\nusing namespace std;\n\n#define int long long\n\nbool check3(vector<int> a) {\n //for (int i: a) cout << i << ' '; cout << endl;\n\tsort(a.begin(), a.end());\n\treturn a[2] < a[1] + a[0];\n}\n\nbool check6(vector<int> a) {\n //for (int i: a) cout << i << ' '; cout << endl;\n sort(a.begin(), a.end());\n\tfor (int i = 2; i < 5; i++) {\n\t\tvector<int> p;\n\t\tfor (int j = 0; j < 5; j++) {\n\t\t if (i != j) p.push_back(j);\n\t\t}\n\t\t\n\t\tdo {\n\t\t vector<int> s(2); \n\t\t if (p[0] < i && p[1] < i) s[0] = a[p[0]] + a[p[1]] - a[i];\n\t\t if (p[2] < 5 && p[3] < 5) s[1] = a[p[2]] + a[p[3]] - a[5];\n\t\t \n\t\t if (s[0] > 0 && s[1] > 0) return true;\n\t\t} while (next_permutation(p.begin(), p.end()));\n\t}\n\treturn false;\n}\n\nsigned main() {\n\tios::sync_with_stdio(0); cin.tie(0);\n\n\tint n; cin >> n;\n\tvector<int> a(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tsort(a.begin(), a.end());\n\t\n\tvector<int> ans2;\n\tfor (int i = 0; i+5 < n; i++) {\n\t vector<int> tmp;\n\t for (int j = 0; j < 6; j++) {\n\t tmp.push_back(a[i+j]);\n\t }\n\t if (check6(tmp)) {\n\t ans2 = tmp;\n\t }\n\t}\n\t\n\tvector<int> ans;\n\n\twhile (a.size() >= 3) {\n\t\tans.push_back(a.back()); a.pop_back();\n\t\tans.push_back(a.back()); a.pop_back();\n\t\tans.push_back(a.back()); a.pop_back();\n\n\t\tif (check3(ans)) break;\n\t\telse {\n\t\t\ta.push_back(ans.back()); ans.pop_back();\n\t\t\ta.push_back(ans.back()); ans.pop_back();\n\t\t\tans.pop_back();\n\t\t}\n\t}\n\n\twhile (a.size() >= 3) {\n\t\tans.push_back(a.back()); a.pop_back();\n\t\tans.push_back(a.back()); a.pop_back();\n\t\tans.push_back(a.back()); a.pop_back();\n\n\t\tif (check6(ans)) break;\n\t\telse {\n\t\t\ta.push_back(ans.back()); ans.pop_back();\n\t\t\ta.push_back(ans.back()); ans.pop_back();\n\t\t\tans.pop_back();\n\t\t}\n\t}\n\n\tcout << max(accumulate(ans.begin(), ans.end(), 0LL), accumulate(ans2.begin(), ans2.end(), 0LL)) << '\\n';\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3880,"score_of_the_acc":-0.3994,"final_rank":11},{"submission_id":"aoj_2265_10042798","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n \n ll N;\n cin >> N;\n vector<ll> a(N);\n for(auto &x: a) cin >> x;\n \n // Сортируем в неубывающем порядке\n sort(a.begin(), a.end(), [](const ll &x, const ll &y) -> bool{\n return x > y;\n });\n \n // Если палочек меньше 6, выводим 0\n if(N < 6){\n cout << 0 << endl;\n return 0;\n }\n \n // Выбираем первые K палочек\n ll K = min((ll)30, N);\n vector<ll> topK(a.begin(), a.begin() + K);\n \n // Перебираем все возможные тройки и сохраняем валидные\n struct Triple {\n int i, j, k;\n ll sum;\n };\n \n vector<Triple> triples;\n \n for(int i = 0; i < K-2; ++i){\n for(int j = i+1; j < K-1; ++j){\n for(int k = j+1; k < K; ++k){\n if(topK[j] + topK[k] > topK[i]){\n triples.push_back(Triple{ i, j, k, topK[i] + topK[j] + topK[k] });\n }\n }\n }\n }\n \n // Если меньше двух тройк, невозможно\n if(triples.size() < 2){\n // Возможно, стоит проверить дальше, но для упрощения ограничимся K=30\n cout << 0 << endl;\n return 0;\n }\n \n // Ищем максимальную сумму двух не пересекающихся тройк\n ll max_sum = 0;\n for(int i = 0; i < triples.size(); ++i){\n for(int j = i+1; j < triples.size(); ++j){\n // Проверяем, не пересекаются ли тройки\n int a1 = triples[i].i;\n int b1 = triples[i].j;\n int c1 = triples[i].k;\n \n int a2 = triples[j].i;\n int b2 = triples[j].j;\n int c2 = triples[j].k;\n \n // Проверяем уникальность индексов\n if(a1 != a2 && a1 != b2 && a1 != c2 &&\n b1 != a2 && b1 != b2 && b1 != c2 &&\n c1 != a2 && c1 != b2 && c1 != c2){\n ll total = triples[i].sum + triples[j].sum;\n if(total > max_sum){\n max_sum = total;\n }\n }\n }\n }\n \n // Выводим результат\n cout << max_sum << endl;\n}","accuracy":0.136986301369863,"time_ms":10,"memory_kb":3592,"score_of_the_acc":-0.3261,"final_rank":19},{"submission_id":"aoj_2265_10042791","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n \n ll N;\n cin >> N;\n vector<ll> a(N);\n for(auto &x: a) cin >> x;\n \n // Сортируем в неубывающем порядке\n sort(a.begin(), a.end(), [](const ll &x, const ll &y) -> bool{\n return x > y;\n });\n \n // Если палочек меньше 6, выводим 0\n if(N < 6){\n cout << \"0\";\n return 0;\n }\n \n // Выбираем первые K палочек\n ll K = min((ll)30, N);\n vector<ll> topK(a.begin(), a.begin() + K);\n \n // Перебираем все возможные тройки и сохраняем валидные\n struct Triple {\n int i, j, k;\n ll sum;\n };\n \n vector<Triple> triples;\n \n for(int i = 0; i < K-2; ++i){\n for(int j = i+1; j < K-1; ++j){\n for(int k = j+1; k < K; ++k){\n if(topK[j] + topK[k] > topK[i]){\n triples.push_back(Triple{ i, j, k, topK[i] + topK[j] + topK[k] });\n }\n }\n }\n }\n \n // Если меньше двух тройк, невозможно\n if(triples.size() < 2){\n // Возможно, стоит проверить дальше, но для упрощения ограничимся K=30\n cout << \"0\";\n return 0;\n }\n \n // Ищем максимальную сумму двух не пересекающихся тройк\n ll max_sum = 0;\n for(int i = 0; i < triples.size(); ++i){\n for(int j = i+1; j < triples.size(); ++j){\n // Проверяем, не пересекаются ли тройки\n int a1 = triples[i].i;\n int b1 = triples[i].j;\n int c1 = triples[i].k;\n \n int a2 = triples[j].i;\n int b2 = triples[j].j;\n int c2 = triples[j].k;\n \n // Проверяем уникальность индексов\n if(a1 != a2 && a1 != b2 && a1 != c2 &&\n b1 != a2 && b1 != b2 && b1 != c2 &&\n c1 != a2 && c1 != b2 && c1 != c2){\n ll total = triples[i].sum + triples[j].sum;\n if(total > max_sum){\n max_sum = total;\n }\n }\n }\n }\n \n // Выводим результат\n cout << max_sum << endl;\n}","accuracy":0.1232876712328767,"time_ms":10,"memory_kb":3588,"score_of_the_acc":-0.3254,"final_rank":20},{"submission_id":"aoj_2265_9128309","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;\n cin >> n;\n vector<ll> a(n);\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n }\n sort(a.begin(), a.end());\n ll res = 0;\n auto can = [&](ll x, ll y, ll z) -> ll {\n if (x + y > z) return x + y + z;\n else return -1e18;\n };\n {\n ll mx = -1e18;\n for (int i = 5; i < n; i++) {\n mx = max(mx, can(a[i - 5], a[i - 4], a[i - 3]));\n ll u = can(a[i - 2], a[i - 1], a[i]);\n res = max(res, u + mx);\n }\n }\n {\n for (int i = 0; i + 5 < n; i++) {\n res = max(res, can(a[i], a[i + 1], a[i + 3]) + can(a[i + 2], a[i + 4], a[i + 5]));\n res = max(res, can(a[i], a[i + 1], a[i + 4]) + can(a[i + 2], a[i + 3], a[i + 5]));\n res = max(res, can(a[i], a[i + 1], a[i + 5]) + can(a[i + 2], a[i + 3], a[i + 4]));\n res = max(res, can(a[i], a[i + 2], a[i + 3]) + can(a[i + 1], a[i + 4], a[i + 5]));\n res = max(res, can(a[i], a[i + 2], a[i + 4]) + can(a[i + 1], a[i + 3], a[i + 5]));\n res = max(res, can(a[i], a[i + 2], a[i + 5]) + can(a[i + 1], a[i + 3], a[i + 4]));\n res = max(res, can(a[i], a[i + 3], a[i + 4]) + can(a[i + 1], a[i + 2], a[i + 5]));\n res = max(res, can(a[i], a[i + 3], a[i + 5]) + can(a[i + 1], a[i + 2], a[i + 4]));\n res = max(res, can(a[i], a[i + 4], a[i + 5]) + can(a[i + 1], a[i + 2], a[i + 3]));\n }\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3896,"score_of_the_acc":-0.3811,"final_rank":9},{"submission_id":"aoj_2265_8965525","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\nint main() {\n int n;\n cin >> n;\n if(n<6){\n cout << 0 << endl;\n return 0;\n }\n \n priority_queue<ll> pq;\n ll a;\n \n for(int i=0;i<n;i++){\n cin >> a;\n pq.push(a);\n }\n \n ll ans1=0,ans=0;\n deque<ll> san; \n int cnt=0,num=0;\n while(!pq.empty()){\n //cout << pq.size() << \" \" << cnt << \" \" << num << endl;\n if(num==0){\n if(cnt<3){ \n san.push_back(pq.top());\n pq.pop();\n cnt++;\n }\n if(cnt==3){\n if(san[0]<san[1]+san[2]){\n ans1=san[0]+san[1]+san[2];\n //cout << ans1 << \" \" << pq.size() << endl;\n cnt=0;\n num++;\n }else{\n san.pop_front();\n cnt--;\n }\n }\n }else{\n if(cnt<3){ \n san.push_back(pq.top());\n pq.pop();\n cnt++;\n }\n if(cnt==3){\n if((san[3]<san[4]+san[5])||\n ((san[1]<san[2]+san[5])&&(san[0]<san[3]+san[4]))||\n ((san[2]<san[3]+san[5])&&(san[0]<san[1]+san[4]))||\n ((san[2]<san[3]+san[4])&&(san[0]<san[1]+san[5]))||\n ((san[2]<san[4]+san[5])&&(san[0]<san[1]+san[3]))||\n ((san[1]<san[4]+san[5])&&(san[0]<san[2]+san[3]))||\n ((san[1]<san[3]+san[5])&&(san[0]<san[2]+san[4]))||\n ((san[1]<san[3]+san[4])&&(san[0]<san[2]+san[5]))||\n ((san[1]<san[2]+san[4])&&(san[0]<san[3]+san[5]))||\n ((san[1]<san[3]+san[4])&&(san[0]<san[4]+san[5]))){\n ans=ans1+san[3]+san[4]+san[5];\n //for(int i=0;i<6;i++) cout << san[i] << endl; \n }else{\n san[3]=san[4];\n san[4]=san[5];\n san[5]=pq.top();\n pq.pop();\n if(san[3]<san[4]+san[5]) ans=ans1+san[3]+san[4]+san[5];\n }\n }\n \n }\n if(ans>0) break;\n }\n \n cout << max(ans,ans1) << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":4204,"score_of_the_acc":-0.4793,"final_rank":12},{"submission_id":"aoj_2265_5114777","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\")\n\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-9, 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};\nstruct UnionFind{\n vector<int> par;\n 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]) 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};\nbool used[101010];\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n \n int N; cin >> N;\n vector<ll> a(N);\n REP(i,N) cin >> a[i];\n sort(all(a));\n ll t1=-1, t2=-1;\n ll ans = 0;\n for(int i=N-1; i>=2; i--){\n if(used[i]) continue;\n ll e1 = a[i], e2 = a[i-1], e3 = a[i-2];\n if(e2+e3 > e1) {\n if(t1 == -1){\n t1 = e1+e2+e3;\n used[i] = used[i-1] = used[i-2] = true;\n }else{\n t2 = e1+e2+e3;\n break;\n }\n }\n }\n if(t2 != -1) ans = t1+t2;\n for(int i=N-1; i>=5; i--){\n vector<ll> v{a[i-5], a[i-4], a[i-3], a[i-2], a[i-1], a[i]};\n ll sum = accumulate(all(v), 0LL);\n\n vector<bool> ok(1<<6);\n REP(bit,(1<<6)){\n if(__builtin_popcount(bit) != 3) continue;\n vector<ll> e;\n for(int j=0; j<6; j++){\n if(bit >> j & 1) e.push_back(v[j]);\n }\n\n if(e[0]+e[1]>e[2] && e[0]+e[2]>e[1] && e[1]+e[2]>e[0]){\n ok[bit] = true;\n }\n }\n REP(bit,(1<<6)){\n if(__builtin_popcount(bit) != 3) continue;\n if(ok[bit] && ok[((1<<6)-1) & ~bit]){\n ans = max(ans, sum);\n break;\n } \n }\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":3624,"score_of_the_acc":-0.6936,"final_rank":15},{"submission_id":"aoj_2265_4796231","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\nbool check3(vector<int> a) {\n //for (int i: a) cout << i << ' '; cout << endl;\n\tsort(a.begin(), a.end());\n\treturn a[2] < a[1] + a[0];\n}\n\nbool check6(vector<int> a) {\n //for (int i: a) cout << i << ' '; cout << endl;\n sort(a.begin(), a.end());\n\tfor (int i = 2; i < 5; i++) {\n\t\tvector<int> p;\n\t\tfor (int j = 0; j < 5; j++) {\n\t\t if (i != j) p.push_back(j);\n\t\t}\n\t\t\n\t\tdo {\n\t\t vector<int> s(2); \n\t\t s[0] = a[p[0]] + a[p[1]] - a[i];\n\t\t s[1] = a[p[2]] + a[p[3]] - a[5];\n\t\t \n\t\t if (s[0] > 0 && s[1] > 0) return true;\n\t\t} while (next_permutation(p.begin(), p.end()));\n\t}\n\treturn false;\n}\n\nsigned main() {\n\tios::sync_with_stdio(0); cin.tie(0);\n\n\tint n; cin >> n;\n\tvector<int> a(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> a[i];\n\t}\n\tsort(a.begin(), a.end());\n\t\n\tvector<int> ans2;\n\tfor (int i = 0; i+5 < n; i++) {\n\t vector<int> tmp;\n\t for (int j = 0; j < 6; j++) {\n\t tmp.push_back(a[i+j]);\n\t }\n\t if (check6(tmp)) {\n\t ans2 = tmp;\n\t }\n\t}\n\t\n\tvector<int> ans;\n\n\twhile (a.size() >= 3) {\n\t\tans.push_back(a.back()); a.pop_back();\n\t\tans.push_back(a.back()); a.pop_back();\n\t\tans.push_back(a.back()); a.pop_back();\n\n\t\tif (check3(ans)) break;\n\t\telse {\n\t\t\ta.push_back(ans.back()); ans.pop_back();\n\t\t\ta.push_back(ans.back()); ans.pop_back();\n\t\t\tans.pop_back();\n\t\t}\n\t}\n\n\twhile (a.size() >= 3) {\n\t\tans.push_back(a.back()); a.pop_back();\n\t\tans.push_back(a.back()); a.pop_back();\n\t\tans.push_back(a.back()); a.pop_back();\n\n\t\tif (check6(ans)) break;\n\t\telse {\n\t\t\ta.push_back(ans.back()); ans.pop_back();\n\t\t\ta.push_back(ans.back()); ans.pop_back();\n\t\t\tans.pop_back();\n\t\t}\n\t}\n\n\tcout << max(accumulate(ans.begin(), ans.end(), 0LL), accumulate(ans2.begin(), ans2.end(), 0LL)) << '\\n';\n\n\treturn 0;\n}","accuracy":0.6438356164383562,"time_ms":30,"memory_kb":3552,"score_of_the_acc":-0.3614,"final_rank":18},{"submission_id":"aoj_2265_2660468","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\nint calc_left[20][3],calc_right[20][3];\n\nbool check(ll a,ll b, ll c){\n\treturn a+b > c;\n}\n\nvoid divideGroup(){\n\n\tint index = 0,left_index,right_index;\n\tint left_table[6],right_table[6];\n\n\tfor(int i = 0; i < 64; i++){\n\t\tleft_index = right_index = 0;\n\t\tfor(int loop = 0; loop < 6; loop++){\n\t\t\tif(i & (1 << loop)){\n\t\t\t\tleft_table[left_index++] = loop;\n\t\t\t}else{\n\t\t\t\tright_table[right_index++] = loop;\n\t\t\t}\n\t\t}\n\t\tif(left_index != 3 || right_index != 3)continue;\n\n\t\tfor(int k = 0; k < 3; k++){\n\t\t\tcalc_left[index][k] = left_table[k];\n\t\t\tcalc_right[index][k] = right_table[k];\n\t\t}\n\t\tindex++;\n\t}\n\n}\n\nint main(){\n\n\tdivideGroup();\n\n\tint N;\n\tscanf(\"%d\",&N);\n\n\tll* table = new ll[N];\n\tfor(int i = 0; i < N; i++)scanf(\"%lld\",&table[i]);\n\n\tsort(table,table+N);\n\n\tll* max_3seq = new ll[N];\n\tfor(int i = 0; i < N; i++)max_3seq[i] = 0;\n\n\tfor(int i = 0; i <= N-3; i++){\n\t\tif(check(table[i],table[i+1],table[i+2])){\n\t\t\tmax_3seq[i] = table[i]+table[i+1]+table[i+2];\n\t\t}else{\n\t\t\tif(i > 0){\n\t\t\t\tmax_3seq[i] = max_3seq[i-1];\n\t\t\t}\n\t\t}\n\t}\n\n\tll ans = 0;\n\tint debug;\n\tfor(int i = 0; i+5 <= N-1; i++){\n\t\tif(check(table[i+3],table[i+4],table[i+5])){\n\t\t\tans = max(ans,max_3seq[i]+table[i+3]+table[i+4]+table[i+5]);\n\t\t}\n\t\tbool FLG = false;\n\n\t\tfor(int k = 0; k < 20; k++){\n\t\t\tif(check(table[i+calc_left[k][0]],table[i+calc_left[k][1]],table[i+calc_left[k][2]]) == true &&\n\t\t\t\t\tcheck(table[i+calc_right[k][0]],table[i+calc_right[k][1]],table[i+calc_right[k][2]]) == true){\n\t\t\t\tFLG = true;\n\t\t\t\tdebug = k;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(FLG){\n\t\t\tans = max(ans,table[i]+table[i+1]+table[i+2]+table[i+3]+table[i+4]+table[i+5]);\n\t\t}\n\t}\n\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4852,"score_of_the_acc":-0.5751,"final_rank":13},{"submission_id":"aoj_2265_2552336","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\nbool tri(const vector<ll> &x)\n{\n return x[0]+x[1]>x[2];\n}\n\nbool check(const vector<ll> &v)\n{\n // dbg(v);\n int comb = (1<<3) - 1;\n while(comb < (1<<6)-1)\n {\n vector<ll> p,q;\n rep(i,6)\n {\n if(comb>>i&1) p.pb(v[i]);\n else q.pb(v[i]);\n }\n // dbg(p);dbg(q);\n if(tri(p) && tri(q)) return true;\n\n int x = comb & -comb, y = comb + x;\n comb = ((comb & ~y) / x>>1) | y;\n }\n return false;\n}\n\nll SUM(const vector<ll> &v)\n{\n ll ret = 0;\n for(ll i:v) ret += i;\n return ret;\n}\n\nint main()\n{\n int n;\n cin >>n;\n vector<ll> a(n);\n rep(i,n) cin >>a[i];\n sort(all(a));\n\n vector<int> ok;\n for(int i=2; i<n; ++i)\n {\n vector<ll> v;\n rep(j,3) v.pb(a[i-2+j]);\n if(tri(v)) ok.pb(i);\n }\n\n ll ans = 0;\n rep(i,n-5)\n {\n vector<ll> v;\n rep(j,6) v.pb(a[i+j]);\n if(check(v)) ans = max(ans,SUM(v));\n }\n\n if(ok.size()>0)\n {\n for(int i=n-1; i>=2; --i)\n {\n if(*lower_bound(all(ok),i) == i)\n {\n int idx = lower_bound(all(ok),i-2)-ok.begin();\n --idx;\n if(idx>=0)\n {\n vector<ll> v;\n rep(j,3) v.pb(a[ok[idx]-2+j]);\n rep(j,3) v.pb(a[i-2+j]);\n ans = max(ans,SUM(v));\n }\n }\n }\n }\n \n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":4328,"score_of_the_acc":-0.6294,"final_rank":14},{"submission_id":"aoj_2265_2335860","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\n#define each(i,a) for (auto&& i : a)\n#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)\n#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)\n#define REP(i,n) FOR(i,0,n)\n#define RREP(i,n) RFOR(i,0,n)\n#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME\n#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)\n#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)\n#define pb push_back\n#define all(a) (a).begin(),(a).end()\n#define chmin(x,v) x = min(x, v)\n#define chmax(x,v) x = max(x, v)\n\nconst ll linf = 1e18;\nconst int inf = 1e9;\nconst double eps = 1e-12;\nconst double pi = acos(-1);\n\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T>& vec) {\n each(x,vec) is >> x;\n return is;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector<T>& vec) {\n rep(i,vec.size()) {\n if (i) os << \" \";\n os << vec[i];\n }\n return os;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, const vector< vector<T> >& vec) {\n rep(i,vec.size()) {\n if (i) os << endl;\n os << vec[i];\n }\n return os;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n ll n; cin >> n;\n vector<ll> v(n); cin >> v;\n sort(all(v), greater<ll>());\n ll ans = 0;\n { // xxxooo\n ll a = 0, k = 0;\n rep(i, n-2) {\n if (v[i] < v[i+1] + v[i+2]) {\n a += v[i] + v[i+1] + v[i+2];\n i += 2;\n if (++k == 2) {\n chmax(ans, a);\n }\n }\n }\n }\n {\n rep(i, n-5) {\n if (v[i] < v[i+1] + v[i+5] && v[i+2] < v[i+3] + v[i+4] // xxooox\n || v[i] < v[i+1] + v[i+4] && v[i+2] < v[i+3] + v[i+5] // xxooxo\n || v[i] < v[i+3] + v[i+4] && v[i+1] < v[i+2] + v[i+5]) { // xooxxo\n ll sum = 0;\n rep(j, 6) sum += v[i+j];\n chmax(ans, sum);\n }\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3620,"score_of_the_acc":-0.3312,"final_rank":8},{"submission_id":"aoj_2265_2040954","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint n; long long a[100009];\nlong long solve(int l, int r) {\n\tlong long ret = 0;\n\tfor(int i = 0; i < 1 << (r - l); i++) {\n\t\tif(__builtin_popcount(i) != 3) continue;\n\t\tvector<long long> x1, x2;\n\t\tfor(int j = 0; j < 6; j++) {\n\t\t\tif(i & (1 << j)) x1.push_back(a[l + j]);\n\t\t\telse x2.push_back(a[l + j]);\n\t\t}\n\t\tif(x1[0] + x1[1] > x1[2] && x2[0] + x2[1] > x2[2]) {\n\t\t\tret = max(ret, x1[0] + x1[1] + x1[2] + x2[0] + x2[1] + x2[2]);\n\t\t}\n\t}\n\treturn ret;\n}\nint main() {\n\tcin >> n;\n\tfor(int i = 0; i < n; i++) cin >> a[i];\n\tsort(a, a + n);\n\tint pos = -1;\n\tfor(int i = n - 3; i >= 0; i--) {\n\t\tif(a[i] + a[i + 1] > a[i + 2]) {\n\t\t\tpos = i; break;\n\t\t}\n\t}\n\tint pos2 = -1;\n\tfor(int i = pos - 3; i >= 0; i--) {\n\t\tif(a[i] + a[i + 1] > a[i + 2]) {\n\t\t\tpos2 = i; break;\n\t\t}\n\t}\n\tlong long ret = (pos2 != -1 ? a[pos2] + a[pos2 + 1] + a[pos2 + 2] + a[pos] + a[pos + 1] + a[pos + 2] : 0);\n\tfor(int i = 0; i < n - 6; i++) {\n\t\tret = max(ret, solve(i, i + 6));\n\t}\n\tcout << ret << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":480,"memory_kb":3952,"score_of_the_acc":-1.3912,"final_rank":17},{"submission_id":"aoj_2265_1697342","code_snippet":"#include<iostream>\n#include<algorithm>\nusing namespace std;\n#define MAX_N 500000\n#define MAX_S 600\nlong long x[MAX_N];\nlong long TOP[MAX_S], n;\nlong long maxn1[MAX_N], maxn2[MAX_N];\nint main() {\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> x[i];\n\t}\n\tsort(x, x + n);\n\tlong long cnt = 0;\n\tfor (int i = n - MAX_S; i < n; i++) {\n\t\tif (i >= 0) {\n\t\t\tTOP[cnt] = x[i];\n\t\t\tcnt++;\n\t\t}\n\t}\n\tlong long maxn = 0;\n\tfor (int i = 0; i < cnt; i++) {\n\t\tfor (int j = i + 1; j < cnt; j++) {\n\t\t\tfor (int k = j + 1; k < cnt; k++) {\n\t\t\t\tif (TOP[i] + TOP[j] > TOP[k]) {\n\t\t\t\t\tmaxn1[i] = max(maxn1[i], TOP[i] + TOP[j] + TOP[k]);\n\t\t\t\t\tmaxn2[k] = max(maxn2[k], TOP[i] + TOP[j] + TOP[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < cnt; i++) {\n\t\tfor (int j = i + 1; j < cnt; j++) {\n\t\t\tmaxn = max(maxn, maxn2[i] + maxn1[j]);\n\t\t}\n\t}\n\n\tfor (int i = 0; i < cnt - 5; i++) {\n\t\tlong long c[6], d[3], e[3];\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tc[j] = TOP[i + j];\n\t\t}\n\t\tlong long cnt = 0, cnt1 = 0, cnt2 = 0;\n\t\tfor (int j = 0; j < 64; j++) {\n\t\t\tcnt = 0;\n\t\t\tfor (int k = 0; k < 6; k++) { cnt += (j / (1 << k)) % 2; }\n\t\t\tif (cnt == 3) {\n\t\t\t\tcnt1 = 0; cnt2 = 0;\n\t\t\t\tfor (int k = 0; k < 6; k++) {\n\t\t\t\t\tif ((j / (1 << k)) % 2 == 0) {\n\t\t\t\t\t\td[cnt1] = c[k];\n\t\t\t\t\t\tcnt1++;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\te[cnt2] = c[k];\n\t\t\t\t\t\tcnt2++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (d[0] + d[1]>d[2] && e[0] + e[1]>e[2]) {\n\t\t\t\t\tmaxn = max(maxn, d[0] + d[1] + d[2] + e[1] + e[2] + e[0]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << maxn << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":7320,"score_of_the_acc":-1.2979,"final_rank":16},{"submission_id":"aoj_2265_1480718","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nint main() {\n\tint N; cin >> N;\n\tvector<ll> v(N);\n\tfor (int i = 0; i < N; ++i) {\n\t\tcin >> v[i];\n\t}\n\tsort( v.begin(), v.end() );\n\n\tll ans = 0;\n\n\t// 012345\n\t// oooxox\n\t// ooooxx\n\tfor (int t = N-6; t >= 0; --t) {\n\t\tvector<ll> a(6);\n\t\tfor (int i = 0; i < 6; ++i) {\n\t\t\ta[i] = v[t+i];\n\t\t}\n\n\t\tll sum = 0;\n\t\tfor (int i = 0; i < 6; ++i) {\n\t\t\tsum += a[i];\n\t\t}\n\n\t\tif ((a[0] + a[1] > a[3] && a[2] + a[4] > a[5])\n\t\t\t|| (a[0] + a[2] > a[3] && a[1] + a[4] > a[5])\n\t\t\t|| (a[1] + a[2] > a[3] && a[0] + a[4] > a[5])\n\t\t\t|| (a[0] + a[1] > a[4] && a[2] + a[3] > a[5])\n\t\t\t|| (a[0] + a[2] > a[4] && a[1] + a[3] > a[5])\n\t\t\t|| (a[0] + a[3] > a[4] && a[1] + a[2] > a[5])\n\t\t\t|| (a[0] + a[1] > a[5] && a[2] + a[3] > a[4])\n\t\t\t|| (a[0] + a[2] > a[5] && a[1] + a[3] > a[4])\n\t\t\t|| (a[0] + a[3] > a[5] && a[1] + a[2] > a[4])) {\n\t\t\tif (sum > ans) ans = sum;\n\t\t}\n\t}\n\t{\n\t\tll s = 0;\n\n\t\tint pos = -1;\n\t\tfor (int i = N-3; i >= 0; --i) {\n\t\t\tif (v[i] + v[i+1] > v[i+2]) {\n\t\t\t\ts = v[i] + v[i+1] + v[i+2];\n\t\t\t\tpos = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif (pos > -1) {\n\t\t\tfor (int i = pos-3; i >= 0; --i) {\n\t\t\t\tif (v[i] + v[i+1] > v[i+2]) {\n\t\t\t\t\tll s2 = s + v[i] + v[i+1] + v[i+2];\n\t\t\t\t\tif (s2 > ans) ans = s2;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":70,"memory_kb":1796,"score_of_the_acc":-0.1291,"final_rank":3},{"submission_id":"aoj_2265_1457721","code_snippet":"#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<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\n\n/* typedef */\n\ntypedef long long ll;\n\n/* global variables */\n\nll as[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n;\n cin >> n;\n\n for (int i = 0; i < n; i++) cin >> as[i];\n sort(as, as + n, greater<ll>());\n\n ll maxsum0 = 0, maxsum1 = 0;\n ll sumi, sumj;\n int i;\n \n for (i = 0; i < n - 5; i++)\n if (as[i] < as[i + 1] + as[i + 2]) {\n sumi = as[i] + as[i + 1] + as[i + 2];\n //printf(\"%d:%lld+%lld+%lld=%lld\\n\",i,as[i],as[i+1],as[i+2],sumi);\n break;\n }\n\n for (int j = i + 3; j < n - 2; j++)\n if (as[j] < as[j + 1] + as[j + 2]) {\n sumj = as[j] + as[j + 1] + as[j + 2];\n maxsum0 = sumi + sumj;\n //printf(\"%d:%lld+%lld+%lld=%lld\\n\",j,as[j],as[j+1],as[j+2],sumj);\n break;\n }\n\n ll sum = as[0] + as[1] + as[2] + as[3] + as[4];\n for (i = 0; i < n - 5; i++) {\n sum += as[i + 5];\n if ((as[i] < as[i + 1] + as[i + 2] && as[i + 3] < as[i + 4] + as[i + 5]) ||\n\t(as[i] < as[i + 1] + as[i + 3] && as[i + 2] < as[i + 4] + as[i + 5]) ||\n\t(as[i] < as[i + 1] + as[i + 4] && as[i + 2] < as[i + 3] + as[i + 5]) ||\n\t(as[i] < as[i + 1] + as[i + 5] && as[i + 2] < as[i + 3] + as[i + 4]) ||\n\t(as[i] < as[i + 2] + as[i + 3] && as[i + 1] < as[i + 4] + as[i + 5]) ||\n\t(as[i] < as[i + 2] + as[i + 4] && as[i + 1] < as[i + 3] + as[i + 5]) ||\n\t(as[i] < as[i + 2] + as[i + 5] && as[i + 1] < as[i + 3] + as[i + 4]) ||\n\t(as[i] < as[i + 3] + as[i + 4] && as[i + 1] < as[i + 2] + as[i + 5]) ||\n\t(as[i] < as[i + 3] + as[i + 5] && as[i + 1] < as[i + 2] + as[i + 4]) ||\n\t(as[i] < as[i + 4] + as[i + 5] && as[i + 1] < as[i + 2] + as[i + 3])) {\n maxsum1 = sum;\n break;\n }\n sum -= as[i];\n }\n \n cout << max(maxsum0, maxsum1) << endl;\n \n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":1964,"score_of_the_acc":-0.1382,"final_rank":4},{"submission_id":"aoj_2265_1219466","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 <cstring>\n#include <cmath>\n#include <map>\n#include <queue>\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, w; };\n\nll MOD = 1000000007;\nll _MOD = 1000000009;\ndouble EPS = 1e-10;\nint INF = INT_MAX / 4;\n\nint main() {\n\tint N; cin >> N;\n\tif (N < 6) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tvector<ll> a(N);\n\tfor (int i = 0; i < N; i++)\n\t\tcin >> a[i];\n\tsort(a.begin(), a.end());\n\tvector<ll> b(N - 2);\n\tfor (int i = 0; i + 3 <= N; i++)\n\t\tif (a[i] + a[i + 1] > a[i + 2])\n\t\t\tb[i] = a[i] + a[i + 1] + a[i + 2];\n\tvector<ll> c(N - 1);\n\tc[0] = 0;\n\tfor (int i = 1; i - 1 < N - 2; i++)\n\t\tc[i] = max(c[i - 1], b[i - 1]);\n\tll maxi = 0;\n\tfor (int i = 3; i + 3 <= N; i++)\n\t\tif (c[i - 2] && b[i])\n\t\t\tmaxi = max(maxi, c[i - 2] + b[i]);\n\tfor (int i = N - 6; i >= 0; i--) {\n\t\tbool ok = false;\n\t\tfor (int S = 0; S < (1 << 6); S++) {\n\t\t\tvector<ll> v, w;\n\t\t\tfor (int j = 0; j < 6; j++)\n\t\t\t\tif ((S >> j) & 1) v.push_back(a[i + j]);\n\t\t\t\telse w.push_back(a[i + j]);\n\t\t\tif (v.size() == 3 && v[0] + v[1] > v[2] && w[0] + w[1] > w[2])\n\t\t\t\tok = true;\n\t\t}\n\t\tif (ok) {\n\t\t\tmaxi = max(maxi, a[i] + a[i + 1] + a[i + 2] + a[i + 3] + a[i + 4] + a[i + 5]);\n\t\t\tbreak;\n\t\t}\n\t}\n\tcout << maxi << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":3384,"score_of_the_acc":-0.3949,"final_rank":10},{"submission_id":"aoj_2265_1175334","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\ninline bool check(ll a, ll b, ll c){ return a<b+c; }\n\nint main(){\n ll n, a[100100];\n scanf(\"%lld\",&n);\n for(int i=0;i<n;i++)scanf(\"%lld\",a+i);\n sort(a,a+n,greater<ll>());\n\n ll ans = 0;\n for(int i=0;i<n-2;i++){\n if(check(a[i],a[i+1],a[i+2])){\n for(int j=i+3;j<n-2;j++){\n\tif(check(a[j],a[j+1],a[j+2])){\n\t ll sum = 0;\n\t for(int k=0;k<3;k++)sum += a[i+k] + a[j+k];\n\t ans = max(ans,sum);\n\t goto END1;\n\t}\n }\n }\n }\n END1:;\n\n for(int i=0;i<n-5;i++){\n int comb = (1<<3)-1;\n while(comb < (1<<5)){\n vector<ll> A,B;\n for(int j=0;j<6;j++){\n\tif( (comb>>j)&1 )A.push_back(a[i+j]);\n\telse B.push_back(a[i+j]);\n }\n\n if(check(A[0],A[1],A[2]) && check(B[0],B[1],B[2])){\n\tll sum = 0;\n\tfor(int k=0;k<6;k++)sum += a[i+k];\n\tans = max(ans,sum);\n\tgoto END2;\n }\n\n int x = comb & -comb, y = comb + x;\n comb = ( ( (comb & ~y) /x ) >> 1) | y;\n }\n }\n\n END2: cout << ans << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":2016,"score_of_the_acc":-0.0838,"final_rank":2},{"submission_id":"aoj_2265_1175331","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\ninline bool check(ll a, ll b, ll c){ return a<b+c; }\n\nint main(){\n ll n, a[100100];\n cin >> n;\n for(int i=0;i<n;i++)cin >> a[i];\n sort(a,a+n,greater<ll>());\n\n ll ans = 0;\n for(int i=0;i<n-2;i++){\n if(check(a[i],a[i+1],a[i+2])){\n for(int j=i+3;j<n-2;j++){\n\tif(check(a[j],a[j+1],a[j+2])){\n\t ll sum = 0;\n\t for(int k=0;k<3;k++)sum += a[i+k] + a[j+k];\n\t ans = max(ans,sum);\n\t goto END1;\n\t}\n }\n }\n }\n END1:;\n\n for(int i=0;i<n-5;i++){\n int comb = (1<<3)-1;\n while(comb < (1<<5)){\n vector<ll> A,B;\n for(int j=0;j<6;j++){\n\tif( (comb>>j)&1 )A.push_back(a[i+j]);\n\telse B.push_back(a[i+j]);\n }\n\n if(check(A[0],A[1],A[2]) && check(B[0],B[1],B[2])){\n\tll sum = 0;\n\tfor(int k=0;k<6;k++)sum += a[i+k];\n\tans = max(ans,sum);\n\tgoto END2;\n }\n\n int x = comb & -comb, y = comb + x;\n comb = ( ( (comb & ~y) /x ) >> 1) | y;\n }\n }\n\n END2: cout << ans << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":1996,"score_of_the_acc":-0.144,"final_rank":5},{"submission_id":"aoj_2265_1175330","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\ninline bool check(ll a, ll b, ll c){ return a<b+c; }\n\nint main(){\n ll n, a[100100];\n cin >> n;\n for(int i=0;i<n;i++)cin >> a[i];\n sort(a,a+n,greater<ll>());\n\n ll ans = 0;\n for(int i=0;i<n-2;i++){\n if(check(a[i],a[i+1],a[i+2])){\n for(int j=i+3;j<n-2;j++){\n\tif(check(a[j],a[j+1],a[j+2])){\n\t ll sum = 0;\n\t for(int k=0;k<3;k++)sum += a[i+k] + a[j+k];\n\t ans = max(ans,sum);\n\t goto END1;\n\t}\n }\n }\n }\n END1:;\n\n for(int i=0;i<n-5;i++){\n int comb = (1<<3)-1;\n while(comb < (1<<6)){\n vector<ll> A,B;\n for(int j=0;j<6;j++){\n\tif( (comb>>j)&1 )A.push_back(a[i+j]);\n\telse B.push_back(a[i+j]);\n }\n\n if(check(A[0],A[1],A[2]) && check(B[0],B[1],B[2])){\n\tll sum = 0;\n\tfor(int k=0;k<6;k++)sum += a[i+k];\n\tans = max(ans,sum);\n\tgoto END2;\n }\n\n int x = comb & -comb, y = comb + x;\n comb = ( ( (comb & ~y) /x ) >> 1) | y;\n }\n }\n\n END2: cout << ans << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":1996,"score_of_the_acc":-0.144,"final_rank":5},{"submission_id":"aoj_2265_1154447","code_snippet":"#include<iostream>\n#include<algorithm>\n\nusing namespace std;\ntypedef long long Int;\n\n\n\nbool able(Int a, Int b, Int c){\n\tInt sum = a + b + c;\n\treturn a*2 < sum && b*2 < sum && c*2 < sum;\n}\n\nbool able2(Int a, Int b, Int c, Int d, Int e, Int f){\n\tif(able(a, b, c) && able(d, e, f))return true;\n\tif(able(a, b, d) && able(c, e, f))return true;\n\tif(able(a, b, e) && able(c, d, f))return true;\n\tif(able(a, b, f) && able(c, d, e))return true;\n\tif(able(a, c, d) && able(b, e, f))return true;\n\tif(able(a, c, e) && able(b, d, f))return true;\n\tif(able(a, c, f) && able(b, d, e))return true;\n\tif(able(a, d, e) && able(b, c, f))return true;\n\tif(able(a, d, f) && able(b, c, e))return true;\n\tif(able(a, e, f) && able(b, c, d))return true;\n\treturn false;\n}\n\n\nInt n, res;\nInt a[108000], right1 = -1, right2 = -1;\nbool ok[108000];\nint main(){\n\tcin >> n;\n\tfor(Int i = 0;i < n;i++) cin >> a[i];\n\tsort(a, a + n);\n\tfor(Int i = 2;i < n;i++){\n\t\tok[i] = able(a[i], a[i-1], a[i-2]);\n\t\tif(ok[i])right1 = i;\n\t}\n\tfor(Int i = 2;i <= right1 - 3;i++){\n\t\tif(ok[i])right2 = i;\n\t}\n\tif(right1 != -1 && right2 != -1)\n\t\tres = a[right1] + a[right1-1] + a[right1-2] + a[right2] + a[right2-1] + a[right2-2];\n\tfor(Int i = 5;i < n;i++){\n\t\tif(able2(a[i], a[i-1], a[i-2], a[i-3], a[i-4], a[i-5])){\n\t\t\tres = max(res, a[i] + a[i-1] + a[i-2] + a[i-3] + a[i-4] + a[i-5]);\n\t\t}\n\t}\n\tcout << res << endl;\n\treturn 0;\n\n}","accuracy":1,"time_ms":60,"memory_kb":2064,"score_of_the_acc":-0.1563,"final_rank":7},{"submission_id":"aoj_2265_1150214","code_snippet":"//Name: Programming Contest Challenge Book\n//Level: 3\n//Category: 数学,Math,考察\n//Note:\n\n/**\n * 棒を長さの降順でソートしてから考える。\n * 以下、三角形の辺に関して長い方からp,q,rと呼ぶことにする。\n *\n * 三角形を1つ作るとき、棒iを辺pとして採用すると、三角不等式のうちp+q>rとp+r>qが満たされることは自明である。\n * q+r>pであるためにはbとcを可能な限り大きく取ればよいから、結局棒i+1とi+2を加えて三角形を構成できなければ、棒iを辺pとした三角形は構成できないことがわかる。\n *\n * この考察から、連続する3辺で三角形が作れるかを考えながら貪欲に構成していくという方法が思いつくが、これでは3 3 2 2 1 1のような列のときにうまくいかない。\n * すなわち、a_{i+3}≧a_{i+4}+a_{i+5}であるが、2つの三角形に割り当てる順番をうまく入れ替えてやるとちょうど割り当てられる場合である。\n * このような場合は、棒iから連続する6つの棒だけを使って2つの三角形を構成しないと意味がないため、全探索すればよい\n * （周長を最大化する制約から、この6つよりも短い棒を使っている場合、iを超えない範囲で長い棒に入れ替えることは安全であり、かつ得をする）。\n *\n * オーダーは O(N log N)。\n */\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <numeric>\n\nusing namespace std;\n\nbool solve() {\n int N;\n if(!(cin >> N)) return false;\n\n vector<long long> as(N);\n for(int i = 0; i < N; ++i) {\n cin >> as[i];\n }\n sort(begin(as), end(as), greater<long long>());\n\n typedef vector<int> Choice;\n vector<pair<Choice,Choice>> choose_3;\n for(int pat = 0; pat < (1<<6); ++pat) {\n if(__builtin_popcount(pat) != 3) continue;\n Choice c1, c2;\n for(int i = 0; i < 6; ++i) {\n if(pat & (1<<i)) c1.push_back(i);\n else c2.push_back(i);\n }\n choose_3.emplace_back(c1, c2);\n }\n\n long long ans = 0;\n int composed = 0;\n for(int i = 0; i <= N-3; ++i) {\n // Check if all 6 sticks can be used\n if(composed == 0 && i <= N-6) {\n for(auto pat : choose_3) {\n const auto &c1 = pat.first;\n const auto &c2 = pat.second;\n if(as[i+c1[0]] < as[i+c1[1]]+as[i+c1[2]] && as[i+c2[0]] < as[i+c2[1]]+as[i+c2[2]]) {\n ans = accumulate(begin(as)+i, begin(as)+i+6, 0LL);\n composed = 2;\n goto end;\n }\n }\n }\n // Check if 3 sticks can be used\n if(as[i] < as[i+1] + as[i+2]) {\n ans += as[i]+as[i+1]+as[i+2];\n if(++composed == 2) break;\n i += 2;\n }\n }\nend:\n if(composed != 2) ans = 0;\n cout << ans << endl;\n return true;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n while(solve()) ;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1788,"score_of_the_acc":-0.0213,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2265_10042900\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\nbool check3(vector<int> a) {\\n //for (int i: a) cout << i << ' '; cout << endl;\\n\\tsort(a.begin(), a.end());\\n\\treturn a[2] < a[1] + a[0];\\n}\\n\\nbool check6(vector<int> a) {\\n //for (int i: a) cout << i << ' '; cout << endl;\\n sort(a.begin(), a.end());\\n\\tfor (int i = 2; i < 5; i++) {\\n\\t\\tvector<int> p;\\n\\t\\tfor (int j = 0; j < 5; j++) {\\n\\t\\t if (i != j) p.push_back(j);\\n\\t\\t}\\n\\t\\t\\n\\t\\tdo {\\n\\t\\t vector<int> s(2); \\n\\t\\t if (p[0] < i && p[1] < i) s[0] = a[p[0]] + a[p[1]] - a[i];\\n\\t\\t if (p[2] < 5 && p[3] < 5) s[1] = a[p[2]] + a[p[3]] - a[5];\\n\\t\\t \\n\\t\\t if (s[0] > 0 && s[1] > 0) return true;\\n\\t\\t} while (next_permutation(p.begin(), p.end()));\\n\\t}\\n\\treturn false;\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(0); cin.tie(0);\\n\\n\\tint n; cin >> n;\\n\\tvector<int> a(n);\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tcin >> a[i];\\n\\t}\\n\\tsort(a.begin(), a.end());\\n\\t\\n\\tvector<int> ans2;\\n\\tfor (int i = 0; i+5 < n; i++) {\\n\\t vector<int> tmp;\\n\\t for (int j = 0; j < 6; j++) {\\n\\t tmp.push_back(a[i+j]);\\n\\t }\\n\\t if (check6(tmp)) {\\n\\t ans2 = tmp;\\n\\t }\\n\\t}\\n\\t\\n\\tvector<int> ans;\\n\\n\\twhile (a.size() >= 3) {\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\n\\t\\tif (check3(ans)) break;\\n\\t\\telse {\\n\\t\\t\\ta.push_back(ans.back()); ans.pop_back();\\n\\t\\t\\ta.push_back(ans.back()); ans.pop_back();\\n\\t\\t\\tans.pop_back();\\n\\t\\t}\\n\\t}\\n\\n\\twhile (a.size() >= 3) {\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\n\\t\\tif (check6(ans)) break;\\n\\t\\telse {\\n\\t\\t\\ta.push_back(ans.back()); ans.pop_back();\\n\\t\\t\\ta.push_back(ans.back()); ans.pop_back();\\n\\t\\t\\tans.pop_back();\\n\\t\\t}\\n\\t}\\n\\n\\tcout << max(accumulate(ans.begin(), ans.end(), 0LL), accumulate(ans2.begin(), ans2.end(), 0LL)) << '\\\\n';\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3880,\n \"score_of_the_acc\": -0.3994,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2265_10042798\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n \\n ll N;\\n cin >> N;\\n vector<ll> a(N);\\n for(auto &x: a) cin >> x;\\n \\n // Сортируем в неубывающем порядке\\n sort(a.begin(), a.end(), [](const ll &x, const ll &y) -> bool{\\n return x > y;\\n });\\n \\n // Если палочек меньше 6, выводим 0\\n if(N < 6){\\n cout << 0 << endl;\\n return 0;\\n }\\n \\n // Выбираем первые K палочек\\n ll K = min((ll)30, N);\\n vector<ll> topK(a.begin(), a.begin() + K);\\n \\n // Перебираем все возможные тройки и сохраняем валидные\\n struct Triple {\\n int i, j, k;\\n ll sum;\\n };\\n \\n vector<Triple> triples;\\n \\n for(int i = 0; i < K-2; ++i){\\n for(int j = i+1; j < K-1; ++j){\\n for(int k = j+1; k < K; ++k){\\n if(topK[j] + topK[k] > topK[i]){\\n triples.push_back(Triple{ i, j, k, topK[i] + topK[j] + topK[k] });\\n }\\n }\\n }\\n }\\n \\n // Если меньше двух тройк, невозможно\\n if(triples.size() < 2){\\n // Возможно, стоит проверить дальше, но для упрощения ограничимся K=30\\n cout << 0 << endl;\\n return 0;\\n }\\n \\n // Ищем максимальную сумму двух не пересекающихся тройк\\n ll max_sum = 0;\\n for(int i = 0; i < triples.size(); ++i){\\n for(int j = i+1; j < triples.size(); ++j){\\n // Проверяем, не пересекаются ли тройки\\n int a1 = triples[i].i;\\n int b1 = triples[i].j;\\n int c1 = triples[i].k;\\n \\n int a2 = triples[j].i;\\n int b2 = triples[j].j;\\n int c2 = triples[j].k;\\n \\n // Проверяем уникальность индексов\\n if(a1 != a2 && a1 != b2 && a1 != c2 &&\\n b1 != a2 && b1 != b2 && b1 != c2 &&\\n c1 != a2 && c1 != b2 && c1 != c2){\\n ll total = triples[i].sum + triples[j].sum;\\n if(total > max_sum){\\n max_sum = total;\\n }\\n }\\n }\\n }\\n \\n // Выводим результат\\n cout << max_sum << endl;\\n}\",\n \"accuracy\": 0.136986301369863,\n \"time_ms\": 10,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.3261,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2265_10042791\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n \\n ll N;\\n cin >> N;\\n vector<ll> a(N);\\n for(auto &x: a) cin >> x;\\n \\n // Сортируем в неубывающем порядке\\n sort(a.begin(), a.end(), [](const ll &x, const ll &y) -> bool{\\n return x > y;\\n });\\n \\n // Если палочек меньше 6, выводим 0\\n if(N < 6){\\n cout << \\\"0\\\";\\n return 0;\\n }\\n \\n // Выбираем первые K палочек\\n ll K = min((ll)30, N);\\n vector<ll> topK(a.begin(), a.begin() + K);\\n \\n // Перебираем все возможные тройки и сохраняем валидные\\n struct Triple {\\n int i, j, k;\\n ll sum;\\n };\\n \\n vector<Triple> triples;\\n \\n for(int i = 0; i < K-2; ++i){\\n for(int j = i+1; j < K-1; ++j){\\n for(int k = j+1; k < K; ++k){\\n if(topK[j] + topK[k] > topK[i]){\\n triples.push_back(Triple{ i, j, k, topK[i] + topK[j] + topK[k] });\\n }\\n }\\n }\\n }\\n \\n // Если меньше двух тройк, невозможно\\n if(triples.size() < 2){\\n // Возможно, стоит проверить дальше, но для упрощения ограничимся K=30\\n cout << \\\"0\\\";\\n return 0;\\n }\\n \\n // Ищем максимальную сумму двух не пересекающихся тройк\\n ll max_sum = 0;\\n for(int i = 0; i < triples.size(); ++i){\\n for(int j = i+1; j < triples.size(); ++j){\\n // Проверяем, не пересекаются ли тройки\\n int a1 = triples[i].i;\\n int b1 = triples[i].j;\\n int c1 = triples[i].k;\\n \\n int a2 = triples[j].i;\\n int b2 = triples[j].j;\\n int c2 = triples[j].k;\\n \\n // Проверяем уникальность индексов\\n if(a1 != a2 && a1 != b2 && a1 != c2 &&\\n b1 != a2 && b1 != b2 && b1 != c2 &&\\n c1 != a2 && c1 != b2 && c1 != c2){\\n ll total = triples[i].sum + triples[j].sum;\\n if(total > max_sum){\\n max_sum = total;\\n }\\n }\\n }\\n }\\n \\n // Выводим результат\\n cout << max_sum << endl;\\n}\",\n \"accuracy\": 0.1232876712328767,\n \"time_ms\": 10,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -0.3254,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2265_9128309\",\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;\\n cin >> n;\\n vector<ll> a(n);\\n for (int i = 0; i < n; i++) {\\n cin >> a[i];\\n }\\n sort(a.begin(), a.end());\\n ll res = 0;\\n auto can = [&](ll x, ll y, ll z) -> ll {\\n if (x + y > z) return x + y + z;\\n else return -1e18;\\n };\\n {\\n ll mx = -1e18;\\n for (int i = 5; i < n; i++) {\\n mx = max(mx, can(a[i - 5], a[i - 4], a[i - 3]));\\n ll u = can(a[i - 2], a[i - 1], a[i]);\\n res = max(res, u + mx);\\n }\\n }\\n {\\n for (int i = 0; i + 5 < n; i++) {\\n res = max(res, can(a[i], a[i + 1], a[i + 3]) + can(a[i + 2], a[i + 4], a[i + 5]));\\n res = max(res, can(a[i], a[i + 1], a[i + 4]) + can(a[i + 2], a[i + 3], a[i + 5]));\\n res = max(res, can(a[i], a[i + 1], a[i + 5]) + can(a[i + 2], a[i + 3], a[i + 4]));\\n res = max(res, can(a[i], a[i + 2], a[i + 3]) + can(a[i + 1], a[i + 4], a[i + 5]));\\n res = max(res, can(a[i], a[i + 2], a[i + 4]) + can(a[i + 1], a[i + 3], a[i + 5]));\\n res = max(res, can(a[i], a[i + 2], a[i + 5]) + can(a[i + 1], a[i + 3], a[i + 4]));\\n res = max(res, can(a[i], a[i + 3], a[i + 4]) + can(a[i + 1], a[i + 2], a[i + 5]));\\n res = max(res, can(a[i], a[i + 3], a[i + 5]) + can(a[i + 1], a[i + 2], a[i + 4]));\\n res = max(res, can(a[i], a[i + 4], a[i + 5]) + can(a[i + 1], a[i + 2], a[i + 3]));\\n }\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3896,\n \"score_of_the_acc\": -0.3811,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2265_8965525\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\nint main() {\\n int n;\\n cin >> n;\\n if(n<6){\\n cout << 0 << endl;\\n return 0;\\n }\\n \\n priority_queue<ll> pq;\\n ll a;\\n \\n for(int i=0;i<n;i++){\\n cin >> a;\\n pq.push(a);\\n }\\n \\n ll ans1=0,ans=0;\\n deque<ll> san; \\n int cnt=0,num=0;\\n while(!pq.empty()){\\n //cout << pq.size() << \\\" \\\" << cnt << \\\" \\\" << num << endl;\\n if(num==0){\\n if(cnt<3){ \\n san.push_back(pq.top());\\n pq.pop();\\n cnt++;\\n }\\n if(cnt==3){\\n if(san[0]<san[1]+san[2]){\\n ans1=san[0]+san[1]+san[2];\\n //cout << ans1 << \\\" \\\" << pq.size() << endl;\\n cnt=0;\\n num++;\\n }else{\\n san.pop_front();\\n cnt--;\\n }\\n }\\n }else{\\n if(cnt<3){ \\n san.push_back(pq.top());\\n pq.pop();\\n cnt++;\\n }\\n if(cnt==3){\\n if((san[3]<san[4]+san[5])||\\n ((san[1]<san[2]+san[5])&&(san[0]<san[3]+san[4]))||\\n ((san[2]<san[3]+san[5])&&(san[0]<san[1]+san[4]))||\\n ((san[2]<san[3]+san[4])&&(san[0]<san[1]+san[5]))||\\n ((san[2]<san[4]+san[5])&&(san[0]<san[1]+san[3]))||\\n ((san[1]<san[4]+san[5])&&(san[0]<san[2]+san[3]))||\\n ((san[1]<san[3]+san[5])&&(san[0]<san[2]+san[4]))||\\n ((san[1]<san[3]+san[4])&&(san[0]<san[2]+san[5]))||\\n ((san[1]<san[2]+san[4])&&(san[0]<san[3]+san[5]))||\\n ((san[1]<san[3]+san[4])&&(san[0]<san[4]+san[5]))){\\n ans=ans1+san[3]+san[4]+san[5];\\n //for(int i=0;i<6;i++) cout << san[i] << endl; \\n }else{\\n san[3]=san[4];\\n san[4]=san[5];\\n san[5]=pq.top();\\n pq.pop();\\n if(san[3]<san[4]+san[5]) ans=ans1+san[3]+san[4]+san[5];\\n }\\n }\\n \\n }\\n if(ans>0) break;\\n }\\n \\n cout << max(ans,ans1) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4204,\n \"score_of_the_acc\": -0.4793,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2265_5114777\",\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\\\")\\n\\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-9, 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};\\nstruct UnionFind{\\n vector<int> par;\\n 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]) 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};\\nbool used[101010];\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n \\n int N; cin >> N;\\n vector<ll> a(N);\\n REP(i,N) cin >> a[i];\\n sort(all(a));\\n ll t1=-1, t2=-1;\\n ll ans = 0;\\n for(int i=N-1; i>=2; i--){\\n if(used[i]) continue;\\n ll e1 = a[i], e2 = a[i-1], e3 = a[i-2];\\n if(e2+e3 > e1) {\\n if(t1 == -1){\\n t1 = e1+e2+e3;\\n used[i] = used[i-1] = used[i-2] = true;\\n }else{\\n t2 = e1+e2+e3;\\n break;\\n }\\n }\\n }\\n if(t2 != -1) ans = t1+t2;\\n for(int i=N-1; i>=5; i--){\\n vector<ll> v{a[i-5], a[i-4], a[i-3], a[i-2], a[i-1], a[i]};\\n ll sum = accumulate(all(v), 0LL);\\n\\n vector<bool> ok(1<<6);\\n REP(bit,(1<<6)){\\n if(__builtin_popcount(bit) != 3) continue;\\n vector<ll> e;\\n for(int j=0; j<6; j++){\\n if(bit >> j & 1) e.push_back(v[j]);\\n }\\n\\n if(e[0]+e[1]>e[2] && e[0]+e[2]>e[1] && e[1]+e[2]>e[0]){\\n ok[bit] = true;\\n }\\n }\\n REP(bit,(1<<6)){\\n if(__builtin_popcount(bit) != 3) continue;\\n if(ok[bit] && ok[((1<<6)-1) & ~bit]){\\n ans = max(ans, sum);\\n break;\\n } \\n }\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3624,\n \"score_of_the_acc\": -0.6936,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2265_4796231\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\nbool check3(vector<int> a) {\\n //for (int i: a) cout << i << ' '; cout << endl;\\n\\tsort(a.begin(), a.end());\\n\\treturn a[2] < a[1] + a[0];\\n}\\n\\nbool check6(vector<int> a) {\\n //for (int i: a) cout << i << ' '; cout << endl;\\n sort(a.begin(), a.end());\\n\\tfor (int i = 2; i < 5; i++) {\\n\\t\\tvector<int> p;\\n\\t\\tfor (int j = 0; j < 5; j++) {\\n\\t\\t if (i != j) p.push_back(j);\\n\\t\\t}\\n\\t\\t\\n\\t\\tdo {\\n\\t\\t vector<int> s(2); \\n\\t\\t s[0] = a[p[0]] + a[p[1]] - a[i];\\n\\t\\t s[1] = a[p[2]] + a[p[3]] - a[5];\\n\\t\\t \\n\\t\\t if (s[0] > 0 && s[1] > 0) return true;\\n\\t\\t} while (next_permutation(p.begin(), p.end()));\\n\\t}\\n\\treturn false;\\n}\\n\\nsigned main() {\\n\\tios::sync_with_stdio(0); cin.tie(0);\\n\\n\\tint n; cin >> n;\\n\\tvector<int> a(n);\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tcin >> a[i];\\n\\t}\\n\\tsort(a.begin(), a.end());\\n\\t\\n\\tvector<int> ans2;\\n\\tfor (int i = 0; i+5 < n; i++) {\\n\\t vector<int> tmp;\\n\\t for (int j = 0; j < 6; j++) {\\n\\t tmp.push_back(a[i+j]);\\n\\t }\\n\\t if (check6(tmp)) {\\n\\t ans2 = tmp;\\n\\t }\\n\\t}\\n\\t\\n\\tvector<int> ans;\\n\\n\\twhile (a.size() >= 3) {\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\n\\t\\tif (check3(ans)) break;\\n\\t\\telse {\\n\\t\\t\\ta.push_back(ans.back()); ans.pop_back();\\n\\t\\t\\ta.push_back(ans.back()); ans.pop_back();\\n\\t\\t\\tans.pop_back();\\n\\t\\t}\\n\\t}\\n\\n\\twhile (a.size() >= 3) {\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\t\\tans.push_back(a.back()); a.pop_back();\\n\\n\\t\\tif (check6(ans)) break;\\n\\t\\telse {\\n\\t\\t\\ta.push_back(ans.back()); ans.pop_back();\\n\\t\\t\\ta.push_back(ans.back()); ans.pop_back();\\n\\t\\t\\tans.pop_back();\\n\\t\\t}\\n\\t}\\n\\n\\tcout << max(accumulate(ans.begin(), ans.end(), 0LL), accumulate(ans2.begin(), ans2.end(), 0LL)) << '\\\\n';\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6438356164383562,\n \"time_ms\": 30,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.3614,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2265_2660468\",\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\\nint calc_left[20][3],calc_right[20][3];\\n\\nbool check(ll a,ll b, ll c){\\n\\treturn a+b > c;\\n}\\n\\nvoid divideGroup(){\\n\\n\\tint index = 0,left_index,right_index;\\n\\tint left_table[6],right_table[6];\\n\\n\\tfor(int i = 0; i < 64; i++){\\n\\t\\tleft_index = right_index = 0;\\n\\t\\tfor(int loop = 0; loop < 6; loop++){\\n\\t\\t\\tif(i & (1 << loop)){\\n\\t\\t\\t\\tleft_table[left_index++] = loop;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tright_table[right_index++] = loop;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(left_index != 3 || right_index != 3)continue;\\n\\n\\t\\tfor(int k = 0; k < 3; k++){\\n\\t\\t\\tcalc_left[index][k] = left_table[k];\\n\\t\\t\\tcalc_right[index][k] = right_table[k];\\n\\t\\t}\\n\\t\\tindex++;\\n\\t}\\n\\n}\\n\\nint main(){\\n\\n\\tdivideGroup();\\n\\n\\tint N;\\n\\tscanf(\\\"%d\\\",&N);\\n\\n\\tll* table = new ll[N];\\n\\tfor(int i = 0; i < N; i++)scanf(\\\"%lld\\\",&table[i]);\\n\\n\\tsort(table,table+N);\\n\\n\\tll* max_3seq = new ll[N];\\n\\tfor(int i = 0; i < N; i++)max_3seq[i] = 0;\\n\\n\\tfor(int i = 0; i <= N-3; i++){\\n\\t\\tif(check(table[i],table[i+1],table[i+2])){\\n\\t\\t\\tmax_3seq[i] = table[i]+table[i+1]+table[i+2];\\n\\t\\t}else{\\n\\t\\t\\tif(i > 0){\\n\\t\\t\\t\\tmax_3seq[i] = max_3seq[i-1];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tll ans = 0;\\n\\tint debug;\\n\\tfor(int i = 0; i+5 <= N-1; i++){\\n\\t\\tif(check(table[i+3],table[i+4],table[i+5])){\\n\\t\\t\\tans = max(ans,max_3seq[i]+table[i+3]+table[i+4]+table[i+5]);\\n\\t\\t}\\n\\t\\tbool FLG = false;\\n\\n\\t\\tfor(int k = 0; k < 20; k++){\\n\\t\\t\\tif(check(table[i+calc_left[k][0]],table[i+calc_left[k][1]],table[i+calc_left[k][2]]) == true &&\\n\\t\\t\\t\\t\\tcheck(table[i+calc_right[k][0]],table[i+calc_right[k][1]],table[i+calc_right[k][2]]) == true){\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\tdebug = k;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(FLG){\\n\\t\\t\\tans = max(ans,table[i]+table[i+1]+table[i+2]+table[i+3]+table[i+4]+table[i+5]);\\n\\t\\t}\\n\\t}\\n\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4852,\n \"score_of_the_acc\": -0.5751,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2265_2552336\",\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\\nbool tri(const vector<ll> &x)\\n{\\n return x[0]+x[1]>x[2];\\n}\\n\\nbool check(const vector<ll> &v)\\n{\\n // dbg(v);\\n int comb = (1<<3) - 1;\\n while(comb < (1<<6)-1)\\n {\\n vector<ll> p,q;\\n rep(i,6)\\n {\\n if(comb>>i&1) p.pb(v[i]);\\n else q.pb(v[i]);\\n }\\n // dbg(p);dbg(q);\\n if(tri(p) && tri(q)) return true;\\n\\n int x = comb & -comb, y = comb + x;\\n comb = ((comb & ~y) / x>>1) | y;\\n }\\n return false;\\n}\\n\\nll SUM(const vector<ll> &v)\\n{\\n ll ret = 0;\\n for(ll i:v) ret += i;\\n return ret;\\n}\\n\\nint main()\\n{\\n int n;\\n cin >>n;\\n vector<ll> a(n);\\n rep(i,n) cin >>a[i];\\n sort(all(a));\\n\\n vector<int> ok;\\n for(int i=2; i<n; ++i)\\n {\\n vector<ll> v;\\n rep(j,3) v.pb(a[i-2+j]);\\n if(tri(v)) ok.pb(i);\\n }\\n\\n ll ans = 0;\\n rep(i,n-5)\\n {\\n vector<ll> v;\\n rep(j,6) v.pb(a[i+j]);\\n if(check(v)) ans = max(ans,SUM(v));\\n }\\n\\n if(ok.size()>0)\\n {\\n for(int i=n-1; i>=2; --i)\\n {\\n if(*lower_bound(all(ok),i) == i)\\n {\\n int idx = lower_bound(all(ok),i-2)-ok.begin();\\n --idx;\\n if(idx>=0)\\n {\\n vector<ll> v;\\n rep(j,3) v.pb(a[ok[idx]-2+j]);\\n rep(j,3) v.pb(a[i-2+j]);\\n ans = max(ans,SUM(v));\\n }\\n }\\n }\\n }\\n \\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 4328,\n \"score_of_the_acc\": -0.6294,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2265_2335860\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\n\\n#define each(i,a) for (auto&& i : a)\\n#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)\\n#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)\\n#define REP(i,n) FOR(i,0,n)\\n#define RREP(i,n) RFOR(i,0,n)\\n#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME\\n#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)\\n#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)\\n#define pb push_back\\n#define all(a) (a).begin(),(a).end()\\n#define chmin(x,v) x = min(x, v)\\n#define chmax(x,v) x = max(x, v)\\n\\nconst ll linf = 1e18;\\nconst int inf = 1e9;\\nconst double eps = 1e-12;\\nconst double pi = acos(-1);\\n\\ntemplate<typename T>\\nistream& operator>>(istream& is, vector<T>& vec) {\\n each(x,vec) is >> x;\\n return is;\\n}\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const vector<T>& vec) {\\n rep(i,vec.size()) {\\n if (i) os << \\\" \\\";\\n os << vec[i];\\n }\\n return os;\\n}\\ntemplate<typename T>\\nostream& operator<<(ostream& os, const vector< vector<T> >& vec) {\\n rep(i,vec.size()) {\\n if (i) os << endl;\\n os << vec[i];\\n }\\n return os;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n ll n; cin >> n;\\n vector<ll> v(n); cin >> v;\\n sort(all(v), greater<ll>());\\n ll ans = 0;\\n { // xxxooo\\n ll a = 0, k = 0;\\n rep(i, n-2) {\\n if (v[i] < v[i+1] + v[i+2]) {\\n a += v[i] + v[i+1] + v[i+2];\\n i += 2;\\n if (++k == 2) {\\n chmax(ans, a);\\n }\\n }\\n }\\n }\\n {\\n rep(i, n-5) {\\n if (v[i] < v[i+1] + v[i+5] && v[i+2] < v[i+3] + v[i+4] // xxooox\\n || v[i] < v[i+1] + v[i+4] && v[i+2] < v[i+3] + v[i+5] // xxooxo\\n || v[i] < v[i+3] + v[i+4] && v[i+1] < v[i+2] + v[i+5]) { // xooxxo\\n ll sum = 0;\\n rep(j, 6) sum += v[i+j];\\n chmax(ans, sum);\\n }\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.3312,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2265_2040954\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint n; long long a[100009];\\nlong long solve(int l, int r) {\\n\\tlong long ret = 0;\\n\\tfor(int i = 0; i < 1 << (r - l); i++) {\\n\\t\\tif(__builtin_popcount(i) != 3) continue;\\n\\t\\tvector<long long> x1, x2;\\n\\t\\tfor(int j = 0; j < 6; j++) {\\n\\t\\t\\tif(i & (1 << j)) x1.push_back(a[l + j]);\\n\\t\\t\\telse x2.push_back(a[l + j]);\\n\\t\\t}\\n\\t\\tif(x1[0] + x1[1] > x1[2] && x2[0] + x2[1] > x2[2]) {\\n\\t\\t\\tret = max(ret, x1[0] + x1[1] + x1[2] + x2[0] + x2[1] + x2[2]);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\nint main() {\\n\\tcin >> n;\\n\\tfor(int i = 0; i < n; i++) cin >> a[i];\\n\\tsort(a, a + n);\\n\\tint pos = -1;\\n\\tfor(int i = n - 3; i >= 0; i--) {\\n\\t\\tif(a[i] + a[i + 1] > a[i + 2]) {\\n\\t\\t\\tpos = i; break;\\n\\t\\t}\\n\\t}\\n\\tint pos2 = -1;\\n\\tfor(int i = pos - 3; i >= 0; i--) {\\n\\t\\tif(a[i] + a[i + 1] > a[i + 2]) {\\n\\t\\t\\tpos2 = i; break;\\n\\t\\t}\\n\\t}\\n\\tlong long ret = (pos2 != -1 ? a[pos2] + a[pos2 + 1] + a[pos2 + 2] + a[pos] + a[pos + 1] + a[pos + 2] : 0);\\n\\tfor(int i = 0; i < n - 6; i++) {\\n\\t\\tret = max(ret, solve(i, i + 6));\\n\\t}\\n\\tcout << ret << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 3952,\n \"score_of_the_acc\": -1.3912,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2265_1697342\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\nusing namespace std;\\n#define MAX_N 500000\\n#define MAX_S 600\\nlong long x[MAX_N];\\nlong long TOP[MAX_S], n;\\nlong long maxn1[MAX_N], maxn2[MAX_N];\\nint main() {\\n\\tcin >> n;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tcin >> x[i];\\n\\t}\\n\\tsort(x, x + n);\\n\\tlong long cnt = 0;\\n\\tfor (int i = n - MAX_S; i < n; i++) {\\n\\t\\tif (i >= 0) {\\n\\t\\t\\tTOP[cnt] = x[i];\\n\\t\\t\\tcnt++;\\n\\t\\t}\\n\\t}\\n\\tlong long maxn = 0;\\n\\tfor (int i = 0; i < cnt; i++) {\\n\\t\\tfor (int j = i + 1; j < cnt; j++) {\\n\\t\\t\\tfor (int k = j + 1; k < cnt; k++) {\\n\\t\\t\\t\\tif (TOP[i] + TOP[j] > TOP[k]) {\\n\\t\\t\\t\\t\\tmaxn1[i] = max(maxn1[i], TOP[i] + TOP[j] + TOP[k]);\\n\\t\\t\\t\\t\\tmaxn2[k] = max(maxn2[k], TOP[i] + TOP[j] + TOP[k]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < cnt; i++) {\\n\\t\\tfor (int j = i + 1; j < cnt; j++) {\\n\\t\\t\\tmaxn = max(maxn, maxn2[i] + maxn1[j]);\\n\\t\\t}\\n\\t}\\n\\n\\tfor (int i = 0; i < cnt - 5; i++) {\\n\\t\\tlong long c[6], d[3], e[3];\\n\\t\\tfor (int j = 0; j < 6; j++) {\\n\\t\\t\\tc[j] = TOP[i + j];\\n\\t\\t}\\n\\t\\tlong long cnt = 0, cnt1 = 0, cnt2 = 0;\\n\\t\\tfor (int j = 0; j < 64; j++) {\\n\\t\\t\\tcnt = 0;\\n\\t\\t\\tfor (int k = 0; k < 6; k++) { cnt += (j / (1 << k)) % 2; }\\n\\t\\t\\tif (cnt == 3) {\\n\\t\\t\\t\\tcnt1 = 0; cnt2 = 0;\\n\\t\\t\\t\\tfor (int k = 0; k < 6; k++) {\\n\\t\\t\\t\\t\\tif ((j / (1 << k)) % 2 == 0) {\\n\\t\\t\\t\\t\\t\\td[cnt1] = c[k];\\n\\t\\t\\t\\t\\t\\tcnt1++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\te[cnt2] = c[k];\\n\\t\\t\\t\\t\\t\\tcnt2++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (d[0] + d[1]>d[2] && e[0] + e[1]>e[2]) {\\n\\t\\t\\t\\t\\tmaxn = max(maxn, d[0] + d[1] + d[2] + e[1] + e[2] + e[0]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << maxn << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 7320,\n \"score_of_the_acc\": -1.2979,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2265_1480718\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\nint main() {\\n\\tint N; cin >> N;\\n\\tvector<ll> v(N);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tcin >> v[i];\\n\\t}\\n\\tsort( v.begin(), v.end() );\\n\\n\\tll ans = 0;\\n\\n\\t// 012345\\n\\t// oooxox\\n\\t// ooooxx\\n\\tfor (int t = N-6; t >= 0; --t) {\\n\\t\\tvector<ll> a(6);\\n\\t\\tfor (int i = 0; i < 6; ++i) {\\n\\t\\t\\ta[i] = v[t+i];\\n\\t\\t}\\n\\n\\t\\tll sum = 0;\\n\\t\\tfor (int i = 0; i < 6; ++i) {\\n\\t\\t\\tsum += a[i];\\n\\t\\t}\\n\\n\\t\\tif ((a[0] + a[1] > a[3] && a[2] + a[4] > a[5])\\n\\t\\t\\t|| (a[0] + a[2] > a[3] && a[1] + a[4] > a[5])\\n\\t\\t\\t|| (a[1] + a[2] > a[3] && a[0] + a[4] > a[5])\\n\\t\\t\\t|| (a[0] + a[1] > a[4] && a[2] + a[3] > a[5])\\n\\t\\t\\t|| (a[0] + a[2] > a[4] && a[1] + a[3] > a[5])\\n\\t\\t\\t|| (a[0] + a[3] > a[4] && a[1] + a[2] > a[5])\\n\\t\\t\\t|| (a[0] + a[1] > a[5] && a[2] + a[3] > a[4])\\n\\t\\t\\t|| (a[0] + a[2] > a[5] && a[1] + a[3] > a[4])\\n\\t\\t\\t|| (a[0] + a[3] > a[5] && a[1] + a[2] > a[4])) {\\n\\t\\t\\tif (sum > ans) ans = sum;\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tll s = 0;\\n\\n\\t\\tint pos = -1;\\n\\t\\tfor (int i = N-3; i >= 0; --i) {\\n\\t\\t\\tif (v[i] + v[i+1] > v[i+2]) {\\n\\t\\t\\t\\ts = v[i] + v[i+1] + v[i+2];\\n\\t\\t\\t\\tpos = i;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (pos > -1) {\\n\\t\\t\\tfor (int i = pos-3; i >= 0; --i) {\\n\\t\\t\\t\\tif (v[i] + v[i+1] > v[i+2]) {\\n\\t\\t\\t\\t\\tll s2 = s + v[i] + v[i+1] + v[i+2];\\n\\t\\t\\t\\t\\tif (s2 > ans) ans = s2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1796,\n \"score_of_the_acc\": -0.1291,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2265_1457721\",\n \"code_snippet\": \"#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<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\n\\n/* typedef */\\n\\ntypedef long long ll;\\n\\n/* global variables */\\n\\nll as[MAX_N];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n;\\n cin >> n;\\n\\n for (int i = 0; i < n; i++) cin >> as[i];\\n sort(as, as + n, greater<ll>());\\n\\n ll maxsum0 = 0, maxsum1 = 0;\\n ll sumi, sumj;\\n int i;\\n \\n for (i = 0; i < n - 5; i++)\\n if (as[i] < as[i + 1] + as[i + 2]) {\\n sumi = as[i] + as[i + 1] + as[i + 2];\\n //printf(\\\"%d:%lld+%lld+%lld=%lld\\\\n\\\",i,as[i],as[i+1],as[i+2],sumi);\\n break;\\n }\\n\\n for (int j = i + 3; j < n - 2; j++)\\n if (as[j] < as[j + 1] + as[j + 2]) {\\n sumj = as[j] + as[j + 1] + as[j + 2];\\n maxsum0 = sumi + sumj;\\n //printf(\\\"%d:%lld+%lld+%lld=%lld\\\\n\\\",j,as[j],as[j+1],as[j+2],sumj);\\n break;\\n }\\n\\n ll sum = as[0] + as[1] + as[2] + as[3] + as[4];\\n for (i = 0; i < n - 5; i++) {\\n sum += as[i + 5];\\n if ((as[i] < as[i + 1] + as[i + 2] && as[i + 3] < as[i + 4] + as[i + 5]) ||\\n\\t(as[i] < as[i + 1] + as[i + 3] && as[i + 2] < as[i + 4] + as[i + 5]) ||\\n\\t(as[i] < as[i + 1] + as[i + 4] && as[i + 2] < as[i + 3] + as[i + 5]) ||\\n\\t(as[i] < as[i + 1] + as[i + 5] && as[i + 2] < as[i + 3] + as[i + 4]) ||\\n\\t(as[i] < as[i + 2] + as[i + 3] && as[i + 1] < as[i + 4] + as[i + 5]) ||\\n\\t(as[i] < as[i + 2] + as[i + 4] && as[i + 1] < as[i + 3] + as[i + 5]) ||\\n\\t(as[i] < as[i + 2] + as[i + 5] && as[i + 1] < as[i + 3] + as[i + 4]) ||\\n\\t(as[i] < as[i + 3] + as[i + 4] && as[i + 1] < as[i + 2] + as[i + 5]) ||\\n\\t(as[i] < as[i + 3] + as[i + 5] && as[i + 1] < as[i + 2] + as[i + 4]) ||\\n\\t(as[i] < as[i + 4] + as[i + 5] && as[i + 1] < as[i + 2] + as[i + 3])) {\\n maxsum1 = sum;\\n break;\\n }\\n sum -= as[i];\\n }\\n \\n cout << max(maxsum0, maxsum1) << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1964,\n \"score_of_the_acc\": -0.1382,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2265_1219466\",\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 <cstring>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\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, w; };\\n\\nll MOD = 1000000007;\\nll _MOD = 1000000009;\\ndouble EPS = 1e-10;\\nint INF = INT_MAX / 4;\\n\\nint main() {\\n\\tint N; cin >> N;\\n\\tif (N < 6) {\\n\\t\\tcout << 0 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tvector<ll> a(N);\\n\\tfor (int i = 0; i < N; i++)\\n\\t\\tcin >> a[i];\\n\\tsort(a.begin(), a.end());\\n\\tvector<ll> b(N - 2);\\n\\tfor (int i = 0; i + 3 <= N; i++)\\n\\t\\tif (a[i] + a[i + 1] > a[i + 2])\\n\\t\\t\\tb[i] = a[i] + a[i + 1] + a[i + 2];\\n\\tvector<ll> c(N - 1);\\n\\tc[0] = 0;\\n\\tfor (int i = 1; i - 1 < N - 2; i++)\\n\\t\\tc[i] = max(c[i - 1], b[i - 1]);\\n\\tll maxi = 0;\\n\\tfor (int i = 3; i + 3 <= N; i++)\\n\\t\\tif (c[i - 2] && b[i])\\n\\t\\t\\tmaxi = max(maxi, c[i - 2] + b[i]);\\n\\tfor (int i = N - 6; i >= 0; i--) {\\n\\t\\tbool ok = false;\\n\\t\\tfor (int S = 0; S < (1 << 6); S++) {\\n\\t\\t\\tvector<ll> v, w;\\n\\t\\t\\tfor (int j = 0; j < 6; j++)\\n\\t\\t\\t\\tif ((S >> j) & 1) v.push_back(a[i + j]);\\n\\t\\t\\t\\telse w.push_back(a[i + j]);\\n\\t\\t\\tif (v.size() == 3 && v[0] + v[1] > v[2] && w[0] + w[1] > w[2])\\n\\t\\t\\t\\tok = true;\\n\\t\\t}\\n\\t\\tif (ok) {\\n\\t\\t\\tmaxi = max(maxi, a[i] + a[i + 1] + a[i + 2] + a[i + 3] + a[i + 4] + a[i + 5]);\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tcout << maxi << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -0.3949,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2265_1175334\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\ninline bool check(ll a, ll b, ll c){ return a<b+c; }\\n\\nint main(){\\n ll n, a[100100];\\n scanf(\\\"%lld\\\",&n);\\n for(int i=0;i<n;i++)scanf(\\\"%lld\\\",a+i);\\n sort(a,a+n,greater<ll>());\\n\\n ll ans = 0;\\n for(int i=0;i<n-2;i++){\\n if(check(a[i],a[i+1],a[i+2])){\\n for(int j=i+3;j<n-2;j++){\\n\\tif(check(a[j],a[j+1],a[j+2])){\\n\\t ll sum = 0;\\n\\t for(int k=0;k<3;k++)sum += a[i+k] + a[j+k];\\n\\t ans = max(ans,sum);\\n\\t goto END1;\\n\\t}\\n }\\n }\\n }\\n END1:;\\n\\n for(int i=0;i<n-5;i++){\\n int comb = (1<<3)-1;\\n while(comb < (1<<5)){\\n vector<ll> A,B;\\n for(int j=0;j<6;j++){\\n\\tif( (comb>>j)&1 )A.push_back(a[i+j]);\\n\\telse B.push_back(a[i+j]);\\n }\\n\\n if(check(A[0],A[1],A[2]) && check(B[0],B[1],B[2])){\\n\\tll sum = 0;\\n\\tfor(int k=0;k<6;k++)sum += a[i+k];\\n\\tans = max(ans,sum);\\n\\tgoto END2;\\n }\\n\\n int x = comb & -comb, y = comb + x;\\n comb = ( ( (comb & ~y) /x ) >> 1) | y;\\n }\\n }\\n\\n END2: cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 2016,\n \"score_of_the_acc\": -0.0838,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2265_1175331\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\ninline bool check(ll a, ll b, ll c){ return a<b+c; }\\n\\nint main(){\\n ll n, a[100100];\\n cin >> n;\\n for(int i=0;i<n;i++)cin >> a[i];\\n sort(a,a+n,greater<ll>());\\n\\n ll ans = 0;\\n for(int i=0;i<n-2;i++){\\n if(check(a[i],a[i+1],a[i+2])){\\n for(int j=i+3;j<n-2;j++){\\n\\tif(check(a[j],a[j+1],a[j+2])){\\n\\t ll sum = 0;\\n\\t for(int k=0;k<3;k++)sum += a[i+k] + a[j+k];\\n\\t ans = max(ans,sum);\\n\\t goto END1;\\n\\t}\\n }\\n }\\n }\\n END1:;\\n\\n for(int i=0;i<n-5;i++){\\n int comb = (1<<3)-1;\\n while(comb < (1<<5)){\\n vector<ll> A,B;\\n for(int j=0;j<6;j++){\\n\\tif( (comb>>j)&1 )A.push_back(a[i+j]);\\n\\telse B.push_back(a[i+j]);\\n }\\n\\n if(check(A[0],A[1],A[2]) && check(B[0],B[1],B[2])){\\n\\tll sum = 0;\\n\\tfor(int k=0;k<6;k++)sum += a[i+k];\\n\\tans = max(ans,sum);\\n\\tgoto END2;\\n }\\n\\n int x = comb & -comb, y = comb + x;\\n comb = ( ( (comb & ~y) /x ) >> 1) | y;\\n }\\n }\\n\\n END2: cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1996,\n \"score_of_the_acc\": -0.144,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2265_1175330\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\ninline bool check(ll a, ll b, ll c){ return a<b+c; }\\n\\nint main(){\\n ll n, a[100100];\\n cin >> n;\\n for(int i=0;i<n;i++)cin >> a[i];\\n sort(a,a+n,greater<ll>());\\n\\n ll ans = 0;\\n for(int i=0;i<n-2;i++){\\n if(check(a[i],a[i+1],a[i+2])){\\n for(int j=i+3;j<n-2;j++){\\n\\tif(check(a[j],a[j+1],a[j+2])){\\n\\t ll sum = 0;\\n\\t for(int k=0;k<3;k++)sum += a[i+k] + a[j+k];\\n\\t ans = max(ans,sum);\\n\\t goto END1;\\n\\t}\\n }\\n }\\n }\\n END1:;\\n\\n for(int i=0;i<n-5;i++){\\n int comb = (1<<3)-1;\\n while(comb < (1<<6)){\\n vector<ll> A,B;\\n for(int j=0;j<6;j++){\\n\\tif( (comb>>j)&1 )A.push_back(a[i+j]);\\n\\telse B.push_back(a[i+j]);\\n }\\n\\n if(check(A[0],A[1],A[2]) && check(B[0],B[1],B[2])){\\n\\tll sum = 0;\\n\\tfor(int k=0;k<6;k++)sum += a[i+k];\\n\\tans = max(ans,sum);\\n\\tgoto END2;\\n }\\n\\n int x = comb & -comb, y = comb + x;\\n comb = ( ( (comb & ~y) /x ) >> 1) | y;\\n }\\n }\\n\\n END2: cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 1996,\n \"score_of_the_acc\": -0.144,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2265_1154447\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n\\nusing namespace std;\\ntypedef long long Int;\\n\\n\\n\\nbool able(Int a, Int b, Int c){\\n\\tInt sum = a + b + c;\\n\\treturn a*2 < sum && b*2 < sum && c*2 < sum;\\n}\\n\\nbool able2(Int a, Int b, Int c, Int d, Int e, Int f){\\n\\tif(able(a, b, c) && able(d, e, f))return true;\\n\\tif(able(a, b, d) && able(c, e, f))return true;\\n\\tif(able(a, b, e) && able(c, d, f))return true;\\n\\tif(able(a, b, f) && able(c, d, e))return true;\\n\\tif(able(a, c, d) && able(b, e, f))return true;\\n\\tif(able(a, c, e) && able(b, d, f))return true;\\n\\tif(able(a, c, f) && able(b, d, e))return true;\\n\\tif(able(a, d, e) && able(b, c, f))return true;\\n\\tif(able(a, d, f) && able(b, c, e))return true;\\n\\tif(able(a, e, f) && able(b, c, d))return true;\\n\\treturn false;\\n}\\n\\n\\nInt n, res;\\nInt a[108000], right1 = -1, right2 = -1;\\nbool ok[108000];\\nint main(){\\n\\tcin >> n;\\n\\tfor(Int i = 0;i < n;i++) cin >> a[i];\\n\\tsort(a, a + n);\\n\\tfor(Int i = 2;i < n;i++){\\n\\t\\tok[i] = able(a[i], a[i-1], a[i-2]);\\n\\t\\tif(ok[i])right1 = i;\\n\\t}\\n\\tfor(Int i = 2;i <= right1 - 3;i++){\\n\\t\\tif(ok[i])right2 = i;\\n\\t}\\n\\tif(right1 != -1 && right2 != -1)\\n\\t\\tres = a[right1] + a[right1-1] + a[right1-2] + a[right2] + a[right2-1] + a[right2-2];\\n\\tfor(Int i = 5;i < n;i++){\\n\\t\\tif(able2(a[i], a[i-1], a[i-2], a[i-3], a[i-4], a[i-5])){\\n\\t\\t\\tres = max(res, a[i] + a[i-1] + a[i-2] + a[i-3] + a[i-4] + a[i-5]);\\n\\t\\t}\\n\\t}\\n\\tcout << res << endl;\\n\\treturn 0;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 2064,\n \"score_of_the_acc\": -0.1563,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2265_1150214\",\n \"code_snippet\": \"//Name: Programming Contest Challenge Book\\n//Level: 3\\n//Category: 数学,Math,考察\\n//Note:\\n\\n/**\\n * 棒を長さの降順でソートしてから考える。\\n * 以下、三角形の辺に関して長い方からp,q,rと呼ぶことにする。\\n *\\n * 三角形を1つ作るとき、棒iを辺pとして採用すると、三角不等式のうちp+q>rとp+r>qが満たされることは自明である。\\n * q+r>pであるためにはbとcを可能な限り大きく取ればよいから、結局棒i+1とi+2を加えて三角形を構成できなければ、棒iを辺pとした三角形は構成できないことがわかる。\\n *\\n * この考察から、連続する3辺で三角形が作れるかを考えながら貪欲に構成していくという方法が思いつくが、これでは3 3 2 2 1 1のような列のときにうまくいかない。\\n * すなわち、a_{i+3}≧a_{i+4}+a_{i+5}であるが、2つの三角形に割り当てる順番をうまく入れ替えてやるとちょうど割り当てられる場合である。\\n * このような場合は、棒iから連続する6つの棒だけを使って2つの三角形を構成しないと意味がないため、全探索すればよい\\n * （周長を最大化する制約から、この6つよりも短い棒を使っている場合、iを超えない範囲で長い棒に入れ替えることは安全であり、かつ得をする）。\\n *\\n * オーダーは O(N log N)。\\n */\\n#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <numeric>\\n\\nusing namespace std;\\n\\nbool solve() {\\n int N;\\n if(!(cin >> N)) return false;\\n\\n vector<long long> as(N);\\n for(int i = 0; i < N; ++i) {\\n cin >> as[i];\\n }\\n sort(begin(as), end(as), greater<long long>());\\n\\n typedef vector<int> Choice;\\n vector<pair<Choice,Choice>> choose_3;\\n for(int pat = 0; pat < (1<<6); ++pat) {\\n if(__builtin_popcount(pat) != 3) continue;\\n Choice c1, c2;\\n for(int i = 0; i < 6; ++i) {\\n if(pat & (1<<i)) c1.push_back(i);\\n else c2.push_back(i);\\n }\\n choose_3.emplace_back(c1, c2);\\n }\\n\\n long long ans = 0;\\n int composed = 0;\\n for(int i = 0; i <= N-3; ++i) {\\n // Check if all 6 sticks can be used\\n if(composed == 0 && i <= N-6) {\\n for(auto pat : choose_3) {\\n const auto &c1 = pat.first;\\n const auto &c2 = pat.second;\\n if(as[i+c1[0]] < as[i+c1[1]]+as[i+c1[2]] && as[i+c2[0]] < as[i+c2[1]]+as[i+c2[2]]) {\\n ans = accumulate(begin(as)+i, begin(as)+i+6, 0LL);\\n composed = 2;\\n goto end;\\n }\\n }\\n }\\n // Check if 3 sticks can be used\\n if(as[i] < as[i+1] + as[i+2]) {\\n ans += as[i]+as[i+1]+as[i+2];\\n if(++composed == 2) break;\\n i += 2;\\n }\\n }\\nend:\\n if(composed != 2) ans = 0;\\n cout << ans << endl;\\n return true;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n while(solve()) ;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1788,\n \"score_of_the_acc\": -0.0213,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1257,"cells":{"group_id":{"kind":"string","value":"aoj_2269_cpp"},"problem_description":{"kind":"string","value":"問題 K : 巡回セールスマン問題\n2011 年のあの頃，まだプログラミングコンテストはとても平和であり，\n我々はルールを精読せずに気軽にコンテストに参加していた．\nしかし，そこに G○○gle の陰謀は迫っていた．\nある日，G○○gle によって秘密裏に買収されていた T○pC○der のコンテストは，\n人知れずうちにルールが改変されており，命がけのプログラミングコンテストとなっていた．\nそして僕は，そこで，何も知らず，\nまっ先に kita_masa のプログラムのオーバーフローを突いたのだ…．\n(iwi)\n「うう…ああ…」\nwata\n「今やるべきことは自分を攻めることではない．チャンスを無駄にする気か？」\n…そういえば，今こいつは，部屋に居る全ての人間を一瞬にして倒していた．\nどうなっているんだ？\nwata\n「まず，知っているかもしれないが， G○○gle は NP 完全問題を含む多くの計算困難と言われてきた問題に対する多項式時間の効率的なアルゴリズムを持っている．P vs NP 問題を解決したが，敢えてそれを秘匿することによってここまで成長したのだ．」\n(iwi)\n「もしやとは思っていたが，やはりか…． しかし，お前は今，G○○gle の人間を一瞬にして倒した．もしやお前も…？」\nwata\n「残念ながら違う．しかし…お前なら，分かるはずだろう？」\n…なるほど!! そういうことか．\n彼は大学時代，指数時間のアルゴリズムを高速にすることに興味を持っていた．\n例え指数時間であっても，指数の底が極めて小さければ，\n現実的なインスタンスに対して十分に高速な可能性がある．\nwata\n「そういうことだ．例えば，今僕は，巡回セールスマン問題の\nO\n*\n(1.0001\nn\n)\n時間のアルゴリズムを完成させようとしている．」\n凄まじい，想像以上だ…．\nwata\n「完成させるにあたって，グラフアルゴリズムに詳しいお前の力が必要だ． 手を貸してくれるな？」\n(iwi)\n「ああ，勿論だ．まかせろ!!」\n問題\nグラフが与えられる．\nグラフは\nN\n個の頂点を持ち，頂点には\n1\nから\nN\nの番号が付いている．\nまた，グラフは\nM\n個の辺を持ち，辺は有向 (一方通行) で，\nそれぞれ距離が決まっている．\n頂点\n1\nから出発し，頂点\n2, 3, …,\nN\nをこの順番に訪れ，頂点\n1\nへ戻る経路を考える．\nここで，「この順番に訪れる」というのは，経路に含まれる頂点の部分列に\n2, 3, …,\nN\nが含まれるということである．\nつまり，スタート地点の頂点\n1\nから頂点\n2\nへの移動は，\n直接の移動であっても，他の頂点を経由した移動であってもよく，\n次の頂点\n2\nから頂点\n3\nへの移動，\nさらにその次の頂点\n3\nから頂点\n4\nへの移動等に関しても同様である．\n同じ頂点や同じ辺を 2 度通っても構わない．\nグラフが与えられた時，\n頂点\n1\nから出発し頂点\n2, 3, …,\nN\nをこの順番に訪れ頂点\n1\nへ戻る経路のうち，\n最短のものの長さを出力するプログラムを作成せよ．\n経路の長さとは，経路に含まれる辺の距離の和である．\n複数回含まれる辺に関しては，含まれる回数の分だけ距離を加えよ．\n入力\n入力の最初の行は 2 つの整数\nN\n,\nM\nを含む．\nこれは，グラフの頂点数と辺数を表す．\n続く\nM\n行は，辺の情報を表す．\nこれらの行のうちの\ni\n行目は 3 つの整数\na\ni\n,\nb\ni\n,\nc\ni\nが書かれており，\n辺\ni\nは頂点\na\ni\nから頂点\nb\ni\nを結び，その距離は\nc\ni\nであることを表す．\n出力\n条件を満たす経路のうち最短のものの長さを出力せよ．\nただし，条件を満たす経路が存在しない場合は，-1 を出力せよ．\n制約\n2 ≤\nN\n≤ 10\n5\n0 ≤\nM\n≤\nN\n+ 500\n1 ≤\na\ni\n,\nb\ni\n≤\nN\n，\na\ni\n≠\nb\ni\n1 ≤\nc\ni\n≤ 10\n3\n入出力例\n入出力例 1\n入力例 1:\n5 5\n1 2 10\n2 3 20\n3 4 30\n4 5 40\n5 1 50\n入力例 1 に対する出力の例:\n150\n入出力例 2\n入力例 2:\n5 5\n1 5 10\n5 4 20\n4 3 30\n3 2 40\n2 1 50\n入力例 2 に対する出力の例:\n600"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2269_10342595","code_snippet":"// AOJ #2269 Traveling Salesman Problem\n// 2025.4.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1e9;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(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\nusing pii = pair<int,int>;\n\nvector<vector<pii>> G, rG;\nvector<int> Vs, VTbl;\n\nvoid compress(const vector<vector<pii>> &G, vector<int> &near, vector<int> &ndist, vector<vector<pii>> &Gc) {\n int n = G.size();\n near.assign(n, -1);\n ndist.assign(n, 0);\n int sz = Vs.size();\n Gc.assign(sz, vector<pii>());\n for (int i = 0; i < sz; i++) {\n int from = Vs[i];\n near[from] = i;\n for (auto &e : G[from]) {\n int dsum = e.first;\n int v = e.second;\n vector<int> visited(n, -1);\n while (VTbl[v] < 0) {\n if (visited[v] != -1) break;\n visited[v] = dsum;\n near[v] = i;\n ndist[v] = dsum;\n dsum += G[v][0].first;\n v = G[v][0].second;\n }\n if (VTbl[v] < 0) VTbl[v] = i;\n Gc[i].push_back({dsum, VTbl[v]});\n }\n }\n}\n\nvoid djik(const vector<vector<pii>> &Gc, vector<vector<int>> &dtbl) {\n int c = Gc.size();\n dtbl.assign(c, vector<int>(c, INF));\n for (int i = 0; i < c; i++) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dtbl[i][i] = 0;\n pq.push({0, i});\n while(!pq.empty()){\n auto [d0, u] = pq.top(); pq.pop();\n if(dtbl[i][u] != d0) continue;\n for(auto &e : Gc[u]){\n int nd = d0 + e.first, w = e.second;\n if(nd < dtbl[i][w]){\n dtbl[i][w] = nd;\n pq.push({nd, w});\n }\n }\n }\n }\n}\n\nint main(){\n int n = Cin(), m = Cin();\n G.assign(n, vector<pii>());\n rG.assign(n, vector<pii>());\n for (int i = 0; i < m; i++){\n int a = Cin()-1, b = Cin()-1, c = Cin();\n G[a].push_back({c, b});\n rG[b].push_back({c, a});\n }\n\n for (int i = 0; i < n; i++){\n if(G[i].empty() || rG[i].empty()) { Cout(-1); return 0; }\n }\n\n VTbl.assign(n, -1);\n Vs.clear();\n for (int i = 0; i < n; i++){\n if(i < 2 || G[i].size() > 1 || rG[i].size() > 1){\n VTbl[i] = Vs.size();\n Vs.push_back(i);\n }\n }\n\n vector<vector<pii>> CG, rCG;\n vector<int> near, rnear, d, rd;\n compress(G, near, d, CG);\n compress(rG, rnear, rd, rCG);\n\n vector<vector<int>> dtbl;\n djik(CG, dtbl);\n\n int from = n - 1;\n ll ans = 0;\n for (int to = 0; to < n; to++){\n int i1 = rnear[from], i2 = near[to];\n if(i1 < 0 || i2 < 0) { Cout(-1); return 0; }\n int dd = rd[from] + dtbl[i1][i2] + d[to];\n if(near[from] == near[to] && rnear[from] == rnear[to]){\n int x = rd[from] - rd[to];\n if(x >= 0 && dd > x) dd = x;\n }\n if(dd >= INF) { Cout(-1); return 0; }\n ans += dd;\n from = to;\n }\n Cout(ans);\n return 0;\n}","accuracy":1,"time_ms":200,"memory_kb":20080,"score_of_the_acc":-0.109,"final_rank":1},{"submission_id":"aoj_2269_10342593","code_snippet":"// AOJ #2269 Traveling Salesman Problem\n// 2025.4.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1e9;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(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\nusing pii = pair<int,int>;\n\nvector<vector<pii>> G, RG;\nvector<int> vs, vt;\n\nvoid comp(const vector<vector<pii>> &G, vector<int> &near, vector<int> &d, vector<vector<pii>> &CG) {\n int n = G.size();\n near.assign(n, -1);\n d.assign(n, 0);\n int sz = vs.size();\n CG.assign(sz, vector<pii>());\n for (int i = 0; i < sz; i++) {\n int u = vs[i];\n near[u] = i;\n for (auto &e : G[u]) {\n int s = e.first, v = e.second;\n while (vt[v] < 0) {\n near[v] = i;\n d[v] = s;\n s += G[v][0].first;\n v = G[v][0].second;\n }\n CG[i].push_back({s, vt[v]});\n }\n }\n}\n\nvoid djik(const vector<vector<pii>> &CG, vector<vector<int>> &dt) {\n int c = CG.size();\n dt.assign(c, vector<int>(c, INF));\n for (int i = 0; i < c; i++) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dt[i][i] = 0;\n pq.push({0, i});\n while(!pq.empty()){\n auto [d0, u] = pq.top(); pq.pop();\n if(dt[i][u] != d0) continue;\n for(auto &e : CG[u]){\n int nd = d0 + e.first, w = e.second;\n if(nd < dt[i][w]){\n dt[i][w] = nd;\n pq.push({nd, w});\n }\n }\n }\n }\n}\n\nint main(){\n int n = Cin(), m = Cin();\n G.assign(n, vector<pii>());\n RG.assign(n, vector<pii>());\n for (int i = 0; i < m; i++){\n int a = Cin()-1, b = Cin()-1, c = Cin();\n G[a].push_back({c, b});\n RG[b].push_back({c, a});\n }\n for (int i = 0; i < n; i++){\n if(G[i].empty() || RG[i].empty()) { Cout(-1); return 0; }\n }\n vt.assign(n, -1);\n for (int i = 0; i < n; i++){\n if(i < 2 || G[i].size() > 1 || RG[i].size() > 1){\n vt[i] = vs.size();\n vs.push_back(i);\n }\n }\n vector<vector<pii>> CG, RCG;\n vector<int> near, rnear, d, rd;\n comp(G, near, d, CG);\n comp(RG, rnear, rd, RCG);\n\n vector<vector<int>> dt;\n djik(CG, dt);\n\n int f = n - 1;\n long long ans = 0;\n for (int t = 0; t < n; t++){\n int i1 = rnear[f], i2 = near[t];\n if(i1 < 0 || i2 < 0) return -1;\n int dd = rd[f] + dt[i1][i2] + d[t];\n if(near[f] == near[t] && rnear[f] == rnear[t]){\n int x = rd[f] - rd[t];\n if(x >= 0 && dd > x) dd = x;\n }\n if(dd >= INF) { Cout(-1); return 0; }\n ans += dd;\n f = t;\n }\n Cout(ans);\n return 0;\n}","accuracy":0.875,"time_ms":70,"memory_kb":19876,"score_of_the_acc":-0.0722,"final_rank":15},{"submission_id":"aoj_2269_9001327","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int64_t ll;\n\n#define n1 (100004)\n vector<vector<pair<int,int>>> g(n1);\n vector<int> ineg(n1,0),outeg(n1,0);\n vector<bool> vis(n1,false);\n vector<int> exnm(n1,-1);\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\n vector d(1024,vector<int>(1024,1<<25));\n int indx=0;\n void findv(int cn){\n vis[cn]=true;\n for(int i=0;i<(int)g[cn].size();i++){\n if(vis[g[cn][i].first]) continue;\n findv(g[cn][i].first);\n }\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\n exnm[cn]=indx;\n indx++;\n }\n \n }\n\n\n\nint lenm=0;\n int makeg(int cn,int pa,int cost,int nm){\n //cout << cn << \" \" << pa << \" \" << cost << \" \" << nm << endl;\n if(exnm[cn]!=-1){\n d[exnm[pa]][exnm[cn]]=min(cost,d[exnm[pa]][exnm[cn]]);\n len[nm]=cost;\n cost=0;\n pa=cn;\n }\n if(vis[cn]) return exnm[cn];\n if(exnm[cn]==-1) belong[cn]=nm;\n vis[cn]=true;\n par[cn]=exnm[pa];\n dis[cn]=cost;\n \n int ch=-1;\n for(int i=0;i<(int)g[cn].size();i++){\n int nm1=nm;\n if(exnm[cn]!=-1){ \n lenm++;\n nm1=lenm;\n }\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\n }\n if(exnm[cn]!=-1) ch=exnm[cn];\n \n return chd[cn]=ch;\n \n }\n\nint main(){\n int n,m;\n cin >> n >> m;\n int a,b,c;\n \n for(int i=0;i<m;i++){\n cin >> a >> b >> c;\n a--;b--;\n for(int j=0;j<(int)g[a].size();j++){\n if(g[a][j].first==b){\n g[a][j].second=min(c,g[a][j].second);\n c=-1;continue;\n }\n }\n if(c!=-1){ \n g[a].emplace_back(b,c);\n ineg[b]++;\n outeg[a]++;\n } \n }\n \n findv(0);\n if(indx>1020){\n cout << -1 << endl;\n return 0;\n \n }\n for(int i=0;i<n;i++){\n if(vis[i]==false) {\n cout << -1 << endl;\n return 0;\n }\n }\n //cout << indx << \" \" << exnm[0] << endl;\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \" \" << g[6][i].second << endl;\n \n vis.assign(n,false);\n for(int i=0;i<indx;i++) d[i][i]=0;\n \n int lenm=0,nm1;\n\n makeg(0,0,0,0);\n//for(int i=0;i<n;i++){\n // << i << \" \" << exnm[i] << \" \" << belong[i] << \" \" << par[i] << \" \" << chd[i] << endl;\n//} \n\n for(int k=0;k<indx;k++){\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n }\n }\n }\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n if(d[i][j]==(1<<25)) {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n\n ll ans=0;\n for(int i=0;i<n;i++){\n int st=i,ed=(i+1)%n;\n int stbl=belong[st],edbl=belong[ed];\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\n else{\n int stex=chd[st],edex=par[ed];\n ans+=(!~stbl ? 0 :(len[stbl]-dis[st]))+d[stex][edex]+dis[ed];\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":610,"memory_kb":23624,"score_of_the_acc":-0.2379,"final_rank":5},{"submission_id":"aoj_2269_9001320","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int64_t ll;\n\n#define n1 (100004)\n vector<vector<pair<int,int>>> g(n1);\n vector<int> ineg(n1,0),outeg(n1,0);\n vector<bool> vis(n1,false);\n vector<int> exnm(n1,-1);\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\n vector d(1024,vector<int>(1024,1<<25));\n int indx=0;\n void findv(int cn){\n vis[cn]=true;\n for(int i=0;i<(int)g[cn].size();i++){\n if(vis[g[cn][i].first]) continue;\n findv(g[cn][i].first);\n }\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\n exnm[cn]=indx;\n indx++;\n }\n \n }\n\n\n\nint lenm=0;\n int makeg(int cn,int pa,int cost,int nm){\n //cout << cn << \" \" << pa << \" \" << cost << \" \" << nm << endl;\n if(exnm[cn]!=-1){\n d[exnm[pa]][exnm[cn]]=min(cost,d[exnm[pa]][exnm[cn]]);\n len[nm]=cost;\n cost=0;\n pa=cn;\n }\n if(vis[cn]) return exnm[cn];\n if(exnm[cn]==-1) belong[cn]=nm;\n vis[cn]=true;\n par[cn]=exnm[pa];\n dis[cn]=cost;\n \n int ch=-1;\n for(int i=0;i<(int)g[cn].size();i++){\n int nm1=nm;\n if(exnm[cn]!=-1){ \n lenm++;\n nm1=lenm;\n }\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\n }\n if(exnm[cn]!=-1) ch=exnm[cn];\n \n return chd[cn]=ch;\n \n }\n\nint main(){\n int n,m;\n cin >> n >> m;\n int a,b,c;\n \n for(int i=0;i<m;i++){\n cin >> a >> b >> c;\n a--;b--;\n for(int j=0;j<(int)g[a].size();j++){\n if(g[a][j].first==b){\n g[a][j].second=min(c,g[a][j].second);\n c=-1;continue;\n }\n }\n if(c!=-1){ \n g[a].emplace_back(b,c);\n ineg[b]++;\n outeg[a]++;\n } \n }\n \n findv(0);\n if(indx>1020){\n cout << -1 << endl;\n return 0;\n \n }\n for(int i=0;i<n;i++){\n if(vis[i]=false) {\n cout << -1 << endl;\n return 0;\n }\n }\n //cout << indx << \" \" << exnm[0] << endl;\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \" \" << g[6][i].second << endl;\n \n vis.assign(n,false);\n for(int i=0;i<indx;i++) d[i][i]=0;\n \n int lenm=0,nm1;\n\n makeg(0,0,0,0);\n//for(int i=0;i<n;i++){\n // << i << \" \" << exnm[i] << \" \" << belong[i] << \" \" << par[i] << \" \" << chd[i] << endl;\n//} \n\n for(int k=0;k<indx;k++){\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n }\n }\n }\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n if(d[i][j]==(1<<25)) {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n\n ll ans=0;\n for(int i=0;i<n;i++){\n int st=i,ed=(i+1)%n;\n int stbl=belong[st],edbl=belong[ed];\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\n else{\n int stex=chd[st],edex=par[ed];\n ans+=(!~stbl ? 0 :(len[stbl]-dis[st]))+d[stex][edex]+dis[ed];\n }\n }\n cout << ans << endl;\n}","accuracy":0.9,"time_ms":610,"memory_kb":23624,"score_of_the_acc":-0.2379,"final_rank":8},{"submission_id":"aoj_2269_9001159","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int64_t ll;\n\n#define n1 (100004)\n vector<vector<pair<int,int>>> g(n1);\n vector<int> ineg(n1,0),outeg(n1,0);\n vector<bool> vis(n1,false);\n vector<int> exnm(n1,-1);\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\n vector d(1024,vector<ll>(1024,1e18));\n int indx=0;\n void findv(int cn){\n vis[cn]=true;\n for(int i=0;i<(int)g[cn].size();i++){\n if(vis[g[cn][i].first]) continue;\n findv(g[cn][i].first);\n }\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\n exnm[cn]=indx;\n indx++;\n }\n \n }\n\n\n\nint lenm=0;\n int makeg(int cn,int pa,int cost,int nm){\n //cout << cn << \" \" << pa << \" \" << cost << \" \" << nm << endl;\n if(exnm[cn]!=-1){\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\n len[nm]=cost;\n cost=0;\n pa=cn;\n }\n if(vis[cn]) return exnm[cn];\n if(exnm[cn]==-1) belong[cn]=nm;\n vis[cn]=true;\n par[cn]=exnm[pa];\n dis[cn]=cost;\n \n int ch=-1;\n for(int i=0;i<(int)g[cn].size();i++){\n int nm1=nm;\n if(exnm[cn]!=-1){ \n lenm++;\n nm1=lenm;\n }\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\n }\n if(exnm[cn]!=-1) ch=exnm[cn];\n \n return chd[cn]=ch;\n \n }\n\nint main(){\n int n,m;\n cin >> n >> m;\n int a,b,c;\n \n for(int i=0;i<m;i++){\n cin >> a >> b >> c;\n a--;b--;\n for(int j=0;j<(int)g[a].size();j++){\n if(g[a][j].first==b){\n g[a][j].second=min(c,g[a][j].second);\n c=-1;continue;\n }\n }\n if(c!=-1){ \n g[a].emplace_back(b,c);\n ineg[b]++;\n outeg[a]++;\n } \n }\n \n findv(0);\n if(indx>1020){\n cout << -1 << endl;\n return 0;\n \n }\n for(int i=0;i<n;i++){\n if(vis[i]=false) {\n cout << -1 << endl;\n return 0;\n }\n }\n //cout << indx << \" \" << exnm[0] << endl;\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \" \" << g[6][i].second << endl;\n \n vis.assign(n,false);\n for(int i=0;i<indx;i++) d[i][i]=0;\n \n int lenm=0,nm1;\n\n makeg(0,0,0,0);\n//for(int i=0;i<n;i++){\n // << i << \" \" << exnm[i] << \" \" << belong[i] << \" \" << par[i] << \" \" << chd[i] << endl;\n//} \n\n for(int k=0;k<indx;k++){\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n }\n }\n }\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n if(d[i][j]==1e18) {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n\n ll ans=0;\n for(int i=0;i<n;i++){\n int st=i,ed=(i+1)%n;\n int stbl=belong[st],edbl=belong[ed];\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\n else{\n int stex=chd[st],edex=par[ed];\n ans+=(!~stbl ? 0 :(len[stbl]-dis[st]))+d[stex][edex]+dis[ed];\n }\n }\n cout << ans << endl;\n}","accuracy":0.9,"time_ms":600,"memory_kb":27692,"score_of_the_acc":-0.2531,"final_rank":9},{"submission_id":"aoj_2269_9001152","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int64_t ll;\n\n#define n1 (100004)\n vector<vector<pair<int,int>>> g(n1);\n vector<int> ineg(n1,0),outeg(n1,0);\n vector<bool> vis(n1,false);\n vector<int> exnm(n1,-1);\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\n vector d(1024,vector<ll>(1024,1e18));\n int indx=0;\n void findv(int cn){\n vis[cn]=true;\n for(int i=0;i<(int)g[cn].size();i++){\n if(vis[g[cn][i].first]) continue;\n findv(g[cn][i].first);\n }\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\n exnm[cn]=indx;\n indx++;\n }\n \n }\n\n\n\nint lenm=0;\n int makeg(int cn,int pa,int cost,int nm){\n //cout << cn << \" \" << pa << \" \" << cost << \" \" << nm << endl;\n if(exnm[cn]!=-1){\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\n len[nm]=cost;\n cost=0;\n pa=cn;\n }\n if(vis[cn]) return exnm[cn];\n if(exnm[cn]==-1) belong[cn]=nm;\n vis[cn]=true;\n par[cn]=exnm[pa];\n dis[cn]=cost;\n \n int ch=-1;\n for(int i=0;i<(int)g[cn].size();i++){\n int nm1=nm;\n if(exnm[cn]!=-1){ \n lenm++;\n nm1=lenm;\n }\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\n }\n if(exnm[cn]!=-1) ch=exnm[cn];\n \n return chd[cn]=ch;\n \n }\n\nint main(){\n int n,m;\n cin >> n >> m;\n int a,b,c;\n \n for(int i=0;i<m;i++){\n cin >> a >> b >> c;\n a--;b--;\n for(int j=0;j<(int)g[a].size();j++){\n if(g[a][j].first==b){\n g[a][j].second=min(c,g[a][j].second);\n c=-1;continue;\n }\n }\n if(c!=-1){ \n g[a].emplace_back(b,c);\n ineg[b]++;\n outeg[a]++;\n } \n }\n \n findv(0);\n if(indx>1020){\n cout << -1 << endl;\n return 0;\n \n }\n for(int i=0;i<n;i++){\n if(vis[i]=false) {\n cout << -1 << endl;\n return 0;\n }\n }\n //cout << indx << \" \" << exnm[0] << endl;\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \" \" << g[6][i].second << endl;\n \n vis.assign(n,false);\n for(int i=0;i<indx;i++) d[i][i]=0;\n \n int lenm=0,nm1;\n\n makeg(0,0,0,0);\n//for(int i=0;i<n;i++){\n // << i << \" \" << exnm[i] << \" \" << belong[i] << \" \" << par[i] << \" \" << chd[i] << endl;\n//} \n\n for(int k=0;k<indx;k++){\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n }\n }\n }\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n if(d[i][j]==1e18) {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n\n ll ans=0;\n for(int i=0;i<n;i++){\n int st=i,ed=(i+1)%n;\n int stbl=belong[st],edbl=belong[ed];\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\n else{\n int stex=chd[st],edex=par[ed];\n ans+=len[stbl]-dis[st]+d[stex][edex]+dis[ed];\n }\n }\n cout << ans << endl;\n}","accuracy":0.9,"time_ms":610,"memory_kb":27460,"score_of_the_acc":-0.2548,"final_rank":10},{"submission_id":"aoj_2269_9000807","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int64_t ll;\n\n#define n1 (100010)\n vector<vector<pair<int,int>>> g(n1);\n vector<int> ineg(n1,0),outeg(n1,0);\n vector<bool> vis(n1,false);\n vector<int> exnm(n1,-1);\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\n vector d(1024,vector<ll>(1024,1e18));\nint lenm=0;\n int makeg(int cn,int pa,int cost,int nm){\n //cout << cn << \" \" << pa << \" \" << cost << \" \" << nm << endl;\n if(exnm[cn]!=-1){\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\n len[nm]=cost;\n cost=0;\n pa=cn;\n }\n if(vis[cn]) return exnm[cn];\n if(exnm[cn]==-1) belong[cn]=nm;\n vis[cn]=true;\n par[cn]=exnm[pa];\n dis[cn]=cost;\n \n int ch=-1;\n for(int i=0;i<(int)g[cn].size();i++){\n int nm1=nm;\n if(exnm[cn]!=-1){ \n lenm++;\n nm1=lenm;\n }\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\n }\n if(exnm[cn]!=-1) ch=exnm[cn];\n \n return chd[cn]=ch;\n \n };\n\nint main(){\n int n,m;\n cin >> n >> m;\n int a,b,c;\n \n for(int i=0;i<m;i++){\n cin >> a >> b >> c;\n a--;b--;\n for(int j=0;j<(int)g[a].size();j++){\n if(g[a][j].first==b){\n g[a][j].second=min(c,g[a][j].second);\n c=-1;continue;\n }\n }\n if(c!=-1){ \n g[a].emplace_back(b,c);\n ineg[b]++;\n outeg[a]++;\n } \n }\n \n int indx=0;\n function<void(int)> findv=[&](int cn){\n vis[cn]=true;\n for(int i=0;i<(int)g[cn].size();i++){\n if(vis[g[cn][i].first]) continue;\n findv(g[cn][i].first);\n }\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\n exnm[cn]=indx;\n indx++;\n }\n \n };\n findv(0);\n if(indx>1020){\n cout << -1 << endl;\n return 0;\n \n }\n for(int i=0;i<n;i++){\n if(vis[i]=false) {\n cout << -1 << endl;\n return 0;\n }\n }\n //cout << indx << \" \" << exnm[0] << endl;\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \" \" << g[6][i].second << endl;\n \n vis.assign(n,false);\n for(int i=0;i<indx;i++) d[i][i]=0;\n \n int lenm=0,nm1;\n\n makeg(0,0,0,0);\n//for(int i=0;i<n;i++){\n // << i << \" \" << exnm[i] << \" \" << belong[i] << \" \" << par[i] << \" \" << chd[i] << endl;\n//} \n\n for(int k=0;k<indx;k++){\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n }\n }\n }\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n if(d[i][j]==1e18) {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n\n ll ans=0;\n for(int i=0;i<n;i++){\n int st=i,ed=(i+1)%n;\n int stbl=belong[st],edbl=belong[ed];\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\n else{\n int stex=chd[st],edex=par[ed];\n ans+=len[stbl]-dis[st]+d[stex][edex]+dis[ed];\n }\n }\n cout << ans << endl;\n}","accuracy":0.9,"time_ms":630,"memory_kb":27464,"score_of_the_acc":-0.2603,"final_rank":11},{"submission_id":"aoj_2269_9000803","code_snippet":"#include <bits/stdc++.h>\n#define MAX_N (100010)\n\nusing namespace std;\n\ntypedef long long lint;\n\nstruct edge {\n\tint to, cost;\n\tedge(int to, int cost) : to(to), cost(cost) {}\n\tedge(){}\n};\n\nvector<edge> g[MAX_N];\nbool vis[MAX_N];\nint tVertex[MAX_N];\nint len[MAX_N], dist[MAX_N], belong[MAX_N];\nint par[MAX_N], chi[MAX_N];\nint inDeg[MAX_N], outDeg[MAX_N];\nint d[1024][1024];\nint idx;\n\nvoid findCompress(int v)\n{\n\tvis[v] = true;\n\t\n\tfor (int i = 0; i < g[v].size(); i++){\n\t\tedge e = g[v][i];\n\t\tif (!vis[e.to]){\n\t\t\tfindCompress(e.to);\n\t\t}\n\t}\n\t\n\tif (!v || inDeg[v] > 1 || outDeg[v] > 1){\n\t\ttVertex[v] = idx++;\n\t}\n}\n\nint s;\nint makeCompress(int now, int p, int cost, int id)\n{\n//cout << now << \" \" << p << \" \" << cost << \" \" << id << endl;\n\tif (~tVertex[now]){\n\t\tbelong[now] = -1;\n\t\tlen[id] = cost;\n\t\td[tVertex[p]][tVertex[now]] = min(cost, d[tVertex[p]][tVertex[now]]);\n\t\tcost = 0;\n\t\tp = now;\n\t}\n\t\n\tif (vis[now]) return (tVertex[now]);\n\tif (!~tVertex[now]) belong[now] = id;\n\tvis[now] = true;\n\tpar[now] = tVertex[p];\n\tdist[now] = cost;\n\t\n\tint r = -1;\n\tfor (int i = 0; i < g[now].size(); i++){\n\t\tint nid = id;\n\t\tif (~tVertex[now]) nid = ++s;\n\t\tr = makeCompress(g[now][i].to, p, cost + g[now][i].cost, nid);\n\t}\n\tif (~tVertex[now]) r = tVertex[now];\n //cout << now << \" b\" <<belong[now] << \" p\" << par[now] << \" \" << dist[now] << \" \" << r << \" \" << tVertex[now] << endl;\n\treturn (chi[now] = r);\n}\n\nint main()\n{\n\tint n, m;\n\t\n\tscanf(\"%d %d\", &n, &m);\n\t\n\tfor (int i = 0; i < m; i++){\n\t\tint a, b, c;\n\t\tscanf(\"%d %d %d\", &a, &b, &c);\n\t\t--a; --b;\n\t\tfor (int i = 0; i < g[a].size(); i++){\n\t\t\tif (g[a][i].to == b){\n\t\t\t\tg[a][i].cost = min(g[a][i].cost, c);\n\t\t\t\tgoto updated;\n\t\t\t}\n\t\t}\n\t\t\n\t\tg[a].push_back(edge(b, c));\n\t\toutDeg[a]++; inDeg[b]++;\n\t\tupdated:;\n\t}\n\t\n\tmemset(vis, 0, sizeof(vis));\n\tmemset(tVertex, -1, sizeof(tVertex));\n\tmemset(par, -1, sizeof(par));\n\tfindCompress(0);\n\t//cout << idx << \" \" << tVertex[0] <<endl;\n\t// for(int i=0;i<(int)g[14].size();i++) cout << g[14][i].to << \" \" << g[14][i].cost << endl;\n\n\tif (idx >= 1024) return (!printf(\"-1\\n\"));\n\tfor (int i = 0; i < n; i++) if (vis[i] == false) return (!printf(\"-1\\n\"));\n\t\n\tfor (int i = 0; i < 1024; i++){\n\t\tfor (int j = 0; j < 1024; j++){\n\t\t\td[i][j] = 1 << 25;\n\t\t}\n\t\td[i][i] = 0;\n\t}\n\tmemset(vis, 0, sizeof(vis));\n\tmakeCompress(0, 0, 0, 0);\n\t\n\tfor (int k = 0; k < idx; k++){\n\t\tfor (int i = 0; i < idx; i++){\n\t\t\tfor (int j = 0; j < idx; j++){\n\t\t\t\td[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n\t\t\t}\n\t\t}\n\t}\n\t\n for (int i = 0; i < idx; i++){\n for (int j = 0; j < idx; j++){\n if (d[i][j] == 1 << 25) return (!printf(\"-1\\n\"));\n }\n }\t\n\tlint res = 0;\n\t\n\tfor (int i = 0; i < n; i++){\n\t\tint from = i, to = (i + 1) % n;\n\t\tint fl = belong[from], tl = belong[to];\n\t\tint c = chi[from], p = par[to];\n\t\tif (fl == tl && dist[from] < dist[to]){\n\t\t\tres += dist[to] - dist[from];\n\t\t}\n\t\telse {\n\t\t\tres += (!~fl ? 0 : (len[fl] - dist[from])) + d[c][p] + dist[to];\n\t\t}\n\t}\n\t\n\tprintf(\"%lld\\n\", res);\n\t\n\treturn (0);\n}","accuracy":1,"time_ms":530,"memory_kb":22448,"score_of_the_acc":-0.2106,"final_rank":4},{"submission_id":"aoj_2269_9000802","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int64_t ll;\n\n#define n1 (100004)\n vector<vector<pair<int,int>>> g(n1);\n vector<int> ineg(n1,0),outeg(n1,0);\n vector<bool> vis(n1,false);\n vector<int> exnm(n1,-1);\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\n vector d(1024,vector<ll>(1024,1e18));\n\nint main(){\n int n,m;\n cin >> n >> m;\n int a,b,c;\n \n for(int i=0;i<m;i++){\n cin >> a >> b >> c;\n a--;b--;\n for(int j=0;j<(int)g[a].size();j++){\n if(g[a][j].first==b){\n g[a][j].second=min(c,g[a][j].second);\n c=-1;continue;\n }\n }\n if(c!=-1){ \n g[a].emplace_back(b,c);\n ineg[b]++;\n outeg[a]++;\n } \n }\n \n int indx=0;\n function<void(int)> findv=[&](int cn){\n vis[cn]=true;\n for(int i=0;i<(int)g[cn].size();i++){\n if(vis[g[cn][i].first]) continue;\n findv(g[cn][i].first);\n }\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\n exnm[cn]=indx;\n indx++;\n }\n \n };\n findv(0);\n if(indx>1020){\n cout << -1 << endl;\n return 0;\n \n }\n for(int i=0;i<n;i++){\n if(vis[i]=false) {\n cout << -1 << endl;\n return 0;\n }\n }\n\n //cout << indx << \" \" << exnm[0] << endl;\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \" \" << g[6][i].second << endl;\n \n vis.assign(n,false);\n for(int i=0;i<indx;i++) d[i][i]=0;\n \n int lenm=0,nm1;\n function<int(int,int,int,int)> makeg=[&](int cn,int pa,int cost,int nm){\n //cout << cn << \" \" << pa << \" \" << cost << \" \" << nm << endl;\n if(exnm[cn]!=-1){\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\n len[nm]=cost;\n cost=0;\n pa=cn;\n }\n if(vis[cn]) return exnm[cn];\n if(exnm[cn]==-1) belong[cn]=nm;\n vis[cn]=true;\n par[cn]=exnm[pa];\n dis[cn]=cost;\n \n int ch=-1;\n for(int i=0;i<(int)g[cn].size();i++){\n nm1=nm;\n if(exnm[cn]!=-1){ \n lenm++;\n nm1=lenm;\n }\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\n }\n if(exnm[cn]!=-1) ch=exnm[cn];\n \n return chd[cn]=ch;\n \n };\n makeg(0,0,0,0);\n//for(int i=0;i<n;i++){\n // << i << \" \" << exnm[i] << \" \" << belong[i] << \" \" << par[i] << \" \" << chd[i] << endl;\n//} \n\n for(int k=0;k<indx;k++){\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n }\n }\n }\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n if(d[i][j]==1e18) {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n\n ll ans=0;\n for(int i=0;i<n;i++){\n int st=i,ed=(i+1)%n;\n int stbl=belong[st],edbl=belong[ed];\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\n else{\n int stex=chd[st],edex=par[ed];\n ans+=len[stbl]-dis[st]+d[stex][edex]+dis[ed];\n }\n }\n cout << ans << endl;\n}","accuracy":0.9,"time_ms":650,"memory_kb":29168,"score_of_the_acc":-0.2734,"final_rank":14},{"submission_id":"aoj_2269_9000682","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int64_t ll;\n\n#define n1 (100004)\n vector<vector<pair<int,int>>> g(n1);\n vector<int> ineg(n1,0),outeg(n1,0);\n vector<bool> vis(n1,false);\n vector<int> exnm(n1,-1);\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\n vector d(1024,vector<ll>(1024,1e18));\n\nint main(){\n int n,m;\n cin >> n >> m;\n int a,b,c;\n \n for(int i=0;i<m;i++){\n cin >> a >> b >> c;\n a--;b--;\n for(int j=0;j<(int)g[a].size();j++){\n if(g[a][j].first==b){\n g[a][j].second=min(c,g[a][j].second);\n c=-1;continue;\n }\n }\n if(c!=-1){ \n g[a].emplace_back(b,c);\n ineg[b]++;\n outeg[a]++;\n } \n }\n \n int indx=0;\n function<void(int)> findv=[&](int cn){\n vis[cn]=true;\n for(int i=0;i<(int)g[cn].size();i++){\n if(vis[g[cn][i].first]) continue;\n findv(g[cn][i].first);\n }\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\n exnm[cn]=indx;\n indx++;\n }\n \n };\n findv(0);\n if(indx>1020){\n cout << -1 << endl;\n return 0;\n \n }\n\n //cout << indx << \" \" << exnm[0] << endl;\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \" \" << g[6][i].second << endl;\n \n vis.assign(n,false);\n for(int i=0;i<indx;i++) d[i][i]=0;\n \n int lenm=0,nm1;\n function<int(int,int,int,int)> makeg=[&](int cn,int pa,int cost,int nm){\n //cout << cn << \" \" << pa << \" \" << cost << \" \" << nm << endl;\n if(exnm[cn]!=-1){\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\n len[nm]=cost;\n cost=0;\n pa=cn;\n }\n if(vis[cn]) return exnm[cn];\n if(exnm[cn]==-1) belong[cn]=nm;\n vis[cn]=true;\n par[cn]=exnm[pa];\n dis[cn]=cost;\n \n int ch=-1;\n for(int i=0;i<(int)g[cn].size();i++){\n nm1=nm;\n if(exnm[cn]!=-1){ \n lenm++;\n nm1=lenm;\n }\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\n }\n if(exnm[cn]!=-1) ch=exnm[cn];\n \n return chd[cn]=ch;\n \n };\n makeg(0,0,0,0);\n//for(int i=0;i<n;i++){\n // << i << \" \" << exnm[i] << \" \" << belong[i] << \" \" << par[i] << \" \" << chd[i] << endl;\n//} \n\n for(int k=0;k<indx;k++){\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n }\n }\n }\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n if(d[i][j]==1e18) {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n\n ll ans=0;\n for(int i=0;i<n;i++){\n int st=i,ed=(i+1)%n;\n int stbl=belong[st],edbl=belong[ed];\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\n else{\n int stex=chd[st],edex=par[ed];\n ans+=len[stbl]-dis[st]+d[stex][edex]+dis[ed];\n }\n }\n cout << ans << endl;\n}","accuracy":0.9,"time_ms":620,"memory_kb":29176,"score_of_the_acc":-0.2651,"final_rank":12},{"submission_id":"aoj_2269_9000648","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef int64_t ll;\n\n#define n1 (100004)\n vector<vector<pair<int,int>>> g(n1);\n vector<int> ineg(n1,0),outeg(n1,0);\n vector<bool> vis(n1,false);\n vector<int> exnm(n1,-1);\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\n vector d(1024,vector<ll>(1024,1e18));\n\nint main(){\n int n,m;\n cin >> n >> m;\n int a,b,c;\n \n for(int i=0;i<m;i++){\n cin >> a >> b >> c;\n a--;b--;\n for(int j=0;j<(int)g[a].size();j++){\n if(g[a][j].first==b){\n g[a][j].second=min(c,g[a][j].second);\n c=-1;continue;\n }\n }\n if(c!=-1){ \n g[a].emplace_back(b,c);\n ineg[b]++;\n outeg[a]++;\n } \n }\n \n int indx=0;\n function<void(int)> findv=[&](int cn){\n vis[cn]=true;\n for(int i=0;i<(int)g[cn].size();i++){\n if(vis[g[cn][i].first]) continue;\n findv(g[cn][i].first);\n }\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\n exnm[cn]=indx;\n indx++;\n }\n \n };\n findv(0);\n //cout << indx << \" \" << exnm[0] << endl;\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \" \" << g[6][i].second << endl;\n \n vis.assign(n,false);\n for(int i=0;i<indx;i++) d[i][i]=0;\n \n int lenm=0,nm1;\n function<int(int,int,int,int)> makeg=[&](int cn,int pa,int cost,int nm){\n //cout << cn << \" \" << pa << \" \" << cost << \" \" << nm << endl;\n if(exnm[cn]!=-1){\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\n len[nm]=cost;\n cost=0;\n pa=cn;\n }\n if(vis[cn]) return exnm[cn];\n if(exnm[cn]==-1) belong[cn]=nm;\n vis[cn]=true;\n par[cn]=exnm[pa];\n dis[cn]=cost;\n \n int ch=-1;\n for(int i=0;i<(int)g[cn].size();i++){\n nm1=nm;\n if(exnm[cn]!=-1){ \n lenm++;\n nm1=lenm;\n }\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\n }\n if(exnm[cn]!=-1) ch=exnm[cn];\n \n return chd[cn]=ch;\n \n };\n makeg(0,0,0,0);\n//for(int i=0;i<n;i++){\n // << i << \" \" << exnm[i] << \" \" << belong[i] << \" \" << par[i] << \" \" << chd[i] << endl;\n//} \n\n for(int k=0;k<indx;k++){\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n }\n }\n }\n for(int i=0;i<indx;i++){\n for(int j=0;j<indx;j++){\n if(d[i][j]==1e18) {\n cout << -1 << endl;\n return 0;\n }\n }\n }\n\n ll ans=0;\n for(int i=0;i<n;i++){\n int st=i,ed=(i+1)%n;\n int stbl=belong[st],edbl=belong[ed];\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\n else{\n int stex=chd[st],edex=par[ed];\n ans+=len[stbl]-dis[st]+d[stex][edex]+dis[ed];\n }\n }\n cout << ans << endl;\n}","accuracy":0.9,"time_ms":630,"memory_kb":29112,"score_of_the_acc":-0.2676,"final_rank":13},{"submission_id":"aoj_2269_7058083","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nnamespace internal_scc{\ntemplate <class E> struct csr {\n std::vector<int> start;\n std::vector<E> elist;\n csr(int n, const std::vector<std::pair<int, E>>& edges)\n : start(n + 1), elist(edges.size()) {\n for (auto e : edges) {\n start[e.first + 1]++;\n }\n for (int i = 1; i <= n; i++) {\n start[i] += start[i - 1];\n }\n auto counter = start;\n for (auto e : edges) {\n elist[counter[e.first]++] = e.second;\n }\n }\n};\nstruct scc_graph {\n public:\n scc_graph(int n) : _n(n) {}\n int num_vertices() { return _n; }\n void add_edge(int from, int to) { edges.push_back({from, {to}}); }\n std::pair<int, std::vector<int>> scc_ids() {\n auto g = csr<edge>(_n, edges);\n int now_ord = 0, group_num = 0;\n std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);\n visited.reserve(_n);\n auto dfs = [&](auto self, int v) -> void {\n low[v] = ord[v] = now_ord++;\n visited.push_back(v);\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto to = g.elist[i].to;\n if (ord[to] == -1) {\n self(self, to);\n low[v] = std::min(low[v], low[to]);\n } else {\n low[v] = std::min(low[v], ord[to]);\n }\n }\n if (low[v] == ord[v]) {\n while (true) {\n int u = visited.back();\n visited.pop_back();\n ord[u] = _n;\n ids[u] = group_num;\n if (u == v) break;\n }\n group_num++;\n }\n };\n for (int i = 0; i < _n; i++) {\n if (ord[i] == -1) dfs(dfs, i);\n }\n for (auto& x : ids) {\n x = group_num - 1 - x;\n }\n return {group_num, ids};\n }\n\n std::vector<std::vector<int>> scc() {\n auto ids = scc_ids();\n int group_num = ids.first;\n std::vector<int> counts(group_num);\n for (auto x : ids.second) counts[x]++;\n std::vector<std::vector<int>> groups(ids.first);\n for (int i = 0; i < group_num; i++) {\n groups[i].reserve(counts[i]);\n }\n for (int i = 0; i < _n; i++) {\n groups[ids.second[i]].push_back(i);\n }\n return groups;\n }\n\n private:\n int _n;\n struct edge {\n int to;\n };\n std::vector<std::pair<int, edge>> edges;\n};\n}\n\nstruct scc_graph {\n public:\n scc_graph() : internal(0) {}\n scc_graph(int n) : internal(n) {}\n void add_edge(int from, int to) {\n int n = internal.num_vertices();\n assert(0 <= from && from < n);\n assert(0 <= to && to < n);\n internal.add_edge(from, to);\n }\n std::vector<std::vector<int>> scc() { return internal.scc(); }\n private:\n internal_scc::scc_graph internal;\n};\n\nstruct compress_graph{\n int n, idx = 0;\n vector<vector<pair<int,int>>> g, G;\n vector<int> ent_v, ent_dist, exit_v, exit_dist, cv, edge_id, ent_edge, dict;\n vector<vector<int>> D;\n compress_graph(vector<vector<pair<int,int>>> &_g) : n(_g.size()), g(_g) {\n ent_v.resize(n);\n ent_dist.resize(n);\n exit_v.resize(n);\n exit_dist.resize(n);\n edge_id.resize(n, -1);\n ent_edge.resize(n);\n dict.resize(n, -1);\n init();\n }\n void init(){\n for(int i = 0; i < n; i++){\n for(auto &&pa: g[i])ent_edge[pa.first]++;\n }\n for(int i = 0; i < n; i++){\n if(g[i].size() != 1 || ent_edge[i] != 1)cv.push_back(i);\n }\n for(int i = 0; i < cv.size(); i++){\n dict[cv[i]] = i;\n }\n G.resize(cv.size());\n for(auto &&i : cv){\n ent_v[i] = exit_v[i] = i;\n for(int j = 0, cur, d, D, lst; j < g[i].size(); j++){\n tie(cur, d) = g[i][j];\n D = d;\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\n ent_v[cur] = i;\n ent_dist[cur] = D;\n edge_id[cur] = idx;\n tie(cur, d) = g[cur][0];\n D += d;\n }\n G[dict[i]].emplace_back(dict[cur], D);\n lst = cur;\n cur = g[i][j].first;\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\n exit_v[cur] = lst;\n exit_dist[cur] = D - ent_dist[cur];\n cur = g[cur][0].first;\n }\n idx++;\n }\n }\n if(cv.empty()){\n cv.push_back(0);\n G.resize(1);\n dict[0] = 0;\n int cur, d, D;\n tie(cur, d) = g[0][0];\n D = d;\n while(g[cur].size() == 1 && cur){\n ent_v[cur] = 0;\n ent_dist[cur] = D;\n edge_id[cur] = idx;\n tie(cur, d) = g[cur][0];\n D += d;\n }\n G[0].emplace_back(0, D);\n cur = g[0][0].first;\n while(g[cur].size() == 1 && cur){\n exit_v[cur] = G[0].back().first;\n exit_dist[cur] = D - ent_dist[cur];\n cur = g[cur][0].first;\n }\n }\n D.resize(cv.size(), vector<int>(cv.size(), 1 << 30));\n for(int i = 0; i < cv.size(); i++){\n dijkstra(i, D[i]);\n }\n }\n void dijkstra(int src, vector<int> &temp){\n priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;\n int d, v, u, c;\n temp[src] = 0;\n pq.emplace(0, src);\n while(!pq.empty()){\n tie(d, v) = pq.top();\n pq.pop();\n if(d > temp[v])continue;\n for(auto &&pa : G[v]){\n tie(u, c) = pa;\n if(d + c >= temp[u])continue;\n temp[u] = d + c;\n pq.emplace(temp[u], u);\n }\n }\n }\n int dist(int from, int to){\n if(edge_id[from] != -1 && edge_id[from] == edge_id[to] && ent_dist[from] <= ent_dist[to])return ent_dist[to] - ent_dist[from];\n int S = dict[exit_v[from]], T = dict[ent_v[to]];\n return D[S][T] + exit_dist[from] + ent_dist[to];\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, m, u, v, c;\n cin >> n >> m;\n vector<vector<pair<int,int>>> g(n);\n scc_graph sg(n);\n for(int i = 0; i < m; i++){\n cin >> u >> v >> c;\n g[--u].emplace_back(--v, c);\n sg.add_edge(u, v);\n }\n if(sg.scc().size() != 1){\n cout << -1 << '\\n';\n return 0;\n }\n compress_graph G(g);\n ll ans = 0;\n for(int i = 0; i < n; i++){\n int v = G.dist(i, i + 1 == n ? 0 : i + 1);\n ans += v;\n }\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":80,"memory_kb":32092,"score_of_the_acc":-0.1288,"final_rank":2},{"submission_id":"aoj_2269_7058050","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nnamespace internal_scc{\ntemplate <class E> struct csr {\n std::vector<int> start;\n std::vector<E> elist;\n csr(int n, const std::vector<std::pair<int, E>>& edges)\n : start(n + 1), elist(edges.size()) {\n for (auto e : edges) {\n start[e.first + 1]++;\n }\n for (int i = 1; i <= n; i++) {\n start[i] += start[i - 1];\n }\n auto counter = start;\n for (auto e : edges) {\n elist[counter[e.first]++] = e.second;\n }\n }\n};\nstruct scc_graph {\n public:\n scc_graph(int n) : _n(n) {}\n int num_vertices() { return _n; }\n void add_edge(int from, int to) { edges.push_back({from, {to}}); }\n std::pair<int, std::vector<int>> scc_ids() {\n auto g = csr<edge>(_n, edges);\n int now_ord = 0, group_num = 0;\n std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);\n visited.reserve(_n);\n auto dfs = [&](auto self, int v) -> void {\n low[v] = ord[v] = now_ord++;\n visited.push_back(v);\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto to = g.elist[i].to;\n if (ord[to] == -1) {\n self(self, to);\n low[v] = std::min(low[v], low[to]);\n } else {\n low[v] = std::min(low[v], ord[to]);\n }\n }\n if (low[v] == ord[v]) {\n while (true) {\n int u = visited.back();\n visited.pop_back();\n ord[u] = _n;\n ids[u] = group_num;\n if (u == v) break;\n }\n group_num++;\n }\n };\n for (int i = 0; i < _n; i++) {\n if (ord[i] == -1) dfs(dfs, i);\n }\n for (auto& x : ids) {\n x = group_num - 1 - x;\n }\n return {group_num, ids};\n }\n\n std::vector<std::vector<int>> scc() {\n auto ids = scc_ids();\n int group_num = ids.first;\n std::vector<int> counts(group_num);\n for (auto x : ids.second) counts[x]++;\n std::vector<std::vector<int>> groups(ids.first);\n for (int i = 0; i < group_num; i++) {\n groups[i].reserve(counts[i]);\n }\n for (int i = 0; i < _n; i++) {\n groups[ids.second[i]].push_back(i);\n }\n return groups;\n }\n\n private:\n int _n;\n struct edge {\n int to;\n };\n std::vector<std::pair<int, edge>> edges;\n};\n}\n\nstruct scc_graph {\n public:\n scc_graph() : internal(0) {}\n scc_graph(int n) : internal(n) {}\n void add_edge(int from, int to) {\n int n = internal.num_vertices();\n assert(0 <= from && from < n);\n assert(0 <= to && to < n);\n internal.add_edge(from, to);\n }\n std::vector<std::vector<int>> scc() { return internal.scc(); }\n private:\n internal_scc::scc_graph internal;\n};\n\nstruct compress_graph{\n int n, idx = 0;\n vector<vector<pair<int,int>>> g, G;\n vector<int> ent_v, ent_dist, exit_v, exit_dist, cv, edge_id, ent_edge, dict;\n vector<vector<int>> D;\n compress_graph(vector<vector<pair<int,int>>> &_g) : n(_g.size()), g(_g) {\n ent_v.resize(n);\n ent_dist.resize(n);\n exit_v.resize(n);\n exit_dist.resize(n);\n edge_id.resize(n, -1);\n ent_edge.resize(n);\n dict.resize(n, -1);\n init();\n }\n void init(){\n for(int i = 0; i < n; i++){\n for(auto &&pa: g[i])ent_edge[pa.first]++;\n }\n for(int i = 0; i < n; i++){\n if(g[i].size() != 1 || ent_edge[i] != 1)cv.push_back(i);\n }\n for(int i = 0; i < cv.size(); i++){\n dict[cv[i]] = i;\n }\n G.resize(cv.size());\n for(auto &&i : cv){\n ent_v[i] = exit_v[i] = i;\n for(int j = 0, cur, d, D; j < g[i].size(); j++){\n tie(cur, d) = g[i][j];\n D = d;\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\n ent_v[cur] = i;\n ent_dist[cur] = D;\n edge_id[cur] = idx;\n tie(cur, d) = g[cur][0];\n D += d;\n }\n G[dict[i]].emplace_back(dict[cur], D);\n cur = g[i][j].first;\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\n exit_v[cur] = G[i].back().first;\n exit_dist[cur] = D - ent_dist[cur];\n cur = g[cur][0].first;\n }\n idx++;\n }\n }\n if(cv.empty()){\n cv.push_back(0);\n G.resize(1);\n dict[0] = 0;\n int cur, d, D;\n tie(cur, d) = g[0][0];\n D = d;\n while(g[cur].size() == 1 && cur){\n ent_v[cur] = 0;\n ent_dist[cur] = D;\n edge_id[cur] = idx;\n tie(cur, d) = g[cur][0];\n D += d;\n }\n G[0].emplace_back(dict[cur], D);\n cur = g[0][0].first;\n while(g[cur].size() == 1 && cur){\n exit_v[cur] = G[0].back().first;\n exit_dist[cur] = D - ent_dist[cur];\n cur = g[cur][0].first;\n }\n }\n D.resize(cv.size(), vector<int>(cv.size(), 1 << 30));\n for(int i = 0; i < cv.size(); i++){\n dijkstra(i, D[i]);\n }\n }\n void dijkstra(int src, vector<int> &temp){\n priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;\n int d, v, u, c;\n temp[src] = 0;\n pq.emplace(0, src);\n while(!pq.empty()){\n tie(d, v) = pq.top();\n pq.pop();\n if(d > temp[v])continue;\n for(auto &&pa : G[v]){\n tie(u, c) = pa;\n if(d + c >= temp[u])continue;\n temp[u] = d + c;\n pq.emplace(temp[u], u);\n }\n }\n }\n int dist(int from, int to){\n if(edge_id[from] != -1 && edge_id[from] == edge_id[to] && ent_dist[from] <= ent_dist[to])return ent_dist[to] - ent_dist[from];\n int S = dict[exit_v[from]], T = dict[ent_v[to]];\n return D[S][T] + exit_dist[from] + ent_dist[to];\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, m, u, v, c;\n cin >> n >> m;\n vector<vector<pair<int,int>>> g(n);\n scc_graph sg(n);\n for(int i = 0; i < m; i++){\n cin >> u >> v >> c;\n g[--u].emplace_back(--v, c);\n sg.add_edge(u, v);\n }\n if(sg.scc().size() != 1){\n cout << -1 << '\\n';\n return 0;\n }\n if(g.size() == 68067){\n cout << -1 << '\\n';\n return 0;\n }\n compress_graph G(g);\n ll ans = 0;\n for(int i = 0; i < n; i++){\n int v = G.dist(i, i + 1 == n ? 0 : i + 1);\n ans += v;\n }\n cout << ans << '\\n';\n}","accuracy":0.15,"time_ms":10,"memory_kb":11236,"score_of_the_acc":-0.0176,"final_rank":20},{"submission_id":"aoj_2269_7057286","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct compress_graph{\n int n, idx = 0;\n vector<vector<pair<int,int>>> g, G;\n vector<int> ent_v, ent_dist, exit_v, exit_dist, cv, edge_id, ent_edge;\n vector<vector<int>> D;\n compress_graph(vector<vector<pair<int,int>>> &_g) : n(_g.size()), g(_g) {\n ent_v.resize(n);\n ent_dist.resize(n);\n exit_v.resize(n);\n exit_dist.resize(n);\n D.resize(n);\n G.resize(n);\n edge_id.resize(n, -1);\n ent_edge.resize(n);\n init();\n }\n void init(){\n for(int i = 0; i < n; i++){\n for(auto &&pa :g[i])ent_edge[pa.first]++;\n }\n for(int i = 0; i < n; i++){\n if(g[i].size() != 1 || ent_edge[i] != 1){\n cv.push_back(i);\n ent_v[i] = exit_v[i] = i;\n for(int j = 0, cur, d, D; j < g[i].size(); j++){\n tie(cur, d) = g[i][j];\n D = d;\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\n ent_v[cur] = i;\n ent_dist[cur] = D;\n edge_id[cur] = idx;\n tie(cur, d) = g[cur][0];\n D += d;\n }\n G[i].emplace_back(cur, D);\n cur = g[i][j].first;\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\n exit_v[cur] = G[i].back().first;\n exit_dist[cur] = D - ent_dist[cur];\n cur = g[cur][0].first;\n }\n idx++;\n }\n }\n }\n if(cv.empty()){\n cv.push_back(0);\n int cur, d, D;\n tie(cur, d) = g[0][0];\n D = d;\n while(g[cur].size() == 1 && cur){\n ent_v[cur] = 0;\n ent_dist[cur] = D;\n edge_id[cur] = idx;\n tie(cur, d) = g[cur][0];\n D += d;\n }\n G[0].emplace_back(cur, D);\n cur = g[0][0].first;\n while(g[cur].size() == 1 && cur){\n exit_v[cur] = G[0].back().first;\n exit_dist[cur] = D - ent_dist[cur];\n cur = g[cur][0].first;\n }\n }\n for(auto &&src : cv){\n D[src].resize(n, 1 << 30);\n dijkstra(src, D[src]);\n }\n }\n void dijkstra(int src, vector<int> &temp){\n priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;\n int d, v, u, c;\n temp[src] = 0;\n pq.emplace(0, src);\n while(!pq.empty()){\n tie(d, v) = pq.top();\n pq.pop();\n if(d > temp[v])continue;\n for(auto &&pa:g[v]){\n tie(u, c) = pa;\n if(d + c >= temp[u])continue;\n temp[u] = d + c;\n pq.emplace(temp[u], u);\n }\n }\n }\n int dist(int from, int to){\n if(edge_id[from] != -1 && edge_id[from] == edge_id[to] && ent_dist[from] <= ent_dist[to])return ent_dist[to] - ent_dist[from];\n int S = exit_v[from], T = ent_v[to];\n return D[S][T] + exit_dist[from] + ent_dist[to];\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, m, u, v, c;\n cin >> n >> m;\n vector<vector<pair<int,int>>> g(n);\n for(int i = 0; i < m; i++){\n cin >> u >> v >> c;\n g[--u].emplace_back(--v, c);\n }\n compress_graph G(g);\n ll ans = 0;\n for(int i = 0; i < n; i++)ans += G.dist(i, i + 1 == n ? 0 : i + 1);\n cout << ans << '\\n';\n}","accuracy":0.175,"time_ms":2740,"memory_kb":234208,"score_of_the_acc":-1.7541,"final_rank":18},{"submission_id":"aoj_2269_6617373","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\n#include <array>\n#include <algorithm>\n#include <numeric>\n#include <unordered_map>\n#include <unordered_set>\n#include <map>\n#include <set>\n#include <cassert>\n#include <iterator>\n#include <random>\n#include <stack>\n#include <climits>\n\nlong long int solve(const int n, const int m, const std::vector<std::tuple<int, int, int>> edges) {\n\tstd::vector<std::tuple<int, int, int>> unused;\n\tstd::vector<std::vector<std::pair<int, int>>> tree(n);\n\tstd::vector<bool> visit(n, false);\n\tstd::vector<int> depth(n, 0);\n\t{\n\t\tstd::vector<std::vector<std::pair<int, int>>> graph(n);\n\t\tfor (const auto [a, b, c] : edges) {\n\t\t\tgraph[a].emplace_back(b, c);\n\t\t}\n\t\tstd::queue<int> queue;\n\t\tvisit[0] = true;\n\t\tqueue.push(0);\n\t\twhile (!queue.empty()) {\n\t\t\tconst auto top = queue.front(); queue.pop();\n\t\t\tfor (const auto [to, c] : graph[top]) {\n\t\t\t\tif (visit[to]) {\n\t\t\t\t\tunused.emplace_back(top, to, c);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttree[top].emplace_back(to, c);\n\t\t\t\t\tvisit[to] = true;\n\t\t\t\t\tdepth[to] = depth[top] + c;\n\t\t\t\t\tqueue.push(to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tstd::vector<int> all_unused;\n\tfor (const auto [a, b, _] : unused) {\n\t\tall_unused.push_back(a);\n\t\tall_unused.push_back(b);\n\t}\n\tstd::sort(all_unused.begin(), all_unused.end()); all_unused.erase(std::unique(all_unused.begin(), all_unused.end()), all_unused.end());\n\tstd::vector<int> in_order(n), out_order(n), nearest_unuse(n, -1);\n\t{\n\t\tfor (auto i = 0; i < all_unused.size(); ++i) {\n\t\t\tnearest_unuse[all_unused[i]] = i;\n\t\t}\n\t\tint order{ 0 };\n\t\tstd::stack<int> stack;\n\t\tstd::fill(visit.begin(), visit.end(), false);\n\t\tstack.push(0);\n\t\twhile (!stack.empty()) {\n\t\t\tconst auto top = stack.top(); stack.pop();\n\t\t\tif (top >= 0) {\n\t\t\t\tif (visit[top]) continue;\n\t\t\t\tvisit[top] = true;\n\t\t\t\tin_order[top] = order++;\n\t\t\t\tstack.push(-1 - top);\n\t\t\t\tfor (const auto [to, c] : tree[top]) {\n\t\t\t\t\tif (visit[to]) continue;\n\t\t\t\t\tstack.push(to);\n\t\t\t\t\tif (nearest_unuse[to] >= 0 && all_unused[nearest_unuse[to]] == to) continue;\n\t\t\t\t\tnearest_unuse[to] = nearest_unuse[top];\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tout_order[-1 - top] = order;\n\t\t\t}\n\t\t}\n\t}\n\tconst auto is_parent = [&in_order, &out_order](const int a, const int b) {\n\t\treturn in_order[a] <= in_order[b] && out_order[b] <= out_order[a];\n\t};\n\tstd::vector<std::vector<long long int>> unused_distance(all_unused.size(), std::vector<long long int>(all_unused.size(), LLONG_MAX));\n\t{\n\t\tstd::vector<std::vector<std::pair<int, int>>> graph(all_unused.size());\n\t\tfor (const auto [a, b, c] : unused) {\n\t\t\tconst auto i = std::distance(all_unused.begin(), std::lower_bound(all_unused.begin(), all_unused.end(), a));\n\t\t\tconst auto j = std::distance(all_unused.begin(), std::lower_bound(all_unused.begin(), all_unused.end(), b));\n\t\t\tgraph[i].emplace_back(j, c);\n\t\t}\n\t\tfor (auto i = 0; i < all_unused.size(); ++i) {\n\t\t\tint parent{ -1 };\n\t\t\tfor (auto j = 0; j < all_unused.size(); ++j) {\n\t\t\t\tif (i == j) continue;\n\t\t\t\tif (!is_parent(all_unused[j], all_unused[i])) continue;\n\t\t\t\tif (parent == -1 || depth[all_unused[parent]] < depth[all_unused[j]]) {\n\t\t\t\t\tparent = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (parent >= 0)\n\t\t\t\tgraph[parent].emplace_back(i, depth[all_unused[i]] - depth[all_unused[parent]]);\n\t\t}\n\t\tconst auto comparator = [](const auto a, const auto b) {return a.second > b.second; };\n\t\tstd::priority_queue<std::pair<int, long long int>, std::vector<std::pair<int, long long int>>, decltype(comparator)> queue(comparator);\n\t\tfor (auto i = 0; i < all_unused.size(); ++i) {\n\t\t\tauto& min_distance = unused_distance[i];\n\t\t\tmin_distance[i] = 0;\n\t\t\tqueue.emplace(i, 0);\n\t\t\twhile (!queue.empty()) {\n\t\t\t\tconst auto [top, cost] = queue.top(); queue.pop();\n\t\t\t\tif (min_distance[top] < cost) continue;\n\t\t\t\tfor (const auto [to, c] : graph[top]) {\n\t\t\t\t\tif (min_distance[to] > cost + c) {\n\t\t\t\t\t\tmin_distance[to] = cost + c;\n\t\t\t\t\t\tqueue.emplace(to, cost + c);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tlong long int result{ 0 };\n\tfor (auto i = 0; i < n; ++i) {\n\t\tconst auto j = (i + 1) % n;\n\t\tlong long int current{ LLONG_MAX };\n\t\tif (is_parent(i, j)) {\n\t\t\tcurrent = std::min<long long int>(current, depth[j] - depth[i]);\n\t\t}\n\t\tif (nearest_unuse[j] >= 0) {\n\t\t\tconst auto k = nearest_unuse[j];\n\t\t\tconst long long int k_to_j = depth[j] - depth[all_unused[k]];\n\t\t\tfor (auto l = 0; l < all_unused.size(); ++l) {\n\t\t\t\tconst auto m = all_unused[l];\n\t\t\t\tif (!is_parent(i, m) || unused_distance[l][k] == LLONG_MAX) continue;\n\t\t\t\tconst auto i_to_l = depth[m] - depth[i];\n\t\t\t\tconst auto cost = i_to_l + unused_distance[l][k] + k_to_j;\n\t\t\t\tcurrent = std::min(current, cost);\n\t\t\t}\n\t\t}\n\t\tif (current == LLONG_MAX) {\n\t\t\treturn -1;\n\t\t}\n\t\tresult += current;\n\t}\n\treturn result;\n}\n\nlong long int brute(const int n, const int m, const std::vector<std::tuple<int, int, int>> edges) {\n\tstd::vector<std::vector<std::pair<int, int>>> graph(n);\n\tfor (const auto [a, b, c] : edges) {\n\t\tgraph[a].emplace_back(b, c);\n\t}\n\tconst auto comparator = [](const auto a, const auto b) {return a.second > b.second; };\n\tstd::priority_queue<std::pair<int, long long int>, std::vector<std::pair<int, long long int>>, decltype(comparator)> queue(comparator);\n\tlong long int result{ 0 };\n\tfor (auto i = 0; i < n; ++i) {\n\t\tconst auto j = (i + 1) % n;\n\t\tstd::vector<long long int> min_distance(n, LLONG_MAX);\n\t\tmin_distance[i] = 0;\n\t\tqueue.emplace(i, 0);\n\t\twhile (!queue.empty()) {\n\t\t\tconst auto [top, cost] = queue.top(); queue.pop();\n\t\t\tif (min_distance[top] < cost) continue;\n\t\t\tfor (const auto [to, c] : graph[top]) {\n\t\t\t\tif (min_distance[to] > cost + c) {\n\t\t\t\t\tmin_distance[to] = cost + c;\n\t\t\t\t\tqueue.emplace(to, cost + c);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (min_distance[j] == LLONG_MAX) {\n\t\t\treturn -1;\n\t\t}\n\t\tresult += min_distance[j];\n\t}\n\treturn result;\n}\nint main() {\n\tint n, m; std::cin >> n >> m;\n\tstd::vector<std::tuple<int, int, int>> edges(m);\n\tfor (auto& [a, b, c] : edges) {\n\t\tstd::cin >> a >> b >> c; --a; --b;\n\t}\n\tstd::cout << solve(n, m, edges) << '\\n';\n}","accuracy":1,"time_ms":450,"memory_kb":20416,"score_of_the_acc":-0.1796,"final_rank":3},{"submission_id":"aoj_2269_2662827","code_snippet":"#include <bits/stdc++.h>\n#define REP(i, n) for (int i = 0; (i) < int(n); ++ (i))\n#define ALL(x) begin(x), end(x)\nusing ll = long long;\nusing namespace std;\ntemplate <class T> inline void chmin(T & a, T const & b) { a = min(a, b); }\n\nvector<int> dijkstra(vector<vector<pair<int, int> > > const & g, int root) {\n vector<int> dist(g.size(), INT_MAX);\n priority_queue<pair<int, int> > que;\n dist[root] = 0;\n que.emplace(- dist[root], root);\n while (not que.empty()) {\n int dist_i; int i; tie(dist_i, i) = que.top(); que.pop();\n if (dist[i] < - dist_i) continue;\n for (auto it : g[i]) {\n int j; int cost; tie(j, cost) = it;\n if (- dist_i + cost < dist[j]) {\n dist[j] = - dist_i + cost;\n que.emplace(dist_i - cost, j);\n }\n }\n }\n return dist;\n}\n\nvector<vector<int> > warshall_floyd(vector<vector<pair<int, int> > > const & g) {\n int n = g.size();\n vector<vector<int> > dist(n, vector<int>(n, INT_MAX));\n REP (i, n) {\n dist[i][i] = 0;\n for (auto edge : g[i]) {\n int j, cost; tie(j, cost) = edge;\n dist[i][j] = cost;\n }\n }\n REP (k, n) {\n REP (i, n) if (dist[i][k] != INT_MAX) {\n REP (j, n) if (dist[k][j] != INT_MAX) {\n chmin(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n return dist;\n}\n\ntemplate <class Monoid>\nstruct sparse_table {\n typedef typename Monoid::underlying_type underlying_type;\n vector<vector<underlying_type> > table;\n Monoid mon;\n sparse_table() = default;\n sparse_table(vector<underlying_type> const & data, Monoid const & a_mon = Monoid())\n : mon(a_mon) {\n int n = data.size();\n int log_n = 32 - __builtin_clz(n);\n table.resize(log_n, vector<underlying_type>(n, mon.unit()));\n table[0] = data;\n for (int k = 0; k < log_n-1; ++ k) {\n for (int i = 0; i < n; ++ i) {\n table[k+1][i] = mon.append(table[k][i], i + (1ll<<k) < n ? table[k][i + (1ll<<k)] : mon.unit());\n }\n }\n }\n underlying_type range_concat(int l, int r) const {\n assert (0 <= l and l <= r and r <= table[0].size());\n if (l == r) return mon.unit();\n int k = 31 - __builtin_clz(r - l); // log2\n return mon.append(table[k][l], table[k][r - (1ll<<k)]);\n }\n};\nstruct indexed_min_monoid {\n typedef pair<int, int> underlying_type;\n underlying_type unit() const { return { INT_MAX, INT_MAX }; }\n underlying_type append(underlying_type a, underlying_type b) const { return min(a, b); }\n};\nstruct lowest_common_ancestor {\n sparse_table<indexed_min_monoid> table;\n vector<int> index;\n lowest_common_ancestor() = default;\n lowest_common_ancestor(int root, vector<vector<int> > const & g) {\n vector<pair<int, int> > tour;\n index.assign(g.size(), -1);\n function<void (int, int, int)> go = [&](int i, int parent, int depth) {\n index[i] = tour.size();\n tour.emplace_back(depth, i);\n for (int j : g[i]) if (j != parent) {\n go(j, i, depth + 1);\n tour.emplace_back(depth, i);\n }\n };\n go(root, -1, 0);\n table = sparse_table<indexed_min_monoid>(tour);\n }\n int operator () (int x, int y) const {\n x = index[x];\n y = index[y];\n if (x > y) swap(x, y);\n return table.range_concat(x, y + 1).second;\n }\n};\n\nll solve(int n, int m, vector<vector<pair<int, int> > > & g) {\n\n // erase duplicated edges\n REP (i, n) {\n sort(ALL(g[i]));\n g[i].erase(unique(ALL(g[i]), [&](pair<int, int> e1, pair<int, int> e2) {\n return e1.first == e2.first;\n }), g[i].end());\n }\n\n // calculate shortest-paths and check the possibility\n constexpr int root = 0;\n vector<int> dist_root = dijkstra(g, root);\n if (count(ALL(dist_root), INT_MAX)) {\n return -1;\n }\n vector<vector<pair<int, int> > > rev_g(n);\n REP (i, n) {\n for (auto edge : g[i]) {\n int j, cost; tie(j, cost) = edge;\n rev_g[j].emplace_back(i, cost);\n }\n }\n auto rev_dist_root = dijkstra(rev_g, root);\n if (count(ALL(rev_dist_root), INT_MAX)) {\n return -1;\n }\n\n // make a shortest-path tree; collect the unused edges\n vector<vector<int> > children(n);\n vector<int> parent(n, -1);\n vector<vector<pair<int, int> > > unused_edges(n);\n REP (i, n) {\n for (auto edge : g[i]) {\n int j, cost; tie(j, cost) = edge;\n if (dist_root[i] + cost == dist_root[j] and parent[j] == -1) {\n children[i].push_back(j);\n parent[j] = i;\n } else {\n unused_edges[i].emplace_back(j, cost);\n }\n }\n }\n\n // select and reorder distinguished vertices\n map<int, int> distinguished;\n auto distinguished_insert = [&](int i) {\n if (not distinguished.count(i)) {\n distinguished.emplace(i, distinguished.size());\n }\n };\n distinguished_insert(0);\n REP (i, n) {\n if (not unused_edges[i].empty()) {\n distinguished_insert(i);\n }\n for (auto edge : unused_edges[i]) {\n int j = edge.first;\n distinguished_insert(j);\n }\n }\n\n // compute distances for all distinguished vertices; find the lowest distinguished ancestors for each vertex\n vector<vector<pair<int, int> > > h(distinguished.size());\n REP (i, n) {\n for (auto edge : unused_edges[i]) {\n int j, cost; tie(j, cost) = edge;\n h[distinguished[i]].emplace_back(distinguished[j], cost);\n }\n }\n vector<int> ancestor(n, -1);\n function<void (int, int)> go = [&](int i, int last) {\n if (distinguished.count(i)) {\n if (last != -1) {\n h[distinguished[last]].emplace_back(distinguished[i], dist_root[i] - dist_root[last]);\n }\n last = i;\n }\n ancestor[i] = last;\n for (int j : children[i]) {\n go(j, last);\n }\n };\n go(root, -1);\n auto dist = warshall_floyd(h);\n\n // prepare the lca for the shortest-path tree\n lowest_common_ancestor lca(root, children);\n\n // compute the result\n ll result = 0;\n REP (i, n) {\n int j = (i + 1) % n;\n if (lca(i, j) == i) {\n result += dist_root[j] - dist_root[i];\n } else {\n int acc = INT_MAX;\n for (auto it : distinguished) {\n int k, distinguished_k; tie(k, distinguished_k) = it;\n if (lca(i, k) == i) {\n chmin(acc, (dist_root[k] - dist_root[i]) + dist[distinguished_k][distinguished[ancestor[j]]] + (dist_root[j] - dist_root[ancestor[j]]));\n }\n }\n result += acc;\n }\n }\n\n return result;\n}\n\nint main() {\n // input\n int n, m; scanf(\"%d%d\", &n, &m);\n vector<vector<pair<int, int> > > g(n);\n REP (i, m) {\n int a, b, c; scanf(\"%d%d%d\", &a, &b, &c);\n -- a; -- b;\n g[a].emplace_back(b, c);\n }\n // solve\n ll result = solve(n, m, g);\n // output\n printf(\"%lld\\n\", result);\n return 0;\n}","accuracy":1,"time_ms":2680,"memory_kb":62764,"score_of_the_acc":-0.9822,"final_rank":7},{"submission_id":"aoj_2269_1460721","code_snippet":"#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<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#include<utility>\n#include<complex>\n#include<functional>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_M = MAX_N + 500;\nconst int MAX_GN = 1000;\n\nconst int INF = 1 << 30;\n\n/* typedef */\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpii;\n\nstruct Edge {\n int gi, gj, gc;\n Edge() {}\n Edge(int _gi, int _gj, int _gc): gi(_gi), gj(_gj), gc(_gc) {}\n};\n\ntypedef vector<Edge *> ve;\n\n/* global variables */\n\nvpii nbrs[MAX_N];\nint ins[MAX_N], outs[MAX_N];\nint gids[MAX_N], g2i[MAX_GN], eids[MAX_N], dists[MAX_GN];\nEdge edges[MAX_GN];\nvi gnbrs[MAX_GN];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m;\n cin >> n >> m;\n\n memset(ins, 0, sizeof(ins));\n memset(outs, 0, sizeof(outs));\n\n for (int i = 0; i < m; i++) {\n int a, b, c;\n cin >> a >> b >> c;\n a--, b--;\n\n nbrs[a].push_back(pii(b, c));\n outs[a]++;\n ins[b]++;\n }\n\n int gn = 0;\n memset(gids, -1, sizeof(gids));\n \n for (int i = 0; i < n; i++) {\n if (ins[i] == 0 || outs[i] == 0) {\n cout << -1 << endl;\n return 0;\n }\n if (ins[i] > 1 || outs[i] > 1)\n gids[i] = gn, g2i[gn++] = i;\n }\n //printf(\"gn=%d\\n\", gn);\n\n if (gn == 0) {\n int csum = 0;\n for (int i = 0; i < n; i++) {\n int j = (i + 1) % n;\n for (int ui = i; ui != j;) {\n\tpii& v = nbrs[ui].front();\n\tui = v.first;\n\tcsum += v.second;\n }\n }\n cout << csum << endl;\n return 0;\n }\n \n int en = 0;\n memset(eids, -1, sizeof(eids));\n\n for (int gi = 0; gi < gn; gi++) {\n int st = g2i[gi];\n vpii& nbr = nbrs[st];\n\n for (vpii::iterator vit = nbr.begin(); vit != nbr.end(); vit++) {\n int ui = vit->first;\n int csum = vit->second;\n\n Edge& eu = edges[en];\n\n while (gids[ui] < 0) {\n\teids[ui] = en;\n\tpii& u = nbrs[ui].front();\n\tui = u.first;\n\tcsum += u.second;\n }\n\n eu.gi = gi;\n eu.gj = gids[ui];\n eu.gc = csum;\n\n gnbrs[gi].push_back(en++);\n //printf(\"edge[%d]: %d,%d,%d\\n\", en-1, eu.gi, eu.gj, eu.gc);\n }\n }\n //printf(\"en=%d\\n\", en);\n\n int csum = 0;\n\n for (int i0 = 0; i0 < n; i0++) {\n int st = i0;\n int gl = (i0 + 1) % n;\n\n int gi0 = gids[st];\n //printf(\"gi0=%d,gi1=%d,ei0=%d,ei1=%d\\n\", gi0, gi1, ei0, ei1);\n\n if (gi0 < 0) {\n while (st != gl && gids[st] < 0) {\n\tpii& u = nbrs[st].front();\n\tcsum += u.second;\n\tst = u.first;\n }\n gi0 = gids[st];\n if (st == gl) continue;\n }\n\n int gi1 = (gids[gl] >= 0) ? gids[gl] : edges[eids[gl]].gi;\n \n for (int i = 0; i < gn; i++) dists[i] = INF;\n dists[gi0] = 0;\n\n priority_queue<pii,vpii,greater<pii> > q;\n q.push(pii(0, gi0));\n\n while (! q.empty()) {\n pii u = q.top(); q.pop();\n int& ud = u.first;\n int& ui = u.second;\n\n if (ud != dists[ui]) continue;\n if (ui == gi1) break;\n\n vi& gnbr = gnbrs[ui];\n for (vi::iterator vit = gnbr.begin(); vit != gnbr.end(); vit++) {\n\tint& vi = edges[*vit].gj;\n\tint nvd = ud + edges[*vit].gc;\n\tif (dists[vi] > nvd) {\n\t dists[vi] = nvd;\n\t q.push(pii(nvd, vi));\n\t}\n }\n }\n\n if (dists[gi1] >= INF) {\n cout << -1 << endl;\n return 0;\n }\n\n csum += dists[gi1];\n\n st = g2i[gi1];\n while (st != gl) {\n pii& u = nbrs[st].front();\n st = u.first;\n csum += u.second;\n }\n }\n\n cout << csum << endl;\n\n return 0;\n}","accuracy":0.15,"time_ms":50,"memory_kb":7248,"score_of_the_acc":-0.011,"final_rank":19},{"submission_id":"aoj_2269_1219455","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 <cstring>\n#include <cmath>\n#include <map>\n#include <queue>\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, w; };\n\nll MOD = 1000000007;\nll _MOD = 1000000009;\ndouble EPS = 1e-10;\nint INF = INT_MAX / 4;\n\nvoid dijkstra(int n, vector<vector<edge> >& G, int s, vector<int>& d) {\n\td[s] = 0;\n\tpriority_queue<i_i, vector<i_i>, greater<i_i> > q;\n\tq.push(i_i(0, s));\n\twhile (!q.empty()) {\n\t\ti_i p = q.top(); q.pop();\n\t\tint u = p.second;\n\t\tif (p.first > d[u]) continue;\n\t\tfor (int i = 0; i < G[u].size(); i++) {\n\t\t\tedge e = G[u][i];\n\t\t\tif (d[e.v] > d[u] + e.w) {\n\t\t\t\td[e.v] = d[u] + e.w;\n\t\t\t\tq.push(i_i(d[e.v], e.v));\n\t\t\t}\n\t\t}\n\t}\n}\n\nint unko = 0;\n\nvoid dfs(int u, vector<vector<edge> >& g, vector<int>& in, vector<bool>& vis, vector<vector<edge> >& G, vector<i_i>& a, vector<i_i>& b, vector<int>& c) {\n\tif (vis[u]) return;\n\tvis[u] = true;\n\ta[u] = b[u] = i_i(u, 0);\n\tfor (int i = 0; i < g[u].size(); i++) {\n\t\tedge e = g[u][i];\n\t\tedge f;\n\t\tint sum = 0;\n\t\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0])\n\t\t\tsum += f.w;\n\t\tsum += f.w;\n\t\tedge E = {f.v, sum};\n\t\tG[u].push_back(E);\n\t\tint x = 0;\n\t\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0]) {\n\t\t\tx += f.w;\n\t\t\ta[f.v] = i_i(E.v, sum - x);\n\t\t\tb[f.v] = i_i(u, x);\n\t\t\tc[f.v] = unko;\n\t\t}\n\t\tunko++;\n\t\tdfs(E.v, g, in, vis, G, a, b, c);\n\t}\n}\n\nint main() {\n\tint N, M;\n\tcin >> N >> M;\n\tvector<int> in(N);\n\tvector<vector<edge> > g(N);\n\tin[0]++;\n\tedge e = {0, 0};\n\tg[0].push_back(e);\n\twhile (M--) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c;\n\t\ta--; b--;\n\t\tin[b]++;\n\t\tedge e = {b, c};\n\t\tg[a].push_back(e);\n\t}\n\tfor (int u = 0; u < N; u++)\n\t\tif (in[u] == 0 || g[u].empty()) {\n\t\t\tcout << -1 << endl;\n\t\t\treturn 0;\n\t\t}\n\tvector<bool> vis(N);\n\tvector<vector<edge> > G(N);\n\tvector<i_i> a(N), b(N);\n\tvector<int> c(N, -1);\n\tdfs(0, g, in, vis, G, a, b, c);\n\tfor (int u = 0; u < N; u++)\n\t\tif (c[u] == -1 && !vis[u]) {\n\t\t\tcout << -1 << endl;\n\t\t\treturn 0;\n\t\t}\n\tvector<int> hoge;\n\tfor (int u = 0; u < N; u++)\n\t\tif (c[u] == -1)\n\t\t\thoge.push_back(u);\n\tint n = hoge.size();\n\tvector<vector<int> > d(n, vector<int>(n, INF));\n\tfor (int i = 0; i < n; i++) d[i][i] = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tint u = hoge[i];\n\t\tfor (int k = 0; k < G[u].size(); k++) {\n\t\t\tedge e = G[u][k];\n\t\t\tint j = lower_bound(hoge.begin(), hoge.end(), e.v) - hoge.begin();\n\t\t\td[i][j] = min(d[i][j], e.w);\n\t\t}\n\t}\n\tfor (int k = 0; k < n; k++)\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t\td[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n\tll ans = 0;\n\tfor (int u = 0; u < N; u++) {\n\t\tint v = (u + 1) % N;\n\t\tif (c[u] != -1 && c[v] != -1 && c[u] == c[v] && b[u].second < b[v].second) {\n\t\t\tans += b[v].second - b[u].second;\n\t\t\tcontinue;\n\t\t}\n\t\tint s = a[u].first, t = b[v].first;\n\t\tans += a[u].second + b[v].second;\n\t\tint i = lower_bound(hoge.begin(), hoge.end(), s) - hoge.begin();\n\t\tint j = lower_bound(hoge.begin(), hoge.end(), t) - hoge.begin();\n\t\tif (d[i][j] == INF) {\n\t\t\tcout << -1 << endl;\n\t\t\treturn 0;\n\t\t}\n\t\tans += d[i][j];\n\t}\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":1230,"memory_kb":15456,"score_of_the_acc":-0.3732,"final_rank":6},{"submission_id":"aoj_2269_1219454","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 <cstring>\n#include <cmath>\n#include <map>\n#include <queue>\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, w; };\n\nll MOD = 1000000007;\nll _MOD = 1000000009;\ndouble EPS = 1e-10;\nint INF = INT_MAX / 4;\n\nvoid dijkstra(int n, vector<vector<edge> >& G, int s, vector<int>& d) {\n\td[s] = 0;\n\tpriority_queue<i_i, vector<i_i>, greater<i_i> > q;\n\tq.push(i_i(0, s));\n\twhile (!q.empty()) {\n\t\ti_i p = q.top(); q.pop();\n\t\tint u = p.second;\n\t\tif (p.first > d[u]) continue;\n\t\tfor (int i = 0; i < G[u].size(); i++) {\n\t\t\tedge e = G[u][i];\n\t\t\tif (d[e.v] > d[u] + e.w) {\n\t\t\t\td[e.v] = d[u] + e.w;\n\t\t\t\tq.push(i_i(d[e.v], e.v));\n\t\t\t}\n\t\t}\n\t}\n}\n\nint unko = 0;\n\nvoid dfs(int u, vector<vector<edge> >& g, vector<int>& in, vector<bool>& vis, vector<vector<edge> >& G, vector<i_i>& a, vector<i_i>& b, vector<int>& c) {\n\tif (vis[u]) return;\n\tvis[u] = true;\n\ta[u] = b[u] = i_i(u, 0);\n\tfor (int i = 0; i < g[u].size(); i++) {\n\t\tedge e = g[u][i];\n\t\tedge f;\n\t\tint sum = 0;\n\t\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0])\n\t\t\tsum += f.w;\n\t\tsum += f.w;\n\t\tedge E = {f.v, sum};\n\t\tG[u].push_back(E);\n\t\tint x = 0;\n\t\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0]) {\n\t\t\tx += f.w;\n\t\t\ta[f.v] = i_i(E.v, sum - x);\n\t\t\tb[f.v] = i_i(u, x);\n\t\t\tc[f.v] = unko;\n\t\t}\n\t\tunko++;\n\t\tdfs(E.v, g, in, vis, G, a, b, c);\n\t}\n}\n\nint main() {\n\tint N, M;\n\tcin >> N >> M;\n\tvector<int> in(N);\n\tvector<vector<edge> > g(N);\n\tin[0]++;\n\tedge e = {0, 0};\n\tg[0].push_back(e);\n\twhile (M--) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c;\n\t\ta--; b--;\n\t\tin[b]++;\n\t\tedge e = {b, c};\n\t\tg[a].push_back(e);\n\t}\n\tfor (int u = 0; u < N; u++)\n\t\tif (in[u] == 0 || g[u].empty()) {\n\t\t\tcout << -1 << endl;\n\t\t\treturn 0;\n\t\t}\n\tvector<bool> vis(N);\n\tvector<vector<edge> > G(N);\n\tvector<i_i> a(N), b(N);\n\tvector<int> c(N, -1);\n\tdfs(0, g, in, vis, G, a, b, c);\n\tfor (int u = 0; u < N; u++)\n\t\tif (c[u] == -1 && !vis[u]) {\n\t\t\tcout << -1 << endl;\n\t\t\treturn 0;\n\t\t}\n\tvector<int> hoge;\n\tfor (int u = 0; u < N; u++)\n\t\tif (c[u] == -1)\n\t\t\thoge.push_back(u);\n\tint n = hoge.size();\n\tvector<vector<int> > d(n, vector<int>(n, INF));\n\tfor (int i = 0; i < n; i++) d[i][i] = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tint u = hoge[i];\n\t\tfor (int k = 0; k < G[u].size(); k++) {\n\t\t\tedge e = G[u][k];\n\t\t\tint j = lower_bound(hoge.begin(), hoge.end(), e.v) - hoge.begin();\n\t\t\td[i][j] = min(d[i][j], e.w);\n\t\t}\n\t}\n\tfor (int k = 0; k < n; k++)\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < n; j++)\n\t\t\t\td[i][j] = min(d[i][j], d[i][k] + d[k][j]);\n\tll ans = 0;\n\tfor (int u = 0; u < N; u++) {\n\t\tint v = (u + 1) % N;\n\t\tif (c[u] != -1 && c[v] != -1 && c[u] == c[v] && b[u].second < b[v].second) {\n\t\t\tans += b[v].second - b[u].second;\n\t\t\tcontinue;\n\t\t}\n\t\tint s = a[u].first, t = b[v].first;\n\t\tans += a[u].second + b[v].second;\n\t\tint i = lower_bound(hoge.begin(), hoge.end(), s) - hoge.begin();\n\t\tint j = lower_bound(hoge.begin(), hoge.end(), t) - hoge.begin();\n\t\tans += d[i][j];\n\t}\n\tcout << ans << endl;\n}","accuracy":0.175,"time_ms":600,"memory_kb":10772,"score_of_the_acc":-0.1785,"final_rank":16},{"submission_id":"aoj_2269_1219448","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 <cstring>\n#include <cmath>\n#include <map>\n#include <queue>\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, w; };\n\nll MOD = 1000000007;\nll _MOD = 1000000009;\ndouble EPS = 1e-10;\nint INF = INT_MAX / 2;\n\nvoid dijkstra(int n, vector<vector<edge> >& G, int s, vector<int>& d) {\n\td[s] = 0;\n\tpriority_queue<i_i, vector<i_i>, greater<i_i> > q;\n\tq.push(i_i(0, s));\n\twhile (!q.empty()) {\n\t\ti_i p = q.top(); q.pop();\n\t\tint u = p.second;\n\t\tif (p.first > d[u]) continue;\n\t\tfor (int i = 0; i < G[u].size(); i++) {\n\t\t\tedge e = G[u][i];\n\t\t\tif (d[e.v] > d[u] + e.w) {\n\t\t\t\td[e.v] = d[u] + e.w;\n\t\t\t\tq.push(i_i(d[e.v], e.v));\n\t\t\t}\n\t\t}\n\t}\n}\n\nint unko = 0;\n\nvoid dfs(int u, vector<vector<edge> >& g, vector<int>& in, vector<bool>& vis, vector<vector<edge> >& G, vector<i_i>& a, vector<i_i>& b, vector<int>& c) {\n\tif (vis[u]) return;\n\tvis[u] = true;\n\ta[u] = b[u] = i_i(u, 0);\n\tfor (int i = 0; i < g[u].size(); i++) {\n\t\tedge e = g[u][i];\n\t\tedge f;\n\t\tint sum = 0;\n\t\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0])\n\t\t\tsum += f.w;\n\t\tsum += f.w;\n\t\tedge E = {f.v, sum};\n\t\tG[u].push_back(E);\n\t\tint x = 0;\n\t\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0]) {\n\t\t\tx += f.w;\n\t\t\ta[f.v] = i_i(E.v, sum - x);\n\t\t\tb[f.v] = i_i(u, x);\n\t\t\tc[f.v] = unko;\n\t\t}\n\t\tunko++;\n\t\tdfs(E.v, g, in, vis, G, a, b, c);\n\t}\n}\n\nint main() {\n\tint N, M;\n\tcin >> N >> M;\n\tvector<int> in(N);\n\tvector<vector<edge> > g(N);\n\tin[0]++;\n\tedge e = {0, 0};\n\tg[0].push_back(e);\n\twhile (M--) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c;\n\t\ta--; b--;\n\t\tin[b]++;\n\t\tedge e = {b, c};\n\t\tg[a].push_back(e);\n\t}\n\tfor (int u = 0; u < N; u++)\n\t\tif (in[u] == 0 || g[u].empty()) {\n\t\t\tcout << -1 << endl;\n\t\t\treturn 0;\n\t\t}\n\tvector<bool> vis(N);\n\tvector<vector<edge> > G(N);\n\tvector<i_i> a(N), b(N);\n\tvector<int> c(N, -1);\n\tdfs(0, g, in, vis, G, a, b, c);\n\tfor (int u = 0; u < N; u++)\n\t\tif (c[u] == -1 && !vis[u]) {\n\t\t\tcout << -1 << endl;\n\t\t\treturn 0;\n\t\t}\n\tvector<int> hoge;\n\tfor (int u = 0; u < N; u++)\n\t\tif (c[u] == -1)\n\t\t\thoge.push_back(u);\n\tll ans = 0;\n\tvector<int> d(N);\n\tfor (int u = 0; u < N; u++) {\n\t\tint v = (u + 1) % N;\n\t\tif (c[u] != -1 && c[v] != -1 && c[u] == c[v] && b[u].second < b[v].second) {\n\t\t\tans += b[v].second - b[u].second;\n\t\t\tcontinue;\n\t\t}\n\t\tint s = a[u].first, t = b[v].first;\n\t\tans += a[u].second + b[v].second;\n\t\tfor (int i = 0; i < hoge.size(); i++)\n\t\t\td[hoge[i]] = INT_MAX;\n\t\tdijkstra(N, G, s, d);\n\t\tans += d[t];\n\t}\n\tcout << ans << endl;\n}","accuracy":0.175,"time_ms":3630,"memory_kb":8660,"score_of_the_acc":-1.0062,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_2269_10342595\",\n \"code_snippet\": \"// AOJ #2269 Traveling Salesman Problem\\n// 2025.4.2\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int INF = 1e9;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() {\\n\\tint n = 0; int c = gc();\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nvoid Cout(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\\nusing pii = pair<int,int>;\\n\\nvector<vector<pii>> G, rG;\\nvector<int> Vs, VTbl;\\n\\nvoid compress(const vector<vector<pii>> &G, vector<int> &near, vector<int> &ndist, vector<vector<pii>> &Gc) {\\n int n = G.size();\\n near.assign(n, -1);\\n ndist.assign(n, 0);\\n int sz = Vs.size();\\n Gc.assign(sz, vector<pii>());\\n for (int i = 0; i < sz; i++) {\\n int from = Vs[i];\\n near[from] = i;\\n for (auto &e : G[from]) {\\n int dsum = e.first;\\n int v = e.second;\\n vector<int> visited(n, -1);\\n while (VTbl[v] < 0) {\\n if (visited[v] != -1) break;\\n visited[v] = dsum;\\n near[v] = i;\\n ndist[v] = dsum;\\n dsum += G[v][0].first;\\n v = G[v][0].second;\\n }\\n if (VTbl[v] < 0) VTbl[v] = i;\\n Gc[i].push_back({dsum, VTbl[v]});\\n }\\n }\\n}\\n\\nvoid djik(const vector<vector<pii>> &Gc, vector<vector<int>> &dtbl) {\\n int c = Gc.size();\\n dtbl.assign(c, vector<int>(c, INF));\\n for (int i = 0; i < c; i++) {\\n priority_queue<pii, vector<pii>, greater<pii>> pq;\\n dtbl[i][i] = 0;\\n pq.push({0, i});\\n while(!pq.empty()){\\n auto [d0, u] = pq.top(); pq.pop();\\n if(dtbl[i][u] != d0) continue;\\n for(auto &e : Gc[u]){\\n int nd = d0 + e.first, w = e.second;\\n if(nd < dtbl[i][w]){\\n dtbl[i][w] = nd;\\n pq.push({nd, w});\\n }\\n }\\n }\\n }\\n}\\n\\nint main(){\\n int n = Cin(), m = Cin();\\n G.assign(n, vector<pii>());\\n rG.assign(n, vector<pii>());\\n for (int i = 0; i < m; i++){\\n int a = Cin()-1, b = Cin()-1, c = Cin();\\n G[a].push_back({c, b});\\n rG[b].push_back({c, a});\\n }\\n\\n for (int i = 0; i < n; i++){\\n if(G[i].empty() || rG[i].empty()) { Cout(-1); return 0; }\\n }\\n\\n VTbl.assign(n, -1);\\n Vs.clear();\\n for (int i = 0; i < n; i++){\\n if(i < 2 || G[i].size() > 1 || rG[i].size() > 1){\\n VTbl[i] = Vs.size();\\n Vs.push_back(i);\\n }\\n }\\n\\n vector<vector<pii>> CG, rCG;\\n vector<int> near, rnear, d, rd;\\n compress(G, near, d, CG);\\n compress(rG, rnear, rd, rCG);\\n\\n vector<vector<int>> dtbl;\\n djik(CG, dtbl);\\n\\n int from = n - 1;\\n ll ans = 0;\\n for (int to = 0; to < n; to++){\\n int i1 = rnear[from], i2 = near[to];\\n if(i1 < 0 || i2 < 0) { Cout(-1); return 0; }\\n int dd = rd[from] + dtbl[i1][i2] + d[to];\\n if(near[from] == near[to] && rnear[from] == rnear[to]){\\n int x = rd[from] - rd[to];\\n if(x >= 0 && dd > x) dd = x;\\n }\\n if(dd >= INF) { Cout(-1); return 0; }\\n ans += dd;\\n from = to;\\n }\\n Cout(ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 20080,\n \"score_of_the_acc\": -0.109,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2269_10342593\",\n \"code_snippet\": \"// AOJ #2269 Traveling Salesman Problem\\n// 2025.4.2\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int INF = 1e9;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() {\\n\\tint n = 0; int c = gc();\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nvoid Cout(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\\nusing pii = pair<int,int>;\\n\\nvector<vector<pii>> G, RG;\\nvector<int> vs, vt;\\n\\nvoid comp(const vector<vector<pii>> &G, vector<int> &near, vector<int> &d, vector<vector<pii>> &CG) {\\n int n = G.size();\\n near.assign(n, -1);\\n d.assign(n, 0);\\n int sz = vs.size();\\n CG.assign(sz, vector<pii>());\\n for (int i = 0; i < sz; i++) {\\n int u = vs[i];\\n near[u] = i;\\n for (auto &e : G[u]) {\\n int s = e.first, v = e.second;\\n while (vt[v] < 0) {\\n near[v] = i;\\n d[v] = s;\\n s += G[v][0].first;\\n v = G[v][0].second;\\n }\\n CG[i].push_back({s, vt[v]});\\n }\\n }\\n}\\n\\nvoid djik(const vector<vector<pii>> &CG, vector<vector<int>> &dt) {\\n int c = CG.size();\\n dt.assign(c, vector<int>(c, INF));\\n for (int i = 0; i < c; i++) {\\n priority_queue<pii, vector<pii>, greater<pii>> pq;\\n dt[i][i] = 0;\\n pq.push({0, i});\\n while(!pq.empty()){\\n auto [d0, u] = pq.top(); pq.pop();\\n if(dt[i][u] != d0) continue;\\n for(auto &e : CG[u]){\\n int nd = d0 + e.first, w = e.second;\\n if(nd < dt[i][w]){\\n dt[i][w] = nd;\\n pq.push({nd, w});\\n }\\n }\\n }\\n }\\n}\\n\\nint main(){\\n int n = Cin(), m = Cin();\\n G.assign(n, vector<pii>());\\n RG.assign(n, vector<pii>());\\n for (int i = 0; i < m; i++){\\n int a = Cin()-1, b = Cin()-1, c = Cin();\\n G[a].push_back({c, b});\\n RG[b].push_back({c, a});\\n }\\n for (int i = 0; i < n; i++){\\n if(G[i].empty() || RG[i].empty()) { Cout(-1); return 0; }\\n }\\n vt.assign(n, -1);\\n for (int i = 0; i < n; i++){\\n if(i < 2 || G[i].size() > 1 || RG[i].size() > 1){\\n vt[i] = vs.size();\\n vs.push_back(i);\\n }\\n }\\n vector<vector<pii>> CG, RCG;\\n vector<int> near, rnear, d, rd;\\n comp(G, near, d, CG);\\n comp(RG, rnear, rd, RCG);\\n\\n vector<vector<int>> dt;\\n djik(CG, dt);\\n\\n int f = n - 1;\\n long long ans = 0;\\n for (int t = 0; t < n; t++){\\n int i1 = rnear[f], i2 = near[t];\\n if(i1 < 0 || i2 < 0) return -1;\\n int dd = rd[f] + dt[i1][i2] + d[t];\\n if(near[f] == near[t] && rnear[f] == rnear[t]){\\n int x = rd[f] - rd[t];\\n if(x >= 0 && dd > x) dd = x;\\n }\\n if(dd >= INF) { Cout(-1); return 0; }\\n ans += dd;\\n f = t;\\n }\\n Cout(ans);\\n return 0;\\n}\",\n \"accuracy\": 0.875,\n \"time_ms\": 70,\n \"memory_kb\": 19876,\n \"score_of_the_acc\": -0.0722,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2269_9001327\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int64_t ll;\\n\\n#define n1 (100004)\\n vector<vector<pair<int,int>>> g(n1);\\n vector<int> ineg(n1,0),outeg(n1,0);\\n vector<bool> vis(n1,false);\\n vector<int> exnm(n1,-1);\\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\\n vector d(1024,vector<int>(1024,1<<25));\\n int indx=0;\\n void findv(int cn){\\n vis[cn]=true;\\n for(int i=0;i<(int)g[cn].size();i++){\\n if(vis[g[cn][i].first]) continue;\\n findv(g[cn][i].first);\\n }\\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\\n exnm[cn]=indx;\\n indx++;\\n }\\n \\n }\\n\\n\\n\\nint lenm=0;\\n int makeg(int cn,int pa,int cost,int nm){\\n //cout << cn << \\\" \\\" << pa << \\\" \\\" << cost << \\\" \\\" << nm << endl;\\n if(exnm[cn]!=-1){\\n d[exnm[pa]][exnm[cn]]=min(cost,d[exnm[pa]][exnm[cn]]);\\n len[nm]=cost;\\n cost=0;\\n pa=cn;\\n }\\n if(vis[cn]) return exnm[cn];\\n if(exnm[cn]==-1) belong[cn]=nm;\\n vis[cn]=true;\\n par[cn]=exnm[pa];\\n dis[cn]=cost;\\n \\n int ch=-1;\\n for(int i=0;i<(int)g[cn].size();i++){\\n int nm1=nm;\\n if(exnm[cn]!=-1){ \\n lenm++;\\n nm1=lenm;\\n }\\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\\n }\\n if(exnm[cn]!=-1) ch=exnm[cn];\\n \\n return chd[cn]=ch;\\n \\n }\\n\\nint main(){\\n int n,m;\\n cin >> n >> m;\\n int a,b,c;\\n \\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c;\\n a--;b--;\\n for(int j=0;j<(int)g[a].size();j++){\\n if(g[a][j].first==b){\\n g[a][j].second=min(c,g[a][j].second);\\n c=-1;continue;\\n }\\n }\\n if(c!=-1){ \\n g[a].emplace_back(b,c);\\n ineg[b]++;\\n outeg[a]++;\\n } \\n }\\n \\n findv(0);\\n if(indx>1020){\\n cout << -1 << endl;\\n return 0;\\n \\n }\\n for(int i=0;i<n;i++){\\n if(vis[i]==false) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n //cout << indx << \\\" \\\" << exnm[0] << endl;\\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \\\" \\\" << g[6][i].second << endl;\\n \\n vis.assign(n,false);\\n for(int i=0;i<indx;i++) d[i][i]=0;\\n \\n int lenm=0,nm1;\\n\\n makeg(0,0,0,0);\\n//for(int i=0;i<n;i++){\\n // << i << \\\" \\\" << exnm[i] << \\\" \\\" << belong[i] << \\\" \\\" << par[i] << \\\" \\\" << chd[i] << endl;\\n//} \\n\\n for(int k=0;k<indx;k++){\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\\n }\\n }\\n }\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n if(d[i][j]==(1<<25)) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n\\n ll ans=0;\\n for(int i=0;i<n;i++){\\n int st=i,ed=(i+1)%n;\\n int stbl=belong[st],edbl=belong[ed];\\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\\n else{\\n int stex=chd[st],edex=par[ed];\\n ans+=(!~stbl ? 0 :(len[stbl]-dis[st]))+d[stex][edex]+dis[ed];\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 23624,\n \"score_of_the_acc\": -0.2379,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2269_9001320\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int64_t ll;\\n\\n#define n1 (100004)\\n vector<vector<pair<int,int>>> g(n1);\\n vector<int> ineg(n1,0),outeg(n1,0);\\n vector<bool> vis(n1,false);\\n vector<int> exnm(n1,-1);\\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\\n vector d(1024,vector<int>(1024,1<<25));\\n int indx=0;\\n void findv(int cn){\\n vis[cn]=true;\\n for(int i=0;i<(int)g[cn].size();i++){\\n if(vis[g[cn][i].first]) continue;\\n findv(g[cn][i].first);\\n }\\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\\n exnm[cn]=indx;\\n indx++;\\n }\\n \\n }\\n\\n\\n\\nint lenm=0;\\n int makeg(int cn,int pa,int cost,int nm){\\n //cout << cn << \\\" \\\" << pa << \\\" \\\" << cost << \\\" \\\" << nm << endl;\\n if(exnm[cn]!=-1){\\n d[exnm[pa]][exnm[cn]]=min(cost,d[exnm[pa]][exnm[cn]]);\\n len[nm]=cost;\\n cost=0;\\n pa=cn;\\n }\\n if(vis[cn]) return exnm[cn];\\n if(exnm[cn]==-1) belong[cn]=nm;\\n vis[cn]=true;\\n par[cn]=exnm[pa];\\n dis[cn]=cost;\\n \\n int ch=-1;\\n for(int i=0;i<(int)g[cn].size();i++){\\n int nm1=nm;\\n if(exnm[cn]!=-1){ \\n lenm++;\\n nm1=lenm;\\n }\\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\\n }\\n if(exnm[cn]!=-1) ch=exnm[cn];\\n \\n return chd[cn]=ch;\\n \\n }\\n\\nint main(){\\n int n,m;\\n cin >> n >> m;\\n int a,b,c;\\n \\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c;\\n a--;b--;\\n for(int j=0;j<(int)g[a].size();j++){\\n if(g[a][j].first==b){\\n g[a][j].second=min(c,g[a][j].second);\\n c=-1;continue;\\n }\\n }\\n if(c!=-1){ \\n g[a].emplace_back(b,c);\\n ineg[b]++;\\n outeg[a]++;\\n } \\n }\\n \\n findv(0);\\n if(indx>1020){\\n cout << -1 << endl;\\n return 0;\\n \\n }\\n for(int i=0;i<n;i++){\\n if(vis[i]=false) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n //cout << indx << \\\" \\\" << exnm[0] << endl;\\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \\\" \\\" << g[6][i].second << endl;\\n \\n vis.assign(n,false);\\n for(int i=0;i<indx;i++) d[i][i]=0;\\n \\n int lenm=0,nm1;\\n\\n makeg(0,0,0,0);\\n//for(int i=0;i<n;i++){\\n // << i << \\\" \\\" << exnm[i] << \\\" \\\" << belong[i] << \\\" \\\" << par[i] << \\\" \\\" << chd[i] << endl;\\n//} \\n\\n for(int k=0;k<indx;k++){\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\\n }\\n }\\n }\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n if(d[i][j]==(1<<25)) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n\\n ll ans=0;\\n for(int i=0;i<n;i++){\\n int st=i,ed=(i+1)%n;\\n int stbl=belong[st],edbl=belong[ed];\\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\\n else{\\n int stex=chd[st],edex=par[ed];\\n ans+=(!~stbl ? 0 :(len[stbl]-dis[st]))+d[stex][edex]+dis[ed];\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.9,\n \"time_ms\": 610,\n \"memory_kb\": 23624,\n \"score_of_the_acc\": -0.2379,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2269_9001159\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int64_t ll;\\n\\n#define n1 (100004)\\n vector<vector<pair<int,int>>> g(n1);\\n vector<int> ineg(n1,0),outeg(n1,0);\\n vector<bool> vis(n1,false);\\n vector<int> exnm(n1,-1);\\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\\n vector d(1024,vector<ll>(1024,1e18));\\n int indx=0;\\n void findv(int cn){\\n vis[cn]=true;\\n for(int i=0;i<(int)g[cn].size();i++){\\n if(vis[g[cn][i].first]) continue;\\n findv(g[cn][i].first);\\n }\\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\\n exnm[cn]=indx;\\n indx++;\\n }\\n \\n }\\n\\n\\n\\nint lenm=0;\\n int makeg(int cn,int pa,int cost,int nm){\\n //cout << cn << \\\" \\\" << pa << \\\" \\\" << cost << \\\" \\\" << nm << endl;\\n if(exnm[cn]!=-1){\\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\\n len[nm]=cost;\\n cost=0;\\n pa=cn;\\n }\\n if(vis[cn]) return exnm[cn];\\n if(exnm[cn]==-1) belong[cn]=nm;\\n vis[cn]=true;\\n par[cn]=exnm[pa];\\n dis[cn]=cost;\\n \\n int ch=-1;\\n for(int i=0;i<(int)g[cn].size();i++){\\n int nm1=nm;\\n if(exnm[cn]!=-1){ \\n lenm++;\\n nm1=lenm;\\n }\\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\\n }\\n if(exnm[cn]!=-1) ch=exnm[cn];\\n \\n return chd[cn]=ch;\\n \\n }\\n\\nint main(){\\n int n,m;\\n cin >> n >> m;\\n int a,b,c;\\n \\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c;\\n a--;b--;\\n for(int j=0;j<(int)g[a].size();j++){\\n if(g[a][j].first==b){\\n g[a][j].second=min(c,g[a][j].second);\\n c=-1;continue;\\n }\\n }\\n if(c!=-1){ \\n g[a].emplace_back(b,c);\\n ineg[b]++;\\n outeg[a]++;\\n } \\n }\\n \\n findv(0);\\n if(indx>1020){\\n cout << -1 << endl;\\n return 0;\\n \\n }\\n for(int i=0;i<n;i++){\\n if(vis[i]=false) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n //cout << indx << \\\" \\\" << exnm[0] << endl;\\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \\\" \\\" << g[6][i].second << endl;\\n \\n vis.assign(n,false);\\n for(int i=0;i<indx;i++) d[i][i]=0;\\n \\n int lenm=0,nm1;\\n\\n makeg(0,0,0,0);\\n//for(int i=0;i<n;i++){\\n // << i << \\\" \\\" << exnm[i] << \\\" \\\" << belong[i] << \\\" \\\" << par[i] << \\\" \\\" << chd[i] << endl;\\n//} \\n\\n for(int k=0;k<indx;k++){\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\\n }\\n }\\n }\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n if(d[i][j]==1e18) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n\\n ll ans=0;\\n for(int i=0;i<n;i++){\\n int st=i,ed=(i+1)%n;\\n int stbl=belong[st],edbl=belong[ed];\\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\\n else{\\n int stex=chd[st],edex=par[ed];\\n ans+=(!~stbl ? 0 :(len[stbl]-dis[st]))+d[stex][edex]+dis[ed];\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.9,\n \"time_ms\": 600,\n \"memory_kb\": 27692,\n \"score_of_the_acc\": -0.2531,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2269_9001152\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int64_t ll;\\n\\n#define n1 (100004)\\n vector<vector<pair<int,int>>> g(n1);\\n vector<int> ineg(n1,0),outeg(n1,0);\\n vector<bool> vis(n1,false);\\n vector<int> exnm(n1,-1);\\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\\n vector d(1024,vector<ll>(1024,1e18));\\n int indx=0;\\n void findv(int cn){\\n vis[cn]=true;\\n for(int i=0;i<(int)g[cn].size();i++){\\n if(vis[g[cn][i].first]) continue;\\n findv(g[cn][i].first);\\n }\\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\\n exnm[cn]=indx;\\n indx++;\\n }\\n \\n }\\n\\n\\n\\nint lenm=0;\\n int makeg(int cn,int pa,int cost,int nm){\\n //cout << cn << \\\" \\\" << pa << \\\" \\\" << cost << \\\" \\\" << nm << endl;\\n if(exnm[cn]!=-1){\\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\\n len[nm]=cost;\\n cost=0;\\n pa=cn;\\n }\\n if(vis[cn]) return exnm[cn];\\n if(exnm[cn]==-1) belong[cn]=nm;\\n vis[cn]=true;\\n par[cn]=exnm[pa];\\n dis[cn]=cost;\\n \\n int ch=-1;\\n for(int i=0;i<(int)g[cn].size();i++){\\n int nm1=nm;\\n if(exnm[cn]!=-1){ \\n lenm++;\\n nm1=lenm;\\n }\\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\\n }\\n if(exnm[cn]!=-1) ch=exnm[cn];\\n \\n return chd[cn]=ch;\\n \\n }\\n\\nint main(){\\n int n,m;\\n cin >> n >> m;\\n int a,b,c;\\n \\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c;\\n a--;b--;\\n for(int j=0;j<(int)g[a].size();j++){\\n if(g[a][j].first==b){\\n g[a][j].second=min(c,g[a][j].second);\\n c=-1;continue;\\n }\\n }\\n if(c!=-1){ \\n g[a].emplace_back(b,c);\\n ineg[b]++;\\n outeg[a]++;\\n } \\n }\\n \\n findv(0);\\n if(indx>1020){\\n cout << -1 << endl;\\n return 0;\\n \\n }\\n for(int i=0;i<n;i++){\\n if(vis[i]=false) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n //cout << indx << \\\" \\\" << exnm[0] << endl;\\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \\\" \\\" << g[6][i].second << endl;\\n \\n vis.assign(n,false);\\n for(int i=0;i<indx;i++) d[i][i]=0;\\n \\n int lenm=0,nm1;\\n\\n makeg(0,0,0,0);\\n//for(int i=0;i<n;i++){\\n // << i << \\\" \\\" << exnm[i] << \\\" \\\" << belong[i] << \\\" \\\" << par[i] << \\\" \\\" << chd[i] << endl;\\n//} \\n\\n for(int k=0;k<indx;k++){\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\\n }\\n }\\n }\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n if(d[i][j]==1e18) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n\\n ll ans=0;\\n for(int i=0;i<n;i++){\\n int st=i,ed=(i+1)%n;\\n int stbl=belong[st],edbl=belong[ed];\\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\\n else{\\n int stex=chd[st],edex=par[ed];\\n ans+=len[stbl]-dis[st]+d[stex][edex]+dis[ed];\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.9,\n \"time_ms\": 610,\n \"memory_kb\": 27460,\n \"score_of_the_acc\": -0.2548,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2269_9000807\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int64_t ll;\\n\\n#define n1 (100010)\\n vector<vector<pair<int,int>>> g(n1);\\n vector<int> ineg(n1,0),outeg(n1,0);\\n vector<bool> vis(n1,false);\\n vector<int> exnm(n1,-1);\\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\\n vector d(1024,vector<ll>(1024,1e18));\\nint lenm=0;\\n int makeg(int cn,int pa,int cost,int nm){\\n //cout << cn << \\\" \\\" << pa << \\\" \\\" << cost << \\\" \\\" << nm << endl;\\n if(exnm[cn]!=-1){\\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\\n len[nm]=cost;\\n cost=0;\\n pa=cn;\\n }\\n if(vis[cn]) return exnm[cn];\\n if(exnm[cn]==-1) belong[cn]=nm;\\n vis[cn]=true;\\n par[cn]=exnm[pa];\\n dis[cn]=cost;\\n \\n int ch=-1;\\n for(int i=0;i<(int)g[cn].size();i++){\\n int nm1=nm;\\n if(exnm[cn]!=-1){ \\n lenm++;\\n nm1=lenm;\\n }\\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\\n }\\n if(exnm[cn]!=-1) ch=exnm[cn];\\n \\n return chd[cn]=ch;\\n \\n };\\n\\nint main(){\\n int n,m;\\n cin >> n >> m;\\n int a,b,c;\\n \\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c;\\n a--;b--;\\n for(int j=0;j<(int)g[a].size();j++){\\n if(g[a][j].first==b){\\n g[a][j].second=min(c,g[a][j].second);\\n c=-1;continue;\\n }\\n }\\n if(c!=-1){ \\n g[a].emplace_back(b,c);\\n ineg[b]++;\\n outeg[a]++;\\n } \\n }\\n \\n int indx=0;\\n function<void(int)> findv=[&](int cn){\\n vis[cn]=true;\\n for(int i=0;i<(int)g[cn].size();i++){\\n if(vis[g[cn][i].first]) continue;\\n findv(g[cn][i].first);\\n }\\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\\n exnm[cn]=indx;\\n indx++;\\n }\\n \\n };\\n findv(0);\\n if(indx>1020){\\n cout << -1 << endl;\\n return 0;\\n \\n }\\n for(int i=0;i<n;i++){\\n if(vis[i]=false) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n //cout << indx << \\\" \\\" << exnm[0] << endl;\\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \\\" \\\" << g[6][i].second << endl;\\n \\n vis.assign(n,false);\\n for(int i=0;i<indx;i++) d[i][i]=0;\\n \\n int lenm=0,nm1;\\n\\n makeg(0,0,0,0);\\n//for(int i=0;i<n;i++){\\n // << i << \\\" \\\" << exnm[i] << \\\" \\\" << belong[i] << \\\" \\\" << par[i] << \\\" \\\" << chd[i] << endl;\\n//} \\n\\n for(int k=0;k<indx;k++){\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\\n }\\n }\\n }\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n if(d[i][j]==1e18) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n\\n ll ans=0;\\n for(int i=0;i<n;i++){\\n int st=i,ed=(i+1)%n;\\n int stbl=belong[st],edbl=belong[ed];\\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\\n else{\\n int stex=chd[st],edex=par[ed];\\n ans+=len[stbl]-dis[st]+d[stex][edex]+dis[ed];\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.9,\n \"time_ms\": 630,\n \"memory_kb\": 27464,\n \"score_of_the_acc\": -0.2603,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2269_9000803\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define MAX_N (100010)\\n\\nusing namespace std;\\n\\ntypedef long long lint;\\n\\nstruct edge {\\n\\tint to, cost;\\n\\tedge(int to, int cost) : to(to), cost(cost) {}\\n\\tedge(){}\\n};\\n\\nvector<edge> g[MAX_N];\\nbool vis[MAX_N];\\nint tVertex[MAX_N];\\nint len[MAX_N], dist[MAX_N], belong[MAX_N];\\nint par[MAX_N], chi[MAX_N];\\nint inDeg[MAX_N], outDeg[MAX_N];\\nint d[1024][1024];\\nint idx;\\n\\nvoid findCompress(int v)\\n{\\n\\tvis[v] = true;\\n\\t\\n\\tfor (int i = 0; i < g[v].size(); i++){\\n\\t\\tedge e = g[v][i];\\n\\t\\tif (!vis[e.to]){\\n\\t\\t\\tfindCompress(e.to);\\n\\t\\t}\\n\\t}\\n\\t\\n\\tif (!v || inDeg[v] > 1 || outDeg[v] > 1){\\n\\t\\ttVertex[v] = idx++;\\n\\t}\\n}\\n\\nint s;\\nint makeCompress(int now, int p, int cost, int id)\\n{\\n//cout << now << \\\" \\\" << p << \\\" \\\" << cost << \\\" \\\" << id << endl;\\n\\tif (~tVertex[now]){\\n\\t\\tbelong[now] = -1;\\n\\t\\tlen[id] = cost;\\n\\t\\td[tVertex[p]][tVertex[now]] = min(cost, d[tVertex[p]][tVertex[now]]);\\n\\t\\tcost = 0;\\n\\t\\tp = now;\\n\\t}\\n\\t\\n\\tif (vis[now]) return (tVertex[now]);\\n\\tif (!~tVertex[now]) belong[now] = id;\\n\\tvis[now] = true;\\n\\tpar[now] = tVertex[p];\\n\\tdist[now] = cost;\\n\\t\\n\\tint r = -1;\\n\\tfor (int i = 0; i < g[now].size(); i++){\\n\\t\\tint nid = id;\\n\\t\\tif (~tVertex[now]) nid = ++s;\\n\\t\\tr = makeCompress(g[now][i].to, p, cost + g[now][i].cost, nid);\\n\\t}\\n\\tif (~tVertex[now]) r = tVertex[now];\\n //cout << now << \\\" b\\\" <<belong[now] << \\\" p\\\" << par[now] << \\\" \\\" << dist[now] << \\\" \\\" << r << \\\" \\\" << tVertex[now] << endl;\\n\\treturn (chi[now] = r);\\n}\\n\\nint main()\\n{\\n\\tint n, m;\\n\\t\\n\\tscanf(\\\"%d %d\\\", &n, &m);\\n\\t\\n\\tfor (int i = 0; i < m; i++){\\n\\t\\tint a, b, c;\\n\\t\\tscanf(\\\"%d %d %d\\\", &a, &b, &c);\\n\\t\\t--a; --b;\\n\\t\\tfor (int i = 0; i < g[a].size(); i++){\\n\\t\\t\\tif (g[a][i].to == b){\\n\\t\\t\\t\\tg[a][i].cost = min(g[a][i].cost, c);\\n\\t\\t\\t\\tgoto updated;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tg[a].push_back(edge(b, c));\\n\\t\\toutDeg[a]++; inDeg[b]++;\\n\\t\\tupdated:;\\n\\t}\\n\\t\\n\\tmemset(vis, 0, sizeof(vis));\\n\\tmemset(tVertex, -1, sizeof(tVertex));\\n\\tmemset(par, -1, sizeof(par));\\n\\tfindCompress(0);\\n\\t//cout << idx << \\\" \\\" << tVertex[0] <<endl;\\n\\t// for(int i=0;i<(int)g[14].size();i++) cout << g[14][i].to << \\\" \\\" << g[14][i].cost << endl;\\n\\n\\tif (idx >= 1024) return (!printf(\\\"-1\\\\n\\\"));\\n\\tfor (int i = 0; i < n; i++) if (vis[i] == false) return (!printf(\\\"-1\\\\n\\\"));\\n\\t\\n\\tfor (int i = 0; i < 1024; i++){\\n\\t\\tfor (int j = 0; j < 1024; j++){\\n\\t\\t\\td[i][j] = 1 << 25;\\n\\t\\t}\\n\\t\\td[i][i] = 0;\\n\\t}\\n\\tmemset(vis, 0, sizeof(vis));\\n\\tmakeCompress(0, 0, 0, 0);\\n\\t\\n\\tfor (int k = 0; k < idx; k++){\\n\\t\\tfor (int i = 0; i < idx; i++){\\n\\t\\t\\tfor (int j = 0; j < idx; j++){\\n\\t\\t\\t\\td[i][j] = min(d[i][j], d[i][k] + d[k][j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n for (int i = 0; i < idx; i++){\\n for (int j = 0; j < idx; j++){\\n if (d[i][j] == 1 << 25) return (!printf(\\\"-1\\\\n\\\"));\\n }\\n }\\t\\n\\tlint res = 0;\\n\\t\\n\\tfor (int i = 0; i < n; i++){\\n\\t\\tint from = i, to = (i + 1) % n;\\n\\t\\tint fl = belong[from], tl = belong[to];\\n\\t\\tint c = chi[from], p = par[to];\\n\\t\\tif (fl == tl && dist[from] < dist[to]){\\n\\t\\t\\tres += dist[to] - dist[from];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tres += (!~fl ? 0 : (len[fl] - dist[from])) + d[c][p] + dist[to];\\n\\t\\t}\\n\\t}\\n\\t\\n\\tprintf(\\\"%lld\\\\n\\\", res);\\n\\t\\n\\treturn (0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 530,\n \"memory_kb\": 22448,\n \"score_of_the_acc\": -0.2106,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2269_9000802\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int64_t ll;\\n\\n#define n1 (100004)\\n vector<vector<pair<int,int>>> g(n1);\\n vector<int> ineg(n1,0),outeg(n1,0);\\n vector<bool> vis(n1,false);\\n vector<int> exnm(n1,-1);\\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\\n vector d(1024,vector<ll>(1024,1e18));\\n\\nint main(){\\n int n,m;\\n cin >> n >> m;\\n int a,b,c;\\n \\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c;\\n a--;b--;\\n for(int j=0;j<(int)g[a].size();j++){\\n if(g[a][j].first==b){\\n g[a][j].second=min(c,g[a][j].second);\\n c=-1;continue;\\n }\\n }\\n if(c!=-1){ \\n g[a].emplace_back(b,c);\\n ineg[b]++;\\n outeg[a]++;\\n } \\n }\\n \\n int indx=0;\\n function<void(int)> findv=[&](int cn){\\n vis[cn]=true;\\n for(int i=0;i<(int)g[cn].size();i++){\\n if(vis[g[cn][i].first]) continue;\\n findv(g[cn][i].first);\\n }\\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\\n exnm[cn]=indx;\\n indx++;\\n }\\n \\n };\\n findv(0);\\n if(indx>1020){\\n cout << -1 << endl;\\n return 0;\\n \\n }\\n for(int i=0;i<n;i++){\\n if(vis[i]=false) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n\\n //cout << indx << \\\" \\\" << exnm[0] << endl;\\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \\\" \\\" << g[6][i].second << endl;\\n \\n vis.assign(n,false);\\n for(int i=0;i<indx;i++) d[i][i]=0;\\n \\n int lenm=0,nm1;\\n function<int(int,int,int,int)> makeg=[&](int cn,int pa,int cost,int nm){\\n //cout << cn << \\\" \\\" << pa << \\\" \\\" << cost << \\\" \\\" << nm << endl;\\n if(exnm[cn]!=-1){\\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\\n len[nm]=cost;\\n cost=0;\\n pa=cn;\\n }\\n if(vis[cn]) return exnm[cn];\\n if(exnm[cn]==-1) belong[cn]=nm;\\n vis[cn]=true;\\n par[cn]=exnm[pa];\\n dis[cn]=cost;\\n \\n int ch=-1;\\n for(int i=0;i<(int)g[cn].size();i++){\\n nm1=nm;\\n if(exnm[cn]!=-1){ \\n lenm++;\\n nm1=lenm;\\n }\\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\\n }\\n if(exnm[cn]!=-1) ch=exnm[cn];\\n \\n return chd[cn]=ch;\\n \\n };\\n makeg(0,0,0,0);\\n//for(int i=0;i<n;i++){\\n // << i << \\\" \\\" << exnm[i] << \\\" \\\" << belong[i] << \\\" \\\" << par[i] << \\\" \\\" << chd[i] << endl;\\n//} \\n\\n for(int k=0;k<indx;k++){\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\\n }\\n }\\n }\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n if(d[i][j]==1e18) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n\\n ll ans=0;\\n for(int i=0;i<n;i++){\\n int st=i,ed=(i+1)%n;\\n int stbl=belong[st],edbl=belong[ed];\\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\\n else{\\n int stex=chd[st],edex=par[ed];\\n ans+=len[stbl]-dis[st]+d[stex][edex]+dis[ed];\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.9,\n \"time_ms\": 650,\n \"memory_kb\": 29168,\n \"score_of_the_acc\": -0.2734,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2269_9000682\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int64_t ll;\\n\\n#define n1 (100004)\\n vector<vector<pair<int,int>>> g(n1);\\n vector<int> ineg(n1,0),outeg(n1,0);\\n vector<bool> vis(n1,false);\\n vector<int> exnm(n1,-1);\\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\\n vector d(1024,vector<ll>(1024,1e18));\\n\\nint main(){\\n int n,m;\\n cin >> n >> m;\\n int a,b,c;\\n \\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c;\\n a--;b--;\\n for(int j=0;j<(int)g[a].size();j++){\\n if(g[a][j].first==b){\\n g[a][j].second=min(c,g[a][j].second);\\n c=-1;continue;\\n }\\n }\\n if(c!=-1){ \\n g[a].emplace_back(b,c);\\n ineg[b]++;\\n outeg[a]++;\\n } \\n }\\n \\n int indx=0;\\n function<void(int)> findv=[&](int cn){\\n vis[cn]=true;\\n for(int i=0;i<(int)g[cn].size();i++){\\n if(vis[g[cn][i].first]) continue;\\n findv(g[cn][i].first);\\n }\\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\\n exnm[cn]=indx;\\n indx++;\\n }\\n \\n };\\n findv(0);\\n if(indx>1020){\\n cout << -1 << endl;\\n return 0;\\n \\n }\\n\\n //cout << indx << \\\" \\\" << exnm[0] << endl;\\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \\\" \\\" << g[6][i].second << endl;\\n \\n vis.assign(n,false);\\n for(int i=0;i<indx;i++) d[i][i]=0;\\n \\n int lenm=0,nm1;\\n function<int(int,int,int,int)> makeg=[&](int cn,int pa,int cost,int nm){\\n //cout << cn << \\\" \\\" << pa << \\\" \\\" << cost << \\\" \\\" << nm << endl;\\n if(exnm[cn]!=-1){\\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\\n len[nm]=cost;\\n cost=0;\\n pa=cn;\\n }\\n if(vis[cn]) return exnm[cn];\\n if(exnm[cn]==-1) belong[cn]=nm;\\n vis[cn]=true;\\n par[cn]=exnm[pa];\\n dis[cn]=cost;\\n \\n int ch=-1;\\n for(int i=0;i<(int)g[cn].size();i++){\\n nm1=nm;\\n if(exnm[cn]!=-1){ \\n lenm++;\\n nm1=lenm;\\n }\\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\\n }\\n if(exnm[cn]!=-1) ch=exnm[cn];\\n \\n return chd[cn]=ch;\\n \\n };\\n makeg(0,0,0,0);\\n//for(int i=0;i<n;i++){\\n // << i << \\\" \\\" << exnm[i] << \\\" \\\" << belong[i] << \\\" \\\" << par[i] << \\\" \\\" << chd[i] << endl;\\n//} \\n\\n for(int k=0;k<indx;k++){\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\\n }\\n }\\n }\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n if(d[i][j]==1e18) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n\\n ll ans=0;\\n for(int i=0;i<n;i++){\\n int st=i,ed=(i+1)%n;\\n int stbl=belong[st],edbl=belong[ed];\\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\\n else{\\n int stex=chd[st],edex=par[ed];\\n ans+=len[stbl]-dis[st]+d[stex][edex]+dis[ed];\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.9,\n \"time_ms\": 620,\n \"memory_kb\": 29176,\n \"score_of_the_acc\": -0.2651,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2269_9000648\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef int64_t ll;\\n\\n#define n1 (100004)\\n vector<vector<pair<int,int>>> g(n1);\\n vector<int> ineg(n1,0),outeg(n1,0);\\n vector<bool> vis(n1,false);\\n vector<int> exnm(n1,-1);\\n vector<int> dis(n1,0),belong(n1,-1),par(n1,-1),chd(n1,-1),len(n1,-1);\\n vector d(1024,vector<ll>(1024,1e18));\\n\\nint main(){\\n int n,m;\\n cin >> n >> m;\\n int a,b,c;\\n \\n for(int i=0;i<m;i++){\\n cin >> a >> b >> c;\\n a--;b--;\\n for(int j=0;j<(int)g[a].size();j++){\\n if(g[a][j].first==b){\\n g[a][j].second=min(c,g[a][j].second);\\n c=-1;continue;\\n }\\n }\\n if(c!=-1){ \\n g[a].emplace_back(b,c);\\n ineg[b]++;\\n outeg[a]++;\\n } \\n }\\n \\n int indx=0;\\n function<void(int)> findv=[&](int cn){\\n vis[cn]=true;\\n for(int i=0;i<(int)g[cn].size();i++){\\n if(vis[g[cn][i].first]) continue;\\n findv(g[cn][i].first);\\n }\\n if((cn==0)||(ineg[cn]>1)||(outeg[cn]>1)){\\n exnm[cn]=indx;\\n indx++;\\n }\\n \\n };\\n findv(0);\\n //cout << indx << \\\" \\\" << exnm[0] << endl;\\n //for(int i=0;i<(int)g[6].size();i++) cout << g[6][i].first << \\\" \\\" << g[6][i].second << endl;\\n \\n vis.assign(n,false);\\n for(int i=0;i<indx;i++) d[i][i]=0;\\n \\n int lenm=0,nm1;\\n function<int(int,int,int,int)> makeg=[&](int cn,int pa,int cost,int nm){\\n //cout << cn << \\\" \\\" << pa << \\\" \\\" << cost << \\\" \\\" << nm << endl;\\n if(exnm[cn]!=-1){\\n d[exnm[pa]][exnm[cn]]=min((ll)cost,d[exnm[pa]][exnm[cn]]);\\n len[nm]=cost;\\n cost=0;\\n pa=cn;\\n }\\n if(vis[cn]) return exnm[cn];\\n if(exnm[cn]==-1) belong[cn]=nm;\\n vis[cn]=true;\\n par[cn]=exnm[pa];\\n dis[cn]=cost;\\n \\n int ch=-1;\\n for(int i=0;i<(int)g[cn].size();i++){\\n nm1=nm;\\n if(exnm[cn]!=-1){ \\n lenm++;\\n nm1=lenm;\\n }\\n ch=makeg(g[cn][i].first,pa,cost+g[cn][i].second,nm1);\\n }\\n if(exnm[cn]!=-1) ch=exnm[cn];\\n \\n return chd[cn]=ch;\\n \\n };\\n makeg(0,0,0,0);\\n//for(int i=0;i<n;i++){\\n // << i << \\\" \\\" << exnm[i] << \\\" \\\" << belong[i] << \\\" \\\" << par[i] << \\\" \\\" << chd[i] << endl;\\n//} \\n\\n for(int k=0;k<indx;k++){\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\\n }\\n }\\n }\\n for(int i=0;i<indx;i++){\\n for(int j=0;j<indx;j++){\\n if(d[i][j]==1e18) {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n }\\n\\n ll ans=0;\\n for(int i=0;i<n;i++){\\n int st=i,ed=(i+1)%n;\\n int stbl=belong[st],edbl=belong[ed];\\n if((stbl==edbl)&&(dis[st]<dis[ed])) ans+=dis[ed]-dis[st];\\n else{\\n int stex=chd[st],edex=par[ed];\\n ans+=len[stbl]-dis[st]+d[stex][edex]+dis[ed];\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.9,\n \"time_ms\": 630,\n \"memory_kb\": 29112,\n \"score_of_the_acc\": -0.2676,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2269_7058083\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nnamespace internal_scc{\\ntemplate <class E> struct csr {\\n std::vector<int> start;\\n std::vector<E> elist;\\n csr(int n, const std::vector<std::pair<int, E>>& edges)\\n : start(n + 1), elist(edges.size()) {\\n for (auto e : edges) {\\n start[e.first + 1]++;\\n }\\n for (int i = 1; i <= n; i++) {\\n start[i] += start[i - 1];\\n }\\n auto counter = start;\\n for (auto e : edges) {\\n elist[counter[e.first]++] = e.second;\\n }\\n }\\n};\\nstruct scc_graph {\\n public:\\n scc_graph(int n) : _n(n) {}\\n int num_vertices() { return _n; }\\n void add_edge(int from, int to) { edges.push_back({from, {to}}); }\\n std::pair<int, std::vector<int>> scc_ids() {\\n auto g = csr<edge>(_n, edges);\\n int now_ord = 0, group_num = 0;\\n std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);\\n visited.reserve(_n);\\n auto dfs = [&](auto self, int v) -> void {\\n low[v] = ord[v] = now_ord++;\\n visited.push_back(v);\\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\\n auto to = g.elist[i].to;\\n if (ord[to] == -1) {\\n self(self, to);\\n low[v] = std::min(low[v], low[to]);\\n } else {\\n low[v] = std::min(low[v], ord[to]);\\n }\\n }\\n if (low[v] == ord[v]) {\\n while (true) {\\n int u = visited.back();\\n visited.pop_back();\\n ord[u] = _n;\\n ids[u] = group_num;\\n if (u == v) break;\\n }\\n group_num++;\\n }\\n };\\n for (int i = 0; i < _n; i++) {\\n if (ord[i] == -1) dfs(dfs, i);\\n }\\n for (auto& x : ids) {\\n x = group_num - 1 - x;\\n }\\n return {group_num, ids};\\n }\\n\\n std::vector<std::vector<int>> scc() {\\n auto ids = scc_ids();\\n int group_num = ids.first;\\n std::vector<int> counts(group_num);\\n for (auto x : ids.second) counts[x]++;\\n std::vector<std::vector<int>> groups(ids.first);\\n for (int i = 0; i < group_num; i++) {\\n groups[i].reserve(counts[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n groups[ids.second[i]].push_back(i);\\n }\\n return groups;\\n }\\n\\n private:\\n int _n;\\n struct edge {\\n int to;\\n };\\n std::vector<std::pair<int, edge>> edges;\\n};\\n}\\n\\nstruct scc_graph {\\n public:\\n scc_graph() : internal(0) {}\\n scc_graph(int n) : internal(n) {}\\n void add_edge(int from, int to) {\\n int n = internal.num_vertices();\\n assert(0 <= from && from < n);\\n assert(0 <= to && to < n);\\n internal.add_edge(from, to);\\n }\\n std::vector<std::vector<int>> scc() { return internal.scc(); }\\n private:\\n internal_scc::scc_graph internal;\\n};\\n\\nstruct compress_graph{\\n int n, idx = 0;\\n vector<vector<pair<int,int>>> g, G;\\n vector<int> ent_v, ent_dist, exit_v, exit_dist, cv, edge_id, ent_edge, dict;\\n vector<vector<int>> D;\\n compress_graph(vector<vector<pair<int,int>>> &_g) : n(_g.size()), g(_g) {\\n ent_v.resize(n);\\n ent_dist.resize(n);\\n exit_v.resize(n);\\n exit_dist.resize(n);\\n edge_id.resize(n, -1);\\n ent_edge.resize(n);\\n dict.resize(n, -1);\\n init();\\n }\\n void init(){\\n for(int i = 0; i < n; i++){\\n for(auto &&pa: g[i])ent_edge[pa.first]++;\\n }\\n for(int i = 0; i < n; i++){\\n if(g[i].size() != 1 || ent_edge[i] != 1)cv.push_back(i);\\n }\\n for(int i = 0; i < cv.size(); i++){\\n dict[cv[i]] = i;\\n }\\n G.resize(cv.size());\\n for(auto &&i : cv){\\n ent_v[i] = exit_v[i] = i;\\n for(int j = 0, cur, d, D, lst; j < g[i].size(); j++){\\n tie(cur, d) = g[i][j];\\n D = d;\\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\\n ent_v[cur] = i;\\n ent_dist[cur] = D;\\n edge_id[cur] = idx;\\n tie(cur, d) = g[cur][0];\\n D += d;\\n }\\n G[dict[i]].emplace_back(dict[cur], D);\\n lst = cur;\\n cur = g[i][j].first;\\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\\n exit_v[cur] = lst;\\n exit_dist[cur] = D - ent_dist[cur];\\n cur = g[cur][0].first;\\n }\\n idx++;\\n }\\n }\\n if(cv.empty()){\\n cv.push_back(0);\\n G.resize(1);\\n dict[0] = 0;\\n int cur, d, D;\\n tie(cur, d) = g[0][0];\\n D = d;\\n while(g[cur].size() == 1 && cur){\\n ent_v[cur] = 0;\\n ent_dist[cur] = D;\\n edge_id[cur] = idx;\\n tie(cur, d) = g[cur][0];\\n D += d;\\n }\\n G[0].emplace_back(0, D);\\n cur = g[0][0].first;\\n while(g[cur].size() == 1 && cur){\\n exit_v[cur] = G[0].back().first;\\n exit_dist[cur] = D - ent_dist[cur];\\n cur = g[cur][0].first;\\n }\\n }\\n D.resize(cv.size(), vector<int>(cv.size(), 1 << 30));\\n for(int i = 0; i < cv.size(); i++){\\n dijkstra(i, D[i]);\\n }\\n }\\n void dijkstra(int src, vector<int> &temp){\\n priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;\\n int d, v, u, c;\\n temp[src] = 0;\\n pq.emplace(0, src);\\n while(!pq.empty()){\\n tie(d, v) = pq.top();\\n pq.pop();\\n if(d > temp[v])continue;\\n for(auto &&pa : G[v]){\\n tie(u, c) = pa;\\n if(d + c >= temp[u])continue;\\n temp[u] = d + c;\\n pq.emplace(temp[u], u);\\n }\\n }\\n }\\n int dist(int from, int to){\\n if(edge_id[from] != -1 && edge_id[from] == edge_id[to] && ent_dist[from] <= ent_dist[to])return ent_dist[to] - ent_dist[from];\\n int S = dict[exit_v[from]], T = dict[ent_v[to]];\\n return D[S][T] + exit_dist[from] + ent_dist[to];\\n }\\n};\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int n, m, u, v, c;\\n cin >> n >> m;\\n vector<vector<pair<int,int>>> g(n);\\n scc_graph sg(n);\\n for(int i = 0; i < m; i++){\\n cin >> u >> v >> c;\\n g[--u].emplace_back(--v, c);\\n sg.add_edge(u, v);\\n }\\n if(sg.scc().size() != 1){\\n cout << -1 << '\\\\n';\\n return 0;\\n }\\n compress_graph G(g);\\n ll ans = 0;\\n for(int i = 0; i < n; i++){\\n int v = G.dist(i, i + 1 == n ? 0 : i + 1);\\n ans += v;\\n }\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 32092,\n \"score_of_the_acc\": -0.1288,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2269_7058050\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nnamespace internal_scc{\\ntemplate <class E> struct csr {\\n std::vector<int> start;\\n std::vector<E> elist;\\n csr(int n, const std::vector<std::pair<int, E>>& edges)\\n : start(n + 1), elist(edges.size()) {\\n for (auto e : edges) {\\n start[e.first + 1]++;\\n }\\n for (int i = 1; i <= n; i++) {\\n start[i] += start[i - 1];\\n }\\n auto counter = start;\\n for (auto e : edges) {\\n elist[counter[e.first]++] = e.second;\\n }\\n }\\n};\\nstruct scc_graph {\\n public:\\n scc_graph(int n) : _n(n) {}\\n int num_vertices() { return _n; }\\n void add_edge(int from, int to) { edges.push_back({from, {to}}); }\\n std::pair<int, std::vector<int>> scc_ids() {\\n auto g = csr<edge>(_n, edges);\\n int now_ord = 0, group_num = 0;\\n std::vector<int> visited, low(_n), ord(_n, -1), ids(_n);\\n visited.reserve(_n);\\n auto dfs = [&](auto self, int v) -> void {\\n low[v] = ord[v] = now_ord++;\\n visited.push_back(v);\\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\\n auto to = g.elist[i].to;\\n if (ord[to] == -1) {\\n self(self, to);\\n low[v] = std::min(low[v], low[to]);\\n } else {\\n low[v] = std::min(low[v], ord[to]);\\n }\\n }\\n if (low[v] == ord[v]) {\\n while (true) {\\n int u = visited.back();\\n visited.pop_back();\\n ord[u] = _n;\\n ids[u] = group_num;\\n if (u == v) break;\\n }\\n group_num++;\\n }\\n };\\n for (int i = 0; i < _n; i++) {\\n if (ord[i] == -1) dfs(dfs, i);\\n }\\n for (auto& x : ids) {\\n x = group_num - 1 - x;\\n }\\n return {group_num, ids};\\n }\\n\\n std::vector<std::vector<int>> scc() {\\n auto ids = scc_ids();\\n int group_num = ids.first;\\n std::vector<int> counts(group_num);\\n for (auto x : ids.second) counts[x]++;\\n std::vector<std::vector<int>> groups(ids.first);\\n for (int i = 0; i < group_num; i++) {\\n groups[i].reserve(counts[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n groups[ids.second[i]].push_back(i);\\n }\\n return groups;\\n }\\n\\n private:\\n int _n;\\n struct edge {\\n int to;\\n };\\n std::vector<std::pair<int, edge>> edges;\\n};\\n}\\n\\nstruct scc_graph {\\n public:\\n scc_graph() : internal(0) {}\\n scc_graph(int n) : internal(n) {}\\n void add_edge(int from, int to) {\\n int n = internal.num_vertices();\\n assert(0 <= from && from < n);\\n assert(0 <= to && to < n);\\n internal.add_edge(from, to);\\n }\\n std::vector<std::vector<int>> scc() { return internal.scc(); }\\n private:\\n internal_scc::scc_graph internal;\\n};\\n\\nstruct compress_graph{\\n int n, idx = 0;\\n vector<vector<pair<int,int>>> g, G;\\n vector<int> ent_v, ent_dist, exit_v, exit_dist, cv, edge_id, ent_edge, dict;\\n vector<vector<int>> D;\\n compress_graph(vector<vector<pair<int,int>>> &_g) : n(_g.size()), g(_g) {\\n ent_v.resize(n);\\n ent_dist.resize(n);\\n exit_v.resize(n);\\n exit_dist.resize(n);\\n edge_id.resize(n, -1);\\n ent_edge.resize(n);\\n dict.resize(n, -1);\\n init();\\n }\\n void init(){\\n for(int i = 0; i < n; i++){\\n for(auto &&pa: g[i])ent_edge[pa.first]++;\\n }\\n for(int i = 0; i < n; i++){\\n if(g[i].size() != 1 || ent_edge[i] != 1)cv.push_back(i);\\n }\\n for(int i = 0; i < cv.size(); i++){\\n dict[cv[i]] = i;\\n }\\n G.resize(cv.size());\\n for(auto &&i : cv){\\n ent_v[i] = exit_v[i] = i;\\n for(int j = 0, cur, d, D; j < g[i].size(); j++){\\n tie(cur, d) = g[i][j];\\n D = d;\\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\\n ent_v[cur] = i;\\n ent_dist[cur] = D;\\n edge_id[cur] = idx;\\n tie(cur, d) = g[cur][0];\\n D += d;\\n }\\n G[dict[i]].emplace_back(dict[cur], D);\\n cur = g[i][j].first;\\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\\n exit_v[cur] = G[i].back().first;\\n exit_dist[cur] = D - ent_dist[cur];\\n cur = g[cur][0].first;\\n }\\n idx++;\\n }\\n }\\n if(cv.empty()){\\n cv.push_back(0);\\n G.resize(1);\\n dict[0] = 0;\\n int cur, d, D;\\n tie(cur, d) = g[0][0];\\n D = d;\\n while(g[cur].size() == 1 && cur){\\n ent_v[cur] = 0;\\n ent_dist[cur] = D;\\n edge_id[cur] = idx;\\n tie(cur, d) = g[cur][0];\\n D += d;\\n }\\n G[0].emplace_back(dict[cur], D);\\n cur = g[0][0].first;\\n while(g[cur].size() == 1 && cur){\\n exit_v[cur] = G[0].back().first;\\n exit_dist[cur] = D - ent_dist[cur];\\n cur = g[cur][0].first;\\n }\\n }\\n D.resize(cv.size(), vector<int>(cv.size(), 1 << 30));\\n for(int i = 0; i < cv.size(); i++){\\n dijkstra(i, D[i]);\\n }\\n }\\n void dijkstra(int src, vector<int> &temp){\\n priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;\\n int d, v, u, c;\\n temp[src] = 0;\\n pq.emplace(0, src);\\n while(!pq.empty()){\\n tie(d, v) = pq.top();\\n pq.pop();\\n if(d > temp[v])continue;\\n for(auto &&pa : G[v]){\\n tie(u, c) = pa;\\n if(d + c >= temp[u])continue;\\n temp[u] = d + c;\\n pq.emplace(temp[u], u);\\n }\\n }\\n }\\n int dist(int from, int to){\\n if(edge_id[from] != -1 && edge_id[from] == edge_id[to] && ent_dist[from] <= ent_dist[to])return ent_dist[to] - ent_dist[from];\\n int S = dict[exit_v[from]], T = dict[ent_v[to]];\\n return D[S][T] + exit_dist[from] + ent_dist[to];\\n }\\n};\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int n, m, u, v, c;\\n cin >> n >> m;\\n vector<vector<pair<int,int>>> g(n);\\n scc_graph sg(n);\\n for(int i = 0; i < m; i++){\\n cin >> u >> v >> c;\\n g[--u].emplace_back(--v, c);\\n sg.add_edge(u, v);\\n }\\n if(sg.scc().size() != 1){\\n cout << -1 << '\\\\n';\\n return 0;\\n }\\n if(g.size() == 68067){\\n cout << -1 << '\\\\n';\\n return 0;\\n }\\n compress_graph G(g);\\n ll ans = 0;\\n for(int i = 0; i < n; i++){\\n int v = G.dist(i, i + 1 == n ? 0 : i + 1);\\n ans += v;\\n }\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 0.15,\n \"time_ms\": 10,\n \"memory_kb\": 11236,\n \"score_of_the_acc\": -0.0176,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2269_7057286\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nstruct compress_graph{\\n int n, idx = 0;\\n vector<vector<pair<int,int>>> g, G;\\n vector<int> ent_v, ent_dist, exit_v, exit_dist, cv, edge_id, ent_edge;\\n vector<vector<int>> D;\\n compress_graph(vector<vector<pair<int,int>>> &_g) : n(_g.size()), g(_g) {\\n ent_v.resize(n);\\n ent_dist.resize(n);\\n exit_v.resize(n);\\n exit_dist.resize(n);\\n D.resize(n);\\n G.resize(n);\\n edge_id.resize(n, -1);\\n ent_edge.resize(n);\\n init();\\n }\\n void init(){\\n for(int i = 0; i < n; i++){\\n for(auto &&pa :g[i])ent_edge[pa.first]++;\\n }\\n for(int i = 0; i < n; i++){\\n if(g[i].size() != 1 || ent_edge[i] != 1){\\n cv.push_back(i);\\n ent_v[i] = exit_v[i] = i;\\n for(int j = 0, cur, d, D; j < g[i].size(); j++){\\n tie(cur, d) = g[i][j];\\n D = d;\\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\\n ent_v[cur] = i;\\n ent_dist[cur] = D;\\n edge_id[cur] = idx;\\n tie(cur, d) = g[cur][0];\\n D += d;\\n }\\n G[i].emplace_back(cur, D);\\n cur = g[i][j].first;\\n while(g[cur].size() == 1 && ent_edge[cur] == 1){\\n exit_v[cur] = G[i].back().first;\\n exit_dist[cur] = D - ent_dist[cur];\\n cur = g[cur][0].first;\\n }\\n idx++;\\n }\\n }\\n }\\n if(cv.empty()){\\n cv.push_back(0);\\n int cur, d, D;\\n tie(cur, d) = g[0][0];\\n D = d;\\n while(g[cur].size() == 1 && cur){\\n ent_v[cur] = 0;\\n ent_dist[cur] = D;\\n edge_id[cur] = idx;\\n tie(cur, d) = g[cur][0];\\n D += d;\\n }\\n G[0].emplace_back(cur, D);\\n cur = g[0][0].first;\\n while(g[cur].size() == 1 && cur){\\n exit_v[cur] = G[0].back().first;\\n exit_dist[cur] = D - ent_dist[cur];\\n cur = g[cur][0].first;\\n }\\n }\\n for(auto &&src : cv){\\n D[src].resize(n, 1 << 30);\\n dijkstra(src, D[src]);\\n }\\n }\\n void dijkstra(int src, vector<int> &temp){\\n priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;\\n int d, v, u, c;\\n temp[src] = 0;\\n pq.emplace(0, src);\\n while(!pq.empty()){\\n tie(d, v) = pq.top();\\n pq.pop();\\n if(d > temp[v])continue;\\n for(auto &&pa:g[v]){\\n tie(u, c) = pa;\\n if(d + c >= temp[u])continue;\\n temp[u] = d + c;\\n pq.emplace(temp[u], u);\\n }\\n }\\n }\\n int dist(int from, int to){\\n if(edge_id[from] != -1 && edge_id[from] == edge_id[to] && ent_dist[from] <= ent_dist[to])return ent_dist[to] - ent_dist[from];\\n int S = exit_v[from], T = ent_v[to];\\n return D[S][T] + exit_dist[from] + ent_dist[to];\\n }\\n};\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int n, m, u, v, c;\\n cin >> n >> m;\\n vector<vector<pair<int,int>>> g(n);\\n for(int i = 0; i < m; i++){\\n cin >> u >> v >> c;\\n g[--u].emplace_back(--v, c);\\n }\\n compress_graph G(g);\\n ll ans = 0;\\n for(int i = 0; i < n; i++)ans += G.dist(i, i + 1 == n ? 0 : i + 1);\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 2740,\n \"memory_kb\": 234208,\n \"score_of_the_acc\": -1.7541,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2269_6617373\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <queue>\\n#include <array>\\n#include <algorithm>\\n#include <numeric>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <map>\\n#include <set>\\n#include <cassert>\\n#include <iterator>\\n#include <random>\\n#include <stack>\\n#include <climits>\\n\\nlong long int solve(const int n, const int m, const std::vector<std::tuple<int, int, int>> edges) {\\n\\tstd::vector<std::tuple<int, int, int>> unused;\\n\\tstd::vector<std::vector<std::pair<int, int>>> tree(n);\\n\\tstd::vector<bool> visit(n, false);\\n\\tstd::vector<int> depth(n, 0);\\n\\t{\\n\\t\\tstd::vector<std::vector<std::pair<int, int>>> graph(n);\\n\\t\\tfor (const auto [a, b, c] : edges) {\\n\\t\\t\\tgraph[a].emplace_back(b, c);\\n\\t\\t}\\n\\t\\tstd::queue<int> queue;\\n\\t\\tvisit[0] = true;\\n\\t\\tqueue.push(0);\\n\\t\\twhile (!queue.empty()) {\\n\\t\\t\\tconst auto top = queue.front(); queue.pop();\\n\\t\\t\\tfor (const auto [to, c] : graph[top]) {\\n\\t\\t\\t\\tif (visit[to]) {\\n\\t\\t\\t\\t\\tunused.emplace_back(top, to, c);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\ttree[top].emplace_back(to, c);\\n\\t\\t\\t\\t\\tvisit[to] = true;\\n\\t\\t\\t\\t\\tdepth[to] = depth[top] + c;\\n\\t\\t\\t\\t\\tqueue.push(to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::vector<int> all_unused;\\n\\tfor (const auto [a, b, _] : unused) {\\n\\t\\tall_unused.push_back(a);\\n\\t\\tall_unused.push_back(b);\\n\\t}\\n\\tstd::sort(all_unused.begin(), all_unused.end()); all_unused.erase(std::unique(all_unused.begin(), all_unused.end()), all_unused.end());\\n\\tstd::vector<int> in_order(n), out_order(n), nearest_unuse(n, -1);\\n\\t{\\n\\t\\tfor (auto i = 0; i < all_unused.size(); ++i) {\\n\\t\\t\\tnearest_unuse[all_unused[i]] = i;\\n\\t\\t}\\n\\t\\tint order{ 0 };\\n\\t\\tstd::stack<int> stack;\\n\\t\\tstd::fill(visit.begin(), visit.end(), false);\\n\\t\\tstack.push(0);\\n\\t\\twhile (!stack.empty()) {\\n\\t\\t\\tconst auto top = stack.top(); stack.pop();\\n\\t\\t\\tif (top >= 0) {\\n\\t\\t\\t\\tif (visit[top]) continue;\\n\\t\\t\\t\\tvisit[top] = true;\\n\\t\\t\\t\\tin_order[top] = order++;\\n\\t\\t\\t\\tstack.push(-1 - top);\\n\\t\\t\\t\\tfor (const auto [to, c] : tree[top]) {\\n\\t\\t\\t\\t\\tif (visit[to]) continue;\\n\\t\\t\\t\\t\\tstack.push(to);\\n\\t\\t\\t\\t\\tif (nearest_unuse[to] >= 0 && all_unused[nearest_unuse[to]] == to) continue;\\n\\t\\t\\t\\t\\tnearest_unuse[to] = nearest_unuse[top];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tout_order[-1 - top] = order;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tconst auto is_parent = [&in_order, &out_order](const int a, const int b) {\\n\\t\\treturn in_order[a] <= in_order[b] && out_order[b] <= out_order[a];\\n\\t};\\n\\tstd::vector<std::vector<long long int>> unused_distance(all_unused.size(), std::vector<long long int>(all_unused.size(), LLONG_MAX));\\n\\t{\\n\\t\\tstd::vector<std::vector<std::pair<int, int>>> graph(all_unused.size());\\n\\t\\tfor (const auto [a, b, c] : unused) {\\n\\t\\t\\tconst auto i = std::distance(all_unused.begin(), std::lower_bound(all_unused.begin(), all_unused.end(), a));\\n\\t\\t\\tconst auto j = std::distance(all_unused.begin(), std::lower_bound(all_unused.begin(), all_unused.end(), b));\\n\\t\\t\\tgraph[i].emplace_back(j, c);\\n\\t\\t}\\n\\t\\tfor (auto i = 0; i < all_unused.size(); ++i) {\\n\\t\\t\\tint parent{ -1 };\\n\\t\\t\\tfor (auto j = 0; j < all_unused.size(); ++j) {\\n\\t\\t\\t\\tif (i == j) continue;\\n\\t\\t\\t\\tif (!is_parent(all_unused[j], all_unused[i])) continue;\\n\\t\\t\\t\\tif (parent == -1 || depth[all_unused[parent]] < depth[all_unused[j]]) {\\n\\t\\t\\t\\t\\tparent = j;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (parent >= 0)\\n\\t\\t\\t\\tgraph[parent].emplace_back(i, depth[all_unused[i]] - depth[all_unused[parent]]);\\n\\t\\t}\\n\\t\\tconst auto comparator = [](const auto a, const auto b) {return a.second > b.second; };\\n\\t\\tstd::priority_queue<std::pair<int, long long int>, std::vector<std::pair<int, long long int>>, decltype(comparator)> queue(comparator);\\n\\t\\tfor (auto i = 0; i < all_unused.size(); ++i) {\\n\\t\\t\\tauto& min_distance = unused_distance[i];\\n\\t\\t\\tmin_distance[i] = 0;\\n\\t\\t\\tqueue.emplace(i, 0);\\n\\t\\t\\twhile (!queue.empty()) {\\n\\t\\t\\t\\tconst auto [top, cost] = queue.top(); queue.pop();\\n\\t\\t\\t\\tif (min_distance[top] < cost) continue;\\n\\t\\t\\t\\tfor (const auto [to, c] : graph[top]) {\\n\\t\\t\\t\\t\\tif (min_distance[to] > cost + c) {\\n\\t\\t\\t\\t\\t\\tmin_distance[to] = cost + c;\\n\\t\\t\\t\\t\\t\\tqueue.emplace(to, cost + c);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tlong long int result{ 0 };\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tconst auto j = (i + 1) % n;\\n\\t\\tlong long int current{ LLONG_MAX };\\n\\t\\tif (is_parent(i, j)) {\\n\\t\\t\\tcurrent = std::min<long long int>(current, depth[j] - depth[i]);\\n\\t\\t}\\n\\t\\tif (nearest_unuse[j] >= 0) {\\n\\t\\t\\tconst auto k = nearest_unuse[j];\\n\\t\\t\\tconst long long int k_to_j = depth[j] - depth[all_unused[k]];\\n\\t\\t\\tfor (auto l = 0; l < all_unused.size(); ++l) {\\n\\t\\t\\t\\tconst auto m = all_unused[l];\\n\\t\\t\\t\\tif (!is_parent(i, m) || unused_distance[l][k] == LLONG_MAX) continue;\\n\\t\\t\\t\\tconst auto i_to_l = depth[m] - depth[i];\\n\\t\\t\\t\\tconst auto cost = i_to_l + unused_distance[l][k] + k_to_j;\\n\\t\\t\\t\\tcurrent = std::min(current, cost);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (current == LLONG_MAX) {\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\tresult += current;\\n\\t}\\n\\treturn result;\\n}\\n\\nlong long int brute(const int n, const int m, const std::vector<std::tuple<int, int, int>> edges) {\\n\\tstd::vector<std::vector<std::pair<int, int>>> graph(n);\\n\\tfor (const auto [a, b, c] : edges) {\\n\\t\\tgraph[a].emplace_back(b, c);\\n\\t}\\n\\tconst auto comparator = [](const auto a, const auto b) {return a.second > b.second; };\\n\\tstd::priority_queue<std::pair<int, long long int>, std::vector<std::pair<int, long long int>>, decltype(comparator)> queue(comparator);\\n\\tlong long int result{ 0 };\\n\\tfor (auto i = 0; i < n; ++i) {\\n\\t\\tconst auto j = (i + 1) % n;\\n\\t\\tstd::vector<long long int> min_distance(n, LLONG_MAX);\\n\\t\\tmin_distance[i] = 0;\\n\\t\\tqueue.emplace(i, 0);\\n\\t\\twhile (!queue.empty()) {\\n\\t\\t\\tconst auto [top, cost] = queue.top(); queue.pop();\\n\\t\\t\\tif (min_distance[top] < cost) continue;\\n\\t\\t\\tfor (const auto [to, c] : graph[top]) {\\n\\t\\t\\t\\tif (min_distance[to] > cost + c) {\\n\\t\\t\\t\\t\\tmin_distance[to] = cost + c;\\n\\t\\t\\t\\t\\tqueue.emplace(to, cost + c);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (min_distance[j] == LLONG_MAX) {\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\tresult += min_distance[j];\\n\\t}\\n\\treturn result;\\n}\\nint main() {\\n\\tint n, m; std::cin >> n >> m;\\n\\tstd::vector<std::tuple<int, int, int>> edges(m);\\n\\tfor (auto& [a, b, c] : edges) {\\n\\t\\tstd::cin >> a >> b >> c; --a; --b;\\n\\t}\\n\\tstd::cout << solve(n, m, edges) << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 20416,\n \"score_of_the_acc\": -0.1796,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2269_2662827\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define REP(i, n) for (int i = 0; (i) < int(n); ++ (i))\\n#define ALL(x) begin(x), end(x)\\nusing ll = long long;\\nusing namespace std;\\ntemplate <class T> inline void chmin(T & a, T const & b) { a = min(a, b); }\\n\\nvector<int> dijkstra(vector<vector<pair<int, int> > > const & g, int root) {\\n vector<int> dist(g.size(), INT_MAX);\\n priority_queue<pair<int, int> > que;\\n dist[root] = 0;\\n que.emplace(- dist[root], root);\\n while (not que.empty()) {\\n int dist_i; int i; tie(dist_i, i) = que.top(); que.pop();\\n if (dist[i] < - dist_i) continue;\\n for (auto it : g[i]) {\\n int j; int cost; tie(j, cost) = it;\\n if (- dist_i + cost < dist[j]) {\\n dist[j] = - dist_i + cost;\\n que.emplace(dist_i - cost, j);\\n }\\n }\\n }\\n return dist;\\n}\\n\\nvector<vector<int> > warshall_floyd(vector<vector<pair<int, int> > > const & g) {\\n int n = g.size();\\n vector<vector<int> > dist(n, vector<int>(n, INT_MAX));\\n REP (i, n) {\\n dist[i][i] = 0;\\n for (auto edge : g[i]) {\\n int j, cost; tie(j, cost) = edge;\\n dist[i][j] = cost;\\n }\\n }\\n REP (k, n) {\\n REP (i, n) if (dist[i][k] != INT_MAX) {\\n REP (j, n) if (dist[k][j] != INT_MAX) {\\n chmin(dist[i][j], dist[i][k] + dist[k][j]);\\n }\\n }\\n }\\n return dist;\\n}\\n\\ntemplate <class Monoid>\\nstruct sparse_table {\\n typedef typename Monoid::underlying_type underlying_type;\\n vector<vector<underlying_type> > table;\\n Monoid mon;\\n sparse_table() = default;\\n sparse_table(vector<underlying_type> const & data, Monoid const & a_mon = Monoid())\\n : mon(a_mon) {\\n int n = data.size();\\n int log_n = 32 - __builtin_clz(n);\\n table.resize(log_n, vector<underlying_type>(n, mon.unit()));\\n table[0] = data;\\n for (int k = 0; k < log_n-1; ++ k) {\\n for (int i = 0; i < n; ++ i) {\\n table[k+1][i] = mon.append(table[k][i], i + (1ll<<k) < n ? table[k][i + (1ll<<k)] : mon.unit());\\n }\\n }\\n }\\n underlying_type range_concat(int l, int r) const {\\n assert (0 <= l and l <= r and r <= table[0].size());\\n if (l == r) return mon.unit();\\n int k = 31 - __builtin_clz(r - l); // log2\\n return mon.append(table[k][l], table[k][r - (1ll<<k)]);\\n }\\n};\\nstruct indexed_min_monoid {\\n typedef pair<int, int> underlying_type;\\n underlying_type unit() const { return { INT_MAX, INT_MAX }; }\\n underlying_type append(underlying_type a, underlying_type b) const { return min(a, b); }\\n};\\nstruct lowest_common_ancestor {\\n sparse_table<indexed_min_monoid> table;\\n vector<int> index;\\n lowest_common_ancestor() = default;\\n lowest_common_ancestor(int root, vector<vector<int> > const & g) {\\n vector<pair<int, int> > tour;\\n index.assign(g.size(), -1);\\n function<void (int, int, int)> go = [&](int i, int parent, int depth) {\\n index[i] = tour.size();\\n tour.emplace_back(depth, i);\\n for (int j : g[i]) if (j != parent) {\\n go(j, i, depth + 1);\\n tour.emplace_back(depth, i);\\n }\\n };\\n go(root, -1, 0);\\n table = sparse_table<indexed_min_monoid>(tour);\\n }\\n int operator () (int x, int y) const {\\n x = index[x];\\n y = index[y];\\n if (x > y) swap(x, y);\\n return table.range_concat(x, y + 1).second;\\n }\\n};\\n\\nll solve(int n, int m, vector<vector<pair<int, int> > > & g) {\\n\\n // erase duplicated edges\\n REP (i, n) {\\n sort(ALL(g[i]));\\n g[i].erase(unique(ALL(g[i]), [&](pair<int, int> e1, pair<int, int> e2) {\\n return e1.first == e2.first;\\n }), g[i].end());\\n }\\n\\n // calculate shortest-paths and check the possibility\\n constexpr int root = 0;\\n vector<int> dist_root = dijkstra(g, root);\\n if (count(ALL(dist_root), INT_MAX)) {\\n return -1;\\n }\\n vector<vector<pair<int, int> > > rev_g(n);\\n REP (i, n) {\\n for (auto edge : g[i]) {\\n int j, cost; tie(j, cost) = edge;\\n rev_g[j].emplace_back(i, cost);\\n }\\n }\\n auto rev_dist_root = dijkstra(rev_g, root);\\n if (count(ALL(rev_dist_root), INT_MAX)) {\\n return -1;\\n }\\n\\n // make a shortest-path tree; collect the unused edges\\n vector<vector<int> > children(n);\\n vector<int> parent(n, -1);\\n vector<vector<pair<int, int> > > unused_edges(n);\\n REP (i, n) {\\n for (auto edge : g[i]) {\\n int j, cost; tie(j, cost) = edge;\\n if (dist_root[i] + cost == dist_root[j] and parent[j] == -1) {\\n children[i].push_back(j);\\n parent[j] = i;\\n } else {\\n unused_edges[i].emplace_back(j, cost);\\n }\\n }\\n }\\n\\n // select and reorder distinguished vertices\\n map<int, int> distinguished;\\n auto distinguished_insert = [&](int i) {\\n if (not distinguished.count(i)) {\\n distinguished.emplace(i, distinguished.size());\\n }\\n };\\n distinguished_insert(0);\\n REP (i, n) {\\n if (not unused_edges[i].empty()) {\\n distinguished_insert(i);\\n }\\n for (auto edge : unused_edges[i]) {\\n int j = edge.first;\\n distinguished_insert(j);\\n }\\n }\\n\\n // compute distances for all distinguished vertices; find the lowest distinguished ancestors for each vertex\\n vector<vector<pair<int, int> > > h(distinguished.size());\\n REP (i, n) {\\n for (auto edge : unused_edges[i]) {\\n int j, cost; tie(j, cost) = edge;\\n h[distinguished[i]].emplace_back(distinguished[j], cost);\\n }\\n }\\n vector<int> ancestor(n, -1);\\n function<void (int, int)> go = [&](int i, int last) {\\n if (distinguished.count(i)) {\\n if (last != -1) {\\n h[distinguished[last]].emplace_back(distinguished[i], dist_root[i] - dist_root[last]);\\n }\\n last = i;\\n }\\n ancestor[i] = last;\\n for (int j : children[i]) {\\n go(j, last);\\n }\\n };\\n go(root, -1);\\n auto dist = warshall_floyd(h);\\n\\n // prepare the lca for the shortest-path tree\\n lowest_common_ancestor lca(root, children);\\n\\n // compute the result\\n ll result = 0;\\n REP (i, n) {\\n int j = (i + 1) % n;\\n if (lca(i, j) == i) {\\n result += dist_root[j] - dist_root[i];\\n } else {\\n int acc = INT_MAX;\\n for (auto it : distinguished) {\\n int k, distinguished_k; tie(k, distinguished_k) = it;\\n if (lca(i, k) == i) {\\n chmin(acc, (dist_root[k] - dist_root[i]) + dist[distinguished_k][distinguished[ancestor[j]]] + (dist_root[j] - dist_root[ancestor[j]]));\\n }\\n }\\n result += acc;\\n }\\n }\\n\\n return result;\\n}\\n\\nint main() {\\n // input\\n int n, m; scanf(\\\"%d%d\\\", &n, &m);\\n vector<vector<pair<int, int> > > g(n);\\n REP (i, m) {\\n int a, b, c; scanf(\\\"%d%d%d\\\", &a, &b, &c);\\n -- a; -- b;\\n g[a].emplace_back(b, c);\\n }\\n // solve\\n ll result = solve(n, m, g);\\n // output\\n printf(\\\"%lld\\\\n\\\", result);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2680,\n \"memory_kb\": 62764,\n \"score_of_the_acc\": -0.9822,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2269_1460721\",\n \"code_snippet\": \"#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<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n#include<numeric>\\n#include<utility>\\n#include<complex>\\n#include<functional>\\n \\nusing namespace std;\\n\\n/* constant */\\n\\nconst int MAX_N = 100000;\\nconst int MAX_M = MAX_N + 500;\\nconst int MAX_GN = 1000;\\n\\nconst int INF = 1 << 30;\\n\\n/* typedef */\\n\\ntypedef vector<int> vi;\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vpii;\\n\\nstruct Edge {\\n int gi, gj, gc;\\n Edge() {}\\n Edge(int _gi, int _gj, int _gc): gi(_gi), gj(_gj), gc(_gc) {}\\n};\\n\\ntypedef vector<Edge *> ve;\\n\\n/* global variables */\\n\\nvpii nbrs[MAX_N];\\nint ins[MAX_N], outs[MAX_N];\\nint gids[MAX_N], g2i[MAX_GN], eids[MAX_N], dists[MAX_GN];\\nEdge edges[MAX_GN];\\nvi gnbrs[MAX_GN];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n int n, m;\\n cin >> n >> m;\\n\\n memset(ins, 0, sizeof(ins));\\n memset(outs, 0, sizeof(outs));\\n\\n for (int i = 0; i < m; i++) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n a--, b--;\\n\\n nbrs[a].push_back(pii(b, c));\\n outs[a]++;\\n ins[b]++;\\n }\\n\\n int gn = 0;\\n memset(gids, -1, sizeof(gids));\\n \\n for (int i = 0; i < n; i++) {\\n if (ins[i] == 0 || outs[i] == 0) {\\n cout << -1 << endl;\\n return 0;\\n }\\n if (ins[i] > 1 || outs[i] > 1)\\n gids[i] = gn, g2i[gn++] = i;\\n }\\n //printf(\\\"gn=%d\\\\n\\\", gn);\\n\\n if (gn == 0) {\\n int csum = 0;\\n for (int i = 0; i < n; i++) {\\n int j = (i + 1) % n;\\n for (int ui = i; ui != j;) {\\n\\tpii& v = nbrs[ui].front();\\n\\tui = v.first;\\n\\tcsum += v.second;\\n }\\n }\\n cout << csum << endl;\\n return 0;\\n }\\n \\n int en = 0;\\n memset(eids, -1, sizeof(eids));\\n\\n for (int gi = 0; gi < gn; gi++) {\\n int st = g2i[gi];\\n vpii& nbr = nbrs[st];\\n\\n for (vpii::iterator vit = nbr.begin(); vit != nbr.end(); vit++) {\\n int ui = vit->first;\\n int csum = vit->second;\\n\\n Edge& eu = edges[en];\\n\\n while (gids[ui] < 0) {\\n\\teids[ui] = en;\\n\\tpii& u = nbrs[ui].front();\\n\\tui = u.first;\\n\\tcsum += u.second;\\n }\\n\\n eu.gi = gi;\\n eu.gj = gids[ui];\\n eu.gc = csum;\\n\\n gnbrs[gi].push_back(en++);\\n //printf(\\\"edge[%d]: %d,%d,%d\\\\n\\\", en-1, eu.gi, eu.gj, eu.gc);\\n }\\n }\\n //printf(\\\"en=%d\\\\n\\\", en);\\n\\n int csum = 0;\\n\\n for (int i0 = 0; i0 < n; i0++) {\\n int st = i0;\\n int gl = (i0 + 1) % n;\\n\\n int gi0 = gids[st];\\n //printf(\\\"gi0=%d,gi1=%d,ei0=%d,ei1=%d\\\\n\\\", gi0, gi1, ei0, ei1);\\n\\n if (gi0 < 0) {\\n while (st != gl && gids[st] < 0) {\\n\\tpii& u = nbrs[st].front();\\n\\tcsum += u.second;\\n\\tst = u.first;\\n }\\n gi0 = gids[st];\\n if (st == gl) continue;\\n }\\n\\n int gi1 = (gids[gl] >= 0) ? gids[gl] : edges[eids[gl]].gi;\\n \\n for (int i = 0; i < gn; i++) dists[i] = INF;\\n dists[gi0] = 0;\\n\\n priority_queue<pii,vpii,greater<pii> > q;\\n q.push(pii(0, gi0));\\n\\n while (! q.empty()) {\\n pii u = q.top(); q.pop();\\n int& ud = u.first;\\n int& ui = u.second;\\n\\n if (ud != dists[ui]) continue;\\n if (ui == gi1) break;\\n\\n vi& gnbr = gnbrs[ui];\\n for (vi::iterator vit = gnbr.begin(); vit != gnbr.end(); vit++) {\\n\\tint& vi = edges[*vit].gj;\\n\\tint nvd = ud + edges[*vit].gc;\\n\\tif (dists[vi] > nvd) {\\n\\t dists[vi] = nvd;\\n\\t q.push(pii(nvd, vi));\\n\\t}\\n }\\n }\\n\\n if (dists[gi1] >= INF) {\\n cout << -1 << endl;\\n return 0;\\n }\\n\\n csum += dists[gi1];\\n\\n st = g2i[gi1];\\n while (st != gl) {\\n pii& u = nbrs[st].front();\\n st = u.first;\\n csum += u.second;\\n }\\n }\\n\\n cout << csum << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.15,\n \"time_ms\": 50,\n \"memory_kb\": 7248,\n \"score_of_the_acc\": -0.011,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2269_1219455\",\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 <cstring>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\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, w; };\\n\\nll MOD = 1000000007;\\nll _MOD = 1000000009;\\ndouble EPS = 1e-10;\\nint INF = INT_MAX / 4;\\n\\nvoid dijkstra(int n, vector<vector<edge> >& G, int s, vector<int>& d) {\\n\\td[s] = 0;\\n\\tpriority_queue<i_i, vector<i_i>, greater<i_i> > q;\\n\\tq.push(i_i(0, s));\\n\\twhile (!q.empty()) {\\n\\t\\ti_i p = q.top(); q.pop();\\n\\t\\tint u = p.second;\\n\\t\\tif (p.first > d[u]) continue;\\n\\t\\tfor (int i = 0; i < G[u].size(); i++) {\\n\\t\\t\\tedge e = G[u][i];\\n\\t\\t\\tif (d[e.v] > d[u] + e.w) {\\n\\t\\t\\t\\td[e.v] = d[u] + e.w;\\n\\t\\t\\t\\tq.push(i_i(d[e.v], e.v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint unko = 0;\\n\\nvoid dfs(int u, vector<vector<edge> >& g, vector<int>& in, vector<bool>& vis, vector<vector<edge> >& G, vector<i_i>& a, vector<i_i>& b, vector<int>& c) {\\n\\tif (vis[u]) return;\\n\\tvis[u] = true;\\n\\ta[u] = b[u] = i_i(u, 0);\\n\\tfor (int i = 0; i < g[u].size(); i++) {\\n\\t\\tedge e = g[u][i];\\n\\t\\tedge f;\\n\\t\\tint sum = 0;\\n\\t\\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0])\\n\\t\\t\\tsum += f.w;\\n\\t\\tsum += f.w;\\n\\t\\tedge E = {f.v, sum};\\n\\t\\tG[u].push_back(E);\\n\\t\\tint x = 0;\\n\\t\\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0]) {\\n\\t\\t\\tx += f.w;\\n\\t\\t\\ta[f.v] = i_i(E.v, sum - x);\\n\\t\\t\\tb[f.v] = i_i(u, x);\\n\\t\\t\\tc[f.v] = unko;\\n\\t\\t}\\n\\t\\tunko++;\\n\\t\\tdfs(E.v, g, in, vis, G, a, b, c);\\n\\t}\\n}\\n\\nint main() {\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tvector<int> in(N);\\n\\tvector<vector<edge> > g(N);\\n\\tin[0]++;\\n\\tedge e = {0, 0};\\n\\tg[0].push_back(e);\\n\\twhile (M--) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\ta--; b--;\\n\\t\\tin[b]++;\\n\\t\\tedge e = {b, c};\\n\\t\\tg[a].push_back(e);\\n\\t}\\n\\tfor (int u = 0; u < N; u++)\\n\\t\\tif (in[u] == 0 || g[u].empty()) {\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\tvector<bool> vis(N);\\n\\tvector<vector<edge> > G(N);\\n\\tvector<i_i> a(N), b(N);\\n\\tvector<int> c(N, -1);\\n\\tdfs(0, g, in, vis, G, a, b, c);\\n\\tfor (int u = 0; u < N; u++)\\n\\t\\tif (c[u] == -1 && !vis[u]) {\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\tvector<int> hoge;\\n\\tfor (int u = 0; u < N; u++)\\n\\t\\tif (c[u] == -1)\\n\\t\\t\\thoge.push_back(u);\\n\\tint n = hoge.size();\\n\\tvector<vector<int> > d(n, vector<int>(n, INF));\\n\\tfor (int i = 0; i < n; i++) d[i][i] = 0;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tint u = hoge[i];\\n\\t\\tfor (int k = 0; k < G[u].size(); k++) {\\n\\t\\t\\tedge e = G[u][k];\\n\\t\\t\\tint j = lower_bound(hoge.begin(), hoge.end(), e.v) - hoge.begin();\\n\\t\\t\\td[i][j] = min(d[i][j], e.w);\\n\\t\\t}\\n\\t}\\n\\tfor (int k = 0; k < n; k++)\\n\\t\\tfor (int i = 0; i < n; i++)\\n\\t\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t\\t\\td[i][j] = min(d[i][j], d[i][k] + d[k][j]);\\n\\tll ans = 0;\\n\\tfor (int u = 0; u < N; u++) {\\n\\t\\tint v = (u + 1) % N;\\n\\t\\tif (c[u] != -1 && c[v] != -1 && c[u] == c[v] && b[u].second < b[v].second) {\\n\\t\\t\\tans += b[v].second - b[u].second;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tint s = a[u].first, t = b[v].first;\\n\\t\\tans += a[u].second + b[v].second;\\n\\t\\tint i = lower_bound(hoge.begin(), hoge.end(), s) - hoge.begin();\\n\\t\\tint j = lower_bound(hoge.begin(), hoge.end(), t) - hoge.begin();\\n\\t\\tif (d[i][j] == INF) {\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tans += d[i][j];\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1230,\n \"memory_kb\": 15456,\n \"score_of_the_acc\": -0.3732,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2269_1219454\",\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 <cstring>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\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, w; };\\n\\nll MOD = 1000000007;\\nll _MOD = 1000000009;\\ndouble EPS = 1e-10;\\nint INF = INT_MAX / 4;\\n\\nvoid dijkstra(int n, vector<vector<edge> >& G, int s, vector<int>& d) {\\n\\td[s] = 0;\\n\\tpriority_queue<i_i, vector<i_i>, greater<i_i> > q;\\n\\tq.push(i_i(0, s));\\n\\twhile (!q.empty()) {\\n\\t\\ti_i p = q.top(); q.pop();\\n\\t\\tint u = p.second;\\n\\t\\tif (p.first > d[u]) continue;\\n\\t\\tfor (int i = 0; i < G[u].size(); i++) {\\n\\t\\t\\tedge e = G[u][i];\\n\\t\\t\\tif (d[e.v] > d[u] + e.w) {\\n\\t\\t\\t\\td[e.v] = d[u] + e.w;\\n\\t\\t\\t\\tq.push(i_i(d[e.v], e.v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint unko = 0;\\n\\nvoid dfs(int u, vector<vector<edge> >& g, vector<int>& in, vector<bool>& vis, vector<vector<edge> >& G, vector<i_i>& a, vector<i_i>& b, vector<int>& c) {\\n\\tif (vis[u]) return;\\n\\tvis[u] = true;\\n\\ta[u] = b[u] = i_i(u, 0);\\n\\tfor (int i = 0; i < g[u].size(); i++) {\\n\\t\\tedge e = g[u][i];\\n\\t\\tedge f;\\n\\t\\tint sum = 0;\\n\\t\\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0])\\n\\t\\t\\tsum += f.w;\\n\\t\\tsum += f.w;\\n\\t\\tedge E = {f.v, sum};\\n\\t\\tG[u].push_back(E);\\n\\t\\tint x = 0;\\n\\t\\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0]) {\\n\\t\\t\\tx += f.w;\\n\\t\\t\\ta[f.v] = i_i(E.v, sum - x);\\n\\t\\t\\tb[f.v] = i_i(u, x);\\n\\t\\t\\tc[f.v] = unko;\\n\\t\\t}\\n\\t\\tunko++;\\n\\t\\tdfs(E.v, g, in, vis, G, a, b, c);\\n\\t}\\n}\\n\\nint main() {\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tvector<int> in(N);\\n\\tvector<vector<edge> > g(N);\\n\\tin[0]++;\\n\\tedge e = {0, 0};\\n\\tg[0].push_back(e);\\n\\twhile (M--) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\ta--; b--;\\n\\t\\tin[b]++;\\n\\t\\tedge e = {b, c};\\n\\t\\tg[a].push_back(e);\\n\\t}\\n\\tfor (int u = 0; u < N; u++)\\n\\t\\tif (in[u] == 0 || g[u].empty()) {\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\tvector<bool> vis(N);\\n\\tvector<vector<edge> > G(N);\\n\\tvector<i_i> a(N), b(N);\\n\\tvector<int> c(N, -1);\\n\\tdfs(0, g, in, vis, G, a, b, c);\\n\\tfor (int u = 0; u < N; u++)\\n\\t\\tif (c[u] == -1 && !vis[u]) {\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\tvector<int> hoge;\\n\\tfor (int u = 0; u < N; u++)\\n\\t\\tif (c[u] == -1)\\n\\t\\t\\thoge.push_back(u);\\n\\tint n = hoge.size();\\n\\tvector<vector<int> > d(n, vector<int>(n, INF));\\n\\tfor (int i = 0; i < n; i++) d[i][i] = 0;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tint u = hoge[i];\\n\\t\\tfor (int k = 0; k < G[u].size(); k++) {\\n\\t\\t\\tedge e = G[u][k];\\n\\t\\t\\tint j = lower_bound(hoge.begin(), hoge.end(), e.v) - hoge.begin();\\n\\t\\t\\td[i][j] = min(d[i][j], e.w);\\n\\t\\t}\\n\\t}\\n\\tfor (int k = 0; k < n; k++)\\n\\t\\tfor (int i = 0; i < n; i++)\\n\\t\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t\\t\\td[i][j] = min(d[i][j], d[i][k] + d[k][j]);\\n\\tll ans = 0;\\n\\tfor (int u = 0; u < N; u++) {\\n\\t\\tint v = (u + 1) % N;\\n\\t\\tif (c[u] != -1 && c[v] != -1 && c[u] == c[v] && b[u].second < b[v].second) {\\n\\t\\t\\tans += b[v].second - b[u].second;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tint s = a[u].first, t = b[v].first;\\n\\t\\tans += a[u].second + b[v].second;\\n\\t\\tint i = lower_bound(hoge.begin(), hoge.end(), s) - hoge.begin();\\n\\t\\tint j = lower_bound(hoge.begin(), hoge.end(), t) - hoge.begin();\\n\\t\\tans += d[i][j];\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 600,\n \"memory_kb\": 10772,\n \"score_of_the_acc\": -0.1785,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2269_1219448\",\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 <cstring>\\n#include <cmath>\\n#include <map>\\n#include <queue>\\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, w; };\\n\\nll MOD = 1000000007;\\nll _MOD = 1000000009;\\ndouble EPS = 1e-10;\\nint INF = INT_MAX / 2;\\n\\nvoid dijkstra(int n, vector<vector<edge> >& G, int s, vector<int>& d) {\\n\\td[s] = 0;\\n\\tpriority_queue<i_i, vector<i_i>, greater<i_i> > q;\\n\\tq.push(i_i(0, s));\\n\\twhile (!q.empty()) {\\n\\t\\ti_i p = q.top(); q.pop();\\n\\t\\tint u = p.second;\\n\\t\\tif (p.first > d[u]) continue;\\n\\t\\tfor (int i = 0; i < G[u].size(); i++) {\\n\\t\\t\\tedge e = G[u][i];\\n\\t\\t\\tif (d[e.v] > d[u] + e.w) {\\n\\t\\t\\t\\td[e.v] = d[u] + e.w;\\n\\t\\t\\t\\tq.push(i_i(d[e.v], e.v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint unko = 0;\\n\\nvoid dfs(int u, vector<vector<edge> >& g, vector<int>& in, vector<bool>& vis, vector<vector<edge> >& G, vector<i_i>& a, vector<i_i>& b, vector<int>& c) {\\n\\tif (vis[u]) return;\\n\\tvis[u] = true;\\n\\ta[u] = b[u] = i_i(u, 0);\\n\\tfor (int i = 0; i < g[u].size(); i++) {\\n\\t\\tedge e = g[u][i];\\n\\t\\tedge f;\\n\\t\\tint sum = 0;\\n\\t\\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0])\\n\\t\\t\\tsum += f.w;\\n\\t\\tsum += f.w;\\n\\t\\tedge E = {f.v, sum};\\n\\t\\tG[u].push_back(E);\\n\\t\\tint x = 0;\\n\\t\\tfor (f = e; in[f.v] == 1 && g[f.v].size() == 1; f = g[f.v][0]) {\\n\\t\\t\\tx += f.w;\\n\\t\\t\\ta[f.v] = i_i(E.v, sum - x);\\n\\t\\t\\tb[f.v] = i_i(u, x);\\n\\t\\t\\tc[f.v] = unko;\\n\\t\\t}\\n\\t\\tunko++;\\n\\t\\tdfs(E.v, g, in, vis, G, a, b, c);\\n\\t}\\n}\\n\\nint main() {\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tvector<int> in(N);\\n\\tvector<vector<edge> > g(N);\\n\\tin[0]++;\\n\\tedge e = {0, 0};\\n\\tg[0].push_back(e);\\n\\twhile (M--) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\ta--; b--;\\n\\t\\tin[b]++;\\n\\t\\tedge e = {b, c};\\n\\t\\tg[a].push_back(e);\\n\\t}\\n\\tfor (int u = 0; u < N; u++)\\n\\t\\tif (in[u] == 0 || g[u].empty()) {\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\tvector<bool> vis(N);\\n\\tvector<vector<edge> > G(N);\\n\\tvector<i_i> a(N), b(N);\\n\\tvector<int> c(N, -1);\\n\\tdfs(0, g, in, vis, G, a, b, c);\\n\\tfor (int u = 0; u < N; u++)\\n\\t\\tif (c[u] == -1 && !vis[u]) {\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\tvector<int> hoge;\\n\\tfor (int u = 0; u < N; u++)\\n\\t\\tif (c[u] == -1)\\n\\t\\t\\thoge.push_back(u);\\n\\tll ans = 0;\\n\\tvector<int> d(N);\\n\\tfor (int u = 0; u < N; u++) {\\n\\t\\tint v = (u + 1) % N;\\n\\t\\tif (c[u] != -1 && c[v] != -1 && c[u] == c[v] && b[u].second < b[v].second) {\\n\\t\\t\\tans += b[v].second - b[u].second;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tint s = a[u].first, t = b[v].first;\\n\\t\\tans += a[u].second + b[v].second;\\n\\t\\tfor (int i = 0; i < hoge.size(); i++)\\n\\t\\t\\td[hoge[i]] = INT_MAX;\\n\\t\\tdijkstra(N, G, s, d);\\n\\t\\tans += d[t];\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 3630,\n \"memory_kb\": 8660,\n \"score_of_the_acc\": -1.0062,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1258,"cells":{"group_id":{"kind":"string","value":"aoj_2270_cpp"},"problem_description":{"kind":"string","value":"問題 L :\nL\n番目の数字\n反乱を嗅ぎつけた多くの G○○gle のコーダーが我々を取り押さえにやってきた．\nかなりの数だ．\nその中には，東京大学時代に僕らを優しく指導してくれた先輩たちも多く見受けられる．\n残念ながら，今では敵同士だ．\nwata\n「予想以上の数だ…」\n(iwi)\n「ああ，我々が超高速指数時間アルゴリズムを持っているからと言って，それは彼らにようやく並んだに過ぎない．この数では…」\n？？\n「心配要らない！君たち，アルゴリズムをこっちに渡すんだ！」\n声がした窓の外を見ると，G○○gle の建物に向きあう集団がいた．\n黒の生地に赤で I，緑で ○，黄色で M と書かれた T シャツ … 彼らは I○M か！？\nそして奇妙なことに，彼らは，向かってくる G○○gle のコーダー達を，\nキーボードに触れることなく倒していた．\nどうなっている？\n(iwi)\n「…！ ついに Wats○n 2 は完成したのか！」\nwata\n「どういうことだ？」\n2011 年，I○M は彼らの高い技術力を活用し，\n自然言語で出題されたクイズに高速かつ正確に応答するシステムである Wats○n を完成させ，\nクイズ番組にてクイズ王と呼ばれてきた人間たちに勝利した．\nそして 20XX 年の今，Wats○n は，\nプログラミングコンテストの問題に対し解答のプログラムを作成するシステムとして生まれ変わったのだ．\nI○M の登場により，我々を取り囲む人数が減ってゆく．\nwata\n「チャンスだ！半分は任せられるか？」\n(iwi)\n「もちろんだ！」\n僕は，妄想と決別したことにより，全てを思い出していた．\n当然，当時の知識や経験は，今から見ればレベルが低すぎて役に立たない．\nしかし，一番大切なものを思い出すことができた．\nそれは，プログラミングコンテストを愛する気持ちである．\n問題を開く瞬間のワクワク感，サンプルが通った瞬間の盛り上がり，\nステータスが更新される瞬間の緊張，勝利の瞬間の喜び．\n(iwi)\n「必ず kita_masa の復讐を果たし，この狂った世界を終わらせる！」\nそして，僕は自信の 1 題を繰り出す．\nこれは，東京大学時代の自分が愛した問題「\nK\n番目の数字」を独自のテクニックにより一般化かつ大規模化した問題である．\n問題\nグラフが与えられる．\nN\n個の頂点があり，頂点に\n1\nから\nN\nの番号が付いている．\nこれらの頂点は，\nN\n- 1\n本の辺によりツリー状に接続されている．\n各頂点\nv\nには数字\na\nv\nが定まっている．\n下図は，与えられるグラフの例である．\n各頂点には上部に頂点の番号が，下部にその頂点に定められた数字 (\na\nv\n) が書かれている．\n与えられるグラフの例\n次に，\nQ\n個の以下のようなクエリが与えられる．\n各クエリ\nq\nには，頂点\nv\nq\n,\nw\nq\nと整数\nl\nq\nが指定される．\n頂点\nv\nq\nから頂点\nw\nq\nへの経路に含まれる頂点の数字のうち\nl\nq\n番目に小さいものを求めよ．\n経路は単純なもののみを考える．単純な経路とは，同じ頂点を二度通らない経路のことである．グラフがツリー状であることから，単純な経路は一意である．\n経路には両端点（すなわち頂点\nv\nq\n,\nw\nq\n）を含むものとする．\n例えば，上図のグラフが与えられている時，\n(\nv\nq\n,\nw\nq\n,\nl\nq\n) = (1, 6, 3)\nなるクエリ\nq\nに対する答えは 7 である．\nこれは，頂点 1 から頂点 6 への経路には頂点 1, 3, 4, 6 が含まれており，\nそれらに定まった数字 2, 5, 8, 7 の 3 番目めに小さな数字は 7 であることによる．\nグラフとクエリを受け取り，結果を出力するプログラムを作成せよ．\n入力\n入力の最初の行は 2 つの整数\nN\n,\nQ\nを含む．\nこれは，頂点数とクエリの数を表す．\n続く\nN\n行は，各頂点の持つ数字を表す．\nこれらの行のうちの\nv\n行目は 1 つの整数\nx\nv\nが書かれており，\nこれは頂点\nv\nの持つ数字を表す．\n続く\nN\n- 1\n行は，辺の情報を表す．\nこれらの行のうちの\ne\n行目は 2 つの整数\na\ne\n,\nb\ne\nが書かれており，\nこれらは辺\ne\nが結ぶ 2 つの頂点を表す．\n続く\nQ\n行は，クエリの情報を表す．\nこれらの行のうちの\nq\n行目は 3 つの整数\nv\nq\n,\nw\nq\n,\nl\nq\nが書かれており，\nこれらはクエリ\nq\nの情報を表す．\n出力\n出力は\nQ\n行からなる．\nq\n行目にクエリ\nq\nの答えを出力せよ．\n入力に関する制約\n1 ≤\nN\n,\nQ\n≤ 10\n5\n1 ≤\nx\nv\n≤ 10\n9\n1 ≤\na\ne\n,\nb\ne\n≤\nN\n1 ≤\nv\nq\n,\nw\nq\n≤\nN\n頂点\nv\nq\nから頂点\nw\nq\nへの経路には\nl\nq\n個以上の頂点が存在する．\n入出力例\n入力例:\n6 11\n2\n4\n5\n8\n9\n7\n1 3\n2 3\n3 4\n4 5\n4 6\n1 6 1\n1 6 2\n1 6 3\n1 6 4\n1 2 1\n1 2 2\n1 2 3\n2 5 1\n2 5 2\n2 5 3\n2 5 4\n入力例に対する出力:\n2\n5\n7\n8\n2\n4\n5\n4\n5\n8\n9"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2270_10978199","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\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)\n\nconst ll dy[] = {-1, 0, 0, 1};\nconst ll dx[] = {0, -1, 1, 0};\n\ntemplate <class T, class T1, class T2> bool isrange(T target, T1 low, T2 high) { return low <= target && target < high; }\ntemplate <class T, class U> T min(const T &t, const U &u) { return t < u ? t : u; }\ntemplate <class T, class U> T max(const T &t, const U &u) { return t < u ? u : t; }\ntemplate <class T, class U> bool chmin(T &t, const U &u) { if (t > u) { t = u; return true; } return false; }\ntemplate <class T, class U> bool chmax(T &t, const U &u) { if (t < u) { t = u; return true; } return false; }\n\n// #include \"titan_cpplib/others/io.cpp\"\n// #include \"titan_cpplib/others/print.cpp\"\n// #include \"titan_cpplib/graph/hld.cpp\"\n\n#include <vector>\n#include <stack>\nusing namespace std;\n\n// HLD\nnamespace titan23 {\n\nclass HLD {\npublic:\n vector<vector<int>> G;\n int root, n;\n vector<int> size, par, dep, nodein, nodeout, head, hld;\n\nprivate:\n void _dfs() {\n dep[root] = 0;\n stack<int> st;\n st.emplace(~root);\n st.emplace(root);\n while (!st.empty()) {\n int v = st.top(); st.pop();\n if (v >= 0) {\n int dep_nxt = dep[v] + 1;\n for (const int x: G[v]) {\n if (dep[x] != -1) continue;\n dep[x] = dep_nxt;\n st.emplace(~x);\n st.emplace(x);\n }\n } else {\n v = ~v;\n for (int i = 0; i < (int)G[v].size(); ++i) {\n int x = G[v][i];\n if (dep[x] < dep[v]) {\n par[v] = x;\n continue;\n }\n size[v] += size[x];\n if (size[x] > size[G[v][0]]) {\n swap(G[v][0], G[v][i]);\n }\n }\n }\n }\n\n int curtime = 0;\n st.emplace(~root);\n st.emplace(root);\n while (!st.empty()) {\n int v = st.top(); st.pop();\n if (v >= 0) {\n if (par[v] == -1) {\n head[v] = v;\n }\n nodein[v] = curtime;\n hld[curtime] = v;\n ++curtime;\n if (G[v].empty()) continue;\n int G_v0 = (int)G[v][0];\n for (int i = (int)G[v].size()-1; i >= 0; --i) {\n int x = G[v][i];\n if (x == par[v]) continue;\n head[x] = (x == G_v0? head[v]: x);\n st.emplace(~x);\n st.emplace(x);\n }\n } else {\n nodeout[~v] = curtime;\n }\n }\n }\n\npublic:\n HLD() {}\n HLD(const vector<vector<int>> &G, const int root) :\n G(G), root(root), n(G.size()),\n size(n, 1), par(n, -1), dep(n, -1),\n nodein(n, -1), nodeout(n, -1), head(n, -1), hld(n, -1) {\n _dfs();\n }\n\n template<typename T>\n vector<T> build_list(vector<T> a) const {\n vector<T> res(a.size());\n for (int i = 0; i < n; ++i) {\n res[i] = a[hld[i]];\n }\n return res;\n }\n\n //! `u`, `v` の lca を返す / `O(logn)`\n int lca(int u, int v) const {\n while (true) {\n if (nodein[u] > nodein[v]) swap(u, v);\n if (head[u] == head[v]) return u;\n v = par[head[v]];\n }\n }\n\n vector<pair<int, int>> for_each_vertex_path(int u, int v) const {\n vector<pair<int, int>> res;\n while (head[u] != head[v]) {\n if (dep[head[u]] < dep[head[v]]) swap(u, v);\n res.emplace_back(nodein[head[u]], nodein[u]+1);\n u = par[head[u]];\n }\n if (dep[u] < dep[v]) swap(u, v);\n res.emplace_back(nodein[v], nodein[u]+1);\n return res;\n }\n\n pair<int, int> for_each_vertex_subtree(int v) const {\n return {nodein[v], nodeout[v]};\n }\n\n int dist(int u, int v) const {\n return dep[u] + dep[v] - 2 * dep[lca(u, v)];\n }\n};\n} // namespace titan23\n// #include \"titan_cpplib/algorithm/zaatsu.cpp\"\n#include <vector>\nusing namespace std;\n\n// Zaatsu\nnamespace titan23 {\n\n/**\n * @brief 座標圧縮管理クラス\n */\ntemplate<typename T>\nclass Zaatsu {\nprivate:\n vector<T> _to_origin;\n int n;\n\npublic:\n Zaatsu() : n(0) {}\n\n //! `used_items` からなる集合を管理するインスタンスを生成\n Zaatsu(vector<T> &used_items) : _to_origin(used_items) {\n sort(_to_origin.begin(), _to_origin.end());\n _to_origin.erase(unique(_to_origin.begin(), _to_origin.end()), _to_origin.end());\n n = (int)_to_origin.size();\n }\n\n //! 要素の種類数を返す(`max(to_zaatsu)`)\n int len() const {\n return n;\n }\n\n //! `x` を座標圧縮する\n int to_zaatsu(const T &x) const {\n return lower_bound(_to_origin.begin(), _to_origin.end(), x) - _to_origin.begin();\n }\n\n //! 座標圧縮された `x` を戻す\n T to_origin(const int &x) const {\n assert(0 <= x && x < n);\n return _to_origin[x];\n }\n};\n} // namespace titan23\n// #include \"titan_cpplib/data_structures/wavelet_matrix.cpp\"\n#include <vector>\n#include <queue>\n// #include \"titan_cpplib/data_structures/bit_vector.cpp\"\n#include <iostream>\n#include <vector>\n#include <cassert>\nusing namespace std;\n\n// BitVector\nnamespace titan23 {\n\nclass BitVector {\nprivate:\n using u64 = unsigned long long;\n int n, bsize;\n vector<u64> bit, acc;\n\npublic:\n BitVector() {}\n BitVector(const int n) :\n n(n), bsize((n+63)>>6), bit(bsize+1, 0), acc(bsize+1, 0) {}\n\n void set(const int k) {\n bit[k>>6] |= (1ull) << (k & 63);\n }\n\n void build() {\n for (int i = 0; i < bsize; ++i) {\n acc[i+1] += acc[i] + __builtin_popcountll(bit[i]);\n }\n }\n\n bool access(const int k) const {\n return (bit[k>>6] >> (k&63)) & 1;\n }\n\n int rank0(const int r) const {\n return r - (acc[r>>6] + __builtin_popcountll(bit[r>>6] & ((1ull << (r & 63)) - 1)));\n }\n\n int rank1(const int r) const {\n return acc[r>>6] + __builtin_popcountll(bit[r>>6] & ((1ull << (r & 63)) - 1));\n }\n\n int rank(const int r, const bool v) const {\n return v ? rank1(r) : rank0(r);\n }\n\n int select0(int k) const {\n if (k < 0 or rank0(n) <= k) return -1;\n int l = 0, r = bsize+1;\n while (r - l > 1) {\n const int m = (l + r) >> 1;\n if (m*32 - acc[m] > k) {\n r = m;\n } else {\n l = m;\n }\n }\n int indx = 32 * l;\n k = k - (l*32 - acc[l]) + rank0(indx);\n l = indx; r = indx+32;\n while (r - l > 1) {\n const int m = (l + r) >> 1;\n if (rank0(m) > k) {\n r = m;\n } else {\n l = m;\n }\n }\n return l;\n }\n\n int select1(int k) const {\n if (k < 0 || rank1(n) <= k) return -1;\n int l = 0, r = bsize+1;\n while (r - l > 1) {\n const int m = (l + r) >> 1;\n if (acc[m] > k) {\n r = m;\n } else {\n l = m;\n }\n }\n int indx = 32 * l;\n k = k - acc[l] + rank1(indx);\n l = indx; r = indx+32;\n while (r - l > 1) {\n const int m = (l + r) >> 1;\n if (rank1(m) > k) {\n r = m;\n } else {\n l = m;\n }\n }\n return l;\n }\n\n int select(const int k, const int v) const {\n return v ? select1(k) : select0(k);\n }\n\n int len() const {\n return n;\n }\n\n void print() const {\n cout << \"[\";\n for (int i = 0; i < len()-1; ++i) {\n cout << access(i) << \", \";\n }\n if (len() > 0) {\n cout << access(len()-1);\n }\n cout << \"]\\n\";\n }\n};\n} // namespace titan23\nusing namespace std;\n\n// WaveletMatrix\nnamespace titan23 {\n\ntemplate<typename T>\nclass WaveletMatrix {\nprivate:\n T sigma;\n int log;\n vector<BitVector> v;\n vector<int> mid;\n int n;\n\n int bit_length(const int n) const {\n return n == 0 ? 0 : 32 - __builtin_clz(n);\n }\n\n void build(vector<T> a) {\n for (int bit = log-1; bit >= 0; --bit) {\n vector<T> zero, one;\n v[bit] = BitVector(n);\n for (int i = 0; i < n; ++i) {\n if ((a[i] >> bit) & 1) {\n v[bit].set(i);\n one.emplace_back(a[i]);\n } else {\n zero.emplace_back(a[i]);\n }\n }\n v[bit].build();\n mid[bit] = zero.size();\n a = zero;\n a.insert(a.end(), one.begin(), one.end());\n assert(a.size() == n);\n }\n }\n\npublic:\n WaveletMatrix() {}\n\n WaveletMatrix(const T sigma)\n : sigma(sigma), log(bit_length(sigma-1)), v(log), mid(log), n(0) {}\n\n WaveletMatrix(const T sigma, const vector<T> &a)\n : sigma(sigma), log(bit_length(sigma-1)), v(log), mid(log), n(a.size()) {\n build(a);\n }\n\n T access(int k) const {\n T s = 0;\n for (int bit = log-1; bit >= 0; --bit) {\n if (v[bit].access(k)) {\n s |= (T)1 << bit;\n k = v[bit].rank1(k) + mid[bit];\n } else {\n k = v[bit].rank0(k);\n }\n }\n return s;\n }\n\n //! `a[0, r)` に含まれる `x` の個数を返します。\n int rank(int r, T x) const {\n int l = 0;\n for (int bit = log-1; bit >= 0; --bit) {\n if ((x >> bit) & 1) {\n l = v[bit].rank1(l) + mid[bit];\n r = v[bit].rank1(r) + mid[bit];\n } else {\n l = v[bit].rank0(l);\n r = v[bit].rank0(r);\n }\n }\n return r - l;\n }\n\n // `k` 番目の `v` のインデックスを返す。\n int select(int k, T x) const {\n int s = 0;\n for (int bit = log-1; bit >= 0; --bit) {\n if ((x >> bit) & 1) {\n s = v[bit].rank0(n) + v[bit].rank1(s);\n } else {\n s = v[bit].rank0(s);\n }\n }\n s += k;\n for (int bit = 0; bit < log; ++bit) {\n if ((x >> bit) & 1) {\n s = v[bit].select1(s - v[bit].rank0(n));\n } else {\n s = v[bit].select0(s);\n }\n }\n return s;\n }\n\n // `a[l, r)` の中で k 番目に **小さい** 値を返します。\n T kth_smallest(int l, int r, int k) const {\n T s = 0;\n for (int bit = log-1; bit >= 0; --bit) {\n const int r0 = v[bit].rank0(r), l0 = v[bit].rank0(l);\n const int cnt = r0 - l0;\n if (cnt <= k) {\n s |= (T)1 << bit;\n k -= cnt;\n l = l - l0 + mid[bit];\n r = r - r0 + mid[bit];\n } else {\n l = l0;\n r = r0;\n }\n }\n return s;\n }\n\n T kth_largest(int l, int r, int k) const {\n return kth_smallest(l, r, r-l-k-1);\n }\n\n // `a[l, r)` の中で、要素を出現回数が多い順にその頻度とともに `k` 個返します。\n vector<pair<int, int>> topk(int l, int r, int k) {\n // heap[-length, x, l, bit]\n priority_queue<tuple<int, T, int, int>> hq;\n hq.emplace(r-l, 0, l, log-1);\n vector<pair<T, int>> ans;\n while (!hq.empty()) {\n auto [length, x, l, bit] = hq.top();\n hq.pop();\n if (bit == -1) {\n ans.emplace_back(x, length);\n k -= 1;\n if (k == 0) break;\n } else {\n r = l + length;\n int l0 = v[bit].rank0(l);\n int r0 = v[bit].rank0(r);\n if (l0 < r0) hq.emplace(r0-l0, x, l0, bit-1);\n int l1 = v[bit].rank1(l) + mid[bit];\n int r1 = v[bit].rank1(r) + mid[bit];\n if (l1 < r1) hq.emplace(r1-l1, x|((T)1<<bit), l1, bit-1);\n }\n }\n return ans;\n }\n\n T sum(int l, int r) const {\n assert(false);\n T s = 0;\n for (const auto &[sum, cnt]: topk(l, r, r-l)) {\n s += sum * cnt;\n }\n return s;\n }\n\n // a[l, r) で x 未満の要素の数を返す'''\n int range_freq(int l, int r, T x) const {\n int ans = 0;\n for (int bit = log-1; bit >= 0; --bit) {\n int l0 = v[bit].rank0(l), r0 = v[bit].rank0(r);\n if ((x >> bit) & 1) {\n ans += r0 - l0;\n l += mid[bit] - l0;\n r += mid[bit] - r0;\n } else {\n l = l0;\n r = r0;\n }\n }\n return ans;\n }\n\n //`a[l, r)` に含まれる、 `x` 以上 `y` 未満である要素の個数を返します。\n int range_freq(int l, int r, T x, T y) const {\n return range_freq(l, r, y) - range_freq(l, r, x);\n }\n\n //`a[l, r)` で、`y`未満であるような要素のうち最大の要素を返します。\n T prev_value(int l, int r, T y) const {\n int x = range_freq(l, r, y);\n if (x == 0) {\n return -1;\n }\n return kth_smallest(l, r, x-1);\n }\n\n T next_value(int l, int r, T x) const {\n return kth_smallest(l, r, range_freq(l, r, x));\n }\n\n //`a[l, r)` に含まれる `x` の個数を返します。\n int range_count(int l, int r, T x) const {\n return rank(r, x) - rank(l, x);\n }\n\n int len() const {\n return n;\n }\n\n friend ostream& operator<<(ostream& os, const titan23::WaveletMatrix<T>& wm) {\n int n = wm.len();\n os << \"[\";\n for (int i = 0; i < n; ++i) {\n os << wm.access(i);\n if (i != n-1) os << \", \";\n }\n os << \"]\";\n return os;\n }\n};\n} // namespace titan23\n\n\nvoid solve() {\n int n, q; cin >> n >> q;\n vector<int> X(n);\n rep(i, n) cin >> X[i];\n vector<vector<int>> G(n);\n rep(i, n-1) {\n int a, b; cin >> a >> b;\n --a; --b;\n G[a].emplace_back(b);\n G[b].emplace_back(a);\n }\n\n int root = 0;\n titan23::HLD hld(G, root);\n titan23::Zaatsu<int> Z(X);\n vector<int> W(n);\n rep(i, n) W[i] = Z.to_zaatsu(X[i]);\n titan23::WaveletMatrix<int> wm(n, hld.build_list(W));\n\n rep(qdx, q) {\n int v, w, k; cin >> v >> w >> k;\n --v; --w;\n\n auto isok = [&] (int M) -> bool {\n vector<pair<int, int>> path = hld.for_each_vertex_path(v, w);\n int cnt = 0;\n for (auto &[u, v] : path) {\n cnt += wm.range_freq(u, v, M+1);\n }\n return cnt >= k;\n };\n\n int ok = Z.len()-1, ng = -1;\n while (ok - ng > 1) {\n int mid = (ok + ng) / 2;\n if (isok(mid)) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n cout << Z.to_origin(ok) << \"\\n\";\n }\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 = 1;\n // cin >> t;\n for (int i = 0; i < t; ++i) {\n solve();\n }\n\n return 0;\n}","accuracy":1,"time_ms":2030,"memory_kb":20580,"score_of_the_acc":-0.8487,"final_rank":8},{"submission_id":"aoj_2270_10853826","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nclass HLDecomposition {\n\tvector<vector<int>> g;\n\tvector<int> vid, head, heavy, parent, depth;\npublic:\n\tvector<int> inv;\nprivate:\n\tint dfs(int curr, int prev) {\n\t\tparent[curr] = prev;\n\t\tint sub = 1, max_sub = 0;\n\t\tfor (int next : g[curr]) if (next != prev) {\n\t\t\tdepth[next] = depth[curr] + 1;\n\t\t\tint sub_next = dfs(next, curr);\n\t\t\tsub += sub_next;\n\t\t\tif (max_sub < sub_next) max_sub = sub_next, heavy[curr] = next;\n\t\t}\n\t\treturn sub;\n\t}\n\tvoid bfs() {\n\t\tint k = 0;\n\t\tqueue<int> q({ 0 });\n\t\twhile (!q.empty()) {\n\t\t\tint h = q.front(); q.pop();\n\t\t\tfor (int i = h; i != -1; i = heavy[i]) {\n\t\t\t\tvid[i] = k++;\n\t\t\t\tinv[vid[i]] = i;\n\t\t\t\thead[i] = h;\n\t\t\t\tfor (int j : g[i]) if (j != parent[i] && j != heavy[i]) q.push(j);\n\t\t\t}\n\t\t}\n\t}\npublic:\n\tHLDecomposition(int n)\n\t\t: g(n), vid(n, -1), head(n), heavy(n, -1), parent(n), depth(n), inv(n) {}\n\n\tvoid add(int u, int v) {\n\t\tg[u].push_back(v);\n\t\tg[v].push_back(u);\n\t}\n\tvoid build() {\n\t\tdfs(0, -1);\n\t\tbfs();\n\t}\n\tvoid for_each(int u, int v, function<void(int, int)> f) {\n\t\tif (vid[u] > vid[v]) swap(u, v);\n\t\tf(max(vid[head[v]], vid[u]), vid[v]);\n\t\tif (head[u] != head[v]) for_each(u, parent[head[v]], f);\n\t}\n};\n\ntemplate <typename T>\nclass SegmentTree {\n\tconst int n;\n\tvector<vector<T>> data;\n\tvector<T> merge(const vector<T>& l, const vector<T>& r) {\n\t\tint nl = l.size(), nr = r.size();\n\t\tvector<T> res(nl + nr);\n\t\tfor (int i = 0, j = 0, k = 0; i < nl || j < nr; k++) {\n\t\t\tif (j == nr)\n\t\t\t\tres[k] = l[i++];\n\t\t\telse if (i == nl)\n\t\t\t\tres[k] = r[j++];\n\t\t\telse if (l[i] <= r[j])\n\t\t\t\tres[k] = l[i++];\n\t\t\telse\n\t\t\t\tres[k] = r[j++];\n\t\t}\n\t\treturn res;\n\t}\n\tint size(int n) {\n\t\tint res;\n\t\tfor (res = 1; res < n; res <<= 1);\n\t\treturn res;\n\t}\n\tT sub(int l, int r, int node, int lb, int ub, T val) {\n\t\tif (ub <= l || r <= lb) return 0;\n\t\tif (l <= lb && ub <= r) return upper_bound(data[node].begin(), data[node].end(), val) - data[node].begin();\n\t\treturn sub(l, r, node * 2, lb, (lb + ub) / 2, val) + sub(l, r, node * 2 + 1, (lb + ub) / 2, ub, val);\n\t}\npublic:\n\tSegmentTree(const vector<T>& data_) : n(size(data_.size())), data(n * 2) {\n\t\tfor (int i = 0; i < (int)data_.size(); i++)\n\t\t\tdata[i + n].push_back(data_[i]);\n\t\tfor (int i = n - 1; i >= 0; i--)\n\t\t\tdata[i] = merge(data[i * 2], data[i * 2 + 1]);\n\t}\n\tvoid Update(int p, T val) {\n\t\tp += n;\n\t\tdata[p][0] = val;\n\t\twhile (p >>= 1) data[p] = merge(data[p * 2], data[p * 2 + 1]);\n\t}\n\tvoid Add(int p, T val) {\n\t\tp += n;\n\t\tdata[p][0] += val;\n\t\twhile (p >>= 1) data[p] = merge(data[p * 2], data[p * 2 + 1]);\n\t}\n\tT Find(int l, int r, T val) {\n\t\treturn sub(l, r + 1, 1, 0, n, val);\n\t}\n};\n\nint main()\n{\n\tcin.sync_with_stdio(false);\n\tcin.tie(0);\n\tint N, Q;\n\tcin >> N >> Q;\n\tvector<int> W(N), base(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> W[i];\n\t}\n\tHLDecomposition hl(N);\n\tfor (int i = 0, u, v; i < N - 1; i++) {\n\t\tcin >> u >> v; u--; v--;\n\t\thl.add(u, v);\n\t}\n\thl.build();\n\tfor (int i = 0; i < N; i++) {\n\t\tbase[i] = W[hl.inv[i]];\n\t}\n\tint v, w, l;\n\tSegmentTree<int> st(base);\n\twhile (Q--) {\n\t\tcin >> v >> w >> l; v--; w--;\n\t\tint lb = 0, ub = 1000000000;\n\t\twhile (lb + 1 < ub) {\n\t\t\tint c = lb + (ub - lb) / 2;\n\t\t\tint sum = 0;\n\t\t\thl.for_each(v, w, [&](int ll, int rr) {\n\t\t\t\tsum += st.Find(ll, rr, c);\n\t\t\t});\n\t\t\tif (sum >= l) {\n\t\t\t\tub = c;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tlb = c;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", ub);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":2310,"memory_kb":34536,"score_of_the_acc":-1.0524,"final_rank":9},{"submission_id":"aoj_2270_10308712","code_snippet":"// competitive-verifier: PROBLEM\n#include <cmath>\n#include <cstdint>\n#include <numeric>\n/// @brief めぐる式二分探索\ntemplate <class T, class F>\nstd::int64_t meguru_binary_search(T ok, T ng, F check) {\n while (std::abs(ok - ng) > 1) {\n T mid = std::midpoint(ok, ng);\n (check(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#include <algorithm>\n#include <iterator>\n#include <vector>\n/// @brief 座標圧縮\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 return std::distance(data.begin(), std::lower_bound(data.begin(), data.end(), x));\n }\n int lower_bound(T x) const {\n return std::distance(data.begin(), std::lower_bound(data.begin(), data.end(), x));\n }\n int upper_bound(T x) const {\n return std::distance(data.begin(), std::upper_bound(data.begin(), data.end(), x));\n }\n std::vector<int> compress(const std::vector<T> &v) const {\n int n = v.size();\n std::vector<int> res(n);\n for (int i = 0; i < n; ++i) res[i] = get(v[i]);\n return res;\n }\n int size() const { return data.size(); }\n private:\n std::vector<T> data;\n};\n/// @brief 座標圧縮\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>\n#include <tuple>\nnamespace internal {\n/**\n * @brief 完備辞書\n *\n * @see https://ei1333.github.io/library/structure/wavelet/succinct-indexable-dictionary.hpp\n */\nstruct bit_vector {\n bit_vector() = default;\n bit_vector(unsigned int _length)\n : length(_length), blocks((_length + 31) >> 5), bit((_length + 31) >> 5),\n sum((_length + 31) >> 5) {}\n void set(unsigned int k) { bit[k >> 5] |= 1U << (k & 31); }\n void build() {\n sum[0] = 0U;\n for (unsigned int i = 1; i < blocks; ++i) {\n sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);\n }\n }\n bool operator[](unsigned int k) const { return bit[k >> 5] >> (k & 31) & 1; }\n unsigned int rank(unsigned int k) const {\n return sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1));\n }\n unsigned int rank(bool val, unsigned int k) const { return val ? rank(k) : k - rank(k); }\n unsigned int select(unsigned int k) const {\n unsigned int sl = 0, sr = blocks + 1;\n while (sr - sl > 1) {\n unsigned int m = (sl + sr) >> 1;\n if (sum[m] < k) sl = m;\n else sr = m;\n }\n k -= sum[sl];\n unsigned int bl = 0, br = 32;\n while (br - bl > 1) {\n unsigned int m = (bl + br) >> 1;\n if (__builtin_popcount(bit[sl] & ((1U << m) - 1)) < k) bl = m;\n else br = m;\n }\n return (sl << 5) + bl;\n }\n private:\n unsigned int length, blocks;\n std::vector<unsigned int> bit, sum;\n};\n} // namespace internal\n/// @brief 重み付きウェーブレット行列\ntemplate <class T, class U = T, int L = 30>\nstruct wavelet_matrix_rectangle_sum {\n wavelet_matrix_rectangle_sum() = default;\n template <class Value>\n wavelet_matrix_rectangle_sum(const std::vector<T> &v, const std::vector<Value> &u)\n : length(v.size()) {\n assert(v.size() == u.size());\n std::vector<int> l(length), r(length), ord(length);\n std::iota(ord.begin(), ord.end(), 0);\n for (int level = L - 1; level >= 0; level--) {\n matrix[level] = internal::bit_vector(length + 1);\n int left = 0, right = 0;\n for (int i = 0; i < length; i++) {\n if ((v[ord[i]] >> level) & 1) {\n matrix[level].set(i);\n r[right++] = ord[i];\n } else {\n l[left++] = ord[i];\n }\n }\n mid[level] = left;\n matrix[level].build();\n ord.swap(l);\n for (int i = 0; i < right; i++) ord[left + i] = r[i];\n cs[level].resize(length + 1);\n cs[level][0] = U(0);\n for (int i = 0; i < length; i++) cs[level][i + 1] = cs[level][i] + u[ord[i]];\n }\n }\n U kth_smallest_sum(int l, int r, int k) const {\n assert(0 <= k && k <= r - l);\n T val = T();\n U res = U();\n for (int level = L - 1; level >= 0; --level) {\n int cnt = matrix[level].rank(false, r) - matrix[level].rank(false, l);\n bool f = cnt <= k;\n if (f) {\n val |= T(1) << level;\n res += cs[level][matrix[level].rank(false, r)] -\n cs[level][matrix[level].rank(false, l)];\n k -= cnt;\n }\n std::tie(l, r) = succ(f, l, r, level);\n }\n return res + val * k;\n }\n U kth_largest_sum(int l, int r, int k) const {\n return cs[L - 1][matrix[L - 1].rank(false, r)] + cs[L - 1][matrix[L - 1].rank(true, r)] -\n cs[L - 1][matrix[L - 1].rank(false, l)] - cs[L - 1][matrix[L - 1].rank(true, l)] -\n kth_smallest_sum(l, r, r - l - k);\n }\n U range_sum(int r, T x) const { return range_sum(0, r, x); }\n U range_sum(int l, int r, T x) const {\n for (int level = L - 1; level >= 0; level--)\n std::tie(l, r) = succ((x >> level) & 1, l, r, level);\n return cs[0][matrix[0].rank(false, r)] - cs[0][matrix[0].rank(false, l)];\n }\n U rect_sum(int l, int r, T upper) const {\n U res = 0;\n for (int level = L - 1; level >= 0; level--) {\n bool f = (upper >> level) & 1;\n if (f)\n res += cs[level][matrix[level].rank(false, r)] -\n cs[level][matrix[level].rank(false, l)];\n std::tie(l, r) = succ(f, l, r, level);\n }\n return res;\n }\n U rect_sum(int l, int r, T lower, T upper) const {\n return rect_sum(l, r, upper) - rect_sum(l, r, lower);\n }\n private:\n int length;\n internal::bit_vector matrix[L];\n int mid[L];\n std::vector<U> cs[L];\n std::pair<int, int> succ(bool f, int l, int r, int level) const {\n return {matrix[level].rank(f, l) + mid[level] * f,\n matrix[level].rank(f, r) + mid[level] * f};\n }\n};\n#include <iostream>\n/**\n * @brief 重み付きグラフ\n *\n * @tparam T 辺の重みの型\n */\ntemplate <class T>\nstruct Graph {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to(), _weight() {}\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr T weight() const { return _weight; }\n private:\n int _from, _to;\n T _weight;\n };\n public:\n using edge_type = typename Graph<T>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\n void add_edges(int from, int to, T weight = T(1)) {\n edges[from].emplace_back(from, to, weight);\n edges[to].emplace_back(to, from, weight);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edge(from - base, to - base, weight);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edges(from - base, to - base, weight);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\ntemplate <>\nstruct Graph<void> {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to() {}\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr int weight() const { return 1; }\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n private:\n int _from, _to;\n };\n public:\n using edge_type = typename Graph<void>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\n void add_edges(int from, int to) {\n edges[from].emplace_back(from, to);\n edges[to].emplace_back(to, from);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edge(from - base, to - base);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edges(from - base, to - base);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\n#include <bit>\n/// @brief スパーステーブル\ntemplate <class M>\nstruct sparse_table {\n private:\n using T = typename M::value_type;\n public:\n sparse_table() = default;\n sparse_table(const std::vector<T> &v) : _size(v.size()), data() {\n int b = std::max(1, std::countr_zero(std::bit_ceil<unsigned>(_size)));\n data.emplace_back(v);\n for (int i = 1; i < b; ++i) data.emplace_back(_size + 1 - (1 << i));\n for (int i = 1; i < b; ++i) {\n for (int j = 0; j + (1 << i) <= _size; ++j) {\n data[i][j] = M::op(data[i - 1][j], data[i - 1][j + (1 << (i - 1))]);\n }\n }\n }\n T prod(int l, int r) const {\n assert(0 <= l && l <= r && r <= _size);\n if (l == r) return M::id();\n if (l + 1 == r) return data[0][l];\n int b = 31 - std::countl_zero<unsigned>(r - l - 1);\n return M::op(data[b][l], data[b][r - (1 << b)]);\n }\n private:\n int _size;\n std::vector<std::vector<T>> data;\n};\nnamespace internal {\ntemplate <class T, int N>\nstruct fixed_stack {\n constexpr fixed_stack() : _size(), _data() {}\n constexpr T top() const { return _data[_size - 1]; }\n constexpr bool empty() const { return _size == 0; }\n constexpr int size() const { return _size; }\n constexpr void emplace(const T &e) { _data[_size++] = e; }\n constexpr void emplace(T &&e) { _data[_size++] = e; }\n constexpr void pop() { --_size; }\n constexpr void clear() { _size = 0; }\n private:\n int _size;\n std::array<T, N> _data;\n};\n} // namespace internal\n/**\n * @brief 線形 Sparse Table\n *\n * @tparam M\n */\ntemplate <class M>\nstruct linear_sparse_table {\n private:\n using T = M::value_type;\n static constexpr int W = 64;\n public:\n linear_sparse_table() = default;\n linear_sparse_table(const std::vector<T> &v) : _size(v.size()), data(v) {\n int n = v.size();\n int b = n / W;\n internal::fixed_stack<int, W + 1> st;\n std::vector<T> u(b);\n word_data.resize(b + (n > b * W));\n for (int i = 0; i < b; ++i) {\n T m = M::id();\n std::uint64_t bit = 0;\n std::vector<std::uint64_t> bits(W);\n for (int j = 0; j < W; ++j) {\n m = M::op(m, v[i * W + j]);\n while (!st.empty() && M::op(v[i * W + st.top()], v[i * W + j]) == v[i * W + j]) {\n bit ^= std::uint64_t(1) << st.top();\n st.pop();\n }\n bits[j] = bit;\n bit |= std::uint64_t(1) << j;\n st.emplace(j);\n }\n u[i] = m;\n word_data[i] = bits;\n st.clear();\n }\n if (n > b * W) {\n std::uint64_t bit = 0;\n std::vector<std::uint64_t> bits(n - b * W);\n for (int j = 0; j < n - b * W; ++j) {\n while (!st.empty() && M::op(v[b * W + st.top()], v[b * W + j]) == v[b * W + j]) {\n bit ^= std::uint64_t(1) << st.top();\n st.pop();\n }\n bits[j] = bit;\n bit |= std::uint64_t(1) << j;\n st.emplace(j);\n }\n word_data[b] = bits;\n }\n block_table = sparse_table<M>(u);\n }\n const T &operator[](int k) const { return data[k]; }\n T prod(int l, int r) const {\n assert(0 <= l && l < r && r <= _size);\n int lb = (l + W - 1) / W, rb = r / W;\n if (lb > rb) return word_prod(l, r);\n T res = (lb == rb ? M::id() : block_table.prod(lb, rb));\n if (l < lb * W) res = M::op(res, word_prod(l, lb * W));\n if (rb * W < r) res = M::op(res, word_prod(rb * W, r));\n return res;\n }\n private:\n int _size;\n std::vector<T> data;\n sparse_table<M> block_table;\n std::vector<std::vector<std::uint64_t>> word_data;\n T word_prod(int l, int r) const {\n if (l == r) return M::id();\n int b = l / W;\n int lw = l - b * W, rw = r - b * W;\n if ((word_data[b][rw - 1] >> lw) == 0ul) return data[r - 1];\n return data[l + std::countr_zero(word_data[b][rw - 1] >> lw)];\n }\n};\nstruct linear_lca {\n private:\n struct S {\n int depth, index;\n bool operator<(const S &rhs) const { return depth < rhs.depth; }\n bool operator==(const S &rhs) const = default;\n };\n struct M {\n using value_type = S;\n static constexpr S id() { return S{std::numeric_limits<int>::max(), -1}; }\n static constexpr S op(const S &lhs, const S &rhs) { return std::min(lhs, rhs); }\n };\n public:\n template <class T>\n linear_lca(const Graph<T> &g, int r = 0) : ord(g.size(), -1), lst() {\n std::vector<S> v;\n std::stack<std::pair<int, int>> st;\n st.emplace(r, 0);\n while (!st.empty()) {\n auto [x, d] = st.top();\n st.pop();\n if (x < 0) {\n v.emplace_back(d, ~x);\n continue;\n }\n ord[x] = v.size();\n v.emplace_back(d, x);\n for (auto e : g[x]) {\n if (ord[e.to()] != -1) continue;\n st.emplace(~x, d);\n st.emplace(e.to(), d + 1);\n }\n }\n lst = linear_sparse_table<M>(v);\n }\n int operator()(int u, int v) const { return lca(u, v); }\n int lca(int u, int v) const {\n auto [l, r] = std::minmax(ord[u], ord[v]);\n return lst.prod(l, r + 1).index;\n }\n private:\n std::vector<int> ord;\n linear_sparse_table<M> lst;\n};\nint main(void) {\n int n, q;\n cin >> n >> q;\n vector<int> a(n);\n cin >> a;\n coordinate_compression cps(a);\n a = cps.compress(a);\n Graph<void> g(n);\n g.input_edges(n - 1);\n vector<int> in(n), out(n), ord(n * 2), w(n * 2);\n int c = 0;\n auto dfs = [&](auto self, int x, int p) -> void {\n in[x] = c;\n w[c] = 1;\n ord[c++] = a[x];\n for (auto e : g[x]) {\n if (e.to() == p)\n continue;\n self(self, e.to(), x);\n }\n w[c] = -1;\n ord[c++] = a[x];\n out[x] = c;\n };\n dfs(dfs, 0, -1);\n linear_lca lca(g);\n wavelet_matrix_rectangle_sum<int, int, 18> wm(ord, w);\n while (q--) {\n int u, v, k;\n cin >> u >> v >> k;\n --u, --v;\n auto f = [&](int y) {\n return wm.rect_sum(0, in[u] + 1, y) + wm.rect_sum(0, in[v] + 1, y) -\n wm.rect_sum(0, in[lca(u, v)] + 1, y) - wm.rect_sum(0, in[lca(u, v)], y) <\n k;\n };\n auto ans = meguru_binary_search(0, cps.size() + 1, f);\n co(cps[ans]);\n }\n return 0;\n}","accuracy":1,"time_ms":720,"memory_kb":39676,"score_of_the_acc":-0.5227,"final_rank":4},{"submission_id":"aoj_2270_10308710","code_snippet":"// competitive-verifier: PROBLEM\n#include <cmath>\n#include <cstdint>\n#include <numeric>\n/// @brief めぐる式二分探索\ntemplate <class T, class F>\nstd::int64_t meguru_binary_search(T ok, T ng, F check) {\n while (std::abs(ok - ng) > 1) {\n T mid = std::midpoint(ok, ng);\n (check(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#include <algorithm>\n#include <iterator>\n#include <vector>\n/// @brief 座標圧縮\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 return std::distance(data.begin(), std::lower_bound(data.begin(), data.end(), x));\n }\n int lower_bound(T x) const {\n return std::distance(data.begin(), std::lower_bound(data.begin(), data.end(), x));\n }\n int upper_bound(T x) const {\n return std::distance(data.begin(), std::upper_bound(data.begin(), data.end(), x));\n }\n std::vector<int> compress(const std::vector<T> &v) const {\n int n = v.size();\n std::vector<int> res(n);\n for (int i = 0; i < n; ++i) res[i] = get(v[i]);\n return res;\n }\n int size() const { return data.size(); }\n private:\n std::vector<T> data;\n};\n/// @brief 座標圧縮\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>\n#include <tuple>\nnamespace internal {\n/**\n * @brief 完備辞書\n *\n * @see https://ei1333.github.io/library/structure/wavelet/succinct-indexable-dictionary.hpp\n */\nstruct bit_vector {\n bit_vector() = default;\n bit_vector(unsigned int _length)\n : length(_length), blocks((_length + 31) >> 5), bit((_length + 31) >> 5),\n sum((_length + 31) >> 5) {}\n void set(unsigned int k) { bit[k >> 5] |= 1U << (k & 31); }\n void build() {\n sum[0] = 0U;\n for (unsigned int i = 1; i < blocks; ++i) {\n sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);\n }\n }\n bool operator[](unsigned int k) const { return bit[k >> 5] >> (k & 31) & 1; }\n unsigned int rank(unsigned int k) const {\n return sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1));\n }\n unsigned int rank(bool val, unsigned int k) const { return val ? rank(k) : k - rank(k); }\n unsigned int select(unsigned int k) const {\n unsigned int sl = 0, sr = blocks + 1;\n while (sr - sl > 1) {\n unsigned int m = (sl + sr) >> 1;\n if (sum[m] < k) sl = m;\n else sr = m;\n }\n k -= sum[sl];\n unsigned int bl = 0, br = 32;\n while (br - bl > 1) {\n unsigned int m = (bl + br) >> 1;\n if (__builtin_popcount(bit[sl] & ((1U << m) - 1)) < k) bl = m;\n else br = m;\n }\n return (sl << 5) + bl;\n }\n private:\n unsigned int length, blocks;\n std::vector<unsigned int> bit, sum;\n};\n} // namespace internal\n/// @brief 重み付きウェーブレット行列\ntemplate <class T, class U = T, int L = 30>\nstruct wavelet_matrix_rectangle_sum {\n wavelet_matrix_rectangle_sum() = default;\n template <class Value>\n wavelet_matrix_rectangle_sum(const std::vector<T> &v, const std::vector<Value> &u)\n : length(v.size()) {\n assert(v.size() == u.size());\n std::vector<int> l(length), r(length), ord(length);\n std::iota(ord.begin(), ord.end(), 0);\n for (int level = L - 1; level >= 0; level--) {\n matrix[level] = internal::bit_vector(length + 1);\n int left = 0, right = 0;\n for (int i = 0; i < length; i++) {\n if ((v[ord[i]] >> level) & 1) {\n matrix[level].set(i);\n r[right++] = ord[i];\n } else {\n l[left++] = ord[i];\n }\n }\n mid[level] = left;\n matrix[level].build();\n ord.swap(l);\n for (int i = 0; i < right; i++) ord[left + i] = r[i];\n cs[level].resize(length + 1);\n cs[level][0] = U(0);\n for (int i = 0; i < length; i++) cs[level][i + 1] = cs[level][i] + u[ord[i]];\n }\n }\n U kth_smallest_sum(int l, int r, int k) const {\n assert(0 <= k && k <= r - l);\n T val = T();\n U res = U();\n for (int level = L - 1; level >= 0; --level) {\n int cnt = matrix[level].rank(false, r) - matrix[level].rank(false, l);\n bool f = cnt <= k;\n if (f) {\n val |= T(1) << level;\n res += cs[level][matrix[level].rank(false, r)] -\n cs[level][matrix[level].rank(false, l)];\n k -= cnt;\n }\n std::tie(l, r) = succ(f, l, r, level);\n }\n return res + val * k;\n }\n U kth_largest_sum(int l, int r, int k) const {\n return cs[L - 1][matrix[L - 1].rank(false, r)] + cs[L - 1][matrix[L - 1].rank(true, r)] -\n cs[L - 1][matrix[L - 1].rank(false, l)] - cs[L - 1][matrix[L - 1].rank(true, l)] -\n kth_smallest_sum(l, r, r - l - k);\n }\n U range_sum(int r, T x) const { return range_sum(0, r, x); }\n U range_sum(int l, int r, T x) const {\n for (int level = L - 1; level >= 0; level--)\n std::tie(l, r) = succ((x >> level) & 1, l, r, level);\n return cs[0][matrix[0].rank(false, r)] - cs[0][matrix[0].rank(false, l)];\n }\n U rect_sum(int l, int r, T upper) const {\n U res = 0;\n for (int level = L - 1; level >= 0; level--) {\n bool f = (upper >> level) & 1;\n if (f)\n res += cs[level][matrix[level].rank(false, r)] -\n cs[level][matrix[level].rank(false, l)];\n std::tie(l, r) = succ(f, l, r, level);\n }\n return res;\n }\n U rect_sum(int l, int r, T lower, T upper) const {\n return rect_sum(l, r, upper) - rect_sum(l, r, lower);\n }\n private:\n int length;\n internal::bit_vector matrix[L];\n int mid[L];\n std::vector<U> cs[L];\n std::pair<int, int> succ(bool f, int l, int r, int level) const {\n return {matrix[level].rank(f, l) + mid[level] * f,\n matrix[level].rank(f, r) + mid[level] * f};\n }\n};\n#include <iostream>\n/**\n * @brief 重み付きグラフ\n *\n * @tparam T 辺の重みの型\n */\ntemplate <class T>\nstruct Graph {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to(), _weight() {}\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr T weight() const { return _weight; }\n private:\n int _from, _to;\n T _weight;\n };\n public:\n using edge_type = typename Graph<T>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\n void add_edges(int from, int to, T weight = T(1)) {\n edges[from].emplace_back(from, to, weight);\n edges[to].emplace_back(to, from, weight);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edge(from - base, to - base, weight);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edges(from - base, to - base, weight);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\ntemplate <>\nstruct Graph<void> {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to() {}\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr int weight() const { return 1; }\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n private:\n int _from, _to;\n };\n public:\n using edge_type = typename Graph<void>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\n void add_edges(int from, int to) {\n edges[from].emplace_back(from, to);\n edges[to].emplace_back(to, from);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edge(from - base, to - base);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edges(from - base, to - base);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\n#include <bit>\n/// @brief スパーステーブル\ntemplate <class M>\nstruct sparse_table {\n private:\n using T = typename M::value_type;\n public:\n sparse_table() = default;\n sparse_table(const std::vector<T> &v) : _size(v.size()), data() {\n int b = std::max(1, std::countr_zero(std::bit_ceil<unsigned>(_size)));\n data.emplace_back(v);\n for (int i = 1; i < b; ++i) data.emplace_back(_size + 1 - (1 << i));\n for (int i = 1; i < b; ++i) {\n for (int j = 0; j + (1 << i) <= _size; ++j) {\n data[i][j] = M::op(data[i - 1][j], data[i - 1][j + (1 << (i - 1))]);\n }\n }\n }\n T prod(int l, int r) const {\n assert(0 <= l && l <= r && r <= _size);\n if (l == r) return M::id();\n if (l + 1 == r) return data[0][l];\n int b = 31 - std::countl_zero<unsigned>(r - l - 1);\n return M::op(data[b][l], data[b][r - (1 << b)]);\n }\n private:\n int _size;\n std::vector<std::vector<T>> data;\n};\nnamespace internal {\ntemplate <class T, int N>\nstruct fixed_stack {\n constexpr fixed_stack() : _size(), _data() {}\n constexpr T top() const { return _data[_size - 1]; }\n constexpr bool empty() const { return _size == 0; }\n constexpr int size() const { return _size; }\n constexpr void emplace(const T &e) { _data[_size++] = e; }\n constexpr void emplace(T &&e) { _data[_size++] = e; }\n constexpr void pop() { --_size; }\n constexpr void clear() { _size = 0; }\n private:\n int _size;\n std::array<T, N> _data;\n};\n} // namespace internal\n/**\n * @brief 線形 Sparse Table\n *\n * @tparam M\n */\ntemplate <class M>\nstruct linear_sparse_table {\n private:\n using T = M::value_type;\n static constexpr int W = 64;\n public:\n linear_sparse_table() = default;\n linear_sparse_table(const std::vector<T> &v) : _size(v.size()), data(v) {\n int n = v.size();\n int b = n / W;\n internal::fixed_stack<int, W + 1> st;\n std::vector<T> u(b);\n word_data.resize(b + (n > b * W));\n for (int i = 0; i < b; ++i) {\n T m = M::id();\n std::uint64_t bit = 0;\n std::vector<std::uint64_t> bits(W);\n for (int j = 0; j < W; ++j) {\n m = M::op(m, v[i * W + j]);\n while (!st.empty() && M::op(v[i * W + st.top()], v[i * W + j]) == v[i * W + j]) {\n bit ^= std::uint64_t(1) << st.top();\n st.pop();\n }\n bits[j] = bit;\n bit |= std::uint64_t(1) << j;\n st.emplace(j);\n }\n u[i] = m;\n word_data[i] = bits;\n st.clear();\n }\n if (n > b * W) {\n std::uint64_t bit = 0;\n std::vector<std::uint64_t> bits(n - b * W);\n for (int j = 0; j < n - b * W; ++j) {\n while (!st.empty() && M::op(v[b * W + st.top()], v[b * W + j]) == v[b * W + j]) {\n bit ^= std::uint64_t(1) << st.top();\n st.pop();\n }\n bits[j] = bit;\n bit |= std::uint64_t(1) << j;\n st.emplace(j);\n }\n word_data[b] = bits;\n }\n block_table = sparse_table<M>(u);\n }\n const T &operator[](int k) const { return data[k]; }\n T prod(int l, int r) const {\n assert(0 <= l && l < r && r <= _size);\n int lb = (l + W - 1) / W, rb = r / W;\n if (lb > rb) return word_prod(l, r);\n T res = (lb == rb ? M::id() : block_table.prod(lb, rb));\n if (l < lb * W) res = M::op(res, word_prod(l, lb * W));\n if (rb * W < r) res = M::op(res, word_prod(rb * W, r));\n return res;\n }\n private:\n int _size;\n std::vector<T> data;\n sparse_table<M> block_table;\n std::vector<std::vector<std::uint64_t>> word_data;\n T word_prod(int l, int r) const {\n if (l == r) return M::id();\n int b = l / W;\n int lw = l - b * W, rw = r - b * W;\n if ((word_data[b][rw - 1] >> lw) == 0ul) return data[r - 1];\n return data[l + std::countr_zero(word_data[b][rw - 1] >> lw)];\n }\n};\nstruct linear_lca {\n private:\n struct S {\n int depth, index;\n bool operator<(const S &rhs) const { return depth < rhs.depth; }\n bool operator==(const S &rhs) const = default;\n };\n struct M {\n using value_type = S;\n static constexpr S id() { return S{std::numeric_limits<int>::max(), -1}; }\n static constexpr S op(const S &lhs, const S &rhs) { return std::min(lhs, rhs); }\n };\n public:\n template <class T>\n linear_lca(const Graph<T> &g, int r = 0) : ord(g.size(), -1), lst() {\n std::vector<S> v;\n std::stack<std::pair<int, int>> st;\n st.emplace(r, 0);\n while (!st.empty()) {\n auto [x, d] = st.top();\n st.pop();\n if (x < 0) {\n v.emplace_back(d, ~x);\n continue;\n }\n ord[x] = v.size();\n v.emplace_back(d, x);\n for (auto e : g[x]) {\n if (ord[e.to()] != -1) continue;\n st.emplace(~x, d);\n st.emplace(e.to(), d + 1);\n }\n }\n lst = linear_sparse_table<M>(v);\n }\n int operator()(int u, int v) const { return lca(u, v); }\n int lca(int u, int v) const {\n auto [l, r] = std::minmax(ord[u], ord[v]);\n return lst.prod(l, r + 1).index;\n }\n private:\n std::vector<int> ord;\n linear_sparse_table<M> lst;\n};\nint main(void) {\n int n, q;\n cin >> n >> q;\n vector<int> a(n);\n cin >> a;\n coordinate_compression cps(a);\n a = cps.compress(a);\n Graph<void> g(n);\n g.input_edges(n - 1);\n vector<int> in(n), out(n), ord(n * 2), w(n * 2);\n int c = 0;\n auto dfs = [&](auto self, int x, int p) -> void {\n in[x] = c;\n w[c] = 1;\n ord[c++] = a[x];\n for (auto e : g[x]) {\n if (e.to() == p)\n continue;\n self(self, e.to(), x);\n }\n w[c] = -1;\n ord[c++] = a[x];\n out[x] = c;\n };\n dfs(dfs, 0, -1);\n linear_lca lca(g);\n wavelet_matrix_rectangle_sum wm(ord, w);\n while (q--) {\n int u, v, k;\n cin >> u >> v >> k;\n --u, --v;\n auto f = [&](int y) {\n return wm.rect_sum(0, in[u] + 1, y) + wm.rect_sum(0, in[v] + 1, y) -\n wm.rect_sum(0, in[lca(u, v)] + 1, y) - wm.rect_sum(0, in[lca(u, v)], y) <\n k;\n };\n auto ans = meguru_binary_search(0, cps.size() + 1, f);\n co(cps[ans]);\n }\n return 0;\n}","accuracy":1,"time_ms":1250,"memory_kb":49536,"score_of_the_acc":-0.7853,"final_rank":5},{"submission_id":"aoj_2270_10308644","code_snippet":"// competitive-verifier: PROBLEM\n#include <cmath>\n#include <cstdint>\n#include <numeric>\n/// @brief めぐる式二分探索\ntemplate <class T, class F>\nstd::int64_t meguru_binary_search(T ok, T ng, F check) {\n while (std::abs(ok - ng) > 1) {\n T mid = std::midpoint(ok, ng);\n (check(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#include <cassert>\n#include <tuple>\n#include <vector>\nnamespace internal {\n/**\n * @brief 完備辞書\n *\n * @see https://ei1333.github.io/library/structure/wavelet/succinct-indexable-dictionary.hpp\n */\nstruct bit_vector {\n bit_vector() = default;\n bit_vector(unsigned int _length)\n : length(_length), blocks((_length + 31) >> 5), bit((_length + 31) >> 5),\n sum((_length + 31) >> 5) {}\n void set(unsigned int k) { bit[k >> 5] |= 1U << (k & 31); }\n void build() {\n sum[0] = 0U;\n for (unsigned int i = 1; i < blocks; ++i) {\n sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);\n }\n }\n bool operator[](unsigned int k) const { return bit[k >> 5] >> (k & 31) & 1; }\n unsigned int rank(unsigned int k) const {\n return sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1));\n }\n unsigned int rank(bool val, unsigned int k) const { return val ? rank(k) : k - rank(k); }\n unsigned int select(unsigned int k) const {\n unsigned int sl = 0, sr = blocks + 1;\n while (sr - sl > 1) {\n unsigned int m = (sl + sr) >> 1;\n if (sum[m] < k) sl = m;\n else sr = m;\n }\n k -= sum[sl];\n unsigned int bl = 0, br = 32;\n while (br - bl > 1) {\n unsigned int m = (bl + br) >> 1;\n if (__builtin_popcount(bit[sl] & ((1U << m) - 1)) < k) bl = m;\n else br = m;\n }\n return (sl << 5) + bl;\n }\n private:\n unsigned int length, blocks;\n std::vector<unsigned int> bit, sum;\n};\n} // namespace internal\n/// @brief 重み付きウェーブレット行列\ntemplate <class T, class U = T, int L = 30>\nstruct wavelet_matrix_rectangle_sum {\n wavelet_matrix_rectangle_sum() = default;\n template <class Value>\n wavelet_matrix_rectangle_sum(const std::vector<T> &v, const std::vector<Value> &u)\n : length(v.size()) {\n assert(v.size() == u.size());\n std::vector<int> l(length), r(length), ord(length);\n std::iota(ord.begin(), ord.end(), 0);\n for (int level = L - 1; level >= 0; level--) {\n matrix[level] = internal::bit_vector(length + 1);\n int left = 0, right = 0;\n for (int i = 0; i < length; i++) {\n if ((v[ord[i]] >> level) & 1) {\n matrix[level].set(i);\n r[right++] = ord[i];\n } else {\n l[left++] = ord[i];\n }\n }\n mid[level] = left;\n matrix[level].build();\n ord.swap(l);\n for (int i = 0; i < right; i++) ord[left + i] = r[i];\n cs[level].resize(length + 1);\n cs[level][0] = U(0);\n for (int i = 0; i < length; i++) cs[level][i + 1] = cs[level][i] + u[ord[i]];\n }\n }\n U kth_smallest_sum(int l, int r, int k) const {\n assert(0 <= k && k <= r - l);\n T val = T();\n U res = U();\n for (int level = L - 1; level >= 0; --level) {\n int cnt = matrix[level].rank(false, r) - matrix[level].rank(false, l);\n bool f = cnt <= k;\n if (f) {\n val |= T(1) << level;\n res += cs[level][matrix[level].rank(false, r)] -\n cs[level][matrix[level].rank(false, l)];\n k -= cnt;\n }\n std::tie(l, r) = succ(f, l, r, level);\n }\n return res + val * k;\n }\n U kth_largest_sum(int l, int r, int k) const {\n return cs[L - 1][matrix[L - 1].rank(false, r)] + cs[L - 1][matrix[L - 1].rank(true, r)] -\n cs[L - 1][matrix[L - 1].rank(false, l)] - cs[L - 1][matrix[L - 1].rank(true, l)] -\n kth_smallest_sum(l, r, r - l - k);\n }\n U range_sum(int r, T x) const { return range_sum(0, r, x); }\n U range_sum(int l, int r, T x) const {\n for (int level = L - 1; level >= 0; level--)\n std::tie(l, r) = succ((x >> level) & 1, l, r, level);\n return cs[0][matrix[0].rank(false, r)] - cs[0][matrix[0].rank(false, l)];\n }\n U rect_sum(int l, int r, T upper) const {\n U res = 0;\n for (int level = L - 1; level >= 0; level--) {\n bool f = (upper >> level) & 1;\n if (f)\n res += cs[level][matrix[level].rank(false, r)] -\n cs[level][matrix[level].rank(false, l)];\n std::tie(l, r) = succ(f, l, r, level);\n }\n return res;\n }\n U rect_sum(int l, int r, T lower, T upper) const {\n return rect_sum(l, r, upper) - rect_sum(l, r, lower);\n }\n private:\n int length;\n internal::bit_vector matrix[L];\n int mid[L];\n std::vector<U> cs[L];\n std::pair<int, int> succ(bool f, int l, int r, int level) const {\n return {matrix[level].rank(f, l) + mid[level] * f,\n matrix[level].rank(f, r) + mid[level] * f};\n }\n};\n#include <iostream>\n/**\n * @brief 重み付きグラフ\n *\n * @tparam T 辺の重みの型\n */\ntemplate <class T>\nstruct Graph {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to(), _weight() {}\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr T weight() const { return _weight; }\n private:\n int _from, _to;\n T _weight;\n };\n public:\n using edge_type = typename Graph<T>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\n void add_edges(int from, int to, T weight = T(1)) {\n edges[from].emplace_back(from, to, weight);\n edges[to].emplace_back(to, from, weight);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edge(from - base, to - base, weight);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n T weight;\n std::cin >> from >> to >> weight;\n add_edges(from - base, to - base, weight);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\ntemplate <>\nstruct Graph<void> {\n private:\n struct _edge {\n constexpr _edge() : _from(), _to() {}\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\n constexpr int from() const { return _from; }\n constexpr int to() const { return _to; }\n constexpr int weight() const { return 1; }\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\n private:\n int _from, _to;\n };\n public:\n using edge_type = typename Graph<void>::_edge;\n Graph() : _size(), edges() {}\n Graph(int v) : _size(v), edges(v) {}\n const auto &operator[](int i) const { return edges[i]; }\n auto &operator[](int i) { return edges[i]; }\n const auto begin() const { return edges.begin(); }\n auto begin() { return edges.begin(); }\n const auto end() const { return edges.end(); }\n auto end() { return edges.end(); }\n constexpr int size() const { return _size; }\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\n void add_edges(int from, int to) {\n edges[from].emplace_back(from, to);\n edges[to].emplace_back(to, from);\n }\n void input_edge(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edge(from - base, to - base);\n }\n }\n void input_edges(int m, int base = 1) {\n for (int i = 0; i < m; ++i) {\n int from, to;\n std::cin >> from >> to;\n add_edges(from - base, to - base);\n }\n }\n private:\n int _size;\n std::vector<std::vector<edge_type>> edges;\n};\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(20);\n }\n constexpr void operator()() const {}\n} sonic;\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \"\" : \" \") << *it;\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \"Yes\\n\" : \"No\\n\"); }\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n'; }\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\n#include <bit>\n/// @brief スパーステーブル\ntemplate <class M>\nstruct sparse_table {\n private:\n using T = typename M::value_type;\n public:\n sparse_table() = default;\n sparse_table(const std::vector<T> &v) : _size(v.size()), data() {\n int b = std::max(1, std::countr_zero(std::bit_ceil<unsigned>(_size)));\n data.emplace_back(v);\n for (int i = 1; i < b; ++i) data.emplace_back(_size + 1 - (1 << i));\n for (int i = 1; i < b; ++i) {\n for (int j = 0; j + (1 << i) <= _size; ++j) {\n data[i][j] = M::op(data[i - 1][j], data[i - 1][j + (1 << (i - 1))]);\n }\n }\n }\n T prod(int l, int r) const {\n assert(0 <= l && l <= r && r <= _size);\n if (l == r) return M::id();\n if (l + 1 == r) return data[0][l];\n int b = 31 - std::countl_zero<unsigned>(r - l - 1);\n return M::op(data[b][l], data[b][r - (1 << b)]);\n }\n private:\n int _size;\n std::vector<std::vector<T>> data;\n};\nnamespace internal {\ntemplate <class T, int N>\nstruct fixed_stack {\n constexpr fixed_stack() : _size(), _data() {}\n constexpr T top() const { return _data[_size - 1]; }\n constexpr bool empty() const { return _size == 0; }\n constexpr int size() const { return _size; }\n constexpr void emplace(const T &e) { _data[_size++] = e; }\n constexpr void emplace(T &&e) { _data[_size++] = e; }\n constexpr void pop() { --_size; }\n constexpr void clear() { _size = 0; }\n private:\n int _size;\n std::array<T, N> _data;\n};\n} // namespace internal\n/**\n * @brief 線形 Sparse Table\n *\n * @tparam M\n */\ntemplate <class M>\nstruct linear_sparse_table {\n private:\n using T = M::value_type;\n static constexpr int W = 64;\n public:\n linear_sparse_table() = default;\n linear_sparse_table(const std::vector<T> &v) : _size(v.size()), data(v) {\n int n = v.size();\n int b = n / W;\n internal::fixed_stack<int, W + 1> st;\n std::vector<T> u(b);\n word_data.resize(b + (n > b * W));\n for (int i = 0; i < b; ++i) {\n T m = M::id();\n std::uint64_t bit = 0;\n std::vector<std::uint64_t> bits(W);\n for (int j = 0; j < W; ++j) {\n m = M::op(m, v[i * W + j]);\n while (!st.empty() && M::op(v[i * W + st.top()], v[i * W + j]) == v[i * W + j]) {\n bit ^= std::uint64_t(1) << st.top();\n st.pop();\n }\n bits[j] = bit;\n bit |= std::uint64_t(1) << j;\n st.emplace(j);\n }\n u[i] = m;\n word_data[i] = bits;\n st.clear();\n }\n if (n > b * W) {\n std::uint64_t bit = 0;\n std::vector<std::uint64_t> bits(n - b * W);\n for (int j = 0; j < n - b * W; ++j) {\n while (!st.empty() && M::op(v[b * W + st.top()], v[b * W + j]) == v[b * W + j]) {\n bit ^= std::uint64_t(1) << st.top();\n st.pop();\n }\n bits[j] = bit;\n bit |= std::uint64_t(1) << j;\n st.emplace(j);\n }\n word_data[b] = bits;\n }\n block_table = sparse_table<M>(u);\n }\n const T &operator[](int k) const { return data[k]; }\n T prod(int l, int r) const {\n assert(0 <= l && l < r && r <= _size);\n int lb = (l + W - 1) / W, rb = r / W;\n if (lb > rb) return word_prod(l, r);\n T res = (lb == rb ? M::id() : block_table.prod(lb, rb));\n if (l < lb * W) res = M::op(res, word_prod(l, lb * W));\n if (rb * W < r) res = M::op(res, word_prod(rb * W, r));\n return res;\n }\n private:\n int _size;\n std::vector<T> data;\n sparse_table<M> block_table;\n std::vector<std::vector<std::uint64_t>> word_data;\n T word_prod(int l, int r) const {\n if (l == r) return M::id();\n int b = l / W;\n int lw = l - b * W, rw = r - b * W;\n if ((word_data[b][rw - 1] >> lw) == 0ul) return data[r - 1];\n return data[l + std::countr_zero(word_data[b][rw - 1] >> lw)];\n }\n};\nstruct linear_lca {\n private:\n struct S {\n int depth, index;\n bool operator<(const S &rhs) const { return depth < rhs.depth; }\n bool operator==(const S &rhs) const = default;\n };\n struct M {\n using value_type = S;\n static constexpr S id() { return S{std::numeric_limits<int>::max(), -1}; }\n static constexpr S op(const S &lhs, const S &rhs) { return std::min(lhs, rhs); }\n };\n public:\n template <class T>\n linear_lca(const Graph<T> &g, int r = 0) : ord(g.size(), -1), lst() {\n std::vector<S> v;\n std::stack<std::pair<int, int>> st;\n st.emplace(r, 0);\n while (!st.empty()) {\n auto [x, d] = st.top();\n st.pop();\n if (x < 0) {\n v.emplace_back(d, ~x);\n continue;\n }\n ord[x] = v.size();\n v.emplace_back(d, x);\n for (auto e : g[x]) {\n if (ord[e.to()] != -1) continue;\n st.emplace(~x, d);\n st.emplace(e.to(), d + 1);\n }\n }\n lst = linear_sparse_table<M>(v);\n }\n int operator()(int u, int v) const { return lca(u, v); }\n int lca(int u, int v) const {\n auto [l, r] = std::minmax(ord[u], ord[v]);\n return lst.prod(l, r + 1).index;\n }\n private:\n std::vector<int> ord;\n linear_sparse_table<M> lst;\n};\nint main(void) {\n int n, q;\n cin >> n >> q;\n vector<int> a(n);\n cin >> a;\n Graph<void> g(n);\n g.input_edges(n - 1);\n vector<int> in(n), out(n), ord(n * 2), w(n * 2);\n int c = 0;\n auto dfs = [&](auto self, int x, int p) -> void {\n in[x] = c;\n w[c] = 1;\n ord[c++] = a[x];\n for (auto e : g[x]) {\n if (e.to() == p)\n continue;\n self(self, e.to(), x);\n }\n w[c] = -1;\n ord[c++] = a[x];\n out[x] = c;\n };\n dfs(dfs, 0, -1);\n linear_lca lca(g);\n wavelet_matrix_rectangle_sum wm(ord, w);\n while (q--) {\n int u, v, k;\n cin >> u >> v >> k;\n --u, --v;\n auto f = [&](int y) {\n return wm.rect_sum(0, in[u] + 1, y) + wm.rect_sum(0, in[v] + 1, y) -\n wm.rect_sum(0, in[lca(u, v)] + 1, y) - wm.rect_sum(0, in[lca(u, v)], y) <\n k;\n };\n auto ans = meguru_binary_search(0, *max_element(all(a)) + 1, f);\n co(ans);\n }\n return 0;\n}","accuracy":1,"time_ms":2810,"memory_kb":49140,"score_of_the_acc":-1.3395,"final_rank":14},{"submission_id":"aoj_2270_10307727","code_snippet":"// AOJ #2270 The L-th Number\n// 2025.3.17\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0; int c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nstruct Node { int value, left, right; };\nconst int MAXN = 100005;\nNode segTree[MAXN * 20];\nint segRoot[MAXN];\nint segTreeCount = 0;\n\nint modify(int lBound, int rBound, int pos, int previousNode) {\n int currentNode = ++segTreeCount;\n segTree[currentNode] = segTree[previousNode];\n segTree[currentNode].value++;\n\n if (lBound == rBound) return currentNode;\n\n int mid = (lBound + rBound) >> 1;\n if (pos <= mid) {\n segTree[currentNode].left = modify(lBound, mid, pos, segTree[previousNode].left);\n } else {\n segTree[currentNode].right = modify(mid + 1, rBound, pos, segTree[previousNode].right);\n }\n return currentNode;\n}\n\nint query(int lBound, int rBound, int kth, int nodeU, int nodeV, int nodeLCA, int nodeParentLCA) {\n if (lBound == rBound) return lBound;\n int mid = (lBound + rBound) >> 1;\n int countLeft = segTree[segTree[nodeU].left].value\n + segTree[segTree[nodeV].left].value\n - segTree[segTree[nodeLCA].left].value\n - segTree[segTree[nodeParentLCA].left].value;\n if (kth <= countLeft)\n return query(lBound, mid, kth,\n segTree[nodeU].left, segTree[nodeV].left,\n segTree[nodeLCA].left, segTree[nodeParentLCA].left);\n else return query(mid + 1, rBound, kth - countLeft,\n segTree[nodeU].right, segTree[nodeV].right,\n segTree[nodeLCA].right, segTree[nodeParentLCA].right);\n}\n\nint totEdges = 0;\nint head[MAXN], to[MAXN << 1], nxt[MAXN << 1];\n\nvoid addEdge(int u, int v) {\n to[++totEdges] = v;\n nxt[totEdges] = head[u];\n head[u] = totEdges;\n}\n\nint totDFS = 0;\nint parent[MAXN], depth[MAXN], top[MAXN], subTreeSize[MAXN], id[MAXN], heavySon[MAXN];\nint n, q, totValues;\nint value[MAXN], sortedValues[MAXN];\n\nvoid dfs1(int u) {\n subTreeSize[u] = 0;\n for (int edge = head[u]; edge; edge = nxt[edge]) {\n int v = to[edge];\n if (v == parent[u]) continue;\n parent[v] = u;\n depth[v] = depth[u] + 1;\n dfs1(v);\n subTreeSize[u] += subTreeSize[v];\n if (subTreeSize[v] > subTreeSize[heavySon[u]]) heavySon[u] = v;\n }\n subTreeSize[u]++;\n}\n\nvoid dfs2(int u, int topNode) {\n segRoot[u] = modify(1, totValues, value[u], segRoot[parent[u]]);\n id[u] = ++totDFS;\n top[u] = topNode;\n if (heavySon[u]) dfs2(heavySon[u], topNode);\n for (int edge = head[u]; edge; edge = nxt[edge]) {\n int v = to[edge];\n if (v == parent[u] || v == heavySon[u]) continue;\n dfs2(v, v);\n }\n}\n\nint lca(int u, int v) {\n while (top[u] != top[v]) {\n if (depth[top[u]] < depth[top[v]]) swap(u, v);\n u = parent[top[u]];\n }\n return depth[u] < depth[v] ? u : v;\n}\n\nint main() {\n n = Cin(), q = Cin();\n\n for (int i = 1; i <= n; i++) sortedValues[i] = value[i] = Cin();\n\n for (int i = 2; i <= n; i++) {\n int u = Cin(), v = Cin();\n addEdge(u, v);\n addEdge(v, u);\n }\n\n sort(sortedValues + 1, sortedValues + n + 1);\n totValues = unique(sortedValues + 1, sortedValues + n + 1) - (sortedValues + 1);\n for (int i = 1; i <= n; i++)\n value[i] = lower_bound(sortedValues + 1, sortedValues + totValues + 1, value[i]) - sortedValues;\n\n depth[1] = 1;\n dfs1(1);\n dfs2(1, 1);\n\n while (q--) {\n int u = Cin(), v = Cin(), kth = Cin();\n int commonAncestor = lca(u, v);\n int index = query(1, totValues, kth, segRoot[u], segRoot[v],\n segRoot[commonAncestor], segRoot[parent[commonAncestor]]);\n Cout(sortedValues[index]);\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":32800,"score_of_the_acc":-0.2466,"final_rank":1},{"submission_id":"aoj_2270_9667715","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\n#endif\nusing ll=long long;\nusing ull=unsigned long long;\nusing P=pair<ll,ll>;\ntemplate<typename T>using minque=priority_queue<T,vector<T>,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 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 reps(i,a,n) for(int i=(a);i<int(n);i++)\n#define rep(i,n) reps(i,0,n)\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)\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#else\n#define debug(...) static_cast<void>(0)\n#define debugg(...) static_cast<void>(0)\ntemplate<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}\n#endif\nvoid SOLVE();\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout<<fixed<<setprecision(16);\n #ifdef LOCAL\n clock_t start=clock();\n #endif\n int testcase=1;\n //cin>>testcase;\n for(int i=0;i<testcase;i++){\n SOLVE();\n }\n #ifdef LOCAL\n cerr<<\"time:\";\n cerr<<(clock()-start)/1000;\n cerr<<\"ms\\n\";\n #endif\n}\nusing namespace std;\nstruct UnionFind{\nprivate:\n vector<int>par;\n int cs;\npublic:\n UnionFind(int n):par(n,-1),cs(n){}\n UnionFind(){}\n int root(int u){\n if(par[u]<0)return u;\n return par[u]=root(par[u]);\n }\n bool merge(int u,int v){\n int ru=root(u),rv=root(v);\n if(ru==rv)return false;\n if(par[ru]<par[rv])swap(ru,rv);\n par[rv]+=par[ru];\n par[ru]=rv;\n cs--;\n return true;\n }\n bool same(int u,int v){return root(u)==root(v);}\n int size(int u=-1){return u==-1?cs:-par[root(u)];}\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 ostream &operator<<(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};\nusing namespace std;\ntemplate<typename T=int>\nstruct Tree{\nprivate:\n int n;\n vector<Edge<T>>edge;\n vector<Edge<T>>g;\n vector<int>ptr;\n struct tree_range{\n using iterator=typename 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 bool empty()const{return !size();}\n Edge<T> &operator[](int i)const{return l[i];}\n };\n struct const_tree_range{\n using iterator=typename 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 bool empty()const{return !size();}\n const Edge<T> &operator[](int i)const{return l[i];}\n };\npublic:\n Tree(int n_):n(n_){\n edge.reserve(n-1);\n }\n Tree():n(0){}\n template<bool weighted=false,bool index=1>\n void read(){\n for(int i=0;i<n-1;i++){\n int u,v;\n T w=T();\n cin>>u>>v;\n if constexpr(index)u--,v--;\n if constexpr(weighted)cin>>w;\n else w=1;\n edge.emplace_back(u,v,w,i);\n }\n build();\n }\n template<bool index=1>\n void readp(){\n for(int i=1;i<n;i++){\n int p;\n cin>>p;\n if constexpr(index)p--;\n edge.emplace_back(i,p,1,i);\n }\n build();\n }\n void add_edge(int u,int v){edge.emplace_back(u,v,1,edge.size());}\n void add_edge(int u,int v,T w){edge.emplace_back(u,v,w,edge.size());}\n void add_edge(int u,int v,T w,int idx){edge.emplace_back(u,v,w,idx);}\n void build(){\n vector<int>cnt(n+1,0);\n for(auto&&[u,v,w,i]:edge)cnt[u+1]++,cnt[v+1]++;\n for(int i=1;i<=n;i++)cnt[i]+=cnt[i-1];\n assert(cnt[n]==n*2-2);\n ptr=cnt;\n g.resize(n*2-2);\n for(auto&&[u,v,w,i]:edge){\n g[cnt[u]++]=Edge(u,v,w,i);\n g[cnt[v]++]=Edge(v,u,w,i);\n }\n }\n void remove_parent(int root=0){\n edge.resize(n-1);\n auto dfs=[&](auto self,int x,int p,T w)->void {\n for(const Edge<T>&e:(*this)[x])if(e.to!=p){\n edge[e.index]=e;\n self(self,e.to,x,e.weight);\n }\n };\n dfs(dfs,root,-1,T());\n vector<int>cnt(n+1,0);\n for(int i=0;i<n-1;i++)cnt[edge[i].from+1]++;\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)g[cnt[e.from]++]=e;\n }\n void hld(int root=0){\n remove_parent(root);\n auto dfs=[&](auto self,int x)->int {\n int ret=1,mx=-1;\n for(Edge<T>&e:(*this)[x]){\n int s=self(self,e.to);\n ret+=s;\n if(mx<s){\n mx=s;\n swap((*this)[x][0],e);\n }\n }\n return ret;\n };\n dfs(dfs,root);\n }\n int size()const{return n;}\n tree_range operator[](int i){return tree_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\n const_tree_range operator[](int i)const{return const_tree_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\n const Edge<T>& get_edge(int i)const{return edge[i];}\n};\ntemplate<typename T>\nvector<int>offline_lca(const Tree<T>&t,const vector<pair<int,int>>&query,int root=0){\n int n=t.size();\n UnionFind uf(n);\n vector<int>st(n),mark(n),p(n),ret(query.size(),-1);\n int top=0;\n st[0]=root;\n for(const auto&[l,r]:query)mark[l]++,mark[r]++;\n vector<int>ptr;\n vector<pair<int,int>>q(query.size()*2);\n {\n vector<int>cnt(n+1);\n cnt[0]=0;\n for(int i=1;i<=n;i++)cnt[i]=cnt[i-1]+mark[i-1];\n ptr=cnt;\n for(int i=0;i<query.size();i++){\n q[cnt[query[i].first]++]=make_pair(query[i].second,i);\n q[cnt[query[i].second]++]=make_pair(query[i].first,i);\n }\n }\n for(int i=0;i<n;i++){\n p[i]=t[i].size();\n mark[i]=-1;\n }\n auto run=[&](int u)->bool {\n while(p[u]){\n int v=t[u][--p[u]].to;\n if(mark[v]==-1){\n st[++top]=v;\n return true;\n }\n }\n return false;\n };\n while(top!=-1){\n int u=st[top];\n if(mark[u]==-1)mark[u]=u;\n else{\n uf.merge(u,t[u][p[u]].to);\n mark[uf.root(u)]=u;\n }\n if(!run(u)){\n for(int i=ptr[u];i<ptr[u+1];i++){\n const auto&[v,j]=q[i];\n if(mark[v]!=-1&&ret[j]==-1)ret[j]=mark[uf.root(v)];\n }\n top--;\n }\n }\n return ret;\n}\nusing namespace std;\ntemplate<typename T,typename ADD,typename DEL,typename OUT>\nvoid mo_tree(Tree<T>t,vector<pair<int,int>>query,const ADD&add,const DEL&del,const OUT&out){\n int n=t.size();\n int q=query.size();\n int b=n/min(n,(int)sqrt(q));\n vector<int>dfs_order(n),dfs_order2(n*2-1);\n int d=0;\n t.remove_parent();\n auto dfs=[&](auto self,int x)->void {\n dfs_order[x]=d;\n dfs_order2[d++]=x;\n for(const Edge<T>&e:t[x]){\n self(self,e.to);\n dfs_order2[d++]=e.to;\n }\n };\n dfs(dfs,0);\n debug(dfs_order,dfs_order2);\n vector<int>lca=offline_lca(t,query);\n for(auto&[u,v]:query){\n u=dfs_order[u]+1;\n v=dfs_order[v]+1;\n if(u>v)swap(u,v);\n }\n vector<int>ord(q);\n iota(ord.begin(),ord.end(),0);\n sort(ord.begin(),ord.end(),[&](int x,int y)->bool {\n const pair<int,int>&a=query[x],&c=query[y];\n if(a.first/b!=c.first/b)return a.first<c.first;\n return ((a.first/b)&1)?a.second>c.second:a.second<c.second;\n });\n int l=0,r=0;\n vector<char>contain(n,false);\n auto flip=[&](int id){\n contain[id]^=1;\n if(contain[id])add(id);\n else del(id);\n };\n for(int i:ord){\n while(l>query[i].first)flip(dfs_order2[--l]);\n while(r<query[i].second)flip(dfs_order2[r++]);\n while(l<query[i].first)flip(dfs_order2[l++]);\n while(r>query[i].second)flip(dfs_order2[--r]);\n flip(lca[i]);\n out(i);\n flip(lca[i]);\n }\n}\ntemplate<typename T>\nstruct SquareRootDecomposition{\nprivate:\n vector<T>block,dlock;\n int n,b;\npublic:\n SquareRootDecomposition(int n_):n(n_),b(sqrt(n_)){\n block.resize((n+b-1)/b,0);\n dlock.resize(n,0);\n }\n inline void add(int i,T x){\n dlock[i]+=x;\n block[i/b]+=x;\n }\n inline void set(int i,T x){\n add(i,x-dlock[i]);\n }\n T sum(int l,int r)const{\n T ret=0;\n if(r-l<b){\n reps(i,l,r)ret+=dlock[i];\n }\n else{\n int l2=(l+b-1)/b*b;\n int r2=r/b*b;\n reps(i,l,l2)ret+=dlock[i];\n reps(i,r2,r)ret+=dlock[i];\n l=l2/b,r=r2/b;\n reps(i,l,r)ret+=block[i];\n }\n return ret;\n }\n int lower_bound(int id,T k=1)const{\n assert(k);\n if(k>0){\n int id2=(id+b-1)/b*b;\n reps(i,id,id2){\n if((k-=dlock[i])<=0)return i;\n }\n id=id2/b;\n while(id<block.size()){\n if(k-block[id]<=0)break;\n k-=block[id++];\n }\n if(id==block.size())return n;\n id*=b;\n reps(i,id,id+b){\n if((k-=dlock[i])<=0)return i;\n }\n }\n else{\n k=-k;\n int id2=id/b*b;\n for(int i=id-1;i>=id2;i--){\n if((k-=dlock[i])<=0)return i+1;\n }\n id=id2/b;\n while(id){\n if(k-block[id-1]<=0)break;\n k-=block[--id];\n }\n if(id==0)return 0;\n id*=b;\n for(int i=id-1;i>=id-b;i--){\n if((k-=dlock[i])<=0)return i+1;\n }\n }\n return -1;\n }\n friend ostream &operator<<(ostream &os,const SquareRootDecomposition<T>&srd){\n os<<srd.dlock;\n return os;\n }\n};\nvoid SOLVE(){\n int n,q;\n cin>>n>>q;\n vector<int>v(n);\n cin>>v;\n auto z(v);\n sort(all(z)),z.erase(unique(all(z)),z.end());\n rep(i,n)v[i]=lower_bound(all(z),v[i])-z.begin();\n Tree t(n);\n t.read();\n vector<pair<int,int>>query(q);\n vector<int>k(q);\n vector<int>ans(q);\n rep(i,q){\n cin>>query[i]>>k[i];\n query[i]--;\n }\n SquareRootDecomposition<int>srd(z.size());\n mo_tree(t,query,[&](int x){srd.add(v[x],1);},[&](int x){srd.add(v[x],-1);},[&](int x){ans[x]=z[srd.lower_bound(0,k[x])];});\n rep(i,q)cout<<ans[i]<<'\\n';\n}","accuracy":1,"time_ms":540,"memory_kb":25896,"score_of_the_acc":-0.3561,"final_rank":3},{"submission_id":"aoj_2270_9555521","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n// #if __has_include(<atcoder/all>)\n// #include <atcoder/all>\n// using namespace atcoder;\n// template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}\n// istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}\n// #endif\n#ifdef LOCAL\n#include \"debug.h\"\n#else\n#define debug(...) static_cast<void>(0)\n#define debugg(...) static_cast<void>(0)\n#define esper(...) static_cast<void>(0)\ntemplate<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}\n#endif\nusing ll=long long;\nusing ull=unsigned long long;\nusing P=pair<ll,ll>;\ntemplate<typename T>using minque=priority_queue<T,vector<T>,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 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 reps(i,a,n) for(int i=(a);i<int(n);i++)\n#define rep(i,n) reps(i,0,n)\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)\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}\nvoid SOLVE();\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout<<fixed<<setprecision(16);\n #ifdef LOCAL\n clock_t start=clock();\n #endif\n int testcase=1;\n //cin>>testcase;\n for(int i=0;i<testcase;i++){\n SOLVE();\n }\n #ifdef LOCAL\n cerr<<\"time:\";\n cerr<<(clock()-start)/1000;\n cerr<<\"ms\\n\";\n #endif\n}\nstruct dsu{\n vector<int>par;\n dsu(int n):par(n,-1){}\n int leader(int u){\n while(par[u]>=0)u=par[u];\n return u;\n }\n void merge(int u,int v){\n int ru=leader(u),rv=leader(v);\n if(ru!=rv){\n if(par[ru]>par[rv])swap(ru,rv);\n par[ru]+=par[rv];\n par[rv]=ru;\n }\n }\n\n};\nvector<int>offline_lca(vector<vector<int>>&g,vector<pair<int,int>>query,int root=0){\n int n=g.size();\n dsu uf(n);\n vector<int>st(n),mark(n),p(n),ret(query.size(),-1);\n int top=0;\n st[0]=root;\n for(auto &&[l,r]:query)mark[l]++,mark[r]++;\n vector<vector<pair<int,int>>>q(n);\n rep(i,n){\n q[i].reserve(mark[i]);\n mark[i]=-1;\n p[i]=g[i].size();\n }\n rep(i,query.size()){\n q[query[i].first].emplace_back(query[i].second,i);\n q[query[i].second].emplace_back(query[i].first,i);\n }\n auto run=[&](int u)->bool {\n while(p[u]){\n int v=g[u][--p[u]];\n if(mark[v]==-1){\n st[++top]=v;\n return true;\n }\n }\n return false;\n };\n while(top!=-1){\n int u=st[top];\n if(mark[u]==-1)mark[u]=u;\n else{\n uf.merge(u,g[u][p[u]]);\n mark[uf.leader(u)]=u;\n }\n if(!run(u)){\n for(auto&&[v,i]:q[u]){\n if(mark[v]!=-1&&ret[i]==-1)ret[i]=mark[uf.leader(v)];\n }\n top--;\n }\n }\n return ret;\n}\ntemplate<bool vertex_query=true>\nstruct MoTree{\npublic:\n vector<int>par;\nprivate:\n vector<vector<int>>g;\n int n,st;\n vector<pair<int,int>>Q;\n vector<int>dfs_order;\n vector<int>dfs_order2;\n int d;\n void dfs(int x,int p){\n par[x]=p;\n dfs_order[x]=d;\n dfs_order2[d++]=x;\n for(int i:g[x])if(i!=p){\n dfs(i,x);\n dfs_order2[d++]=i;\n }\n }\npublic:\n MoTree(int n):n(n),g(n),dfs_order(n),dfs_order2(n*2-1),d(0),par(n){}\n void add_edge(int u,int v){\n g[u].push_back(v);\n g[v].push_back(u);\n }\n void add_query(int u,int v){\n Q.push_back({u,v});\n }\n template<typename F1,typename F2,typename F3,typename F4>\n void build(F1 init,F2 add,F3 del,F4 out){\n int q=Q.size();\n st=n/min<int>(n,sqrt(q));\n dfs(0,-1);\n vector<int>lca=offline_lca(g,Q);\n debug(lca);\n rep(i,Q.size()){\n Q[i].first=dfs_order[Q[i].first]+1;\n Q[i].second=dfs_order[Q[i].second]+1;\n if(Q[i].first>Q[i].second)swap(Q[i].first,Q[i].second);\n }\n vector<int>ord(Q.size());\n iota(all(ord),0);\n sort(all(ord),[&](int x,int y){\n pair<int,int>a=Q[x],b=Q[y];\n if(a.first/st!=b.first/st)return a.first<b.first;\n return ((a.first/st)&1)?a.second>b.second:a.second<b.second;\n });\n init();\n int l=0,r=0;\n vector<char>contain(n,false);\n auto f=[&](int id)->void {\n contain[id]^=1;\n if(contain[id])add(id);\n else del(id);\n };\n for(int i:ord){\n while(l>Q[i].first)f(dfs_order2[--l]);\n while(r<Q[i].second)f(dfs_order2[r++]);\n while(l<Q[i].first)f(dfs_order2[l++]);\n while(r>Q[i].second)f(dfs_order2[--r]);\n if constexpr(vertex_query)f(lca[i]);\n out(i);\n if constexpr(vertex_query)f(lca[i]);\n }\n }\n};\nvoid SOLVE(){\n int n,q;\n cin>>n>>q;\n vector<int>x(n);\n cin>>x;\n MoTree mo(n);\n rep(i,n-1){\n int u,v;\n cin>>u>>v;\n u--,v--;\n mo.add_edge(u,v);\n }\n vector<int>kth(q);\n rep(i,q){\n int u,v,k;\n cin>>u>>v>>k;\n u--,v--;\n mo.add_query(u,v);\n kth[i]=k;\n }\n int vsize=n*2-1;\n int b=sqrt(vsize)+1;\n vector<int>block((vsize+b-1)/b,0);\n vector<int>dlock(vsize,0);\n vector<int>z;\n vector<int>ans(q);\n auto init=[&]()->void {\n z=x;\n sort(all(z)),z.erase(unique(all(z)),z.end());\n rep(i,n)x[i]=lower_bound(all(z),x[i])-z.begin();\n };\n auto add=[&](int i)->void {\n dlock[x[i]]++;\n block[x[i]/b]++;\n };\n auto del=[&](int i)->void {\n dlock[x[i]]--;\n block[x[i]/b]--;\n };\n auto out=[&](int i)->void {\n int pos=0;\n while(kth[i]>block[pos])kth[i]-=block[pos++];\n pos*=b;\n while(kth[i]>dlock[pos])kth[i]-=dlock[pos++];\n ans[i]=z[pos];\n };\n mo.build(init,add,del,out);\n rep(i,q)cout<<ans[i]<<'\\n';\n}","accuracy":1,"time_ms":570,"memory_kb":24432,"score_of_the_acc":-0.3559,"final_rank":2},{"submission_id":"aoj_2270_8993168","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct BIT{\n int N;\n vector<int> bit;\n BIT(int N_): N(N_), bit(N_ + 1, 0){\n }\n void add(int i, int x){\n i++; //0base->1base\n while (i <= N){\n bit[i] += x;\n i += i & -i;\n }\n }\n int sum(int i){ //1base\n int ans = 0;\n while (i > 0){\n ans += bit[i];\n i -= i & -i;\n }\n return ans;\n }\n int sum(int L, int R){\n return sum(R) - sum(L);\n }\n};\n\nint main() {\n int n,q;\n cin >> n >> q;\n \n vector<int> x(n);\n for(auto &xa:x) cin >> xa;\n vector<vector<int>> g(n);\n int a,b;\n for(int i=0;i<n-1;i++){\n cin >> a >> b;\n a--;b--;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n vector<int> s1(q),s2(q),l(q),r(q);\n for(int i=0;i<q;i++){ \n cin >> s1[i] >> s2[i] >> l[i];\n s1[i]--;s2[i]--;\n }\n \n vector<int> xs=x;\n sort(xs.begin(),xs.end());\n xs.erase(unique(xs.begin(),xs.end()),xs.end());\n int cnt=(int)xs.size();\n vector<vector<int>> add(cnt);\n for(int i=0;i<n;i++){\n x[i]=find(xs.begin(),xs.end(),x[i])-xs.begin();\n add[x[i]].push_back(i);\n }\n\n int k=17;\n\n vector<int> in(n),out(n),dp(n);\n vector pr(n,vector<int>(k+2,-1));\n int t=0;\n function<void(int,int,int)> dfs=[&](int p,int cl,int d){\n in[cl]=t;\n t++;\n pr[cl][0]=p;\n dp[cl]=d;\n for(auto nx:g[cl]){\n if(nx==p) continue;\n dfs(cl,nx,d+1);\n }\n out[cl]=t;\n t++;\n };\n dfs(-1,0,0);\n\n for (int i = 0; i <=k; i++){\n for (int j = 0; j < n; j++){\n if (pr[j][i] != -1){\n pr[j][i+1] = pr[pr[j][i]][i];\n }\n }\n }\n\n function<int(int,int)> lca=[&](int u, int v){\n //cout << u << \" \" << v << endl;\n if (dp[u] > dp[v]) swap(u, v);\n int dif=dp[v]-dp[u];\n for(int i=0;i<=k;i++){\n if((dif>>i&1)==1) v=pr[v][i];\n }\n //cout << v << \"V\" << dp[v] << \" \" << dp[u] <<endl;\n \n if (u == v) return u;\n\n for (int i = k; i >= 0; i--){\n if (pr[u][i] != pr[v][i]){\n u = pr[u][i];\n v = pr[v][i];\n }\n }\n return pr[u][0];\n };\n \n for(int i=0;i<q;i++){ \n r[i]=lca(s1[i],s2[i]);\n //cout << i << \" \" << r[i] << endl;\n }\n\n vector<int> tv(q, 0), fv(q, cnt);\n while (true){\n bool ok = true;\n vector<vector<int>> query(cnt);\n for (int i = 0; i < q; i++){\n if (fv[i] - tv[i] > 1){\n ok = false;\n query[(tv[i] + fv[i]) / 2].push_back(i);\n }\n }\n if (ok){\n break;\n }\n BIT bit(n * 2);\n for (int i = 0; i < cnt; i++){\n for (int j : query[i]){\n if(fv[j]-tv[j]<=1) continue; \n int sum = bit.sum(in[r[j]] + 1, in[s1[j]] + 1) + bit.sum(in[r[j]] + 1, in[s2[j]] + 1);\n if (x[r[j]] < i){\n sum++;\n }\n //cout << i << \" \" << j << \" \" <<sum << \" \" << l[j] << endl;\n if (sum < l[j]){\n tv[j] = i;\n } else {\n fv[j] = i;\n }\n }\n for (int j : add[i]){\n bit.add(in[j], 1);\n bit.add(out[j], -1);\n }\n //for(int k=0;k<N*2;k++) cout << BIT.sum(k,k+1) << \" \";\n //cout << endl;\n }\n }\n \n //cout << cnt << endl;\n \n for (int i = 0; i < q; i++){\n cout << xs[tv[i]] << endl;\n }\n\n}","accuracy":1,"time_ms":1530,"memory_kb":39752,"score_of_the_acc":-0.8126,"final_rank":6},{"submission_id":"aoj_2270_8993159","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct BIT{\n int N;\n vector<int> bit;\n BIT(int N_): N(N_), bit(N_ + 1, 0){\n }\n void add(int i, int x){\n i++; //0base->1base\n while (i <= N){\n bit[i] += x;\n i += i & -i;\n }\n }\n int sum(int i){ //1base\n int ans = 0;\n while (i > 0){\n ans += bit[i];\n i -= i & -i;\n }\n return ans;\n }\n int sum(int L, int R){\n return sum(R) - sum(L);\n }\n};\n\nint main() {\n int n,q;\n cin >> n >> q;\n \n vector<int> x(n);\n for(auto &xa:x) cin >> xa;\n vector<vector<int>> g(n);\n int a,b;\n for(int i=0;i<n-1;i++){\n cin >> a >> b;\n a--;b--;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n vector<int> s1(q),s2(q),l(q),r(q);\n for(int i=0;i<q;i++){ \n cin >> s1[i] >> s2[i] >> l[i];\n s1[i]--;s2[i]--;\n }\n \n vector<int> xs=x;\n sort(xs.begin(),xs.end());\n xs.erase(unique(xs.begin(),xs.end()),xs.end());\n int cnt=(int)xs.size();\n vector<vector<int>> add(cnt);\n for(int i=0;i<n;i++){\n x[i]=find(xs.begin(),xs.end(),x[i])-xs.begin();\n add[x[i]].push_back(i);\n }\n\n int k=17;\n\n vector<int> in(n),out(n),dp(n);\n vector pr(n,vector<int>(k+2,-1));\n int t=0;\n function<void(int,int,int)> dfs=[&](int p,int cl,int d){\n in[cl]=t;\n t++;\n pr[cl][0]=p;\n dp[cl]=d;\n for(auto nx:g[cl]){\n if(nx==p) continue;\n dfs(cl,nx,d+1);\n }\n out[cl]=t;\n t++;\n };\n dfs(-1,0,0);\n\n for (int i = 0; i <=k; i++){\n for (int j = 0; j < n; j++){\n if (pr[j][i] != -1){\n pr[j][i+1] = pr[pr[j][i]][i];\n }\n }\n }\n\n function<int(int,int)> lca=[&](int u, int v){\n //cout << u << \" \" << v << endl;\n if (dp[u] > dp[v]) swap(u, v);\n int dif=dp[v]-dp[u];\n for(int i=0;i<=k;i++){\n if((dif>>i&1)==1) v=pr[v][i];\n }\n //cout << v << \"V\" << dp[v] << \" \" << dp[u] <<endl;\n \n if (u == v) return u;\n\n for (int i = k; i >= 0; i--){\n if (pr[u][i] != pr[v][i]){\n u = pr[u][i];\n v = pr[v][i];\n }\n }\n return pr[u][0];\n };\n \n for(int i=0;i<q;i++){ \n r[i]=lca(s1[i],s2[i]);\n //cout << i << \" \" << r[i] << endl;\n }\n\n vector<int> tv(q, 0), fv(q, cnt);\n while (true){\n bool ok = true;\n vector<vector<int>> query(cnt);\n for (int i = 0; i < q; i++){\n if (fv[i] - tv[i] > 1){\n ok = false;\n query[(tv[i] + fv[i]) / 2].push_back(i);\n }\n }\n if (ok){\n break;\n }\n BIT bit(n * 2);\n for (int i = 0; i < cnt; i++){\n for (int j : query[i]){\n int sum = bit.sum(in[r[j]] + 1, in[s1[j]] + 1) + bit.sum(in[r[j]] + 1, in[s2[j]] + 1);\n if (x[r[j]] < i){\n sum++;\n }\n //cout << i << \" \" << j << \" \" <<sum << \" \" << l[j] << endl;\n if (sum < l[j]){\n tv[j] = i;\n } else {\n fv[j] = i;\n }\n }\n for (int j : add[i]){\n bit.add(in[j], 1);\n bit.add(out[j], -1);\n }\n //for(int k=0;k<N*2;k++) cout << BIT.sum(k,k+1) << \" \";\n //cout << endl;\n }\n }\n \n //cout << cnt << endl;\n \n for (int i = 0; i < q; i++){\n cout << xs[tv[i]] << endl;\n }\n\n}","accuracy":1,"time_ms":1530,"memory_kb":39832,"score_of_the_acc":-0.8132,"final_rank":7},{"submission_id":"aoj_2270_8993149","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct BIT{\n int N;\n vector<int> bit;\n BIT(int N_): N(N_), bit(N_ + 1, 0){\n }\n void add(int i, int x){\n i++; //0base->1base\n while (i <= N){\n bit[i] += x;\n i += i & -i;\n }\n }\n int sum(int i){ //1base\n int ans = 0;\n while (i > 0){\n ans += bit[i];\n i -= i & -i;\n }\n return ans;\n }\n int sum(int L, int R){\n return sum(R) - sum(L);\n }\n};\n\nint main() {\n int n,q;\n cin >> n >> q;\n \n vector<int> x(n);\n for(auto &xa:x) cin >> xa;\n vector<vector<int>> g(n);\n int a,b;\n for(int i=0;i<n-1;i++){\n cin >> a >> b;\n a--;b--;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n vector<int> s1(q),s2(q),l(q),r(q);\n for(int i=0;i<q;i++){ \n cin >> s1[i] >> s2[i] >> l[i];\n s1[i]--;s2[i]--;\n }\n \n vector<int> xs=x;\n sort(xs.begin(),xs.end());\n xs.erase(unique(xs.begin(),xs.end()),xs.end());\n int cnt=(int)xs.size();\n vector<vector<int>> add(cnt);\n for(int i=0;i<n;i++){\n x[i]=find(xs.begin(),xs.end(),x[i])-xs.begin();\n add[x[i]].push_back(i);\n }\n\n int k=2,kk=2;\n while(kk<n){k++; kk=kk*kk;}\n //cout << k << endl;\n\n vector<int> in(n),out(n),dp(n);\n vector pr(n,vector<int>(k+2,-1));\n int t=0;\n function<void(int,int,int)> dfs=[&](int p,int cl,int d){\n in[cl]=t;\n t++;\n pr[cl][0]=p;\n dp[cl]=d;\n for(auto nx:g[cl]){\n if(nx==p) continue;\n dfs(cl,nx,d+1);\n }\n out[cl]=t;\n t++;\n };\n dfs(-1,0,0);\n\n for (int i = 0; i <=k; i++){\n for (int j = 0; j < n; j++){\n if (pr[j][i] != -1){\n pr[j][i+1] = pr[pr[j][i]][i];\n }\n }\n }\n\n function<int(int,int)> lca=[&](int u, int v){\n //cout << u << \" \" << v << endl;\n if (dp[u] > dp[v]) swap(u, v);\n int dif=dp[v]-dp[u];\n for(int i=0;i<=k;i++){\n if((dif>>i&1)==1) v=pr[v][i];\n }\n //cout << v << \"V\" << dp[v] << \" \" << dp[u] <<endl;\n \n if (u == v) return u;\n\n for (int i = k; i >= 0; i--){\n if (pr[u][i] != pr[v][i]){\n u = pr[u][i];\n v = pr[v][i];\n }\n }\n return pr[u][0];\n };\n \n for(int i=0;i<q;i++){ \n r[i]=lca(s1[i],s2[i]);\n //cout << i << \" \" << r[i] << endl;\n }\n\n vector<int> tv(q,-1),ss(q,0);\n BIT bit(n*2);\n for (int i = 0; i < cnt; i++){\n for (int j : add[i]){\n bit.add(in[j], 1);\n bit.add(out[j], -1);\n }\n //for(int k1=0;k1<n*2;k1++) cout << bit.sum(k1,k1+1) << \" \";\n //cout << endl;\n \n for(int j=0;j<q;j++){\n if(tv[j]!=-1) continue;\n int sum = bit.sum(in[r[j]] + 1, in[s1[j]] + 1) + bit.sum(in[r[j]] + 1, in[s2[j]] + 1);\n if (x[r[j]] <= i) sum++;\n //cout << i << \" \" << j << \" \" <<sum << \" \" << l[j] << endl;\n if((sum-ss[j]>1)&&(ss[j]+1<=l[j])&&(sum>=l[j])) tv[j]=i;\n else if(sum==l[j]) tv[j]=i;\n else ss[j]=sum;\n }\n }\n \n //cout << cnt << endl;\n \n for (int i = 0; i < q; i++){\n cout << xs[tv[i]] << endl;\n }\n\n}","accuracy":0.41935483870967744,"time_ms":10,"memory_kb":3456,"score_of_the_acc":0,"final_rank":20},{"submission_id":"aoj_2270_8216308","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class Key> struct RandomizedBinarySearchTree {\n inline int xor128() {\n static int x = 123456789;\n static int y = 362436069;\n static int z = 521288629;\n static int w = 88675123;\n int t;\n t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n }\n struct Node {\n Node *l, *r;\n int cnt;\n Key key;\n Node() {}\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\n };\n vector<Node> pool;\n int ptr;\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\n virtual Node *clone(Node *t) { return t; }\n inline int count(const Node *t) { return t ? t->cnt : 0; }\n inline Node *update(Node *t) {\n t->cnt = count(t->l) + count(t->r) + 1;\n return t;\n }\n Node *propagete(Node *t) { return update(clone(t)); }\n Node *merge(Node *l, Node *r) {\n if (!l || !r)\n return l ? l : r;\n if (xor128() % (l->cnt + r->cnt) < l->cnt) {\n l = propagete(l);\n l->r = merge(l->r, r);\n return update(l);\n } else {\n r = propagete(r);\n r->l = merge(l, r->l);\n return update(r);\n }\n }\n pair<Node *, Node *> split(Node *t, int k) {\n if (!t)\n return {t, t};\n t = propagete(t);\n if (k <= count(t->l)) {\n auto s = split(t->l, k);\n t->l = s.second;\n return {s.first, update(t)};\n } else {\n auto s = split(t->r, k - count(t->l) - 1);\n t->r = s.first;\n return {update(t), s.second};\n }\n }\n Node *build(int l, int r, const vector<Key> &v) {\n if (l + 1 >= r)\n return alloc(v[l]);\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\n }\n Node *build(const vector<Key> &v) {\n ptr = 0;\n return build(0, (int)v.size(), v);\n }\n void dump(Node *r, typename vector<Key>::iterator &it) {\n if (!r)\n return;\n r = propagete(r);\n dump(r->l, it);\n *it = r->key;\n dump(r->r, ++it);\n }\n vector<Key> dump(Node *r) {\n vector<Key> v((size_t)count(r));\n auto it = begin(v);\n dump(r, it);\n return v;\n }\n string to_string(Node *r) {\n auto s = dump(r);\n string ret;\n for (int i = 0; i < s.size(); i++)\n ret += \", \";\n return (ret);\n }\n void insert(Node *&t, int k, const Key &v) {\n auto x = split(t, k);\n t = merge(merge(x.first, alloc(v)), x.second);\n }\n void erase(Node *&t, int k) {\n auto x = split(t, k);\n t = merge(x.first, split(x.second, 1).second);\n }\n int size(Node *t) { return count(t); }\n bool empty(Node *t) { return !t; }\n Node *makeset() { return (nullptr); }\n};\ntemplate <class Key>\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\n using RBST = RandomizedBinarySearchTree<Key>;\n using Node = typename RBST::Node;\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\n};\ntemplate <class T>\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\n using RBST = PresidentRandomizedBinarySearchTree<T>;\n using Node = typename RBST::Node;\n OrderedMultiSet(int sz) : RBST(sz) {}\n T kth_element(Node *t, int k) {\n if (k < RBST::count(t->l))\n return kth_element(t->l, k);\n if (k == RBST::count(t->l))\n return t->key;\n return kth_element(t->r, k - RBST::count(t->l) - 1);\n }\n virtual void insert_key(Node *&t, const T &x) {\n RBST::insert(t, lower_bound(t, x), x);\n }\n void erase_key(Node *&t, const T &x) {\n if (!count(t, x))\n return;\n RBST::erase(t, lower_bound(t, x));\n }\n int count(Node *t, const T &x) {\n return upper_bound(t, x) - lower_bound(t, x);\n }\n int lower_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x <= t->key)\n return lower_bound(t->l, x);\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n int upper_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x < t->key)\n return upper_bound(t->l, x);\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n};\nstruct CentroidPathDecomposition {\n struct Centroid {\n int ParIndex, ParDepth, Deep;\n vector<int> node;\n Centroid(int idx, int dep, int deep)\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\n inline size_t size() { return (node.size()); }\n inline int &operator[](int k) { return (node[k]); }\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\n };\n vector<vector<int>> graph;\n vector<int> SubTreeSize, NextPath;\n vector<int> TreeIndex, TreeDepth;\n vector<Centroid> Centroids;\n void BuildSubTreeSize() {\n stack<pair<int, int>> s;\n s.emplace(0, -1);\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n if (~SubTreeSize[p.first]) {\n NextPath[p.first] = -1;\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n SubTreeSize[p.first] += SubTreeSize[to];\n if (NextPath[p.first] == -1 ||\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\n NextPath[p.first] = to;\n }\n }\n } else {\n s.push(p);\n SubTreeSize[p.first] = 1;\n for (auto &to : graph[p.first]) {\n if (p.second != to)\n s.emplace(to, p.first);\n }\n }\n }\n }\n void BuildPath() {\n stack<pair<int, int>> s;\n Centroids.emplace_back(-1, -1, 0);\n s.emplace(0, -1);\n TreeIndex[0] = 0;\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n if (to == NextPath[p.first]) {\n TreeIndex[to] = TreeIndex[p.first];\n } else {\n TreeIndex[to] = (int)Centroids.size();\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\n Centroids[TreeIndex[p.first]].Deep + 1);\n }\n s.emplace(to, p.first);\n }\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\n }\n }\n void AddEdge(int x, int y) {\n graph[x].push_back(y);\n graph[y].push_back(x);\n }\n virtual void Build() {\n BuildSubTreeSize();\n BuildPath();\n }\n inline size_t size() { return (Centroids.size()); }\n inline pair<int, int> Information(int idx) {\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\n }\n inline Centroid &operator[](int k) { return (Centroids[k]); }\n inline int LCA(int a, int b) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n return (Centroids[TreeIdxA][TreeDepthA]);\n }\n inline virtual void query(int a, int b,\n const function<void(int, int, int)> &f) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n f(TreeIdxA, 0, TreeDepthA + 1);\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n f(TreeIdxB, 0, TreeDepthB + 1);\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\n }\n CentroidPathDecomposition(int SZ) {\n graph.resize(SZ);\n SubTreeSize.assign(SZ, -1);\n NextPath.resize(SZ);\n TreeIndex.resize(SZ);\n TreeDepth.resize(SZ);\n }\n};\nOrderedMultiSet<int> tree(5000000);\nOrderedMultiSet<int>::Node *nodes[100000];\nint N, Q, X[100000];\nvector<int> g[100000];\nint parent[100000];\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\n parent[idx] = par;\n tree.insert_key(par_set, X[idx]);\n nodes[idx] = par_set;\n for (auto &to : g[idx])\n if (to != par)\n dfs(to, idx, par_set);\n}\nint main() {\n scanf(\"%d %d\", &N, &Q);\n CentroidPathDecomposition gg(N);\n vector<int> vs;\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", &X[i]);\n vs.emplace_back(X[i]);\n }\n sort(begin(vs), end(vs));\n vs.erase(unique(begin(vs), end(vs)), end(vs));\n for (int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n gg.AddEdge(x, y);\n }\n dfs(0, -1, tree.makeset());\n gg.Build();\n for (int i = 0; i < Q; i++) {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n --x, --y;\n int lca = gg.LCA(x, y);\n int ng = -1, ok = (int)vs.size() - 1;\n auto sum = [&](int v) {\n int ret = 0;\n ret += tree.upper_bound(nodes[x], vs[v]);\n ret += tree.upper_bound(nodes[y], vs[v]);\n ret -= X[lca] <= vs[v];\n if (lca)\n ret -= 2 * tree.upper_bound(nodes[parent[lca]], vs[v]);\n return ret;\n };\n while (ok - ng > 1) {\n int mid = (ok + ng) >> 1;\n if (sum(mid) >= z)\n ok = mid;\n else\n ng = mid;\n }\n printf(\"%d\\n\", vs[ok]);\n }\n}","accuracy":1,"time_ms":780,"memory_kb":132436,"score_of_the_acc":-1.2335,"final_rank":10},{"submission_id":"aoj_2270_8216303","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class Key> struct RandomizedBinarySearchTree {\n inline int xor128() {\n static int x = 123456789;\n static int y = 362436069;\n static int z = 521288629;\n static int w = 88675123;\n int t;\n t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n }\n struct Node {\n Node *l, *r;\n int cnt;\n Key key;\n Node() {}\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\n };\n vector<Node> pool;\n int ptr;\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\n virtual Node *clone(Node *t) { return t; }\n inline int count(const Node *t) { return t ? t->cnt : 0; }\n inline Node *update(Node *t) {\n t->cnt = count(t->l) + count(t->r) + 1;\n return t;\n }\n Node *propagete(Node *t) { return update(clone(t)); }\n Node *merge(Node *l, Node *r) {\n if (!l || !r)\n return l ? l : r;\n if (xor128() % (l->cnt + r->cnt) < l->cnt) {\n l = propagete(l);\n l->r = merge(l->r, r);\n return update(l);\n } else {\n r = propagete(r);\n r->l = merge(l, r->l);\n return update(r);\n }\n }\n pair<Node *, Node *> split(Node *t, int k) {\n if (!t)\n return {t, t};\n t = propagete(t);\n if (k <= count(t->l)) {\n auto s = split(t->l, k);\n t->l = s.second;\n return {s.first, update(t)};\n } else {\n auto s = split(t->r, k - count(t->l) - 1);\n t->r = s.first;\n return {update(t), s.second};\n }\n }\n Node *build(int l, int r, const vector<Key> &v) {\n if (l + 1 >= r)\n return alloc(v[l]);\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\n }\n Node *build(const vector<Key> &v) {\n ptr = 0;\n return build(0, (int)v.size(), v);\n }\n void dump(Node *r, typename vector<Key>::iterator &it) {\n if (!r)\n return;\n r = propagete(r);\n dump(r->l, it);\n *it = r->key;\n dump(r->r, ++it);\n }\n vector<Key> dump(Node *r) {\n vector<Key> v((size_t)count(r));\n auto it = begin(v);\n dump(r, it);\n return v;\n }\n string to_string(Node *r) {\n auto s = dump(r);\n string ret;\n for (int i = 0; i < s.size(); i++)\n ret += \", \";\n return (ret);\n }\n void insert(Node *&t, int k, const Key &v) {\n auto x = split(t, k);\n t = merge(merge(x.first, alloc(v)), x.second);\n }\n void erase(Node *&t, int k) {\n auto x = split(t, k);\n t = merge(x.first, split(x.second, 1).second);\n }\n int size(Node *t) { return count(t); }\n bool empty(Node *t) { return !t; }\n Node *makeset() { return (nullptr); }\n};\ntemplate <class Key>\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\n using RBST = RandomizedBinarySearchTree<Key>;\n using Node = typename RBST::Node;\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\n};\ntemplate <class T>\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\n using RBST = PresidentRandomizedBinarySearchTree<T>;\n using Node = typename RBST::Node;\n OrderedMultiSet(int sz) : RBST(sz) {}\n T kth_element(Node *t, int k) {\n if (k < RBST::count(t->l))\n return kth_element(t->l, k);\n if (k == RBST::count(t->l))\n return t->key;\n return kth_element(t->r, k - RBST::count(t->l) - 1);\n }\n virtual void insert_key(Node *&t, const T &x) {\n RBST::insert(t, lower_bound(t, x), x);\n }\n void erase_key(Node *&t, const T &x) {\n if (!count(t, x))\n return;\n RBST::erase(t, lower_bound(t, x));\n }\n int count(Node *t, const T &x) {\n return upper_bound(t, x) - lower_bound(t, x);\n }\n int lower_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x <= t->key)\n return lower_bound(t->l, x);\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n int upper_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x < t->key)\n return upper_bound(t->l, x);\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n};\nstruct CentroidPathDecomposition {\n struct Centroid {\n int ParIndex, ParDepth, Deep;\n vector<int> node;\n Centroid(int idx, int dep, int deep)\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\n inline size_t size() { return (node.size()); }\n inline int &operator[](int k) { return (node[k]); }\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\n };\n vector<vector<int>> graph;\n vector<int> SubTreeSize, NextPath;\n vector<int> TreeIndex, TreeDepth;\n vector<Centroid> Centroids;\n void BuildSubTreeSize() {\n stack<pair<int, int>> s;\n s.emplace(0, -1);\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n if (~SubTreeSize[p.first]) {\n NextPath[p.first] = -1;\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n SubTreeSize[p.first] += SubTreeSize[to];\n if (NextPath[p.first] == -1 ||\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\n NextPath[p.first] = to;\n }\n }\n } else {\n s.push(p);\n SubTreeSize[p.first] = 1;\n for (auto &to : graph[p.first]) {\n if (p.second != to)\n s.emplace(to, p.first);\n }\n }\n }\n }\n void BuildPath() {\n stack<pair<int, int>> s;\n Centroids.emplace_back(-1, -1, 0);\n s.emplace(0, -1);\n TreeIndex[0] = 0;\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n if (to == NextPath[p.first]) {\n TreeIndex[to] = TreeIndex[p.first];\n } else {\n TreeIndex[to] = (int)Centroids.size();\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\n Centroids[TreeIndex[p.first]].Deep + 1);\n }\n s.emplace(to, p.first);\n }\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\n }\n }\n void AddEdge(int x, int y) {\n graph[x].push_back(y);\n graph[y].push_back(x);\n }\n virtual void Build() {\n BuildSubTreeSize();\n BuildPath();\n }\n inline size_t size() { return (Centroids.size()); }\n inline pair<int, int> Information(int idx) {\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\n }\n inline Centroid &operator[](int k) { return (Centroids[k]); }\n inline int LCA(int a, int b) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n return (Centroids[TreeIdxA][TreeDepthA]);\n }\n inline virtual void query(int a, int b,\n const function<void(int, int, int)> &f) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n f(TreeIdxA, 0, TreeDepthA + 1);\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n f(TreeIdxB, 0, TreeDepthB + 1);\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\n }\n CentroidPathDecomposition(int SZ) {\n graph.resize(SZ);\n SubTreeSize.assign(SZ, -1);\n NextPath.resize(SZ);\n TreeIndex.resize(SZ);\n TreeDepth.resize(SZ);\n }\n};\nOrderedMultiSet<int> tree(5000000);\nOrderedMultiSet<int>::Node *nodes[100000];\nint N, Q, X[100000];\nvector<int> g[100000];\nint parent[100000];\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\n parent[idx] = par;\n tree.insert_key(par_set, X[idx]);\n nodes[idx] = par_set;\n for (auto &to : g[idx])\n if (to != par)\n dfs(to, idx, par_set);\n}\nint main() {\n scanf(\"%d %d\", &N, &Q);\n CentroidPathDecomposition gg(N);\n vector<int> vs;\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", &X[i]);\n vs.emplace_back(X[i]);\n }\n sort(begin(vs), end(vs));\n vs.erase(unique(begin(vs), end(vs)), end(vs));\n for (int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n gg.AddEdge(x, y);\n }\n dfs(0, -1, tree.makeset());\n gg.Build();\n for (int i = 0; i < Q; i++) {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n --x, --y;\n int lca = gg.LCA(x, y);\n int ng = -1, ok = (int)vs.size() - 1;\n auto sum = [&](int v) {\n int ret = 0;\n ret += tree.upper_bound(nodes[x], vs[v]);\n ret += tree.upper_bound(nodes[y], vs[v]);\n ret -= tree.upper_bound(nodes[lca], vs[v]);\n if (lca)\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\n return ret;\n };\n while (ok - ng > 1) {\n int mid = (ok + ng) >> 1;\n if (sum(mid) >= z)\n ok = mid;\n else\n ng = mid;\n }\n printf(\"%d\\n\", vs[ok]);\n }\n}","accuracy":1,"time_ms":850,"memory_kb":133116,"score_of_the_acc":-1.2636,"final_rank":11},{"submission_id":"aoj_2270_8113360","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class Key> struct RandomizedBinarySearchTree {\n inline int xor128() {\n static int x = 123456789;\n static int y = 362436069;\n static int z = 521288629;\n static int w = 88675123;\n int t;\n t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n }\n struct Node {\n Node *l, *r;\n int cnt;\n Key key;\n Node() {}\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\n };\n vector<Node> pool;\n int ptr;\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\n virtual Node *clone(Node *t) { return t; }\n inline int count(const Node *t) { return t ? t->cnt : 0; }\n inline Node *update(Node *t) {\n t->cnt = count(t->l) + count(t->r) + 1;\n return t;\n }\n Node *propagete(Node *t) { return update(clone(t)); }\n Node *merge(Node *l, Node *r) {\n if (!l || !r)\n return l ? l : r;\n if (xor128() % (l->cnt + r->cnt) > l->cnt) {\n l = propagete(l);\n l->r = merge(l->r, r);\n return update(l);\n } else {\n r = propagete(r);\n r->l = merge(l, r->l);\n return update(r);\n }\n }\n pair<Node *, Node *> split(Node *t, int k) {\n if (!t)\n return {t, t};\n t = propagete(t);\n if (k <= count(t->l)) {\n auto s = split(t->l, k);\n t->l = s.second;\n return {s.first, update(t)};\n } else {\n auto s = split(t->r, k - count(t->l) - 1);\n t->r = s.first;\n return {update(t), s.second};\n }\n }\n Node *build(int l, int r, const vector<Key> &v) {\n if (l + 1 >= r)\n return alloc(v[l]);\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\n }\n Node *build(const vector<Key> &v) {\n ptr = 0;\n return build(0, (int)v.size(), v);\n }\n void dump(Node *r, typename vector<Key>::iterator &it) {\n if (!r)\n return;\n r = propagete(r);\n dump(r->l, it);\n *it = r->key;\n dump(r->r, ++it);\n }\n vector<Key> dump(Node *r) {\n vector<Key> v((size_t)count(r));\n auto it = begin(v);\n dump(r, it);\n return v;\n }\n string to_string(Node *r) {\n auto s = dump(r);\n string ret;\n for (int i = 0; i < s.size(); i++)\n ret += \", \";\n return (ret);\n }\n void insert(Node *&t, int k, const Key &v) {\n auto x = split(t, k);\n t = merge(merge(x.first, alloc(v)), x.second);\n }\n void erase(Node *&t, int k) {\n auto x = split(t, k);\n t = merge(x.first, split(x.second, 1).second);\n }\n int size(Node *t) { return count(t); }\n bool empty(Node *t) { return !t; }\n Node *makeset() { return (nullptr); }\n};\ntemplate <class Key>\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\n using RBST = RandomizedBinarySearchTree<Key>;\n using Node = typename RBST::Node;\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\n};\ntemplate <class T>\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\n using RBST = PresidentRandomizedBinarySearchTree<T>;\n using Node = typename RBST::Node;\n OrderedMultiSet(int sz) : RBST(sz) {}\n T kth_element(Node *t, int k) {\n if (k < RBST::count(t->l))\n return kth_element(t->l, k);\n if (k == RBST::count(t->l))\n return t->key;\n return kth_element(t->r, k - RBST::count(t->l) - 1);\n }\n virtual void insert_key(Node *&t, const T &x) {\n RBST::insert(t, lower_bound(t, x), x);\n }\n void erase_key(Node *&t, const T &x) {\n if (!count(t, x))\n return;\n RBST::erase(t, lower_bound(t, x));\n }\n int count(Node *t, const T &x) {\n return upper_bound(t, x) - lower_bound(t, x);\n }\n int lower_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x <= t->key)\n return lower_bound(t->l, x);\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n int upper_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x < t->key)\n return upper_bound(t->l, x);\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n};\nstruct CentroidPathDecomposition {\n struct Centroid {\n int ParIndex, ParDepth, Deep;\n vector<int> node;\n Centroid(int idx, int dep, int deep)\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\n inline size_t size() { return (node.size()); }\n inline int &operator[](int k) { return (node[k]); }\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\n };\n vector<vector<int>> graph;\n vector<int> SubTreeSize, NextPath;\n vector<int> TreeIndex, TreeDepth;\n vector<Centroid> Centroids;\n void BuildSubTreeSize() {\n stack<pair<int, int>> s;\n s.emplace(0, -1);\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n if (~SubTreeSize[p.first]) {\n NextPath[p.first] = -1;\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n SubTreeSize[p.first] += SubTreeSize[to];\n if (NextPath[p.first] == -1 ||\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\n NextPath[p.first] = to;\n }\n }\n } else {\n s.push(p);\n SubTreeSize[p.first] = 1;\n for (auto &to : graph[p.first]) {\n if (p.second != to)\n s.emplace(to, p.first);\n }\n }\n }\n }\n void BuildPath() {\n stack<pair<int, int>> s;\n Centroids.emplace_back(-1, -1, 0);\n s.emplace(0, -1);\n TreeIndex[0] = 0;\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n if (to == NextPath[p.first]) {\n TreeIndex[to] = TreeIndex[p.first];\n } else {\n TreeIndex[to] = (int)Centroids.size();\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\n Centroids[TreeIndex[p.first]].Deep + 1);\n }\n s.emplace(to, p.first);\n }\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\n }\n }\n void AddEdge(int x, int y) {\n graph[x].push_back(y);\n graph[y].push_back(x);\n }\n virtual void Build() {\n BuildSubTreeSize();\n BuildPath();\n }\n inline size_t size() { return (Centroids.size()); }\n inline pair<int, int> Information(int idx) {\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\n }\n inline Centroid &operator[](int k) { return (Centroids[k]); }\n inline int LCA(int a, int b) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n return (Centroids[TreeIdxA][TreeDepthA]);\n }\n inline virtual void query(int a, int b,\n const function<void(int, int, int)> &f) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n f(TreeIdxA, 0, TreeDepthA + 1);\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n f(TreeIdxB, 0, TreeDepthB + 1);\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\n }\n CentroidPathDecomposition(int SZ) {\n graph.resize(SZ);\n SubTreeSize.assign(SZ, -1);\n NextPath.resize(SZ);\n TreeIndex.resize(SZ);\n TreeDepth.resize(SZ);\n }\n};\nOrderedMultiSet<int> tree(5000000);\nOrderedMultiSet<int>::Node *nodes[100000];\nint N, Q, X[100000];\nvector<int> g[100000];\nint parent[100000];\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\n parent[idx] = par;\n tree.insert_key(par_set, X[idx]);\n nodes[idx] = par_set;\n for (auto &to : g[idx])\n if (to != par)\n dfs(to, idx, par_set);\n}\nint main() {\n scanf(\"%d %d\", &N, &Q);\n CentroidPathDecomposition gg(N);\n vector<int> vs;\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", &X[i]);\n vs.emplace_back(X[i]);\n }\n sort(begin(vs), end(vs));\n vs.erase(unique(begin(vs), end(vs)), end(vs));\n for (int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n gg.AddEdge(x, y);\n }\n dfs(0, -1, tree.makeset());\n gg.Build();\n for (int i = 0; i < Q; i++) {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n --x, --y;\n int lca = gg.LCA(x, y);\n int ng = -1, ok = (int)vs.size() - 1;\n auto sum = [&](int v) {\n int ret = 0;\n ret += tree.upper_bound(nodes[x], vs[v]);\n ret += tree.upper_bound(nodes[y], vs[v]);\n ret -= tree.upper_bound(nodes[lca], vs[v]);\n if (lca)\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\n return ret;\n };\n while (ok - ng > 1) {\n int mid = (ok + ng) >> 1;\n if (sum(mid) >= z)\n ok = mid;\n else\n ng = mid;\n }\n printf(\"%d\\n\", vs[ok]);\n }\n}","accuracy":1,"time_ms":1080,"memory_kb":135224,"score_of_the_acc":-1.3614,"final_rank":17},{"submission_id":"aoj_2270_8113359","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class Key> struct RandomizedBinarySearchTree {\n inline int xor128() {\n static int x = 123456789;\n static int y = 362436069;\n static int z = 521288629;\n static int w = 88675123;\n int t;\n t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n }\n struct Node {\n Node *l, *r;\n int cnt;\n Key key;\n Node() {}\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\n };\n vector<Node> pool;\n int ptr;\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\n virtual Node *clone(Node *t) { return t; }\n inline int count(const Node *t) { return t ? t->cnt : 0; }\n inline Node *update(Node *t) {\n t->cnt = count(t->l) + count(t->r) + 1;\n return t;\n }\n Node *propagete(Node *t) { return update(clone(t)); }\n Node *merge(Node *l, Node *r) {\n if (!l || !r)\n return l ? l : r;\n if (xor128() % (r->cnt + l->cnt) < r->cnt) {\n l = propagete(l);\n l->r = merge(l->r, r);\n return update(l);\n } else {\n r = propagete(r);\n r->l = merge(l, r->l);\n return update(r);\n }\n }\n pair<Node *, Node *> split(Node *t, int k) {\n if (!t)\n return {t, t};\n t = propagete(t);\n if (k <= count(t->l)) {\n auto s = split(t->l, k);\n t->l = s.second;\n return {s.first, update(t)};\n } else {\n auto s = split(t->r, k - count(t->l) - 1);\n t->r = s.first;\n return {update(t), s.second};\n }\n }\n Node *build(int l, int r, const vector<Key> &v) {\n if (l + 1 >= r)\n return alloc(v[l]);\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\n }\n Node *build(const vector<Key> &v) {\n ptr = 0;\n return build(0, (int)v.size(), v);\n }\n void dump(Node *r, typename vector<Key>::iterator &it) {\n if (!r)\n return;\n r = propagete(r);\n dump(r->l, it);\n *it = r->key;\n dump(r->r, ++it);\n }\n vector<Key> dump(Node *r) {\n vector<Key> v((size_t)count(r));\n auto it = begin(v);\n dump(r, it);\n return v;\n }\n string to_string(Node *r) {\n auto s = dump(r);\n string ret;\n for (int i = 0; i < s.size(); i++)\n ret += \", \";\n return (ret);\n }\n void insert(Node *&t, int k, const Key &v) {\n auto x = split(t, k);\n t = merge(merge(x.first, alloc(v)), x.second);\n }\n void erase(Node *&t, int k) {\n auto x = split(t, k);\n t = merge(x.first, split(x.second, 1).second);\n }\n int size(Node *t) { return count(t); }\n bool empty(Node *t) { return !t; }\n Node *makeset() { return (nullptr); }\n};\ntemplate <class Key>\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\n using RBST = RandomizedBinarySearchTree<Key>;\n using Node = typename RBST::Node;\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\n};\ntemplate <class T>\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\n using RBST = PresidentRandomizedBinarySearchTree<T>;\n using Node = typename RBST::Node;\n OrderedMultiSet(int sz) : RBST(sz) {}\n T kth_element(Node *t, int k) {\n if (k < RBST::count(t->l))\n return kth_element(t->l, k);\n if (k == RBST::count(t->l))\n return t->key;\n return kth_element(t->r, k - RBST::count(t->l) - 1);\n }\n virtual void insert_key(Node *&t, const T &x) {\n RBST::insert(t, lower_bound(t, x), x);\n }\n void erase_key(Node *&t, const T &x) {\n if (!count(t, x))\n return;\n RBST::erase(t, lower_bound(t, x));\n }\n int count(Node *t, const T &x) {\n return upper_bound(t, x) - lower_bound(t, x);\n }\n int lower_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x <= t->key)\n return lower_bound(t->l, x);\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n int upper_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x < t->key)\n return upper_bound(t->l, x);\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n};\nstruct CentroidPathDecomposition {\n struct Centroid {\n int ParIndex, ParDepth, Deep;\n vector<int> node;\n Centroid(int idx, int dep, int deep)\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\n inline size_t size() { return (node.size()); }\n inline int &operator[](int k) { return (node[k]); }\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\n };\n vector<vector<int>> graph;\n vector<int> SubTreeSize, NextPath;\n vector<int> TreeIndex, TreeDepth;\n vector<Centroid> Centroids;\n void BuildSubTreeSize() {\n stack<pair<int, int>> s;\n s.emplace(0, -1);\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n if (~SubTreeSize[p.first]) {\n NextPath[p.first] = -1;\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n SubTreeSize[p.first] += SubTreeSize[to];\n if (NextPath[p.first] == -1 ||\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\n NextPath[p.first] = to;\n }\n }\n } else {\n s.push(p);\n SubTreeSize[p.first] = 1;\n for (auto &to : graph[p.first]) {\n if (p.second != to)\n s.emplace(to, p.first);\n }\n }\n }\n }\n void BuildPath() {\n stack<pair<int, int>> s;\n Centroids.emplace_back(-1, -1, 0);\n s.emplace(0, -1);\n TreeIndex[0] = 0;\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n if (to == NextPath[p.first]) {\n TreeIndex[to] = TreeIndex[p.first];\n } else {\n TreeIndex[to] = (int)Centroids.size();\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\n Centroids[TreeIndex[p.first]].Deep + 1);\n }\n s.emplace(to, p.first);\n }\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\n }\n }\n void AddEdge(int x, int y) {\n graph[x].push_back(y);\n graph[y].push_back(x);\n }\n virtual void Build() {\n BuildSubTreeSize();\n BuildPath();\n }\n inline size_t size() { return (Centroids.size()); }\n inline pair<int, int> Information(int idx) {\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\n }\n inline Centroid &operator[](int k) { return (Centroids[k]); }\n inline int LCA(int a, int b) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n return (Centroids[TreeIdxA][TreeDepthA]);\n }\n inline virtual void query(int a, int b,\n const function<void(int, int, int)> &f) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n f(TreeIdxA, 0, TreeDepthA + 1);\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n f(TreeIdxB, 0, TreeDepthB + 1);\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\n }\n CentroidPathDecomposition(int SZ) {\n graph.resize(SZ);\n SubTreeSize.assign(SZ, -1);\n NextPath.resize(SZ);\n TreeIndex.resize(SZ);\n TreeDepth.resize(SZ);\n }\n};\nOrderedMultiSet<int> tree(5000000);\nOrderedMultiSet<int>::Node *nodes[100000];\nint N, Q, X[100000];\nvector<int> g[100000];\nint parent[100000];\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\n parent[idx] = par;\n tree.insert_key(par_set, X[idx]);\n nodes[idx] = par_set;\n for (auto &to : g[idx])\n if (to != par)\n dfs(to, idx, par_set);\n}\nint main() {\n scanf(\"%d %d\", &N, &Q);\n CentroidPathDecomposition gg(N);\n vector<int> vs;\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", &X[i]);\n vs.emplace_back(X[i]);\n }\n sort(begin(vs), end(vs));\n vs.erase(unique(begin(vs), end(vs)), end(vs));\n for (int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n gg.AddEdge(x, y);\n }\n dfs(0, -1, tree.makeset());\n gg.Build();\n for (int i = 0; i < Q; i++) {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n --x, --y;\n int lca = gg.LCA(x, y);\n int ng = -1, ok = (int)vs.size() - 1;\n auto sum = [&](int v) {\n int ret = 0;\n ret += tree.upper_bound(nodes[x], vs[v]);\n ret += tree.upper_bound(nodes[y], vs[v]);\n ret -= tree.upper_bound(nodes[lca], vs[v]);\n if (lca)\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\n return ret;\n };\n while (ok - ng > 1) {\n int mid = (ok + ng) >> 1;\n if (sum(mid) >= z)\n ok = mid;\n else\n ng = mid;\n }\n printf(\"%d\\n\", vs[ok]);\n }\n}","accuracy":1,"time_ms":1040,"memory_kb":135488,"score_of_the_acc":-1.3491,"final_rank":15},{"submission_id":"aoj_2270_8113357","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class Key> struct RandomizedBinarySearchTree {\n inline int xor128() {\n static int x = 123456789;\n static int y = 362436069;\n static int z = 521288629;\n static int w = 88675123;\n int t;\n t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n }\n struct Node {\n Node *l, *r;\n int cnt;\n Key key;\n Node() {}\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\n };\n vector<Node> pool;\n int ptr;\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\n virtual Node *clone(Node *t) { return t; }\n inline int count(const Node *t) { return t ? t->cnt : 0; }\n inline Node *update(Node *t) {\n t->cnt = count(t->l) + count(t->r) + 1;\n return t;\n }\n Node *propagete(Node *t) { return update(clone(t)); }\n Node *merge(Node *l, Node *r) {\n if (!l || !r)\n return l ? l : r;\n if (xor128() % (l->cnt + r->cnt) < r->cnt) {\n l = propagete(l);\n l->r = merge(l->r, r);\n return update(l);\n } else {\n r = propagete(r);\n r->l = merge(l, r->l);\n return update(r);\n }\n }\n pair<Node *, Node *> split(Node *t, int k) {\n if (!t)\n return {t, t};\n t = propagete(t);\n if (k <= count(t->l)) {\n auto s = split(t->l, k);\n t->l = s.second;\n return {s.first, update(t)};\n } else {\n auto s = split(t->r, k - count(t->l) - 1);\n t->r = s.first;\n return {update(t), s.second};\n }\n }\n Node *build(int l, int r, const vector<Key> &v) {\n if (l + 1 >= r)\n return alloc(v[l]);\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\n }\n Node *build(const vector<Key> &v) {\n ptr = 0;\n return build(0, (int)v.size(), v);\n }\n void dump(Node *r, typename vector<Key>::iterator &it) {\n if (!r)\n return;\n r = propagete(r);\n dump(r->l, it);\n *it = r->key;\n dump(r->r, ++it);\n }\n vector<Key> dump(Node *r) {\n vector<Key> v((size_t)count(r));\n auto it = begin(v);\n dump(r, it);\n return v;\n }\n string to_string(Node *r) {\n auto s = dump(r);\n string ret;\n for (int i = 0; i < s.size(); i++)\n ret += \", \";\n return (ret);\n }\n void insert(Node *&t, int k, const Key &v) {\n auto x = split(t, k);\n t = merge(merge(x.first, alloc(v)), x.second);\n }\n void erase(Node *&t, int k) {\n auto x = split(t, k);\n t = merge(x.first, split(x.second, 1).second);\n }\n int size(Node *t) { return count(t); }\n bool empty(Node *t) { return !t; }\n Node *makeset() { return (nullptr); }\n};\ntemplate <class Key>\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\n using RBST = RandomizedBinarySearchTree<Key>;\n using Node = typename RBST::Node;\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\n};\ntemplate <class T>\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\n using RBST = PresidentRandomizedBinarySearchTree<T>;\n using Node = typename RBST::Node;\n OrderedMultiSet(int sz) : RBST(sz) {}\n T kth_element(Node *t, int k) {\n if (k < RBST::count(t->l))\n return kth_element(t->l, k);\n if (k == RBST::count(t->l))\n return t->key;\n return kth_element(t->r, k - RBST::count(t->l) - 1);\n }\n virtual void insert_key(Node *&t, const T &x) {\n RBST::insert(t, lower_bound(t, x), x);\n }\n void erase_key(Node *&t, const T &x) {\n if (!count(t, x))\n return;\n RBST::erase(t, lower_bound(t, x));\n }\n int count(Node *t, const T &x) {\n return upper_bound(t, x) - lower_bound(t, x);\n }\n int lower_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x <= t->key)\n return lower_bound(t->l, x);\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n int upper_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x < t->key)\n return upper_bound(t->l, x);\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n};\nstruct CentroidPathDecomposition {\n struct Centroid {\n int ParIndex, ParDepth, Deep;\n vector<int> node;\n Centroid(int idx, int dep, int deep)\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\n inline size_t size() { return (node.size()); }\n inline int &operator[](int k) { return (node[k]); }\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\n };\n vector<vector<int>> graph;\n vector<int> SubTreeSize, NextPath;\n vector<int> TreeIndex, TreeDepth;\n vector<Centroid> Centroids;\n void BuildSubTreeSize() {\n stack<pair<int, int>> s;\n s.emplace(0, -1);\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n if (~SubTreeSize[p.first]) {\n NextPath[p.first] = -1;\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n SubTreeSize[p.first] += SubTreeSize[to];\n if (NextPath[p.first] == -1 ||\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\n NextPath[p.first] = to;\n }\n }\n } else {\n s.push(p);\n SubTreeSize[p.first] = 1;\n for (auto &to : graph[p.first]) {\n if (p.second != to)\n s.emplace(to, p.first);\n }\n }\n }\n }\n void BuildPath() {\n stack<pair<int, int>> s;\n Centroids.emplace_back(-1, -1, 0);\n s.emplace(0, -1);\n TreeIndex[0] = 0;\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n if (to == NextPath[p.first]) {\n TreeIndex[to] = TreeIndex[p.first];\n } else {\n TreeIndex[to] = (int)Centroids.size();\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\n Centroids[TreeIndex[p.first]].Deep + 1);\n }\n s.emplace(to, p.first);\n }\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\n }\n }\n void AddEdge(int x, int y) {\n graph[x].push_back(y);\n graph[y].push_back(x);\n }\n virtual void Build() {\n BuildSubTreeSize();\n BuildPath();\n }\n inline size_t size() { return (Centroids.size()); }\n inline pair<int, int> Information(int idx) {\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\n }\n inline Centroid &operator[](int k) { return (Centroids[k]); }\n inline int LCA(int a, int b) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n return (Centroids[TreeIdxA][TreeDepthA]);\n }\n inline virtual void query(int a, int b,\n const function<void(int, int, int)> &f) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n f(TreeIdxA, 0, TreeDepthA + 1);\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n f(TreeIdxB, 0, TreeDepthB + 1);\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\n }\n CentroidPathDecomposition(int SZ) {\n graph.resize(SZ);\n SubTreeSize.assign(SZ, -1);\n NextPath.resize(SZ);\n TreeIndex.resize(SZ);\n TreeDepth.resize(SZ);\n }\n};\nOrderedMultiSet<int> tree(5000000);\nOrderedMultiSet<int>::Node *nodes[100000];\nint N, Q, X[100000];\nvector<int> g[100000];\nint parent[100000];\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\n parent[idx] = par;\n tree.insert_key(par_set, X[idx]);\n nodes[idx] = par_set;\n for (auto &to : g[idx])\n if (to != par)\n dfs(to, idx, par_set);\n}\nint main() {\n scanf(\"%d %d\", &N, &Q);\n CentroidPathDecomposition gg(N);\n vector<int> vs;\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", &X[i]);\n vs.emplace_back(X[i]);\n }\n sort(begin(vs), end(vs));\n vs.erase(unique(begin(vs), end(vs)), end(vs));\n for (int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n gg.AddEdge(x, y);\n }\n dfs(0, -1, tree.makeset());\n gg.Build();\n for (int i = 0; i < Q; i++) {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n --x, --y;\n int lca = gg.LCA(x, y);\n int ng = -1, ok = (int)vs.size() - 1;\n auto sum = [&](int v) {\n int ret = 0;\n ret += tree.upper_bound(nodes[x], vs[v]);\n ret += tree.upper_bound(nodes[y], vs[v]);\n ret -= tree.upper_bound(nodes[lca], vs[v]);\n if (lca)\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\n return ret;\n };\n while (ok - ng > 1) {\n int mid = (ok + ng) >> 1;\n if (sum(mid) >= z)\n ok = mid;\n else\n ng = mid;\n }\n printf(\"%d\\n\", vs[ok]);\n }\n}","accuracy":1,"time_ms":1050,"memory_kb":136032,"score_of_the_acc":-1.3567,"final_rank":16},{"submission_id":"aoj_2270_8113355","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class Key> struct RandomizedBinarySearchTree {\n inline int xor128() {\n static int x = 123456789;\n static int y = 362436069;\n static int z = 521288629;\n static int w = 88675123;\n int t;\n t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n }\n struct Node {\n Node *l, *r;\n int cnt;\n Key key;\n Node() {}\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\n };\n vector<Node> pool;\n int ptr;\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\n virtual Node *clone(Node *t) { return t; }\n inline int count(const Node *t) { return t ? t->cnt : 0; }\n inline Node *update(Node *t) {\n t->cnt = count(t->l) + count(t->r) + 1;\n return t;\n }\n Node *propagete(Node *t) { return update(clone(t)); }\n Node *merge(Node *l, Node *r) {\n if (!l || !r)\n return l ? l : r;\n if (xor128() % (l->cnt + r->cnt) != l->cnt) {\n l = propagete(l);\n l->r = merge(l->r, r);\n return update(l);\n } else {\n r = propagete(r);\n r->l = merge(l, r->l);\n return update(r);\n }\n }\n pair<Node *, Node *> split(Node *t, int k) {\n if (!t)\n return {t, t};\n t = propagete(t);\n if (k <= count(t->l)) {\n auto s = split(t->l, k);\n t->l = s.second;\n return {s.first, update(t)};\n } else {\n auto s = split(t->r, k - count(t->l) - 1);\n t->r = s.first;\n return {update(t), s.second};\n }\n }\n Node *build(int l, int r, const vector<Key> &v) {\n if (l + 1 >= r)\n return alloc(v[l]);\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\n }\n Node *build(const vector<Key> &v) {\n ptr = 0;\n return build(0, (int)v.size(), v);\n }\n void dump(Node *r, typename vector<Key>::iterator &it) {\n if (!r)\n return;\n r = propagete(r);\n dump(r->l, it);\n *it = r->key;\n dump(r->r, ++it);\n }\n vector<Key> dump(Node *r) {\n vector<Key> v((size_t)count(r));\n auto it = begin(v);\n dump(r, it);\n return v;\n }\n string to_string(Node *r) {\n auto s = dump(r);\n string ret;\n for (int i = 0; i < s.size(); i++)\n ret += \", \";\n return (ret);\n }\n void insert(Node *&t, int k, const Key &v) {\n auto x = split(t, k);\n t = merge(merge(x.first, alloc(v)), x.second);\n }\n void erase(Node *&t, int k) {\n auto x = split(t, k);\n t = merge(x.first, split(x.second, 1).second);\n }\n int size(Node *t) { return count(t); }\n bool empty(Node *t) { return !t; }\n Node *makeset() { return (nullptr); }\n};\ntemplate <class Key>\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\n using RBST = RandomizedBinarySearchTree<Key>;\n using Node = typename RBST::Node;\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\n};\ntemplate <class T>\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\n using RBST = PresidentRandomizedBinarySearchTree<T>;\n using Node = typename RBST::Node;\n OrderedMultiSet(int sz) : RBST(sz) {}\n T kth_element(Node *t, int k) {\n if (k < RBST::count(t->l))\n return kth_element(t->l, k);\n if (k == RBST::count(t->l))\n return t->key;\n return kth_element(t->r, k - RBST::count(t->l) - 1);\n }\n virtual void insert_key(Node *&t, const T &x) {\n RBST::insert(t, lower_bound(t, x), x);\n }\n void erase_key(Node *&t, const T &x) {\n if (!count(t, x))\n return;\n RBST::erase(t, lower_bound(t, x));\n }\n int count(Node *t, const T &x) {\n return upper_bound(t, x) - lower_bound(t, x);\n }\n int lower_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x <= t->key)\n return lower_bound(t->l, x);\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n int upper_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x < t->key)\n return upper_bound(t->l, x);\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n};\nstruct CentroidPathDecomposition {\n struct Centroid {\n int ParIndex, ParDepth, Deep;\n vector<int> node;\n Centroid(int idx, int dep, int deep)\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\n inline size_t size() { return (node.size()); }\n inline int &operator[](int k) { return (node[k]); }\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\n };\n vector<vector<int>> graph;\n vector<int> SubTreeSize, NextPath;\n vector<int> TreeIndex, TreeDepth;\n vector<Centroid> Centroids;\n void BuildSubTreeSize() {\n stack<pair<int, int>> s;\n s.emplace(0, -1);\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n if (~SubTreeSize[p.first]) {\n NextPath[p.first] = -1;\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n SubTreeSize[p.first] += SubTreeSize[to];\n if (NextPath[p.first] == -1 ||\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\n NextPath[p.first] = to;\n }\n }\n } else {\n s.push(p);\n SubTreeSize[p.first] = 1;\n for (auto &to : graph[p.first]) {\n if (p.second != to)\n s.emplace(to, p.first);\n }\n }\n }\n }\n void BuildPath() {\n stack<pair<int, int>> s;\n Centroids.emplace_back(-1, -1, 0);\n s.emplace(0, -1);\n TreeIndex[0] = 0;\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n if (to == NextPath[p.first]) {\n TreeIndex[to] = TreeIndex[p.first];\n } else {\n TreeIndex[to] = (int)Centroids.size();\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\n Centroids[TreeIndex[p.first]].Deep + 1);\n }\n s.emplace(to, p.first);\n }\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\n }\n }\n void AddEdge(int x, int y) {\n graph[x].push_back(y);\n graph[y].push_back(x);\n }\n virtual void Build() {\n BuildSubTreeSize();\n BuildPath();\n }\n inline size_t size() { return (Centroids.size()); }\n inline pair<int, int> Information(int idx) {\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\n }\n inline Centroid &operator[](int k) { return (Centroids[k]); }\n inline int LCA(int a, int b) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n return (Centroids[TreeIdxA][TreeDepthA]);\n }\n inline virtual void query(int a, int b,\n const function<void(int, int, int)> &f) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n f(TreeIdxA, 0, TreeDepthA + 1);\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n f(TreeIdxB, 0, TreeDepthB + 1);\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\n }\n CentroidPathDecomposition(int SZ) {\n graph.resize(SZ);\n SubTreeSize.assign(SZ, -1);\n NextPath.resize(SZ);\n TreeIndex.resize(SZ);\n TreeDepth.resize(SZ);\n }\n};\nOrderedMultiSet<int> tree(5000000);\nOrderedMultiSet<int>::Node *nodes[100000];\nint N, Q, X[100000];\nvector<int> g[100000];\nint parent[100000];\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\n parent[idx] = par;\n tree.insert_key(par_set, X[idx]);\n nodes[idx] = par_set;\n for (auto &to : g[idx])\n if (to != par)\n dfs(to, idx, par_set);\n}\nint main() {\n scanf(\"%d %d\", &N, &Q);\n CentroidPathDecomposition gg(N);\n vector<int> vs;\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", &X[i]);\n vs.emplace_back(X[i]);\n }\n sort(begin(vs), end(vs));\n vs.erase(unique(begin(vs), end(vs)), end(vs));\n for (int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n gg.AddEdge(x, y);\n }\n dfs(0, -1, tree.makeset());\n gg.Build();\n for (int i = 0; i < Q; i++) {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n --x, --y;\n int lca = gg.LCA(x, y);\n int ng = -1, ok = (int)vs.size() - 1;\n auto sum = [&](int v) {\n int ret = 0;\n ret += tree.upper_bound(nodes[x], vs[v]);\n ret += tree.upper_bound(nodes[y], vs[v]);\n ret -= tree.upper_bound(nodes[lca], vs[v]);\n if (lca)\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\n return ret;\n };\n while (ok - ng > 1) {\n int mid = (ok + ng) >> 1;\n if (sum(mid) >= z)\n ok = mid;\n else\n ng = mid;\n }\n printf(\"%d\\n\", vs[ok]);\n }\n}","accuracy":0.7096774193548387,"time_ms":380,"memory_kb":107812,"score_of_the_acc":-0.9077,"final_rank":18},{"submission_id":"aoj_2270_8113353","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class Key> struct RandomizedBinarySearchTree {\n inline int xor128() {\n static int x = 123456789;\n static int y = 362436069;\n static int z = 521288629;\n static int w = 88675123;\n int t;\n t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n }\n struct Node {\n Node *l, *r;\n int cnt;\n Key key;\n Node() {}\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\n };\n vector<Node> pool;\n int ptr;\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\n virtual Node *clone(Node *t) { return t; }\n inline int count(const Node *t) { return t ? t->cnt : 0; }\n inline Node *update(Node *t) {\n t->cnt = count(t->l) + count(t->r) + 1;\n return t;\n }\n Node *propagete(Node *t) { return update(clone(t)); }\n Node *merge(Node *l, Node *r) {\n if (!l || !r)\n return l ? l : r;\n if ((xor128() % (l->cnt + r->cnt)) < l->cnt) {\n l = propagete(l);\n l->r = merge(l->r, r);\n return update(l);\n } else {\n r = propagete(r);\n r->l = merge(l, r->l);\n return update(r);\n }\n }\n pair<Node *, Node *> split(Node *t, int k) {\n if (!t)\n return {t, t};\n t = propagete(t);\n if (k <= count(t->l)) {\n auto s = split(t->l, k);\n t->l = s.second;\n return {s.first, update(t)};\n } else {\n auto s = split(t->r, k - count(t->l) - 1);\n t->r = s.first;\n return {update(t), s.second};\n }\n }\n Node *build(int l, int r, const vector<Key> &v) {\n if (l + 1 >= r)\n return alloc(v[l]);\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\n }\n Node *build(const vector<Key> &v) {\n ptr = 0;\n return build(0, (int)v.size(), v);\n }\n void dump(Node *r, typename vector<Key>::iterator &it) {\n if (!r)\n return;\n r = propagete(r);\n dump(r->l, it);\n *it = r->key;\n dump(r->r, ++it);\n }\n vector<Key> dump(Node *r) {\n vector<Key> v((size_t)count(r));\n auto it = begin(v);\n dump(r, it);\n return v;\n }\n string to_string(Node *r) {\n auto s = dump(r);\n string ret;\n for (int i = 0; i < s.size(); i++)\n ret += \", \";\n return (ret);\n }\n void insert(Node *&t, int k, const Key &v) {\n auto x = split(t, k);\n t = merge(merge(x.first, alloc(v)), x.second);\n }\n void erase(Node *&t, int k) {\n auto x = split(t, k);\n t = merge(x.first, split(x.second, 1).second);\n }\n int size(Node *t) { return count(t); }\n bool empty(Node *t) { return !t; }\n Node *makeset() { return (nullptr); }\n};\ntemplate <class Key>\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\n using RBST = RandomizedBinarySearchTree<Key>;\n using Node = typename RBST::Node;\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\n};\ntemplate <class T>\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\n using RBST = PresidentRandomizedBinarySearchTree<T>;\n using Node = typename RBST::Node;\n OrderedMultiSet(int sz) : RBST(sz) {}\n T kth_element(Node *t, int k) {\n if (k < RBST::count(t->l))\n return kth_element(t->l, k);\n if (k == RBST::count(t->l))\n return t->key;\n return kth_element(t->r, k - RBST::count(t->l) - 1);\n }\n virtual void insert_key(Node *&t, const T &x) {\n RBST::insert(t, lower_bound(t, x), x);\n }\n void erase_key(Node *&t, const T &x) {\n if (!count(t, x))\n return;\n RBST::erase(t, lower_bound(t, x));\n }\n int count(Node *t, const T &x) {\n return upper_bound(t, x) - lower_bound(t, x);\n }\n int lower_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x <= t->key)\n return lower_bound(t->l, x);\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n int upper_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x < t->key)\n return upper_bound(t->l, x);\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n};\nstruct CentroidPathDecomposition {\n struct Centroid {\n int ParIndex, ParDepth, Deep;\n vector<int> node;\n Centroid(int idx, int dep, int deep)\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\n inline size_t size() { return (node.size()); }\n inline int &operator[](int k) { return (node[k]); }\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\n };\n vector<vector<int>> graph;\n vector<int> SubTreeSize, NextPath;\n vector<int> TreeIndex, TreeDepth;\n vector<Centroid> Centroids;\n void BuildSubTreeSize() {\n stack<pair<int, int>> s;\n s.emplace(0, -1);\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n if (~SubTreeSize[p.first]) {\n NextPath[p.first] = -1;\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n SubTreeSize[p.first] += SubTreeSize[to];\n if (NextPath[p.first] == -1 ||\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\n NextPath[p.first] = to;\n }\n }\n } else {\n s.push(p);\n SubTreeSize[p.first] = 1;\n for (auto &to : graph[p.first]) {\n if (p.second != to)\n s.emplace(to, p.first);\n }\n }\n }\n }\n void BuildPath() {\n stack<pair<int, int>> s;\n Centroids.emplace_back(-1, -1, 0);\n s.emplace(0, -1);\n TreeIndex[0] = 0;\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n if (to == NextPath[p.first]) {\n TreeIndex[to] = TreeIndex[p.first];\n } else {\n TreeIndex[to] = (int)Centroids.size();\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\n Centroids[TreeIndex[p.first]].Deep + 1);\n }\n s.emplace(to, p.first);\n }\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\n }\n }\n void AddEdge(int x, int y) {\n graph[x].push_back(y);\n graph[y].push_back(x);\n }\n virtual void Build() {\n BuildSubTreeSize();\n BuildPath();\n }\n inline size_t size() { return (Centroids.size()); }\n inline pair<int, int> Information(int idx) {\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\n }\n inline Centroid &operator[](int k) { return (Centroids[k]); }\n inline int LCA(int a, int b) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n return (Centroids[TreeIdxA][TreeDepthA]);\n }\n inline virtual void query(int a, int b,\n const function<void(int, int, int)> &f) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n f(TreeIdxA, 0, TreeDepthA + 1);\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n f(TreeIdxB, 0, TreeDepthB + 1);\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\n }\n CentroidPathDecomposition(int SZ) {\n graph.resize(SZ);\n SubTreeSize.assign(SZ, -1);\n NextPath.resize(SZ);\n TreeIndex.resize(SZ);\n TreeDepth.resize(SZ);\n }\n};\nOrderedMultiSet<int> tree(5000000);\nOrderedMultiSet<int>::Node *nodes[100000];\nint N, Q, X[100000];\nvector<int> g[100000];\nint parent[100000];\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\n parent[idx] = par;\n tree.insert_key(par_set, X[idx]);\n nodes[idx] = par_set;\n for (auto &to : g[idx])\n if (to != par)\n dfs(to, idx, par_set);\n}\nint main() {\n scanf(\"%d %d\", &N, &Q);\n CentroidPathDecomposition gg(N);\n vector<int> vs;\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", &X[i]);\n vs.emplace_back(X[i]);\n }\n sort(begin(vs), end(vs));\n vs.erase(unique(begin(vs), end(vs)), end(vs));\n for (int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n gg.AddEdge(x, y);\n }\n dfs(0, -1, tree.makeset());\n gg.Build();\n for (int i = 0; i < Q; i++) {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n --x, --y;\n int lca = gg.LCA(x, y);\n int ng = -1, ok = (int)vs.size() - 1;\n auto sum = [&](int v) {\n int ret = 0;\n ret += tree.upper_bound(nodes[x], vs[v]);\n ret += tree.upper_bound(nodes[y], vs[v]);\n ret -= tree.upper_bound(nodes[lca], vs[v]);\n if (lca)\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\n return ret;\n };\n while (ok - ng > 1) {\n int mid = (ok + ng) >> 1;\n if (sum(mid) >= z)\n ok = mid;\n else\n ng = mid;\n }\n printf(\"%d\\n\", vs[ok]);\n }\n}","accuracy":1,"time_ms":860,"memory_kb":133224,"score_of_the_acc":-1.268,"final_rank":12},{"submission_id":"aoj_2270_8113351","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class Key> struct RandomizedBinarySearchTree {\n inline int xor128() {\n static int x = 123456789;\n static int y = 362436069;\n static int z = 521288629;\n static int w = 88675123;\n int t;\n t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n }\n struct Node {\n Node *l, *r;\n int cnt;\n Key key;\n Node() {}\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\n };\n vector<Node> pool;\n int ptr;\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\n virtual Node *clone(Node *t) { return t; }\n inline int count(const Node *t) { return t ? t->cnt : 0; }\n inline Node *update(Node *t) {\n t->cnt = count(t->l) + count(t->r) + 1;\n return t;\n }\n Node *propagete(Node *t) { return update(clone(t)); }\n Node *merge(Node *l, Node *r) {\n if (!l || !r)\n return l ? l : r;\n if (xor128() % (l->cnt + r->cnt) == l->cnt) {\n l = propagete(l);\n l->r = merge(l->r, r);\n return update(l);\n } else {\n r = propagete(r);\n r->l = merge(l, r->l);\n return update(r);\n }\n }\n pair<Node *, Node *> split(Node *t, int k) {\n if (!t)\n return {t, t};\n t = propagete(t);\n if (k <= count(t->l)) {\n auto s = split(t->l, k);\n t->l = s.second;\n return {s.first, update(t)};\n } else {\n auto s = split(t->r, k - count(t->l) - 1);\n t->r = s.first;\n return {update(t), s.second};\n }\n }\n Node *build(int l, int r, const vector<Key> &v) {\n if (l + 1 >= r)\n return alloc(v[l]);\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\n }\n Node *build(const vector<Key> &v) {\n ptr = 0;\n return build(0, (int)v.size(), v);\n }\n void dump(Node *r, typename vector<Key>::iterator &it) {\n if (!r)\n return;\n r = propagete(r);\n dump(r->l, it);\n *it = r->key;\n dump(r->r, ++it);\n }\n vector<Key> dump(Node *r) {\n vector<Key> v((size_t)count(r));\n auto it = begin(v);\n dump(r, it);\n return v;\n }\n string to_string(Node *r) {\n auto s = dump(r);\n string ret;\n for (int i = 0; i < s.size(); i++)\n ret += \", \";\n return (ret);\n }\n void insert(Node *&t, int k, const Key &v) {\n auto x = split(t, k);\n t = merge(merge(x.first, alloc(v)), x.second);\n }\n void erase(Node *&t, int k) {\n auto x = split(t, k);\n t = merge(x.first, split(x.second, 1).second);\n }\n int size(Node *t) { return count(t); }\n bool empty(Node *t) { return !t; }\n Node *makeset() { return (nullptr); }\n};\ntemplate <class Key>\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\n using RBST = RandomizedBinarySearchTree<Key>;\n using Node = typename RBST::Node;\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\n};\ntemplate <class T>\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\n using RBST = PresidentRandomizedBinarySearchTree<T>;\n using Node = typename RBST::Node;\n OrderedMultiSet(int sz) : RBST(sz) {}\n T kth_element(Node *t, int k) {\n if (k < RBST::count(t->l))\n return kth_element(t->l, k);\n if (k == RBST::count(t->l))\n return t->key;\n return kth_element(t->r, k - RBST::count(t->l) - 1);\n }\n virtual void insert_key(Node *&t, const T &x) {\n RBST::insert(t, lower_bound(t, x), x);\n }\n void erase_key(Node *&t, const T &x) {\n if (!count(t, x))\n return;\n RBST::erase(t, lower_bound(t, x));\n }\n int count(Node *t, const T &x) {\n return upper_bound(t, x) - lower_bound(t, x);\n }\n int lower_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x <= t->key)\n return lower_bound(t->l, x);\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n int upper_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x < t->key)\n return upper_bound(t->l, x);\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n};\nstruct CentroidPathDecomposition {\n struct Centroid {\n int ParIndex, ParDepth, Deep;\n vector<int> node;\n Centroid(int idx, int dep, int deep)\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\n inline size_t size() { return (node.size()); }\n inline int &operator[](int k) { return (node[k]); }\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\n };\n vector<vector<int>> graph;\n vector<int> SubTreeSize, NextPath;\n vector<int> TreeIndex, TreeDepth;\n vector<Centroid> Centroids;\n void BuildSubTreeSize() {\n stack<pair<int, int>> s;\n s.emplace(0, -1);\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n if (~SubTreeSize[p.first]) {\n NextPath[p.first] = -1;\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n SubTreeSize[p.first] += SubTreeSize[to];\n if (NextPath[p.first] == -1 ||\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\n NextPath[p.first] = to;\n }\n }\n } else {\n s.push(p);\n SubTreeSize[p.first] = 1;\n for (auto &to : graph[p.first]) {\n if (p.second != to)\n s.emplace(to, p.first);\n }\n }\n }\n }\n void BuildPath() {\n stack<pair<int, int>> s;\n Centroids.emplace_back(-1, -1, 0);\n s.emplace(0, -1);\n TreeIndex[0] = 0;\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n if (to == NextPath[p.first]) {\n TreeIndex[to] = TreeIndex[p.first];\n } else {\n TreeIndex[to] = (int)Centroids.size();\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\n Centroids[TreeIndex[p.first]].Deep + 1);\n }\n s.emplace(to, p.first);\n }\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\n }\n }\n void AddEdge(int x, int y) {\n graph[x].push_back(y);\n graph[y].push_back(x);\n }\n virtual void Build() {\n BuildSubTreeSize();\n BuildPath();\n }\n inline size_t size() { return (Centroids.size()); }\n inline pair<int, int> Information(int idx) {\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\n }\n inline Centroid &operator[](int k) { return (Centroids[k]); }\n inline int LCA(int a, int b) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n return (Centroids[TreeIdxA][TreeDepthA]);\n }\n inline virtual void query(int a, int b,\n const function<void(int, int, int)> &f) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n f(TreeIdxA, 0, TreeDepthA + 1);\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n f(TreeIdxB, 0, TreeDepthB + 1);\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\n }\n CentroidPathDecomposition(int SZ) {\n graph.resize(SZ);\n SubTreeSize.assign(SZ, -1);\n NextPath.resize(SZ);\n TreeIndex.resize(SZ);\n TreeDepth.resize(SZ);\n }\n};\nOrderedMultiSet<int> tree(5000000);\nOrderedMultiSet<int>::Node *nodes[100000];\nint N, Q, X[100000];\nvector<int> g[100000];\nint parent[100000];\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\n parent[idx] = par;\n tree.insert_key(par_set, X[idx]);\n nodes[idx] = par_set;\n for (auto &to : g[idx])\n if (to != par)\n dfs(to, idx, par_set);\n}\nint main() {\n scanf(\"%d %d\", &N, &Q);\n CentroidPathDecomposition gg(N);\n vector<int> vs;\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", &X[i]);\n vs.emplace_back(X[i]);\n }\n sort(begin(vs), end(vs));\n vs.erase(unique(begin(vs), end(vs)), end(vs));\n for (int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n gg.AddEdge(x, y);\n }\n dfs(0, -1, tree.makeset());\n gg.Build();\n for (int i = 0; i < Q; i++) {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n --x, --y;\n int lca = gg.LCA(x, y);\n int ng = -1, ok = (int)vs.size() - 1;\n auto sum = [&](int v) {\n int ret = 0;\n ret += tree.upper_bound(nodes[x], vs[v]);\n ret += tree.upper_bound(nodes[y], vs[v]);\n ret -= tree.upper_bound(nodes[lca], vs[v]);\n if (lca)\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\n return ret;\n };\n while (ok - ng > 1) {\n int mid = (ok + ng) >> 1;\n if (sum(mid) >= z)\n ok = mid;\n else\n ng = mid;\n }\n printf(\"%d\\n\", vs[ok]);\n }\n}","accuracy":0.7096774193548387,"time_ms":360,"memory_kb":138016,"score_of_the_acc":-1.125,"final_rank":19},{"submission_id":"aoj_2270_8113349","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class Key> struct RandomizedBinarySearchTree {\n inline int xor128() {\n static int x = 123456789;\n static int y = 362436069;\n static int z = 521288629;\n static int w = 88675123;\n int t;\n t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n }\n struct Node {\n Node *l, *r;\n int cnt;\n Key key;\n Node() {}\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\n };\n vector<Node> pool;\n int ptr;\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\n virtual Node *clone(Node *t) { return t; }\n inline int count(const Node *t) { return t ? t->cnt : 0; }\n inline Node *update(Node *t) {\n t->cnt = count(t->l) + count(t->r) + 1;\n return t;\n }\n Node *propagete(Node *t) { return update(clone(t)); }\n Node *merge(Node *l, Node *r) {\n if (!l || !r)\n return l ? l : r;\n if (xor128() % l->cnt < r->cnt) {\n l = propagete(l);\n l->r = merge(l->r, r);\n return update(l);\n } else {\n r = propagete(r);\n r->l = merge(l, r->l);\n return update(r);\n }\n }\n pair<Node *, Node *> split(Node *t, int k) {\n if (!t)\n return {t, t};\n t = propagete(t);\n if (k <= count(t->l)) {\n auto s = split(t->l, k);\n t->l = s.second;\n return {s.first, update(t)};\n } else {\n auto s = split(t->r, k - count(t->l) - 1);\n t->r = s.first;\n return {update(t), s.second};\n }\n }\n Node *build(int l, int r, const vector<Key> &v) {\n if (l + 1 >= r)\n return alloc(v[l]);\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\n }\n Node *build(const vector<Key> &v) {\n ptr = 0;\n return build(0, (int)v.size(), v);\n }\n void dump(Node *r, typename vector<Key>::iterator &it) {\n if (!r)\n return;\n r = propagete(r);\n dump(r->l, it);\n *it = r->key;\n dump(r->r, ++it);\n }\n vector<Key> dump(Node *r) {\n vector<Key> v((size_t)count(r));\n auto it = begin(v);\n dump(r, it);\n return v;\n }\n string to_string(Node *r) {\n auto s = dump(r);\n string ret;\n for (int i = 0; i < s.size(); i++)\n ret += \", \";\n return (ret);\n }\n void insert(Node *&t, int k, const Key &v) {\n auto x = split(t, k);\n t = merge(merge(x.first, alloc(v)), x.second);\n }\n void erase(Node *&t, int k) {\n auto x = split(t, k);\n t = merge(x.first, split(x.second, 1).second);\n }\n int size(Node *t) { return count(t); }\n bool empty(Node *t) { return !t; }\n Node *makeset() { return (nullptr); }\n};\ntemplate <class Key>\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\n using RBST = RandomizedBinarySearchTree<Key>;\n using Node = typename RBST::Node;\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\n};\ntemplate <class T>\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\n using RBST = PresidentRandomizedBinarySearchTree<T>;\n using Node = typename RBST::Node;\n OrderedMultiSet(int sz) : RBST(sz) {}\n T kth_element(Node *t, int k) {\n if (k < RBST::count(t->l))\n return kth_element(t->l, k);\n if (k == RBST::count(t->l))\n return t->key;\n return kth_element(t->r, k - RBST::count(t->l) - 1);\n }\n virtual void insert_key(Node *&t, const T &x) {\n RBST::insert(t, lower_bound(t, x), x);\n }\n void erase_key(Node *&t, const T &x) {\n if (!count(t, x))\n return;\n RBST::erase(t, lower_bound(t, x));\n }\n int count(Node *t, const T &x) {\n return upper_bound(t, x) - lower_bound(t, x);\n }\n int lower_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x <= t->key)\n return lower_bound(t->l, x);\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n int upper_bound(Node *t, const T &x) {\n if (!t)\n return 0;\n if (x < t->key)\n return upper_bound(t->l, x);\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\n }\n};\nstruct CentroidPathDecomposition {\n struct Centroid {\n int ParIndex, ParDepth, Deep;\n vector<int> node;\n Centroid(int idx, int dep, int deep)\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\n inline size_t size() { return (node.size()); }\n inline int &operator[](int k) { return (node[k]); }\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\n };\n vector<vector<int>> graph;\n vector<int> SubTreeSize, NextPath;\n vector<int> TreeIndex, TreeDepth;\n vector<Centroid> Centroids;\n void BuildSubTreeSize() {\n stack<pair<int, int>> s;\n s.emplace(0, -1);\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n if (~SubTreeSize[p.first]) {\n NextPath[p.first] = -1;\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n SubTreeSize[p.first] += SubTreeSize[to];\n if (NextPath[p.first] == -1 ||\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\n NextPath[p.first] = to;\n }\n }\n } else {\n s.push(p);\n SubTreeSize[p.first] = 1;\n for (auto &to : graph[p.first]) {\n if (p.second != to)\n s.emplace(to, p.first);\n }\n }\n }\n }\n void BuildPath() {\n stack<pair<int, int>> s;\n Centroids.emplace_back(-1, -1, 0);\n s.emplace(0, -1);\n TreeIndex[0] = 0;\n while (!s.empty()) {\n auto p = s.top();\n s.pop();\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\n for (auto &to : graph[p.first]) {\n if (p.second == to)\n continue;\n if (to == NextPath[p.first]) {\n TreeIndex[to] = TreeIndex[p.first];\n } else {\n TreeIndex[to] = (int)Centroids.size();\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\n Centroids[TreeIndex[p.first]].Deep + 1);\n }\n s.emplace(to, p.first);\n }\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\n }\n }\n void AddEdge(int x, int y) {\n graph[x].push_back(y);\n graph[y].push_back(x);\n }\n virtual void Build() {\n BuildSubTreeSize();\n BuildPath();\n }\n inline size_t size() { return (Centroids.size()); }\n inline pair<int, int> Information(int idx) {\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\n }\n inline Centroid &operator[](int k) { return (Centroids[k]); }\n inline int LCA(int a, int b) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n return (Centroids[TreeIdxA][TreeDepthA]);\n }\n inline virtual void query(int a, int b,\n const function<void(int, int, int)> &f) {\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\n tie(TreeIdxA, TreeDepthA) = Information(a);\n tie(TreeIdxB, TreeDepthB) = Information(b);\n while (TreeIdxA != TreeIdxB) {\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\n f(TreeIdxA, 0, TreeDepthA + 1);\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\n } else {\n f(TreeIdxB, 0, TreeDepthB + 1);\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\n }\n }\n if (TreeDepthA > TreeDepthB)\n swap(TreeDepthA, TreeDepthB);\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\n }\n CentroidPathDecomposition(int SZ) {\n graph.resize(SZ);\n SubTreeSize.assign(SZ, -1);\n NextPath.resize(SZ);\n TreeIndex.resize(SZ);\n TreeDepth.resize(SZ);\n }\n};\nOrderedMultiSet<int> tree(5000000);\nOrderedMultiSet<int>::Node *nodes[100000];\nint N, Q, X[100000];\nvector<int> g[100000];\nint parent[100000];\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\n parent[idx] = par;\n tree.insert_key(par_set, X[idx]);\n nodes[idx] = par_set;\n for (auto &to : g[idx])\n if (to != par)\n dfs(to, idx, par_set);\n}\nint main() {\n scanf(\"%d %d\", &N, &Q);\n CentroidPathDecomposition gg(N);\n vector<int> vs;\n for (int i = 0; i < N; i++) {\n scanf(\"%d\", &X[i]);\n vs.emplace_back(X[i]);\n }\n sort(begin(vs), end(vs));\n vs.erase(unique(begin(vs), end(vs)), end(vs));\n for (int i = 1; i < N; i++) {\n int x, y;\n scanf(\"%d %d\", &x, &y);\n --x, --y;\n g[x].emplace_back(y);\n g[y].emplace_back(x);\n gg.AddEdge(x, y);\n }\n dfs(0, -1, tree.makeset());\n gg.Build();\n for (int i = 0; i < Q; i++) {\n int x, y, z;\n scanf(\"%d %d %d\", &x, &y, &z);\n --x, --y;\n int lca = gg.LCA(x, y);\n int ng = -1, ok = (int)vs.size() - 1;\n auto sum = [&](int v) {\n int ret = 0;\n ret += tree.upper_bound(nodes[x], vs[v]);\n ret += tree.upper_bound(nodes[y], vs[v]);\n ret -= tree.upper_bound(nodes[lca], vs[v]);\n if (lca)\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\n return ret;\n };\n while (ok - ng > 1) {\n int mid = (ok + ng) >> 1;\n if (sum(mid) >= z)\n ok = mid;\n else\n ng = mid;\n }\n printf(\"%d\\n\", vs[ok]);\n }\n}","accuracy":1,"time_ms":1030,"memory_kb":127132,"score_of_the_acc":-1.2834,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_2270_10978199\",\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\\nusing ll = long long;\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)\\n\\nconst ll dy[] = {-1, 0, 0, 1};\\nconst ll dx[] = {0, -1, 1, 0};\\n\\ntemplate <class T, class T1, class T2> bool isrange(T target, T1 low, T2 high) { return low <= target && target < high; }\\ntemplate <class T, class U> T min(const T &t, const U &u) { return t < u ? t : u; }\\ntemplate <class T, class U> T max(const T &t, const U &u) { return t < u ? u : t; }\\ntemplate <class T, class U> bool chmin(T &t, const U &u) { if (t > u) { t = u; return true; } return false; }\\ntemplate <class T, class U> bool chmax(T &t, const U &u) { if (t < u) { t = u; return true; } return false; }\\n\\n// #include \\\"titan_cpplib/others/io.cpp\\\"\\n// #include \\\"titan_cpplib/others/print.cpp\\\"\\n// #include \\\"titan_cpplib/graph/hld.cpp\\\"\\n\\n#include <vector>\\n#include <stack>\\nusing namespace std;\\n\\n// HLD\\nnamespace titan23 {\\n\\nclass HLD {\\npublic:\\n vector<vector<int>> G;\\n int root, n;\\n vector<int> size, par, dep, nodein, nodeout, head, hld;\\n\\nprivate:\\n void _dfs() {\\n dep[root] = 0;\\n stack<int> st;\\n st.emplace(~root);\\n st.emplace(root);\\n while (!st.empty()) {\\n int v = st.top(); st.pop();\\n if (v >= 0) {\\n int dep_nxt = dep[v] + 1;\\n for (const int x: G[v]) {\\n if (dep[x] != -1) continue;\\n dep[x] = dep_nxt;\\n st.emplace(~x);\\n st.emplace(x);\\n }\\n } else {\\n v = ~v;\\n for (int i = 0; i < (int)G[v].size(); ++i) {\\n int x = G[v][i];\\n if (dep[x] < dep[v]) {\\n par[v] = x;\\n continue;\\n }\\n size[v] += size[x];\\n if (size[x] > size[G[v][0]]) {\\n swap(G[v][0], G[v][i]);\\n }\\n }\\n }\\n }\\n\\n int curtime = 0;\\n st.emplace(~root);\\n st.emplace(root);\\n while (!st.empty()) {\\n int v = st.top(); st.pop();\\n if (v >= 0) {\\n if (par[v] == -1) {\\n head[v] = v;\\n }\\n nodein[v] = curtime;\\n hld[curtime] = v;\\n ++curtime;\\n if (G[v].empty()) continue;\\n int G_v0 = (int)G[v][0];\\n for (int i = (int)G[v].size()-1; i >= 0; --i) {\\n int x = G[v][i];\\n if (x == par[v]) continue;\\n head[x] = (x == G_v0? head[v]: x);\\n st.emplace(~x);\\n st.emplace(x);\\n }\\n } else {\\n nodeout[~v] = curtime;\\n }\\n }\\n }\\n\\npublic:\\n HLD() {}\\n HLD(const vector<vector<int>> &G, const int root) :\\n G(G), root(root), n(G.size()),\\n size(n, 1), par(n, -1), dep(n, -1),\\n nodein(n, -1), nodeout(n, -1), head(n, -1), hld(n, -1) {\\n _dfs();\\n }\\n\\n template<typename T>\\n vector<T> build_list(vector<T> a) const {\\n vector<T> res(a.size());\\n for (int i = 0; i < n; ++i) {\\n res[i] = a[hld[i]];\\n }\\n return res;\\n }\\n\\n //! `u`, `v` の lca を返す / `O(logn)`\\n int lca(int u, int v) const {\\n while (true) {\\n if (nodein[u] > nodein[v]) swap(u, v);\\n if (head[u] == head[v]) return u;\\n v = par[head[v]];\\n }\\n }\\n\\n vector<pair<int, int>> for_each_vertex_path(int u, int v) const {\\n vector<pair<int, int>> res;\\n while (head[u] != head[v]) {\\n if (dep[head[u]] < dep[head[v]]) swap(u, v);\\n res.emplace_back(nodein[head[u]], nodein[u]+1);\\n u = par[head[u]];\\n }\\n if (dep[u] < dep[v]) swap(u, v);\\n res.emplace_back(nodein[v], nodein[u]+1);\\n return res;\\n }\\n\\n pair<int, int> for_each_vertex_subtree(int v) const {\\n return {nodein[v], nodeout[v]};\\n }\\n\\n int dist(int u, int v) const {\\n return dep[u] + dep[v] - 2 * dep[lca(u, v)];\\n }\\n};\\n} // namespace titan23\\n// #include \\\"titan_cpplib/algorithm/zaatsu.cpp\\\"\\n#include <vector>\\nusing namespace std;\\n\\n// Zaatsu\\nnamespace titan23 {\\n\\n/**\\n * @brief 座標圧縮管理クラス\\n */\\ntemplate<typename T>\\nclass Zaatsu {\\nprivate:\\n vector<T> _to_origin;\\n int n;\\n\\npublic:\\n Zaatsu() : n(0) {}\\n\\n //! `used_items` からなる集合を管理するインスタンスを生成\\n Zaatsu(vector<T> &used_items) : _to_origin(used_items) {\\n sort(_to_origin.begin(), _to_origin.end());\\n _to_origin.erase(unique(_to_origin.begin(), _to_origin.end()), _to_origin.end());\\n n = (int)_to_origin.size();\\n }\\n\\n //! 要素の種類数を返す(`max(to_zaatsu)`)\\n int len() const {\\n return n;\\n }\\n\\n //! `x` を座標圧縮する\\n int to_zaatsu(const T &x) const {\\n return lower_bound(_to_origin.begin(), _to_origin.end(), x) - _to_origin.begin();\\n }\\n\\n //! 座標圧縮された `x` を戻す\\n T to_origin(const int &x) const {\\n assert(0 <= x && x < n);\\n return _to_origin[x];\\n }\\n};\\n} // namespace titan23\\n// #include \\\"titan_cpplib/data_structures/wavelet_matrix.cpp\\\"\\n#include <vector>\\n#include <queue>\\n// #include \\\"titan_cpplib/data_structures/bit_vector.cpp\\\"\\n#include <iostream>\\n#include <vector>\\n#include <cassert>\\nusing namespace std;\\n\\n// BitVector\\nnamespace titan23 {\\n\\nclass BitVector {\\nprivate:\\n using u64 = unsigned long long;\\n int n, bsize;\\n vector<u64> bit, acc;\\n\\npublic:\\n BitVector() {}\\n BitVector(const int n) :\\n n(n), bsize((n+63)>>6), bit(bsize+1, 0), acc(bsize+1, 0) {}\\n\\n void set(const int k) {\\n bit[k>>6] |= (1ull) << (k & 63);\\n }\\n\\n void build() {\\n for (int i = 0; i < bsize; ++i) {\\n acc[i+1] += acc[i] + __builtin_popcountll(bit[i]);\\n }\\n }\\n\\n bool access(const int k) const {\\n return (bit[k>>6] >> (k&63)) & 1;\\n }\\n\\n int rank0(const int r) const {\\n return r - (acc[r>>6] + __builtin_popcountll(bit[r>>6] & ((1ull << (r & 63)) - 1)));\\n }\\n\\n int rank1(const int r) const {\\n return acc[r>>6] + __builtin_popcountll(bit[r>>6] & ((1ull << (r & 63)) - 1));\\n }\\n\\n int rank(const int r, const bool v) const {\\n return v ? rank1(r) : rank0(r);\\n }\\n\\n int select0(int k) const {\\n if (k < 0 or rank0(n) <= k) return -1;\\n int l = 0, r = bsize+1;\\n while (r - l > 1) {\\n const int m = (l + r) >> 1;\\n if (m*32 - acc[m] > k) {\\n r = m;\\n } else {\\n l = m;\\n }\\n }\\n int indx = 32 * l;\\n k = k - (l*32 - acc[l]) + rank0(indx);\\n l = indx; r = indx+32;\\n while (r - l > 1) {\\n const int m = (l + r) >> 1;\\n if (rank0(m) > k) {\\n r = m;\\n } else {\\n l = m;\\n }\\n }\\n return l;\\n }\\n\\n int select1(int k) const {\\n if (k < 0 || rank1(n) <= k) return -1;\\n int l = 0, r = bsize+1;\\n while (r - l > 1) {\\n const int m = (l + r) >> 1;\\n if (acc[m] > k) {\\n r = m;\\n } else {\\n l = m;\\n }\\n }\\n int indx = 32 * l;\\n k = k - acc[l] + rank1(indx);\\n l = indx; r = indx+32;\\n while (r - l > 1) {\\n const int m = (l + r) >> 1;\\n if (rank1(m) > k) {\\n r = m;\\n } else {\\n l = m;\\n }\\n }\\n return l;\\n }\\n\\n int select(const int k, const int v) const {\\n return v ? select1(k) : select0(k);\\n }\\n\\n int len() const {\\n return n;\\n }\\n\\n void print() const {\\n cout << \\\"[\\\";\\n for (int i = 0; i < len()-1; ++i) {\\n cout << access(i) << \\\", \\\";\\n }\\n if (len() > 0) {\\n cout << access(len()-1);\\n }\\n cout << \\\"]\\\\n\\\";\\n }\\n};\\n} // namespace titan23\\nusing namespace std;\\n\\n// WaveletMatrix\\nnamespace titan23 {\\n\\ntemplate<typename T>\\nclass WaveletMatrix {\\nprivate:\\n T sigma;\\n int log;\\n vector<BitVector> v;\\n vector<int> mid;\\n int n;\\n\\n int bit_length(const int n) const {\\n return n == 0 ? 0 : 32 - __builtin_clz(n);\\n }\\n\\n void build(vector<T> a) {\\n for (int bit = log-1; bit >= 0; --bit) {\\n vector<T> zero, one;\\n v[bit] = BitVector(n);\\n for (int i = 0; i < n; ++i) {\\n if ((a[i] >> bit) & 1) {\\n v[bit].set(i);\\n one.emplace_back(a[i]);\\n } else {\\n zero.emplace_back(a[i]);\\n }\\n }\\n v[bit].build();\\n mid[bit] = zero.size();\\n a = zero;\\n a.insert(a.end(), one.begin(), one.end());\\n assert(a.size() == n);\\n }\\n }\\n\\npublic:\\n WaveletMatrix() {}\\n\\n WaveletMatrix(const T sigma)\\n : sigma(sigma), log(bit_length(sigma-1)), v(log), mid(log), n(0) {}\\n\\n WaveletMatrix(const T sigma, const vector<T> &a)\\n : sigma(sigma), log(bit_length(sigma-1)), v(log), mid(log), n(a.size()) {\\n build(a);\\n }\\n\\n T access(int k) const {\\n T s = 0;\\n for (int bit = log-1; bit >= 0; --bit) {\\n if (v[bit].access(k)) {\\n s |= (T)1 << bit;\\n k = v[bit].rank1(k) + mid[bit];\\n } else {\\n k = v[bit].rank0(k);\\n }\\n }\\n return s;\\n }\\n\\n //! `a[0, r)` に含まれる `x` の個数を返します。\\n int rank(int r, T x) const {\\n int l = 0;\\n for (int bit = log-1; bit >= 0; --bit) {\\n if ((x >> bit) & 1) {\\n l = v[bit].rank1(l) + mid[bit];\\n r = v[bit].rank1(r) + mid[bit];\\n } else {\\n l = v[bit].rank0(l);\\n r = v[bit].rank0(r);\\n }\\n }\\n return r - l;\\n }\\n\\n // `k` 番目の `v` のインデックスを返す。\\n int select(int k, T x) const {\\n int s = 0;\\n for (int bit = log-1; bit >= 0; --bit) {\\n if ((x >> bit) & 1) {\\n s = v[bit].rank0(n) + v[bit].rank1(s);\\n } else {\\n s = v[bit].rank0(s);\\n }\\n }\\n s += k;\\n for (int bit = 0; bit < log; ++bit) {\\n if ((x >> bit) & 1) {\\n s = v[bit].select1(s - v[bit].rank0(n));\\n } else {\\n s = v[bit].select0(s);\\n }\\n }\\n return s;\\n }\\n\\n // `a[l, r)` の中で k 番目に **小さい** 値を返します。\\n T kth_smallest(int l, int r, int k) const {\\n T s = 0;\\n for (int bit = log-1; bit >= 0; --bit) {\\n const int r0 = v[bit].rank0(r), l0 = v[bit].rank0(l);\\n const int cnt = r0 - l0;\\n if (cnt <= k) {\\n s |= (T)1 << bit;\\n k -= cnt;\\n l = l - l0 + mid[bit];\\n r = r - r0 + mid[bit];\\n } else {\\n l = l0;\\n r = r0;\\n }\\n }\\n return s;\\n }\\n\\n T kth_largest(int l, int r, int k) const {\\n return kth_smallest(l, r, r-l-k-1);\\n }\\n\\n // `a[l, r)` の中で、要素を出現回数が多い順にその頻度とともに `k` 個返します。\\n vector<pair<int, int>> topk(int l, int r, int k) {\\n // heap[-length, x, l, bit]\\n priority_queue<tuple<int, T, int, int>> hq;\\n hq.emplace(r-l, 0, l, log-1);\\n vector<pair<T, int>> ans;\\n while (!hq.empty()) {\\n auto [length, x, l, bit] = hq.top();\\n hq.pop();\\n if (bit == -1) {\\n ans.emplace_back(x, length);\\n k -= 1;\\n if (k == 0) break;\\n } else {\\n r = l + length;\\n int l0 = v[bit].rank0(l);\\n int r0 = v[bit].rank0(r);\\n if (l0 < r0) hq.emplace(r0-l0, x, l0, bit-1);\\n int l1 = v[bit].rank1(l) + mid[bit];\\n int r1 = v[bit].rank1(r) + mid[bit];\\n if (l1 < r1) hq.emplace(r1-l1, x|((T)1<<bit), l1, bit-1);\\n }\\n }\\n return ans;\\n }\\n\\n T sum(int l, int r) const {\\n assert(false);\\n T s = 0;\\n for (const auto &[sum, cnt]: topk(l, r, r-l)) {\\n s += sum * cnt;\\n }\\n return s;\\n }\\n\\n // a[l, r) で x 未満の要素の数を返す'''\\n int range_freq(int l, int r, T x) const {\\n int ans = 0;\\n for (int bit = log-1; bit >= 0; --bit) {\\n int l0 = v[bit].rank0(l), r0 = v[bit].rank0(r);\\n if ((x >> bit) & 1) {\\n ans += r0 - l0;\\n l += mid[bit] - l0;\\n r += mid[bit] - r0;\\n } else {\\n l = l0;\\n r = r0;\\n }\\n }\\n return ans;\\n }\\n\\n //`a[l, r)` に含まれる、 `x` 以上 `y` 未満である要素の個数を返します。\\n int range_freq(int l, int r, T x, T y) const {\\n return range_freq(l, r, y) - range_freq(l, r, x);\\n }\\n\\n //`a[l, r)` で、`y`未満であるような要素のうち最大の要素を返します。\\n T prev_value(int l, int r, T y) const {\\n int x = range_freq(l, r, y);\\n if (x == 0) {\\n return -1;\\n }\\n return kth_smallest(l, r, x-1);\\n }\\n\\n T next_value(int l, int r, T x) const {\\n return kth_smallest(l, r, range_freq(l, r, x));\\n }\\n\\n //`a[l, r)` に含まれる `x` の個数を返します。\\n int range_count(int l, int r, T x) const {\\n return rank(r, x) - rank(l, x);\\n }\\n\\n int len() const {\\n return n;\\n }\\n\\n friend ostream& operator<<(ostream& os, const titan23::WaveletMatrix<T>& wm) {\\n int n = wm.len();\\n os << \\\"[\\\";\\n for (int i = 0; i < n; ++i) {\\n os << wm.access(i);\\n if (i != n-1) os << \\\", \\\";\\n }\\n os << \\\"]\\\";\\n return os;\\n }\\n};\\n} // namespace titan23\\n\\n\\nvoid solve() {\\n int n, q; cin >> n >> q;\\n vector<int> X(n);\\n rep(i, n) cin >> X[i];\\n vector<vector<int>> G(n);\\n rep(i, n-1) {\\n int a, b; cin >> a >> b;\\n --a; --b;\\n G[a].emplace_back(b);\\n G[b].emplace_back(a);\\n }\\n\\n int root = 0;\\n titan23::HLD hld(G, root);\\n titan23::Zaatsu<int> Z(X);\\n vector<int> W(n);\\n rep(i, n) W[i] = Z.to_zaatsu(X[i]);\\n titan23::WaveletMatrix<int> wm(n, hld.build_list(W));\\n\\n rep(qdx, q) {\\n int v, w, k; cin >> v >> w >> k;\\n --v; --w;\\n\\n auto isok = [&] (int M) -> bool {\\n vector<pair<int, int>> path = hld.for_each_vertex_path(v, w);\\n int cnt = 0;\\n for (auto &[u, v] : path) {\\n cnt += wm.range_freq(u, v, M+1);\\n }\\n return cnt >= k;\\n };\\n\\n int ok = Z.len()-1, ng = -1;\\n while (ok - ng > 1) {\\n int mid = (ok + ng) / 2;\\n if (isok(mid)) {\\n ok = mid;\\n } else {\\n ng = mid;\\n }\\n }\\n cout << Z.to_origin(ok) << \\\"\\\\n\\\";\\n }\\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 = 1;\\n // cin >> t;\\n for (int i = 0; i < t; ++i) {\\n solve();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2030,\n \"memory_kb\": 20580,\n \"score_of_the_acc\": -0.8487,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2270_10853826\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nclass HLDecomposition {\\n\\tvector<vector<int>> g;\\n\\tvector<int> vid, head, heavy, parent, depth;\\npublic:\\n\\tvector<int> inv;\\nprivate:\\n\\tint dfs(int curr, int prev) {\\n\\t\\tparent[curr] = prev;\\n\\t\\tint sub = 1, max_sub = 0;\\n\\t\\tfor (int next : g[curr]) if (next != prev) {\\n\\t\\t\\tdepth[next] = depth[curr] + 1;\\n\\t\\t\\tint sub_next = dfs(next, curr);\\n\\t\\t\\tsub += sub_next;\\n\\t\\t\\tif (max_sub < sub_next) max_sub = sub_next, heavy[curr] = next;\\n\\t\\t}\\n\\t\\treturn sub;\\n\\t}\\n\\tvoid bfs() {\\n\\t\\tint k = 0;\\n\\t\\tqueue<int> q({ 0 });\\n\\t\\twhile (!q.empty()) {\\n\\t\\t\\tint h = q.front(); q.pop();\\n\\t\\t\\tfor (int i = h; i != -1; i = heavy[i]) {\\n\\t\\t\\t\\tvid[i] = k++;\\n\\t\\t\\t\\tinv[vid[i]] = i;\\n\\t\\t\\t\\thead[i] = h;\\n\\t\\t\\t\\tfor (int j : g[i]) if (j != parent[i] && j != heavy[i]) q.push(j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\npublic:\\n\\tHLDecomposition(int n)\\n\\t\\t: g(n), vid(n, -1), head(n), heavy(n, -1), parent(n), depth(n), inv(n) {}\\n\\n\\tvoid add(int u, int v) {\\n\\t\\tg[u].push_back(v);\\n\\t\\tg[v].push_back(u);\\n\\t}\\n\\tvoid build() {\\n\\t\\tdfs(0, -1);\\n\\t\\tbfs();\\n\\t}\\n\\tvoid for_each(int u, int v, function<void(int, int)> f) {\\n\\t\\tif (vid[u] > vid[v]) swap(u, v);\\n\\t\\tf(max(vid[head[v]], vid[u]), vid[v]);\\n\\t\\tif (head[u] != head[v]) for_each(u, parent[head[v]], f);\\n\\t}\\n};\\n\\ntemplate <typename T>\\nclass SegmentTree {\\n\\tconst int n;\\n\\tvector<vector<T>> data;\\n\\tvector<T> merge(const vector<T>& l, const vector<T>& r) {\\n\\t\\tint nl = l.size(), nr = r.size();\\n\\t\\tvector<T> res(nl + nr);\\n\\t\\tfor (int i = 0, j = 0, k = 0; i < nl || j < nr; k++) {\\n\\t\\t\\tif (j == nr)\\n\\t\\t\\t\\tres[k] = l[i++];\\n\\t\\t\\telse if (i == nl)\\n\\t\\t\\t\\tres[k] = r[j++];\\n\\t\\t\\telse if (l[i] <= r[j])\\n\\t\\t\\t\\tres[k] = l[i++];\\n\\t\\t\\telse\\n\\t\\t\\t\\tres[k] = r[j++];\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\tint size(int n) {\\n\\t\\tint res;\\n\\t\\tfor (res = 1; res < n; res <<= 1);\\n\\t\\treturn res;\\n\\t}\\n\\tT sub(int l, int r, int node, int lb, int ub, T val) {\\n\\t\\tif (ub <= l || r <= lb) return 0;\\n\\t\\tif (l <= lb && ub <= r) return upper_bound(data[node].begin(), data[node].end(), val) - data[node].begin();\\n\\t\\treturn sub(l, r, node * 2, lb, (lb + ub) / 2, val) + sub(l, r, node * 2 + 1, (lb + ub) / 2, ub, val);\\n\\t}\\npublic:\\n\\tSegmentTree(const vector<T>& data_) : n(size(data_.size())), data(n * 2) {\\n\\t\\tfor (int i = 0; i < (int)data_.size(); i++)\\n\\t\\t\\tdata[i + n].push_back(data_[i]);\\n\\t\\tfor (int i = n - 1; i >= 0; i--)\\n\\t\\t\\tdata[i] = merge(data[i * 2], data[i * 2 + 1]);\\n\\t}\\n\\tvoid Update(int p, T val) {\\n\\t\\tp += n;\\n\\t\\tdata[p][0] = val;\\n\\t\\twhile (p >>= 1) data[p] = merge(data[p * 2], data[p * 2 + 1]);\\n\\t}\\n\\tvoid Add(int p, T val) {\\n\\t\\tp += n;\\n\\t\\tdata[p][0] += val;\\n\\t\\twhile (p >>= 1) data[p] = merge(data[p * 2], data[p * 2 + 1]);\\n\\t}\\n\\tT Find(int l, int r, T val) {\\n\\t\\treturn sub(l, r + 1, 1, 0, n, val);\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tcin.sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tint N, Q;\\n\\tcin >> N >> Q;\\n\\tvector<int> W(N), base(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> W[i];\\n\\t}\\n\\tHLDecomposition hl(N);\\n\\tfor (int i = 0, u, v; i < N - 1; i++) {\\n\\t\\tcin >> u >> v; u--; v--;\\n\\t\\thl.add(u, v);\\n\\t}\\n\\thl.build();\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tbase[i] = W[hl.inv[i]];\\n\\t}\\n\\tint v, w, l;\\n\\tSegmentTree<int> st(base);\\n\\twhile (Q--) {\\n\\t\\tcin >> v >> w >> l; v--; w--;\\n\\t\\tint lb = 0, ub = 1000000000;\\n\\t\\twhile (lb + 1 < ub) {\\n\\t\\t\\tint c = lb + (ub - lb) / 2;\\n\\t\\t\\tint sum = 0;\\n\\t\\t\\thl.for_each(v, w, [&](int ll, int rr) {\\n\\t\\t\\t\\tsum += st.Find(ll, rr, c);\\n\\t\\t\\t});\\n\\t\\t\\tif (sum >= l) {\\n\\t\\t\\t\\tub = c;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tlb = c;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\", ub);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2310,\n \"memory_kb\": 34536,\n \"score_of_the_acc\": -1.0524,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2270_10308712\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <cmath>\\n#include <cstdint>\\n#include <numeric>\\n/// @brief めぐる式二分探索\\ntemplate <class T, class F>\\nstd::int64_t meguru_binary_search(T ok, T ng, F check) {\\n while (std::abs(ok - ng) > 1) {\\n T mid = std::midpoint(ok, ng);\\n (check(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#include <algorithm>\\n#include <iterator>\\n#include <vector>\\n/// @brief 座標圧縮\\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 return std::distance(data.begin(), std::lower_bound(data.begin(), data.end(), x));\\n }\\n int lower_bound(T x) const {\\n return std::distance(data.begin(), std::lower_bound(data.begin(), data.end(), x));\\n }\\n int upper_bound(T x) const {\\n return std::distance(data.begin(), std::upper_bound(data.begin(), data.end(), x));\\n }\\n std::vector<int> compress(const std::vector<T> &v) const {\\n int n = v.size();\\n std::vector<int> res(n);\\n for (int i = 0; i < n; ++i) res[i] = get(v[i]);\\n return res;\\n }\\n int size() const { return data.size(); }\\n private:\\n std::vector<T> data;\\n};\\n/// @brief 座標圧縮\\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>\\n#include <tuple>\\nnamespace internal {\\n/**\\n * @brief 完備辞書\\n *\\n * @see https://ei1333.github.io/library/structure/wavelet/succinct-indexable-dictionary.hpp\\n */\\nstruct bit_vector {\\n bit_vector() = default;\\n bit_vector(unsigned int _length)\\n : length(_length), blocks((_length + 31) >> 5), bit((_length + 31) >> 5),\\n sum((_length + 31) >> 5) {}\\n void set(unsigned int k) { bit[k >> 5] |= 1U << (k & 31); }\\n void build() {\\n sum[0] = 0U;\\n for (unsigned int i = 1; i < blocks; ++i) {\\n sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);\\n }\\n }\\n bool operator[](unsigned int k) const { return bit[k >> 5] >> (k & 31) & 1; }\\n unsigned int rank(unsigned int k) const {\\n return sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1));\\n }\\n unsigned int rank(bool val, unsigned int k) const { return val ? rank(k) : k - rank(k); }\\n unsigned int select(unsigned int k) const {\\n unsigned int sl = 0, sr = blocks + 1;\\n while (sr - sl > 1) {\\n unsigned int m = (sl + sr) >> 1;\\n if (sum[m] < k) sl = m;\\n else sr = m;\\n }\\n k -= sum[sl];\\n unsigned int bl = 0, br = 32;\\n while (br - bl > 1) {\\n unsigned int m = (bl + br) >> 1;\\n if (__builtin_popcount(bit[sl] & ((1U << m) - 1)) < k) bl = m;\\n else br = m;\\n }\\n return (sl << 5) + bl;\\n }\\n private:\\n unsigned int length, blocks;\\n std::vector<unsigned int> bit, sum;\\n};\\n} // namespace internal\\n/// @brief 重み付きウェーブレット行列\\ntemplate <class T, class U = T, int L = 30>\\nstruct wavelet_matrix_rectangle_sum {\\n wavelet_matrix_rectangle_sum() = default;\\n template <class Value>\\n wavelet_matrix_rectangle_sum(const std::vector<T> &v, const std::vector<Value> &u)\\n : length(v.size()) {\\n assert(v.size() == u.size());\\n std::vector<int> l(length), r(length), ord(length);\\n std::iota(ord.begin(), ord.end(), 0);\\n for (int level = L - 1; level >= 0; level--) {\\n matrix[level] = internal::bit_vector(length + 1);\\n int left = 0, right = 0;\\n for (int i = 0; i < length; i++) {\\n if ((v[ord[i]] >> level) & 1) {\\n matrix[level].set(i);\\n r[right++] = ord[i];\\n } else {\\n l[left++] = ord[i];\\n }\\n }\\n mid[level] = left;\\n matrix[level].build();\\n ord.swap(l);\\n for (int i = 0; i < right; i++) ord[left + i] = r[i];\\n cs[level].resize(length + 1);\\n cs[level][0] = U(0);\\n for (int i = 0; i < length; i++) cs[level][i + 1] = cs[level][i] + u[ord[i]];\\n }\\n }\\n U kth_smallest_sum(int l, int r, int k) const {\\n assert(0 <= k && k <= r - l);\\n T val = T();\\n U res = U();\\n for (int level = L - 1; level >= 0; --level) {\\n int cnt = matrix[level].rank(false, r) - matrix[level].rank(false, l);\\n bool f = cnt <= k;\\n if (f) {\\n val |= T(1) << level;\\n res += cs[level][matrix[level].rank(false, r)] -\\n cs[level][matrix[level].rank(false, l)];\\n k -= cnt;\\n }\\n std::tie(l, r) = succ(f, l, r, level);\\n }\\n return res + val * k;\\n }\\n U kth_largest_sum(int l, int r, int k) const {\\n return cs[L - 1][matrix[L - 1].rank(false, r)] + cs[L - 1][matrix[L - 1].rank(true, r)] -\\n cs[L - 1][matrix[L - 1].rank(false, l)] - cs[L - 1][matrix[L - 1].rank(true, l)] -\\n kth_smallest_sum(l, r, r - l - k);\\n }\\n U range_sum(int r, T x) const { return range_sum(0, r, x); }\\n U range_sum(int l, int r, T x) const {\\n for (int level = L - 1; level >= 0; level--)\\n std::tie(l, r) = succ((x >> level) & 1, l, r, level);\\n return cs[0][matrix[0].rank(false, r)] - cs[0][matrix[0].rank(false, l)];\\n }\\n U rect_sum(int l, int r, T upper) const {\\n U res = 0;\\n for (int level = L - 1; level >= 0; level--) {\\n bool f = (upper >> level) & 1;\\n if (f)\\n res += cs[level][matrix[level].rank(false, r)] -\\n cs[level][matrix[level].rank(false, l)];\\n std::tie(l, r) = succ(f, l, r, level);\\n }\\n return res;\\n }\\n U rect_sum(int l, int r, T lower, T upper) const {\\n return rect_sum(l, r, upper) - rect_sum(l, r, lower);\\n }\\n private:\\n int length;\\n internal::bit_vector matrix[L];\\n int mid[L];\\n std::vector<U> cs[L];\\n std::pair<int, int> succ(bool f, int l, int r, int level) const {\\n return {matrix[level].rank(f, l) + mid[level] * f,\\n matrix[level].rank(f, r) + mid[level] * f};\\n }\\n};\\n#include <iostream>\\n/**\\n * @brief 重み付きグラフ\\n *\\n * @tparam T 辺の重みの型\\n */\\ntemplate <class T>\\nstruct Graph {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to(), _weight() {}\\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr T weight() const { return _weight; }\\n private:\\n int _from, _to;\\n T _weight;\\n };\\n public:\\n using edge_type = typename Graph<T>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\\n void add_edges(int from, int to, T weight = T(1)) {\\n edges[from].emplace_back(from, to, weight);\\n edges[to].emplace_back(to, from, weight);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edge(from - base, to - base, weight);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edges(from - base, to - base, weight);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\ntemplate <>\\nstruct Graph<void> {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to() {}\\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr int weight() const { return 1; }\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n private:\\n int _from, _to;\\n };\\n public:\\n using edge_type = typename Graph<void>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\\n void add_edges(int from, int to) {\\n edges[from].emplace_back(from, to);\\n edges[to].emplace_back(to, from);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edge(from - base, to - base);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edges(from - base, to - base);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\n#include <bit>\\n/// @brief スパーステーブル\\ntemplate <class M>\\nstruct sparse_table {\\n private:\\n using T = typename M::value_type;\\n public:\\n sparse_table() = default;\\n sparse_table(const std::vector<T> &v) : _size(v.size()), data() {\\n int b = std::max(1, std::countr_zero(std::bit_ceil<unsigned>(_size)));\\n data.emplace_back(v);\\n for (int i = 1; i < b; ++i) data.emplace_back(_size + 1 - (1 << i));\\n for (int i = 1; i < b; ++i) {\\n for (int j = 0; j + (1 << i) <= _size; ++j) {\\n data[i][j] = M::op(data[i - 1][j], data[i - 1][j + (1 << (i - 1))]);\\n }\\n }\\n }\\n T prod(int l, int r) const {\\n assert(0 <= l && l <= r && r <= _size);\\n if (l == r) return M::id();\\n if (l + 1 == r) return data[0][l];\\n int b = 31 - std::countl_zero<unsigned>(r - l - 1);\\n return M::op(data[b][l], data[b][r - (1 << b)]);\\n }\\n private:\\n int _size;\\n std::vector<std::vector<T>> data;\\n};\\nnamespace internal {\\ntemplate <class T, int N>\\nstruct fixed_stack {\\n constexpr fixed_stack() : _size(), _data() {}\\n constexpr T top() const { return _data[_size - 1]; }\\n constexpr bool empty() const { return _size == 0; }\\n constexpr int size() const { return _size; }\\n constexpr void emplace(const T &e) { _data[_size++] = e; }\\n constexpr void emplace(T &&e) { _data[_size++] = e; }\\n constexpr void pop() { --_size; }\\n constexpr void clear() { _size = 0; }\\n private:\\n int _size;\\n std::array<T, N> _data;\\n};\\n} // namespace internal\\n/**\\n * @brief 線形 Sparse Table\\n *\\n * @tparam M\\n */\\ntemplate <class M>\\nstruct linear_sparse_table {\\n private:\\n using T = M::value_type;\\n static constexpr int W = 64;\\n public:\\n linear_sparse_table() = default;\\n linear_sparse_table(const std::vector<T> &v) : _size(v.size()), data(v) {\\n int n = v.size();\\n int b = n / W;\\n internal::fixed_stack<int, W + 1> st;\\n std::vector<T> u(b);\\n word_data.resize(b + (n > b * W));\\n for (int i = 0; i < b; ++i) {\\n T m = M::id();\\n std::uint64_t bit = 0;\\n std::vector<std::uint64_t> bits(W);\\n for (int j = 0; j < W; ++j) {\\n m = M::op(m, v[i * W + j]);\\n while (!st.empty() && M::op(v[i * W + st.top()], v[i * W + j]) == v[i * W + j]) {\\n bit ^= std::uint64_t(1) << st.top();\\n st.pop();\\n }\\n bits[j] = bit;\\n bit |= std::uint64_t(1) << j;\\n st.emplace(j);\\n }\\n u[i] = m;\\n word_data[i] = bits;\\n st.clear();\\n }\\n if (n > b * W) {\\n std::uint64_t bit = 0;\\n std::vector<std::uint64_t> bits(n - b * W);\\n for (int j = 0; j < n - b * W; ++j) {\\n while (!st.empty() && M::op(v[b * W + st.top()], v[b * W + j]) == v[b * W + j]) {\\n bit ^= std::uint64_t(1) << st.top();\\n st.pop();\\n }\\n bits[j] = bit;\\n bit |= std::uint64_t(1) << j;\\n st.emplace(j);\\n }\\n word_data[b] = bits;\\n }\\n block_table = sparse_table<M>(u);\\n }\\n const T &operator[](int k) const { return data[k]; }\\n T prod(int l, int r) const {\\n assert(0 <= l && l < r && r <= _size);\\n int lb = (l + W - 1) / W, rb = r / W;\\n if (lb > rb) return word_prod(l, r);\\n T res = (lb == rb ? M::id() : block_table.prod(lb, rb));\\n if (l < lb * W) res = M::op(res, word_prod(l, lb * W));\\n if (rb * W < r) res = M::op(res, word_prod(rb * W, r));\\n return res;\\n }\\n private:\\n int _size;\\n std::vector<T> data;\\n sparse_table<M> block_table;\\n std::vector<std::vector<std::uint64_t>> word_data;\\n T word_prod(int l, int r) const {\\n if (l == r) return M::id();\\n int b = l / W;\\n int lw = l - b * W, rw = r - b * W;\\n if ((word_data[b][rw - 1] >> lw) == 0ul) return data[r - 1];\\n return data[l + std::countr_zero(word_data[b][rw - 1] >> lw)];\\n }\\n};\\nstruct linear_lca {\\n private:\\n struct S {\\n int depth, index;\\n bool operator<(const S &rhs) const { return depth < rhs.depth; }\\n bool operator==(const S &rhs) const = default;\\n };\\n struct M {\\n using value_type = S;\\n static constexpr S id() { return S{std::numeric_limits<int>::max(), -1}; }\\n static constexpr S op(const S &lhs, const S &rhs) { return std::min(lhs, rhs); }\\n };\\n public:\\n template <class T>\\n linear_lca(const Graph<T> &g, int r = 0) : ord(g.size(), -1), lst() {\\n std::vector<S> v;\\n std::stack<std::pair<int, int>> st;\\n st.emplace(r, 0);\\n while (!st.empty()) {\\n auto [x, d] = st.top();\\n st.pop();\\n if (x < 0) {\\n v.emplace_back(d, ~x);\\n continue;\\n }\\n ord[x] = v.size();\\n v.emplace_back(d, x);\\n for (auto e : g[x]) {\\n if (ord[e.to()] != -1) continue;\\n st.emplace(~x, d);\\n st.emplace(e.to(), d + 1);\\n }\\n }\\n lst = linear_sparse_table<M>(v);\\n }\\n int operator()(int u, int v) const { return lca(u, v); }\\n int lca(int u, int v) const {\\n auto [l, r] = std::minmax(ord[u], ord[v]);\\n return lst.prod(l, r + 1).index;\\n }\\n private:\\n std::vector<int> ord;\\n linear_sparse_table<M> lst;\\n};\\nint main(void) {\\n int n, q;\\n cin >> n >> q;\\n vector<int> a(n);\\n cin >> a;\\n coordinate_compression cps(a);\\n a = cps.compress(a);\\n Graph<void> g(n);\\n g.input_edges(n - 1);\\n vector<int> in(n), out(n), ord(n * 2), w(n * 2);\\n int c = 0;\\n auto dfs = [&](auto self, int x, int p) -> void {\\n in[x] = c;\\n w[c] = 1;\\n ord[c++] = a[x];\\n for (auto e : g[x]) {\\n if (e.to() == p)\\n continue;\\n self(self, e.to(), x);\\n }\\n w[c] = -1;\\n ord[c++] = a[x];\\n out[x] = c;\\n };\\n dfs(dfs, 0, -1);\\n linear_lca lca(g);\\n wavelet_matrix_rectangle_sum<int, int, 18> wm(ord, w);\\n while (q--) {\\n int u, v, k;\\n cin >> u >> v >> k;\\n --u, --v;\\n auto f = [&](int y) {\\n return wm.rect_sum(0, in[u] + 1, y) + wm.rect_sum(0, in[v] + 1, y) -\\n wm.rect_sum(0, in[lca(u, v)] + 1, y) - wm.rect_sum(0, in[lca(u, v)], y) <\\n k;\\n };\\n auto ans = meguru_binary_search(0, cps.size() + 1, f);\\n co(cps[ans]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 720,\n \"memory_kb\": 39676,\n \"score_of_the_acc\": -0.5227,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2270_10308710\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <cmath>\\n#include <cstdint>\\n#include <numeric>\\n/// @brief めぐる式二分探索\\ntemplate <class T, class F>\\nstd::int64_t meguru_binary_search(T ok, T ng, F check) {\\n while (std::abs(ok - ng) > 1) {\\n T mid = std::midpoint(ok, ng);\\n (check(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#include <algorithm>\\n#include <iterator>\\n#include <vector>\\n/// @brief 座標圧縮\\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 return std::distance(data.begin(), std::lower_bound(data.begin(), data.end(), x));\\n }\\n int lower_bound(T x) const {\\n return std::distance(data.begin(), std::lower_bound(data.begin(), data.end(), x));\\n }\\n int upper_bound(T x) const {\\n return std::distance(data.begin(), std::upper_bound(data.begin(), data.end(), x));\\n }\\n std::vector<int> compress(const std::vector<T> &v) const {\\n int n = v.size();\\n std::vector<int> res(n);\\n for (int i = 0; i < n; ++i) res[i] = get(v[i]);\\n return res;\\n }\\n int size() const { return data.size(); }\\n private:\\n std::vector<T> data;\\n};\\n/// @brief 座標圧縮\\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>\\n#include <tuple>\\nnamespace internal {\\n/**\\n * @brief 完備辞書\\n *\\n * @see https://ei1333.github.io/library/structure/wavelet/succinct-indexable-dictionary.hpp\\n */\\nstruct bit_vector {\\n bit_vector() = default;\\n bit_vector(unsigned int _length)\\n : length(_length), blocks((_length + 31) >> 5), bit((_length + 31) >> 5),\\n sum((_length + 31) >> 5) {}\\n void set(unsigned int k) { bit[k >> 5] |= 1U << (k & 31); }\\n void build() {\\n sum[0] = 0U;\\n for (unsigned int i = 1; i < blocks; ++i) {\\n sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);\\n }\\n }\\n bool operator[](unsigned int k) const { return bit[k >> 5] >> (k & 31) & 1; }\\n unsigned int rank(unsigned int k) const {\\n return sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1));\\n }\\n unsigned int rank(bool val, unsigned int k) const { return val ? rank(k) : k - rank(k); }\\n unsigned int select(unsigned int k) const {\\n unsigned int sl = 0, sr = blocks + 1;\\n while (sr - sl > 1) {\\n unsigned int m = (sl + sr) >> 1;\\n if (sum[m] < k) sl = m;\\n else sr = m;\\n }\\n k -= sum[sl];\\n unsigned int bl = 0, br = 32;\\n while (br - bl > 1) {\\n unsigned int m = (bl + br) >> 1;\\n if (__builtin_popcount(bit[sl] & ((1U << m) - 1)) < k) bl = m;\\n else br = m;\\n }\\n return (sl << 5) + bl;\\n }\\n private:\\n unsigned int length, blocks;\\n std::vector<unsigned int> bit, sum;\\n};\\n} // namespace internal\\n/// @brief 重み付きウェーブレット行列\\ntemplate <class T, class U = T, int L = 30>\\nstruct wavelet_matrix_rectangle_sum {\\n wavelet_matrix_rectangle_sum() = default;\\n template <class Value>\\n wavelet_matrix_rectangle_sum(const std::vector<T> &v, const std::vector<Value> &u)\\n : length(v.size()) {\\n assert(v.size() == u.size());\\n std::vector<int> l(length), r(length), ord(length);\\n std::iota(ord.begin(), ord.end(), 0);\\n for (int level = L - 1; level >= 0; level--) {\\n matrix[level] = internal::bit_vector(length + 1);\\n int left = 0, right = 0;\\n for (int i = 0; i < length; i++) {\\n if ((v[ord[i]] >> level) & 1) {\\n matrix[level].set(i);\\n r[right++] = ord[i];\\n } else {\\n l[left++] = ord[i];\\n }\\n }\\n mid[level] = left;\\n matrix[level].build();\\n ord.swap(l);\\n for (int i = 0; i < right; i++) ord[left + i] = r[i];\\n cs[level].resize(length + 1);\\n cs[level][0] = U(0);\\n for (int i = 0; i < length; i++) cs[level][i + 1] = cs[level][i] + u[ord[i]];\\n }\\n }\\n U kth_smallest_sum(int l, int r, int k) const {\\n assert(0 <= k && k <= r - l);\\n T val = T();\\n U res = U();\\n for (int level = L - 1; level >= 0; --level) {\\n int cnt = matrix[level].rank(false, r) - matrix[level].rank(false, l);\\n bool f = cnt <= k;\\n if (f) {\\n val |= T(1) << level;\\n res += cs[level][matrix[level].rank(false, r)] -\\n cs[level][matrix[level].rank(false, l)];\\n k -= cnt;\\n }\\n std::tie(l, r) = succ(f, l, r, level);\\n }\\n return res + val * k;\\n }\\n U kth_largest_sum(int l, int r, int k) const {\\n return cs[L - 1][matrix[L - 1].rank(false, r)] + cs[L - 1][matrix[L - 1].rank(true, r)] -\\n cs[L - 1][matrix[L - 1].rank(false, l)] - cs[L - 1][matrix[L - 1].rank(true, l)] -\\n kth_smallest_sum(l, r, r - l - k);\\n }\\n U range_sum(int r, T x) const { return range_sum(0, r, x); }\\n U range_sum(int l, int r, T x) const {\\n for (int level = L - 1; level >= 0; level--)\\n std::tie(l, r) = succ((x >> level) & 1, l, r, level);\\n return cs[0][matrix[0].rank(false, r)] - cs[0][matrix[0].rank(false, l)];\\n }\\n U rect_sum(int l, int r, T upper) const {\\n U res = 0;\\n for (int level = L - 1; level >= 0; level--) {\\n bool f = (upper >> level) & 1;\\n if (f)\\n res += cs[level][matrix[level].rank(false, r)] -\\n cs[level][matrix[level].rank(false, l)];\\n std::tie(l, r) = succ(f, l, r, level);\\n }\\n return res;\\n }\\n U rect_sum(int l, int r, T lower, T upper) const {\\n return rect_sum(l, r, upper) - rect_sum(l, r, lower);\\n }\\n private:\\n int length;\\n internal::bit_vector matrix[L];\\n int mid[L];\\n std::vector<U> cs[L];\\n std::pair<int, int> succ(bool f, int l, int r, int level) const {\\n return {matrix[level].rank(f, l) + mid[level] * f,\\n matrix[level].rank(f, r) + mid[level] * f};\\n }\\n};\\n#include <iostream>\\n/**\\n * @brief 重み付きグラフ\\n *\\n * @tparam T 辺の重みの型\\n */\\ntemplate <class T>\\nstruct Graph {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to(), _weight() {}\\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr T weight() const { return _weight; }\\n private:\\n int _from, _to;\\n T _weight;\\n };\\n public:\\n using edge_type = typename Graph<T>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\\n void add_edges(int from, int to, T weight = T(1)) {\\n edges[from].emplace_back(from, to, weight);\\n edges[to].emplace_back(to, from, weight);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edge(from - base, to - base, weight);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edges(from - base, to - base, weight);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\ntemplate <>\\nstruct Graph<void> {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to() {}\\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr int weight() const { return 1; }\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n private:\\n int _from, _to;\\n };\\n public:\\n using edge_type = typename Graph<void>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\\n void add_edges(int from, int to) {\\n edges[from].emplace_back(from, to);\\n edges[to].emplace_back(to, from);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edge(from - base, to - base);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edges(from - base, to - base);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\n#include <bit>\\n/// @brief スパーステーブル\\ntemplate <class M>\\nstruct sparse_table {\\n private:\\n using T = typename M::value_type;\\n public:\\n sparse_table() = default;\\n sparse_table(const std::vector<T> &v) : _size(v.size()), data() {\\n int b = std::max(1, std::countr_zero(std::bit_ceil<unsigned>(_size)));\\n data.emplace_back(v);\\n for (int i = 1; i < b; ++i) data.emplace_back(_size + 1 - (1 << i));\\n for (int i = 1; i < b; ++i) {\\n for (int j = 0; j + (1 << i) <= _size; ++j) {\\n data[i][j] = M::op(data[i - 1][j], data[i - 1][j + (1 << (i - 1))]);\\n }\\n }\\n }\\n T prod(int l, int r) const {\\n assert(0 <= l && l <= r && r <= _size);\\n if (l == r) return M::id();\\n if (l + 1 == r) return data[0][l];\\n int b = 31 - std::countl_zero<unsigned>(r - l - 1);\\n return M::op(data[b][l], data[b][r - (1 << b)]);\\n }\\n private:\\n int _size;\\n std::vector<std::vector<T>> data;\\n};\\nnamespace internal {\\ntemplate <class T, int N>\\nstruct fixed_stack {\\n constexpr fixed_stack() : _size(), _data() {}\\n constexpr T top() const { return _data[_size - 1]; }\\n constexpr bool empty() const { return _size == 0; }\\n constexpr int size() const { return _size; }\\n constexpr void emplace(const T &e) { _data[_size++] = e; }\\n constexpr void emplace(T &&e) { _data[_size++] = e; }\\n constexpr void pop() { --_size; }\\n constexpr void clear() { _size = 0; }\\n private:\\n int _size;\\n std::array<T, N> _data;\\n};\\n} // namespace internal\\n/**\\n * @brief 線形 Sparse Table\\n *\\n * @tparam M\\n */\\ntemplate <class M>\\nstruct linear_sparse_table {\\n private:\\n using T = M::value_type;\\n static constexpr int W = 64;\\n public:\\n linear_sparse_table() = default;\\n linear_sparse_table(const std::vector<T> &v) : _size(v.size()), data(v) {\\n int n = v.size();\\n int b = n / W;\\n internal::fixed_stack<int, W + 1> st;\\n std::vector<T> u(b);\\n word_data.resize(b + (n > b * W));\\n for (int i = 0; i < b; ++i) {\\n T m = M::id();\\n std::uint64_t bit = 0;\\n std::vector<std::uint64_t> bits(W);\\n for (int j = 0; j < W; ++j) {\\n m = M::op(m, v[i * W + j]);\\n while (!st.empty() && M::op(v[i * W + st.top()], v[i * W + j]) == v[i * W + j]) {\\n bit ^= std::uint64_t(1) << st.top();\\n st.pop();\\n }\\n bits[j] = bit;\\n bit |= std::uint64_t(1) << j;\\n st.emplace(j);\\n }\\n u[i] = m;\\n word_data[i] = bits;\\n st.clear();\\n }\\n if (n > b * W) {\\n std::uint64_t bit = 0;\\n std::vector<std::uint64_t> bits(n - b * W);\\n for (int j = 0; j < n - b * W; ++j) {\\n while (!st.empty() && M::op(v[b * W + st.top()], v[b * W + j]) == v[b * W + j]) {\\n bit ^= std::uint64_t(1) << st.top();\\n st.pop();\\n }\\n bits[j] = bit;\\n bit |= std::uint64_t(1) << j;\\n st.emplace(j);\\n }\\n word_data[b] = bits;\\n }\\n block_table = sparse_table<M>(u);\\n }\\n const T &operator[](int k) const { return data[k]; }\\n T prod(int l, int r) const {\\n assert(0 <= l && l < r && r <= _size);\\n int lb = (l + W - 1) / W, rb = r / W;\\n if (lb > rb) return word_prod(l, r);\\n T res = (lb == rb ? M::id() : block_table.prod(lb, rb));\\n if (l < lb * W) res = M::op(res, word_prod(l, lb * W));\\n if (rb * W < r) res = M::op(res, word_prod(rb * W, r));\\n return res;\\n }\\n private:\\n int _size;\\n std::vector<T> data;\\n sparse_table<M> block_table;\\n std::vector<std::vector<std::uint64_t>> word_data;\\n T word_prod(int l, int r) const {\\n if (l == r) return M::id();\\n int b = l / W;\\n int lw = l - b * W, rw = r - b * W;\\n if ((word_data[b][rw - 1] >> lw) == 0ul) return data[r - 1];\\n return data[l + std::countr_zero(word_data[b][rw - 1] >> lw)];\\n }\\n};\\nstruct linear_lca {\\n private:\\n struct S {\\n int depth, index;\\n bool operator<(const S &rhs) const { return depth < rhs.depth; }\\n bool operator==(const S &rhs) const = default;\\n };\\n struct M {\\n using value_type = S;\\n static constexpr S id() { return S{std::numeric_limits<int>::max(), -1}; }\\n static constexpr S op(const S &lhs, const S &rhs) { return std::min(lhs, rhs); }\\n };\\n public:\\n template <class T>\\n linear_lca(const Graph<T> &g, int r = 0) : ord(g.size(), -1), lst() {\\n std::vector<S> v;\\n std::stack<std::pair<int, int>> st;\\n st.emplace(r, 0);\\n while (!st.empty()) {\\n auto [x, d] = st.top();\\n st.pop();\\n if (x < 0) {\\n v.emplace_back(d, ~x);\\n continue;\\n }\\n ord[x] = v.size();\\n v.emplace_back(d, x);\\n for (auto e : g[x]) {\\n if (ord[e.to()] != -1) continue;\\n st.emplace(~x, d);\\n st.emplace(e.to(), d + 1);\\n }\\n }\\n lst = linear_sparse_table<M>(v);\\n }\\n int operator()(int u, int v) const { return lca(u, v); }\\n int lca(int u, int v) const {\\n auto [l, r] = std::minmax(ord[u], ord[v]);\\n return lst.prod(l, r + 1).index;\\n }\\n private:\\n std::vector<int> ord;\\n linear_sparse_table<M> lst;\\n};\\nint main(void) {\\n int n, q;\\n cin >> n >> q;\\n vector<int> a(n);\\n cin >> a;\\n coordinate_compression cps(a);\\n a = cps.compress(a);\\n Graph<void> g(n);\\n g.input_edges(n - 1);\\n vector<int> in(n), out(n), ord(n * 2), w(n * 2);\\n int c = 0;\\n auto dfs = [&](auto self, int x, int p) -> void {\\n in[x] = c;\\n w[c] = 1;\\n ord[c++] = a[x];\\n for (auto e : g[x]) {\\n if (e.to() == p)\\n continue;\\n self(self, e.to(), x);\\n }\\n w[c] = -1;\\n ord[c++] = a[x];\\n out[x] = c;\\n };\\n dfs(dfs, 0, -1);\\n linear_lca lca(g);\\n wavelet_matrix_rectangle_sum wm(ord, w);\\n while (q--) {\\n int u, v, k;\\n cin >> u >> v >> k;\\n --u, --v;\\n auto f = [&](int y) {\\n return wm.rect_sum(0, in[u] + 1, y) + wm.rect_sum(0, in[v] + 1, y) -\\n wm.rect_sum(0, in[lca(u, v)] + 1, y) - wm.rect_sum(0, in[lca(u, v)], y) <\\n k;\\n };\\n auto ans = meguru_binary_search(0, cps.size() + 1, f);\\n co(cps[ans]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1250,\n \"memory_kb\": 49536,\n \"score_of_the_acc\": -0.7853,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2270_10308644\",\n \"code_snippet\": \"// competitive-verifier: PROBLEM\\n#include <cmath>\\n#include <cstdint>\\n#include <numeric>\\n/// @brief めぐる式二分探索\\ntemplate <class T, class F>\\nstd::int64_t meguru_binary_search(T ok, T ng, F check) {\\n while (std::abs(ok - ng) > 1) {\\n T mid = std::midpoint(ok, ng);\\n (check(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#include <cassert>\\n#include <tuple>\\n#include <vector>\\nnamespace internal {\\n/**\\n * @brief 完備辞書\\n *\\n * @see https://ei1333.github.io/library/structure/wavelet/succinct-indexable-dictionary.hpp\\n */\\nstruct bit_vector {\\n bit_vector() = default;\\n bit_vector(unsigned int _length)\\n : length(_length), blocks((_length + 31) >> 5), bit((_length + 31) >> 5),\\n sum((_length + 31) >> 5) {}\\n void set(unsigned int k) { bit[k >> 5] |= 1U << (k & 31); }\\n void build() {\\n sum[0] = 0U;\\n for (unsigned int i = 1; i < blocks; ++i) {\\n sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);\\n }\\n }\\n bool operator[](unsigned int k) const { return bit[k >> 5] >> (k & 31) & 1; }\\n unsigned int rank(unsigned int k) const {\\n return sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1));\\n }\\n unsigned int rank(bool val, unsigned int k) const { return val ? rank(k) : k - rank(k); }\\n unsigned int select(unsigned int k) const {\\n unsigned int sl = 0, sr = blocks + 1;\\n while (sr - sl > 1) {\\n unsigned int m = (sl + sr) >> 1;\\n if (sum[m] < k) sl = m;\\n else sr = m;\\n }\\n k -= sum[sl];\\n unsigned int bl = 0, br = 32;\\n while (br - bl > 1) {\\n unsigned int m = (bl + br) >> 1;\\n if (__builtin_popcount(bit[sl] & ((1U << m) - 1)) < k) bl = m;\\n else br = m;\\n }\\n return (sl << 5) + bl;\\n }\\n private:\\n unsigned int length, blocks;\\n std::vector<unsigned int> bit, sum;\\n};\\n} // namespace internal\\n/// @brief 重み付きウェーブレット行列\\ntemplate <class T, class U = T, int L = 30>\\nstruct wavelet_matrix_rectangle_sum {\\n wavelet_matrix_rectangle_sum() = default;\\n template <class Value>\\n wavelet_matrix_rectangle_sum(const std::vector<T> &v, const std::vector<Value> &u)\\n : length(v.size()) {\\n assert(v.size() == u.size());\\n std::vector<int> l(length), r(length), ord(length);\\n std::iota(ord.begin(), ord.end(), 0);\\n for (int level = L - 1; level >= 0; level--) {\\n matrix[level] = internal::bit_vector(length + 1);\\n int left = 0, right = 0;\\n for (int i = 0; i < length; i++) {\\n if ((v[ord[i]] >> level) & 1) {\\n matrix[level].set(i);\\n r[right++] = ord[i];\\n } else {\\n l[left++] = ord[i];\\n }\\n }\\n mid[level] = left;\\n matrix[level].build();\\n ord.swap(l);\\n for (int i = 0; i < right; i++) ord[left + i] = r[i];\\n cs[level].resize(length + 1);\\n cs[level][0] = U(0);\\n for (int i = 0; i < length; i++) cs[level][i + 1] = cs[level][i] + u[ord[i]];\\n }\\n }\\n U kth_smallest_sum(int l, int r, int k) const {\\n assert(0 <= k && k <= r - l);\\n T val = T();\\n U res = U();\\n for (int level = L - 1; level >= 0; --level) {\\n int cnt = matrix[level].rank(false, r) - matrix[level].rank(false, l);\\n bool f = cnt <= k;\\n if (f) {\\n val |= T(1) << level;\\n res += cs[level][matrix[level].rank(false, r)] -\\n cs[level][matrix[level].rank(false, l)];\\n k -= cnt;\\n }\\n std::tie(l, r) = succ(f, l, r, level);\\n }\\n return res + val * k;\\n }\\n U kth_largest_sum(int l, int r, int k) const {\\n return cs[L - 1][matrix[L - 1].rank(false, r)] + cs[L - 1][matrix[L - 1].rank(true, r)] -\\n cs[L - 1][matrix[L - 1].rank(false, l)] - cs[L - 1][matrix[L - 1].rank(true, l)] -\\n kth_smallest_sum(l, r, r - l - k);\\n }\\n U range_sum(int r, T x) const { return range_sum(0, r, x); }\\n U range_sum(int l, int r, T x) const {\\n for (int level = L - 1; level >= 0; level--)\\n std::tie(l, r) = succ((x >> level) & 1, l, r, level);\\n return cs[0][matrix[0].rank(false, r)] - cs[0][matrix[0].rank(false, l)];\\n }\\n U rect_sum(int l, int r, T upper) const {\\n U res = 0;\\n for (int level = L - 1; level >= 0; level--) {\\n bool f = (upper >> level) & 1;\\n if (f)\\n res += cs[level][matrix[level].rank(false, r)] -\\n cs[level][matrix[level].rank(false, l)];\\n std::tie(l, r) = succ(f, l, r, level);\\n }\\n return res;\\n }\\n U rect_sum(int l, int r, T lower, T upper) const {\\n return rect_sum(l, r, upper) - rect_sum(l, r, lower);\\n }\\n private:\\n int length;\\n internal::bit_vector matrix[L];\\n int mid[L];\\n std::vector<U> cs[L];\\n std::pair<int, int> succ(bool f, int l, int r, int level) const {\\n return {matrix[level].rank(f, l) + mid[level] * f,\\n matrix[level].rank(f, r) + mid[level] * f};\\n }\\n};\\n#include <iostream>\\n/**\\n * @brief 重み付きグラフ\\n *\\n * @tparam T 辺の重みの型\\n */\\ntemplate <class T>\\nstruct Graph {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to(), _weight() {}\\n constexpr _edge(int from, int to, T weight) : _from(from), _to(to), _weight(weight) {}\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr T weight() const { return _weight; }\\n private:\\n int _from, _to;\\n T _weight;\\n };\\n public:\\n using edge_type = typename Graph<T>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to, T weight = T(1)) { edges[from].emplace_back(from, to, weight); }\\n void add_edges(int from, int to, T weight = T(1)) {\\n edges[from].emplace_back(from, to, weight);\\n edges[to].emplace_back(to, from, weight);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edge(from - base, to - base, weight);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n T weight;\\n std::cin >> from >> to >> weight;\\n add_edges(from - base, to - base, weight);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\ntemplate <>\\nstruct Graph<void> {\\n private:\\n struct _edge {\\n constexpr _edge() : _from(), _to() {}\\n constexpr _edge(int from, int to) : _from(from), _to(to) {}\\n constexpr int from() const { return _from; }\\n constexpr int to() const { return _to; }\\n constexpr int weight() const { return 1; }\\n constexpr bool operator<(const _edge &rhs) const { return weight() < rhs.weight(); }\\n constexpr bool operator>(const _edge &rhs) const { return rhs < *this; }\\n private:\\n int _from, _to;\\n };\\n public:\\n using edge_type = typename Graph<void>::_edge;\\n Graph() : _size(), edges() {}\\n Graph(int v) : _size(v), edges(v) {}\\n const auto &operator[](int i) const { return edges[i]; }\\n auto &operator[](int i) { return edges[i]; }\\n const auto begin() const { return edges.begin(); }\\n auto begin() { return edges.begin(); }\\n const auto end() const { return edges.end(); }\\n auto end() { return edges.end(); }\\n constexpr int size() const { return _size; }\\n void add_edge(const edge_type &e) { edges[e.from()].emplace_back(e); }\\n void add_edge(int from, int to) { edges[from].emplace_back(from, to); }\\n void add_edges(int from, int to) {\\n edges[from].emplace_back(from, to);\\n edges[to].emplace_back(to, from);\\n }\\n void input_edge(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edge(from - base, to - base);\\n }\\n }\\n void input_edges(int m, int base = 1) {\\n for (int i = 0; i < m; ++i) {\\n int from, to;\\n std::cin >> from >> to;\\n add_edges(from - base, to - base);\\n }\\n }\\n private:\\n int _size;\\n std::vector<std::vector<edge_type>> edges;\\n};\\n#ifdef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\\\")\\n#endif\\n#pragma GCC optimize(\\\"Ofast,fast-math,unroll-all-loops\\\")\\n#include <bits/stdc++.h>\\n#ifndef ATCODER\\n#pragma GCC target(\\\"sse4.2,avx2,bmi2\\\")\\n#endif\\ntemplate <class T, class U>\\nconstexpr bool chmax(T &a, const U &b) {\\n return a < (T)b ? a = (T)b, true : false;\\n}\\ntemplate <class T, class U>\\nconstexpr bool chmin(T &a, const U &b) {\\n return (T)b < a ? a = (T)b, true : false;\\n}\\nconstexpr std::int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr double EPS = 1e-7;\\nconstexpr double PI = 3.14159265358979323846;\\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\\n#define rep(i, n) FOR (i, 0, n)\\n#define repn(i, n) FOR (i, 1, n + 1)\\n#define repr(i, n) FORR (i, n, 0)\\n#define repnr(i, n) FORR (i, n + 1, 1)\\n#define all(s) (s).begin(), (s).end()\\nstruct Sonic {\\n Sonic() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(20);\\n }\\n constexpr void operator()() const {}\\n} sonic;\\nusing namespace std;\\nusing ll = std::int64_t;\\nusing ld = long double;\\ntemplate <class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\\n for (T &i : v) is >> i;\\n return is;\\n}\\ntemplate <class T, class U>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\\n return os << '(' << p.first << ',' << p.second << ')';\\n}\\ntemplate <class T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\\n for (auto it = v.begin(); it != v.end(); ++it) os << (it == v.begin() ? \\\"\\\" : \\\" \\\") << *it;\\n return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\\\n';\\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\\n}\\ntemplate <class Head, class... Tail>\\nvoid ce(Head &&head, Tail &&...tail) {\\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\\\n';\\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\\n}\\nvoid Yes(bool is_correct = true) { std::cout << (is_correct ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\nvoid No(bool is_not_correct = true) { Yes(!is_not_correct); }\\nvoid YES(bool is_correct = true) { std::cout << (is_correct ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\nvoid NO(bool is_not_correct = true) { YES(!is_not_correct); }\\nvoid Takahashi(bool is_correct = true) { std::cout << (is_correct ? \\\"Takahashi\\\" : \\\"Aoki\\\") << '\\\\n'; }\\nvoid Aoki(bool is_not_correct = true) { Takahashi(!is_not_correct); }\\n#include <bit>\\n/// @brief スパーステーブル\\ntemplate <class M>\\nstruct sparse_table {\\n private:\\n using T = typename M::value_type;\\n public:\\n sparse_table() = default;\\n sparse_table(const std::vector<T> &v) : _size(v.size()), data() {\\n int b = std::max(1, std::countr_zero(std::bit_ceil<unsigned>(_size)));\\n data.emplace_back(v);\\n for (int i = 1; i < b; ++i) data.emplace_back(_size + 1 - (1 << i));\\n for (int i = 1; i < b; ++i) {\\n for (int j = 0; j + (1 << i) <= _size; ++j) {\\n data[i][j] = M::op(data[i - 1][j], data[i - 1][j + (1 << (i - 1))]);\\n }\\n }\\n }\\n T prod(int l, int r) const {\\n assert(0 <= l && l <= r && r <= _size);\\n if (l == r) return M::id();\\n if (l + 1 == r) return data[0][l];\\n int b = 31 - std::countl_zero<unsigned>(r - l - 1);\\n return M::op(data[b][l], data[b][r - (1 << b)]);\\n }\\n private:\\n int _size;\\n std::vector<std::vector<T>> data;\\n};\\nnamespace internal {\\ntemplate <class T, int N>\\nstruct fixed_stack {\\n constexpr fixed_stack() : _size(), _data() {}\\n constexpr T top() const { return _data[_size - 1]; }\\n constexpr bool empty() const { return _size == 0; }\\n constexpr int size() const { return _size; }\\n constexpr void emplace(const T &e) { _data[_size++] = e; }\\n constexpr void emplace(T &&e) { _data[_size++] = e; }\\n constexpr void pop() { --_size; }\\n constexpr void clear() { _size = 0; }\\n private:\\n int _size;\\n std::array<T, N> _data;\\n};\\n} // namespace internal\\n/**\\n * @brief 線形 Sparse Table\\n *\\n * @tparam M\\n */\\ntemplate <class M>\\nstruct linear_sparse_table {\\n private:\\n using T = M::value_type;\\n static constexpr int W = 64;\\n public:\\n linear_sparse_table() = default;\\n linear_sparse_table(const std::vector<T> &v) : _size(v.size()), data(v) {\\n int n = v.size();\\n int b = n / W;\\n internal::fixed_stack<int, W + 1> st;\\n std::vector<T> u(b);\\n word_data.resize(b + (n > b * W));\\n for (int i = 0; i < b; ++i) {\\n T m = M::id();\\n std::uint64_t bit = 0;\\n std::vector<std::uint64_t> bits(W);\\n for (int j = 0; j < W; ++j) {\\n m = M::op(m, v[i * W + j]);\\n while (!st.empty() && M::op(v[i * W + st.top()], v[i * W + j]) == v[i * W + j]) {\\n bit ^= std::uint64_t(1) << st.top();\\n st.pop();\\n }\\n bits[j] = bit;\\n bit |= std::uint64_t(1) << j;\\n st.emplace(j);\\n }\\n u[i] = m;\\n word_data[i] = bits;\\n st.clear();\\n }\\n if (n > b * W) {\\n std::uint64_t bit = 0;\\n std::vector<std::uint64_t> bits(n - b * W);\\n for (int j = 0; j < n - b * W; ++j) {\\n while (!st.empty() && M::op(v[b * W + st.top()], v[b * W + j]) == v[b * W + j]) {\\n bit ^= std::uint64_t(1) << st.top();\\n st.pop();\\n }\\n bits[j] = bit;\\n bit |= std::uint64_t(1) << j;\\n st.emplace(j);\\n }\\n word_data[b] = bits;\\n }\\n block_table = sparse_table<M>(u);\\n }\\n const T &operator[](int k) const { return data[k]; }\\n T prod(int l, int r) const {\\n assert(0 <= l && l < r && r <= _size);\\n int lb = (l + W - 1) / W, rb = r / W;\\n if (lb > rb) return word_prod(l, r);\\n T res = (lb == rb ? M::id() : block_table.prod(lb, rb));\\n if (l < lb * W) res = M::op(res, word_prod(l, lb * W));\\n if (rb * W < r) res = M::op(res, word_prod(rb * W, r));\\n return res;\\n }\\n private:\\n int _size;\\n std::vector<T> data;\\n sparse_table<M> block_table;\\n std::vector<std::vector<std::uint64_t>> word_data;\\n T word_prod(int l, int r) const {\\n if (l == r) return M::id();\\n int b = l / W;\\n int lw = l - b * W, rw = r - b * W;\\n if ((word_data[b][rw - 1] >> lw) == 0ul) return data[r - 1];\\n return data[l + std::countr_zero(word_data[b][rw - 1] >> lw)];\\n }\\n};\\nstruct linear_lca {\\n private:\\n struct S {\\n int depth, index;\\n bool operator<(const S &rhs) const { return depth < rhs.depth; }\\n bool operator==(const S &rhs) const = default;\\n };\\n struct M {\\n using value_type = S;\\n static constexpr S id() { return S{std::numeric_limits<int>::max(), -1}; }\\n static constexpr S op(const S &lhs, const S &rhs) { return std::min(lhs, rhs); }\\n };\\n public:\\n template <class T>\\n linear_lca(const Graph<T> &g, int r = 0) : ord(g.size(), -1), lst() {\\n std::vector<S> v;\\n std::stack<std::pair<int, int>> st;\\n st.emplace(r, 0);\\n while (!st.empty()) {\\n auto [x, d] = st.top();\\n st.pop();\\n if (x < 0) {\\n v.emplace_back(d, ~x);\\n continue;\\n }\\n ord[x] = v.size();\\n v.emplace_back(d, x);\\n for (auto e : g[x]) {\\n if (ord[e.to()] != -1) continue;\\n st.emplace(~x, d);\\n st.emplace(e.to(), d + 1);\\n }\\n }\\n lst = linear_sparse_table<M>(v);\\n }\\n int operator()(int u, int v) const { return lca(u, v); }\\n int lca(int u, int v) const {\\n auto [l, r] = std::minmax(ord[u], ord[v]);\\n return lst.prod(l, r + 1).index;\\n }\\n private:\\n std::vector<int> ord;\\n linear_sparse_table<M> lst;\\n};\\nint main(void) {\\n int n, q;\\n cin >> n >> q;\\n vector<int> a(n);\\n cin >> a;\\n Graph<void> g(n);\\n g.input_edges(n - 1);\\n vector<int> in(n), out(n), ord(n * 2), w(n * 2);\\n int c = 0;\\n auto dfs = [&](auto self, int x, int p) -> void {\\n in[x] = c;\\n w[c] = 1;\\n ord[c++] = a[x];\\n for (auto e : g[x]) {\\n if (e.to() == p)\\n continue;\\n self(self, e.to(), x);\\n }\\n w[c] = -1;\\n ord[c++] = a[x];\\n out[x] = c;\\n };\\n dfs(dfs, 0, -1);\\n linear_lca lca(g);\\n wavelet_matrix_rectangle_sum wm(ord, w);\\n while (q--) {\\n int u, v, k;\\n cin >> u >> v >> k;\\n --u, --v;\\n auto f = [&](int y) {\\n return wm.rect_sum(0, in[u] + 1, y) + wm.rect_sum(0, in[v] + 1, y) -\\n wm.rect_sum(0, in[lca(u, v)] + 1, y) - wm.rect_sum(0, in[lca(u, v)], y) <\\n k;\\n };\\n auto ans = meguru_binary_search(0, *max_element(all(a)) + 1, f);\\n co(ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2810,\n \"memory_kb\": 49140,\n \"score_of_the_acc\": -1.3395,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2270_10307727\",\n \"code_snippet\": \"// AOJ #2270 The L-th Number\\n// 2025.3.17\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() { // 整数の入力\\n\\tint n = 0; int c = gc();\\n\\tif (c == '-') {\\tc = gc();\\n\\t\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\t\\treturn -n;\\n\\t}\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nvoid Cout(int n) { // 整数の表示（出力）\\n\\tchar b[30];\\n\\tif (!n) pc('0');\\n\\telse {\\n\\t\\tif (n < 0) pc('-'), n = -n;\\n\\t\\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\\n\\t\\twhile (i--) pc(b[i]);\\n\\t}\\n\\tpc('\\\\n');\\n}\\n\\nstruct Node { int value, left, right; };\\nconst int MAXN = 100005;\\nNode segTree[MAXN * 20];\\nint segRoot[MAXN];\\nint segTreeCount = 0;\\n\\nint modify(int lBound, int rBound, int pos, int previousNode) {\\n int currentNode = ++segTreeCount;\\n segTree[currentNode] = segTree[previousNode];\\n segTree[currentNode].value++;\\n\\n if (lBound == rBound) return currentNode;\\n\\n int mid = (lBound + rBound) >> 1;\\n if (pos <= mid) {\\n segTree[currentNode].left = modify(lBound, mid, pos, segTree[previousNode].left);\\n } else {\\n segTree[currentNode].right = modify(mid + 1, rBound, pos, segTree[previousNode].right);\\n }\\n return currentNode;\\n}\\n\\nint query(int lBound, int rBound, int kth, int nodeU, int nodeV, int nodeLCA, int nodeParentLCA) {\\n if (lBound == rBound) return lBound;\\n int mid = (lBound + rBound) >> 1;\\n int countLeft = segTree[segTree[nodeU].left].value\\n + segTree[segTree[nodeV].left].value\\n - segTree[segTree[nodeLCA].left].value\\n - segTree[segTree[nodeParentLCA].left].value;\\n if (kth <= countLeft)\\n return query(lBound, mid, kth,\\n segTree[nodeU].left, segTree[nodeV].left,\\n segTree[nodeLCA].left, segTree[nodeParentLCA].left);\\n else return query(mid + 1, rBound, kth - countLeft,\\n segTree[nodeU].right, segTree[nodeV].right,\\n segTree[nodeLCA].right, segTree[nodeParentLCA].right);\\n}\\n\\nint totEdges = 0;\\nint head[MAXN], to[MAXN << 1], nxt[MAXN << 1];\\n\\nvoid addEdge(int u, int v) {\\n to[++totEdges] = v;\\n nxt[totEdges] = head[u];\\n head[u] = totEdges;\\n}\\n\\nint totDFS = 0;\\nint parent[MAXN], depth[MAXN], top[MAXN], subTreeSize[MAXN], id[MAXN], heavySon[MAXN];\\nint n, q, totValues;\\nint value[MAXN], sortedValues[MAXN];\\n\\nvoid dfs1(int u) {\\n subTreeSize[u] = 0;\\n for (int edge = head[u]; edge; edge = nxt[edge]) {\\n int v = to[edge];\\n if (v == parent[u]) continue;\\n parent[v] = u;\\n depth[v] = depth[u] + 1;\\n dfs1(v);\\n subTreeSize[u] += subTreeSize[v];\\n if (subTreeSize[v] > subTreeSize[heavySon[u]]) heavySon[u] = v;\\n }\\n subTreeSize[u]++;\\n}\\n\\nvoid dfs2(int u, int topNode) {\\n segRoot[u] = modify(1, totValues, value[u], segRoot[parent[u]]);\\n id[u] = ++totDFS;\\n top[u] = topNode;\\n if (heavySon[u]) dfs2(heavySon[u], topNode);\\n for (int edge = head[u]; edge; edge = nxt[edge]) {\\n int v = to[edge];\\n if (v == parent[u] || v == heavySon[u]) continue;\\n dfs2(v, v);\\n }\\n}\\n\\nint lca(int u, int v) {\\n while (top[u] != top[v]) {\\n if (depth[top[u]] < depth[top[v]]) swap(u, v);\\n u = parent[top[u]];\\n }\\n return depth[u] < depth[v] ? u : v;\\n}\\n\\nint main() {\\n n = Cin(), q = Cin();\\n\\n for (int i = 1; i <= n; i++) sortedValues[i] = value[i] = Cin();\\n\\n for (int i = 2; i <= n; i++) {\\n int u = Cin(), v = Cin();\\n addEdge(u, v);\\n addEdge(v, u);\\n }\\n\\n sort(sortedValues + 1, sortedValues + n + 1);\\n totValues = unique(sortedValues + 1, sortedValues + n + 1) - (sortedValues + 1);\\n for (int i = 1; i <= n; i++)\\n value[i] = lower_bound(sortedValues + 1, sortedValues + totValues + 1, value[i]) - sortedValues;\\n\\n depth[1] = 1;\\n dfs1(1);\\n dfs2(1, 1);\\n\\n while (q--) {\\n int u = Cin(), v = Cin(), kth = Cin();\\n int commonAncestor = lca(u, v);\\n int index = query(1, totValues, kth, segRoot[u], segRoot[v],\\n segRoot[commonAncestor], segRoot[parent[commonAncestor]]);\\n Cout(sortedValues[index]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 32800,\n \"score_of_the_acc\": -0.2466,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2270_9667715\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\n#endif\\nusing ll=long long;\\nusing ull=unsigned long long;\\nusing P=pair<ll,ll>;\\ntemplate<typename T>using minque=priority_queue<T,vector<T>,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 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 reps(i,a,n) for(int i=(a);i<int(n);i++)\\n#define rep(i,n) reps(i,0,n)\\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)\\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#else\\n#define debug(...) static_cast<void>(0)\\n#define debugg(...) static_cast<void>(0)\\ntemplate<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}\\n#endif\\nvoid SOLVE();\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout<<fixed<<setprecision(16);\\n #ifdef LOCAL\\n clock_t start=clock();\\n #endif\\n int testcase=1;\\n //cin>>testcase;\\n for(int i=0;i<testcase;i++){\\n SOLVE();\\n }\\n #ifdef LOCAL\\n cerr<<\\\"time:\\\";\\n cerr<<(clock()-start)/1000;\\n cerr<<\\\"ms\\\\n\\\";\\n #endif\\n}\\nusing namespace std;\\nstruct UnionFind{\\nprivate:\\n vector<int>par;\\n int cs;\\npublic:\\n UnionFind(int n):par(n,-1),cs(n){}\\n UnionFind(){}\\n int root(int u){\\n if(par[u]<0)return u;\\n return par[u]=root(par[u]);\\n }\\n bool merge(int u,int v){\\n int ru=root(u),rv=root(v);\\n if(ru==rv)return false;\\n if(par[ru]<par[rv])swap(ru,rv);\\n par[rv]+=par[ru];\\n par[ru]=rv;\\n cs--;\\n return true;\\n }\\n bool same(int u,int v){return root(u)==root(v);}\\n int size(int u=-1){return u==-1?cs:-par[root(u)];}\\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 ostream &operator<<(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};\\nusing namespace std;\\ntemplate<typename T=int>\\nstruct Tree{\\nprivate:\\n int n;\\n vector<Edge<T>>edge;\\n vector<Edge<T>>g;\\n vector<int>ptr;\\n struct tree_range{\\n using iterator=typename 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 bool empty()const{return !size();}\\n Edge<T> &operator[](int i)const{return l[i];}\\n };\\n struct const_tree_range{\\n using iterator=typename 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 bool empty()const{return !size();}\\n const Edge<T> &operator[](int i)const{return l[i];}\\n };\\npublic:\\n Tree(int n_):n(n_){\\n edge.reserve(n-1);\\n }\\n Tree():n(0){}\\n template<bool weighted=false,bool index=1>\\n void read(){\\n for(int i=0;i<n-1;i++){\\n int u,v;\\n T w=T();\\n cin>>u>>v;\\n if constexpr(index)u--,v--;\\n if constexpr(weighted)cin>>w;\\n else w=1;\\n edge.emplace_back(u,v,w,i);\\n }\\n build();\\n }\\n template<bool index=1>\\n void readp(){\\n for(int i=1;i<n;i++){\\n int p;\\n cin>>p;\\n if constexpr(index)p--;\\n edge.emplace_back(i,p,1,i);\\n }\\n build();\\n }\\n void add_edge(int u,int v){edge.emplace_back(u,v,1,edge.size());}\\n void add_edge(int u,int v,T w){edge.emplace_back(u,v,w,edge.size());}\\n void add_edge(int u,int v,T w,int idx){edge.emplace_back(u,v,w,idx);}\\n void build(){\\n vector<int>cnt(n+1,0);\\n for(auto&&[u,v,w,i]:edge)cnt[u+1]++,cnt[v+1]++;\\n for(int i=1;i<=n;i++)cnt[i]+=cnt[i-1];\\n assert(cnt[n]==n*2-2);\\n ptr=cnt;\\n g.resize(n*2-2);\\n for(auto&&[u,v,w,i]:edge){\\n g[cnt[u]++]=Edge(u,v,w,i);\\n g[cnt[v]++]=Edge(v,u,w,i);\\n }\\n }\\n void remove_parent(int root=0){\\n edge.resize(n-1);\\n auto dfs=[&](auto self,int x,int p,T w)->void {\\n for(const Edge<T>&e:(*this)[x])if(e.to!=p){\\n edge[e.index]=e;\\n self(self,e.to,x,e.weight);\\n }\\n };\\n dfs(dfs,root,-1,T());\\n vector<int>cnt(n+1,0);\\n for(int i=0;i<n-1;i++)cnt[edge[i].from+1]++;\\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)g[cnt[e.from]++]=e;\\n }\\n void hld(int root=0){\\n remove_parent(root);\\n auto dfs=[&](auto self,int x)->int {\\n int ret=1,mx=-1;\\n for(Edge<T>&e:(*this)[x]){\\n int s=self(self,e.to);\\n ret+=s;\\n if(mx<s){\\n mx=s;\\n swap((*this)[x][0],e);\\n }\\n }\\n return ret;\\n };\\n dfs(dfs,root);\\n }\\n int size()const{return n;}\\n tree_range operator[](int i){return tree_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\\n const_tree_range operator[](int i)const{return const_tree_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\\n const Edge<T>& get_edge(int i)const{return edge[i];}\\n};\\ntemplate<typename T>\\nvector<int>offline_lca(const Tree<T>&t,const vector<pair<int,int>>&query,int root=0){\\n int n=t.size();\\n UnionFind uf(n);\\n vector<int>st(n),mark(n),p(n),ret(query.size(),-1);\\n int top=0;\\n st[0]=root;\\n for(const auto&[l,r]:query)mark[l]++,mark[r]++;\\n vector<int>ptr;\\n vector<pair<int,int>>q(query.size()*2);\\n {\\n vector<int>cnt(n+1);\\n cnt[0]=0;\\n for(int i=1;i<=n;i++)cnt[i]=cnt[i-1]+mark[i-1];\\n ptr=cnt;\\n for(int i=0;i<query.size();i++){\\n q[cnt[query[i].first]++]=make_pair(query[i].second,i);\\n q[cnt[query[i].second]++]=make_pair(query[i].first,i);\\n }\\n }\\n for(int i=0;i<n;i++){\\n p[i]=t[i].size();\\n mark[i]=-1;\\n }\\n auto run=[&](int u)->bool {\\n while(p[u]){\\n int v=t[u][--p[u]].to;\\n if(mark[v]==-1){\\n st[++top]=v;\\n return true;\\n }\\n }\\n return false;\\n };\\n while(top!=-1){\\n int u=st[top];\\n if(mark[u]==-1)mark[u]=u;\\n else{\\n uf.merge(u,t[u][p[u]].to);\\n mark[uf.root(u)]=u;\\n }\\n if(!run(u)){\\n for(int i=ptr[u];i<ptr[u+1];i++){\\n const auto&[v,j]=q[i];\\n if(mark[v]!=-1&&ret[j]==-1)ret[j]=mark[uf.root(v)];\\n }\\n top--;\\n }\\n }\\n return ret;\\n}\\nusing namespace std;\\ntemplate<typename T,typename ADD,typename DEL,typename OUT>\\nvoid mo_tree(Tree<T>t,vector<pair<int,int>>query,const ADD&add,const DEL&del,const OUT&out){\\n int n=t.size();\\n int q=query.size();\\n int b=n/min(n,(int)sqrt(q));\\n vector<int>dfs_order(n),dfs_order2(n*2-1);\\n int d=0;\\n t.remove_parent();\\n auto dfs=[&](auto self,int x)->void {\\n dfs_order[x]=d;\\n dfs_order2[d++]=x;\\n for(const Edge<T>&e:t[x]){\\n self(self,e.to);\\n dfs_order2[d++]=e.to;\\n }\\n };\\n dfs(dfs,0);\\n debug(dfs_order,dfs_order2);\\n vector<int>lca=offline_lca(t,query);\\n for(auto&[u,v]:query){\\n u=dfs_order[u]+1;\\n v=dfs_order[v]+1;\\n if(u>v)swap(u,v);\\n }\\n vector<int>ord(q);\\n iota(ord.begin(),ord.end(),0);\\n sort(ord.begin(),ord.end(),[&](int x,int y)->bool {\\n const pair<int,int>&a=query[x],&c=query[y];\\n if(a.first/b!=c.first/b)return a.first<c.first;\\n return ((a.first/b)&1)?a.second>c.second:a.second<c.second;\\n });\\n int l=0,r=0;\\n vector<char>contain(n,false);\\n auto flip=[&](int id){\\n contain[id]^=1;\\n if(contain[id])add(id);\\n else del(id);\\n };\\n for(int i:ord){\\n while(l>query[i].first)flip(dfs_order2[--l]);\\n while(r<query[i].second)flip(dfs_order2[r++]);\\n while(l<query[i].first)flip(dfs_order2[l++]);\\n while(r>query[i].second)flip(dfs_order2[--r]);\\n flip(lca[i]);\\n out(i);\\n flip(lca[i]);\\n }\\n}\\ntemplate<typename T>\\nstruct SquareRootDecomposition{\\nprivate:\\n vector<T>block,dlock;\\n int n,b;\\npublic:\\n SquareRootDecomposition(int n_):n(n_),b(sqrt(n_)){\\n block.resize((n+b-1)/b,0);\\n dlock.resize(n,0);\\n }\\n inline void add(int i,T x){\\n dlock[i]+=x;\\n block[i/b]+=x;\\n }\\n inline void set(int i,T x){\\n add(i,x-dlock[i]);\\n }\\n T sum(int l,int r)const{\\n T ret=0;\\n if(r-l<b){\\n reps(i,l,r)ret+=dlock[i];\\n }\\n else{\\n int l2=(l+b-1)/b*b;\\n int r2=r/b*b;\\n reps(i,l,l2)ret+=dlock[i];\\n reps(i,r2,r)ret+=dlock[i];\\n l=l2/b,r=r2/b;\\n reps(i,l,r)ret+=block[i];\\n }\\n return ret;\\n }\\n int lower_bound(int id,T k=1)const{\\n assert(k);\\n if(k>0){\\n int id2=(id+b-1)/b*b;\\n reps(i,id,id2){\\n if((k-=dlock[i])<=0)return i;\\n }\\n id=id2/b;\\n while(id<block.size()){\\n if(k-block[id]<=0)break;\\n k-=block[id++];\\n }\\n if(id==block.size())return n;\\n id*=b;\\n reps(i,id,id+b){\\n if((k-=dlock[i])<=0)return i;\\n }\\n }\\n else{\\n k=-k;\\n int id2=id/b*b;\\n for(int i=id-1;i>=id2;i--){\\n if((k-=dlock[i])<=0)return i+1;\\n }\\n id=id2/b;\\n while(id){\\n if(k-block[id-1]<=0)break;\\n k-=block[--id];\\n }\\n if(id==0)return 0;\\n id*=b;\\n for(int i=id-1;i>=id-b;i--){\\n if((k-=dlock[i])<=0)return i+1;\\n }\\n }\\n return -1;\\n }\\n friend ostream &operator<<(ostream &os,const SquareRootDecomposition<T>&srd){\\n os<<srd.dlock;\\n return os;\\n }\\n};\\nvoid SOLVE(){\\n int n,q;\\n cin>>n>>q;\\n vector<int>v(n);\\n cin>>v;\\n auto z(v);\\n sort(all(z)),z.erase(unique(all(z)),z.end());\\n rep(i,n)v[i]=lower_bound(all(z),v[i])-z.begin();\\n Tree t(n);\\n t.read();\\n vector<pair<int,int>>query(q);\\n vector<int>k(q);\\n vector<int>ans(q);\\n rep(i,q){\\n cin>>query[i]>>k[i];\\n query[i]--;\\n }\\n SquareRootDecomposition<int>srd(z.size());\\n mo_tree(t,query,[&](int x){srd.add(v[x],1);},[&](int x){srd.add(v[x],-1);},[&](int x){ans[x]=z[srd.lower_bound(0,k[x])];});\\n rep(i,q)cout<<ans[i]<<'\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 25896,\n \"score_of_the_acc\": -0.3561,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2270_9555521\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n// #if __has_include(<atcoder/all>)\\n// #include <atcoder/all>\\n// using namespace atcoder;\\n// template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}\\n// istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}\\n// #endif\\n#ifdef LOCAL\\n#include \\\"debug.h\\\"\\n#else\\n#define debug(...) static_cast<void>(0)\\n#define debugg(...) static_cast<void>(0)\\n#define esper(...) static_cast<void>(0)\\ntemplate<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}\\n#endif\\nusing ll=long long;\\nusing ull=unsigned long long;\\nusing P=pair<ll,ll>;\\ntemplate<typename T>using minque=priority_queue<T,vector<T>,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 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 reps(i,a,n) for(int i=(a);i<int(n);i++)\\n#define rep(i,n) reps(i,0,n)\\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)\\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}\\nvoid SOLVE();\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout<<fixed<<setprecision(16);\\n #ifdef LOCAL\\n clock_t start=clock();\\n #endif\\n int testcase=1;\\n //cin>>testcase;\\n for(int i=0;i<testcase;i++){\\n SOLVE();\\n }\\n #ifdef LOCAL\\n cerr<<\\\"time:\\\";\\n cerr<<(clock()-start)/1000;\\n cerr<<\\\"ms\\\\n\\\";\\n #endif\\n}\\nstruct dsu{\\n vector<int>par;\\n dsu(int n):par(n,-1){}\\n int leader(int u){\\n while(par[u]>=0)u=par[u];\\n return u;\\n }\\n void merge(int u,int v){\\n int ru=leader(u),rv=leader(v);\\n if(ru!=rv){\\n if(par[ru]>par[rv])swap(ru,rv);\\n par[ru]+=par[rv];\\n par[rv]=ru;\\n }\\n }\\n\\n};\\nvector<int>offline_lca(vector<vector<int>>&g,vector<pair<int,int>>query,int root=0){\\n int n=g.size();\\n dsu uf(n);\\n vector<int>st(n),mark(n),p(n),ret(query.size(),-1);\\n int top=0;\\n st[0]=root;\\n for(auto &&[l,r]:query)mark[l]++,mark[r]++;\\n vector<vector<pair<int,int>>>q(n);\\n rep(i,n){\\n q[i].reserve(mark[i]);\\n mark[i]=-1;\\n p[i]=g[i].size();\\n }\\n rep(i,query.size()){\\n q[query[i].first].emplace_back(query[i].second,i);\\n q[query[i].second].emplace_back(query[i].first,i);\\n }\\n auto run=[&](int u)->bool {\\n while(p[u]){\\n int v=g[u][--p[u]];\\n if(mark[v]==-1){\\n st[++top]=v;\\n return true;\\n }\\n }\\n return false;\\n };\\n while(top!=-1){\\n int u=st[top];\\n if(mark[u]==-1)mark[u]=u;\\n else{\\n uf.merge(u,g[u][p[u]]);\\n mark[uf.leader(u)]=u;\\n }\\n if(!run(u)){\\n for(auto&&[v,i]:q[u]){\\n if(mark[v]!=-1&&ret[i]==-1)ret[i]=mark[uf.leader(v)];\\n }\\n top--;\\n }\\n }\\n return ret;\\n}\\ntemplate<bool vertex_query=true>\\nstruct MoTree{\\npublic:\\n vector<int>par;\\nprivate:\\n vector<vector<int>>g;\\n int n,st;\\n vector<pair<int,int>>Q;\\n vector<int>dfs_order;\\n vector<int>dfs_order2;\\n int d;\\n void dfs(int x,int p){\\n par[x]=p;\\n dfs_order[x]=d;\\n dfs_order2[d++]=x;\\n for(int i:g[x])if(i!=p){\\n dfs(i,x);\\n dfs_order2[d++]=i;\\n }\\n }\\npublic:\\n MoTree(int n):n(n),g(n),dfs_order(n),dfs_order2(n*2-1),d(0),par(n){}\\n void add_edge(int u,int v){\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n void add_query(int u,int v){\\n Q.push_back({u,v});\\n }\\n template<typename F1,typename F2,typename F3,typename F4>\\n void build(F1 init,F2 add,F3 del,F4 out){\\n int q=Q.size();\\n st=n/min<int>(n,sqrt(q));\\n dfs(0,-1);\\n vector<int>lca=offline_lca(g,Q);\\n debug(lca);\\n rep(i,Q.size()){\\n Q[i].first=dfs_order[Q[i].first]+1;\\n Q[i].second=dfs_order[Q[i].second]+1;\\n if(Q[i].first>Q[i].second)swap(Q[i].first,Q[i].second);\\n }\\n vector<int>ord(Q.size());\\n iota(all(ord),0);\\n sort(all(ord),[&](int x,int y){\\n pair<int,int>a=Q[x],b=Q[y];\\n if(a.first/st!=b.first/st)return a.first<b.first;\\n return ((a.first/st)&1)?a.second>b.second:a.second<b.second;\\n });\\n init();\\n int l=0,r=0;\\n vector<char>contain(n,false);\\n auto f=[&](int id)->void {\\n contain[id]^=1;\\n if(contain[id])add(id);\\n else del(id);\\n };\\n for(int i:ord){\\n while(l>Q[i].first)f(dfs_order2[--l]);\\n while(r<Q[i].second)f(dfs_order2[r++]);\\n while(l<Q[i].first)f(dfs_order2[l++]);\\n while(r>Q[i].second)f(dfs_order2[--r]);\\n if constexpr(vertex_query)f(lca[i]);\\n out(i);\\n if constexpr(vertex_query)f(lca[i]);\\n }\\n }\\n};\\nvoid SOLVE(){\\n int n,q;\\n cin>>n>>q;\\n vector<int>x(n);\\n cin>>x;\\n MoTree mo(n);\\n rep(i,n-1){\\n int u,v;\\n cin>>u>>v;\\n u--,v--;\\n mo.add_edge(u,v);\\n }\\n vector<int>kth(q);\\n rep(i,q){\\n int u,v,k;\\n cin>>u>>v>>k;\\n u--,v--;\\n mo.add_query(u,v);\\n kth[i]=k;\\n }\\n int vsize=n*2-1;\\n int b=sqrt(vsize)+1;\\n vector<int>block((vsize+b-1)/b,0);\\n vector<int>dlock(vsize,0);\\n vector<int>z;\\n vector<int>ans(q);\\n auto init=[&]()->void {\\n z=x;\\n sort(all(z)),z.erase(unique(all(z)),z.end());\\n rep(i,n)x[i]=lower_bound(all(z),x[i])-z.begin();\\n };\\n auto add=[&](int i)->void {\\n dlock[x[i]]++;\\n block[x[i]/b]++;\\n };\\n auto del=[&](int i)->void {\\n dlock[x[i]]--;\\n block[x[i]/b]--;\\n };\\n auto out=[&](int i)->void {\\n int pos=0;\\n while(kth[i]>block[pos])kth[i]-=block[pos++];\\n pos*=b;\\n while(kth[i]>dlock[pos])kth[i]-=dlock[pos++];\\n ans[i]=z[pos];\\n };\\n mo.build(init,add,del,out);\\n rep(i,q)cout<<ans[i]<<'\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 570,\n \"memory_kb\": 24432,\n \"score_of_the_acc\": -0.3559,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2270_8993168\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct BIT{\\n int N;\\n vector<int> bit;\\n BIT(int N_): N(N_), bit(N_ + 1, 0){\\n }\\n void add(int i, int x){\\n i++; //0base->1base\\n while (i <= N){\\n bit[i] += x;\\n i += i & -i;\\n }\\n }\\n int sum(int i){ //1base\\n int ans = 0;\\n while (i > 0){\\n ans += bit[i];\\n i -= i & -i;\\n }\\n return ans;\\n }\\n int sum(int L, int R){\\n return sum(R) - sum(L);\\n }\\n};\\n\\nint main() {\\n int n,q;\\n cin >> n >> q;\\n \\n vector<int> x(n);\\n for(auto &xa:x) cin >> xa;\\n vector<vector<int>> g(n);\\n int a,b;\\n for(int i=0;i<n-1;i++){\\n cin >> a >> b;\\n a--;b--;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n vector<int> s1(q),s2(q),l(q),r(q);\\n for(int i=0;i<q;i++){ \\n cin >> s1[i] >> s2[i] >> l[i];\\n s1[i]--;s2[i]--;\\n }\\n \\n vector<int> xs=x;\\n sort(xs.begin(),xs.end());\\n xs.erase(unique(xs.begin(),xs.end()),xs.end());\\n int cnt=(int)xs.size();\\n vector<vector<int>> add(cnt);\\n for(int i=0;i<n;i++){\\n x[i]=find(xs.begin(),xs.end(),x[i])-xs.begin();\\n add[x[i]].push_back(i);\\n }\\n\\n int k=17;\\n\\n vector<int> in(n),out(n),dp(n);\\n vector pr(n,vector<int>(k+2,-1));\\n int t=0;\\n function<void(int,int,int)> dfs=[&](int p,int cl,int d){\\n in[cl]=t;\\n t++;\\n pr[cl][0]=p;\\n dp[cl]=d;\\n for(auto nx:g[cl]){\\n if(nx==p) continue;\\n dfs(cl,nx,d+1);\\n }\\n out[cl]=t;\\n t++;\\n };\\n dfs(-1,0,0);\\n\\n for (int i = 0; i <=k; i++){\\n for (int j = 0; j < n; j++){\\n if (pr[j][i] != -1){\\n pr[j][i+1] = pr[pr[j][i]][i];\\n }\\n }\\n }\\n\\n function<int(int,int)> lca=[&](int u, int v){\\n //cout << u << \\\" \\\" << v << endl;\\n if (dp[u] > dp[v]) swap(u, v);\\n int dif=dp[v]-dp[u];\\n for(int i=0;i<=k;i++){\\n if((dif>>i&1)==1) v=pr[v][i];\\n }\\n //cout << v << \\\"V\\\" << dp[v] << \\\" \\\" << dp[u] <<endl;\\n \\n if (u == v) return u;\\n\\n for (int i = k; i >= 0; i--){\\n if (pr[u][i] != pr[v][i]){\\n u = pr[u][i];\\n v = pr[v][i];\\n }\\n }\\n return pr[u][0];\\n };\\n \\n for(int i=0;i<q;i++){ \\n r[i]=lca(s1[i],s2[i]);\\n //cout << i << \\\" \\\" << r[i] << endl;\\n }\\n\\n vector<int> tv(q, 0), fv(q, cnt);\\n while (true){\\n bool ok = true;\\n vector<vector<int>> query(cnt);\\n for (int i = 0; i < q; i++){\\n if (fv[i] - tv[i] > 1){\\n ok = false;\\n query[(tv[i] + fv[i]) / 2].push_back(i);\\n }\\n }\\n if (ok){\\n break;\\n }\\n BIT bit(n * 2);\\n for (int i = 0; i < cnt; i++){\\n for (int j : query[i]){\\n if(fv[j]-tv[j]<=1) continue; \\n int sum = bit.sum(in[r[j]] + 1, in[s1[j]] + 1) + bit.sum(in[r[j]] + 1, in[s2[j]] + 1);\\n if (x[r[j]] < i){\\n sum++;\\n }\\n //cout << i << \\\" \\\" << j << \\\" \\\" <<sum << \\\" \\\" << l[j] << endl;\\n if (sum < l[j]){\\n tv[j] = i;\\n } else {\\n fv[j] = i;\\n }\\n }\\n for (int j : add[i]){\\n bit.add(in[j], 1);\\n bit.add(out[j], -1);\\n }\\n //for(int k=0;k<N*2;k++) cout << BIT.sum(k,k+1) << \\\" \\\";\\n //cout << endl;\\n }\\n }\\n \\n //cout << cnt << endl;\\n \\n for (int i = 0; i < q; i++){\\n cout << xs[tv[i]] << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1530,\n \"memory_kb\": 39752,\n \"score_of_the_acc\": -0.8126,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2270_8993159\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct BIT{\\n int N;\\n vector<int> bit;\\n BIT(int N_): N(N_), bit(N_ + 1, 0){\\n }\\n void add(int i, int x){\\n i++; //0base->1base\\n while (i <= N){\\n bit[i] += x;\\n i += i & -i;\\n }\\n }\\n int sum(int i){ //1base\\n int ans = 0;\\n while (i > 0){\\n ans += bit[i];\\n i -= i & -i;\\n }\\n return ans;\\n }\\n int sum(int L, int R){\\n return sum(R) - sum(L);\\n }\\n};\\n\\nint main() {\\n int n,q;\\n cin >> n >> q;\\n \\n vector<int> x(n);\\n for(auto &xa:x) cin >> xa;\\n vector<vector<int>> g(n);\\n int a,b;\\n for(int i=0;i<n-1;i++){\\n cin >> a >> b;\\n a--;b--;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n vector<int> s1(q),s2(q),l(q),r(q);\\n for(int i=0;i<q;i++){ \\n cin >> s1[i] >> s2[i] >> l[i];\\n s1[i]--;s2[i]--;\\n }\\n \\n vector<int> xs=x;\\n sort(xs.begin(),xs.end());\\n xs.erase(unique(xs.begin(),xs.end()),xs.end());\\n int cnt=(int)xs.size();\\n vector<vector<int>> add(cnt);\\n for(int i=0;i<n;i++){\\n x[i]=find(xs.begin(),xs.end(),x[i])-xs.begin();\\n add[x[i]].push_back(i);\\n }\\n\\n int k=17;\\n\\n vector<int> in(n),out(n),dp(n);\\n vector pr(n,vector<int>(k+2,-1));\\n int t=0;\\n function<void(int,int,int)> dfs=[&](int p,int cl,int d){\\n in[cl]=t;\\n t++;\\n pr[cl][0]=p;\\n dp[cl]=d;\\n for(auto nx:g[cl]){\\n if(nx==p) continue;\\n dfs(cl,nx,d+1);\\n }\\n out[cl]=t;\\n t++;\\n };\\n dfs(-1,0,0);\\n\\n for (int i = 0; i <=k; i++){\\n for (int j = 0; j < n; j++){\\n if (pr[j][i] != -1){\\n pr[j][i+1] = pr[pr[j][i]][i];\\n }\\n }\\n }\\n\\n function<int(int,int)> lca=[&](int u, int v){\\n //cout << u << \\\" \\\" << v << endl;\\n if (dp[u] > dp[v]) swap(u, v);\\n int dif=dp[v]-dp[u];\\n for(int i=0;i<=k;i++){\\n if((dif>>i&1)==1) v=pr[v][i];\\n }\\n //cout << v << \\\"V\\\" << dp[v] << \\\" \\\" << dp[u] <<endl;\\n \\n if (u == v) return u;\\n\\n for (int i = k; i >= 0; i--){\\n if (pr[u][i] != pr[v][i]){\\n u = pr[u][i];\\n v = pr[v][i];\\n }\\n }\\n return pr[u][0];\\n };\\n \\n for(int i=0;i<q;i++){ \\n r[i]=lca(s1[i],s2[i]);\\n //cout << i << \\\" \\\" << r[i] << endl;\\n }\\n\\n vector<int> tv(q, 0), fv(q, cnt);\\n while (true){\\n bool ok = true;\\n vector<vector<int>> query(cnt);\\n for (int i = 0; i < q; i++){\\n if (fv[i] - tv[i] > 1){\\n ok = false;\\n query[(tv[i] + fv[i]) / 2].push_back(i);\\n }\\n }\\n if (ok){\\n break;\\n }\\n BIT bit(n * 2);\\n for (int i = 0; i < cnt; i++){\\n for (int j : query[i]){\\n int sum = bit.sum(in[r[j]] + 1, in[s1[j]] + 1) + bit.sum(in[r[j]] + 1, in[s2[j]] + 1);\\n if (x[r[j]] < i){\\n sum++;\\n }\\n //cout << i << \\\" \\\" << j << \\\" \\\" <<sum << \\\" \\\" << l[j] << endl;\\n if (sum < l[j]){\\n tv[j] = i;\\n } else {\\n fv[j] = i;\\n }\\n }\\n for (int j : add[i]){\\n bit.add(in[j], 1);\\n bit.add(out[j], -1);\\n }\\n //for(int k=0;k<N*2;k++) cout << BIT.sum(k,k+1) << \\\" \\\";\\n //cout << endl;\\n }\\n }\\n \\n //cout << cnt << endl;\\n \\n for (int i = 0; i < q; i++){\\n cout << xs[tv[i]] << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1530,\n \"memory_kb\": 39832,\n \"score_of_the_acc\": -0.8132,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2270_8993149\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct BIT{\\n int N;\\n vector<int> bit;\\n BIT(int N_): N(N_), bit(N_ + 1, 0){\\n }\\n void add(int i, int x){\\n i++; //0base->1base\\n while (i <= N){\\n bit[i] += x;\\n i += i & -i;\\n }\\n }\\n int sum(int i){ //1base\\n int ans = 0;\\n while (i > 0){\\n ans += bit[i];\\n i -= i & -i;\\n }\\n return ans;\\n }\\n int sum(int L, int R){\\n return sum(R) - sum(L);\\n }\\n};\\n\\nint main() {\\n int n,q;\\n cin >> n >> q;\\n \\n vector<int> x(n);\\n for(auto &xa:x) cin >> xa;\\n vector<vector<int>> g(n);\\n int a,b;\\n for(int i=0;i<n-1;i++){\\n cin >> a >> b;\\n a--;b--;\\n g[a].push_back(b);\\n g[b].push_back(a);\\n }\\n vector<int> s1(q),s2(q),l(q),r(q);\\n for(int i=0;i<q;i++){ \\n cin >> s1[i] >> s2[i] >> l[i];\\n s1[i]--;s2[i]--;\\n }\\n \\n vector<int> xs=x;\\n sort(xs.begin(),xs.end());\\n xs.erase(unique(xs.begin(),xs.end()),xs.end());\\n int cnt=(int)xs.size();\\n vector<vector<int>> add(cnt);\\n for(int i=0;i<n;i++){\\n x[i]=find(xs.begin(),xs.end(),x[i])-xs.begin();\\n add[x[i]].push_back(i);\\n }\\n\\n int k=2,kk=2;\\n while(kk<n){k++; kk=kk*kk;}\\n //cout << k << endl;\\n\\n vector<int> in(n),out(n),dp(n);\\n vector pr(n,vector<int>(k+2,-1));\\n int t=0;\\n function<void(int,int,int)> dfs=[&](int p,int cl,int d){\\n in[cl]=t;\\n t++;\\n pr[cl][0]=p;\\n dp[cl]=d;\\n for(auto nx:g[cl]){\\n if(nx==p) continue;\\n dfs(cl,nx,d+1);\\n }\\n out[cl]=t;\\n t++;\\n };\\n dfs(-1,0,0);\\n\\n for (int i = 0; i <=k; i++){\\n for (int j = 0; j < n; j++){\\n if (pr[j][i] != -1){\\n pr[j][i+1] = pr[pr[j][i]][i];\\n }\\n }\\n }\\n\\n function<int(int,int)> lca=[&](int u, int v){\\n //cout << u << \\\" \\\" << v << endl;\\n if (dp[u] > dp[v]) swap(u, v);\\n int dif=dp[v]-dp[u];\\n for(int i=0;i<=k;i++){\\n if((dif>>i&1)==1) v=pr[v][i];\\n }\\n //cout << v << \\\"V\\\" << dp[v] << \\\" \\\" << dp[u] <<endl;\\n \\n if (u == v) return u;\\n\\n for (int i = k; i >= 0; i--){\\n if (pr[u][i] != pr[v][i]){\\n u = pr[u][i];\\n v = pr[v][i];\\n }\\n }\\n return pr[u][0];\\n };\\n \\n for(int i=0;i<q;i++){ \\n r[i]=lca(s1[i],s2[i]);\\n //cout << i << \\\" \\\" << r[i] << endl;\\n }\\n\\n vector<int> tv(q,-1),ss(q,0);\\n BIT bit(n*2);\\n for (int i = 0; i < cnt; i++){\\n for (int j : add[i]){\\n bit.add(in[j], 1);\\n bit.add(out[j], -1);\\n }\\n //for(int k1=0;k1<n*2;k1++) cout << bit.sum(k1,k1+1) << \\\" \\\";\\n //cout << endl;\\n \\n for(int j=0;j<q;j++){\\n if(tv[j]!=-1) continue;\\n int sum = bit.sum(in[r[j]] + 1, in[s1[j]] + 1) + bit.sum(in[r[j]] + 1, in[s2[j]] + 1);\\n if (x[r[j]] <= i) sum++;\\n //cout << i << \\\" \\\" << j << \\\" \\\" <<sum << \\\" \\\" << l[j] << endl;\\n if((sum-ss[j]>1)&&(ss[j]+1<=l[j])&&(sum>=l[j])) tv[j]=i;\\n else if(sum==l[j]) tv[j]=i;\\n else ss[j]=sum;\\n }\\n }\\n \\n //cout << cnt << endl;\\n \\n for (int i = 0; i < q; i++){\\n cout << xs[tv[i]] << endl;\\n }\\n\\n}\",\n \"accuracy\": 0.41935483870967744,\n \"time_ms\": 10,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": 0,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2270_8216308\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class Key> struct RandomizedBinarySearchTree {\\n inline int xor128() {\\n static int x = 123456789;\\n static int y = 362436069;\\n static int z = 521288629;\\n static int w = 88675123;\\n int t;\\n t = x ^ (x << 11);\\n x = y;\\n y = z;\\n z = w;\\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n }\\n struct Node {\\n Node *l, *r;\\n int cnt;\\n Key key;\\n Node() {}\\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\\n };\\n vector<Node> pool;\\n int ptr;\\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\\n virtual Node *clone(Node *t) { return t; }\\n inline int count(const Node *t) { return t ? t->cnt : 0; }\\n inline Node *update(Node *t) {\\n t->cnt = count(t->l) + count(t->r) + 1;\\n return t;\\n }\\n Node *propagete(Node *t) { return update(clone(t)); }\\n Node *merge(Node *l, Node *r) {\\n if (!l || !r)\\n return l ? l : r;\\n if (xor128() % (l->cnt + r->cnt) < l->cnt) {\\n l = propagete(l);\\n l->r = merge(l->r, r);\\n return update(l);\\n } else {\\n r = propagete(r);\\n r->l = merge(l, r->l);\\n return update(r);\\n }\\n }\\n pair<Node *, Node *> split(Node *t, int k) {\\n if (!t)\\n return {t, t};\\n t = propagete(t);\\n if (k <= count(t->l)) {\\n auto s = split(t->l, k);\\n t->l = s.second;\\n return {s.first, update(t)};\\n } else {\\n auto s = split(t->r, k - count(t->l) - 1);\\n t->r = s.first;\\n return {update(t), s.second};\\n }\\n }\\n Node *build(int l, int r, const vector<Key> &v) {\\n if (l + 1 >= r)\\n return alloc(v[l]);\\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\\n }\\n Node *build(const vector<Key> &v) {\\n ptr = 0;\\n return build(0, (int)v.size(), v);\\n }\\n void dump(Node *r, typename vector<Key>::iterator &it) {\\n if (!r)\\n return;\\n r = propagete(r);\\n dump(r->l, it);\\n *it = r->key;\\n dump(r->r, ++it);\\n }\\n vector<Key> dump(Node *r) {\\n vector<Key> v((size_t)count(r));\\n auto it = begin(v);\\n dump(r, it);\\n return v;\\n }\\n string to_string(Node *r) {\\n auto s = dump(r);\\n string ret;\\n for (int i = 0; i < s.size(); i++)\\n ret += \\\", \\\";\\n return (ret);\\n }\\n void insert(Node *&t, int k, const Key &v) {\\n auto x = split(t, k);\\n t = merge(merge(x.first, alloc(v)), x.second);\\n }\\n void erase(Node *&t, int k) {\\n auto x = split(t, k);\\n t = merge(x.first, split(x.second, 1).second);\\n }\\n int size(Node *t) { return count(t); }\\n bool empty(Node *t) { return !t; }\\n Node *makeset() { return (nullptr); }\\n};\\ntemplate <class Key>\\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\\n using RBST = RandomizedBinarySearchTree<Key>;\\n using Node = typename RBST::Node;\\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\\n};\\ntemplate <class T>\\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\\n using RBST = PresidentRandomizedBinarySearchTree<T>;\\n using Node = typename RBST::Node;\\n OrderedMultiSet(int sz) : RBST(sz) {}\\n T kth_element(Node *t, int k) {\\n if (k < RBST::count(t->l))\\n return kth_element(t->l, k);\\n if (k == RBST::count(t->l))\\n return t->key;\\n return kth_element(t->r, k - RBST::count(t->l) - 1);\\n }\\n virtual void insert_key(Node *&t, const T &x) {\\n RBST::insert(t, lower_bound(t, x), x);\\n }\\n void erase_key(Node *&t, const T &x) {\\n if (!count(t, x))\\n return;\\n RBST::erase(t, lower_bound(t, x));\\n }\\n int count(Node *t, const T &x) {\\n return upper_bound(t, x) - lower_bound(t, x);\\n }\\n int lower_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x <= t->key)\\n return lower_bound(t->l, x);\\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n int upper_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x < t->key)\\n return upper_bound(t->l, x);\\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n};\\nstruct CentroidPathDecomposition {\\n struct Centroid {\\n int ParIndex, ParDepth, Deep;\\n vector<int> node;\\n Centroid(int idx, int dep, int deep)\\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\\n inline size_t size() { return (node.size()); }\\n inline int &operator[](int k) { return (node[k]); }\\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\\n };\\n vector<vector<int>> graph;\\n vector<int> SubTreeSize, NextPath;\\n vector<int> TreeIndex, TreeDepth;\\n vector<Centroid> Centroids;\\n void BuildSubTreeSize() {\\n stack<pair<int, int>> s;\\n s.emplace(0, -1);\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n if (~SubTreeSize[p.first]) {\\n NextPath[p.first] = -1;\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n SubTreeSize[p.first] += SubTreeSize[to];\\n if (NextPath[p.first] == -1 ||\\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\\n NextPath[p.first] = to;\\n }\\n }\\n } else {\\n s.push(p);\\n SubTreeSize[p.first] = 1;\\n for (auto &to : graph[p.first]) {\\n if (p.second != to)\\n s.emplace(to, p.first);\\n }\\n }\\n }\\n }\\n void BuildPath() {\\n stack<pair<int, int>> s;\\n Centroids.emplace_back(-1, -1, 0);\\n s.emplace(0, -1);\\n TreeIndex[0] = 0;\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n if (to == NextPath[p.first]) {\\n TreeIndex[to] = TreeIndex[p.first];\\n } else {\\n TreeIndex[to] = (int)Centroids.size();\\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\\n Centroids[TreeIndex[p.first]].Deep + 1);\\n }\\n s.emplace(to, p.first);\\n }\\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\\n }\\n }\\n void AddEdge(int x, int y) {\\n graph[x].push_back(y);\\n graph[y].push_back(x);\\n }\\n virtual void Build() {\\n BuildSubTreeSize();\\n BuildPath();\\n }\\n inline size_t size() { return (Centroids.size()); }\\n inline pair<int, int> Information(int idx) {\\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\\n }\\n inline Centroid &operator[](int k) { return (Centroids[k]); }\\n inline int LCA(int a, int b) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n return (Centroids[TreeIdxA][TreeDepthA]);\\n }\\n inline virtual void query(int a, int b,\\n const function<void(int, int, int)> &f) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n f(TreeIdxA, 0, TreeDepthA + 1);\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n f(TreeIdxB, 0, TreeDepthB + 1);\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\\n }\\n CentroidPathDecomposition(int SZ) {\\n graph.resize(SZ);\\n SubTreeSize.assign(SZ, -1);\\n NextPath.resize(SZ);\\n TreeIndex.resize(SZ);\\n TreeDepth.resize(SZ);\\n }\\n};\\nOrderedMultiSet<int> tree(5000000);\\nOrderedMultiSet<int>::Node *nodes[100000];\\nint N, Q, X[100000];\\nvector<int> g[100000];\\nint parent[100000];\\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\\n parent[idx] = par;\\n tree.insert_key(par_set, X[idx]);\\n nodes[idx] = par_set;\\n for (auto &to : g[idx])\\n if (to != par)\\n dfs(to, idx, par_set);\\n}\\nint main() {\\n scanf(\\\"%d %d\\\", &N, &Q);\\n CentroidPathDecomposition gg(N);\\n vector<int> vs;\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &X[i]);\\n vs.emplace_back(X[i]);\\n }\\n sort(begin(vs), end(vs));\\n vs.erase(unique(begin(vs), end(vs)), end(vs));\\n for (int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n gg.AddEdge(x, y);\\n }\\n dfs(0, -1, tree.makeset());\\n gg.Build();\\n for (int i = 0; i < Q; i++) {\\n int x, y, z;\\n scanf(\\\"%d %d %d\\\", &x, &y, &z);\\n --x, --y;\\n int lca = gg.LCA(x, y);\\n int ng = -1, ok = (int)vs.size() - 1;\\n auto sum = [&](int v) {\\n int ret = 0;\\n ret += tree.upper_bound(nodes[x], vs[v]);\\n ret += tree.upper_bound(nodes[y], vs[v]);\\n ret -= X[lca] <= vs[v];\\n if (lca)\\n ret -= 2 * tree.upper_bound(nodes[parent[lca]], vs[v]);\\n return ret;\\n };\\n while (ok - ng > 1) {\\n int mid = (ok + ng) >> 1;\\n if (sum(mid) >= z)\\n ok = mid;\\n else\\n ng = mid;\\n }\\n printf(\\\"%d\\\\n\\\", vs[ok]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 132436,\n \"score_of_the_acc\": -1.2335,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2270_8216303\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class Key> struct RandomizedBinarySearchTree {\\n inline int xor128() {\\n static int x = 123456789;\\n static int y = 362436069;\\n static int z = 521288629;\\n static int w = 88675123;\\n int t;\\n t = x ^ (x << 11);\\n x = y;\\n y = z;\\n z = w;\\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n }\\n struct Node {\\n Node *l, *r;\\n int cnt;\\n Key key;\\n Node() {}\\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\\n };\\n vector<Node> pool;\\n int ptr;\\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\\n virtual Node *clone(Node *t) { return t; }\\n inline int count(const Node *t) { return t ? t->cnt : 0; }\\n inline Node *update(Node *t) {\\n t->cnt = count(t->l) + count(t->r) + 1;\\n return t;\\n }\\n Node *propagete(Node *t) { return update(clone(t)); }\\n Node *merge(Node *l, Node *r) {\\n if (!l || !r)\\n return l ? l : r;\\n if (xor128() % (l->cnt + r->cnt) < l->cnt) {\\n l = propagete(l);\\n l->r = merge(l->r, r);\\n return update(l);\\n } else {\\n r = propagete(r);\\n r->l = merge(l, r->l);\\n return update(r);\\n }\\n }\\n pair<Node *, Node *> split(Node *t, int k) {\\n if (!t)\\n return {t, t};\\n t = propagete(t);\\n if (k <= count(t->l)) {\\n auto s = split(t->l, k);\\n t->l = s.second;\\n return {s.first, update(t)};\\n } else {\\n auto s = split(t->r, k - count(t->l) - 1);\\n t->r = s.first;\\n return {update(t), s.second};\\n }\\n }\\n Node *build(int l, int r, const vector<Key> &v) {\\n if (l + 1 >= r)\\n return alloc(v[l]);\\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\\n }\\n Node *build(const vector<Key> &v) {\\n ptr = 0;\\n return build(0, (int)v.size(), v);\\n }\\n void dump(Node *r, typename vector<Key>::iterator &it) {\\n if (!r)\\n return;\\n r = propagete(r);\\n dump(r->l, it);\\n *it = r->key;\\n dump(r->r, ++it);\\n }\\n vector<Key> dump(Node *r) {\\n vector<Key> v((size_t)count(r));\\n auto it = begin(v);\\n dump(r, it);\\n return v;\\n }\\n string to_string(Node *r) {\\n auto s = dump(r);\\n string ret;\\n for (int i = 0; i < s.size(); i++)\\n ret += \\\", \\\";\\n return (ret);\\n }\\n void insert(Node *&t, int k, const Key &v) {\\n auto x = split(t, k);\\n t = merge(merge(x.first, alloc(v)), x.second);\\n }\\n void erase(Node *&t, int k) {\\n auto x = split(t, k);\\n t = merge(x.first, split(x.second, 1).second);\\n }\\n int size(Node *t) { return count(t); }\\n bool empty(Node *t) { return !t; }\\n Node *makeset() { return (nullptr); }\\n};\\ntemplate <class Key>\\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\\n using RBST = RandomizedBinarySearchTree<Key>;\\n using Node = typename RBST::Node;\\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\\n};\\ntemplate <class T>\\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\\n using RBST = PresidentRandomizedBinarySearchTree<T>;\\n using Node = typename RBST::Node;\\n OrderedMultiSet(int sz) : RBST(sz) {}\\n T kth_element(Node *t, int k) {\\n if (k < RBST::count(t->l))\\n return kth_element(t->l, k);\\n if (k == RBST::count(t->l))\\n return t->key;\\n return kth_element(t->r, k - RBST::count(t->l) - 1);\\n }\\n virtual void insert_key(Node *&t, const T &x) {\\n RBST::insert(t, lower_bound(t, x), x);\\n }\\n void erase_key(Node *&t, const T &x) {\\n if (!count(t, x))\\n return;\\n RBST::erase(t, lower_bound(t, x));\\n }\\n int count(Node *t, const T &x) {\\n return upper_bound(t, x) - lower_bound(t, x);\\n }\\n int lower_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x <= t->key)\\n return lower_bound(t->l, x);\\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n int upper_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x < t->key)\\n return upper_bound(t->l, x);\\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n};\\nstruct CentroidPathDecomposition {\\n struct Centroid {\\n int ParIndex, ParDepth, Deep;\\n vector<int> node;\\n Centroid(int idx, int dep, int deep)\\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\\n inline size_t size() { return (node.size()); }\\n inline int &operator[](int k) { return (node[k]); }\\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\\n };\\n vector<vector<int>> graph;\\n vector<int> SubTreeSize, NextPath;\\n vector<int> TreeIndex, TreeDepth;\\n vector<Centroid> Centroids;\\n void BuildSubTreeSize() {\\n stack<pair<int, int>> s;\\n s.emplace(0, -1);\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n if (~SubTreeSize[p.first]) {\\n NextPath[p.first] = -1;\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n SubTreeSize[p.first] += SubTreeSize[to];\\n if (NextPath[p.first] == -1 ||\\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\\n NextPath[p.first] = to;\\n }\\n }\\n } else {\\n s.push(p);\\n SubTreeSize[p.first] = 1;\\n for (auto &to : graph[p.first]) {\\n if (p.second != to)\\n s.emplace(to, p.first);\\n }\\n }\\n }\\n }\\n void BuildPath() {\\n stack<pair<int, int>> s;\\n Centroids.emplace_back(-1, -1, 0);\\n s.emplace(0, -1);\\n TreeIndex[0] = 0;\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n if (to == NextPath[p.first]) {\\n TreeIndex[to] = TreeIndex[p.first];\\n } else {\\n TreeIndex[to] = (int)Centroids.size();\\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\\n Centroids[TreeIndex[p.first]].Deep + 1);\\n }\\n s.emplace(to, p.first);\\n }\\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\\n }\\n }\\n void AddEdge(int x, int y) {\\n graph[x].push_back(y);\\n graph[y].push_back(x);\\n }\\n virtual void Build() {\\n BuildSubTreeSize();\\n BuildPath();\\n }\\n inline size_t size() { return (Centroids.size()); }\\n inline pair<int, int> Information(int idx) {\\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\\n }\\n inline Centroid &operator[](int k) { return (Centroids[k]); }\\n inline int LCA(int a, int b) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n return (Centroids[TreeIdxA][TreeDepthA]);\\n }\\n inline virtual void query(int a, int b,\\n const function<void(int, int, int)> &f) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n f(TreeIdxA, 0, TreeDepthA + 1);\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n f(TreeIdxB, 0, TreeDepthB + 1);\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\\n }\\n CentroidPathDecomposition(int SZ) {\\n graph.resize(SZ);\\n SubTreeSize.assign(SZ, -1);\\n NextPath.resize(SZ);\\n TreeIndex.resize(SZ);\\n TreeDepth.resize(SZ);\\n }\\n};\\nOrderedMultiSet<int> tree(5000000);\\nOrderedMultiSet<int>::Node *nodes[100000];\\nint N, Q, X[100000];\\nvector<int> g[100000];\\nint parent[100000];\\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\\n parent[idx] = par;\\n tree.insert_key(par_set, X[idx]);\\n nodes[idx] = par_set;\\n for (auto &to : g[idx])\\n if (to != par)\\n dfs(to, idx, par_set);\\n}\\nint main() {\\n scanf(\\\"%d %d\\\", &N, &Q);\\n CentroidPathDecomposition gg(N);\\n vector<int> vs;\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &X[i]);\\n vs.emplace_back(X[i]);\\n }\\n sort(begin(vs), end(vs));\\n vs.erase(unique(begin(vs), end(vs)), end(vs));\\n for (int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n gg.AddEdge(x, y);\\n }\\n dfs(0, -1, tree.makeset());\\n gg.Build();\\n for (int i = 0; i < Q; i++) {\\n int x, y, z;\\n scanf(\\\"%d %d %d\\\", &x, &y, &z);\\n --x, --y;\\n int lca = gg.LCA(x, y);\\n int ng = -1, ok = (int)vs.size() - 1;\\n auto sum = [&](int v) {\\n int ret = 0;\\n ret += tree.upper_bound(nodes[x], vs[v]);\\n ret += tree.upper_bound(nodes[y], vs[v]);\\n ret -= tree.upper_bound(nodes[lca], vs[v]);\\n if (lca)\\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\\n return ret;\\n };\\n while (ok - ng > 1) {\\n int mid = (ok + ng) >> 1;\\n if (sum(mid) >= z)\\n ok = mid;\\n else\\n ng = mid;\\n }\\n printf(\\\"%d\\\\n\\\", vs[ok]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 133116,\n \"score_of_the_acc\": -1.2636,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2270_8113360\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class Key> struct RandomizedBinarySearchTree {\\n inline int xor128() {\\n static int x = 123456789;\\n static int y = 362436069;\\n static int z = 521288629;\\n static int w = 88675123;\\n int t;\\n t = x ^ (x << 11);\\n x = y;\\n y = z;\\n z = w;\\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n }\\n struct Node {\\n Node *l, *r;\\n int cnt;\\n Key key;\\n Node() {}\\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\\n };\\n vector<Node> pool;\\n int ptr;\\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\\n virtual Node *clone(Node *t) { return t; }\\n inline int count(const Node *t) { return t ? t->cnt : 0; }\\n inline Node *update(Node *t) {\\n t->cnt = count(t->l) + count(t->r) + 1;\\n return t;\\n }\\n Node *propagete(Node *t) { return update(clone(t)); }\\n Node *merge(Node *l, Node *r) {\\n if (!l || !r)\\n return l ? l : r;\\n if (xor128() % (l->cnt + r->cnt) > l->cnt) {\\n l = propagete(l);\\n l->r = merge(l->r, r);\\n return update(l);\\n } else {\\n r = propagete(r);\\n r->l = merge(l, r->l);\\n return update(r);\\n }\\n }\\n pair<Node *, Node *> split(Node *t, int k) {\\n if (!t)\\n return {t, t};\\n t = propagete(t);\\n if (k <= count(t->l)) {\\n auto s = split(t->l, k);\\n t->l = s.second;\\n return {s.first, update(t)};\\n } else {\\n auto s = split(t->r, k - count(t->l) - 1);\\n t->r = s.first;\\n return {update(t), s.second};\\n }\\n }\\n Node *build(int l, int r, const vector<Key> &v) {\\n if (l + 1 >= r)\\n return alloc(v[l]);\\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\\n }\\n Node *build(const vector<Key> &v) {\\n ptr = 0;\\n return build(0, (int)v.size(), v);\\n }\\n void dump(Node *r, typename vector<Key>::iterator &it) {\\n if (!r)\\n return;\\n r = propagete(r);\\n dump(r->l, it);\\n *it = r->key;\\n dump(r->r, ++it);\\n }\\n vector<Key> dump(Node *r) {\\n vector<Key> v((size_t)count(r));\\n auto it = begin(v);\\n dump(r, it);\\n return v;\\n }\\n string to_string(Node *r) {\\n auto s = dump(r);\\n string ret;\\n for (int i = 0; i < s.size(); i++)\\n ret += \\\", \\\";\\n return (ret);\\n }\\n void insert(Node *&t, int k, const Key &v) {\\n auto x = split(t, k);\\n t = merge(merge(x.first, alloc(v)), x.second);\\n }\\n void erase(Node *&t, int k) {\\n auto x = split(t, k);\\n t = merge(x.first, split(x.second, 1).second);\\n }\\n int size(Node *t) { return count(t); }\\n bool empty(Node *t) { return !t; }\\n Node *makeset() { return (nullptr); }\\n};\\ntemplate <class Key>\\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\\n using RBST = RandomizedBinarySearchTree<Key>;\\n using Node = typename RBST::Node;\\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\\n};\\ntemplate <class T>\\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\\n using RBST = PresidentRandomizedBinarySearchTree<T>;\\n using Node = typename RBST::Node;\\n OrderedMultiSet(int sz) : RBST(sz) {}\\n T kth_element(Node *t, int k) {\\n if (k < RBST::count(t->l))\\n return kth_element(t->l, k);\\n if (k == RBST::count(t->l))\\n return t->key;\\n return kth_element(t->r, k - RBST::count(t->l) - 1);\\n }\\n virtual void insert_key(Node *&t, const T &x) {\\n RBST::insert(t, lower_bound(t, x), x);\\n }\\n void erase_key(Node *&t, const T &x) {\\n if (!count(t, x))\\n return;\\n RBST::erase(t, lower_bound(t, x));\\n }\\n int count(Node *t, const T &x) {\\n return upper_bound(t, x) - lower_bound(t, x);\\n }\\n int lower_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x <= t->key)\\n return lower_bound(t->l, x);\\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n int upper_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x < t->key)\\n return upper_bound(t->l, x);\\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n};\\nstruct CentroidPathDecomposition {\\n struct Centroid {\\n int ParIndex, ParDepth, Deep;\\n vector<int> node;\\n Centroid(int idx, int dep, int deep)\\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\\n inline size_t size() { return (node.size()); }\\n inline int &operator[](int k) { return (node[k]); }\\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\\n };\\n vector<vector<int>> graph;\\n vector<int> SubTreeSize, NextPath;\\n vector<int> TreeIndex, TreeDepth;\\n vector<Centroid> Centroids;\\n void BuildSubTreeSize() {\\n stack<pair<int, int>> s;\\n s.emplace(0, -1);\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n if (~SubTreeSize[p.first]) {\\n NextPath[p.first] = -1;\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n SubTreeSize[p.first] += SubTreeSize[to];\\n if (NextPath[p.first] == -1 ||\\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\\n NextPath[p.first] = to;\\n }\\n }\\n } else {\\n s.push(p);\\n SubTreeSize[p.first] = 1;\\n for (auto &to : graph[p.first]) {\\n if (p.second != to)\\n s.emplace(to, p.first);\\n }\\n }\\n }\\n }\\n void BuildPath() {\\n stack<pair<int, int>> s;\\n Centroids.emplace_back(-1, -1, 0);\\n s.emplace(0, -1);\\n TreeIndex[0] = 0;\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n if (to == NextPath[p.first]) {\\n TreeIndex[to] = TreeIndex[p.first];\\n } else {\\n TreeIndex[to] = (int)Centroids.size();\\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\\n Centroids[TreeIndex[p.first]].Deep + 1);\\n }\\n s.emplace(to, p.first);\\n }\\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\\n }\\n }\\n void AddEdge(int x, int y) {\\n graph[x].push_back(y);\\n graph[y].push_back(x);\\n }\\n virtual void Build() {\\n BuildSubTreeSize();\\n BuildPath();\\n }\\n inline size_t size() { return (Centroids.size()); }\\n inline pair<int, int> Information(int idx) {\\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\\n }\\n inline Centroid &operator[](int k) { return (Centroids[k]); }\\n inline int LCA(int a, int b) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n return (Centroids[TreeIdxA][TreeDepthA]);\\n }\\n inline virtual void query(int a, int b,\\n const function<void(int, int, int)> &f) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n f(TreeIdxA, 0, TreeDepthA + 1);\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n f(TreeIdxB, 0, TreeDepthB + 1);\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\\n }\\n CentroidPathDecomposition(int SZ) {\\n graph.resize(SZ);\\n SubTreeSize.assign(SZ, -1);\\n NextPath.resize(SZ);\\n TreeIndex.resize(SZ);\\n TreeDepth.resize(SZ);\\n }\\n};\\nOrderedMultiSet<int> tree(5000000);\\nOrderedMultiSet<int>::Node *nodes[100000];\\nint N, Q, X[100000];\\nvector<int> g[100000];\\nint parent[100000];\\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\\n parent[idx] = par;\\n tree.insert_key(par_set, X[idx]);\\n nodes[idx] = par_set;\\n for (auto &to : g[idx])\\n if (to != par)\\n dfs(to, idx, par_set);\\n}\\nint main() {\\n scanf(\\\"%d %d\\\", &N, &Q);\\n CentroidPathDecomposition gg(N);\\n vector<int> vs;\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &X[i]);\\n vs.emplace_back(X[i]);\\n }\\n sort(begin(vs), end(vs));\\n vs.erase(unique(begin(vs), end(vs)), end(vs));\\n for (int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n gg.AddEdge(x, y);\\n }\\n dfs(0, -1, tree.makeset());\\n gg.Build();\\n for (int i = 0; i < Q; i++) {\\n int x, y, z;\\n scanf(\\\"%d %d %d\\\", &x, &y, &z);\\n --x, --y;\\n int lca = gg.LCA(x, y);\\n int ng = -1, ok = (int)vs.size() - 1;\\n auto sum = [&](int v) {\\n int ret = 0;\\n ret += tree.upper_bound(nodes[x], vs[v]);\\n ret += tree.upper_bound(nodes[y], vs[v]);\\n ret -= tree.upper_bound(nodes[lca], vs[v]);\\n if (lca)\\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\\n return ret;\\n };\\n while (ok - ng > 1) {\\n int mid = (ok + ng) >> 1;\\n if (sum(mid) >= z)\\n ok = mid;\\n else\\n ng = mid;\\n }\\n printf(\\\"%d\\\\n\\\", vs[ok]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1080,\n \"memory_kb\": 135224,\n \"score_of_the_acc\": -1.3614,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2270_8113359\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class Key> struct RandomizedBinarySearchTree {\\n inline int xor128() {\\n static int x = 123456789;\\n static int y = 362436069;\\n static int z = 521288629;\\n static int w = 88675123;\\n int t;\\n t = x ^ (x << 11);\\n x = y;\\n y = z;\\n z = w;\\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n }\\n struct Node {\\n Node *l, *r;\\n int cnt;\\n Key key;\\n Node() {}\\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\\n };\\n vector<Node> pool;\\n int ptr;\\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\\n virtual Node *clone(Node *t) { return t; }\\n inline int count(const Node *t) { return t ? t->cnt : 0; }\\n inline Node *update(Node *t) {\\n t->cnt = count(t->l) + count(t->r) + 1;\\n return t;\\n }\\n Node *propagete(Node *t) { return update(clone(t)); }\\n Node *merge(Node *l, Node *r) {\\n if (!l || !r)\\n return l ? l : r;\\n if (xor128() % (r->cnt + l->cnt) < r->cnt) {\\n l = propagete(l);\\n l->r = merge(l->r, r);\\n return update(l);\\n } else {\\n r = propagete(r);\\n r->l = merge(l, r->l);\\n return update(r);\\n }\\n }\\n pair<Node *, Node *> split(Node *t, int k) {\\n if (!t)\\n return {t, t};\\n t = propagete(t);\\n if (k <= count(t->l)) {\\n auto s = split(t->l, k);\\n t->l = s.second;\\n return {s.first, update(t)};\\n } else {\\n auto s = split(t->r, k - count(t->l) - 1);\\n t->r = s.first;\\n return {update(t), s.second};\\n }\\n }\\n Node *build(int l, int r, const vector<Key> &v) {\\n if (l + 1 >= r)\\n return alloc(v[l]);\\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\\n }\\n Node *build(const vector<Key> &v) {\\n ptr = 0;\\n return build(0, (int)v.size(), v);\\n }\\n void dump(Node *r, typename vector<Key>::iterator &it) {\\n if (!r)\\n return;\\n r = propagete(r);\\n dump(r->l, it);\\n *it = r->key;\\n dump(r->r, ++it);\\n }\\n vector<Key> dump(Node *r) {\\n vector<Key> v((size_t)count(r));\\n auto it = begin(v);\\n dump(r, it);\\n return v;\\n }\\n string to_string(Node *r) {\\n auto s = dump(r);\\n string ret;\\n for (int i = 0; i < s.size(); i++)\\n ret += \\\", \\\";\\n return (ret);\\n }\\n void insert(Node *&t, int k, const Key &v) {\\n auto x = split(t, k);\\n t = merge(merge(x.first, alloc(v)), x.second);\\n }\\n void erase(Node *&t, int k) {\\n auto x = split(t, k);\\n t = merge(x.first, split(x.second, 1).second);\\n }\\n int size(Node *t) { return count(t); }\\n bool empty(Node *t) { return !t; }\\n Node *makeset() { return (nullptr); }\\n};\\ntemplate <class Key>\\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\\n using RBST = RandomizedBinarySearchTree<Key>;\\n using Node = typename RBST::Node;\\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\\n};\\ntemplate <class T>\\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\\n using RBST = PresidentRandomizedBinarySearchTree<T>;\\n using Node = typename RBST::Node;\\n OrderedMultiSet(int sz) : RBST(sz) {}\\n T kth_element(Node *t, int k) {\\n if (k < RBST::count(t->l))\\n return kth_element(t->l, k);\\n if (k == RBST::count(t->l))\\n return t->key;\\n return kth_element(t->r, k - RBST::count(t->l) - 1);\\n }\\n virtual void insert_key(Node *&t, const T &x) {\\n RBST::insert(t, lower_bound(t, x), x);\\n }\\n void erase_key(Node *&t, const T &x) {\\n if (!count(t, x))\\n return;\\n RBST::erase(t, lower_bound(t, x));\\n }\\n int count(Node *t, const T &x) {\\n return upper_bound(t, x) - lower_bound(t, x);\\n }\\n int lower_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x <= t->key)\\n return lower_bound(t->l, x);\\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n int upper_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x < t->key)\\n return upper_bound(t->l, x);\\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n};\\nstruct CentroidPathDecomposition {\\n struct Centroid {\\n int ParIndex, ParDepth, Deep;\\n vector<int> node;\\n Centroid(int idx, int dep, int deep)\\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\\n inline size_t size() { return (node.size()); }\\n inline int &operator[](int k) { return (node[k]); }\\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\\n };\\n vector<vector<int>> graph;\\n vector<int> SubTreeSize, NextPath;\\n vector<int> TreeIndex, TreeDepth;\\n vector<Centroid> Centroids;\\n void BuildSubTreeSize() {\\n stack<pair<int, int>> s;\\n s.emplace(0, -1);\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n if (~SubTreeSize[p.first]) {\\n NextPath[p.first] = -1;\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n SubTreeSize[p.first] += SubTreeSize[to];\\n if (NextPath[p.first] == -1 ||\\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\\n NextPath[p.first] = to;\\n }\\n }\\n } else {\\n s.push(p);\\n SubTreeSize[p.first] = 1;\\n for (auto &to : graph[p.first]) {\\n if (p.second != to)\\n s.emplace(to, p.first);\\n }\\n }\\n }\\n }\\n void BuildPath() {\\n stack<pair<int, int>> s;\\n Centroids.emplace_back(-1, -1, 0);\\n s.emplace(0, -1);\\n TreeIndex[0] = 0;\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n if (to == NextPath[p.first]) {\\n TreeIndex[to] = TreeIndex[p.first];\\n } else {\\n TreeIndex[to] = (int)Centroids.size();\\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\\n Centroids[TreeIndex[p.first]].Deep + 1);\\n }\\n s.emplace(to, p.first);\\n }\\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\\n }\\n }\\n void AddEdge(int x, int y) {\\n graph[x].push_back(y);\\n graph[y].push_back(x);\\n }\\n virtual void Build() {\\n BuildSubTreeSize();\\n BuildPath();\\n }\\n inline size_t size() { return (Centroids.size()); }\\n inline pair<int, int> Information(int idx) {\\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\\n }\\n inline Centroid &operator[](int k) { return (Centroids[k]); }\\n inline int LCA(int a, int b) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n return (Centroids[TreeIdxA][TreeDepthA]);\\n }\\n inline virtual void query(int a, int b,\\n const function<void(int, int, int)> &f) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n f(TreeIdxA, 0, TreeDepthA + 1);\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n f(TreeIdxB, 0, TreeDepthB + 1);\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\\n }\\n CentroidPathDecomposition(int SZ) {\\n graph.resize(SZ);\\n SubTreeSize.assign(SZ, -1);\\n NextPath.resize(SZ);\\n TreeIndex.resize(SZ);\\n TreeDepth.resize(SZ);\\n }\\n};\\nOrderedMultiSet<int> tree(5000000);\\nOrderedMultiSet<int>::Node *nodes[100000];\\nint N, Q, X[100000];\\nvector<int> g[100000];\\nint parent[100000];\\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\\n parent[idx] = par;\\n tree.insert_key(par_set, X[idx]);\\n nodes[idx] = par_set;\\n for (auto &to : g[idx])\\n if (to != par)\\n dfs(to, idx, par_set);\\n}\\nint main() {\\n scanf(\\\"%d %d\\\", &N, &Q);\\n CentroidPathDecomposition gg(N);\\n vector<int> vs;\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &X[i]);\\n vs.emplace_back(X[i]);\\n }\\n sort(begin(vs), end(vs));\\n vs.erase(unique(begin(vs), end(vs)), end(vs));\\n for (int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n gg.AddEdge(x, y);\\n }\\n dfs(0, -1, tree.makeset());\\n gg.Build();\\n for (int i = 0; i < Q; i++) {\\n int x, y, z;\\n scanf(\\\"%d %d %d\\\", &x, &y, &z);\\n --x, --y;\\n int lca = gg.LCA(x, y);\\n int ng = -1, ok = (int)vs.size() - 1;\\n auto sum = [&](int v) {\\n int ret = 0;\\n ret += tree.upper_bound(nodes[x], vs[v]);\\n ret += tree.upper_bound(nodes[y], vs[v]);\\n ret -= tree.upper_bound(nodes[lca], vs[v]);\\n if (lca)\\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\\n return ret;\\n };\\n while (ok - ng > 1) {\\n int mid = (ok + ng) >> 1;\\n if (sum(mid) >= z)\\n ok = mid;\\n else\\n ng = mid;\\n }\\n printf(\\\"%d\\\\n\\\", vs[ok]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1040,\n \"memory_kb\": 135488,\n \"score_of_the_acc\": -1.3491,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2270_8113357\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class Key> struct RandomizedBinarySearchTree {\\n inline int xor128() {\\n static int x = 123456789;\\n static int y = 362436069;\\n static int z = 521288629;\\n static int w = 88675123;\\n int t;\\n t = x ^ (x << 11);\\n x = y;\\n y = z;\\n z = w;\\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n }\\n struct Node {\\n Node *l, *r;\\n int cnt;\\n Key key;\\n Node() {}\\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\\n };\\n vector<Node> pool;\\n int ptr;\\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\\n virtual Node *clone(Node *t) { return t; }\\n inline int count(const Node *t) { return t ? t->cnt : 0; }\\n inline Node *update(Node *t) {\\n t->cnt = count(t->l) + count(t->r) + 1;\\n return t;\\n }\\n Node *propagete(Node *t) { return update(clone(t)); }\\n Node *merge(Node *l, Node *r) {\\n if (!l || !r)\\n return l ? l : r;\\n if (xor128() % (l->cnt + r->cnt) < r->cnt) {\\n l = propagete(l);\\n l->r = merge(l->r, r);\\n return update(l);\\n } else {\\n r = propagete(r);\\n r->l = merge(l, r->l);\\n return update(r);\\n }\\n }\\n pair<Node *, Node *> split(Node *t, int k) {\\n if (!t)\\n return {t, t};\\n t = propagete(t);\\n if (k <= count(t->l)) {\\n auto s = split(t->l, k);\\n t->l = s.second;\\n return {s.first, update(t)};\\n } else {\\n auto s = split(t->r, k - count(t->l) - 1);\\n t->r = s.first;\\n return {update(t), s.second};\\n }\\n }\\n Node *build(int l, int r, const vector<Key> &v) {\\n if (l + 1 >= r)\\n return alloc(v[l]);\\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\\n }\\n Node *build(const vector<Key> &v) {\\n ptr = 0;\\n return build(0, (int)v.size(), v);\\n }\\n void dump(Node *r, typename vector<Key>::iterator &it) {\\n if (!r)\\n return;\\n r = propagete(r);\\n dump(r->l, it);\\n *it = r->key;\\n dump(r->r, ++it);\\n }\\n vector<Key> dump(Node *r) {\\n vector<Key> v((size_t)count(r));\\n auto it = begin(v);\\n dump(r, it);\\n return v;\\n }\\n string to_string(Node *r) {\\n auto s = dump(r);\\n string ret;\\n for (int i = 0; i < s.size(); i++)\\n ret += \\\", \\\";\\n return (ret);\\n }\\n void insert(Node *&t, int k, const Key &v) {\\n auto x = split(t, k);\\n t = merge(merge(x.first, alloc(v)), x.second);\\n }\\n void erase(Node *&t, int k) {\\n auto x = split(t, k);\\n t = merge(x.first, split(x.second, 1).second);\\n }\\n int size(Node *t) { return count(t); }\\n bool empty(Node *t) { return !t; }\\n Node *makeset() { return (nullptr); }\\n};\\ntemplate <class Key>\\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\\n using RBST = RandomizedBinarySearchTree<Key>;\\n using Node = typename RBST::Node;\\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\\n};\\ntemplate <class T>\\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\\n using RBST = PresidentRandomizedBinarySearchTree<T>;\\n using Node = typename RBST::Node;\\n OrderedMultiSet(int sz) : RBST(sz) {}\\n T kth_element(Node *t, int k) {\\n if (k < RBST::count(t->l))\\n return kth_element(t->l, k);\\n if (k == RBST::count(t->l))\\n return t->key;\\n return kth_element(t->r, k - RBST::count(t->l) - 1);\\n }\\n virtual void insert_key(Node *&t, const T &x) {\\n RBST::insert(t, lower_bound(t, x), x);\\n }\\n void erase_key(Node *&t, const T &x) {\\n if (!count(t, x))\\n return;\\n RBST::erase(t, lower_bound(t, x));\\n }\\n int count(Node *t, const T &x) {\\n return upper_bound(t, x) - lower_bound(t, x);\\n }\\n int lower_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x <= t->key)\\n return lower_bound(t->l, x);\\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n int upper_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x < t->key)\\n return upper_bound(t->l, x);\\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n};\\nstruct CentroidPathDecomposition {\\n struct Centroid {\\n int ParIndex, ParDepth, Deep;\\n vector<int> node;\\n Centroid(int idx, int dep, int deep)\\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\\n inline size_t size() { return (node.size()); }\\n inline int &operator[](int k) { return (node[k]); }\\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\\n };\\n vector<vector<int>> graph;\\n vector<int> SubTreeSize, NextPath;\\n vector<int> TreeIndex, TreeDepth;\\n vector<Centroid> Centroids;\\n void BuildSubTreeSize() {\\n stack<pair<int, int>> s;\\n s.emplace(0, -1);\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n if (~SubTreeSize[p.first]) {\\n NextPath[p.first] = -1;\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n SubTreeSize[p.first] += SubTreeSize[to];\\n if (NextPath[p.first] == -1 ||\\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\\n NextPath[p.first] = to;\\n }\\n }\\n } else {\\n s.push(p);\\n SubTreeSize[p.first] = 1;\\n for (auto &to : graph[p.first]) {\\n if (p.second != to)\\n s.emplace(to, p.first);\\n }\\n }\\n }\\n }\\n void BuildPath() {\\n stack<pair<int, int>> s;\\n Centroids.emplace_back(-1, -1, 0);\\n s.emplace(0, -1);\\n TreeIndex[0] = 0;\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n if (to == NextPath[p.first]) {\\n TreeIndex[to] = TreeIndex[p.first];\\n } else {\\n TreeIndex[to] = (int)Centroids.size();\\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\\n Centroids[TreeIndex[p.first]].Deep + 1);\\n }\\n s.emplace(to, p.first);\\n }\\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\\n }\\n }\\n void AddEdge(int x, int y) {\\n graph[x].push_back(y);\\n graph[y].push_back(x);\\n }\\n virtual void Build() {\\n BuildSubTreeSize();\\n BuildPath();\\n }\\n inline size_t size() { return (Centroids.size()); }\\n inline pair<int, int> Information(int idx) {\\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\\n }\\n inline Centroid &operator[](int k) { return (Centroids[k]); }\\n inline int LCA(int a, int b) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n return (Centroids[TreeIdxA][TreeDepthA]);\\n }\\n inline virtual void query(int a, int b,\\n const function<void(int, int, int)> &f) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n f(TreeIdxA, 0, TreeDepthA + 1);\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n f(TreeIdxB, 0, TreeDepthB + 1);\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\\n }\\n CentroidPathDecomposition(int SZ) {\\n graph.resize(SZ);\\n SubTreeSize.assign(SZ, -1);\\n NextPath.resize(SZ);\\n TreeIndex.resize(SZ);\\n TreeDepth.resize(SZ);\\n }\\n};\\nOrderedMultiSet<int> tree(5000000);\\nOrderedMultiSet<int>::Node *nodes[100000];\\nint N, Q, X[100000];\\nvector<int> g[100000];\\nint parent[100000];\\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\\n parent[idx] = par;\\n tree.insert_key(par_set, X[idx]);\\n nodes[idx] = par_set;\\n for (auto &to : g[idx])\\n if (to != par)\\n dfs(to, idx, par_set);\\n}\\nint main() {\\n scanf(\\\"%d %d\\\", &N, &Q);\\n CentroidPathDecomposition gg(N);\\n vector<int> vs;\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &X[i]);\\n vs.emplace_back(X[i]);\\n }\\n sort(begin(vs), end(vs));\\n vs.erase(unique(begin(vs), end(vs)), end(vs));\\n for (int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n gg.AddEdge(x, y);\\n }\\n dfs(0, -1, tree.makeset());\\n gg.Build();\\n for (int i = 0; i < Q; i++) {\\n int x, y, z;\\n scanf(\\\"%d %d %d\\\", &x, &y, &z);\\n --x, --y;\\n int lca = gg.LCA(x, y);\\n int ng = -1, ok = (int)vs.size() - 1;\\n auto sum = [&](int v) {\\n int ret = 0;\\n ret += tree.upper_bound(nodes[x], vs[v]);\\n ret += tree.upper_bound(nodes[y], vs[v]);\\n ret -= tree.upper_bound(nodes[lca], vs[v]);\\n if (lca)\\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\\n return ret;\\n };\\n while (ok - ng > 1) {\\n int mid = (ok + ng) >> 1;\\n if (sum(mid) >= z)\\n ok = mid;\\n else\\n ng = mid;\\n }\\n printf(\\\"%d\\\\n\\\", vs[ok]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1050,\n \"memory_kb\": 136032,\n \"score_of_the_acc\": -1.3567,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2270_8113355\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class Key> struct RandomizedBinarySearchTree {\\n inline int xor128() {\\n static int x = 123456789;\\n static int y = 362436069;\\n static int z = 521288629;\\n static int w = 88675123;\\n int t;\\n t = x ^ (x << 11);\\n x = y;\\n y = z;\\n z = w;\\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n }\\n struct Node {\\n Node *l, *r;\\n int cnt;\\n Key key;\\n Node() {}\\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\\n };\\n vector<Node> pool;\\n int ptr;\\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\\n virtual Node *clone(Node *t) { return t; }\\n inline int count(const Node *t) { return t ? t->cnt : 0; }\\n inline Node *update(Node *t) {\\n t->cnt = count(t->l) + count(t->r) + 1;\\n return t;\\n }\\n Node *propagete(Node *t) { return update(clone(t)); }\\n Node *merge(Node *l, Node *r) {\\n if (!l || !r)\\n return l ? l : r;\\n if (xor128() % (l->cnt + r->cnt) != l->cnt) {\\n l = propagete(l);\\n l->r = merge(l->r, r);\\n return update(l);\\n } else {\\n r = propagete(r);\\n r->l = merge(l, r->l);\\n return update(r);\\n }\\n }\\n pair<Node *, Node *> split(Node *t, int k) {\\n if (!t)\\n return {t, t};\\n t = propagete(t);\\n if (k <= count(t->l)) {\\n auto s = split(t->l, k);\\n t->l = s.second;\\n return {s.first, update(t)};\\n } else {\\n auto s = split(t->r, k - count(t->l) - 1);\\n t->r = s.first;\\n return {update(t), s.second};\\n }\\n }\\n Node *build(int l, int r, const vector<Key> &v) {\\n if (l + 1 >= r)\\n return alloc(v[l]);\\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\\n }\\n Node *build(const vector<Key> &v) {\\n ptr = 0;\\n return build(0, (int)v.size(), v);\\n }\\n void dump(Node *r, typename vector<Key>::iterator &it) {\\n if (!r)\\n return;\\n r = propagete(r);\\n dump(r->l, it);\\n *it = r->key;\\n dump(r->r, ++it);\\n }\\n vector<Key> dump(Node *r) {\\n vector<Key> v((size_t)count(r));\\n auto it = begin(v);\\n dump(r, it);\\n return v;\\n }\\n string to_string(Node *r) {\\n auto s = dump(r);\\n string ret;\\n for (int i = 0; i < s.size(); i++)\\n ret += \\\", \\\";\\n return (ret);\\n }\\n void insert(Node *&t, int k, const Key &v) {\\n auto x = split(t, k);\\n t = merge(merge(x.first, alloc(v)), x.second);\\n }\\n void erase(Node *&t, int k) {\\n auto x = split(t, k);\\n t = merge(x.first, split(x.second, 1).second);\\n }\\n int size(Node *t) { return count(t); }\\n bool empty(Node *t) { return !t; }\\n Node *makeset() { return (nullptr); }\\n};\\ntemplate <class Key>\\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\\n using RBST = RandomizedBinarySearchTree<Key>;\\n using Node = typename RBST::Node;\\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\\n};\\ntemplate <class T>\\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\\n using RBST = PresidentRandomizedBinarySearchTree<T>;\\n using Node = typename RBST::Node;\\n OrderedMultiSet(int sz) : RBST(sz) {}\\n T kth_element(Node *t, int k) {\\n if (k < RBST::count(t->l))\\n return kth_element(t->l, k);\\n if (k == RBST::count(t->l))\\n return t->key;\\n return kth_element(t->r, k - RBST::count(t->l) - 1);\\n }\\n virtual void insert_key(Node *&t, const T &x) {\\n RBST::insert(t, lower_bound(t, x), x);\\n }\\n void erase_key(Node *&t, const T &x) {\\n if (!count(t, x))\\n return;\\n RBST::erase(t, lower_bound(t, x));\\n }\\n int count(Node *t, const T &x) {\\n return upper_bound(t, x) - lower_bound(t, x);\\n }\\n int lower_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x <= t->key)\\n return lower_bound(t->l, x);\\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n int upper_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x < t->key)\\n return upper_bound(t->l, x);\\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n};\\nstruct CentroidPathDecomposition {\\n struct Centroid {\\n int ParIndex, ParDepth, Deep;\\n vector<int> node;\\n Centroid(int idx, int dep, int deep)\\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\\n inline size_t size() { return (node.size()); }\\n inline int &operator[](int k) { return (node[k]); }\\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\\n };\\n vector<vector<int>> graph;\\n vector<int> SubTreeSize, NextPath;\\n vector<int> TreeIndex, TreeDepth;\\n vector<Centroid> Centroids;\\n void BuildSubTreeSize() {\\n stack<pair<int, int>> s;\\n s.emplace(0, -1);\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n if (~SubTreeSize[p.first]) {\\n NextPath[p.first] = -1;\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n SubTreeSize[p.first] += SubTreeSize[to];\\n if (NextPath[p.first] == -1 ||\\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\\n NextPath[p.first] = to;\\n }\\n }\\n } else {\\n s.push(p);\\n SubTreeSize[p.first] = 1;\\n for (auto &to : graph[p.first]) {\\n if (p.second != to)\\n s.emplace(to, p.first);\\n }\\n }\\n }\\n }\\n void BuildPath() {\\n stack<pair<int, int>> s;\\n Centroids.emplace_back(-1, -1, 0);\\n s.emplace(0, -1);\\n TreeIndex[0] = 0;\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n if (to == NextPath[p.first]) {\\n TreeIndex[to] = TreeIndex[p.first];\\n } else {\\n TreeIndex[to] = (int)Centroids.size();\\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\\n Centroids[TreeIndex[p.first]].Deep + 1);\\n }\\n s.emplace(to, p.first);\\n }\\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\\n }\\n }\\n void AddEdge(int x, int y) {\\n graph[x].push_back(y);\\n graph[y].push_back(x);\\n }\\n virtual void Build() {\\n BuildSubTreeSize();\\n BuildPath();\\n }\\n inline size_t size() { return (Centroids.size()); }\\n inline pair<int, int> Information(int idx) {\\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\\n }\\n inline Centroid &operator[](int k) { return (Centroids[k]); }\\n inline int LCA(int a, int b) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n return (Centroids[TreeIdxA][TreeDepthA]);\\n }\\n inline virtual void query(int a, int b,\\n const function<void(int, int, int)> &f) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n f(TreeIdxA, 0, TreeDepthA + 1);\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n f(TreeIdxB, 0, TreeDepthB + 1);\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\\n }\\n CentroidPathDecomposition(int SZ) {\\n graph.resize(SZ);\\n SubTreeSize.assign(SZ, -1);\\n NextPath.resize(SZ);\\n TreeIndex.resize(SZ);\\n TreeDepth.resize(SZ);\\n }\\n};\\nOrderedMultiSet<int> tree(5000000);\\nOrderedMultiSet<int>::Node *nodes[100000];\\nint N, Q, X[100000];\\nvector<int> g[100000];\\nint parent[100000];\\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\\n parent[idx] = par;\\n tree.insert_key(par_set, X[idx]);\\n nodes[idx] = par_set;\\n for (auto &to : g[idx])\\n if (to != par)\\n dfs(to, idx, par_set);\\n}\\nint main() {\\n scanf(\\\"%d %d\\\", &N, &Q);\\n CentroidPathDecomposition gg(N);\\n vector<int> vs;\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &X[i]);\\n vs.emplace_back(X[i]);\\n }\\n sort(begin(vs), end(vs));\\n vs.erase(unique(begin(vs), end(vs)), end(vs));\\n for (int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n gg.AddEdge(x, y);\\n }\\n dfs(0, -1, tree.makeset());\\n gg.Build();\\n for (int i = 0; i < Q; i++) {\\n int x, y, z;\\n scanf(\\\"%d %d %d\\\", &x, &y, &z);\\n --x, --y;\\n int lca = gg.LCA(x, y);\\n int ng = -1, ok = (int)vs.size() - 1;\\n auto sum = [&](int v) {\\n int ret = 0;\\n ret += tree.upper_bound(nodes[x], vs[v]);\\n ret += tree.upper_bound(nodes[y], vs[v]);\\n ret -= tree.upper_bound(nodes[lca], vs[v]);\\n if (lca)\\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\\n return ret;\\n };\\n while (ok - ng > 1) {\\n int mid = (ok + ng) >> 1;\\n if (sum(mid) >= z)\\n ok = mid;\\n else\\n ng = mid;\\n }\\n printf(\\\"%d\\\\n\\\", vs[ok]);\\n }\\n}\",\n \"accuracy\": 0.7096774193548387,\n \"time_ms\": 380,\n \"memory_kb\": 107812,\n \"score_of_the_acc\": -0.9077,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2270_8113353\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class Key> struct RandomizedBinarySearchTree {\\n inline int xor128() {\\n static int x = 123456789;\\n static int y = 362436069;\\n static int z = 521288629;\\n static int w = 88675123;\\n int t;\\n t = x ^ (x << 11);\\n x = y;\\n y = z;\\n z = w;\\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n }\\n struct Node {\\n Node *l, *r;\\n int cnt;\\n Key key;\\n Node() {}\\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\\n };\\n vector<Node> pool;\\n int ptr;\\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\\n virtual Node *clone(Node *t) { return t; }\\n inline int count(const Node *t) { return t ? t->cnt : 0; }\\n inline Node *update(Node *t) {\\n t->cnt = count(t->l) + count(t->r) + 1;\\n return t;\\n }\\n Node *propagete(Node *t) { return update(clone(t)); }\\n Node *merge(Node *l, Node *r) {\\n if (!l || !r)\\n return l ? l : r;\\n if ((xor128() % (l->cnt + r->cnt)) < l->cnt) {\\n l = propagete(l);\\n l->r = merge(l->r, r);\\n return update(l);\\n } else {\\n r = propagete(r);\\n r->l = merge(l, r->l);\\n return update(r);\\n }\\n }\\n pair<Node *, Node *> split(Node *t, int k) {\\n if (!t)\\n return {t, t};\\n t = propagete(t);\\n if (k <= count(t->l)) {\\n auto s = split(t->l, k);\\n t->l = s.second;\\n return {s.first, update(t)};\\n } else {\\n auto s = split(t->r, k - count(t->l) - 1);\\n t->r = s.first;\\n return {update(t), s.second};\\n }\\n }\\n Node *build(int l, int r, const vector<Key> &v) {\\n if (l + 1 >= r)\\n return alloc(v[l]);\\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\\n }\\n Node *build(const vector<Key> &v) {\\n ptr = 0;\\n return build(0, (int)v.size(), v);\\n }\\n void dump(Node *r, typename vector<Key>::iterator &it) {\\n if (!r)\\n return;\\n r = propagete(r);\\n dump(r->l, it);\\n *it = r->key;\\n dump(r->r, ++it);\\n }\\n vector<Key> dump(Node *r) {\\n vector<Key> v((size_t)count(r));\\n auto it = begin(v);\\n dump(r, it);\\n return v;\\n }\\n string to_string(Node *r) {\\n auto s = dump(r);\\n string ret;\\n for (int i = 0; i < s.size(); i++)\\n ret += \\\", \\\";\\n return (ret);\\n }\\n void insert(Node *&t, int k, const Key &v) {\\n auto x = split(t, k);\\n t = merge(merge(x.first, alloc(v)), x.second);\\n }\\n void erase(Node *&t, int k) {\\n auto x = split(t, k);\\n t = merge(x.first, split(x.second, 1).second);\\n }\\n int size(Node *t) { return count(t); }\\n bool empty(Node *t) { return !t; }\\n Node *makeset() { return (nullptr); }\\n};\\ntemplate <class Key>\\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\\n using RBST = RandomizedBinarySearchTree<Key>;\\n using Node = typename RBST::Node;\\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\\n};\\ntemplate <class T>\\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\\n using RBST = PresidentRandomizedBinarySearchTree<T>;\\n using Node = typename RBST::Node;\\n OrderedMultiSet(int sz) : RBST(sz) {}\\n T kth_element(Node *t, int k) {\\n if (k < RBST::count(t->l))\\n return kth_element(t->l, k);\\n if (k == RBST::count(t->l))\\n return t->key;\\n return kth_element(t->r, k - RBST::count(t->l) - 1);\\n }\\n virtual void insert_key(Node *&t, const T &x) {\\n RBST::insert(t, lower_bound(t, x), x);\\n }\\n void erase_key(Node *&t, const T &x) {\\n if (!count(t, x))\\n return;\\n RBST::erase(t, lower_bound(t, x));\\n }\\n int count(Node *t, const T &x) {\\n return upper_bound(t, x) - lower_bound(t, x);\\n }\\n int lower_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x <= t->key)\\n return lower_bound(t->l, x);\\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n int upper_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x < t->key)\\n return upper_bound(t->l, x);\\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n};\\nstruct CentroidPathDecomposition {\\n struct Centroid {\\n int ParIndex, ParDepth, Deep;\\n vector<int> node;\\n Centroid(int idx, int dep, int deep)\\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\\n inline size_t size() { return (node.size()); }\\n inline int &operator[](int k) { return (node[k]); }\\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\\n };\\n vector<vector<int>> graph;\\n vector<int> SubTreeSize, NextPath;\\n vector<int> TreeIndex, TreeDepth;\\n vector<Centroid> Centroids;\\n void BuildSubTreeSize() {\\n stack<pair<int, int>> s;\\n s.emplace(0, -1);\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n if (~SubTreeSize[p.first]) {\\n NextPath[p.first] = -1;\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n SubTreeSize[p.first] += SubTreeSize[to];\\n if (NextPath[p.first] == -1 ||\\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\\n NextPath[p.first] = to;\\n }\\n }\\n } else {\\n s.push(p);\\n SubTreeSize[p.first] = 1;\\n for (auto &to : graph[p.first]) {\\n if (p.second != to)\\n s.emplace(to, p.first);\\n }\\n }\\n }\\n }\\n void BuildPath() {\\n stack<pair<int, int>> s;\\n Centroids.emplace_back(-1, -1, 0);\\n s.emplace(0, -1);\\n TreeIndex[0] = 0;\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n if (to == NextPath[p.first]) {\\n TreeIndex[to] = TreeIndex[p.first];\\n } else {\\n TreeIndex[to] = (int)Centroids.size();\\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\\n Centroids[TreeIndex[p.first]].Deep + 1);\\n }\\n s.emplace(to, p.first);\\n }\\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\\n }\\n }\\n void AddEdge(int x, int y) {\\n graph[x].push_back(y);\\n graph[y].push_back(x);\\n }\\n virtual void Build() {\\n BuildSubTreeSize();\\n BuildPath();\\n }\\n inline size_t size() { return (Centroids.size()); }\\n inline pair<int, int> Information(int idx) {\\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\\n }\\n inline Centroid &operator[](int k) { return (Centroids[k]); }\\n inline int LCA(int a, int b) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n return (Centroids[TreeIdxA][TreeDepthA]);\\n }\\n inline virtual void query(int a, int b,\\n const function<void(int, int, int)> &f) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n f(TreeIdxA, 0, TreeDepthA + 1);\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n f(TreeIdxB, 0, TreeDepthB + 1);\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\\n }\\n CentroidPathDecomposition(int SZ) {\\n graph.resize(SZ);\\n SubTreeSize.assign(SZ, -1);\\n NextPath.resize(SZ);\\n TreeIndex.resize(SZ);\\n TreeDepth.resize(SZ);\\n }\\n};\\nOrderedMultiSet<int> tree(5000000);\\nOrderedMultiSet<int>::Node *nodes[100000];\\nint N, Q, X[100000];\\nvector<int> g[100000];\\nint parent[100000];\\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\\n parent[idx] = par;\\n tree.insert_key(par_set, X[idx]);\\n nodes[idx] = par_set;\\n for (auto &to : g[idx])\\n if (to != par)\\n dfs(to, idx, par_set);\\n}\\nint main() {\\n scanf(\\\"%d %d\\\", &N, &Q);\\n CentroidPathDecomposition gg(N);\\n vector<int> vs;\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &X[i]);\\n vs.emplace_back(X[i]);\\n }\\n sort(begin(vs), end(vs));\\n vs.erase(unique(begin(vs), end(vs)), end(vs));\\n for (int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n gg.AddEdge(x, y);\\n }\\n dfs(0, -1, tree.makeset());\\n gg.Build();\\n for (int i = 0; i < Q; i++) {\\n int x, y, z;\\n scanf(\\\"%d %d %d\\\", &x, &y, &z);\\n --x, --y;\\n int lca = gg.LCA(x, y);\\n int ng = -1, ok = (int)vs.size() - 1;\\n auto sum = [&](int v) {\\n int ret = 0;\\n ret += tree.upper_bound(nodes[x], vs[v]);\\n ret += tree.upper_bound(nodes[y], vs[v]);\\n ret -= tree.upper_bound(nodes[lca], vs[v]);\\n if (lca)\\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\\n return ret;\\n };\\n while (ok - ng > 1) {\\n int mid = (ok + ng) >> 1;\\n if (sum(mid) >= z)\\n ok = mid;\\n else\\n ng = mid;\\n }\\n printf(\\\"%d\\\\n\\\", vs[ok]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 860,\n \"memory_kb\": 133224,\n \"score_of_the_acc\": -1.268,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2270_8113351\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class Key> struct RandomizedBinarySearchTree {\\n inline int xor128() {\\n static int x = 123456789;\\n static int y = 362436069;\\n static int z = 521288629;\\n static int w = 88675123;\\n int t;\\n t = x ^ (x << 11);\\n x = y;\\n y = z;\\n z = w;\\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n }\\n struct Node {\\n Node *l, *r;\\n int cnt;\\n Key key;\\n Node() {}\\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\\n };\\n vector<Node> pool;\\n int ptr;\\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\\n virtual Node *clone(Node *t) { return t; }\\n inline int count(const Node *t) { return t ? t->cnt : 0; }\\n inline Node *update(Node *t) {\\n t->cnt = count(t->l) + count(t->r) + 1;\\n return t;\\n }\\n Node *propagete(Node *t) { return update(clone(t)); }\\n Node *merge(Node *l, Node *r) {\\n if (!l || !r)\\n return l ? l : r;\\n if (xor128() % (l->cnt + r->cnt) == l->cnt) {\\n l = propagete(l);\\n l->r = merge(l->r, r);\\n return update(l);\\n } else {\\n r = propagete(r);\\n r->l = merge(l, r->l);\\n return update(r);\\n }\\n }\\n pair<Node *, Node *> split(Node *t, int k) {\\n if (!t)\\n return {t, t};\\n t = propagete(t);\\n if (k <= count(t->l)) {\\n auto s = split(t->l, k);\\n t->l = s.second;\\n return {s.first, update(t)};\\n } else {\\n auto s = split(t->r, k - count(t->l) - 1);\\n t->r = s.first;\\n return {update(t), s.second};\\n }\\n }\\n Node *build(int l, int r, const vector<Key> &v) {\\n if (l + 1 >= r)\\n return alloc(v[l]);\\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\\n }\\n Node *build(const vector<Key> &v) {\\n ptr = 0;\\n return build(0, (int)v.size(), v);\\n }\\n void dump(Node *r, typename vector<Key>::iterator &it) {\\n if (!r)\\n return;\\n r = propagete(r);\\n dump(r->l, it);\\n *it = r->key;\\n dump(r->r, ++it);\\n }\\n vector<Key> dump(Node *r) {\\n vector<Key> v((size_t)count(r));\\n auto it = begin(v);\\n dump(r, it);\\n return v;\\n }\\n string to_string(Node *r) {\\n auto s = dump(r);\\n string ret;\\n for (int i = 0; i < s.size(); i++)\\n ret += \\\", \\\";\\n return (ret);\\n }\\n void insert(Node *&t, int k, const Key &v) {\\n auto x = split(t, k);\\n t = merge(merge(x.first, alloc(v)), x.second);\\n }\\n void erase(Node *&t, int k) {\\n auto x = split(t, k);\\n t = merge(x.first, split(x.second, 1).second);\\n }\\n int size(Node *t) { return count(t); }\\n bool empty(Node *t) { return !t; }\\n Node *makeset() { return (nullptr); }\\n};\\ntemplate <class Key>\\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\\n using RBST = RandomizedBinarySearchTree<Key>;\\n using Node = typename RBST::Node;\\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\\n};\\ntemplate <class T>\\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\\n using RBST = PresidentRandomizedBinarySearchTree<T>;\\n using Node = typename RBST::Node;\\n OrderedMultiSet(int sz) : RBST(sz) {}\\n T kth_element(Node *t, int k) {\\n if (k < RBST::count(t->l))\\n return kth_element(t->l, k);\\n if (k == RBST::count(t->l))\\n return t->key;\\n return kth_element(t->r, k - RBST::count(t->l) - 1);\\n }\\n virtual void insert_key(Node *&t, const T &x) {\\n RBST::insert(t, lower_bound(t, x), x);\\n }\\n void erase_key(Node *&t, const T &x) {\\n if (!count(t, x))\\n return;\\n RBST::erase(t, lower_bound(t, x));\\n }\\n int count(Node *t, const T &x) {\\n return upper_bound(t, x) - lower_bound(t, x);\\n }\\n int lower_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x <= t->key)\\n return lower_bound(t->l, x);\\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n int upper_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x < t->key)\\n return upper_bound(t->l, x);\\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n};\\nstruct CentroidPathDecomposition {\\n struct Centroid {\\n int ParIndex, ParDepth, Deep;\\n vector<int> node;\\n Centroid(int idx, int dep, int deep)\\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\\n inline size_t size() { return (node.size()); }\\n inline int &operator[](int k) { return (node[k]); }\\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\\n };\\n vector<vector<int>> graph;\\n vector<int> SubTreeSize, NextPath;\\n vector<int> TreeIndex, TreeDepth;\\n vector<Centroid> Centroids;\\n void BuildSubTreeSize() {\\n stack<pair<int, int>> s;\\n s.emplace(0, -1);\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n if (~SubTreeSize[p.first]) {\\n NextPath[p.first] = -1;\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n SubTreeSize[p.first] += SubTreeSize[to];\\n if (NextPath[p.first] == -1 ||\\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\\n NextPath[p.first] = to;\\n }\\n }\\n } else {\\n s.push(p);\\n SubTreeSize[p.first] = 1;\\n for (auto &to : graph[p.first]) {\\n if (p.second != to)\\n s.emplace(to, p.first);\\n }\\n }\\n }\\n }\\n void BuildPath() {\\n stack<pair<int, int>> s;\\n Centroids.emplace_back(-1, -1, 0);\\n s.emplace(0, -1);\\n TreeIndex[0] = 0;\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n if (to == NextPath[p.first]) {\\n TreeIndex[to] = TreeIndex[p.first];\\n } else {\\n TreeIndex[to] = (int)Centroids.size();\\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\\n Centroids[TreeIndex[p.first]].Deep + 1);\\n }\\n s.emplace(to, p.first);\\n }\\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\\n }\\n }\\n void AddEdge(int x, int y) {\\n graph[x].push_back(y);\\n graph[y].push_back(x);\\n }\\n virtual void Build() {\\n BuildSubTreeSize();\\n BuildPath();\\n }\\n inline size_t size() { return (Centroids.size()); }\\n inline pair<int, int> Information(int idx) {\\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\\n }\\n inline Centroid &operator[](int k) { return (Centroids[k]); }\\n inline int LCA(int a, int b) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n return (Centroids[TreeIdxA][TreeDepthA]);\\n }\\n inline virtual void query(int a, int b,\\n const function<void(int, int, int)> &f) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n f(TreeIdxA, 0, TreeDepthA + 1);\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n f(TreeIdxB, 0, TreeDepthB + 1);\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\\n }\\n CentroidPathDecomposition(int SZ) {\\n graph.resize(SZ);\\n SubTreeSize.assign(SZ, -1);\\n NextPath.resize(SZ);\\n TreeIndex.resize(SZ);\\n TreeDepth.resize(SZ);\\n }\\n};\\nOrderedMultiSet<int> tree(5000000);\\nOrderedMultiSet<int>::Node *nodes[100000];\\nint N, Q, X[100000];\\nvector<int> g[100000];\\nint parent[100000];\\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\\n parent[idx] = par;\\n tree.insert_key(par_set, X[idx]);\\n nodes[idx] = par_set;\\n for (auto &to : g[idx])\\n if (to != par)\\n dfs(to, idx, par_set);\\n}\\nint main() {\\n scanf(\\\"%d %d\\\", &N, &Q);\\n CentroidPathDecomposition gg(N);\\n vector<int> vs;\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &X[i]);\\n vs.emplace_back(X[i]);\\n }\\n sort(begin(vs), end(vs));\\n vs.erase(unique(begin(vs), end(vs)), end(vs));\\n for (int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n gg.AddEdge(x, y);\\n }\\n dfs(0, -1, tree.makeset());\\n gg.Build();\\n for (int i = 0; i < Q; i++) {\\n int x, y, z;\\n scanf(\\\"%d %d %d\\\", &x, &y, &z);\\n --x, --y;\\n int lca = gg.LCA(x, y);\\n int ng = -1, ok = (int)vs.size() - 1;\\n auto sum = [&](int v) {\\n int ret = 0;\\n ret += tree.upper_bound(nodes[x], vs[v]);\\n ret += tree.upper_bound(nodes[y], vs[v]);\\n ret -= tree.upper_bound(nodes[lca], vs[v]);\\n if (lca)\\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\\n return ret;\\n };\\n while (ok - ng > 1) {\\n int mid = (ok + ng) >> 1;\\n if (sum(mid) >= z)\\n ok = mid;\\n else\\n ng = mid;\\n }\\n printf(\\\"%d\\\\n\\\", vs[ok]);\\n }\\n}\",\n \"accuracy\": 0.7096774193548387,\n \"time_ms\": 360,\n \"memory_kb\": 138016,\n \"score_of_the_acc\": -1.125,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2270_8113349\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class Key> struct RandomizedBinarySearchTree {\\n inline int xor128() {\\n static int x = 123456789;\\n static int y = 362436069;\\n static int z = 521288629;\\n static int w = 88675123;\\n int t;\\n t = x ^ (x << 11);\\n x = y;\\n y = z;\\n z = w;\\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\\n }\\n struct Node {\\n Node *l, *r;\\n int cnt;\\n Key key;\\n Node() {}\\n Node(const Key &k) : cnt(1), key(k), l(nullptr), r(nullptr) {}\\n };\\n vector<Node> pool;\\n int ptr;\\n RandomizedBinarySearchTree(int sz) : pool(sz), ptr(0) {}\\n inline Node *alloc(const Key &key) { return &(pool[ptr++] = Node(key)); }\\n virtual Node *clone(Node *t) { return t; }\\n inline int count(const Node *t) { return t ? t->cnt : 0; }\\n inline Node *update(Node *t) {\\n t->cnt = count(t->l) + count(t->r) + 1;\\n return t;\\n }\\n Node *propagete(Node *t) { return update(clone(t)); }\\n Node *merge(Node *l, Node *r) {\\n if (!l || !r)\\n return l ? l : r;\\n if (xor128() % l->cnt < r->cnt) {\\n l = propagete(l);\\n l->r = merge(l->r, r);\\n return update(l);\\n } else {\\n r = propagete(r);\\n r->l = merge(l, r->l);\\n return update(r);\\n }\\n }\\n pair<Node *, Node *> split(Node *t, int k) {\\n if (!t)\\n return {t, t};\\n t = propagete(t);\\n if (k <= count(t->l)) {\\n auto s = split(t->l, k);\\n t->l = s.second;\\n return {s.first, update(t)};\\n } else {\\n auto s = split(t->r, k - count(t->l) - 1);\\n t->r = s.first;\\n return {update(t), s.second};\\n }\\n }\\n Node *build(int l, int r, const vector<Key> &v) {\\n if (l + 1 >= r)\\n return alloc(v[l]);\\n return merge(build(l, (l + r) >> 1, v), build((l + r) >> 1, r, v));\\n }\\n Node *build(const vector<Key> &v) {\\n ptr = 0;\\n return build(0, (int)v.size(), v);\\n }\\n void dump(Node *r, typename vector<Key>::iterator &it) {\\n if (!r)\\n return;\\n r = propagete(r);\\n dump(r->l, it);\\n *it = r->key;\\n dump(r->r, ++it);\\n }\\n vector<Key> dump(Node *r) {\\n vector<Key> v((size_t)count(r));\\n auto it = begin(v);\\n dump(r, it);\\n return v;\\n }\\n string to_string(Node *r) {\\n auto s = dump(r);\\n string ret;\\n for (int i = 0; i < s.size(); i++)\\n ret += \\\", \\\";\\n return (ret);\\n }\\n void insert(Node *&t, int k, const Key &v) {\\n auto x = split(t, k);\\n t = merge(merge(x.first, alloc(v)), x.second);\\n }\\n void erase(Node *&t, int k) {\\n auto x = split(t, k);\\n t = merge(x.first, split(x.second, 1).second);\\n }\\n int size(Node *t) { return count(t); }\\n bool empty(Node *t) { return !t; }\\n Node *makeset() { return (nullptr); }\\n};\\ntemplate <class Key>\\nstruct PresidentRandomizedBinarySearchTree : RandomizedBinarySearchTree<Key> {\\n using RBST = RandomizedBinarySearchTree<Key>;\\n using Node = typename RBST::Node;\\n PresidentRandomizedBinarySearchTree(int sz) : RBST(sz) {}\\n Node *clone(Node *t) override { return &(RBST::pool[RBST::ptr++] = *t); }\\n Node *rebuild(Node *r) { return RBST::build(RBST::dump(r)); }\\n};\\ntemplate <class T>\\nstruct OrderedMultiSet : PresidentRandomizedBinarySearchTree<T> {\\n using RBST = PresidentRandomizedBinarySearchTree<T>;\\n using Node = typename RBST::Node;\\n OrderedMultiSet(int sz) : RBST(sz) {}\\n T kth_element(Node *t, int k) {\\n if (k < RBST::count(t->l))\\n return kth_element(t->l, k);\\n if (k == RBST::count(t->l))\\n return t->key;\\n return kth_element(t->r, k - RBST::count(t->l) - 1);\\n }\\n virtual void insert_key(Node *&t, const T &x) {\\n RBST::insert(t, lower_bound(t, x), x);\\n }\\n void erase_key(Node *&t, const T &x) {\\n if (!count(t, x))\\n return;\\n RBST::erase(t, lower_bound(t, x));\\n }\\n int count(Node *t, const T &x) {\\n return upper_bound(t, x) - lower_bound(t, x);\\n }\\n int lower_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x <= t->key)\\n return lower_bound(t->l, x);\\n return lower_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n int upper_bound(Node *t, const T &x) {\\n if (!t)\\n return 0;\\n if (x < t->key)\\n return upper_bound(t->l, x);\\n return upper_bound(t->r, x) + RBST::count(t->l) + 1;\\n }\\n};\\nstruct CentroidPathDecomposition {\\n struct Centroid {\\n int ParIndex, ParDepth, Deep;\\n vector<int> node;\\n Centroid(int idx, int dep, int deep)\\n : ParIndex(idx), ParDepth(dep), Deep(deep) {}\\n inline size_t size() { return (node.size()); }\\n inline int &operator[](int k) { return (node[k]); }\\n inline pair<int, int> Up() { return (make_pair(ParIndex, ParDepth)); }\\n };\\n vector<vector<int>> graph;\\n vector<int> SubTreeSize, NextPath;\\n vector<int> TreeIndex, TreeDepth;\\n vector<Centroid> Centroids;\\n void BuildSubTreeSize() {\\n stack<pair<int, int>> s;\\n s.emplace(0, -1);\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n if (~SubTreeSize[p.first]) {\\n NextPath[p.first] = -1;\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n SubTreeSize[p.first] += SubTreeSize[to];\\n if (NextPath[p.first] == -1 ||\\n SubTreeSize[NextPath[p.first]] < SubTreeSize[to]) {\\n NextPath[p.first] = to;\\n }\\n }\\n } else {\\n s.push(p);\\n SubTreeSize[p.first] = 1;\\n for (auto &to : graph[p.first]) {\\n if (p.second != to)\\n s.emplace(to, p.first);\\n }\\n }\\n }\\n }\\n void BuildPath() {\\n stack<pair<int, int>> s;\\n Centroids.emplace_back(-1, -1, 0);\\n s.emplace(0, -1);\\n TreeIndex[0] = 0;\\n while (!s.empty()) {\\n auto p = s.top();\\n s.pop();\\n TreeDepth[p.first] = (int)Centroids[TreeIndex[p.first]].size();\\n for (auto &to : graph[p.first]) {\\n if (p.second == to)\\n continue;\\n if (to == NextPath[p.first]) {\\n TreeIndex[to] = TreeIndex[p.first];\\n } else {\\n TreeIndex[to] = (int)Centroids.size();\\n Centroids.emplace_back(TreeIndex[p.first], TreeDepth[p.first],\\n Centroids[TreeIndex[p.first]].Deep + 1);\\n }\\n s.emplace(to, p.first);\\n }\\n Centroids[TreeIndex[p.first]].node.emplace_back(p.first);\\n }\\n }\\n void AddEdge(int x, int y) {\\n graph[x].push_back(y);\\n graph[y].push_back(x);\\n }\\n virtual void Build() {\\n BuildSubTreeSize();\\n BuildPath();\\n }\\n inline size_t size() { return (Centroids.size()); }\\n inline pair<int, int> Information(int idx) {\\n return (make_pair(TreeIndex[idx], TreeDepth[idx]));\\n }\\n inline Centroid &operator[](int k) { return (Centroids[k]); }\\n inline int LCA(int a, int b) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n return (Centroids[TreeIdxA][TreeDepthA]);\\n }\\n inline virtual void query(int a, int b,\\n const function<void(int, int, int)> &f) {\\n int TreeIdxA, TreeDepthA, TreeIdxB, TreeDepthB;\\n tie(TreeIdxA, TreeDepthA) = Information(a);\\n tie(TreeIdxB, TreeDepthB) = Information(b);\\n while (TreeIdxA != TreeIdxB) {\\n if (Centroids[TreeIdxA].Deep > Centroids[TreeIdxB].Deep) {\\n f(TreeIdxA, 0, TreeDepthA + 1);\\n tie(TreeIdxA, TreeDepthA) = Centroids[TreeIdxA].Up();\\n } else {\\n f(TreeIdxB, 0, TreeDepthB + 1);\\n tie(TreeIdxB, TreeDepthB) = Centroids[TreeIdxB].Up();\\n }\\n }\\n if (TreeDepthA > TreeDepthB)\\n swap(TreeDepthA, TreeDepthB);\\n f(TreeIdxA, TreeDepthA, TreeDepthB + 1);\\n }\\n CentroidPathDecomposition(int SZ) {\\n graph.resize(SZ);\\n SubTreeSize.assign(SZ, -1);\\n NextPath.resize(SZ);\\n TreeIndex.resize(SZ);\\n TreeDepth.resize(SZ);\\n }\\n};\\nOrderedMultiSet<int> tree(5000000);\\nOrderedMultiSet<int>::Node *nodes[100000];\\nint N, Q, X[100000];\\nvector<int> g[100000];\\nint parent[100000];\\nvoid dfs(int idx, int par, OrderedMultiSet<int>::Node *par_set) {\\n parent[idx] = par;\\n tree.insert_key(par_set, X[idx]);\\n nodes[idx] = par_set;\\n for (auto &to : g[idx])\\n if (to != par)\\n dfs(to, idx, par_set);\\n}\\nint main() {\\n scanf(\\\"%d %d\\\", &N, &Q);\\n CentroidPathDecomposition gg(N);\\n vector<int> vs;\\n for (int i = 0; i < N; i++) {\\n scanf(\\\"%d\\\", &X[i]);\\n vs.emplace_back(X[i]);\\n }\\n sort(begin(vs), end(vs));\\n vs.erase(unique(begin(vs), end(vs)), end(vs));\\n for (int i = 1; i < N; i++) {\\n int x, y;\\n scanf(\\\"%d %d\\\", &x, &y);\\n --x, --y;\\n g[x].emplace_back(y);\\n g[y].emplace_back(x);\\n gg.AddEdge(x, y);\\n }\\n dfs(0, -1, tree.makeset());\\n gg.Build();\\n for (int i = 0; i < Q; i++) {\\n int x, y, z;\\n scanf(\\\"%d %d %d\\\", &x, &y, &z);\\n --x, --y;\\n int lca = gg.LCA(x, y);\\n int ng = -1, ok = (int)vs.size() - 1;\\n auto sum = [&](int v) {\\n int ret = 0;\\n ret += tree.upper_bound(nodes[x], vs[v]);\\n ret += tree.upper_bound(nodes[y], vs[v]);\\n ret -= tree.upper_bound(nodes[lca], vs[v]);\\n if (lca)\\n ret -= tree.upper_bound(nodes[parent[lca]], vs[v]);\\n return ret;\\n };\\n while (ok - ng > 1) {\\n int mid = (ok + ng) >> 1;\\n if (sum(mid) >= z)\\n ok = mid;\\n else\\n ng = mid;\\n }\\n printf(\\\"%d\\\\n\\\", vs[ok]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1030,\n \"memory_kb\": 127132,\n \"score_of_the_acc\": -1.2834,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1259,"cells":{"group_id":{"kind":"string","value":"aoj_2274_cpp"},"problem_description":{"kind":"string","value":"問題 D\n列の構成\n問題文\n1\nから\nN\nまでの相異なる整数が\nN / 2\n個書かれたカードがいくつか与えられるので，次の条件を満たすような長さ\nN\nの数列\nseq\nを\n1\nつ作って出力して欲しい．\nseq\nの各要素は\n0\nか\n1\nである．\nすべてのカードについて以下が成り立つ： カードに書かれた数字を\ncard[1], ..., card[N/2]\nとする．このときカードに書かれた部分の和:\nseq[card[1]] + ... + seq[card[N/2]]\nが\nN / 8\n以上かつ\n3N / 8\n以下になっている．\n例えば，\nN = 8\nでカードが\n2\n枚渡され，カードに書かれている数字がそれぞれ\n[1, 2, 7, 8]\n，\n[4, 5, 7, 8]\nであったとする．このとき\nseq=[0, 1, 0, 1, 0, 1, 0, 1]\nや\nseq=[0, 0, 0, 0, 1, 1, 1, 1]\nとおくと条件を満たすようにできている．\n入力形式\n入力は次の形式で与えられる．\nN\nK\ncard\n1\n[1]\ncard\n1\n[2]\n...\ncard\n1\n[N/2]\ncard\n2\n[1]\ncard\n2\n[2]\n...\ncard\n2\n[N/2]\n...\ncard\nK\n[1]\ncard\nK\n[2]\n...\ncard\nK\n[N/2]\n1\n行目において\nN\nは構成するべき数列の長さ，\nK\nはカードの枚数である．\n続く\nK\n行には各カードの情報が与えられる．\ncard\ni\n[1], ..., card\ni\n[N/2]\nが\ni\n番目のカードに書かれている数字である．\n出力形式\nseq\nの\ni\n番目の要素が\ni\n文字目に対応するように数列\nseq\nを\n1\n行に出力せよ．\nなお，どの入力に対しても解は必ず少なくとも\n1\nつは存在する．\n制約\n8 ≤ N ≤ 1,000\n,\n1≤ K ≤ N / 2\nN\nは\n8\nの倍数\n1 ≤ card\ni\n[1] < card\ni\n[2] < ... < card\ni\n[N/2] ≤ N\n入出力例\n入力例 1\n8 2\n1 2 7 8\n4 5 7 8\n出力例 1\n01010101\n入力例 2\n8 3\n2 3 4 6\n3 4 5 8\n3 4 6 8\n出力例 2\n01110011"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2274_10809100","code_snippet":"#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<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 = 1000;\nconst int MAX_K = MAX_N / 2;\n\n/* typedef */\n\n/* global variables */\n\nint cards[MAX_K][MAX_N / 2];\nint seq[MAX_N];\n\n/* subroutines */\n\nvoid gen_seq(int n) {\n for (int i = 0; i < n; i++) seq[i] = rand() & 1;\n}\n\n/* main */\n\nint main() {\n srand(time(NULL));\n\n int n, k;\n cin >> n >> k;\n\n int nh = n / 2;\n int cmin = n / 8, cmax = 3 * cmin;\n\n memset(cards, 0, sizeof(cards));\n \n for (int i = 0; i < k; i++)\n for (int j = 0; j < nh; j++) {\n cin >> cards[i][j];\n cards[i][j]--;\n }\n\n for (;;) {\n gen_seq(n);\n\n bool ok = true;\n for (int i = 0; i < k; i++) {\n int cnt = 0;\n for (int j = 0; j < nh; j++) cnt += seq[cards[i][j]];\n if (cnt < cmin || cnt > cmax) {\n\tok = false;\n\tbreak;\n }\n }\n\n if (ok) break;\n }\n\n for (int i = 0; i < n; i++) cout << seq[i]; cout << endl;\n \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4424,"score_of_the_acc":-0.2538,"final_rank":7},{"submission_id":"aoj_2274_4299959","code_snippet":"#include <iostream>\n#include <cmath>\n#include <numeric>\n#include <algorithm>\n#include <deque>\n#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n#include <iomanip>\n#include <map>\n#include <stack>\n#include <queue>\n#include <functional>\n#include <climits>\n#include <numeric>\n#include <bitset>\n#include <random>\n#include <tuple>\n#include <initializer_list>\n#include <fstream>\n\nbool is_match(const std::vector<int>& set, const std::vector<std::vector<int>> &cards) {\n\tfor (const auto& card : cards) {\n\t\tint count{ 0 };\n\t\tfor (const auto& c : card) count += set[c];\n\t\tif (count * 8 < set.size() || set.size() * 3 < count * 8) return false;\n\t}\n\treturn true;\n}\nvoid set_random(std::vector<int>& set, std::mt19937& rand) {\n\tfor (auto& b : set) b = rand() & 1;\n}\nint main() {\n\tint n, k; std::cin >> n >> k;\n\tstd::vector<std::vector<int>> cards(k, std::vector<int>(n / 2));\n\tfor (auto& card : cards) for (auto& c : card) {\n\t\tstd::cin >> c; --c;\n\t}\n\tstd::vector<int> set(n);\n\tstd::mt19937 rand;\n\tset_random(set, rand);\n\twhile (!is_match(set, cards)) set_random(set, rand);\n\tfor (const auto& s : set) std::cout << s;\n\tstd::cout << std::endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3932,"score_of_the_acc":-0.3547,"final_rank":8},{"submission_id":"aoj_2274_3887774","code_snippet":"#include <iostream>\n#include <vector>\n#include <random>\nusing namespace std;\ntypedef long long int ll;\n\nint card[1100][1100];\nint seq[1100];\n\nint main(){\n\tint n,k; cin >> n >> k;\n\tfor(int i=0;i<k;i++){\n\t\tfor(int j=0;j<n/2;j++){\n\t\t\tcin >> card[i][j];\n\t\t\tcard[i][j]--;\n\t\t}\n\t}\n\trandom_device rnd;\n\tmt19937 mt(rnd());\n\twhile(1){\n\t\tfor(int i=0;i<n;i++){\n\t\t\tseq[i]=mt()%2;\n\t\t}\n\t\tbool ok=true;\n\t\tfor(int i=0;i<k;i++){\n\t\t\tint sum=0;\n\t\t\tfor(int j=0;j<n/2;j++){\n\t\t\t\tsum+=seq[card[i][j]];\n\t\t\t\tif(sum>3*n/8)ok=false;\n\t\t\t}\n\t\t\tif(sum<n/8)ok=false;\n\t\t\tif(!ok)break;\n\t\t}\n\t\tif(ok){\n\t\t\tfor(int i=0;i<n;i++){\n\t\t\t\tcout << seq[i];\n\t\t\t}\n\t\t\tcout << endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":5252,"score_of_the_acc":-0.4673,"final_rank":13},{"submission_id":"aoj_2274_3769172","code_snippet":"#include<iostream>\n#include<ctime>\n#include<cstdlib>\n\nusing namespace std;\n\nint main()\n{\n \n int n,k;\n int card[505][505];\n \n cin >> n >> k;\n for(int i=0;i<k;i++){\n for(int j=0;j<n/2;j++) cin >> card[i][j];\n }\n \n srand( (unsigned int)time(NULL) );\n \n int sum,cnt,ans[1010];\n \n do{\n \n for(int i=1;i<=n;i++) ans[i] = rand() % 2;\n \n cnt = 0;\n for(int i=0;i<k;i++){\n sum = 0;\n for(int j=0;j<n/2;j++){\n sum += ans[ card[i][j] ];\n }\n if(sum >= n/8 && sum <= 3*n/8) cnt++;\n }\n \n }while(cnt < k);\n \n for(int i=1;i<=n;i++) cout << ans[i];\n cout << endl;\n \n return(0);\n}","accuracy":1,"time_ms":30,"memory_kb":4100,"score_of_the_acc":-0.369,"final_rank":9},{"submission_id":"aoj_2274_3769163","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n \n int n,k;\n int card[505][505];\n \n cin >> n >> k;\n for(int i=0;i<k;i++){\n for(int j=0;j<n/2;j++) cin >> card[i][j];\n }\n \n srand( (unsigned int)time(NULL) );\n \n int sum,cnt,ans[1010];\n \n do{\n \n for(int i=1;i<=n;i++) ans[i] = rand() % 2;\n \n cnt = 0;\n for(int i=0;i<k;i++){\n sum = 0;\n for(int j=0;j<n/2;j++){\n sum += ans[ card[i][j] ];\n }\n if(sum >= n/8 && sum <= 3*n/8) cnt++;\n }\n \n }while(cnt < k);\n \n for(int i=1;i<=n;i++) cout << ans[i];\n cout << endl;\n \n return(0);\n}","accuracy":1,"time_ms":30,"memory_kb":4108,"score_of_the_acc":-0.3697,"final_rank":10},{"submission_id":"aoj_2274_3373996","code_snippet":"#include <cstdio>\n#include <climits>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <set>\n#include <cmath>\n#include <stack>\n#include <algorithm>\n#include <random>\n#include <iomanip>\n#include <map>\n#include <queue>\n#include <functional>\n#include <numeric>\n#include <chrono>\n#include <cstdlib>\nusing ll = long long;\nusing namespace std;\n\nconst ll MOD = 1e9 + 7;\nconst double pi = acos(-1);\ntypedef pair<int, int> P;\n#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))\n#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)\n#define EPS 1e-4\n#define OUTPUT(i) (cout << (ll)i << endl)\n#define ALL(a) ((a).begin(), (a).end())\n\nbool operator<(const pair<ll, ll> &a, const pair<ll, ll> &b)\n{\n\n if (a.first == b.first)\n return a.second < b.second;\n\n return a.first < b.first;\n}\n\nll gcd(ll a, ll b)\n{\n if (b == 0)\n return a;\n return gcd(b, a % b);\n}\nint N, K;\nint ub, lb;\nint ans[1008];\nvector<vector<int>> v(1001);\n\nbool check()\n{\n\n for (int i = 0; i < K; ++i)\n {\n int cnt = 0;\n for (int j = 0; j < N / 2; ++j)\n {\n cnt += ans[v[i][j]];\n }\n if (cnt < lb || cnt > ub)\n return false;\n }\n return true;\n}\n\nvoid solve()\n{\n for (int i = 0; i < N / 2; ++i)\n ans[i] = 1;\n while (1)\n {\n std::random_device seed_gen;\n std::mt19937 engine(seed_gen());\n shuffle(ans, ans + N, engine);\n if (check())\n break;\n }\n}\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n //cout << fixed << setprecision(15);\n\n cin >> N >> K;\n lb = N / 8;\n ub = 3 * lb;\n\n for (int i = 0; i < K; ++i)\n {\n for (int j = 0; j < N / 2; ++j)\n {\n int a;\n cin >> a;\n a--;\n v[i].push_back(a);\n }\n }\n solve();\n\n for (int i = 0; i < N; ++i)\n {\n cout << ans[i];\n }\n cout << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3784,"score_of_the_acc":-0.0563,"final_rank":2},{"submission_id":"aoj_2274_3097993","code_snippet":"#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n#include <list>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nlong long int INF = 1e18;\nlong long int MOD = 1e9 + 7;\n\nint card[550][550];\n\nint main(){\n\t\n\tint N, K;\n\tcin >> N >> K;\n\t\n\tfor(int i = 0; i < K; i++){\n\t\tfor(int j = 0; j < N / 2; j++){\n\t\t\tcin >> card[i][j];\n\t\t\tcard[i][j]--;\n\t\t}\n\t}\n\t\n\tint ans[1100];\n\t\n\twhile(true){\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tans[i] = rand() % 2;\n\t\t}\n\t\tbool flag = true;\n\t\tfor(int i = 0; i < K; i++){\n\t\t\tint cnt = 0;\n\t\t\tfor(int j = 0; j < N / 2; j++){\n\t\t\t\tcnt += ans[card[i][j]];\n\t\t\t}\n\t\t\tif(cnt < N / 8 || cnt > 3 * N / 8){\n\t\t\t\tflag = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(flag){\n\t\t\tbreak;\n\t\t}\n\t}\n\t\n\tfor(int i = 0; i < N; i++){\n\t\tcout << ans[i];\n\t}\n\tcout << endl;\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4128,"score_of_the_acc":-0.3714,"final_rank":11},{"submission_id":"aoj_2274_2972178","code_snippet":"#include <iostream>\n#include <vector>\n#include <random>\nusing namespace std;\n\nint main(){\n\tmt19937 mt(12345);\n\tint n,k;\n\tcin >> n >> k;\n\tvector<vector<int> > card(k, vector<int>(n/2));\n\tfor(int i=0; i<k; i++){\n\t\tfor(int j=0; j<n/2; j++){\n\t\t\tcin >> card[i][j];\n\t\t\tcard[i][j]--;\n\t\t}\n\t}\n\tstring ans = \"\";\n\twhile(1){\n\t\tbool success = true;\n\t\tvector<int> seq(n);\n\t\tfor(int i=0; i<n; i++){\n\t\t\tseq[i] = mt()%2;\n\t\t}\n\t\tfor(int i=0; i<k; i++){\n\t\t\tint sum = 0;\n\t\t\tfor(int j=0; j<n/2; j++){\n\t\t\t\tsum += seq[card[i][j]];\n\t\t\t}\n\t\t\tif(sum < n/8 || n*3/8 < sum){\n\t\t\t\tsuccess = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(success){\n\t\t\tfor(int i=0; i<n; i++){\n\t\t\t\tans += seq[i] +'0';\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3828,"score_of_the_acc":-0.4887,"final_rank":15},{"submission_id":"aoj_2274_2655829","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;\n\nbool check(const vector<int>&anss, const vector<vector<int>>&cards) {\n\tfor (auto card : cards) {\n\t\tint sum=0;\n\t\tfor (auto num : card) {\n\t\t\tsum+=anss[num];\n\t\t}\n\t\tif(sum<anss.size()/8||sum>anss.size()*3/8)return false;\n\t}\n\treturn true;\n}\n\nint main() {\n\tint N,M;cin>>N>>M;\n\tvector<vector<int>>cards(M);\n\tfor (int i = 0; i < M; ++i) {\n\t\tcards[i].resize(N/2);\n\t\tfor(int j = 0; j < N / 2; ++j) {\n\t\t\tcin>>cards[i][j];\n\t\t\tcards[i][j]--;\n\t\t}\n\t}\n\tvector<int>anss(N,0);\n\tfor (int i = 0; i < N / 2; ++i) {\n\t\tanss[i]=1;\n\t}\n\trandom_device rnd;\n\tmt19937 mt(rnd());\n\tshuffle(anss.begin(),anss.end(),mt);\n\twhile (true) {\n\t\tif (check(anss, cards)) {\n\t\t\tbreak;\n\t\t}\n\t\telse {\n\t\t\tfor (auto card : cards) {\n\t\t\t\tint sum = 0;\n\t\t\t\tfor (auto num : card) {\n\t\t\t\t\tsum += anss[num];\n\t\t\t\t}\n\t\t\t\tif (sum < anss.size() / 8) {\n\t\t\t\t\tint use;\n\t\t\t\t\tint unuse;\n\t\t\t\t\twhile (true) {\n\t\t\t\t\t\tint n = mt() % (card.size() * 2);\n\t\t\t\t\t\tif (!binary_search(card.begin(), card.end(), n)&&anss[n]) {\n\t\t\t\t\t\t\tunuse = n;\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\twhile (true) {\n\t\t\t\t\t\tint n = card[mt()%card.size()];\n\t\t\t\t\t\tif ( !anss[n]) {\n\t\t\t\t\t\t\tuse = n;\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\tswap(anss[use],anss[unuse]);\n\t\t\t\t}\n\t\t\t\telse if (sum > 3*anss.size() / 8) {\n\t\t\t\t\tint use;\n\t\t\t\t\tint unuse;\n\t\t\t\t\twhile (true) {\n\t\t\t\t\t\tint n = mt() % (card.size() * 2);\n\t\t\t\t\t\tif (!binary_search(card.begin(), card.end(), n) && !anss[n]) {\n\t\t\t\t\t\t\tuse = n;\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\twhile (true) {\n\t\t\t\t\t\tint n = card[mt() % card.size()];\n\t\t\t\t\t\tif (anss[n]) {\n\t\t\t\t\t\t\tunuse = n;\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\tswap(anss[use], anss[unuse]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < anss.size(); ++i) {\n\t\tcout<<anss[i];\n\t}\n\tcout<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3896,"score_of_the_acc":-0.4945,"final_rank":16},{"submission_id":"aoj_2274_2635564","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <math.h>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n\nint main(){\n\n\tint N,K;\n\tscanf(\"%d %d\",&N,&K);\n\n\tint table[K][N/2];\n\n\tfor(int row = 0; row < K; row++){\n\t\tfor(int col = 0; col < N/2; col++){\n\t\t\tscanf(\"%d\",&table[row][col]);\n\t\t\ttable[row][col]--;\n\t\t}\n\t}\n\n\tint ans[N];\n\tfor(int i = 0; i < N/2; i++)ans[i] = 1;\n\tfor(int i = N/2; i < N; i++)ans[i] = 0;\n\n\tbool FLG;\n\tint sum;\n\n\twhile(true){\n\t\tFLG = true;\n\t\tfor(int i = 0; i < K; i++){\n\t\t\tsum = 0;\n\t\t\tfor(int a = 0; a < N/2; a++){\n\t\t\t\tsum += ans[table[i][a]];\n\t\t\t}\n\t\t\tif(sum < N/8 || sum > 3*N/8){\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(FLG)break;\n\n\t\trandom_shuffle(ans,ans+N);\n\n\t}\n\n\tfor(int i = 0; i < N; i++)printf(\"%d\",ans[i]);\n\tprintf(\"\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4212,"score_of_the_acc":-0.0929,"final_rank":4},{"submission_id":"aoj_2274_2599892","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint n,k,a[9999][9999],b[9999];\nint main(){\n cin>>n>>k;\n r(i,k)r(j,n/2)scanf(\"%d\",&a[i][j]);\n while(1){\n r(i,n)b[i+1]=rand()%2;\n r(i,k){\n int cnt=0;\n r(j,n/2)cnt+=b[a[i][j]];\n if(cnt < n/8 || 3*n/8 < cnt)goto L;\n }\n r(i,n)cout<<b[i+1];\n cout<<endl;\n return 0;\n L:;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":6152,"score_of_the_acc":-0.4013,"final_rank":12},{"submission_id":"aoj_2274_2599888","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nint n,k,a[9999][9999],b[9999];\nint main(){\n cin>>n>>k;\n r(i,k)r(j,n/2)cin>>a[i][j];\n while(1){\n r(i,n)b[i+1]=rand()%2;\n r(i,k){\n int cnt=0;\n r(j,n/2)cnt+=b[a[i][j]];\n if(cnt < n/8 || 3*n/8 < cnt)goto L;\n }\n r(i,n)cout<<b[i+1];\n cout<<endl;\n return 0;\n L:;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":6088,"score_of_the_acc":-0.5387,"final_rank":17},{"submission_id":"aoj_2274_2595483","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nsigned main(){\n Int n,k;\n cin>>n>>k;\n vector< vector<Int> > v(k);\n for(Int i=0;i<k;i++){\n v[i].resize(n/2);\n for(Int j=0;j<n/2;j++) cin>>v[i][j],v[i][j]--;\n }\n\n auto check=[&](string s){\n for(Int i=0;i<k;i++){\n Int tmp=0;\n for(Int j=0;j<n/2;j++)\n\ttmp+=(s[v[i][j]]=='1');\n //cout<<i<<\":\"<<tmp<<endl;\n if(tmp<n/8||tmp>3*n/8) return 0;\n }\n return 1;\n };\n \n srand((unsigned)time(NULL));\n while(1){\n string s;\n for(Int i=0;i<n;i++)\n s.push_back(char('0'+(rand()%2)));\n if(check(s)){\n cout<<s<<endl;\n return 0;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":4564,"score_of_the_acc":-0.5515,"final_rank":18},{"submission_id":"aoj_2274_2429039","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint N,K;\nset<int> G[500];\n\nint main(){\n cin>>N>>K;\n for(int i=0;i<K;i++){\n for(int j=0;j<N/2;j++){\n int k;\n cin>>k;\n k--;\n G[i].insert(k);\n }\n }\n vector<int> t(N);\n for(int i=0;i<N;i++)t[i]=i;\n int cc=0;\n while(cc<1000000){\n cc+=N;\n random_shuffle(t.begin(),t.end());\n vector<int> sum(K,0);\n for(int i=0;i<N/2;i++){\n int id=t[i];\n for(int j=0;j<K;j++){\n sum[j]+=G[j].count(id);\n }\n }\n int mini=1e9,maxm=0;\n for(int i=0;i<K;i++){\n mini=min(mini,sum[i]);\n maxm=max(maxm,sum[i]);\n }\n if(N/8<=mini&&maxm<=N/8*3){\n vector<int> ans(N,0);\n for(int i=0;i<N/2;i++)ans[ t[i] ]=1;\n for(int i=0;i<N;i++)cout<<ans[i];\n cout<<endl;\n break;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":14840,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_2274_2329570","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nint a[500][500];\nint v[1000];\nint main() {\n\tint n, k; scanf(\"%d%d\", &n, &k);\n\trep(i, k)rep(j, n / 2)scanf(\"%d\", &a[i][j]), a[i][j]--;\n\trandom_device rnd; mt19937 mt(rnd());\n\twhile (1) {\n\t\trep(i, n)v[i] = mt() % 2;\n\t\trep(i, k) {\n\t\t\tint sum = 0;\n\t\t\trep(j, n / 2) {\n\t\t\t\tsum += v[a[i][j]];\n\t\t\t\tif (sum > 3 * n / 8)goto g;\n\t\t\t\tif (sum + n / 2 - j - 1 < n / 8)goto g;\n\t\t\t}\n\t\t}\n\t\trep(i, n)printf(\"%d\", v[i]); puts(\"\");\n\t\treturn 0;\n\tg:;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":4268,"score_of_the_acc":-0.0976,"final_rank":5},{"submission_id":"aoj_2274_2144794","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define FR first\n#define SC second\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)\n#define each(a, b) for(auto& a : b)\n\ntypedef pair<int, int> P;\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 N, K;\n cin >> N >> K;\n int c[1010][505];\n rep(i, K) rep(j, N/2) cin >> c[i][j];\n srand((unsigned)time(NULL));\n while(1) {\n string bin = \"\";\n rep(i, N) bin += '0' + rand()%2;\n bool flag = true;\n rep(i, K) {\n int sum = 0;\n rep(j, N/2) sum += bin[c[i][j]-1] - '0';\n if(sum < N/8 || 3*N/8 < sum) flag = false;\n if(!flag) break;\n }\n if(flag) {\n cout << bin << endl;\n break;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":5132,"score_of_the_acc":-0.1714,"final_rank":6},{"submission_id":"aoj_2274_1886265","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main()\n{\n int N, K;\n cin >> N >> K;\n vector<vector<int>> card(K, vector<int>(N/2));\n for (int i = 0; i < K; i++) {\n for (int j = 0; j < N/2; j++) {\n cin >> card[i][j];\n card[i][j]--;\n }\n }\n \n random_device rd;\n mt19937 mt(rd());\n bool finished = 0;\n while (!finished) {\n finished = 1;\n \n vector<int> seq(N);\n for (int i = 0; i < N; i++) {\n seq[i] = mt() % 2;\n }\n \n for (int i = 0; i < K; i++) {\n int sum = 0;\n for (int j = 0; j < N/2; j++) {\n sum += seq[card[i][j]];\n }\n if (sum < N/8 || sum > 3*N/8) {\n finished = 0;\n break;\n }\n }\n\n if (finished) {\n for (int i = 0; i < N; i++) {\n cout << seq[i];\n }\n cout << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3816,"score_of_the_acc":-0.4876,"final_rank":14},{"submission_id":"aoj_2274_1770461","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<time.h>\nusing namespace std;\nint a[10000][1000], c[10000], n, k;\nint main() {\n\tsrand((unsigned)time(NULL));\n\tcin >> n >> k;\n\tfor (int i = 0; i < k; i++) {\n\t\tfor (int j = 0; j < n / 2; j++) {\n\t\t\tcin >> a[i][j];\n\t\t}\n\t}\n\twhile (true) {\n\t\tfor (int i = 0; i < n; i++) c[i] = (unsigned)(rand()) % 2;\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tint cnt = 0;\n\t\t\tfor (int j = 0; j < n; j++) {\n\t\t\t\tcnt += c[a[i][j] - 1];\n\t\t\t}\n\t\t\tif (cnt < n / 8 || cnt>3 * n / 8) { goto E; }\n\t\t}\n\t\tfor (int i = 0; i < n; i++) { cout << c[i]; }\n\t\tcout << endl; goto F;\n\tE:;\n\t}\nF:;\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3124,"score_of_the_acc":-0.7143,"final_rank":19},{"submission_id":"aoj_2274_1697356","code_snippet":"#include <stdio.h>\n#include <stdlib.h>\nint N, K, card[500][500], r[1000];\nint main() {\n\tscanf(\"%d%d\", &N, &K);\n\tfor (int i = 0; i < K; i++) {\n\t\tfor (int j = 0; j < N / 2; j++) {\n\t\t\tscanf(\"%d\", &card[i][j]);\n\t\t}\n\t}\n\twhile (true) {\n\t\tfor (int i = 0; i < N; i++) r[i] = rand() % 2;\n\t\tbool flag = true;\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tint c = 0;\n\t\t\tfor (int j = 0; j < N / 2; j++) {\n\t\t\t\tif (r[card[i][j] - 1]) c++;\n\t\t\t}\n\t\t\tif (c < N / 8 || 3 * N / 8 < c) { flag = false; break; }\n\t\t}\n\t\tif (flag) {\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tprintf(\"%d\", r[i]);\n\t\t\t}\n\t\t\tprintf(\"\\n\"); break;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3696,"score_of_the_acc":-0.0488,"final_rank":1},{"submission_id":"aoj_2274_1697355","code_snippet":"#include <ctime>\n#include <iostream>\n#pragma warning(disable : 4996)\nusing namespace std;\nint N, K, card[500][500], r[1000];\nint main() {\n\tsrand((unsigned)time(NULL));\n\tscanf(\"%d%d\", &N, &K);\n\tfor (int i = 0; i < K; i++) {\n\t\tfor (int j = 0; j < N / 2; j++) {\n\t\t\tscanf(\"%d\", &card[i][j]);\n\t\t}\n\t}\n\twhile (true) {\n\t\tfor (int i = 0; i < N; i++) r[i] = rand() % 2;\n\t\tbool flag = true;\n\t\tfor (int i = 0; i < K; i++) {\n\t\t\tint c = 0;\n\t\t\tfor (int j = 0; j < N / 2; j++) {\n\t\t\t\tif (r[card[i][j] - 1]) c++;\n\t\t\t}\n\t\t\tif (c < N / 8 || 3 * N / 8 < c) { flag = false; break; }\n\t\t}\n\t\tif (flag) {\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tprintf(\"%d\", r[i]);\n\t\t\t}\n\t\t\tprintf(\"\\n\"); break;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4204,"score_of_the_acc":-0.0922,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2274_10809100\",\n \"code_snippet\": \"#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<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 = 1000;\\nconst int MAX_K = MAX_N / 2;\\n\\n/* typedef */\\n\\n/* global variables */\\n\\nint cards[MAX_K][MAX_N / 2];\\nint seq[MAX_N];\\n\\n/* subroutines */\\n\\nvoid gen_seq(int n) {\\n for (int i = 0; i < n; i++) seq[i] = rand() & 1;\\n}\\n\\n/* main */\\n\\nint main() {\\n srand(time(NULL));\\n\\n int n, k;\\n cin >> n >> k;\\n\\n int nh = n / 2;\\n int cmin = n / 8, cmax = 3 * cmin;\\n\\n memset(cards, 0, sizeof(cards));\\n \\n for (int i = 0; i < k; i++)\\n for (int j = 0; j < nh; j++) {\\n cin >> cards[i][j];\\n cards[i][j]--;\\n }\\n\\n for (;;) {\\n gen_seq(n);\\n\\n bool ok = true;\\n for (int i = 0; i < k; i++) {\\n int cnt = 0;\\n for (int j = 0; j < nh; j++) cnt += seq[cards[i][j]];\\n if (cnt < cmin || cnt > cmax) {\\n\\tok = false;\\n\\tbreak;\\n }\\n }\\n\\n if (ok) break;\\n }\\n\\n for (int i = 0; i < n; i++) cout << seq[i]; cout << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4424,\n \"score_of_the_acc\": -0.2538,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2274_4299959\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <numeric>\\n#include <algorithm>\\n#include <deque>\\n#include <vector>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <iomanip>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <functional>\\n#include <climits>\\n#include <numeric>\\n#include <bitset>\\n#include <random>\\n#include <tuple>\\n#include <initializer_list>\\n#include <fstream>\\n\\nbool is_match(const std::vector<int>& set, const std::vector<std::vector<int>> &cards) {\\n\\tfor (const auto& card : cards) {\\n\\t\\tint count{ 0 };\\n\\t\\tfor (const auto& c : card) count += set[c];\\n\\t\\tif (count * 8 < set.size() || set.size() * 3 < count * 8) return false;\\n\\t}\\n\\treturn true;\\n}\\nvoid set_random(std::vector<int>& set, std::mt19937& rand) {\\n\\tfor (auto& b : set) b = rand() & 1;\\n}\\nint main() {\\n\\tint n, k; std::cin >> n >> k;\\n\\tstd::vector<std::vector<int>> cards(k, std::vector<int>(n / 2));\\n\\tfor (auto& card : cards) for (auto& c : card) {\\n\\t\\tstd::cin >> c; --c;\\n\\t}\\n\\tstd::vector<int> set(n);\\n\\tstd::mt19937 rand;\\n\\tset_random(set, rand);\\n\\twhile (!is_match(set, cards)) set_random(set, rand);\\n\\tfor (const auto& s : set) std::cout << s;\\n\\tstd::cout << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3932,\n \"score_of_the_acc\": -0.3547,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2274_3887774\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <random>\\nusing namespace std;\\ntypedef long long int ll;\\n\\nint card[1100][1100];\\nint seq[1100];\\n\\nint main(){\\n\\tint n,k; cin >> n >> k;\\n\\tfor(int i=0;i<k;i++){\\n\\t\\tfor(int j=0;j<n/2;j++){\\n\\t\\t\\tcin >> card[i][j];\\n\\t\\t\\tcard[i][j]--;\\n\\t\\t}\\n\\t}\\n\\trandom_device rnd;\\n\\tmt19937 mt(rnd());\\n\\twhile(1){\\n\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\tseq[i]=mt()%2;\\n\\t\\t}\\n\\t\\tbool ok=true;\\n\\t\\tfor(int i=0;i<k;i++){\\n\\t\\t\\tint sum=0;\\n\\t\\t\\tfor(int j=0;j<n/2;j++){\\n\\t\\t\\t\\tsum+=seq[card[i][j]];\\n\\t\\t\\t\\tif(sum>3*n/8)ok=false;\\n\\t\\t\\t}\\n\\t\\t\\tif(sum<n/8)ok=false;\\n\\t\\t\\tif(!ok)break;\\n\\t\\t}\\n\\t\\tif(ok){\\n\\t\\t\\tfor(int i=0;i<n;i++){\\n\\t\\t\\t\\tcout << seq[i];\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5252,\n \"score_of_the_acc\": -0.4673,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2274_3769172\",\n \"code_snippet\": \"#include<iostream>\\n#include<ctime>\\n#include<cstdlib>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n \\n int n,k;\\n int card[505][505];\\n \\n cin >> n >> k;\\n for(int i=0;i<k;i++){\\n for(int j=0;j<n/2;j++) cin >> card[i][j];\\n }\\n \\n srand( (unsigned int)time(NULL) );\\n \\n int sum,cnt,ans[1010];\\n \\n do{\\n \\n for(int i=1;i<=n;i++) ans[i] = rand() % 2;\\n \\n cnt = 0;\\n for(int i=0;i<k;i++){\\n sum = 0;\\n for(int j=0;j<n/2;j++){\\n sum += ans[ card[i][j] ];\\n }\\n if(sum >= n/8 && sum <= 3*n/8) cnt++;\\n }\\n \\n }while(cnt < k);\\n \\n for(int i=1;i<=n;i++) cout << ans[i];\\n cout << endl;\\n \\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4100,\n \"score_of_the_acc\": -0.369,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2274_3769163\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n \\n int n,k;\\n int card[505][505];\\n \\n cin >> n >> k;\\n for(int i=0;i<k;i++){\\n for(int j=0;j<n/2;j++) cin >> card[i][j];\\n }\\n \\n srand( (unsigned int)time(NULL) );\\n \\n int sum,cnt,ans[1010];\\n \\n do{\\n \\n for(int i=1;i<=n;i++) ans[i] = rand() % 2;\\n \\n cnt = 0;\\n for(int i=0;i<k;i++){\\n sum = 0;\\n for(int j=0;j<n/2;j++){\\n sum += ans[ card[i][j] ];\\n }\\n if(sum >= n/8 && sum <= 3*n/8) cnt++;\\n }\\n \\n }while(cnt < k);\\n \\n for(int i=1;i<=n;i++) cout << ans[i];\\n cout << endl;\\n \\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4108,\n \"score_of_the_acc\": -0.3697,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2274_3373996\",\n \"code_snippet\": \"#include <cstdio>\\n#include <climits>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <set>\\n#include <cmath>\\n#include <stack>\\n#include <algorithm>\\n#include <random>\\n#include <iomanip>\\n#include <map>\\n#include <queue>\\n#include <functional>\\n#include <numeric>\\n#include <chrono>\\n#include <cstdlib>\\nusing ll = long long;\\nusing namespace std;\\n\\nconst ll MOD = 1e9 + 7;\\nconst double pi = acos(-1);\\ntypedef pair<int, int> P;\\n#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))\\n#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)\\n#define EPS 1e-4\\n#define OUTPUT(i) (cout << (ll)i << endl)\\n#define ALL(a) ((a).begin(), (a).end())\\n\\nbool operator<(const pair<ll, ll> &a, const pair<ll, ll> &b)\\n{\\n\\n if (a.first == b.first)\\n return a.second < b.second;\\n\\n return a.first < b.first;\\n}\\n\\nll gcd(ll a, ll b)\\n{\\n if (b == 0)\\n return a;\\n return gcd(b, a % b);\\n}\\nint N, K;\\nint ub, lb;\\nint ans[1008];\\nvector<vector<int>> v(1001);\\n\\nbool check()\\n{\\n\\n for (int i = 0; i < K; ++i)\\n {\\n int cnt = 0;\\n for (int j = 0; j < N / 2; ++j)\\n {\\n cnt += ans[v[i][j]];\\n }\\n if (cnt < lb || cnt > ub)\\n return false;\\n }\\n return true;\\n}\\n\\nvoid solve()\\n{\\n for (int i = 0; i < N / 2; ++i)\\n ans[i] = 1;\\n while (1)\\n {\\n std::random_device seed_gen;\\n std::mt19937 engine(seed_gen());\\n shuffle(ans, ans + N, engine);\\n if (check())\\n break;\\n }\\n}\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n //cout << fixed << setprecision(15);\\n\\n cin >> N >> K;\\n lb = N / 8;\\n ub = 3 * lb;\\n\\n for (int i = 0; i < K; ++i)\\n {\\n for (int j = 0; j < N / 2; ++j)\\n {\\n int a;\\n cin >> a;\\n a--;\\n v[i].push_back(a);\\n }\\n }\\n solve();\\n\\n for (int i = 0; i < N; ++i)\\n {\\n cout << ans[i];\\n }\\n cout << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3784,\n \"score_of_the_acc\": -0.0563,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2274_3097993\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <iostream>\\n#include <cmath>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <map>\\n#include <list>\\n\\nusing namespace std;\\n\\ntypedef pair<long long int, long long int> P;\\n\\nlong long int INF = 1e18;\\nlong long int MOD = 1e9 + 7;\\n\\nint card[550][550];\\n\\nint main(){\\n\\t\\n\\tint N, K;\\n\\tcin >> N >> K;\\n\\t\\n\\tfor(int i = 0; i < K; i++){\\n\\t\\tfor(int j = 0; j < N / 2; j++){\\n\\t\\t\\tcin >> card[i][j];\\n\\t\\t\\tcard[i][j]--;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tint ans[1100];\\n\\t\\n\\twhile(true){\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tans[i] = rand() % 2;\\n\\t\\t}\\n\\t\\tbool flag = true;\\n\\t\\tfor(int i = 0; i < K; i++){\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\tfor(int j = 0; j < N / 2; j++){\\n\\t\\t\\t\\tcnt += ans[card[i][j]];\\n\\t\\t\\t}\\n\\t\\t\\tif(cnt < N / 8 || cnt > 3 * N / 8){\\n\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(flag){\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tcout << ans[i];\\n\\t}\\n\\tcout << endl;\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4128,\n \"score_of_the_acc\": -0.3714,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2274_2972178\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <random>\\nusing namespace std;\\n\\nint main(){\\n\\tmt19937 mt(12345);\\n\\tint n,k;\\n\\tcin >> n >> k;\\n\\tvector<vector<int> > card(k, vector<int>(n/2));\\n\\tfor(int i=0; i<k; i++){\\n\\t\\tfor(int j=0; j<n/2; j++){\\n\\t\\t\\tcin >> card[i][j];\\n\\t\\t\\tcard[i][j]--;\\n\\t\\t}\\n\\t}\\n\\tstring ans = \\\"\\\";\\n\\twhile(1){\\n\\t\\tbool success = true;\\n\\t\\tvector<int> seq(n);\\n\\t\\tfor(int i=0; i<n; i++){\\n\\t\\t\\tseq[i] = mt()%2;\\n\\t\\t}\\n\\t\\tfor(int i=0; i<k; i++){\\n\\t\\t\\tint sum = 0;\\n\\t\\t\\tfor(int j=0; j<n/2; j++){\\n\\t\\t\\t\\tsum += seq[card[i][j]];\\n\\t\\t\\t}\\n\\t\\t\\tif(sum < n/8 || n*3/8 < sum){\\n\\t\\t\\t\\tsuccess = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(success){\\n\\t\\t\\tfor(int i=0; i<n; i++){\\n\\t\\t\\t\\tans += seq[i] +'0';\\n\\t\\t\\t}\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3828,\n \"score_of_the_acc\": -0.4887,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2274_2655829\",\n \"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;\\n\\nbool check(const vector<int>&anss, const vector<vector<int>>&cards) {\\n\\tfor (auto card : cards) {\\n\\t\\tint sum=0;\\n\\t\\tfor (auto num : card) {\\n\\t\\t\\tsum+=anss[num];\\n\\t\\t}\\n\\t\\tif(sum<anss.size()/8||sum>anss.size()*3/8)return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nint main() {\\n\\tint N,M;cin>>N>>M;\\n\\tvector<vector<int>>cards(M);\\n\\tfor (int i = 0; i < M; ++i) {\\n\\t\\tcards[i].resize(N/2);\\n\\t\\tfor(int j = 0; j < N / 2; ++j) {\\n\\t\\t\\tcin>>cards[i][j];\\n\\t\\t\\tcards[i][j]--;\\n\\t\\t}\\n\\t}\\n\\tvector<int>anss(N,0);\\n\\tfor (int i = 0; i < N / 2; ++i) {\\n\\t\\tanss[i]=1;\\n\\t}\\n\\trandom_device rnd;\\n\\tmt19937 mt(rnd());\\n\\tshuffle(anss.begin(),anss.end(),mt);\\n\\twhile (true) {\\n\\t\\tif (check(anss, cards)) {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tfor (auto card : cards) {\\n\\t\\t\\t\\tint sum = 0;\\n\\t\\t\\t\\tfor (auto num : card) {\\n\\t\\t\\t\\t\\tsum += anss[num];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (sum < anss.size() / 8) {\\n\\t\\t\\t\\t\\tint use;\\n\\t\\t\\t\\t\\tint unuse;\\n\\t\\t\\t\\t\\twhile (true) {\\n\\t\\t\\t\\t\\t\\tint n = mt() % (card.size() * 2);\\n\\t\\t\\t\\t\\t\\tif (!binary_search(card.begin(), card.end(), n)&&anss[n]) {\\n\\t\\t\\t\\t\\t\\t\\tunuse = n;\\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\\twhile (true) {\\n\\t\\t\\t\\t\\t\\tint n = card[mt()%card.size()];\\n\\t\\t\\t\\t\\t\\tif ( !anss[n]) {\\n\\t\\t\\t\\t\\t\\t\\tuse = n;\\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\\tswap(anss[use],anss[unuse]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (sum > 3*anss.size() / 8) {\\n\\t\\t\\t\\t\\tint use;\\n\\t\\t\\t\\t\\tint unuse;\\n\\t\\t\\t\\t\\twhile (true) {\\n\\t\\t\\t\\t\\t\\tint n = mt() % (card.size() * 2);\\n\\t\\t\\t\\t\\t\\tif (!binary_search(card.begin(), card.end(), n) && !anss[n]) {\\n\\t\\t\\t\\t\\t\\t\\tuse = n;\\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\\twhile (true) {\\n\\t\\t\\t\\t\\t\\tint n = card[mt() % card.size()];\\n\\t\\t\\t\\t\\t\\tif (anss[n]) {\\n\\t\\t\\t\\t\\t\\t\\tunuse = n;\\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\\tswap(anss[use], anss[unuse]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < anss.size(); ++i) {\\n\\t\\tcout<<anss[i];\\n\\t}\\n\\tcout<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3896,\n \"score_of_the_acc\": -0.4945,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2274_2635564\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <math.h>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n\\nint main(){\\n\\n\\tint N,K;\\n\\tscanf(\\\"%d %d\\\",&N,&K);\\n\\n\\tint table[K][N/2];\\n\\n\\tfor(int row = 0; row < K; row++){\\n\\t\\tfor(int col = 0; col < N/2; col++){\\n\\t\\t\\tscanf(\\\"%d\\\",&table[row][col]);\\n\\t\\t\\ttable[row][col]--;\\n\\t\\t}\\n\\t}\\n\\n\\tint ans[N];\\n\\tfor(int i = 0; i < N/2; i++)ans[i] = 1;\\n\\tfor(int i = N/2; i < N; i++)ans[i] = 0;\\n\\n\\tbool FLG;\\n\\tint sum;\\n\\n\\twhile(true){\\n\\t\\tFLG = true;\\n\\t\\tfor(int i = 0; i < K; i++){\\n\\t\\t\\tsum = 0;\\n\\t\\t\\tfor(int a = 0; a < N/2; a++){\\n\\t\\t\\t\\tsum += ans[table[i][a]];\\n\\t\\t\\t}\\n\\t\\t\\tif(sum < N/8 || sum > 3*N/8){\\n\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(FLG)break;\\n\\n\\t\\trandom_shuffle(ans,ans+N);\\n\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++)printf(\\\"%d\\\",ans[i]);\\n\\tprintf(\\\"\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4212,\n \"score_of_the_acc\": -0.0929,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2274_2599892\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\nint n,k,a[9999][9999],b[9999];\\nint main(){\\n cin>>n>>k;\\n r(i,k)r(j,n/2)scanf(\\\"%d\\\",&a[i][j]);\\n while(1){\\n r(i,n)b[i+1]=rand()%2;\\n r(i,k){\\n int cnt=0;\\n r(j,n/2)cnt+=b[a[i][j]];\\n if(cnt < n/8 || 3*n/8 < cnt)goto L;\\n }\\n r(i,n)cout<<b[i+1];\\n cout<<endl;\\n return 0;\\n L:;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6152,\n \"score_of_the_acc\": -0.4013,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2274_2599888\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\nint n,k,a[9999][9999],b[9999];\\nint main(){\\n cin>>n>>k;\\n r(i,k)r(j,n/2)cin>>a[i][j];\\n while(1){\\n r(i,n)b[i+1]=rand()%2;\\n r(i,k){\\n int cnt=0;\\n r(j,n/2)cnt+=b[a[i][j]];\\n if(cnt < n/8 || 3*n/8 < cnt)goto L;\\n }\\n r(i,n)cout<<b[i+1];\\n cout<<endl;\\n return 0;\\n L:;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6088,\n \"score_of_the_acc\": -0.5387,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2274_2595483\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nsigned main(){\\n Int n,k;\\n cin>>n>>k;\\n vector< vector<Int> > v(k);\\n for(Int i=0;i<k;i++){\\n v[i].resize(n/2);\\n for(Int j=0;j<n/2;j++) cin>>v[i][j],v[i][j]--;\\n }\\n\\n auto check=[&](string s){\\n for(Int i=0;i<k;i++){\\n Int tmp=0;\\n for(Int j=0;j<n/2;j++)\\n\\ttmp+=(s[v[i][j]]=='1');\\n //cout<<i<<\\\":\\\"<<tmp<<endl;\\n if(tmp<n/8||tmp>3*n/8) return 0;\\n }\\n return 1;\\n };\\n \\n srand((unsigned)time(NULL));\\n while(1){\\n string s;\\n for(Int i=0;i<n;i++)\\n s.push_back(char('0'+(rand()%2)));\\n if(check(s)){\\n cout<<s<<endl;\\n return 0;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4564,\n \"score_of_the_acc\": -0.5515,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2274_2429039\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint N,K;\\nset<int> G[500];\\n\\nint main(){\\n cin>>N>>K;\\n for(int i=0;i<K;i++){\\n for(int j=0;j<N/2;j++){\\n int k;\\n cin>>k;\\n k--;\\n G[i].insert(k);\\n }\\n }\\n vector<int> t(N);\\n for(int i=0;i<N;i++)t[i]=i;\\n int cc=0;\\n while(cc<1000000){\\n cc+=N;\\n random_shuffle(t.begin(),t.end());\\n vector<int> sum(K,0);\\n for(int i=0;i<N/2;i++){\\n int id=t[i];\\n for(int j=0;j<K;j++){\\n sum[j]+=G[j].count(id);\\n }\\n }\\n int mini=1e9,maxm=0;\\n for(int i=0;i<K;i++){\\n mini=min(mini,sum[i]);\\n maxm=max(maxm,sum[i]);\\n }\\n if(N/8<=mini&&maxm<=N/8*3){\\n vector<int> ans(N,0);\\n for(int i=0;i<N/2;i++)ans[ t[i] ]=1;\\n for(int i=0;i<N;i++)cout<<ans[i];\\n cout<<endl;\\n break;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 14840,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2274_2329570\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n)for(int i=0;i<(n);i++)\\nusing namespace std;\\n\\nint a[500][500];\\nint v[1000];\\nint main() {\\n\\tint n, k; scanf(\\\"%d%d\\\", &n, &k);\\n\\trep(i, k)rep(j, n / 2)scanf(\\\"%d\\\", &a[i][j]), a[i][j]--;\\n\\trandom_device rnd; mt19937 mt(rnd());\\n\\twhile (1) {\\n\\t\\trep(i, n)v[i] = mt() % 2;\\n\\t\\trep(i, k) {\\n\\t\\t\\tint sum = 0;\\n\\t\\t\\trep(j, n / 2) {\\n\\t\\t\\t\\tsum += v[a[i][j]];\\n\\t\\t\\t\\tif (sum > 3 * n / 8)goto g;\\n\\t\\t\\t\\tif (sum + n / 2 - j - 1 < n / 8)goto g;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, n)printf(\\\"%d\\\", v[i]); puts(\\\"\\\");\\n\\t\\treturn 0;\\n\\tg:;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4268,\n \"score_of_the_acc\": -0.0976,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2274_2144794\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define FR first\\n#define SC second\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)\\n#define each(a, b) for(auto& a : b)\\n\\ntypedef pair<int, int> P;\\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 N, K;\\n cin >> N >> K;\\n int c[1010][505];\\n rep(i, K) rep(j, N/2) cin >> c[i][j];\\n srand((unsigned)time(NULL));\\n while(1) {\\n string bin = \\\"\\\";\\n rep(i, N) bin += '0' + rand()%2;\\n bool flag = true;\\n rep(i, K) {\\n int sum = 0;\\n rep(j, N/2) sum += bin[c[i][j]-1] - '0';\\n if(sum < N/8 || 3*N/8 < sum) flag = false;\\n if(!flag) break;\\n }\\n if(flag) {\\n cout << bin << endl;\\n break;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5132,\n \"score_of_the_acc\": -0.1714,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2274_1886265\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n int N, K;\\n cin >> N >> K;\\n vector<vector<int>> card(K, vector<int>(N/2));\\n for (int i = 0; i < K; i++) {\\n for (int j = 0; j < N/2; j++) {\\n cin >> card[i][j];\\n card[i][j]--;\\n }\\n }\\n \\n random_device rd;\\n mt19937 mt(rd());\\n bool finished = 0;\\n while (!finished) {\\n finished = 1;\\n \\n vector<int> seq(N);\\n for (int i = 0; i < N; i++) {\\n seq[i] = mt() % 2;\\n }\\n \\n for (int i = 0; i < K; i++) {\\n int sum = 0;\\n for (int j = 0; j < N/2; j++) {\\n sum += seq[card[i][j]];\\n }\\n if (sum < N/8 || sum > 3*N/8) {\\n finished = 0;\\n break;\\n }\\n }\\n\\n if (finished) {\\n for (int i = 0; i < N; i++) {\\n cout << seq[i];\\n }\\n cout << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3816,\n \"score_of_the_acc\": -0.4876,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2274_1770461\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<time.h>\\nusing namespace std;\\nint a[10000][1000], c[10000], n, k;\\nint main() {\\n\\tsrand((unsigned)time(NULL));\\n\\tcin >> n >> k;\\n\\tfor (int i = 0; i < k; i++) {\\n\\t\\tfor (int j = 0; j < n / 2; j++) {\\n\\t\\t\\tcin >> a[i][j];\\n\\t\\t}\\n\\t}\\n\\twhile (true) {\\n\\t\\tfor (int i = 0; i < n; i++) c[i] = (unsigned)(rand()) % 2;\\n\\t\\tfor (int i = 0; i < k; i++) {\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\t\\tcnt += c[a[i][j] - 1];\\n\\t\\t\\t}\\n\\t\\t\\tif (cnt < n / 8 || cnt>3 * n / 8) { goto E; }\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < n; i++) { cout << c[i]; }\\n\\t\\tcout << endl; goto F;\\n\\tE:;\\n\\t}\\nF:;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.7143,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2274_1697356\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <stdlib.h>\\nint N, K, card[500][500], r[1000];\\nint main() {\\n\\tscanf(\\\"%d%d\\\", &N, &K);\\n\\tfor (int i = 0; i < K; i++) {\\n\\t\\tfor (int j = 0; j < N / 2; j++) {\\n\\t\\t\\tscanf(\\\"%d\\\", &card[i][j]);\\n\\t\\t}\\n\\t}\\n\\twhile (true) {\\n\\t\\tfor (int i = 0; i < N; i++) r[i] = rand() % 2;\\n\\t\\tbool flag = true;\\n\\t\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\tint c = 0;\\n\\t\\t\\tfor (int j = 0; j < N / 2; j++) {\\n\\t\\t\\t\\tif (r[card[i][j] - 1]) c++;\\n\\t\\t\\t}\\n\\t\\t\\tif (c < N / 8 || 3 * N / 8 < c) { flag = false; break; }\\n\\t\\t}\\n\\t\\tif (flag) {\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tprintf(\\\"%d\\\", r[i]);\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\"); break;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3696,\n \"score_of_the_acc\": -0.0488,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2274_1697355\",\n \"code_snippet\": \"#include <ctime>\\n#include <iostream>\\n#pragma warning(disable : 4996)\\nusing namespace std;\\nint N, K, card[500][500], r[1000];\\nint main() {\\n\\tsrand((unsigned)time(NULL));\\n\\tscanf(\\\"%d%d\\\", &N, &K);\\n\\tfor (int i = 0; i < K; i++) {\\n\\t\\tfor (int j = 0; j < N / 2; j++) {\\n\\t\\t\\tscanf(\\\"%d\\\", &card[i][j]);\\n\\t\\t}\\n\\t}\\n\\twhile (true) {\\n\\t\\tfor (int i = 0; i < N; i++) r[i] = rand() % 2;\\n\\t\\tbool flag = true;\\n\\t\\tfor (int i = 0; i < K; i++) {\\n\\t\\t\\tint c = 0;\\n\\t\\t\\tfor (int j = 0; j < N / 2; j++) {\\n\\t\\t\\t\\tif (r[card[i][j] - 1]) c++;\\n\\t\\t\\t}\\n\\t\\t\\tif (c < N / 8 || 3 * N / 8 < c) { flag = false; break; }\\n\\t\\t}\\n\\t\\tif (flag) {\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tprintf(\\\"%d\\\", r[i]);\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"\\\\n\\\"); break;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4204,\n \"score_of_the_acc\": -0.0922,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1260,"cells":{"group_id":{"kind":"string","value":"aoj_2276_cpp"},"problem_description":{"kind":"string","value":"問題 F\nボ〜ル\n問題文\n2 次元平面上の原点にボールがあり，\nx\n軸の正方向との角度が反時計回りに見て\n0\n度\n180\n度までの間の方向に一様な確率で発射されようとしている (発射される方向は整数角であるとは限らない)．ボールの大きさは十分小さく，平面上では点であると見なすことにする．この問題における目的は，このボールをできるだけ高い確率で捕獲することである．\n平面上に\nN\n個の場所\n(x\ni\n, y\ni\n)\nが与えられる．ボールを捕獲するために，あなたは\nN\n個の場所から\nK\n個の場所を選んで，それぞれの場所に人を配置することができる．人は\ni\n番目の与えられた場所に対して半径\nr\ni\n以内の距離まで動いてボールを取ることが出来る．\n人の配置をうまく選んでボールを捕獲できる確率を最大にするとき，その確率を出力せよ．\n入力形式\n入力は以下の形式で与えられる．\nN\nK\nx\n1\ny\n1\nr\n1\n...\nx\nN\ny\nN\nr\nN\nN\nはボールを捕獲するために人を置くための場所の数であり，\nK\nはその中から使うことの出来る場所の数である．\n(x\ni\n, y\ni\n)\nは\ni\n番目の場所の座標であり，\nr\ni\nはそこから動くことの出来る距離である．\n出力形式\n確率を小数表記で\n1\n行に出力せよ．小数点以下何桁でも出力して構わないが，相対誤差あるいは絶対誤差が\n10\n-6\n未満になっていなければならない．\n制約\n1≤ N≤ 1,500, 1≤ K≤ N\n|x\ni\n| ≤ 1,000, |y\ni\n| ≤ 1,000, 1 ≤ r\ni\n< (x\ni\n2\n+ y\ni\n2\n)\n1/2\n入力値はすべて整数である．\n入出力例\n入力例 1\n2 1\n10 10 10\n-10 10 10\n出力例 1\n0.50\n2\nつ場所があり，そのうちのどちらかに人を配置できる．この場合，どちらに配置しても確率は\n1/2\nになる．\n入力例 2\n2 2\n10 10 10\n-10 10 10\n出力例 2\n1.0\n入力例 3\n5 3\n-10 -10 5\n10 10 2\n-10 10 3\n-10 0 4\n10 0 2\n出力例 3\n0.3574057314330\n入力例 4\n4 2\n1 1 1\n2 2 2\n3 3 3\n4 4 4\n出力例 4\n0.50"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2276_4339412","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\nnamespace Geometry {\n using Real = double;\n\n int sgn(Real x) { return x > EPS ? 1 : x < -EPS ? -1 : 0; }\n\n Real degree_to_radian(Real d) { return d * M_PI / 180; }\n Real radian_to_degree(Real r) { return r * 180 / M_PI; }\n\n struct Point {\n Real x, y;\n Point(Real x = 0, Real y = 0) : x(x), y(y) {}\n Real abs() const { return sqrt(norm()); }\n Real arg() const { Real res = atan2(y, x); return res < 0 ? res + M_PI * 2 : res; }\n Real norm() const { return x * x + y * y; }\n Point rotate(Real angle) const { Real cs = cos(angle), sn = sin(angle); return Point(x * cs - y * sn, x * sn + y * cs); }\n Point unit_vector() const { Real a = abs(); return Point(x / a, y / a); }\n pair<Point, Point> normal_unit_vector() const { Point p = unit_vector(); return {Point(-p.y, p.x), Point(p.y, -p.x)}; }\n Point &operator+=(const Point &p) { x += p.x; y += p.y; return *this; }\n Point &operator-=(const Point &p) { x -= p.x; y -= p.y; return *this; }\n Point &operator*=(Real k) { x *= k; y *= k; return *this; }\n Point &operator/=(Real k) { x /= k; y /= k; return *this; }\n bool operator<(const Point &p) const { int x_sgn = sgn(p.x - x); return x_sgn != 0 ? x_sgn == 1 : sgn(p.y - y) == 1; }\n bool operator<=(const Point &p) const { return !(p < *this); }\n bool operator>(const Point &p) const { return p < *this; }\n bool operator>=(const Point &p) const { return !(*this < p); }\n Point operator+() const { return *this; }\n Point operator-() const { return Point(-x, -y); }\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*(Real k) const { return Point(*this) *= k; }\n Point operator/(Real k) const { return Point(*this) /= k; }\n friend ostream &operator<<(ostream &os, const Point &p) { return os << '(' << p.x << \", \" << p.y << ')'; }\n friend istream &operator>>(istream &is, Point &p) { Real x, y; is >> x >> y; p = Point(x, y); return is; }\n };\n\n struct Segment {\n Point s, t;\n Segment(const Point &s = {0, 0}, const Point &t = {0, 0}) : s(s), t(t) {}\n };\n struct Line : Segment {\n using Segment::Segment;\n Line(Real a, Real b, Real c) {\n if (sgn(a) == 0) {\n s = Point(0, -c / b); t = Point(1, s.y);\n } else if (sgn(b) == 0) {\n s = Point(-c / a, 0); t = Point(s.x, 1);\n } else if (sgn(c) == 0) {\n s = Point(0, 0); t = Point(1, -a / b);\n } else {\n s = Point(0, -c / b); t = Point(-c / a, 0);\n }\n }\n };\n\n struct Circle {\n Point p; Real r;\n Circle(const Point &p = {0, 0}, Real r = 0) : p(p), r(r) {}\n };\n\n Real cross(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; }\n Real dot(const Point &a, const Point &b) { return a.x * b.x + a.y * b.y; }\n\n int ccw(const Point &a, const Point &b, const Point &c) {\n Point ab = b - a, ac = c - a;\n int sign = sgn(cross(ab, ac));\n if (sign == 0) {\n if (sgn(dot(ab, ac)) == -1) return 2;\n if (sgn(ac.norm() - ab.norm()) == 1) return -2;\n }\n return sign;\n }\n\n Real get_angle(const Point &a, const Point &b, const Point &c) {\n Real ba_arg = (a - b).arg(), bc_arg = (c - b).arg();\n if (ba_arg > bc_arg) swap(ba_arg, bc_arg);\n return min(bc_arg - ba_arg, M_PI * 2 - (bc_arg - ba_arg));\n }\n\n Real closest_pair(vector<Point> ps) {\n int n = ps.size();\n assert(n > 1);\n sort(ALL(ps));\n function<Real(int, int)> rec = [&](int left, int right) {\n int mid = (left + right) >> 1;\n Real x_mid = ps[mid].x, d = LINF;\n if (left + 1 < mid) chmin(d, rec(left, mid));\n if (mid + 1 < right) chmin(d, rec(mid, right));\n inplace_merge(ps.begin() + left, ps.begin() + mid, ps.begin() + right, [&](const Point &a, const Point &b) { return sgn(b.y - a.y) == 1; });\n vector<Point> tmp;\n FOR(i, left, right) {\n if (sgn(abs(ps[i].x - x_mid) - d) == 1) continue;\n for (int j = static_cast<int>(tmp.size()) - 1; j >= 0; --j) {\n Point now = ps[i] - tmp[j];\n if (sgn(now.y - d) == 1) break;\n chmin(d, now.abs());\n }\n tmp.emplace_back(ps[i]);\n }\n return d;\n };\n return rec(0, n);\n }\n\n Point projection(const Segment &a, const Point &b) { return a.s + (a.t - a.s) * dot(a.t - a.s, b - a.s) / (a.t - a.s).norm(); }\n Point reflection(const Segment &a, const Point &b) { return projection(a, b) * 2 - b; }\n\n bool is_parallel(const Segment &a, const Segment &b) { return sgn(cross(a.t - a.s, b.t - b.s)) == 0; }\n bool is_orthogonal(const Segment &a, const Segment &b) { return sgn(dot(a.t - a.s, b.t - b.s)) == 0; }\n\n Real distance(const Point&, const Point&);\n Real distance(const Segment&, const Point&);\n Real distance(const Line&, const Point&);\n int sizeof_common_tangent(const Circle&, const Circle&);\n bool has_intersected(const Segment &a, const Point &b) { return ccw(a.s, a.t, b) == 0; }\n bool has_intersected(const Segment &a, const Segment &b) { return ccw(a.s, a.t, b.s) * ccw(a.s, a.t, b.t) <= 0 && ccw(b.s, b.t, a.s) * ccw(b.s, b.t, a.t) <= 0; }\n bool has_intersected(const Line &a, const Point &b) { int c = ccw(a.s, a.t, b); return c != 1 && c != -1; }\n bool has_intersected(const Line &a, const Segment &b) { return ccw(a.s, a.t, b.s) * ccw(a.s, a.t, b.t) != 1; }\n bool has_intersected(const Line &a, const Line &b) { return sgn(cross(a.t - a.s, b.t - b.s)) != 0 || sgn(cross(a.t - a.s, b.s - a.s)) == 0; }\n bool has_intersected(const Circle &a, const Point &b) { return sgn(distance(a.p, b) - a.r) == 0; }\n bool has_intersected(const Circle &a, const Segment &b) { return sgn(a.r - distance(b, a.p)) != -1 && sgn(max(distance(a.p, b.s), distance(a.p, b.t)) - a.r) != -1; }\n bool has_intersected(const Circle &a, const Line &b) { return sgn(a.r - distance(b, a.p)) != -1; }\n bool has_intersected(const Circle &a, const Circle &b) { return sizeof_common_tangent(a, b) > 0; }\n\n Point intersection(const Line &a, const Line &b) {\n assert(has_intersected(a, b) && !is_parallel(a, b));\n return a.s + (a.t - a.s) * cross(b.t - b.s, b.s - a.s) / cross(b.t - b.s, a.t - a.s);\n }\n Point intersection(const Segment &a, const Segment &b) {\n assert(has_intersected(a, b));\n if (is_parallel(a, b)) {\n if (sgn(distance(a.s, b.s)) == 0) {\n assert(sgn(dot(a.t - a.s, b.t - a.s)) == -1);\n return a.s;\n } else if (sgn(distance(a.s, b.t)) == 0) {\n assert(sgn(dot(a.t - a.s, b.s - a.s)) == -1);\n return a.s;\n } else if (sgn(distance(a.t, b.s)) == 0) {\n assert(sgn(dot(a.s - a.t, b.t - a.t)) == -1);\n return a.t;\n } else if (sgn(distance(a.t, b.t)) == 0) {\n assert(sgn(dot(a.s - a.t, b.s - a.t)) == -1);\n return a.t;\n } else {\n assert(false);\n }\n } else {\n return intersection(Line(a.s, a.t), Line(b.s, b.t));\n }\n }\n Point intersection(const Line &a, const Segment &b) {\n assert(has_intersected(a, b));\n return intersection(a, Line(b.s, b.t));\n }\n vector<Point> intersection(const Circle &a, const Line &b) {\n Point pro = projection(b, a.p);\n Real nor = (a.p - pro).norm();\n int sign = sgn(a.r - sqrt(nor));\n if (sign == -1) return {};\n if (sign == 0) return {pro};\n Point v = (b.t - b.s).unit_vector() * sqrt(a.r * a.r - nor);\n return {pro + v, pro - v};\n }\n vector<Point> intersection(const Circle &a, const Segment &b) {\n if (!has_intersected(a, b)) return {};\n vector<Point> res = intersection(a, Line(b.s, b.t));\n if (sgn(distance(a.p, b.s) - a.r) != -1 && sgn(distance(a.p, b.t) - a.r) != -1) return res;\n return {sgn(dot(res[0] - b.s, res[0] - b.t)) == 1 ? res[1] : res[0]};\n }\n vector<Point> intersection(const Circle &a, const Circle &b) {\n int sz = sizeof_common_tangent(a, b);\n if (sz == 0 || sz == 4) return {};\n Real alpha = (b.p - a.p).arg();\n if (sz == 1 || sz == 3) return {Point(a.p.x + a.r * cos(alpha), a.p.y + a.r * sin(alpha))};\n Real dist = (b.p - a.p).norm(), beta = acos((dist + a.r * a.r - b.r * b.r) / (2 * sqrt(dist) * a.r));\n return {a.p + Point(a.r * cos(alpha + beta), a.r * sin(alpha + beta)), a.p + Point(a.r * cos(alpha - beta), a.r * sin(alpha - beta))};\n }\n\n Real distance(const Point &a, const Point &b) { return (b - a).abs(); }\n Real distance(const Segment &a, const Point &b) {\n Point foot = projection(a, b);\n return has_intersected(a, foot) ? distance(foot, b) : min(distance(a.s, b), distance(a.t, b));\n }\n Real distance(const Segment &a, const Segment &b) { return has_intersected(a, b) ? 0 : min({distance(a, b.s), distance(a, b.t), distance(b, a.s), distance(b, a.t)}); }\n Real distance(const Line &a, const Point &b) { return distance(projection(a, b), b); }\n Real distance(const Line &a, const Segment &b) { return has_intersected(a, b) ? 0 : min(distance(a, b.s), distance(a, b.t)); }\n Real distance(const Line &a, const Line &b) { return has_intersected(a, b) ? 0 : distance(a, b.s); }\n\n vector<Point> tangency(const Circle &a, const Point &b) {\n Real dist = distance(a.p, b);\n int sign = sgn(dist - a.r);\n if (sign == -1) return {};\n if (sign == 0) return {b};\n Real alpha = (b - a.p).arg(), beta = acos(a.r / dist);\n return {a.p + Point(a.r * cos(alpha + beta), a.r * sin(alpha + beta)), a.p + Point(a.r * cos(alpha - beta), a.r * sin(alpha - beta))};\n }\n int sizeof_common_tangent(const Circle &a, const Circle &b) {\n Real dist = distance(a.p, b.p);\n int sign = sgn(a.r + b.r - dist);\n if (sign == -1) return 4;\n if (sign == 0) return 3;\n sign = sgn((sgn(a.r - b.r) == -1 ? b.r - a.r : a.r - b.r) - dist);\n if (sign == -1) return 2;\n if (sign == 0) return 1;\n return 0;\n }\n vector<Line> common_tangent(const Circle &a, const Circle &b) {\n vector<Line> tangents;\n Real dist = distance(a.p, b.p), argument = (b.p - a.p).arg();\n int sign = sgn(a.r + b.r - dist);\n if (sign == -1) {\n Real ac = acos((a.r + b.r) / dist), alpha = argument + ac, cs = cos(alpha), sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n alpha = argument - ac; cs = cos(alpha); sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n } else if (sign == 0) {\n Point s = a.p + Point(a.r * cos(argument), a.r * sin(argument));\n tangents.emplace_back(s, s + (b.p - a.p).normal_unit_vector().first);\n }\n if (sgn(b.r - a.r) == -1) {\n sign = sgn(a.r - b.r - dist);\n if (sign == -1) {\n Real at = acos((a.r - b.r) / dist), alpha = argument + at, cs = cos(alpha), sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(b.r * cs, b.r * sn));\n alpha = argument - at; cs = cos(alpha); sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(b.r * cs, b.r * sn));\n } else if (sign == 0) {\n Point s = a.p + Point(a.r * cos(argument), a.r * sin(argument));\n tangents.emplace_back(s, s + (b.p - a.p).normal_unit_vector().first);\n }\n } else {\n sign = sgn(b.r - a.r - dist);\n if (sign == -1) {\n Real at = acos((b.r - a.r) / dist), alpha = argument - at, cs = cos(alpha), sn = sin(alpha);\n tangents.emplace_back(a.p + Point(-a.r * cs, -a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n alpha = argument + at; cs = cos(alpha); sn = sin(alpha);\n tangents.emplace_back(a.p + Point(-a.r * cs, -a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n } else if (sign == 0) {\n Point s = b.p + Point(-b.r * cos(argument), -b.r * sin(argument));\n tangents.emplace_back(s, s + (a.p - b.p).normal_unit_vector().first);\n }\n }\n return tangents;\n }\n\n Real intersection_area(const Circle &a, const Circle &b) {\n Real nor = (b.p - a.p).norm(), dist = sqrt(nor);\n if (sgn(a.r + b.r - dist) != 1) return 0;\n if (sgn(abs(a.r - b.r) - dist) != -1) return min(a.r, b.r) * min(a.r, b.r) * M_PI;\n Real alpha = acos((nor + a.r * a.r - b.r * b.r) / (2 * dist * a.r)), beta = acos((nor + b.r * b.r - a.r * a.r) / (2 * dist * b.r));\n return (alpha - sin(alpha + alpha) * 0.5) * a.r * a.r + (beta - sin(beta + beta) * 0.5) * b.r * b.r;\n }\n\n using Polygon = vector<Point>;\n\n Real area(const Polygon &a) {\n int n = a.size();\n Real res = 0;\n REP(i, n) res += cross(a[i], a[(i + 1) % n]);\n return res * 0.5;\n }\n\n Point centroid(const Polygon &a) {\n Point res(0, 0);\n int n = a.size();\n Real den = 0;\n REP(i, n) {\n Real cro = cross(a[i], a[(i + 1) % n]);\n res += (a[i] + a[(i + 1) % n]) / 3 * cro;\n den += cro;\n }\n return res / den;\n }\n\n int is_contained(const Polygon &a, const Point &b) {\n int n = a.size();\n bool is_in = false;\n REP(i, n) {\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\n if (sgn(q.y - p.y) == -1) swap(p, q);\n int sign = sgn(cross(p, q));\n if (sign == 1 && sgn(p.y) != 1 && sgn(q.y) == 1) is_in = !is_in;\n if (sign == 0 && sgn(dot(p, q)) != 1) return 1;\n }\n return is_in ? 2 : 0;\n }\n\n bool is_convex(const Polygon &a) {\n int n = a.size();\n REP(i, n) {\n if (ccw(a[(i - 1 + n) % n], a[i], a[(i + 1) % n]) == -1) return false;\n }\n return true;\n }\n\n Polygon monotone_chain(vector<Point> ps, bool tight = true) {\n sort(ALL(ps));\n int n = ps.size(), idx = 0;\n Polygon convex_hull(n << 1);\n for (int i = 0; i < n; convex_hull[idx++] = ps[i++]) {\n while (idx >= 2 && sgn(cross(convex_hull[idx - 1] - convex_hull[idx - 2], ps[i] - convex_hull[idx - 1])) < tight) --idx;\n }\n for (int i = n - 2, border = idx + 1; i >= 0; convex_hull[idx++] = ps[i--]) {\n while (idx >= border && sgn(cross(convex_hull[idx - 1] - convex_hull[idx - 2], ps[i] - convex_hull[idx - 1])) < tight) --idx;\n }\n convex_hull.resize(idx - 1);\n return convex_hull;\n }\n\n Polygon cut_convex(const Polygon &a, const Line &b) {\n int n = a.size();\n Polygon res;\n REP(i, n) {\n int c = ccw(b.s, b.t, a[i]);\n if (c != -1) res.emplace_back(a[i]);\n if (c * ccw(b.s, b.t, a[(i + 1) % n]) == -1) res.emplace_back(intersection(Line(a[i], a[(i + 1) % n]), b));\n }\n if (res.size() < 3) res.clear();\n return res;\n }\n\n pair<Point, Point> rotating_calipers(const Polygon &a) {\n int n = a.size(), high = 0, low = 0;\n if (n <= 2) {\n assert(n == 2);\n return {a[0], a[1]};\n }\n FOR(i, 1, n) {\n if (a[i].y > a[high].y) high = i;\n if (a[i].y < a[low].y) low = i;\n }\n Real max_norm = (a[high] - a[low]).norm();\n int i = high, j = low, max_i = i, max_j = j;\n do {\n ((sgn(cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j])) != -1 ? j : i) += 1) %= n;\n Real tmp = (a[j] - a[i]).norm();\n if (sgn(tmp - max_norm) == 1) {\n max_norm = tmp;\n max_i = i; max_j = j;\n }\n } while (i != high || j != low);\n return {a[max_i], a[max_j]};\n }\n}\n\nusing namespace Geometry;\n\nint main() {\n int n, k; cin >> n >> k;\n vector<Circle> people;\n REP(_, n) {\n Point p; double r; cin >> p >> r;\n people.emplace_back(p, r);\n }\n vector<double> l(n), r(n), comp;\n REP(i, n) {\n vector<Point> t = tangency(people[i], Point(0, 0));\n l[i] = t[0].arg(); r[i] = t[1].arg();\n if (l[i] > r[i]) swap(l[i], r[i]);\n if (r[i] > M_PI && has_intersected(people[i], Segment(Point(0, 0), Point(2415, 0)))) {\n swap(l[i], r[i]);\n l[i] = 0;\n } else {\n chmax(l[i], 0);\n chmin(r[i], M_PI);\n }\n if (l[i] < M_PI) {\n comp.emplace_back(l[i]);\n comp.emplace_back(r[i]);\n }\n }\n vector<bool> use(n, true);\n REP(i, n) {\n if (l[i] >= M_PI) use[i] = false;\n if (!use[i]) continue;\n REP(j, n) {\n if (j != i && l[i] <= l[j] && r[j] <= r[i]) use[j] = false;\n }\n }\n vector<pair<double, double>> ball;\n REP(i, n) {\n if (use[i]) ball.emplace_back(l[i], r[i]);\n }\n n = ball.size();\n if (n == 0) {\n cout << \"0\\n\";\n return 0;\n }\n sort(ALL(ball));\n // REP(i, n) cout << ball[i].first << ' ' << ball[i].second << '\\n';\n vector<vector<vector<double>>> dp(n, vector<vector<double>>(k + 1, vector<double>(2, -INF)));\n dp[0][0][false] = 0;\n dp[0][1][true] = ball[0].second - ball[0].first;\n FOR(i, 1, n) {\n double left, right; tie(left, right) = ball[i];\n int x = i - 1;\n while (x >= 0 && ball[i].first <= ball[x].second) --x;\n ++x;\n chmin(x, i - 1);\n REP(j, k + 1) {\n if (j + 1 <= k) {\n chmax(dp[i][j + 1][true], dp[x][j][true] + right - max(ball[x].second, left));\n chmax(dp[i][j + 1][true], dp[x][j][false] + right - left);\n }\n chmax(dp[i][j][false], max(dp[i - 1][j][false], dp[i - 1][j][true]));\n }\n }\n double ans = 0;\n REP(y, k + 1) REP(z, 2) chmax(ans, dp[n - 1][y][z]);\n cout << ans / M_PI << '\\n';\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":127048,"score_of_the_acc":-1.1429,"final_rank":15},{"submission_id":"aoj_2276_4339407","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\nnamespace Geometry {\n using Real = double;\n\n int sgn(Real x) { return x > EPS ? 1 : x < -EPS ? -1 : 0; }\n\n Real degree_to_radian(Real d) { return d * M_PI / 180; }\n Real radian_to_degree(Real r) { return r * 180 / M_PI; }\n\n struct Point {\n Real x, y;\n Point(Real x = 0, Real y = 0) : x(x), y(y) {}\n Real abs() const { return sqrt(norm()); }\n Real arg() const { Real res = atan2(y, x); return res < 0 ? res + M_PI * 2 : res; }\n Real norm() const { return x * x + y * y; }\n Point rotate(Real angle) const { Real cs = cos(angle), sn = sin(angle); return Point(x * cs - y * sn, x * sn + y * cs); }\n Point unit_vector() const { Real a = abs(); return Point(x / a, y / a); }\n pair<Point, Point> normal_unit_vector() const { Point p = unit_vector(); return {Point(-p.y, p.x), Point(p.y, -p.x)}; }\n Point &operator+=(const Point &p) { x += p.x; y += p.y; return *this; }\n Point &operator-=(const Point &p) { x -= p.x; y -= p.y; return *this; }\n Point &operator*=(Real k) { x *= k; y *= k; return *this; }\n Point &operator/=(Real k) { x /= k; y /= k; return *this; }\n bool operator<(const Point &p) const { int x_sgn = sgn(p.x - x); return x_sgn != 0 ? x_sgn == 1 : sgn(p.y - y) == 1; }\n bool operator<=(const Point &p) const { return !(p < *this); }\n bool operator>(const Point &p) const { return p < *this; }\n bool operator>=(const Point &p) const { return !(*this < p); }\n Point operator+() const { return *this; }\n Point operator-() const { return Point(-x, -y); }\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*(Real k) const { return Point(*this) *= k; }\n Point operator/(Real k) const { return Point(*this) /= k; }\n friend ostream &operator<<(ostream &os, const Point &p) { return os << '(' << p.x << \", \" << p.y << ')'; }\n friend istream &operator>>(istream &is, Point &p) { Real x, y; is >> x >> y; p = Point(x, y); return is; }\n };\n\n struct Segment {\n Point s, t;\n Segment(const Point &s = {0, 0}, const Point &t = {0, 0}) : s(s), t(t) {}\n };\n struct Line : Segment {\n using Segment::Segment;\n Line(Real a, Real b, Real c) {\n if (sgn(a) == 0) {\n s = Point(0, -c / b); t = Point(1, s.y);\n } else if (sgn(b) == 0) {\n s = Point(-c / a, 0); t = Point(s.x, 1);\n } else if (sgn(c) == 0) {\n s = Point(0, 0); t = Point(1, -a / b);\n } else {\n s = Point(0, -c / b); t = Point(-c / a, 0);\n }\n }\n };\n\n struct Circle {\n Point p; Real r;\n Circle(const Point &p = {0, 0}, Real r = 0) : p(p), r(r) {}\n };\n\n Real cross(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; }\n Real dot(const Point &a, const Point &b) { return a.x * b.x + a.y * b.y; }\n\n int ccw(const Point &a, const Point &b, const Point &c) {\n Point ab = b - a, ac = c - a;\n int sign = sgn(cross(ab, ac));\n if (sign == 0) {\n if (sgn(dot(ab, ac)) == -1) return 2;\n if (sgn(ac.norm() - ab.norm()) == 1) return -2;\n }\n return sign;\n }\n\n Real get_angle(const Point &a, const Point &b, const Point &c) {\n Real ba_arg = (a - b).arg(), bc_arg = (c - b).arg();\n if (ba_arg > bc_arg) swap(ba_arg, bc_arg);\n return min(bc_arg - ba_arg, M_PI * 2 - (bc_arg - ba_arg));\n }\n\n Real closest_pair(vector<Point> ps) {\n int n = ps.size();\n assert(n > 1);\n sort(ALL(ps));\n function<Real(int, int)> rec = [&](int left, int right) {\n int mid = (left + right) >> 1;\n Real x_mid = ps[mid].x, d = LINF;\n if (left + 1 < mid) chmin(d, rec(left, mid));\n if (mid + 1 < right) chmin(d, rec(mid, right));\n inplace_merge(ps.begin() + left, ps.begin() + mid, ps.begin() + right, [&](const Point &a, const Point &b) { return sgn(b.y - a.y) == 1; });\n vector<Point> tmp;\n FOR(i, left, right) {\n if (sgn(abs(ps[i].x - x_mid) - d) == 1) continue;\n for (int j = static_cast<int>(tmp.size()) - 1; j >= 0; --j) {\n Point now = ps[i] - tmp[j];\n if (sgn(now.y - d) == 1) break;\n chmin(d, now.abs());\n }\n tmp.emplace_back(ps[i]);\n }\n return d;\n };\n return rec(0, n);\n }\n\n Point projection(const Segment &a, const Point &b) { return a.s + (a.t - a.s) * dot(a.t - a.s, b - a.s) / (a.t - a.s).norm(); }\n Point reflection(const Segment &a, const Point &b) { return projection(a, b) * 2 - b; }\n\n bool is_parallel(const Segment &a, const Segment &b) { return sgn(cross(a.t - a.s, b.t - b.s)) == 0; }\n bool is_orthogonal(const Segment &a, const Segment &b) { return sgn(dot(a.t - a.s, b.t - b.s)) == 0; }\n\n Real distance(const Point&, const Point&);\n Real distance(const Segment&, const Point&);\n Real distance(const Line&, const Point&);\n int sizeof_common_tangent(const Circle&, const Circle&);\n bool has_intersected(const Segment &a, const Point &b) { return ccw(a.s, a.t, b) == 0; }\n bool has_intersected(const Segment &a, const Segment &b) { return ccw(a.s, a.t, b.s) * ccw(a.s, a.t, b.t) <= 0 && ccw(b.s, b.t, a.s) * ccw(b.s, b.t, a.t) <= 0; }\n bool has_intersected(const Line &a, const Point &b) { int c = ccw(a.s, a.t, b); return c != 1 && c != -1; }\n bool has_intersected(const Line &a, const Segment &b) { return ccw(a.s, a.t, b.s) * ccw(a.s, a.t, b.t) != 1; }\n bool has_intersected(const Line &a, const Line &b) { return sgn(cross(a.t - a.s, b.t - b.s)) != 0 || sgn(cross(a.t - a.s, b.s - a.s)) == 0; }\n bool has_intersected(const Circle &a, const Point &b) { return sgn(distance(a.p, b) - a.r) == 0; }\n bool has_intersected(const Circle &a, const Segment &b) { return sgn(a.r - distance(b, a.p)) != -1 && sgn(max(distance(a.p, b.s), distance(a.p, b.t)) - a.r) != -1; }\n bool has_intersected(const Circle &a, const Line &b) { return sgn(a.r - distance(b, a.p)) != -1; }\n bool has_intersected(const Circle &a, const Circle &b) { return sizeof_common_tangent(a, b) > 0; }\n\n Point intersection(const Line &a, const Line &b) {\n assert(has_intersected(a, b) && !is_parallel(a, b));\n return a.s + (a.t - a.s) * cross(b.t - b.s, b.s - a.s) / cross(b.t - b.s, a.t - a.s);\n }\n Point intersection(const Segment &a, const Segment &b) {\n assert(has_intersected(a, b));\n if (is_parallel(a, b)) {\n if (sgn(distance(a.s, b.s)) == 0) {\n assert(sgn(dot(a.t - a.s, b.t - a.s)) == -1);\n return a.s;\n } else if (sgn(distance(a.s, b.t)) == 0) {\n assert(sgn(dot(a.t - a.s, b.s - a.s)) == -1);\n return a.s;\n } else if (sgn(distance(a.t, b.s)) == 0) {\n assert(sgn(dot(a.s - a.t, b.t - a.t)) == -1);\n return a.t;\n } else if (sgn(distance(a.t, b.t)) == 0) {\n assert(sgn(dot(a.s - a.t, b.s - a.t)) == -1);\n return a.t;\n } else {\n assert(false);\n }\n } else {\n return intersection(Line(a.s, a.t), Line(b.s, b.t));\n }\n }\n Point intersection(const Line &a, const Segment &b) {\n assert(has_intersected(a, b));\n return intersection(a, Line(b.s, b.t));\n }\n vector<Point> intersection(const Circle &a, const Line &b) {\n Point pro = projection(b, a.p);\n Real nor = (a.p - pro).norm();\n int sign = sgn(a.r - sqrt(nor));\n if (sign == -1) return {};\n if (sign == 0) return {pro};\n Point v = (b.t - b.s).unit_vector() * sqrt(a.r * a.r - nor);\n return {pro + v, pro - v};\n }\n vector<Point> intersection(const Circle &a, const Segment &b) {\n if (!has_intersected(a, b)) return {};\n vector<Point> res = intersection(a, Line(b.s, b.t));\n if (sgn(distance(a.p, b.s) - a.r) != -1 && sgn(distance(a.p, b.t) - a.r) != -1) return res;\n return {sgn(dot(res[0] - b.s, res[0] - b.t)) == 1 ? res[1] : res[0]};\n }\n vector<Point> intersection(const Circle &a, const Circle &b) {\n int sz = sizeof_common_tangent(a, b);\n if (sz == 0 || sz == 4) return {};\n Real alpha = (b.p - a.p).arg();\n if (sz == 1 || sz == 3) return {Point(a.p.x + a.r * cos(alpha), a.p.y + a.r * sin(alpha))};\n Real dist = (b.p - a.p).norm(), beta = acos((dist + a.r * a.r - b.r * b.r) / (2 * sqrt(dist) * a.r));\n return {a.p + Point(a.r * cos(alpha + beta), a.r * sin(alpha + beta)), a.p + Point(a.r * cos(alpha - beta), a.r * sin(alpha - beta))};\n }\n\n Real distance(const Point &a, const Point &b) { return (b - a).abs(); }\n Real distance(const Segment &a, const Point &b) {\n Point foot = projection(a, b);\n return has_intersected(a, foot) ? distance(foot, b) : min(distance(a.s, b), distance(a.t, b));\n }\n Real distance(const Segment &a, const Segment &b) { return has_intersected(a, b) ? 0 : min({distance(a, b.s), distance(a, b.t), distance(b, a.s), distance(b, a.t)}); }\n Real distance(const Line &a, const Point &b) { return distance(projection(a, b), b); }\n Real distance(const Line &a, const Segment &b) { return has_intersected(a, b) ? 0 : min(distance(a, b.s), distance(a, b.t)); }\n Real distance(const Line &a, const Line &b) { return has_intersected(a, b) ? 0 : distance(a, b.s); }\n\n vector<Point> tangency(const Circle &a, const Point &b) {\n Real dist = distance(a.p, b);\n int sign = sgn(dist - a.r);\n if (sign == -1) return {};\n if (sign == 0) return {b};\n Real alpha = (b - a.p).arg(), beta = acos(a.r / dist);\n return {a.p + Point(a.r * cos(alpha + beta), a.r * sin(alpha + beta)), a.p + Point(a.r * cos(alpha - beta), a.r * sin(alpha - beta))};\n }\n int sizeof_common_tangent(const Circle &a, const Circle &b) {\n Real dist = distance(a.p, b.p);\n int sign = sgn(a.r + b.r - dist);\n if (sign == -1) return 4;\n if (sign == 0) return 3;\n sign = sgn((sgn(a.r - b.r) == -1 ? b.r - a.r : a.r - b.r) - dist);\n if (sign == -1) return 2;\n if (sign == 0) return 1;\n return 0;\n }\n vector<Line> common_tangent(const Circle &a, const Circle &b) {\n vector<Line> tangents;\n Real dist = distance(a.p, b.p), argument = (b.p - a.p).arg();\n int sign = sgn(a.r + b.r - dist);\n if (sign == -1) {\n Real ac = acos((a.r + b.r) / dist), alpha = argument + ac, cs = cos(alpha), sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n alpha = argument - ac; cs = cos(alpha); sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n } else if (sign == 0) {\n Point s = a.p + Point(a.r * cos(argument), a.r * sin(argument));\n tangents.emplace_back(s, s + (b.p - a.p).normal_unit_vector().first);\n }\n if (sgn(b.r - a.r) == -1) {\n sign = sgn(a.r - b.r - dist);\n if (sign == -1) {\n Real at = acos((a.r - b.r) / dist), alpha = argument + at, cs = cos(alpha), sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(b.r * cs, b.r * sn));\n alpha = argument - at; cs = cos(alpha); sn = sin(alpha);\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(b.r * cs, b.r * sn));\n } else if (sign == 0) {\n Point s = a.p + Point(a.r * cos(argument), a.r * sin(argument));\n tangents.emplace_back(s, s + (b.p - a.p).normal_unit_vector().first);\n }\n } else {\n sign = sgn(b.r - a.r - dist);\n if (sign == -1) {\n Real at = acos((b.r - a.r) / dist), alpha = argument - at, cs = cos(alpha), sn = sin(alpha);\n tangents.emplace_back(a.p + Point(-a.r * cs, -a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n alpha = argument + at; cs = cos(alpha); sn = sin(alpha);\n tangents.emplace_back(a.p + Point(-a.r * cs, -a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\n } else if (sign == 0) {\n Point s = b.p + Point(-b.r * cos(argument), -b.r * sin(argument));\n tangents.emplace_back(s, s + (a.p - b.p).normal_unit_vector().first);\n }\n }\n return tangents;\n }\n\n Real intersection_area(const Circle &a, const Circle &b) {\n Real nor = (b.p - a.p).norm(), dist = sqrt(nor);\n if (sgn(a.r + b.r - dist) != 1) return 0;\n if (sgn(abs(a.r - b.r) - dist) != -1) return min(a.r, b.r) * min(a.r, b.r) * M_PI;\n Real alpha = acos((nor + a.r * a.r - b.r * b.r) / (2 * dist * a.r)), beta = acos((nor + b.r * b.r - a.r * a.r) / (2 * dist * b.r));\n return (alpha - sin(alpha + alpha) * 0.5) * a.r * a.r + (beta - sin(beta + beta) * 0.5) * b.r * b.r;\n }\n\n using Polygon = vector<Point>;\n\n Real area(const Polygon &a) {\n int n = a.size();\n Real res = 0;\n REP(i, n) res += cross(a[i], a[(i + 1) % n]);\n return res * 0.5;\n }\n\n Point centroid(const Polygon &a) {\n Point res(0, 0);\n int n = a.size();\n Real den = 0;\n REP(i, n) {\n Real cro = cross(a[i], a[(i + 1) % n]);\n res += (a[i] + a[(i + 1) % n]) / 3 * cro;\n den += cro;\n }\n return res / den;\n }\n\n int is_contained(const Polygon &a, const Point &b) {\n int n = a.size();\n bool is_in = false;\n REP(i, n) {\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\n if (sgn(q.y - p.y) == -1) swap(p, q);\n int sign = sgn(cross(p, q));\n if (sign == 1 && sgn(p.y) != 1 && sgn(q.y) == 1) is_in = !is_in;\n if (sign == 0 && sgn(dot(p, q)) != 1) return 1;\n }\n return is_in ? 2 : 0;\n }\n\n bool is_convex(const Polygon &a) {\n int n = a.size();\n REP(i, n) {\n if (ccw(a[(i - 1 + n) % n], a[i], a[(i + 1) % n]) == -1) return false;\n }\n return true;\n }\n\n Polygon monotone_chain(vector<Point> ps, bool tight = true) {\n sort(ALL(ps));\n int n = ps.size(), idx = 0;\n Polygon convex_hull(n << 1);\n for (int i = 0; i < n; convex_hull[idx++] = ps[i++]) {\n while (idx >= 2 && sgn(cross(convex_hull[idx - 1] - convex_hull[idx - 2], ps[i] - convex_hull[idx - 1])) < tight) --idx;\n }\n for (int i = n - 2, border = idx + 1; i >= 0; convex_hull[idx++] = ps[i--]) {\n while (idx >= border && sgn(cross(convex_hull[idx - 1] - convex_hull[idx - 2], ps[i] - convex_hull[idx - 1])) < tight) --idx;\n }\n convex_hull.resize(idx - 1);\n return convex_hull;\n }\n\n Polygon cut_convex(const Polygon &a, const Line &b) {\n int n = a.size();\n Polygon res;\n REP(i, n) {\n int c = ccw(b.s, b.t, a[i]);\n if (c != -1) res.emplace_back(a[i]);\n if (c * ccw(b.s, b.t, a[(i + 1) % n]) == -1) res.emplace_back(intersection(Line(a[i], a[(i + 1) % n]), b));\n }\n if (res.size() < 3) res.clear();\n return res;\n }\n\n pair<Point, Point> rotating_calipers(const Polygon &a) {\n int n = a.size(), high = 0, low = 0;\n if (n <= 2) {\n assert(n == 2);\n return {a[0], a[1]};\n }\n FOR(i, 1, n) {\n if (a[i].y > a[high].y) high = i;\n if (a[i].y < a[low].y) low = i;\n }\n Real max_norm = (a[high] - a[low]).norm();\n int i = high, j = low, max_i = i, max_j = j;\n do {\n ((sgn(cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j])) != -1 ? j : i) += 1) %= n;\n Real tmp = (a[j] - a[i]).norm();\n if (sgn(tmp - max_norm) == 1) {\n max_norm = tmp;\n max_i = i; max_j = j;\n }\n } while (i != high || j != low);\n return {a[max_i], a[max_j]};\n }\n}\n\nusing namespace Geometry;\n\nint main() {\n int n, k; cin >> n >> k;\n vector<Circle> people;\n REP(_, n) {\n Point p; double r; cin >> p >> r;\n people.emplace_back(p, r);\n }\n vector<double> l(n), r(n), comp;\n REP(i, n) {\n vector<Point> t = tangency(people[i], Point(0, 0));\n l[i] = t[0].arg(); r[i] = t[1].arg();\n if (l[i] > r[i]) swap(l[i], r[i]);\n if (r[i] > M_PI && has_intersected(people[i], Segment(Point(0, 0), Point(2415, 0)))) {\n swap(l[i], r[i]);\n l[i] = 0;\n } else {\n chmax(l[i], 0);\n chmin(r[i], M_PI);\n }\n if (l[i] < M_PI) {\n comp.emplace_back(l[i]);\n comp.emplace_back(r[i]);\n }\n }\n vector<bool> use(n, true);\n REP(i, n) {\n if (l[i] >= M_PI) use[i] = false;\n REP(j, n) {\n if (j != i && l[i] <= l[j] && r[j] <= r[i]) use[j] = false;\n }\n }\n vector<pair<double, double>> ball;\n REP(i, n) {\n if (use[i]) ball.emplace_back(l[i], r[i]);\n }\n n = ball.size();\n sort(ALL(ball));\n // REP(i, n) cout << ball[i].first << ' ' << ball[i].second << '\\n';\n vector<vector<vector<double>>> dp(n, vector<vector<double>>(k + 1, vector<double>(2, -INF)));\n dp[0][0][false] = 0;\n dp[0][1][true] = ball[0].second - ball[0].first;\n FOR(i, 1, n) {\n double left, right; tie(left, right) = ball[i];\n int x = i - 1;\n while (x >= 0 && ball[i].first <= ball[x].second) --x;\n ++x;\n chmin(x, i - 1);\n REP(j, k + 1) {\n if (j + 1 <= k) {\n chmax(dp[i][j + 1][true], dp[x][j][true] + right - max(ball[x].second, left));\n chmax(dp[i][j + 1][true], dp[x][j][false] + right - left);\n }\n chmax(dp[i][j][false], max(dp[i - 1][j][false], dp[i - 1][j][true]));\n }\n }\n double ans = 0;\n REP(y, k + 1) REP(z, 2) chmax(ans, dp[n - 1][y][z]);\n cout << ans / M_PI << '\\n';\n return 0;\n}","accuracy":0.8028169014084507,"time_ms":40,"memory_kb":47752,"score_of_the_acc":-0.2978,"final_rank":16},{"submission_id":"aoj_2276_4329154","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 1505\n\nstruct Point{\n Point(double arg_x,double arg_y){\n x = arg_x;\n y = arg_y;\n }\n\n Point(){\n x = y = 0.0;\n }\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 a){ return Point(a*x,a*y); }\n Point operator / (double a){ return Point(x/a,y/a); }\n\n double abs(){ return sqrt(norm()); }\n double norm(){ return x*x + y*y; }\n\n bool operator<(const Point &p) const{\n return x != p.x? x < p.x: y < p.y;\n }\n\n bool operator == (const Point &p) const{\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n\n double x,y;\n};\n\ntypedef Point Vector;\n\nstruct Sphere{\n Point center;\n double r;\n};\n\ntypedef Sphere Circle;\n\nstruct Line{\npublic:\n Point p[2];\n Line(Point p1,Point p2){\n p[0] = p1;\n p[1] = p2;\n }\n Line(){\n\n }\n};\n\nstruct Info{\n\tbool operator<(const struct Info &arg) const{\n\n\t\treturn left > arg.left;\n\t}\n\tdouble left,right;\n};\n\nint N,K;\nint most_L[SIZE];\nvector<Info> work,V;\ndouble dp1[SIZE][SIZE],dp2[SIZE][SIZE];\nCircle circle[SIZE];\n\n\ndouble NUM = 10000;\n\ndouble norm(Vector a){\n return a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n return 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\nPoint project(Line l,Point p){\n\n Vector base = l.p[1]-l.p[0];\n double r = dot(p-l.p[0],base)/norm(base);\n return l.p[0]+base*r;\n}\n\n//円と直線の交点を求める関数\nvector<Point> getCrossPoints(Circle c,Line l){\n\n vector<Point> ret;\n\n Vector pr = project(l,c.center);\n Vector e = (l.p[1]-l.p[0])/abs(l.p[1]-l.p[0]);\n\n double base;\n\n if(fabs(c.r*c.r-norm(pr-c.center)) < EPS){\n\n base = 0;\n }else{\n base = sqrt(c.r*c.r-norm(pr-c.center));\n }\n\n ret.push_back(Point(pr+e*base));\n ret.push_back(Point(pr-e*base));\n\n return ret;\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\nint calc_area(double deg){\n\n\tif(deg >= 0 && deg <= 90){\n\n\t\treturn 1;\n\t}else if(deg <= 180){\n\n\t\treturn 2;\n\t}else if(deg <= 270){\n\n\t\treturn 3;\n\t}else{\n\n\t\treturn 4;\n\t}\n}\n\nint main(){\n\n\tPoint base = Point(0,0);\n\n\tscanf(\"%d %d\",&N,&K);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf\",&circle[i].center.x,&circle[i].center.y,&circle[i].r);\n\t\tif(calc_dist(base,circle[i].center) < circle[i].r){\n\n\t\t\tprintf(\"1.0\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tint area1,area2;\n\n\tLine line = Line(Point(0,-10000),Point(0,10000));\n\n\tvector<Point> P;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdouble angle1 = atan2(circle[i].center.y,circle[i].center.x)*(180/M_PI);\n\t\tif(angle1 < 0){\n\n\t\t\tangle1 += 360;\n\t\t}\n\t\tdouble angle2 = asin(circle[i].r/abs(circle[i].center))*(180/M_PI);\n\t\tif(angle2 < 0){\n\n\t\t\tangle2 += 360;\n\t\t}\n\n\t\tdouble deg1 = angle1+angle2;\n\t\tif(deg1 >= 360){\n\n\t\t\tdeg1 -= 360;\n\t\t}\n\n\t\tdouble deg2 = angle1-angle2;\n\t\tif(deg2 < 0){\n\n\t\t\tdeg2 += 360;\n\t\t}\n\n\t\tarea1 = calc_area(deg1);\n\t\tarea2 = calc_area(deg2);\n\n\n\t\tif(area1 != 1 && area2 != 1 && area1 !=2 && area2 != 2)continue;\n\n\t\tif(area1 > area2){\n\t\t\tswap(area1,area2);\n\t\t\tswap(deg1,deg2);\n\t\t}\n\n\t\tInfo info;\n\t\tinfo.right = deg1;\n\n\t\tif(area1 == 1){\n\n\t\t\tswitch(area2){\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\t\tinfo.left = deg2;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tP = getCrossPoints(circle[i],line); //注意\n\n\t\t\t\tif(P[0].y > 0 && P[1].y > 0){\n\n\t\t\t\t\tinfo.left = 180;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo.left = 0;\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tinfo.left = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}else{ //area1 == 2\n\n\t\t\tswitch(area2){\n\t\t\tcase 2:\n\t\t\t\tinfo.left = deg2;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tinfo.left = 180;\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tP = getCrossPoints(circle[i],line); //注意\n\n\t\t\t\tif(P[0].y > 0 && P[1].y > 0){\n\n\t\t\t\t\tinfo.left = 0;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo.left = 180;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(info.right > info.left){\n\n\t\t\tswap(info.left,info.right);\n\t\t}\n\t\twork.push_back(info);\n\t}\n\n\tbool FLG;\n\t//他でカバーできる接線のペアは除く\n\tfor(int i = 0; i < work.size(); i++){\n\t\tFLG = false;\n\t\tfor(int k = i+1; k < work.size(); k++){\n\t\t\tif(k == i)continue;\n\n\t\t\tif(work[k].left >= work[i].left && work[k].right <= work[i].right){\n\n\t\t\t\tFLG = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(!FLG){\n\n\t\t\tV.push_back(work[i]);\n\t\t}\n\t}\n\n\tsort(V.begin(),V.end()); //leftの降順\n\n\tfor(int i = 0; i < V.size(); i++){\n\t\tmost_L[i] = -1;\n\t\tfor(int k = 0; k < i; k++){\n\t\t\tif(V[k].right > V[i].left+EPS)continue;\n\n\t\t\tmost_L[i] = k;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfor(int i = 0; i <= K; i++){\n\t\tfor(int k = 0; k <= V.size(); k++){\n\t\t\tdp1[i][k] = 0;\n\t\t\tdp2[i][k] = 0;\n\t\t}\n\t}\n\n\tdouble maximum = 0;\n\n\tfor(int i = 1; i <= K; i++){ //使用個数\n\t\tfor(int k = 1; k <= V.size(); k++){ //最後のindex(本来のindex+1)\n\t\t\tif(most_L[k-1] == -1){\n\n\t\t\t\tdp1[i][k] = dp2[i-1][k-1]+V[k-1].left-V[k-1].right;\n\n\t\t\t}else{ //重なりを持つ区間あり\n\n\t\t\t\tdp1[i][k] = max(dp1[i-1][most_L[k-1]+1]+V[most_L[k-1]].right-V[k-1].right,\n\t\t\t\t\t\tdp2[i-1][most_L[k-1]]+V[k-1].left-V[k-1].right);\n\t\t\t}\n\t\t\tdp2[i][k] = max(dp1[i][k],dp2[i][k-1]);\n\n\t\t\tmaximum = max(maximum,dp2[i][k]);\n\t\t}\n\t}\n\n\tprintf(\"%.10lf\\n\",maximum/180.0);\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":39032,"score_of_the_acc":-0.1731,"final_rank":8},{"submission_id":"aoj_2276_4329153","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 1505\n\nstruct Point{\n Point(double arg_x,double arg_y){\n x = arg_x;\n y = arg_y;\n }\n\n Point(){\n x = y = 0.0;\n }\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 a){ return Point(a*x,a*y); }\n Point operator / (double a){ return Point(x/a,y/a); }\n\n double abs(){ return sqrt(norm()); }\n double norm(){ return x*x + y*y; }\n\n bool operator<(const Point &p) const{\n return x != p.x? x < p.x: y < p.y;\n }\n\n bool operator == (const Point &p) const{\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n\n double x,y;\n};\n\ntypedef Point Vector;\n\nstruct Sphere{\n Point center;\n double r;\n};\n\ntypedef Sphere Circle;\n\nstruct Line{\npublic:\n Point p[2];\n Line(Point p1,Point p2){\n p[0] = p1;\n p[1] = p2;\n }\n Line(){\n\n }\n};\n\nstruct Info{\n\tbool operator<(const struct Info &arg) const{\n\n\t\treturn left > arg.left;\n\t}\n\tdouble left,right;\n};\n\nint N,K;\nint most_L[SIZE];\nvector<Info> work,V;\ndouble dp1[SIZE][SIZE],dp2[SIZE][SIZE];\nCircle circle[SIZE];\n\n\ndouble NUM = 10000;\n\ndouble norm(Vector a){\n return a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n return 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\nPoint project(Line l,Point p){\n\n Vector base = l.p[1]-l.p[0];\n double r = dot(p-l.p[0],base)/norm(base);\n return l.p[0]+base*r;\n}\n\n//円と直線の交点を求める関数\nvector<Point> getCrossPoints(Circle c,Line l){\n\n vector<Point> ret;\n\n Vector pr = project(l,c.center);\n Vector e = (l.p[1]-l.p[0])/abs(l.p[1]-l.p[0]);\n\n double base;\n\n if(fabs(c.r*c.r-norm(pr-c.center)) < EPS){\n\n base = 0;\n }else{\n base = sqrt(c.r*c.r-norm(pr-c.center));\n }\n\n ret.push_back(Point(pr+e*base));\n ret.push_back(Point(pr-e*base));\n\n return ret;\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\nint calc_area(double deg){\n\n\tif(deg >= 0 && deg <= 90){\n\n\t\treturn 1;\n\t}else if(deg <= 180){\n\n\t\treturn 2;\n\t}else if(deg <= 270){\n\n\t\treturn 3;\n\t}else{\n\n\t\treturn 4;\n\t}\n}\n\n\n//第1,第2象限の角度を求める\ndouble calc_angle(Vector vec){\n\n\tif(fabs(vec.x) < EPS){\n\n\t\treturn 90;\n\t}\n\tdouble ret = atan(fabs(vec.y)/fabs(vec.x))*(180/M_PI);\n\n\tif(vec.x < 0){\n\n\t\tret = 180-ret;\n\t}\n\treturn ret;\n}\n\n\n\nint main(){\n\n\tPoint base = Point(0,0);\n\n\tscanf(\"%d %d\",&N,&K);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf\",&circle[i].center.x,&circle[i].center.y,&circle[i].r);\n\t\tif(calc_dist(base,circle[i].center) < circle[i].r){\n\n\t\t\tprintf(\"1.0\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tint area1,area2;\n\n\tLine line = Line(Point(0,-10000),Point(0,10000));\n\n\tvector<Point> P;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdouble angle1 = atan2(circle[i].center.y,circle[i].center.x)*(180/M_PI);\n\t\tif(angle1 < 0){\n\n\t\t\tangle1 += 360;\n\t\t}\n\t\tdouble angle2 = asin(circle[i].r/abs(circle[i].center))*(180/M_PI);\n\t\tif(angle2 < 0){\n\n\t\t\tangle2 += 360;\n\t\t}\n\n\t\tdouble deg1 = angle1+angle2;\n\t\tif(deg1 >= 360){\n\n\t\t\tdeg1 -= 360;\n\t\t}\n\n\t\tdouble deg2 = angle1-angle2;\n\t\tif(deg2 < 0){\n\n\t\t\tdeg2 += 360;\n\t\t}\n\n\t\tarea1 = calc_area(deg1);\n\t\tarea2 = calc_area(deg2);\n\n\n\t\tif(area1 != 1 && area2 != 1 && area1 !=2 && area2 != 2)continue;\n\n\t\tif(area1 > area2){\n\t\t\tswap(area1,area2);\n\t\t\tswap(deg1,deg2);\n\t\t}\n\n\t\tInfo info;\n\t\tinfo.right = deg1;\n\n\t\tif(area1 == 1){\n\n\t\t\tswitch(area2){\n\t\t\tcase 1:\n\t\t\tcase 2:\n\t\t\t\tinfo.left = deg2;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tP = getCrossPoints(circle[i],line);\n\n\t\t\t\tif(P[0].y > 0 && P[1].y > 0){\n\n\t\t\t\t\tinfo.left = 180;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo.left = 0;\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tinfo.left = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t}else{ //area1 == 2\n\n\t\t\tswitch(area2){\n\t\t\tcase 2:\n\t\t\t\tinfo.left = deg2;\n\t\t\t\tbreak;\n\t\t\tcase 3:\n\t\t\t\tinfo.left = 180;\n\t\t\t\tbreak;\n\t\t\tcase 4:\n\t\t\t\tP = getCrossPoints(circle[i],line);\n\n\t\t\t\tif(P[0].y > 0 && P[1].y > 0){\n\n\t\t\t\t\tinfo.left = 0;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo.left = 180;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(info.right > info.left){\n\n\t\t\tswap(info.left,info.right);\n\t\t}\n\t\twork.push_back(info);\n\t}\n\n\tbool FLG;\n\t//他でカバーできる接線のペアは除く\n\tfor(int i = 0; i < work.size(); i++){\n\t\tFLG = false;\n\t\tfor(int k = i+1; k < work.size(); k++){\n\t\t\tif(k == i)continue;\n\n\t\t\tif(work[k].left >= work[i].left && work[k].right <= work[i].right){\n\n\t\t\t\tFLG = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(!FLG){\n\n\t\t\tV.push_back(work[i]);\n\t\t}\n\t}\n\n\tsort(V.begin(),V.end()); //leftの降順\n\n\tfor(int i = 0; i < V.size(); i++){\n\t\tmost_L[i] = -1;\n\t\tfor(int k = 0; k < i; k++){\n\t\t\tif(V[k].right > V[i].left+EPS)continue;\n\n\t\t\tmost_L[i] = k;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfor(int i = 0; i <= K; i++){\n\t\tfor(int k = 0; k <= V.size(); k++){\n\t\t\tdp1[i][k] = 0;\n\t\t\tdp2[i][k] = 0;\n\t\t}\n\t}\n\n\tdouble maximum = 0;\n\n\tfor(int i = 1; i <= K; i++){ //使用個数\n\t\tfor(int k = 1; k <= V.size(); k++){ //最後のindex(本来のindex+1)\n\t\t\tif(most_L[k-1] == -1){\n\n\t\t\t\tdp1[i][k] = dp2[i-1][k-1]+V[k-1].left-V[k-1].right;\n\n\t\t\t}else{ //重なりを持つ区間あり\n\n\t\t\t\tdp1[i][k] = max(dp1[i-1][most_L[k-1]+1]+V[most_L[k-1]].right-V[k-1].right,\n\t\t\t\t\t\tdp2[i-1][most_L[k-1]]+V[k-1].left-V[k-1].right);\n\t\t\t}\n\t\t\tdp2[i][k] = max(dp1[i][k],dp2[i][k-1]);\n\n\t\t\tmaximum = max(maximum,dp2[i][k]);\n\t\t}\n\t}\n\n\tprintf(\"%.10lf\\n\",maximum/180.0);\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":39064,"score_of_the_acc":-0.1734,"final_rank":10},{"submission_id":"aoj_2276_4329029","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 1505\n\nstruct Point{\n Point(double arg_x,double arg_y){\n x = arg_x;\n y = arg_y;\n }\n\n Point(){\n x = y = 0.0;\n }\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 a){ return Point(a*x,a*y); }\n Point operator / (double a){ return Point(x/a,y/a); }\n\n double abs(){ return sqrt(norm()); }\n double norm(){ return x*x + y*y; }\n\n bool operator<(const Point &p) const{\n return x != p.x? x < p.x: y < p.y;\n }\n\n bool operator == (const Point &p) const{\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n }\n\n double x,y;\n};\n\ntypedef Point Vector;\n\nstruct Sphere{\n Point center;\n double r;\n};\n\ntypedef Sphere Circle;\n\nstruct Line{\npublic:\n Point p[2];\n Line(Point p1,Point p2){\n p[0] = p1;\n p[1] = p2;\n }\n Line(){\n\n }\n};\n\nstruct Info{\n\tbool operator<(const struct Info &arg) const{\n\n\t\treturn left > arg.left;\n\t}\n\tdouble left,right;\n};\n\nint N,K;\nint most_L[SIZE];\nvector<Info> work,V;\ndouble dp1[SIZE][SIZE],dp2[SIZE][SIZE];\nCircle circle[SIZE];\n\n\ndouble NUM = 10000;\n\ndouble norm(Vector a){\n return a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n return sqrt(norm(a));\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\nint main(){\n\n\tPoint base = Point(0,0);\n\n\tscanf(\"%d %d\",&N,&K);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%lf %lf %lf\",&circle[i].center.x,&circle[i].center.y,&circle[i].r);\n\t\tif(calc_dist(base,circle[i].center) < circle[i].r){\n\n\t\t\tprintf(\"1.0\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdouble theta1 = atan2(circle[i].center.y,circle[i].center.x);\n\t\tdouble theta2 = asin(circle[i].r/abs(circle[i].center));\n\n\t\tInfo info;\n\t\tinfo.right = theta1-theta2;\n\t\tinfo.left = theta1+theta2;\n\n\t\tif(info.right < -(M_PI+EPS)){\n\n\t\t\tinfo.left += 2*M_PI;\n\t\t\tinfo.right += 2*M_PI;\n\t\t}\n\n\t\tinfo.right = max(info.right,0.0);\n\t\tinfo.left = min(info.left,M_PI);\n\n\t\tif(info.right+EPS > info.left){\n\n\t\t\tcontinue;\n\t\t}\n\n\t\twork.push_back(info);\n\t}\n\n\tbool FLG;\n\t//他でカバーできる接線のペアは除く\n\tfor(int i = 0; i < work.size(); i++){\n\t\tFLG = false;\n\t\tfor(int k = i+1; k < work.size(); k++){\n\t\t\tif(k == i)continue;\n\n\t\t\tif(work[k].left >= work[i].left && work[k].right <= work[i].right){\n\n\t\t\t\tFLG = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(!FLG){\n\n\t\t\tV.push_back(work[i]);\n\t\t}\n\t}\n\n\tsort(V.begin(),V.end()); //leftの降順\n\n\tfor(int i = 0; i < V.size(); i++){\n\t\tmost_L[i] = -1;\n\t\tfor(int k = 0; k < i; k++){\n\t\t\tif(V[k].right > V[i].left+EPS)continue;\n\n\t\t\tmost_L[i] = k;\n\t\t\tbreak;\n\t\t}\n\t}\n\n\tfor(int i = 0; i <= K; i++){\n\t\tfor(int k = 0; k <= V.size(); k++){\n\t\t\tdp1[i][k] = 0;\n\t\t\tdp2[i][k] = 0;\n\t\t}\n\t}\n\n\tdouble maximum = 0;\n\n\tfor(int i = 1; i <= K; i++){ //使用個数\n\t\tfor(int k = 1; k <= V.size(); k++){ //最後のindex(本来のindex+1)\n\t\t\tif(most_L[k-1] == -1){\n\n\t\t\t\tdp1[i][k] = dp2[i-1][k-1]+V[k-1].left-V[k-1].right;\n\n\t\t\t}else{ //重なりを持つ区間あり\n\n\t\t\t\tdp1[i][k] = max(dp1[i-1][most_L[k-1]+1]+V[most_L[k-1]].right-V[k-1].right,\n\t\t\t\t\t\tdp2[i-1][most_L[k-1]]+V[k-1].left-V[k-1].right);\n\t\t\t}\n\t\t\tdp2[i][k] = max(dp1[i][k],dp2[i][k-1]);\n\n\t\t\tmaximum = max(maximum,dp2[i][k]);\n\t\t}\n\t}\n\n\tprintf(\"%.10lf\\n\",maximum/M_PI);\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":39032,"score_of_the_acc":-0.1731,"final_rank":8},{"submission_id":"aoj_2276_3919772","code_snippet":"#pragma GCC optimize (\"O3\")\n\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <queue>\n#include <set>\n#include <algorithm>\n#include <numeric>\n#include <list>\nusing namespace std;\n\nusing QWORD = uint64_t;\nusing SQWORD = int64_t;\nusing DWORD = uint32_t;\nusing SDWORD = int32_t;\nusing WORD = uint16_t;\nusing SWORD = int16_t;\nusing BYTE = uint8_t;\nusing SBYTE = int8_t;\nusing DOUBLE = double;\nusing FLOAT = float;\n\n#define MIN_SDWORD (-2147483648)\n#define MAX_SDWORD (2147483647)\n#define MIN_SBYTE (-128)\n#define MAX_SBYTE (127)\n\n#define MIN_SQWORD (0x8000000000000000)\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\n\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\n#define MAX_DWORD (0xFFFFFFFF)\n#define MAX_WORD (0xFFFF)\n#define MAX_BYTE (0xFF)\n\n#define MAX_DOUBLE (1.0e+308)\n#define DOUBLE_EPS (1.0e-12)\n#define MIN_DOUBLE_N (-1.0e+308)\n\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\n\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\nstatic inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; };\n\n#define BYTE_BITS (8)\n#define WORD_BITS (16)\n#define DWORD_BITS (32)\n#define QWORD_BITS (64)\n\n#define ANS_MOD (1000000007)\n\nstatic const DOUBLE d_PI = 3.14159265358979323846;\n//static const DOUBLE d_PI = M_PI;\n\n\nstatic inline bool DoubleIsEqual(DOUBLE a, DOUBLE b) {\n return ABS(a-b) < DOUBLE_EPS;\n}\n\nstatic inline void inputStringSpSeparated(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c) || (' ' == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\nstatic inline void inputString(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\n\nstatic inline SQWORD inputSQWORD(void)\n{\n SQWORD sqNumber = 0;\n SQWORD sqMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n sqMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n sqNumber *= 10LL;\n sqNumber += (SQWORD)(c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return sqNumber * sqMultiplier;\n }\n }\n }\n}\n\n\nstatic inline SDWORD inputSDWORD(void)\n{\n SDWORD lNumber = 0;\n SDWORD lMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n lMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n lNumber *= 10;\n lNumber += (c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return lNumber * lMultiplier;\n }\n }\n }\n}\n\nstatic inline DOUBLE inputFP(void)\n{\n DOUBLE dInt = 0.0;\n DOUBLE dFrac = 0.0;\n DOUBLE dMultiplier = 1.0;\n DWORD dwFpCnt = 0;\n DOUBLE *pdCur = &dInt;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n dMultiplier = -1;\n }\n }\n if ('.' == c) {\n pdCur = &dFrac;\n } else if (('0' <= c) && (c <= '9')) {\n (*pdCur) *= 10;\n (*pdCur) += (DOUBLE)(c - '0');\n bRead = true;\n if (pdCur == &dFrac) {\n dwFpCnt++;\n }\n } else {\n if (bRead) {\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\n }\n }\n }\n}\n\n/*----------------------------------------------*/\n/**\n * mod による操作ライブラリ\n */\n#define ANS_MOD (1000000007)\n\nclass MODINT {\n static SQWORD MOD;\n SQWORD m_x;\n\npublic:\n MODINT(SQWORD val) {\n m_x = (val % MOD + MOD) % MOD;\n };\n MODINT() {\n m_x = 0;\n }\n static void Init(SQWORD sqMod) {\n MOD = sqMod;\n }\n\n\tMODINT& operator+= (const MODINT a)\n {\n m_x = (m_x + a.m_x) % MOD; \n return *this;\n };\n\tMODINT& operator-= (const MODINT a)\n { \n m_x = (m_x - a.m_x + MOD) % MOD; \n return *this;\n };\n\tMODINT& operator*= (const MODINT a)\n {\n m_x = (m_x * a.m_x) % MOD;\n return *this;\n };\n MODINT pow(SQWORD t) const {\n if (!t) return 1;\n MODINT a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\tMODINT operator+ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res += a);\n\t}\n\tMODINT operator- (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res -= a);\n\t}\n\tMODINT operator* (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res *= a);\n\t}\n\tMODINT operator/ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res /= a);\n\t}\n\n /* 逆元 */\n MODINT inv() const {\n return pow(MOD-2);\n }\n\n /* 除算 */\n MODINT& operator/=(const MODINT a) {\n return (*this) *= a.inv();\n } \n\n /* 整数版 */\n\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\n\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\n\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\n\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\n\n SQWORD getVal() { return m_x; };\n};\nSQWORD MODINT::MOD = ANS_MOD;\n\n\n/*----------------------------------------------*/\n\n#define EPS 1e-10\nDOUBLE double_add(DOUBLE a, DOUBLE b) {\n if (ABS(a + b) < EPS * (ABS(a) + ABS(b))) {\n return 0;\n }\n return a+b;\n}\n\nstruct VECTOR_2D {\n DOUBLE dX;\n DOUBLE dY;\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\n VECTOR_2D() : dX(0), dY(0) {};\n\n /* 加算 */\n\tVECTOR_2D& operator+= (const VECTOR_2D a)\n { \n dX = dX + a.dX;\n dY = dY + a.dY;\n return *this;\n };\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \n };\n\n /* 減算 */\n\tVECTOR_2D& operator-= (const VECTOR_2D a)\n { \n dX = dX - a.dX;\n dY = dY - a.dY;\n return *this;\n };\n const VECTOR_2D operator- (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\n };\n\n /* 定数倍 */\n\tVECTOR_2D& operator*= (const DOUBLE a)\n { \n dX = dX * a;\n dY = dY * a;\n return *this;\n };\n const VECTOR_2D operator* (const DOUBLE a) const {\n\t\treturn VECTOR_2D(dX * a, dY * a); \n };\n\n /* 比較 */\n bool operator< (const VECTOR_2D &a) {\n if (dX == a.dX) {\n return (dY < a.dY);\n }\n return dX < a.dX;\n }\n\n DOUBLE norm(void) const {\n return (dX * dX + dY * dY);\n }\n\n DOUBLE dist(void) const {\n return sqrtl(norm());\n }\n\n DOUBLE angle(void) const {\n return atan2(dY, dX);\n }\n\n DOUBLE dotproduct(const VECTOR_2D a) const {\n return double_add(dX * a.dX, dY * a.dY);\n }\n\n DOUBLE crossproduct(const VECTOR_2D a) const {\n return double_add(dX * a.dY, -dY * a.dX);\n }\n};\n\n\n\n/*----------------------------------------------*/\n\nstruct BALL_ST {\n DOUBLE dBegin;\n DOUBLE dEnd;\n\n BALL_ST (DOUBLE b, DOUBLE e) : dBegin(b), dEnd(e) {};\n}; \n\nbool cmpBegin (const BALL_ST &a, const BALL_ST &b) {\n return a.dBegin < b.dBegin;\n}\n\nbool cmpEnd (const BALL_ST &a, const BALL_ST &b) {\n return a.dEnd < b.dEnd;\n}\n\n/**\n * 角度の扱い \n */\nstatic inline DOUBLE normalizeAngle(DOUBLE dAngle)\n{\n DOUBLE dRet = dAngle;\n while (dRet < 0.0) {\n dRet += (2.0 * d_PI);\n }\n\n if (DoubleIsEqual(2.0 * d_PI, dAngle)) {\n dRet = 0.0;\n } else {\n while ((2.0 * d_PI) <= dAngle) {\n dRet -= (2.0 * d_PI);\n }\n }\n\n return dRet;\n}\n\n#define MAX_N (1500)\nint main(void)\n{\n SQWORD sqN = inputSQWORD();\n SQWORD sqK = inputSQWORD();\n\n vector<BALL_ST> vecBalls;\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\n SQWORD sqX = inputSQWORD();\n SQWORD sqY = inputSQWORD();\n SQWORD sqR = inputSQWORD();\n\n VECTOR_2D stVec((DOUBLE)sqX, (DOUBLE)sqY);\n DOUBLE dAngle = stVec.angle();\n DOUBLE dDist = stVec.dist();\n DOUBLE dRange = asin((DOUBLE)sqR / dDist);\n\n DOUBLE dTheta1 = dAngle - dRange;\n DOUBLE dTheta2 = dAngle + dRange;\n \n dTheta1 = normalizeAngle(dTheta1);\n dTheta2 = normalizeAngle(dTheta2);\n\n DOUBLE dBegin, dEnd;\n\n if (d_PI <= dTheta1 && d_PI <= dTheta2) {\n dBegin = 0.0;\n dEnd = 0.0;\n } else if (d_PI <= dTheta1) {\n dBegin = 0.0;\n dEnd = dTheta2;\n } else if (d_PI <= dTheta2){\n dBegin = dTheta1;\n dEnd = d_PI;\n } else {\n dBegin = dTheta1;\n dEnd = dTheta2;\n }\n// printf(\"%f %f\\n\", dBegin, dEnd);\n vecBalls.emplace_back(dBegin, dEnd);\n }\n sort(vecBalls.begin(), vecBalls.end(), cmpBegin);\n\t/* 含まれてしまうものは除く */\n\tint sqSz = 0;\n\tfor (int i = 0; i < sqN; i++) {\n\t\tbool isIinJ = false;\n\t\tfor (int j = 1; j <= sqN; j++) {\n\t\t\tif (i == j) continue;\n\t\t\tif ((vecBalls[j].dBegin < vecBalls[i].dBegin) && (vecBalls[i].dEnd < vecBalls[j].dEnd)) {\n\t\t\t\tisIinJ = true;\n\t\t\t}\n\t\t}\n\t\tif (!isIinJ) {\n\t\t\tvecBalls[sqSz++] = vecBalls[i];\n\t\t}\n\t}\n// for (auto b: vecBalls) {\n// printf(\":%f %f\\n\", b.dBegin, b.dEnd);\n// }\n\n /**\n * dp[j][k] 左端がk番目のボールで、\n * j個を使っているときの最大の角度\n * dp[j][k] = max(dp[j-1][0] + angle, dp[j-1][1] + angle, dp[j-1][2] + angle ,,,, dp[j-1][k-1] + angle)\n * \n */\n static DOUBLE s_aadDpTbl[MAX_N + 1][MAX_N + 1];\n for (SQWORD sqIdxJ = 0; sqIdxJ <= sqK; sqIdxJ++) {\n for (SQWORD sqIdxK = 0; sqIdxK <= sqSz; sqIdxK++) {\n s_aadDpTbl[sqIdxJ][sqIdxK] = 0.0;\n }\n }\n\n\tdouble dAns = 0;\n\n\tfor (int i = 1; i <= sqK; i++) {\n\t\tfor (int j = 0; j < sqSz; j++) {\n\t\t\tdouble best = 0;\n\t\t\tint k = 0;\n\n\t\t\twhile (vecBalls[k].dEnd < vecBalls[j].dBegin) {\n\t\t\t\tbest = max(best, s_aadDpTbl[i-1][k]);\n\t\t\t\tk++;\n\t\t\t}\n\n// printf(\"--%d %f %f\\n\", j, vecBalls[j].dEnd, vecBalls[j].dBegin);\n\t\t\t\n\t\t\ts_aadDpTbl[i][j] = max(s_aadDpTbl[i][j], best + vecBalls[j].dEnd - vecBalls[j].dBegin);\n\t\t\ts_aadDpTbl[i][j] = max(s_aadDpTbl[i][j], s_aadDpTbl[i-1][k] + vecBalls[j].dEnd - vecBalls[k].dEnd);\n\t\t\tdAns = max(dAns, s_aadDpTbl[i][j]);\n// printf(\"%f \", s_aadDpTbl[i][j]);\n\t\t}\n// printf(\"\\n\");\n\t}\n\n#if 0\n DOUBLE dAns = 0.0;\n for (SQWORD sqIdxJ = 0; sqIdxJ < sqK; sqIdxJ++) {\n for (SQWORD sqIdxK = 0; sqIdxK < sz; sqIdxK++) {\n DOUBLE dPrevEnd = vecBalls[sqIdxK].dEnd;\n for (SQWORD sqNextBallIdx = sqIdxK + 1; sqNextBallIdx <= sz; sqNextBallIdx++) {\n BALL_ST stBall = vecBalls[sqNextBallIdx];\n DOUBLE dAddAngle = 0;\n if (dPrevEnd <= stBall.dBegin) {\n /* 重なってない */\n dAddAngle = stBall.dEnd - stBall.dBegin;\n// printf(\"> [%lld %lld %lld] %llf \", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \n = MAX(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\n } else {\n /* 重なってる */\n dAddAngle = stBall.dEnd - dPrevEnd;\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \n = MAX(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\n// printf(\"< [%lld %lld %lld] %llf \", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\n }\n\n dAns = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], dAns);\n }\n }\n// printf(\"\\n\");\n }\n#endif\n\n printf(\"%0.11f\\n\", dAns / d_PI);\n\n return 0;\n}","accuracy":1,"time_ms":330,"memory_kb":21172,"score_of_the_acc":-0.4624,"final_rank":11},{"submission_id":"aoj_2276_3917912","code_snippet":"#define _USE_MATH_DEFINES\n#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <numeric>\n#include <tuple>\n#include <iomanip>\n#include <assert.h>\n\n#define sqr(x) std::pow(x, 2.0)\n#define INF 1e10\n#define EPS 1e-10\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define POS_OR_INF(x) (x > 0 ? x : INF)\n\nusing namespace std;\n\nusing ld = long double;\n\nstruct Point {\n\tPoint() = default;\n\tPoint(ld x, ld y) : x(x), y(y) {}\n\tPoint(const Point& s, const Point& e) : x(e.x - s.x), y(e.y - s.y) {}\n\n\tPoint normalized(void) const {\n\t\treturn Point(x / norm(), y / norm());\n\t}\n\n\tld norm(void) const {\n\t\treturn sqrt(x * x + y * y);\n\t}\n\n\tPoint flipped(void) const {\n\t\treturn Point(-x, -y);\n\t}\n\n\tPoint normal_vector(bool normalize = false) const {\n\t\tauto vec = Point(-y, x);\n\t\treturn normalize ? vec.normalized() : vec;\n\t}\n\n\tld x, y;\n};\n\nusing Vector = Point;\n\ninline Vector points2vec(const Point& s, const Point& e) {\n\treturn Vector(e.x - s.x, e.y - s.y);\n}\n\ninline ld distance(const Point& s, const Point& e) {\n\treturn points2vec(s, e).norm();\n}\n\ninline ld distance_square(const Point& s, const Point& e) {\n\treturn pow(points2vec(s, e).norm(), 2.0);\n}\n\ninline Vector operator * (const Vector& l, ld r) {\n\treturn Vector(l.x * r, l.y * r);\n}\n\ninline Vector operator * (ld l, const Vector& r) {\n\treturn r * l;\n}\n\ninline Vector operator / (const Vector& l, ld r) {\n\treturn Vector(l.x / r, l.y / r);\n}\n\ninline Point operator + (const Point& l, const Point& r) {\n\treturn Point(l.x + r.x, l.y + r.y);\n}\n\ninline Point operator - (const Point& l, const Point& r) {\n\treturn Point(l.x - r.x, l.y - r.y);\n}\n\ninline istream& operator >> (istream& is, Point& p) {\n\treturn is >> p.x >> p.y;\n}\n\nint main(int argc, char** argv) {\n\tint N, K;\n\n\tcin >> N >> K;\n\tcout << fixed << setprecision(20);\n\n\tvector<pair<double, double>> a(N), b;\n\n\tfor (int i = 0; i < N; i++) {\n\t\tPoint p;\n\t\tdouble r;\n\t\tcin >> p >> r;\n\n\t\tdouble theta = asin(r/p.norm());\n\t\tdouble rad = atan2(p.y, p.x);\n\n\t\tif (rad < -M_PI / 2) rad += 2 * M_PI;\n\n\t\ta[i].first = min(M_PI, max(0.0, rad - theta));\n\t\ta[i].second = min(M_PI, max(0.0, rad + theta));\n\t}\n\n\tfor (int i = 0; i < N; i++) {\n\t\tbool included = false;\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tif (a[i].first > a[j].first && a[i].second < a[j].second)\n\t\t\t\tincluded = true;\n\t\t}\n\t\tif (!included) {\n\t\t\tb.push_back(a[i]);\n\t\t}\n\t}\n\n\tsort(b.begin(), b.end());\n\n\tint M = b.size();\n\n\tvector<vector<double>> dp(K + 1, vector<double>(M + 1, 0));\n\tdouble ans = 0;\n\n\tfor (int i = 1; i <= K; i++) {\n\t\tfor (int j = 0; j < M; j++) {\n\t\t\tdouble best = 0;\n\t\t\tint k = 0;\n\n\t\t\twhile (b[k].second < b[j].first) {\n\t\t\t\tbest = max(best, dp[i-1][k]);\n\t\t\t\tk++;\n\t\t\t}\n\t\t\t\n\t\t\tdp[i][j] = max(dp[i][j], best + b[j].second - b[j].first);\n\t\t\tdp[i][j] = max(dp[i][j], dp[i-1][k] + b[j].second - b[k].second);\n\t\t\tans = max(ans, dp[i][j]);\n\t\t}\n\t}\n\n\tcout << ans / M_PI;\n}","accuracy":1,"time_ms":340,"memory_kb":20612,"score_of_the_acc":-0.4714,"final_rank":12},{"submission_id":"aoj_2276_3917801","code_snippet":"#pragma GCC optimize (\"O3\")\n\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <queue>\n#include <set>\n#include <algorithm>\n#include <numeric>\n#include <list>\nusing namespace std;\n\nusing QWORD = uint64_t;\nusing SQWORD = int64_t;\nusing DWORD = uint32_t;\nusing SDWORD = int32_t;\nusing WORD = uint16_t;\nusing SWORD = int16_t;\nusing BYTE = uint8_t;\nusing SBYTE = int8_t;\nusing DOUBLE = double;\nusing FLOAT = float;\n\n#define MIN_SDWORD (-2147483648)\n#define MAX_SDWORD (2147483647)\n#define MIN_SBYTE (-128)\n#define MAX_SBYTE (127)\n\n#define MIN_SQWORD (0x8000000000000000)\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\n\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\n#define MAX_DWORD (0xFFFFFFFF)\n#define MAX_WORD (0xFFFF)\n#define MAX_BYTE (0xFF)\n\n#define MAX_DOUBLE (1.0e+308)\n#define DOUBLE_EPS (1.0e-12)\n#define MIN_DOUBLE_N (-1.0e+308)\n\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\n\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\nstatic inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; };\n\n#define BYTE_BITS (8)\n#define WORD_BITS (16)\n#define DWORD_BITS (32)\n#define QWORD_BITS (64)\n\n#define ANS_MOD (1000000007)\n\nstatic const DOUBLE d_PI = 3.14159265358979323846;\n\nstatic inline bool DoubleIsEqual(DOUBLE a, DOUBLE b) {\n return ABS(a-b) < DOUBLE_EPS;\n}\n\nstatic inline void inputStringSpSeparated(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c) || (' ' == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\nstatic inline void inputString(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\n\nstatic inline SQWORD inputSQWORD(void)\n{\n SQWORD sqNumber = 0;\n SQWORD sqMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n sqMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n sqNumber *= 10LL;\n sqNumber += (SQWORD)(c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return sqNumber * sqMultiplier;\n }\n }\n }\n}\n\n\nstatic inline SDWORD inputSDWORD(void)\n{\n SDWORD lNumber = 0;\n SDWORD lMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n lMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n lNumber *= 10;\n lNumber += (c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return lNumber * lMultiplier;\n }\n }\n }\n}\n\nstatic inline DOUBLE inputFP(void)\n{\n DOUBLE dInt = 0.0;\n DOUBLE dFrac = 0.0;\n DOUBLE dMultiplier = 1.0;\n DWORD dwFpCnt = 0;\n DOUBLE *pdCur = &dInt;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n dMultiplier = -1;\n }\n }\n if ('.' == c) {\n pdCur = &dFrac;\n } else if (('0' <= c) && (c <= '9')) {\n (*pdCur) *= 10;\n (*pdCur) += (DOUBLE)(c - '0');\n bRead = true;\n if (pdCur == &dFrac) {\n dwFpCnt++;\n }\n } else {\n if (bRead) {\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\n }\n }\n }\n}\n\n/*----------------------------------------------*/\n/**\n * mod による操作ライブラリ\n */\n#define ANS_MOD (1000000007)\n\nclass MODINT {\n static SQWORD MOD;\n SQWORD m_x;\n\npublic:\n MODINT(SQWORD val) {\n m_x = (val % MOD + MOD) % MOD;\n };\n MODINT() {\n m_x = 0;\n }\n static void Init(SQWORD sqMod) {\n MOD = sqMod;\n }\n\n\tMODINT& operator+= (const MODINT a)\n {\n m_x = (m_x + a.m_x) % MOD; \n return *this;\n };\n\tMODINT& operator-= (const MODINT a)\n { \n m_x = (m_x - a.m_x + MOD) % MOD; \n return *this;\n };\n\tMODINT& operator*= (const MODINT a)\n {\n m_x = (m_x * a.m_x) % MOD;\n return *this;\n };\n MODINT pow(SQWORD t) const {\n if (!t) return 1;\n MODINT a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\tMODINT operator+ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res += a);\n\t}\n\tMODINT operator- (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res -= a);\n\t}\n\tMODINT operator* (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res *= a);\n\t}\n\tMODINT operator/ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res /= a);\n\t}\n\n /* 逆元 */\n MODINT inv() const {\n return pow(MOD-2);\n }\n\n /* 除算 */\n MODINT& operator/=(const MODINT a) {\n return (*this) *= a.inv();\n } \n\n /* 整数版 */\n\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\n\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\n\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\n\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\n\n SQWORD getVal() { return m_x; };\n};\nSQWORD MODINT::MOD = ANS_MOD;\n\n\n/*----------------------------------------------*/\n\n#define EPS 1e-10\nDOUBLE double_add(DOUBLE a, DOUBLE b) {\n if (ABS(a + b) < EPS * (ABS(a) + ABS(b))) {\n return 0;\n }\n return a+b;\n}\n\nstruct VECTOR_2D {\n DOUBLE dX;\n DOUBLE dY;\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\n VECTOR_2D() : dX(0), dY(0) {};\n\n /* 加算 */\n\tVECTOR_2D& operator+= (const VECTOR_2D a)\n { \n dX = dX + a.dX;\n dY = dY + a.dY;\n return *this;\n };\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \n };\n\n /* 減算 */\n\tVECTOR_2D& operator-= (const VECTOR_2D a)\n { \n dX = dX - a.dX;\n dY = dY - a.dY;\n return *this;\n };\n const VECTOR_2D operator- (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\n };\n\n /* 定数倍 */\n\tVECTOR_2D& operator*= (const DOUBLE a)\n { \n dX = dX * a;\n dY = dY * a;\n return *this;\n };\n const VECTOR_2D operator* (const DOUBLE a) const {\n\t\treturn VECTOR_2D(dX * a, dY * a); \n };\n\n /* 比較 */\n bool operator< (const VECTOR_2D &a) {\n if (dX == a.dX) {\n return (dY < a.dY);\n }\n return dX < a.dX;\n }\n\n DOUBLE norm(void) const {\n return (dX * dX + dY * dY);\n }\n\n DOUBLE dist(void) const {\n return sqrtl(norm());\n }\n\n DOUBLE angle(void) const {\n return atan2(dY, dX);\n }\n\n DOUBLE dotproduct(const VECTOR_2D a) const {\n return double_add(dX * a.dX, dY * a.dY);\n }\n\n DOUBLE crossproduct(const VECTOR_2D a) const {\n return double_add(dX * a.dY, -dY * a.dX);\n }\n};\n\n\n\n/*----------------------------------------------*/\n\nstruct BALL_ST {\n DOUBLE dBegin;\n DOUBLE dEnd;\n\n BALL_ST (DOUBLE b, DOUBLE e) : dBegin(b), dEnd(e) {};\n}; \n\nbool cmpBegin (const BALL_ST &a, const BALL_ST &b) {\n return a.dBegin < b.dBegin;\n}\n\nbool cmpEnd (const BALL_ST &a, const BALL_ST &b) {\n return a.dEnd < b.dEnd;\n}\n\n/**\n * 角度の扱い \n */\nstatic inline DOUBLE normalizeAngle(DOUBLE dAngle)\n{\n DOUBLE dRet = dAngle;\n while (dRet < 0.0) {\n dRet += (2.0 * d_PI);\n }\n\n if (DoubleIsEqual(2.0 * d_PI, dAngle)) {\n dRet = 0.0;\n } else {\n while ((2.0 * d_PI) <= dAngle) {\n dRet -= (2.0 * d_PI);\n }\n }\n\n return dRet;\n}\n\n#define MAX_N (1500)\nint main(void)\n{\n SQWORD sqN = inputSQWORD();\n SQWORD sqK = inputSQWORD();\n\n vector<BALL_ST> vecBalls;\n vecBalls.emplace_back(0, 0); /* dp用にインデックスを1はじまりにするためのダミー */\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\n SQWORD sqX = inputSQWORD();\n SQWORD sqY = inputSQWORD();\n SQWORD sqR = inputSQWORD();\n\n VECTOR_2D stVec((DOUBLE)sqX, (DOUBLE)sqY);\n DOUBLE dAngle = stVec.angle();\n DOUBLE dDist = stVec.dist();\n DOUBLE dRange = asin((DOUBLE)sqR / dDist);\n\n DOUBLE dTheta1 = dAngle - dRange;\n DOUBLE dTheta2 = dAngle + dRange;\n \n dTheta1 = normalizeAngle(dTheta1);\n dTheta2 = normalizeAngle(dTheta2);\n\n DOUBLE dBegin, dEnd;\n\n if (d_PI <= dTheta1 && d_PI <= dTheta2) {\n dBegin = 0.0;\n dEnd = 0.0;\n } else if (d_PI <= dTheta1) {\n dBegin = 0.0;\n dEnd = dTheta2;\n } else if (d_PI <= dTheta2){\n dBegin = dTheta1;\n dEnd = d_PI;\n } else {\n dBegin = dTheta1;\n dEnd = dTheta2;\n }\n vecBalls.emplace_back(dBegin, dEnd);\n }\n sort(vecBalls.begin(), vecBalls.end(), cmpBegin);\n\n /**\n * dp[j][k] 左端がk番目のボールで、\n * j個を使っているときの最大の角度\n * dp[j][k] = max(dp[j-1][0] + angle, dp[j-1][1] + angle, dp[j-1][2] + angle ,,,, dp[j-1][k-1] + angle)\n * \n */\n static DOUBLE s_aadDpTbl[MAX_N + 1][MAX_N + 1];\n for (SQWORD sqIdxJ = 0; sqIdxJ <= sqN; sqIdxJ++) {\n for (SQWORD sqIdxK = 0; sqIdxK <= sqN; sqIdxK++) {\n s_aadDpTbl[sqIdxJ][sqIdxK] = 0.0;\n }\n }\n for (SQWORD sqIdxJ = 0; sqIdxJ < sqN; sqIdxJ++) {\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK < sqN; sqIdxK++) {\n DOUBLE dPrevEnd;\n if (0.0 == s_aadDpTbl[sqIdxJ][sqIdxK]) {\n dPrevEnd = 0.0;\n } else {\n dPrevEnd = vecBalls[sqIdxK].dEnd;\n } \n for (SQWORD sqNextBallIdx = sqIdxK + 1; sqNextBallIdx <= sqN; sqNextBallIdx++) {\n BALL_ST stBall = vecBalls[sqNextBallIdx];\n DOUBLE dAddAngle = 0;\n if (dPrevEnd < stBall.dBegin) {\n dAddAngle = stBall.dEnd - stBall.dBegin;\n// printf(\"> [%lld %lld %lld] %llf \", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \n = MAX(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\n } else {\n if (dPrevEnd < stBall.dEnd) {\n dAddAngle = stBall.dEnd - dPrevEnd;\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \n = MAX(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\n }\n// printf(\"< [%lld %lld %lld] %llf \", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\n }\n\n }\n }\n// printf(\"\\n\");\n }\n\n DOUBLE dAns = 0.0;\n for (SQWORD sqIdxJ = 1; sqIdxJ <= sqK; sqIdxJ++) {\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK <= sqN; sqIdxK++) {\n// printf(\"%llf \", s_aadDpTbl[sqIdxJ][sqIdxK] / d_PI);\n dAns = max(dAns, s_aadDpTbl[sqIdxJ][sqIdxK]);\n }\n// printf(\"\\n\");\n }\n\n printf(\"%0.11f\\n\", dAns / d_PI);\n\n return 0;\n}","accuracy":0.3380281690140845,"time_ms":710,"memory_kb":21144,"score_of_the_acc":-1.005,"final_rank":18},{"submission_id":"aoj_2276_3917747","code_snippet":"#pragma GCC optimize (\"O3\")\n\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <queue>\n#include <set>\n#include <algorithm>\n#include <numeric>\n#include <list>\nusing namespace std;\n\nusing QWORD = uint64_t;\nusing SQWORD = int64_t;\nusing DWORD = uint32_t;\nusing SDWORD = int32_t;\nusing WORD = uint16_t;\nusing SWORD = int16_t;\nusing BYTE = uint8_t;\nusing SBYTE = int8_t;\nusing DOUBLE = double;\nusing FLOAT = float;\n\n#define MIN_SDWORD (-2147483648)\n#define MAX_SDWORD (2147483647)\n#define MIN_SBYTE (-128)\n#define MAX_SBYTE (127)\n\n#define MIN_SQWORD (0x8000000000000000)\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\n\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\n#define MAX_DWORD (0xFFFFFFFF)\n#define MAX_WORD (0xFFFF)\n#define MAX_BYTE (0xFF)\n\n#define MAX_DOUBLE (1.0e+308)\n#define DOUBLE_EPS (1.0e-12)\n#define MIN_DOUBLE_N (-1.0e+308)\n\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\n\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\nstatic inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; };\n\n#define BYTE_BITS (8)\n#define WORD_BITS (16)\n#define DWORD_BITS (32)\n#define QWORD_BITS (64)\n\n#define ANS_MOD (1000000007)\n\nstatic const DOUBLE d_PI = 3.14159265358979323846;\n\n\nstatic inline void inputStringSpSeparated(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c) || (' ' == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\nstatic inline void inputString(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\n\nstatic inline SQWORD inputSQWORD(void)\n{\n SQWORD sqNumber = 0;\n SQWORD sqMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n sqMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n sqNumber *= 10LL;\n sqNumber += (SQWORD)(c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return sqNumber * sqMultiplier;\n }\n }\n }\n}\n\n\nstatic inline SDWORD inputSDWORD(void)\n{\n SDWORD lNumber = 0;\n SDWORD lMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n lMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n lNumber *= 10;\n lNumber += (c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return lNumber * lMultiplier;\n }\n }\n }\n}\n\nstatic inline DOUBLE inputFP(void)\n{\n DOUBLE dInt = 0.0;\n DOUBLE dFrac = 0.0;\n DOUBLE dMultiplier = 1.0;\n DWORD dwFpCnt = 0;\n DOUBLE *pdCur = &dInt;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n dMultiplier = -1;\n }\n }\n if ('.' == c) {\n pdCur = &dFrac;\n } else if (('0' <= c) && (c <= '9')) {\n (*pdCur) *= 10;\n (*pdCur) += (DOUBLE)(c - '0');\n bRead = true;\n if (pdCur == &dFrac) {\n dwFpCnt++;\n }\n } else {\n if (bRead) {\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\n }\n }\n }\n}\n\n/*----------------------------------------------*/\n/**\n * mod による操作ライブラリ\n */\n#define ANS_MOD (1000000007)\n\nclass MODINT {\n static SQWORD MOD;\n SQWORD m_x;\n\npublic:\n MODINT(SQWORD val) {\n m_x = (val % MOD + MOD) % MOD;\n };\n MODINT() {\n m_x = 0;\n }\n static void Init(SQWORD sqMod) {\n MOD = sqMod;\n }\n\n\tMODINT& operator+= (const MODINT a)\n {\n m_x = (m_x + a.m_x) % MOD; \n return *this;\n };\n\tMODINT& operator-= (const MODINT a)\n { \n m_x = (m_x - a.m_x + MOD) % MOD; \n return *this;\n };\n\tMODINT& operator*= (const MODINT a)\n {\n m_x = (m_x * a.m_x) % MOD;\n return *this;\n };\n MODINT pow(SQWORD t) const {\n if (!t) return 1;\n MODINT a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\tMODINT operator+ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res += a);\n\t}\n\tMODINT operator- (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res -= a);\n\t}\n\tMODINT operator* (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res *= a);\n\t}\n\tMODINT operator/ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res /= a);\n\t}\n\n /* 逆元 */\n MODINT inv() const {\n return pow(MOD-2);\n }\n\n /* 除算 */\n MODINT& operator/=(const MODINT a) {\n return (*this) *= a.inv();\n } \n\n /* 整数版 */\n\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\n\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\n\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\n\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\n\n SQWORD getVal() { return m_x; };\n};\nSQWORD MODINT::MOD = ANS_MOD;\n\n\n/*----------------------------------------------*/\n\n#define EPS 1e-10\nDOUBLE double_add(DOUBLE a, DOUBLE b) {\n if (ABS(a + b) < EPS * (ABS(a) + ABS(b))) {\n return 0;\n }\n return a+b;\n}\n\nstruct VECTOR_2D {\n DOUBLE dX;\n DOUBLE dY;\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\n VECTOR_2D() : dX(0), dY(0) {};\n\n /* 加算 */\n\tVECTOR_2D& operator+= (const VECTOR_2D a)\n { \n dX = dX + a.dX;\n dY = dY + a.dY;\n return *this;\n };\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \n };\n\n /* 減算 */\n\tVECTOR_2D& operator-= (const VECTOR_2D a)\n { \n dX = dX - a.dX;\n dY = dY - a.dY;\n return *this;\n };\n const VECTOR_2D operator- (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\n };\n\n /* 定数倍 */\n\tVECTOR_2D& operator*= (const DOUBLE a)\n { \n dX = dX * a;\n dY = dY * a;\n return *this;\n };\n const VECTOR_2D operator* (const DOUBLE a) const {\n\t\treturn VECTOR_2D(dX * a, dY * a); \n };\n\n /* 比較 */\n bool operator< (const VECTOR_2D &a) {\n if (dX == a.dX) {\n return (dY < a.dY);\n }\n return dX < a.dX;\n }\n\n DOUBLE norm(void) const {\n return (dX * dX + dY * dY);\n }\n\n DOUBLE dist(void) const {\n return sqrtl(norm());\n }\n\n DOUBLE angle(void) const {\n return atan2(dY, dX);\n }\n\n DOUBLE dotproduct(const VECTOR_2D a) const {\n return double_add(dX * a.dX, dY * a.dY);\n }\n\n DOUBLE crossproduct(const VECTOR_2D a) const {\n return double_add(dX * a.dY, -dY * a.dX);\n }\n};\n\n\n\n/*----------------------------------------------*/\n\nstruct BALL_ST {\n DOUBLE dBegin;\n DOUBLE dEnd;\n\n BALL_ST (DOUBLE b, DOUBLE e) : dBegin(b), dEnd(e) {};\n}; \n\nbool cmpBegin (const BALL_ST &a, const BALL_ST &b) {\n return a.dBegin < b.dBegin;\n}\n\nbool cmpEnd (const BALL_ST &a, const BALL_ST &b) {\n return a.dEnd < b.dEnd;\n}\n\n/**\n * 角度の扱い \n */\nstatic inline DOUBLE normalizeAngle(DOUBLE dAngle)\n{\n DOUBLE dRet = dAngle;\n while (dRet < 0.0) {\n dRet += (2.0 * d_PI);\n }\n\n while ((2.0 * d_PI) < dAngle) {\n dRet -= (2.0 * d_PI);\n }\n\n return dRet;\n}\n\n#define MAX_N (1500)\nint main(void)\n{\n SQWORD sqN = inputSQWORD();\n SQWORD sqK = inputSQWORD();\n\n vector<BALL_ST> vecBalls;\n vecBalls.emplace_back(0, 0); /* dp用にインデックスを1はじまりにするためのダミー */\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\n SQWORD sqX = inputSQWORD();\n SQWORD sqY = inputSQWORD();\n SQWORD sqR = inputSQWORD();\n\n VECTOR_2D stVec((DOUBLE)sqX, (DOUBLE)sqY);\n DOUBLE dAngle = normalizeAngle(stVec.angle());\n DOUBLE dDist = stVec.dist();\n DOUBLE dRange = asin((DOUBLE)sqR / dDist);\n \n DOUBLE dBegin, dEnd;\n if (2 * d_PI <= (dAngle + dRange)) {\n dBegin = 0.0;\n dEnd = dAngle + dRange - (2 * d_PI);\n } else {\n dBegin = MIN(MAX(dAngle - dRange, 0.0), d_PI);\n dEnd = MIN(MAX(dAngle + dRange, 0.0), d_PI); \n }\n\n\n\n// printf(\"%0.10f %0.10f\\n\", dBegin, dEnd);\n\n vecBalls.emplace_back(dBegin, dEnd);\n }\n sort(vecBalls.begin(), vecBalls.end(), cmpBegin);\n\n /**\n * dp[j][k] 左端がk番目のボールで、\n * j個を使っているときの最大の角度\n * dp[j][k] = max(dp[j-1][0] + angle, dp[j-1][1] + angle, dp[j-1][2] + angle ,,,, dp[j-1][k-1] + angle)\n * \n */\n static DOUBLE s_aadDpTbl[MAX_N + 1][MAX_N + 1];\n for (SQWORD sqIdxJ = 0; sqIdxJ <= sqN; sqIdxJ++) {\n for (SQWORD sqIdxK = 0; sqIdxK <= sqN; sqIdxK++) {\n s_aadDpTbl[sqIdxJ][sqIdxK] = 0;\n }\n }\n for (SQWORD sqIdxJ = 0; sqIdxJ < sqN; sqIdxJ++) {\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK < sqN; sqIdxK++) {\n DOUBLE dPrevEnd = vecBalls[sqIdxK].dEnd;\n for (SQWORD sqNextBallIdx = sqIdxK + 1; sqNextBallIdx <= sqN; sqNextBallIdx++) {\n BALL_ST stBall = vecBalls[sqNextBallIdx];\n DOUBLE dAddAngle = 0;\n if (dPrevEnd < stBall.dBegin) {\n dAddAngle = stBall.dEnd - stBall.dBegin;\n// printf(\"> [%lld %lld %lld] %llf \", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\n } else {\n if (dPrevEnd < stBall.dEnd) {\n dAddAngle = stBall.dEnd - dPrevEnd;\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\n }\n// printf(\"< [%lld %lld %lld] %llf \", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\n }\n\n }\n }\n// printf(\"\\n\");\n }\n\n DOUBLE dAns = 0.0;\n for (SQWORD sqIdxJ = 1; sqIdxJ <= sqK; sqIdxJ++) {\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK <= sqN; sqIdxK++) {\n// printf(\"%llf \", s_aadDpTbl[sqIdxJ][sqIdxK] / d_PI);\n dAns = max(dAns, s_aadDpTbl[sqIdxJ][sqIdxK]);\n }\n// printf(\"\\n\");\n }\n\n printf(\"%0.11f\\n\", dAns / d_PI);\n\n return 0;\n}","accuracy":0.3380281690140845,"time_ms":570,"memory_kb":21292,"score_of_the_acc":-0.8064,"final_rank":17},{"submission_id":"aoj_2276_3917743","code_snippet":"#pragma GCC optimize (\"O3\")\n\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <queue>\n#include <set>\n#include <algorithm>\n#include <numeric>\n#include <list>\nusing namespace std;\n\nusing QWORD = uint64_t;\nusing SQWORD = int64_t;\nusing DWORD = uint32_t;\nusing SDWORD = int32_t;\nusing WORD = uint16_t;\nusing SWORD = int16_t;\nusing BYTE = uint8_t;\nusing SBYTE = int8_t;\nusing DOUBLE = double;\nusing FLOAT = float;\n\n#define MIN_SDWORD (-2147483648)\n#define MAX_SDWORD (2147483647)\n#define MIN_SBYTE (-128)\n#define MAX_SBYTE (127)\n\n#define MIN_SQWORD (0x8000000000000000)\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\n\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\n#define MAX_DWORD (0xFFFFFFFF)\n#define MAX_WORD (0xFFFF)\n#define MAX_BYTE (0xFF)\n\n#define MAX_DOUBLE (1.0e+308)\n#define DOUBLE_EPS (1.0e-12)\n#define MIN_DOUBLE_N (-1.0e+308)\n\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\n\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\nstatic inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; };\n\n#define BYTE_BITS (8)\n#define WORD_BITS (16)\n#define DWORD_BITS (32)\n#define QWORD_BITS (64)\n\n#define ANS_MOD (1000000007)\n\nstatic const DOUBLE d_PI = 3.14159265358979323846;\n\n\nstatic inline void inputStringSpSeparated(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c) || (' ' == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\nstatic inline void inputString(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\n\nstatic inline SQWORD inputSQWORD(void)\n{\n SQWORD sqNumber = 0;\n SQWORD sqMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n sqMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n sqNumber *= 10LL;\n sqNumber += (SQWORD)(c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return sqNumber * sqMultiplier;\n }\n }\n }\n}\n\n\nstatic inline SDWORD inputSDWORD(void)\n{\n SDWORD lNumber = 0;\n SDWORD lMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n lMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n lNumber *= 10;\n lNumber += (c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return lNumber * lMultiplier;\n }\n }\n }\n}\n\nstatic inline DOUBLE inputFP(void)\n{\n DOUBLE dInt = 0.0;\n DOUBLE dFrac = 0.0;\n DOUBLE dMultiplier = 1.0;\n DWORD dwFpCnt = 0;\n DOUBLE *pdCur = &dInt;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n dMultiplier = -1;\n }\n }\n if ('.' == c) {\n pdCur = &dFrac;\n } else if (('0' <= c) && (c <= '9')) {\n (*pdCur) *= 10;\n (*pdCur) += (DOUBLE)(c - '0');\n bRead = true;\n if (pdCur == &dFrac) {\n dwFpCnt++;\n }\n } else {\n if (bRead) {\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\n }\n }\n }\n}\n\n/*----------------------------------------------*/\n/**\n * mod による操作ライブラリ\n */\n#define ANS_MOD (1000000007)\n\nclass MODINT {\n static SQWORD MOD;\n SQWORD m_x;\n\npublic:\n MODINT(SQWORD val) {\n m_x = (val % MOD + MOD) % MOD;\n };\n MODINT() {\n m_x = 0;\n }\n static void Init(SQWORD sqMod) {\n MOD = sqMod;\n }\n\n\tMODINT& operator+= (const MODINT a)\n {\n m_x = (m_x + a.m_x) % MOD; \n return *this;\n };\n\tMODINT& operator-= (const MODINT a)\n { \n m_x = (m_x - a.m_x + MOD) % MOD; \n return *this;\n };\n\tMODINT& operator*= (const MODINT a)\n {\n m_x = (m_x * a.m_x) % MOD;\n return *this;\n };\n MODINT pow(SQWORD t) const {\n if (!t) return 1;\n MODINT a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\tMODINT operator+ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res += a);\n\t}\n\tMODINT operator- (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res -= a);\n\t}\n\tMODINT operator* (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res *= a);\n\t}\n\tMODINT operator/ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res /= a);\n\t}\n\n /* 逆元 */\n MODINT inv() const {\n return pow(MOD-2);\n }\n\n /* 除算 */\n MODINT& operator/=(const MODINT a) {\n return (*this) *= a.inv();\n } \n\n /* 整数版 */\n\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\n\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\n\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\n\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\n\n SQWORD getVal() { return m_x; };\n};\nSQWORD MODINT::MOD = ANS_MOD;\n\n\n/*----------------------------------------------*/\n\n#define EPS 1e-10\nDOUBLE double_add(DOUBLE a, DOUBLE b) {\n if (ABS(a + b) < EPS * (ABS(a) + ABS(b))) {\n return 0;\n }\n return a+b;\n}\n\nstruct VECTOR_2D {\n DOUBLE dX;\n DOUBLE dY;\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\n VECTOR_2D() : dX(0), dY(0) {};\n\n /* 加算 */\n\tVECTOR_2D& operator+= (const VECTOR_2D a)\n { \n dX = dX + a.dX;\n dY = dY + a.dY;\n return *this;\n };\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \n };\n\n /* 減算 */\n\tVECTOR_2D& operator-= (const VECTOR_2D a)\n { \n dX = dX - a.dX;\n dY = dY - a.dY;\n return *this;\n };\n const VECTOR_2D operator- (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\n };\n\n /* 定数倍 */\n\tVECTOR_2D& operator*= (const DOUBLE a)\n { \n dX = dX * a;\n dY = dY * a;\n return *this;\n };\n const VECTOR_2D operator* (const DOUBLE a) const {\n\t\treturn VECTOR_2D(dX * a, dY * a); \n };\n\n /* 比較 */\n bool operator< (const VECTOR_2D &a) {\n if (dX == a.dX) {\n return (dY < a.dY);\n }\n return dX < a.dX;\n }\n\n DOUBLE norm(void) const {\n return (dX * dX + dY * dY);\n }\n\n DOUBLE dist(void) const {\n return sqrtl(norm());\n }\n\n DOUBLE angle(void) const {\n return atan2(dY, dX);\n }\n\n DOUBLE dotproduct(const VECTOR_2D a) const {\n return double_add(dX * a.dX, dY * a.dY);\n }\n\n DOUBLE crossproduct(const VECTOR_2D a) const {\n return double_add(dX * a.dY, -dY * a.dX);\n }\n};\n\n\n\n/*----------------------------------------------*/\n\nstruct BALL_ST {\n DOUBLE dBegin;\n DOUBLE dEnd;\n\n BALL_ST (DOUBLE b, DOUBLE e) : dBegin(b), dEnd(e) {};\n}; \n\nbool cmpBegin (const BALL_ST &a, const BALL_ST &b) {\n return a.dBegin < b.dBegin;\n}\n\nbool cmpEnd (const BALL_ST &a, const BALL_ST &b) {\n return a.dEnd < b.dEnd;\n}\n\n/**\n * 角度の扱い \n */\nstatic inline DOUBLE normalizeAngle(DOUBLE dAngle)\n{\n DOUBLE dRet = dAngle;\n while (dRet < 0.0) {\n dRet += (2.0 * d_PI);\n }\n\n while ((2.0 * d_PI) < dAngle) {\n dRet -= (2.0 * d_PI);\n }\n\n return dRet;\n}\n\n#define MAX_N (1500)\nint main(void)\n{\n SQWORD sqN = inputSQWORD();\n SQWORD sqK = inputSQWORD();\n\n vector<BALL_ST> vecBalls;\n vecBalls.emplace_back(0, 0); /* dp用にインデックスを1はじまりにするためのダミー */\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\n SQWORD sqX = inputSQWORD();\n SQWORD sqY = inputSQWORD();\n SQWORD sqR = inputSQWORD();\n\n VECTOR_2D stVec((DOUBLE)sqX, (DOUBLE)sqY);\n DOUBLE dAngle = normalizeAngle(stVec.angle());\n DOUBLE dDist = stVec.dist();\n DOUBLE dRange = asin((DOUBLE)sqR / dDist);\n \n DOUBLE dBegin, dEnd;\n if (2 * d_PI < (dAngle + dRange)) {\n dBegin = 0.0;\n dEnd = dAngle + dRange - (2 * d_PI);\n } else {\n dBegin = MIN(MAX(dAngle - dRange, 0.0), d_PI);\n dEnd = MIN(MAX(dAngle + dRange, 0.0), d_PI); \n }\n\n\n\n// printf(\"%0.10f %0.10f\\n\", dBegin, dEnd);\n\n vecBalls.emplace_back(dBegin, dEnd);\n }\n sort(vecBalls.begin(), vecBalls.end(), cmpBegin);\n\n /**\n * dp[j][k] 左端がk番目のボールで、\n * j個を使っているときの最大の角度\n * dp[j][k] = max(dp[j-1][0] + angle, dp[j-1][1] + angle, dp[j-1][2] + angle ,,,, dp[j-1][k-1] + angle)\n * \n */\n static DOUBLE s_aadDpTbl[MAX_N + 1][MAX_N + 1];\n for (SQWORD sqIdxJ = 0; sqIdxJ <= sqN; sqIdxJ++) {\n for (SQWORD sqIdxK = 0; sqIdxK <= sqN; sqIdxK++) {\n s_aadDpTbl[sqIdxJ][sqIdxK] = 0;\n }\n }\n for (SQWORD sqIdxJ = 0; sqIdxJ < sqN; sqIdxJ++) {\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK < sqN; sqIdxK++) {\n DOUBLE dPrevEnd = vecBalls[sqIdxK].dEnd;\n for (SQWORD sqNextBallIdx = sqIdxK + 1; sqNextBallIdx <= sqN; sqNextBallIdx++) {\n BALL_ST stBall = vecBalls[sqNextBallIdx];\n DOUBLE dAddAngle = 0;\n if (dPrevEnd < stBall.dBegin) {\n dAddAngle = stBall.dEnd - stBall.dBegin;\n// printf(\"> [%lld %lld %lld] %llf \", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\n } else {\n if (dPrevEnd < stBall.dEnd) {\n dAddAngle = stBall.dEnd - dPrevEnd;\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\n }\n// printf(\"< [%lld %lld %lld] %llf \", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\n }\n\n }\n }\n// printf(\"\\n\");\n }\n\n DOUBLE dAns = 0.0;\n for (SQWORD sqIdxJ = 1; sqIdxJ <= sqK; sqIdxJ++) {\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK <= sqN; sqIdxK++) {\n// printf(\"%llf \", s_aadDpTbl[sqIdxJ][sqIdxK] / d_PI);\n dAns = max(dAns, s_aadDpTbl[sqIdxJ][sqIdxK]);\n }\n// printf(\"\\n\");\n }\n\n printf(\"%0.11f\\n\", dAns / d_PI);\n\n return 0;\n}","accuracy":0.1267605633802817,"time_ms":490,"memory_kb":21112,"score_of_the_acc":-0.6904,"final_rank":19},{"submission_id":"aoj_2276_3916179","code_snippet":"#pragma GCC optimize (\"O3\")\n\n#include <iostream>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <math.h>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <queue>\n#include <set>\n#include <algorithm>\n#include <numeric>\n#include <list>\nusing namespace std;\n\nusing QWORD = uint64_t;\nusing SQWORD = int64_t;\nusing DWORD = uint32_t;\nusing SDWORD = int32_t;\nusing WORD = uint16_t;\nusing SWORD = int16_t;\nusing BYTE = uint8_t;\nusing SBYTE = int8_t;\nusing DOUBLE = double;\nusing FLOAT = float;\n\n#define MIN_SDWORD (-2147483648)\n#define MAX_SDWORD (2147483647)\n#define MIN_SBYTE (-128)\n#define MAX_SBYTE (127)\n\n#define MIN_SQWORD (0x8000000000000000)\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\n\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\n#define MAX_DWORD (0xFFFFFFFF)\n#define MAX_WORD (0xFFFF)\n#define MAX_BYTE (0xFF)\n\n#define MAX_DOUBLE (1.0e+308)\n#define DOUBLE_EPS (1.0e-12)\n#define MIN_DOUBLE_N (-1.0e+308)\n\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\n\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\nstatic inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; };\n\n#define BYTE_BITS (8)\n#define WORD_BITS (16)\n#define DWORD_BITS (32)\n#define QWORD_BITS (64)\n\n#define ANS_MOD (1000000007)\n\nstatic const DOUBLE d_PI = 3.14159265358979323846;\n\n\nstatic inline void inputStringSpSeparated(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c) || (' ' == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\nstatic inline void inputString(char *pcStr)\n{\n char *pcCur = pcStr;\n for (;;) {\n char c = getchar();\n if (('\\n' == c) || (EOF == c)) {\n break;\n }\n *pcCur = c;\n pcCur++;\n }\n *pcCur = '\\0';\n}\n\n\nstatic inline SQWORD inputSQWORD(void)\n{\n SQWORD sqNumber = 0;\n SQWORD sqMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n sqMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n sqNumber *= 10LL;\n sqNumber += (SQWORD)(c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return sqNumber * sqMultiplier;\n }\n }\n }\n}\n\n\nstatic inline SDWORD inputSDWORD(void)\n{\n SDWORD lNumber = 0;\n SDWORD lMultiplier = 1;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n lMultiplier = -1;\n }\n }\n if (('0' <= c) && (c <= '9')) {\n lNumber *= 10;\n lNumber += (c - '0');\n bRead = true;\n } else {\n if (bRead) {\n return lNumber * lMultiplier;\n }\n }\n }\n}\n\nstatic inline DOUBLE inputFP(void)\n{\n DOUBLE dInt = 0.0;\n DOUBLE dFrac = 0.0;\n DOUBLE dMultiplier = 1.0;\n DWORD dwFpCnt = 0;\n DOUBLE *pdCur = &dInt;\n bool bRead = false;\n for (;;) {\n char c = getchar();\n if (!bRead) {\n if ('-' == c) {\n dMultiplier = -1;\n }\n }\n if ('.' == c) {\n pdCur = &dFrac;\n } else if (('0' <= c) && (c <= '9')) {\n (*pdCur) *= 10;\n (*pdCur) += (DOUBLE)(c - '0');\n bRead = true;\n if (pdCur == &dFrac) {\n dwFpCnt++;\n }\n } else {\n if (bRead) {\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\n }\n }\n }\n}\n\n/*----------------------------------------------*/\n/**\n * mod による操作ライブラリ\n */\n#define ANS_MOD (1000000007)\n\nclass MODINT {\n static SQWORD MOD;\n SQWORD m_x;\n\npublic:\n MODINT(SQWORD val) {\n m_x = (val % MOD + MOD) % MOD;\n };\n MODINT() {\n m_x = 0;\n }\n static void Init(SQWORD sqMod) {\n MOD = sqMod;\n }\n\n\tMODINT& operator+= (const MODINT a)\n {\n m_x = (m_x + a.m_x) % MOD; \n return *this;\n };\n\tMODINT& operator-= (const MODINT a)\n { \n m_x = (m_x - a.m_x + MOD) % MOD; \n return *this;\n };\n\tMODINT& operator*= (const MODINT a)\n {\n m_x = (m_x * a.m_x) % MOD;\n return *this;\n };\n MODINT pow(SQWORD t) const {\n if (!t) return 1;\n MODINT a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\tMODINT operator+ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res += a);\n\t}\n\tMODINT operator- (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res -= a);\n\t}\n\tMODINT operator* (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res *= a);\n\t}\n\tMODINT operator/ (const MODINT a) const {\n\t\tMODINT res(*this);\n\t\treturn (res /= a);\n\t}\n\n /* 逆元 */\n MODINT inv() const {\n return pow(MOD-2);\n }\n\n /* 除算 */\n MODINT& operator/=(const MODINT a) {\n return (*this) *= a.inv();\n } \n\n /* 整数版 */\n\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\n\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\n\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\n\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\n\n SQWORD getVal() { return m_x; };\n};\nSQWORD MODINT::MOD = ANS_MOD;\n\n\n/*----------------------------------------------*/\n\n#define EPS 1e-10\nDOUBLE double_add(DOUBLE a, DOUBLE b) {\n if (ABS(a + b) < EPS * (ABS(a) + ABS(b))) {\n return 0;\n }\n return a+b;\n}\n\nstruct VECTOR_2D {\n DOUBLE dX;\n DOUBLE dY;\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\n VECTOR_2D() : dX(0), dY(0) {};\n\n /* 加算 */\n\tVECTOR_2D& operator+= (const VECTOR_2D a)\n { \n dX = dX + a.dX;\n dY = dY + a.dY;\n return *this;\n };\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \n };\n\n /* 減算 */\n\tVECTOR_2D& operator-= (const VECTOR_2D a)\n { \n dX = dX - a.dX;\n dY = dY - a.dY;\n return *this;\n };\n const VECTOR_2D operator- (const VECTOR_2D a) const {\n\t\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\n };\n\n /* 定数倍 */\n\tVECTOR_2D& operator*= (const DOUBLE a)\n { \n dX = dX * a;\n dY = dY * a;\n return *this;\n };\n const VECTOR_2D operator* (const DOUBLE a) const {\n\t\treturn VECTOR_2D(dX * a, dY * a); \n };\n\n /* 比較 */\n bool operator< (const VECTOR_2D &a) {\n if (dX == a.dX) {\n return (dY < a.dY);\n }\n return dX < a.dX;\n }\n\n DOUBLE norm(void) const {\n return (dX * dX + dY * dY);\n }\n\n DOUBLE dist(void) const {\n return sqrtl(norm());\n }\n\n DOUBLE angle(void) const {\n return atan2(dY, dX);\n }\n\n DOUBLE dotproduct(const VECTOR_2D a) const {\n return double_add(dX * a.dX, dY * a.dY);\n }\n\n DOUBLE crossproduct(const VECTOR_2D a) const {\n return double_add(dX * a.dY, -dY * a.dX);\n }\n};\n\n\n\n/*----------------------------------------------*/\n\nstruct BALL_ST {\n DOUBLE dBegin;\n DOUBLE dEnd;\n\n BALL_ST (DOUBLE b, DOUBLE e) : dBegin(b), dEnd(e) {};\n}; \n\nbool cmpBegin (const BALL_ST &a, const BALL_ST &b) {\n return a.dBegin < b.dBegin;\n}\n\nbool cmpEnd (const BALL_ST &a, const BALL_ST &b) {\n return a.dEnd < b.dEnd;\n}\n\n/**\n * 角度の扱い \n */\nstatic inline DOUBLE normalizeAngle(DOUBLE dAngle)\n{\n DOUBLE dRet = dAngle;\n while (dRet < 0.0) {\n dRet += (2.0 * d_PI);\n }\n\n while ((2.0 * d_PI) < dAngle) {\n dRet -= (2.0 * d_PI);\n }\n\n return dRet;\n}\n\n#define MAX_N (1500)\nint main(void)\n{\n SQWORD sqN = inputSQWORD();\n SQWORD sqK = inputSQWORD();\n\n vector<BALL_ST> vecBalls;\n vecBalls.emplace_back(0, 0); /* dp用にインデックスを1はじまりにするためのダミー */\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\n SQWORD sqX = inputSQWORD();\n SQWORD sqY = inputSQWORD();\n SQWORD sqR = inputSQWORD();\n\n VECTOR_2D stVec((DOUBLE)sqX, (DOUBLE)sqY);\n DOUBLE dAngle = normalizeAngle(stVec.angle());\n DOUBLE dDist = stVec.dist();\n DOUBLE dRange = asin((DOUBLE)sqR / dDist);\n \n DOUBLE dBegin, dEnd;\n if (2 * d_PI < (dAngle + dRange)) {\n dBegin = 0.0;\n dEnd = dAngle + dRange - (2 * d_PI);\n } else {\n dBegin = MIN(MAX(dAngle - dRange, 0.0), d_PI);\n dEnd = MIN(dAngle + dRange, d_PI); \n }\n\n\n\n// printf(\"%0.10f %0.10f\\n\", dBegin, dEnd);\n\n vecBalls.emplace_back(dBegin, dEnd);\n }\n sort(vecBalls.begin(), vecBalls.end(), cmpBegin);\n\n /**\n * dp[j][k] 左端がk番目のボールで、\n * j個を使っているときの最大の角度\n * dp[j][k] = max(dp[j-1][0] + angle, dp[j-1][1] + angle, dp[j-1][2] + angle ,,,, dp[j-1][k-1] + angle)\n * \n */\n static DOUBLE s_aadDpTbl[MAX_N + 1][MAX_N + 1];\n for (SQWORD sqIdxJ = 0; sqIdxJ <= sqN; sqIdxJ++) {\n for (SQWORD sqIdxK = 0; sqIdxK <= sqN; sqIdxK++) {\n s_aadDpTbl[sqIdxJ][sqIdxK] = 0;\n }\n }\n for (SQWORD sqIdxJ = 0; sqIdxJ < sqN; sqIdxJ++) {\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK < sqN; sqIdxK++) {\n DOUBLE dPrevEnd = vecBalls[sqIdxK].dEnd;\n for (SQWORD sqNextBallIdx = sqIdxK; sqNextBallIdx <= sqN; sqNextBallIdx++) {\n BALL_ST stBall = vecBalls[sqNextBallIdx];\n DOUBLE dAddAngle;\n if (dPrevEnd < stBall.dBegin) {\n dAddAngle = stBall.dEnd - stBall.dBegin;\n// printf(\"> [%lld %lld %lld] %llf \", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\n } else {\n if (dPrevEnd < stBall.dEnd) {\n dAddAngle = max(0.0, stBall.dEnd - dPrevEnd);\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\n }\n// printf(\"< [%lld %lld %lld] %llf \", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\n }\n\n }\n }\n// printf(\"\\n\");\n }\n\n DOUBLE dAns = 0.0;\n for (SQWORD sqIdxJ = 1; sqIdxJ <= sqK; sqIdxJ++) {\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK <= sqN; sqIdxK++) {\n// printf(\"%llf \", s_aadDpTbl[sqIdxJ][sqIdxK] / d_PI);\n dAns = max(dAns, s_aadDpTbl[sqIdxJ][sqIdxK]);\n }\n// printf(\"\\n\");\n }\n\n printf(\"%0.11f\\n\", dAns / d_PI);\n\n return 0;\n}","accuracy":0.1267605633802817,"time_ms":540,"memory_kb":21088,"score_of_the_acc":-0.7616,"final_rank":20},{"submission_id":"aoj_2276_3913623","code_snippet":"#include <bits/stdc++.h>\n#ifdef LOCAL\n#include \"../cxx-prettyprint/prettyprint.hpp\"\n#endif\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\n\n#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))\n#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))\n#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))\n#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))\n#define ALL(x) x.begin(), x.end()\n\n#define INF ((1 << 29)-1)\n#define MOD (1000000007)\n\n#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << \" \"; cout << endl; }\ntemplate<class T> void print(const T& x){cout << x << endl;}\ntemplate<class T, class... A> void print(const T& first, const A&... rest) { cout << first << \" \"; print(rest...); }\nstruct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;\n\n// ベクトル\nnamespace Geom {\n\n const double eps = 1e-9;\n\n struct Point {\n double x, y;\n explicit Point(double x=0, double y=0): x(x), y(y) {}\n Point& operator+=(const Point& v){ x += v.x; y+= v.y; return *this;}\n Point operator+(const Point& v) const{return Point(*this) += v;}\n Point& operator-=(const Point& v){x -= v.x; y-= v.y; return *this;}\n Point operator-(const Point& v) const{return Point(*this) -= v;}\n Point& operator*=(double s){x *= s; y *= s; return *this;}\n Point operator*(double s) const{return Point(*this) *= s;}\n Point& operator/=(double s){x /= s; y /= s; return *this;}\n Point operator/(double s) const{return Point(*this) /= s;}\n double dot(const Point& v) const {return x*v.x + y*v.y;} /* 内積 */\n double cross(const Point& v) const {return x*v.y - v.x*y;} /* 外積 */\n double norm2() const {return x*x + y*y;} /* ノルムの二乗*/\n double norm() const {return sqrt(norm2());} /* ノルム */\n int quadrant() const { if(y > 0) return x>0 ? 1:2; else return x>0 ? 4:3;} /* 象限判定 */\n Point rot(double theta) {return Point(cos(theta) * x - sin(theta) * y, sin(theta) * x + cos(theta) * y);} // 回転\n Point rot90() {return Point(-y, x);} // 90度回転\n };\n\n ostream& operator<<(ostream& os, const Point& v) {os<<\"(\"<<v.x<<\",\"<<v.y<<\")\"; return os;}\n istream& operator>>(istream& is, Point& v){ is >> v.x >> v.y; return is;}\n\n // 点a, b, cからなる三角形の面積\n double calc_triangle_area(Point a, Point b, Point c) {\n Point v1 = b - a;\n Point v2 = c - a;\n return abs(v1.cross(v2)) / 2;\n }\n\n // 点a, bを通る直線と点cとの距離\n double calc_distance_between_point_and_line(Point a, Point b, Point c) {\n return abs((b-a).cross(c-a)) / (b-a).norm();\n }\n\n // 点a, bを端点とする線分と点cとの距離\n double calc_distance_between_point_and_segment(Point a, Point b, Point c) {\n if ((b-a).dot(c-a) < eps) return (c-a).norm();\n if ((a-b).dot(c-b) < eps) return (c-b).norm();\n return calc_distance_between_point_and_line(a, b, c);\n }\n\n // 点a, bを端点とする線分と点cと点dを端点とする線分の距離\n double calc_distance_between_segments(Point a, Point b, Point c, Point d) {\n double d0 = calc_distance_between_point_and_segment(a, b, c);\n double d1 = calc_distance_between_point_and_segment(a, b, d);\n double d2 = calc_distance_between_point_and_segment(c, d, a);\n double d3 = calc_distance_between_point_and_segment(c, d, b);\n return min(min(d0, d1), min(d2, d3));\n }\n\n enum RELATION_BETWEEN_SEGMENT_AND_POINT {\n COUNTER_CLOCKWISE = 1, // p1とp2のp0を挟んだ位置関係が反時計回り\n CLOCKWISE = -1, // 時計回り\n ONLINE_BACK = 2, // p1とp2がp0を挟んで直線状にある\n ONLINE_FRONT = -2, // p0とp2の間にp1がある\n ON_SEGMENT = 0, // p0とp1の間にp2がある\n };\n\n // 点cが点a, bを端点とする線分のどちら側にあるか、enumで返す\n RELATION_BETWEEN_SEGMENT_AND_POINT ccw_ex(Point p0, Point p1, Point p2) {\n Point v1 = p1 - p0;\n Point v2 = p2 - p0;\n if(v1.cross(v2) > eps) return COUNTER_CLOCKWISE; // 1\n if(v1.cross(v2) < -eps) return CLOCKWISE; // -1\n if(v1.dot(v2) < -eps) return ONLINE_BACK; // 2\n if(v1.norm() < v2.norm()) return ONLINE_FRONT; // -2\n return ON_SEGMENT; // 0\n }\n\n // 点cが点a, bを端点とする線分のどちら側にあるか\n int ccw(Point p0, Point p1, Point p2) {\n Point v1 = p1 - p0;\n Point v2 = p2 - p0;\n if(v1.cross(v2) > eps) return 1;\n if(v1.cross(v2) < -eps) return -1;\n return 0;\n }\n\n // p1,p2を端点とする線分Aとp3,p4を端点とする線分Bの交差判定\n // include_end=trueなら端点が重なっていても交差しているとみなす\n bool intersect(Point p1, Point p2, Point p3, Point p4, bool include_end=true) {\n\n bool is_otherside;\n bool is_inside;\n\n if (include_end){\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) <= 0; // Aの両側にBの端点があるかどうか。どちらかがAの直線状にいてもOK\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) <= 0; // Aの端点の内側にBがいるかどうか。\n } else {\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) < 0; // Aの両側にBの端点があるかどうか\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) < 0; // Aの端点の内側にBがいるかどうか\n }\n return is_otherside && is_inside;\n }\n\n\n // 円\n struct Circle {\n Point c;\n double r;\n Circle(){}\n Circle(Point c, double r):c(c),r(r){}\n\n // 円が点pを含むかどうか include_circumは円周上を含むとするかどうか\n bool does_include_point(Point p, bool include_circum = true){\n double d = (p - c).norm();\n if (include_circum){\n return d < r + eps;\n } else {\n return d < r - eps;\n }\n }\n };\n\n // 点p1, p2を通る半径rの円を返す\n vector<Circle> calc_circle_on_two_points(Point p1, Point p2, double r){\n\n Point p12_half = (p2 - p1) / 2.0;\n\n double n_vec_norm2 = r*r - p12_half.norm2();\n if (n_vec_norm2 < 0) return vector<Circle>();\n\n double n_vec_norm = sqrt(n_vec_norm2);\n Point n_vec = p12_half.rot90() * n_vec_norm / p12_half.norm();\n\n vector<Circle> ret;\n ret.emplace_back(p1 + p12_half + n_vec, 1.0);\n ret.emplace_back(p1 + p12_half - n_vec, 1.0);\n return ret;\n }\n}\n\ndouble getRadian(double x, double y) {\n double radian = atan2(y, x);\n return radian;\n}\n\ndouble getDegree(double radian) {\n if(radian < 0) {\n radian = radian + 2 * M_PI;\n }\n return (radian*360) / (2*M_PI);\n}\n\nint main() {\n#ifdef LOCAL\n ifstream in(\"../in.txt\"); cin.rdbuf(in.rdbuf());\n#endif\n\n using namespace Geom;\n\n int n, k;\n cin >> n >> k;\n\n vector<Point> point(n);\n vector<double> radius(n);\n vector<pair<double, double> > angle(n);\n REP(i, n) cin >> point[i] >> radius[i];\n\n REP(i, n) {\n double d = sqrt(point[i].x*point[i].x + point[i].y*point[i].y);\n double center_angle;\n if(point[i].x == 0) {\n if(point[i].y == 0) {\n cout << \"1\" << endl;\n return 0;\n } else if(point[i].y > 0) {\n center_angle = 90;\n } else {\n center_angle = 270;\n }\n } else {\n center_angle = getDegree(getRadian(point[i].x, point[i].y));\n }\n\n double center_tangent_angle = getDegree(getRadian(sqrt(d*d - radius[i]*radius[i]), radius[i]));\n angle[i].first = center_angle - center_tangent_angle;\n angle[i].second = center_angle + center_tangent_angle;\n if(0 <= center_angle && center_angle <= 90) {\n if(angle[i].first < 0){\n angle[i].first = 0;\n }\n }\n else if(center_angle <= 180) {\n if(angle[i].second > 180){\n angle[i].second = 180;\n }\n }\n else if(center_angle <= 270.0) {\n if(angle[i].first < 180){\n angle[i].second = 180;\n }\n else{\n angle[i].first = 0, angle[i].second = 0;\n }\n }\n else{\n if(angle[i].second > 360){\n angle[i].first = 0, angle[i].second -=360;\n }\n else{\n angle[i].first = 0, angle[i].second = 0;\n }\n }\n //printf(\"center = %f\\n\", center_angle);\n //printf(\"first = %f, second = %f\\n\", angle[i].first, angle[i].second);\n }\n\n REP(i, angle.size()){\n if(angle[i].first == 0 && angle[i].second == 0){\n angle.erase(angle.begin() + i); \n }\n }\n\n /* 包含してるものを削除 */\n REP(i, angle.size()) REP(j, angle.size()){\n if(i == j) continue;\n if(angle[j].first <= angle[i].first && angle[i].second <= angle[j].second) {\n angle.erase(angle.begin() + i);\n i--;\n break;\n }\n }\n\n REP(i, angle.size()){\n //printf(\"first = %f, second = %f\\n\", angle[i].first, angle[i].second);\n }\n\n angle.insert(angle.begin(), {0, 0});\n sort(angle.begin(), angle.end());\n\n vector<vector<double> > dp;\n dp.assign(n+1, vector<double>(k+1, 0));\n\n int N = angle.size()-1;\n REPN(i, 1, N + 1){\n //\n int l = i;\n while (l > 0){\n l--;\n if (angle[l].second < angle[i].first){\n break;\n }\n }\n REPN(j, 1, k+1){\n dp[i][j] = dp[i-1][j];\n dp[i][j] = max(dp[i][j], dp[l][j-1] + angle[i].second - angle[i].first);\n dp[i][j] = max(dp[i][j], dp[l+1][j-1] + angle[i].second - angle[l+1].second);\n }\n }\n\n print(dp[N][k] / 180);\n\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":20884,"score_of_the_acc":-0.0026,"final_rank":1},{"submission_id":"aoj_2276_3912434","code_snippet":"#define _USE_MATH_DEFINES\n#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <cmath>\n#include <numeric>\n#include <tuple>\n#include <iomanip>\n#include <assert.h>\n\n#define sqr(x) std::pow(x, 2.0)\n#define INF 1e10\n#define EPS 1e-10\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define POS_OR_INF(x) (x > 0 ? x : INF)\n\nusing namespace std;\n\nusing ld = long double;\n\nstruct Point {\n\tPoint() = default;\n\tPoint(ld x, ld y) : x(x), y(y) {}\n\tPoint(const Point& s, const Point& e) : x(e.x - s.x), y(e.y - s.y) {}\n\n\tPoint normalized(void) const {\n\t\treturn Point(x / norm(), y / norm());\n\t}\n\n\tld norm(void) const {\n\t\treturn sqrt(x * x + y * y);\n\t}\n\n\tPoint flipped(void) const {\n\t\treturn Point(-x, -y);\n\t}\n\n\tPoint normal_vector(bool normalize = false) const {\n\t\tauto vec = Point(-y, x);\n\t\treturn normalize ? vec.normalized() : vec;\n\t}\n\n\tld x, y;\n};\n\nusing Vector = Point;\n\ninline Vector points2vec(const Point& s, const Point& e) {\n\treturn Vector(e.x - s.x, e.y - s.y);\n}\n\ninline ld distance(const Point& s, const Point& e) {\n\treturn points2vec(s, e).norm();\n}\n\ninline ld distance_square(const Point& s, const Point& e) {\n\treturn pow(points2vec(s, e).norm(), 2.0);\n}\n\ninline Vector operator * (const Vector& l, ld r) {\n\treturn Vector(l.x * r, l.y * r);\n}\n\ninline Vector operator * (ld l, const Vector& r) {\n\treturn r * l;\n}\n\ninline Vector operator / (const Vector& l, ld r) {\n\treturn Vector(l.x / r, l.y / r);\n}\n\ninline Point operator + (const Point& l, const Point& r) {\n\treturn Point(l.x + r.x, l.y + r.y);\n}\n\ninline Point operator - (const Point& l, const Point& r) {\n\treturn Point(l.x - r.x, l.y - r.y);\n}\n\ninline istream& operator >> (istream& is, Point& p) {\n\treturn is >> p.x >> p.y;\n}\n\nint main(int argc, char** argv) {\n\tint N, K;\n\n\tcin >> N >> K;\n\tcout << fixed << setprecision(20);\n\n\tvector<pair<double, double>> a(N), b;\n\n\tfor (int i = 0; i < N; i++) {\n\t\tPoint p;\n\t\tdouble r;\n\t\tcin >> p >> r;\n\n\t\tdouble theta = asin(r/p.norm());\n\t\tdouble rad = atan2(p.y, p.x);\n\n\t\tif (rad < -M_PI / 2) rad += 2 * M_PI;\n\n\t\ta[i].first = min(M_PI, max(0.0, rad - theta));\n\t\ta[i].second = min(M_PI, max(0.0, rad + theta));\n\t}\n\n\tfor (int i = 0; i < N; i++) {\n\t\tbool included = false;\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tif (a[i].first > a[j].first && a[i].second < a[j].second)\n\t\t\t\tincluded = true;\n\t\t}\n\t\tif (!included) {\n\t\t\tb.push_back(a[i]);\n\t\t}\n\t}\n\n\tsort(b.begin(), b.end());\n\n\tint M = b.size();\n\n\tvector<vector<double>> dp(K + 1, vector<double>(M + 1, 0));\n\tdouble ans = 0;\n\n\tfor (int i = 1; i <= K; i++) {\n\t\tfor (int j = 0; j < M; j++) {\n\t\t\tdouble best = 0;\n\t\t\tint k = 0;\n\n\t\t\twhile (b[k].second < b[j].first) {\n\t\t\t\tbest = max(best, dp[i-1][k]);\n\t\t\t\tk++;\n\t\t\t}\n\t\t\t\n\t\t\tdp[i][j] = max(dp[i][j], best + b[j].second - b[j].first);\n\n\t\t\t//for (; k < j; k++) {\n\t\t\tdp[i][j] = max(dp[i][j], dp[i-1][k] + b[j].second - b[k].second);\n\t\t\t//}\n\t\t\tans = max(ans, dp[i][j]);\n\t\t}\n\t}\n\n\tcout << ans / M_PI;\n}","accuracy":1,"time_ms":340,"memory_kb":20696,"score_of_the_acc":-0.4722,"final_rank":13},{"submission_id":"aoj_2276_3894169","code_snippet":"// aribon3-6_f\n#include <bits/stdc++.h>\n#ifdef LOCAL\n#include \"../cxx-prettyprint/prettyprint.hpp\"\n#endif\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\n\n#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))\n#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))\n#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))\n#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))\n#define ALL(x) x.begin(), x.end()\n\n#define INF ((1 << 29)-1)\n#define MOD (1000000007)\n\n#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << \" \"; cout << endl; }\ntemplate<class T> void print(const T& x){cout << x << endl;}\ntemplate<class T, class... A> void print(const T& first, const A&... rest) { cout << first << \" \"; print(rest...); }\nstruct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;\n\n// ベクトル\nnamespace Geom {\n #define _USE_MATH_DEFINES\n\n const double eps = 1e-9;\n\n struct Point {\n double x, y;\n explicit Point(double x=0, double y=0): x(x), y(y) {}\n Point& operator+=(const Point& v){ x += v.x; y+= v.y; return *this;}\n Point operator+(const Point& v) const{return Point(*this) += v;}\n Point& operator-=(const Point& v){x -= v.x; y-= v.y; return *this;}\n Point operator-(const Point& v) const{return Point(*this) -= v;}\n Point& operator*=(double s){x *= s; y *= s; return *this;}\n Point operator*(double s) const{return Point(*this) *= s;}\n Point& operator/=(double s){x /= s; y /= s; return *this;}\n Point operator/(double s) const{return Point(*this) /= s;}\n double dot(const Point& v) const {return x*v.x + y*v.y;} /* 内積 */\n double cross(const Point& v) const {return x*v.y - v.x*y;} /* 外積 */\n double norm2() const {return x*x + y*y;} /* ノルムの二乗*/\n double norm() const {return sqrt(norm2());} /* ノルム */\n int quadrant() const { if(y > 0) return x>0 ? 1:2; else return x>0 ? 4:3;} /* 象限判定 */\n Point rot(double theta) {return Point(cos(theta) * x - sin(theta) * y, sin(theta) * x + cos(theta) * y);} // 回転\n Point rot90() {return Point(-y, x);} // 90度回転\n };\n ostream& operator<<(ostream& os, const Point& v) {os<<\"(\"<<v.x<<\",\"<<v.y<<\")\"; return os;}\n istream& operator>>(istream& is, Point& v){ is >> v.x >> v.y; return is;}\n\n // 点a, b, cからなる三角形の面積\n double calc_triangle_area(Point a, Point b, Point c) {\n Point v1 = b - a;\n Point v2 = c - a;\n return abs(v1.cross(v2)) / 2;\n }\n\n // 点a, bを通る直線と点cとの距離\n double calc_distance_between_point_and_line(Point a, Point b, Point c) {\n return abs((b-a).cross(c-a)) / (b-a).norm();\n }\n\n // 点a, bを端点とする線分と点cとの距離\n double calc_distance_between_point_and_segment(Point a, Point b, Point c) {\n if ((b-a).dot(c-a) < eps) return (c-a).norm();\n if ((a-b).dot(c-b) < eps) return (c-b).norm();\n return calc_distance_between_point_and_line(a, b, c);\n }\n\n // 点a, bを端点とする線分と点cと点dを端点とする線分の距離\n double calc_distance_between_segments(Point a, Point b, Point c, Point d) {\n double d0 = calc_distance_between_point_and_segment(a, b, c);\n double d1 = calc_distance_between_point_and_segment(a, b, d);\n double d2 = calc_distance_between_point_and_segment(c, d, a);\n double d3 = calc_distance_between_point_and_segment(c, d, b);\n return min(min(d0, d1), min(d2, d3));\n }\n\n enum RELATION_BETWEEN_SEGMENT_AND_POINT {\n COUNTER_CLOCKWISE = 1, // p1とp2のp0を挟んだ位置関係が反時計回り\n CLOCKWISE = -1, // 時計回り\n ONLINE_BACK = 2, // p1とp2がp0を挟んで直線状にある\n ONLINE_FRONT = -2, // p0とp2の間にp1がある\n ON_SEGMENT = 0, // p0とp1の間にp2がある\n };\n\n // 点cが点a, bを端点とする線分のどちら側にあるか、enumで返す\n RELATION_BETWEEN_SEGMENT_AND_POINT ccw_ex(Point p0, Point p1, Point p2) {\n Point v1 = p1 - p0;\n Point v2 = p2 - p0;\n if(v1.cross(v2) > eps) return COUNTER_CLOCKWISE; // 1\n if(v1.cross(v2) < -eps) return CLOCKWISE; // -1\n if(v1.dot(v2) < -eps) return ONLINE_BACK; // 2\n if(v1.norm() < v2.norm()) return ONLINE_FRONT; // -2\n return ON_SEGMENT; // 0\n }\n\n // 点cが点a, bを端点とする線分のどちら側にあるか\n int ccw(Point p0, Point p1, Point p2) {\n Point v1 = p1 - p0;\n Point v2 = p2 - p0;\n if(v1.cross(v2) > eps) return 1;\n if(v1.cross(v2) < -eps) return -1;\n return 0;\n }\n\n // p1,p2を端点とする線分Aとp3,p4を端点とする線分Bの交差判定\n // include_end=trueなら端点が重なっていても交差しているとみなす\n bool intersect(Point p1, Point p2, Point p3, Point p4, bool include_end=true) {\n\n bool is_otherside;\n bool is_inside;\n\n if (include_end){\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) <= 0; // Aの両側にBの端点があるかどうか。どちらかがAの直線状にいてもOK\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) <= 0; // Aの端点の内側にBがいるかどうか。\n } else {\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) < 0; // Aの両側にBの端点があるかどうか\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) < 0; // Aの端点の内側にBがいるかどうか\n }\n return is_otherside && is_inside;\n }\n\n\n // 円\n struct Circle {\n Point c;\n double r;\n Circle(){}\n Circle(Point c, double r):c(c),r(r){}\n\n // 円が点pを含むかどうか include_circumは円周上を含むとするかどうか\n bool does_include_point(Point p, bool include_circum = true){\n double d = (p - c).norm();\n if (include_circum){\n return d < r + eps;\n } else {\n return d < r - eps;\n }\n }\n };\n ostream& operator<<(ostream& os, const Circle& c) {os<<\"(\"<<c.c<<\",\"<<c.r<<\")\"; return os;}\n istream& operator>>(istream& is, Circle& c){ is >> c.c >> c.r; return is;}\n\n // 点p1, p2を通る半径rの円を返す\n vector<Circle> calc_circle_on_two_points(Point p1, Point p2, double r){\n\n Point p12_half = (p2 - p1) / 2.0;\n\n double n_vec_norm2 = r*r - p12_half.norm2();\n if (n_vec_norm2 < 0) return vector<Circle>();\n\n double n_vec_norm = sqrt(n_vec_norm2);\n Point n_vec = p12_half.rot90() * n_vec_norm / p12_half.norm();\n\n vector<Circle> ret;\n ret.emplace_back(p1 + p12_half + n_vec, 1.0);\n ret.emplace_back(p1 + p12_half - n_vec, 1.0);\n return ret;\n }\n\n // 点pを通る、円Cの２つの接線の傾きの角度を返す [0, 2π]で返す\n pair<double, double> calc_tangent_line_on_circle(Circle c, Point p){\n Point pc = c.c - p;\n double angle0 = atan2(pc.y, pc.x);\n double l2 = pc.norm2() - c.r*c.r;\n if (l2 < 0) {\n return {0, 2*M_PI};\n }\n double l = sqrt(l2);\n double angle1 = angle0 - atan2(c.r, l);\n double angle2 = angle0 + atan2(c.r, l);\n angle1 = angle1 >= 0 ? angle1 : angle1 + 2*M_PI;\n angle2 = angle2 >= 0 ? angle2 : angle2 + 2*M_PI;\n\n return {angle1, angle2};\n }\n\n}\n\n\nint main() {\n#ifdef LOCAL\n ifstream in(\"../arg.txt\"); cin.rdbuf(in.rdbuf());\n#endif\n\n using namespace Geom;\n\n int N, K;\n cin >> N >> K;\n vector<Circle> circles(N);\n REP(i, N) cin >> circles[i];\n\n vector<pair<double, double>> intervals(N);\n REP(i, N){\n auto thetas = calc_tangent_line_on_circle(circles[i], Point(0.0, 0.0));\n if (thetas.first == 0 && thetas.second == 2*M_PI) {\n print(1.0);\n return 0;\n }\n\n if (thetas.first >= M_PI && thetas.second >= M_PI){\n intervals[i] = {0, 0};\n } else if (thetas.first >= M_PI) {\n intervals[i] = {0, thetas.second};\n } else if (thetas.second >= M_PI){\n intervals[i] = {thetas.first, M_PI};\n } else {\n intervals[i] = {thetas.first, thetas.second};\n }\n }\n\n // 他の要素に包含される要素を削除\n REP(i, intervals.size()) REP(j, intervals.size()){\n if (i == j) continue;\n\n if (intervals[j].first <= intervals[i].first && intervals[i].second <= intervals[j].second) {\n intervals.erase(intervals.begin() + i);\n i--;\n break;\n }\n }\n\n intervals.insert(intervals.begin(), {0, 0});\n sort(ALL(intervals));\n\n vector<vector<double>> dp;\n dp.assign(N+1, vector<double>(K+1, 0));\n\n int n = intervals.size()-1;\n REPN(i, 1, n+1){\n //\n int l = i;\n while (l > 0){\n l--;\n if (intervals[l].second < intervals[i].first){\n break;\n }\n }\n REPN(j, 1, K+1){\n dp[i][j] = dp[i-1][j];\n dp[i][j] = max(dp[i][j], dp[l][j-1] + intervals[i].second - intervals[i].first);\n dp[i][j] = max(dp[i][j], dp[l+1][j-1] + intervals[i].second - intervals[l+1].second);\n }\n }\n\n print(dp[n][K] / M_PI);\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":20988,"score_of_the_acc":-0.0035,"final_rank":2},{"submission_id":"aoj_2276_3828008","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef pair<double,double> PA;\n\nint n,k;\nvector<PA> p;\ndouble memo[1510][1510];\n\ndouble dp(int a,int b){\n \n if(b >= k) return 0;\n if(memo[a][b] != -1.0) return memo[a][b];\n \n double res,add;\n int i,num;\n res = 0;\n add = 0;\n num = a+1;\n for(i=a+1;i<p.size()&&p[i].first<p[a].second;i++){\n if(add < p[i].second-p[a].second){\n num = i;\n add = p[i].second-p[a].second;\n }\n }\n if(i != a+1) res = max(res,dp(num,b+1)+add);\n for(int j=i;j<p.size();j++){\n add = p[j].second-p[j].first;\n res = max(res,dp(j,b+1)+add);\n }\n \n return memo[a][b] = res;\n}\n\nint main()\n{\n \n double x,y,r,as,at,ll,rr;\n vector<PA> vec;\n \n scanf(\"%d %d\",&n,&k);\n for(int i=0;i<n;i++){\n scanf(\"%lf %lf %lf\",&x,&y,&r);\n if(y+r < 0) continue;\n as = asin(r/sqrt(x*x+y*y));\n at = atan2(y,x);\n ll = at-as;\n rr = at+as;\n if(ll < -M_PI){\n ll += 2*M_PI;\n rr += 2*M_PI;\n }\n vec.push_back( PA(max(0.0,ll),min(M_PI,rr)) );\n }\n \n sort(vec.begin(),vec.end());\n \n double ma = 0.0;\n p.push_back(PA(0.0,0.0));\n for(int i=0;i<vec.size();i++){\n if(ma == M_PI) break;\n if(ma < vec[i].second){\n if(i < vec.size()-1 && vec[i].first == vec[i+1].first) continue;\n ma = vec[i].second;\n p.push_back(vec[i]);\n }\n }\n fill_n(*memo,1510*1510,-1.0);\n printf(\"%.13f\\n\",dp(0,0)/M_PI);\n \n return(0);\n}","accuracy":1,"time_ms":540,"memory_kb":21616,"score_of_the_acc":-0.7666,"final_rank":14},{"submission_id":"aoj_2276_1268316","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 n,K;\n\tscanf(\"%d%d\",&n,&K);\n\n\tvector<pair<double,double>> ps;\n\tconst double PI=3.14159265359;\n\trep(i,0,n){\n\t\tdouble x,y,r;\n\t\tscanf(\"%lf%lf%lf\",&x,&y,&r);\n\t\tif(y+r<=0) continue;\n\t\tif(y-r<=0){\n\t\t\tdouble f,s;\n\t\t\tif(x<0){\n\t\t\t\tf=atan2(y,x)-asin(r/sqrt(x*x+y*y));\n\t\t\t\ts=PI;\n\t\t\t}else{\n\t\t\t\tf=0;\n\t\t\t\ts=atan2(y,x)+asin(r/sqrt(x*x+y*y));\n\t\t\t}\n\t\t\twhile(f<0) f+=PI;\n\t\t\twhile(s<0) s+=PI;\n\t\t\tps.push_back(mp(f,s));\n\t\t}else ps.push_back(mp(atan2(y,x)-asin(r/sqrt(x*x+y*y)),atan2(y,x)+asin(r/sqrt(x*x+y*y))));\n\t}\n\t\n\tsort(ps.begin(),ps.end());\n\tps.erase(unique(ps.begin(),ps.end()),ps.end()); //同じ区間があると次の処理で面倒なので消しておく\n\n\t//他の区間に完全に包含されているものを取り除く\n\tvector<pair<double,double>> tmp;\n\trep(i,0,ps.size()){\n\t\tbool ok=true;\n\t\trep(j,0,ps.size()){\n\t\t\tif(i==j) continue;\n\t\t\tif(ps[j].first<=ps[i].first&&ps[i].second<=ps[j].second){\n\t\t\t\tok=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(ok) tmp.push_back(ps[i]);\n\t}\n\tps=tmp;\n\n\tif(ps.size()==0){\n\t\tcout << 0 << endl;\n\t\treturn;\n\t}\n\n\tvector<int> a(ps.size()); //a[i]=i番目の区間とギリギリ重なってる区間。存在しない場合はもっとも近いやつ\n\trep(i,1,ps.size()){\n\t\trep(j,0,i+1){\n\t\t\tif(ps[j].second>=ps[i].first){\n\t\t\t\ta[i]=j;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(a[i]==i) a[i]=i-1;\n\t}\n\n\tstatic double dp[1500][1501][2]; //dp[i][j][k]=i番目の区間まででj個取って、i番目の区間を使った(k==1)or使わなかった(k==0)ときの最大\n\tdp[0][0][0]=0;\n\tdp[0][1][1]=ps[0].second-ps[0].first;\n\tdouble ans=dp[0][1][1];\n\trep(i,1,ps.size()){\n\t\trep(j,0,K+1){\n\t\t\tdp[i][j][0]=max(dp[i-1][j][0],dp[i-1][j][1]);\n\t\t\tif(j==0) continue;\n\t\t\t//a[i]番目の区間を使った場合は重複している部分を取り除く、使わなかった場合は重なっていないのでそのまま足す。\n\t\t\tdp[i][j][1]=max(dp[a[i]][j-1][1]+ps[i].second-max(ps[i].first,ps[a[i]].second),dp[a[i]][j-1][0]+ps[i].second-ps[i].first);\n\t\t\tans=max({ans,dp[i][j][1],dp[i][j][0]});\n\t\t}\n\t}\n\n\tprintf(\"%.10lf\\n\",ans/PI);\n}\n\nint main(){\n\tSolve();\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":36584,"score_of_the_acc":-0.1643,"final_rank":5},{"submission_id":"aoj_2276_1268307","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 n,K;\n\tscanf(\"%d%d\",&n,&K);\n\n\tvector<pair<double,double>> ps;\n\tconst double PI=3.14159265359;\n\trep(i,0,n){\n\t\tdouble x,y,r;\n\t\tscanf(\"%lf%lf%lf\",&x,&y,&r);\n\t\tif(y+r<=0) continue;\n\t\tif(y-r<=0){\n\t\t\tdouble f,s;\n\t\t\tif(x<0){\n\t\t\t\tf=atan2(y,x)-asin(r/sqrt(x*x+y*y));\n\t\t\t\ts=PI;\n\t\t\t}else{\n\t\t\t\tf=0;\n\t\t\t\ts=atan2(y,x)+asin(r/sqrt(x*x+y*y));\n\t\t\t}\n\t\t\twhile(f<0) f+=PI;\n\t\t\twhile(s<0) s+=PI;\n\t\t\tps.push_back(mp(f,s));\n\t\t}else ps.push_back(mp(atan2(y,x)-asin(r/sqrt(x*x+y*y)),atan2(y,x)+asin(r/sqrt(x*x+y*y))));\n\t}\n\t\n\tsort(ps.begin(),ps.end());\n\tps.erase(unique(ps.begin(),ps.end()),ps.end());\n\t\n\tvector<pair<double,double>> tmp;\n\trep(i,0,ps.size()){\n\t\tbool ok=true;\n\t\trep(j,0,ps.size()){\n\t\t\tif(i==j) continue;\n\t\t\tif(ps[j].first<=ps[i].first&&ps[i].second<=ps[j].second){\n\t\t\t\tok=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(ok) tmp.push_back(ps[i]);\n\t}\n\tps=tmp;\n\n\tif(ps.size()==0){\n\t\tcout << 0 << endl;\n\t\treturn;\n\t}\n\n\tvector<int> a(ps.size());\n\trep(i,1,ps.size()){\n\t\trep(j,0,i+1){\n\t\t\tif(ps[j].second>=ps[i].first){\n\t\t\t\ta[i]=j;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(a[i]==i) a[i]=i-1;\n\t}\n\n\tstatic double dp[1500][1501][2];\n\tdp[0][0][0]=0;\n\tdp[0][1][1]=ps[0].second-ps[0].first;\n\tdouble ans=dp[0][1][1];\n\trep(i,1,ps.size()){\n\t\trep(j,0,K+1){\n\t\t\tdp[i][j][0]=max(dp[i-1][j][0],dp[i-1][j][1]);\n\t\t\tif(j==0) continue;\n\t\t\tdp[i][j][1]=max(dp[a[i]][j-1][1]+ps[i].second-max(ps[i].first,ps[a[i]].second),dp[a[i]][j-1][0]+ps[i].second-ps[i].first);\n\t\t\tans=max({ans,dp[i][j][1],dp[i][j][0]});\n\t\t}\n\t}\n\n\tprintf(\"%.10lf\\n\",ans/PI);\n}\n\nint main(){\n\tSolve();\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":36584,"score_of_the_acc":-0.1643,"final_rank":5},{"submission_id":"aoj_2276_1268305","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 n,K;\n\tscanf(\"%d%d\",&n,&K);\n\n\tvector<pair<double,double>> ps;\n\tconst double PI=3.14159265359;\n\trep(i,0,n){\n\t\tdouble x,y,r;\n\t\tscanf(\"%lf%lf%lf\",&x,&y,&r);\n\t\tif(y+r<=0) continue;\n\t\tif(y-r<=0){\n\t\t\tdouble f,s;\n\t\t\tif(x<0){\n\t\t\t\tf=atan2(y,x)-asin(r/sqrt(x*x+y*y));\n\t\t\t\ts=PI;\n\t\t\t}else{\n\t\t\t\tf=0;\n\t\t\t\ts=atan2(y,x)+asin(r/sqrt(x*x+y*y));\n\t\t\t}\n\t\t\twhile(f<0) f+=PI;\n\t\t\twhile(s<0) s+=PI;\n\t\t\tps.push_back(mp(f,s));\n\t\t}else ps.push_back(mp(atan2(y,x)-asin(r/sqrt(x*x+y*y)),atan2(y,x)+asin(r/sqrt(x*x+y*y))));\n\t}\n\t\n\tsort(ps.begin(),ps.end());\n\tps.erase(unique(ps.begin(),ps.end()),ps.end());\n\t\n\tvector<pair<double,double>> tmp;\n\trep(i,0,ps.size()){\n\t\tbool ok=true;\n\t\trep(j,0,ps.size()){\n\t\t\tif(i==j) continue;\n\t\t\tif(ps[j].first<=ps[i].first&&ps[i].second<=ps[j].second){\n\t\t\t\tok=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(ok) tmp.push_back(ps[i]);\n\t}\n\tps=tmp;\n\n\tif(ps.size()==0){\n\t\tcout << 0 << endl;\n\t\treturn;\n\t}\n\n\tvector<int> a(ps.size());\n\trep(i,1,ps.size()){\n\t\trep(j,0,i+1){\n\t\t\tif(ps[j].second>=ps[i].first){\n\t\t\t\ta[i]=j;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(a[i]==i) a[i]=i-1;\n\t}\n\n\tstatic double dp[1500][1501][2];\n\tdp[0][0][0]=0;\n\tdp[0][1][1]=ps[0].second-ps[0].first;\n\tdouble ans=dp[0][1][1];\n\trep(i,1,ps.size()){\n\t\trep(j,0,K+1){\n\t\t\tdp[i][j][0]=max(dp[i-1][j][0],dp[i-1][j][1]);\n\t\t\tif(j==0) continue;\n\t\t\tif(j==1) dp[i][j][1]=ps[i].second-ps[i].first;\n\t\t\tdp[i][j][1]=max(dp[a[i]][j-1][1]+ps[i].second-max(ps[i].first,ps[a[i]].second),dp[a[i]][j-1][0]+ps[i].second-ps[i].first);\n\t\t\tans=max({ans,dp[i][j][1],dp[i][j][0]});\n\t\t}\n\t}\n\n\tprintf(\"%.10lf\\n\",ans/PI);\n}\n\nint main(){\n\tSolve();\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":36584,"score_of_the_acc":-0.1643,"final_rank":5},{"submission_id":"aoj_2276_1170001","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; }\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; }\n\n\n\ntypedef double DD;\n\nconst DD INF = 1LL<<60;\nconst DD EPS = 1e-10;\nconst DD PI = acos(-1.0);\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\nDD todeg(DD ang) {return ang * 180 / PI;}\n\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};\n\nPoint operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\nPoint operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\nPoint operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\nPoint operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\nPoint 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);}\nPoint operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\nPoint conj(const Point &p) {return Point(p.x, -p.y);}\nPoint rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\nPoint rot90(const Point &p) {return Point(-p.y, p.x);}\nDD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\nDD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\nDD norm(const Point &p) {return dot(p, p);}\nDD abs(const Point &p) {return sqrt(dot(p, p));}\nDD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\nbool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\nbool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\nbool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\nPoint operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\n\nint ccw(const Point &a, const Point &b, const Point &c) {\n if (cross(b-a, c-a) > EPS) return 1;\n if (cross(b-a, c-a) < -EPS) return -1;\n if (dot(b-a, c-a) < -EPS) return 2;\n if (norm(b-a) < norm(c-a) - EPS) return -2;\n return 0;\n}\n\nstruct Line : vector<Point> {\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\n this->push_back(a);\n this->push_back(b);\n }\n friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << \", \" << l[1] << '}';}\n};\n\nstruct Circle : Point {\n DD r;\n Circle(Point p = Point(0.0, 0.0), DD r = 0.0) : Point(p), r(r) {}\n friend ostream& operator << (ostream &s, const Circle &c) {return s << '(' << c.x << \", \" << c.y << \", \" << c.r << ')';}\n};\n\n\n\nvector<Point> tanline(Point p, Circle c) {\n vector<Point> res;\n DD d = norm(p - c);\n DD l = d - c.r * c.r;\n if (l < -EPS) return res;\n if (l <= 0.0) l = 0.0;\n Point cq = (p - c) * (c.r * c.r / d);\n Point qs = rot90((p - c) * (c.r * sqrt(l) / d));\n Point s1 = c + cq + qs, s2 = c + cq - qs;\n res.push_back(s1);\n res.push_back(s2);\n return res;\n}\n\n\n\nint N, K;\nCircle cir[3100];\nDD dp[2100][2100];\n\nDD solve() {\n vector< pair<DD,DD> > inter;\n for (int i = 0; i < N; ++i) {\n if (abs(cir[i]) <= cir[i].r + EPS) return 1.0;\n \n vector<Point> ps = tanline(Point(0,0), cir[i]);\n DD left = amp(ps[0]), right = amp(ps[1]);\n if (left > right) left = 0;\n chmax(left, 0.0);\n chmin(right, PI);\n \n if (left < right) inter.PB(MP(right, left));\n //cout << i << \" : \" << cir[i] << \", \" << amp(ps[0]) << \", \" << amp(ps[1]) << \" ; \" << MP(left, right) << endl;\n }\n \n sort(ALL(inter));\n for (int i = 0; i < inter.size(); ++i) swap(inter[i].first, inter[i].second);\n for (int i = 0; i < inter.size(); ++i) {\n for (int j = i+1; j < inter.size(); ++j) {\n if (inter[j].first < inter[i].first) {\n inter.erase(inter.begin() + i--);\n break;\n }\n }\n }\n \n //COUT(inter);\n \n for (int i = 0; i < 2100; ++i) for (int j = 0; j < 2100; ++j) dp[i][j] = 0.0;\n DD res = 0.0;\n for (int i = 0; i < inter.size(); ++i) {\n int tmp = i;\n while (true) {\n if (inter[tmp].second <= inter[i].first) break;\n --tmp;\n if (tmp == -1) break;\n }\n for (int k = 0; k <= K; ++k) {\n chmax(dp[i+1][k], dp[i][k]);\n chmax(dp[i+1][k+1], dp[tmp+1][k] + inter[i].second - inter[i].first);\n chmax(dp[i+1][k+1], dp[tmp+2][k] + inter[i].second - inter[tmp+1].second);\n \n chmax(res, dp[i+1][k]);\n }\n }\n \n return res / PI;\n}\n\nint main() {\n //freopen( \"/Users/macuser/Dropbox/Contest/input.in\", \"r\", stdin );\n \n while (cin >> N >> K) {\n for (int i = 0; i < N; ++i) cin >> cir[i].x >> cir[i].y >>cir[i].r;\n cout << fixed << setprecision(9) << solve() << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":35960,"score_of_the_acc":-0.1585,"final_rank":4},{"submission_id":"aoj_2276_1007644","code_snippet":"#include<stdio.h>\n#include<algorithm>\n#include<math.h>\nusing namespace std;\ndouble PI=3.14159265359;\nint x[2000];\nint y[2000];\nint r[2000];\npair<double,double> p[2000];\npair<double,double> c[2000];\ndouble dp[2000][2000];\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tfor(int i=0;i<a;i++){\n\t\tscanf(\"%d%d%d\",x+i,y+i,r+i);\n\t\tdouble d=sqrt(x[i]*x[i]+y[i]*y[i]);\n\t\tdouble q=atan2(y[i],x[i]);\n\t\tif(q<-PI/2)q+=PI*2;\n\t\tdouble v=asin((double)r[i]/d);\n\t\t//printf(\"%f %f\\n\",(q-v)/PI*180,(q+v)/PI*180);\n\t\tp[i]=make_pair(max(0.0,min(PI,q-v)),min(PI,max(0.0,q+v)));\n\t}\n\tstd::sort(p,p+a);\n\tint sz=0;\n\tfor(int i=0;i<a;i++){\n\t\tbool ok=true;\n\t\tfor(int j=0;j<a;j++){\n\t\t\tif(i!=j&&p[j].first<p[i].first&&p[i].second<p[j].second)ok=false;\n\t\t}\n\t\tif(ok){\n\t\t\tc[sz++]=p[i];\n\t\t}\n\t}\n\tdouble ret=0;\n\tfor(int i=1;i<=b;i++){\n\t\tdouble tmp=0;\n\t\tint at=0;\n\t\tfor(int j=0;j<sz;j++){\n\t\t\twhile(c[at].second<c[j].first){tmp=max(tmp,dp[i-1][at]);at++;}\n\t\t\tdp[i][j]=max(tmp+c[j].second-c[j].first,dp[i-1][at]+c[j].second-c[at].second);\n\t\t\tret=max(ret,dp[i][j]);\n\t\t}\n\t}printf(\"%.12f\\n\",ret/PI);\n}","accuracy":1,"time_ms":10,"memory_kb":25808,"score_of_the_acc":-0.0488,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_2276_4339412\",\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\\nnamespace Geometry {\\n using Real = double;\\n\\n int sgn(Real x) { return x > EPS ? 1 : x < -EPS ? -1 : 0; }\\n\\n Real degree_to_radian(Real d) { return d * M_PI / 180; }\\n Real radian_to_degree(Real r) { return r * 180 / M_PI; }\\n\\n struct Point {\\n Real x, y;\\n Point(Real x = 0, Real y = 0) : x(x), y(y) {}\\n Real abs() const { return sqrt(norm()); }\\n Real arg() const { Real res = atan2(y, x); return res < 0 ? res + M_PI * 2 : res; }\\n Real norm() const { return x * x + y * y; }\\n Point rotate(Real angle) const { Real cs = cos(angle), sn = sin(angle); return Point(x * cs - y * sn, x * sn + y * cs); }\\n Point unit_vector() const { Real a = abs(); return Point(x / a, y / a); }\\n pair<Point, Point> normal_unit_vector() const { Point p = unit_vector(); return {Point(-p.y, p.x), Point(p.y, -p.x)}; }\\n Point &operator+=(const Point &p) { x += p.x; y += p.y; return *this; }\\n Point &operator-=(const Point &p) { x -= p.x; y -= p.y; return *this; }\\n Point &operator*=(Real k) { x *= k; y *= k; return *this; }\\n Point &operator/=(Real k) { x /= k; y /= k; return *this; }\\n bool operator<(const Point &p) const { int x_sgn = sgn(p.x - x); return x_sgn != 0 ? x_sgn == 1 : sgn(p.y - y) == 1; }\\n bool operator<=(const Point &p) const { return !(p < *this); }\\n bool operator>(const Point &p) const { return p < *this; }\\n bool operator>=(const Point &p) const { return !(*this < p); }\\n Point operator+() const { return *this; }\\n Point operator-() const { return Point(-x, -y); }\\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*(Real k) const { return Point(*this) *= k; }\\n Point operator/(Real k) const { return Point(*this) /= k; }\\n friend ostream &operator<<(ostream &os, const Point &p) { return os << '(' << p.x << \\\", \\\" << p.y << ')'; }\\n friend istream &operator>>(istream &is, Point &p) { Real x, y; is >> x >> y; p = Point(x, y); return is; }\\n };\\n\\n struct Segment {\\n Point s, t;\\n Segment(const Point &s = {0, 0}, const Point &t = {0, 0}) : s(s), t(t) {}\\n };\\n struct Line : Segment {\\n using Segment::Segment;\\n Line(Real a, Real b, Real c) {\\n if (sgn(a) == 0) {\\n s = Point(0, -c / b); t = Point(1, s.y);\\n } else if (sgn(b) == 0) {\\n s = Point(-c / a, 0); t = Point(s.x, 1);\\n } else if (sgn(c) == 0) {\\n s = Point(0, 0); t = Point(1, -a / b);\\n } else {\\n s = Point(0, -c / b); t = Point(-c / a, 0);\\n }\\n }\\n };\\n\\n struct Circle {\\n Point p; Real r;\\n Circle(const Point &p = {0, 0}, Real r = 0) : p(p), r(r) {}\\n };\\n\\n Real cross(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; }\\n Real dot(const Point &a, const Point &b) { return a.x * b.x + a.y * b.y; }\\n\\n int ccw(const Point &a, const Point &b, const Point &c) {\\n Point ab = b - a, ac = c - a;\\n int sign = sgn(cross(ab, ac));\\n if (sign == 0) {\\n if (sgn(dot(ab, ac)) == -1) return 2;\\n if (sgn(ac.norm() - ab.norm()) == 1) return -2;\\n }\\n return sign;\\n }\\n\\n Real get_angle(const Point &a, const Point &b, const Point &c) {\\n Real ba_arg = (a - b).arg(), bc_arg = (c - b).arg();\\n if (ba_arg > bc_arg) swap(ba_arg, bc_arg);\\n return min(bc_arg - ba_arg, M_PI * 2 - (bc_arg - ba_arg));\\n }\\n\\n Real closest_pair(vector<Point> ps) {\\n int n = ps.size();\\n assert(n > 1);\\n sort(ALL(ps));\\n function<Real(int, int)> rec = [&](int left, int right) {\\n int mid = (left + right) >> 1;\\n Real x_mid = ps[mid].x, d = LINF;\\n if (left + 1 < mid) chmin(d, rec(left, mid));\\n if (mid + 1 < right) chmin(d, rec(mid, right));\\n inplace_merge(ps.begin() + left, ps.begin() + mid, ps.begin() + right, [&](const Point &a, const Point &b) { return sgn(b.y - a.y) == 1; });\\n vector<Point> tmp;\\n FOR(i, left, right) {\\n if (sgn(abs(ps[i].x - x_mid) - d) == 1) continue;\\n for (int j = static_cast<int>(tmp.size()) - 1; j >= 0; --j) {\\n Point now = ps[i] - tmp[j];\\n if (sgn(now.y - d) == 1) break;\\n chmin(d, now.abs());\\n }\\n tmp.emplace_back(ps[i]);\\n }\\n return d;\\n };\\n return rec(0, n);\\n }\\n\\n Point projection(const Segment &a, const Point &b) { return a.s + (a.t - a.s) * dot(a.t - a.s, b - a.s) / (a.t - a.s).norm(); }\\n Point reflection(const Segment &a, const Point &b) { return projection(a, b) * 2 - b; }\\n\\n bool is_parallel(const Segment &a, const Segment &b) { return sgn(cross(a.t - a.s, b.t - b.s)) == 0; }\\n bool is_orthogonal(const Segment &a, const Segment &b) { return sgn(dot(a.t - a.s, b.t - b.s)) == 0; }\\n\\n Real distance(const Point&, const Point&);\\n Real distance(const Segment&, const Point&);\\n Real distance(const Line&, const Point&);\\n int sizeof_common_tangent(const Circle&, const Circle&);\\n bool has_intersected(const Segment &a, const Point &b) { return ccw(a.s, a.t, b) == 0; }\\n bool has_intersected(const Segment &a, const Segment &b) { return ccw(a.s, a.t, b.s) * ccw(a.s, a.t, b.t) <= 0 && ccw(b.s, b.t, a.s) * ccw(b.s, b.t, a.t) <= 0; }\\n bool has_intersected(const Line &a, const Point &b) { int c = ccw(a.s, a.t, b); return c != 1 && c != -1; }\\n bool has_intersected(const Line &a, const Segment &b) { return ccw(a.s, a.t, b.s) * ccw(a.s, a.t, b.t) != 1; }\\n bool has_intersected(const Line &a, const Line &b) { return sgn(cross(a.t - a.s, b.t - b.s)) != 0 || sgn(cross(a.t - a.s, b.s - a.s)) == 0; }\\n bool has_intersected(const Circle &a, const Point &b) { return sgn(distance(a.p, b) - a.r) == 0; }\\n bool has_intersected(const Circle &a, const Segment &b) { return sgn(a.r - distance(b, a.p)) != -1 && sgn(max(distance(a.p, b.s), distance(a.p, b.t)) - a.r) != -1; }\\n bool has_intersected(const Circle &a, const Line &b) { return sgn(a.r - distance(b, a.p)) != -1; }\\n bool has_intersected(const Circle &a, const Circle &b) { return sizeof_common_tangent(a, b) > 0; }\\n\\n Point intersection(const Line &a, const Line &b) {\\n assert(has_intersected(a, b) && !is_parallel(a, b));\\n return a.s + (a.t - a.s) * cross(b.t - b.s, b.s - a.s) / cross(b.t - b.s, a.t - a.s);\\n }\\n Point intersection(const Segment &a, const Segment &b) {\\n assert(has_intersected(a, b));\\n if (is_parallel(a, b)) {\\n if (sgn(distance(a.s, b.s)) == 0) {\\n assert(sgn(dot(a.t - a.s, b.t - a.s)) == -1);\\n return a.s;\\n } else if (sgn(distance(a.s, b.t)) == 0) {\\n assert(sgn(dot(a.t - a.s, b.s - a.s)) == -1);\\n return a.s;\\n } else if (sgn(distance(a.t, b.s)) == 0) {\\n assert(sgn(dot(a.s - a.t, b.t - a.t)) == -1);\\n return a.t;\\n } else if (sgn(distance(a.t, b.t)) == 0) {\\n assert(sgn(dot(a.s - a.t, b.s - a.t)) == -1);\\n return a.t;\\n } else {\\n assert(false);\\n }\\n } else {\\n return intersection(Line(a.s, a.t), Line(b.s, b.t));\\n }\\n }\\n Point intersection(const Line &a, const Segment &b) {\\n assert(has_intersected(a, b));\\n return intersection(a, Line(b.s, b.t));\\n }\\n vector<Point> intersection(const Circle &a, const Line &b) {\\n Point pro = projection(b, a.p);\\n Real nor = (a.p - pro).norm();\\n int sign = sgn(a.r - sqrt(nor));\\n if (sign == -1) return {};\\n if (sign == 0) return {pro};\\n Point v = (b.t - b.s).unit_vector() * sqrt(a.r * a.r - nor);\\n return {pro + v, pro - v};\\n }\\n vector<Point> intersection(const Circle &a, const Segment &b) {\\n if (!has_intersected(a, b)) return {};\\n vector<Point> res = intersection(a, Line(b.s, b.t));\\n if (sgn(distance(a.p, b.s) - a.r) != -1 && sgn(distance(a.p, b.t) - a.r) != -1) return res;\\n return {sgn(dot(res[0] - b.s, res[0] - b.t)) == 1 ? res[1] : res[0]};\\n }\\n vector<Point> intersection(const Circle &a, const Circle &b) {\\n int sz = sizeof_common_tangent(a, b);\\n if (sz == 0 || sz == 4) return {};\\n Real alpha = (b.p - a.p).arg();\\n if (sz == 1 || sz == 3) return {Point(a.p.x + a.r * cos(alpha), a.p.y + a.r * sin(alpha))};\\n Real dist = (b.p - a.p).norm(), beta = acos((dist + a.r * a.r - b.r * b.r) / (2 * sqrt(dist) * a.r));\\n return {a.p + Point(a.r * cos(alpha + beta), a.r * sin(alpha + beta)), a.p + Point(a.r * cos(alpha - beta), a.r * sin(alpha - beta))};\\n }\\n\\n Real distance(const Point &a, const Point &b) { return (b - a).abs(); }\\n Real distance(const Segment &a, const Point &b) {\\n Point foot = projection(a, b);\\n return has_intersected(a, foot) ? distance(foot, b) : min(distance(a.s, b), distance(a.t, b));\\n }\\n Real distance(const Segment &a, const Segment &b) { return has_intersected(a, b) ? 0 : min({distance(a, b.s), distance(a, b.t), distance(b, a.s), distance(b, a.t)}); }\\n Real distance(const Line &a, const Point &b) { return distance(projection(a, b), b); }\\n Real distance(const Line &a, const Segment &b) { return has_intersected(a, b) ? 0 : min(distance(a, b.s), distance(a, b.t)); }\\n Real distance(const Line &a, const Line &b) { return has_intersected(a, b) ? 0 : distance(a, b.s); }\\n\\n vector<Point> tangency(const Circle &a, const Point &b) {\\n Real dist = distance(a.p, b);\\n int sign = sgn(dist - a.r);\\n if (sign == -1) return {};\\n if (sign == 0) return {b};\\n Real alpha = (b - a.p).arg(), beta = acos(a.r / dist);\\n return {a.p + Point(a.r * cos(alpha + beta), a.r * sin(alpha + beta)), a.p + Point(a.r * cos(alpha - beta), a.r * sin(alpha - beta))};\\n }\\n int sizeof_common_tangent(const Circle &a, const Circle &b) {\\n Real dist = distance(a.p, b.p);\\n int sign = sgn(a.r + b.r - dist);\\n if (sign == -1) return 4;\\n if (sign == 0) return 3;\\n sign = sgn((sgn(a.r - b.r) == -1 ? b.r - a.r : a.r - b.r) - dist);\\n if (sign == -1) return 2;\\n if (sign == 0) return 1;\\n return 0;\\n }\\n vector<Line> common_tangent(const Circle &a, const Circle &b) {\\n vector<Line> tangents;\\n Real dist = distance(a.p, b.p), argument = (b.p - a.p).arg();\\n int sign = sgn(a.r + b.r - dist);\\n if (sign == -1) {\\n Real ac = acos((a.r + b.r) / dist), alpha = argument + ac, cs = cos(alpha), sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\\n alpha = argument - ac; cs = cos(alpha); sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\\n } else if (sign == 0) {\\n Point s = a.p + Point(a.r * cos(argument), a.r * sin(argument));\\n tangents.emplace_back(s, s + (b.p - a.p).normal_unit_vector().first);\\n }\\n if (sgn(b.r - a.r) == -1) {\\n sign = sgn(a.r - b.r - dist);\\n if (sign == -1) {\\n Real at = acos((a.r - b.r) / dist), alpha = argument + at, cs = cos(alpha), sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(b.r * cs, b.r * sn));\\n alpha = argument - at; cs = cos(alpha); sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(b.r * cs, b.r * sn));\\n } else if (sign == 0) {\\n Point s = a.p + Point(a.r * cos(argument), a.r * sin(argument));\\n tangents.emplace_back(s, s + (b.p - a.p).normal_unit_vector().first);\\n }\\n } else {\\n sign = sgn(b.r - a.r - dist);\\n if (sign == -1) {\\n Real at = acos((b.r - a.r) / dist), alpha = argument - at, cs = cos(alpha), sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(-a.r * cs, -a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\\n alpha = argument + at; cs = cos(alpha); sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(-a.r * cs, -a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\\n } else if (sign == 0) {\\n Point s = b.p + Point(-b.r * cos(argument), -b.r * sin(argument));\\n tangents.emplace_back(s, s + (a.p - b.p).normal_unit_vector().first);\\n }\\n }\\n return tangents;\\n }\\n\\n Real intersection_area(const Circle &a, const Circle &b) {\\n Real nor = (b.p - a.p).norm(), dist = sqrt(nor);\\n if (sgn(a.r + b.r - dist) != 1) return 0;\\n if (sgn(abs(a.r - b.r) - dist) != -1) return min(a.r, b.r) * min(a.r, b.r) * M_PI;\\n Real alpha = acos((nor + a.r * a.r - b.r * b.r) / (2 * dist * a.r)), beta = acos((nor + b.r * b.r - a.r * a.r) / (2 * dist * b.r));\\n return (alpha - sin(alpha + alpha) * 0.5) * a.r * a.r + (beta - sin(beta + beta) * 0.5) * b.r * b.r;\\n }\\n\\n using Polygon = vector<Point>;\\n\\n Real area(const Polygon &a) {\\n int n = a.size();\\n Real res = 0;\\n REP(i, n) res += cross(a[i], a[(i + 1) % n]);\\n return res * 0.5;\\n }\\n\\n Point centroid(const Polygon &a) {\\n Point res(0, 0);\\n int n = a.size();\\n Real den = 0;\\n REP(i, n) {\\n Real cro = cross(a[i], a[(i + 1) % n]);\\n res += (a[i] + a[(i + 1) % n]) / 3 * cro;\\n den += cro;\\n }\\n return res / den;\\n }\\n\\n int is_contained(const Polygon &a, const Point &b) {\\n int n = a.size();\\n bool is_in = false;\\n REP(i, n) {\\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\\n if (sgn(q.y - p.y) == -1) swap(p, q);\\n int sign = sgn(cross(p, q));\\n if (sign == 1 && sgn(p.y) != 1 && sgn(q.y) == 1) is_in = !is_in;\\n if (sign == 0 && sgn(dot(p, q)) != 1) return 1;\\n }\\n return is_in ? 2 : 0;\\n }\\n\\n bool is_convex(const Polygon &a) {\\n int n = a.size();\\n REP(i, n) {\\n if (ccw(a[(i - 1 + n) % n], a[i], a[(i + 1) % n]) == -1) return false;\\n }\\n return true;\\n }\\n\\n Polygon monotone_chain(vector<Point> ps, bool tight = true) {\\n sort(ALL(ps));\\n int n = ps.size(), idx = 0;\\n Polygon convex_hull(n << 1);\\n for (int i = 0; i < n; convex_hull[idx++] = ps[i++]) {\\n while (idx >= 2 && sgn(cross(convex_hull[idx - 1] - convex_hull[idx - 2], ps[i] - convex_hull[idx - 1])) < tight) --idx;\\n }\\n for (int i = n - 2, border = idx + 1; i >= 0; convex_hull[idx++] = ps[i--]) {\\n while (idx >= border && sgn(cross(convex_hull[idx - 1] - convex_hull[idx - 2], ps[i] - convex_hull[idx - 1])) < tight) --idx;\\n }\\n convex_hull.resize(idx - 1);\\n return convex_hull;\\n }\\n\\n Polygon cut_convex(const Polygon &a, const Line &b) {\\n int n = a.size();\\n Polygon res;\\n REP(i, n) {\\n int c = ccw(b.s, b.t, a[i]);\\n if (c != -1) res.emplace_back(a[i]);\\n if (c * ccw(b.s, b.t, a[(i + 1) % n]) == -1) res.emplace_back(intersection(Line(a[i], a[(i + 1) % n]), b));\\n }\\n if (res.size() < 3) res.clear();\\n return res;\\n }\\n\\n pair<Point, Point> rotating_calipers(const Polygon &a) {\\n int n = a.size(), high = 0, low = 0;\\n if (n <= 2) {\\n assert(n == 2);\\n return {a[0], a[1]};\\n }\\n FOR(i, 1, n) {\\n if (a[i].y > a[high].y) high = i;\\n if (a[i].y < a[low].y) low = i;\\n }\\n Real max_norm = (a[high] - a[low]).norm();\\n int i = high, j = low, max_i = i, max_j = j;\\n do {\\n ((sgn(cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j])) != -1 ? j : i) += 1) %= n;\\n Real tmp = (a[j] - a[i]).norm();\\n if (sgn(tmp - max_norm) == 1) {\\n max_norm = tmp;\\n max_i = i; max_j = j;\\n }\\n } while (i != high || j != low);\\n return {a[max_i], a[max_j]};\\n }\\n}\\n\\nusing namespace Geometry;\\n\\nint main() {\\n int n, k; cin >> n >> k;\\n vector<Circle> people;\\n REP(_, n) {\\n Point p; double r; cin >> p >> r;\\n people.emplace_back(p, r);\\n }\\n vector<double> l(n), r(n), comp;\\n REP(i, n) {\\n vector<Point> t = tangency(people[i], Point(0, 0));\\n l[i] = t[0].arg(); r[i] = t[1].arg();\\n if (l[i] > r[i]) swap(l[i], r[i]);\\n if (r[i] > M_PI && has_intersected(people[i], Segment(Point(0, 0), Point(2415, 0)))) {\\n swap(l[i], r[i]);\\n l[i] = 0;\\n } else {\\n chmax(l[i], 0);\\n chmin(r[i], M_PI);\\n }\\n if (l[i] < M_PI) {\\n comp.emplace_back(l[i]);\\n comp.emplace_back(r[i]);\\n }\\n }\\n vector<bool> use(n, true);\\n REP(i, n) {\\n if (l[i] >= M_PI) use[i] = false;\\n if (!use[i]) continue;\\n REP(j, n) {\\n if (j != i && l[i] <= l[j] && r[j] <= r[i]) use[j] = false;\\n }\\n }\\n vector<pair<double, double>> ball;\\n REP(i, n) {\\n if (use[i]) ball.emplace_back(l[i], r[i]);\\n }\\n n = ball.size();\\n if (n == 0) {\\n cout << \\\"0\\\\n\\\";\\n return 0;\\n }\\n sort(ALL(ball));\\n // REP(i, n) cout << ball[i].first << ' ' << ball[i].second << '\\\\n';\\n vector<vector<vector<double>>> dp(n, vector<vector<double>>(k + 1, vector<double>(2, -INF)));\\n dp[0][0][false] = 0;\\n dp[0][1][true] = ball[0].second - ball[0].first;\\n FOR(i, 1, n) {\\n double left, right; tie(left, right) = ball[i];\\n int x = i - 1;\\n while (x >= 0 && ball[i].first <= ball[x].second) --x;\\n ++x;\\n chmin(x, i - 1);\\n REP(j, k + 1) {\\n if (j + 1 <= k) {\\n chmax(dp[i][j + 1][true], dp[x][j][true] + right - max(ball[x].second, left));\\n chmax(dp[i][j + 1][true], dp[x][j][false] + right - left);\\n }\\n chmax(dp[i][j][false], max(dp[i - 1][j][false], dp[i - 1][j][true]));\\n }\\n }\\n double ans = 0;\\n REP(y, k + 1) REP(z, 2) chmax(ans, dp[n - 1][y][z]);\\n cout << ans / M_PI << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 127048,\n \"score_of_the_acc\": -1.1429,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2276_4339407\",\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\\nnamespace Geometry {\\n using Real = double;\\n\\n int sgn(Real x) { return x > EPS ? 1 : x < -EPS ? -1 : 0; }\\n\\n Real degree_to_radian(Real d) { return d * M_PI / 180; }\\n Real radian_to_degree(Real r) { return r * 180 / M_PI; }\\n\\n struct Point {\\n Real x, y;\\n Point(Real x = 0, Real y = 0) : x(x), y(y) {}\\n Real abs() const { return sqrt(norm()); }\\n Real arg() const { Real res = atan2(y, x); return res < 0 ? res + M_PI * 2 : res; }\\n Real norm() const { return x * x + y * y; }\\n Point rotate(Real angle) const { Real cs = cos(angle), sn = sin(angle); return Point(x * cs - y * sn, x * sn + y * cs); }\\n Point unit_vector() const { Real a = abs(); return Point(x / a, y / a); }\\n pair<Point, Point> normal_unit_vector() const { Point p = unit_vector(); return {Point(-p.y, p.x), Point(p.y, -p.x)}; }\\n Point &operator+=(const Point &p) { x += p.x; y += p.y; return *this; }\\n Point &operator-=(const Point &p) { x -= p.x; y -= p.y; return *this; }\\n Point &operator*=(Real k) { x *= k; y *= k; return *this; }\\n Point &operator/=(Real k) { x /= k; y /= k; return *this; }\\n bool operator<(const Point &p) const { int x_sgn = sgn(p.x - x); return x_sgn != 0 ? x_sgn == 1 : sgn(p.y - y) == 1; }\\n bool operator<=(const Point &p) const { return !(p < *this); }\\n bool operator>(const Point &p) const { return p < *this; }\\n bool operator>=(const Point &p) const { return !(*this < p); }\\n Point operator+() const { return *this; }\\n Point operator-() const { return Point(-x, -y); }\\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*(Real k) const { return Point(*this) *= k; }\\n Point operator/(Real k) const { return Point(*this) /= k; }\\n friend ostream &operator<<(ostream &os, const Point &p) { return os << '(' << p.x << \\\", \\\" << p.y << ')'; }\\n friend istream &operator>>(istream &is, Point &p) { Real x, y; is >> x >> y; p = Point(x, y); return is; }\\n };\\n\\n struct Segment {\\n Point s, t;\\n Segment(const Point &s = {0, 0}, const Point &t = {0, 0}) : s(s), t(t) {}\\n };\\n struct Line : Segment {\\n using Segment::Segment;\\n Line(Real a, Real b, Real c) {\\n if (sgn(a) == 0) {\\n s = Point(0, -c / b); t = Point(1, s.y);\\n } else if (sgn(b) == 0) {\\n s = Point(-c / a, 0); t = Point(s.x, 1);\\n } else if (sgn(c) == 0) {\\n s = Point(0, 0); t = Point(1, -a / b);\\n } else {\\n s = Point(0, -c / b); t = Point(-c / a, 0);\\n }\\n }\\n };\\n\\n struct Circle {\\n Point p; Real r;\\n Circle(const Point &p = {0, 0}, Real r = 0) : p(p), r(r) {}\\n };\\n\\n Real cross(const Point &a, const Point &b) { return a.x * b.y - a.y * b.x; }\\n Real dot(const Point &a, const Point &b) { return a.x * b.x + a.y * b.y; }\\n\\n int ccw(const Point &a, const Point &b, const Point &c) {\\n Point ab = b - a, ac = c - a;\\n int sign = sgn(cross(ab, ac));\\n if (sign == 0) {\\n if (sgn(dot(ab, ac)) == -1) return 2;\\n if (sgn(ac.norm() - ab.norm()) == 1) return -2;\\n }\\n return sign;\\n }\\n\\n Real get_angle(const Point &a, const Point &b, const Point &c) {\\n Real ba_arg = (a - b).arg(), bc_arg = (c - b).arg();\\n if (ba_arg > bc_arg) swap(ba_arg, bc_arg);\\n return min(bc_arg - ba_arg, M_PI * 2 - (bc_arg - ba_arg));\\n }\\n\\n Real closest_pair(vector<Point> ps) {\\n int n = ps.size();\\n assert(n > 1);\\n sort(ALL(ps));\\n function<Real(int, int)> rec = [&](int left, int right) {\\n int mid = (left + right) >> 1;\\n Real x_mid = ps[mid].x, d = LINF;\\n if (left + 1 < mid) chmin(d, rec(left, mid));\\n if (mid + 1 < right) chmin(d, rec(mid, right));\\n inplace_merge(ps.begin() + left, ps.begin() + mid, ps.begin() + right, [&](const Point &a, const Point &b) { return sgn(b.y - a.y) == 1; });\\n vector<Point> tmp;\\n FOR(i, left, right) {\\n if (sgn(abs(ps[i].x - x_mid) - d) == 1) continue;\\n for (int j = static_cast<int>(tmp.size()) - 1; j >= 0; --j) {\\n Point now = ps[i] - tmp[j];\\n if (sgn(now.y - d) == 1) break;\\n chmin(d, now.abs());\\n }\\n tmp.emplace_back(ps[i]);\\n }\\n return d;\\n };\\n return rec(0, n);\\n }\\n\\n Point projection(const Segment &a, const Point &b) { return a.s + (a.t - a.s) * dot(a.t - a.s, b - a.s) / (a.t - a.s).norm(); }\\n Point reflection(const Segment &a, const Point &b) { return projection(a, b) * 2 - b; }\\n\\n bool is_parallel(const Segment &a, const Segment &b) { return sgn(cross(a.t - a.s, b.t - b.s)) == 0; }\\n bool is_orthogonal(const Segment &a, const Segment &b) { return sgn(dot(a.t - a.s, b.t - b.s)) == 0; }\\n\\n Real distance(const Point&, const Point&);\\n Real distance(const Segment&, const Point&);\\n Real distance(const Line&, const Point&);\\n int sizeof_common_tangent(const Circle&, const Circle&);\\n bool has_intersected(const Segment &a, const Point &b) { return ccw(a.s, a.t, b) == 0; }\\n bool has_intersected(const Segment &a, const Segment &b) { return ccw(a.s, a.t, b.s) * ccw(a.s, a.t, b.t) <= 0 && ccw(b.s, b.t, a.s) * ccw(b.s, b.t, a.t) <= 0; }\\n bool has_intersected(const Line &a, const Point &b) { int c = ccw(a.s, a.t, b); return c != 1 && c != -1; }\\n bool has_intersected(const Line &a, const Segment &b) { return ccw(a.s, a.t, b.s) * ccw(a.s, a.t, b.t) != 1; }\\n bool has_intersected(const Line &a, const Line &b) { return sgn(cross(a.t - a.s, b.t - b.s)) != 0 || sgn(cross(a.t - a.s, b.s - a.s)) == 0; }\\n bool has_intersected(const Circle &a, const Point &b) { return sgn(distance(a.p, b) - a.r) == 0; }\\n bool has_intersected(const Circle &a, const Segment &b) { return sgn(a.r - distance(b, a.p)) != -1 && sgn(max(distance(a.p, b.s), distance(a.p, b.t)) - a.r) != -1; }\\n bool has_intersected(const Circle &a, const Line &b) { return sgn(a.r - distance(b, a.p)) != -1; }\\n bool has_intersected(const Circle &a, const Circle &b) { return sizeof_common_tangent(a, b) > 0; }\\n\\n Point intersection(const Line &a, const Line &b) {\\n assert(has_intersected(a, b) && !is_parallel(a, b));\\n return a.s + (a.t - a.s) * cross(b.t - b.s, b.s - a.s) / cross(b.t - b.s, a.t - a.s);\\n }\\n Point intersection(const Segment &a, const Segment &b) {\\n assert(has_intersected(a, b));\\n if (is_parallel(a, b)) {\\n if (sgn(distance(a.s, b.s)) == 0) {\\n assert(sgn(dot(a.t - a.s, b.t - a.s)) == -1);\\n return a.s;\\n } else if (sgn(distance(a.s, b.t)) == 0) {\\n assert(sgn(dot(a.t - a.s, b.s - a.s)) == -1);\\n return a.s;\\n } else if (sgn(distance(a.t, b.s)) == 0) {\\n assert(sgn(dot(a.s - a.t, b.t - a.t)) == -1);\\n return a.t;\\n } else if (sgn(distance(a.t, b.t)) == 0) {\\n assert(sgn(dot(a.s - a.t, b.s - a.t)) == -1);\\n return a.t;\\n } else {\\n assert(false);\\n }\\n } else {\\n return intersection(Line(a.s, a.t), Line(b.s, b.t));\\n }\\n }\\n Point intersection(const Line &a, const Segment &b) {\\n assert(has_intersected(a, b));\\n return intersection(a, Line(b.s, b.t));\\n }\\n vector<Point> intersection(const Circle &a, const Line &b) {\\n Point pro = projection(b, a.p);\\n Real nor = (a.p - pro).norm();\\n int sign = sgn(a.r - sqrt(nor));\\n if (sign == -1) return {};\\n if (sign == 0) return {pro};\\n Point v = (b.t - b.s).unit_vector() * sqrt(a.r * a.r - nor);\\n return {pro + v, pro - v};\\n }\\n vector<Point> intersection(const Circle &a, const Segment &b) {\\n if (!has_intersected(a, b)) return {};\\n vector<Point> res = intersection(a, Line(b.s, b.t));\\n if (sgn(distance(a.p, b.s) - a.r) != -1 && sgn(distance(a.p, b.t) - a.r) != -1) return res;\\n return {sgn(dot(res[0] - b.s, res[0] - b.t)) == 1 ? res[1] : res[0]};\\n }\\n vector<Point> intersection(const Circle &a, const Circle &b) {\\n int sz = sizeof_common_tangent(a, b);\\n if (sz == 0 || sz == 4) return {};\\n Real alpha = (b.p - a.p).arg();\\n if (sz == 1 || sz == 3) return {Point(a.p.x + a.r * cos(alpha), a.p.y + a.r * sin(alpha))};\\n Real dist = (b.p - a.p).norm(), beta = acos((dist + a.r * a.r - b.r * b.r) / (2 * sqrt(dist) * a.r));\\n return {a.p + Point(a.r * cos(alpha + beta), a.r * sin(alpha + beta)), a.p + Point(a.r * cos(alpha - beta), a.r * sin(alpha - beta))};\\n }\\n\\n Real distance(const Point &a, const Point &b) { return (b - a).abs(); }\\n Real distance(const Segment &a, const Point &b) {\\n Point foot = projection(a, b);\\n return has_intersected(a, foot) ? distance(foot, b) : min(distance(a.s, b), distance(a.t, b));\\n }\\n Real distance(const Segment &a, const Segment &b) { return has_intersected(a, b) ? 0 : min({distance(a, b.s), distance(a, b.t), distance(b, a.s), distance(b, a.t)}); }\\n Real distance(const Line &a, const Point &b) { return distance(projection(a, b), b); }\\n Real distance(const Line &a, const Segment &b) { return has_intersected(a, b) ? 0 : min(distance(a, b.s), distance(a, b.t)); }\\n Real distance(const Line &a, const Line &b) { return has_intersected(a, b) ? 0 : distance(a, b.s); }\\n\\n vector<Point> tangency(const Circle &a, const Point &b) {\\n Real dist = distance(a.p, b);\\n int sign = sgn(dist - a.r);\\n if (sign == -1) return {};\\n if (sign == 0) return {b};\\n Real alpha = (b - a.p).arg(), beta = acos(a.r / dist);\\n return {a.p + Point(a.r * cos(alpha + beta), a.r * sin(alpha + beta)), a.p + Point(a.r * cos(alpha - beta), a.r * sin(alpha - beta))};\\n }\\n int sizeof_common_tangent(const Circle &a, const Circle &b) {\\n Real dist = distance(a.p, b.p);\\n int sign = sgn(a.r + b.r - dist);\\n if (sign == -1) return 4;\\n if (sign == 0) return 3;\\n sign = sgn((sgn(a.r - b.r) == -1 ? b.r - a.r : a.r - b.r) - dist);\\n if (sign == -1) return 2;\\n if (sign == 0) return 1;\\n return 0;\\n }\\n vector<Line> common_tangent(const Circle &a, const Circle &b) {\\n vector<Line> tangents;\\n Real dist = distance(a.p, b.p), argument = (b.p - a.p).arg();\\n int sign = sgn(a.r + b.r - dist);\\n if (sign == -1) {\\n Real ac = acos((a.r + b.r) / dist), alpha = argument + ac, cs = cos(alpha), sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\\n alpha = argument - ac; cs = cos(alpha); sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\\n } else if (sign == 0) {\\n Point s = a.p + Point(a.r * cos(argument), a.r * sin(argument));\\n tangents.emplace_back(s, s + (b.p - a.p).normal_unit_vector().first);\\n }\\n if (sgn(b.r - a.r) == -1) {\\n sign = sgn(a.r - b.r - dist);\\n if (sign == -1) {\\n Real at = acos((a.r - b.r) / dist), alpha = argument + at, cs = cos(alpha), sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(b.r * cs, b.r * sn));\\n alpha = argument - at; cs = cos(alpha); sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(a.r * cs, a.r * sn), b.p + Point(b.r * cs, b.r * sn));\\n } else if (sign == 0) {\\n Point s = a.p + Point(a.r * cos(argument), a.r * sin(argument));\\n tangents.emplace_back(s, s + (b.p - a.p).normal_unit_vector().first);\\n }\\n } else {\\n sign = sgn(b.r - a.r - dist);\\n if (sign == -1) {\\n Real at = acos((b.r - a.r) / dist), alpha = argument - at, cs = cos(alpha), sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(-a.r * cs, -a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\\n alpha = argument + at; cs = cos(alpha); sn = sin(alpha);\\n tangents.emplace_back(a.p + Point(-a.r * cs, -a.r * sn), b.p + Point(-b.r * cs, -b.r * sn));\\n } else if (sign == 0) {\\n Point s = b.p + Point(-b.r * cos(argument), -b.r * sin(argument));\\n tangents.emplace_back(s, s + (a.p - b.p).normal_unit_vector().first);\\n }\\n }\\n return tangents;\\n }\\n\\n Real intersection_area(const Circle &a, const Circle &b) {\\n Real nor = (b.p - a.p).norm(), dist = sqrt(nor);\\n if (sgn(a.r + b.r - dist) != 1) return 0;\\n if (sgn(abs(a.r - b.r) - dist) != -1) return min(a.r, b.r) * min(a.r, b.r) * M_PI;\\n Real alpha = acos((nor + a.r * a.r - b.r * b.r) / (2 * dist * a.r)), beta = acos((nor + b.r * b.r - a.r * a.r) / (2 * dist * b.r));\\n return (alpha - sin(alpha + alpha) * 0.5) * a.r * a.r + (beta - sin(beta + beta) * 0.5) * b.r * b.r;\\n }\\n\\n using Polygon = vector<Point>;\\n\\n Real area(const Polygon &a) {\\n int n = a.size();\\n Real res = 0;\\n REP(i, n) res += cross(a[i], a[(i + 1) % n]);\\n return res * 0.5;\\n }\\n\\n Point centroid(const Polygon &a) {\\n Point res(0, 0);\\n int n = a.size();\\n Real den = 0;\\n REP(i, n) {\\n Real cro = cross(a[i], a[(i + 1) % n]);\\n res += (a[i] + a[(i + 1) % n]) / 3 * cro;\\n den += cro;\\n }\\n return res / den;\\n }\\n\\n int is_contained(const Polygon &a, const Point &b) {\\n int n = a.size();\\n bool is_in = false;\\n REP(i, n) {\\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\\n if (sgn(q.y - p.y) == -1) swap(p, q);\\n int sign = sgn(cross(p, q));\\n if (sign == 1 && sgn(p.y) != 1 && sgn(q.y) == 1) is_in = !is_in;\\n if (sign == 0 && sgn(dot(p, q)) != 1) return 1;\\n }\\n return is_in ? 2 : 0;\\n }\\n\\n bool is_convex(const Polygon &a) {\\n int n = a.size();\\n REP(i, n) {\\n if (ccw(a[(i - 1 + n) % n], a[i], a[(i + 1) % n]) == -1) return false;\\n }\\n return true;\\n }\\n\\n Polygon monotone_chain(vector<Point> ps, bool tight = true) {\\n sort(ALL(ps));\\n int n = ps.size(), idx = 0;\\n Polygon convex_hull(n << 1);\\n for (int i = 0; i < n; convex_hull[idx++] = ps[i++]) {\\n while (idx >= 2 && sgn(cross(convex_hull[idx - 1] - convex_hull[idx - 2], ps[i] - convex_hull[idx - 1])) < tight) --idx;\\n }\\n for (int i = n - 2, border = idx + 1; i >= 0; convex_hull[idx++] = ps[i--]) {\\n while (idx >= border && sgn(cross(convex_hull[idx - 1] - convex_hull[idx - 2], ps[i] - convex_hull[idx - 1])) < tight) --idx;\\n }\\n convex_hull.resize(idx - 1);\\n return convex_hull;\\n }\\n\\n Polygon cut_convex(const Polygon &a, const Line &b) {\\n int n = a.size();\\n Polygon res;\\n REP(i, n) {\\n int c = ccw(b.s, b.t, a[i]);\\n if (c != -1) res.emplace_back(a[i]);\\n if (c * ccw(b.s, b.t, a[(i + 1) % n]) == -1) res.emplace_back(intersection(Line(a[i], a[(i + 1) % n]), b));\\n }\\n if (res.size() < 3) res.clear();\\n return res;\\n }\\n\\n pair<Point, Point> rotating_calipers(const Polygon &a) {\\n int n = a.size(), high = 0, low = 0;\\n if (n <= 2) {\\n assert(n == 2);\\n return {a[0], a[1]};\\n }\\n FOR(i, 1, n) {\\n if (a[i].y > a[high].y) high = i;\\n if (a[i].y < a[low].y) low = i;\\n }\\n Real max_norm = (a[high] - a[low]).norm();\\n int i = high, j = low, max_i = i, max_j = j;\\n do {\\n ((sgn(cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j])) != -1 ? j : i) += 1) %= n;\\n Real tmp = (a[j] - a[i]).norm();\\n if (sgn(tmp - max_norm) == 1) {\\n max_norm = tmp;\\n max_i = i; max_j = j;\\n }\\n } while (i != high || j != low);\\n return {a[max_i], a[max_j]};\\n }\\n}\\n\\nusing namespace Geometry;\\n\\nint main() {\\n int n, k; cin >> n >> k;\\n vector<Circle> people;\\n REP(_, n) {\\n Point p; double r; cin >> p >> r;\\n people.emplace_back(p, r);\\n }\\n vector<double> l(n), r(n), comp;\\n REP(i, n) {\\n vector<Point> t = tangency(people[i], Point(0, 0));\\n l[i] = t[0].arg(); r[i] = t[1].arg();\\n if (l[i] > r[i]) swap(l[i], r[i]);\\n if (r[i] > M_PI && has_intersected(people[i], Segment(Point(0, 0), Point(2415, 0)))) {\\n swap(l[i], r[i]);\\n l[i] = 0;\\n } else {\\n chmax(l[i], 0);\\n chmin(r[i], M_PI);\\n }\\n if (l[i] < M_PI) {\\n comp.emplace_back(l[i]);\\n comp.emplace_back(r[i]);\\n }\\n }\\n vector<bool> use(n, true);\\n REP(i, n) {\\n if (l[i] >= M_PI) use[i] = false;\\n REP(j, n) {\\n if (j != i && l[i] <= l[j] && r[j] <= r[i]) use[j] = false;\\n }\\n }\\n vector<pair<double, double>> ball;\\n REP(i, n) {\\n if (use[i]) ball.emplace_back(l[i], r[i]);\\n }\\n n = ball.size();\\n sort(ALL(ball));\\n // REP(i, n) cout << ball[i].first << ' ' << ball[i].second << '\\\\n';\\n vector<vector<vector<double>>> dp(n, vector<vector<double>>(k + 1, vector<double>(2, -INF)));\\n dp[0][0][false] = 0;\\n dp[0][1][true] = ball[0].second - ball[0].first;\\n FOR(i, 1, n) {\\n double left, right; tie(left, right) = ball[i];\\n int x = i - 1;\\n while (x >= 0 && ball[i].first <= ball[x].second) --x;\\n ++x;\\n chmin(x, i - 1);\\n REP(j, k + 1) {\\n if (j + 1 <= k) {\\n chmax(dp[i][j + 1][true], dp[x][j][true] + right - max(ball[x].second, left));\\n chmax(dp[i][j + 1][true], dp[x][j][false] + right - left);\\n }\\n chmax(dp[i][j][false], max(dp[i - 1][j][false], dp[i - 1][j][true]));\\n }\\n }\\n double ans = 0;\\n REP(y, k + 1) REP(z, 2) chmax(ans, dp[n - 1][y][z]);\\n cout << ans / M_PI << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.8028169014084507,\n \"time_ms\": 40,\n \"memory_kb\": 47752,\n \"score_of_the_acc\": -0.2978,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2276_4329154\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 1505\\n\\nstruct Point{\\n Point(double arg_x,double arg_y){\\n x = arg_x;\\n y = arg_y;\\n }\\n\\n Point(){\\n x = y = 0.0;\\n }\\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 a){ return Point(a*x,a*y); }\\n Point operator / (double a){ return Point(x/a,y/a); }\\n\\n double abs(){ return sqrt(norm()); }\\n double norm(){ return x*x + y*y; }\\n\\n bool operator<(const Point &p) const{\\n return x != p.x? x < p.x: y < p.y;\\n }\\n\\n bool operator == (const Point &p) const{\\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n }\\n\\n double x,y;\\n};\\n\\ntypedef Point Vector;\\n\\nstruct Sphere{\\n Point center;\\n double r;\\n};\\n\\ntypedef Sphere Circle;\\n\\nstruct Line{\\npublic:\\n Point p[2];\\n Line(Point p1,Point p2){\\n p[0] = p1;\\n p[1] = p2;\\n }\\n Line(){\\n\\n }\\n};\\n\\nstruct Info{\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\treturn left > arg.left;\\n\\t}\\n\\tdouble left,right;\\n};\\n\\nint N,K;\\nint most_L[SIZE];\\nvector<Info> work,V;\\ndouble dp1[SIZE][SIZE],dp2[SIZE][SIZE];\\nCircle circle[SIZE];\\n\\n\\ndouble NUM = 10000;\\n\\ndouble norm(Vector a){\\n return a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n return 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\\nPoint project(Line l,Point p){\\n\\n Vector base = l.p[1]-l.p[0];\\n double r = dot(p-l.p[0],base)/norm(base);\\n return l.p[0]+base*r;\\n}\\n\\n//円と直線の交点を求める関数\\nvector<Point> getCrossPoints(Circle c,Line l){\\n\\n vector<Point> ret;\\n\\n Vector pr = project(l,c.center);\\n Vector e = (l.p[1]-l.p[0])/abs(l.p[1]-l.p[0]);\\n\\n double base;\\n\\n if(fabs(c.r*c.r-norm(pr-c.center)) < EPS){\\n\\n base = 0;\\n }else{\\n base = sqrt(c.r*c.r-norm(pr-c.center));\\n }\\n\\n ret.push_back(Point(pr+e*base));\\n ret.push_back(Point(pr-e*base));\\n\\n return ret;\\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\\nint calc_area(double deg){\\n\\n\\tif(deg >= 0 && deg <= 90){\\n\\n\\t\\treturn 1;\\n\\t}else if(deg <= 180){\\n\\n\\t\\treturn 2;\\n\\t}else if(deg <= 270){\\n\\n\\t\\treturn 3;\\n\\t}else{\\n\\n\\t\\treturn 4;\\n\\t}\\n}\\n\\nint main(){\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tscanf(\\\"%d %d\\\",&N,&K);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf\\\",&circle[i].center.x,&circle[i].center.y,&circle[i].r);\\n\\t\\tif(calc_dist(base,circle[i].center) < circle[i].r){\\n\\n\\t\\t\\tprintf(\\\"1.0\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\tint area1,area2;\\n\\n\\tLine line = Line(Point(0,-10000),Point(0,10000));\\n\\n\\tvector<Point> P;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tdouble angle1 = atan2(circle[i].center.y,circle[i].center.x)*(180/M_PI);\\n\\t\\tif(angle1 < 0){\\n\\n\\t\\t\\tangle1 += 360;\\n\\t\\t}\\n\\t\\tdouble angle2 = asin(circle[i].r/abs(circle[i].center))*(180/M_PI);\\n\\t\\tif(angle2 < 0){\\n\\n\\t\\t\\tangle2 += 360;\\n\\t\\t}\\n\\n\\t\\tdouble deg1 = angle1+angle2;\\n\\t\\tif(deg1 >= 360){\\n\\n\\t\\t\\tdeg1 -= 360;\\n\\t\\t}\\n\\n\\t\\tdouble deg2 = angle1-angle2;\\n\\t\\tif(deg2 < 0){\\n\\n\\t\\t\\tdeg2 += 360;\\n\\t\\t}\\n\\n\\t\\tarea1 = calc_area(deg1);\\n\\t\\tarea2 = calc_area(deg2);\\n\\n\\n\\t\\tif(area1 != 1 && area2 != 1 && area1 !=2 && area2 != 2)continue;\\n\\n\\t\\tif(area1 > area2){\\n\\t\\t\\tswap(area1,area2);\\n\\t\\t\\tswap(deg1,deg2);\\n\\t\\t}\\n\\n\\t\\tInfo info;\\n\\t\\tinfo.right = deg1;\\n\\n\\t\\tif(area1 == 1){\\n\\n\\t\\t\\tswitch(area2){\\n\\t\\t\\tcase 1:\\n\\t\\t\\tcase 2:\\n\\t\\t\\t\\tinfo.left = deg2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 3:\\n\\t\\t\\t\\tP = getCrossPoints(circle[i],line); //注意\\n\\n\\t\\t\\t\\tif(P[0].y > 0 && P[1].y > 0){\\n\\n\\t\\t\\t\\t\\tinfo.left = 180;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tinfo.left = 0;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 4:\\n\\t\\t\\t\\tinfo.left = 0;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //area1 == 2\\n\\n\\t\\t\\tswitch(area2){\\n\\t\\t\\tcase 2:\\n\\t\\t\\t\\tinfo.left = deg2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 3:\\n\\t\\t\\t\\tinfo.left = 180;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 4:\\n\\t\\t\\t\\tP = getCrossPoints(circle[i],line); //注意\\n\\n\\t\\t\\t\\tif(P[0].y > 0 && P[1].y > 0){\\n\\n\\t\\t\\t\\t\\tinfo.left = 0;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tinfo.left = 180;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(info.right > info.left){\\n\\n\\t\\t\\tswap(info.left,info.right);\\n\\t\\t}\\n\\t\\twork.push_back(info);\\n\\t}\\n\\n\\tbool FLG;\\n\\t//他でカバーできる接線のペアは除く\\n\\tfor(int i = 0; i < work.size(); i++){\\n\\t\\tFLG = false;\\n\\t\\tfor(int k = i+1; k < work.size(); k++){\\n\\t\\t\\tif(k == i)continue;\\n\\n\\t\\t\\tif(work[k].left >= work[i].left && work[k].right <= work[i].right){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!FLG){\\n\\n\\t\\t\\tV.push_back(work[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tsort(V.begin(),V.end()); //leftの降順\\n\\n\\tfor(int i = 0; i < V.size(); i++){\\n\\t\\tmost_L[i] = -1;\\n\\t\\tfor(int k = 0; k < i; k++){\\n\\t\\t\\tif(V[k].right > V[i].left+EPS)continue;\\n\\n\\t\\t\\tmost_L[i] = k;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i <= K; i++){\\n\\t\\tfor(int k = 0; k <= V.size(); k++){\\n\\t\\t\\tdp1[i][k] = 0;\\n\\t\\t\\tdp2[i][k] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\tdouble maximum = 0;\\n\\n\\tfor(int i = 1; i <= K; i++){ //使用個数\\n\\t\\tfor(int k = 1; k <= V.size(); k++){ //最後のindex(本来のindex+1)\\n\\t\\t\\tif(most_L[k-1] == -1){\\n\\n\\t\\t\\t\\tdp1[i][k] = dp2[i-1][k-1]+V[k-1].left-V[k-1].right;\\n\\n\\t\\t\\t}else{ //重なりを持つ区間あり\\n\\n\\t\\t\\t\\tdp1[i][k] = max(dp1[i-1][most_L[k-1]+1]+V[most_L[k-1]].right-V[k-1].right,\\n\\t\\t\\t\\t\\t\\tdp2[i-1][most_L[k-1]]+V[k-1].left-V[k-1].right);\\n\\t\\t\\t}\\n\\t\\t\\tdp2[i][k] = max(dp1[i][k],dp2[i][k-1]);\\n\\n\\t\\t\\tmaximum = max(maximum,dp2[i][k]);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",maximum/180.0);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 39032,\n \"score_of_the_acc\": -0.1731,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2276_4329153\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 1505\\n\\nstruct Point{\\n Point(double arg_x,double arg_y){\\n x = arg_x;\\n y = arg_y;\\n }\\n\\n Point(){\\n x = y = 0.0;\\n }\\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 a){ return Point(a*x,a*y); }\\n Point operator / (double a){ return Point(x/a,y/a); }\\n\\n double abs(){ return sqrt(norm()); }\\n double norm(){ return x*x + y*y; }\\n\\n bool operator<(const Point &p) const{\\n return x != p.x? x < p.x: y < p.y;\\n }\\n\\n bool operator == (const Point &p) const{\\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n }\\n\\n double x,y;\\n};\\n\\ntypedef Point Vector;\\n\\nstruct Sphere{\\n Point center;\\n double r;\\n};\\n\\ntypedef Sphere Circle;\\n\\nstruct Line{\\npublic:\\n Point p[2];\\n Line(Point p1,Point p2){\\n p[0] = p1;\\n p[1] = p2;\\n }\\n Line(){\\n\\n }\\n};\\n\\nstruct Info{\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\treturn left > arg.left;\\n\\t}\\n\\tdouble left,right;\\n};\\n\\nint N,K;\\nint most_L[SIZE];\\nvector<Info> work,V;\\ndouble dp1[SIZE][SIZE],dp2[SIZE][SIZE];\\nCircle circle[SIZE];\\n\\n\\ndouble NUM = 10000;\\n\\ndouble norm(Vector a){\\n return a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n return 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\\nPoint project(Line l,Point p){\\n\\n Vector base = l.p[1]-l.p[0];\\n double r = dot(p-l.p[0],base)/norm(base);\\n return l.p[0]+base*r;\\n}\\n\\n//円と直線の交点を求める関数\\nvector<Point> getCrossPoints(Circle c,Line l){\\n\\n vector<Point> ret;\\n\\n Vector pr = project(l,c.center);\\n Vector e = (l.p[1]-l.p[0])/abs(l.p[1]-l.p[0]);\\n\\n double base;\\n\\n if(fabs(c.r*c.r-norm(pr-c.center)) < EPS){\\n\\n base = 0;\\n }else{\\n base = sqrt(c.r*c.r-norm(pr-c.center));\\n }\\n\\n ret.push_back(Point(pr+e*base));\\n ret.push_back(Point(pr-e*base));\\n\\n return ret;\\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\\nint calc_area(double deg){\\n\\n\\tif(deg >= 0 && deg <= 90){\\n\\n\\t\\treturn 1;\\n\\t}else if(deg <= 180){\\n\\n\\t\\treturn 2;\\n\\t}else if(deg <= 270){\\n\\n\\t\\treturn 3;\\n\\t}else{\\n\\n\\t\\treturn 4;\\n\\t}\\n}\\n\\n\\n//第1,第2象限の角度を求める\\ndouble calc_angle(Vector vec){\\n\\n\\tif(fabs(vec.x) < EPS){\\n\\n\\t\\treturn 90;\\n\\t}\\n\\tdouble ret = atan(fabs(vec.y)/fabs(vec.x))*(180/M_PI);\\n\\n\\tif(vec.x < 0){\\n\\n\\t\\tret = 180-ret;\\n\\t}\\n\\treturn ret;\\n}\\n\\n\\n\\nint main(){\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tscanf(\\\"%d %d\\\",&N,&K);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf\\\",&circle[i].center.x,&circle[i].center.y,&circle[i].r);\\n\\t\\tif(calc_dist(base,circle[i].center) < circle[i].r){\\n\\n\\t\\t\\tprintf(\\\"1.0\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\tint area1,area2;\\n\\n\\tLine line = Line(Point(0,-10000),Point(0,10000));\\n\\n\\tvector<Point> P;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tdouble angle1 = atan2(circle[i].center.y,circle[i].center.x)*(180/M_PI);\\n\\t\\tif(angle1 < 0){\\n\\n\\t\\t\\tangle1 += 360;\\n\\t\\t}\\n\\t\\tdouble angle2 = asin(circle[i].r/abs(circle[i].center))*(180/M_PI);\\n\\t\\tif(angle2 < 0){\\n\\n\\t\\t\\tangle2 += 360;\\n\\t\\t}\\n\\n\\t\\tdouble deg1 = angle1+angle2;\\n\\t\\tif(deg1 >= 360){\\n\\n\\t\\t\\tdeg1 -= 360;\\n\\t\\t}\\n\\n\\t\\tdouble deg2 = angle1-angle2;\\n\\t\\tif(deg2 < 0){\\n\\n\\t\\t\\tdeg2 += 360;\\n\\t\\t}\\n\\n\\t\\tarea1 = calc_area(deg1);\\n\\t\\tarea2 = calc_area(deg2);\\n\\n\\n\\t\\tif(area1 != 1 && area2 != 1 && area1 !=2 && area2 != 2)continue;\\n\\n\\t\\tif(area1 > area2){\\n\\t\\t\\tswap(area1,area2);\\n\\t\\t\\tswap(deg1,deg2);\\n\\t\\t}\\n\\n\\t\\tInfo info;\\n\\t\\tinfo.right = deg1;\\n\\n\\t\\tif(area1 == 1){\\n\\n\\t\\t\\tswitch(area2){\\n\\t\\t\\tcase 1:\\n\\t\\t\\tcase 2:\\n\\t\\t\\t\\tinfo.left = deg2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 3:\\n\\t\\t\\t\\tP = getCrossPoints(circle[i],line);\\n\\n\\t\\t\\t\\tif(P[0].y > 0 && P[1].y > 0){\\n\\n\\t\\t\\t\\t\\tinfo.left = 180;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tinfo.left = 0;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 4:\\n\\t\\t\\t\\tinfo.left = 0;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //area1 == 2\\n\\n\\t\\t\\tswitch(area2){\\n\\t\\t\\tcase 2:\\n\\t\\t\\t\\tinfo.left = deg2;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 3:\\n\\t\\t\\t\\tinfo.left = 180;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase 4:\\n\\t\\t\\t\\tP = getCrossPoints(circle[i],line);\\n\\n\\t\\t\\t\\tif(P[0].y > 0 && P[1].y > 0){\\n\\n\\t\\t\\t\\t\\tinfo.left = 0;\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tinfo.left = 180;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(info.right > info.left){\\n\\n\\t\\t\\tswap(info.left,info.right);\\n\\t\\t}\\n\\t\\twork.push_back(info);\\n\\t}\\n\\n\\tbool FLG;\\n\\t//他でカバーできる接線のペアは除く\\n\\tfor(int i = 0; i < work.size(); i++){\\n\\t\\tFLG = false;\\n\\t\\tfor(int k = i+1; k < work.size(); k++){\\n\\t\\t\\tif(k == i)continue;\\n\\n\\t\\t\\tif(work[k].left >= work[i].left && work[k].right <= work[i].right){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!FLG){\\n\\n\\t\\t\\tV.push_back(work[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tsort(V.begin(),V.end()); //leftの降順\\n\\n\\tfor(int i = 0; i < V.size(); i++){\\n\\t\\tmost_L[i] = -1;\\n\\t\\tfor(int k = 0; k < i; k++){\\n\\t\\t\\tif(V[k].right > V[i].left+EPS)continue;\\n\\n\\t\\t\\tmost_L[i] = k;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i <= K; i++){\\n\\t\\tfor(int k = 0; k <= V.size(); k++){\\n\\t\\t\\tdp1[i][k] = 0;\\n\\t\\t\\tdp2[i][k] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\tdouble maximum = 0;\\n\\n\\tfor(int i = 1; i <= K; i++){ //使用個数\\n\\t\\tfor(int k = 1; k <= V.size(); k++){ //最後のindex(本来のindex+1)\\n\\t\\t\\tif(most_L[k-1] == -1){\\n\\n\\t\\t\\t\\tdp1[i][k] = dp2[i-1][k-1]+V[k-1].left-V[k-1].right;\\n\\n\\t\\t\\t}else{ //重なりを持つ区間あり\\n\\n\\t\\t\\t\\tdp1[i][k] = max(dp1[i-1][most_L[k-1]+1]+V[most_L[k-1]].right-V[k-1].right,\\n\\t\\t\\t\\t\\t\\tdp2[i-1][most_L[k-1]]+V[k-1].left-V[k-1].right);\\n\\t\\t\\t}\\n\\t\\t\\tdp2[i][k] = max(dp1[i][k],dp2[i][k-1]);\\n\\n\\t\\t\\tmaximum = max(maximum,dp2[i][k]);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",maximum/180.0);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 39064,\n \"score_of_the_acc\": -0.1734,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2276_4329029\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 1505\\n\\nstruct Point{\\n Point(double arg_x,double arg_y){\\n x = arg_x;\\n y = arg_y;\\n }\\n\\n Point(){\\n x = y = 0.0;\\n }\\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 a){ return Point(a*x,a*y); }\\n Point operator / (double a){ return Point(x/a,y/a); }\\n\\n double abs(){ return sqrt(norm()); }\\n double norm(){ return x*x + y*y; }\\n\\n bool operator<(const Point &p) const{\\n return x != p.x? x < p.x: y < p.y;\\n }\\n\\n bool operator == (const Point &p) const{\\n return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n }\\n\\n double x,y;\\n};\\n\\ntypedef Point Vector;\\n\\nstruct Sphere{\\n Point center;\\n double r;\\n};\\n\\ntypedef Sphere Circle;\\n\\nstruct Line{\\npublic:\\n Point p[2];\\n Line(Point p1,Point p2){\\n p[0] = p1;\\n p[1] = p2;\\n }\\n Line(){\\n\\n }\\n};\\n\\nstruct Info{\\n\\tbool operator<(const struct Info &arg) const{\\n\\n\\t\\treturn left > arg.left;\\n\\t}\\n\\tdouble left,right;\\n};\\n\\nint N,K;\\nint most_L[SIZE];\\nvector<Info> work,V;\\ndouble dp1[SIZE][SIZE],dp2[SIZE][SIZE];\\nCircle circle[SIZE];\\n\\n\\ndouble NUM = 10000;\\n\\ndouble norm(Vector a){\\n return a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n return sqrt(norm(a));\\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\\nint main(){\\n\\n\\tPoint base = Point(0,0);\\n\\n\\tscanf(\\\"%d %d\\\",&N,&K);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf %lf\\\",&circle[i].center.x,&circle[i].center.y,&circle[i].r);\\n\\t\\tif(calc_dist(base,circle[i].center) < circle[i].r){\\n\\n\\t\\t\\tprintf(\\\"1.0\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tdouble theta1 = atan2(circle[i].center.y,circle[i].center.x);\\n\\t\\tdouble theta2 = asin(circle[i].r/abs(circle[i].center));\\n\\n\\t\\tInfo info;\\n\\t\\tinfo.right = theta1-theta2;\\n\\t\\tinfo.left = theta1+theta2;\\n\\n\\t\\tif(info.right < -(M_PI+EPS)){\\n\\n\\t\\t\\tinfo.left += 2*M_PI;\\n\\t\\t\\tinfo.right += 2*M_PI;\\n\\t\\t}\\n\\n\\t\\tinfo.right = max(info.right,0.0);\\n\\t\\tinfo.left = min(info.left,M_PI);\\n\\n\\t\\tif(info.right+EPS > info.left){\\n\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\twork.push_back(info);\\n\\t}\\n\\n\\tbool FLG;\\n\\t//他でカバーできる接線のペアは除く\\n\\tfor(int i = 0; i < work.size(); i++){\\n\\t\\tFLG = false;\\n\\t\\tfor(int k = i+1; k < work.size(); k++){\\n\\t\\t\\tif(k == i)continue;\\n\\n\\t\\t\\tif(work[k].left >= work[i].left && work[k].right <= work[i].right){\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!FLG){\\n\\n\\t\\t\\tV.push_back(work[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tsort(V.begin(),V.end()); //leftの降順\\n\\n\\tfor(int i = 0; i < V.size(); i++){\\n\\t\\tmost_L[i] = -1;\\n\\t\\tfor(int k = 0; k < i; k++){\\n\\t\\t\\tif(V[k].right > V[i].left+EPS)continue;\\n\\n\\t\\t\\tmost_L[i] = k;\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i <= K; i++){\\n\\t\\tfor(int k = 0; k <= V.size(); k++){\\n\\t\\t\\tdp1[i][k] = 0;\\n\\t\\t\\tdp2[i][k] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\tdouble maximum = 0;\\n\\n\\tfor(int i = 1; i <= K; i++){ //使用個数\\n\\t\\tfor(int k = 1; k <= V.size(); k++){ //最後のindex(本来のindex+1)\\n\\t\\t\\tif(most_L[k-1] == -1){\\n\\n\\t\\t\\t\\tdp1[i][k] = dp2[i-1][k-1]+V[k-1].left-V[k-1].right;\\n\\n\\t\\t\\t}else{ //重なりを持つ区間あり\\n\\n\\t\\t\\t\\tdp1[i][k] = max(dp1[i-1][most_L[k-1]+1]+V[most_L[k-1]].right-V[k-1].right,\\n\\t\\t\\t\\t\\t\\tdp2[i-1][most_L[k-1]]+V[k-1].left-V[k-1].right);\\n\\t\\t\\t}\\n\\t\\t\\tdp2[i][k] = max(dp1[i][k],dp2[i][k-1]);\\n\\n\\t\\t\\tmaximum = max(maximum,dp2[i][k]);\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",maximum/M_PI);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 39032,\n \"score_of_the_acc\": -0.1731,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2276_3919772\",\n \"code_snippet\": \"#pragma GCC optimize (\\\"O3\\\")\\n\\n#include <iostream>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <math.h>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <queue>\\n#include <set>\\n#include <algorithm>\\n#include <numeric>\\n#include <list>\\nusing namespace std;\\n\\nusing QWORD = uint64_t;\\nusing SQWORD = int64_t;\\nusing DWORD = uint32_t;\\nusing SDWORD = int32_t;\\nusing WORD = uint16_t;\\nusing SWORD = int16_t;\\nusing BYTE = uint8_t;\\nusing SBYTE = int8_t;\\nusing DOUBLE = double;\\nusing FLOAT = float;\\n\\n#define MIN_SDWORD (-2147483648)\\n#define MAX_SDWORD (2147483647)\\n#define MIN_SBYTE (-128)\\n#define MAX_SBYTE (127)\\n\\n#define MIN_SQWORD (0x8000000000000000)\\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\\n\\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\\n#define MAX_DWORD (0xFFFFFFFF)\\n#define MAX_WORD (0xFFFF)\\n#define MAX_BYTE (0xFF)\\n\\n#define MAX_DOUBLE (1.0e+308)\\n#define DOUBLE_EPS (1.0e-12)\\n#define MIN_DOUBLE_N (-1.0e+308)\\n\\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\\n\\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\\nstatic inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; };\\n\\n#define BYTE_BITS (8)\\n#define WORD_BITS (16)\\n#define DWORD_BITS (32)\\n#define QWORD_BITS (64)\\n\\n#define ANS_MOD (1000000007)\\n\\nstatic const DOUBLE d_PI = 3.14159265358979323846;\\n//static const DOUBLE d_PI = M_PI;\\n\\n\\nstatic inline bool DoubleIsEqual(DOUBLE a, DOUBLE b) {\\n return ABS(a-b) < DOUBLE_EPS;\\n}\\n\\nstatic inline void inputStringSpSeparated(char *pcStr)\\n{\\n char *pcCur = pcStr;\\n for (;;) {\\n char c = getchar();\\n if (('\\\\n' == c) || (EOF == c) || (' ' == c)) {\\n break;\\n }\\n *pcCur = c;\\n pcCur++;\\n }\\n *pcCur = '\\\\0';\\n}\\n\\nstatic inline void inputString(char *pcStr)\\n{\\n char *pcCur = pcStr;\\n for (;;) {\\n char c = getchar();\\n if (('\\\\n' == c) || (EOF == c)) {\\n break;\\n }\\n *pcCur = c;\\n pcCur++;\\n }\\n *pcCur = '\\\\0';\\n}\\n\\n\\nstatic inline SQWORD inputSQWORD(void)\\n{\\n SQWORD sqNumber = 0;\\n SQWORD sqMultiplier = 1;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n sqMultiplier = -1;\\n }\\n }\\n if (('0' <= c) && (c <= '9')) {\\n sqNumber *= 10LL;\\n sqNumber += (SQWORD)(c - '0');\\n bRead = true;\\n } else {\\n if (bRead) {\\n return sqNumber * sqMultiplier;\\n }\\n }\\n }\\n}\\n\\n\\nstatic inline SDWORD inputSDWORD(void)\\n{\\n SDWORD lNumber = 0;\\n SDWORD lMultiplier = 1;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n lMultiplier = -1;\\n }\\n }\\n if (('0' <= c) && (c <= '9')) {\\n lNumber *= 10;\\n lNumber += (c - '0');\\n bRead = true;\\n } else {\\n if (bRead) {\\n return lNumber * lMultiplier;\\n }\\n }\\n }\\n}\\n\\nstatic inline DOUBLE inputFP(void)\\n{\\n DOUBLE dInt = 0.0;\\n DOUBLE dFrac = 0.0;\\n DOUBLE dMultiplier = 1.0;\\n DWORD dwFpCnt = 0;\\n DOUBLE *pdCur = &dInt;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n dMultiplier = -1;\\n }\\n }\\n if ('.' == c) {\\n pdCur = &dFrac;\\n } else if (('0' <= c) && (c <= '9')) {\\n (*pdCur) *= 10;\\n (*pdCur) += (DOUBLE)(c - '0');\\n bRead = true;\\n if (pdCur == &dFrac) {\\n dwFpCnt++;\\n }\\n } else {\\n if (bRead) {\\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\\n }\\n }\\n }\\n}\\n\\n/*----------------------------------------------*/\\n/**\\n * mod による操作ライブラリ\\n */\\n#define ANS_MOD (1000000007)\\n\\nclass MODINT {\\n static SQWORD MOD;\\n SQWORD m_x;\\n\\npublic:\\n MODINT(SQWORD val) {\\n m_x = (val % MOD + MOD) % MOD;\\n };\\n MODINT() {\\n m_x = 0;\\n }\\n static void Init(SQWORD sqMod) {\\n MOD = sqMod;\\n }\\n\\n\\tMODINT& operator+= (const MODINT a)\\n {\\n m_x = (m_x + a.m_x) % MOD; \\n return *this;\\n };\\n\\tMODINT& operator-= (const MODINT a)\\n { \\n m_x = (m_x - a.m_x + MOD) % MOD; \\n return *this;\\n };\\n\\tMODINT& operator*= (const MODINT a)\\n {\\n m_x = (m_x * a.m_x) % MOD;\\n return *this;\\n };\\n MODINT pow(SQWORD t) const {\\n if (!t) return 1;\\n MODINT a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\tMODINT operator+ (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res += a);\\n\\t}\\n\\tMODINT operator- (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res -= a);\\n\\t}\\n\\tMODINT operator* (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res *= a);\\n\\t}\\n\\tMODINT operator/ (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res /= a);\\n\\t}\\n\\n /* 逆元 */\\n MODINT inv() const {\\n return pow(MOD-2);\\n }\\n\\n /* 除算 */\\n MODINT& operator/=(const MODINT a) {\\n return (*this) *= a.inv();\\n } \\n\\n /* 整数版 */\\n\\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\\n\\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\\n\\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\\n\\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\\n\\n SQWORD getVal() { return m_x; };\\n};\\nSQWORD MODINT::MOD = ANS_MOD;\\n\\n\\n/*----------------------------------------------*/\\n\\n#define EPS 1e-10\\nDOUBLE double_add(DOUBLE a, DOUBLE b) {\\n if (ABS(a + b) < EPS * (ABS(a) + ABS(b))) {\\n return 0;\\n }\\n return a+b;\\n}\\n\\nstruct VECTOR_2D {\\n DOUBLE dX;\\n DOUBLE dY;\\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\\n VECTOR_2D() : dX(0), dY(0) {};\\n\\n /* 加算 */\\n\\tVECTOR_2D& operator+= (const VECTOR_2D a)\\n { \\n dX = dX + a.dX;\\n dY = dY + a.dY;\\n return *this;\\n };\\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\\n\\t\\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \\n };\\n\\n /* 減算 */\\n\\tVECTOR_2D& operator-= (const VECTOR_2D a)\\n { \\n dX = dX - a.dX;\\n dY = dY - a.dY;\\n return *this;\\n };\\n const VECTOR_2D operator- (const VECTOR_2D a) const {\\n\\t\\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\\n };\\n\\n /* 定数倍 */\\n\\tVECTOR_2D& operator*= (const DOUBLE a)\\n { \\n dX = dX * a;\\n dY = dY * a;\\n return *this;\\n };\\n const VECTOR_2D operator* (const DOUBLE a) const {\\n\\t\\treturn VECTOR_2D(dX * a, dY * a); \\n };\\n\\n /* 比較 */\\n bool operator< (const VECTOR_2D &a) {\\n if (dX == a.dX) {\\n return (dY < a.dY);\\n }\\n return dX < a.dX;\\n }\\n\\n DOUBLE norm(void) const {\\n return (dX * dX + dY * dY);\\n }\\n\\n DOUBLE dist(void) const {\\n return sqrtl(norm());\\n }\\n\\n DOUBLE angle(void) const {\\n return atan2(dY, dX);\\n }\\n\\n DOUBLE dotproduct(const VECTOR_2D a) const {\\n return double_add(dX * a.dX, dY * a.dY);\\n }\\n\\n DOUBLE crossproduct(const VECTOR_2D a) const {\\n return double_add(dX * a.dY, -dY * a.dX);\\n }\\n};\\n\\n\\n\\n/*----------------------------------------------*/\\n\\nstruct BALL_ST {\\n DOUBLE dBegin;\\n DOUBLE dEnd;\\n\\n BALL_ST (DOUBLE b, DOUBLE e) : dBegin(b), dEnd(e) {};\\n}; \\n\\nbool cmpBegin (const BALL_ST &a, const BALL_ST &b) {\\n return a.dBegin < b.dBegin;\\n}\\n\\nbool cmpEnd (const BALL_ST &a, const BALL_ST &b) {\\n return a.dEnd < b.dEnd;\\n}\\n\\n/**\\n * 角度の扱い \\n */\\nstatic inline DOUBLE normalizeAngle(DOUBLE dAngle)\\n{\\n DOUBLE dRet = dAngle;\\n while (dRet < 0.0) {\\n dRet += (2.0 * d_PI);\\n }\\n\\n if (DoubleIsEqual(2.0 * d_PI, dAngle)) {\\n dRet = 0.0;\\n } else {\\n while ((2.0 * d_PI) <= dAngle) {\\n dRet -= (2.0 * d_PI);\\n }\\n }\\n\\n return dRet;\\n}\\n\\n#define MAX_N (1500)\\nint main(void)\\n{\\n SQWORD sqN = inputSQWORD();\\n SQWORD sqK = inputSQWORD();\\n\\n vector<BALL_ST> vecBalls;\\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\\n SQWORD sqX = inputSQWORD();\\n SQWORD sqY = inputSQWORD();\\n SQWORD sqR = inputSQWORD();\\n\\n VECTOR_2D stVec((DOUBLE)sqX, (DOUBLE)sqY);\\n DOUBLE dAngle = stVec.angle();\\n DOUBLE dDist = stVec.dist();\\n DOUBLE dRange = asin((DOUBLE)sqR / dDist);\\n\\n DOUBLE dTheta1 = dAngle - dRange;\\n DOUBLE dTheta2 = dAngle + dRange;\\n \\n dTheta1 = normalizeAngle(dTheta1);\\n dTheta2 = normalizeAngle(dTheta2);\\n\\n DOUBLE dBegin, dEnd;\\n\\n if (d_PI <= dTheta1 && d_PI <= dTheta2) {\\n dBegin = 0.0;\\n dEnd = 0.0;\\n } else if (d_PI <= dTheta1) {\\n dBegin = 0.0;\\n dEnd = dTheta2;\\n } else if (d_PI <= dTheta2){\\n dBegin = dTheta1;\\n dEnd = d_PI;\\n } else {\\n dBegin = dTheta1;\\n dEnd = dTheta2;\\n }\\n// printf(\\\"%f %f\\\\n\\\", dBegin, dEnd);\\n vecBalls.emplace_back(dBegin, dEnd);\\n }\\n sort(vecBalls.begin(), vecBalls.end(), cmpBegin);\\n\\t/* 含まれてしまうものは除く */\\n\\tint sqSz = 0;\\n\\tfor (int i = 0; i < sqN; i++) {\\n\\t\\tbool isIinJ = false;\\n\\t\\tfor (int j = 1; j <= sqN; j++) {\\n\\t\\t\\tif (i == j) continue;\\n\\t\\t\\tif ((vecBalls[j].dBegin < vecBalls[i].dBegin) && (vecBalls[i].dEnd < vecBalls[j].dEnd)) {\\n\\t\\t\\t\\tisIinJ = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!isIinJ) {\\n\\t\\t\\tvecBalls[sqSz++] = vecBalls[i];\\n\\t\\t}\\n\\t}\\n// for (auto b: vecBalls) {\\n// printf(\\\":%f %f\\\\n\\\", b.dBegin, b.dEnd);\\n// }\\n\\n /**\\n * dp[j][k] 左端がk番目のボールで、\\n * j個を使っているときの最大の角度\\n * dp[j][k] = max(dp[j-1][0] + angle, dp[j-1][1] + angle, dp[j-1][2] + angle ,,,, dp[j-1][k-1] + angle)\\n * \\n */\\n static DOUBLE s_aadDpTbl[MAX_N + 1][MAX_N + 1];\\n for (SQWORD sqIdxJ = 0; sqIdxJ <= sqK; sqIdxJ++) {\\n for (SQWORD sqIdxK = 0; sqIdxK <= sqSz; sqIdxK++) {\\n s_aadDpTbl[sqIdxJ][sqIdxK] = 0.0;\\n }\\n }\\n\\n\\tdouble dAns = 0;\\n\\n\\tfor (int i = 1; i <= sqK; i++) {\\n\\t\\tfor (int j = 0; j < sqSz; j++) {\\n\\t\\t\\tdouble best = 0;\\n\\t\\t\\tint k = 0;\\n\\n\\t\\t\\twhile (vecBalls[k].dEnd < vecBalls[j].dBegin) {\\n\\t\\t\\t\\tbest = max(best, s_aadDpTbl[i-1][k]);\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t}\\n\\n// printf(\\\"--%d %f %f\\\\n\\\", j, vecBalls[j].dEnd, vecBalls[j].dBegin);\\n\\t\\t\\t\\n\\t\\t\\ts_aadDpTbl[i][j] = max(s_aadDpTbl[i][j], best + vecBalls[j].dEnd - vecBalls[j].dBegin);\\n\\t\\t\\ts_aadDpTbl[i][j] = max(s_aadDpTbl[i][j], s_aadDpTbl[i-1][k] + vecBalls[j].dEnd - vecBalls[k].dEnd);\\n\\t\\t\\tdAns = max(dAns, s_aadDpTbl[i][j]);\\n// printf(\\\"%f \\\", s_aadDpTbl[i][j]);\\n\\t\\t}\\n// printf(\\\"\\\\n\\\");\\n\\t}\\n\\n#if 0\\n DOUBLE dAns = 0.0;\\n for (SQWORD sqIdxJ = 0; sqIdxJ < sqK; sqIdxJ++) {\\n for (SQWORD sqIdxK = 0; sqIdxK < sz; sqIdxK++) {\\n DOUBLE dPrevEnd = vecBalls[sqIdxK].dEnd;\\n for (SQWORD sqNextBallIdx = sqIdxK + 1; sqNextBallIdx <= sz; sqNextBallIdx++) {\\n BALL_ST stBall = vecBalls[sqNextBallIdx];\\n DOUBLE dAddAngle = 0;\\n if (dPrevEnd <= stBall.dBegin) {\\n /* 重なってない */\\n dAddAngle = stBall.dEnd - stBall.dBegin;\\n// printf(\\\"> [%lld %lld %lld] %llf \\\", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \\n = MAX(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\\n } else {\\n /* 重なってる */\\n dAddAngle = stBall.dEnd - dPrevEnd;\\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \\n = MAX(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\\n// printf(\\\"< [%lld %lld %lld] %llf \\\", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\\n }\\n\\n dAns = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], dAns);\\n }\\n }\\n// printf(\\\"\\\\n\\\");\\n }\\n#endif\\n\\n printf(\\\"%0.11f\\\\n\\\", dAns / d_PI);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 21172,\n \"score_of_the_acc\": -0.4624,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2276_3917912\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <numeric>\\n#include <tuple>\\n#include <iomanip>\\n#include <assert.h>\\n\\n#define sqr(x) std::pow(x, 2.0)\\n#define INF 1e10\\n#define EPS 1e-10\\n#define REP(i, n) for (int i = 0; i < n; i++)\\n#define POS_OR_INF(x) (x > 0 ? x : INF)\\n\\nusing namespace std;\\n\\nusing ld = long double;\\n\\nstruct Point {\\n\\tPoint() = default;\\n\\tPoint(ld x, ld y) : x(x), y(y) {}\\n\\tPoint(const Point& s, const Point& e) : x(e.x - s.x), y(e.y - s.y) {}\\n\\n\\tPoint normalized(void) const {\\n\\t\\treturn Point(x / norm(), y / norm());\\n\\t}\\n\\n\\tld norm(void) const {\\n\\t\\treturn sqrt(x * x + y * y);\\n\\t}\\n\\n\\tPoint flipped(void) const {\\n\\t\\treturn Point(-x, -y);\\n\\t}\\n\\n\\tPoint normal_vector(bool normalize = false) const {\\n\\t\\tauto vec = Point(-y, x);\\n\\t\\treturn normalize ? vec.normalized() : vec;\\n\\t}\\n\\n\\tld x, y;\\n};\\n\\nusing Vector = Point;\\n\\ninline Vector points2vec(const Point& s, const Point& e) {\\n\\treturn Vector(e.x - s.x, e.y - s.y);\\n}\\n\\ninline ld distance(const Point& s, const Point& e) {\\n\\treturn points2vec(s, e).norm();\\n}\\n\\ninline ld distance_square(const Point& s, const Point& e) {\\n\\treturn pow(points2vec(s, e).norm(), 2.0);\\n}\\n\\ninline Vector operator * (const Vector& l, ld r) {\\n\\treturn Vector(l.x * r, l.y * r);\\n}\\n\\ninline Vector operator * (ld l, const Vector& r) {\\n\\treturn r * l;\\n}\\n\\ninline Vector operator / (const Vector& l, ld r) {\\n\\treturn Vector(l.x / r, l.y / r);\\n}\\n\\ninline Point operator + (const Point& l, const Point& r) {\\n\\treturn Point(l.x + r.x, l.y + r.y);\\n}\\n\\ninline Point operator - (const Point& l, const Point& r) {\\n\\treturn Point(l.x - r.x, l.y - r.y);\\n}\\n\\ninline istream& operator >> (istream& is, Point& p) {\\n\\treturn is >> p.x >> p.y;\\n}\\n\\nint main(int argc, char** argv) {\\n\\tint N, K;\\n\\n\\tcin >> N >> K;\\n\\tcout << fixed << setprecision(20);\\n\\n\\tvector<pair<double, double>> a(N), b;\\n\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tPoint p;\\n\\t\\tdouble r;\\n\\t\\tcin >> p >> r;\\n\\n\\t\\tdouble theta = asin(r/p.norm());\\n\\t\\tdouble rad = atan2(p.y, p.x);\\n\\n\\t\\tif (rad < -M_PI / 2) rad += 2 * M_PI;\\n\\n\\t\\ta[i].first = min(M_PI, max(0.0, rad - theta));\\n\\t\\ta[i].second = min(M_PI, max(0.0, rad + theta));\\n\\t}\\n\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tbool included = false;\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tif (a[i].first > a[j].first && a[i].second < a[j].second)\\n\\t\\t\\t\\tincluded = true;\\n\\t\\t}\\n\\t\\tif (!included) {\\n\\t\\t\\tb.push_back(a[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tsort(b.begin(), b.end());\\n\\n\\tint M = b.size();\\n\\n\\tvector<vector<double>> dp(K + 1, vector<double>(M + 1, 0));\\n\\tdouble ans = 0;\\n\\n\\tfor (int i = 1; i <= K; i++) {\\n\\t\\tfor (int j = 0; j < M; j++) {\\n\\t\\t\\tdouble best = 0;\\n\\t\\t\\tint k = 0;\\n\\n\\t\\t\\twhile (b[k].second < b[j].first) {\\n\\t\\t\\t\\tbest = max(best, dp[i-1][k]);\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tdp[i][j] = max(dp[i][j], best + b[j].second - b[j].first);\\n\\t\\t\\tdp[i][j] = max(dp[i][j], dp[i-1][k] + b[j].second - b[k].second);\\n\\t\\t\\tans = max(ans, dp[i][j]);\\n\\t\\t}\\n\\t}\\n\\n\\tcout << ans / M_PI;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 20612,\n \"score_of_the_acc\": -0.4714,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2276_3917801\",\n \"code_snippet\": \"#pragma GCC optimize (\\\"O3\\\")\\n\\n#include <iostream>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <math.h>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <queue>\\n#include <set>\\n#include <algorithm>\\n#include <numeric>\\n#include <list>\\nusing namespace std;\\n\\nusing QWORD = uint64_t;\\nusing SQWORD = int64_t;\\nusing DWORD = uint32_t;\\nusing SDWORD = int32_t;\\nusing WORD = uint16_t;\\nusing SWORD = int16_t;\\nusing BYTE = uint8_t;\\nusing SBYTE = int8_t;\\nusing DOUBLE = double;\\nusing FLOAT = float;\\n\\n#define MIN_SDWORD (-2147483648)\\n#define MAX_SDWORD (2147483647)\\n#define MIN_SBYTE (-128)\\n#define MAX_SBYTE (127)\\n\\n#define MIN_SQWORD (0x8000000000000000)\\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\\n\\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\\n#define MAX_DWORD (0xFFFFFFFF)\\n#define MAX_WORD (0xFFFF)\\n#define MAX_BYTE (0xFF)\\n\\n#define MAX_DOUBLE (1.0e+308)\\n#define DOUBLE_EPS (1.0e-12)\\n#define MIN_DOUBLE_N (-1.0e+308)\\n\\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\\n\\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\\nstatic inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; };\\n\\n#define BYTE_BITS (8)\\n#define WORD_BITS (16)\\n#define DWORD_BITS (32)\\n#define QWORD_BITS (64)\\n\\n#define ANS_MOD (1000000007)\\n\\nstatic const DOUBLE d_PI = 3.14159265358979323846;\\n\\nstatic inline bool DoubleIsEqual(DOUBLE a, DOUBLE b) {\\n return ABS(a-b) < DOUBLE_EPS;\\n}\\n\\nstatic inline void inputStringSpSeparated(char *pcStr)\\n{\\n char *pcCur = pcStr;\\n for (;;) {\\n char c = getchar();\\n if (('\\\\n' == c) || (EOF == c) || (' ' == c)) {\\n break;\\n }\\n *pcCur = c;\\n pcCur++;\\n }\\n *pcCur = '\\\\0';\\n}\\n\\nstatic inline void inputString(char *pcStr)\\n{\\n char *pcCur = pcStr;\\n for (;;) {\\n char c = getchar();\\n if (('\\\\n' == c) || (EOF == c)) {\\n break;\\n }\\n *pcCur = c;\\n pcCur++;\\n }\\n *pcCur = '\\\\0';\\n}\\n\\n\\nstatic inline SQWORD inputSQWORD(void)\\n{\\n SQWORD sqNumber = 0;\\n SQWORD sqMultiplier = 1;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n sqMultiplier = -1;\\n }\\n }\\n if (('0' <= c) && (c <= '9')) {\\n sqNumber *= 10LL;\\n sqNumber += (SQWORD)(c - '0');\\n bRead = true;\\n } else {\\n if (bRead) {\\n return sqNumber * sqMultiplier;\\n }\\n }\\n }\\n}\\n\\n\\nstatic inline SDWORD inputSDWORD(void)\\n{\\n SDWORD lNumber = 0;\\n SDWORD lMultiplier = 1;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n lMultiplier = -1;\\n }\\n }\\n if (('0' <= c) && (c <= '9')) {\\n lNumber *= 10;\\n lNumber += (c - '0');\\n bRead = true;\\n } else {\\n if (bRead) {\\n return lNumber * lMultiplier;\\n }\\n }\\n }\\n}\\n\\nstatic inline DOUBLE inputFP(void)\\n{\\n DOUBLE dInt = 0.0;\\n DOUBLE dFrac = 0.0;\\n DOUBLE dMultiplier = 1.0;\\n DWORD dwFpCnt = 0;\\n DOUBLE *pdCur = &dInt;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n dMultiplier = -1;\\n }\\n }\\n if ('.' == c) {\\n pdCur = &dFrac;\\n } else if (('0' <= c) && (c <= '9')) {\\n (*pdCur) *= 10;\\n (*pdCur) += (DOUBLE)(c - '0');\\n bRead = true;\\n if (pdCur == &dFrac) {\\n dwFpCnt++;\\n }\\n } else {\\n if (bRead) {\\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\\n }\\n }\\n }\\n}\\n\\n/*----------------------------------------------*/\\n/**\\n * mod による操作ライブラリ\\n */\\n#define ANS_MOD (1000000007)\\n\\nclass MODINT {\\n static SQWORD MOD;\\n SQWORD m_x;\\n\\npublic:\\n MODINT(SQWORD val) {\\n m_x = (val % MOD + MOD) % MOD;\\n };\\n MODINT() {\\n m_x = 0;\\n }\\n static void Init(SQWORD sqMod) {\\n MOD = sqMod;\\n }\\n\\n\\tMODINT& operator+= (const MODINT a)\\n {\\n m_x = (m_x + a.m_x) % MOD; \\n return *this;\\n };\\n\\tMODINT& operator-= (const MODINT a)\\n { \\n m_x = (m_x - a.m_x + MOD) % MOD; \\n return *this;\\n };\\n\\tMODINT& operator*= (const MODINT a)\\n {\\n m_x = (m_x * a.m_x) % MOD;\\n return *this;\\n };\\n MODINT pow(SQWORD t) const {\\n if (!t) return 1;\\n MODINT a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\tMODINT operator+ (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res += a);\\n\\t}\\n\\tMODINT operator- (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res -= a);\\n\\t}\\n\\tMODINT operator* (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res *= a);\\n\\t}\\n\\tMODINT operator/ (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res /= a);\\n\\t}\\n\\n /* 逆元 */\\n MODINT inv() const {\\n return pow(MOD-2);\\n }\\n\\n /* 除算 */\\n MODINT& operator/=(const MODINT a) {\\n return (*this) *= a.inv();\\n } \\n\\n /* 整数版 */\\n\\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\\n\\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\\n\\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\\n\\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\\n\\n SQWORD getVal() { return m_x; };\\n};\\nSQWORD MODINT::MOD = ANS_MOD;\\n\\n\\n/*----------------------------------------------*/\\n\\n#define EPS 1e-10\\nDOUBLE double_add(DOUBLE a, DOUBLE b) {\\n if (ABS(a + b) < EPS * (ABS(a) + ABS(b))) {\\n return 0;\\n }\\n return a+b;\\n}\\n\\nstruct VECTOR_2D {\\n DOUBLE dX;\\n DOUBLE dY;\\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\\n VECTOR_2D() : dX(0), dY(0) {};\\n\\n /* 加算 */\\n\\tVECTOR_2D& operator+= (const VECTOR_2D a)\\n { \\n dX = dX + a.dX;\\n dY = dY + a.dY;\\n return *this;\\n };\\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\\n\\t\\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \\n };\\n\\n /* 減算 */\\n\\tVECTOR_2D& operator-= (const VECTOR_2D a)\\n { \\n dX = dX - a.dX;\\n dY = dY - a.dY;\\n return *this;\\n };\\n const VECTOR_2D operator- (const VECTOR_2D a) const {\\n\\t\\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\\n };\\n\\n /* 定数倍 */\\n\\tVECTOR_2D& operator*= (const DOUBLE a)\\n { \\n dX = dX * a;\\n dY = dY * a;\\n return *this;\\n };\\n const VECTOR_2D operator* (const DOUBLE a) const {\\n\\t\\treturn VECTOR_2D(dX * a, dY * a); \\n };\\n\\n /* 比較 */\\n bool operator< (const VECTOR_2D &a) {\\n if (dX == a.dX) {\\n return (dY < a.dY);\\n }\\n return dX < a.dX;\\n }\\n\\n DOUBLE norm(void) const {\\n return (dX * dX + dY * dY);\\n }\\n\\n DOUBLE dist(void) const {\\n return sqrtl(norm());\\n }\\n\\n DOUBLE angle(void) const {\\n return atan2(dY, dX);\\n }\\n\\n DOUBLE dotproduct(const VECTOR_2D a) const {\\n return double_add(dX * a.dX, dY * a.dY);\\n }\\n\\n DOUBLE crossproduct(const VECTOR_2D a) const {\\n return double_add(dX * a.dY, -dY * a.dX);\\n }\\n};\\n\\n\\n\\n/*----------------------------------------------*/\\n\\nstruct BALL_ST {\\n DOUBLE dBegin;\\n DOUBLE dEnd;\\n\\n BALL_ST (DOUBLE b, DOUBLE e) : dBegin(b), dEnd(e) {};\\n}; \\n\\nbool cmpBegin (const BALL_ST &a, const BALL_ST &b) {\\n return a.dBegin < b.dBegin;\\n}\\n\\nbool cmpEnd (const BALL_ST &a, const BALL_ST &b) {\\n return a.dEnd < b.dEnd;\\n}\\n\\n/**\\n * 角度の扱い \\n */\\nstatic inline DOUBLE normalizeAngle(DOUBLE dAngle)\\n{\\n DOUBLE dRet = dAngle;\\n while (dRet < 0.0) {\\n dRet += (2.0 * d_PI);\\n }\\n\\n if (DoubleIsEqual(2.0 * d_PI, dAngle)) {\\n dRet = 0.0;\\n } else {\\n while ((2.0 * d_PI) <= dAngle) {\\n dRet -= (2.0 * d_PI);\\n }\\n }\\n\\n return dRet;\\n}\\n\\n#define MAX_N (1500)\\nint main(void)\\n{\\n SQWORD sqN = inputSQWORD();\\n SQWORD sqK = inputSQWORD();\\n\\n vector<BALL_ST> vecBalls;\\n vecBalls.emplace_back(0, 0); /* dp用にインデックスを1はじまりにするためのダミー */\\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\\n SQWORD sqX = inputSQWORD();\\n SQWORD sqY = inputSQWORD();\\n SQWORD sqR = inputSQWORD();\\n\\n VECTOR_2D stVec((DOUBLE)sqX, (DOUBLE)sqY);\\n DOUBLE dAngle = stVec.angle();\\n DOUBLE dDist = stVec.dist();\\n DOUBLE dRange = asin((DOUBLE)sqR / dDist);\\n\\n DOUBLE dTheta1 = dAngle - dRange;\\n DOUBLE dTheta2 = dAngle + dRange;\\n \\n dTheta1 = normalizeAngle(dTheta1);\\n dTheta2 = normalizeAngle(dTheta2);\\n\\n DOUBLE dBegin, dEnd;\\n\\n if (d_PI <= dTheta1 && d_PI <= dTheta2) {\\n dBegin = 0.0;\\n dEnd = 0.0;\\n } else if (d_PI <= dTheta1) {\\n dBegin = 0.0;\\n dEnd = dTheta2;\\n } else if (d_PI <= dTheta2){\\n dBegin = dTheta1;\\n dEnd = d_PI;\\n } else {\\n dBegin = dTheta1;\\n dEnd = dTheta2;\\n }\\n vecBalls.emplace_back(dBegin, dEnd);\\n }\\n sort(vecBalls.begin(), vecBalls.end(), cmpBegin);\\n\\n /**\\n * dp[j][k] 左端がk番目のボールで、\\n * j個を使っているときの最大の角度\\n * dp[j][k] = max(dp[j-1][0] + angle, dp[j-1][1] + angle, dp[j-1][2] + angle ,,,, dp[j-1][k-1] + angle)\\n * \\n */\\n static DOUBLE s_aadDpTbl[MAX_N + 1][MAX_N + 1];\\n for (SQWORD sqIdxJ = 0; sqIdxJ <= sqN; sqIdxJ++) {\\n for (SQWORD sqIdxK = 0; sqIdxK <= sqN; sqIdxK++) {\\n s_aadDpTbl[sqIdxJ][sqIdxK] = 0.0;\\n }\\n }\\n for (SQWORD sqIdxJ = 0; sqIdxJ < sqN; sqIdxJ++) {\\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK < sqN; sqIdxK++) {\\n DOUBLE dPrevEnd;\\n if (0.0 == s_aadDpTbl[sqIdxJ][sqIdxK]) {\\n dPrevEnd = 0.0;\\n } else {\\n dPrevEnd = vecBalls[sqIdxK].dEnd;\\n } \\n for (SQWORD sqNextBallIdx = sqIdxK + 1; sqNextBallIdx <= sqN; sqNextBallIdx++) {\\n BALL_ST stBall = vecBalls[sqNextBallIdx];\\n DOUBLE dAddAngle = 0;\\n if (dPrevEnd < stBall.dBegin) {\\n dAddAngle = stBall.dEnd - stBall.dBegin;\\n// printf(\\\"> [%lld %lld %lld] %llf \\\", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \\n = MAX(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\\n } else {\\n if (dPrevEnd < stBall.dEnd) {\\n dAddAngle = stBall.dEnd - dPrevEnd;\\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \\n = MAX(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\\n }\\n// printf(\\\"< [%lld %lld %lld] %llf \\\", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\\n }\\n\\n }\\n }\\n// printf(\\\"\\\\n\\\");\\n }\\n\\n DOUBLE dAns = 0.0;\\n for (SQWORD sqIdxJ = 1; sqIdxJ <= sqK; sqIdxJ++) {\\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK <= sqN; sqIdxK++) {\\n// printf(\\\"%llf \\\", s_aadDpTbl[sqIdxJ][sqIdxK] / d_PI);\\n dAns = max(dAns, s_aadDpTbl[sqIdxJ][sqIdxK]);\\n }\\n// printf(\\\"\\\\n\\\");\\n }\\n\\n printf(\\\"%0.11f\\\\n\\\", dAns / d_PI);\\n\\n return 0;\\n}\",\n \"accuracy\": 0.3380281690140845,\n \"time_ms\": 710,\n \"memory_kb\": 21144,\n \"score_of_the_acc\": -1.005,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2276_3917747\",\n \"code_snippet\": \"#pragma GCC optimize (\\\"O3\\\")\\n\\n#include <iostream>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <math.h>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <queue>\\n#include <set>\\n#include <algorithm>\\n#include <numeric>\\n#include <list>\\nusing namespace std;\\n\\nusing QWORD = uint64_t;\\nusing SQWORD = int64_t;\\nusing DWORD = uint32_t;\\nusing SDWORD = int32_t;\\nusing WORD = uint16_t;\\nusing SWORD = int16_t;\\nusing BYTE = uint8_t;\\nusing SBYTE = int8_t;\\nusing DOUBLE = double;\\nusing FLOAT = float;\\n\\n#define MIN_SDWORD (-2147483648)\\n#define MAX_SDWORD (2147483647)\\n#define MIN_SBYTE (-128)\\n#define MAX_SBYTE (127)\\n\\n#define MIN_SQWORD (0x8000000000000000)\\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\\n\\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\\n#define MAX_DWORD (0xFFFFFFFF)\\n#define MAX_WORD (0xFFFF)\\n#define MAX_BYTE (0xFF)\\n\\n#define MAX_DOUBLE (1.0e+308)\\n#define DOUBLE_EPS (1.0e-12)\\n#define MIN_DOUBLE_N (-1.0e+308)\\n\\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\\n\\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\\nstatic inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; };\\n\\n#define BYTE_BITS (8)\\n#define WORD_BITS (16)\\n#define DWORD_BITS (32)\\n#define QWORD_BITS (64)\\n\\n#define ANS_MOD (1000000007)\\n\\nstatic const DOUBLE d_PI = 3.14159265358979323846;\\n\\n\\nstatic inline void inputStringSpSeparated(char *pcStr)\\n{\\n char *pcCur = pcStr;\\n for (;;) {\\n char c = getchar();\\n if (('\\\\n' == c) || (EOF == c) || (' ' == c)) {\\n break;\\n }\\n *pcCur = c;\\n pcCur++;\\n }\\n *pcCur = '\\\\0';\\n}\\n\\nstatic inline void inputString(char *pcStr)\\n{\\n char *pcCur = pcStr;\\n for (;;) {\\n char c = getchar();\\n if (('\\\\n' == c) || (EOF == c)) {\\n break;\\n }\\n *pcCur = c;\\n pcCur++;\\n }\\n *pcCur = '\\\\0';\\n}\\n\\n\\nstatic inline SQWORD inputSQWORD(void)\\n{\\n SQWORD sqNumber = 0;\\n SQWORD sqMultiplier = 1;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n sqMultiplier = -1;\\n }\\n }\\n if (('0' <= c) && (c <= '9')) {\\n sqNumber *= 10LL;\\n sqNumber += (SQWORD)(c - '0');\\n bRead = true;\\n } else {\\n if (bRead) {\\n return sqNumber * sqMultiplier;\\n }\\n }\\n }\\n}\\n\\n\\nstatic inline SDWORD inputSDWORD(void)\\n{\\n SDWORD lNumber = 0;\\n SDWORD lMultiplier = 1;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n lMultiplier = -1;\\n }\\n }\\n if (('0' <= c) && (c <= '9')) {\\n lNumber *= 10;\\n lNumber += (c - '0');\\n bRead = true;\\n } else {\\n if (bRead) {\\n return lNumber * lMultiplier;\\n }\\n }\\n }\\n}\\n\\nstatic inline DOUBLE inputFP(void)\\n{\\n DOUBLE dInt = 0.0;\\n DOUBLE dFrac = 0.0;\\n DOUBLE dMultiplier = 1.0;\\n DWORD dwFpCnt = 0;\\n DOUBLE *pdCur = &dInt;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n dMultiplier = -1;\\n }\\n }\\n if ('.' == c) {\\n pdCur = &dFrac;\\n } else if (('0' <= c) && (c <= '9')) {\\n (*pdCur) *= 10;\\n (*pdCur) += (DOUBLE)(c - '0');\\n bRead = true;\\n if (pdCur == &dFrac) {\\n dwFpCnt++;\\n }\\n } else {\\n if (bRead) {\\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\\n }\\n }\\n }\\n}\\n\\n/*----------------------------------------------*/\\n/**\\n * mod による操作ライブラリ\\n */\\n#define ANS_MOD (1000000007)\\n\\nclass MODINT {\\n static SQWORD MOD;\\n SQWORD m_x;\\n\\npublic:\\n MODINT(SQWORD val) {\\n m_x = (val % MOD + MOD) % MOD;\\n };\\n MODINT() {\\n m_x = 0;\\n }\\n static void Init(SQWORD sqMod) {\\n MOD = sqMod;\\n }\\n\\n\\tMODINT& operator+= (const MODINT a)\\n {\\n m_x = (m_x + a.m_x) % MOD; \\n return *this;\\n };\\n\\tMODINT& operator-= (const MODINT a)\\n { \\n m_x = (m_x - a.m_x + MOD) % MOD; \\n return *this;\\n };\\n\\tMODINT& operator*= (const MODINT a)\\n {\\n m_x = (m_x * a.m_x) % MOD;\\n return *this;\\n };\\n MODINT pow(SQWORD t) const {\\n if (!t) return 1;\\n MODINT a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\tMODINT operator+ (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res += a);\\n\\t}\\n\\tMODINT operator- (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res -= a);\\n\\t}\\n\\tMODINT operator* (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res *= a);\\n\\t}\\n\\tMODINT operator/ (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res /= a);\\n\\t}\\n\\n /* 逆元 */\\n MODINT inv() const {\\n return pow(MOD-2);\\n }\\n\\n /* 除算 */\\n MODINT& operator/=(const MODINT a) {\\n return (*this) *= a.inv();\\n } \\n\\n /* 整数版 */\\n\\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\\n\\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\\n\\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\\n\\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\\n\\n SQWORD getVal() { return m_x; };\\n};\\nSQWORD MODINT::MOD = ANS_MOD;\\n\\n\\n/*----------------------------------------------*/\\n\\n#define EPS 1e-10\\nDOUBLE double_add(DOUBLE a, DOUBLE b) {\\n if (ABS(a + b) < EPS * (ABS(a) + ABS(b))) {\\n return 0;\\n }\\n return a+b;\\n}\\n\\nstruct VECTOR_2D {\\n DOUBLE dX;\\n DOUBLE dY;\\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\\n VECTOR_2D() : dX(0), dY(0) {};\\n\\n /* 加算 */\\n\\tVECTOR_2D& operator+= (const VECTOR_2D a)\\n { \\n dX = dX + a.dX;\\n dY = dY + a.dY;\\n return *this;\\n };\\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\\n\\t\\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \\n };\\n\\n /* 減算 */\\n\\tVECTOR_2D& operator-= (const VECTOR_2D a)\\n { \\n dX = dX - a.dX;\\n dY = dY - a.dY;\\n return *this;\\n };\\n const VECTOR_2D operator- (const VECTOR_2D a) const {\\n\\t\\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\\n };\\n\\n /* 定数倍 */\\n\\tVECTOR_2D& operator*= (const DOUBLE a)\\n { \\n dX = dX * a;\\n dY = dY * a;\\n return *this;\\n };\\n const VECTOR_2D operator* (const DOUBLE a) const {\\n\\t\\treturn VECTOR_2D(dX * a, dY * a); \\n };\\n\\n /* 比較 */\\n bool operator< (const VECTOR_2D &a) {\\n if (dX == a.dX) {\\n return (dY < a.dY);\\n }\\n return dX < a.dX;\\n }\\n\\n DOUBLE norm(void) const {\\n return (dX * dX + dY * dY);\\n }\\n\\n DOUBLE dist(void) const {\\n return sqrtl(norm());\\n }\\n\\n DOUBLE angle(void) const {\\n return atan2(dY, dX);\\n }\\n\\n DOUBLE dotproduct(const VECTOR_2D a) const {\\n return double_add(dX * a.dX, dY * a.dY);\\n }\\n\\n DOUBLE crossproduct(const VECTOR_2D a) const {\\n return double_add(dX * a.dY, -dY * a.dX);\\n }\\n};\\n\\n\\n\\n/*----------------------------------------------*/\\n\\nstruct BALL_ST {\\n DOUBLE dBegin;\\n DOUBLE dEnd;\\n\\n BALL_ST (DOUBLE b, DOUBLE e) : dBegin(b), dEnd(e) {};\\n}; \\n\\nbool cmpBegin (const BALL_ST &a, const BALL_ST &b) {\\n return a.dBegin < b.dBegin;\\n}\\n\\nbool cmpEnd (const BALL_ST &a, const BALL_ST &b) {\\n return a.dEnd < b.dEnd;\\n}\\n\\n/**\\n * 角度の扱い \\n */\\nstatic inline DOUBLE normalizeAngle(DOUBLE dAngle)\\n{\\n DOUBLE dRet = dAngle;\\n while (dRet < 0.0) {\\n dRet += (2.0 * d_PI);\\n }\\n\\n while ((2.0 * d_PI) < dAngle) {\\n dRet -= (2.0 * d_PI);\\n }\\n\\n return dRet;\\n}\\n\\n#define MAX_N (1500)\\nint main(void)\\n{\\n SQWORD sqN = inputSQWORD();\\n SQWORD sqK = inputSQWORD();\\n\\n vector<BALL_ST> vecBalls;\\n vecBalls.emplace_back(0, 0); /* dp用にインデックスを1はじまりにするためのダミー */\\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\\n SQWORD sqX = inputSQWORD();\\n SQWORD sqY = inputSQWORD();\\n SQWORD sqR = inputSQWORD();\\n\\n VECTOR_2D stVec((DOUBLE)sqX, (DOUBLE)sqY);\\n DOUBLE dAngle = normalizeAngle(stVec.angle());\\n DOUBLE dDist = stVec.dist();\\n DOUBLE dRange = asin((DOUBLE)sqR / dDist);\\n \\n DOUBLE dBegin, dEnd;\\n if (2 * d_PI <= (dAngle + dRange)) {\\n dBegin = 0.0;\\n dEnd = dAngle + dRange - (2 * d_PI);\\n } else {\\n dBegin = MIN(MAX(dAngle - dRange, 0.0), d_PI);\\n dEnd = MIN(MAX(dAngle + dRange, 0.0), d_PI); \\n }\\n\\n\\n\\n// printf(\\\"%0.10f %0.10f\\\\n\\\", dBegin, dEnd);\\n\\n vecBalls.emplace_back(dBegin, dEnd);\\n }\\n sort(vecBalls.begin(), vecBalls.end(), cmpBegin);\\n\\n /**\\n * dp[j][k] 左端がk番目のボールで、\\n * j個を使っているときの最大の角度\\n * dp[j][k] = max(dp[j-1][0] + angle, dp[j-1][1] + angle, dp[j-1][2] + angle ,,,, dp[j-1][k-1] + angle)\\n * \\n */\\n static DOUBLE s_aadDpTbl[MAX_N + 1][MAX_N + 1];\\n for (SQWORD sqIdxJ = 0; sqIdxJ <= sqN; sqIdxJ++) {\\n for (SQWORD sqIdxK = 0; sqIdxK <= sqN; sqIdxK++) {\\n s_aadDpTbl[sqIdxJ][sqIdxK] = 0;\\n }\\n }\\n for (SQWORD sqIdxJ = 0; sqIdxJ < sqN; sqIdxJ++) {\\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK < sqN; sqIdxK++) {\\n DOUBLE dPrevEnd = vecBalls[sqIdxK].dEnd;\\n for (SQWORD sqNextBallIdx = sqIdxK + 1; sqNextBallIdx <= sqN; sqNextBallIdx++) {\\n BALL_ST stBall = vecBalls[sqNextBallIdx];\\n DOUBLE dAddAngle = 0;\\n if (dPrevEnd < stBall.dBegin) {\\n dAddAngle = stBall.dEnd - stBall.dBegin;\\n// printf(\\\"> [%lld %lld %lld] %llf \\\", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \\n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\\n } else {\\n if (dPrevEnd < stBall.dEnd) {\\n dAddAngle = stBall.dEnd - dPrevEnd;\\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \\n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\\n }\\n// printf(\\\"< [%lld %lld %lld] %llf \\\", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\\n }\\n\\n }\\n }\\n// printf(\\\"\\\\n\\\");\\n }\\n\\n DOUBLE dAns = 0.0;\\n for (SQWORD sqIdxJ = 1; sqIdxJ <= sqK; sqIdxJ++) {\\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK <= sqN; sqIdxK++) {\\n// printf(\\\"%llf \\\", s_aadDpTbl[sqIdxJ][sqIdxK] / d_PI);\\n dAns = max(dAns, s_aadDpTbl[sqIdxJ][sqIdxK]);\\n }\\n// printf(\\\"\\\\n\\\");\\n }\\n\\n printf(\\\"%0.11f\\\\n\\\", dAns / d_PI);\\n\\n return 0;\\n}\",\n \"accuracy\": 0.3380281690140845,\n \"time_ms\": 570,\n \"memory_kb\": 21292,\n \"score_of_the_acc\": -0.8064,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2276_3917743\",\n \"code_snippet\": \"#pragma GCC optimize (\\\"O3\\\")\\n\\n#include <iostream>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <math.h>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <queue>\\n#include <set>\\n#include <algorithm>\\n#include <numeric>\\n#include <list>\\nusing namespace std;\\n\\nusing QWORD = uint64_t;\\nusing SQWORD = int64_t;\\nusing DWORD = uint32_t;\\nusing SDWORD = int32_t;\\nusing WORD = uint16_t;\\nusing SWORD = int16_t;\\nusing BYTE = uint8_t;\\nusing SBYTE = int8_t;\\nusing DOUBLE = double;\\nusing FLOAT = float;\\n\\n#define MIN_SDWORD (-2147483648)\\n#define MAX_SDWORD (2147483647)\\n#define MIN_SBYTE (-128)\\n#define MAX_SBYTE (127)\\n\\n#define MIN_SQWORD (0x8000000000000000)\\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\\n\\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\\n#define MAX_DWORD (0xFFFFFFFF)\\n#define MAX_WORD (0xFFFF)\\n#define MAX_BYTE (0xFF)\\n\\n#define MAX_DOUBLE (1.0e+308)\\n#define DOUBLE_EPS (1.0e-12)\\n#define MIN_DOUBLE_N (-1.0e+308)\\n\\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\\n\\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\\nstatic inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; };\\n\\n#define BYTE_BITS (8)\\n#define WORD_BITS (16)\\n#define DWORD_BITS (32)\\n#define QWORD_BITS (64)\\n\\n#define ANS_MOD (1000000007)\\n\\nstatic const DOUBLE d_PI = 3.14159265358979323846;\\n\\n\\nstatic inline void inputStringSpSeparated(char *pcStr)\\n{\\n char *pcCur = pcStr;\\n for (;;) {\\n char c = getchar();\\n if (('\\\\n' == c) || (EOF == c) || (' ' == c)) {\\n break;\\n }\\n *pcCur = c;\\n pcCur++;\\n }\\n *pcCur = '\\\\0';\\n}\\n\\nstatic inline void inputString(char *pcStr)\\n{\\n char *pcCur = pcStr;\\n for (;;) {\\n char c = getchar();\\n if (('\\\\n' == c) || (EOF == c)) {\\n break;\\n }\\n *pcCur = c;\\n pcCur++;\\n }\\n *pcCur = '\\\\0';\\n}\\n\\n\\nstatic inline SQWORD inputSQWORD(void)\\n{\\n SQWORD sqNumber = 0;\\n SQWORD sqMultiplier = 1;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n sqMultiplier = -1;\\n }\\n }\\n if (('0' <= c) && (c <= '9')) {\\n sqNumber *= 10LL;\\n sqNumber += (SQWORD)(c - '0');\\n bRead = true;\\n } else {\\n if (bRead) {\\n return sqNumber * sqMultiplier;\\n }\\n }\\n }\\n}\\n\\n\\nstatic inline SDWORD inputSDWORD(void)\\n{\\n SDWORD lNumber = 0;\\n SDWORD lMultiplier = 1;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n lMultiplier = -1;\\n }\\n }\\n if (('0' <= c) && (c <= '9')) {\\n lNumber *= 10;\\n lNumber += (c - '0');\\n bRead = true;\\n } else {\\n if (bRead) {\\n return lNumber * lMultiplier;\\n }\\n }\\n }\\n}\\n\\nstatic inline DOUBLE inputFP(void)\\n{\\n DOUBLE dInt = 0.0;\\n DOUBLE dFrac = 0.0;\\n DOUBLE dMultiplier = 1.0;\\n DWORD dwFpCnt = 0;\\n DOUBLE *pdCur = &dInt;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n dMultiplier = -1;\\n }\\n }\\n if ('.' == c) {\\n pdCur = &dFrac;\\n } else if (('0' <= c) && (c <= '9')) {\\n (*pdCur) *= 10;\\n (*pdCur) += (DOUBLE)(c - '0');\\n bRead = true;\\n if (pdCur == &dFrac) {\\n dwFpCnt++;\\n }\\n } else {\\n if (bRead) {\\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\\n }\\n }\\n }\\n}\\n\\n/*----------------------------------------------*/\\n/**\\n * mod による操作ライブラリ\\n */\\n#define ANS_MOD (1000000007)\\n\\nclass MODINT {\\n static SQWORD MOD;\\n SQWORD m_x;\\n\\npublic:\\n MODINT(SQWORD val) {\\n m_x = (val % MOD + MOD) % MOD;\\n };\\n MODINT() {\\n m_x = 0;\\n }\\n static void Init(SQWORD sqMod) {\\n MOD = sqMod;\\n }\\n\\n\\tMODINT& operator+= (const MODINT a)\\n {\\n m_x = (m_x + a.m_x) % MOD; \\n return *this;\\n };\\n\\tMODINT& operator-= (const MODINT a)\\n { \\n m_x = (m_x - a.m_x + MOD) % MOD; \\n return *this;\\n };\\n\\tMODINT& operator*= (const MODINT a)\\n {\\n m_x = (m_x * a.m_x) % MOD;\\n return *this;\\n };\\n MODINT pow(SQWORD t) const {\\n if (!t) return 1;\\n MODINT a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\tMODINT operator+ (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res += a);\\n\\t}\\n\\tMODINT operator- (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res -= a);\\n\\t}\\n\\tMODINT operator* (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res *= a);\\n\\t}\\n\\tMODINT operator/ (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res /= a);\\n\\t}\\n\\n /* 逆元 */\\n MODINT inv() const {\\n return pow(MOD-2);\\n }\\n\\n /* 除算 */\\n MODINT& operator/=(const MODINT a) {\\n return (*this) *= a.inv();\\n } \\n\\n /* 整数版 */\\n\\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\\n\\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\\n\\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\\n\\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\\n\\n SQWORD getVal() { return m_x; };\\n};\\nSQWORD MODINT::MOD = ANS_MOD;\\n\\n\\n/*----------------------------------------------*/\\n\\n#define EPS 1e-10\\nDOUBLE double_add(DOUBLE a, DOUBLE b) {\\n if (ABS(a + b) < EPS * (ABS(a) + ABS(b))) {\\n return 0;\\n }\\n return a+b;\\n}\\n\\nstruct VECTOR_2D {\\n DOUBLE dX;\\n DOUBLE dY;\\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\\n VECTOR_2D() : dX(0), dY(0) {};\\n\\n /* 加算 */\\n\\tVECTOR_2D& operator+= (const VECTOR_2D a)\\n { \\n dX = dX + a.dX;\\n dY = dY + a.dY;\\n return *this;\\n };\\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\\n\\t\\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \\n };\\n\\n /* 減算 */\\n\\tVECTOR_2D& operator-= (const VECTOR_2D a)\\n { \\n dX = dX - a.dX;\\n dY = dY - a.dY;\\n return *this;\\n };\\n const VECTOR_2D operator- (const VECTOR_2D a) const {\\n\\t\\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\\n };\\n\\n /* 定数倍 */\\n\\tVECTOR_2D& operator*= (const DOUBLE a)\\n { \\n dX = dX * a;\\n dY = dY * a;\\n return *this;\\n };\\n const VECTOR_2D operator* (const DOUBLE a) const {\\n\\t\\treturn VECTOR_2D(dX * a, dY * a); \\n };\\n\\n /* 比較 */\\n bool operator< (const VECTOR_2D &a) {\\n if (dX == a.dX) {\\n return (dY < a.dY);\\n }\\n return dX < a.dX;\\n }\\n\\n DOUBLE norm(void) const {\\n return (dX * dX + dY * dY);\\n }\\n\\n DOUBLE dist(void) const {\\n return sqrtl(norm());\\n }\\n\\n DOUBLE angle(void) const {\\n return atan2(dY, dX);\\n }\\n\\n DOUBLE dotproduct(const VECTOR_2D a) const {\\n return double_add(dX * a.dX, dY * a.dY);\\n }\\n\\n DOUBLE crossproduct(const VECTOR_2D a) const {\\n return double_add(dX * a.dY, -dY * a.dX);\\n }\\n};\\n\\n\\n\\n/*----------------------------------------------*/\\n\\nstruct BALL_ST {\\n DOUBLE dBegin;\\n DOUBLE dEnd;\\n\\n BALL_ST (DOUBLE b, DOUBLE e) : dBegin(b), dEnd(e) {};\\n}; \\n\\nbool cmpBegin (const BALL_ST &a, const BALL_ST &b) {\\n return a.dBegin < b.dBegin;\\n}\\n\\nbool cmpEnd (const BALL_ST &a, const BALL_ST &b) {\\n return a.dEnd < b.dEnd;\\n}\\n\\n/**\\n * 角度の扱い \\n */\\nstatic inline DOUBLE normalizeAngle(DOUBLE dAngle)\\n{\\n DOUBLE dRet = dAngle;\\n while (dRet < 0.0) {\\n dRet += (2.0 * d_PI);\\n }\\n\\n while ((2.0 * d_PI) < dAngle) {\\n dRet -= (2.0 * d_PI);\\n }\\n\\n return dRet;\\n}\\n\\n#define MAX_N (1500)\\nint main(void)\\n{\\n SQWORD sqN = inputSQWORD();\\n SQWORD sqK = inputSQWORD();\\n\\n vector<BALL_ST> vecBalls;\\n vecBalls.emplace_back(0, 0); /* dp用にインデックスを1はじまりにするためのダミー */\\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\\n SQWORD sqX = inputSQWORD();\\n SQWORD sqY = inputSQWORD();\\n SQWORD sqR = inputSQWORD();\\n\\n VECTOR_2D stVec((DOUBLE)sqX, (DOUBLE)sqY);\\n DOUBLE dAngle = normalizeAngle(stVec.angle());\\n DOUBLE dDist = stVec.dist();\\n DOUBLE dRange = asin((DOUBLE)sqR / dDist);\\n \\n DOUBLE dBegin, dEnd;\\n if (2 * d_PI < (dAngle + dRange)) {\\n dBegin = 0.0;\\n dEnd = dAngle + dRange - (2 * d_PI);\\n } else {\\n dBegin = MIN(MAX(dAngle - dRange, 0.0), d_PI);\\n dEnd = MIN(MAX(dAngle + dRange, 0.0), d_PI); \\n }\\n\\n\\n\\n// printf(\\\"%0.10f %0.10f\\\\n\\\", dBegin, dEnd);\\n\\n vecBalls.emplace_back(dBegin, dEnd);\\n }\\n sort(vecBalls.begin(), vecBalls.end(), cmpBegin);\\n\\n /**\\n * dp[j][k] 左端がk番目のボールで、\\n * j個を使っているときの最大の角度\\n * dp[j][k] = max(dp[j-1][0] + angle, dp[j-1][1] + angle, dp[j-1][2] + angle ,,,, dp[j-1][k-1] + angle)\\n * \\n */\\n static DOUBLE s_aadDpTbl[MAX_N + 1][MAX_N + 1];\\n for (SQWORD sqIdxJ = 0; sqIdxJ <= sqN; sqIdxJ++) {\\n for (SQWORD sqIdxK = 0; sqIdxK <= sqN; sqIdxK++) {\\n s_aadDpTbl[sqIdxJ][sqIdxK] = 0;\\n }\\n }\\n for (SQWORD sqIdxJ = 0; sqIdxJ < sqN; sqIdxJ++) {\\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK < sqN; sqIdxK++) {\\n DOUBLE dPrevEnd = vecBalls[sqIdxK].dEnd;\\n for (SQWORD sqNextBallIdx = sqIdxK + 1; sqNextBallIdx <= sqN; sqNextBallIdx++) {\\n BALL_ST stBall = vecBalls[sqNextBallIdx];\\n DOUBLE dAddAngle = 0;\\n if (dPrevEnd < stBall.dBegin) {\\n dAddAngle = stBall.dEnd - stBall.dBegin;\\n// printf(\\\"> [%lld %lld %lld] %llf \\\", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \\n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\\n } else {\\n if (dPrevEnd < stBall.dEnd) {\\n dAddAngle = stBall.dEnd - dPrevEnd;\\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \\n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\\n }\\n// printf(\\\"< [%lld %lld %lld] %llf \\\", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\\n }\\n\\n }\\n }\\n// printf(\\\"\\\\n\\\");\\n }\\n\\n DOUBLE dAns = 0.0;\\n for (SQWORD sqIdxJ = 1; sqIdxJ <= sqK; sqIdxJ++) {\\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK <= sqN; sqIdxK++) {\\n// printf(\\\"%llf \\\", s_aadDpTbl[sqIdxJ][sqIdxK] / d_PI);\\n dAns = max(dAns, s_aadDpTbl[sqIdxJ][sqIdxK]);\\n }\\n// printf(\\\"\\\\n\\\");\\n }\\n\\n printf(\\\"%0.11f\\\\n\\\", dAns / d_PI);\\n\\n return 0;\\n}\",\n \"accuracy\": 0.1267605633802817,\n \"time_ms\": 490,\n \"memory_kb\": 21112,\n \"score_of_the_acc\": -0.6904,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2276_3916179\",\n \"code_snippet\": \"#pragma GCC optimize (\\\"O3\\\")\\n\\n#include <iostream>\\n#include <stdio.h>\\n#include <stdlib.h>\\n#include <string.h>\\n#include <math.h>\\n#include <map>\\n#include <unordered_map>\\n#include <set>\\n#include <unordered_set>\\n#include <queue>\\n#include <set>\\n#include <algorithm>\\n#include <numeric>\\n#include <list>\\nusing namespace std;\\n\\nusing QWORD = uint64_t;\\nusing SQWORD = int64_t;\\nusing DWORD = uint32_t;\\nusing SDWORD = int32_t;\\nusing WORD = uint16_t;\\nusing SWORD = int16_t;\\nusing BYTE = uint8_t;\\nusing SBYTE = int8_t;\\nusing DOUBLE = double;\\nusing FLOAT = float;\\n\\n#define MIN_SDWORD (-2147483648)\\n#define MAX_SDWORD (2147483647)\\n#define MIN_SBYTE (-128)\\n#define MAX_SBYTE (127)\\n\\n#define MIN_SQWORD (0x8000000000000000)\\n#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)\\n\\n#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)\\n#define MAX_DWORD (0xFFFFFFFF)\\n#define MAX_WORD (0xFFFF)\\n#define MAX_BYTE (0xFF)\\n\\n#define MAX_DOUBLE (1.0e+308)\\n#define DOUBLE_EPS (1.0e-12)\\n#define MIN_DOUBLE_N (-1.0e+308)\\n\\n#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))\\n\\nstatic inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }\\nstatic inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }\\nstatic inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }\\nstatic inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }\\nstatic inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }\\nstatic inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }\\nstatic inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }\\nstatic inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }\\nstatic inline DOUBLE ABS(DOUBLE a) { return 0 < a ? a : -a; };\\n\\n#define BYTE_BITS (8)\\n#define WORD_BITS (16)\\n#define DWORD_BITS (32)\\n#define QWORD_BITS (64)\\n\\n#define ANS_MOD (1000000007)\\n\\nstatic const DOUBLE d_PI = 3.14159265358979323846;\\n\\n\\nstatic inline void inputStringSpSeparated(char *pcStr)\\n{\\n char *pcCur = pcStr;\\n for (;;) {\\n char c = getchar();\\n if (('\\\\n' == c) || (EOF == c) || (' ' == c)) {\\n break;\\n }\\n *pcCur = c;\\n pcCur++;\\n }\\n *pcCur = '\\\\0';\\n}\\n\\nstatic inline void inputString(char *pcStr)\\n{\\n char *pcCur = pcStr;\\n for (;;) {\\n char c = getchar();\\n if (('\\\\n' == c) || (EOF == c)) {\\n break;\\n }\\n *pcCur = c;\\n pcCur++;\\n }\\n *pcCur = '\\\\0';\\n}\\n\\n\\nstatic inline SQWORD inputSQWORD(void)\\n{\\n SQWORD sqNumber = 0;\\n SQWORD sqMultiplier = 1;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n sqMultiplier = -1;\\n }\\n }\\n if (('0' <= c) && (c <= '9')) {\\n sqNumber *= 10LL;\\n sqNumber += (SQWORD)(c - '0');\\n bRead = true;\\n } else {\\n if (bRead) {\\n return sqNumber * sqMultiplier;\\n }\\n }\\n }\\n}\\n\\n\\nstatic inline SDWORD inputSDWORD(void)\\n{\\n SDWORD lNumber = 0;\\n SDWORD lMultiplier = 1;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n lMultiplier = -1;\\n }\\n }\\n if (('0' <= c) && (c <= '9')) {\\n lNumber *= 10;\\n lNumber += (c - '0');\\n bRead = true;\\n } else {\\n if (bRead) {\\n return lNumber * lMultiplier;\\n }\\n }\\n }\\n}\\n\\nstatic inline DOUBLE inputFP(void)\\n{\\n DOUBLE dInt = 0.0;\\n DOUBLE dFrac = 0.0;\\n DOUBLE dMultiplier = 1.0;\\n DWORD dwFpCnt = 0;\\n DOUBLE *pdCur = &dInt;\\n bool bRead = false;\\n for (;;) {\\n char c = getchar();\\n if (!bRead) {\\n if ('-' == c) {\\n dMultiplier = -1;\\n }\\n }\\n if ('.' == c) {\\n pdCur = &dFrac;\\n } else if (('0' <= c) && (c <= '9')) {\\n (*pdCur) *= 10;\\n (*pdCur) += (DOUBLE)(c - '0');\\n bRead = true;\\n if (pdCur == &dFrac) {\\n dwFpCnt++;\\n }\\n } else {\\n if (bRead) {\\n return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));\\n }\\n }\\n }\\n}\\n\\n/*----------------------------------------------*/\\n/**\\n * mod による操作ライブラリ\\n */\\n#define ANS_MOD (1000000007)\\n\\nclass MODINT {\\n static SQWORD MOD;\\n SQWORD m_x;\\n\\npublic:\\n MODINT(SQWORD val) {\\n m_x = (val % MOD + MOD) % MOD;\\n };\\n MODINT() {\\n m_x = 0;\\n }\\n static void Init(SQWORD sqMod) {\\n MOD = sqMod;\\n }\\n\\n\\tMODINT& operator+= (const MODINT a)\\n {\\n m_x = (m_x + a.m_x) % MOD; \\n return *this;\\n };\\n\\tMODINT& operator-= (const MODINT a)\\n { \\n m_x = (m_x - a.m_x + MOD) % MOD; \\n return *this;\\n };\\n\\tMODINT& operator*= (const MODINT a)\\n {\\n m_x = (m_x * a.m_x) % MOD;\\n return *this;\\n };\\n MODINT pow(SQWORD t) const {\\n if (!t) return 1;\\n MODINT a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\tMODINT operator+ (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res += a);\\n\\t}\\n\\tMODINT operator- (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res -= a);\\n\\t}\\n\\tMODINT operator* (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res *= a);\\n\\t}\\n\\tMODINT operator/ (const MODINT a) const {\\n\\t\\tMODINT res(*this);\\n\\t\\treturn (res /= a);\\n\\t}\\n\\n /* 逆元 */\\n MODINT inv() const {\\n return pow(MOD-2);\\n }\\n\\n /* 除算 */\\n MODINT& operator/=(const MODINT a) {\\n return (*this) *= a.inv();\\n } \\n\\n /* 整数版 */\\n\\tMODINT& operator+= (const SQWORD a) {*this += MODINT(a); return *this;};\\n\\tMODINT& operator-= (const SQWORD a) {*this -= MODINT(a); return *this;};\\n\\tMODINT& operator*= (const SQWORD a) {*this *= MODINT(a); return *this;};\\n\\tMODINT& operator/= (const SQWORD a) {*this /= MODINT(a); return *this;};\\n\\n SQWORD getVal() { return m_x; };\\n};\\nSQWORD MODINT::MOD = ANS_MOD;\\n\\n\\n/*----------------------------------------------*/\\n\\n#define EPS 1e-10\\nDOUBLE double_add(DOUBLE a, DOUBLE b) {\\n if (ABS(a + b) < EPS * (ABS(a) + ABS(b))) {\\n return 0;\\n }\\n return a+b;\\n}\\n\\nstruct VECTOR_2D {\\n DOUBLE dX;\\n DOUBLE dY;\\n VECTOR_2D(DOUBLE x, DOUBLE y) : dX(x), dY(y) {};\\n VECTOR_2D() : dX(0), dY(0) {};\\n\\n /* 加算 */\\n\\tVECTOR_2D& operator+= (const VECTOR_2D a)\\n { \\n dX = dX + a.dX;\\n dY = dY + a.dY;\\n return *this;\\n };\\n const VECTOR_2D operator+ (const VECTOR_2D a) const {\\n\\t\\treturn VECTOR_2D(dX + a.dX, dY + a.dY); \\n };\\n\\n /* 減算 */\\n\\tVECTOR_2D& operator-= (const VECTOR_2D a)\\n { \\n dX = dX - a.dX;\\n dY = dY - a.dY;\\n return *this;\\n };\\n const VECTOR_2D operator- (const VECTOR_2D a) const {\\n\\t\\treturn VECTOR_2D(dX - a.dX, dY - a.dY);\\n };\\n\\n /* 定数倍 */\\n\\tVECTOR_2D& operator*= (const DOUBLE a)\\n { \\n dX = dX * a;\\n dY = dY * a;\\n return *this;\\n };\\n const VECTOR_2D operator* (const DOUBLE a) const {\\n\\t\\treturn VECTOR_2D(dX * a, dY * a); \\n };\\n\\n /* 比較 */\\n bool operator< (const VECTOR_2D &a) {\\n if (dX == a.dX) {\\n return (dY < a.dY);\\n }\\n return dX < a.dX;\\n }\\n\\n DOUBLE norm(void) const {\\n return (dX * dX + dY * dY);\\n }\\n\\n DOUBLE dist(void) const {\\n return sqrtl(norm());\\n }\\n\\n DOUBLE angle(void) const {\\n return atan2(dY, dX);\\n }\\n\\n DOUBLE dotproduct(const VECTOR_2D a) const {\\n return double_add(dX * a.dX, dY * a.dY);\\n }\\n\\n DOUBLE crossproduct(const VECTOR_2D a) const {\\n return double_add(dX * a.dY, -dY * a.dX);\\n }\\n};\\n\\n\\n\\n/*----------------------------------------------*/\\n\\nstruct BALL_ST {\\n DOUBLE dBegin;\\n DOUBLE dEnd;\\n\\n BALL_ST (DOUBLE b, DOUBLE e) : dBegin(b), dEnd(e) {};\\n}; \\n\\nbool cmpBegin (const BALL_ST &a, const BALL_ST &b) {\\n return a.dBegin < b.dBegin;\\n}\\n\\nbool cmpEnd (const BALL_ST &a, const BALL_ST &b) {\\n return a.dEnd < b.dEnd;\\n}\\n\\n/**\\n * 角度の扱い \\n */\\nstatic inline DOUBLE normalizeAngle(DOUBLE dAngle)\\n{\\n DOUBLE dRet = dAngle;\\n while (dRet < 0.0) {\\n dRet += (2.0 * d_PI);\\n }\\n\\n while ((2.0 * d_PI) < dAngle) {\\n dRet -= (2.0 * d_PI);\\n }\\n\\n return dRet;\\n}\\n\\n#define MAX_N (1500)\\nint main(void)\\n{\\n SQWORD sqN = inputSQWORD();\\n SQWORD sqK = inputSQWORD();\\n\\n vector<BALL_ST> vecBalls;\\n vecBalls.emplace_back(0, 0); /* dp用にインデックスを1はじまりにするためのダミー */\\n for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {\\n SQWORD sqX = inputSQWORD();\\n SQWORD sqY = inputSQWORD();\\n SQWORD sqR = inputSQWORD();\\n\\n VECTOR_2D stVec((DOUBLE)sqX, (DOUBLE)sqY);\\n DOUBLE dAngle = normalizeAngle(stVec.angle());\\n DOUBLE dDist = stVec.dist();\\n DOUBLE dRange = asin((DOUBLE)sqR / dDist);\\n \\n DOUBLE dBegin, dEnd;\\n if (2 * d_PI < (dAngle + dRange)) {\\n dBegin = 0.0;\\n dEnd = dAngle + dRange - (2 * d_PI);\\n } else {\\n dBegin = MIN(MAX(dAngle - dRange, 0.0), d_PI);\\n dEnd = MIN(dAngle + dRange, d_PI); \\n }\\n\\n\\n\\n// printf(\\\"%0.10f %0.10f\\\\n\\\", dBegin, dEnd);\\n\\n vecBalls.emplace_back(dBegin, dEnd);\\n }\\n sort(vecBalls.begin(), vecBalls.end(), cmpBegin);\\n\\n /**\\n * dp[j][k] 左端がk番目のボールで、\\n * j個を使っているときの最大の角度\\n * dp[j][k] = max(dp[j-1][0] + angle, dp[j-1][1] + angle, dp[j-1][2] + angle ,,,, dp[j-1][k-1] + angle)\\n * \\n */\\n static DOUBLE s_aadDpTbl[MAX_N + 1][MAX_N + 1];\\n for (SQWORD sqIdxJ = 0; sqIdxJ <= sqN; sqIdxJ++) {\\n for (SQWORD sqIdxK = 0; sqIdxK <= sqN; sqIdxK++) {\\n s_aadDpTbl[sqIdxJ][sqIdxK] = 0;\\n }\\n }\\n for (SQWORD sqIdxJ = 0; sqIdxJ < sqN; sqIdxJ++) {\\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK < sqN; sqIdxK++) {\\n DOUBLE dPrevEnd = vecBalls[sqIdxK].dEnd;\\n for (SQWORD sqNextBallIdx = sqIdxK; sqNextBallIdx <= sqN; sqNextBallIdx++) {\\n BALL_ST stBall = vecBalls[sqNextBallIdx];\\n DOUBLE dAddAngle;\\n if (dPrevEnd < stBall.dBegin) {\\n dAddAngle = stBall.dEnd - stBall.dBegin;\\n// printf(\\\"> [%lld %lld %lld] %llf \\\", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \\n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\\n } else {\\n if (dPrevEnd < stBall.dEnd) {\\n dAddAngle = max(0.0, stBall.dEnd - dPrevEnd);\\n s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx] \\n = max(s_aadDpTbl[sqIdxJ + 1][sqNextBallIdx], s_aadDpTbl[sqIdxJ][sqIdxK] + dAddAngle);\\n }\\n// printf(\\\"< [%lld %lld %lld] %llf \\\", sqIdxJ, sqIdxK, sqNextBallIdx, dAddAngle / d_PI);\\n }\\n\\n }\\n }\\n// printf(\\\"\\\\n\\\");\\n }\\n\\n DOUBLE dAns = 0.0;\\n for (SQWORD sqIdxJ = 1; sqIdxJ <= sqK; sqIdxJ++) {\\n for (SQWORD sqIdxK = sqIdxJ; sqIdxK <= sqN; sqIdxK++) {\\n// printf(\\\"%llf \\\", s_aadDpTbl[sqIdxJ][sqIdxK] / d_PI);\\n dAns = max(dAns, s_aadDpTbl[sqIdxJ][sqIdxK]);\\n }\\n// printf(\\\"\\\\n\\\");\\n }\\n\\n printf(\\\"%0.11f\\\\n\\\", dAns / d_PI);\\n\\n return 0;\\n}\",\n \"accuracy\": 0.1267605633802817,\n \"time_ms\": 540,\n \"memory_kb\": 21088,\n \"score_of_the_acc\": -0.7616,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2276_3913623\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#ifdef LOCAL\\n#include \\\"../cxx-prettyprint/prettyprint.hpp\\\"\\n#endif\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> P;\\n\\n#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))\\n#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))\\n#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))\\n#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))\\n#define ALL(x) x.begin(), x.end()\\n\\n#define INF ((1 << 29)-1)\\n#define MOD (1000000007)\\n\\n#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << \\\" \\\"; cout << endl; }\\ntemplate<class T> void print(const T& x){cout << x << endl;}\\ntemplate<class T, class... A> void print(const T& first, const A&... rest) { cout << first << \\\" \\\"; print(rest...); }\\nstruct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;\\n\\n// ベクトル\\nnamespace Geom {\\n\\n const double eps = 1e-9;\\n\\n struct Point {\\n double x, y;\\n explicit Point(double x=0, double y=0): x(x), y(y) {}\\n Point& operator+=(const Point& v){ x += v.x; y+= v.y; return *this;}\\n Point operator+(const Point& v) const{return Point(*this) += v;}\\n Point& operator-=(const Point& v){x -= v.x; y-= v.y; return *this;}\\n Point operator-(const Point& v) const{return Point(*this) -= v;}\\n Point& operator*=(double s){x *= s; y *= s; return *this;}\\n Point operator*(double s) const{return Point(*this) *= s;}\\n Point& operator/=(double s){x /= s; y /= s; return *this;}\\n Point operator/(double s) const{return Point(*this) /= s;}\\n double dot(const Point& v) const {return x*v.x + y*v.y;} /* 内積 */\\n double cross(const Point& v) const {return x*v.y - v.x*y;} /* 外積 */\\n double norm2() const {return x*x + y*y;} /* ノルムの二乗*/\\n double norm() const {return sqrt(norm2());} /* ノルム */\\n int quadrant() const { if(y > 0) return x>0 ? 1:2; else return x>0 ? 4:3;} /* 象限判定 */\\n Point rot(double theta) {return Point(cos(theta) * x - sin(theta) * y, sin(theta) * x + cos(theta) * y);} // 回転\\n Point rot90() {return Point(-y, x);} // 90度回転\\n };\\n\\n ostream& operator<<(ostream& os, const Point& v) {os<<\\\"(\\\"<<v.x<<\\\",\\\"<<v.y<<\\\")\\\"; return os;}\\n istream& operator>>(istream& is, Point& v){ is >> v.x >> v.y; return is;}\\n\\n // 点a, b, cからなる三角形の面積\\n double calc_triangle_area(Point a, Point b, Point c) {\\n Point v1 = b - a;\\n Point v2 = c - a;\\n return abs(v1.cross(v2)) / 2;\\n }\\n\\n // 点a, bを通る直線と点cとの距離\\n double calc_distance_between_point_and_line(Point a, Point b, Point c) {\\n return abs((b-a).cross(c-a)) / (b-a).norm();\\n }\\n\\n // 点a, bを端点とする線分と点cとの距離\\n double calc_distance_between_point_and_segment(Point a, Point b, Point c) {\\n if ((b-a).dot(c-a) < eps) return (c-a).norm();\\n if ((a-b).dot(c-b) < eps) return (c-b).norm();\\n return calc_distance_between_point_and_line(a, b, c);\\n }\\n\\n // 点a, bを端点とする線分と点cと点dを端点とする線分の距離\\n double calc_distance_between_segments(Point a, Point b, Point c, Point d) {\\n double d0 = calc_distance_between_point_and_segment(a, b, c);\\n double d1 = calc_distance_between_point_and_segment(a, b, d);\\n double d2 = calc_distance_between_point_and_segment(c, d, a);\\n double d3 = calc_distance_between_point_and_segment(c, d, b);\\n return min(min(d0, d1), min(d2, d3));\\n }\\n\\n enum RELATION_BETWEEN_SEGMENT_AND_POINT {\\n COUNTER_CLOCKWISE = 1, // p1とp2のp0を挟んだ位置関係が反時計回り\\n CLOCKWISE = -1, // 時計回り\\n ONLINE_BACK = 2, // p1とp2がp0を挟んで直線状にある\\n ONLINE_FRONT = -2, // p0とp2の間にp1がある\\n ON_SEGMENT = 0, // p0とp1の間にp2がある\\n };\\n\\n // 点cが点a, bを端点とする線分のどちら側にあるか、enumで返す\\n RELATION_BETWEEN_SEGMENT_AND_POINT ccw_ex(Point p0, Point p1, Point p2) {\\n Point v1 = p1 - p0;\\n Point v2 = p2 - p0;\\n if(v1.cross(v2) > eps) return COUNTER_CLOCKWISE; // 1\\n if(v1.cross(v2) < -eps) return CLOCKWISE; // -1\\n if(v1.dot(v2) < -eps) return ONLINE_BACK; // 2\\n if(v1.norm() < v2.norm()) return ONLINE_FRONT; // -2\\n return ON_SEGMENT; // 0\\n }\\n\\n // 点cが点a, bを端点とする線分のどちら側にあるか\\n int ccw(Point p0, Point p1, Point p2) {\\n Point v1 = p1 - p0;\\n Point v2 = p2 - p0;\\n if(v1.cross(v2) > eps) return 1;\\n if(v1.cross(v2) < -eps) return -1;\\n return 0;\\n }\\n\\n // p1,p2を端点とする線分Aとp3,p4を端点とする線分Bの交差判定\\n // include_end=trueなら端点が重なっていても交差しているとみなす\\n bool intersect(Point p1, Point p2, Point p3, Point p4, bool include_end=true) {\\n\\n bool is_otherside;\\n bool is_inside;\\n\\n if (include_end){\\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) <= 0; // Aの両側にBの端点があるかどうか。どちらかがAの直線状にいてもOK\\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) <= 0; // Aの端点の内側にBがいるかどうか。\\n } else {\\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) < 0; // Aの両側にBの端点があるかどうか\\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) < 0; // Aの端点の内側にBがいるかどうか\\n }\\n return is_otherside && is_inside;\\n }\\n\\n\\n // 円\\n struct Circle {\\n Point c;\\n double r;\\n Circle(){}\\n Circle(Point c, double r):c(c),r(r){}\\n\\n // 円が点pを含むかどうか include_circumは円周上を含むとするかどうか\\n bool does_include_point(Point p, bool include_circum = true){\\n double d = (p - c).norm();\\n if (include_circum){\\n return d < r + eps;\\n } else {\\n return d < r - eps;\\n }\\n }\\n };\\n\\n // 点p1, p2を通る半径rの円を返す\\n vector<Circle> calc_circle_on_two_points(Point p1, Point p2, double r){\\n\\n Point p12_half = (p2 - p1) / 2.0;\\n\\n double n_vec_norm2 = r*r - p12_half.norm2();\\n if (n_vec_norm2 < 0) return vector<Circle>();\\n\\n double n_vec_norm = sqrt(n_vec_norm2);\\n Point n_vec = p12_half.rot90() * n_vec_norm / p12_half.norm();\\n\\n vector<Circle> ret;\\n ret.emplace_back(p1 + p12_half + n_vec, 1.0);\\n ret.emplace_back(p1 + p12_half - n_vec, 1.0);\\n return ret;\\n }\\n}\\n\\ndouble getRadian(double x, double y) {\\n double radian = atan2(y, x);\\n return radian;\\n}\\n\\ndouble getDegree(double radian) {\\n if(radian < 0) {\\n radian = radian + 2 * M_PI;\\n }\\n return (radian*360) / (2*M_PI);\\n}\\n\\nint main() {\\n#ifdef LOCAL\\n ifstream in(\\\"../in.txt\\\"); cin.rdbuf(in.rdbuf());\\n#endif\\n\\n using namespace Geom;\\n\\n int n, k;\\n cin >> n >> k;\\n\\n vector<Point> point(n);\\n vector<double> radius(n);\\n vector<pair<double, double> > angle(n);\\n REP(i, n) cin >> point[i] >> radius[i];\\n\\n REP(i, n) {\\n double d = sqrt(point[i].x*point[i].x + point[i].y*point[i].y);\\n double center_angle;\\n if(point[i].x == 0) {\\n if(point[i].y == 0) {\\n cout << \\\"1\\\" << endl;\\n return 0;\\n } else if(point[i].y > 0) {\\n center_angle = 90;\\n } else {\\n center_angle = 270;\\n }\\n } else {\\n center_angle = getDegree(getRadian(point[i].x, point[i].y));\\n }\\n\\n double center_tangent_angle = getDegree(getRadian(sqrt(d*d - radius[i]*radius[i]), radius[i]));\\n angle[i].first = center_angle - center_tangent_angle;\\n angle[i].second = center_angle + center_tangent_angle;\\n if(0 <= center_angle && center_angle <= 90) {\\n if(angle[i].first < 0){\\n angle[i].first = 0;\\n }\\n }\\n else if(center_angle <= 180) {\\n if(angle[i].second > 180){\\n angle[i].second = 180;\\n }\\n }\\n else if(center_angle <= 270.0) {\\n if(angle[i].first < 180){\\n angle[i].second = 180;\\n }\\n else{\\n angle[i].first = 0, angle[i].second = 0;\\n }\\n }\\n else{\\n if(angle[i].second > 360){\\n angle[i].first = 0, angle[i].second -=360;\\n }\\n else{\\n angle[i].first = 0, angle[i].second = 0;\\n }\\n }\\n //printf(\\\"center = %f\\\\n\\\", center_angle);\\n //printf(\\\"first = %f, second = %f\\\\n\\\", angle[i].first, angle[i].second);\\n }\\n\\n REP(i, angle.size()){\\n if(angle[i].first == 0 && angle[i].second == 0){\\n angle.erase(angle.begin() + i); \\n }\\n }\\n\\n /* 包含してるものを削除 */\\n REP(i, angle.size()) REP(j, angle.size()){\\n if(i == j) continue;\\n if(angle[j].first <= angle[i].first && angle[i].second <= angle[j].second) {\\n angle.erase(angle.begin() + i);\\n i--;\\n break;\\n }\\n }\\n\\n REP(i, angle.size()){\\n //printf(\\\"first = %f, second = %f\\\\n\\\", angle[i].first, angle[i].second);\\n }\\n\\n angle.insert(angle.begin(), {0, 0});\\n sort(angle.begin(), angle.end());\\n\\n vector<vector<double> > dp;\\n dp.assign(n+1, vector<double>(k+1, 0));\\n\\n int N = angle.size()-1;\\n REPN(i, 1, N + 1){\\n //\\n int l = i;\\n while (l > 0){\\n l--;\\n if (angle[l].second < angle[i].first){\\n break;\\n }\\n }\\n REPN(j, 1, k+1){\\n dp[i][j] = dp[i-1][j];\\n dp[i][j] = max(dp[i][j], dp[l][j-1] + angle[i].second - angle[i].first);\\n dp[i][j] = max(dp[i][j], dp[l+1][j-1] + angle[i].second - angle[l+1].second);\\n }\\n }\\n\\n print(dp[N][k] / 180);\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 20884,\n \"score_of_the_acc\": -0.0026,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2276_3912434\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <algorithm>\\n#include <iostream>\\n#include <vector>\\n#include <cmath>\\n#include <numeric>\\n#include <tuple>\\n#include <iomanip>\\n#include <assert.h>\\n\\n#define sqr(x) std::pow(x, 2.0)\\n#define INF 1e10\\n#define EPS 1e-10\\n#define REP(i, n) for (int i = 0; i < n; i++)\\n#define POS_OR_INF(x) (x > 0 ? x : INF)\\n\\nusing namespace std;\\n\\nusing ld = long double;\\n\\nstruct Point {\\n\\tPoint() = default;\\n\\tPoint(ld x, ld y) : x(x), y(y) {}\\n\\tPoint(const Point& s, const Point& e) : x(e.x - s.x), y(e.y - s.y) {}\\n\\n\\tPoint normalized(void) const {\\n\\t\\treturn Point(x / norm(), y / norm());\\n\\t}\\n\\n\\tld norm(void) const {\\n\\t\\treturn sqrt(x * x + y * y);\\n\\t}\\n\\n\\tPoint flipped(void) const {\\n\\t\\treturn Point(-x, -y);\\n\\t}\\n\\n\\tPoint normal_vector(bool normalize = false) const {\\n\\t\\tauto vec = Point(-y, x);\\n\\t\\treturn normalize ? vec.normalized() : vec;\\n\\t}\\n\\n\\tld x, y;\\n};\\n\\nusing Vector = Point;\\n\\ninline Vector points2vec(const Point& s, const Point& e) {\\n\\treturn Vector(e.x - s.x, e.y - s.y);\\n}\\n\\ninline ld distance(const Point& s, const Point& e) {\\n\\treturn points2vec(s, e).norm();\\n}\\n\\ninline ld distance_square(const Point& s, const Point& e) {\\n\\treturn pow(points2vec(s, e).norm(), 2.0);\\n}\\n\\ninline Vector operator * (const Vector& l, ld r) {\\n\\treturn Vector(l.x * r, l.y * r);\\n}\\n\\ninline Vector operator * (ld l, const Vector& r) {\\n\\treturn r * l;\\n}\\n\\ninline Vector operator / (const Vector& l, ld r) {\\n\\treturn Vector(l.x / r, l.y / r);\\n}\\n\\ninline Point operator + (const Point& l, const Point& r) {\\n\\treturn Point(l.x + r.x, l.y + r.y);\\n}\\n\\ninline Point operator - (const Point& l, const Point& r) {\\n\\treturn Point(l.x - r.x, l.y - r.y);\\n}\\n\\ninline istream& operator >> (istream& is, Point& p) {\\n\\treturn is >> p.x >> p.y;\\n}\\n\\nint main(int argc, char** argv) {\\n\\tint N, K;\\n\\n\\tcin >> N >> K;\\n\\tcout << fixed << setprecision(20);\\n\\n\\tvector<pair<double, double>> a(N), b;\\n\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tPoint p;\\n\\t\\tdouble r;\\n\\t\\tcin >> p >> r;\\n\\n\\t\\tdouble theta = asin(r/p.norm());\\n\\t\\tdouble rad = atan2(p.y, p.x);\\n\\n\\t\\tif (rad < -M_PI / 2) rad += 2 * M_PI;\\n\\n\\t\\ta[i].first = min(M_PI, max(0.0, rad - theta));\\n\\t\\ta[i].second = min(M_PI, max(0.0, rad + theta));\\n\\t}\\n\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tbool included = false;\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tif (a[i].first > a[j].first && a[i].second < a[j].second)\\n\\t\\t\\t\\tincluded = true;\\n\\t\\t}\\n\\t\\tif (!included) {\\n\\t\\t\\tb.push_back(a[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tsort(b.begin(), b.end());\\n\\n\\tint M = b.size();\\n\\n\\tvector<vector<double>> dp(K + 1, vector<double>(M + 1, 0));\\n\\tdouble ans = 0;\\n\\n\\tfor (int i = 1; i <= K; i++) {\\n\\t\\tfor (int j = 0; j < M; j++) {\\n\\t\\t\\tdouble best = 0;\\n\\t\\t\\tint k = 0;\\n\\n\\t\\t\\twhile (b[k].second < b[j].first) {\\n\\t\\t\\t\\tbest = max(best, dp[i-1][k]);\\n\\t\\t\\t\\tk++;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tdp[i][j] = max(dp[i][j], best + b[j].second - b[j].first);\\n\\n\\t\\t\\t//for (; k < j; k++) {\\n\\t\\t\\tdp[i][j] = max(dp[i][j], dp[i-1][k] + b[j].second - b[k].second);\\n\\t\\t\\t//}\\n\\t\\t\\tans = max(ans, dp[i][j]);\\n\\t\\t}\\n\\t}\\n\\n\\tcout << ans / M_PI;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 20696,\n \"score_of_the_acc\": -0.4722,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2276_3894169\",\n \"code_snippet\": \"// aribon3-6_f\\n#include <bits/stdc++.h>\\n#ifdef LOCAL\\n#include \\\"../cxx-prettyprint/prettyprint.hpp\\\"\\n#endif\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<int, int> P;\\n\\n#define REP(i, n) for (int (i) = 0 ; (i) < (int)(n) ; ++(i))\\n#define REPN(i, m, n) for (int (i) = m ; (i) < (int)(n) ; ++(i))\\n#define REP_REV(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))\\n#define REPN_REV(i, m, n) for (int (i) = (int)(n) - 1 ; (i) >= m ; --(i))\\n#define ALL(x) x.begin(), x.end()\\n\\n#define INF ((1 << 29)-1)\\n#define MOD (1000000007)\\n\\n#define print2D(h, w, arr) REP(i, h) { REP(j, w) cout << arr[i][j] << \\\" \\\"; cout << endl; }\\ntemplate<class T> void print(const T& x){cout << x << endl;}\\ntemplate<class T, class... A> void print(const T& first, const A&... rest) { cout << first << \\\" \\\"; print(rest...); }\\nstruct PreMain {PreMain(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} premain;\\n\\n// ベクトル\\nnamespace Geom {\\n #define _USE_MATH_DEFINES\\n\\n const double eps = 1e-9;\\n\\n struct Point {\\n double x, y;\\n explicit Point(double x=0, double y=0): x(x), y(y) {}\\n Point& operator+=(const Point& v){ x += v.x; y+= v.y; return *this;}\\n Point operator+(const Point& v) const{return Point(*this) += v;}\\n Point& operator-=(const Point& v){x -= v.x; y-= v.y; return *this;}\\n Point operator-(const Point& v) const{return Point(*this) -= v;}\\n Point& operator*=(double s){x *= s; y *= s; return *this;}\\n Point operator*(double s) const{return Point(*this) *= s;}\\n Point& operator/=(double s){x /= s; y /= s; return *this;}\\n Point operator/(double s) const{return Point(*this) /= s;}\\n double dot(const Point& v) const {return x*v.x + y*v.y;} /* 内積 */\\n double cross(const Point& v) const {return x*v.y - v.x*y;} /* 外積 */\\n double norm2() const {return x*x + y*y;} /* ノルムの二乗*/\\n double norm() const {return sqrt(norm2());} /* ノルム */\\n int quadrant() const { if(y > 0) return x>0 ? 1:2; else return x>0 ? 4:3;} /* 象限判定 */\\n Point rot(double theta) {return Point(cos(theta) * x - sin(theta) * y, sin(theta) * x + cos(theta) * y);} // 回転\\n Point rot90() {return Point(-y, x);} // 90度回転\\n };\\n ostream& operator<<(ostream& os, const Point& v) {os<<\\\"(\\\"<<v.x<<\\\",\\\"<<v.y<<\\\")\\\"; return os;}\\n istream& operator>>(istream& is, Point& v){ is >> v.x >> v.y; return is;}\\n\\n // 点a, b, cからなる三角形の面積\\n double calc_triangle_area(Point a, Point b, Point c) {\\n Point v1 = b - a;\\n Point v2 = c - a;\\n return abs(v1.cross(v2)) / 2;\\n }\\n\\n // 点a, bを通る直線と点cとの距離\\n double calc_distance_between_point_and_line(Point a, Point b, Point c) {\\n return abs((b-a).cross(c-a)) / (b-a).norm();\\n }\\n\\n // 点a, bを端点とする線分と点cとの距離\\n double calc_distance_between_point_and_segment(Point a, Point b, Point c) {\\n if ((b-a).dot(c-a) < eps) return (c-a).norm();\\n if ((a-b).dot(c-b) < eps) return (c-b).norm();\\n return calc_distance_between_point_and_line(a, b, c);\\n }\\n\\n // 点a, bを端点とする線分と点cと点dを端点とする線分の距離\\n double calc_distance_between_segments(Point a, Point b, Point c, Point d) {\\n double d0 = calc_distance_between_point_and_segment(a, b, c);\\n double d1 = calc_distance_between_point_and_segment(a, b, d);\\n double d2 = calc_distance_between_point_and_segment(c, d, a);\\n double d3 = calc_distance_between_point_and_segment(c, d, b);\\n return min(min(d0, d1), min(d2, d3));\\n }\\n\\n enum RELATION_BETWEEN_SEGMENT_AND_POINT {\\n COUNTER_CLOCKWISE = 1, // p1とp2のp0を挟んだ位置関係が反時計回り\\n CLOCKWISE = -1, // 時計回り\\n ONLINE_BACK = 2, // p1とp2がp0を挟んで直線状にある\\n ONLINE_FRONT = -2, // p0とp2の間にp1がある\\n ON_SEGMENT = 0, // p0とp1の間にp2がある\\n };\\n\\n // 点cが点a, bを端点とする線分のどちら側にあるか、enumで返す\\n RELATION_BETWEEN_SEGMENT_AND_POINT ccw_ex(Point p0, Point p1, Point p2) {\\n Point v1 = p1 - p0;\\n Point v2 = p2 - p0;\\n if(v1.cross(v2) > eps) return COUNTER_CLOCKWISE; // 1\\n if(v1.cross(v2) < -eps) return CLOCKWISE; // -1\\n if(v1.dot(v2) < -eps) return ONLINE_BACK; // 2\\n if(v1.norm() < v2.norm()) return ONLINE_FRONT; // -2\\n return ON_SEGMENT; // 0\\n }\\n\\n // 点cが点a, bを端点とする線分のどちら側にあるか\\n int ccw(Point p0, Point p1, Point p2) {\\n Point v1 = p1 - p0;\\n Point v2 = p2 - p0;\\n if(v1.cross(v2) > eps) return 1;\\n if(v1.cross(v2) < -eps) return -1;\\n return 0;\\n }\\n\\n // p1,p2を端点とする線分Aとp3,p4を端点とする線分Bの交差判定\\n // include_end=trueなら端点が重なっていても交差しているとみなす\\n bool intersect(Point p1, Point p2, Point p3, Point p4, bool include_end=true) {\\n\\n bool is_otherside;\\n bool is_inside;\\n\\n if (include_end){\\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) <= 0; // Aの両側にBの端点があるかどうか。どちらかがAの直線状にいてもOK\\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) <= 0; // Aの端点の内側にBがいるかどうか。\\n } else {\\n is_otherside = ccw(p1,p2,p3) * ccw(p1,p2,p4) < 0; // Aの両側にBの端点があるかどうか\\n is_inside = ccw(p3,p4,p1) * ccw(p3,p4,p2) < 0; // Aの端点の内側にBがいるかどうか\\n }\\n return is_otherside && is_inside;\\n }\\n\\n\\n // 円\\n struct Circle {\\n Point c;\\n double r;\\n Circle(){}\\n Circle(Point c, double r):c(c),r(r){}\\n\\n // 円が点pを含むかどうか include_circumは円周上を含むとするかどうか\\n bool does_include_point(Point p, bool include_circum = true){\\n double d = (p - c).norm();\\n if (include_circum){\\n return d < r + eps;\\n } else {\\n return d < r - eps;\\n }\\n }\\n };\\n ostream& operator<<(ostream& os, const Circle& c) {os<<\\\"(\\\"<<c.c<<\\\",\\\"<<c.r<<\\\")\\\"; return os;}\\n istream& operator>>(istream& is, Circle& c){ is >> c.c >> c.r; return is;}\\n\\n // 点p1, p2を通る半径rの円を返す\\n vector<Circle> calc_circle_on_two_points(Point p1, Point p2, double r){\\n\\n Point p12_half = (p2 - p1) / 2.0;\\n\\n double n_vec_norm2 = r*r - p12_half.norm2();\\n if (n_vec_norm2 < 0) return vector<Circle>();\\n\\n double n_vec_norm = sqrt(n_vec_norm2);\\n Point n_vec = p12_half.rot90() * n_vec_norm / p12_half.norm();\\n\\n vector<Circle> ret;\\n ret.emplace_back(p1 + p12_half + n_vec, 1.0);\\n ret.emplace_back(p1 + p12_half - n_vec, 1.0);\\n return ret;\\n }\\n\\n // 点pを通る、円Cの２つの接線の傾きの角度を返す [0, 2π]で返す\\n pair<double, double> calc_tangent_line_on_circle(Circle c, Point p){\\n Point pc = c.c - p;\\n double angle0 = atan2(pc.y, pc.x);\\n double l2 = pc.norm2() - c.r*c.r;\\n if (l2 < 0) {\\n return {0, 2*M_PI};\\n }\\n double l = sqrt(l2);\\n double angle1 = angle0 - atan2(c.r, l);\\n double angle2 = angle0 + atan2(c.r, l);\\n angle1 = angle1 >= 0 ? angle1 : angle1 + 2*M_PI;\\n angle2 = angle2 >= 0 ? angle2 : angle2 + 2*M_PI;\\n\\n return {angle1, angle2};\\n }\\n\\n}\\n\\n\\nint main() {\\n#ifdef LOCAL\\n ifstream in(\\\"../arg.txt\\\"); cin.rdbuf(in.rdbuf());\\n#endif\\n\\n using namespace Geom;\\n\\n int N, K;\\n cin >> N >> K;\\n vector<Circle> circles(N);\\n REP(i, N) cin >> circles[i];\\n\\n vector<pair<double, double>> intervals(N);\\n REP(i, N){\\n auto thetas = calc_tangent_line_on_circle(circles[i], Point(0.0, 0.0));\\n if (thetas.first == 0 && thetas.second == 2*M_PI) {\\n print(1.0);\\n return 0;\\n }\\n\\n if (thetas.first >= M_PI && thetas.second >= M_PI){\\n intervals[i] = {0, 0};\\n } else if (thetas.first >= M_PI) {\\n intervals[i] = {0, thetas.second};\\n } else if (thetas.second >= M_PI){\\n intervals[i] = {thetas.first, M_PI};\\n } else {\\n intervals[i] = {thetas.first, thetas.second};\\n }\\n }\\n\\n // 他の要素に包含される要素を削除\\n REP(i, intervals.size()) REP(j, intervals.size()){\\n if (i == j) continue;\\n\\n if (intervals[j].first <= intervals[i].first && intervals[i].second <= intervals[j].second) {\\n intervals.erase(intervals.begin() + i);\\n i--;\\n break;\\n }\\n }\\n\\n intervals.insert(intervals.begin(), {0, 0});\\n sort(ALL(intervals));\\n\\n vector<vector<double>> dp;\\n dp.assign(N+1, vector<double>(K+1, 0));\\n\\n int n = intervals.size()-1;\\n REPN(i, 1, n+1){\\n //\\n int l = i;\\n while (l > 0){\\n l--;\\n if (intervals[l].second < intervals[i].first){\\n break;\\n }\\n }\\n REPN(j, 1, K+1){\\n dp[i][j] = dp[i-1][j];\\n dp[i][j] = max(dp[i][j], dp[l][j-1] + intervals[i].second - intervals[i].first);\\n dp[i][j] = max(dp[i][j], dp[l+1][j-1] + intervals[i].second - intervals[l+1].second);\\n }\\n }\\n\\n print(dp[n][K] / M_PI);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 20988,\n \"score_of_the_acc\": -0.0035,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2276_3828008\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef pair<double,double> PA;\\n\\nint n,k;\\nvector<PA> p;\\ndouble memo[1510][1510];\\n\\ndouble dp(int a,int b){\\n \\n if(b >= k) return 0;\\n if(memo[a][b] != -1.0) return memo[a][b];\\n \\n double res,add;\\n int i,num;\\n res = 0;\\n add = 0;\\n num = a+1;\\n for(i=a+1;i<p.size()&&p[i].first<p[a].second;i++){\\n if(add < p[i].second-p[a].second){\\n num = i;\\n add = p[i].second-p[a].second;\\n }\\n }\\n if(i != a+1) res = max(res,dp(num,b+1)+add);\\n for(int j=i;j<p.size();j++){\\n add = p[j].second-p[j].first;\\n res = max(res,dp(j,b+1)+add);\\n }\\n \\n return memo[a][b] = res;\\n}\\n\\nint main()\\n{\\n \\n double x,y,r,as,at,ll,rr;\\n vector<PA> vec;\\n \\n scanf(\\\"%d %d\\\",&n,&k);\\n for(int i=0;i<n;i++){\\n scanf(\\\"%lf %lf %lf\\\",&x,&y,&r);\\n if(y+r < 0) continue;\\n as = asin(r/sqrt(x*x+y*y));\\n at = atan2(y,x);\\n ll = at-as;\\n rr = at+as;\\n if(ll < -M_PI){\\n ll += 2*M_PI;\\n rr += 2*M_PI;\\n }\\n vec.push_back( PA(max(0.0,ll),min(M_PI,rr)) );\\n }\\n \\n sort(vec.begin(),vec.end());\\n \\n double ma = 0.0;\\n p.push_back(PA(0.0,0.0));\\n for(int i=0;i<vec.size();i++){\\n if(ma == M_PI) break;\\n if(ma < vec[i].second){\\n if(i < vec.size()-1 && vec[i].first == vec[i+1].first) continue;\\n ma = vec[i].second;\\n p.push_back(vec[i]);\\n }\\n }\\n fill_n(*memo,1510*1510,-1.0);\\n printf(\\\"%.13f\\\\n\\\",dp(0,0)/M_PI);\\n \\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 21616,\n \"score_of_the_acc\": -0.7666,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2276_1268316\",\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 n,K;\\n\\tscanf(\\\"%d%d\\\",&n,&K);\\n\\n\\tvector<pair<double,double>> ps;\\n\\tconst double PI=3.14159265359;\\n\\trep(i,0,n){\\n\\t\\tdouble x,y,r;\\n\\t\\tscanf(\\\"%lf%lf%lf\\\",&x,&y,&r);\\n\\t\\tif(y+r<=0) continue;\\n\\t\\tif(y-r<=0){\\n\\t\\t\\tdouble f,s;\\n\\t\\t\\tif(x<0){\\n\\t\\t\\t\\tf=atan2(y,x)-asin(r/sqrt(x*x+y*y));\\n\\t\\t\\t\\ts=PI;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tf=0;\\n\\t\\t\\t\\ts=atan2(y,x)+asin(r/sqrt(x*x+y*y));\\n\\t\\t\\t}\\n\\t\\t\\twhile(f<0) f+=PI;\\n\\t\\t\\twhile(s<0) s+=PI;\\n\\t\\t\\tps.push_back(mp(f,s));\\n\\t\\t}else ps.push_back(mp(atan2(y,x)-asin(r/sqrt(x*x+y*y)),atan2(y,x)+asin(r/sqrt(x*x+y*y))));\\n\\t}\\n\\t\\n\\tsort(ps.begin(),ps.end());\\n\\tps.erase(unique(ps.begin(),ps.end()),ps.end()); //同じ区間があると次の処理で面倒なので消しておく\\n\\n\\t//他の区間に完全に包含されているものを取り除く\\n\\tvector<pair<double,double>> tmp;\\n\\trep(i,0,ps.size()){\\n\\t\\tbool ok=true;\\n\\t\\trep(j,0,ps.size()){\\n\\t\\t\\tif(i==j) continue;\\n\\t\\t\\tif(ps[j].first<=ps[i].first&&ps[i].second<=ps[j].second){\\n\\t\\t\\t\\tok=false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(ok) tmp.push_back(ps[i]);\\n\\t}\\n\\tps=tmp;\\n\\n\\tif(ps.size()==0){\\n\\t\\tcout << 0 << endl;\\n\\t\\treturn;\\n\\t}\\n\\n\\tvector<int> a(ps.size()); //a[i]=i番目の区間とギリギリ重なってる区間。存在しない場合はもっとも近いやつ\\n\\trep(i,1,ps.size()){\\n\\t\\trep(j,0,i+1){\\n\\t\\t\\tif(ps[j].second>=ps[i].first){\\n\\t\\t\\t\\ta[i]=j;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(a[i]==i) a[i]=i-1;\\n\\t}\\n\\n\\tstatic double dp[1500][1501][2]; //dp[i][j][k]=i番目の区間まででj個取って、i番目の区間を使った(k==1)or使わなかった(k==0)ときの最大\\n\\tdp[0][0][0]=0;\\n\\tdp[0][1][1]=ps[0].second-ps[0].first;\\n\\tdouble ans=dp[0][1][1];\\n\\trep(i,1,ps.size()){\\n\\t\\trep(j,0,K+1){\\n\\t\\t\\tdp[i][j][0]=max(dp[i-1][j][0],dp[i-1][j][1]);\\n\\t\\t\\tif(j==0) continue;\\n\\t\\t\\t//a[i]番目の区間を使った場合は重複している部分を取り除く、使わなかった場合は重なっていないのでそのまま足す。\\n\\t\\t\\tdp[i][j][1]=max(dp[a[i]][j-1][1]+ps[i].second-max(ps[i].first,ps[a[i]].second),dp[a[i]][j-1][0]+ps[i].second-ps[i].first);\\n\\t\\t\\tans=max({ans,dp[i][j][1],dp[i][j][0]});\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans/PI);\\n}\\n\\nint main(){\\n\\tSolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 36584,\n \"score_of_the_acc\": -0.1643,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2276_1268307\",\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 n,K;\\n\\tscanf(\\\"%d%d\\\",&n,&K);\\n\\n\\tvector<pair<double,double>> ps;\\n\\tconst double PI=3.14159265359;\\n\\trep(i,0,n){\\n\\t\\tdouble x,y,r;\\n\\t\\tscanf(\\\"%lf%lf%lf\\\",&x,&y,&r);\\n\\t\\tif(y+r<=0) continue;\\n\\t\\tif(y-r<=0){\\n\\t\\t\\tdouble f,s;\\n\\t\\t\\tif(x<0){\\n\\t\\t\\t\\tf=atan2(y,x)-asin(r/sqrt(x*x+y*y));\\n\\t\\t\\t\\ts=PI;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tf=0;\\n\\t\\t\\t\\ts=atan2(y,x)+asin(r/sqrt(x*x+y*y));\\n\\t\\t\\t}\\n\\t\\t\\twhile(f<0) f+=PI;\\n\\t\\t\\twhile(s<0) s+=PI;\\n\\t\\t\\tps.push_back(mp(f,s));\\n\\t\\t}else ps.push_back(mp(atan2(y,x)-asin(r/sqrt(x*x+y*y)),atan2(y,x)+asin(r/sqrt(x*x+y*y))));\\n\\t}\\n\\t\\n\\tsort(ps.begin(),ps.end());\\n\\tps.erase(unique(ps.begin(),ps.end()),ps.end());\\n\\t\\n\\tvector<pair<double,double>> tmp;\\n\\trep(i,0,ps.size()){\\n\\t\\tbool ok=true;\\n\\t\\trep(j,0,ps.size()){\\n\\t\\t\\tif(i==j) continue;\\n\\t\\t\\tif(ps[j].first<=ps[i].first&&ps[i].second<=ps[j].second){\\n\\t\\t\\t\\tok=false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(ok) tmp.push_back(ps[i]);\\n\\t}\\n\\tps=tmp;\\n\\n\\tif(ps.size()==0){\\n\\t\\tcout << 0 << endl;\\n\\t\\treturn;\\n\\t}\\n\\n\\tvector<int> a(ps.size());\\n\\trep(i,1,ps.size()){\\n\\t\\trep(j,0,i+1){\\n\\t\\t\\tif(ps[j].second>=ps[i].first){\\n\\t\\t\\t\\ta[i]=j;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(a[i]==i) a[i]=i-1;\\n\\t}\\n\\n\\tstatic double dp[1500][1501][2];\\n\\tdp[0][0][0]=0;\\n\\tdp[0][1][1]=ps[0].second-ps[0].first;\\n\\tdouble ans=dp[0][1][1];\\n\\trep(i,1,ps.size()){\\n\\t\\trep(j,0,K+1){\\n\\t\\t\\tdp[i][j][0]=max(dp[i-1][j][0],dp[i-1][j][1]);\\n\\t\\t\\tif(j==0) continue;\\n\\t\\t\\tdp[i][j][1]=max(dp[a[i]][j-1][1]+ps[i].second-max(ps[i].first,ps[a[i]].second),dp[a[i]][j-1][0]+ps[i].second-ps[i].first);\\n\\t\\t\\tans=max({ans,dp[i][j][1],dp[i][j][0]});\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans/PI);\\n}\\n\\nint main(){\\n\\tSolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 36584,\n \"score_of_the_acc\": -0.1643,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2276_1268305\",\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 n,K;\\n\\tscanf(\\\"%d%d\\\",&n,&K);\\n\\n\\tvector<pair<double,double>> ps;\\n\\tconst double PI=3.14159265359;\\n\\trep(i,0,n){\\n\\t\\tdouble x,y,r;\\n\\t\\tscanf(\\\"%lf%lf%lf\\\",&x,&y,&r);\\n\\t\\tif(y+r<=0) continue;\\n\\t\\tif(y-r<=0){\\n\\t\\t\\tdouble f,s;\\n\\t\\t\\tif(x<0){\\n\\t\\t\\t\\tf=atan2(y,x)-asin(r/sqrt(x*x+y*y));\\n\\t\\t\\t\\ts=PI;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tf=0;\\n\\t\\t\\t\\ts=atan2(y,x)+asin(r/sqrt(x*x+y*y));\\n\\t\\t\\t}\\n\\t\\t\\twhile(f<0) f+=PI;\\n\\t\\t\\twhile(s<0) s+=PI;\\n\\t\\t\\tps.push_back(mp(f,s));\\n\\t\\t}else ps.push_back(mp(atan2(y,x)-asin(r/sqrt(x*x+y*y)),atan2(y,x)+asin(r/sqrt(x*x+y*y))));\\n\\t}\\n\\t\\n\\tsort(ps.begin(),ps.end());\\n\\tps.erase(unique(ps.begin(),ps.end()),ps.end());\\n\\t\\n\\tvector<pair<double,double>> tmp;\\n\\trep(i,0,ps.size()){\\n\\t\\tbool ok=true;\\n\\t\\trep(j,0,ps.size()){\\n\\t\\t\\tif(i==j) continue;\\n\\t\\t\\tif(ps[j].first<=ps[i].first&&ps[i].second<=ps[j].second){\\n\\t\\t\\t\\tok=false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(ok) tmp.push_back(ps[i]);\\n\\t}\\n\\tps=tmp;\\n\\n\\tif(ps.size()==0){\\n\\t\\tcout << 0 << endl;\\n\\t\\treturn;\\n\\t}\\n\\n\\tvector<int> a(ps.size());\\n\\trep(i,1,ps.size()){\\n\\t\\trep(j,0,i+1){\\n\\t\\t\\tif(ps[j].second>=ps[i].first){\\n\\t\\t\\t\\ta[i]=j;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(a[i]==i) a[i]=i-1;\\n\\t}\\n\\n\\tstatic double dp[1500][1501][2];\\n\\tdp[0][0][0]=0;\\n\\tdp[0][1][1]=ps[0].second-ps[0].first;\\n\\tdouble ans=dp[0][1][1];\\n\\trep(i,1,ps.size()){\\n\\t\\trep(j,0,K+1){\\n\\t\\t\\tdp[i][j][0]=max(dp[i-1][j][0],dp[i-1][j][1]);\\n\\t\\t\\tif(j==0) continue;\\n\\t\\t\\tif(j==1) dp[i][j][1]=ps[i].second-ps[i].first;\\n\\t\\t\\tdp[i][j][1]=max(dp[a[i]][j-1][1]+ps[i].second-max(ps[i].first,ps[a[i]].second),dp[a[i]][j-1][0]+ps[i].second-ps[i].first);\\n\\t\\t\\tans=max({ans,dp[i][j][1],dp[i][j][0]});\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans/PI);\\n}\\n\\nint main(){\\n\\tSolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 36584,\n \"score_of_the_acc\": -0.1643,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2276_1170001\",\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; }\\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; }\\n\\n\\n\\ntypedef double DD;\\n\\nconst DD INF = 1LL<<60;\\nconst DD EPS = 1e-10;\\nconst DD PI = acos(-1.0);\\nDD torad(int deg) {return (DD)(deg) * PI / 180;}\\nDD todeg(DD ang) {return ang * 180 / PI;}\\n\\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};\\n\\nPoint operator + (const Point &p, const Point &q) {return Point(p.x + q.x, p.y + q.y);}\\nPoint operator - (const Point &p, const Point &q) {return Point(p.x - q.x, p.y - q.y);}\\nPoint operator * (const Point &p, DD a) {return Point(p.x * a, p.y * a);}\\nPoint operator * (DD a, const Point &p) {return Point(a * p.x, a * p.y);}\\nPoint 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);}\\nPoint operator / (const Point &p, DD a) {return Point(p.x / a, p.y / a);}\\nPoint conj(const Point &p) {return Point(p.x, -p.y);}\\nPoint rot(const Point &p, DD ang) {return Point(cos(ang) * p.x - sin(ang) * p.y, sin(ang) * p.x + cos(ang) * p.y);}\\nPoint rot90(const Point &p) {return Point(-p.y, p.x);}\\nDD cross(const Point &p, const Point &q) {return p.x * q.y - p.y * q.x;}\\nDD dot(const Point &p, const Point &q) {return p.x * q.x + p.y * q.y;}\\nDD norm(const Point &p) {return dot(p, p);}\\nDD abs(const Point &p) {return sqrt(dot(p, p));}\\nDD amp(const Point &p) {DD res = atan2(p.y, p.x); if (res < 0) res += PI*2; return res;}\\nbool eq(const Point &p, const Point &q) {return abs(p - q) < EPS;}\\nbool operator < (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x < q.x : p.y < q.y);}\\nbool operator > (const Point &p, const Point &q) {return (abs(p.x - q.x) > EPS ? p.x > q.x : p.y > q.y);}\\nPoint operator / (const Point &p, const Point &q) {return p * conj(q) / norm(q);}\\n\\nint ccw(const Point &a, const Point &b, const Point &c) {\\n if (cross(b-a, c-a) > EPS) return 1;\\n if (cross(b-a, c-a) < -EPS) return -1;\\n if (dot(b-a, c-a) < -EPS) return 2;\\n if (norm(b-a) < norm(c-a) - EPS) return -2;\\n return 0;\\n}\\n\\nstruct Line : vector<Point> {\\n Line(Point a = Point(0.0, 0.0), Point b = Point(0.0, 0.0)) {\\n this->push_back(a);\\n this->push_back(b);\\n }\\n friend ostream& operator << (ostream &s, const Line &l) {return s << '{' << l[0] << \\\", \\\" << l[1] << '}';}\\n};\\n\\nstruct Circle : Point {\\n DD r;\\n Circle(Point p = Point(0.0, 0.0), DD r = 0.0) : Point(p), r(r) {}\\n friend ostream& operator << (ostream &s, const Circle &c) {return s << '(' << c.x << \\\", \\\" << c.y << \\\", \\\" << c.r << ')';}\\n};\\n\\n\\n\\nvector<Point> tanline(Point p, Circle c) {\\n vector<Point> res;\\n DD d = norm(p - c);\\n DD l = d - c.r * c.r;\\n if (l < -EPS) return res;\\n if (l <= 0.0) l = 0.0;\\n Point cq = (p - c) * (c.r * c.r / d);\\n Point qs = rot90((p - c) * (c.r * sqrt(l) / d));\\n Point s1 = c + cq + qs, s2 = c + cq - qs;\\n res.push_back(s1);\\n res.push_back(s2);\\n return res;\\n}\\n\\n\\n\\nint N, K;\\nCircle cir[3100];\\nDD dp[2100][2100];\\n\\nDD solve() {\\n vector< pair<DD,DD> > inter;\\n for (int i = 0; i < N; ++i) {\\n if (abs(cir[i]) <= cir[i].r + EPS) return 1.0;\\n \\n vector<Point> ps = tanline(Point(0,0), cir[i]);\\n DD left = amp(ps[0]), right = amp(ps[1]);\\n if (left > right) left = 0;\\n chmax(left, 0.0);\\n chmin(right, PI);\\n \\n if (left < right) inter.PB(MP(right, left));\\n //cout << i << \\\" : \\\" << cir[i] << \\\", \\\" << amp(ps[0]) << \\\", \\\" << amp(ps[1]) << \\\" ; \\\" << MP(left, right) << endl;\\n }\\n \\n sort(ALL(inter));\\n for (int i = 0; i < inter.size(); ++i) swap(inter[i].first, inter[i].second);\\n for (int i = 0; i < inter.size(); ++i) {\\n for (int j = i+1; j < inter.size(); ++j) {\\n if (inter[j].first < inter[i].first) {\\n inter.erase(inter.begin() + i--);\\n break;\\n }\\n }\\n }\\n \\n //COUT(inter);\\n \\n for (int i = 0; i < 2100; ++i) for (int j = 0; j < 2100; ++j) dp[i][j] = 0.0;\\n DD res = 0.0;\\n for (int i = 0; i < inter.size(); ++i) {\\n int tmp = i;\\n while (true) {\\n if (inter[tmp].second <= inter[i].first) break;\\n --tmp;\\n if (tmp == -1) break;\\n }\\n for (int k = 0; k <= K; ++k) {\\n chmax(dp[i+1][k], dp[i][k]);\\n chmax(dp[i+1][k+1], dp[tmp+1][k] + inter[i].second - inter[i].first);\\n chmax(dp[i+1][k+1], dp[tmp+2][k] + inter[i].second - inter[tmp+1].second);\\n \\n chmax(res, dp[i+1][k]);\\n }\\n }\\n \\n return res / PI;\\n}\\n\\nint main() {\\n //freopen( \\\"/Users/macuser/Dropbox/Contest/input.in\\\", \\\"r\\\", stdin );\\n \\n while (cin >> N >> K) {\\n for (int i = 0; i < N; ++i) cin >> cir[i].x >> cir[i].y >>cir[i].r;\\n cout << fixed << setprecision(9) << solve() << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 35960,\n \"score_of_the_acc\": -0.1585,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2276_1007644\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\n#include<math.h>\\nusing namespace std;\\ndouble PI=3.14159265359;\\nint x[2000];\\nint y[2000];\\nint r[2000];\\npair<double,double> p[2000];\\npair<double,double> c[2000];\\ndouble dp[2000][2000];\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tfor(int i=0;i<a;i++){\\n\\t\\tscanf(\\\"%d%d%d\\\",x+i,y+i,r+i);\\n\\t\\tdouble d=sqrt(x[i]*x[i]+y[i]*y[i]);\\n\\t\\tdouble q=atan2(y[i],x[i]);\\n\\t\\tif(q<-PI/2)q+=PI*2;\\n\\t\\tdouble v=asin((double)r[i]/d);\\n\\t\\t//printf(\\\"%f %f\\\\n\\\",(q-v)/PI*180,(q+v)/PI*180);\\n\\t\\tp[i]=make_pair(max(0.0,min(PI,q-v)),min(PI,max(0.0,q+v)));\\n\\t}\\n\\tstd::sort(p,p+a);\\n\\tint sz=0;\\n\\tfor(int i=0;i<a;i++){\\n\\t\\tbool ok=true;\\n\\t\\tfor(int j=0;j<a;j++){\\n\\t\\t\\tif(i!=j&&p[j].first<p[i].first&&p[i].second<p[j].second)ok=false;\\n\\t\\t}\\n\\t\\tif(ok){\\n\\t\\t\\tc[sz++]=p[i];\\n\\t\\t}\\n\\t}\\n\\tdouble ret=0;\\n\\tfor(int i=1;i<=b;i++){\\n\\t\\tdouble tmp=0;\\n\\t\\tint at=0;\\n\\t\\tfor(int j=0;j<sz;j++){\\n\\t\\t\\twhile(c[at].second<c[j].first){tmp=max(tmp,dp[i-1][at]);at++;}\\n\\t\\t\\tdp[i][j]=max(tmp+c[j].second-c[j].first,dp[i-1][at]+c[j].second-c[at].second);\\n\\t\\t\\tret=max(ret,dp[i][j]);\\n\\t\\t}\\n\\t}printf(\\\"%.12f\\\\n\\\",ret/PI);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 25808,\n \"score_of_the_acc\": -0.0488,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":1261,"cells":{"group_id":{"kind":"string","value":"aoj_2268_cpp"},"problem_description":{"kind":"string","value":"問題 J : 乱択平衡分二分探索木\nところで，G○○gle Code Jam の地区大会で右の席に座っていた男の\nID は rng_58 と言うらしい．\n東京大学時代の記憶に，似たような ID の仲間が居た覚えがあるが，僕の仲間は一人残さず美少女だったはずだ．\n彼女はいわゆる無表情不思議系キャラだったような気がする．\nということは，彼は知らない男だ．rng とは何の略だろう．\nおそらく Random Number Generator に違いない．\n乱択アルゴリズムを得意とするのだろう．\nところで，乱数を用いた平衡二分探索木である Treap は，\n2011 年頃のプログラミングコンテストではしばしば用いられていたようだが，\n20XX 年の今では，あまり使用されていない．\n当時 Treap は実装が平易であるという理由により Splay 木や Scapegoat 木と並んでよく使われていた．\n20XX 年の今，命をかけたプログラミングコンテストが日常的に行われるこの世界では，\n実装が多少平易になるというような甘い根拠での選択は到底考えられない．\n皆，少しでもプログラムが高速になるよう考えているし，\n世界大会出場者ともなれば，Left-leaning 赤黒木程度なら十数秒で記述できるのが当然だ．\n例えば，Treap が赤黒木よりも遅くなってしまうのは，\n高さの定数倍が効いてくるからであると言われている．\nここは，落ち着いてそれを数値的に考察することにより，精神の安定を取り戻そう．\n問題\nキーを実数とする Treap に\nN\n個のランダムな要素を挿入した際に，\n高さが\nh\n(\nh\n= 0, 1, …,\nN\n- 1\n) となる確率を求めよ．\n以下，より詳しく説明する．\nTreap とは乱数を用いた平衡二分探索木である．\n各ノードは，キーの他に，優先度という値を持つ．\nここでは，キーと優先度は\n0\nから\n1\nまでの実数値とする．\nTreap では，以下の 2 つの条件が常に保たれる．\nキーに関する条件\n各ノードに関して，左の子以下のノードは自分より小さなキーを持つ\n各ノードに関して，右の子以下のノードは自分より大きなキーを持つ\n優先度に関する条件\n各ノードに関して，子のノードは自分より小さな優先度を持つ\n下図は，Treap の例である．\n各ノードの，上部にキーが，下部に優先度が書かれている．\n7 つのノードからなる Treap の例．\n挿入の操作は，以下のように行われる．\n挿入するキー を\nx\nとおく．\n挿入する新しいノードの優先度\np\nを\n0\nから\n1\nまでの一様分布よりランダムに決定する．\n通常の二分探索木と同様に，まずは優先度を無視し新しいノードを挿入する．\n優先度の条件を満たすように，新しいノードを上に持ち上げるような回転操作を必要なだけ繰り返す．\n木の回転操作に関しては，補足の節に詳しく記述したので，参考にせよ．\n下図は，先ほどの例にキーとして 0.5，優先度として 0.7 を持つ頂点を挿入した過程の例である．\nまずは優先度が無視され，ノードが挿入される．\n回転を行い新しいノードが上へ行く．\nさらに回転を行うと，優先度の条件が満たされるので，挿入は終了する．\n空の Treap に\nN\n個のキーを，\nやはり\n0\nから\n1\nまでの一様分布よりランダムに選び挿入してゆくとする．\n最終的に高さが\nh\nとなる確率を，\n各\nh\n= 0, 1, …,\nN\n- 1\nについて求めよ．\nなお，実数は十分な精度を持って扱われるとし，\n例えば 2 つのノードの優先度が等しくなる確率は 0 としてよい．\nまた，高さとは，根のノードから各ノードに至るために通らなければならない辺の本数の最大値である．\n入力\n1 つの整数\nN\nが書かれている．\n出力\n出力は\nN\n行から成る．\ni\n行目に高さが\ni\n- 1\nとなる確率を出力せよ．\n値は小数点以下何桁表示しても構わない．\n制約\n1 ≤\nN\n≤ 3 × 10\n4\n出力する値は\n10\n- 5\n以下の誤差を含んでいても構わない．\n入出力例\n入力例 1:\n1\n入力例 1 に対する出力例:\n1.0\n入力例 2:\n2\n入力例 2 に対する出力例:\n0.0000000000\n1.0000000000\n補足\n木の回転操作には，右回転と左回転がある．\n右回転とは，以下の 2 つの図の 1 つめの状態を 2 つめの状態にする操作であり，\n左回転とは，以下の 2 つの図の 2 つめの状態を 1 つめの状態にする操作である．\n右回転をする前，または左回転をした後\n右回転をした後，または左回転をする前\nTreap においては，持ち上げたいノードがその親ノードの左の子であった場合，\n持ち上げたいノードを上図の P とするような右回転を適用し，\n持ち上げたいノードがその親ノードの右の子であった場合，\n持ち上げたいノードを上図の Q とするような左回転を適用する．\n木の回転操作について，より詳しくは，例えば以下を参照せよ．\nhttp://ja.wikipedia.org/wiki/%E6%9C%A8%E3%81%AE%E5%9B%9E%E8%BB%A2\nTreap について，より詳しくは，例えば以下を参照せよ．\nhttp://en.wikipedia.org/wiki/Treap\nhttp://www.prefield.com/algorithm/container/treap.html"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2268_10307688","code_snippet":"// AOJ #2268 Randomized Self-Balancing Binary Search Tree\n// 2025.3.17\n\n#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename R>\nvoid fft(vector<complex<R>> &f, int dir) {\n int n = f.size();\n assert(n == (1 << static_cast<int>(log2(n))));\n R theta = dir * 2 * M_PI / n;\n\n for (int m = n; m >= 2; m /= 2) {\n for (int i = 0; i < m / 2; i++) {\n complex<R> w = polar<R>(1, i * theta);\n for (int j = i; j < n; j += m) {\n int k = j + m / 2;\n complex<R> diff = f[j] - f[k];\n f[j] += f[k];\n f[k] = w * diff;\n }\n }\n theta *= 2;\n }\n\n int i = 0;\n for (int j = 1; j < n - 1; j++) {\n for (int k = n / 2; k > (i ^= k); k /= 2);\n if (j < i) swap(f[i], f[j]);\n }\n}\n\ntemplate <typename T, typename R = double>\nvoid conv(vector<T> &a, int result_n) {\n int m = 2 * a.size() - 1;\n int n = pow(2, ceil(log2(m)));\n vector<complex<R>> x(n);\n\n copy(a.begin(), a.end(), x.begin());\n fft(x, +1);\n for (int i = 0; i < n; i++) x[i] *= x[i];\n fft(x, -1);\n\n a.resize(result_n);\n for (int i = 0; i < result_n; i++) a[i] = x[i].real() / n;\n}\n\nint main() {\n int n;\n cin >> n;\n\n int h = min(n, 50);\n vector<double> dp(n + 1, 0);\n dp[0] = 1;\n double last = 0;\n\n for (int j = 1; j <= h; j++) {\n conv(dp, n + 1);\n for (int i = n - 1; i >= 0; i--) {\n dp[i + 1] = dp[i] / (i + 1);\n }\n dp[0] = 1;\n printf(\"%.10lf\\n\", dp[n] - last);\n last = dp[n];\n }\n for (int j = h + 1; j <= n; j++) puts(\"0\");\n return 0;\n}","accuracy":1,"time_ms":470,"memory_kb":4984,"score_of_the_acc":-0.097,"final_rank":1},{"submission_id":"aoj_2268_10274921","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst double PI = acos(-1.0);\n\n// FFT（Cooley-Tukeyアルゴリズム）\nvoid fft(vector<complex<double>> &a, bool invert) {\n int n = (int)a.size();\n for (int i = 1, j = 0; i < n; i++) {\n int bit = n >> 1;\n for (; j & bit; bit >>= 1)\n j -= bit;\n j += bit;\n if (i < j) swap(a[i], a[j]);\n }\n\n for (int len = 2; len <= n; len <<= 1) {\n double ang = 2 * PI / len * (invert ? -1 : 1);\n complex<double> wlen(cos(ang), sin(ang));\n for (int i = 0; i < n; i += len) {\n complex<double> w(1);\n for (int j = 0; j < len / 2; j++) {\n complex<double> u = a[i + j], v = a[i + j + len / 2] * w;\n a[i + j] = u + v;\n a[i + j + len / 2] = u - v;\n w *= wlen;\n }\n }\n }\n\n if (invert) {\n for (int i = 0; i < n; i++)\n a[i] /= n;\n }\n}\n\n// 畳み込み（convolution）: O(N log N)\n// a, b は実数ベクトル。戻り値は a∗b の畳み込みの実部のみを返す。\nvector<double> convolution(const vector<double> &a, const vector<double> &b) {\n int n_fft = 1;\n int result_size = a.size() + b.size() - 1;\n while (n_fft < result_size)\n n_fft <<= 1;\n vector<complex<double>> fa(n_fft), fb(n_fft);\n for (int i = 0; i < (int)a.size(); i++)\n fa[i] = a[i];\n for (int i = a.size(); i < n_fft; i++)\n fa[i] = 0;\n for (int i = 0; i < (int)b.size(); i++)\n fb[i] = b[i];\n for (int i = b.size(); i < n_fft; i++)\n fb[i] = 0;\n\n fft(fa, false);\n fft(fb, false);\n for (int i = 0; i < n_fft; i++)\n fa[i] *= fb[i];\n fft(fa, true);\n\n vector<double> res(result_size);\n for (int i = 0; i < result_size; i++)\n res[i] = fa[i].real();\n return res;\n}\n\n// main：dp層hについての更新を FFT畳み込みで O(n log n) で行う\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n;\n cin >> n;\n\n // dp_prev[x] = dp[x][h-1]、dp_cur[x] = dp[x][h] (0 <= x <= n)\n // 初期条件：h=0 では dp[0][0]=1, dp[x>0][0]=0\n vector<double> dp_prev(n + 1, 0.0), dp_cur(n + 1, 0.0);\n dp_prev[0] = 1.0;\n for (int i = 1; i <= n; i++)\n dp_prev[i] = 0.0;\n\n // 各高さ h = 1,2,...,n について dp[n][h] - dp[n][h-1] を出力\n for (int h = 1; h <= n; h++) {\n if (h >= 50) {\n printf(\"0.0000000000\\n\");\n continue;\n }\n // dp[n][h] = (1/n) * (畳み込み結果の index n-1)\n // つまり、dp[.][h] は dp[.][h-1] 同士の畳み込み結果を利用して求められる。\n vector<double> convRes = convolution(dp_prev, dp_prev);\n\n dp_cur[0] = 1.0; // dp[0][h] = 1\n for (int m = 1; m <= n; m++) {\n // convRes[m-1] = ∑_{i+j = m-1} dp[i][h-1]*dp[j][h-1]\n dp_cur[m] = convRes[m - 1] / m;\n }\n\n // 高さが正確に h となる確率は dp[n][h] - dp[n][h-1]\n double ans = dp_cur[n] - dp_prev[n];\n printf(\"%.10f\\n\", ans);\n\n dp_prev = dp_cur;\n }\n return 0;\n}","accuracy":1,"time_ms":480,"memory_kb":6676,"score_of_the_acc":-0.1267,"final_rank":2},{"submission_id":"aoj_2268_6975824","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nlong double PI = acos(-1);\nvector<complex<long double>> fft(vector<complex<long double>> A, bool inv){\n\tint N = A.size();\n\tcomplex<long double> r = polar((long double) 1, (2 * PI) / (N));\n\tif (inv){\n\t\tr = pow(r, -1);\n\t}\n\tvector<complex<long double>> B(N);\n\tfor (int i = N / 2; i > 0; i /= 2){\n\t\tcomplex<long double> z = pow(r, i);\n\t\tcomplex<long double> z2 = 1;\n\t\tfor (int j = 0; j < N; j += i * 2){\n\t\t\tfor (int k = 0; k < i; k++){\n\t\t\t\tA[i + j + k] *= z2;\n\t\t\t\tB[j / 2 + k] = A[j + k] + A[i + j + k];\n\t\t\t\tB[N / 2 + j / 2 + k] = A[j + k] - A[i + j + k];\n\t\t\t}\n\t\t\tz2 *= z;\n\t\t}\n\t\tswap(A, B);\n\t}\n\tif (inv){\n\t\tfor (int i = 0; i < N; i++){\n\t\t\tA[i] /= N;\n\t\t}\n\t}\n\treturn A;\n}\nvector<long double> convolution(vector<long double> A, vector<long double> B){\n\tint deg = A.size() + B.size() - 1;\n\tint N = 1;\n\twhile (N < deg){\n\t\tN *= 2;\n\t}\n\tvector<complex<long double>> A2(N, 0);\n\tfor (int i = 0; i < A.size(); i++){\n\t\tA2[i] = A[i];\n\t}\n\tvector<complex<long double>> B2(N, 0);\n\tfor (int i = 0; i < B.size(); i++){\n\t\tB2[i] = B[i];\n\t}\n\tA2 = fft(A2, false);\n\tB2 = fft(B2, false);\n\tvector<complex<long double>> C2(N);\n\tfor (int i = 0; i < N; i++){\n\t\tC2[i] = A2[i] * B2[i];\n\t}\n\tC2 = fft(C2, true);\n\tvector<long double> C(deg);\n\tfor (int i = 0; i < deg; i++){\n\t C[i] = C2[i].real();\n\t}\n\treturn C;\n}\nint main(){\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n int M = min(N, 100);\n vector<vector<long double>> dp(M + 1, vector<long double>(N + 1, 0));\n dp[0][0] = 1;\n for (int i = 0; i < M; i++){\n vector<long double> tmp = convolution(dp[i], dp[i]);\n dp[i + 1][0] = 1;\n for (int j = 1; j <= N; j++){\n dp[i + 1][j] = tmp[j - 1] / j;\n }\n }\n for (int i = 1; i <= M; i++){\n cout << max(dp[i][N] - dp[i - 1][N], (long double) 0) << endl;\n }\n for (int i = M; i < N; i++){\n cout << 0 << endl;\n }\n}","accuracy":1,"time_ms":3380,"memory_kb":61956,"score_of_the_acc":-1.7062,"final_rank":13},{"submission_id":"aoj_2268_6975823","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ndouble PI = acos(-1);\nvector<complex<double>> fft(vector<complex<double>> A, bool inv){\n\tint N = A.size();\n\tcomplex<double> r = polar((double) 1, (2 * PI) / (N));\n\tif (inv){\n\t\tr = pow(r, -1);\n\t}\n\tvector<complex<double>> B(N);\n\tfor (int i = N / 2; i > 0; i /= 2){\n\t\tcomplex<double> z = pow(r, i);\n\t\tcomplex<double> z2 = 1;\n\t\tfor (int j = 0; j < N; j += i * 2){\n\t\t\tfor (int k = 0; k < i; k++){\n\t\t\t\tA[i + j + k] *= z2;\n\t\t\t\tB[j / 2 + k] = A[j + k] + A[i + j + k];\n\t\t\t\tB[N / 2 + j / 2 + k] = A[j + k] - A[i + j + k];\n\t\t\t}\n\t\t\tz2 *= z;\n\t\t}\n\t\tswap(A, B);\n\t}\n\tif (inv){\n\t\tfor (int i = 0; i < N; i++){\n\t\t\tA[i] /= N;\n\t\t}\n\t}\n\treturn A;\n}\nvector<double> convolution(vector<double> A, vector<double> B){\n\tint deg = A.size() + B.size() - 1;\n\tint N = 1;\n\twhile (N < deg){\n\t\tN *= 2;\n\t}\n\tvector<complex<double>> A2(N, 0);\n\tfor (int i = 0; i < A.size(); i++){\n\t\tA2[i] = A[i];\n\t}\n\tvector<complex<double>> B2(N, 0);\n\tfor (int i = 0; i < B.size(); i++){\n\t\tB2[i] = B[i];\n\t}\n\tA2 = fft(A2, false);\n\tB2 = fft(B2, false);\n\tvector<complex<double>> C2(N);\n\tfor (int i = 0; i < N; i++){\n\t\tC2[i] = A2[i] * B2[i];\n\t}\n\tC2 = fft(C2, true);\n\tvector<double> C(deg);\n\tfor (int i = 0; i < deg; i++){\n\t C[i] = C2[i].real();\n\t}\n\treturn C;\n}\nint main(){\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n int M = min(N, 100);\n vector<vector<double>> dp(M + 1, vector<double>(N + 1, 0));\n dp[0][0] = 1;\n for (int i = 0; i < M; i++){\n vector<double> tmp = convolution(dp[i], dp[i]);\n dp[i + 1][0] = 1;\n for (int j = 1; j <= N; j++){\n dp[i + 1][j] = max(tmp[j - 1], (double) 0) / j;\n }\n }\n for (int i = 1; i <= M; i++){\n cout << max(dp[i][N] - dp[i - 1][N], (double) 0) << endl;\n }\n for (int i = M; i < N; i++){\n cout << 0 << endl;\n }\n}","accuracy":0.3225806451612903,"time_ms":860,"memory_kb":32608,"score_of_the_acc":-0.6353,"final_rank":17},{"submission_id":"aoj_2268_6975817","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ndouble PI = acos(-1);\nvector<complex<double>> fft(vector<complex<double>> A, bool inv){\n\tint N = A.size();\n\tcomplex<double> r = polar((double) 1, (2 * PI) / (N));\n\tif (inv){\n\t\tr = pow(r, -1);\n\t}\n\tvector<complex<double>> B(N);\n\tfor (int i = N / 2; i > 0; i /= 2){\n\t\tcomplex<double> z = pow(r, i);\n\t\tcomplex<double> z2 = 1;\n\t\tfor (int j = 0; j < N; j += i * 2){\n\t\t\tfor (int k = 0; k < i; k++){\n\t\t\t\tA[i + j + k] *= z2;\n\t\t\t\tB[j / 2 + k] = A[j + k] + A[i + j + k];\n\t\t\t\tB[N / 2 + j / 2 + k] = A[j + k] - A[i + j + k];\n\t\t\t}\n\t\t\tz2 *= z;\n\t\t}\n\t\tswap(A, B);\n\t}\n\tif (inv){\n\t\tfor (int i = 0; i < N; i++){\n\t\t\tA[i] /= N;\n\t\t}\n\t}\n\treturn A;\n}\nvector<double> convolution(vector<double> A, vector<double> B){\n\tint deg = A.size() + B.size() - 1;\n\tint N = 1;\n\twhile (N < deg){\n\t\tN *= 2;\n\t}\n\tvector<complex<double>> A2(N, 0);\n\tfor (int i = 0; i < A.size(); i++){\n\t\tA2[i] = A[i];\n\t}\n\tvector<complex<double>> B2(N, 0);\n\tfor (int i = 0; i < B.size(); i++){\n\t\tB2[i] = B[i];\n\t}\n\tA2 = fft(A2, false);\n\tB2 = fft(B2, false);\n\tvector<complex<double>> C2(N);\n\tfor (int i = 0; i < N; i++){\n\t\tC2[i] = A2[i] * B2[i];\n\t}\n\tC2 = fft(C2, true);\n\tvector<double> C(deg);\n\tfor (int i = 0; i < deg; i++){\n\t C[i] = C2[i].real();\n\t}\n\treturn C;\n}\nint main(){\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n int M = min(N, 100);\n vector<vector<double>> dp(M + 1, vector<double>(N + 1, 0));\n dp[0][0] = 1;\n for (int i = 0; i < M; i++){\n vector<double> tmp = convolution(dp[i], dp[i]);\n dp[i + 1][0] = 1;\n for (int j = 1; j <= N; j++){\n dp[i + 1][j] = tmp[j - 1] / j;\n }\n }\n for (int i = 1; i <= M; i++){\n cout << dp[i][N] - dp[i - 1][N] << endl;\n }\n for (int i = M; i < N; i++){\n cout << 0 << endl;\n }\n}","accuracy":0.3225806451612903,"time_ms":850,"memory_kb":32644,"score_of_the_acc":-0.6335,"final_rank":16},{"submission_id":"aoj_2268_4414300","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i=0;i<n;i++)\n#define repn(i, n) for(int i=1;i<=n;i++)\ntypedef pair<ll,ll> P;\n#define fi first\n#define sc second\n#define pb push_back\n#define mp make_pair\n#define all(x) x.begin(), x.end()\n#define POSL(v, x) lower_bound(v.begin(), v.end(), x) - v.begin()\n\nstruct FFT{\n\tconst double PI = acos(-1.);\n\tstruct cp{\n\t\tdouble x, y; \n\t\tcp(double x = 0, double y = 0) : x(x), y(y) {}\n\t\tcp operator + (const cp & a) { return cp(x+a.x, y+a.y); }\n\t\tcp operator - (const cp & a) { return cp(x-a.x, y-a.y); }\n\t\tcp operator * (const cp & a) { return cp(x*a.x-y*a.y, x*a.y+y*a.x); }\n\t};\n\tcp g[1<<17];\n\tvoid FFTMakeG(int n){\n\t\trep(i, n){\n\t\t\tdouble th = PI * 2.0 * i / n;\n\t\t\tg[i] = cp(cos(th), sin(th));\n\t\t}\n\t}\n\tvoid fft( vector<cp>&z ){\n\t\tint n = z.size();\n\t\tint i, j, k, l, m;\n\t\tfor(i = 1, j = 0; i < n; ++i){\n\t\t\tfor(int k=n>>1;(j^=k) < k ; k >>= 1);\n\t\t\tif(i < j) swap(z[i], z[j]);\n\t\t}\n\t\tfor(l = k = 1, m = __builtin_ctz(n); m--; l |= k <<= 1){\n\t\t\tfor(i = 0;i<n;i++) if(i < (j=i^k)){\n\t\t\t\tcp t = z[j] * g[(i & l) << m];\n\t\t\t\tz[j] = z[i] - t;\n\t\t\t\tz[i] = z[i] + t;\n\t\t\t}\n\t\t}\n\t}\n\tvector<double>conv (vector<double>a){\n\t\tint n = a.size() + a.size();\n\t\tint t = 1;\n\t\twhile(t < n) t <<= 1;\n\t\tFFTMakeG(t);\n\t\tvector<cp>fa, fb;\n\t\trep(i, t){\n\t\t\tif(i < a.size()) fa.pb(cp(a[i]));\n\t\t\telse fa.pb(cp());\n\t\t\t\n\t\t\t//if(i < a.size()) fb.pb(cp(a[i]));\n\t\t\t//else fb.pb(cp());\n\t\t}\n\t\tfft(fa); //fft(fb);\n\t\trep(i, t) fa[i] = fa[i] * fa[i];\n\t\tfor(int l=1,r=t-1;l<r;l++,r--) swap(g[l], g[r]);\n\t\tfft(fa);\n\t\tvector<double>ret;\n\t\trep(i, t) ret.pb(fa[i].x / (double)t);\n\t\treturn ret;\n\t}\n}kaede;\n\ndouble dp[30005][105];\n\n\nint main(){\n\trep(j, 105){\n\t\tdp[0][j] = 1.;\n\t}\n\trepn(j, 104){\n\t\tdp[1][j] = 1.;\n\t}\n\tfor(int j=2;j<105;j++){\n\t\t{\n\t\t\tvector<double>a;\n\t\t\trep(c, 30005) a.pb(dp[c][j-1]);\n\t\t\tauto b = kaede.conv(a);\n\t\t\trep(c, 30003) dp[c+1][j] = b[c] / (double)(c+1);\n\t\t}\n\t}\n\tint n; cin >> n;\n\trepn(i, n){\n\t\tif(i <= 100) printf(\"%.12f\\n\", dp[n][i]-dp[n][i-1]);\n\t\telse puts(\"0\");\n\t}\n}","accuracy":1,"time_ms":910,"memory_kb":32384,"score_of_the_acc":-0.6435,"final_rank":9},{"submission_id":"aoj_2268_3771999","code_snippet":"#include <cmath>\n#include <vector>\n#include <complex>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst double pi = acos(-1);\nvoid discrete_fourier_transform(std::size_t n, std::complex<double> *v, bool rev) {\n\tfor (std::size_t i = 0, j = 1; j < n - 1; ++j) {\n\t\tfor (std::size_t k = n >> 1; k > (i ^= k); k >>= 1);\n\t\tif (i > j) std::swap(v[i], v[j]);\n\t}\n\tfor (std::size_t b = 1; b < n; b <<= 1) {\n\t\tstd::complex<double> wr = std::polar(1.0, (rev ? -1.0 : 1.0) * pi / b);\n\t\tfor (std::size_t i = 0; i < n; i += 2 * b) {\n\t\t\tstd::complex<double> w = 1.0;\n\t\t\tfor (std::size_t j = 0; j < b; ++j) {\n\t\t\t\tstd::complex<double> v0 = v[i + j];\n\t\t\t\tstd::complex<double> v1 = w * v[i + j + b];\n\t\t\t\tv[i + j] = v0 + v1;\n\t\t\t\tv[i + j + b] = v0 - v1;\n\t\t\t\tw *= wr;\n\t\t\t}\n\t\t}\n\t}\n\tif (!rev) return;\n\tfor (std::size_t i = 0; i < n; i++) v[i] /= n;\n}\ndouble prob[54][65555]; complex<double> tmp[65555];\nint main() {\n\tios::sync_with_stdio(false);\n\tint N;\n\tcin >> N;\n\tint b = 1;\n\twhile (b < 2 * (N + 1)) b *= 2;\n\tprob[0][0] = 1.0; prob[0][1] = 1.0;\n\tfor (int i = 0; i < 50; ++i) {\n\t\tfor (int j = 0; j < b; ++j) {\n\t\t\ttmp[j] = (j <= N ? prob[i][j] : 0.0);\n\t\t}\n\t\tdiscrete_fourier_transform(b, tmp, false);\n\t\tfor (int j = 0; j < b; ++j) {\n\t\t\ttmp[j] *= tmp[j];\n\t\t}\n\t\tdiscrete_fourier_transform(b, tmp, true);\n\t\tprob[i + 1][0] = 1.0;\n\t\tfor (int j = 0; j < N; ++j) {\n\t\t\tprob[i + 1][j + 1] = tmp[j].real() / (j + 1);\n\t\t}\n\t}\n\tcout.precision(7);\n\tfor (int i = 0; i < N; ++i) {\n\t\tcout << fixed << (i > 50 ? 0.0 : max(prob[i][N] - (i > 0 ? prob[i - 1][N] : 0.0), 0.0)) << '\\n';\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":400,"memory_kb":16536,"score_of_the_acc":-0.2669,"final_rank":4},{"submission_id":"aoj_2268_3771993","code_snippet":"#include <cmath>\n#include <vector>\n#include <complex>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst double pi = acos(-1);\nvoid discrete_fourier_transform(std::size_t n, std::complex<double> *v, bool rev) {\n\tfor (std::size_t i = 0, j = 1; j < n - 1; ++j) {\n\t\tfor (std::size_t k = n >> 1; k > (i ^= k); k >>= 1);\n\t\tif (i > j) std::swap(v[i], v[j]);\n\t}\n\tfor (std::size_t b = 1; b < n; b <<= 1) {\n\t\tstd::complex<double> wr = std::polar(1.0, (rev ? -1.0 : 1.0) * pi / b);\n\t\tfor (std::size_t i = 0; i < n; i += 2 * b) {\n\t\t\tstd::complex<double> w = 1.0;\n\t\t\tfor (std::size_t j = 0; j < b; ++j) {\n\t\t\t\tstd::complex<double> v0 = v[i + j];\n\t\t\t\tstd::complex<double> v1 = w * v[i + j + b];\n\t\t\t\tv[i + j] = v0 + v1;\n\t\t\t\tv[i + j + b] = v0 - v1;\n\t\t\t\tw *= wr;\n\t\t\t}\n\t\t}\n\t}\n\tif (!rev) return;\n\tfor (std::size_t i = 0; i < n; i++) v[i] /= n;\n}\ndouble prob[64][65555]; complex<double> tmp[65555];\nint main() {\n\tios::sync_with_stdio(false);\n\tint N;\n\tcin >> N;\n\tint b = 1;\n\twhile (b < 2 * (N + 1)) b *= 2;\n\tprob[0][0] = 1.0; prob[0][1] = 1.0;\n\tfor (int i = 0; i < 55; ++i) {\n\t\tfor (int j = 0; j < b; ++j) {\n\t\t\ttmp[j] = (j <= N ? prob[i][j] : 0.0);\n\t\t}\n\t\tdiscrete_fourier_transform(b, tmp, false);\n\t\tfor (int j = 0; j < b; ++j) {\n\t\t\ttmp[j] *= tmp[j];\n\t\t}\n\t\tdiscrete_fourier_transform(b, tmp, true);\n\t\tprob[i + 1][0] = 1.0;\n\t\tfor (int j = 0; j < N; ++j) {\n\t\t\tprob[i + 1][j + 1] = tmp[j].real() / (j + 1);\n\t\t}\n\t}\n\tcout.precision(7);\n\tfor (int i = 0; i < N; ++i) {\n\t\tcout << fixed << (i > 55 ? 0.0 : max(prob[i][N] - (i > 0 ? prob[i - 1][N] : 0.0), 0.0)) << '\\n';\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":610,"memory_kb":17604,"score_of_the_acc":-0.3339,"final_rank":5},{"submission_id":"aoj_2268_3771990","code_snippet":"#include <cmath>\n#include <vector>\n#include <complex>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst double pi = acos(-1);\nvoid discrete_fourier_transform(std::size_t n, std::complex<double> *v, bool rev) {\n\tfor (std::size_t i = 0, j = 1; j < n - 1; ++j) {\n\t\tfor (std::size_t k = n >> 1; k > (i ^= k); k >>= 1);\n\t\tif (i > j) std::swap(v[i], v[j]);\n\t}\n\tfor (std::size_t b = 1; b < n; b <<= 1) {\n\t\tstd::complex<double> wr = std::polar(1.0, (rev ? -1.0 : 1.0) * pi / b);\n\t\tfor (std::size_t i = 0; i < n; i += 2 * b) {\n\t\t\tstd::complex<double> w = 1.0;\n\t\t\tfor (std::size_t j = 0; j < b; ++j) {\n\t\t\t\tstd::complex<double> v0 = v[i + j];\n\t\t\t\tstd::complex<double> v1 = w * v[i + j + b];\n\t\t\t\tv[i + j] = v0 + v1;\n\t\t\t\tv[i + j + b] = v0 - v1;\n\t\t\t\tw *= wr;\n\t\t\t}\n\t\t}\n\t}\n\tif (!rev) return;\n\tfor (std::size_t i = 0; i < n; i++) v[i] /= n;\n}\ndouble prob[64][65555]; complex<double> tmp[65555];\nint main() {\n\tios::sync_with_stdio(false);\n\tint N;\n\tcin >> N;\n\tint b = 1;\n\twhile (b < 2 * (N + 1)) b *= 2;\n\tprob[0][0] = 1.0; prob[0][1] = 1.0;\n\tfor (int i = 0; i < 55; ++i) {\n\t\tfor (int j = 0; j < b; ++j) {\n\t\t\ttmp[j] = (j <= N ? prob[i][j] : 0.0);\n\t\t}\n\t\tdiscrete_fourier_transform(b, tmp, false);\n\t\tfor (int j = 0; j < b; ++j) {\n\t\t\ttmp[j] *= tmp[j];\n\t\t}\n\t\tdiscrete_fourier_transform(b, tmp, true);\n\t\tprob[i + 1][0] = 1.0;\n\t\tfor (int j = 0; j < N; ++j) {\n\t\t\tprob[i + 1][j + 1] = tmp[j].real() / (j + 1);\n\t\t}\n\t}\n\tcout.precision(7);\n\tfor (int i = 0; i < N; ++i) {\n\t\tcout << fixed << (i > 55 ? 0.0 : prob[i][N] - (i > 0 ? prob[i - 1][N] : 0.0)) << '\\n';\n\t}\n\treturn 0;\n}","accuracy":0.3225806451612903,"time_ms":440,"memory_kb":17676,"score_of_the_acc":-0.2948,"final_rank":14},{"submission_id":"aoj_2268_3771960","code_snippet":"#include <cmath>\n#include <vector>\n#include <complex>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst long double pi = acos(-1);\nvoid discrete_fourier_transform(std::size_t n, std::complex<long double> *v, bool rev) {\n\tfor (std::size_t i = 0, j = 1; j < n - 1; ++j) {\n\t\tfor (std::size_t k = n >> 1; k > (i ^= k); k >>= 1);\n\t\tif (i > j) std::swap(v[i], v[j]);\n\t}\n\tfor (std::size_t b = 1; b < n; b <<= 1) {\n\t\tstd::complex<long double> wr = std::polar(1.0L, (rev ? -1.0 : 1.0) * pi / b);\n\t\tfor (std::size_t i = 0; i < n; i += 2 * b) {\n\t\t\tstd::complex<long double> w = 1.0;\n\t\t\tfor (std::size_t j = 0; j < b; ++j) {\n\t\t\t\tstd::complex<long double> v0 = v[i + j];\n\t\t\t\tstd::complex<long double> v1 = w * v[i + j + b];\n\t\t\t\tv[i + j] = v0 + v1;\n\t\t\t\tv[i + j + b] = v0 - v1;\n\t\t\t\tw *= wr;\n\t\t\t}\n\t\t}\n\t}\n\tif (!rev) return;\n\tfor (std::size_t i = 0; i < n; i++) v[i] /= n;\n}\nlong double prob[64][65555]; complex<long double> tmp[65555];\nint main() {\n\tios::sync_with_stdio(false);\n\tint N;\n\tcin >> N;\n\tint b = 1;\n\twhile (b < 2 * (N + 1)) b *= 2;\n\tprob[0][0] = 1.0; prob[0][1] = 1.0;\n\tfor (int i = 0; i < 60; ++i) {\n\t\tfor (int j = 0; j < b; ++j) {\n\t\t\ttmp[j] = (j <= N ? prob[i][j] : 0.0);\n\t\t}\n\t\tdiscrete_fourier_transform(b, tmp, false);\n\t\tfor (int j = 0; j < b; ++j) {\n\t\t\ttmp[j] *= tmp[j];\n\t\t}\n\t\tdiscrete_fourier_transform(b, tmp, true);\n\t\tprob[i + 1][0] = 1.0;\n\t\tfor (int j = 0; j < N; ++j) {\n\t\t\tprob[i + 1][j + 1] = tmp[j].real() / (j + 1);\n\t\t\tif (abs(prob[i + 1][j + 1]) <= 1.0e-8) prob[i + 1][j + 1] = 0.0;\n\t\t}\n\t}\n\tcout.precision(7);\n\tfor (int i = 0; i < N; ++i) {\n\t\tcout << fixed << (i > 60 ? 0.0 : prob[i][N] - (i > 0 ? prob[i - 1][N] : 0.0)) << '\\n';\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":2960,"memory_kb":34008,"score_of_the_acc":-1.1555,"final_rank":11},{"submission_id":"aoj_2268_3771959","code_snippet":"#include <cmath>\n#include <vector>\n#include <complex>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst double pi = acos(-1);\nvoid discrete_fourier_transform(std::size_t n, std::complex<double> *v, bool rev) {\n\tfor (std::size_t i = 0, j = 1; j < n - 1; ++j) {\n\t\tfor (std::size_t k = n >> 1; k > (i ^= k); k >>= 1);\n\t\tif (i > j) std::swap(v[i], v[j]);\n\t}\n\tfor (std::size_t b = 1; b < n; b <<= 1) {\n\t\tstd::complex<double> wr = std::polar(1.0, (rev ? -1.0 : 1.0) * pi / b);\n\t\tfor (std::size_t i = 0; i < n; i += 2 * b) {\n\t\t\tstd::complex<double> w = 1.0;\n\t\t\tfor (std::size_t j = 0; j < b; ++j) {\n\t\t\t\tstd::complex<double> v0 = v[i + j];\n\t\t\t\tstd::complex<double> v1 = w * v[i + j + b];\n\t\t\t\tv[i + j] = v0 + v1;\n\t\t\t\tv[i + j + b] = v0 - v1;\n\t\t\t\tw *= wr;\n\t\t\t}\n\t\t}\n\t}\n\tif (!rev) return;\n\tfor (std::size_t i = 0; i < n; i++) v[i] /= n;\n}\ndouble prob[104][65555]; complex<double> tmp[65555];\nint main() {\n\tios::sync_with_stdio(false);\n\tint N;\n\tcin >> N;\n\tint b = 1;\n\twhile (b < 2 * (N + 1)) b *= 2;\n\tprob[0][0] = 1.0; prob[0][1] = 1.0;\n\tfor (int i = 0; i < 100; ++i) {\n\t\tfor (int j = 0; j < b; ++j) {\n\t\t\ttmp[j] = (j <= N ? prob[i][j] : 0.0);\n\t\t}\n\t\tdiscrete_fourier_transform(b, tmp, false);\n\t\tfor (int j = 0; j < b; ++j) {\n\t\t\ttmp[j] *= tmp[j];\n\t\t}\n\t\tdiscrete_fourier_transform(b, tmp, true);\n\t\tprob[i + 1][0] = 1.0;\n\t\tfor (int j = 0; j < N; ++j) {\n\t\t\tprob[i + 1][j + 1] = tmp[j].real() / (j + 1);\n\t\t\tif (abs(prob[i + 1][j + 1]) <= 1.0e-8) prob[i + 1][j + 1] = 0.0;\n\t\t}\n\t}\n\tcout.precision(7);\n\tfor (int i = 0; i < N; ++i) {\n\t\tcout << fixed << (i > 100 ? 0.0 : prob[i][N] - (i > 0 ? prob[i - 1][N] : 0.0)) << '\\n';\n\t}\n\treturn 0;\n}","accuracy":0.3225806451612903,"time_ms":810,"memory_kb":28456,"score_of_the_acc":-0.5565,"final_rank":15},{"submission_id":"aoj_2268_2662808","code_snippet":"#include <bits/stdc++.h>\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 REP_R(i, n) for (int i = int(n) - 1; (i) >= 0; -- (i))\nusing namespace std;\n\ntemplate <typename R>\nvoid fft_inplace(vector<complex<R> > & f, int dir) {\n int n = f.size();\n assert(n == pow(2, log2(n)));\n R theta = dir * 2 * M_PI / n;\n for (int m = n; m >= 2; m >>= 1) {\n REP (i, m / 2) {\n complex<R> w = polar<R>(1, i * theta);\n for (int j = i; j < n; j += m) {\n int k = j + m / 2;\n complex<R> x = f[j] - f[k];\n f[j] += f[k];\n f[k] = w * x;\n }\n }\n theta *= 2;\n }\n int i = 0;\n REP3 (j, 1, n - 1) {\n for (int k = n >> 1; k > (i ^= k); ) k >>= 1;\n if (j < i) {\n swap(f[i], f[j]);\n }\n }\n}\ntemplate <typename T, typename R = double>\nvoid convolution_self_inplace(vector<T> & a, int result_n) {\n int m = 2 * a.size() - 1;\n int n = pow(2, ceil(log2(m)));\n vector<complex<R> > x(n);\n copy(a.begin(), a.end(), x.begin());\n fft_inplace(x, +1);\n vector<complex<R> > z(n);\n REP (i, n) x[i] *= x[i];\n fft_inplace(x, -1);\n a.resize(result_n);\n REP (i, result_n) a[i] = x[i].real() / n;\n}\n\nint main() {\n // input\n int n; scanf(\"%d\", &n);\n // solve\n const int height = min(n, 50);\n vector<double> dp(n + 1);\n dp[0] = 1;\n double last_dp_n = 0;\n REP3 (j, 1, height + 1) {\n convolution_self_inplace(dp, n + 1);\n REP_R (i, n) {\n dp[i + 1] = dp[i] / (i + 1);\n }\n dp[0] = 1;\n // output\n printf(\"%.10lf\\n\", double(dp[n] - last_dp_n));\n last_dp_n = dp[n];\n }\n REP3 (j, height + 1, n + 1) {\n printf(\"0\\n\");\n }\n return 0;\n}","accuracy":1,"time_ms":680,"memory_kb":5632,"score_of_the_acc":-0.1573,"final_rank":3},{"submission_id":"aoj_2268_2662807","code_snippet":"#include <bits/stdc++.h>\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 REP_R(i, n) for (int i = int(n) - 1; (i) >= 0; -- (i))\nusing namespace std;\n\ntemplate <typename R>\nvoid fft_inplace(vector<complex<R> > & f, int dir) {\n int n = f.size();\n assert(n == pow(2, log2(n)));\n R theta = dir * 2 * M_PI / n;\n for (int m = n; m >= 2; m >>= 1) {\n REP (i, m / 2) {\n complex<R> w = polar<R>(1, i * theta);\n for (int j = i; j < n; j += m) {\n int k = j + m / 2;\n complex<R> x = f[j] - f[k];\n f[j] += f[k];\n f[k] = w * x;\n }\n }\n theta *= 2;\n }\n int i = 0;\n REP3 (j, 1, n - 1) {\n for (int k = n >> 1; k > (i ^= k); ) k >>= 1;\n if (j < i) {\n swap(f[i], f[j]);\n }\n }\n}\ntemplate <typename T, typename R = long double>\nvoid convolution_self_inplace(vector<T> & a, int result_n) {\n int m = 2 * a.size() - 1;\n int n = pow(2, ceil(log2(m)));\n vector<complex<R> > x(n);\n copy(a.begin(), a.end(), x.begin());\n fft_inplace(x, +1);\n vector<complex<R> > z(n);\n REP (i, n) x[i] *= x[i];\n fft_inplace(x, -1);\n a.resize(result_n);\n REP (i, result_n) a[i] = x[i].real() / n;\n}\n\nint main() {\n // input\n int n; scanf(\"%d\", &n);\n // solve\n const int height = min(n, 50);\n vector<long double> dp(n + 1);\n dp[0] = 1;\n long double last_dp_n = 0;\n REP3 (j, 1, height + 1) {\n convolution_self_inplace(dp, n + 1);\n REP_R (i, n) {\n dp[i + 1] = dp[i] / (i + 1);\n }\n dp[0] = 1;\n // output\n printf(\"%.10lf\\n\", double(dp[n] - last_dp_n));\n last_dp_n = dp[n];\n }\n REP3 (j, height + 1, n + 1) {\n printf(\"0\\n\");\n }\n return 0;\n}","accuracy":1,"time_ms":2370,"memory_kb":7936,"score_of_the_acc":-0.5949,"final_rank":7},{"submission_id":"aoj_2268_2662806","code_snippet":"#include <bits/stdc++.h>\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))\nusing namespace std;\n\ntemplate <typename T>\nvoid fft_inplace(vector<complex<T> > & f, int dir) {\n int n = f.size();\n assert (n == pow(2, log2(n)));\n if (n == 1) return;\n vector<complex<T> > a(n / 2), b(n / 2);\n REP (i, n / 2) {\n a[i] = f[2 * i];\n b[i] = f[2 * i+ 1];\n }\n fft_inplace(a, dir);\n fft_inplace(b, dir);\n const complex<T> zeta = polar<T>(1, dir * 2 * M_PI / n);\n complex<T> pow_zeta = 1;\n REP (i, n) {\n f[i] = a[i % (n / 2)] + pow_zeta * b[i % (n / 2)];\n pow_zeta *= zeta;\n }\n}\ntemplate <typename T, typename R = double>\ndeque<T> convolution(deque<T> const & a, deque<T> const & b) {\n int m = a.size() + b.size() - 1;\n int n = pow(2, ceil(log2(m)));\n vector<complex<R> > x(n), y(n);\n copy(a.begin(), a.end(), x.begin());\n copy(b.begin(), b.end(), y.begin());\n fft_inplace(x, +1);\n fft_inplace(y, +1);\n vector<complex<R> > z(n);\n REP (i, n) z[i] = x[i] * y[i];\n fft_inplace(z, -1);\n deque<T> c(m);\n REP (i, m) c[i] = is_integral<T>::value ? round(z[i].real() / n) : z[i].real() / n;\n return c;\n}\n\nint main() {\n // input\n int n; scanf(\"%d\", &n);\n // solve\n const int height = min(n, 50);\n deque<double> dp(n + 1);\n dp[0] = 1;\n double last_dp_n = 0;\n REP3 (j, 1, height + 1) {\n dp = convolution(dp, dp);\n dp.push_front(1);\n dp.resize(n + 1);\n REP (i, n) {\n dp[i + 1] /= (i + 1);\n }\n // output\n printf(\"%.10lf\\n\", dp[n] - last_dp_n);\n last_dp_n = dp[n];\n }\n REP3 (j, height + 1, n + 1) {\n printf(\"0\\n\");\n }\n return 0;\n}","accuracy":0.3225806451612903,"time_ms":4400,"memory_kb":8636,"score_of_the_acc":-1.0873,"final_rank":18},{"submission_id":"aoj_2268_380010","code_snippet":"#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <complex>\n#include <cstring>\nusing namespace std;\n\nconst int MAX_N = 30000<<3;\nconst double PI = 4.0*atan(1.0);\n\nint N, NN;\ndouble prev[MAX_N], cur[MAX_N];\ncomplex<double> xs[MAX_N], zs[MAX_N];\n\nstatic const complex<double> I(0,1);\n\nvoid init(){\n\tscanf(\"%d\", &N);\n}\n\nvoid fft(complex<double> a[], int n, bool inv = false){\n\tdouble theta = 2 * PI / n * (inv ? -1 : 1);\n\tfor(int m=n; m>=2; m>>=1){\n\t\tint mh = m >> 1;\n\t\tfor(int i=0; i<mh; ++i){\n\t\t\tcomplex<double> w = exp(i*theta*I);\n\t\t\tfor(int j=i; j<n; j+=m){\n\t\t\t\tint k = j + mh;\n\t\t\t\tcomplex<double> x = a[j] - a[k];\n\t\t\t\ta[j] += a[k];\n\t\t\t\ta[k] = w * x;\n\t\t\t}\n\t\t}\n\t\ttheta *= 2;\n\t}\n\tint i = 0;\n\tfor(int j=1; j<n-1; ++j){\n\t\tfor(int k=n>>1; k>(i^=k); k>>=1);\n\t\tif(j<i){\n\t\t\tswap(a[i], a[j]);\n\t\t}\n\t}\n\tif(inv){\n\t\tfor(int i=0; i<n; ++i){\n\t\t\ta[i] /= n;\n\t\t}\n\t}\n}\n\nvoid calc(){\n\tfor(int i=0; i<NN; ++i){\n\t\txs[i] = complex<double>(prev[i], 0.0);\n\t}\n\tfft(xs, NN);\n\tfor(int i=0; i<NN; ++i){\n\t\tzs[i] = xs[i] * xs[i];\n\t}\n\tfft(zs, NN, true);\n\tmemset(cur, 0, sizeof(cur));\n\tcur[0] = 1.0;\n\tfor(int i=1; i<=N; ++i){\n\t\tcur[i] = zs[i-1].real() / i;\n\t}\n}\n\nvoid solve(){\n\tNN = 4<<(31 - __builtin_clz(N));\n\tfill(prev, prev+NN, 0.0);\n\tprev[0] = prev[1] = 1.0;\n\tbool small = false;\n\tprintf(\"%f\\n\", prev[N]);\n\tfor(int i=0; i<N-1; ++i){\n\t\tif(small){\n\t\t\tputs(\"0.0\");\n\t\t}\n\t\telse{\n\t\t\tcalc();\n\t\t\tprintf(\"%.12f\\n\", cur[N] - prev[N]);\n\n\t\t\tif(i>50 && cur[N] - prev[N] < 1e-5){\n\t\t\t\tsmall = true;\n\t\t\t}\n\t\t\tmemcpy(prev, cur, sizeof(prev));\n\t\t}\n\t}\n}\n\nint main(){\n\tinit();\n\tsolve();\n\n\treturn 0;\n}","accuracy":1,"time_ms":2250,"memory_kb":0,"score_of_the_acc":-0.4384,"final_rank":6},{"submission_id":"aoj_2268_294257","code_snippet":"#include <iostream>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n\nusing namespace std;\n\ninline int getInt(){ int s; scanf(\"%d\", &s); return s; }\n\n// sizeof v must be 2 ^ n\ntemplate<class T>\nvoid fft_core(vector<complex<T> > &v, bool rev = false){\n const int n = v.size();\n\n for(int i = 0; i < n; i++){\n int k = 0;\n int b = (n >> 1);\n int a = 1;\n\n while(b >= a){\n if(b & i) k |= a;\n if(a & i) k |= b;\n b >>= 1;\n a <<= 1;\n }\n\n if(i < k) swap(v[i], v[k]);\n }\n\n int m = 2;\n\n while(m <= n){\n double arg = -2.0 * M_PI / m;\n complex<T> w(cos(arg), sin(arg));\n if(rev) w = 1.0 / w;\n\n for(int i = 0; i < n; i += m){\n complex<T> ww(1.0);\n\n for(int j = 0; j < m / 2; j++){\n\tint a = i + j;\n\tint b = i + j + m / 2;\n\tcomplex<T> t = ww * v[b];\n\n\tv[b] = v[a] - t;\n\tv[a] = v[a] + t;\n\n\tww *= w;\n }\n }\n m *= 2;\n }\n\n if(rev){\n double s = (double)n;\n for(int i = 0; i < n; i++)\n v[i] /= s;\n }\n}\n\ntemplate<class T> inline void fft(vector<T> &v){ fft_core(v); }\ntemplate<class T> inline void ifft(vector<T> &v){ fft_core(v, true); }\n\nint next(int n){\n int i = 1;\n while(i < n) i *= 2;\n return i;\n}\n\n\nint main(){\n int n = getInt();\n int m = next(n + 1);\n int mm = m * 2;\n vector<complex<double> > p(mm, 0.0);\n double prev = 0.0;\n p[0] = 1.0;\n \n for(int i = 1; i <= n; i++){\n if(i < 51){\n fft(p);\n\n for(int j = mm - 1; j >= 0; j--){\n\tp[j] = p[j] * p[j];\n }\n \n ifft(p);\n\n for(int j = mm - 1; j >= 1; j--){\n\tp[j] = p[j - 1];\n }\n p[0] = 1.0;\n for(int j = 1; j < mm / 2; j++)\n\tp[j] /= j;\n for(int j = mm / 2; j < mm; j++)\n\tp[j] = 0.0;\n \n double ans = n >= p.size() ? 0.0 : p[n].real();\n double pans = (ans - prev);\n if(ans > 1e-10) pans += 0.000007;\n printf(\"%.7f\\n\", max(0.0, pans) + 1e-10);\n prev = ans;\n }else{\n printf(\"%.7f\\n\", 0.0 + 1e-10);\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":2980,"memory_kb":0,"score_of_the_acc":-0.6114,"final_rank":8},{"submission_id":"aoj_2268_294255","code_snippet":"#include <iostream>\n#include <cstdlib>\n#include <algorithm>\n#include <queue>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n\nusing namespace std;\n\ninline int getInt(){ int s; scanf(\"%d\", &s); return s; }\n\n// sizeof v must be 2 ^ n\ntemplate<class T>\nvoid fft_core(vector<complex<T> > &v, bool rev = false){\n const int n = v.size();\n\n for(int i = 0; i < n; i++){\n int k = 0;\n int b = (n >> 1);\n int a = 1;\n\n while(b >= a){\n if(b & i) k |= a;\n if(a & i) k |= b;\n b >>= 1;\n a <<= 1;\n }\n\n if(i < k) swap(v[i], v[k]);\n }\n\n int m = 2;\n\n while(m <= n){\n double arg = -2.0 * M_PI / m;\n complex<T> w(cos(arg), sin(arg));\n if(rev) w = 1.0 / w;\n\n for(int i = 0; i < n; i += m){\n complex<T> ww(1.0);\n\n for(int j = 0; j < m / 2; j++){\n\tint a = i + j;\n\tint b = i + j + m / 2;\n\tcomplex<T> t = ww * v[b];\n\n\tv[b] = v[a] - t;\n\tv[a] = v[a] + t;\n\n\tww *= w;\n }\n }\n m *= 2;\n }\n\n if(rev){\n double s = (double)n;\n for(int i = 0; i < n; i++)\n v[i] /= s;\n }\n}\n\ntemplate<class T> inline void fft(vector<T> &v){ fft_core(v); }\ntemplate<class T> inline void ifft(vector<T> &v){ fft_core(v, true); }\n\nint next(int n){\n int i = 1;\n while(i < n) i *= 2;\n return i;\n}\n\n\nint main(){\n int n = getInt();\n int m = next(n + 1);\n int mm = m * 2;\n vector<complex<double> > p(mm, 0.0);\n double prev = 0.0;\n p[0] = 1.0;\n \n for(int i = 1; i <= n; i++){\n if(i < 80){\n fft(p);\n\n for(int j = mm - 1; j >= 0; j--){\n\tp[j] = p[j] * p[j];\n }\n \n ifft(p);\n\n for(int j = mm - 1; j >= 1; j--){\n\tp[j] = p[j - 1];\n }\n p[0] = 1.0;\n for(int j = 1; j < mm / 2; j++)\n\tp[j] /= j;\n for(int j = mm / 2; j < mm; j++)\n\tp[j] = 0.0;\n \n double ans = n >= p.size() ? 0.0 : p[n].real();\n double pans = (ans - prev);\n if(ans > 1e-10) pans += 0.000007;\n printf(\"%.7f\\n\", max(0.0, pans) + 1e-10);\n prev = ans;\n }else{\n printf(\"%.7f\\n\", 0.0 + 1e-10);\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":4620,"memory_kb":0,"score_of_the_acc":-1,"final_rank":10},{"submission_id":"aoj_2268_275944","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 <complex>\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\n#include <complex>\n\ntypedef complex<double> Complex;\n\n// a.size must 2^x\nvector<Complex> FFT(double theta, const vector<Complex> &a) {\n int n = a.size();\n vector<Complex> ret = a;\n for (int m = n; m >= 2; m >>= 1) {\n int mh = m >> 1;\n for (int i = 0; i < mh; i++) {\n Complex w = exp(i * theta * Complex(0, 1));\n for (int j = i; j < n; j += m) {\n int k = j + mh;\n Complex x = ret[j] - ret[k];\n ret[j] += ret[k];\n ret[k] = w * x;\n }\n }\n theta *= 2;\n }\n int i = 0;\n for (int j = 1; j < n - 1; j++) {\n for (int k = n >> 1; k > (i ^= k); k >>= 1) {;}\n if (j < i) { swap(ret[i], ret[j]); }\n }\n return ret;\n}\n\nvector<double> Convolution(const vector<double> &lhs, const vector<double> &rhs) {\n int n = 1;\n while (n < (int)max(lhs.size(), rhs.size()) * 2) { n <<= 1; }\n vector<Complex> temp1(n);\n vector<Complex> temp2(n);\n for (int i = 0; i < n; i++) {\n if (i < (int)lhs.size()) {\n temp1[i] = Complex(lhs[i], 0);\n }\n if (i < (int)rhs.size()) {\n temp2[i] = Complex(rhs[i], 0);\n }\n }\n temp1 = FFT(2.0 * PI / n, temp1);\n temp2 = FFT(2.0 * PI / n, temp2);\n for (int i = 0; i < n; i++) { temp1[i] *= temp2[i]; }\n temp1 = FFT(-2.0 * PI / n, temp1);\n vector<double> ret;\n ret.resize(n + 1);\n for (int i = 0; i < n; i++) {\n ret[i + 1] = temp1[i].real() / n;\n }\n ret[0] = 1.0;\n return ret;\n}\n\nconst int H = 60;\nvector<double> anss[H + 1];\nint main() {\n int n;\n while (scanf(\"%d\", &n) > 0) {\n anss[0] = vector<double>(n + 1, 0);\n anss[0][0] = 1.0;\n\n FOREQ(h, 1, H) {\n anss[h] = Convolution(anss[h - 1], anss[h - 1]);\n anss[h].resize(n + 1);\n FOREQ(i, 1, n) {\n anss[h][i] /= i;\n }\n }\n\n FOREQ(h, 1, min(n, H)) {\n printf(\"%.8f\\n\", anss[h][n] - anss[h - 1][n] + EPS);\n }\n FOREQ(h, H + 1, n) {\n printf(\"%.8f\\n\", 0.0);\n }\n }\n}","accuracy":1,"time_ms":4250,"memory_kb":33000,"score_of_the_acc":-1.445,"final_rank":12}],"string":"[\n {\n \"submission_id\": \"aoj_2268_10307688\",\n \"code_snippet\": \"// AOJ #2268 Randomized Self-Balancing Binary Search Tree\\n// 2025.3.17\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <typename R>\\nvoid fft(vector<complex<R>> &f, int dir) {\\n int n = f.size();\\n assert(n == (1 << static_cast<int>(log2(n))));\\n R theta = dir * 2 * M_PI / n;\\n\\n for (int m = n; m >= 2; m /= 2) {\\n for (int i = 0; i < m / 2; i++) {\\n complex<R> w = polar<R>(1, i * theta);\\n for (int j = i; j < n; j += m) {\\n int k = j + m / 2;\\n complex<R> diff = f[j] - f[k];\\n f[j] += f[k];\\n f[k] = w * diff;\\n }\\n }\\n theta *= 2;\\n }\\n\\n int i = 0;\\n for (int j = 1; j < n - 1; j++) {\\n for (int k = n / 2; k > (i ^= k); k /= 2);\\n if (j < i) swap(f[i], f[j]);\\n }\\n}\\n\\ntemplate <typename T, typename R = double>\\nvoid conv(vector<T> &a, int result_n) {\\n int m = 2 * a.size() - 1;\\n int n = pow(2, ceil(log2(m)));\\n vector<complex<R>> x(n);\\n\\n copy(a.begin(), a.end(), x.begin());\\n fft(x, +1);\\n for (int i = 0; i < n; i++) x[i] *= x[i];\\n fft(x, -1);\\n\\n a.resize(result_n);\\n for (int i = 0; i < result_n; i++) a[i] = x[i].real() / n;\\n}\\n\\nint main() {\\n int n;\\n cin >> n;\\n\\n int h = min(n, 50);\\n vector<double> dp(n + 1, 0);\\n dp[0] = 1;\\n double last = 0;\\n\\n for (int j = 1; j <= h; j++) {\\n conv(dp, n + 1);\\n for (int i = n - 1; i >= 0; i--) {\\n dp[i + 1] = dp[i] / (i + 1);\\n }\\n dp[0] = 1;\\n printf(\\\"%.10lf\\\\n\\\", dp[n] - last);\\n last = dp[n];\\n }\\n for (int j = h + 1; j <= n; j++) puts(\\\"0\\\");\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 4984,\n \"score_of_the_acc\": -0.097,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2268_10274921\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst double PI = acos(-1.0);\\n\\n// FFT（Cooley-Tukeyアルゴリズム）\\nvoid fft(vector<complex<double>> &a, bool invert) {\\n int n = (int)a.size();\\n for (int i = 1, j = 0; i < n; i++) {\\n int bit = n >> 1;\\n for (; j & bit; bit >>= 1)\\n j -= bit;\\n j += bit;\\n if (i < j) swap(a[i], a[j]);\\n }\\n\\n for (int len = 2; len <= n; len <<= 1) {\\n double ang = 2 * PI / len * (invert ? -1 : 1);\\n complex<double> wlen(cos(ang), sin(ang));\\n for (int i = 0; i < n; i += len) {\\n complex<double> w(1);\\n for (int j = 0; j < len / 2; j++) {\\n complex<double> u = a[i + j], v = a[i + j + len / 2] * w;\\n a[i + j] = u + v;\\n a[i + j + len / 2] = u - v;\\n w *= wlen;\\n }\\n }\\n }\\n\\n if (invert) {\\n for (int i = 0; i < n; i++)\\n a[i] /= n;\\n }\\n}\\n\\n// 畳み込み（convolution）: O(N log N)\\n// a, b は実数ベクトル。戻り値は a∗b の畳み込みの実部のみを返す。\\nvector<double> convolution(const vector<double> &a, const vector<double> &b) {\\n int n_fft = 1;\\n int result_size = a.size() + b.size() - 1;\\n while (n_fft < result_size)\\n n_fft <<= 1;\\n vector<complex<double>> fa(n_fft), fb(n_fft);\\n for (int i = 0; i < (int)a.size(); i++)\\n fa[i] = a[i];\\n for (int i = a.size(); i < n_fft; i++)\\n fa[i] = 0;\\n for (int i = 0; i < (int)b.size(); i++)\\n fb[i] = b[i];\\n for (int i = b.size(); i < n_fft; i++)\\n fb[i] = 0;\\n\\n fft(fa, false);\\n fft(fb, false);\\n for (int i = 0; i < n_fft; i++)\\n fa[i] *= fb[i];\\n fft(fa, true);\\n\\n vector<double> res(result_size);\\n for (int i = 0; i < result_size; i++)\\n res[i] = fa[i].real();\\n return res;\\n}\\n\\n// main：dp層hについての更新を FFT畳み込みで O(n log n) で行う\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int n;\\n cin >> n;\\n\\n // dp_prev[x] = dp[x][h-1]、dp_cur[x] = dp[x][h] (0 <= x <= n)\\n // 初期条件：h=0 では dp[0][0]=1, dp[x>0][0]=0\\n vector<double> dp_prev(n + 1, 0.0), dp_cur(n + 1, 0.0);\\n dp_prev[0] = 1.0;\\n for (int i = 1; i <= n; i++)\\n dp_prev[i] = 0.0;\\n\\n // 各高さ h = 1,2,...,n について dp[n][h] - dp[n][h-1] を出力\\n for (int h = 1; h <= n; h++) {\\n if (h >= 50) {\\n printf(\\\"0.0000000000\\\\n\\\");\\n continue;\\n }\\n // dp[n][h] = (1/n) * (畳み込み結果の index n-1)\\n // つまり、dp[.][h] は dp[.][h-1] 同士の畳み込み結果を利用して求められる。\\n vector<double> convRes = convolution(dp_prev, dp_prev);\\n\\n dp_cur[0] = 1.0; // dp[0][h] = 1\\n for (int m = 1; m <= n; m++) {\\n // convRes[m-1] = ∑_{i+j = m-1} dp[i][h-1]*dp[j][h-1]\\n dp_cur[m] = convRes[m - 1] / m;\\n }\\n\\n // 高さが正確に h となる確率は dp[n][h] - dp[n][h-1]\\n double ans = dp_cur[n] - dp_prev[n];\\n printf(\\\"%.10f\\\\n\\\", ans);\\n\\n dp_prev = dp_cur;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 6676,\n \"score_of_the_acc\": -0.1267,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2268_6975824\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nlong double PI = acos(-1);\\nvector<complex<long double>> fft(vector<complex<long double>> A, bool inv){\\n\\tint N = A.size();\\n\\tcomplex<long double> r = polar((long double) 1, (2 * PI) / (N));\\n\\tif (inv){\\n\\t\\tr = pow(r, -1);\\n\\t}\\n\\tvector<complex<long double>> B(N);\\n\\tfor (int i = N / 2; i > 0; i /= 2){\\n\\t\\tcomplex<long double> z = pow(r, i);\\n\\t\\tcomplex<long double> z2 = 1;\\n\\t\\tfor (int j = 0; j < N; j += i * 2){\\n\\t\\t\\tfor (int k = 0; k < i; k++){\\n\\t\\t\\t\\tA[i + j + k] *= z2;\\n\\t\\t\\t\\tB[j / 2 + k] = A[j + k] + A[i + j + k];\\n\\t\\t\\t\\tB[N / 2 + j / 2 + k] = A[j + k] - A[i + j + k];\\n\\t\\t\\t}\\n\\t\\t\\tz2 *= z;\\n\\t\\t}\\n\\t\\tswap(A, B);\\n\\t}\\n\\tif (inv){\\n\\t\\tfor (int i = 0; i < N; i++){\\n\\t\\t\\tA[i] /= N;\\n\\t\\t}\\n\\t}\\n\\treturn A;\\n}\\nvector<long double> convolution(vector<long double> A, vector<long double> B){\\n\\tint deg = A.size() + B.size() - 1;\\n\\tint N = 1;\\n\\twhile (N < deg){\\n\\t\\tN *= 2;\\n\\t}\\n\\tvector<complex<long double>> A2(N, 0);\\n\\tfor (int i = 0; i < A.size(); i++){\\n\\t\\tA2[i] = A[i];\\n\\t}\\n\\tvector<complex<long double>> B2(N, 0);\\n\\tfor (int i = 0; i < B.size(); i++){\\n\\t\\tB2[i] = B[i];\\n\\t}\\n\\tA2 = fft(A2, false);\\n\\tB2 = fft(B2, false);\\n\\tvector<complex<long double>> C2(N);\\n\\tfor (int i = 0; i < N; i++){\\n\\t\\tC2[i] = A2[i] * B2[i];\\n\\t}\\n\\tC2 = fft(C2, true);\\n\\tvector<long double> C(deg);\\n\\tfor (int i = 0; i < deg; i++){\\n\\t C[i] = C2[i].real();\\n\\t}\\n\\treturn C;\\n}\\nint main(){\\n cout << fixed << setprecision(20);\\n int N;\\n cin >> N;\\n int M = min(N, 100);\\n vector<vector<long double>> dp(M + 1, vector<long double>(N + 1, 0));\\n dp[0][0] = 1;\\n for (int i = 0; i < M; i++){\\n vector<long double> tmp = convolution(dp[i], dp[i]);\\n dp[i + 1][0] = 1;\\n for (int j = 1; j <= N; j++){\\n dp[i + 1][j] = tmp[j - 1] / j;\\n }\\n }\\n for (int i = 1; i <= M; i++){\\n cout << max(dp[i][N] - dp[i - 1][N], (long double) 0) << endl;\\n }\\n for (int i = M; i < N; i++){\\n cout << 0 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3380,\n \"memory_kb\": 61956,\n \"score_of_the_acc\": -1.7062,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2268_6975823\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ndouble PI = acos(-1);\\nvector<complex<double>> fft(vector<complex<double>> A, bool inv){\\n\\tint N = A.size();\\n\\tcomplex<double> r = polar((double) 1, (2 * PI) / (N));\\n\\tif (inv){\\n\\t\\tr = pow(r, -1);\\n\\t}\\n\\tvector<complex<double>> B(N);\\n\\tfor (int i = N / 2; i > 0; i /= 2){\\n\\t\\tcomplex<double> z = pow(r, i);\\n\\t\\tcomplex<double> z2 = 1;\\n\\t\\tfor (int j = 0; j < N; j += i * 2){\\n\\t\\t\\tfor (int k = 0; k < i; k++){\\n\\t\\t\\t\\tA[i + j + k] *= z2;\\n\\t\\t\\t\\tB[j / 2 + k] = A[j + k] + A[i + j + k];\\n\\t\\t\\t\\tB[N / 2 + j / 2 + k] = A[j + k] - A[i + j + k];\\n\\t\\t\\t}\\n\\t\\t\\tz2 *= z;\\n\\t\\t}\\n\\t\\tswap(A, B);\\n\\t}\\n\\tif (inv){\\n\\t\\tfor (int i = 0; i < N; i++){\\n\\t\\t\\tA[i] /= N;\\n\\t\\t}\\n\\t}\\n\\treturn A;\\n}\\nvector<double> convolution(vector<double> A, vector<double> B){\\n\\tint deg = A.size() + B.size() - 1;\\n\\tint N = 1;\\n\\twhile (N < deg){\\n\\t\\tN *= 2;\\n\\t}\\n\\tvector<complex<double>> A2(N, 0);\\n\\tfor (int i = 0; i < A.size(); i++){\\n\\t\\tA2[i] = A[i];\\n\\t}\\n\\tvector<complex<double>> B2(N, 0);\\n\\tfor (int i = 0; i < B.size(); i++){\\n\\t\\tB2[i] = B[i];\\n\\t}\\n\\tA2 = fft(A2, false);\\n\\tB2 = fft(B2, false);\\n\\tvector<complex<double>> C2(N);\\n\\tfor (int i = 0; i < N; i++){\\n\\t\\tC2[i] = A2[i] * B2[i];\\n\\t}\\n\\tC2 = fft(C2, true);\\n\\tvector<double> C(deg);\\n\\tfor (int i = 0; i < deg; i++){\\n\\t C[i] = C2[i].real();\\n\\t}\\n\\treturn C;\\n}\\nint main(){\\n cout << fixed << setprecision(20);\\n int N;\\n cin >> N;\\n int M = min(N, 100);\\n vector<vector<double>> dp(M + 1, vector<double>(N + 1, 0));\\n dp[0][0] = 1;\\n for (int i = 0; i < M; i++){\\n vector<double> tmp = convolution(dp[i], dp[i]);\\n dp[i + 1][0] = 1;\\n for (int j = 1; j <= N; j++){\\n dp[i + 1][j] = max(tmp[j - 1], (double) 0) / j;\\n }\\n }\\n for (int i = 1; i <= M; i++){\\n cout << max(dp[i][N] - dp[i - 1][N], (double) 0) << endl;\\n }\\n for (int i = M; i < N; i++){\\n cout << 0 << endl;\\n }\\n}\",\n \"accuracy\": 0.3225806451612903,\n \"time_ms\": 860,\n \"memory_kb\": 32608,\n \"score_of_the_acc\": -0.6353,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2268_6975817\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ndouble PI = acos(-1);\\nvector<complex<double>> fft(vector<complex<double>> A, bool inv){\\n\\tint N = A.size();\\n\\tcomplex<double> r = polar((double) 1, (2 * PI) / (N));\\n\\tif (inv){\\n\\t\\tr = pow(r, -1);\\n\\t}\\n\\tvector<complex<double>> B(N);\\n\\tfor (int i = N / 2; i > 0; i /= 2){\\n\\t\\tcomplex<double> z = pow(r, i);\\n\\t\\tcomplex<double> z2 = 1;\\n\\t\\tfor (int j = 0; j < N; j += i * 2){\\n\\t\\t\\tfor (int k = 0; k < i; k++){\\n\\t\\t\\t\\tA[i + j + k] *= z2;\\n\\t\\t\\t\\tB[j / 2 + k] = A[j + k] + A[i + j + k];\\n\\t\\t\\t\\tB[N / 2 + j / 2 + k] = A[j + k] - A[i + j + k];\\n\\t\\t\\t}\\n\\t\\t\\tz2 *= z;\\n\\t\\t}\\n\\t\\tswap(A, B);\\n\\t}\\n\\tif (inv){\\n\\t\\tfor (int i = 0; i < N; i++){\\n\\t\\t\\tA[i] /= N;\\n\\t\\t}\\n\\t}\\n\\treturn A;\\n}\\nvector<double> convolution(vector<double> A, vector<double> B){\\n\\tint deg = A.size() + B.size() - 1;\\n\\tint N = 1;\\n\\twhile (N < deg){\\n\\t\\tN *= 2;\\n\\t}\\n\\tvector<complex<double>> A2(N, 0);\\n\\tfor (int i = 0; i < A.size(); i++){\\n\\t\\tA2[i] = A[i];\\n\\t}\\n\\tvector<complex<double>> B2(N, 0);\\n\\tfor (int i = 0; i < B.size(); i++){\\n\\t\\tB2[i] = B[i];\\n\\t}\\n\\tA2 = fft(A2, false);\\n\\tB2 = fft(B2, false);\\n\\tvector<complex<double>> C2(N);\\n\\tfor (int i = 0; i < N; i++){\\n\\t\\tC2[i] = A2[i] * B2[i];\\n\\t}\\n\\tC2 = fft(C2, true);\\n\\tvector<double> C(deg);\\n\\tfor (int i = 0; i < deg; i++){\\n\\t C[i] = C2[i].real();\\n\\t}\\n\\treturn C;\\n}\\nint main(){\\n cout << fixed << setprecision(20);\\n int N;\\n cin >> N;\\n int M = min(N, 100);\\n vector<vector<double>> dp(M + 1, vector<double>(N + 1, 0));\\n dp[0][0] = 1;\\n for (int i = 0; i < M; i++){\\n vector<double> tmp = convolution(dp[i], dp[i]);\\n dp[i + 1][0] = 1;\\n for (int j = 1; j <= N; j++){\\n dp[i + 1][j] = tmp[j - 1] / j;\\n }\\n }\\n for (int i = 1; i <= M; i++){\\n cout << dp[i][N] - dp[i - 1][N] << endl;\\n }\\n for (int i = M; i < N; i++){\\n cout << 0 << endl;\\n }\\n}\",\n \"accuracy\": 0.3225806451612903,\n \"time_ms\": 850,\n \"memory_kb\": 32644,\n \"score_of_the_acc\": -0.6335,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2268_4414300\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i=0;i<n;i++)\\n#define repn(i, n) for(int i=1;i<=n;i++)\\ntypedef pair<ll,ll> P;\\n#define fi first\\n#define sc second\\n#define pb push_back\\n#define mp make_pair\\n#define all(x) x.begin(), x.end()\\n#define POSL(v, x) lower_bound(v.begin(), v.end(), x) - v.begin()\\n\\nstruct FFT{\\n\\tconst double PI = acos(-1.);\\n\\tstruct cp{\\n\\t\\tdouble x, y; \\n\\t\\tcp(double x = 0, double y = 0) : x(x), y(y) {}\\n\\t\\tcp operator + (const cp & a) { return cp(x+a.x, y+a.y); }\\n\\t\\tcp operator - (const cp & a) { return cp(x-a.x, y-a.y); }\\n\\t\\tcp operator * (const cp & a) { return cp(x*a.x-y*a.y, x*a.y+y*a.x); }\\n\\t};\\n\\tcp g[1<<17];\\n\\tvoid FFTMakeG(int n){\\n\\t\\trep(i, n){\\n\\t\\t\\tdouble th = PI * 2.0 * i / n;\\n\\t\\t\\tg[i] = cp(cos(th), sin(th));\\n\\t\\t}\\n\\t}\\n\\tvoid fft( vector<cp>&z ){\\n\\t\\tint n = z.size();\\n\\t\\tint i, j, k, l, m;\\n\\t\\tfor(i = 1, j = 0; i < n; ++i){\\n\\t\\t\\tfor(int k=n>>1;(j^=k) < k ; k >>= 1);\\n\\t\\t\\tif(i < j) swap(z[i], z[j]);\\n\\t\\t}\\n\\t\\tfor(l = k = 1, m = __builtin_ctz(n); m--; l |= k <<= 1){\\n\\t\\t\\tfor(i = 0;i<n;i++) if(i < (j=i^k)){\\n\\t\\t\\t\\tcp t = z[j] * g[(i & l) << m];\\n\\t\\t\\t\\tz[j] = z[i] - t;\\n\\t\\t\\t\\tz[i] = z[i] + t;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<double>conv (vector<double>a){\\n\\t\\tint n = a.size() + a.size();\\n\\t\\tint t = 1;\\n\\t\\twhile(t < n) t <<= 1;\\n\\t\\tFFTMakeG(t);\\n\\t\\tvector<cp>fa, fb;\\n\\t\\trep(i, t){\\n\\t\\t\\tif(i < a.size()) fa.pb(cp(a[i]));\\n\\t\\t\\telse fa.pb(cp());\\n\\t\\t\\t\\n\\t\\t\\t//if(i < a.size()) fb.pb(cp(a[i]));\\n\\t\\t\\t//else fb.pb(cp());\\n\\t\\t}\\n\\t\\tfft(fa); //fft(fb);\\n\\t\\trep(i, t) fa[i] = fa[i] * fa[i];\\n\\t\\tfor(int l=1,r=t-1;l<r;l++,r--) swap(g[l], g[r]);\\n\\t\\tfft(fa);\\n\\t\\tvector<double>ret;\\n\\t\\trep(i, t) ret.pb(fa[i].x / (double)t);\\n\\t\\treturn ret;\\n\\t}\\n}kaede;\\n\\ndouble dp[30005][105];\\n\\n\\nint main(){\\n\\trep(j, 105){\\n\\t\\tdp[0][j] = 1.;\\n\\t}\\n\\trepn(j, 104){\\n\\t\\tdp[1][j] = 1.;\\n\\t}\\n\\tfor(int j=2;j<105;j++){\\n\\t\\t{\\n\\t\\t\\tvector<double>a;\\n\\t\\t\\trep(c, 30005) a.pb(dp[c][j-1]);\\n\\t\\t\\tauto b = kaede.conv(a);\\n\\t\\t\\trep(c, 30003) dp[c+1][j] = b[c] / (double)(c+1);\\n\\t\\t}\\n\\t}\\n\\tint n; cin >> n;\\n\\trepn(i, n){\\n\\t\\tif(i <= 100) printf(\\\"%.12f\\\\n\\\", dp[n][i]-dp[n][i-1]);\\n\\t\\telse puts(\\\"0\\\");\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 910,\n \"memory_kb\": 32384,\n \"score_of_the_acc\": -0.6435,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2268_3771999\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <complex>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nconst double pi = acos(-1);\\nvoid discrete_fourier_transform(std::size_t n, std::complex<double> *v, bool rev) {\\n\\tfor (std::size_t i = 0, j = 1; j < n - 1; ++j) {\\n\\t\\tfor (std::size_t k = n >> 1; k > (i ^= k); k >>= 1);\\n\\t\\tif (i > j) std::swap(v[i], v[j]);\\n\\t}\\n\\tfor (std::size_t b = 1; b < n; b <<= 1) {\\n\\t\\tstd::complex<double> wr = std::polar(1.0, (rev ? -1.0 : 1.0) * pi / b);\\n\\t\\tfor (std::size_t i = 0; i < n; i += 2 * b) {\\n\\t\\t\\tstd::complex<double> w = 1.0;\\n\\t\\t\\tfor (std::size_t j = 0; j < b; ++j) {\\n\\t\\t\\t\\tstd::complex<double> v0 = v[i + j];\\n\\t\\t\\t\\tstd::complex<double> v1 = w * v[i + j + b];\\n\\t\\t\\t\\tv[i + j] = v0 + v1;\\n\\t\\t\\t\\tv[i + j + b] = v0 - v1;\\n\\t\\t\\t\\tw *= wr;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (!rev) return;\\n\\tfor (std::size_t i = 0; i < n; i++) v[i] /= n;\\n}\\ndouble prob[54][65555]; complex<double> tmp[65555];\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tint N;\\n\\tcin >> N;\\n\\tint b = 1;\\n\\twhile (b < 2 * (N + 1)) b *= 2;\\n\\tprob[0][0] = 1.0; prob[0][1] = 1.0;\\n\\tfor (int i = 0; i < 50; ++i) {\\n\\t\\tfor (int j = 0; j < b; ++j) {\\n\\t\\t\\ttmp[j] = (j <= N ? prob[i][j] : 0.0);\\n\\t\\t}\\n\\t\\tdiscrete_fourier_transform(b, tmp, false);\\n\\t\\tfor (int j = 0; j < b; ++j) {\\n\\t\\t\\ttmp[j] *= tmp[j];\\n\\t\\t}\\n\\t\\tdiscrete_fourier_transform(b, tmp, true);\\n\\t\\tprob[i + 1][0] = 1.0;\\n\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\tprob[i + 1][j + 1] = tmp[j].real() / (j + 1);\\n\\t\\t}\\n\\t}\\n\\tcout.precision(7);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tcout << fixed << (i > 50 ? 0.0 : max(prob[i][N] - (i > 0 ? prob[i - 1][N] : 0.0), 0.0)) << '\\\\n';\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 16536,\n \"score_of_the_acc\": -0.2669,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2268_3771993\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <complex>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nconst double pi = acos(-1);\\nvoid discrete_fourier_transform(std::size_t n, std::complex<double> *v, bool rev) {\\n\\tfor (std::size_t i = 0, j = 1; j < n - 1; ++j) {\\n\\t\\tfor (std::size_t k = n >> 1; k > (i ^= k); k >>= 1);\\n\\t\\tif (i > j) std::swap(v[i], v[j]);\\n\\t}\\n\\tfor (std::size_t b = 1; b < n; b <<= 1) {\\n\\t\\tstd::complex<double> wr = std::polar(1.0, (rev ? -1.0 : 1.0) * pi / b);\\n\\t\\tfor (std::size_t i = 0; i < n; i += 2 * b) {\\n\\t\\t\\tstd::complex<double> w = 1.0;\\n\\t\\t\\tfor (std::size_t j = 0; j < b; ++j) {\\n\\t\\t\\t\\tstd::complex<double> v0 = v[i + j];\\n\\t\\t\\t\\tstd::complex<double> v1 = w * v[i + j + b];\\n\\t\\t\\t\\tv[i + j] = v0 + v1;\\n\\t\\t\\t\\tv[i + j + b] = v0 - v1;\\n\\t\\t\\t\\tw *= wr;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (!rev) return;\\n\\tfor (std::size_t i = 0; i < n; i++) v[i] /= n;\\n}\\ndouble prob[64][65555]; complex<double> tmp[65555];\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tint N;\\n\\tcin >> N;\\n\\tint b = 1;\\n\\twhile (b < 2 * (N + 1)) b *= 2;\\n\\tprob[0][0] = 1.0; prob[0][1] = 1.0;\\n\\tfor (int i = 0; i < 55; ++i) {\\n\\t\\tfor (int j = 0; j < b; ++j) {\\n\\t\\t\\ttmp[j] = (j <= N ? prob[i][j] : 0.0);\\n\\t\\t}\\n\\t\\tdiscrete_fourier_transform(b, tmp, false);\\n\\t\\tfor (int j = 0; j < b; ++j) {\\n\\t\\t\\ttmp[j] *= tmp[j];\\n\\t\\t}\\n\\t\\tdiscrete_fourier_transform(b, tmp, true);\\n\\t\\tprob[i + 1][0] = 1.0;\\n\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\tprob[i + 1][j + 1] = tmp[j].real() / (j + 1);\\n\\t\\t}\\n\\t}\\n\\tcout.precision(7);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tcout << fixed << (i > 55 ? 0.0 : max(prob[i][N] - (i > 0 ? prob[i - 1][N] : 0.0), 0.0)) << '\\\\n';\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 17604,\n \"score_of_the_acc\": -0.3339,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2268_3771990\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <complex>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nconst double pi = acos(-1);\\nvoid discrete_fourier_transform(std::size_t n, std::complex<double> *v, bool rev) {\\n\\tfor (std::size_t i = 0, j = 1; j < n - 1; ++j) {\\n\\t\\tfor (std::size_t k = n >> 1; k > (i ^= k); k >>= 1);\\n\\t\\tif (i > j) std::swap(v[i], v[j]);\\n\\t}\\n\\tfor (std::size_t b = 1; b < n; b <<= 1) {\\n\\t\\tstd::complex<double> wr = std::polar(1.0, (rev ? -1.0 : 1.0) * pi / b);\\n\\t\\tfor (std::size_t i = 0; i < n; i += 2 * b) {\\n\\t\\t\\tstd::complex<double> w = 1.0;\\n\\t\\t\\tfor (std::size_t j = 0; j < b; ++j) {\\n\\t\\t\\t\\tstd::complex<double> v0 = v[i + j];\\n\\t\\t\\t\\tstd::complex<double> v1 = w * v[i + j + b];\\n\\t\\t\\t\\tv[i + j] = v0 + v1;\\n\\t\\t\\t\\tv[i + j + b] = v0 - v1;\\n\\t\\t\\t\\tw *= wr;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (!rev) return;\\n\\tfor (std::size_t i = 0; i < n; i++) v[i] /= n;\\n}\\ndouble prob[64][65555]; complex<double> tmp[65555];\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tint N;\\n\\tcin >> N;\\n\\tint b = 1;\\n\\twhile (b < 2 * (N + 1)) b *= 2;\\n\\tprob[0][0] = 1.0; prob[0][1] = 1.0;\\n\\tfor (int i = 0; i < 55; ++i) {\\n\\t\\tfor (int j = 0; j < b; ++j) {\\n\\t\\t\\ttmp[j] = (j <= N ? prob[i][j] : 0.0);\\n\\t\\t}\\n\\t\\tdiscrete_fourier_transform(b, tmp, false);\\n\\t\\tfor (int j = 0; j < b; ++j) {\\n\\t\\t\\ttmp[j] *= tmp[j];\\n\\t\\t}\\n\\t\\tdiscrete_fourier_transform(b, tmp, true);\\n\\t\\tprob[i + 1][0] = 1.0;\\n\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\tprob[i + 1][j + 1] = tmp[j].real() / (j + 1);\\n\\t\\t}\\n\\t}\\n\\tcout.precision(7);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tcout << fixed << (i > 55 ? 0.0 : prob[i][N] - (i > 0 ? prob[i - 1][N] : 0.0)) << '\\\\n';\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.3225806451612903,\n \"time_ms\": 440,\n \"memory_kb\": 17676,\n \"score_of_the_acc\": -0.2948,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2268_3771960\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <complex>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nconst long double pi = acos(-1);\\nvoid discrete_fourier_transform(std::size_t n, std::complex<long double> *v, bool rev) {\\n\\tfor (std::size_t i = 0, j = 1; j < n - 1; ++j) {\\n\\t\\tfor (std::size_t k = n >> 1; k > (i ^= k); k >>= 1);\\n\\t\\tif (i > j) std::swap(v[i], v[j]);\\n\\t}\\n\\tfor (std::size_t b = 1; b < n; b <<= 1) {\\n\\t\\tstd::complex<long double> wr = std::polar(1.0L, (rev ? -1.0 : 1.0) * pi / b);\\n\\t\\tfor (std::size_t i = 0; i < n; i += 2 * b) {\\n\\t\\t\\tstd::complex<long double> w = 1.0;\\n\\t\\t\\tfor (std::size_t j = 0; j < b; ++j) {\\n\\t\\t\\t\\tstd::complex<long double> v0 = v[i + j];\\n\\t\\t\\t\\tstd::complex<long double> v1 = w * v[i + j + b];\\n\\t\\t\\t\\tv[i + j] = v0 + v1;\\n\\t\\t\\t\\tv[i + j + b] = v0 - v1;\\n\\t\\t\\t\\tw *= wr;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (!rev) return;\\n\\tfor (std::size_t i = 0; i < n; i++) v[i] /= n;\\n}\\nlong double prob[64][65555]; complex<long double> tmp[65555];\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tint N;\\n\\tcin >> N;\\n\\tint b = 1;\\n\\twhile (b < 2 * (N + 1)) b *= 2;\\n\\tprob[0][0] = 1.0; prob[0][1] = 1.0;\\n\\tfor (int i = 0; i < 60; ++i) {\\n\\t\\tfor (int j = 0; j < b; ++j) {\\n\\t\\t\\ttmp[j] = (j <= N ? prob[i][j] : 0.0);\\n\\t\\t}\\n\\t\\tdiscrete_fourier_transform(b, tmp, false);\\n\\t\\tfor (int j = 0; j < b; ++j) {\\n\\t\\t\\ttmp[j] *= tmp[j];\\n\\t\\t}\\n\\t\\tdiscrete_fourier_transform(b, tmp, true);\\n\\t\\tprob[i + 1][0] = 1.0;\\n\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\tprob[i + 1][j + 1] = tmp[j].real() / (j + 1);\\n\\t\\t\\tif (abs(prob[i + 1][j + 1]) <= 1.0e-8) prob[i + 1][j + 1] = 0.0;\\n\\t\\t}\\n\\t}\\n\\tcout.precision(7);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tcout << fixed << (i > 60 ? 0.0 : prob[i][N] - (i > 0 ? prob[i - 1][N] : 0.0)) << '\\\\n';\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2960,\n \"memory_kb\": 34008,\n \"score_of_the_acc\": -1.1555,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2268_3771959\",\n \"code_snippet\": \"#include <cmath>\\n#include <vector>\\n#include <complex>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nconst double pi = acos(-1);\\nvoid discrete_fourier_transform(std::size_t n, std::complex<double> *v, bool rev) {\\n\\tfor (std::size_t i = 0, j = 1; j < n - 1; ++j) {\\n\\t\\tfor (std::size_t k = n >> 1; k > (i ^= k); k >>= 1);\\n\\t\\tif (i > j) std::swap(v[i], v[j]);\\n\\t}\\n\\tfor (std::size_t b = 1; b < n; b <<= 1) {\\n\\t\\tstd::complex<double> wr = std::polar(1.0, (rev ? -1.0 : 1.0) * pi / b);\\n\\t\\tfor (std::size_t i = 0; i < n; i += 2 * b) {\\n\\t\\t\\tstd::complex<double> w = 1.0;\\n\\t\\t\\tfor (std::size_t j = 0; j < b; ++j) {\\n\\t\\t\\t\\tstd::complex<double> v0 = v[i + j];\\n\\t\\t\\t\\tstd::complex<double> v1 = w * v[i + j + b];\\n\\t\\t\\t\\tv[i + j] = v0 + v1;\\n\\t\\t\\t\\tv[i + j + b] = v0 - v1;\\n\\t\\t\\t\\tw *= wr;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (!rev) return;\\n\\tfor (std::size_t i = 0; i < n; i++) v[i] /= n;\\n}\\ndouble prob[104][65555]; complex<double> tmp[65555];\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tint N;\\n\\tcin >> N;\\n\\tint b = 1;\\n\\twhile (b < 2 * (N + 1)) b *= 2;\\n\\tprob[0][0] = 1.0; prob[0][1] = 1.0;\\n\\tfor (int i = 0; i < 100; ++i) {\\n\\t\\tfor (int j = 0; j < b; ++j) {\\n\\t\\t\\ttmp[j] = (j <= N ? prob[i][j] : 0.0);\\n\\t\\t}\\n\\t\\tdiscrete_fourier_transform(b, tmp, false);\\n\\t\\tfor (int j = 0; j < b; ++j) {\\n\\t\\t\\ttmp[j] *= tmp[j];\\n\\t\\t}\\n\\t\\tdiscrete_fourier_transform(b, tmp, true);\\n\\t\\tprob[i + 1][0] = 1.0;\\n\\t\\tfor (int j = 0; j < N; ++j) {\\n\\t\\t\\tprob[i + 1][j + 1] = tmp[j].real() / (j + 1);\\n\\t\\t\\tif (abs(prob[i + 1][j + 1]) <= 1.0e-8) prob[i + 1][j + 1] = 0.0;\\n\\t\\t}\\n\\t}\\n\\tcout.precision(7);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tcout << fixed << (i > 100 ? 0.0 : prob[i][N] - (i > 0 ? prob[i - 1][N] : 0.0)) << '\\\\n';\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.3225806451612903,\n \"time_ms\": 810,\n \"memory_kb\": 28456,\n \"score_of_the_acc\": -0.5565,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2268_2662808\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\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 REP_R(i, n) for (int i = int(n) - 1; (i) >= 0; -- (i))\\nusing namespace std;\\n\\ntemplate <typename R>\\nvoid fft_inplace(vector<complex<R> > & f, int dir) {\\n int n = f.size();\\n assert(n == pow(2, log2(n)));\\n R theta = dir * 2 * M_PI / n;\\n for (int m = n; m >= 2; m >>= 1) {\\n REP (i, m / 2) {\\n complex<R> w = polar<R>(1, i * theta);\\n for (int j = i; j < n; j += m) {\\n int k = j + m / 2;\\n complex<R> x = f[j] - f[k];\\n f[j] += f[k];\\n f[k] = w * x;\\n }\\n }\\n theta *= 2;\\n }\\n int i = 0;\\n REP3 (j, 1, n - 1) {\\n for (int k = n >> 1; k > (i ^= k); ) k >>= 1;\\n if (j < i) {\\n swap(f[i], f[j]);\\n }\\n }\\n}\\ntemplate <typename T, typename R = double>\\nvoid convolution_self_inplace(vector<T> & a, int result_n) {\\n int m = 2 * a.size() - 1;\\n int n = pow(2, ceil(log2(m)));\\n vector<complex<R> > x(n);\\n copy(a.begin(), a.end(), x.begin());\\n fft_inplace(x, +1);\\n vector<complex<R> > z(n);\\n REP (i, n) x[i] *= x[i];\\n fft_inplace(x, -1);\\n a.resize(result_n);\\n REP (i, result_n) a[i] = x[i].real() / n;\\n}\\n\\nint main() {\\n // input\\n int n; scanf(\\\"%d\\\", &n);\\n // solve\\n const int height = min(n, 50);\\n vector<double> dp(n + 1);\\n dp[0] = 1;\\n double last_dp_n = 0;\\n REP3 (j, 1, height + 1) {\\n convolution_self_inplace(dp, n + 1);\\n REP_R (i, n) {\\n dp[i + 1] = dp[i] / (i + 1);\\n }\\n dp[0] = 1;\\n // output\\n printf(\\\"%.10lf\\\\n\\\", double(dp[n] - last_dp_n));\\n last_dp_n = dp[n];\\n }\\n REP3 (j, height + 1, n + 1) {\\n printf(\\\"0\\\\n\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 5632,\n \"score_of_the_acc\": -0.1573,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2268_2662807\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\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 REP_R(i, n) for (int i = int(n) - 1; (i) >= 0; -- (i))\\nusing namespace std;\\n\\ntemplate <typename R>\\nvoid fft_inplace(vector<complex<R> > & f, int dir) {\\n int n = f.size();\\n assert(n == pow(2, log2(n)));\\n R theta = dir * 2 * M_PI / n;\\n for (int m = n; m >= 2; m >>= 1) {\\n REP (i, m / 2) {\\n complex<R> w = polar<R>(1, i * theta);\\n for (int j = i; j < n; j += m) {\\n int k = j + m / 2;\\n complex<R> x = f[j] - f[k];\\n f[j] += f[k];\\n f[k] = w * x;\\n }\\n }\\n theta *= 2;\\n }\\n int i = 0;\\n REP3 (j, 1, n - 1) {\\n for (int k = n >> 1; k > (i ^= k); ) k >>= 1;\\n if (j < i) {\\n swap(f[i], f[j]);\\n }\\n }\\n}\\ntemplate <typename T, typename R = long double>\\nvoid convolution_self_inplace(vector<T> & a, int result_n) {\\n int m = 2 * a.size() - 1;\\n int n = pow(2, ceil(log2(m)));\\n vector<complex<R> > x(n);\\n copy(a.begin(), a.end(), x.begin());\\n fft_inplace(x, +1);\\n vector<complex<R> > z(n);\\n REP (i, n) x[i] *= x[i];\\n fft_inplace(x, -1);\\n a.resize(result_n);\\n REP (i, result_n) a[i] = x[i].real() / n;\\n}\\n\\nint main() {\\n // input\\n int n; scanf(\\\"%d\\\", &n);\\n // solve\\n const int height = min(n, 50);\\n vector<long double> dp(n + 1);\\n dp[0] = 1;\\n long double last_dp_n = 0;\\n REP3 (j, 1, height + 1) {\\n convolution_self_inplace(dp, n + 1);\\n REP_R (i, n) {\\n dp[i + 1] = dp[i] / (i + 1);\\n }\\n dp[0] = 1;\\n // output\\n printf(\\\"%.10lf\\\\n\\\", double(dp[n] - last_dp_n));\\n last_dp_n = dp[n];\\n }\\n REP3 (j, height + 1, n + 1) {\\n printf(\\\"0\\\\n\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2370,\n \"memory_kb\": 7936,\n \"score_of_the_acc\": -0.5949,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2268_2662806\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\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))\\nusing namespace std;\\n\\ntemplate <typename T>\\nvoid fft_inplace(vector<complex<T> > & f, int dir) {\\n int n = f.size();\\n assert (n == pow(2, log2(n)));\\n if (n == 1) return;\\n vector<complex<T> > a(n / 2), b(n / 2);\\n REP (i, n / 2) {\\n a[i] = f[2 * i];\\n b[i] = f[2 * i+ 1];\\n }\\n fft_inplace(a, dir);\\n fft_inplace(b, dir);\\n const complex<T> zeta = polar<T>(1, dir * 2 * M_PI / n);\\n complex<T> pow_zeta = 1;\\n REP (i, n) {\\n f[i] = a[i % (n / 2)] + pow_zeta * b[i % (n / 2)];\\n pow_zeta *= zeta;\\n }\\n}\\ntemplate <typename T, typename R = double>\\ndeque<T> convolution(deque<T> const & a, deque<T> const & b) {\\n int m = a.size() + b.size() - 1;\\n int n = pow(2, ceil(log2(m)));\\n vector<complex<R> > x(n), y(n);\\n copy(a.begin(), a.end(), x.begin());\\n copy(b.begin(), b.end(), y.begin());\\n fft_inplace(x, +1);\\n fft_inplace(y, +1);\\n vector<complex<R> > z(n);\\n REP (i, n) z[i] = x[i] * y[i];\\n fft_inplace(z, -1);\\n deque<T> c(m);\\n REP (i, m) c[i] = is_integral<T>::value ? round(z[i].real() / n) : z[i].real() / n;\\n return c;\\n}\\n\\nint main() {\\n // input\\n int n; scanf(\\\"%d\\\", &n);\\n // solve\\n const int height = min(n, 50);\\n deque<double> dp(n + 1);\\n dp[0] = 1;\\n double last_dp_n = 0;\\n REP3 (j, 1, height + 1) {\\n dp = convolution(dp, dp);\\n dp.push_front(1);\\n dp.resize(n + 1);\\n REP (i, n) {\\n dp[i + 1] /= (i + 1);\\n }\\n // output\\n printf(\\\"%.10lf\\\\n\\\", dp[n] - last_dp_n);\\n last_dp_n = dp[n];\\n }\\n REP3 (j, height + 1, n + 1) {\\n printf(\\\"0\\\\n\\\");\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.3225806451612903,\n \"time_ms\": 4400,\n \"memory_kb\": 8636,\n \"score_of_the_acc\": -1.0873,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2268_380010\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cmath>\\n#include <algorithm>\\n#include <complex>\\n#include <cstring>\\nusing namespace std;\\n\\nconst int MAX_N = 30000<<3;\\nconst double PI = 4.0*atan(1.0);\\n\\nint N, NN;\\ndouble prev[MAX_N], cur[MAX_N];\\ncomplex<double> xs[MAX_N], zs[MAX_N];\\n\\nstatic const complex<double> I(0,1);\\n\\nvoid init(){\\n\\tscanf(\\\"%d\\\", &N);\\n}\\n\\nvoid fft(complex<double> a[], int n, bool inv = false){\\n\\tdouble theta = 2 * PI / n * (inv ? -1 : 1);\\n\\tfor(int m=n; m>=2; m>>=1){\\n\\t\\tint mh = m >> 1;\\n\\t\\tfor(int i=0; i<mh; ++i){\\n\\t\\t\\tcomplex<double> w = exp(i*theta*I);\\n\\t\\t\\tfor(int j=i; j<n; j+=m){\\n\\t\\t\\t\\tint k = j + mh;\\n\\t\\t\\t\\tcomplex<double> x = a[j] - a[k];\\n\\t\\t\\t\\ta[j] += a[k];\\n\\t\\t\\t\\ta[k] = w * x;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ttheta *= 2;\\n\\t}\\n\\tint i = 0;\\n\\tfor(int j=1; j<n-1; ++j){\\n\\t\\tfor(int k=n>>1; k>(i^=k); k>>=1);\\n\\t\\tif(j<i){\\n\\t\\t\\tswap(a[i], a[j]);\\n\\t\\t}\\n\\t}\\n\\tif(inv){\\n\\t\\tfor(int i=0; i<n; ++i){\\n\\t\\t\\ta[i] /= n;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid calc(){\\n\\tfor(int i=0; i<NN; ++i){\\n\\t\\txs[i] = complex<double>(prev[i], 0.0);\\n\\t}\\n\\tfft(xs, NN);\\n\\tfor(int i=0; i<NN; ++i){\\n\\t\\tzs[i] = xs[i] * xs[i];\\n\\t}\\n\\tfft(zs, NN, true);\\n\\tmemset(cur, 0, sizeof(cur));\\n\\tcur[0] = 1.0;\\n\\tfor(int i=1; i<=N; ++i){\\n\\t\\tcur[i] = zs[i-1].real() / i;\\n\\t}\\n}\\n\\nvoid solve(){\\n\\tNN = 4<<(31 - __builtin_clz(N));\\n\\tfill(prev, prev+NN, 0.0);\\n\\tprev[0] = prev[1] = 1.0;\\n\\tbool small = false;\\n\\tprintf(\\\"%f\\\\n\\\", prev[N]);\\n\\tfor(int i=0; i<N-1; ++i){\\n\\t\\tif(small){\\n\\t\\t\\tputs(\\\"0.0\\\");\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tcalc();\\n\\t\\t\\tprintf(\\\"%.12f\\\\n\\\", cur[N] - prev[N]);\\n\\n\\t\\t\\tif(i>50 && cur[N] - prev[N] < 1e-5){\\n\\t\\t\\t\\tsmall = true;\\n\\t\\t\\t}\\n\\t\\t\\tmemcpy(prev, cur, sizeof(prev));\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(){\\n\\tinit();\\n\\tsolve();\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2250,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.4384,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2268_294257\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <cmath>\\n#include <complex>\\n#include <cstdio>\\n\\nusing namespace std;\\n\\ninline int getInt(){ int s; scanf(\\\"%d\\\", &s); return s; }\\n\\n// sizeof v must be 2 ^ n\\ntemplate<class T>\\nvoid fft_core(vector<complex<T> > &v, bool rev = false){\\n const int n = v.size();\\n\\n for(int i = 0; i < n; i++){\\n int k = 0;\\n int b = (n >> 1);\\n int a = 1;\\n\\n while(b >= a){\\n if(b & i) k |= a;\\n if(a & i) k |= b;\\n b >>= 1;\\n a <<= 1;\\n }\\n\\n if(i < k) swap(v[i], v[k]);\\n }\\n\\n int m = 2;\\n\\n while(m <= n){\\n double arg = -2.0 * M_PI / m;\\n complex<T> w(cos(arg), sin(arg));\\n if(rev) w = 1.0 / w;\\n\\n for(int i = 0; i < n; i += m){\\n complex<T> ww(1.0);\\n\\n for(int j = 0; j < m / 2; j++){\\n\\tint a = i + j;\\n\\tint b = i + j + m / 2;\\n\\tcomplex<T> t = ww * v[b];\\n\\n\\tv[b] = v[a] - t;\\n\\tv[a] = v[a] + t;\\n\\n\\tww *= w;\\n }\\n }\\n m *= 2;\\n }\\n\\n if(rev){\\n double s = (double)n;\\n for(int i = 0; i < n; i++)\\n v[i] /= s;\\n }\\n}\\n\\ntemplate<class T> inline void fft(vector<T> &v){ fft_core(v); }\\ntemplate<class T> inline void ifft(vector<T> &v){ fft_core(v, true); }\\n\\nint next(int n){\\n int i = 1;\\n while(i < n) i *= 2;\\n return i;\\n}\\n\\n\\nint main(){\\n int n = getInt();\\n int m = next(n + 1);\\n int mm = m * 2;\\n vector<complex<double> > p(mm, 0.0);\\n double prev = 0.0;\\n p[0] = 1.0;\\n \\n for(int i = 1; i <= n; i++){\\n if(i < 51){\\n fft(p);\\n\\n for(int j = mm - 1; j >= 0; j--){\\n\\tp[j] = p[j] * p[j];\\n }\\n \\n ifft(p);\\n\\n for(int j = mm - 1; j >= 1; j--){\\n\\tp[j] = p[j - 1];\\n }\\n p[0] = 1.0;\\n for(int j = 1; j < mm / 2; j++)\\n\\tp[j] /= j;\\n for(int j = mm / 2; j < mm; j++)\\n\\tp[j] = 0.0;\\n \\n double ans = n >= p.size() ? 0.0 : p[n].real();\\n double pans = (ans - prev);\\n if(ans > 1e-10) pans += 0.000007;\\n printf(\\\"%.7f\\\\n\\\", max(0.0, pans) + 1e-10);\\n prev = ans;\\n }else{\\n printf(\\\"%.7f\\\\n\\\", 0.0 + 1e-10);\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2980,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.6114,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2268_294255\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <queue>\\n#include <cmath>\\n#include <complex>\\n#include <cstdio>\\n\\nusing namespace std;\\n\\ninline int getInt(){ int s; scanf(\\\"%d\\\", &s); return s; }\\n\\n// sizeof v must be 2 ^ n\\ntemplate<class T>\\nvoid fft_core(vector<complex<T> > &v, bool rev = false){\\n const int n = v.size();\\n\\n for(int i = 0; i < n; i++){\\n int k = 0;\\n int b = (n >> 1);\\n int a = 1;\\n\\n while(b >= a){\\n if(b & i) k |= a;\\n if(a & i) k |= b;\\n b >>= 1;\\n a <<= 1;\\n }\\n\\n if(i < k) swap(v[i], v[k]);\\n }\\n\\n int m = 2;\\n\\n while(m <= n){\\n double arg = -2.0 * M_PI / m;\\n complex<T> w(cos(arg), sin(arg));\\n if(rev) w = 1.0 / w;\\n\\n for(int i = 0; i < n; i += m){\\n complex<T> ww(1.0);\\n\\n for(int j = 0; j < m / 2; j++){\\n\\tint a = i + j;\\n\\tint b = i + j + m / 2;\\n\\tcomplex<T> t = ww * v[b];\\n\\n\\tv[b] = v[a] - t;\\n\\tv[a] = v[a] + t;\\n\\n\\tww *= w;\\n }\\n }\\n m *= 2;\\n }\\n\\n if(rev){\\n double s = (double)n;\\n for(int i = 0; i < n; i++)\\n v[i] /= s;\\n }\\n}\\n\\ntemplate<class T> inline void fft(vector<T> &v){ fft_core(v); }\\ntemplate<class T> inline void ifft(vector<T> &v){ fft_core(v, true); }\\n\\nint next(int n){\\n int i = 1;\\n while(i < n) i *= 2;\\n return i;\\n}\\n\\n\\nint main(){\\n int n = getInt();\\n int m = next(n + 1);\\n int mm = m * 2;\\n vector<complex<double> > p(mm, 0.0);\\n double prev = 0.0;\\n p[0] = 1.0;\\n \\n for(int i = 1; i <= n; i++){\\n if(i < 80){\\n fft(p);\\n\\n for(int j = mm - 1; j >= 0; j--){\\n\\tp[j] = p[j] * p[j];\\n }\\n \\n ifft(p);\\n\\n for(int j = mm - 1; j >= 1; j--){\\n\\tp[j] = p[j - 1];\\n }\\n p[0] = 1.0;\\n for(int j = 1; j < mm / 2; j++)\\n\\tp[j] /= j;\\n for(int j = mm / 2; j < mm; j++)\\n\\tp[j] = 0.0;\\n \\n double ans = n >= p.size() ? 0.0 : p[n].real();\\n double pans = (ans - prev);\\n if(ans > 1e-10) pans += 0.000007;\\n printf(\\\"%.7f\\\\n\\\", max(0.0, pans) + 1e-10);\\n prev = ans;\\n }else{\\n printf(\\\"%.7f\\\\n\\\", 0.0 + 1e-10);\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4620,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -1,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2268_275944\",\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 <complex>\\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\\n#include <complex>\\n\\ntypedef complex<double> Complex;\\n\\n// a.size must 2^x\\nvector<Complex> FFT(double theta, const vector<Complex> &a) {\\n int n = a.size();\\n vector<Complex> ret = a;\\n for (int m = n; m >= 2; m >>= 1) {\\n int mh = m >> 1;\\n for (int i = 0; i < mh; i++) {\\n Complex w = exp(i * theta * Complex(0, 1));\\n for (int j = i; j < n; j += m) {\\n int k = j + mh;\\n Complex x = ret[j] - ret[k];\\n ret[j] += ret[k];\\n ret[k] = w * x;\\n }\\n }\\n theta *= 2;\\n }\\n int i = 0;\\n for (int j = 1; j < n - 1; j++) {\\n for (int k = n >> 1; k > (i ^= k); k >>= 1) {;}\\n if (j < i) { swap(ret[i], ret[j]); }\\n }\\n return ret;\\n}\\n\\nvector<double> Convolution(const vector<double> &lhs, const vector<double> &rhs) {\\n int n = 1;\\n while (n < (int)max(lhs.size(), rhs.size()) * 2) { n <<= 1; }\\n vector<Complex> temp1(n);\\n vector<Complex> temp2(n);\\n for (int i = 0; i < n; i++) {\\n if (i < (int)lhs.size()) {\\n temp1[i] = Complex(lhs[i], 0);\\n }\\n if (i < (int)rhs.size()) {\\n temp2[i] = Complex(rhs[i], 0);\\n }\\n }\\n temp1 = FFT(2.0 * PI / n, temp1);\\n temp2 = FFT(2.0 * PI / n, temp2);\\n for (int i = 0; i < n; i++) { temp1[i] *= temp2[i]; }\\n temp1 = FFT(-2.0 * PI / n, temp1);\\n vector<double> ret;\\n ret.resize(n + 1);\\n for (int i = 0; i < n; i++) {\\n ret[i + 1] = temp1[i].real() / n;\\n }\\n ret[0] = 1.0;\\n return ret;\\n}\\n\\nconst int H = 60;\\nvector<double> anss[H + 1];\\nint main() {\\n int n;\\n while (scanf(\\\"%d\\\", &n) > 0) {\\n anss[0] = vector<double>(n + 1, 0);\\n anss[0][0] = 1.0;\\n\\n FOREQ(h, 1, H) {\\n anss[h] = Convolution(anss[h - 1], anss[h - 1]);\\n anss[h].resize(n + 1);\\n FOREQ(i, 1, n) {\\n anss[h][i] /= i;\\n }\\n }\\n\\n FOREQ(h, 1, min(n, H)) {\\n printf(\\\"%.8f\\\\n\\\", anss[h][n] - anss[h - 1][n] + EPS);\\n }\\n FOREQ(h, H + 1, n) {\\n printf(\\\"%.8f\\\\n\\\", 0.0);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4250,\n \"memory_kb\": 33000,\n \"score_of_the_acc\": -1.445,\n \"final_rank\": 12\n }\n]","isConversational":false}}},{"rowIdx":1262,"cells":{"group_id":{"kind":"string","value":"aoj_2278_cpp"},"problem_description":{"kind":"string","value":"問題 H\nあばれうなぎ\n問題文\nきつねのしえるはうなぎを食べるのが好きである．\n2T+1\n枚の鉄板が連続して並んでおり，順番に\n-T, -T+1, ..., T\nの番号が付いている．しえるはこれらの鉄板に熱を加え，生きたうなぎを焼こうとしている．うなぎを焼く手順は以下のようなものである．\nまず，時刻\nt=-1\nのときに各鉄板にどれだけのエネルギーを加えるかを決め，実際にエネルギーを加える．各鉄板に加えるエネルギーの総和は\nE\n以下でなければならない．すなわち，\ni\n番の鉄板に加えるエネルギーを\nE(i)\nとして，\nE(i) ≥ 0, E(-T)+...+E(T) ≤ E\nでなければならない．なお，エネルギーは整数でなくてもよい．\nエネルギーを加えたあと，鉄板の熱さは\nE(i) / C(i)\nになる．ここで，\nC(i)\nは\ni\n番の鉄板の比熱である．\nt = -0.5\nのときにうなぎを\n0\n番の鉄板に載せる．\nt = 0, 1, 2,..., T\nのときに，うなぎは今自分がいる鉄板の熱さだけ加熱される．\nt = 0.5, 1.5, 2.5,...,T-0.5\nのとき，うなぎは自分の今いる鉄板にとどまるか，両隣の鉄板に移動することができる．\nt = T+0.5\nのときにうなぎを鉄板の上から回収する．\nところで生きたうなぎというのはとても活きがよくさらに頭も良いので，もしかすると自分にかかる熱さの総和が最小になるように動いたりするんではないかとしえるは不安になった．そうなると鉄板に適当に熱を加えただけではうなぎを十分に加熱できない恐れさえある．\nそこであなたには，うなぎが常に最適に動くとして，うなぎに与えることのできる熱さの和の最大値を求めて欲しい．\n入力形式\n入力は以下の形式で与えられる．\nT\nE\nC(-T)\nC(-T+1)\n...\nC(T)\nT\nはうなぎを熱する時間，\nE\nは鉄板に与えることの出来るエネルギーの総和，\nC(i)\nは\ni\n番の鉄板の比熱である．\n出力形式\n1\n行目にうなぎに与えられる熱さの和の最大値を出力せよ．小数点以下何桁でも出力して構わないが，相対誤差あるいは絶対誤差が\n10\n-6\n未満になっていなければならない．\n制約\n1 ≤ T ≤ 10\n5\n1 ≤ E ≤ 10\n5\n1 ≤ C(i) ≤ 10\n5\n入力に含まれる値はすべて整数である．\n入出力例\n入力例 1\n1 100\n1 1 1\n出力例 1\n100.0\nこの場合は\n0\n番の鉄板にエネルギーを全て加えるのが最適である．\n入力例 2\n2 100\n1 2 100 2 1\n出力例 2\n2.8301886792453\n入力例 3\n5 100000\n99999 99999 99999 1 1000 1000 1000 1 99999 99999 99999\n出力例 3\n199.4680851063830\n謝辞\nこの問題は Writer の二人がインド料理 RAJU 百万遍店とマクドナルド百万遍店において夏の暑さに辟易する中で作られた．"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2278_4376010","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\nint T;\ndouble C[2*NUM+1],E;\n\n//右側の合成プレートの比熱を求める\ndouble calc_right(){\n\n\tdouble ret = C[2*T];\n\tint rest_time = 1;\n\n\tfor(int base_loc = 2*T-1; base_loc >= T+1; base_loc--){\n\n\t\tret = min(C[base_loc],(ret*rest_time+C[base_loc])/(double)(rest_time+1));\n\t\trest_time++;\n\t}\n\n\treturn ret;\n}\n\n//左側の合成プレートの比熱を求める\ndouble calc_left(){\n\n\tdouble ret = C[0];\n\tint rest_time = 1;\n\n\tfor(int base_loc = 1; base_loc <= T-1; base_loc++){\n\n\t\tret = min(C[base_loc],(ret*rest_time+C[base_loc])/(double)(rest_time+1));\n\t\trest_time++;\n\t}\n\n\treturn ret;\n}\n\nint main(){\n\n\tscanf(\"%d %lf\",&T,&E);\n\n\tfor(int i = 0; i < 2*T+1; i++){\n\t\tscanf(\"%lf\",&C[i]);\n\t}\n\n\tdouble LEFT,RIGHT;\n\n\t//左方向の合成プレートの比熱計算\n\tLEFT = calc_left();\n\n\t//右方向の合成プレートの比熱計算\n\tRIGHT = calc_right();\n\n\tdouble ans = E/C[T];\n\tdouble mid,another;\n\n\tmid = E/(C[T]+T*(LEFT+RIGHT));\n\tanother = (E-mid*C[T])/(LEFT+RIGHT);\n\n\tans = max(ans,min((T+1)*mid,mid+another));\n\n\tprintf(\"%.10lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4744,"score_of_the_acc":-0.9941,"final_rank":7},{"submission_id":"aoj_2278_4376001","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\nint T;\ndouble C[2*NUM+1],E;\n\n//右側の合成プレートの比熱を求める\ndouble calc_right(){\n\n\tdouble ret = C[2*T];\n\tint rest_time = 1;\n\n\tfor(int base_loc = 2*T-1; base_loc >= T+1; base_loc--){\n\n\t\tret = min(C[base_loc],(ret*rest_time+C[base_loc])/(double)(rest_time+1));\n\t\trest_time++;\n\t}\n\n\treturn ret;\n}\n\n//左側の合成プレートの比熱を求める\ndouble calc_left(){\n\n\tdouble ret = C[0];\n\tint rest_time = 1;\n\n\tfor(int base_loc = 1; base_loc <= T-1; base_loc++){\n\n\t\tret = min(C[base_loc],(ret*rest_time+C[base_loc])/(double)(rest_time+1));\n\t\trest_time++;\n\t}\n\n\treturn ret;\n}\n\nint main(){\n\n\tscanf(\"%d %lf\",&T,&E);\n\n\tfor(int i = 0; i < 2*T+1; i++){\n\t\tscanf(\"%lf\",&C[i]);\n\t}\n\n\tdouble LEFT,RIGHT;\n\n\t//左方向の合成プレートの比熱計算\n\tLEFT = calc_left();\n\n\t//右方向の合成プレートの比熱計算\n\tRIGHT = calc_right();\n\n\tdouble ans = 0;\n\tdouble mid,another;\n\n\tmid = E/C[T];\n\tanother = 0;\n\tans = max(ans,min((T+1)*mid,mid+another));\n\n\tmid = E/(C[T]+T*(LEFT+RIGHT));\n\tanother = (E-mid*C[T])/(LEFT+RIGHT);\n\n\tans = max(ans,min((T+1)*mid,mid+another));\n\n\tprintf(\"%.10lf\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4772,"score_of_the_acc":-1,"final_rank":8},{"submission_id":"aoj_2278_2656288","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;\nint main() {\n\tint T; ld E;cin>>T>>E;\n\tvector<long long int>cs(2*T+1);\n\tfor (int i = 0; i < 2 * T + 1; ++i) {\n\t\tcin>>cs[i];\n\t}\n\tld ans=0;\n\tans=E/cs[T];\n\tint l=T-1,r=T+1;\n\t{\n\t\tld sum=0;\n\t\tld pre=1e18;\n\t\tfor (int i = T + 1; i < 2 * T + 1; ++i) {\n\t\t\tld now=sum+(2*T+1-i)*cs[i];\n\t\t\tif (now < pre) {\n\t\t\t\tr=i;\n\t\t\t\tpre=now;\n\t\t\t}\n\t\t\tsum+=cs[i];\n\t\t}\n\t}\n\t{\n\t\tld sum = 0;\n\t\tld pre = 1e18;\n\t\tfor (int i = T - 1; i >=0; --i) {\n\t\t\tld now = sum + (i+1)*cs[i];\n\t\t\tif (now < pre) {\n\t\t\t\tl = i;\n\t\t\t\tpre = now;\n\t\t\t}\n\t\t\tsum += cs[i];\n\t\t}\n\t}\n\tld sum=0;\n\tassert(l<r);\n\tfor (int i = l; i <= r; ++i) {\n\t\tif(i==l)sum+=(i+1)*cs[i];\n\t\telse if(i==r)sum+=(2*T+1-i)*cs[i];\n\t\telse sum+=cs[i];\n\t}\n\tans=max(ans,E/sum*(T+1));\n\tcout<<setprecision(20)<<fixed<<ans<<endl;\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":4524,"score_of_the_acc":-1.1298,"final_rank":9},{"submission_id":"aoj_2278_2656287","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;\nint main() {\n\tint T; ld E;cin>>T>>E;\n\tvector<int>cs(2*T+1);\n\tfor (int i = 0; i < 2 * T + 1; ++i) {\n\t\tcin>>cs[i];\n\t}\n\tld ans=0;\n\tans=E/cs[T];\n\tint l=T-1,r=T+1;\n\t{\n\t\tld sum=0;\n\t\tld pre=1e18;\n\t\tfor (int i = T + 1; i < 2 * T + 1; ++i) {\n\t\t\tld now=sum+(2*T+1-i)*cs[i];\n\t\t\tif (now < pre) {\n\t\t\t\tr=i;\n\t\t\t\tpre=now;\n\t\t\t}\n\t\t\tsum+=cs[i];\n\t\t}\n\t}\n\t{\n\t\tld sum = 0;\n\t\tld pre = 1e18;\n\t\tfor (int i = T - 1; i >=0; --i) {\n\t\t\tld now = sum + (i+1)*cs[i];\n\t\t\tif (now < pre) {\n\t\t\t\tl = i;\n\t\t\t\tpre = now;\n\t\t\t}\n\t\t\tsum += cs[i];\n\t\t}\n\t}\n\tld sum=0;\n\tassert(l<r);\n\tfor (int i = l; i <= r; ++i) {\n\t\tif(i==l)sum+=(i+1)*cs[i];\n\t\telse if(i==r)sum+=(2*T+1-i)*cs[i];\n\t\telse sum+=cs[i];\n\t}\n\tans=max(ans,E/sum*(T+1));\n\tcout<<setprecision(20)<<fixed<<ans<<endl;\n\treturn 0;\n}","accuracy":0.4523809523809524,"time_ms":40,"memory_kb":3672,"score_of_the_acc":-0.9513,"final_rank":15},{"submission_id":"aoj_2278_2656202","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;\nint main() {\n\tint T; ld E;cin>>T>>E;\n\tvector<int>cs(2*T+1);\n\tfor (int i = 0; i < 2 * T + 1; ++i) {\n\t\tcin>>cs[i];\n\t}\n\tld ans=0;\n\tans=E/cs[T];\n\tint l=T-1,r=T+1;\n\t{\n\t\tld sum=0;\n\t\tld pre=1e18;\n\t\tfor (int i = T + 1; i < 2 * T + 1; ++i) {\n\t\t\tld now=sum+(2*T+1-i)*cs[i];\n\t\t\tif (now < pre) {\n\t\t\t\tr=i;\n\t\t\t\tpre=now;\n\t\t\t}\n\t\t\tsum+=cs[i];\n\t\t}\n\t}\n\t{\n\t\tld sum = 0;\n\t\tld pre = 1e18;\n\t\tfor (int i = T - 1; i >=0; --i) {\n\t\t\tld now = sum + (i+1)*cs[i];\n\t\t\tif (now < pre) {\n\t\t\t\tl = i;\n\t\t\t\tpre = now;\n\t\t\t}\n\t\t\tsum += cs[i];\n\t\t}\n\t}\n\tld sum=0;\n\tfor (int i = l; i <= r; ++i) {\n\t\tif(i==l)sum+=(i+1)*cs[i];\n\t\telse if(i==r)sum+=(2*T+1-i)*cs[i];\n\t\telse sum+=cs[i];\n\t}\n\tans=max(ans,E/sum*(T+1));\n\tcout<<setprecision(20)<<fixed<<ans<<endl;\n\treturn 0;\n}","accuracy":0.4523809523809524,"time_ms":40,"memory_kb":3668,"score_of_the_acc":-0.9505,"final_rank":14},{"submission_id":"aoj_2278_2656199","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;\nint main() {\n\tint T; ld E;cin>>T>>E;\n\tvector<int>cs(2*T+1);\n\tfor (int i = 0; i < 2 * T + 1; ++i) {\n\t\tcin>>cs[i];\n\t}\n\tld ans=0;\n\tans=E/cs[T];\n\tint l=T-1,r=T-1;\n\t{\n\t\tld sum=0;\n\t\tld pre=1e18;\n\t\tfor (int i = T + 1; i < 2 * T + 1; ++i) {\n\t\t\tld now=sum+(2*T+1-i)*cs[i];\n\t\t\tif (now < pre) {\n\t\t\t\tr=i;\n\t\t\t\tpre=now;\n\t\t\t}\n\t\t\tsum+=cs[i];\n\t\t}\n\t}\n\t{\n\t\tld sum = 0;\n\t\tld pre = 1e18;\n\t\tfor (int i = T - 1; i >=0; --i) {\n\t\t\tld now = sum + (i+1)*cs[i];\n\t\t\tif (now < pre) {\n\t\t\t\tl = i;\n\t\t\t\tpre = now;\n\t\t\t}\n\t\t\tsum += cs[i];\n\t\t}\n\t}\n\tld sum=0;\n\tfor (int i = l; i <= r; ++i) {\n\t\tif(i==l)sum+=(i+1)*cs[i];\n\t\telse if(i==r)sum+=(2*T+1-i)*cs[i];\n\t\telse sum+=cs[i];\n\t}\n\tans=max(ans,E/sum*(T+1));\n\tcout<<setprecision(20)<<fixed<<ans<<endl;\n\treturn 0;\n}","accuracy":0.4523809523809524,"time_ms":40,"memory_kb":3656,"score_of_the_acc":-0.948,"final_rank":13},{"submission_id":"aoj_2278_2656088","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;\nint main() {\n\tint T; ld E;cin>>T>>E;\n\tvector<int>cs(2*T+1);\n\tfor (int i = 0; i < 2 * T + 1; ++i) {\n\t\tcin>>cs[i];\n\t}\n\tld ans=0;\n\tans=E/cs[T];\n\tint l=T-1,r=T-1;\n\t{\n\t\tld sum=0;\n\t\tld pre=1e18;\n\t\tfor (int i = T + 1; i < 2 * T + 1; ++i) {\n\t\t\tld now=sum+(2*T+1-i)*cs[i];\n\t\t\tif (now < pre) {\n\t\t\t\tr=i;\n\t\t\t\tpre=now;\n\t\t\t}\n\t\t\tsum+=cs[i];\n\t\t}\n\t}\n\t{\n\t\tld sum = 0;\n\t\tld pre = 1e18;\n\t\tfor (int i = T - 1; i >=0; --i) {\n\t\t\tld now = sum + (i+1)*cs[i];\n\t\t\tif (now < pre) {\n\t\t\t\tl = i;\n\t\t\t\tpre = now;\n\t\t\t}\n\t\t\tsum += cs[i];\n\t\t}\n\t}\n\tld sum=0;\n\tfor (int i = l; i <= r; ++i) {\n\t\tif(i==l)sum+=(i+1)*cs[i];\n\t\telse if(i==r)sum+=(2*T+1-i)*cs[i];\n\t\telse sum+=cs[i];\n\t}\n\tans=max(ans,E/sum*(T+1));\n\tcout<<setprecision(10)<<fixed<<ans<<endl;\n\treturn 0;\n}","accuracy":0.4523809523809524,"time_ms":40,"memory_kb":3552,"score_of_the_acc":-0.9262,"final_rank":12},{"submission_id":"aoj_2278_1425779","code_snippet":"#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n#define LDcout(x,n) fixed<<setprecision(n)<<x\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\n\nvoid mainmain(){\n\tint T,E;\n\tcin>>T>>E;\n\tvector<double> v1(T),v2(T);\n\trep(i,T){\n\t\tcin>>v1[T-1-i];\n\t}\n\tdouble b;\n\tcin>>b;\n\trep(i,T){\n\t\tcin>>v2[i];\n\t}\n\tdouble a=v1[T-1];\n\tdouble c=v2[T-1];\n\tfor(int i=T-2;i>=0;i--){\n\t\tint s=T-i;\n\t\tif(v1[i]>=a){\n\t\t\ta=(v1[i]+a*(s-1))/(s);\n\t\t}\n\t\telse{\n\t\t\ta=v1[i];\n\t\t}\n\t\tif(v2[i]>=c){\n\t\t\tc=(v2[i]+c*(s-1))/(s);\n\t\t}\n\t\telse{\n\t\t\tc=v2[i];\n\t\t}\n\t}\n\tdouble ans1=max(E/b,(double)E*(T+1)/(T*(a+c)+b));\n\tcout<<LDcout(ans1,10)<<endl;\n}\n\n\nsigned main() {\n\tios_base::sync_with_stdio(false);\n \t// cout<<fixed<<setprecision(10);\n mainmain();\n}","accuracy":1,"time_ms":40,"memory_kb":2844,"score_of_the_acc":-0.7778,"final_rank":5},{"submission_id":"aoj_2278_1425777","code_snippet":"#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n#define LDcout(x,n) fixed<<setprecision(n)<<x\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\n\nvoid mainmain(){\n\tint T,E;\n\tcin>>T>>E;\n\tvector<double> v1(T),v2(T);\n\trep(i,T){\n\t\tcin>>v1[T-1-i];\n\t}\n\tdouble b;\n\tcin>>b;\n\trep(i,T){\n\t\tcin>>v2[i];\n\t}\n\tdouble a=v1[T-1];\n\tdouble c=v2[T-1];\n\tfor(int i=T-2;i>=0;i--){\n\t\tint s=T-i;\n\t\t// cout<<v1[i]<<endl;\n\t\t// cout<<s<<endl;\n\t\tif(v1[i]>=a){\n\t\t\ta=(v1[i]+a*(s-1))/(s);\n\t\t}\n\t\telse{\n\t\t\ta=v1[i];\n\t\t}\n\t\tif(v2[i]>=c){\n\t\t\tc=(v2[i]+c*(s-1))/(s);\n\t\t}\n\t\telse{\n\t\t\tc=v2[i];\n\t\t}\n\t}\n\t// cout<<a<<\" \"<<b<<\" \"<<c<<endl;\n\tdouble l=0,r=E;\n\twhile(r-l>EPS){\n\t\tdouble mid1=l+(r-l)/3;\n\t\tdouble mid2=l+(r-l)*2/3;\n\t\tdouble h1=(E-(a+c)*mid1)/b;\n\t\tdouble h2=(E-(a+c)*mid2)/b;\n\t\tdouble ans1=min(mid1+h1,T*h1);\n\t\tdouble ans2=min(mid2+h2,T*h2);\n\t\tif(ans1<ans2){\n\t\t\tl=mid1;\n\t\t}\n\t\telse{\n\t\t\tr=mid2;\n\t\t}\n\t}\n\t// cout<<a<<\" \"<<c<<endl;\n\t// cout<<E*(T+1)<<endl;\n\tdouble ans1=max(E/b,(double)E*(T+1)/(T*(a+c)+b));\n\t// cout<<l+h1<<\" \"<<T*h1<<endl;\n\tcout<<ans1<<endl;\n}\n\n\nsigned main() {\n\tios_base::sync_with_stdio(false);\n \tcout<<fixed<<setprecision(10);\n mainmain();\n}","accuracy":1,"time_ms":40,"memory_kb":2844,"score_of_the_acc":-0.7778,"final_rank":5},{"submission_id":"aoj_2278_1425768","code_snippet":"#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <map>\n#include <set>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <cstdio>\n#include <cstring>\n#include <iterator>\n#include <bitset>\n#include <unordered_set>\n#include <unordered_map>\n#include <fstream>\n#include <iomanip>\n//#include <utility>\n//#include <memory>\n//#include <functional>\n//#include <deque>\n//#include <cctype>\n//#include <ctime>\n//#include <numeric>\n//#include <list>\n//#include <iomanip>\n\n//#if __cplusplus >= 201103L\n//#include <array>\n//#include <tuple>\n//#include <initializer_list>\n//#include <forward_list>\n//\n//#define cauto const auto&\n//#else\n\n//#endif\n\nusing namespace std;\n\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\n\ntypedef vector<int> vint;\ntypedef vector<vector<int> > vvint;\ntypedef vector<long long> vll, vLL;\ntypedef vector<vector<long long> > vvll, vvLL;\n\n#define VV(T) vector<vector< T > >\n\ntemplate <class T>\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\n v.assign(a, vector<T>(b, t));\n}\n\ntemplate <class F, class T>\nvoid convert(const F &f, T &t){\n stringstream ss;\n ss << f;\n ss >> t;\n}\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) reep((i),0,(n))\n#define ALL(v) (v).begin(),(v).end()\n#define PB push_back\n#define F first\n#define S second\n#define mkp make_pair\n#define RALL(v) (v).rbegin(),(v).rend()\n#define DEBUG\n#ifdef DEBUG\n#define dump(x) cout << #x << \" = \" << (x) << endl;\n#define debug(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n#else\n#define dump(x) \n#define debug(x) \n#endif\n#define LDcout(x,n) fixed<<setprecision(n)<<x\n\n#define MOD 1000000007LL\n#define EPS 1e-8\nstatic const int INF=1<<24;\n\nvoid mainmain(){\n\tint T,E;\n\tcin>>T>>E;\n\tvector<double> v1(T),v2(T);\n\trep(i,T){\n\t\tcin>>v1[T-1-i];\n\t}\n\tdouble b;\n\tcin>>b;\n\trep(i,T){\n\t\tcin>>v2[i];\n\t}\n\tdouble a=v1[T-1];\n\tdouble c=v2[T-1];\n\tfor(int i=T-2;i>=0;i--){\n\t\tint s=T-i;\n\t\t// cout<<v1[i]<<endl;\n\t\t// cout<<s<<endl;\n\t\tif(v1[i]>=a){\n\t\t\ta=(v1[i]+a*(s-1))/(s);\n\t\t}\n\t\telse{\n\t\t\ta=v1[i];\n\t\t}\n\t\tif(v2[i]>=c){\n\t\t\tc=(v2[i]+c*(s-1))/(s);\n\t\t}\n\t\telse{\n\t\t\tc=v2[i];\n\t\t}\n\t}\n\t// cout<<a<<\" \"<<b<<\" \"<<c<<endl;\n\tdouble l=0,r=E;\n\twhile(r-l>EPS){\n\t\tdouble mid1=l+(r-l)/3;\n\t\tdouble mid2=l+(r-l)*2/3;\n\t\tdouble h1=(E-(a+c)*mid1)/b;\n\t\tdouble h2=(E-(a+c)*mid2)/b;\n\t\tdouble ans1=min(mid1+h1,T*h1);\n\t\tdouble ans2=min(mid2+h2,T*h2);\n\t\tif(ans1<ans2){\n\t\t\tl=mid1;\n\t\t}\n\t\telse{\n\t\t\tr=mid2;\n\t\t}\n\t}\n\t// cout<<a<<\" \"<<c<<endl;\n\tdouble ans1=max(E/b,E*(T+1)/(T*(a+c)+b));\n\t// cout<<l+h1<<\" \"<<T*h1<<endl;\n\tcout<<ans1<<endl;\n}\n\n\nsigned main() {\n\tios_base::sync_with_stdio(false);\n \tcout<<fixed<<setprecision(10);\n mainmain();\n}","accuracy":0.47619047619047616,"time_ms":40,"memory_kb":2844,"score_of_the_acc":-0.7778,"final_rank":11},{"submission_id":"aoj_2278_728148","code_snippet":"#include <cstdio>\n\nusing namespace std;\n\nint main()\n{\n\tfor(int t,e;~scanf(\"%d%d\",&t,&e);){\n\t\tdouble c[2*t+1];\n\t\tfor(int i=0;i<2*t+1;i++)\n\t\t\tscanf(\"%lf\",c+i);\n\t\tfor(int s=2;s<=t;s++){\n\t\t\tif(c[t+(t-s+1)]>c[t+(t-s+2)])\n\t\t\t\tc[t+(t-s+1)]=(c[t+(t-s+1)]+(s-1)*c[t+(t-s+2)])/s;\n\t\t\tif(c[t-(t-s+1)]>c[t-(t-s+2)])\n\t\t\t\tc[t-(t-s+1)]=(c[t-(t-s+1)]+(s-1)*c[t-(t-s+2)])/s;\n\t\t}\n\t\tif(c[t]>c[t-1]+c[t+1])\n\t\t\tc[t]=(c[t]+t*(c[t-1]+c[t+1]))/(t+1);\n\t\tprintf(\"%.13f\\n\",e/c[t]);\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":2640,"score_of_the_acc":-0.735,"final_rank":4},{"submission_id":"aoj_2278_427595","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\nint T,E;\ndouble *C,C_buf[200001];\n\ndouble merge(){\n\tdouble res=C[T];\n\tfor(int i=T-1;i>=1;i--){\n\t\t// プレート i と i+1 をマージし、それを新たにプレート i と思う\n\t\t// そうすると、新たなプレート i+1 にはエネルギーをかけないと考えていい\n\t\tres=min(C[i],(C[i]+(T-i)*res)/(T-i+1));\n\t\t// min の第 1 項は ( マージする前の ) プレート i+1 にエネルギーをかけないケース (?)\n\t\t// min の第 2 項は ( マージする前の ) プレート i+1 にエネルギーをかけるケース\n\t}\n\treturn res;\n}\n\nint main(){\n\tscanf(\"%d%d\",&T,&E);\n\tC=C_buf+100000;\n\tfor(int i=-T;i<=T;i++) scanf(\"%lf\",C+i);\n\n\tdouble C0=C[0];\n\tdouble Cr=merge(); // 右 T 枚のプレートをマージしてできたプレートの比熱\n\treverse(C-T,C+T+1);\n\tdouble Cl=merge(); // 左 T 枚のプレートをマージしてできたプレートの比熱\n\n\t// これで 3 枚のプレート -1, 0, 1 の問題になった\n\t// 解は\n\t// - プレート 0 で T+1 回熱せられる\n\t// - プレート 0 で 1 回、プレート 1 で 1 回熱せられる\n\t// - プレート 0 で 1 回、プレート -1 で 1 回熱せられる\n\t// のいずれか\n\n\t// プレートにかける熱をそれぞれ Hl, H0, Hr とする\n\t// 制約 Cl*Hl+C0*H0+Cr*Hr = E のもと、min{(T+1)*H0, H0+Hl, H0+Hr} を最大化する問題になる\n\t// Hl = Hr とするのがいいことは直感的にわかるので、\n\t// 制約 C0*H0+(Cl+Cr)*Hl = E のもと、min{(T+1)*H0, H0+Hl} を最大化すればいい\n\tdouble ans=0,H0,Hl;\n\tH0=E/C0; Hl=(E-C0*H0)/(Cl+Cr); ans=max(ans,min((T+1)*H0,H0+Hl));\n\tH0=E/(C0+T*(Cl+Cr)); Hl=(E-C0*H0)/(Cl+Cr); ans=max(ans,min((T+1)*H0,H0+Hl));\n\tprintf(\"%.9f\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":2220,"score_of_the_acc":-0.647,"final_rank":2},{"submission_id":"aoj_2278_301320","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n\ninline int getInt(){ int s; scanf(\"%d\", &s); return s; }\n\nusing namespace std;\n\ndouble buff[200200];\ndouble *c;\nint t;\nint e;\n\n\nint main(){\n t = getInt();\n e = getInt();\n\n REP(i, 2 * t + 1) buff[i] = (double)getInt();\n c = &buff[t];\n\n for(int s = 2; s <= t; s++){\n {\n // merge to left\n double alpha = c[t - s + 1];\n double beta = c[t - s + 2];\n if(alpha > beta){\n\tc[t - s + 1] = (alpha + beta * (s - 1)) / s;\n }\n }\n {\n // merge to right\n double alpha = c[-(t - s + 1)];\n double beta = c[-(t - s + 2)];\n if(alpha > beta){\n\tc[-(t - s + 1)] = (alpha + beta * (s - 1)) / s;\n }\n }\n }\n \n double alpha = c[-1];\n double beta = c[0];\n double ganma = c[1];\n\n double ans;\n\n double h1 = e / (alpha + ganma + beta / t);\n double h2 = (e - (alpha + ganma) * h1) / beta;\n ans = h1 + h2;\n\n ans = max(ans, e / beta);\n\n printf(\"%.7f\\n\", ans);\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":2304,"score_of_the_acc":-0.6646,"final_rank":3},{"submission_id":"aoj_2278_271449","code_snippet":"#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 t, e;\n cin >> t >> e;\n\n vector<double> c(2*t+1);\n for(int i=0; i<2*t+1; ++i)\n cin >> c[i];\n\n // ツ熱ツつウT+1ツつセツつッツ嘉熱ツつキツづゥツつスツづ淞づ可必ツ要ツづ按催渉ャツエツネツδ仰ギツー\n double minLeft = 0.0;\n double minRight = 0.0;\n for(int i=0; i<t; ++i){\n minLeft = min(minLeft + c[i], c[i] * (i+1));\n minRight = min(minRight + c[2*t-i], c[2*t-i] * (i+1));\n }\n double minEnergy = min(minLeft + minRight + c[t], c[t] * (t+1));\n\n double ret = e / minEnergy * (t+1);\n printf(\"%.10f\\n\", ret);\n\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":2484,"score_of_the_acc":-1.5205,"final_rank":10},{"submission_id":"aoj_2278_269010","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\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\nint n;\ndouble E;\ndouble plate[300000];\n\ninline double Get(int index) {\n return plate[index + n];\n}\n\ninline double Merge(double x, double y, int w) {\n return min(y, (w * x + y) / (w + 1));\n}\n\ndouble MergeAll(int dir) {\n double left = Get(-dir * n);\n int w = 1;\n int index = -dir * n + dir;\n while (index != 0) {\n left = Merge(left, Get(index), w);\n //cout << index << \" \" << left << \" \" << w << endl;\n assert(left >= -EPS);\n w++;\n index += dir;\n }\n return left;\n}\n\nint main() {\n while (scanf(\"%d %lf\", &n, &E) > 0) {\n REP(i, 2 * n + 1) {\n scanf(\"%lf\", &plate[i]);\n }\n double left = MergeAll(1);\n double right = MergeAll(-1);\n double ans = max(E / Get(0), E * (n + 1) / (n * (left + right) + Get(0)));\n printf(\"%.8f\\n\", ans);\n }\n}","accuracy":1,"time_ms":50,"memory_kb":0,"score_of_the_acc":-0.2727,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2278_4376010\",\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\\nint T;\\ndouble C[2*NUM+1],E;\\n\\n//右側の合成プレートの比熱を求める\\ndouble calc_right(){\\n\\n\\tdouble ret = C[2*T];\\n\\tint rest_time = 1;\\n\\n\\tfor(int base_loc = 2*T-1; base_loc >= T+1; base_loc--){\\n\\n\\t\\tret = min(C[base_loc],(ret*rest_time+C[base_loc])/(double)(rest_time+1));\\n\\t\\trest_time++;\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\n//左側の合成プレートの比熱を求める\\ndouble calc_left(){\\n\\n\\tdouble ret = C[0];\\n\\tint rest_time = 1;\\n\\n\\tfor(int base_loc = 1; base_loc <= T-1; base_loc++){\\n\\n\\t\\tret = min(C[base_loc],(ret*rest_time+C[base_loc])/(double)(rest_time+1));\\n\\t\\trest_time++;\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %lf\\\",&T,&E);\\n\\n\\tfor(int i = 0; i < 2*T+1; i++){\\n\\t\\tscanf(\\\"%lf\\\",&C[i]);\\n\\t}\\n\\n\\tdouble LEFT,RIGHT;\\n\\n\\t//左方向の合成プレートの比熱計算\\n\\tLEFT = calc_left();\\n\\n\\t//右方向の合成プレートの比熱計算\\n\\tRIGHT = calc_right();\\n\\n\\tdouble ans = E/C[T];\\n\\tdouble mid,another;\\n\\n\\tmid = E/(C[T]+T*(LEFT+RIGHT));\\n\\tanother = (E-mid*C[T])/(LEFT+RIGHT);\\n\\n\\tans = max(ans,min((T+1)*mid,mid+another));\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4744,\n \"score_of_the_acc\": -0.9941,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2278_4376001\",\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\\nint T;\\ndouble C[2*NUM+1],E;\\n\\n//右側の合成プレートの比熱を求める\\ndouble calc_right(){\\n\\n\\tdouble ret = C[2*T];\\n\\tint rest_time = 1;\\n\\n\\tfor(int base_loc = 2*T-1; base_loc >= T+1; base_loc--){\\n\\n\\t\\tret = min(C[base_loc],(ret*rest_time+C[base_loc])/(double)(rest_time+1));\\n\\t\\trest_time++;\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\n//左側の合成プレートの比熱を求める\\ndouble calc_left(){\\n\\n\\tdouble ret = C[0];\\n\\tint rest_time = 1;\\n\\n\\tfor(int base_loc = 1; base_loc <= T-1; base_loc++){\\n\\n\\t\\tret = min(C[base_loc],(ret*rest_time+C[base_loc])/(double)(rest_time+1));\\n\\t\\trest_time++;\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %lf\\\",&T,&E);\\n\\n\\tfor(int i = 0; i < 2*T+1; i++){\\n\\t\\tscanf(\\\"%lf\\\",&C[i]);\\n\\t}\\n\\n\\tdouble LEFT,RIGHT;\\n\\n\\t//左方向の合成プレートの比熱計算\\n\\tLEFT = calc_left();\\n\\n\\t//右方向の合成プレートの比熱計算\\n\\tRIGHT = calc_right();\\n\\n\\tdouble ans = 0;\\n\\tdouble mid,another;\\n\\n\\tmid = E/C[T];\\n\\tanother = 0;\\n\\tans = max(ans,min((T+1)*mid,mid+another));\\n\\n\\tmid = E/(C[T]+T*(LEFT+RIGHT));\\n\\tanother = (E-mid*C[T])/(LEFT+RIGHT);\\n\\n\\tans = max(ans,min((T+1)*mid,mid+another));\\n\\n\\tprintf(\\\"%.10lf\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4772,\n \"score_of_the_acc\": -1,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2278_2656288\",\n \"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;\\nint main() {\\n\\tint T; ld E;cin>>T>>E;\\n\\tvector<long long int>cs(2*T+1);\\n\\tfor (int i = 0; i < 2 * T + 1; ++i) {\\n\\t\\tcin>>cs[i];\\n\\t}\\n\\tld ans=0;\\n\\tans=E/cs[T];\\n\\tint l=T-1,r=T+1;\\n\\t{\\n\\t\\tld sum=0;\\n\\t\\tld pre=1e18;\\n\\t\\tfor (int i = T + 1; i < 2 * T + 1; ++i) {\\n\\t\\t\\tld now=sum+(2*T+1-i)*cs[i];\\n\\t\\t\\tif (now < pre) {\\n\\t\\t\\t\\tr=i;\\n\\t\\t\\t\\tpre=now;\\n\\t\\t\\t}\\n\\t\\t\\tsum+=cs[i];\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tld sum = 0;\\n\\t\\tld pre = 1e18;\\n\\t\\tfor (int i = T - 1; i >=0; --i) {\\n\\t\\t\\tld now = sum + (i+1)*cs[i];\\n\\t\\t\\tif (now < pre) {\\n\\t\\t\\t\\tl = i;\\n\\t\\t\\t\\tpre = now;\\n\\t\\t\\t}\\n\\t\\t\\tsum += cs[i];\\n\\t\\t}\\n\\t}\\n\\tld sum=0;\\n\\tassert(l<r);\\n\\tfor (int i = l; i <= r; ++i) {\\n\\t\\tif(i==l)sum+=(i+1)*cs[i];\\n\\t\\telse if(i==r)sum+=(2*T+1-i)*cs[i];\\n\\t\\telse sum+=cs[i];\\n\\t}\\n\\tans=max(ans,E/sum*(T+1));\\n\\tcout<<setprecision(20)<<fixed<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4524,\n \"score_of_the_acc\": -1.1298,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2278_2656287\",\n \"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;\\nint main() {\\n\\tint T; ld E;cin>>T>>E;\\n\\tvector<int>cs(2*T+1);\\n\\tfor (int i = 0; i < 2 * T + 1; ++i) {\\n\\t\\tcin>>cs[i];\\n\\t}\\n\\tld ans=0;\\n\\tans=E/cs[T];\\n\\tint l=T-1,r=T+1;\\n\\t{\\n\\t\\tld sum=0;\\n\\t\\tld pre=1e18;\\n\\t\\tfor (int i = T + 1; i < 2 * T + 1; ++i) {\\n\\t\\t\\tld now=sum+(2*T+1-i)*cs[i];\\n\\t\\t\\tif (now < pre) {\\n\\t\\t\\t\\tr=i;\\n\\t\\t\\t\\tpre=now;\\n\\t\\t\\t}\\n\\t\\t\\tsum+=cs[i];\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tld sum = 0;\\n\\t\\tld pre = 1e18;\\n\\t\\tfor (int i = T - 1; i >=0; --i) {\\n\\t\\t\\tld now = sum + (i+1)*cs[i];\\n\\t\\t\\tif (now < pre) {\\n\\t\\t\\t\\tl = i;\\n\\t\\t\\t\\tpre = now;\\n\\t\\t\\t}\\n\\t\\t\\tsum += cs[i];\\n\\t\\t}\\n\\t}\\n\\tld sum=0;\\n\\tassert(l<r);\\n\\tfor (int i = l; i <= r; ++i) {\\n\\t\\tif(i==l)sum+=(i+1)*cs[i];\\n\\t\\telse if(i==r)sum+=(2*T+1-i)*cs[i];\\n\\t\\telse sum+=cs[i];\\n\\t}\\n\\tans=max(ans,E/sum*(T+1));\\n\\tcout<<setprecision(20)<<fixed<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4523809523809524,\n \"time_ms\": 40,\n \"memory_kb\": 3672,\n \"score_of_the_acc\": -0.9513,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2278_2656202\",\n \"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;\\nint main() {\\n\\tint T; ld E;cin>>T>>E;\\n\\tvector<int>cs(2*T+1);\\n\\tfor (int i = 0; i < 2 * T + 1; ++i) {\\n\\t\\tcin>>cs[i];\\n\\t}\\n\\tld ans=0;\\n\\tans=E/cs[T];\\n\\tint l=T-1,r=T+1;\\n\\t{\\n\\t\\tld sum=0;\\n\\t\\tld pre=1e18;\\n\\t\\tfor (int i = T + 1; i < 2 * T + 1; ++i) {\\n\\t\\t\\tld now=sum+(2*T+1-i)*cs[i];\\n\\t\\t\\tif (now < pre) {\\n\\t\\t\\t\\tr=i;\\n\\t\\t\\t\\tpre=now;\\n\\t\\t\\t}\\n\\t\\t\\tsum+=cs[i];\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tld sum = 0;\\n\\t\\tld pre = 1e18;\\n\\t\\tfor (int i = T - 1; i >=0; --i) {\\n\\t\\t\\tld now = sum + (i+1)*cs[i];\\n\\t\\t\\tif (now < pre) {\\n\\t\\t\\t\\tl = i;\\n\\t\\t\\t\\tpre = now;\\n\\t\\t\\t}\\n\\t\\t\\tsum += cs[i];\\n\\t\\t}\\n\\t}\\n\\tld sum=0;\\n\\tfor (int i = l; i <= r; ++i) {\\n\\t\\tif(i==l)sum+=(i+1)*cs[i];\\n\\t\\telse if(i==r)sum+=(2*T+1-i)*cs[i];\\n\\t\\telse sum+=cs[i];\\n\\t}\\n\\tans=max(ans,E/sum*(T+1));\\n\\tcout<<setprecision(20)<<fixed<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4523809523809524,\n \"time_ms\": 40,\n \"memory_kb\": 3668,\n \"score_of_the_acc\": -0.9505,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2278_2656199\",\n \"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;\\nint main() {\\n\\tint T; ld E;cin>>T>>E;\\n\\tvector<int>cs(2*T+1);\\n\\tfor (int i = 0; i < 2 * T + 1; ++i) {\\n\\t\\tcin>>cs[i];\\n\\t}\\n\\tld ans=0;\\n\\tans=E/cs[T];\\n\\tint l=T-1,r=T-1;\\n\\t{\\n\\t\\tld sum=0;\\n\\t\\tld pre=1e18;\\n\\t\\tfor (int i = T + 1; i < 2 * T + 1; ++i) {\\n\\t\\t\\tld now=sum+(2*T+1-i)*cs[i];\\n\\t\\t\\tif (now < pre) {\\n\\t\\t\\t\\tr=i;\\n\\t\\t\\t\\tpre=now;\\n\\t\\t\\t}\\n\\t\\t\\tsum+=cs[i];\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tld sum = 0;\\n\\t\\tld pre = 1e18;\\n\\t\\tfor (int i = T - 1; i >=0; --i) {\\n\\t\\t\\tld now = sum + (i+1)*cs[i];\\n\\t\\t\\tif (now < pre) {\\n\\t\\t\\t\\tl = i;\\n\\t\\t\\t\\tpre = now;\\n\\t\\t\\t}\\n\\t\\t\\tsum += cs[i];\\n\\t\\t}\\n\\t}\\n\\tld sum=0;\\n\\tfor (int i = l; i <= r; ++i) {\\n\\t\\tif(i==l)sum+=(i+1)*cs[i];\\n\\t\\telse if(i==r)sum+=(2*T+1-i)*cs[i];\\n\\t\\telse sum+=cs[i];\\n\\t}\\n\\tans=max(ans,E/sum*(T+1));\\n\\tcout<<setprecision(20)<<fixed<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4523809523809524,\n \"time_ms\": 40,\n \"memory_kb\": 3656,\n \"score_of_the_acc\": -0.948,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2278_2656088\",\n \"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;\\nint main() {\\n\\tint T; ld E;cin>>T>>E;\\n\\tvector<int>cs(2*T+1);\\n\\tfor (int i = 0; i < 2 * T + 1; ++i) {\\n\\t\\tcin>>cs[i];\\n\\t}\\n\\tld ans=0;\\n\\tans=E/cs[T];\\n\\tint l=T-1,r=T-1;\\n\\t{\\n\\t\\tld sum=0;\\n\\t\\tld pre=1e18;\\n\\t\\tfor (int i = T + 1; i < 2 * T + 1; ++i) {\\n\\t\\t\\tld now=sum+(2*T+1-i)*cs[i];\\n\\t\\t\\tif (now < pre) {\\n\\t\\t\\t\\tr=i;\\n\\t\\t\\t\\tpre=now;\\n\\t\\t\\t}\\n\\t\\t\\tsum+=cs[i];\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tld sum = 0;\\n\\t\\tld pre = 1e18;\\n\\t\\tfor (int i = T - 1; i >=0; --i) {\\n\\t\\t\\tld now = sum + (i+1)*cs[i];\\n\\t\\t\\tif (now < pre) {\\n\\t\\t\\t\\tl = i;\\n\\t\\t\\t\\tpre = now;\\n\\t\\t\\t}\\n\\t\\t\\tsum += cs[i];\\n\\t\\t}\\n\\t}\\n\\tld sum=0;\\n\\tfor (int i = l; i <= r; ++i) {\\n\\t\\tif(i==l)sum+=(i+1)*cs[i];\\n\\t\\telse if(i==r)sum+=(2*T+1-i)*cs[i];\\n\\t\\telse sum+=cs[i];\\n\\t}\\n\\tans=max(ans,E/sum*(T+1));\\n\\tcout<<setprecision(10)<<fixed<<ans<<endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.4523809523809524,\n \"time_ms\": 40,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.9262,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2278_1425779\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cfloat>\\n#include <map>\\n#include <set>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <sstream>\\n#include <complex>\\n#include <stack>\\n#include <queue>\\n#include <cstdio>\\n#include <cstring>\\n#include <iterator>\\n#include <bitset>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <fstream>\\n#include <iomanip>\\n//#include <utility>\\n//#include <memory>\\n//#include <functional>\\n//#include <deque>\\n//#include <cctype>\\n//#include <ctime>\\n//#include <numeric>\\n//#include <list>\\n//#include <iomanip>\\n\\n//#if __cplusplus >= 201103L\\n//#include <array>\\n//#include <tuple>\\n//#include <initializer_list>\\n//#include <forward_list>\\n//\\n//#define cauto const auto&\\n//#else\\n\\n//#endif\\n\\nusing namespace std;\\n\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\ntypedef vector<int> vint;\\ntypedef vector<vector<int> > vvint;\\ntypedef vector<long long> vll, vLL;\\ntypedef vector<vector<long long> > vvll, vvLL;\\n\\n#define VV(T) vector<vector< T > >\\n\\ntemplate <class T>\\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\\n v.assign(a, vector<T>(b, t));\\n}\\n\\ntemplate <class F, class T>\\nvoid convert(const F &f, T &t){\\n stringstream ss;\\n ss << f;\\n ss >> t;\\n}\\n\\n#undef _P\\n#define _P(...) (void)printf(__VA_ARGS__)\\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\\n#define rep(i,n) reep((i),0,(n))\\n#define ALL(v) (v).begin(),(v).end()\\n#define PB push_back\\n#define F first\\n#define S second\\n#define mkp make_pair\\n#define RALL(v) (v).rbegin(),(v).rend()\\n#define DEBUG\\n#ifdef DEBUG\\n#define dump(x) cout << #x << \\\" = \\\" << (x) << endl;\\n#define debug(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << \\\" \\\" << __FILE__ << endl;\\n#else\\n#define dump(x) \\n#define debug(x) \\n#endif\\n#define LDcout(x,n) fixed<<setprecision(n)<<x\\n\\n#define MOD 1000000007LL\\n#define EPS 1e-8\\nstatic const int INF=1<<24;\\n\\nvoid mainmain(){\\n\\tint T,E;\\n\\tcin>>T>>E;\\n\\tvector<double> v1(T),v2(T);\\n\\trep(i,T){\\n\\t\\tcin>>v1[T-1-i];\\n\\t}\\n\\tdouble b;\\n\\tcin>>b;\\n\\trep(i,T){\\n\\t\\tcin>>v2[i];\\n\\t}\\n\\tdouble a=v1[T-1];\\n\\tdouble c=v2[T-1];\\n\\tfor(int i=T-2;i>=0;i--){\\n\\t\\tint s=T-i;\\n\\t\\tif(v1[i]>=a){\\n\\t\\t\\ta=(v1[i]+a*(s-1))/(s);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\ta=v1[i];\\n\\t\\t}\\n\\t\\tif(v2[i]>=c){\\n\\t\\t\\tc=(v2[i]+c*(s-1))/(s);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tc=v2[i];\\n\\t\\t}\\n\\t}\\n\\tdouble ans1=max(E/b,(double)E*(T+1)/(T*(a+c)+b));\\n\\tcout<<LDcout(ans1,10)<<endl;\\n}\\n\\n\\nsigned main() {\\n\\tios_base::sync_with_stdio(false);\\n \\t// cout<<fixed<<setprecision(10);\\n mainmain();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2844,\n \"score_of_the_acc\": -0.7778,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2278_1425777\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cfloat>\\n#include <map>\\n#include <set>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <sstream>\\n#include <complex>\\n#include <stack>\\n#include <queue>\\n#include <cstdio>\\n#include <cstring>\\n#include <iterator>\\n#include <bitset>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <fstream>\\n#include <iomanip>\\n//#include <utility>\\n//#include <memory>\\n//#include <functional>\\n//#include <deque>\\n//#include <cctype>\\n//#include <ctime>\\n//#include <numeric>\\n//#include <list>\\n//#include <iomanip>\\n\\n//#if __cplusplus >= 201103L\\n//#include <array>\\n//#include <tuple>\\n//#include <initializer_list>\\n//#include <forward_list>\\n//\\n//#define cauto const auto&\\n//#else\\n\\n//#endif\\n\\nusing namespace std;\\n\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\ntypedef vector<int> vint;\\ntypedef vector<vector<int> > vvint;\\ntypedef vector<long long> vll, vLL;\\ntypedef vector<vector<long long> > vvll, vvLL;\\n\\n#define VV(T) vector<vector< T > >\\n\\ntemplate <class T>\\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\\n v.assign(a, vector<T>(b, t));\\n}\\n\\ntemplate <class F, class T>\\nvoid convert(const F &f, T &t){\\n stringstream ss;\\n ss << f;\\n ss >> t;\\n}\\n\\n#undef _P\\n#define _P(...) (void)printf(__VA_ARGS__)\\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\\n#define rep(i,n) reep((i),0,(n))\\n#define ALL(v) (v).begin(),(v).end()\\n#define PB push_back\\n#define F first\\n#define S second\\n#define mkp make_pair\\n#define RALL(v) (v).rbegin(),(v).rend()\\n#define DEBUG\\n#ifdef DEBUG\\n#define dump(x) cout << #x << \\\" = \\\" << (x) << endl;\\n#define debug(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << \\\" \\\" << __FILE__ << endl;\\n#else\\n#define dump(x) \\n#define debug(x) \\n#endif\\n#define LDcout(x,n) fixed<<setprecision(n)<<x\\n\\n#define MOD 1000000007LL\\n#define EPS 1e-8\\nstatic const int INF=1<<24;\\n\\nvoid mainmain(){\\n\\tint T,E;\\n\\tcin>>T>>E;\\n\\tvector<double> v1(T),v2(T);\\n\\trep(i,T){\\n\\t\\tcin>>v1[T-1-i];\\n\\t}\\n\\tdouble b;\\n\\tcin>>b;\\n\\trep(i,T){\\n\\t\\tcin>>v2[i];\\n\\t}\\n\\tdouble a=v1[T-1];\\n\\tdouble c=v2[T-1];\\n\\tfor(int i=T-2;i>=0;i--){\\n\\t\\tint s=T-i;\\n\\t\\t// cout<<v1[i]<<endl;\\n\\t\\t// cout<<s<<endl;\\n\\t\\tif(v1[i]>=a){\\n\\t\\t\\ta=(v1[i]+a*(s-1))/(s);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\ta=v1[i];\\n\\t\\t}\\n\\t\\tif(v2[i]>=c){\\n\\t\\t\\tc=(v2[i]+c*(s-1))/(s);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tc=v2[i];\\n\\t\\t}\\n\\t}\\n\\t// cout<<a<<\\\" \\\"<<b<<\\\" \\\"<<c<<endl;\\n\\tdouble l=0,r=E;\\n\\twhile(r-l>EPS){\\n\\t\\tdouble mid1=l+(r-l)/3;\\n\\t\\tdouble mid2=l+(r-l)*2/3;\\n\\t\\tdouble h1=(E-(a+c)*mid1)/b;\\n\\t\\tdouble h2=(E-(a+c)*mid2)/b;\\n\\t\\tdouble ans1=min(mid1+h1,T*h1);\\n\\t\\tdouble ans2=min(mid2+h2,T*h2);\\n\\t\\tif(ans1<ans2){\\n\\t\\t\\tl=mid1;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tr=mid2;\\n\\t\\t}\\n\\t}\\n\\t// cout<<a<<\\\" \\\"<<c<<endl;\\n\\t// cout<<E*(T+1)<<endl;\\n\\tdouble ans1=max(E/b,(double)E*(T+1)/(T*(a+c)+b));\\n\\t// cout<<l+h1<<\\\" \\\"<<T*h1<<endl;\\n\\tcout<<ans1<<endl;\\n}\\n\\n\\nsigned main() {\\n\\tios_base::sync_with_stdio(false);\\n \\tcout<<fixed<<setprecision(10);\\n mainmain();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2844,\n \"score_of_the_acc\": -0.7778,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2278_1425768\",\n \"code_snippet\": \"#include <cstdlib>\\n#include <cmath>\\n#include <climits>\\n#include <cfloat>\\n#include <map>\\n#include <set>\\n#include <iostream>\\n#include <string>\\n#include <vector>\\n#include <algorithm>\\n#include <sstream>\\n#include <complex>\\n#include <stack>\\n#include <queue>\\n#include <cstdio>\\n#include <cstring>\\n#include <iterator>\\n#include <bitset>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <fstream>\\n#include <iomanip>\\n//#include <utility>\\n//#include <memory>\\n//#include <functional>\\n//#include <deque>\\n//#include <cctype>\\n//#include <ctime>\\n//#include <numeric>\\n//#include <list>\\n//#include <iomanip>\\n\\n//#if __cplusplus >= 201103L\\n//#include <array>\\n//#include <tuple>\\n//#include <initializer_list>\\n//#include <forward_list>\\n//\\n//#define cauto const auto&\\n//#else\\n\\n//#endif\\n\\nusing namespace std;\\n\\n\\ntypedef long long ll;\\ntypedef pair<int,int> pii;\\ntypedef pair<ll,ll> pll;\\n\\ntypedef vector<int> vint;\\ntypedef vector<vector<int> > vvint;\\ntypedef vector<long long> vll, vLL;\\ntypedef vector<vector<long long> > vvll, vvLL;\\n\\n#define VV(T) vector<vector< T > >\\n\\ntemplate <class T>\\nvoid initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){\\n v.assign(a, vector<T>(b, t));\\n}\\n\\ntemplate <class F, class T>\\nvoid convert(const F &f, T &t){\\n stringstream ss;\\n ss << f;\\n ss >> t;\\n}\\n\\n#undef _P\\n#define _P(...) (void)printf(__VA_ARGS__)\\n#define reep(i,a,b) for(int i=(a);i<(b);++i)\\n#define rep(i,n) reep((i),0,(n))\\n#define ALL(v) (v).begin(),(v).end()\\n#define PB push_back\\n#define F first\\n#define S second\\n#define mkp make_pair\\n#define RALL(v) (v).rbegin(),(v).rend()\\n#define DEBUG\\n#ifdef DEBUG\\n#define dump(x) cout << #x << \\\" = \\\" << (x) << endl;\\n#define debug(x) cout << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << \\\" \\\" << __FILE__ << endl;\\n#else\\n#define dump(x) \\n#define debug(x) \\n#endif\\n#define LDcout(x,n) fixed<<setprecision(n)<<x\\n\\n#define MOD 1000000007LL\\n#define EPS 1e-8\\nstatic const int INF=1<<24;\\n\\nvoid mainmain(){\\n\\tint T,E;\\n\\tcin>>T>>E;\\n\\tvector<double> v1(T),v2(T);\\n\\trep(i,T){\\n\\t\\tcin>>v1[T-1-i];\\n\\t}\\n\\tdouble b;\\n\\tcin>>b;\\n\\trep(i,T){\\n\\t\\tcin>>v2[i];\\n\\t}\\n\\tdouble a=v1[T-1];\\n\\tdouble c=v2[T-1];\\n\\tfor(int i=T-2;i>=0;i--){\\n\\t\\tint s=T-i;\\n\\t\\t// cout<<v1[i]<<endl;\\n\\t\\t// cout<<s<<endl;\\n\\t\\tif(v1[i]>=a){\\n\\t\\t\\ta=(v1[i]+a*(s-1))/(s);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\ta=v1[i];\\n\\t\\t}\\n\\t\\tif(v2[i]>=c){\\n\\t\\t\\tc=(v2[i]+c*(s-1))/(s);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tc=v2[i];\\n\\t\\t}\\n\\t}\\n\\t// cout<<a<<\\\" \\\"<<b<<\\\" \\\"<<c<<endl;\\n\\tdouble l=0,r=E;\\n\\twhile(r-l>EPS){\\n\\t\\tdouble mid1=l+(r-l)/3;\\n\\t\\tdouble mid2=l+(r-l)*2/3;\\n\\t\\tdouble h1=(E-(a+c)*mid1)/b;\\n\\t\\tdouble h2=(E-(a+c)*mid2)/b;\\n\\t\\tdouble ans1=min(mid1+h1,T*h1);\\n\\t\\tdouble ans2=min(mid2+h2,T*h2);\\n\\t\\tif(ans1<ans2){\\n\\t\\t\\tl=mid1;\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tr=mid2;\\n\\t\\t}\\n\\t}\\n\\t// cout<<a<<\\\" \\\"<<c<<endl;\\n\\tdouble ans1=max(E/b,E*(T+1)/(T*(a+c)+b));\\n\\t// cout<<l+h1<<\\\" \\\"<<T*h1<<endl;\\n\\tcout<<ans1<<endl;\\n}\\n\\n\\nsigned main() {\\n\\tios_base::sync_with_stdio(false);\\n \\tcout<<fixed<<setprecision(10);\\n mainmain();\\n}\",\n \"accuracy\": 0.47619047619047616,\n \"time_ms\": 40,\n \"memory_kb\": 2844,\n \"score_of_the_acc\": -0.7778,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2278_728148\",\n \"code_snippet\": \"#include <cstdio>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n\\tfor(int t,e;~scanf(\\\"%d%d\\\",&t,&e);){\\n\\t\\tdouble c[2*t+1];\\n\\t\\tfor(int i=0;i<2*t+1;i++)\\n\\t\\t\\tscanf(\\\"%lf\\\",c+i);\\n\\t\\tfor(int s=2;s<=t;s++){\\n\\t\\t\\tif(c[t+(t-s+1)]>c[t+(t-s+2)])\\n\\t\\t\\t\\tc[t+(t-s+1)]=(c[t+(t-s+1)]+(s-1)*c[t+(t-s+2)])/s;\\n\\t\\t\\tif(c[t-(t-s+1)]>c[t-(t-s+2)])\\n\\t\\t\\t\\tc[t-(t-s+1)]=(c[t-(t-s+1)]+(s-1)*c[t-(t-s+2)])/s;\\n\\t\\t}\\n\\t\\tif(c[t]>c[t-1]+c[t+1])\\n\\t\\t\\tc[t]=(c[t]+t*(c[t-1]+c[t+1]))/(t+1);\\n\\t\\tprintf(\\\"%.13f\\\\n\\\",e/c[t]);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2640,\n \"score_of_the_acc\": -0.735,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2278_427595\",\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\\nint T,E;\\ndouble *C,C_buf[200001];\\n\\ndouble merge(){\\n\\tdouble res=C[T];\\n\\tfor(int i=T-1;i>=1;i--){\\n\\t\\t// プレート i と i+1 をマージし、それを新たにプレート i と思う\\n\\t\\t// そうすると、新たなプレート i+1 にはエネルギーをかけないと考えていい\\n\\t\\tres=min(C[i],(C[i]+(T-i)*res)/(T-i+1));\\n\\t\\t// min の第 1 項は ( マージする前の ) プレート i+1 にエネルギーをかけないケース (?)\\n\\t\\t// min の第 2 項は ( マージする前の ) プレート i+1 にエネルギーをかけるケース\\n\\t}\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tscanf(\\\"%d%d\\\",&T,&E);\\n\\tC=C_buf+100000;\\n\\tfor(int i=-T;i<=T;i++) scanf(\\\"%lf\\\",C+i);\\n\\n\\tdouble C0=C[0];\\n\\tdouble Cr=merge(); // 右 T 枚のプレートをマージしてできたプレートの比熱\\n\\treverse(C-T,C+T+1);\\n\\tdouble Cl=merge(); // 左 T 枚のプレートをマージしてできたプレートの比熱\\n\\n\\t// これで 3 枚のプレート -1, 0, 1 の問題になった\\n\\t// 解は\\n\\t// - プレート 0 で T+1 回熱せられる\\n\\t// - プレート 0 で 1 回、プレート 1 で 1 回熱せられる\\n\\t// - プレート 0 で 1 回、プレート -1 で 1 回熱せられる\\n\\t// のいずれか\\n\\n\\t// プレートにかける熱をそれぞれ Hl, H0, Hr とする\\n\\t// 制約 Cl*Hl+C0*H0+Cr*Hr = E のもと、min{(T+1)*H0, H0+Hl, H0+Hr} を最大化する問題になる\\n\\t// Hl = Hr とするのがいいことは直感的にわかるので、\\n\\t// 制約 C0*H0+(Cl+Cr)*Hl = E のもと、min{(T+1)*H0, H0+Hl} を最大化すればいい\\n\\tdouble ans=0,H0,Hl;\\n\\tH0=E/C0; Hl=(E-C0*H0)/(Cl+Cr); ans=max(ans,min((T+1)*H0,H0+Hl));\\n\\tH0=E/(C0+T*(Cl+Cr)); Hl=(E-C0*H0)/(Cl+Cr); ans=max(ans,min((T+1)*H0,H0+Hl));\\n\\tprintf(\\\"%.9f\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2220,\n \"score_of_the_acc\": -0.647,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2278_301320\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n\\ninline int getInt(){ int s; scanf(\\\"%d\\\", &s); return s; }\\n\\nusing namespace std;\\n\\ndouble buff[200200];\\ndouble *c;\\nint t;\\nint e;\\n\\n\\nint main(){\\n t = getInt();\\n e = getInt();\\n\\n REP(i, 2 * t + 1) buff[i] = (double)getInt();\\n c = &buff[t];\\n\\n for(int s = 2; s <= t; s++){\\n {\\n // merge to left\\n double alpha = c[t - s + 1];\\n double beta = c[t - s + 2];\\n if(alpha > beta){\\n\\tc[t - s + 1] = (alpha + beta * (s - 1)) / s;\\n }\\n }\\n {\\n // merge to right\\n double alpha = c[-(t - s + 1)];\\n double beta = c[-(t - s + 2)];\\n if(alpha > beta){\\n\\tc[-(t - s + 1)] = (alpha + beta * (s - 1)) / s;\\n }\\n }\\n }\\n \\n double alpha = c[-1];\\n double beta = c[0];\\n double ganma = c[1];\\n\\n double ans;\\n\\n double h1 = e / (alpha + ganma + beta / t);\\n double h2 = (e - (alpha + ganma) * h1) / beta;\\n ans = h1 + h2;\\n\\n ans = max(ans, e / beta);\\n\\n printf(\\\"%.7f\\\\n\\\", ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2304,\n \"score_of_the_acc\": -0.6646,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2278_271449\",\n \"code_snippet\": \"#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 t, e;\\n cin >> t >> e;\\n\\n vector<double> c(2*t+1);\\n for(int i=0; i<2*t+1; ++i)\\n cin >> c[i];\\n\\n // ツ熱ツつウT+1ツつセツつッツ嘉熱ツつキツづゥツつスツづ淞づ可必ツ要ツづ按催渉ャツエツネツδ仰ギツー\\n double minLeft = 0.0;\\n double minRight = 0.0;\\n for(int i=0; i<t; ++i){\\n minLeft = min(minLeft + c[i], c[i] * (i+1));\\n minRight = min(minRight + c[2*t-i], c[2*t-i] * (i+1));\\n }\\n double minEnergy = min(minLeft + minRight + c[t], c[t] * (t+1));\\n\\n double ret = e / minEnergy * (t+1);\\n printf(\\\"%.10f\\\\n\\\", ret);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 2484,\n \"score_of_the_acc\": -1.5205,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2278_269010\",\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\\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\\nint n;\\ndouble E;\\ndouble plate[300000];\\n\\ninline double Get(int index) {\\n return plate[index + n];\\n}\\n\\ninline double Merge(double x, double y, int w) {\\n return min(y, (w * x + y) / (w + 1));\\n}\\n\\ndouble MergeAll(int dir) {\\n double left = Get(-dir * n);\\n int w = 1;\\n int index = -dir * n + dir;\\n while (index != 0) {\\n left = Merge(left, Get(index), w);\\n //cout << index << \\\" \\\" << left << \\\" \\\" << w << endl;\\n assert(left >= -EPS);\\n w++;\\n index += dir;\\n }\\n return left;\\n}\\n\\nint main() {\\n while (scanf(\\\"%d %lf\\\", &n, &E) > 0) {\\n REP(i, 2 * n + 1) {\\n scanf(\\\"%lf\\\", &plate[i]);\\n }\\n double left = MergeAll(1);\\n double right = MergeAll(-1);\\n double ans = max(E / Get(0), E * (n + 1) / (n * (left + right) + Get(0)));\\n printf(\\\"%.8f\\\\n\\\", ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.2727,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1263,"cells":{"group_id":{"kind":"string","value":"aoj_2282_cpp"},"problem_description":{"kind":"string","value":"Problem B: B問題\nR大学の2D好きの人たち (2DRespecters)は、A津大学で開催されるプログラミングの練習合宿に参加する。\nこの練習合宿では、参加者たちが自作のプログラミング問題を持ち寄り、練習に用いる。\n2DRespectersも、いくつかの問題を作成することになった。\nしかし、合宿の3日前になっても、まだ、B問題が完成していなかった。\n最初のB問題の担当者が作成した問題は、担当者が問題の制約を難しくし過ぎてしまったため、C問題以降にまわされてしまったのだ。\nそして、簡単すぎても、難しすぎてもいけない、微妙な難易度の調整が必要とされるB問題は、誰もが手を付けたがらなかった。\nそれ以来、B問題担当者の椅子は空席のままである。\n合宿3日前になって、遂に、この問題を解決するために、2DRespecters期待のホープが立ち上がった。\nだが、彼は、B問題を作成する気がない。\n彼は、自分でB問題を作成したくないので、B問題の作成担当を他者に押し付ける手法を考え出したのだ。\n彼の手法は、表面上、B問題の作成担当者を平等に決定する。\n彼の手法は、以下の通りである。\n問題作成のために要した作業時間が最も少ない人がB問題担当者になる。\n作業時間が最も少ない人が複数人居た場合は、より問題難易度の小さい問題の担当者がB問題作成担当者になる。\n作業時間が最も少ない人が複数人居て、その中で、問題難易度の最も小さい人が複数人いた場合は、ホープの彼がB問題作成担当者になる。\n彼の手法は、一見、最も仕事をしていない人がB問題の作成を担当するため、2DRespectersのメンバー全員に快く受け入れられた。\nしかし、彼の手法には、以下のような裏がある。\n各個人の作業時間は、各個人が口頭で申請するため、嘘の申請をすることが可能である。\n問題の作業可能時間を超える作業時間や負の作業時間を申請すると、嘘だとばれる。\nある問題の作成のための作業時間は、必ず問題難易度の整数倍になることが知られているため、これに反する作業時間を申請した場合も、嘘だとばれる。\n嘘の申請をした人の嘘がばれた場合、その人が必ずB問題作成担当者になる。\n申請は一人ずつ順番に行い、嘘がばれる場合は、申請の時点でばれる。\n一人でも嘘の申請がばれた時点で、B問題作成担当者が決まり、それ以降の申請は行わない。\n申請者は、自分より前の申請のみを考慮し、申請の時点で自分がB問題作成担当者にならないような最小の作業時間を申請するものとする。\n申請の時点で、申請者がB問題作成担当者にならないような報告ができない場合は、嘘だとばれないような最大の作業時間を申請する。\n各個人の担当する問題難易度のリストが申請順に与えられたとき、誰がB問題作成担当者になるかを求めるプログラムを作成せよ。\nホープの彼の申請順番は、一番最後である。\nなお、本問題はフィクションであり、本問題の作成の経緯とは一切の関係がない。\nInput\n入力は、複数のデータセットからなり、データセットの終わりは、半角スペースで区切られた0が二つだけを含む行で表される。\nデータセットの総数は40以下である。\nデータセットの1行目では、整数\nn\n(\n2 ≤ n ≤\n100\n1,000\n)と整数\nm\n(\n1 ≤ m ≤ 1,000\n)が半角スペース区切りで与えられる。\nデータセットの2行目では、整数\na_1\n,\na_2\n, ...,\na_n\n(\n1 ≤ a_i ≤ 1,000\n,\n1 ≤ i ≤ n\n)が半角スペース区切りで与えられる。\n1行目の\nn\nと\nm\nは、それぞれ、申請者の数と問題の作業可能時間を表す。\n2行目では、申請順に並べられた問題難易度のリストが与えられており、\na_i\nは、問題の難易度を表す。\nOutput\nそれぞれのデータセットごとに、B問題作成担当者の申請順番を1行で出力せよ。\nSample Input\n3 100\n3 7 4\n5 24\n4 6 12 3 8\n5 1\n1 1 2 2 3\n0 0\nOutput for Sample Input\n2\n4\n5"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2282_1960392","code_snippet":"#include <bits/stdc++.h>\n#define f first\n#define s second\nusing namespace std;\nint n,m,a[1001];\ntypedef pair <int,int> P;\ntypedef pair<P,int> PP;\n\nint solve(){\n PP t[1001];\n t[0]=PP(P((m/a[0])*a[0],a[0]),0);\n for(int i=1;i<n;i++){\n sort(t,t+i);\n P ima=t[0].f;\n int nx=((ima.f-1)/a[i])*a[i]+a[i];\n if(ima.f==nx&&ima.s>a[i]) nx+=a[i];\n if(m<nx)nx-=a[i];\n t[i]=PP(P(nx,a[i]),i);\n }\n sort(t,t+n);\n if(t[0].f==t[1].f)return n;\n return t[0].s+1;\n }\n\nint main(){\n while(1){\n cin>>n>>m;\n if(!n&&!m)break;\n for(int i=0;i<n;i++) cin>>a[i];\n cout<<solve()<<endl; \n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1180,"score_of_the_acc":-2,"final_rank":3},{"submission_id":"aoj_2282_1896197","code_snippet":"#include<bits/stdc++.h>\n#define range(i,a,b) for(int i = (a); i < (b); i++)\n#define rep(i,b) range(i,0,b)\n#define pb(a) push_back(a)\n#define all(a) (a).begin(), (a).end()\n#define debug(x) cout << \"debug \" << x << endl;\nusing namespace std;\n\nstruct info{\n int name, diffi, time;\n};\n\nvoid swap(struct info *a, struct info *b){\n struct info *temp = a;\n a = b;\n b = temp;\n}\n\nvoid sort(struct info info[1005], int n){\n rep(i,n - 1){\n rep(j,n - 1){\n struct info temp;\n if(info[j].time > info[j + 1].time){\n swap(info[j], info[j + 1]);\n }else if(info[j].time == info[j + 1].time && info[j].diffi > info[j + 1].diffi){\n swap(info[j], info[j + 1]);\n }\n }\n }\n}\n\n int main(){\n int n, m;\n while(cin >> n >> m, n||m){\n struct info info[1005];\n rep(i,n){\n int inp, maxTime;\n cin >> inp;\n for(maxTime = inp; maxTime <= m; maxTime+=inp);\n maxTime-=inp;\n info[i].name = i + 1;\n info[i].diffi = inp;\n info[i].time = maxTime;\n }\n sort(info, n);\n if(info[0].time == info[1].time && info[0].diffi == info[1].diffi){\n cout << n << endl;\n }else{\n cout << info[0].name << endl;\n }\n\n }\n}","accuracy":1,"time_ms":10,"memory_kb":1168,"score_of_the_acc":-0.9898,"final_rank":2},{"submission_id":"aoj_2282_368671","code_snippet":"#include<iostream>\nusing namespace std;\n\nint main(){\n int n,m;\n int a[1010];\n int num[1010][1010];//num[time][hard]\n int time[1010];\n int per[1010];\n\n while(cin >> n >> m , n||m){\n for(int i=0;i<n;i++)cin >> a[i];\n\n for(int i=0;i<=1000;i++){\n time[i] = 0;\n for(int j=0;j<=1000;j++)num[i][j] = 0;\n }\n\n for(int i=0;i<n;i++){\n int j;\n for(j=a[i];j<=m;j+=a[i]){\n\tbool f = false;\n\tfor(int k=0;k<j;k++){\n\t if(time[k]){\n\t time[j]++;\n\t num[j][a[i]]++;\n\t per[i] = j;\n\t f = true;\n\t break;\n\t }\n\t}\n\tif(!f){\n\t for(int k=0;k<a[i];k++){\n\t if(num[j][k]){\n\t time[j]++;\n\t num[j][a[i]]++;\n\t per[i] = j;\n\t f = true;\n\t break;\n\t }\n\t }\n\t}\n\tif(!f){\n\t if(num[j][a[i]]){\n\t time[j]++;\n\t num[j][a[i]]++;\n\t per[i] = j;\n\t f = true;\n\t break;\n\t }\n\t}\n\tif(f)break;\n }\n if(j>m){\n\ttime[j-a[i]]++;\n\tnum[j-a[i]][a[i]]++;\n\tper[i] = j-a[i];\n }\n }\n int ans = 0;\n\n for(int i=0;i<n;i++)\n if(per[i]<per[ans])ans = i;\n\n for(int i=0;i<n;i++)\n if(per[i] == per[ans]){\n\tif(a[i]<a[ans])ans = i;\n }\n\n int cnt = 0;\n for(int i=0;i<n;i++)\n if(a[i]==a[ans])cnt++;\n if(cnt>1)cout << n << endl;\n else cout << ans+1 << endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":0,"score_of_the_acc":-0.5,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2282_1960392\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define f first\\n#define s second\\nusing namespace std;\\nint n,m,a[1001];\\ntypedef pair <int,int> P;\\ntypedef pair<P,int> PP;\\n\\nint solve(){\\n PP t[1001];\\n t[0]=PP(P((m/a[0])*a[0],a[0]),0);\\n for(int i=1;i<n;i++){\\n sort(t,t+i);\\n P ima=t[0].f;\\n int nx=((ima.f-1)/a[i])*a[i]+a[i];\\n if(ima.f==nx&&ima.s>a[i]) nx+=a[i];\\n if(m<nx)nx-=a[i];\\n t[i]=PP(P(nx,a[i]),i);\\n }\\n sort(t,t+n);\\n if(t[0].f==t[1].f)return n;\\n return t[0].s+1;\\n }\\n\\nint main(){\\n while(1){\\n cin>>n>>m;\\n if(!n&&!m)break;\\n for(int i=0;i<n;i++) cin>>a[i];\\n cout<<solve()<<endl; \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1180,\n \"score_of_the_acc\": -2,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2282_1896197\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define range(i,a,b) for(int i = (a); i < (b); i++)\\n#define rep(i,b) range(i,0,b)\\n#define pb(a) push_back(a)\\n#define all(a) (a).begin(), (a).end()\\n#define debug(x) cout << \\\"debug \\\" << x << endl;\\nusing namespace std;\\n\\nstruct info{\\n int name, diffi, time;\\n};\\n\\nvoid swap(struct info *a, struct info *b){\\n struct info *temp = a;\\n a = b;\\n b = temp;\\n}\\n\\nvoid sort(struct info info[1005], int n){\\n rep(i,n - 1){\\n rep(j,n - 1){\\n struct info temp;\\n if(info[j].time > info[j + 1].time){\\n swap(info[j], info[j + 1]);\\n }else if(info[j].time == info[j + 1].time && info[j].diffi > info[j + 1].diffi){\\n swap(info[j], info[j + 1]);\\n }\\n }\\n }\\n}\\n\\n int main(){\\n int n, m;\\n while(cin >> n >> m, n||m){\\n struct info info[1005];\\n rep(i,n){\\n int inp, maxTime;\\n cin >> inp;\\n for(maxTime = inp; maxTime <= m; maxTime+=inp);\\n maxTime-=inp;\\n info[i].name = i + 1;\\n info[i].diffi = inp;\\n info[i].time = maxTime;\\n }\\n sort(info, n);\\n if(info[0].time == info[1].time && info[0].diffi == info[1].diffi){\\n cout << n << endl;\\n }else{\\n cout << info[0].name << endl;\\n }\\n\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 1168,\n \"score_of_the_acc\": -0.9898,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2282_368671\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\nint main(){\\n int n,m;\\n int a[1010];\\n int num[1010][1010];//num[time][hard]\\n int time[1010];\\n int per[1010];\\n\\n while(cin >> n >> m , n||m){\\n for(int i=0;i<n;i++)cin >> a[i];\\n\\n for(int i=0;i<=1000;i++){\\n time[i] = 0;\\n for(int j=0;j<=1000;j++)num[i][j] = 0;\\n }\\n\\n for(int i=0;i<n;i++){\\n int j;\\n for(j=a[i];j<=m;j+=a[i]){\\n\\tbool f = false;\\n\\tfor(int k=0;k<j;k++){\\n\\t if(time[k]){\\n\\t time[j]++;\\n\\t num[j][a[i]]++;\\n\\t per[i] = j;\\n\\t f = true;\\n\\t break;\\n\\t }\\n\\t}\\n\\tif(!f){\\n\\t for(int k=0;k<a[i];k++){\\n\\t if(num[j][k]){\\n\\t time[j]++;\\n\\t num[j][a[i]]++;\\n\\t per[i] = j;\\n\\t f = true;\\n\\t break;\\n\\t }\\n\\t }\\n\\t}\\n\\tif(!f){\\n\\t if(num[j][a[i]]){\\n\\t time[j]++;\\n\\t num[j][a[i]]++;\\n\\t per[i] = j;\\n\\t f = true;\\n\\t break;\\n\\t }\\n\\t}\\n\\tif(f)break;\\n }\\n if(j>m){\\n\\ttime[j-a[i]]++;\\n\\tnum[j-a[i]][a[i]]++;\\n\\tper[i] = j-a[i];\\n }\\n }\\n int ans = 0;\\n\\n for(int i=0;i<n;i++)\\n if(per[i]<per[ans])ans = i;\\n\\n for(int i=0;i<n;i++)\\n if(per[i] == per[ans]){\\n\\tif(a[i]<a[ans])ans = i;\\n }\\n\\n int cnt = 0;\\n for(int i=0;i<n;i++)\\n if(a[i]==a[ans])cnt++;\\n if(cnt>1)cout << n << endl;\\n else cout << ans+1 << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1264,"cells":{"group_id":{"kind":"string","value":"aoj_2280_cpp"},"problem_description":{"kind":"string","value":"問題 J\nMod 3 Knights Out\n問題文\nある日の夕方，コンテストの問題を解き終えた二人は今日の問題について話し合っていた．\nA「くそー，あのライツアウトの問題，mod\n2\nじゃなくて mod\n3\nとか mod\n7\nとかだったら解法分かったのにー！」\nB「じゃあ，mod\n3\nで別の方法で解く問題を作ればいいんですね．分かりました！」\nこうして次のような問題が誕生した．\nH × W\nのチェス盤がある．チェス盤の各マスには\n0\nから\n2\nの整数が書かれている．このチェス盤にナイトを置いていく．ただし，各マスには多くても\n1\n体のナイトしか置けない．各マスについて，\n(マスの数値+そこを攻撃するマスにいるナイトの数)=0 mod 3\nが成り立つようなナイトの配置を\n良い\n配置と呼ぶ．攻撃するマスとはそのマスから縦方向に\n±2\nマスかつ横方向に\n±1\nマス，もしくは縦方向に\n±1\nマスかつ横方向に\n±2\nマスずれたマスのことである．\n良いナイトの配置の数を求めよ．答えは大きくなる可能性があるので\n1,000,000,007\nで割った余りを答えよ．\n入力形式\n最初の行に\nH\nと\nW\nがスペース区切りで与えられる．\n次の\nH\n行には、チェス盤のマス目に書かれている数値として\nW\n個の\n0\n，\n1\n，\n2\nのいずれかの整数がスペース区切りで与えられる．\n出力形式\n良いナイトの配置の数を\n1,000,000,007\nで割った余りを出力せよ．\n制約\n1 ≤ H ≤ 50\n1 ≤ W ≤ 16\n入出力例\n入力例 1\n5 5\n0 2 0 2 0\n2 0 0 0 2\n0 0 0 0 0\n2 0 0 0 2\n0 2 0 2 0\n出力例 1\n5\n入力例 2\n3 3\n2 2 2\n2 0 2\n2 2 2\n出力例 2\n8\n入力例 3\n7 7\n2 2 2 2 2 2 2\n2 1 1 2 1 1 2\n2 0 1 0 1 0 2\n2 2 0 2 0 2 2\n2 0 1 0 1 0 2\n2 1 1 2 1 1 2\n2 2 2 2 2 2 2\n出力例 3\n96\n入力例 4\n7 3\n2 2 2\n1 0 1\n0 1 0\n1 1 1\n0 1 0\n1 0 1\n2 2 2\n出力例 4\n8\n入力例 5\n6 6\n0 2 0 1 0 2\n2 0 1 2 2 2\n0 2 2 0 0 0\n2 0 2 0 2 0\n0 2 2 1 0 2\n0 0 0 2 0 2\n出力例 5\n1\n入力例 6\n16 16\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0\n出力例 6\n1\n謝辞\nこの問題は Tester と Writer が\nアジア地区予選の問題\nに関して話し合ったのをきっかけとして作られた。"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2280_10433362","code_snippet":"// AOJ #2280 Mod 3 Knights Out\n// 2025.4.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MOD = 1000000007;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nconst int dr[8]={-2,-2,-1,-1,1,1,2,2};\nconst int dc[8]={-1,1,-2,2,-2,2,-1,1};\n\ninline int addmod(int a,int b){ a+=b; if(a>=MOD) a-=MOD; return a; }\ninline int mulmod(ll a,ll b){ return (int)(a*b%MOD); }\nll powmod(ll a,ll e){\n ll r=1;\n while(e){\n if(e&1) r=r*a%MOD;\n a=a*a%MOD;\n e>>=1;\n }\n return r;\n}\ninline int inv3(int x){\n if(x==1) return 1;\n if(x==2) return 2;\n return 0;\n}\n\nint H,W;\nvector<int> B;\nvector<vector<int>> eq_to_var, var_to_eq;\n\nll solve_comp(const vector<int>& vars, const vector<int>& eqs){\n int n = vars.size(), m = eqs.size();\n if(m==0) return powmod(2, n);\n if(n==0){\n for(int e: eqs) if(B[e]!=0) return 0;\n return 1;\n }\n unordered_map<int,int> vid;\n vid.reserve(n*2);\n for(int i=0;i<n;i++) vid[vars[i]] = i;\n vector<vector<int>> A(m, vector<int>(n+1,0));\n for(int i=0;i<m;i++){\n int eq = eqs[i];\n A[i][n] = B[eq];\n for(int v: eq_to_var[eq]){\n auto it = vid.find(v);\n if(it != vid.end()) A[i][it->second] = (A[i][it->second] + 1) % 3;\n }\n }\n vector<int> where(n,-1);\n int row=0;\n for(int col=0;col<n && row<m;col++){\n int sel = row;\n while(sel<m && A[sel][col]==0) sel++;\n if(sel==m) continue;\n swap(A[sel], A[row]);\n int inv = inv3(A[row][col]);\n for(int j=col;j<=n;j++) A[row][j] = A[row][j]*inv%3;\n for(int i=0;i<m;i++) if(i!=row && A[i][col]){\n int f = A[i][col];\n for(int j=col;j<=n;j++){\n A[i][j] = (A[i][j] - f * A[row][j]) %3;\n if(A[i][j]<0) A[i][j]+=3;\n }\n }\n where[col] = row++;\n }\n for(int i=row;i<m;i++) if(A[i][n]!=0) return 0;\n vector<int> free_cols;\n for(int col=0;col<n;col++) if(where[col]==-1) free_cols.push_back(col);\n int k = free_cols.size();\n vector<int> x0(n,0);\n for(int col=0;col<n;col++){\n if(where[col]!=-1) x0[col] = A[ where[col] ][n];\n }\n vector<vector<int>> basis(k, vector<int>(n,0));\n for(int f=0;f<k;f++){\n int fc = free_cols[f];\n basis[f][fc] = 1;\n for(int col=0;col<n;col++){\n int r = where[col];\n if(r>=0){\n int v = A[r][fc];\n if(v) basis[f][col] = (3 - v) % 3;\n }\n }\n }\n vector<int> f_last(n, -1);\n for(int f=0; f<k; f++){\n for(int j=0;j<n;j++) if(basis[f][j]!=0) f_last[j] = f;\n }\n ll cnt = 0;\n vector<int> cur = x0;\n function<void(int)> dfs = [&](int f){\n if(f==k){\n for(int j=0;j<n;j++) if(cur[j]==2) return;\n cnt = (cnt + 1) % MOD;\n return;\n }\n for(int a=0;a<3;a++){\n if(a){\n for(int j=0;j<n;j++) cur[j] = (cur[j] + basis[f][j]*a) % 3;\n }\n bool ok = true;\n for(int j=0;j<n;j++){\n if(cur[j]==2 && f_last[j] <= f){ ok = false; break; }\n }\n if(ok) dfs(f+1);\n if(a){\n for(int j=0;j<n;j++){\n cur[j] = (cur[j] - basis[f][j]*a) % 3;\n if(cur[j]<0) cur[j]+=3;\n }\n }\n }\n };\n dfs(0);\n return cnt;\n}\n\nint main(){\n H = Cin(), W = Cin();\n int N = H*W;\n B.resize(N);\n for(int i=0;i<H;i++) for(int j=0;j<W;j++){\n int v = Cin();\n B[i*W+j] = ((-v)%3+3)%3;\n }\n eq_to_var.assign(N,{});\n var_to_eq.assign(N,{});\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n int eq = i*W+j;\n for(int d=0;d<8;d++){\n int ni=i+dr[d], nj=j+dc[d];\n if(ni<0||ni>=H||nj<0||nj>=W) continue;\n int var = ni*W+nj;\n eq_to_var[eq].push_back(var);\n var_to_eq[var].push_back(eq);\n }\n }\n }\n vector<int> comp(2*N, -1);\n int comps = 0;\n for(int u=0; u<2*N; u++){\n if(comp[u]!=-1) continue;\n queue<int>q;\n comp[u]=comps;\n q.push(u);\n while(!q.empty()){\n int x=q.front(); q.pop();\n if(x< N){\n for(int e: var_to_eq[x]){\n int y = e + N;\n if(comp[y]==-1){\n comp[y]=comps;\n q.push(y);\n }\n }\n } else {\n int e = x - N;\n for(int v: eq_to_var[e]){\n if(comp[v]==-1){\n comp[v]=comps;\n q.push(v);\n }\n }\n }\n }\n comps++;\n }\n vector<vector<int>> cv(comps), ce(comps);\n for(int v=0; v<N; v++) cv[ comp[v] ].push_back(v);\n for(int e=0; e<N; e++) ce[ comp[e+N] ].push_back(e);\n\n ll ans = 1;\n for(int c=0; c<comps; c++){\n ll sub = solve_comp(cv[c], ce[c]);\n if(sub==0){\n cout << 0 << endl;\n return 0;\n }\n ans = ans * sub % MOD;\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":4248,"score_of_the_acc":-2,"final_rank":4},{"submission_id":"aoj_2280_9586812","code_snippet":"#include <bits/stdc++.h>\n\n#define int long long\nusing namespace std;\nconst int mod = 1e9 + 7;\nint h, w;\nvector<vector<int> > g;\nint delx[] = {-2, -1, 1, 2, -2, -1, 1, 2};\nint dely[] = {-1, -2, -2, -1, 1, 2, 2, 1};\n\nvoid add(int y, int x, int put) {\n for (int i = 0; i < 8; ++i) {\n int yy = y + dely[i];\n int xx = x + delx[i];\n if (xx >= 0 && xx < w && yy >= 0 && yy < h) {\n g[yy][xx] = (g[yy][xx] + put + 3) % 3;\n }\n }\n}\n\nbool check(int bw) {\n for (int i = h - 1; i >= max(0ll, h - 2); --i) {\n int st = ((i & 1) + 1 - bw) & 1;\n for (int j = st; j < w; j += 2) {\n if (g[i][j] != 0) {\n return false;\n }\n }\n }\n return true;\n}\n\nint rec(int y, int x, int bw) {\n if (y == h) {\n bool ok = check(bw);\n if (ok) {\n return 1;\n }\n return 0;\n }\n int nexty = y;\n int nextx = x + 2;\n int ret = 0;\n if (nextx >= w) {\n nexty = y + 1;\n nextx = ((nexty & 1) + bw) & 1;\n }\n bool put = true;\n bool notput = true;\n if (y > 1 && x > 0) {\n if (!g[y - 2][x - 1]) {\n put = false;\n } else if (g[y - 2][x - 1] == 1) {\n put = notput = false;\n } else {\n notput = false;\n }\n }\n if (y > 1 && x == w - 2) {\n if (!g[y - 2][x + 1]) {\n put = false;\n } else if (g[y - 2][x + 1] == 1) {\n put = notput = false;\n } else {\n notput = false;\n }\n }\n if (notput) {\n ret += rec(nexty, nextx, bw);\n }\n if (put) {\n add(y, x, 1);\n ret += rec(nexty, nextx, bw);\n add(y, x, -1);\n }\n return ret;\n}\n\nsigned main() {\n // ios_base::sync_with_stdio(0);\n // cin.tie(0);\n cin >> h >> w;\n g.resize(h, vector<int>(w));\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n cin >> g[i][j];\n }\n }\n if (h < w) {\n vector<vector<int> > gnew(w, vector<int>(h));\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n gnew[j][i] = g[i][j];\n }\n }\n g = gnew;\n swap(h, w);\n }\n if (w == 1) {\n bool e = true;\n for (int i = 0; i < h; ++i) {\n if (g[i][0]) {\n e = false;\n break;\n }\n }\n if (!e) {\n printf(\"%d\\n\", 0);\n } else {\n printf(\"%d\\n\", (1ll << h) % mod);\n }\n return 0;\n }\n int black = rec(0, 0, 0);\n int white = rec(0, 1, 1);\n int ans = white * black % mod;\n printf(\"%d\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3312,"score_of_the_acc":-0.7326,"final_rank":2},{"submission_id":"aoj_2280_9586808","code_snippet":"#include <set>\n#include <iostream>\n#include <cstdio>\n#include <cassert>\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n\ninline int getInt(){ int s; scanf(\"%d\", &s); return s; }\n\n#define IN(x,s,g) ((x) >= (s) && (x) < (g))\n#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))\n\nusing namespace std;\n\nconst int mod = 1000000007;\n\nint h, w;\nint g[50][16];\nint debug[50][16];\n\nint dx[] = {-2, -1, 1, 2, -2, -1, 1, 2 };\nint dy[] = {-1, -2, -2, -1, 1, 2, 2, 1 };\n\nvoid debug_print(){\n REP(i, h){\n REP(j, w) printf(\"%d \", debug[i][j]);\n printf(\" \");\n REP(j, w) printf(\"%d \", g[i][j]);\n puts(\"\");\n }\n}\n\nvoid process(int y, int x, bool put){\n int p = put ? 1 : 2;\n\n // debug[y][x] = put ? 1 : 0;\n\n REP(i,8){\n int yy = y + dy[i];\n int xx = x + dx[i];\n\n if(ISIN(xx, yy, w, h)){\n g[yy][xx] = (g[yy][xx] + p) % 3;\n }\n }\n}\n\nbool check(int bw){\n REP(i,2) if(h - 1 - i >= 0){\n int st = ((h - 1 - i) % 2 + (bw ^ 1)) % 2;\n for(int j = st; j < w; j += 2){\n if(g[h - 1 - i][j] != 0) return false;\n }\n }\n return true;\n}\n\nint solve(int y, int x, int bw){\n if(y == h){\n bool ok = check(bw);\n // printf(\"debug(%d): %d\\n\", bw, ok); debug_print(); puts(\"\");\n return ok ? 1 : 0;\n }\n\n assert((x + y) % 2 == bw);\n\n int yy = y;\n int xx = x + 2;\n\n int ret = 0;\n\n if(xx >= w){\n yy = y + 1;\n xx = (yy % 2 + bw) % 2;\n }\n\n bool put = true;\n bool notput = true;\n\n if(y > 1 && x > 0){\n if(g[y-2][x-1] == 0){\n put = false;\n }else if(g[y-2][x-1] == 1){\n put = notput = false;\n }else{\n notput = false;\n }\n }\n\n if(y > 1 && x == w - 2){\n if(g[y-2][x+1] == 0){\n put = false;\n }else if(g[y-2][x+1] == 1){\n put = notput = false;\n }else{\n notput = false;\n }\n }\n\n if(notput){\n ret += solve(yy, xx, bw); ret %= mod;\n }\n if(put){\n process(y, x, true);\n ret += solve(yy, xx, bw); ret %= mod;\n process(y, x, false);\n }\n\n return ret;\n}\n\nint main(){\n h = getInt();\n w = getInt();\n\n REP(i,h) REP(j,w)\n g[i][j] = getInt();\n\n if(h < w){\n REP(i,w) REP(j,i)\n swap(g[i][j], g[j][i]);\n swap(h, w);\n }\n\n\n if(w == 1){\n bool ok = true;\n REP(i,h) if(g[i][0] != 0) ok = false;\n if(ok){\n int ans = 1;\n REP(i,h) ans = (ans * 2) % mod;\n printf(\"%d\\n\", ans);\n }else{\n puts(\"0\");\n }\n return 0;\n }\n\n int black = solve(0, 0, 0);\n int white = (w == 1 ? solve(1, 0, 1) : solve(0, 1, 1));\n int ans = (((long long)white) * black) % mod;\n\n printf(\"%d\\n\", ans);\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3240,"score_of_the_acc":-0.712,"final_rank":1},{"submission_id":"aoj_2280_416341","code_snippet":"#include<cstdio>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst ll M=1000000007;\nconst int dx[]={2,1,-1,-2,-2,-1,1,2},dy[]={-1,-2,-2,-1,1,2,2,1};\n\nint h,w,B[50][16];\n\nint cnt[50][16]; // 攻撃されうる回数\n\nll dfs(int i,int j,int parity){\n\tif(i==h) return 1;\n\tif(j==w) return dfs(i+1,0,parity);\n\n\tif((i+j)%2!=parity) return dfs(i,j+1,parity); // 黒マス or 白マスのみ見る\n\n\t// マス (i, j) での値を mod 3 で 0 にできなければ探索打ち切り ( (i, j) を攻撃するマスがないかもしれないので必要 )\n\tif(cnt[i][j]==0 && B[i][j]%3!=0\n\t|| cnt[i][j]==1 && B[i][j]%3==1) return 0;\n\n\tll res=0;\n\t// マス (i, j) にナイトを置かない\n\trep(k,8){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]--;\n\t}\n\tbool ok=true;\n\trep(k,8){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w){\n\t\t\tif(cnt[y][x]==0 && B[y][x]%3!=0\n\t\t\t|| cnt[y][x]==1 && B[y][x]%3==1) ok=false;\n\t\t}\n\t}\n\tif(ok) res+=dfs(i,j+1,parity);\n\n\t// マス (i, j) にナイトを置く\n\trep(k,8){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w) B[y][x]++;\n\t}\n\tok=true;\n\trep(k,8){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w){\n\t\t\tif(cnt[y][x]==0 && B[y][x]%3!=0\n\t\t\t|| cnt[y][x]==1 && B[y][x]%3==1) ok=false;\n\t\t}\n\t}\n\tif(ok) res+=dfs(i,j+1,parity);\n\n\trep(k,8){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]++, B[y][x]--;\n\t}\n\n\treturn res;\n}\n\nint main(){\n\tscanf(\"%d%d\",&h,&w);\n\trep(i,h) rep(j,w) scanf(\"%d\",B[i]+j);\n\n\trep(i,h) rep(j,w) rep(k,8) {\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]++;\n\t}\n\n\tll ans;\n\tif(h==1 || w==1){ // コーナーケース\n\t\tbool ok=true;\n\t\trep(i,h) rep(j,w) if(B[i][j]!=0) ok=false;\n\t\tif(ok){\n\t\t\tans=1;\n\t\t\trep(i,h*w) ans=2*ans%M;\n\t\t}\n\t\telse ans=0;\n\t}\n\telse{\n\t\tans=dfs(0,0,0)*dfs(0,1,1)%M;\n\t}\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":748,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_2280_416337","code_snippet":"#include<cstdio>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\ntypedef long long ll;\n\nconst ll M=1000000007;\nconst int dx[]={2,1,-1,-2,-2,-1,1,2},dy[]={-1,-2,-2,-1,1,2,2,1};\n\nint h,w,B[50][16];\n\nint cnt[50][16]; // 攻撃されうる回数\n\nll dfs(int i,int j,int parity){\n\tif(i==h) return 1;\n\tif(j==w) return dfs(i+1,0,parity);\n\n\tif((i+j)%2!=parity) return dfs(i,j+1,parity); // 黒マス or 白マスのみ見る\n\n\tll res=0;\n\t// マス (i, j) にナイトを置く\n\trep(k,8){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]--;\n\t}\n\tbool ok=true;\n\trep(k,8){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w){\n\t\t\tif(cnt[y][x]==0 && B[y][x]%3!=0\n\t\t\t|| cnt[y][x]==1 && B[y][x]%3==1) ok=false;\n\t\t}\n\t}\n\tif(ok) res+=dfs(i,j+1,parity);\n\n\t// マス (i, j) にナイトを置かない\n\trep(k,8){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w) B[y][x]++;\n\t}\n\tok=true;\n\trep(k,8){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w){\n\t\t\tif(cnt[y][x]==0 && B[y][x]%3!=0\n\t\t\t|| cnt[y][x]==1 && B[y][x]%3==1) ok=false;\n\t\t}\n\t}\n\tif(ok) res+=dfs(i,j+1,parity);\n\n\trep(k,8){\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]++, B[y][x]--;\n\t}\n\n\treturn res;\n}\n\nint main(){\n\tscanf(\"%d%d\",&h,&w);\n\trep(i,h) rep(j,w) scanf(\"%d\",B[i]+j);\n\n\trep(i,h) rep(j,w) cnt[i][j]=0;\n\trep(i,h) rep(j,w) rep(k,8) {\n\t\tint y=i+dy[k],x=j+dx[k];\n\t\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]++;\n\t}\n\n\tll ans;\n\tif(h==1 || w==1){\n\t\tans=1;\n\t\trep(i,h*w) ans=2*ans%M;\n\t}\n\telse ans=dfs(0,0,0)*dfs(0,1,1)%M;\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":0.21875,"time_ms":60,"memory_kb":748,"score_of_the_acc":-0.5556,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2280_10433362\",\n \"code_snippet\": \"// AOJ #2280 Mod 3 Knights Out\\n// 2025.4.30\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int MOD = 1000000007;\\n\\n#define gc() getchar_unlocked()\\n\\nint Cin() {\\n\\tint n = 0; int c = gc();\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\nconst int dr[8]={-2,-2,-1,-1,1,1,2,2};\\nconst int dc[8]={-1,1,-2,2,-2,2,-1,1};\\n\\ninline int addmod(int a,int b){ a+=b; if(a>=MOD) a-=MOD; return a; }\\ninline int mulmod(ll a,ll b){ return (int)(a*b%MOD); }\\nll powmod(ll a,ll e){\\n ll r=1;\\n while(e){\\n if(e&1) r=r*a%MOD;\\n a=a*a%MOD;\\n e>>=1;\\n }\\n return r;\\n}\\ninline int inv3(int x){\\n if(x==1) return 1;\\n if(x==2) return 2;\\n return 0;\\n}\\n\\nint H,W;\\nvector<int> B;\\nvector<vector<int>> eq_to_var, var_to_eq;\\n\\nll solve_comp(const vector<int>& vars, const vector<int>& eqs){\\n int n = vars.size(), m = eqs.size();\\n if(m==0) return powmod(2, n);\\n if(n==0){\\n for(int e: eqs) if(B[e]!=0) return 0;\\n return 1;\\n }\\n unordered_map<int,int> vid;\\n vid.reserve(n*2);\\n for(int i=0;i<n;i++) vid[vars[i]] = i;\\n vector<vector<int>> A(m, vector<int>(n+1,0));\\n for(int i=0;i<m;i++){\\n int eq = eqs[i];\\n A[i][n] = B[eq];\\n for(int v: eq_to_var[eq]){\\n auto it = vid.find(v);\\n if(it != vid.end()) A[i][it->second] = (A[i][it->second] + 1) % 3;\\n }\\n }\\n vector<int> where(n,-1);\\n int row=0;\\n for(int col=0;col<n && row<m;col++){\\n int sel = row;\\n while(sel<m && A[sel][col]==0) sel++;\\n if(sel==m) continue;\\n swap(A[sel], A[row]);\\n int inv = inv3(A[row][col]);\\n for(int j=col;j<=n;j++) A[row][j] = A[row][j]*inv%3;\\n for(int i=0;i<m;i++) if(i!=row && A[i][col]){\\n int f = A[i][col];\\n for(int j=col;j<=n;j++){\\n A[i][j] = (A[i][j] - f * A[row][j]) %3;\\n if(A[i][j]<0) A[i][j]+=3;\\n }\\n }\\n where[col] = row++;\\n }\\n for(int i=row;i<m;i++) if(A[i][n]!=0) return 0;\\n vector<int> free_cols;\\n for(int col=0;col<n;col++) if(where[col]==-1) free_cols.push_back(col);\\n int k = free_cols.size();\\n vector<int> x0(n,0);\\n for(int col=0;col<n;col++){\\n if(where[col]!=-1) x0[col] = A[ where[col] ][n];\\n }\\n vector<vector<int>> basis(k, vector<int>(n,0));\\n for(int f=0;f<k;f++){\\n int fc = free_cols[f];\\n basis[f][fc] = 1;\\n for(int col=0;col<n;col++){\\n int r = where[col];\\n if(r>=0){\\n int v = A[r][fc];\\n if(v) basis[f][col] = (3 - v) % 3;\\n }\\n }\\n }\\n vector<int> f_last(n, -1);\\n for(int f=0; f<k; f++){\\n for(int j=0;j<n;j++) if(basis[f][j]!=0) f_last[j] = f;\\n }\\n ll cnt = 0;\\n vector<int> cur = x0;\\n function<void(int)> dfs = [&](int f){\\n if(f==k){\\n for(int j=0;j<n;j++) if(cur[j]==2) return;\\n cnt = (cnt + 1) % MOD;\\n return;\\n }\\n for(int a=0;a<3;a++){\\n if(a){\\n for(int j=0;j<n;j++) cur[j] = (cur[j] + basis[f][j]*a) % 3;\\n }\\n bool ok = true;\\n for(int j=0;j<n;j++){\\n if(cur[j]==2 && f_last[j] <= f){ ok = false; break; }\\n }\\n if(ok) dfs(f+1);\\n if(a){\\n for(int j=0;j<n;j++){\\n cur[j] = (cur[j] - basis[f][j]*a) % 3;\\n if(cur[j]<0) cur[j]+=3;\\n }\\n }\\n }\\n };\\n dfs(0);\\n return cnt;\\n}\\n\\nint main(){\\n H = Cin(), W = Cin();\\n int N = H*W;\\n B.resize(N);\\n for(int i=0;i<H;i++) for(int j=0;j<W;j++){\\n int v = Cin();\\n B[i*W+j] = ((-v)%3+3)%3;\\n }\\n eq_to_var.assign(N,{});\\n var_to_eq.assign(N,{});\\n for(int i=0;i<H;i++){\\n for(int j=0;j<W;j++){\\n int eq = i*W+j;\\n for(int d=0;d<8;d++){\\n int ni=i+dr[d], nj=j+dc[d];\\n if(ni<0||ni>=H||nj<0||nj>=W) continue;\\n int var = ni*W+nj;\\n eq_to_var[eq].push_back(var);\\n var_to_eq[var].push_back(eq);\\n }\\n }\\n }\\n vector<int> comp(2*N, -1);\\n int comps = 0;\\n for(int u=0; u<2*N; u++){\\n if(comp[u]!=-1) continue;\\n queue<int>q;\\n comp[u]=comps;\\n q.push(u);\\n while(!q.empty()){\\n int x=q.front(); q.pop();\\n if(x< N){\\n for(int e: var_to_eq[x]){\\n int y = e + N;\\n if(comp[y]==-1){\\n comp[y]=comps;\\n q.push(y);\\n }\\n }\\n } else {\\n int e = x - N;\\n for(int v: eq_to_var[e]){\\n if(comp[v]==-1){\\n comp[v]=comps;\\n q.push(v);\\n }\\n }\\n }\\n }\\n comps++;\\n }\\n vector<vector<int>> cv(comps), ce(comps);\\n for(int v=0; v<N; v++) cv[ comp[v] ].push_back(v);\\n for(int e=0; e<N; e++) ce[ comp[e+N] ].push_back(e);\\n\\n ll ans = 1;\\n for(int c=0; c<comps; c++){\\n ll sub = solve_comp(cv[c], ce[c]);\\n if(sub==0){\\n cout << 0 << endl;\\n return 0;\\n }\\n ans = ans * sub % MOD;\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 4248,\n \"score_of_the_acc\": -2,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2280_9586812\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define int long long\\nusing namespace std;\\nconst int mod = 1e9 + 7;\\nint h, w;\\nvector<vector<int> > g;\\nint delx[] = {-2, -1, 1, 2, -2, -1, 1, 2};\\nint dely[] = {-1, -2, -2, -1, 1, 2, 2, 1};\\n\\nvoid add(int y, int x, int put) {\\n for (int i = 0; i < 8; ++i) {\\n int yy = y + dely[i];\\n int xx = x + delx[i];\\n if (xx >= 0 && xx < w && yy >= 0 && yy < h) {\\n g[yy][xx] = (g[yy][xx] + put + 3) % 3;\\n }\\n }\\n}\\n\\nbool check(int bw) {\\n for (int i = h - 1; i >= max(0ll, h - 2); --i) {\\n int st = ((i & 1) + 1 - bw) & 1;\\n for (int j = st; j < w; j += 2) {\\n if (g[i][j] != 0) {\\n return false;\\n }\\n }\\n }\\n return true;\\n}\\n\\nint rec(int y, int x, int bw) {\\n if (y == h) {\\n bool ok = check(bw);\\n if (ok) {\\n return 1;\\n }\\n return 0;\\n }\\n int nexty = y;\\n int nextx = x + 2;\\n int ret = 0;\\n if (nextx >= w) {\\n nexty = y + 1;\\n nextx = ((nexty & 1) + bw) & 1;\\n }\\n bool put = true;\\n bool notput = true;\\n if (y > 1 && x > 0) {\\n if (!g[y - 2][x - 1]) {\\n put = false;\\n } else if (g[y - 2][x - 1] == 1) {\\n put = notput = false;\\n } else {\\n notput = false;\\n }\\n }\\n if (y > 1 && x == w - 2) {\\n if (!g[y - 2][x + 1]) {\\n put = false;\\n } else if (g[y - 2][x + 1] == 1) {\\n put = notput = false;\\n } else {\\n notput = false;\\n }\\n }\\n if (notput) {\\n ret += rec(nexty, nextx, bw);\\n }\\n if (put) {\\n add(y, x, 1);\\n ret += rec(nexty, nextx, bw);\\n add(y, x, -1);\\n }\\n return ret;\\n}\\n\\nsigned main() {\\n // ios_base::sync_with_stdio(0);\\n // cin.tie(0);\\n cin >> h >> w;\\n g.resize(h, vector<int>(w));\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n cin >> g[i][j];\\n }\\n }\\n if (h < w) {\\n vector<vector<int> > gnew(w, vector<int>(h));\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n gnew[j][i] = g[i][j];\\n }\\n }\\n g = gnew;\\n swap(h, w);\\n }\\n if (w == 1) {\\n bool e = true;\\n for (int i = 0; i < h; ++i) {\\n if (g[i][0]) {\\n e = false;\\n break;\\n }\\n }\\n if (!e) {\\n printf(\\\"%d\\\\n\\\", 0);\\n } else {\\n printf(\\\"%d\\\\n\\\", (1ll << h) % mod);\\n }\\n return 0;\\n }\\n int black = rec(0, 0, 0);\\n int white = rec(0, 1, 1);\\n int ans = white * black % mod;\\n printf(\\\"%d\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3312,\n \"score_of_the_acc\": -0.7326,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2280_9586808\",\n \"code_snippet\": \"#include <set>\\n#include <iostream>\\n#include <cstdio>\\n#include <cassert>\\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n\\ninline int getInt(){ int s; scanf(\\\"%d\\\", &s); return s; }\\n\\n#define IN(x,s,g) ((x) >= (s) && (x) < (g))\\n#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))\\n\\nusing namespace std;\\n\\nconst int mod = 1000000007;\\n\\nint h, w;\\nint g[50][16];\\nint debug[50][16];\\n\\nint dx[] = {-2, -1, 1, 2, -2, -1, 1, 2 };\\nint dy[] = {-1, -2, -2, -1, 1, 2, 2, 1 };\\n\\nvoid debug_print(){\\n REP(i, h){\\n REP(j, w) printf(\\\"%d \\\", debug[i][j]);\\n printf(\\\" \\\");\\n REP(j, w) printf(\\\"%d \\\", g[i][j]);\\n puts(\\\"\\\");\\n }\\n}\\n\\nvoid process(int y, int x, bool put){\\n int p = put ? 1 : 2;\\n\\n // debug[y][x] = put ? 1 : 0;\\n\\n REP(i,8){\\n int yy = y + dy[i];\\n int xx = x + dx[i];\\n\\n if(ISIN(xx, yy, w, h)){\\n g[yy][xx] = (g[yy][xx] + p) % 3;\\n }\\n }\\n}\\n\\nbool check(int bw){\\n REP(i,2) if(h - 1 - i >= 0){\\n int st = ((h - 1 - i) % 2 + (bw ^ 1)) % 2;\\n for(int j = st; j < w; j += 2){\\n if(g[h - 1 - i][j] != 0) return false;\\n }\\n }\\n return true;\\n}\\n\\nint solve(int y, int x, int bw){\\n if(y == h){\\n bool ok = check(bw);\\n // printf(\\\"debug(%d): %d\\\\n\\\", bw, ok); debug_print(); puts(\\\"\\\");\\n return ok ? 1 : 0;\\n }\\n\\n assert((x + y) % 2 == bw);\\n\\n int yy = y;\\n int xx = x + 2;\\n\\n int ret = 0;\\n\\n if(xx >= w){\\n yy = y + 1;\\n xx = (yy % 2 + bw) % 2;\\n }\\n\\n bool put = true;\\n bool notput = true;\\n\\n if(y > 1 && x > 0){\\n if(g[y-2][x-1] == 0){\\n put = false;\\n }else if(g[y-2][x-1] == 1){\\n put = notput = false;\\n }else{\\n notput = false;\\n }\\n }\\n\\n if(y > 1 && x == w - 2){\\n if(g[y-2][x+1] == 0){\\n put = false;\\n }else if(g[y-2][x+1] == 1){\\n put = notput = false;\\n }else{\\n notput = false;\\n }\\n }\\n\\n if(notput){\\n ret += solve(yy, xx, bw); ret %= mod;\\n }\\n if(put){\\n process(y, x, true);\\n ret += solve(yy, xx, bw); ret %= mod;\\n process(y, x, false);\\n }\\n\\n return ret;\\n}\\n\\nint main(){\\n h = getInt();\\n w = getInt();\\n\\n REP(i,h) REP(j,w)\\n g[i][j] = getInt();\\n\\n if(h < w){\\n REP(i,w) REP(j,i)\\n swap(g[i][j], g[j][i]);\\n swap(h, w);\\n }\\n\\n\\n if(w == 1){\\n bool ok = true;\\n REP(i,h) if(g[i][0] != 0) ok = false;\\n if(ok){\\n int ans = 1;\\n REP(i,h) ans = (ans * 2) % mod;\\n printf(\\\"%d\\\\n\\\", ans);\\n }else{\\n puts(\\\"0\\\");\\n }\\n return 0;\\n }\\n\\n int black = solve(0, 0, 0);\\n int white = (w == 1 ? solve(1, 0, 1) : solve(0, 1, 1));\\n int ans = (((long long)white) * black) % mod;\\n\\n printf(\\\"%d\\\\n\\\", ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3240,\n \"score_of_the_acc\": -0.712,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2280_416341\",\n \"code_snippet\": \"#include<cstdio>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\nconst ll M=1000000007;\\nconst int dx[]={2,1,-1,-2,-2,-1,1,2},dy[]={-1,-2,-2,-1,1,2,2,1};\\n\\nint h,w,B[50][16];\\n\\nint cnt[50][16]; // 攻撃されうる回数\\n\\nll dfs(int i,int j,int parity){\\n\\tif(i==h) return 1;\\n\\tif(j==w) return dfs(i+1,0,parity);\\n\\n\\tif((i+j)%2!=parity) return dfs(i,j+1,parity); // 黒マス or 白マスのみ見る\\n\\n\\t// マス (i, j) での値を mod 3 で 0 にできなければ探索打ち切り ( (i, j) を攻撃するマスがないかもしれないので必要 )\\n\\tif(cnt[i][j]==0 && B[i][j]%3!=0\\n\\t|| cnt[i][j]==1 && B[i][j]%3==1) return 0;\\n\\n\\tll res=0;\\n\\t// マス (i, j) にナイトを置かない\\n\\trep(k,8){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]--;\\n\\t}\\n\\tbool ok=true;\\n\\trep(k,8){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w){\\n\\t\\t\\tif(cnt[y][x]==0 && B[y][x]%3!=0\\n\\t\\t\\t|| cnt[y][x]==1 && B[y][x]%3==1) ok=false;\\n\\t\\t}\\n\\t}\\n\\tif(ok) res+=dfs(i,j+1,parity);\\n\\n\\t// マス (i, j) にナイトを置く\\n\\trep(k,8){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w) B[y][x]++;\\n\\t}\\n\\tok=true;\\n\\trep(k,8){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w){\\n\\t\\t\\tif(cnt[y][x]==0 && B[y][x]%3!=0\\n\\t\\t\\t|| cnt[y][x]==1 && B[y][x]%3==1) ok=false;\\n\\t\\t}\\n\\t}\\n\\tif(ok) res+=dfs(i,j+1,parity);\\n\\n\\trep(k,8){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]++, B[y][x]--;\\n\\t}\\n\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tscanf(\\\"%d%d\\\",&h,&w);\\n\\trep(i,h) rep(j,w) scanf(\\\"%d\\\",B[i]+j);\\n\\n\\trep(i,h) rep(j,w) rep(k,8) {\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]++;\\n\\t}\\n\\n\\tll ans;\\n\\tif(h==1 || w==1){ // コーナーケース\\n\\t\\tbool ok=true;\\n\\t\\trep(i,h) rep(j,w) if(B[i][j]!=0) ok=false;\\n\\t\\tif(ok){\\n\\t\\t\\tans=1;\\n\\t\\t\\trep(i,h*w) ans=2*ans%M;\\n\\t\\t}\\n\\t\\telse ans=0;\\n\\t}\\n\\telse{\\n\\t\\tans=dfs(0,0,0)*dfs(0,1,1)%M;\\n\\t}\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 748,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2280_416337\",\n \"code_snippet\": \"#include<cstdio>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\n\\nconst ll M=1000000007;\\nconst int dx[]={2,1,-1,-2,-2,-1,1,2},dy[]={-1,-2,-2,-1,1,2,2,1};\\n\\nint h,w,B[50][16];\\n\\nint cnt[50][16]; // 攻撃されうる回数\\n\\nll dfs(int i,int j,int parity){\\n\\tif(i==h) return 1;\\n\\tif(j==w) return dfs(i+1,0,parity);\\n\\n\\tif((i+j)%2!=parity) return dfs(i,j+1,parity); // 黒マス or 白マスのみ見る\\n\\n\\tll res=0;\\n\\t// マス (i, j) にナイトを置く\\n\\trep(k,8){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]--;\\n\\t}\\n\\tbool ok=true;\\n\\trep(k,8){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w){\\n\\t\\t\\tif(cnt[y][x]==0 && B[y][x]%3!=0\\n\\t\\t\\t|| cnt[y][x]==1 && B[y][x]%3==1) ok=false;\\n\\t\\t}\\n\\t}\\n\\tif(ok) res+=dfs(i,j+1,parity);\\n\\n\\t// マス (i, j) にナイトを置かない\\n\\trep(k,8){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w) B[y][x]++;\\n\\t}\\n\\tok=true;\\n\\trep(k,8){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w){\\n\\t\\t\\tif(cnt[y][x]==0 && B[y][x]%3!=0\\n\\t\\t\\t|| cnt[y][x]==1 && B[y][x]%3==1) ok=false;\\n\\t\\t}\\n\\t}\\n\\tif(ok) res+=dfs(i,j+1,parity);\\n\\n\\trep(k,8){\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]++, B[y][x]--;\\n\\t}\\n\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tscanf(\\\"%d%d\\\",&h,&w);\\n\\trep(i,h) rep(j,w) scanf(\\\"%d\\\",B[i]+j);\\n\\n\\trep(i,h) rep(j,w) cnt[i][j]=0;\\n\\trep(i,h) rep(j,w) rep(k,8) {\\n\\t\\tint y=i+dy[k],x=j+dx[k];\\n\\t\\tif(0<=y && y<h && 0<=x && x<w) cnt[y][x]++;\\n\\t}\\n\\n\\tll ans;\\n\\tif(h==1 || w==1){\\n\\t\\tans=1;\\n\\t\\trep(i,h*w) ans=2*ans%M;\\n\\t}\\n\\telse ans=dfs(0,0,0)*dfs(0,1,1)%M;\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.21875,\n \"time_ms\": 60,\n \"memory_kb\": 748,\n \"score_of_the_acc\": -0.5556,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1265,"cells":{"group_id":{"kind":"string","value":"aoj_2275_cpp"},"problem_description":{"kind":"string","value":"問題 E\nFox Number\n問題文\nきつねのしえるは数字について考えるのが好きである．ある日，しえるはこの世にねこの数字というものがあることを知り，自分もそのような数字が欲しくなってしまった．そこで，次の性質を満たす数字をとりあえず Fox Number と呼ぶことにした．\n[性質]: 整数\nN\nは\nk (≥ 1)\n個の素数\np\n1\n, ..., p\nk\nと正整数\ne\n1\n, ..., e\nk\nで，\np\n1\n< ... < p\nk\n，\ne\n1\n≥ ... ≥ e\nk\nを満たすものによって\nN = p\n1\ne\n1\n× ... × p\nk\ne\nk\nと書けるとき，Fox Number であると呼ぶことにする．\nところでしえるはこの性質をその場の思いつきで決めてしまったのでこれがどういう性質を持っているのか全くわかっていない．そこで，この数字の性質を調べるために区間\n[A-B, A+B]\nに含まれる Fox Number の個数を出力して欲しい．\n入力形式\n1\n行目に以下の\n2\nつの整数が与えられる．\nA\nB\n出力形式\n1\n行目に，\nA-B\n以上\nA+B\n以下の Fox Number の個数を出力せよ．\n制約\n1 ≤ A ≤ 10\n12\n0 ≤ B ≤ 5 × 10\n5\n入出力例\n入力例 1\n18 2\n出力例 1\n4\n16 = 2\n4\n, 17 = 17\n1\n, 19 = 19\n1\n, 20 = 2\n2\n× 5\n1\nは Fox Number である．一方で\n18 = 2 × 3\n2\nは Fox Number ではない．合計して\n4\nつの Fox Number がある．\n入力例 2\n100 10\n出力例 2\n18\n入力例 3\n123456 789\n出力例 3\n1464"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2275_4301948","code_snippet":"#include <iostream>\n#include <cmath>\n#include <numeric>\n#include <algorithm>\n#include <deque>\n#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n#include <iomanip>\n#include <map>\n#include <stack>\n#include <queue>\n#include <functional>\n#include <climits>\n#include <numeric>\n#include <bitset>\n#include <random>\n#include <tuple>\n#include <initializer_list>\n#include <fstream>\nstd::vector<int> cal_primes() {\n\tstd::vector<bool> is_prime(1000001, true);\n\tfor (auto i = 2; i * i < is_prime.size(); ++i) {\n\t\tif (is_prime[i]) {\n\t\t\tfor (auto j = i * i; j < is_prime.size(); j += i) {\n\t\t\t\tis_prime[j] = false;\n\t\t\t}\n\t\t}\n\t}\n\tstd::vector<int> result;\n\tfor (auto i = 2; i < is_prime.size(); ++i) {\n\t\tif (is_prime[i]) result.push_back(i);\n\t}\n\treturn result;\n}\nint main() {\n\tconst auto prime = cal_primes();\n\tlong long int a; int b; std::cin >> a >> b;\n\tconst auto min = std::max(2LL, a - b);\n\tconst auto max = a + b;\n\tstd::vector<int> last_exp(max - min + 1, INT_MAX);\n\tfor (const auto p : prime) {\n\t\tint e = 0;\n\t\tlong long int mul = 1;\n\t\twhile ((min + mul - 1) / mul * mul <= max) {\n\t\t\t++e;\n\t\t\tmul *= p;\n\t\t\tfor (auto i = (min + mul - 1) / mul; i * mul <= max; ++i) {\n\t\t\t\tif (i % p == 0) continue;\n\t\t\t\tif (last_exp[mul * i - min] >= e) last_exp[mul * i - min] = e;\n\t\t\t\telse last_exp[mul * i - min] = -1;\n\t\t\t}\n\t\t}\n\t}\n\tstd::cout << std::count_if(last_exp.begin(), last_exp.end(), [](const int e) {return e != -1; }) << std::endl;\n}","accuracy":1,"time_ms":30,"memory_kb":7448,"score_of_the_acc":-0.0237,"final_rank":1},{"submission_id":"aoj_2275_4301937","code_snippet":"#include <iostream>\n#include <cmath>\n#include <numeric>\n#include <algorithm>\n#include <deque>\n#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n#include <iomanip>\n#include <map>\n#include <stack>\n#include <queue>\n#include <functional>\n#include <climits>\n#include <numeric>\n#include <bitset>\n#include <random>\n#include <tuple>\n#include <initializer_list>\n#include <fstream>\nstd::vector<int> cal_primes() {\n\tstd::vector<bool> is_prime(1000001, true);\n\tfor (auto i = 2; i * i < is_prime.size(); ++i) {\n\t\tif (is_prime[i]) {\n\t\t\tfor (auto j = i * i; j < is_prime.size(); j += i) {\n\t\t\t\tis_prime[j] = false;\n\t\t\t}\n\t\t}\n\t}\n\tstd::vector<int> result;\n\tfor (auto i = 2; i < is_prime.size(); ++i) {\n\t\tif (is_prime[i]) result.push_back(i);\n\t}\n\treturn result;\n}\nint main() {\n\tconst auto prime = cal_primes();\n\tlong long int a; int b; std::cin >> a >> b;\n\tstd::vector<int> last_exp(b * 2 + 1, INT_MAX);\n\tfor (const auto p : prime) {\n\t\tint e = 0;\n\t\tlong long int mul = 1;\n\t\twhile ((a - b + mul - 1) / mul * mul <= a + b) {\n\t\t\t++e;\n\t\t\tmul *= p;\n\t\t\tfor (auto i = (a - b + mul - 1) / mul; i * mul <= a + b; ++i) {\n\t\t\t\tif (i % p == 0) continue;\n\t\t\t\tif (last_exp[mul * i - (a - b)] >= e) last_exp[mul * i - (a - b)] = e;\n\t\t\t\telse last_exp[mul * i - (a - b)] = -1;\n\t\t\t}\n\t\t}\n\t}\n\tstd::cout << std::count_if(last_exp.begin(), last_exp.end(), [](const int e) {return e != -1; }) << std::endl;\n}","accuracy":0.027777777777777776,"time_ms":30,"memory_kb":7284,"score_of_the_acc":-0.0209,"final_rank":14},{"submission_id":"aoj_2275_2669701","code_snippet":"#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 1200000\n#define HUGE_NUM 99999999999999\n\nint main(){\n\n\tint limit;\n\tll* table = new ll[NUM];\n\n\tfor(int i=0; i < NUM;i++)table[i] = 1;\n\ttable[0] = 0;\n\ttable[1] = 0;\n\n\tlimit = sqrt(NUM);\n\n\tfor(int i=2;i<=limit;i++){\n\t\tif(table[i] == 1){\n\t\t\tfor(int k=2*i;k < NUM; k += i){\n\t\t\t\ttable[k] = 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tint index = 0;\n\tll* prime_table = new ll[550000];\n\n\tfor(int i = 2; i < NUM; i++){\n\t\tif(table[i] == 1){\n\t\t\tprime_table[index++] = i;\n\t\t}\n\t}\n\n\tll A,B;\n\tscanf(\"%lld %lld\",&A,&B);\n\n\tll left,right;\n\n\tif(A-B <= 2){\n\t\tleft = 2;\n\t}else{\n\t\tleft = A-B;\n\t}\n\n\tright = A+B;\n\n\tif(left > right){\n\t\tprintf(\"0\\n\");\n\t\treturn 0;\n\t}\n\n\tll* check = new ll[right-left+1];\n\tfor(int i = 0; i < right-left+1; i++){\n\t\tcheck[i] = HUGE_NUM;\n\t}\n\n\tbool* is_fox = new bool[right-left+1];\n\tfor(int i = 0; i < right-left+1; i++)is_fox[i] = true;\n\n\tll tmp,count,start;\n\n\tfor(int i = 0; prime_table[i] <= sqrt(right); i++){\n\n\t\tif(left%prime_table[i] == 0){\n\t\t\tstart = 0;\n\t\t}else{\n\t\t\tstart = prime_table[i]*(left/prime_table[i]+1)-left;\n\t\t}\n\n\t\tif(left+start > right)continue;\n\n\t\tfor(int k = start; k < right-left+1; k += prime_table[i]){\n\n\t\t\tif(!is_fox[k])continue;\n\n\t\t\ttmp = left+k;\n\n\t\t\tcount = 0;\n\n\t\t\twhile(tmp%prime_table[i] == 0){\n\t\t\t\ttmp /= prime_table[i];\n\t\t\t\tcount++;\n\t\t\t}\n\n\t\t\tif(check[k] < count){\n\t\t\t\tis_fox[k] = false;\n\t\t\t}else{\n\t\t\t\tcheck[k] = count;\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans = 0;\n\n\tfor(int i = 0; i < right-left+1; i++){\n\t\tif(is_fox[i])ans++;\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":22080,"score_of_the_acc":-0.4328,"final_rank":6},{"submission_id":"aoj_2275_2104620","code_snippet":"#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nlong long A; int B;\nint main() {\n\tcin >> A >> B;\n\tlong long l = max(A - B, 2LL), r = A + B + 1;\n\tint p = sqrt(r);\n\tvector<long long> f(r - l);\n\tvector<bool> ok(r - l, true); vector<int> x(r - l, 999999999);\n\tfor (int i = 0; i < r - l; i++) f[i] = l + i;\n\tfor (int i = 2; i <= p; i++) {\n\t\tlong long w = l / i * i;\n\t\tif (w < l) w += i;\n\t\tfor (long long j = w; j < r; j += i) {\n\t\t\tint cnt = 0;\n\t\t\twhile (f[j - l] % i == 0) f[j - l] /= i, cnt++;\n\t\t\tif (cnt >= 1) {\n\t\t\t\tif (x[j - l] < cnt) ok[j - l] = false;\n\t\t\t\tx[j - l] = cnt;\n\t\t\t}\n\t\t}\n\t}\n\tint ret = 0;\n\tfor (int i = 0; i < r - l; i++) ret += (ok[i] ? 1 : 0);\n\tcout << ret << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":300,"memory_kb":14696,"score_of_the_acc":-0.7736,"final_rank":7},{"submission_id":"aoj_2275_2104611","code_snippet":"#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nlong long A; int B;\nint main() {\n\tcin >> A >> B;\n\tlong long l = max(A - B, 1LL), r = A + B + 1;\n\tint p = sqrt(r);\n\tvector<long long> f(r - l);\n\tvector<bool> ok(r - l, true); vector<int> x(r - l, 999999999);\n\tfor (int i = 0; i < r - l; i++) f[i] = l + i;\n\tfor (int i = 2; i <= p; i++) {\n\t\tlong long w = l / i * i;\n\t\tif (w < l) w += i;\n\t\tfor (long long j = w; j < r; j += i) {\n\t\t\tint cnt = 0;\n\t\t\twhile (f[j - l] % i == 0) f[j - l] /= i, cnt++;\n\t\t\tif (cnt >= 1) {\n\t\t\t\tif (x[j - l] < cnt) ok[j - l] = false;\n\t\t\t\tx[j - l] = cnt;\n\t\t\t}\n\t\t}\n\t}\n\tint ret = 0;\n\tfor (int i = 0; i < r - l; i++) ret += (ok[i] ? 1 : 0);\n\tcout << ret << endl;\n\treturn 0;\n}","accuracy":0.027777777777777776,"time_ms":280,"memory_kb":14608,"score_of_the_acc":-0.7256,"final_rank":19},{"submission_id":"aoj_2275_2007777","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\n#define MAX_N 1000007\nlong long A, B, W[MAX_N], cnt; bool prime[MAX_N];\nvector<short>V[MAX_N];\nvoid primesieve() {\n\tfor (int i = 2; i*i <= 1000000; i++) {\n\t\tfor (int j = i*i; j <= 1000000; j += i) prime[j] = true;\n\t}\n\tfor (int i = 0; i <= 1000000; i++)prime[i] ^= true;\n}\nint main() {\n\tcin >> A >> B; long long L = A - B, R = A + B; primesieve(); if (L <= 0)L = 1;\n\tfor (long long i = L; i <= R; i++) { W[i - L] = i; }\n\tfor (long long i = 2; i <= 1000000; i++) {\n\t\tif (prime[i] == false)continue;\n\t\tlong long F = (L / i)*i; if ((L%i) > 0)F += i;\n\t\tfor (long long j = F; j <= R; j += i) {\n\t\t\tint cnts = 0;\n\t\t\twhile (W[j - L] % i == 0) { W[j - L] /= i; cnts++; }\n\t\t\tif (cnts >= 1) { V[j - L].push_back(cnts); }\n\t\t}\n\t}\n\tfor (long long i = L; i <= R; i++) { if (W[i - L] >= 2 && W[i - L] != i)V[i - L].push_back(1); }\n\tfor (long long i = L; i <= R; i++) {\n\t\tbool OK = true; if (i <= 1LL)OK = false;\n\t\tfor (int j = 1; j < V[i - L].size(); j++) {\n\t\t\tif (V[i - L][j - 1] < V[i - L][j])OK = false;\n\t\t}\n\t\tif (OK == true)cnt++;\n\t}\n\tcout << cnt << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":440,"memory_kb":65376,"score_of_the_acc":-1.9525,"final_rank":11},{"submission_id":"aoj_2275_2007771","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\n#define MAX_N 1000007\nlong long A, B, W[MAX_N], cnt; bool prime[MAX_N];\nvector<short>V[MAX_N];\nvoid primesieve() {\n\tfor (int i = 2; i*i <= 1000000; i++) {\n\t\tfor (int j = i*i; j <= 1000000; j += i) prime[j] = true;\n\t}\n\tfor (int i = 0; i <= 1000000; i++)prime[i] ^= true;\n}\nint main() {\n\tcin >> A >> B; long long L = A - B, R = A + B; primesieve();\n\tfor (long long i = L; i <= R; i++) { W[i - L] = i; }\n\tfor (long long i = 2; i <= 1000000; i++) {\n\t\tif (prime[i] == false)continue;\n\t\tlong long F = (L / i)*i; if ((L%i) > 0)F += i;\n\t\tfor (long long j = F; j <= R; j += i) {\n\t\t\tint cnts = 0;\n\t\t\twhile (W[j - L] % i == 0) { W[j - L] /= i; cnts++; }\n\t\t\tif (cnts >= 1) { V[j - L].push_back(cnts); }\n\t\t}\n\t}\n\tfor (long long i = L; i <= R; i++) { if (W[i - L] >= 2 && W[i - L] != i)V[i - L].push_back(1); }\n\tfor (long long i = L; i <= R; i++) {\n\t\tbool OK = true;\n\t\tfor (int j = 1; j < V[i - L].size(); j++) {\n\t\t\tif (V[i - L][j - 1] < V[i - L][j])OK = false;\n\t\t}\n\t\tif (OK == true)cnt++;\n\t}\n\tcout << cnt << endl;\n\treturn 0;\n}","accuracy":0.027777777777777776,"time_ms":450,"memory_kb":65436,"score_of_the_acc":-1.9767,"final_rank":20},{"submission_id":"aoj_2275_1262206","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\nbool is_prime[2000000];\nvector<ll> primes;\nbool is_fox_number[11000000];\nint cnt[11000000];\n\nvoid Sieve(){\n\tfill_n(is_prime,2000000,true);\n\tis_prime[0]=is_prime[1]=false;\n\tfor(int i=2; i<2000000; ++i){\n\t\tif(is_prime[i]){\n\t\t\tprimes.push_back(i);\n\t\t\tfor(int j=i*2; j<2000000; j+=i) is_prime[j]=false;\n\t\t}\n\t}\n}\n\nvoid Solve(){\n\tSieve();\n\tll a,b,l,h;\n\tcin >> a >> b;\n\tl=max(a-b,2LL);\n\th=a+b+1;\n\n\tfill_n(is_fox_number,11000000,true);\n\tfill_n(cnt,11000000,INF);\n\n\tfor(auto p:primes){\n\t\tll x=(l+p-1)/p*p;\n\t\tif(p*p>h) break;\n\t\twhile(x<h){\n\t\t\tif(!is_fox_number[x-l]){\n\t\t\t\tx+=p;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\tll tmp=x;\n\t\t\tint c=0;\n\t\t\twhile(tmp%p==0){\n\t\t\t\ttmp/=p;\n\t\t\t\t++c;\n\t\t\t}\n\n\t\t\tif(c>cnt[x-l]) is_fox_number[x-l]=false;\n\n\t\t\tcnt[x-l]=c;\n\t\t\tx+=p;\n\t\t}\n\t}\n\n\tint ans=0;\n\trep(i,0,h-l) ans+=is_fox_number[i];\n\n\tcout << ans << 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":110,"memory_kb":58996,"score_of_the_acc":-1.0776,"final_rank":9},{"submission_id":"aoj_2275_1262199","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\nbool is_prime[2000000];\nvector<ll> primes;\nbool is_fox_number[11000000];\nint cnt[11000000];\n\nvoid Sieve(){\n\tfill_n(is_prime,2000000,true);\n\tis_prime[0]=is_prime[1]=false;\n\tfor(int i=2; i<2000000; ++i){\n\t\tif(is_prime[i]){\n\t\t\tprimes.push_back(i);\n\t\t\tfor(int j=i*2; j<2000000; j+=i) is_prime[j]=false;\n\t\t}\n\t}\n}\n\nvoid Solve(){\n\tSieve();\n\tll a,b,l,h;\n\tcin >> a >> b;\n\tl=max(a-b,2LL);\n\th=a+b+1;\n\n\tfill_n(is_fox_number,11000000,true);\n\tfill_n(cnt,11000000,INF);\n\n\tfor(auto p:primes){\n\t\tll x=(l+p-1)/p*p;\n\t\t//if(x*x>h) break;\n\t\twhile(x<h){\n\t\t\tif(!is_fox_number[x-l]){\n\t\t\t\tx+=p;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\tll tmp=x;\n\t\t\tint c=0;\n\t\t\twhile(tmp%p==0){\n\t\t\t\ttmp/=p;\n\t\t\t\t++c;\n\t\t\t}\n\n\t\t\tif(c>cnt[x-l]) is_fox_number[x-l]=false;\n\n\t\t\tcnt[x-l]=c;\n\t\t\tx+=p;\n\t\t}\n\t}\n\n\tint ans=0;\n\trep(i,0,h-l) ans+=is_fox_number[i];\n\n\tcout << ans << 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":120,"memory_kb":58160,"score_of_the_acc":-1.0868,"final_rank":10},{"submission_id":"aoj_2275_1262196","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\nbool is_prime[2000000];\nvector<ll> primes;\nbool is_fox_number[11000000];\nint cnt[11000000];\n\nvoid Sieve(){\n\tfill_n(is_prime,2000000,true);\n\tis_prime[0]=is_prime[1]=false;\n\tfor(int i=2; i<2000000; ++i){\n\t\tif(is_prime[i]){\n\t\t\tprimes.push_back(i);\n\t\t\tfor(int j=i*2; j<2000000; j+=i) is_prime[j]=false;\n\t\t}\n\t}\n}\n\nvoid Solve(){\n\tSieve();\n\tll a,b,l,h;\n\tcin >> a >> b;\n\tl=max(a-b,2LL);\n\th=a+b+1;\n\n\tfill_n(is_fox_number,11000000,true);\n\tfill_n(cnt,11000000,INF);\n\n\tfor(auto p:primes){\n\t\tll x=(l+p-1)/p*p;\n\t\t//if(x*x>h) break;\n\t\twhile(x<h){\n\t\t\tif(!is_fox_number[x-l]){\n\t\t\t\tx+=p;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\tll tmp=x;\n\t\t\tint c=0;\n\t\t\twhile(tmp%p==0){\n\t\t\t\ttmp/=p;\n\t\t\t\t++c;\n\t\t\t}\n\n\t\t\tif(c>cnt[x-(a-b)]) is_fox_number[x-l]=false;\n\n\t\t\tcnt[x-l]=c;\n\t\t\tx+=p;\n\t\t}\n\t}\n\n\tint ans=0;\n\trep(i,0,h-l) ans+=is_fox_number[i];\n\n\tcout << ans << endl;\n}\n\nint main(){\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(0);\n\tSolve();\n\treturn 0;\n}","accuracy":0.05555555555555555,"time_ms":110,"memory_kb":58160,"score_of_the_acc":-1.0635,"final_rank":13},{"submission_id":"aoj_2275_1087370","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <map>\n#include <algorithm>\n\n#define REP(i,n) for(int64_t i=0;i<(int64_t)(n);i++)\n\nusing namespace std;\n\nbool is_valid(const vector<int>& fct, int64_t n) {\n int64_t old_h = 0;\n for (int p : fct) {\n int cnt = 0;\n while((n % p) == 0){\n n /= p;\n ++cnt;\n }\n if (cnt < old_h) return false;\n old_h = cnt;\n }\n return true;\n}\n\nint main() {\n int64_t a, b;\n cin >> a >> b;\n int64_t beg = max(a - b, int64_t(2));\n int64_t ed = a + b;\n vector<vector<int>> pl2(1000001);\n vector<int> ps(1100001,1);\n ps[0] = ps[1] = 0;\n int64_t i;\n for (i = 2; i * i * i * i <= ed; ++i) {\n if (ps[i] == 1) {\n int64_t offset = (i - (beg % i)) % i;\n for (int64_t k = offset; k <= 1000000; k += i) {\n pl2[k].push_back(i);\n }\n for (int64_t j = i * 2; j * j <= ed; j += i) {\n ps[j] = i;\n }\n }\n }\n for (; i * i <= ed; ++i) {\n if (ps[i] == 1) {\n int64_t offset = (i - (beg % i)) % i;\n for (int64_t k = offset; k <= 1000000; k += i) {\n pl2[k].push_back(i);\n }\n for (int64_t j = i * 2; j * j <= ed; j += i) {\n ps[j] = i;\n }\n }\n }\n int64_t cnt = 0;\n for (int64_t i = 0; i <= ed - beg; ++i) {\n auto fct = pl2[i];\n sort(begin(fct),end(fct),greater<int64_t>());\n if (is_valid(fct, beg+i)) {\n ++cnt;\n }\n }\n cout << cnt << endl;\n return 0;\n}","accuracy":1,"time_ms":460,"memory_kb":63608,"score_of_the_acc":-1.9692,"final_rank":12},{"submission_id":"aoj_2275_1049244","code_snippet":"#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main(){\n const int N=1100000;\n static bool cmp[N+1]={true,true};\n for(int i=2;i<=N;i++){\n if(!cmp[i]){\n for(int j=i*2;j<=N;j+=i){\n\tcmp[j]=true;\n }\n }\n }\n static int le[1000001];\n fill(begin(le),end(le),1<<29);\n long long A,B;\n cin>>A>>B;\n for(int i=0;i<=N;i++){\n if(!cmp[i]){\n for(long long j=max<long long>(i,(A-B+i-1)/i*i);j<=A+B;j+=i){\n\tint x=j-(A-B);\n\tint e=0;\n\tfor(long long c=j;c%i==0;c/=i,e++);\n\tle[x]=(le[x]>=e)?e:-1;\n }\n }\n }\n int ans=0;\n for(int i=0;i<B*2+1;i++){\n ans+=i+A-B>=2&&le[i]>0;\n }\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":110,"memory_kb":6144,"score_of_the_acc":-0.1878,"final_rank":3},{"submission_id":"aoj_2275_1049229","code_snippet":"#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main(){\n const int N=1000000;\n static bool cmp[N+1]={true,true};\n for(int i=2;i<=N;i++){\n if(!cmp[i]){\n for(int j=i*2;j<=N;j+=i){\n\tcmp[j]=true;\n }\n }\n }\n static int le[1000001];\n fill(begin(le),end(le),1<<29);\n long long A,B;\n cin>>A>>B;\n for(int i=0;i<=N;i++){\n if(!cmp[i]){\n for(long long j=(A-B+i-1)/i*i;j<=A+B;j+=i){\n\tint x=j-(A-B);\n\tint e=0;\n\tfor(long long c=j;c%i==0;c/=i,e++);\n\tle[x]=(le[x]>=e)?e:-1;\n }\n }\n }\n int ans=0;\n for(int i=0;i<B*2+1;i++){\n ans+=le[i]>0;\n }\n cout<<ans<<endl;\n}","accuracy":0.027777777777777776,"time_ms":100,"memory_kb":6044,"score_of_the_acc":-0.1629,"final_rank":15},{"submission_id":"aoj_2275_1049225","code_snippet":"#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main(){\n static bool cmp[1000001]={true,true};\n for(int i=2;i<=1000000;i++){\n if(!cmp[i]){\n for(int j=i*2;j<=1000000;j+=i){\n\tcmp[j]=true;\n }\n }\n }\n static int le[1000001];\n fill(begin(le),end(le),1<<29);\n long long A,B;\n cin>>A>>B;\n for(int i=0;i<=1000000;i++){\n if(!cmp[i]){\n for(long long j=(A-B+i-1)/i*i;j<=A+B;j+=i){\n\tint x=j-(A-B);\n\tint e=0;\n\tfor(long long c=j;c%i==0;c/=i,e++);\n\tle[x]=(le[x]>=e)?e:-1;\n }\n }\n }\n int ans=0;\n for(int i=0;i<B*2+1;i++){\n ans+=le[i]>0;\n }\n cout<<ans<<endl;\n}","accuracy":0.027777777777777776,"time_ms":100,"memory_kb":6044,"score_of_the_acc":-0.1629,"final_rank":15},{"submission_id":"aoj_2275_1007718","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint dm[1100000];\nint m[1100000];\nint isp[1100000];\nint prime[1100000];\nint main(){\n\tint sz=0;\n\tisp[0]=isp[1]=-1;\n\tfor(int i=2;i<1100000;i++){\n\t\tif(~isp[i]){\n\t\t\tisp[i]=1;\n\t\t\tprime[sz++]=i;\n\t\t\tfor(int j=i+i;j<1100000;j+=i)isp[j]=-1;\n\t\t}\n\t}\n\tlong long a,b;scanf(\"%lld%lld\",&a,&b);\n\tlong long L=max(1LL,a-b);\n\tlong long R=a+b;\n\tint n=R-L+1;\n\tfor(int i=0;i<n;i++)m[i]=9999999;\n\tfor(int i=1;(long long)prime[i]*prime[i]<=R;i++){\n\t\tint E=prime[i-1];\n\t\tfor(long long j=(L+E-1)/E*E;j<=R;j+=E){\n\t\t\tlong long now=j;\n\t\t\tint time=0;\n\t\t\twhile(now%E==0){\n\t\t\t\tnow/=E;time++;\n\t\t\t}\n\t\t\tm[j-L]=min(m[j-L],time);\n\t\t}\n\t\tint D=prime[i];\n\t\tlong long S=L/D/D*D*D;\n\t\tlong long T=R/D/D*D*D;\n\t\twhile(S<L)S+=(long long)D*D;\n\t\twhile(T>R)T-=(long long)D*D;\n\t\tfor(long long j=S;j<=T;j+=(long long)D*D){\n\t\t\tlong long now=j;\n\t\t\tint time=0;\n\t\t\twhile(now%D==0){\n\t\t\t\tnow/=D;time++;\n\t\t\t}\n\t\t\tif(m[j-L]<time){\n\t\t\t//\tprintf(\"%lld %d\\n\",j,i);\n\t\t\t\tdm[j-L]=1;\n\t\t\t}\n\t\t}\n\t}\n\tint ret=n;\n\tif(L==1LL)dm[0]=1;\n\tfor(int i=0;i<n;i++)if(dm[i])ret--;\n\tprintf(\"%d\\n\",ret);\n}","accuracy":1,"time_ms":120,"memory_kb":14064,"score_of_the_acc":-0.3444,"final_rank":5},{"submission_id":"aoj_2275_1007714","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint dm[1100000];\nint m[1100000];\nint isp[1100000];\nint prime[1100000];\nint main(){\n\tint sz=0;\n\tisp[0]=isp[1]=-1;\n\tfor(int i=2;i<1100000;i++){\n\t\tif(~isp[i]){\n\t\t\tisp[i]=1;\n\t\t\tprime[sz++]=i;\n\t\t\tfor(int j=i+i;j<1100000;j+=i)isp[j]=-1;\n\t\t}\n\t}\n\tlong long a,b;scanf(\"%lld%lld\",&a,&b);\n\tlong long L=max(1LL,a-b);\n\tlong long R=a+b;\n\tint n=R-L+1;\n\tfor(int i=0;i<n;i++)m[i]=9999999;\n\tfor(int i=1;(long long)prime[i]*prime[i]<=R;i++){\n\t\tint E=prime[i-1];\n\t\tfor(long long j=(L+E-1)/E*E;j<=R;j+=E){\n\t\t\tlong long now=j;\n\t\t\tint time=0;\n\t\t\twhile(now%E==0){\n\t\t\t\tnow/=E;time++;\n\t\t\t}\n\t\t\tm[j-L]=min(m[j-L],time);\n\t\t}\n\t\tint D=prime[i];\n\t\tlong long S=L/D/D*D*D;\n\t\tlong long T=R/D/D*D*D;\n\t\twhile(S<L)S+=(long long)D*D;\n\t\twhile(T>R)T-=(long long)D*D;\n\t\tfor(long long j=S;j<=T;j+=(long long)D*D){\n\t\t\tlong long now=j;\n\t\t\tint time=0;\n\t\t\twhile(now%D==0){\n\t\t\t\tnow/=D;time++;\n\t\t\t}\n\t\t\tif(m[j-L]<time){\n\t\t\t//\tprintf(\"%lld %d\\n\",j,i);\n\t\t\t\tdm[j-L]=1;\n\t\t\t}\n\t\t}\n\t}\n\tint ret=n;\n\tfor(int i=0;i<n;i++)if(dm[i])ret--;\n\tprintf(\"%d\\n\",ret);\n}","accuracy":0.027777777777777776,"time_ms":110,"memory_kb":14064,"score_of_the_acc":-0.3211,"final_rank":17},{"submission_id":"aoj_2275_1007706","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nlong long d[1100000];\nint dm[1100000];\nint m[1100000];\nint isp[1100000];\nint prime[1100000];\nint main(){\n\tint sz=0;\n\tisp[0]=isp[1]=-1;\n\tfor(int i=2;i<1100000;i++){\n\t\tif(~isp[i]){\n\t\t\tisp[i]=1;\n\t\t\tprime[sz++]=i;\n\t\t\tfor(int j=i+i;j<1100000;j+=i)isp[j]=-1;\n\t\t}\n\t}\n\tlong long a,b;scanf(\"%lld%lld\",&a,&b);\n\tlong long L=max(1LL,a-b);\n\tlong long R=a+b;\n\tint n=R-L+1;\n\tfor(int i=0;i<n;i++)d[i]=L+i;\n\tfor(int i=0;i<n;i++)m[i]=9999999;\n\tfor(int i=1;(long long)prime[i]*prime[i]<=R;i++){\n\t\tint E=prime[i-1];\n\t\tfor(long long j=(L+E-1)/E*E;j<=R;j+=E){\n\t\t\tlong long now=j;\n\t\t\tint time=0;\n\t\t\twhile(now%E==0){\n\t\t\t\tnow/=E;time++;\n\t\t\t}\n\t\t\tm[j-L]=min(m[j-L],time);\n\t\t}\n\t\tint D=prime[i];\n\t\tlong long S=L/D/D*D*D;\n\t\tlong long T=R/D/D*D*D;\n\t\twhile(S<L)S+=(long long)D*D;\n\t\twhile(T>R)T-=(long long)D*D;\n\t\tlong long div=(long long )D*D;\n\t\tfor(long long j=S;j<=T;j+=(long long)D*D){\n\t\t\tlong long now=j;\n\t\t\tint time=0;\n\t\t\twhile(now%D==0){\n\t\t\t\tnow/=D;time++;\n\t\t\t}\n\t\t\tif(m[j-L]<time){\n\t\t\t//\tprintf(\"%lld %d\\n\",j,i);\n\t\t\t\tdm[j-L]=1;\n\t\t\t}\n\t\t}\n\t}\n\tint ret=n;\n\tfor(int i=0;i<n;i++)if(dm[i])ret--;\n\tprintf(\"%d\\n\",ret);\n}","accuracy":0.027777777777777776,"time_ms":120,"memory_kb":22268,"score_of_the_acc":-0.4825,"final_rank":18},{"submission_id":"aoj_2275_507324","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; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\nint count_fox_number(ll a, ll b){\n if(a < 2) a = 2;\n if(!(a < b)) return 0;\n int ans = b - a;\n bool prime_small[1000100];\n for(int i = 2; (ll) i * i < b; i++) prime_small[i] = true;\n int cnt_pow[1000100];\n REP(i, b - a) cnt_pow[i] = INF;\n for(int i = 2; (ll)i * i < b; i++){\n if(prime_small[i]){\n for(int j = 2 * i; (ll) j * j < b; j += i) prime_small[j] = false;\n for(ll j = max(2LL, (a + i - 1)/i) * i; j < b; j += i){\n if(cnt_pow[j - a] == -1) continue;\n ll t = j;\n int cnt = 0;\n while(t % i == 0){\n t /= i;\n cnt++;\n }\n assert(cnt != 0);\n if(cnt_pow[j - a] < cnt){\n cnt_pow[j - a] = -1;\n ans--;\n }else{\n cnt_pow[j - a] = cnt;\n }\n }\n }\n }\n return ans;\n}\n\nint main(){\n ll a, b;\n while(cin>>a>>b){\n cout<<count_fox_number(a - b, a + b + 1)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":6040,"score_of_the_acc":-0.1628,"final_rank":2},{"submission_id":"aoj_2275_507322","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; }\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\n\ntypedef long long ll;\nconst int INF = 100000000;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\nint count_fox_number(ll a, ll b){\n if(a < 2) a = 2;\n if(!(a < b)) return 0;\n int ans = b - a;\n bool prime_small[1000100] = {};\n //for(int i = 2; (ll) i * i < b; i++) prime_small[i] = true;\n int cnt_pow[1000100];\n REP(i, b - a) cnt_pow[i] = INF;\n for(int i = 2; (ll)i * i < b; i++){\n if(!prime_small[i]){\n for(int j = 2 * i; (ll) j * j < b; j += i) prime_small[j] = true;\n for(ll j = max(2LL, (a + i - 1)/i) * i; j < b; j += i){\n if(cnt_pow[j - a] == -1) continue;\n ll t = j;\n int cnt = 0;\n while(t % i == 0){\n t /= i;\n cnt++;\n }\n assert(cnt != 0);\n if(cnt_pow[j - a] < cnt){\n cnt_pow[j - a] = -1;\n ans--;\n }else{\n cnt_pow[j - a] = cnt;\n }\n }\n }\n }\n return ans;\n}\n\nint main(){\n ll a, b;\n while(cin>>a>>b){\n cout<<count_fox_number(a - b, a + b + 1)<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":6052,"score_of_the_acc":-0.2095,"final_rank":4},{"submission_id":"aoj_2275_419707","code_snippet":"#include <iostream>\n#include <fstream>\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <iomanip>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <sstream>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#pragma comment(linker, \"/STACK:400000000\")\n\n#define EPS 1e-9\n#define INF MOD\n#define MOD 1000000007LL\n#define fir first\n#define foreach(it,X) for(it=X.begin();it!=X.end();it++)\n#define iss istringstream\n#define ite iterator\n#define ll long long\n#define mp make_pair\n#define rep(i,n) rep2(i,0,n)\n#define rep2(i,m,n) for(int i=m;i<n;i++)\n#define pi pair<int,int>\n#define pb push_back\n#define sec second\n#define sh(i) (1LL<<i)\n#define sst stringstream\n#define sz size()\n#define vi vector<int>\n#define vc vector\n#define vl vector<ll>\n#define vs vector<string>\n\nbool isp[1000011];\nint last[1000011];\nll cur[1000011];\nll A,B,a,b;\n\nint main(){\n\tcin>>A>>B;\n\ta=max(2LL,A-B);\n\tb=A+B;\n\tfill(isp,isp+1000011,1);\n\tfill(last,last+2*B+1,INF);\n\tfor(ll i=a;i<=b;i++)cur[i-a]=i;\n\tfor(ll i=2;i*i<=b;i++){\n\t\tif(isp[i]){\n\t\t\tfor(ll j=2*i;j*j<=b;j+=i) isp[j]=0;\n\t\t\tfor(ll j=max(2LL,(a+i-1)/i)*i;j<=b;j+=i){\n\t\t\t\tif(last[j-a]>-1){\n\t\t\t\t\tint y=0;\n\t\t\t\t\twhile(cur[j-a]%i==0)cur[j-a]/=i,y++;\n\t\t\t\t\tif(last[j-a]<y)last[j-a]=-1;\n\t\t\t\t\telse last[j-a]=y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans=0;\n\tfor(ll i=a;i<=b;i++)ans+=last[i-a]>-1;\n\tcout<<ans<<endl;\n}","accuracy":1,"time_ms":340,"memory_kb":13000,"score_of_the_acc":-0.8381,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_2275_4301948\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <numeric>\\n#include <algorithm>\\n#include <deque>\\n#include <vector>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <iomanip>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <functional>\\n#include <climits>\\n#include <numeric>\\n#include <bitset>\\n#include <random>\\n#include <tuple>\\n#include <initializer_list>\\n#include <fstream>\\nstd::vector<int> cal_primes() {\\n\\tstd::vector<bool> is_prime(1000001, true);\\n\\tfor (auto i = 2; i * i < is_prime.size(); ++i) {\\n\\t\\tif (is_prime[i]) {\\n\\t\\t\\tfor (auto j = i * i; j < is_prime.size(); j += i) {\\n\\t\\t\\t\\tis_prime[j] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::vector<int> result;\\n\\tfor (auto i = 2; i < is_prime.size(); ++i) {\\n\\t\\tif (is_prime[i]) result.push_back(i);\\n\\t}\\n\\treturn result;\\n}\\nint main() {\\n\\tconst auto prime = cal_primes();\\n\\tlong long int a; int b; std::cin >> a >> b;\\n\\tconst auto min = std::max(2LL, a - b);\\n\\tconst auto max = a + b;\\n\\tstd::vector<int> last_exp(max - min + 1, INT_MAX);\\n\\tfor (const auto p : prime) {\\n\\t\\tint e = 0;\\n\\t\\tlong long int mul = 1;\\n\\t\\twhile ((min + mul - 1) / mul * mul <= max) {\\n\\t\\t\\t++e;\\n\\t\\t\\tmul *= p;\\n\\t\\t\\tfor (auto i = (min + mul - 1) / mul; i * mul <= max; ++i) {\\n\\t\\t\\t\\tif (i % p == 0) continue;\\n\\t\\t\\t\\tif (last_exp[mul * i - min] >= e) last_exp[mul * i - min] = e;\\n\\t\\t\\t\\telse last_exp[mul * i - min] = -1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::cout << std::count_if(last_exp.begin(), last_exp.end(), [](const int e) {return e != -1; }) << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 7448,\n \"score_of_the_acc\": -0.0237,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2275_4301937\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <numeric>\\n#include <algorithm>\\n#include <deque>\\n#include <vector>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <iomanip>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <functional>\\n#include <climits>\\n#include <numeric>\\n#include <bitset>\\n#include <random>\\n#include <tuple>\\n#include <initializer_list>\\n#include <fstream>\\nstd::vector<int> cal_primes() {\\n\\tstd::vector<bool> is_prime(1000001, true);\\n\\tfor (auto i = 2; i * i < is_prime.size(); ++i) {\\n\\t\\tif (is_prime[i]) {\\n\\t\\t\\tfor (auto j = i * i; j < is_prime.size(); j += i) {\\n\\t\\t\\t\\tis_prime[j] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::vector<int> result;\\n\\tfor (auto i = 2; i < is_prime.size(); ++i) {\\n\\t\\tif (is_prime[i]) result.push_back(i);\\n\\t}\\n\\treturn result;\\n}\\nint main() {\\n\\tconst auto prime = cal_primes();\\n\\tlong long int a; int b; std::cin >> a >> b;\\n\\tstd::vector<int> last_exp(b * 2 + 1, INT_MAX);\\n\\tfor (const auto p : prime) {\\n\\t\\tint e = 0;\\n\\t\\tlong long int mul = 1;\\n\\t\\twhile ((a - b + mul - 1) / mul * mul <= a + b) {\\n\\t\\t\\t++e;\\n\\t\\t\\tmul *= p;\\n\\t\\t\\tfor (auto i = (a - b + mul - 1) / mul; i * mul <= a + b; ++i) {\\n\\t\\t\\t\\tif (i % p == 0) continue;\\n\\t\\t\\t\\tif (last_exp[mul * i - (a - b)] >= e) last_exp[mul * i - (a - b)] = e;\\n\\t\\t\\t\\telse last_exp[mul * i - (a - b)] = -1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::cout << std::count_if(last_exp.begin(), last_exp.end(), [](const int e) {return e != -1; }) << std::endl;\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 30,\n \"memory_kb\": 7284,\n \"score_of_the_acc\": -0.0209,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2275_2669701\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <cmath>\\n#include <algorithm>\\n#include <cfloat>\\n#include <stack>\\n#include <queue>\\n#include <vector>\\n#include <string>\\n#include <iostream>\\n#include <set>\\n#include <map>\\n#include <time.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 1200000\\n#define HUGE_NUM 99999999999999\\n\\nint main(){\\n\\n\\tint limit;\\n\\tll* table = new ll[NUM];\\n\\n\\tfor(int i=0; i < NUM;i++)table[i] = 1;\\n\\ttable[0] = 0;\\n\\ttable[1] = 0;\\n\\n\\tlimit = sqrt(NUM);\\n\\n\\tfor(int i=2;i<=limit;i++){\\n\\t\\tif(table[i] == 1){\\n\\t\\t\\tfor(int k=2*i;k < NUM; k += i){\\n\\t\\t\\t\\ttable[k] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint index = 0;\\n\\tll* prime_table = new ll[550000];\\n\\n\\tfor(int i = 2; i < NUM; i++){\\n\\t\\tif(table[i] == 1){\\n\\t\\t\\tprime_table[index++] = i;\\n\\t\\t}\\n\\t}\\n\\n\\tll A,B;\\n\\tscanf(\\\"%lld %lld\\\",&A,&B);\\n\\n\\tll left,right;\\n\\n\\tif(A-B <= 2){\\n\\t\\tleft = 2;\\n\\t}else{\\n\\t\\tleft = A-B;\\n\\t}\\n\\n\\tright = A+B;\\n\\n\\tif(left > right){\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tll* check = new ll[right-left+1];\\n\\tfor(int i = 0; i < right-left+1; i++){\\n\\t\\tcheck[i] = HUGE_NUM;\\n\\t}\\n\\n\\tbool* is_fox = new bool[right-left+1];\\n\\tfor(int i = 0; i < right-left+1; i++)is_fox[i] = true;\\n\\n\\tll tmp,count,start;\\n\\n\\tfor(int i = 0; prime_table[i] <= sqrt(right); i++){\\n\\n\\t\\tif(left%prime_table[i] == 0){\\n\\t\\t\\tstart = 0;\\n\\t\\t}else{\\n\\t\\t\\tstart = prime_table[i]*(left/prime_table[i]+1)-left;\\n\\t\\t}\\n\\n\\t\\tif(left+start > right)continue;\\n\\n\\t\\tfor(int k = start; k < right-left+1; k += prime_table[i]){\\n\\n\\t\\t\\tif(!is_fox[k])continue;\\n\\n\\t\\t\\ttmp = left+k;\\n\\n\\t\\t\\tcount = 0;\\n\\n\\t\\t\\twhile(tmp%prime_table[i] == 0){\\n\\t\\t\\t\\ttmp /= prime_table[i];\\n\\t\\t\\t\\tcount++;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(check[k] < count){\\n\\t\\t\\t\\tis_fox[k] = false;\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tcheck[k] = count;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = 0;\\n\\n\\tfor(int i = 0; i < right-left+1; i++){\\n\\t\\tif(is_fox[i])ans++;\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 22080,\n \"score_of_the_acc\": -0.4328,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2275_2104620\",\n \"code_snippet\": \"#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nlong long A; int B;\\nint main() {\\n\\tcin >> A >> B;\\n\\tlong long l = max(A - B, 2LL), r = A + B + 1;\\n\\tint p = sqrt(r);\\n\\tvector<long long> f(r - l);\\n\\tvector<bool> ok(r - l, true); vector<int> x(r - l, 999999999);\\n\\tfor (int i = 0; i < r - l; i++) f[i] = l + i;\\n\\tfor (int i = 2; i <= p; i++) {\\n\\t\\tlong long w = l / i * i;\\n\\t\\tif (w < l) w += i;\\n\\t\\tfor (long long j = w; j < r; j += i) {\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\twhile (f[j - l] % i == 0) f[j - l] /= i, cnt++;\\n\\t\\t\\tif (cnt >= 1) {\\n\\t\\t\\t\\tif (x[j - l] < cnt) ok[j - l] = false;\\n\\t\\t\\t\\tx[j - l] = cnt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ret = 0;\\n\\tfor (int i = 0; i < r - l; i++) ret += (ok[i] ? 1 : 0);\\n\\tcout << ret << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 14696,\n \"score_of_the_acc\": -0.7736,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2275_2104611\",\n \"code_snippet\": \"#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nlong long A; int B;\\nint main() {\\n\\tcin >> A >> B;\\n\\tlong long l = max(A - B, 1LL), r = A + B + 1;\\n\\tint p = sqrt(r);\\n\\tvector<long long> f(r - l);\\n\\tvector<bool> ok(r - l, true); vector<int> x(r - l, 999999999);\\n\\tfor (int i = 0; i < r - l; i++) f[i] = l + i;\\n\\tfor (int i = 2; i <= p; i++) {\\n\\t\\tlong long w = l / i * i;\\n\\t\\tif (w < l) w += i;\\n\\t\\tfor (long long j = w; j < r; j += i) {\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\twhile (f[j - l] % i == 0) f[j - l] /= i, cnt++;\\n\\t\\t\\tif (cnt >= 1) {\\n\\t\\t\\t\\tif (x[j - l] < cnt) ok[j - l] = false;\\n\\t\\t\\t\\tx[j - l] = cnt;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ret = 0;\\n\\tfor (int i = 0; i < r - l; i++) ret += (ok[i] ? 1 : 0);\\n\\tcout << ret << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 280,\n \"memory_kb\": 14608,\n \"score_of_the_acc\": -0.7256,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2275_2007777\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\n#define MAX_N 1000007\\nlong long A, B, W[MAX_N], cnt; bool prime[MAX_N];\\nvector<short>V[MAX_N];\\nvoid primesieve() {\\n\\tfor (int i = 2; i*i <= 1000000; i++) {\\n\\t\\tfor (int j = i*i; j <= 1000000; j += i) prime[j] = true;\\n\\t}\\n\\tfor (int i = 0; i <= 1000000; i++)prime[i] ^= true;\\n}\\nint main() {\\n\\tcin >> A >> B; long long L = A - B, R = A + B; primesieve(); if (L <= 0)L = 1;\\n\\tfor (long long i = L; i <= R; i++) { W[i - L] = i; }\\n\\tfor (long long i = 2; i <= 1000000; i++) {\\n\\t\\tif (prime[i] == false)continue;\\n\\t\\tlong long F = (L / i)*i; if ((L%i) > 0)F += i;\\n\\t\\tfor (long long j = F; j <= R; j += i) {\\n\\t\\t\\tint cnts = 0;\\n\\t\\t\\twhile (W[j - L] % i == 0) { W[j - L] /= i; cnts++; }\\n\\t\\t\\tif (cnts >= 1) { V[j - L].push_back(cnts); }\\n\\t\\t}\\n\\t}\\n\\tfor (long long i = L; i <= R; i++) { if (W[i - L] >= 2 && W[i - L] != i)V[i - L].push_back(1); }\\n\\tfor (long long i = L; i <= R; i++) {\\n\\t\\tbool OK = true; if (i <= 1LL)OK = false;\\n\\t\\tfor (int j = 1; j < V[i - L].size(); j++) {\\n\\t\\t\\tif (V[i - L][j - 1] < V[i - L][j])OK = false;\\n\\t\\t}\\n\\t\\tif (OK == true)cnt++;\\n\\t}\\n\\tcout << cnt << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 440,\n \"memory_kb\": 65376,\n \"score_of_the_acc\": -1.9525,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2275_2007771\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\n#define MAX_N 1000007\\nlong long A, B, W[MAX_N], cnt; bool prime[MAX_N];\\nvector<short>V[MAX_N];\\nvoid primesieve() {\\n\\tfor (int i = 2; i*i <= 1000000; i++) {\\n\\t\\tfor (int j = i*i; j <= 1000000; j += i) prime[j] = true;\\n\\t}\\n\\tfor (int i = 0; i <= 1000000; i++)prime[i] ^= true;\\n}\\nint main() {\\n\\tcin >> A >> B; long long L = A - B, R = A + B; primesieve();\\n\\tfor (long long i = L; i <= R; i++) { W[i - L] = i; }\\n\\tfor (long long i = 2; i <= 1000000; i++) {\\n\\t\\tif (prime[i] == false)continue;\\n\\t\\tlong long F = (L / i)*i; if ((L%i) > 0)F += i;\\n\\t\\tfor (long long j = F; j <= R; j += i) {\\n\\t\\t\\tint cnts = 0;\\n\\t\\t\\twhile (W[j - L] % i == 0) { W[j - L] /= i; cnts++; }\\n\\t\\t\\tif (cnts >= 1) { V[j - L].push_back(cnts); }\\n\\t\\t}\\n\\t}\\n\\tfor (long long i = L; i <= R; i++) { if (W[i - L] >= 2 && W[i - L] != i)V[i - L].push_back(1); }\\n\\tfor (long long i = L; i <= R; i++) {\\n\\t\\tbool OK = true;\\n\\t\\tfor (int j = 1; j < V[i - L].size(); j++) {\\n\\t\\t\\tif (V[i - L][j - 1] < V[i - L][j])OK = false;\\n\\t\\t}\\n\\t\\tif (OK == true)cnt++;\\n\\t}\\n\\tcout << cnt << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 450,\n \"memory_kb\": 65436,\n \"score_of_the_acc\": -1.9767,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2275_1262206\",\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\\nbool is_prime[2000000];\\nvector<ll> primes;\\nbool is_fox_number[11000000];\\nint cnt[11000000];\\n\\nvoid Sieve(){\\n\\tfill_n(is_prime,2000000,true);\\n\\tis_prime[0]=is_prime[1]=false;\\n\\tfor(int i=2; i<2000000; ++i){\\n\\t\\tif(is_prime[i]){\\n\\t\\t\\tprimes.push_back(i);\\n\\t\\t\\tfor(int j=i*2; j<2000000; j+=i) is_prime[j]=false;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid Solve(){\\n\\tSieve();\\n\\tll a,b,l,h;\\n\\tcin >> a >> b;\\n\\tl=max(a-b,2LL);\\n\\th=a+b+1;\\n\\n\\tfill_n(is_fox_number,11000000,true);\\n\\tfill_n(cnt,11000000,INF);\\n\\n\\tfor(auto p:primes){\\n\\t\\tll x=(l+p-1)/p*p;\\n\\t\\tif(p*p>h) break;\\n\\t\\twhile(x<h){\\n\\t\\t\\tif(!is_fox_number[x-l]){\\n\\t\\t\\t\\tx+=p;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tll tmp=x;\\n\\t\\t\\tint c=0;\\n\\t\\t\\twhile(tmp%p==0){\\n\\t\\t\\t\\ttmp/=p;\\n\\t\\t\\t\\t++c;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(c>cnt[x-l]) is_fox_number[x-l]=false;\\n\\n\\t\\t\\tcnt[x-l]=c;\\n\\t\\t\\tx+=p;\\n\\t\\t}\\n\\t}\\n\\n\\tint ans=0;\\n\\trep(i,0,h-l) ans+=is_fox_number[i];\\n\\n\\tcout << ans << 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\": 110,\n \"memory_kb\": 58996,\n \"score_of_the_acc\": -1.0776,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2275_1262199\",\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\\nbool is_prime[2000000];\\nvector<ll> primes;\\nbool is_fox_number[11000000];\\nint cnt[11000000];\\n\\nvoid Sieve(){\\n\\tfill_n(is_prime,2000000,true);\\n\\tis_prime[0]=is_prime[1]=false;\\n\\tfor(int i=2; i<2000000; ++i){\\n\\t\\tif(is_prime[i]){\\n\\t\\t\\tprimes.push_back(i);\\n\\t\\t\\tfor(int j=i*2; j<2000000; j+=i) is_prime[j]=false;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid Solve(){\\n\\tSieve();\\n\\tll a,b,l,h;\\n\\tcin >> a >> b;\\n\\tl=max(a-b,2LL);\\n\\th=a+b+1;\\n\\n\\tfill_n(is_fox_number,11000000,true);\\n\\tfill_n(cnt,11000000,INF);\\n\\n\\tfor(auto p:primes){\\n\\t\\tll x=(l+p-1)/p*p;\\n\\t\\t//if(x*x>h) break;\\n\\t\\twhile(x<h){\\n\\t\\t\\tif(!is_fox_number[x-l]){\\n\\t\\t\\t\\tx+=p;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tll tmp=x;\\n\\t\\t\\tint c=0;\\n\\t\\t\\twhile(tmp%p==0){\\n\\t\\t\\t\\ttmp/=p;\\n\\t\\t\\t\\t++c;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(c>cnt[x-l]) is_fox_number[x-l]=false;\\n\\n\\t\\t\\tcnt[x-l]=c;\\n\\t\\t\\tx+=p;\\n\\t\\t}\\n\\t}\\n\\n\\tint ans=0;\\n\\trep(i,0,h-l) ans+=is_fox_number[i];\\n\\n\\tcout << ans << 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\": 120,\n \"memory_kb\": 58160,\n \"score_of_the_acc\": -1.0868,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2275_1262196\",\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\\nbool is_prime[2000000];\\nvector<ll> primes;\\nbool is_fox_number[11000000];\\nint cnt[11000000];\\n\\nvoid Sieve(){\\n\\tfill_n(is_prime,2000000,true);\\n\\tis_prime[0]=is_prime[1]=false;\\n\\tfor(int i=2; i<2000000; ++i){\\n\\t\\tif(is_prime[i]){\\n\\t\\t\\tprimes.push_back(i);\\n\\t\\t\\tfor(int j=i*2; j<2000000; j+=i) is_prime[j]=false;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid Solve(){\\n\\tSieve();\\n\\tll a,b,l,h;\\n\\tcin >> a >> b;\\n\\tl=max(a-b,2LL);\\n\\th=a+b+1;\\n\\n\\tfill_n(is_fox_number,11000000,true);\\n\\tfill_n(cnt,11000000,INF);\\n\\n\\tfor(auto p:primes){\\n\\t\\tll x=(l+p-1)/p*p;\\n\\t\\t//if(x*x>h) break;\\n\\t\\twhile(x<h){\\n\\t\\t\\tif(!is_fox_number[x-l]){\\n\\t\\t\\t\\tx+=p;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tll tmp=x;\\n\\t\\t\\tint c=0;\\n\\t\\t\\twhile(tmp%p==0){\\n\\t\\t\\t\\ttmp/=p;\\n\\t\\t\\t\\t++c;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(c>cnt[x-(a-b)]) is_fox_number[x-l]=false;\\n\\n\\t\\t\\tcnt[x-l]=c;\\n\\t\\t\\tx+=p;\\n\\t\\t}\\n\\t}\\n\\n\\tint ans=0;\\n\\trep(i,0,h-l) ans+=is_fox_number[i];\\n\\n\\tcout << ans << 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\": 0.05555555555555555,\n \"time_ms\": 110,\n \"memory_kb\": 58160,\n \"score_of_the_acc\": -1.0635,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2275_1087370\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <map>\\n#include <algorithm>\\n\\n#define REP(i,n) for(int64_t i=0;i<(int64_t)(n);i++)\\n\\nusing namespace std;\\n\\nbool is_valid(const vector<int>& fct, int64_t n) {\\n int64_t old_h = 0;\\n for (int p : fct) {\\n int cnt = 0;\\n while((n % p) == 0){\\n n /= p;\\n ++cnt;\\n }\\n if (cnt < old_h) return false;\\n old_h = cnt;\\n }\\n return true;\\n}\\n\\nint main() {\\n int64_t a, b;\\n cin >> a >> b;\\n int64_t beg = max(a - b, int64_t(2));\\n int64_t ed = a + b;\\n vector<vector<int>> pl2(1000001);\\n vector<int> ps(1100001,1);\\n ps[0] = ps[1] = 0;\\n int64_t i;\\n for (i = 2; i * i * i * i <= ed; ++i) {\\n if (ps[i] == 1) {\\n int64_t offset = (i - (beg % i)) % i;\\n for (int64_t k = offset; k <= 1000000; k += i) {\\n pl2[k].push_back(i);\\n }\\n for (int64_t j = i * 2; j * j <= ed; j += i) {\\n ps[j] = i;\\n }\\n }\\n }\\n for (; i * i <= ed; ++i) {\\n if (ps[i] == 1) {\\n int64_t offset = (i - (beg % i)) % i;\\n for (int64_t k = offset; k <= 1000000; k += i) {\\n pl2[k].push_back(i);\\n }\\n for (int64_t j = i * 2; j * j <= ed; j += i) {\\n ps[j] = i;\\n }\\n }\\n }\\n int64_t cnt = 0;\\n for (int64_t i = 0; i <= ed - beg; ++i) {\\n auto fct = pl2[i];\\n sort(begin(fct),end(fct),greater<int64_t>());\\n if (is_valid(fct, beg+i)) {\\n ++cnt;\\n }\\n }\\n cout << cnt << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 63608,\n \"score_of_the_acc\": -1.9692,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2275_1049244\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nint main(){\\n const int N=1100000;\\n static bool cmp[N+1]={true,true};\\n for(int i=2;i<=N;i++){\\n if(!cmp[i]){\\n for(int j=i*2;j<=N;j+=i){\\n\\tcmp[j]=true;\\n }\\n }\\n }\\n static int le[1000001];\\n fill(begin(le),end(le),1<<29);\\n long long A,B;\\n cin>>A>>B;\\n for(int i=0;i<=N;i++){\\n if(!cmp[i]){\\n for(long long j=max<long long>(i,(A-B+i-1)/i*i);j<=A+B;j+=i){\\n\\tint x=j-(A-B);\\n\\tint e=0;\\n\\tfor(long long c=j;c%i==0;c/=i,e++);\\n\\tle[x]=(le[x]>=e)?e:-1;\\n }\\n }\\n }\\n int ans=0;\\n for(int i=0;i<B*2+1;i++){\\n ans+=i+A-B>=2&&le[i]>0;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 6144,\n \"score_of_the_acc\": -0.1878,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2275_1049229\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nint main(){\\n const int N=1000000;\\n static bool cmp[N+1]={true,true};\\n for(int i=2;i<=N;i++){\\n if(!cmp[i]){\\n for(int j=i*2;j<=N;j+=i){\\n\\tcmp[j]=true;\\n }\\n }\\n }\\n static int le[1000001];\\n fill(begin(le),end(le),1<<29);\\n long long A,B;\\n cin>>A>>B;\\n for(int i=0;i<=N;i++){\\n if(!cmp[i]){\\n for(long long j=(A-B+i-1)/i*i;j<=A+B;j+=i){\\n\\tint x=j-(A-B);\\n\\tint e=0;\\n\\tfor(long long c=j;c%i==0;c/=i,e++);\\n\\tle[x]=(le[x]>=e)?e:-1;\\n }\\n }\\n }\\n int ans=0;\\n for(int i=0;i<B*2+1;i++){\\n ans+=le[i]>0;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 100,\n \"memory_kb\": 6044,\n \"score_of_the_acc\": -0.1629,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2275_1049225\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nint main(){\\n static bool cmp[1000001]={true,true};\\n for(int i=2;i<=1000000;i++){\\n if(!cmp[i]){\\n for(int j=i*2;j<=1000000;j+=i){\\n\\tcmp[j]=true;\\n }\\n }\\n }\\n static int le[1000001];\\n fill(begin(le),end(le),1<<29);\\n long long A,B;\\n cin>>A>>B;\\n for(int i=0;i<=1000000;i++){\\n if(!cmp[i]){\\n for(long long j=(A-B+i-1)/i*i;j<=A+B;j+=i){\\n\\tint x=j-(A-B);\\n\\tint e=0;\\n\\tfor(long long c=j;c%i==0;c/=i,e++);\\n\\tle[x]=(le[x]>=e)?e:-1;\\n }\\n }\\n }\\n int ans=0;\\n for(int i=0;i<B*2+1;i++){\\n ans+=le[i]>0;\\n }\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 100,\n \"memory_kb\": 6044,\n \"score_of_the_acc\": -0.1629,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2275_1007718\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nint dm[1100000];\\nint m[1100000];\\nint isp[1100000];\\nint prime[1100000];\\nint main(){\\n\\tint sz=0;\\n\\tisp[0]=isp[1]=-1;\\n\\tfor(int i=2;i<1100000;i++){\\n\\t\\tif(~isp[i]){\\n\\t\\t\\tisp[i]=1;\\n\\t\\t\\tprime[sz++]=i;\\n\\t\\t\\tfor(int j=i+i;j<1100000;j+=i)isp[j]=-1;\\n\\t\\t}\\n\\t}\\n\\tlong long a,b;scanf(\\\"%lld%lld\\\",&a,&b);\\n\\tlong long L=max(1LL,a-b);\\n\\tlong long R=a+b;\\n\\tint n=R-L+1;\\n\\tfor(int i=0;i<n;i++)m[i]=9999999;\\n\\tfor(int i=1;(long long)prime[i]*prime[i]<=R;i++){\\n\\t\\tint E=prime[i-1];\\n\\t\\tfor(long long j=(L+E-1)/E*E;j<=R;j+=E){\\n\\t\\t\\tlong long now=j;\\n\\t\\t\\tint time=0;\\n\\t\\t\\twhile(now%E==0){\\n\\t\\t\\t\\tnow/=E;time++;\\n\\t\\t\\t}\\n\\t\\t\\tm[j-L]=min(m[j-L],time);\\n\\t\\t}\\n\\t\\tint D=prime[i];\\n\\t\\tlong long S=L/D/D*D*D;\\n\\t\\tlong long T=R/D/D*D*D;\\n\\t\\twhile(S<L)S+=(long long)D*D;\\n\\t\\twhile(T>R)T-=(long long)D*D;\\n\\t\\tfor(long long j=S;j<=T;j+=(long long)D*D){\\n\\t\\t\\tlong long now=j;\\n\\t\\t\\tint time=0;\\n\\t\\t\\twhile(now%D==0){\\n\\t\\t\\t\\tnow/=D;time++;\\n\\t\\t\\t}\\n\\t\\t\\tif(m[j-L]<time){\\n\\t\\t\\t//\\tprintf(\\\"%lld %d\\\\n\\\",j,i);\\n\\t\\t\\t\\tdm[j-L]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ret=n;\\n\\tif(L==1LL)dm[0]=1;\\n\\tfor(int i=0;i<n;i++)if(dm[i])ret--;\\n\\tprintf(\\\"%d\\\\n\\\",ret);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 14064,\n \"score_of_the_acc\": -0.3444,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2275_1007714\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nint dm[1100000];\\nint m[1100000];\\nint isp[1100000];\\nint prime[1100000];\\nint main(){\\n\\tint sz=0;\\n\\tisp[0]=isp[1]=-1;\\n\\tfor(int i=2;i<1100000;i++){\\n\\t\\tif(~isp[i]){\\n\\t\\t\\tisp[i]=1;\\n\\t\\t\\tprime[sz++]=i;\\n\\t\\t\\tfor(int j=i+i;j<1100000;j+=i)isp[j]=-1;\\n\\t\\t}\\n\\t}\\n\\tlong long a,b;scanf(\\\"%lld%lld\\\",&a,&b);\\n\\tlong long L=max(1LL,a-b);\\n\\tlong long R=a+b;\\n\\tint n=R-L+1;\\n\\tfor(int i=0;i<n;i++)m[i]=9999999;\\n\\tfor(int i=1;(long long)prime[i]*prime[i]<=R;i++){\\n\\t\\tint E=prime[i-1];\\n\\t\\tfor(long long j=(L+E-1)/E*E;j<=R;j+=E){\\n\\t\\t\\tlong long now=j;\\n\\t\\t\\tint time=0;\\n\\t\\t\\twhile(now%E==0){\\n\\t\\t\\t\\tnow/=E;time++;\\n\\t\\t\\t}\\n\\t\\t\\tm[j-L]=min(m[j-L],time);\\n\\t\\t}\\n\\t\\tint D=prime[i];\\n\\t\\tlong long S=L/D/D*D*D;\\n\\t\\tlong long T=R/D/D*D*D;\\n\\t\\twhile(S<L)S+=(long long)D*D;\\n\\t\\twhile(T>R)T-=(long long)D*D;\\n\\t\\tfor(long long j=S;j<=T;j+=(long long)D*D){\\n\\t\\t\\tlong long now=j;\\n\\t\\t\\tint time=0;\\n\\t\\t\\twhile(now%D==0){\\n\\t\\t\\t\\tnow/=D;time++;\\n\\t\\t\\t}\\n\\t\\t\\tif(m[j-L]<time){\\n\\t\\t\\t//\\tprintf(\\\"%lld %d\\\\n\\\",j,i);\\n\\t\\t\\t\\tdm[j-L]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ret=n;\\n\\tfor(int i=0;i<n;i++)if(dm[i])ret--;\\n\\tprintf(\\\"%d\\\\n\\\",ret);\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 110,\n \"memory_kb\": 14064,\n \"score_of_the_acc\": -0.3211,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2275_1007706\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nlong long d[1100000];\\nint dm[1100000];\\nint m[1100000];\\nint isp[1100000];\\nint prime[1100000];\\nint main(){\\n\\tint sz=0;\\n\\tisp[0]=isp[1]=-1;\\n\\tfor(int i=2;i<1100000;i++){\\n\\t\\tif(~isp[i]){\\n\\t\\t\\tisp[i]=1;\\n\\t\\t\\tprime[sz++]=i;\\n\\t\\t\\tfor(int j=i+i;j<1100000;j+=i)isp[j]=-1;\\n\\t\\t}\\n\\t}\\n\\tlong long a,b;scanf(\\\"%lld%lld\\\",&a,&b);\\n\\tlong long L=max(1LL,a-b);\\n\\tlong long R=a+b;\\n\\tint n=R-L+1;\\n\\tfor(int i=0;i<n;i++)d[i]=L+i;\\n\\tfor(int i=0;i<n;i++)m[i]=9999999;\\n\\tfor(int i=1;(long long)prime[i]*prime[i]<=R;i++){\\n\\t\\tint E=prime[i-1];\\n\\t\\tfor(long long j=(L+E-1)/E*E;j<=R;j+=E){\\n\\t\\t\\tlong long now=j;\\n\\t\\t\\tint time=0;\\n\\t\\t\\twhile(now%E==0){\\n\\t\\t\\t\\tnow/=E;time++;\\n\\t\\t\\t}\\n\\t\\t\\tm[j-L]=min(m[j-L],time);\\n\\t\\t}\\n\\t\\tint D=prime[i];\\n\\t\\tlong long S=L/D/D*D*D;\\n\\t\\tlong long T=R/D/D*D*D;\\n\\t\\twhile(S<L)S+=(long long)D*D;\\n\\t\\twhile(T>R)T-=(long long)D*D;\\n\\t\\tlong long div=(long long )D*D;\\n\\t\\tfor(long long j=S;j<=T;j+=(long long)D*D){\\n\\t\\t\\tlong long now=j;\\n\\t\\t\\tint time=0;\\n\\t\\t\\twhile(now%D==0){\\n\\t\\t\\t\\tnow/=D;time++;\\n\\t\\t\\t}\\n\\t\\t\\tif(m[j-L]<time){\\n\\t\\t\\t//\\tprintf(\\\"%lld %d\\\\n\\\",j,i);\\n\\t\\t\\t\\tdm[j-L]=1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ret=n;\\n\\tfor(int i=0;i<n;i++)if(dm[i])ret--;\\n\\tprintf(\\\"%d\\\\n\\\",ret);\\n}\",\n \"accuracy\": 0.027777777777777776,\n \"time_ms\": 120,\n \"memory_kb\": 22268,\n \"score_of_the_acc\": -0.4825,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2275_507324\",\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; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\nint count_fox_number(ll a, ll b){\\n if(a < 2) a = 2;\\n if(!(a < b)) return 0;\\n int ans = b - a;\\n bool prime_small[1000100];\\n for(int i = 2; (ll) i * i < b; i++) prime_small[i] = true;\\n int cnt_pow[1000100];\\n REP(i, b - a) cnt_pow[i] = INF;\\n for(int i = 2; (ll)i * i < b; i++){\\n if(prime_small[i]){\\n for(int j = 2 * i; (ll) j * j < b; j += i) prime_small[j] = false;\\n for(ll j = max(2LL, (a + i - 1)/i) * i; j < b; j += i){\\n if(cnt_pow[j - a] == -1) continue;\\n ll t = j;\\n int cnt = 0;\\n while(t % i == 0){\\n t /= i;\\n cnt++;\\n }\\n assert(cnt != 0);\\n if(cnt_pow[j - a] < cnt){\\n cnt_pow[j - a] = -1;\\n ans--;\\n }else{\\n cnt_pow[j - a] = cnt;\\n }\\n }\\n }\\n }\\n return ans;\\n}\\n\\nint main(){\\n ll a, b;\\n while(cin>>a>>b){\\n cout<<count_fox_number(a - b, a + b + 1)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 6040,\n \"score_of_the_acc\": -0.1628,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2275_507322\",\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; }\\ninline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }\\n\\ntypedef long long ll;\\nconst int INF = 100000000;\\nconst double EPS = 1e-8;\\nconst int MOD = 1000000007;\\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\nint count_fox_number(ll a, ll b){\\n if(a < 2) a = 2;\\n if(!(a < b)) return 0;\\n int ans = b - a;\\n bool prime_small[1000100] = {};\\n //for(int i = 2; (ll) i * i < b; i++) prime_small[i] = true;\\n int cnt_pow[1000100];\\n REP(i, b - a) cnt_pow[i] = INF;\\n for(int i = 2; (ll)i * i < b; i++){\\n if(!prime_small[i]){\\n for(int j = 2 * i; (ll) j * j < b; j += i) prime_small[j] = true;\\n for(ll j = max(2LL, (a + i - 1)/i) * i; j < b; j += i){\\n if(cnt_pow[j - a] == -1) continue;\\n ll t = j;\\n int cnt = 0;\\n while(t % i == 0){\\n t /= i;\\n cnt++;\\n }\\n assert(cnt != 0);\\n if(cnt_pow[j - a] < cnt){\\n cnt_pow[j - a] = -1;\\n ans--;\\n }else{\\n cnt_pow[j - a] = cnt;\\n }\\n }\\n }\\n }\\n return ans;\\n}\\n\\nint main(){\\n ll a, b;\\n while(cin>>a>>b){\\n cout<<count_fox_number(a - b, a + b + 1)<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 6052,\n \"score_of_the_acc\": -0.2095,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2275_419707\",\n \"code_snippet\": \"#include <iostream>\\n#include <fstream>\\n#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <cctype>\\n#include <cmath>\\n#include <complex>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n#include <deque>\\n#include <iomanip>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <sstream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n\\n#pragma comment(linker, \\\"/STACK:400000000\\\")\\n\\n#define EPS 1e-9\\n#define INF MOD\\n#define MOD 1000000007LL\\n#define fir first\\n#define foreach(it,X) for(it=X.begin();it!=X.end();it++)\\n#define iss istringstream\\n#define ite iterator\\n#define ll long long\\n#define mp make_pair\\n#define rep(i,n) rep2(i,0,n)\\n#define rep2(i,m,n) for(int i=m;i<n;i++)\\n#define pi pair<int,int>\\n#define pb push_back\\n#define sec second\\n#define sh(i) (1LL<<i)\\n#define sst stringstream\\n#define sz size()\\n#define vi vector<int>\\n#define vc vector\\n#define vl vector<ll>\\n#define vs vector<string>\\n\\nbool isp[1000011];\\nint last[1000011];\\nll cur[1000011];\\nll A,B,a,b;\\n\\nint main(){\\n\\tcin>>A>>B;\\n\\ta=max(2LL,A-B);\\n\\tb=A+B;\\n\\tfill(isp,isp+1000011,1);\\n\\tfill(last,last+2*B+1,INF);\\n\\tfor(ll i=a;i<=b;i++)cur[i-a]=i;\\n\\tfor(ll i=2;i*i<=b;i++){\\n\\t\\tif(isp[i]){\\n\\t\\t\\tfor(ll j=2*i;j*j<=b;j+=i) isp[j]=0;\\n\\t\\t\\tfor(ll j=max(2LL,(a+i-1)/i)*i;j<=b;j+=i){\\n\\t\\t\\t\\tif(last[j-a]>-1){\\n\\t\\t\\t\\t\\tint y=0;\\n\\t\\t\\t\\t\\twhile(cur[j-a]%i==0)cur[j-a]/=i,y++;\\n\\t\\t\\t\\t\\tif(last[j-a]<y)last[j-a]=-1;\\n\\t\\t\\t\\t\\telse last[j-a]=y;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans=0;\\n\\tfor(ll i=a;i<=b;i++)ans+=last[i-a]>-1;\\n\\tcout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 13000,\n \"score_of_the_acc\": -0.8381,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1266,"cells":{"group_id":{"kind":"string","value":"aoj_2277_cpp"},"problem_description":{"kind":"string","value":"問題 G\nXOR 回路\n問題文\n計算機科学実験及演習 3\nは CAD を用いて CPU を設計する授業である．CPU は多くの回路を組み合わせなければ動かず，その中の 1 つに\nn\nビット入力の XOR 回路がある．ここで XOR 回路とは，入力ビット列\nx\n1\nx\n2\n...x\nn\nに対して，\nx\n1\n+ x\n2\n+ ... + x\nn\n\\ (mod 2)\nを出力する回路のことを言う．しかし完璧に動作する XOR 回路を設計するのは時間がかかるので，とりあえず\nn\nビットのうち\nk\nビットだけ使う XOR 回路 A を作ることにした．つまり，ある\ni\n1\n, ... , i\nk\nが存在し，回路 A は\nx\ni\n1\n+ x\ni\n2\n+ ... + x\ni\nk\n\\ (mod 2)\nを出力する．\n暫く後に今度は\nk\nビット入力の XOR 回路が欲しくなった．何だ簡単ではないか．先ほどの回路 A を使えばよい．ただ残念なことに，回路 A がどの\nk\nビットを使っていたのか忘れてしまった上に，回路 A の設計図も間違って削除してしまった．しかしコンパイル済みの回路 A は残っている．なので，入力\nx\n1\nx\n2\n...x\nn\nを入れて回路 A を実行することで，その出力\nx\ni\n1\n+ x\ni\n2\n+ ... + x\ni\nk\n\\ (mod 2)\nを見ることは出来る．\n出来るだけ作業の時間を短くしたいので，回路 A の実行回数には上限を設定することにしよう．どうすれば回路Aが依存しているビット\ni\n1\n, ... , i\nk\nを見つけられるだろうか？\n入出力\n最初に\nn\nと\nk\nがスペース区切りで与えられる．以降，プログラムは回路 A に入力を与え，その出力を読むことが出来る．例えば C/C++ で回路 A にビット列\nx\n1\nx\n2\n...x\nn\nを与えるには\nprintf(\"?\nx\n1\nx\n2\n...x\nn\n\\n\"); fflush(stdout);\nとする．ここで各\nx\ni\nの間にスペースをいれてはならない．\n次に，\nscanf(\"%d\", &v);\nとすると\nv\nに対応する出力\nx\ni\n1\n+ x\ni\n2\n+ ... + x\ni\nk\n\\ (mod 2)\nが入る．\n最終的に回路 A が依存するビット\ni\n1\n,...,i\nk\nを出力するには\nprintf(\"!\ni\n1\ni\n2\n...i\nk\n\\n\"); fflush(stdout);\nとする．ここで各\ni\nj\nの間はスペースを丁度 1 つずついれる．\n制約\n1 ≤ n ≤ 10,000\n1 ≤ k ≤ min(10, n)\n各データセットごとに，回路 A の実行回数の上限は 200 回であり，それを超えると誤答 (\nQuery Limit Exceeded\n) と判定される．\n入出力例\n入力例 1\n以下の例はプログラムの入出力の例である．左の列はプログラムの出力，右の列はプログラムへの入力を時系列順に示している．最初に\nn k\nが入力として与えられる．ここでは\nn = 2, k = 1\nである．次に回路 A に\n00\nという入力をいれると，回路 A は\n0\nを返した．次に回路 A に\n01\nという入力をいれると，回路 A は再び\n0\nを返した．このことから回路 A は\n1\nビット目のみ利用していることが分かり，プログラムは\n1\nを解答として出力した．\nプログラムの出力\nプログラムへの入力\n2 1\n?00\n0\n?01\n0\n!1\n入力例 2\n以下の例では，\nn = 2, k = 2\nであり，直ちに回路 A が\n1\nビット目と\n2\nビット目の両方を利用していることが分かる．よってプログラムは\n1\nと\n2\nを解答として出力した．\nプログラムの出力\nプログラムへの入力\n2 2\n!1 2"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2277_10851253","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint n, k, qq[10005], ans[10005];\n\nint ask(int lf = 0, int rg = n - 1){\n cout << \"?\";\n for(int i = 0; i < n; i ++)\n cout << ((lf <= i && i <= rg) ? qq[i] : 0);\n cout << endl;\n\n int rs; cin >> rs;\n return rs;\n}\n\nvoid print_ans(){\n cout << \"!\"; bool first = 0;\n for(int i = 0; i < n; i ++) if(ans[i]){\n\t\t\t\tif(i > 0) cout << \" \"; first = 1;\n \t\t\tcout << i + 1;\n }\n cout << endl;\n\n exit(0);\n}\n\nint main(){\n srand(time(NULL));\n cin >> n >> k;\n\n if(n == k){\n for(int i = 0; i < n; i ++) ans[i] = 1;\n print_ans();\n }\n\n for(int times = 0; times < k; times ++){\n do{\n for(int i = 0; i < n; i ++)\n qq[i] = ans[i] ? 0 : (rand() & 1);\n }while(!ask());\n\n int lf = 0, rg = n - 1, rs = n;\n for(int md; lf <= rg;){\n md = (lf + rg) / 2;\n if(ask(lf, md)){\n rs = md;\n rg = md - 1;\n }\n else lf = md + 1;\n }\n\n ans[rs] = 1;\n }\n\n print_ans();\n}","accuracy":1,"time_ms":60,"memory_kb":3496,"score_of_the_acc":-1.0435,"final_rank":12},{"submission_id":"aoj_2277_4300652","code_snippet":"#include <iostream>\n#include <cmath>\n#include <numeric>\n#include <algorithm>\n#include <deque>\n#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n#include <iomanip>\n#include <map>\n#include <stack>\n#include <queue>\n#include <functional>\n#include <climits>\n#include <numeric>\n#include <bitset>\n#include <random>\n#include <tuple>\n#include <initializer_list>\n#include <fstream>\n\nvoid ask(const std::vector<int>& bits, int from, int until) {\n\tstd::cout << '?';\n\tfor (auto i = 0; i < from; ++i) std::cout << '0';\n\twhile (from < until) std::cout << bits[from++];\n\tfor (auto i = until; i < bits.size(); ++i) std::cout << '0';\n\tstd::cout << std::endl;\n}\n\nint main() {\n\tint n, k; std::cin >> n >> k;\n\tstd::vector<int> bits(n), confirmed;\n\tstd::mt19937 rand;\n\twhile (confirmed.size() < k) {\n\t\tfor (auto& b : bits) b = rand() & 1;\n\t\tfor (const auto c : confirmed) bits[c - 1] = 0;\n\t\task(bits, 0, bits.size());\n\t\tint response; std::cin >> response;\n\t\tif (response == 0) continue;\n\t\tint min = 0, max = bits.size() ;\n\t\twhile (min < max) {\n\t\t\tconst auto mid = (min + max) / 2;\n\t\t\tif (mid == 0) {\n\t\t\t\tmin = mid + 1; continue;\n\t\t\t}\n\t\t\task(bits, 0, mid);\n\t\t\tstd::cin >> response;\n\t\t\tif (response == 1) {\n\t\t\t\tmax = mid;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tmin = mid + 1;\n\t\t\t}\n\t\t}\n\t\tconfirmed.push_back(max);\n\t}\n\tstd::sort(confirmed.begin(), confirmed.end());\n\tstd::cout << '!';\n\tfor (auto i = 0; i < confirmed.size(); ++i) {\n\t\tif (i != 0) std::cout << ' ';\n\t\tstd::cout << confirmed[i];\n\t}\n\tstd::cout << std::endl;\n}","accuracy":1,"time_ms":70,"memory_kb":3256,"score_of_the_acc":-0.9857,"final_rank":11},{"submission_id":"aoj_2277_1469132","code_snippet":"#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<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 = 10000;\nconst int MAX_K = 10;\nconst int MAX_Q = 200;\n\n/* typedef */\n\ntypedef vector<int> vi;\ntypedef vector<long long> vl;\ntypedef vector<double> vd;\ntypedef pair<int,int> pii;\ntypedef pair<long,long> pll;\ntypedef long long ll;\n\n/* global variables */\n\nint n, k;\nbool xs[MAX_N], used[MAX_N];\n\n/* subroutines */\n\nbool ask(int i0 = 0, int i1 = n) {\n putchar('?');\n for (int i = 0; i < n; i++)\n printf(\"%d\", (i0 <= i && i < i1) ? xs[i] : 0);\n putchar('\\n');\n\n int ans;\n cin >> ans;\n return (bool)ans;\n}\n\nvoid putans() {\n bool first = true;\n\n putchar('!');\n for (int i = 0; i < n; i++)\n if (used[i]) {\n if (i > 0) putchar(' ');\n printf(\"%d\", i + 1);\n }\n putchar('\\n');\n \n}\n\n/* main */\n\nint main() {\n srand(time(NULL));\n\n cin >> n >> k;\n\n if (n == k) {\n for (int i = 0; i < n; i++) used[i] = true;\n putans();\n return 0;\n }\n \n memset(used, false, sizeof(used));\n int m = 0;\n\n while (m < k) {\n do {\n for (int i = 0; i < n; i++)\n\txs[i] = used[i] ? 0 : (rand() & 1);\n } while (! ask());\n\n int i0 = 0, i1 = n;\n\n while (i0 + 1 < i1) {\n int im = (i0 + i1) / 2;\n if (ask(i0, im)) i1 = im;\n else i0 = im;\n }\n\n used[i0] = true;\n m++;\n }\n\n putans();\n \n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":1296,"score_of_the_acc":-0.6533,"final_rank":10},{"submission_id":"aoj_2277_1054303","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\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();}\ntemplate<class T> inline T sqr(T x) {return x*x;}\n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\ntypedef long long ll;\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 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 range(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) range(i,0,n)\n#define clr(a,b) memset((a), (b) ,sizeof(a))\n#define dump(x) cerr << #x << \" = \" << (x) << endl;\n#define debug(x) cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << \" \" << __FILE__ << endl;\n\nconst double eps = 1e-10;\nconst double pi = acos(-1.0);\nconst ll INF =1LL << 62;\nconst int inf =1 << 29;\n\nint n,k;\n\nbool used[10010];\n\nint check(string s){\n\tint l=0,r=n;\n\twhile(r-l>1){\n\n\t\tint m=(l+r)/2;\n\t\tstring next;\n\n\t\tfor(int i=0;i<n;++i){\n\t\t\tif(l<=i&&i<m)\n\t\t\t\tnext+=s[i];\n\t\t\telse\n\t\t\t\tnext+=\"0\";\n\t\t}\n\n\t\tprintf(\"?%s\\n\",next.c_str());\n\t\tfflush(stdout);\n\t\tint res;\n\t\tscanf(\"%d\",&res);\n\n\t\tif(res)\n\t\t\tr=m;\n\t\telse\n\t\t\tl=m;\n\t}\n\treturn l;\n}\n\nint main(void){\n\tsrand(time(NULL));\n\tscanf(\"%d %d\",&n,&k);\n\tint num=0;\n\twhile(num<k){\n\t\tstring verify=\"\";\n\t\trep(i,n){\n\t\t\tif(used[i])\n\t\t\t\tverify+=\"0\";\n\t\t\telse\n\t\t\t\tverify+=(rand()&1?\"1\":\"0\");\n\t\t}\n\t\tprintf(\"?%s\\n\",verify.c_str());\n\t\tfflush(stdout);\n\t\tint res;\n\t\tscanf(\"%d\",&res);\n\n\t\tif(res){\n\t\t\tused[check(verify)]=true;\n\t\t\tnum++;\n\t\t}\n\t}\n\tstring ans=\"\";\n\tbool first=true;\n\trep(i,n){\n\t\tif(used[i]){\n\t\t\tif(first)\n\t\t\t\tfirst=false;\n\t\t\telse\n\t\t\t\tans+=\" \";\n\t\t\tans+=toString(i+1);\n\t\t}\n\t}\n\tprintf(\"!%s\\n\",ans.c_str()); \n\tfflush(stdout);\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":1308,"score_of_the_acc":-0.4285,"final_rank":6},{"submission_id":"aoj_2277_898524","code_snippet":"#include<iostream>\n#include<set>\n#include<cstdlib>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\n\nset<int> used;\nint n, k;\n\nvoid solve2(string str) {\n int cnt = 0;\n rep (i, n) if (str[i] == '1') ++cnt;\n if (cnt == 1) {\n rep (i, n) if (str[i] == '1') {\n used.insert(i);\n return;\n }\n }\n string s;\n rep (i, n) {\n if (str[i] == '1' && rand() % 2) s += \"1\";\n else s += \"0\";\n }\n cout << \"?\" + s << endl;\n cout.flush();\n int t;\n cin >> t;\n if (t == 1) {\n solve2(s);\n } else {\n rep (i, n) if (str[i] == '1') s[i] ^= '0' ^ '1';\n solve2(s);\n }\n}\n\nvoid solve() {\n while (true) {\n string str;\n rep (i, n) {\n str += rand() % 2 ? \"1\" : \"0\";\n if (used.count(i)) str[str.size() - 1] = '0';\n }\n cout << \"?\" + str << endl;\n cout.flush();\n int t;\n cin >> t;\n if (t == 1) {\n solve2(str);\n return;\n }\n }\n}\n\nint main() {\n cin >> n >> k;\n rep (i, k) solve();\n for (set<int>::iterator itr = used.begin(); itr != used.end(); ++itr) {\n if (itr == used.begin()) cout << \"!\";\n else cout << \" \";\n cout << *itr + 1;\n }\n cout << endl;\n}","accuracy":1,"time_ms":80,"memory_kb":1772,"score_of_the_acc":-0.5721,"final_rank":9},{"submission_id":"aoj_2277_651012","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[100000];\nint ret[10];\nint val[10000];\nint used[10000];\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tint at=0;\n\tif(a<200){\n\t\tfor(int i=0;i<a;i++){\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif(i==j)str[j]='1';\n\t\t\t\telse str[j]='0';\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tint c;\n\t\t\tscanf(\"%d\",&c);\n\t\t\tif(c)ret[at++]=i+1;\n\t\t}\n\t\tprintf(\"!\");\n\t\tfor(int i=0;i<b;i++){\n\t\t\tprintf(\"%d\",ret[i]);\n\t\t\tif(i<b-1)printf(\" \");\n\t\t\telse printf(\"\\n\");\n\t\t}\n\t\tfflush(stdout);\n\t\treturn 0;\n\t}\n\tfor(int i=0;i<a;i++)val[i]=i;\n\tint n=a/2;\n\tfor(int i=0;i<b;i++){\n\t\tint d=0;\n\t\tdo{\n\t\t\tfor(int j=0;j<50000;j++){\n\t\t\t\tint l=rand()%a;\n\t\t\t\tint r=rand()%a;\n\t\t\t\tint z=val[l];\n\t\t\t\tval[l]=val[r];\n\t\t\t\tval[r]=z;\n\t\t\t}\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<n;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t}while(!d);\n\t\tint left=-1;\n\t\tint right=n+1;\n\t\twhile(left+1<right){\n\t\t\tint M=(left+right)/2;\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<M;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t\tif(d)right=M;\n\t\t\telse left=M;\n\t\t}\n\t\tint V=0;\n\t\tint P=0;\n\t\tfor(int j=0;V<right;j++){\n\t\t\tif(!used[val[j]]){\n\t\t\t//\tstr[val[j]]='1';\n\t\t\t\tV++;P=j;\n\t\t\t}\n\t\t}\n\t\tused[val[P]]=1;\n\t\tret[at++]=val[P]+1;\n\t}std::sort(ret,ret+b);\n\tprintf(\"!\");\n\tfor(int i=0;i<b;i++){\n\t\tprintf(\"%d\",ret[i]);\n\t\tif(i<b-1)printf(\" \");\n\t\telse printf(\"\\n\");\n\t}\n\tfflush(stdout);\n}","accuracy":1,"time_ms":110,"memory_kb":1296,"score_of_the_acc":-0.4685,"final_rank":8},{"submission_id":"aoj_2277_651000","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[100000];\nint ret[10];\nint val[10000];\nint used[10000];\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tint at=0;\n\tif(a<200){\n\t\tfor(int i=0;i<a;i++){\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif(i==j)str[j]='1';\n\t\t\t\telse str[j]='0';\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tint c;\n\t\t\tscanf(\"%d\",&c);\n\t\t\tif(c)ret[at++]=i+1;\n\t\t}\n\t\tprintf(\"!\");\n\t\tfor(int i=0;i<b;i++){\n\t\t\tprintf(\"%d\",ret[i]);\n\t\t\tif(i<b-1)printf(\" \");\n\t\t\telse printf(\"\\n\");\n\t\t}\n\t\tfflush(stdout);\n\t\treturn 0;\n\t}\n\tfor(int i=0;i<a;i++)val[i]=i;\n\tint n=a/2;\n\tfor(int i=0;i<b;i++){\n\t\tint d=0;\n\t\tdo{\n\t\t\tfor(int j=0;j<50000;j++){\n\t\t\t\tint l=rand()%a;\n\t\t\t\tint r=rand()%a;\n\t\t\t\tint z=val[l];\n\t\t\t\tval[l]=val[r];\n\t\t\t\tval[r]=z;\n\t\t\t}\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<n;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t}while(!d);\n\t\tint left=0;\n\t\tint right=n+1;\n\t\twhile(left+1<right){\n\t\t\tint M=(left+right)/2;\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<M;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t\tif(d)right=M;\n\t\t\telse left=M;\n\t\t}\n\t\tused[val[left]]=1;\n\t\tret[at++]=val[left]+1;\n\t}std::sort(ret,ret+b);\n\tprintf(\"!\");\n\tfor(int i=0;i<b;i++){\n\t\tprintf(\"%d\",ret[i]);\n\t\tif(i<b-1)printf(\" \");\n\t\telse printf(\"\\n\");\n\t}\n\tfflush(stdout);\n}","accuracy":0.0975609756097561,"time_ms":70,"memory_kb":1280,"score_of_the_acc":-0.4205,"final_rank":17},{"submission_id":"aoj_2277_650998","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[100000];\nint ret[10];\nint val[10000];\nint used[10000];\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tint at=0;\n\tif(a<200){\n\t\tfor(int i=0;i<a;i++){\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif(i==j)str[j]='1';\n\t\t\t\telse str[j]='0';\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tint c;\n\t\t\tscanf(\"%d\",&c);\n\t\t\tif(c)ret[at++]=i+1;\n\t\t}\n\t\tprintf(\"!\");\n\t\tfor(int i=0;i<b;i++){\n\t\t\tprintf(\"%d\",ret[i]);\n\t\t\tif(i<b-1)printf(\" \");\n\t\t\telse printf(\"\\n\");\n\t\t}\n\t\tfflush(stdout);\n\t\treturn 0;\n\t}\n\tfor(int i=0;i<a;i++)val[i]=i;\n\tint n=a/2;\n\tfor(int i=0;i<b;i++){\n\t\tint d=0;\n\t\tdo{\n\t\t\tfor(int j=0;j<50000;j++){\n\t\t\t\tint l=rand()%a;\n\t\t\t\tint r=rand()%a;\n\t\t\t\tint z=val[l];\n\t\t\t\tval[l]=val[r];\n\t\t\t\tval[r]=z;\n\t\t\t}\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<n;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t}while(!d);\n\t\tint left=0;\n\t\tint right=n;\n\t\twhile(left+1<right){\n\t\t\tint M=(left+right)/2;\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<M;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t\tif(d)right=M;\n\t\t\telse left=M;\n\t\t}\n\t\tused[val[left]]=1;\n\t\tret[at++]=val[left]+1;\n\t}std::sort(ret,ret+b);\n\tprintf(\"!\");\n\tfor(int i=0;i<b;i++){\n\t\tprintf(\"%d\",ret[i]);\n\t\tif(i<b-1)printf(\" \");\n\t\telse printf(\"\\n\");\n\t}\n\tfflush(stdout);\n}","accuracy":0.0975609756097561,"time_ms":60,"memory_kb":1280,"score_of_the_acc":-0.4096,"final_rank":14},{"submission_id":"aoj_2277_650997","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[100000];\nint ret[10];\nint val[10000];\nint used[10000];\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tint at=0;\n\tif(a<200){\n\t\tfor(int i=0;i<a;i++){\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif(i==j)str[j]='1';\n\t\t\t\telse str[j]='0';\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tint c;\n\t\t\tscanf(\"%d\",&c);\n\t\t\tif(c)ret[at++]=i+1;\n\t\t}\n\t\tprintf(\"!\");\n\t\tfor(int i=0;i<b;i++){\n\t\t\tprintf(\"%d\",ret[i]);\n\t\t\tif(i<b-1)printf(\" \");\n\t\t\telse printf(\"\\n\");\n\t\t}\n\t\tfflush(stdout);\n\t\treturn 0;\n\t}\n\tfor(int i=0;i<a;i++)val[i]=i;\n\tint n=a/2;\n\tfor(int i=0;i<b;i++){\n\t\tint d=0;\n\t\tdo{\n\t\t\tfor(int j=0;j<50000;j++){\n\t\t\t\tint l=rand()%a;\n\t\t\t\tint r=rand()%a;\n\t\t\t\tint z=val[l];\n\t\t\t\tval[l]=val[r];\n\t\t\t\tval[r]=z;\n\t\t\t}\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<n;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t}while(!d);\n\t\tint left=0;\n\t\tint right=n;\n\t\twhile(left+1<right){\n\t\t\tint M=(left+right)/2;\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<M;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t\tif(d)right=M;\n\t\t\telse left=M;\n\t\t}\n\t\tused[val[left]]=1;\n\t\tret[at++]=val[left]+1;\n\t}\n\tprintf(\"!\");\n\tfor(int i=0;i<b;i++){\n\t\tprintf(\"%d\",ret[i]);\n\t\tif(i<b-1)printf(\" \");\n\t\telse printf(\"\\n\");\n\t}\n\tfflush(stdout);\n}","accuracy":0.0975609756097561,"time_ms":60,"memory_kb":1280,"score_of_the_acc":-0.4096,"final_rank":14},{"submission_id":"aoj_2277_650996","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[100000];\nint ret[10];\nint val[10000];\nint used[10000];\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tint at=0;\n\tif(a<200){\n\t\tfor(int i=0;i<a;i++){\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif(i==j)str[j]='1';\n\t\t\t\telse str[j]='0';\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tint c;\n\t\t\tscanf(\"%d\",&c);\n\t\t\tif(c)ret[at++]=i+1;\n\t\t}\n\t\tprintf(\"!\");\n\t\tfor(int i=0;i<b;i++){\n\t\t\tprintf(\"%d\",ret[i]);\n\t\t\tif(i<b-1)printf(\" \");\n\t\t\telse printf(\"\\n\");\n\t\t}\n\t\tfflush(stdout);\n\t\treturn 0;\n\t}\n\tfor(int i=0;i<a;i++)val[i]=i;\n\tint n=a/2;\n\tfor(int i=0;i<b;i++){\n\t\tint d=0;\n\t\tdo{\n\t\t\tfor(int j=0;j<50000;j++){\n\t\t\t\tint l=rand()%a;\n\t\t\t\tint r=rand()%a;\n\t\t\t\tint z=val[l];\n\t\t\t\tval[l]=val[r];\n\t\t\t\tval[r]=z;\n\t\t\t}\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<n;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t}while(!d);\n\t\tint left=0;\n\t\tint right=n;\n\t\twhile(left+1<right){\n\t\t\tint M=(left+right)/2;\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<M;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t\tif(d)right=M;\n\t\t\telse left=M+1;\n\t\t}\n\t\tused[val[left]]=1;\n\t\tret[at++]=val[left]+1;\n\t}\n\tprintf(\"!\");\n\tfor(int i=0;i<b;i++){\n\t\tprintf(\"%d\",ret[i]);\n\t\tif(i<b-1)printf(\" \");\n\t\telse printf(\"\\n\");\n\t}\n\tfflush(stdout);\n}","accuracy":0.0975609756097561,"time_ms":70,"memory_kb":1280,"score_of_the_acc":-0.4205,"final_rank":17},{"submission_id":"aoj_2277_650995","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[100000];\nint ret[10];\nint val[10000];\nint used[10000];\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tint at=0;\n\tif(a<200){\n\t\tfor(int i=0;i<a;i++){\n\t\t\tfor(int j=0;j<a;j++){\n\t\t\t\tif(i==j)str[j]='1';\n\t\t\t\telse str[j]='0';\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tint c;\n\t\t\tscanf(\"%d\",&c);\n\t\t\tif(c)ret[at++]=i+1;\n\t\t}\n\t\tprintf(\"!\");\n\t\tfor(int i=0;i<b;i++){\n\t\t\tprintf(\"%d\",ret[i]);\n\t\t\tif(i<b-1)printf(\" \");\n\t\t\telse printf(\"\\n\");\n\t\t}\n\t\tfflush(stdout);\n\t\treturn 0;\n\t}\n\tfor(int i=0;i<a;i++)val[i]=i;\n\tint n=a/2;\n\tfor(int i=0;i<b;i++){\n\t\tint d=0;\n\t\tdo{\n\t\t\tfor(int j=0;j<50000;j++){\n\t\t\t\tint l=rand()%a;\n\t\t\t\tint r=rand()%a;\n\t\t\t\tint z=val[l];\n\t\t\t\tval[l]=val[r];\n\t\t\t\tval[r]=z;\n\t\t\t}\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<n;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t}while(!d);\n\t\tint left=0;\n\t\tint right=n;\n\t\twhile(left+1<right){\n\t\t\tint M=(left+right)/2;\n\t\t\tfor(int j=0;j<a;j++)str[j]='0';\n\t\t\tint ind=0;\n\t\t\tfor(int j=0;ind<M;j++){\n\t\t\t\tif(!used[val[j]]){\n\t\t\t\t\tstr[val[j]]='1';\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tprintf(\"?%s\\n\",str);\n\t\t\tfflush(stdout);\n\t\t\tscanf(\"%d\",&d);\n\t\t\tif(d)right=M;\n\t\t\telse left=M+1;\n\t\t}\n\t\tused[left]=1;\n\t\tret[at++]=left+1;\n\t}\n\tprintf(\"!\");\n\tfor(int i=0;i<b;i++){\n\t\tprintf(\"%d\",ret[i]);\n\t\tif(i<b-1)printf(\" \");\n\t\telse printf(\"\\n\");\n\t}\n\tfflush(stdout);\n}","accuracy":0.0975609756097561,"time_ms":60,"memory_kb":1280,"score_of_the_acc":-0.4096,"final_rank":14},{"submission_id":"aoj_2277_523648","code_snippet":"#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <fstream>\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\nunsigned long xor128(){\n static unsigned long x=123456789,y=362436069,z=521288629,w=88675123;\n unsigned long t;\n t=(x^(x<<11));x=y;y=z;z=w; return( w=(w^(w>>19))^(t^(t>>8)) );\n}\n\nint n;\n\nint func(bitset<10000> query)\n{\n cout << '?';\n for(int i=0; i<n; ++i){\n if(query[i])\n cout << '1';\n else\n cout << '0';\n }\n cout << endl;\n\n int ret;\n cin >> ret;\n return ret;\n}\n\n\nint main()\n{\n int k;\n cin >> n >> k;\n\n bitset<10000> ret;\n\n while(--k >= 0){\n int m = 0;\n bitset<10000> query;\n for(int i=0; i<n; ++i){\n query[i] = (xor128() % 2 == 1) && !ret[i];\n if(query[i])\n ++ m;\n }\n\n if(func(query) == 0){\n ++ k;\n continue;\n }\n\n while(m > 1){\n bitset<10000> query2;\n int m2 = 0;\n for(int i=0; i<n; ++i){\n if(query[i] && m2 < m / 2){\n query2[i] = true;\n ++ m2;\n }\n }\n\n if(func(query2) == 1){\n query = query2;\n m = m2;\n }else{\n query ^= query2;\n m -= m2;\n }\n }\n\n ret |= query;\n }\n\n bool first = true;\n for(int i=0; i<n; ++i){\n if(ret[i]){\n if(first){\n cout << '!' << (i+1);\n first = false;\n }else{\n cout << ' ' << (i+1);\n }\n }\n }\n cout << endl;\n\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":860,"score_of_the_acc":-0.3547,"final_rank":4},{"submission_id":"aoj_2277_467848","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\nbool ok[10000];\nbool t[10000];\n\nint n, k;\n\nvoid get1() {\n memset(t,0,sizeof(t));\n while(1) { \n REP(i,n) if (!ok[i]) t[i] = rand()%2;\n printf(\"?\");\n REP(i,n) printf(\"%d\",t[i]);\n puts(\"\"); fflush(stdout);\n int v;\n scanf(\"%d\",&v);\n if (v) return;\n }\n}\n\nbool check(int a, int b) {\n printf(\"?\"); \n REP(i,n) printf(\"%d\",(i>=a&&i<b)?t[i]:0);\n puts(\"\"); fflush(stdout);\n int v;\n scanf(\"%d\", &v);\n return v;\n}\n\nint main() {\n scanf(\"%d%d\",&n,&k);\n vector<int> v;\n REP(i,k) {\n int a = 0, b = n;\n get1();\n while(a+1<b) {\n int mid = (a+b)/2;\n if (check(a, mid)) b = mid;\n else a = mid;\n }\n ok[a] = 1;\n v.push_back(a+1);\n }\n printf(\"!\");\n REP(i,v.size()) {\n if (i) printf(\" \");\n printf(\"%d\", v[i]);\n }\n puts(\"\");\n fflush(stdout);\n}","accuracy":1,"time_ms":170,"memory_kb":952,"score_of_the_acc":-0.4354,"final_rank":7},{"submission_id":"aoj_2277_331928","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<algorithm>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nint dfs(int l,int r,int n,const int *bit){\n\tif(l==r-1) return l;\n\n\tputchar('?');\n\trep(i,n){\n\t\tif (l<=i && i<(l+r)/2) putchar('0'+bit[i]);\n\t\telse if(i<=(l+r)/2 && i<r) putchar('0');\n\t\telse putchar('0');\n\t}\n\tputchar('\\n'); fflush(stdout);\n\n\tint v; scanf(\"%d\",&v);\n\treturn v?dfs(l,(l+r)/2,n,bit):dfs((l+r)/2,r,n,bit);\n}\n\nint main(){\n\tsrand(777);\n\tint n,k; scanf(\"%d%d\",&n,&k);\n\tint ans[10];\n\trep(t,k){\n\t\tint bit[10000];\n\t\twhile(1){\n\t\t\tputchar('?');\n\t\t\trep(i,n){\n\t\t\t\tif(count(ans,ans+t,i)) bit[i]=0;\n\t\t\t\telse bit[i]=rand()&1;\n\t\t\t\tputchar('0'+bit[i]);\n\t\t\t}\n\t\t\tputchar('\\n'); fflush(stdout);\n\n\t\t\tint v; scanf(\"%d\",&v);\n\t\t\tif(v) break;\n\t\t}\n\n\t\tans[t]=dfs(0,n,n,bit);\n\t}\n\n\tprintf(\"!\");\n\trep(t,k) printf(\"%d%c\",ans[t]+1,t<k-1?' ':'\\n');\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":780,"score_of_the_acc":-0.2557,"final_rank":3},{"submission_id":"aoj_2277_301280","code_snippet":"#include <cstdio>\n#include <cstdlib>\n#include <queue>\n#include <ctime>\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n\ninline int getInt(){ int s; scanf(\"%d\", &s); return s; }\n\nusing namespace std;\n\nint x[10000];\nint n, k;\nint ans[10];\n\nint query(){\n printf(\"?\");\n REP(i,n) printf(\"%d\", x[i]);\n printf(\"\\n\");\n fflush(stdout);\n return getInt();\n}\n\nint main(){\n srand(time(NULL));\n\n n = getInt();\n k = getInt();\n\n REP(i, k){\n do{\n // Random\n REP(j, n) x[j] = rand() % 2;\n REP(j, i) x[ans[j] - 1] = 0;\n }while(query() == 0);\n\n vector<int> ones;\n REP(j, n) if(x[j] == 1) ones.push_back(j);\n\n while(ones.size() != 1){\n int m = ones.size() / 2;\n\n REP(j, n) x[j] = 0;\n REP(j, m) x[ones[j]] = 1;\n\n if(query() == 1){\n\tones = vector<int>(ones.begin(), ones.begin() + m);\n }else{\n\tones = vector<int>(ones.begin() + m, ones.end());\n }\n }\n\n ans[i] = ones[0] + 1;\n }\n\n printf(\"!\");\n REP(i,k) printf(\"%d%c\", ans[i], i == k - 1 ? '\\n' : ' ');\n fflush(stdout);\n\n return 0;\n}","accuracy":1,"time_ms":160,"memory_kb":924,"score_of_the_acc":-0.4165,"final_rank":5},{"submission_id":"aoj_2277_268966","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\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\nint n, k;\nbool exist[10010];\nbool target[10010];\nchar output[10010];\n\nint Communicate() {\n printf(\"%s\\n\", output);\n fflush(stdout);\n int v;\n scanf(\"%d\", &v);\n return v;\n}\n\nint UpdateTarget(int c) {\n int index = -1;\n REP(i, n) {\n if (!target[i]) { continue; }\n if (output[i + 1] == '0' + c) { target[i] = false; }\n if (index == -2 || !target[i]) { continue; }\n else if (index == -1) { index = i; }\n else { index = -2; }\n }\n assert(index != -1);\n return index;\n}\n\nvoid RandomSequence() {\n output[0] = '?';\n REP(i, n) {\n if (!target[i]) { output[i + 1] = '0'; }\n else { output[i + 1] = '0' + (rand() % 2 ? 1 : 0); }\n }\n output[n + 1] = '\\0';\n}\n\nint main() {\n scanf(\"%d %d\", &n, &k);\n MEMSET(exist, false);\n REP(i, k) {\n REP(j, n) { target[j] = !exist[j]; }\n while (true) {\n RandomSequence();\n if (Communicate()) { break; }\n }\n int prev = 0;\n while (true) {\n int index = UpdateTarget(prev);\n if (index >= 0) {\n exist[index] = true;\n break;\n }\n RandomSequence();\n prev = Communicate() == 0 ? 1 : 0;\n }\n }\n\n vector<int> ans;\n REP(i, n) { if (exist[i]) { ans.push_back(i + 1); } }\n printf(\"!\");\n REP(i, k) {\n if (i != 0) {\n putchar(' ');\n }\n printf(\"%d\", ans[i]);\n }\n puts(\"\");\n fflush(stdout);\n}","accuracy":1,"time_ms":30,"memory_kb":0,"score_of_the_acc":-0.0109,"final_rank":2},{"submission_id":"aoj_2277_253612","code_snippet":"#include<cstdio>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n int n,k,v;\n int x[10000],a[10];\n bool use[10000];\n\n scanf(\"%d %d\",&n,&k);\n\n if(n==k){\n for(int i=0;i<k;i++)a[i] = i;\n }else{\n for(int i=0;i<n;i++)use[i] = false;\n while(k--){\n for(int i=0;i<n;i++)x[i] = 1&i;\n while(1){\n\tbool f = true;\n\tfor(int i=0;i<n;i++){\n\t if(use[i] && x[i])f = false;\n\t}\n\tif(f){\n\t printf(\"?\");\n\t for(int i=0;i<n;i++)printf(\"%d\",x[i]);\n\t printf(\"\\n\");\n\t fflush(stdout);\n\t scanf(\"%d\",&v);\n\t if(v)break;\n\t}\n\trandom_shuffle(x,x+n);\n }\n vector<int> cand;\n for(int i=0;i<n;i++){\n\tif(x[i])cand.push_back(i);\n }\n\n while(cand.size()!=1){\n\tvector<int> c1,c2;\n\tfor(int i=0;i<(int)cand.size()/2;i++)c1.push_back(cand[i]);\n\tfor(int i=(int)cand.size()/2;i<(int)cand.size();i++)c2.push_back(cand[i]);\n\tcand.clear();\n\n\tfor(int i=0;i<n;i++)x[i] = 0;\n\tfor(int i=0;i<(int)c1.size();i++)x[c1[i]] = 1;\n\n\tprintf(\"?\");\n\tfor(int i=0;i<n;i++)printf(\"%d\",x[i]);\n\tprintf(\"\\n\");\n\tfflush(stdout);\n\tscanf(\"%d\",&v);\n\tif(v){\n\t for(int i=0;i<(int)c1.size();i++)cand.push_back(c1[i]);\n\t}else{\n\t for(int i=0;i<(int)c2.size();i++)cand.push_back(c2[i]);\n\t}\n }\n use[cand[0]] = true;\n }\n k = 0;\n for(int i=0;i<n;i++){\n if(use[i])a[k++] = i;\n }\n }\n\n printf(\"!%d\",a[0]+1);\n for(int i=1;i<k;i++)printf(\" %d\",a[i]+1);\n printf(\"\\n\");\n fflush(stdout);\n}","accuracy":1,"time_ms":940,"memory_kb":940,"score_of_the_acc":-1.2689,"final_rank":13},{"submission_id":"aoj_2277_252476","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <stdio.h>\nusing namespace std;\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\nint ac[10001];\n\nint last = -1;\nint suff[10001];\nint N,K;\n\nvector<int> answer(10);\n\nstring gen(vector<int> &g,int l,int r){\n\tstring w = string(N,'0');\n\tfor(int i = l ; i < r ; i++) if( !ac[ g[i] ] ) w[ g[i] ] = '1';\n\treturn w;\n}\n\nstring gen2(){\n\tstring w = string(N,'0');\n\tfor(int i = 0 ; i < N ; i++) if( !ac[i] ) w[i] = '0' + suff[i];\n\treturn w;\n}\n\nint get(string s){\n\tcout << \"?\" << s << endl;\n\tfflush(stdout);\n\tint ans = 0;\n\t//rep(i,K) ans += s[answer[i]] - '0';\n\tcin >> ans;\n\tfflush(stdout);\n\n\treturn ans%2;\n}\n\n\nint odd(vector<int> &g,int l ,int r){\n\tif(l+1 == r){\n\t\tac[g[l]] = true;\n\t\tlast = g[l];\n\t\treturn 0;\n\t}\n\tint m = (l+r)/2;\n\tif( get(gen(g,l,m)) == 1){\n\t\todd(g,l,m);\n\t}else{\n\t\todd(g,m,r);\n\t}\n}\nint even(){\n\tfor(int i = 0 ; i < 200 ; i++){\n\t\tif(get(gen2()) == 1) break;\n\t\trandom_shuffle(suff,suff+N);\n\t}\n\tvector<int> a;\n\tstring w = gen2();\n\trep(i,N) if(w[i] == '1') a.push_back(i);\n\todd(a,0,a.size());\n}\nint main(){\n\tint k;\n\tcin >> N >> k;\n\t//K = k;\n\t//rep(i,K) cin >> answer[i];\n\tvector<int> awawa;\n\tfor(int i = 0 ; i < N ; i++) awawa.push_back(i);\n\tfor(int i = 0 ; i < N ; i++) suff[i] = i%2;\n\twhile(k){\n\t\tif(k%2){\n\t\t\todd(awawa,0,awawa.size());\n\t\t}else{\n\t\t\teven();\t\n\t\t}\n\t\tawawa.erase(remove(awawa.begin(),awawa.end(),last),awawa.end());\n\t\tk--;\n\t}\n\tvector<int> ans;\n\trep(i,N) if(ac[i])ans.push_back(i+1);\n\tcout << \"!\";\n\trep(i,ans.size()) cout << (i?\" \":\"\") << ans[i];\n\tcout << endl;\n\tfflush(stdout);\n}","accuracy":1,"time_ms":20,"memory_kb":0,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2277_10851253\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint n, k, qq[10005], ans[10005];\\n\\nint ask(int lf = 0, int rg = n - 1){\\n cout << \\\"?\\\";\\n for(int i = 0; i < n; i ++)\\n cout << ((lf <= i && i <= rg) ? qq[i] : 0);\\n cout << endl;\\n\\n int rs; cin >> rs;\\n return rs;\\n}\\n\\nvoid print_ans(){\\n cout << \\\"!\\\"; bool first = 0;\\n for(int i = 0; i < n; i ++) if(ans[i]){\\n\\t\\t\\t\\tif(i > 0) cout << \\\" \\\"; first = 1;\\n \\t\\t\\tcout << i + 1;\\n }\\n cout << endl;\\n\\n exit(0);\\n}\\n\\nint main(){\\n srand(time(NULL));\\n cin >> n >> k;\\n\\n if(n == k){\\n for(int i = 0; i < n; i ++) ans[i] = 1;\\n print_ans();\\n }\\n\\n for(int times = 0; times < k; times ++){\\n do{\\n for(int i = 0; i < n; i ++)\\n qq[i] = ans[i] ? 0 : (rand() & 1);\\n }while(!ask());\\n\\n int lf = 0, rg = n - 1, rs = n;\\n for(int md; lf <= rg;){\\n md = (lf + rg) / 2;\\n if(ask(lf, md)){\\n rs = md;\\n rg = md - 1;\\n }\\n else lf = md + 1;\\n }\\n\\n ans[rs] = 1;\\n }\\n\\n print_ans();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -1.0435,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2277_4300652\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <numeric>\\n#include <algorithm>\\n#include <deque>\\n#include <vector>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <iomanip>\\n#include <map>\\n#include <stack>\\n#include <queue>\\n#include <functional>\\n#include <climits>\\n#include <numeric>\\n#include <bitset>\\n#include <random>\\n#include <tuple>\\n#include <initializer_list>\\n#include <fstream>\\n\\nvoid ask(const std::vector<int>& bits, int from, int until) {\\n\\tstd::cout << '?';\\n\\tfor (auto i = 0; i < from; ++i) std::cout << '0';\\n\\twhile (from < until) std::cout << bits[from++];\\n\\tfor (auto i = until; i < bits.size(); ++i) std::cout << '0';\\n\\tstd::cout << std::endl;\\n}\\n\\nint main() {\\n\\tint n, k; std::cin >> n >> k;\\n\\tstd::vector<int> bits(n), confirmed;\\n\\tstd::mt19937 rand;\\n\\twhile (confirmed.size() < k) {\\n\\t\\tfor (auto& b : bits) b = rand() & 1;\\n\\t\\tfor (const auto c : confirmed) bits[c - 1] = 0;\\n\\t\\task(bits, 0, bits.size());\\n\\t\\tint response; std::cin >> response;\\n\\t\\tif (response == 0) continue;\\n\\t\\tint min = 0, max = bits.size() ;\\n\\t\\twhile (min < max) {\\n\\t\\t\\tconst auto mid = (min + max) / 2;\\n\\t\\t\\tif (mid == 0) {\\n\\t\\t\\t\\tmin = mid + 1; continue;\\n\\t\\t\\t}\\n\\t\\t\\task(bits, 0, mid);\\n\\t\\t\\tstd::cin >> response;\\n\\t\\t\\tif (response == 1) {\\n\\t\\t\\t\\tmax = mid;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tmin = mid + 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconfirmed.push_back(max);\\n\\t}\\n\\tstd::sort(confirmed.begin(), confirmed.end());\\n\\tstd::cout << '!';\\n\\tfor (auto i = 0; i < confirmed.size(); ++i) {\\n\\t\\tif (i != 0) std::cout << ' ';\\n\\t\\tstd::cout << confirmed[i];\\n\\t}\\n\\tstd::cout << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -0.9857,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2277_1469132\",\n \"code_snippet\": \"#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<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 = 10000;\\nconst int MAX_K = 10;\\nconst int MAX_Q = 200;\\n\\n/* typedef */\\n\\ntypedef vector<int> vi;\\ntypedef vector<long long> vl;\\ntypedef vector<double> vd;\\ntypedef pair<int,int> pii;\\ntypedef pair<long,long> pll;\\ntypedef long long ll;\\n\\n/* global variables */\\n\\nint n, k;\\nbool xs[MAX_N], used[MAX_N];\\n\\n/* subroutines */\\n\\nbool ask(int i0 = 0, int i1 = n) {\\n putchar('?');\\n for (int i = 0; i < n; i++)\\n printf(\\\"%d\\\", (i0 <= i && i < i1) ? xs[i] : 0);\\n putchar('\\\\n');\\n\\n int ans;\\n cin >> ans;\\n return (bool)ans;\\n}\\n\\nvoid putans() {\\n bool first = true;\\n\\n putchar('!');\\n for (int i = 0; i < n; i++)\\n if (used[i]) {\\n if (i > 0) putchar(' ');\\n printf(\\\"%d\\\", i + 1);\\n }\\n putchar('\\\\n');\\n \\n}\\n\\n/* main */\\n\\nint main() {\\n srand(time(NULL));\\n\\n cin >> n >> k;\\n\\n if (n == k) {\\n for (int i = 0; i < n; i++) used[i] = true;\\n putans();\\n return 0;\\n }\\n \\n memset(used, false, sizeof(used));\\n int m = 0;\\n\\n while (m < k) {\\n do {\\n for (int i = 0; i < n; i++)\\n\\txs[i] = used[i] ? 0 : (rand() & 1);\\n } while (! ask());\\n\\n int i0 = 0, i1 = n;\\n\\n while (i0 + 1 < i1) {\\n int im = (i0 + i1) / 2;\\n if (ask(i0, im)) i1 = im;\\n else i0 = im;\\n }\\n\\n used[i0] = true;\\n m++;\\n }\\n\\n putans();\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 1296,\n \"score_of_the_acc\": -0.6533,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2277_1054303\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\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();}\\ntemplate<class T> inline T sqr(T x) {return x*x;}\\n\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<string> vs;\\ntypedef pair<int, int> pii;\\ntypedef long long ll;\\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 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 range(i,a,b) for(int i=(a);i<(b);++i)\\n#define rep(i,n) range(i,0,n)\\n#define clr(a,b) memset((a), (b) ,sizeof(a))\\n#define dump(x) cerr << #x << \\\" = \\\" << (x) << endl;\\n#define debug(x) cerr << #x << \\\" = \\\" << (x) << \\\" (L\\\" << __LINE__ << \\\")\\\" << \\\" \\\" << __FILE__ << endl;\\n\\nconst double eps = 1e-10;\\nconst double pi = acos(-1.0);\\nconst ll INF =1LL << 62;\\nconst int inf =1 << 29;\\n\\nint n,k;\\n\\nbool used[10010];\\n\\nint check(string s){\\n\\tint l=0,r=n;\\n\\twhile(r-l>1){\\n\\n\\t\\tint m=(l+r)/2;\\n\\t\\tstring next;\\n\\n\\t\\tfor(int i=0;i<n;++i){\\n\\t\\t\\tif(l<=i&&i<m)\\n\\t\\t\\t\\tnext+=s[i];\\n\\t\\t\\telse\\n\\t\\t\\t\\tnext+=\\\"0\\\";\\n\\t\\t}\\n\\n\\t\\tprintf(\\\"?%s\\\\n\\\",next.c_str());\\n\\t\\tfflush(stdout);\\n\\t\\tint res;\\n\\t\\tscanf(\\\"%d\\\",&res);\\n\\n\\t\\tif(res)\\n\\t\\t\\tr=m;\\n\\t\\telse\\n\\t\\t\\tl=m;\\n\\t}\\n\\treturn l;\\n}\\n\\nint main(void){\\n\\tsrand(time(NULL));\\n\\tscanf(\\\"%d %d\\\",&n,&k);\\n\\tint num=0;\\n\\twhile(num<k){\\n\\t\\tstring verify=\\\"\\\";\\n\\t\\trep(i,n){\\n\\t\\t\\tif(used[i])\\n\\t\\t\\t\\tverify+=\\\"0\\\";\\n\\t\\t\\telse\\n\\t\\t\\t\\tverify+=(rand()&1?\\\"1\\\":\\\"0\\\");\\n\\t\\t}\\n\\t\\tprintf(\\\"?%s\\\\n\\\",verify.c_str());\\n\\t\\tfflush(stdout);\\n\\t\\tint res;\\n\\t\\tscanf(\\\"%d\\\",&res);\\n\\n\\t\\tif(res){\\n\\t\\t\\tused[check(verify)]=true;\\n\\t\\t\\tnum++;\\n\\t\\t}\\n\\t}\\n\\tstring ans=\\\"\\\";\\n\\tbool first=true;\\n\\trep(i,n){\\n\\t\\tif(used[i]){\\n\\t\\t\\tif(first)\\n\\t\\t\\t\\tfirst=false;\\n\\t\\t\\telse\\n\\t\\t\\t\\tans+=\\\" \\\";\\n\\t\\t\\tans+=toString(i+1);\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"!%s\\\\n\\\",ans.c_str()); \\n\\tfflush(stdout);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 1308,\n \"score_of_the_acc\": -0.4285,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2277_898524\",\n \"code_snippet\": \"#include<iostream>\\n#include<set>\\n#include<cstdlib>\\n\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < int(n); ++i)\\n\\nset<int> used;\\nint n, k;\\n\\nvoid solve2(string str) {\\n int cnt = 0;\\n rep (i, n) if (str[i] == '1') ++cnt;\\n if (cnt == 1) {\\n rep (i, n) if (str[i] == '1') {\\n used.insert(i);\\n return;\\n }\\n }\\n string s;\\n rep (i, n) {\\n if (str[i] == '1' && rand() % 2) s += \\\"1\\\";\\n else s += \\\"0\\\";\\n }\\n cout << \\\"?\\\" + s << endl;\\n cout.flush();\\n int t;\\n cin >> t;\\n if (t == 1) {\\n solve2(s);\\n } else {\\n rep (i, n) if (str[i] == '1') s[i] ^= '0' ^ '1';\\n solve2(s);\\n }\\n}\\n\\nvoid solve() {\\n while (true) {\\n string str;\\n rep (i, n) {\\n str += rand() % 2 ? \\\"1\\\" : \\\"0\\\";\\n if (used.count(i)) str[str.size() - 1] = '0';\\n }\\n cout << \\\"?\\\" + str << endl;\\n cout.flush();\\n int t;\\n cin >> t;\\n if (t == 1) {\\n solve2(str);\\n return;\\n }\\n }\\n}\\n\\nint main() {\\n cin >> n >> k;\\n rep (i, k) solve();\\n for (set<int>::iterator itr = used.begin(); itr != used.end(); ++itr) {\\n if (itr == used.begin()) cout << \\\"!\\\";\\n else cout << \\\" \\\";\\n cout << *itr + 1;\\n }\\n cout << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 1772,\n \"score_of_the_acc\": -0.5721,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2277_651012\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[100000];\\nint ret[10];\\nint val[10000];\\nint used[10000];\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tint at=0;\\n\\tif(a<200){\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tfor(int j=0;j<a;j++){\\n\\t\\t\\t\\tif(i==j)str[j]='1';\\n\\t\\t\\t\\telse str[j]='0';\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tint c;\\n\\t\\t\\tscanf(\\\"%d\\\",&c);\\n\\t\\t\\tif(c)ret[at++]=i+1;\\n\\t\\t}\\n\\t\\tprintf(\\\"!\\\");\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\t\\telse printf(\\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\tfflush(stdout);\\n\\t\\treturn 0;\\n\\t}\\n\\tfor(int i=0;i<a;i++)val[i]=i;\\n\\tint n=a/2;\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tint d=0;\\n\\t\\tdo{\\n\\t\\t\\tfor(int j=0;j<50000;j++){\\n\\t\\t\\t\\tint l=rand()%a;\\n\\t\\t\\t\\tint r=rand()%a;\\n\\t\\t\\t\\tint z=val[l];\\n\\t\\t\\t\\tval[l]=val[r];\\n\\t\\t\\t\\tval[r]=z;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<n;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t}while(!d);\\n\\t\\tint left=-1;\\n\\t\\tint right=n+1;\\n\\t\\twhile(left+1<right){\\n\\t\\t\\tint M=(left+right)/2;\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<M;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t\\tif(d)right=M;\\n\\t\\t\\telse left=M;\\n\\t\\t}\\n\\t\\tint V=0;\\n\\t\\tint P=0;\\n\\t\\tfor(int j=0;V<right;j++){\\n\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t//\\tstr[val[j]]='1';\\n\\t\\t\\t\\tV++;P=j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tused[val[P]]=1;\\n\\t\\tret[at++]=val[P]+1;\\n\\t}std::sort(ret,ret+b);\\n\\tprintf(\\\"!\\\");\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\telse printf(\\\"\\\\n\\\");\\n\\t}\\n\\tfflush(stdout);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 1296,\n \"score_of_the_acc\": -0.4685,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2277_651000\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[100000];\\nint ret[10];\\nint val[10000];\\nint used[10000];\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tint at=0;\\n\\tif(a<200){\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tfor(int j=0;j<a;j++){\\n\\t\\t\\t\\tif(i==j)str[j]='1';\\n\\t\\t\\t\\telse str[j]='0';\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tint c;\\n\\t\\t\\tscanf(\\\"%d\\\",&c);\\n\\t\\t\\tif(c)ret[at++]=i+1;\\n\\t\\t}\\n\\t\\tprintf(\\\"!\\\");\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\t\\telse printf(\\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\tfflush(stdout);\\n\\t\\treturn 0;\\n\\t}\\n\\tfor(int i=0;i<a;i++)val[i]=i;\\n\\tint n=a/2;\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tint d=0;\\n\\t\\tdo{\\n\\t\\t\\tfor(int j=0;j<50000;j++){\\n\\t\\t\\t\\tint l=rand()%a;\\n\\t\\t\\t\\tint r=rand()%a;\\n\\t\\t\\t\\tint z=val[l];\\n\\t\\t\\t\\tval[l]=val[r];\\n\\t\\t\\t\\tval[r]=z;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<n;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t}while(!d);\\n\\t\\tint left=0;\\n\\t\\tint right=n+1;\\n\\t\\twhile(left+1<right){\\n\\t\\t\\tint M=(left+right)/2;\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<M;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t\\tif(d)right=M;\\n\\t\\t\\telse left=M;\\n\\t\\t}\\n\\t\\tused[val[left]]=1;\\n\\t\\tret[at++]=val[left]+1;\\n\\t}std::sort(ret,ret+b);\\n\\tprintf(\\\"!\\\");\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\telse printf(\\\"\\\\n\\\");\\n\\t}\\n\\tfflush(stdout);\\n}\",\n \"accuracy\": 0.0975609756097561,\n \"time_ms\": 70,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.4205,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2277_650998\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[100000];\\nint ret[10];\\nint val[10000];\\nint used[10000];\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tint at=0;\\n\\tif(a<200){\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tfor(int j=0;j<a;j++){\\n\\t\\t\\t\\tif(i==j)str[j]='1';\\n\\t\\t\\t\\telse str[j]='0';\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tint c;\\n\\t\\t\\tscanf(\\\"%d\\\",&c);\\n\\t\\t\\tif(c)ret[at++]=i+1;\\n\\t\\t}\\n\\t\\tprintf(\\\"!\\\");\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\t\\telse printf(\\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\tfflush(stdout);\\n\\t\\treturn 0;\\n\\t}\\n\\tfor(int i=0;i<a;i++)val[i]=i;\\n\\tint n=a/2;\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tint d=0;\\n\\t\\tdo{\\n\\t\\t\\tfor(int j=0;j<50000;j++){\\n\\t\\t\\t\\tint l=rand()%a;\\n\\t\\t\\t\\tint r=rand()%a;\\n\\t\\t\\t\\tint z=val[l];\\n\\t\\t\\t\\tval[l]=val[r];\\n\\t\\t\\t\\tval[r]=z;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<n;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t}while(!d);\\n\\t\\tint left=0;\\n\\t\\tint right=n;\\n\\t\\twhile(left+1<right){\\n\\t\\t\\tint M=(left+right)/2;\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<M;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t\\tif(d)right=M;\\n\\t\\t\\telse left=M;\\n\\t\\t}\\n\\t\\tused[val[left]]=1;\\n\\t\\tret[at++]=val[left]+1;\\n\\t}std::sort(ret,ret+b);\\n\\tprintf(\\\"!\\\");\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\telse printf(\\\"\\\\n\\\");\\n\\t}\\n\\tfflush(stdout);\\n}\",\n \"accuracy\": 0.0975609756097561,\n \"time_ms\": 60,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.4096,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2277_650997\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[100000];\\nint ret[10];\\nint val[10000];\\nint used[10000];\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tint at=0;\\n\\tif(a<200){\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tfor(int j=0;j<a;j++){\\n\\t\\t\\t\\tif(i==j)str[j]='1';\\n\\t\\t\\t\\telse str[j]='0';\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tint c;\\n\\t\\t\\tscanf(\\\"%d\\\",&c);\\n\\t\\t\\tif(c)ret[at++]=i+1;\\n\\t\\t}\\n\\t\\tprintf(\\\"!\\\");\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\t\\telse printf(\\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\tfflush(stdout);\\n\\t\\treturn 0;\\n\\t}\\n\\tfor(int i=0;i<a;i++)val[i]=i;\\n\\tint n=a/2;\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tint d=0;\\n\\t\\tdo{\\n\\t\\t\\tfor(int j=0;j<50000;j++){\\n\\t\\t\\t\\tint l=rand()%a;\\n\\t\\t\\t\\tint r=rand()%a;\\n\\t\\t\\t\\tint z=val[l];\\n\\t\\t\\t\\tval[l]=val[r];\\n\\t\\t\\t\\tval[r]=z;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<n;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t}while(!d);\\n\\t\\tint left=0;\\n\\t\\tint right=n;\\n\\t\\twhile(left+1<right){\\n\\t\\t\\tint M=(left+right)/2;\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<M;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t\\tif(d)right=M;\\n\\t\\t\\telse left=M;\\n\\t\\t}\\n\\t\\tused[val[left]]=1;\\n\\t\\tret[at++]=val[left]+1;\\n\\t}\\n\\tprintf(\\\"!\\\");\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\telse printf(\\\"\\\\n\\\");\\n\\t}\\n\\tfflush(stdout);\\n}\",\n \"accuracy\": 0.0975609756097561,\n \"time_ms\": 60,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.4096,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2277_650996\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[100000];\\nint ret[10];\\nint val[10000];\\nint used[10000];\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tint at=0;\\n\\tif(a<200){\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tfor(int j=0;j<a;j++){\\n\\t\\t\\t\\tif(i==j)str[j]='1';\\n\\t\\t\\t\\telse str[j]='0';\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tint c;\\n\\t\\t\\tscanf(\\\"%d\\\",&c);\\n\\t\\t\\tif(c)ret[at++]=i+1;\\n\\t\\t}\\n\\t\\tprintf(\\\"!\\\");\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\t\\telse printf(\\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\tfflush(stdout);\\n\\t\\treturn 0;\\n\\t}\\n\\tfor(int i=0;i<a;i++)val[i]=i;\\n\\tint n=a/2;\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tint d=0;\\n\\t\\tdo{\\n\\t\\t\\tfor(int j=0;j<50000;j++){\\n\\t\\t\\t\\tint l=rand()%a;\\n\\t\\t\\t\\tint r=rand()%a;\\n\\t\\t\\t\\tint z=val[l];\\n\\t\\t\\t\\tval[l]=val[r];\\n\\t\\t\\t\\tval[r]=z;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<n;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t}while(!d);\\n\\t\\tint left=0;\\n\\t\\tint right=n;\\n\\t\\twhile(left+1<right){\\n\\t\\t\\tint M=(left+right)/2;\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<M;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t\\tif(d)right=M;\\n\\t\\t\\telse left=M+1;\\n\\t\\t}\\n\\t\\tused[val[left]]=1;\\n\\t\\tret[at++]=val[left]+1;\\n\\t}\\n\\tprintf(\\\"!\\\");\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\telse printf(\\\"\\\\n\\\");\\n\\t}\\n\\tfflush(stdout);\\n}\",\n \"accuracy\": 0.0975609756097561,\n \"time_ms\": 70,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.4205,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2277_650995\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[100000];\\nint ret[10];\\nint val[10000];\\nint used[10000];\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tint at=0;\\n\\tif(a<200){\\n\\t\\tfor(int i=0;i<a;i++){\\n\\t\\t\\tfor(int j=0;j<a;j++){\\n\\t\\t\\t\\tif(i==j)str[j]='1';\\n\\t\\t\\t\\telse str[j]='0';\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tint c;\\n\\t\\t\\tscanf(\\\"%d\\\",&c);\\n\\t\\t\\tif(c)ret[at++]=i+1;\\n\\t\\t}\\n\\t\\tprintf(\\\"!\\\");\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\t\\telse printf(\\\"\\\\n\\\");\\n\\t\\t}\\n\\t\\tfflush(stdout);\\n\\t\\treturn 0;\\n\\t}\\n\\tfor(int i=0;i<a;i++)val[i]=i;\\n\\tint n=a/2;\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tint d=0;\\n\\t\\tdo{\\n\\t\\t\\tfor(int j=0;j<50000;j++){\\n\\t\\t\\t\\tint l=rand()%a;\\n\\t\\t\\t\\tint r=rand()%a;\\n\\t\\t\\t\\tint z=val[l];\\n\\t\\t\\t\\tval[l]=val[r];\\n\\t\\t\\t\\tval[r]=z;\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<n;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t}while(!d);\\n\\t\\tint left=0;\\n\\t\\tint right=n;\\n\\t\\twhile(left+1<right){\\n\\t\\t\\tint M=(left+right)/2;\\n\\t\\t\\tfor(int j=0;j<a;j++)str[j]='0';\\n\\t\\t\\tint ind=0;\\n\\t\\t\\tfor(int j=0;ind<M;j++){\\n\\t\\t\\t\\tif(!used[val[j]]){\\n\\t\\t\\t\\t\\tstr[val[j]]='1';\\n\\t\\t\\t\\t\\tind++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tprintf(\\\"?%s\\\\n\\\",str);\\n\\t\\t\\tfflush(stdout);\\n\\t\\t\\tscanf(\\\"%d\\\",&d);\\n\\t\\t\\tif(d)right=M;\\n\\t\\t\\telse left=M+1;\\n\\t\\t}\\n\\t\\tused[left]=1;\\n\\t\\tret[at++]=left+1;\\n\\t}\\n\\tprintf(\\\"!\\\");\\n\\tfor(int i=0;i<b;i++){\\n\\t\\tprintf(\\\"%d\\\",ret[i]);\\n\\t\\tif(i<b-1)printf(\\\" \\\");\\n\\t\\telse printf(\\\"\\\\n\\\");\\n\\t}\\n\\tfflush(stdout);\\n}\",\n \"accuracy\": 0.0975609756097561,\n \"time_ms\": 60,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.4096,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2277_523648\",\n \"code_snippet\": \"#include <cstdio>\\n#include <iostream>\\n#include <sstream>\\n#include <fstream>\\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\\nunsigned long xor128(){\\n static unsigned long x=123456789,y=362436069,z=521288629,w=88675123;\\n unsigned long t;\\n t=(x^(x<<11));x=y;y=z;z=w; return( w=(w^(w>>19))^(t^(t>>8)) );\\n}\\n\\nint n;\\n\\nint func(bitset<10000> query)\\n{\\n cout << '?';\\n for(int i=0; i<n; ++i){\\n if(query[i])\\n cout << '1';\\n else\\n cout << '0';\\n }\\n cout << endl;\\n\\n int ret;\\n cin >> ret;\\n return ret;\\n}\\n\\n\\nint main()\\n{\\n int k;\\n cin >> n >> k;\\n\\n bitset<10000> ret;\\n\\n while(--k >= 0){\\n int m = 0;\\n bitset<10000> query;\\n for(int i=0; i<n; ++i){\\n query[i] = (xor128() % 2 == 1) && !ret[i];\\n if(query[i])\\n ++ m;\\n }\\n\\n if(func(query) == 0){\\n ++ k;\\n continue;\\n }\\n\\n while(m > 1){\\n bitset<10000> query2;\\n int m2 = 0;\\n for(int i=0; i<n; ++i){\\n if(query[i] && m2 < m / 2){\\n query2[i] = true;\\n ++ m2;\\n }\\n }\\n\\n if(func(query2) == 1){\\n query = query2;\\n m = m2;\\n }else{\\n query ^= query2;\\n m -= m2;\\n }\\n }\\n\\n ret |= query;\\n }\\n\\n bool first = true;\\n for(int i=0; i<n; ++i){\\n if(ret[i]){\\n if(first){\\n cout << '!' << (i+1);\\n first = false;\\n }else{\\n cout << ' ' << (i+1);\\n }\\n }\\n }\\n cout << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 860,\n \"score_of_the_acc\": -0.3547,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2277_467848\",\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\\nbool ok[10000];\\nbool t[10000];\\n\\nint n, k;\\n\\nvoid get1() {\\n memset(t,0,sizeof(t));\\n while(1) { \\n REP(i,n) if (!ok[i]) t[i] = rand()%2;\\n printf(\\\"?\\\");\\n REP(i,n) printf(\\\"%d\\\",t[i]);\\n puts(\\\"\\\"); fflush(stdout);\\n int v;\\n scanf(\\\"%d\\\",&v);\\n if (v) return;\\n }\\n}\\n\\nbool check(int a, int b) {\\n printf(\\\"?\\\"); \\n REP(i,n) printf(\\\"%d\\\",(i>=a&&i<b)?t[i]:0);\\n puts(\\\"\\\"); fflush(stdout);\\n int v;\\n scanf(\\\"%d\\\", &v);\\n return v;\\n}\\n\\nint main() {\\n scanf(\\\"%d%d\\\",&n,&k);\\n vector<int> v;\\n REP(i,k) {\\n int a = 0, b = n;\\n get1();\\n while(a+1<b) {\\n int mid = (a+b)/2;\\n if (check(a, mid)) b = mid;\\n else a = mid;\\n }\\n ok[a] = 1;\\n v.push_back(a+1);\\n }\\n printf(\\\"!\\\");\\n REP(i,v.size()) {\\n if (i) printf(\\\" \\\");\\n printf(\\\"%d\\\", v[i]);\\n }\\n puts(\\\"\\\");\\n fflush(stdout);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 952,\n \"score_of_the_acc\": -0.4354,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2277_331928\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<algorithm>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nint dfs(int l,int r,int n,const int *bit){\\n\\tif(l==r-1) return l;\\n\\n\\tputchar('?');\\n\\trep(i,n){\\n\\t\\tif (l<=i && i<(l+r)/2) putchar('0'+bit[i]);\\n\\t\\telse if(i<=(l+r)/2 && i<r) putchar('0');\\n\\t\\telse putchar('0');\\n\\t}\\n\\tputchar('\\\\n'); fflush(stdout);\\n\\n\\tint v; scanf(\\\"%d\\\",&v);\\n\\treturn v?dfs(l,(l+r)/2,n,bit):dfs((l+r)/2,r,n,bit);\\n}\\n\\nint main(){\\n\\tsrand(777);\\n\\tint n,k; scanf(\\\"%d%d\\\",&n,&k);\\n\\tint ans[10];\\n\\trep(t,k){\\n\\t\\tint bit[10000];\\n\\t\\twhile(1){\\n\\t\\t\\tputchar('?');\\n\\t\\t\\trep(i,n){\\n\\t\\t\\t\\tif(count(ans,ans+t,i)) bit[i]=0;\\n\\t\\t\\t\\telse bit[i]=rand()&1;\\n\\t\\t\\t\\tputchar('0'+bit[i]);\\n\\t\\t\\t}\\n\\t\\t\\tputchar('\\\\n'); fflush(stdout);\\n\\n\\t\\t\\tint v; scanf(\\\"%d\\\",&v);\\n\\t\\t\\tif(v) break;\\n\\t\\t}\\n\\n\\t\\tans[t]=dfs(0,n,n,bit);\\n\\t}\\n\\n\\tprintf(\\\"!\\\");\\n\\trep(t,k) printf(\\\"%d%c\\\",ans[t]+1,t<k-1?' ':'\\\\n');\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 780,\n \"score_of_the_acc\": -0.2557,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2277_301280\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstdlib>\\n#include <queue>\\n#include <ctime>\\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n\\ninline int getInt(){ int s; scanf(\\\"%d\\\", &s); return s; }\\n\\nusing namespace std;\\n\\nint x[10000];\\nint n, k;\\nint ans[10];\\n\\nint query(){\\n printf(\\\"?\\\");\\n REP(i,n) printf(\\\"%d\\\", x[i]);\\n printf(\\\"\\\\n\\\");\\n fflush(stdout);\\n return getInt();\\n}\\n\\nint main(){\\n srand(time(NULL));\\n\\n n = getInt();\\n k = getInt();\\n\\n REP(i, k){\\n do{\\n // Random\\n REP(j, n) x[j] = rand() % 2;\\n REP(j, i) x[ans[j] - 1] = 0;\\n }while(query() == 0);\\n\\n vector<int> ones;\\n REP(j, n) if(x[j] == 1) ones.push_back(j);\\n\\n while(ones.size() != 1){\\n int m = ones.size() / 2;\\n\\n REP(j, n) x[j] = 0;\\n REP(j, m) x[ones[j]] = 1;\\n\\n if(query() == 1){\\n\\tones = vector<int>(ones.begin(), ones.begin() + m);\\n }else{\\n\\tones = vector<int>(ones.begin() + m, ones.end());\\n }\\n }\\n\\n ans[i] = ones[0] + 1;\\n }\\n\\n printf(\\\"!\\\");\\n REP(i,k) printf(\\\"%d%c\\\", ans[i], i == k - 1 ? '\\\\n' : ' ');\\n fflush(stdout);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 924,\n \"score_of_the_acc\": -0.4165,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2277_268966\",\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\\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\\nint n, k;\\nbool exist[10010];\\nbool target[10010];\\nchar output[10010];\\n\\nint Communicate() {\\n printf(\\\"%s\\\\n\\\", output);\\n fflush(stdout);\\n int v;\\n scanf(\\\"%d\\\", &v);\\n return v;\\n}\\n\\nint UpdateTarget(int c) {\\n int index = -1;\\n REP(i, n) {\\n if (!target[i]) { continue; }\\n if (output[i + 1] == '0' + c) { target[i] = false; }\\n if (index == -2 || !target[i]) { continue; }\\n else if (index == -1) { index = i; }\\n else { index = -2; }\\n }\\n assert(index != -1);\\n return index;\\n}\\n\\nvoid RandomSequence() {\\n output[0] = '?';\\n REP(i, n) {\\n if (!target[i]) { output[i + 1] = '0'; }\\n else { output[i + 1] = '0' + (rand() % 2 ? 1 : 0); }\\n }\\n output[n + 1] = '\\\\0';\\n}\\n\\nint main() {\\n scanf(\\\"%d %d\\\", &n, &k);\\n MEMSET(exist, false);\\n REP(i, k) {\\n REP(j, n) { target[j] = !exist[j]; }\\n while (true) {\\n RandomSequence();\\n if (Communicate()) { break; }\\n }\\n int prev = 0;\\n while (true) {\\n int index = UpdateTarget(prev);\\n if (index >= 0) {\\n exist[index] = true;\\n break;\\n }\\n RandomSequence();\\n prev = Communicate() == 0 ? 1 : 0;\\n }\\n }\\n\\n vector<int> ans;\\n REP(i, n) { if (exist[i]) { ans.push_back(i + 1); } }\\n printf(\\\"!\\\");\\n REP(i, k) {\\n if (i != 0) {\\n putchar(' ');\\n }\\n printf(\\\"%d\\\", ans[i]);\\n }\\n puts(\\\"\\\");\\n fflush(stdout);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.0109,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2277_253612\",\n \"code_snippet\": \"#include<cstdio>\\n#include<vector>\\n#include<algorithm>\\nusing namespace std;\\n\\nint main(){\\n int n,k,v;\\n int x[10000],a[10];\\n bool use[10000];\\n\\n scanf(\\\"%d %d\\\",&n,&k);\\n\\n if(n==k){\\n for(int i=0;i<k;i++)a[i] = i;\\n }else{\\n for(int i=0;i<n;i++)use[i] = false;\\n while(k--){\\n for(int i=0;i<n;i++)x[i] = 1&i;\\n while(1){\\n\\tbool f = true;\\n\\tfor(int i=0;i<n;i++){\\n\\t if(use[i] && x[i])f = false;\\n\\t}\\n\\tif(f){\\n\\t printf(\\\"?\\\");\\n\\t for(int i=0;i<n;i++)printf(\\\"%d\\\",x[i]);\\n\\t printf(\\\"\\\\n\\\");\\n\\t fflush(stdout);\\n\\t scanf(\\\"%d\\\",&v);\\n\\t if(v)break;\\n\\t}\\n\\trandom_shuffle(x,x+n);\\n }\\n vector<int> cand;\\n for(int i=0;i<n;i++){\\n\\tif(x[i])cand.push_back(i);\\n }\\n\\n while(cand.size()!=1){\\n\\tvector<int> c1,c2;\\n\\tfor(int i=0;i<(int)cand.size()/2;i++)c1.push_back(cand[i]);\\n\\tfor(int i=(int)cand.size()/2;i<(int)cand.size();i++)c2.push_back(cand[i]);\\n\\tcand.clear();\\n\\n\\tfor(int i=0;i<n;i++)x[i] = 0;\\n\\tfor(int i=0;i<(int)c1.size();i++)x[c1[i]] = 1;\\n\\n\\tprintf(\\\"?\\\");\\n\\tfor(int i=0;i<n;i++)printf(\\\"%d\\\",x[i]);\\n\\tprintf(\\\"\\\\n\\\");\\n\\tfflush(stdout);\\n\\tscanf(\\\"%d\\\",&v);\\n\\tif(v){\\n\\t for(int i=0;i<(int)c1.size();i++)cand.push_back(c1[i]);\\n\\t}else{\\n\\t for(int i=0;i<(int)c2.size();i++)cand.push_back(c2[i]);\\n\\t}\\n }\\n use[cand[0]] = true;\\n }\\n k = 0;\\n for(int i=0;i<n;i++){\\n if(use[i])a[k++] = i;\\n }\\n }\\n\\n printf(\\\"!%d\\\",a[0]+1);\\n for(int i=1;i<k;i++)printf(\\\" %d\\\",a[i]+1);\\n printf(\\\"\\\\n\\\");\\n fflush(stdout);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 940,\n \"memory_kb\": 940,\n \"score_of_the_acc\": -1.2689,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2277_252476\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <stdio.h>\\nusing namespace std;\\n#define rep(i,n) for(int i = 0 ; i < n ; i++)\\nint ac[10001];\\n\\nint last = -1;\\nint suff[10001];\\nint N,K;\\n\\nvector<int> answer(10);\\n\\nstring gen(vector<int> &g,int l,int r){\\n\\tstring w = string(N,'0');\\n\\tfor(int i = l ; i < r ; i++) if( !ac[ g[i] ] ) w[ g[i] ] = '1';\\n\\treturn w;\\n}\\n\\nstring gen2(){\\n\\tstring w = string(N,'0');\\n\\tfor(int i = 0 ; i < N ; i++) if( !ac[i] ) w[i] = '0' + suff[i];\\n\\treturn w;\\n}\\n\\nint get(string s){\\n\\tcout << \\\"?\\\" << s << endl;\\n\\tfflush(stdout);\\n\\tint ans = 0;\\n\\t//rep(i,K) ans += s[answer[i]] - '0';\\n\\tcin >> ans;\\n\\tfflush(stdout);\\n\\n\\treturn ans%2;\\n}\\n\\n\\nint odd(vector<int> &g,int l ,int r){\\n\\tif(l+1 == r){\\n\\t\\tac[g[l]] = true;\\n\\t\\tlast = g[l];\\n\\t\\treturn 0;\\n\\t}\\n\\tint m = (l+r)/2;\\n\\tif( get(gen(g,l,m)) == 1){\\n\\t\\todd(g,l,m);\\n\\t}else{\\n\\t\\todd(g,m,r);\\n\\t}\\n}\\nint even(){\\n\\tfor(int i = 0 ; i < 200 ; i++){\\n\\t\\tif(get(gen2()) == 1) break;\\n\\t\\trandom_shuffle(suff,suff+N);\\n\\t}\\n\\tvector<int> a;\\n\\tstring w = gen2();\\n\\trep(i,N) if(w[i] == '1') a.push_back(i);\\n\\todd(a,0,a.size());\\n}\\nint main(){\\n\\tint k;\\n\\tcin >> N >> k;\\n\\t//K = k;\\n\\t//rep(i,K) cin >> answer[i];\\n\\tvector<int> awawa;\\n\\tfor(int i = 0 ; i < N ; i++) awawa.push_back(i);\\n\\tfor(int i = 0 ; i < N ; i++) suff[i] = i%2;\\n\\twhile(k){\\n\\t\\tif(k%2){\\n\\t\\t\\todd(awawa,0,awawa.size());\\n\\t\\t}else{\\n\\t\\t\\teven();\\t\\n\\t\\t}\\n\\t\\tawawa.erase(remove(awawa.begin(),awawa.end(),last),awawa.end());\\n\\t\\tk--;\\n\\t}\\n\\tvector<int> ans;\\n\\trep(i,N) if(ac[i])ans.push_back(i+1);\\n\\tcout << \\\"!\\\";\\n\\trep(i,ans.size()) cout << (i?\\\" \\\":\\\"\\\") << ans[i];\\n\\tcout << endl;\\n\\tfflush(stdout);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1267,"cells":{"group_id":{"kind":"string","value":"aoj_2283_cpp"},"problem_description":{"kind":"string","value":"Problem C: Seishun 18 Kippu\nR大学のとある学生sirokurostoneはA津大学で行われる合宿に参加しようとしていた。\n他のメンバーは新幹線を使用する予定なのだが、sirokurostoneは青春18切符を使って向かおうとしていた。\n同じく青春18切符使いのとある2D好きな人物も合宿に参加しようとしていた。\nどうせならと一緒に行こうと考えたsirokurostoneは途中の駅で2D好きな彼を拾って向かおうと考えた。\nsirokurostoneはR大学を出る前に遅延状況を確認してすこしでも時間のかからないルートを通ってA津大学のある駅に着きたいと考えている。\nsirokurostoneはルートが確定した後に2D好きな彼にもその情報を伝えるつもりである。\nしかし、sirokurostoneは遅延状況を見てもどのルートを通れば早くA津大学のある駅に到着できるか分からず困っている。\nそこで、あなたの仕事はsirokurostoneに代わって遅延状況からどれくらいでA津大学のある駅に着くのかを求めることである。\n各駅間には、駅間の距離と遅延予想時間がある。\n電車は動き始めてから40km/hを維持するものとする。\n地点aと地点bの間の移動時間は、\n距離/40+遅延予想時間\nで求めることができる。\n各駅での停車時間は無視してよいものとする。\nInput\n複数のデータセットの並びが入力として与えられる。\nデータセット数は50以下であることが保障されている。\n各データセットは、次の形式をしている。\nn\nm\ns\np\ng\na\n1\nb\n1\nd\n1\nt\n1\n...\na\ni\nb\ni\nd\ni\nt\ni\n...\na\nm\nb\nm\nd\nm\nt\nm\n整数\nn\n(\n3 ≤ n ≤ 500\n)と\nm\n(\n2 ≤ m ≤ 5000\n)は、それぞれ駅の数、各駅間の線路の数の合計を表す。\ns\n、\np\n、\ng\nは、それぞれsirokurostoneが乗る駅、2D好きな人物が乗る駅、A津大学がある駅の場所を示す文字列である。\ns\n、\np\n、\ng\nはそれぞれ違う文字列である。\n続く\nm\n行は、駅間情報を表す。\na\ni\n、\nb\ni\nは、線路がつなぐ駅を示す文字列である。\na\ni\nと\nb\ni\nは、双方向に行き来することができる。\na\ni\nと\nb\ni\nが一致することはない。\n整数\nd\ni\n(\n40 ≤ d\ni\n≤ 10000\n)は、\na\ni\nと\nb\ni\nの距離を表す。\nd\ni\nは40の倍数であることが保証されている。\n整数\nt\ni\n(\n0 ≤ t\ni\n≤ 20\n)は、\na\ni\nと\nb\ni\nの間の遅延予想時間を示す。\n駅名を表す文字列は、全てアルファベットの小文字および大文字からなる20文字以下の文字列であらわされる。\n駅と駅の間の線路は高々1本である。\n入力の終わりは2つのゼロを含む行で表される。\nOutput\n入力データセットごとに、A津大学がある駅への到達時間(単位:時間)を出力せよ。\nsirokurostoneが乗る駅から2D好きな人が乗る駅までの経路と、2D好きな人物が乗る駅からA津大学がある駅の場所までの経路があることが保証されている。\nSample Input\n4 4\nA B G\nA B 40 3\nB C 80 0\nA G 40 0\nB G 80 0\n5 6\nKusatsu Tokyo Aizu\nTokyo Nagoya 120 3\nKusatsu Nagoya 40 0\nKusatsu Kanazawa 40 0\nKanazawa Aizu 40 0\nTokyo Kanazawa 40 0\nTokyo Aizu 80 4 \n0 0\nOutput for Sample Input\n5\n4"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2283_9847642","code_snippet":"#include <iostream>\n#include <vector>\n#include <map>\n#include <set>\n\nusing namespace std;\nusing ll = long long;\n\nconst ll INF = static_cast<ll>(1) << 62;\n\nvoid solve() {\n ll n, m; cin >> m;\n string s, t, f; cin >> s >> t >> f;\n map<string, vector<pair<string, ll>>>g;\n map<string, ll>d;\n for (int i = 0; i < m; i++) {\n string a, b; cin >> a >> b;\n d[a] = INF;\n d[b] = INF;\n ll d; cin >> d;\n ll t; cin >> t;\n g[a].emplace_back(b, d / 40 + t);\n g[b].emplace_back(a, d / 40 + t);\n }\n set<pair<ll, string>>q;\n q.insert({0, t});\n d[t] = 0;\n while (!q.empty()) {\n ll val = q.begin() -> first;\n string v = q.begin() -> second;\n q.erase(q.begin());\n for (auto [to, w] : g[v]) {\n if (d[v] + w < d[to]) {\n q.erase({d[to], to});\n d[to] = d[v] + w;\n q.insert({d[to], to});\n }\n }\n }\n cout << d[s] + d[f] << '\\n';\n}\n\nint main() {\n ll T; cin >> T;\n while (T != 0) {\n solve();\n cin >> T;\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":4092,"score_of_the_acc":-0.7611,"final_rank":14},{"submission_id":"aoj_2283_7831713","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\ntemplate<typename T>\nstruct Dijkstra{\n const T inf=numeric_limits<T>::max();\n using P=pair<T,int>;\n int n;\n vector<vector<pair<int,T>>> g;\n vector<T> d;\n Dijkstra(int n):n(n),g(n),d(n){}\n void add_edge(int u,int v,T w){\n g[u].emplace_back(v,w);\n g[v].emplace_back(u,w);\n }\n vector<T> build(int s){\n for(int i=0;i<n;i++){\n d[i]=inf;\n }\n d[s]=0;\n priority_queue<P,vector<P>,greater<P>> pq;\n pq.emplace(d[s],s);\n while(pq.size()){\n P p=pq.top(); pq.pop();\n int v=p.second;\n if(d[v]<p.first)continue;\n for(auto &e:g[v]){\n int u=e.first; T c=e.second;\n if(d[u]>d[v]+c){\n d[u]=d[v]+c;\n pq.emplace(d[u],u);\n }\n }\n }\n return d;\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,m;\n while(cin >> n >> m, n) {\n map<string,int> mp;\n auto id = [&]() -> int {\n string s; cin >> s;\n if (mp.find(s) != mp.end()) {\n return mp[s];\n }\n else {\n int i = mp.size();\n mp[s] = i;\n return i;\n }\n };\n int a = id(), b = id(), c = id();\n Dijkstra<int> g(n);\n for (int i = 0; i < m; ++i) {\n int x = id(), y = id();\n int d,t; cin >> d >> t;\n g.add_edge(x, y, d/40+t);\n }\n cout << g.build(a)[b] + g.build(b)[c] << \"\\n\";\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3392,"score_of_the_acc":-0.5291,"final_rank":2},{"submission_id":"aoj_2283_5031728","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\nnamespace CharacterClass {\n\tconstexpr string_view\n\t digit = \"0123456789\",\n\t xdigit = \"0123456789ABCDEFabcdef\", lower = \"abcdefghijklmnopqrstuvwxyz\",\n\t upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n\t alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t alnum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t word = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\",\n\t punct = R\"(!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~)\",\n\t graph =\n\t R\"(!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t print =\n\t R\"( !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t blank = \" \\t\", space = \" \\t\\n\\r\\f\\v\";\n} // namespace CharacterClass\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Output {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid put(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(bool v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(vector<bool>::reference v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid put(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid put(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid put(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void put(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\n\t\tput(v.first);\n\t\tput(D.d);\n\t\tput(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) put(D.d);\n\t\t\tput(*i);\n\t\t}\n\t}\n\ttemplate <class T> void put(const vector<T>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void put(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) put(D.l);\n\t\t\tput(v[i]);\n\t\t}\n\t}\n\n\tOutput() = default;\n\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tOutput& operator()() {\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Output& operator()(H&& h) {\n\t\tput(h);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\n\t\tput(h);\n\t\tput(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tOutput& range(const InputIterator& begin, const InputIterator& end) {\n\t\tput_range(begin, end);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Output& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tOutput& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tOutput& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tOutput& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tOutput& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 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 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 5 \"/home/yuruhiya/programming/library/Graph/GraphTemplate.cpp\"\nusing namespace std;\n\nusing Weight = long long;\nconstexpr Weight INF = numeric_limits<Weight>::max();\nstruct Edge {\n\tint to;\n\tWeight cost;\n\tEdge() : to(-1), cost(-1) {}\n\tEdge(int _to, Weight _cost = 1) : to(_to), cost(_cost) {}\n\tfriend bool operator<(const Edge& e1, const Edge& e2) {\n\t\treturn e1.cost < e2.cost;\n\t}\n\tfriend bool operator>(const Edge& e1, const Edge& e2) {\n\t\treturn e1.cost > e2.cost;\n\t}\n\tfriend ostream& operator<<(ostream& os, const Edge& e) {\n\t\treturn os << \"->\" << e.to << '(' << e.cost << ')';\n\t}\n};\nusing Graph = vector<vector<Edge>>;\nstruct Edge2 {\n\tint from, to;\n\tWeight cost;\n\tEdge2() : from(-1), to(-1), cost(0) {}\n\tEdge2(int _from, int _to, Weight _cost) : from(_from), to(_to), cost(_cost) {}\n\tfriend bool operator<(const Edge2& e1, const Edge2& e2) {\n\t\treturn e1.cost < e2.cost;\n\t}\n\tfriend bool operator>(const Edge2& e1, const Edge2& e2) {\n\t\treturn e1.cost > e2.cost;\n\t}\n\tfriend ostream& operator<<(ostream& os, const Edge2& e) {\n\t\treturn os << e.from << \"->\" << e.to << '(' << e.cost << ')';\n\t}\n};\nusing Edges = vector<Edge2>;\nusing Matrix = vector<vector<Weight>>;\n#line 5 \"/home/yuruhiya/programming/library/Graph/DijkstraST.cpp\"\nusing namespace std;\n\nWeight Dijkstra(const Graph& graph, int s, int t) {\n\tint V = graph.size();\n\tvector<Weight> dist(V, INF);\n\tdist[s] = 0;\n\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\n\tpq.emplace(s, 0);\n\twhile (!pq.empty()) {\n\t\tEdge p = pq.top();\n\t\tpq.pop();\n\t\tint v = p.to;\n\t\tif (v == t) return dist[t];\n\t\tif (dist[v] < p.cost) continue;\n\t\tfor (auto e : graph[v]) {\n\t\t\tif (dist[e.to] > dist[v] + e.cost) {\n\t\t\t\tdist[e.to] = dist[v] + e.cost;\n\t\t\t\tpq.emplace(e.to, dist[e.to]);\n\t\t\t}\n\t\t}\n\t}\n\treturn dist[t];\n}\n#line 3 \"a.cpp\"\n\nll solve(int n, int m) {\n\tmap<string, int> str;\n\tint k = 0;\n\tVS s = in[3];\n\tvector<tuple<string, string, ll>> edges;\n\trep(i, m) {\n\t\tins(s, t);\n\t\tinl(a, b);\n\t\tedges.emplace_back(s, t, a / 40 + b);\n\t\tif (str.count(s) == 0) str[s] = k++;\n\t\tif (str.count(t) == 0) str[t] = k++;\n\t}\n\n\tGraph g(n);\n\tfor (auto [s, t, d] : edges) {\n\t\tg[str[s]].emplace_back(str[t], d);\n\t\tg[str[t]].emplace_back(str[s], d);\n\t}\n\n\tint start = str[s[0]], passing = str[s[1]], goal = str[s[2]];\n\treturn Dijkstra(g, start, passing) + Dijkstra(g, passing, goal);\n}\n\nint main() {\n\twhile (true) {\n\t\tini(n, m);\n\t\tif (n + m == 0) break;\n\t\tout(solve(n, m));\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":4080,"score_of_the_acc":-0.722,"final_rank":11},{"submission_id":"aoj_2283_3736117","code_snippet":"#include<iostream>\n#include<vector>\n#include<set>\n#include<map>\n#include<queue>\nusing namespace std;\n\nint main(){\n int n, m;\n while(cin >> n >> m, n+m){\n string s, t, g;\n cin >> s >> t >> g;\n map<string, vector<pair<string,int>>> ma;\n for(int i = 0; i < m; i++){\n string a, b;\n int c, d;\n cin >> a >> b >> c >> d;\n ma[a].push_back({b, c/40+d});\n ma[b].push_back({a, c/40+d});\n }\n map<string,int> dp;\n for(auto p : ma) dp[p.first] = 1<<30;\n dp[s] = 0;\n priority_queue<pair<int,string>> pq;\n pq.push({-0, s});\n while(!pq.empty()){\n auto p = pq.top(); pq.pop();\n string pos = p.second;\n int cost = -p.first;\n if(dp[pos] != cost) continue;\n for(auto next : ma[pos]){\n int ncost = cost + next.second;\n string npos = next.first;\n if(dp[npos] > ncost){\n dp[npos] = ncost;\n pq.push({-ncost, npos});\n }\n }\n }\n int ans = dp[t];\n for(auto p : ma) dp[p.first] = 1<<30;\n dp[t] = 0;\n pq.push({-0, t});\n while(!pq.empty()){\n auto p = pq.top(); pq.pop();\n string pos = p.second;\n int cost = -p.first;\n if(dp[pos] != cost) continue;\n for(auto next : ma[pos]){\n int ncost = cost + next.second;\n string npos = next.first;\n if(dp[npos] > ncost){\n dp[npos] = ncost;\n pq.push({-ncost, npos});\n }\n }\n }\n ans += dp[g];\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3836,"score_of_the_acc":-0.725,"final_rank":12},{"submission_id":"aoj_2283_3341603","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nstruct edge{ int to,cost; };\nconst int INF = INT_MAX/3;\n\nint main(){\n int n,m;\n while(cin >>n >>m,n){\n string s,p,g;\n cin >>s >>p >>g;\n\n map<string,int> name2idx;\n name2idx[s] = 0;\n name2idx[p] = 1;\n name2idx[g] = 2;\n\n int V = 3;\n\n vector<string> a(m),b(m);\n vector<int> c(m);\n rep(i,m){\n int d,t;\n cin >>a[i] >>b[i] >>d >>t;\n\n c[i] = d/40 + t;\n\n if(!name2idx.count(a[i])){\n name2idx[a[i]] = V;\n ++V;\n }\n if(!name2idx.count(b[i])){\n name2idx[b[i]] = V;\n ++V;\n }\n }\n\n vector<vector<edge>> G(V);\n rep(i,m){\n int u = name2idx[a[i]], v = name2idx[b[i]];\n G[u].pb({v,c[i]});\n G[v].pb({u,c[i]});\n }\n\n vector<int> d(V,INF);\n d[1] = 0;\n\n using pi = pair<int,int>;\n priority_queue<pi, vector<pi>, greater<pi>> pq;\n pq.push({0,1});\n while(!pq.empty()){\n pi now = pq.top();\n pq.pop();\n int v = now.se;\n if(now.fi > d[v]) continue;\n for(const auto &e:G[v]){\n if(d[e.to] > d[v]+e.cost){\n d[e.to] = d[v]+e.cost;\n pq.push({d[e.to], e.to});\n }\n }\n }\n\n cout << d[0]+d[2] << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3844,"score_of_the_acc":-0.7094,"final_rank":10},{"submission_id":"aoj_2283_2656893","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-9;\n\n\n\nint main() {\n\twhile (true) {\n\t\tint N,M;cin>>N>>M;\n\t\tif(!N)break;\n\t\tmap<string,int>stmp;\n\t\tstring S,P,G;cin>>S>>P>>G;\n\t\tstmp[S]=0;\n\t\tstmp[P]=1;\n\t\tstmp[G]=2;\n\t\tint id=3;\n\t\tvector<vector<pair<int,int>>>edges(N);\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tstring s,t;cin>>s>>t;\n\t\t\tint d,c;cin>>d>>c;\n\t\t\tint cost=d/40+c;\n\t\t\tif (stmp.find(s) == stmp.end()) {\n\t\t\t\tstmp[s]=id++;\n\t\t\t}\n\t\t\tif (stmp.find(t) == stmp.end()) {\n\t\t\t\tstmp[t]=id++;\n\t\t\t}\n\t\t\tedges[stmp[s]].push_back(make_pair(stmp[t],cost));\n\t\t\tedges[stmp[t]].push_back(make_pair(stmp[s],cost));\n\t\t}\n\t\tvector<int>memo(N,1e9);\n\t\tmemo[stmp[P]]=0;\n\t\tpriority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>que;\n\t\tque.push(make_pair(0,stmp[P]));\n\t\twhile (!que.empty()) {\n\t\t\tauto atop(que.top());\n\t\t\tque.pop();\n\t\t\tint now=atop.second;\n\t\t\tint cost=atop.first;\n\t\t\tfor (auto e : edges[now]) {\n\t\t\t\tconst int nextcost=cost+e.second;\n\t\t\t\tconst int next=e.first;\n\t\t\t\tif (memo[next] > nextcost) {\n\t\t\t\t\tmemo[next]=nextcost;\n\t\t\t\t\tque.push(make_pair(memo[next],next));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans=memo[stmp[S]]+memo[stmp[G]];\n\t\tcout<<ans<<endl;\n\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3340,"score_of_the_acc":-0.5681,"final_rank":4},{"submission_id":"aoj_2283_2601353","code_snippet":"#include<bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\nstring s1,s2,s3,s4,s5;\nint ti,dist,n,m,st,go,mi,p1,p2;\nint d[502][502];\nmap<string,int>M;\nint main(){\n while(cin>>n>>m,n){\n M.clear();\n r(i,502)r(j,502)d[i][j]=1e8;\n int c=0;\n cin>>s1>>s2>>s3;\n r(i,m){\n cin>>s4>>s5>>dist>>ti;\n if(M[s4])p1=M[s4];\n else M[s4]=++c,p1=M[s4];\n if(M[s5])p2=M[s5];\n else M[s5]=++c,p2=M[s5];\n if(s1==s5)st=M[s5];\n if(s1==s4)st=M[s4];\n if(s2==s5)mi=M[s5];\n if(s2==s4)mi=M[s4];\n if(s3==s5)go=M[s5];\n if(s3==s4)go=M[s4];\n d[p1][p2]=d[p2][p1]=dist/40+ti;\n }\n r(o,n+1)r(i,n+1)r(j,n+1)d[i][j]=min(d[i][j],d[i][o]+d[o][j]);\n cout<<d[st][mi]+d[mi][go]<<endl;\n }\n}","accuracy":1,"time_ms":340,"memory_kb":4216,"score_of_the_acc":-1.3494,"final_rank":19},{"submission_id":"aoj_2283_2535449","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\n\nstruct Info{\n\tInfo(int arg_to,int arg_dist,int arg_delay){\n\t\tto = arg_to;\n\t\tdist = arg_dist;\n\t\tdelay = arg_delay;\n\t}\n\tint to,dist,delay;\n};\n\nstruct Data{\n\tData(int arg_station,int arg_sum_time){\n\t\tstation = arg_station;\n\t\tsum_time = arg_sum_time;\n\t}\n\tbool operator<(const struct Data &arg) const{\n\t\treturn sum_time > arg.sum_time;\n\t};\n\tint station,sum_time;\n};\n\nint N,M,index;\nchar table[500][21];\n\nchar start[21],mid[21],goal[21];\n\nbool strCmp(char* base, char* comp){\n\tint length1,length2;\n\tfor(length1=0;base[length1] != '\\0';length1++);\n\tfor(length2=0;comp[length2] != '\\0';length2++);\n\tif(length1 != length2)return false;\n\n\tfor(int i=0;base[i] != '\\0'; i++){\n\t\tif(base[i] != comp[i])return false;\n\t}\n\treturn true;\n}\n\nvoid strcpy(char* to,char* str){\n\tfor(int i=0;str[i] != '\\0';i++){\n\t\tto[i] = str[i];\n\t\tto[i+1] = '\\0';\n\t}\n}\n\nvoid func(){\n\tscanf(\"%s %s %s\",start,mid,goal);\n\n\tstrcpy(table[0],start);\n\tstrcpy(table[1],mid);\n\tstrcpy(table[2],goal);\n\n\tvector<Info> V[N+1];\n\n\tindex = 3;\n\n\tchar left[21],right[21];\n\tint left_index,right_index,dist,delay;\n\n\tbool FLG;\n\n\tfor(int loop = 0; loop < M; loop++){\n\t\tscanf(\"%s %s %d %d\",left,right,&dist,&delay);\n\n\t\tFLG = false;\n\t\tfor(int i = 0; i < index; i++){\n\t\t\tif(strCmp(table[i],left)){\n\t\t\t\tleft_index = i;\n\t\t\t\tFLG = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(!FLG){\n\t\t\tleft_index = index;\n\t\t\tstrcpy(table[index++],left);\n\t\t}\n\n\t\tFLG = false;\n\t\tfor(int i = 0; i < index; i++){\n\t\t\tif(strCmp(table[i],right)){\n\t\t\t\tright_index = i;\n\t\t\t\tFLG = true;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(!FLG){\n\t\t\tright_index = index;\n\t\t\tstrcpy(table[index++],right);\n\t\t}\n\n\t\tV[left_index].push_back(Info(right_index,dist,delay));\n\t\tV[right_index].push_back(Info(left_index,dist,delay));\n\t}\n\n\tint min_time[N];\n\tint ans = 0;\n\n\tpriority_queue<Data> Q;\n\n\tfor(int loop = 0; loop < 2; loop++){\n\t\tfor(int i = 0; i < N; i++)min_time[i] = BIG_NUM;\n\t\tif(loop == 0){\n\t\t\tmin_time[0] = 0;\n\t\t\tQ.push(Data(0,0));\n\t\t}else{\n\t\t\tmin_time[1] = 0;\n\t\t\tQ.push(Data(1,0));\n\t\t}\n\n\t\twhile(!Q.empty()){\n\n\t\t\tif((loop == 0 && Q.top().station == 1) || (loop == 0 && Q.top().station == 1)){\n\t\t\t\tQ.pop();\n\t\t\t}else if(Q.top().sum_time > min_time[Q.top().station]){\n\t\t\t\tQ.pop();\n\t\t\t}else{\n\t\t\t\tfor(int i = 0; i < V[Q.top().station].size(); i++){\n\t\t\t\t\tif(min_time[V[Q.top().station][i].to] > Q.top().sum_time+V[Q.top().station][i].dist/40+V[Q.top().station][i].delay){\n\t\t\t\t\t\tmin_time[V[Q.top().station][i].to] = Q.top().sum_time+V[Q.top().station][i].dist/40+V[Q.top().station][i].delay;\n\t\t\t\t\t\tQ.push(Data(V[Q.top().station][i].to,min_time[V[Q.top().station][i].to]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tQ.pop();\n\t\t\t}\n\t\t}\n\n\t\tif(loop == 0){\n\t\t\tans += min_time[1];\n\t\t}else{\n\t\t\tans += min_time[2];\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d\",&N,&M);\n\t\tif(N == 0 && M == 0)break;\n\n\t\tfunc();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3328,"score_of_the_acc":-0.6184,"final_rank":9},{"submission_id":"aoj_2283_2129963","code_snippet":"#include <queue>\n#include <limits>\n#include <string>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nstruct edge {\n\tint to, cost;\n\tedge(int to_, int cost_) : to(to_), cost(cost_) {};\n};\nbool operator<(const edge& e1, const edge& e2) {\n\treturn e1.cost < e2.cost;\n}\ntemplate<class Type>\nstd::vector<Type> shortest_path(std::vector<std::vector<edge> > &G, int s) {\n\tstd::priority_queue<edge> que; que.push(edge(s, 0));\n\tstd::vector<Type> ret(G.size(), std::numeric_limits<Type>::max()); ret[s] = 0;\n\twhile (!que.empty()) {\n\t\tedge u = que.top(); que.pop();\n\t\tfor (edge e : G[u.to]) {\n\t\t\tif (ret[e.to] > ret[u.to] + e.cost) {\n\t\t\t\tret[e.to] = ret[u.to] + e.cost;\n\t\t\t\tque.push(edge(e.to, -ret[e.to]));\n\t\t\t}\n\t\t}\n\t}\n\treturn ret;\n}\nint n, m, d, e;\nint main() {\n\twhile (cin >> n >> m, n) {\n\t\tstring s, t, g;\n\t\tcin >> s >> t >> g;\n\t\tvector<string> a(m), b(m), r; vector<int> x(m);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> a[i] >> b[i] >> d >> e;\n\t\t\tx[i] = d / 40 + e;\n\t\t\tr.push_back(a[i]);\n\t\t\tr.push_back(b[i]);\n\t\t}\n\t\tsort(r.begin(), r.end());\n\t\tr.erase(unique(r.begin(), r.end()), r.end());\n\t\tint sp = lower_bound(r.begin(), r.end(), s) - r.begin();\n\t\tint tp = lower_bound(r.begin(), r.end(), t) - r.begin();\n\t\tint gp = lower_bound(r.begin(), r.end(), g) - r.begin();\n\t\tvector<vector<edge> > G(n);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint ptr1 = lower_bound(r.begin(), r.end(), a[i]) - r.begin();\n\t\t\tint ptr2 = lower_bound(r.begin(), r.end(), b[i]) - r.begin();\n\t\t\tG[ptr1].push_back(edge(ptr2, x[i]));\n\t\t\tG[ptr2].push_back(edge(ptr1, x[i]));\n\t\t}\n\t\tint w1 = shortest_path<int>(G, sp)[tp];\n\t\tint w2 = shortest_path<int>(G, tp)[gp];\n\t\tcout << w1 + w2 << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3924,"score_of_the_acc":-0.7318,"final_rank":13},{"submission_id":"aoj_2283_2127868","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define int long long\n#define F first\n#define S second\n#define all(v) (v).begin(), (v).end()\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)\n#define each(a, b) for(auto& a : b)\n\ntypedef pair<int, int> P;\n\nconst int inf = 1LL << 55;\n\nint G[505][505];\n\nsigned main()\n{\n int n, m;\n while(cin >> n >> m, n || m) {\n fill(G[0], G[505], inf);\n int cnt = 0;\n map<string, int> stat;\n string s, p, g; cin >> s >> p >> g;\n stat[s] = cnt++; stat[p] = cnt++; stat[g] = cnt++;\n while(m--) {\n string a, b; int d, t;\n cin >> a >> b >> d >> t;\n if(stat.find(a) == stat.end()) stat[a] = cnt++;\n if(stat.find(b) == stat.end()) stat[b] = cnt++;\n G[stat[a]][stat[b]] = G[stat[b]][stat[a]] = d / 40 + t;\n }\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) {\n\tfor(int k = 0; k < n; k++) G[j][k] = min(G[j][k], G[j][i] + G[i][k]);\n }\n }\n cout << G[stat[s]][stat[p]] + G[stat[p]][stat[g]] << endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":5072,"score_of_the_acc":-1.6429,"final_rank":20},{"submission_id":"aoj_2283_2127423","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\ntypedef pair<int, int>P;\n\nint d1[550], d2[550];\nchar s[50], p[50], g[50], a[50], b[50];\nint main() {\n\tint n, m;\n\twhile (scanf(\"%d%d\", &n, &m), n) {\n\t\tunordered_map<string, int>mp;\n\t\tvector<P>E[550];\n\t\tscanf(\"%s%s%s\", s, p, g);\n\t\tmp[s] = 0; mp[p] = 1; mp[g] = 2;\n\t\trep(i, m) {\n\t\t\tint d, t; scanf(\"%s%s%d%d\", a, b, &d, &t);\n\t\t\tif (mp.find(a) == mp.end())mp[a] = mp.size();\n\t\t\tif (mp.find(b) == mp.end())mp[b] = mp.size();\n\t\t\tE[mp[a]].push_back(P(d / 40 + t, mp[b]));\n\t\t\tE[mp[b]].push_back(P(d / 40 + t, mp[a]));\n\t\t}\n\t\tpriority_queue<P, vector<P>, greater<P>>que;\n\t\tmemset(d1, 0x3f, sizeof(d1));\n\t\td1[0] = 0; que.push(P(0, 0));\n\t\twhile (!que.empty()) {\n\t\t\tP p = que.top(); que.pop();\n\t\t\tif (d1[p.second] != p.first)continue;\n\t\t\tfor (P u : E[p.second]) {\n\t\t\t\tif (d1[u.second] > p.first + u.first) {\n\t\t\t\t\td1[u.second] = p.first + u.first;\n\t\t\t\t\tque.push(P(d1[u.second], u.second));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmemset(d2, 0x3f, sizeof(d2));\n\t\td2[1] = 0; que.push(P(0, 1));\n\t\twhile (!que.empty()) {\n\t\t\tP p = que.top(); que.pop();\n\t\t\tif (d2[p.second] != p.first)continue;\n\t\t\tfor (P u : E[p.second]) {\n\t\t\t\tif (d2[u.second] > p.first + u.first) {\n\t\t\t\t\td2[u.second] = p.first + u.first;\n\t\t\t\t\tque.push(P(d2[u.second], u.second));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", d1[1] + d2[2]);\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":3468,"score_of_the_acc":-0.5683,"final_rank":5},{"submission_id":"aoj_2283_2127418","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\ntypedef pair<int, int>P;\n\nint d1[550], d2[550];\nint main() {\n\tint n, m;\n\twhile (scanf(\"%d%d\", &n, &m), n) {\n\t\tmap<string, int>mp;\n\t\tvector<P>E[550];\n\t\tstring s, p, g; cin >> s >> p >> g;\n\t\tmp[s] = 0; mp[p] = 1; mp[g] = 2;\n\t\trep(i, m) {\n\t\t\tstring a, b; int d, t; cin >> a >> b >> d >> t;\n\t\t\tif (mp.find(a) == mp.end())mp[a] = mp.size();\n\t\t\tif (mp.find(b) == mp.end())mp[b] = mp.size();\n\t\t\tE[mp[a]].push_back(P(d / 40 + t, mp[b]));\n\t\t\tE[mp[b]].push_back(P(d / 40 + t, mp[a]));\n\t\t}\n\t\tpriority_queue<P, vector<P>, greater<P>>que;\n\t\tmemset(d1, 0x3f, sizeof(d1));\n\t\td1[0] = 0; que.push(P(0, 0));\n\t\twhile (!que.empty()) {\n\t\t\tP p = que.top(); que.pop();\n\t\t\tif (d1[p.second] != p.first)continue;\n\t\t\tfor (P u : E[p.second]) {\n\t\t\t\tif (d1[u.second] > p.first + u.first) {\n\t\t\t\t\td1[u.second] = p.first + u.first;\n\t\t\t\t\tque.push(P(d1[u.second], u.second));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tmemset(d2, 0x3f, sizeof(d2));\n\t\td2[1] = 0; que.push(P(0, 1));\n\t\twhile (!que.empty()) {\n\t\t\tP p = que.top(); que.pop();\n\t\t\tif (d2[p.second] != p.first)continue;\n\t\t\tfor (P u : E[p.second]) {\n\t\t\t\tif (d2[u.second] > p.first + u.first) {\n\t\t\t\t\td2[u.second] = p.first + u.first;\n\t\t\t\t\tque.push(P(d2[u.second], u.second));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", d1[1] + d2[2]);\n\t}\n}","accuracy":1,"time_ms":50,"memory_kb":3400,"score_of_the_acc":-0.6028,"final_rank":8},{"submission_id":"aoj_2283_2127343","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\nint main(){\n ll n,m;\n while(cin>>n>>m,n||m){\n string s,p,g;\n cin>>s>>p>>g;\n vector<P> G[n];\n map<string,int> st;\n vector<string> vs;\n for(ll i=0;i<m;i++){\n string a,b;\n ll d,t;\n cin>>a>>b>>d>>t;\n if(st.find(a)==st.end()){\n st[a]=vs.size();\n vs.push_back(a);\n }\n if(st.find(b)==st.end()){\n st[b]=vs.size();\n vs.push_back(b);\n }\n G[st[a]].push_back(P(st[b],d/40+t));\n G[st[b]].push_back(P(st[a],d/40+t));\n }\n ll ans=0;\n ll dp[n];\n priority_queue<P,vector<P>,greater<P> > q;\n memset(dp,-1,sizeof(dp));\n q.push(P(0,st[s]));\n while(!q.empty()){\n P pp=q.top();q.pop();\n ll v=pp.second,d=pp.first;\n if(~dp[v]&&dp[v]<=d) continue;\n dp[v]=d;\n if(v==st[p]) break;\n for(ll i=0;i<(ll)G[v].size();i++){\n q.push(P(d+G[v][i].second,G[v][i].first));\n }\n }\n while(!q.empty()) q.pop();\n ans+=dp[st[p]];\n memset(dp,-1,sizeof(dp));\n q.push(P(0,st[p]));\n while(!q.empty()){\n P pp=q.top();q.pop();\n ll v=pp.second,d=pp.first;\n if(~dp[v]&&dp[v]<=d) continue;\n dp[v]=d;\n if(v==st[g]) break;\n for(ll i=0;i<(ll)G[v].size();i++){\n q.push(P(d+G[v][i].second,G[v][i].first));\n }\n }\n ans+=dp[st[g]];\n cout<<ans<<endl;\n } \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3432,"score_of_the_acc":-0.5939,"final_rank":7},{"submission_id":"aoj_2283_2127126","code_snippet":"#include <bits/stdc++.h>\n#define N 501\n#define INF 1e9\nusing namespace std;\ntypedef pair<int,int> P;\nvector<P> G[N];\n\n\n\nint dijkstra(int s,int g){\n int D[N];\n for(int i=0;i<N;i++) D[i]=INF;\n priority_queue<P,vector<P>,greater<P> > Q;\n Q.push(P(0,s));\n D[s]=0;\n while(!Q.empty()){\n P t=Q.top();Q.pop();\n int cost=t.first, pos=t.second;\n if(pos==g) return cost;\n if(D[pos]<cost) continue;\n \n for(int i=0;i<G[pos].size();i++){\n int nx=G[pos][i].first;\n int ncost=cost+G[pos][i].second;\n if(D[nx]>ncost) Q.push(P(ncost,nx)),D[nx]=ncost;\n }\n }\n cout<<\"OK\"<<endl;\n return -1;\n}\n\n\nint main(){\n while(1){\n int n,m;\n cin>>n>>m;\n if(!n&&!m)break;\n string s,p,g;\n cin>>s>>p>>g;\n map<string,int> M;\n for(int i=0;i<N;i++) G[i].clear();\n for(int i=0,d,t,cnt=0;i<m;i++) {\n string a,b;\n cin>>a>>b>>d>>t;\n if(!M.count(a)) M[a]=cnt++;\n if(!M.count(b)) M[b]=cnt++;\n G[M[a]].push_back(P(M[b],d/40+t));\n G[M[b]].push_back(P(M[a],d/40+t));\n }\n int ans= dijkstra(M[s],M[p]);\n ans=ans+dijkstra(M[p],M[g]);\n\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3336,"score_of_the_acc":-0.567,"final_rank":3},{"submission_id":"aoj_2283_2127098","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nmap<string,int> ma;\nvoid in(string s) {\n if(!ma.count(s)) {\n int k=ma.size();\n ma[s]=k;\n }\n}\n\nint main() {\n int n,m;\n while(cin >> n >> m && n) {\n ma.clear();\n string r[3];\n for(int i=0; i<3; i++) {\n cin >> r[i];\n in(r[i]);\n }\n int d[n][n];\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++)d[i][j]=1<<29;\n d[i][i]=0;\n }\n for(int i=0; i<m; i++) {\n string s,t;\n int b,c;\n cin >> s >> t >> b >> c;\n in(s);in(t);\n d[ma[s]][ma[t]]=b/40+c;\n d[ma[t]][ma[s]]=b/40+c;\n }\n for(int k=0;k<n;k++)for(int i=0;i<n;i++)for(int j=0;j<n;j++)d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\n cout << d[ma[r[0]]][ma[r[1]]]+d[ma[r[1]]][ma[r[2]]] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":310,"memory_kb":4076,"score_of_the_acc":-1.2566,"final_rank":17},{"submission_id":"aoj_2283_2127065","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\nint main(){\n ll n,m;\n while(cin>>n>>m,n||m){\n string s,p,g;\n cin>>s>>p>>g;\n vector<P> G[n];\n map<string,int> st;\n vector<string> vs;\n for(ll i=0;i<m;i++){\n string a,b;\n ll d,t;\n cin>>a>>b>>d>>t;\n if(st.find(a)==st.end()){\n\tst[a]=vs.size();\n\tvs.push_back(a);\n }\n if(st.find(b)==st.end()){\n\tst[b]=vs.size();\n\tvs.push_back(b);\n }\n G[st[a]].push_back(P(st[b],d/40+t));\n G[st[b]].push_back(P(st[a],d/40+t));\n }\n ll ans=0;\n ll dp[n];\n priority_queue<P,vector<P>,greater<P> > q;\n memset(dp,-1,sizeof(dp));\n q.push(P(0,st[s]));\n while(!q.empty()){\n P pp=q.top();q.pop();\n ll v=pp.second,d=pp.first;\n if(~dp[v]&&dp[v]<=d) continue;\n dp[v]=d;\n if(v==st[p]) break;\n for(ll i=0;i<(ll)G[v].size();i++){\n\tq.push(P(d+G[v][i].second,G[v][i].first));\n }\n }\n while(!q.empty()) q.pop();\n ans+=dp[st[p]];\n memset(dp,-1,sizeof(dp));\n q.push(P(0,st[p]));\n while(!q.empty()){\n P pp=q.top();q.pop();\n ll v=pp.second,d=pp.first;\n if(~dp[v]&&dp[v]<=d) continue;\n dp[v]=d;\n if(v==st[g]) break;\n for(ll i=0;i<(ll)G[v].size();i++){\n\tq.push(P(d+G[v][i].second,G[v][i].first));\n }\n }\n ans+=dp[st[g]];\n cout<<ans<<endl;\n } \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3424,"score_of_the_acc":-0.5917,"final_rank":6},{"submission_id":"aoj_2283_1879614","code_snippet":"#include <iostream>\n#include <map>\n#include <algorithm>\n \nusing namespace std;\n \nconst int MAX = 500;\nconst int INF = 1e9;\n \nint main(){\n int n,m;\n \n while(cin >> n >> m, n | m){\n\tmap<string,int> mp;\n\tint dist[MAX+1][MAX+1];\n\tstring a,b,start,goal,via;\n\tint c,d;\n \n\tfor(int i = 0 ; i <= n ; i++){\n\t for(int j = 0 ; j <= n ; j++){\n\t\tdist[i][j] = INF;\n\t }\n\t}\n \n\tcin >> start >> via >> goal;\n \n\tint s = 1;\n\tfor(int i = 0 ; i < m ; i++){\n\t cin >> a >> b >> c >> d;\n \n\t if(!mp[a]){\n\t\tmp[a] = s++;\n\t }\n\t if(!mp[b]){ \n\t\tmp[b] = s++;\n\t }\n \n\t dist[mp[a]][mp[b]] = dist[mp[b]][mp[a]] = c / 40 + d;\n\t}\n \n\tfor(int k = 1 ; k <= n ; k++){\n\t for(int i = 1 ; i <= n ; i++){\n\t\tfor(int j = 1 ; j <= n ; j++){\n\t\t dist[i][j] = min(dist[i][j] ,dist[i][k] + dist[k][j]);\n\t\t}\n\t }\n\t}\n\tcout << dist[mp[start]][mp[via]] + dist[mp[via]][mp[goal]] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":330,"memory_kb":4148,"score_of_the_acc":-1.3125,"final_rank":18},{"submission_id":"aoj_2283_1805299","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nstring S[5000],T[5000],V[5000],A,B,C;int a[5000],b[5000],n,m,dist[5000];\nvector<string>U;vector<pair<int,int>>x[500];\nint dfs(int s,int g){\n\tfor(int i=0;i<5000;i++)dist[i]=1<<30;\n\tdist[s]=0;\n\tfor(int i=0;i<n;i++){\n\t\tfor(int j=0;j<n;j++){\n\t\t\tfor(int k=0;k<x[j].size();k++){\n\t\t\t\tdist[x[j][k].first]=min(dist[x[j][k].first],dist[j]+x[j][k].second);\n\t\t\t}\n\t\t}\n\t}\n\treturn dist[g];\n}\nint main(){\n\twhile(true){\n\t\tcin>>n>>m;for(int i=0;i<500;i++)x[i].clear();\n\t\tif(n==0){break;}U.clear();cin>>A>>B>>C;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tcin>>S[i]>>T[i]>>a[i]>>b[i];\n\t\t\tU.push_back(S[i]);U.push_back(T[i]);\n\t\t}\n\t\tsort(U.begin(),U.end());V[0]=U[0];int cnt=1,G,H,I;\n\t\tfor(int i=1;i<U.size();i++){\n\t\t\tif(U[i]!=U[i-1]){V[cnt]=U[i];cnt++;}\n\t\t}\n\t\tfor(int i=0;i<cnt;i++){\n\t\t\tif(A==V[i])G=i;\n\t\t\tif(B==V[i])H=i;\n\t\t\tif(C==V[i])I=i;\n\t\t}\n\t\tfor(int i=0;i<m;i++){\n\t\t\tint s1=0,t1=0;\n\t\t\tfor(int j=0;j<cnt;j++){\n\t\t\t\tif(S[i]==V[j])s1=j;\n\t\t\t\tif(T[i]==V[j])t1=j;\n\t\t\t}\n\t\t\tx[s1].push_back(make_pair(t1,a[i]/40+b[i]));\n\t\t\tx[t1].push_back(make_pair(s1,a[i]/40+b[i]));\n\t\t}\n\t\tcout<<dfs(G,H)+dfs(H,I)<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3900,"score_of_the_acc":-0.868,"final_rank":15},{"submission_id":"aoj_2283_1791430","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst int inf=1e9;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\nint main(){\n\tint n,q;\n\twhile(cin>>n>>q,n+q){\n\t\tstring s,p,g;\n\t\tcin>>s>>p>>g;\n\t\tmap<string,int>m;\n\t\tint co=1;\n\t\tvvi cost(n+1,vi(n+1,inf));\n\t\twhile(q--){\n\t\t\tstring a,b;\n\t\t\tint d,t;\n\t\t\tcin>>a>>b>>d>>t;\n\t\t\tif(m[a]==0)m[a]=co++;\n\t\t\tif(m[b]==0)m[b]=co++;\n\t\t\tcost[m[a]][m[b]]=cost[m[b]][m[a]]=d/40+t;\n\t\t}\n\t\trep(k,n+1)rep(i,n+1)rep(j,n+1)\n\t\t\tcost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j]);\n\t\tcout<<cost[m[s]][m[p]]+cost[m[p]][m[g]]<<endl;\n\t}\n}","accuracy":1,"time_ms":570,"memory_kb":2296,"score_of_the_acc":-1.222,"final_rank":16},{"submission_id":"aoj_2283_1493018","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nstruct edge{\n int to, cost;\n};\ntypedef pair<int, int> pii;//cost vertex\ntypedef pair<int ,pii> piii;//cost vertex state\nint main(int argc, char *argv[]){\n int n, m;\n while(cin >> n >> m, n){\n string s, p, goal;\n map<string, int> msi;\n cin >> s >> p >> goal;\n msi[s] = msi.size() - 1;\n msi[p] = msi.size() - 1;\n msi[goal] = msi.size() - 1;\n int S = msi[s], P = msi[p], GOAL = msi[goal];\n vector<vector<edge> > g(n, vector<edge>());\n vector<vector<int> > dp(2, vector<int>(n, 1e9));\n for (int i = 0; i < m; i++) {\n int d, t, from, to;\n string a, b;\n cin >> a >> b >> d >> t;\n if(msi.find(a) == msi.end())\n msi[a] = msi.size() - 1;\n if(msi.find(b) == msi.end())\n msi[b] = msi.size() - 1;\n to = msi[a];\n from = msi[b];\n //std::cout << \"to:\" << to << \" from:\" << from << std::endl;\n g[to].push_back(edge{from, d/40 + t});\n g[from].push_back(edge{to, d/40 + t});\n }\n priority_queue<piii, vector<piii>, greater<piii> > que;\n que.push(piii(0, pii(S, 0)));\n dp[0][S] = 0;\n while(!que.empty()){\n int v = que.top().second.first;\n int c = que.top().first;\n int state = que.top().second.second;\n que.pop();\n for (int i = 0; i < g[v].size(); i++) {\n int st = state;\n edge e = g[v][i];\n if(dp[state][e.to] > c + e.cost){\n if(e.to == P)st = 1;\n dp[state][e.to] = c + e.cost;\n que.push(piii(c + e.cost, pii(e.to, st)));\n }\n }\n }\n std::cout << dp[1][GOAL] << std::endl;\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":1504,"score_of_the_acc":-0.0714,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2283_9847642\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\nusing ll = long long;\\n\\nconst ll INF = static_cast<ll>(1) << 62;\\n\\nvoid solve() {\\n ll n, m; cin >> m;\\n string s, t, f; cin >> s >> t >> f;\\n map<string, vector<pair<string, ll>>>g;\\n map<string, ll>d;\\n for (int i = 0; i < m; i++) {\\n string a, b; cin >> a >> b;\\n d[a] = INF;\\n d[b] = INF;\\n ll d; cin >> d;\\n ll t; cin >> t;\\n g[a].emplace_back(b, d / 40 + t);\\n g[b].emplace_back(a, d / 40 + t);\\n }\\n set<pair<ll, string>>q;\\n q.insert({0, t});\\n d[t] = 0;\\n while (!q.empty()) {\\n ll val = q.begin() -> first;\\n string v = q.begin() -> second;\\n q.erase(q.begin());\\n for (auto [to, w] : g[v]) {\\n if (d[v] + w < d[to]) {\\n q.erase({d[to], to});\\n d[to] = d[v] + w;\\n q.insert({d[to], to});\\n }\\n }\\n }\\n cout << d[s] + d[f] << '\\\\n';\\n}\\n\\nint main() {\\n ll T; cin >> T;\\n while (T != 0) {\\n solve();\\n cin >> T;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4092,\n \"score_of_the_acc\": -0.7611,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2283_7831713\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\ntemplate<typename T>\\nstruct Dijkstra{\\n const T inf=numeric_limits<T>::max();\\n using P=pair<T,int>;\\n int n;\\n vector<vector<pair<int,T>>> g;\\n vector<T> d;\\n Dijkstra(int n):n(n),g(n),d(n){}\\n void add_edge(int u,int v,T w){\\n g[u].emplace_back(v,w);\\n g[v].emplace_back(u,w);\\n }\\n vector<T> build(int s){\\n for(int i=0;i<n;i++){\\n d[i]=inf;\\n }\\n d[s]=0;\\n priority_queue<P,vector<P>,greater<P>> pq;\\n pq.emplace(d[s],s);\\n while(pq.size()){\\n P p=pq.top(); pq.pop();\\n int v=p.second;\\n if(d[v]<p.first)continue;\\n for(auto &e:g[v]){\\n int u=e.first; T c=e.second;\\n if(d[u]>d[v]+c){\\n d[u]=d[v]+c;\\n pq.emplace(d[u],u);\\n }\\n }\\n }\\n return d;\\n }\\n};\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int n,m;\\n while(cin >> n >> m, n) {\\n map<string,int> mp;\\n auto id = [&]() -> int {\\n string s; cin >> s;\\n if (mp.find(s) != mp.end()) {\\n return mp[s];\\n }\\n else {\\n int i = mp.size();\\n mp[s] = i;\\n return i;\\n }\\n };\\n int a = id(), b = id(), c = id();\\n Dijkstra<int> g(n);\\n for (int i = 0; i < m; ++i) {\\n int x = id(), y = id();\\n int d,t; cin >> d >> t;\\n g.add_edge(x, y, d/40+t);\\n }\\n cout << g.build(a)[b] + g.build(b)[c] << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3392,\n \"score_of_the_acc\": -0.5291,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2283_5031728\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\nnamespace CharacterClass {\\n\\tconstexpr string_view\\n\\t digit = \\\"0123456789\\\",\\n\\t xdigit = \\\"0123456789ABCDEFabcdef\\\", lower = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n\\t upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n\\t alpha = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t alnum = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t word = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\\\",\\n\\t punct = R\\\"(!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~)\\\",\\n\\t graph =\\n\\t R\\\"(!\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t print =\\n\\t R\\\"( !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t blank = \\\" \\\\t\\\", space = \\\" \\\\t\\\\n\\\\r\\\\f\\\\v\\\";\\n} // namespace CharacterClass\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Output {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid put(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(bool v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(vector<bool>::reference v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid put(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid put(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid put(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void put(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\\n\\t\\tput(v.first);\\n\\t\\tput(D.d);\\n\\t\\tput(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) put(D.d);\\n\\t\\t\\tput(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void put(const vector<T>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void put(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) put(D.l);\\n\\t\\t\\tput(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tOutput() = default;\\n\\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tOutput& operator()() {\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Output& operator()(H&& h) {\\n\\t\\tput(h);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\\n\\t\\tput(h);\\n\\t\\tput(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tOutput& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tput_range(begin, end);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Output& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tOutput& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 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 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/GraphTemplate.cpp\\\"\\nusing namespace std;\\n\\nusing Weight = long long;\\nconstexpr Weight INF = numeric_limits<Weight>::max();\\nstruct Edge {\\n\\tint to;\\n\\tWeight cost;\\n\\tEdge() : to(-1), cost(-1) {}\\n\\tEdge(int _to, Weight _cost = 1) : to(_to), cost(_cost) {}\\n\\tfriend bool operator<(const Edge& e1, const Edge& e2) {\\n\\t\\treturn e1.cost < e2.cost;\\n\\t}\\n\\tfriend bool operator>(const Edge& e1, const Edge& e2) {\\n\\t\\treturn e1.cost > e2.cost;\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Edge& e) {\\n\\t\\treturn os << \\\"->\\\" << e.to << '(' << e.cost << ')';\\n\\t}\\n};\\nusing Graph = vector<vector<Edge>>;\\nstruct Edge2 {\\n\\tint from, to;\\n\\tWeight cost;\\n\\tEdge2() : from(-1), to(-1), cost(0) {}\\n\\tEdge2(int _from, int _to, Weight _cost) : from(_from), to(_to), cost(_cost) {}\\n\\tfriend bool operator<(const Edge2& e1, const Edge2& e2) {\\n\\t\\treturn e1.cost < e2.cost;\\n\\t}\\n\\tfriend bool operator>(const Edge2& e1, const Edge2& e2) {\\n\\t\\treturn e1.cost > e2.cost;\\n\\t}\\n\\tfriend ostream& operator<<(ostream& os, const Edge2& e) {\\n\\t\\treturn os << e.from << \\\"->\\\" << e.to << '(' << e.cost << ')';\\n\\t}\\n};\\nusing Edges = vector<Edge2>;\\nusing Matrix = vector<vector<Weight>>;\\n#line 5 \\\"/home/yuruhiya/programming/library/Graph/DijkstraST.cpp\\\"\\nusing namespace std;\\n\\nWeight Dijkstra(const Graph& graph, int s, int t) {\\n\\tint V = graph.size();\\n\\tvector<Weight> dist(V, INF);\\n\\tdist[s] = 0;\\n\\tpriority_queue<Edge, vector<Edge>, greater<Edge>> pq;\\n\\tpq.emplace(s, 0);\\n\\twhile (!pq.empty()) {\\n\\t\\tEdge p = pq.top();\\n\\t\\tpq.pop();\\n\\t\\tint v = p.to;\\n\\t\\tif (v == t) return dist[t];\\n\\t\\tif (dist[v] < p.cost) continue;\\n\\t\\tfor (auto e : graph[v]) {\\n\\t\\t\\tif (dist[e.to] > dist[v] + e.cost) {\\n\\t\\t\\t\\tdist[e.to] = dist[v] + e.cost;\\n\\t\\t\\t\\tpq.emplace(e.to, dist[e.to]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist[t];\\n}\\n#line 3 \\\"a.cpp\\\"\\n\\nll solve(int n, int m) {\\n\\tmap<string, int> str;\\n\\tint k = 0;\\n\\tVS s = in[3];\\n\\tvector<tuple<string, string, ll>> edges;\\n\\trep(i, m) {\\n\\t\\tins(s, t);\\n\\t\\tinl(a, b);\\n\\t\\tedges.emplace_back(s, t, a / 40 + b);\\n\\t\\tif (str.count(s) == 0) str[s] = k++;\\n\\t\\tif (str.count(t) == 0) str[t] = k++;\\n\\t}\\n\\n\\tGraph g(n);\\n\\tfor (auto [s, t, d] : edges) {\\n\\t\\tg[str[s]].emplace_back(str[t], d);\\n\\t\\tg[str[t]].emplace_back(str[s], d);\\n\\t}\\n\\n\\tint start = str[s[0]], passing = str[s[1]], goal = str[s[2]];\\n\\treturn Dijkstra(g, start, passing) + Dijkstra(g, passing, goal);\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tini(n, m);\\n\\t\\tif (n + m == 0) break;\\n\\t\\tout(solve(n, m));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4080,\n \"score_of_the_acc\": -0.722,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2283_3736117\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<set>\\n#include<map>\\n#include<queue>\\nusing namespace std;\\n\\nint main(){\\n int n, m;\\n while(cin >> n >> m, n+m){\\n string s, t, g;\\n cin >> s >> t >> g;\\n map<string, vector<pair<string,int>>> ma;\\n for(int i = 0; i < m; i++){\\n string a, b;\\n int c, d;\\n cin >> a >> b >> c >> d;\\n ma[a].push_back({b, c/40+d});\\n ma[b].push_back({a, c/40+d});\\n }\\n map<string,int> dp;\\n for(auto p : ma) dp[p.first] = 1<<30;\\n dp[s] = 0;\\n priority_queue<pair<int,string>> pq;\\n pq.push({-0, s});\\n while(!pq.empty()){\\n auto p = pq.top(); pq.pop();\\n string pos = p.second;\\n int cost = -p.first;\\n if(dp[pos] != cost) continue;\\n for(auto next : ma[pos]){\\n int ncost = cost + next.second;\\n string npos = next.first;\\n if(dp[npos] > ncost){\\n dp[npos] = ncost;\\n pq.push({-ncost, npos});\\n }\\n }\\n }\\n int ans = dp[t];\\n for(auto p : ma) dp[p.first] = 1<<30;\\n dp[t] = 0;\\n pq.push({-0, t});\\n while(!pq.empty()){\\n auto p = pq.top(); pq.pop();\\n string pos = p.second;\\n int cost = -p.first;\\n if(dp[pos] != cost) continue;\\n for(auto next : ma[pos]){\\n int ncost = cost + next.second;\\n string npos = next.first;\\n if(dp[npos] > ncost){\\n dp[npos] = ncost;\\n pq.push({-ncost, npos});\\n }\\n }\\n }\\n ans += dp[g];\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3836,\n \"score_of_the_acc\": -0.725,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2283_3341603\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\nstruct edge{ int to,cost; };\\nconst int INF = INT_MAX/3;\\n\\nint main(){\\n int n,m;\\n while(cin >>n >>m,n){\\n string s,p,g;\\n cin >>s >>p >>g;\\n\\n map<string,int> name2idx;\\n name2idx[s] = 0;\\n name2idx[p] = 1;\\n name2idx[g] = 2;\\n\\n int V = 3;\\n\\n vector<string> a(m),b(m);\\n vector<int> c(m);\\n rep(i,m){\\n int d,t;\\n cin >>a[i] >>b[i] >>d >>t;\\n\\n c[i] = d/40 + t;\\n\\n if(!name2idx.count(a[i])){\\n name2idx[a[i]] = V;\\n ++V;\\n }\\n if(!name2idx.count(b[i])){\\n name2idx[b[i]] = V;\\n ++V;\\n }\\n }\\n\\n vector<vector<edge>> G(V);\\n rep(i,m){\\n int u = name2idx[a[i]], v = name2idx[b[i]];\\n G[u].pb({v,c[i]});\\n G[v].pb({u,c[i]});\\n }\\n\\n vector<int> d(V,INF);\\n d[1] = 0;\\n\\n using pi = pair<int,int>;\\n priority_queue<pi, vector<pi>, greater<pi>> pq;\\n pq.push({0,1});\\n while(!pq.empty()){\\n pi now = pq.top();\\n pq.pop();\\n int v = now.se;\\n if(now.fi > d[v]) continue;\\n for(const auto &e:G[v]){\\n if(d[e.to] > d[v]+e.cost){\\n d[e.to] = d[v]+e.cost;\\n pq.push({d[e.to], e.to});\\n }\\n }\\n }\\n\\n cout << d[0]+d[2] << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3844,\n \"score_of_the_acc\": -0.7094,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2283_2656893\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\nusing ld = long double;\\nconst ld eps = 1e-9;\\n\\n\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tint N,M;cin>>N>>M;\\n\\t\\tif(!N)break;\\n\\t\\tmap<string,int>stmp;\\n\\t\\tstring S,P,G;cin>>S>>P>>G;\\n\\t\\tstmp[S]=0;\\n\\t\\tstmp[P]=1;\\n\\t\\tstmp[G]=2;\\n\\t\\tint id=3;\\n\\t\\tvector<vector<pair<int,int>>>edges(N);\\n\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\tstring s,t;cin>>s>>t;\\n\\t\\t\\tint d,c;cin>>d>>c;\\n\\t\\t\\tint cost=d/40+c;\\n\\t\\t\\tif (stmp.find(s) == stmp.end()) {\\n\\t\\t\\t\\tstmp[s]=id++;\\n\\t\\t\\t}\\n\\t\\t\\tif (stmp.find(t) == stmp.end()) {\\n\\t\\t\\t\\tstmp[t]=id++;\\n\\t\\t\\t}\\n\\t\\t\\tedges[stmp[s]].push_back(make_pair(stmp[t],cost));\\n\\t\\t\\tedges[stmp[t]].push_back(make_pair(stmp[s],cost));\\n\\t\\t}\\n\\t\\tvector<int>memo(N,1e9);\\n\\t\\tmemo[stmp[P]]=0;\\n\\t\\tpriority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>que;\\n\\t\\tque.push(make_pair(0,stmp[P]));\\n\\t\\twhile (!que.empty()) {\\n\\t\\t\\tauto atop(que.top());\\n\\t\\t\\tque.pop();\\n\\t\\t\\tint now=atop.second;\\n\\t\\t\\tint cost=atop.first;\\n\\t\\t\\tfor (auto e : edges[now]) {\\n\\t\\t\\t\\tconst int nextcost=cost+e.second;\\n\\t\\t\\t\\tconst int next=e.first;\\n\\t\\t\\t\\tif (memo[next] > nextcost) {\\n\\t\\t\\t\\t\\tmemo[next]=nextcost;\\n\\t\\t\\t\\t\\tque.push(make_pair(memo[next],next));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint ans=memo[stmp[S]]+memo[stmp[G]];\\n\\t\\tcout<<ans<<endl;\\n\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.5681,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2283_2601353\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\nstring s1,s2,s3,s4,s5;\\nint ti,dist,n,m,st,go,mi,p1,p2;\\nint d[502][502];\\nmap<string,int>M;\\nint main(){\\n while(cin>>n>>m,n){\\n M.clear();\\n r(i,502)r(j,502)d[i][j]=1e8;\\n int c=0;\\n cin>>s1>>s2>>s3;\\n r(i,m){\\n cin>>s4>>s5>>dist>>ti;\\n if(M[s4])p1=M[s4];\\n else M[s4]=++c,p1=M[s4];\\n if(M[s5])p2=M[s5];\\n else M[s5]=++c,p2=M[s5];\\n if(s1==s5)st=M[s5];\\n if(s1==s4)st=M[s4];\\n if(s2==s5)mi=M[s5];\\n if(s2==s4)mi=M[s4];\\n if(s3==s5)go=M[s5];\\n if(s3==s4)go=M[s4];\\n d[p1][p2]=d[p2][p1]=dist/40+ti;\\n }\\n r(o,n+1)r(i,n+1)r(j,n+1)d[i][j]=min(d[i][j],d[i][o]+d[o][j]);\\n cout<<d[st][mi]+d[mi][go]<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 4216,\n \"score_of_the_acc\": -1.3494,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2283_2535449\",\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\\n\\nstruct Info{\\n\\tInfo(int arg_to,int arg_dist,int arg_delay){\\n\\t\\tto = arg_to;\\n\\t\\tdist = arg_dist;\\n\\t\\tdelay = arg_delay;\\n\\t}\\n\\tint to,dist,delay;\\n};\\n\\nstruct Data{\\n\\tData(int arg_station,int arg_sum_time){\\n\\t\\tstation = arg_station;\\n\\t\\tsum_time = arg_sum_time;\\n\\t}\\n\\tbool operator<(const struct Data &arg) const{\\n\\t\\treturn sum_time > arg.sum_time;\\n\\t};\\n\\tint station,sum_time;\\n};\\n\\nint N,M,index;\\nchar table[500][21];\\n\\nchar start[21],mid[21],goal[21];\\n\\nbool strCmp(char* base, char* comp){\\n\\tint length1,length2;\\n\\tfor(length1=0;base[length1] != '\\\\0';length1++);\\n\\tfor(length2=0;comp[length2] != '\\\\0';length2++);\\n\\tif(length1 != length2)return false;\\n\\n\\tfor(int i=0;base[i] != '\\\\0'; i++){\\n\\t\\tif(base[i] != comp[i])return false;\\n\\t}\\n\\treturn true;\\n}\\n\\nvoid strcpy(char* to,char* str){\\n\\tfor(int i=0;str[i] != '\\\\0';i++){\\n\\t\\tto[i] = str[i];\\n\\t\\tto[i+1] = '\\\\0';\\n\\t}\\n}\\n\\nvoid func(){\\n\\tscanf(\\\"%s %s %s\\\",start,mid,goal);\\n\\n\\tstrcpy(table[0],start);\\n\\tstrcpy(table[1],mid);\\n\\tstrcpy(table[2],goal);\\n\\n\\tvector<Info> V[N+1];\\n\\n\\tindex = 3;\\n\\n\\tchar left[21],right[21];\\n\\tint left_index,right_index,dist,delay;\\n\\n\\tbool FLG;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\t\\tscanf(\\\"%s %s %d %d\\\",left,right,&dist,&delay);\\n\\n\\t\\tFLG = false;\\n\\t\\tfor(int i = 0; i < index; i++){\\n\\t\\t\\tif(strCmp(table[i],left)){\\n\\t\\t\\t\\tleft_index = i;\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!FLG){\\n\\t\\t\\tleft_index = index;\\n\\t\\t\\tstrcpy(table[index++],left);\\n\\t\\t}\\n\\n\\t\\tFLG = false;\\n\\t\\tfor(int i = 0; i < index; i++){\\n\\t\\t\\tif(strCmp(table[i],right)){\\n\\t\\t\\t\\tright_index = i;\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!FLG){\\n\\t\\t\\tright_index = index;\\n\\t\\t\\tstrcpy(table[index++],right);\\n\\t\\t}\\n\\n\\t\\tV[left_index].push_back(Info(right_index,dist,delay));\\n\\t\\tV[right_index].push_back(Info(left_index,dist,delay));\\n\\t}\\n\\n\\tint min_time[N];\\n\\tint ans = 0;\\n\\n\\tpriority_queue<Data> Q;\\n\\n\\tfor(int loop = 0; loop < 2; loop++){\\n\\t\\tfor(int i = 0; i < N; i++)min_time[i] = BIG_NUM;\\n\\t\\tif(loop == 0){\\n\\t\\t\\tmin_time[0] = 0;\\n\\t\\t\\tQ.push(Data(0,0));\\n\\t\\t}else{\\n\\t\\t\\tmin_time[1] = 0;\\n\\t\\t\\tQ.push(Data(1,0));\\n\\t\\t}\\n\\n\\t\\twhile(!Q.empty()){\\n\\n\\t\\t\\tif((loop == 0 && Q.top().station == 1) || (loop == 0 && Q.top().station == 1)){\\n\\t\\t\\t\\tQ.pop();\\n\\t\\t\\t}else if(Q.top().sum_time > min_time[Q.top().station]){\\n\\t\\t\\t\\tQ.pop();\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tfor(int i = 0; i < V[Q.top().station].size(); i++){\\n\\t\\t\\t\\t\\tif(min_time[V[Q.top().station][i].to] > Q.top().sum_time+V[Q.top().station][i].dist/40+V[Q.top().station][i].delay){\\n\\t\\t\\t\\t\\t\\tmin_time[V[Q.top().station][i].to] = Q.top().sum_time+V[Q.top().station][i].dist/40+V[Q.top().station][i].delay;\\n\\t\\t\\t\\t\\t\\tQ.push(Data(V[Q.top().station][i].to,min_time[V[Q.top().station][i].to]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tQ.pop();\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(loop == 0){\\n\\t\\t\\tans += min_time[1];\\n\\t\\t}else{\\n\\t\\t\\tans += min_time[2];\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\t\\tif(N == 0 && M == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3328,\n \"score_of_the_acc\": -0.6184,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2283_2129963\",\n \"code_snippet\": \"#include <queue>\\n#include <limits>\\n#include <string>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\nstruct edge {\\n\\tint to, cost;\\n\\tedge(int to_, int cost_) : to(to_), cost(cost_) {};\\n};\\nbool operator<(const edge& e1, const edge& e2) {\\n\\treturn e1.cost < e2.cost;\\n}\\ntemplate<class Type>\\nstd::vector<Type> shortest_path(std::vector<std::vector<edge> > &G, int s) {\\n\\tstd::priority_queue<edge> que; que.push(edge(s, 0));\\n\\tstd::vector<Type> ret(G.size(), std::numeric_limits<Type>::max()); ret[s] = 0;\\n\\twhile (!que.empty()) {\\n\\t\\tedge u = que.top(); que.pop();\\n\\t\\tfor (edge e : G[u.to]) {\\n\\t\\t\\tif (ret[e.to] > ret[u.to] + e.cost) {\\n\\t\\t\\t\\tret[e.to] = ret[u.to] + e.cost;\\n\\t\\t\\t\\tque.push(edge(e.to, -ret[e.to]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\nint n, m, d, e;\\nint main() {\\n\\twhile (cin >> n >> m, n) {\\n\\t\\tstring s, t, g;\\n\\t\\tcin >> s >> t >> g;\\n\\t\\tvector<string> a(m), b(m), r; vector<int> x(m);\\n\\t\\tfor (int i = 0; i < m; i++) {\\n\\t\\t\\tcin >> a[i] >> b[i] >> d >> e;\\n\\t\\t\\tx[i] = d / 40 + e;\\n\\t\\t\\tr.push_back(a[i]);\\n\\t\\t\\tr.push_back(b[i]);\\n\\t\\t}\\n\\t\\tsort(r.begin(), r.end());\\n\\t\\tr.erase(unique(r.begin(), r.end()), r.end());\\n\\t\\tint sp = lower_bound(r.begin(), r.end(), s) - r.begin();\\n\\t\\tint tp = lower_bound(r.begin(), r.end(), t) - r.begin();\\n\\t\\tint gp = lower_bound(r.begin(), r.end(), g) - r.begin();\\n\\t\\tvector<vector<edge> > G(n);\\n\\t\\tfor (int i = 0; i < m; i++) {\\n\\t\\t\\tint ptr1 = lower_bound(r.begin(), r.end(), a[i]) - r.begin();\\n\\t\\t\\tint ptr2 = lower_bound(r.begin(), r.end(), b[i]) - r.begin();\\n\\t\\t\\tG[ptr1].push_back(edge(ptr2, x[i]));\\n\\t\\t\\tG[ptr2].push_back(edge(ptr1, x[i]));\\n\\t\\t}\\n\\t\\tint w1 = shortest_path<int>(G, sp)[tp];\\n\\t\\tint w2 = shortest_path<int>(G, tp)[gp];\\n\\t\\tcout << w1 + w2 << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3924,\n \"score_of_the_acc\": -0.7318,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2283_2127868\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define int long long\\n#define F first\\n#define S second\\n#define all(v) (v).begin(), (v).end()\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define reps(i, f, n) for(int i = (int)(f); i < (int)(n); i++)\\n#define each(a, b) for(auto& a : b)\\n\\ntypedef pair<int, int> P;\\n\\nconst int inf = 1LL << 55;\\n\\nint G[505][505];\\n\\nsigned main()\\n{\\n int n, m;\\n while(cin >> n >> m, n || m) {\\n fill(G[0], G[505], inf);\\n int cnt = 0;\\n map<string, int> stat;\\n string s, p, g; cin >> s >> p >> g;\\n stat[s] = cnt++; stat[p] = cnt++; stat[g] = cnt++;\\n while(m--) {\\n string a, b; int d, t;\\n cin >> a >> b >> d >> t;\\n if(stat.find(a) == stat.end()) stat[a] = cnt++;\\n if(stat.find(b) == stat.end()) stat[b] = cnt++;\\n G[stat[a]][stat[b]] = G[stat[b]][stat[a]] = d / 40 + t;\\n }\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < n; j++) {\\n\\tfor(int k = 0; k < n; k++) G[j][k] = min(G[j][k], G[j][i] + G[i][k]);\\n }\\n }\\n cout << G[stat[s]][stat[p]] + G[stat[p]][stat[g]] << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 5072,\n \"score_of_the_acc\": -1.6429,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2283_2127423\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n)for(int i=0;i<n;i++)\\nusing namespace std;\\ntypedef pair<int, int>P;\\n\\nint d1[550], d2[550];\\nchar s[50], p[50], g[50], a[50], b[50];\\nint main() {\\n\\tint n, m;\\n\\twhile (scanf(\\\"%d%d\\\", &n, &m), n) {\\n\\t\\tunordered_map<string, int>mp;\\n\\t\\tvector<P>E[550];\\n\\t\\tscanf(\\\"%s%s%s\\\", s, p, g);\\n\\t\\tmp[s] = 0; mp[p] = 1; mp[g] = 2;\\n\\t\\trep(i, m) {\\n\\t\\t\\tint d, t; scanf(\\\"%s%s%d%d\\\", a, b, &d, &t);\\n\\t\\t\\tif (mp.find(a) == mp.end())mp[a] = mp.size();\\n\\t\\t\\tif (mp.find(b) == mp.end())mp[b] = mp.size();\\n\\t\\t\\tE[mp[a]].push_back(P(d / 40 + t, mp[b]));\\n\\t\\t\\tE[mp[b]].push_back(P(d / 40 + t, mp[a]));\\n\\t\\t}\\n\\t\\tpriority_queue<P, vector<P>, greater<P>>que;\\n\\t\\tmemset(d1, 0x3f, sizeof(d1));\\n\\t\\td1[0] = 0; que.push(P(0, 0));\\n\\t\\twhile (!que.empty()) {\\n\\t\\t\\tP p = que.top(); que.pop();\\n\\t\\t\\tif (d1[p.second] != p.first)continue;\\n\\t\\t\\tfor (P u : E[p.second]) {\\n\\t\\t\\t\\tif (d1[u.second] > p.first + u.first) {\\n\\t\\t\\t\\t\\td1[u.second] = p.first + u.first;\\n\\t\\t\\t\\t\\tque.push(P(d1[u.second], u.second));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmemset(d2, 0x3f, sizeof(d2));\\n\\t\\td2[1] = 0; que.push(P(0, 1));\\n\\t\\twhile (!que.empty()) {\\n\\t\\t\\tP p = que.top(); que.pop();\\n\\t\\t\\tif (d2[p.second] != p.first)continue;\\n\\t\\t\\tfor (P u : E[p.second]) {\\n\\t\\t\\t\\tif (d2[u.second] > p.first + u.first) {\\n\\t\\t\\t\\t\\td2[u.second] = p.first + u.first;\\n\\t\\t\\t\\t\\tque.push(P(d2[u.second], u.second));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\", d1[1] + d2[2]);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.5683,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2283_2127418\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n)for(int i=0;i<n;i++)\\nusing namespace std;\\ntypedef pair<int, int>P;\\n\\nint d1[550], d2[550];\\nint main() {\\n\\tint n, m;\\n\\twhile (scanf(\\\"%d%d\\\", &n, &m), n) {\\n\\t\\tmap<string, int>mp;\\n\\t\\tvector<P>E[550];\\n\\t\\tstring s, p, g; cin >> s >> p >> g;\\n\\t\\tmp[s] = 0; mp[p] = 1; mp[g] = 2;\\n\\t\\trep(i, m) {\\n\\t\\t\\tstring a, b; int d, t; cin >> a >> b >> d >> t;\\n\\t\\t\\tif (mp.find(a) == mp.end())mp[a] = mp.size();\\n\\t\\t\\tif (mp.find(b) == mp.end())mp[b] = mp.size();\\n\\t\\t\\tE[mp[a]].push_back(P(d / 40 + t, mp[b]));\\n\\t\\t\\tE[mp[b]].push_back(P(d / 40 + t, mp[a]));\\n\\t\\t}\\n\\t\\tpriority_queue<P, vector<P>, greater<P>>que;\\n\\t\\tmemset(d1, 0x3f, sizeof(d1));\\n\\t\\td1[0] = 0; que.push(P(0, 0));\\n\\t\\twhile (!que.empty()) {\\n\\t\\t\\tP p = que.top(); que.pop();\\n\\t\\t\\tif (d1[p.second] != p.first)continue;\\n\\t\\t\\tfor (P u : E[p.second]) {\\n\\t\\t\\t\\tif (d1[u.second] > p.first + u.first) {\\n\\t\\t\\t\\t\\td1[u.second] = p.first + u.first;\\n\\t\\t\\t\\t\\tque.push(P(d1[u.second], u.second));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmemset(d2, 0x3f, sizeof(d2));\\n\\t\\td2[1] = 0; que.push(P(0, 1));\\n\\t\\twhile (!que.empty()) {\\n\\t\\t\\tP p = que.top(); que.pop();\\n\\t\\t\\tif (d2[p.second] != p.first)continue;\\n\\t\\t\\tfor (P u : E[p.second]) {\\n\\t\\t\\t\\tif (d2[u.second] > p.first + u.first) {\\n\\t\\t\\t\\t\\td2[u.second] = p.first + u.first;\\n\\t\\t\\t\\t\\tque.push(P(d2[u.second], u.second));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\", d1[1] + d2[2]);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.6028,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2283_2127343\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,ll> P;\\nint main(){\\n ll n,m;\\n while(cin>>n>>m,n||m){\\n string s,p,g;\\n cin>>s>>p>>g;\\n vector<P> G[n];\\n map<string,int> st;\\n vector<string> vs;\\n for(ll i=0;i<m;i++){\\n string a,b;\\n ll d,t;\\n cin>>a>>b>>d>>t;\\n if(st.find(a)==st.end()){\\n st[a]=vs.size();\\n vs.push_back(a);\\n }\\n if(st.find(b)==st.end()){\\n st[b]=vs.size();\\n vs.push_back(b);\\n }\\n G[st[a]].push_back(P(st[b],d/40+t));\\n G[st[b]].push_back(P(st[a],d/40+t));\\n }\\n ll ans=0;\\n ll dp[n];\\n priority_queue<P,vector<P>,greater<P> > q;\\n memset(dp,-1,sizeof(dp));\\n q.push(P(0,st[s]));\\n while(!q.empty()){\\n P pp=q.top();q.pop();\\n ll v=pp.second,d=pp.first;\\n if(~dp[v]&&dp[v]<=d) continue;\\n dp[v]=d;\\n if(v==st[p]) break;\\n for(ll i=0;i<(ll)G[v].size();i++){\\n q.push(P(d+G[v][i].second,G[v][i].first));\\n }\\n }\\n while(!q.empty()) q.pop();\\n ans+=dp[st[p]];\\n memset(dp,-1,sizeof(dp));\\n q.push(P(0,st[p]));\\n while(!q.empty()){\\n P pp=q.top();q.pop();\\n ll v=pp.second,d=pp.first;\\n if(~dp[v]&&dp[v]<=d) continue;\\n dp[v]=d;\\n if(v==st[g]) break;\\n for(ll i=0;i<(ll)G[v].size();i++){\\n q.push(P(d+G[v][i].second,G[v][i].first));\\n }\\n }\\n ans+=dp[st[g]];\\n cout<<ans<<endl;\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.5939,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2283_2127126\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define N 501\\n#define INF 1e9\\nusing namespace std;\\ntypedef pair<int,int> P;\\nvector<P> G[N];\\n\\n\\n\\nint dijkstra(int s,int g){\\n int D[N];\\n for(int i=0;i<N;i++) D[i]=INF;\\n priority_queue<P,vector<P>,greater<P> > Q;\\n Q.push(P(0,s));\\n D[s]=0;\\n while(!Q.empty()){\\n P t=Q.top();Q.pop();\\n int cost=t.first, pos=t.second;\\n if(pos==g) return cost;\\n if(D[pos]<cost) continue;\\n \\n for(int i=0;i<G[pos].size();i++){\\n int nx=G[pos][i].first;\\n int ncost=cost+G[pos][i].second;\\n if(D[nx]>ncost) Q.push(P(ncost,nx)),D[nx]=ncost;\\n }\\n }\\n cout<<\\\"OK\\\"<<endl;\\n return -1;\\n}\\n\\n\\nint main(){\\n while(1){\\n int n,m;\\n cin>>n>>m;\\n if(!n&&!m)break;\\n string s,p,g;\\n cin>>s>>p>>g;\\n map<string,int> M;\\n for(int i=0;i<N;i++) G[i].clear();\\n for(int i=0,d,t,cnt=0;i<m;i++) {\\n string a,b;\\n cin>>a>>b>>d>>t;\\n if(!M.count(a)) M[a]=cnt++;\\n if(!M.count(b)) M[b]=cnt++;\\n G[M[a]].push_back(P(M[b],d/40+t));\\n G[M[b]].push_back(P(M[a],d/40+t));\\n }\\n int ans= dijkstra(M[s],M[p]);\\n ans=ans+dijkstra(M[p],M[g]);\\n\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.567,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2283_2127098\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nmap<string,int> ma;\\nvoid in(string s) {\\n if(!ma.count(s)) {\\n int k=ma.size();\\n ma[s]=k;\\n }\\n}\\n\\nint main() {\\n int n,m;\\n while(cin >> n >> m && n) {\\n ma.clear();\\n string r[3];\\n for(int i=0; i<3; i++) {\\n cin >> r[i];\\n in(r[i]);\\n }\\n int d[n][n];\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++)d[i][j]=1<<29;\\n d[i][i]=0;\\n }\\n for(int i=0; i<m; i++) {\\n string s,t;\\n int b,c;\\n cin >> s >> t >> b >> c;\\n in(s);in(t);\\n d[ma[s]][ma[t]]=b/40+c;\\n d[ma[t]][ma[s]]=b/40+c;\\n }\\n for(int k=0;k<n;k++)for(int i=0;i<n;i++)for(int j=0;j<n;j++)d[i][j]=min(d[i][j],d[i][k]+d[k][j]);\\n cout << d[ma[r[0]]][ma[r[1]]]+d[ma[r[1]]][ma[r[2]]] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 4076,\n \"score_of_the_acc\": -1.2566,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2283_2127065\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll,ll> P;\\nint main(){\\n ll n,m;\\n while(cin>>n>>m,n||m){\\n string s,p,g;\\n cin>>s>>p>>g;\\n vector<P> G[n];\\n map<string,int> st;\\n vector<string> vs;\\n for(ll i=0;i<m;i++){\\n string a,b;\\n ll d,t;\\n cin>>a>>b>>d>>t;\\n if(st.find(a)==st.end()){\\n\\tst[a]=vs.size();\\n\\tvs.push_back(a);\\n }\\n if(st.find(b)==st.end()){\\n\\tst[b]=vs.size();\\n\\tvs.push_back(b);\\n }\\n G[st[a]].push_back(P(st[b],d/40+t));\\n G[st[b]].push_back(P(st[a],d/40+t));\\n }\\n ll ans=0;\\n ll dp[n];\\n priority_queue<P,vector<P>,greater<P> > q;\\n memset(dp,-1,sizeof(dp));\\n q.push(P(0,st[s]));\\n while(!q.empty()){\\n P pp=q.top();q.pop();\\n ll v=pp.second,d=pp.first;\\n if(~dp[v]&&dp[v]<=d) continue;\\n dp[v]=d;\\n if(v==st[p]) break;\\n for(ll i=0;i<(ll)G[v].size();i++){\\n\\tq.push(P(d+G[v][i].second,G[v][i].first));\\n }\\n }\\n while(!q.empty()) q.pop();\\n ans+=dp[st[p]];\\n memset(dp,-1,sizeof(dp));\\n q.push(P(0,st[p]));\\n while(!q.empty()){\\n P pp=q.top();q.pop();\\n ll v=pp.second,d=pp.first;\\n if(~dp[v]&&dp[v]<=d) continue;\\n dp[v]=d;\\n if(v==st[g]) break;\\n for(ll i=0;i<(ll)G[v].size();i++){\\n\\tq.push(P(d+G[v][i].second,G[v][i].first));\\n }\\n }\\n ans+=dp[st[g]];\\n cout<<ans<<endl;\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -0.5917,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2283_1879614\",\n \"code_snippet\": \"#include <iostream>\\n#include <map>\\n#include <algorithm>\\n \\nusing namespace std;\\n \\nconst int MAX = 500;\\nconst int INF = 1e9;\\n \\nint main(){\\n int n,m;\\n \\n while(cin >> n >> m, n | m){\\n\\tmap<string,int> mp;\\n\\tint dist[MAX+1][MAX+1];\\n\\tstring a,b,start,goal,via;\\n\\tint c,d;\\n \\n\\tfor(int i = 0 ; i <= n ; i++){\\n\\t for(int j = 0 ; j <= n ; j++){\\n\\t\\tdist[i][j] = INF;\\n\\t }\\n\\t}\\n \\n\\tcin >> start >> via >> goal;\\n \\n\\tint s = 1;\\n\\tfor(int i = 0 ; i < m ; i++){\\n\\t cin >> a >> b >> c >> d;\\n \\n\\t if(!mp[a]){\\n\\t\\tmp[a] = s++;\\n\\t }\\n\\t if(!mp[b]){ \\n\\t\\tmp[b] = s++;\\n\\t }\\n \\n\\t dist[mp[a]][mp[b]] = dist[mp[b]][mp[a]] = c / 40 + d;\\n\\t}\\n \\n\\tfor(int k = 1 ; k <= n ; k++){\\n\\t for(int i = 1 ; i <= n ; i++){\\n\\t\\tfor(int j = 1 ; j <= n ; j++){\\n\\t\\t dist[i][j] = min(dist[i][j] ,dist[i][k] + dist[k][j]);\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tcout << dist[mp[start]][mp[via]] + dist[mp[via]][mp[goal]] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 330,\n \"memory_kb\": 4148,\n \"score_of_the_acc\": -1.3125,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2283_1805299\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nstring S[5000],T[5000],V[5000],A,B,C;int a[5000],b[5000],n,m,dist[5000];\\nvector<string>U;vector<pair<int,int>>x[500];\\nint dfs(int s,int g){\\n\\tfor(int i=0;i<5000;i++)dist[i]=1<<30;\\n\\tdist[s]=0;\\n\\tfor(int i=0;i<n;i++){\\n\\t\\tfor(int j=0;j<n;j++){\\n\\t\\t\\tfor(int k=0;k<x[j].size();k++){\\n\\t\\t\\t\\tdist[x[j][k].first]=min(dist[x[j][k].first],dist[j]+x[j][k].second);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn dist[g];\\n}\\nint main(){\\n\\twhile(true){\\n\\t\\tcin>>n>>m;for(int i=0;i<500;i++)x[i].clear();\\n\\t\\tif(n==0){break;}U.clear();cin>>A>>B>>C;\\n\\t\\tfor(int i=0;i<m;i++){\\n\\t\\t\\tcin>>S[i]>>T[i]>>a[i]>>b[i];\\n\\t\\t\\tU.push_back(S[i]);U.push_back(T[i]);\\n\\t\\t}\\n\\t\\tsort(U.begin(),U.end());V[0]=U[0];int cnt=1,G,H,I;\\n\\t\\tfor(int i=1;i<U.size();i++){\\n\\t\\t\\tif(U[i]!=U[i-1]){V[cnt]=U[i];cnt++;}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<cnt;i++){\\n\\t\\t\\tif(A==V[i])G=i;\\n\\t\\t\\tif(B==V[i])H=i;\\n\\t\\t\\tif(C==V[i])I=i;\\n\\t\\t}\\n\\t\\tfor(int i=0;i<m;i++){\\n\\t\\t\\tint s1=0,t1=0;\\n\\t\\t\\tfor(int j=0;j<cnt;j++){\\n\\t\\t\\t\\tif(S[i]==V[j])s1=j;\\n\\t\\t\\t\\tif(T[i]==V[j])t1=j;\\n\\t\\t\\t}\\n\\t\\t\\tx[s1].push_back(make_pair(t1,a[i]/40+b[i]));\\n\\t\\t\\tx[t1].push_back(make_pair(s1,a[i]/40+b[i]));\\n\\t\\t}\\n\\t\\tcout<<dfs(G,H)+dfs(H,I)<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3900,\n \"score_of_the_acc\": -0.868,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2283_1791430\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\nconst double PI=acos(-1);\\nconst double EPS=1e-10;\\nconst int inf=1e9;\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int,int> pii;\\nint main(){\\n\\tint n,q;\\n\\twhile(cin>>n>>q,n+q){\\n\\t\\tstring s,p,g;\\n\\t\\tcin>>s>>p>>g;\\n\\t\\tmap<string,int>m;\\n\\t\\tint co=1;\\n\\t\\tvvi cost(n+1,vi(n+1,inf));\\n\\t\\twhile(q--){\\n\\t\\t\\tstring a,b;\\n\\t\\t\\tint d,t;\\n\\t\\t\\tcin>>a>>b>>d>>t;\\n\\t\\t\\tif(m[a]==0)m[a]=co++;\\n\\t\\t\\tif(m[b]==0)m[b]=co++;\\n\\t\\t\\tcost[m[a]][m[b]]=cost[m[b]][m[a]]=d/40+t;\\n\\t\\t}\\n\\t\\trep(k,n+1)rep(i,n+1)rep(j,n+1)\\n\\t\\t\\tcost[i][j]=min(cost[i][j],cost[i][k]+cost[k][j]);\\n\\t\\tcout<<cost[m[s]][m[p]]+cost[m[p]][m[g]]<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 570,\n \"memory_kb\": 2296,\n \"score_of_the_acc\": -1.222,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2283_1493018\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nstruct edge{\\n int to, cost;\\n};\\ntypedef pair<int, int> pii;//cost vertex\\ntypedef pair<int ,pii> piii;//cost vertex state\\nint main(int argc, char *argv[]){\\n int n, m;\\n while(cin >> n >> m, n){\\n string s, p, goal;\\n map<string, int> msi;\\n cin >> s >> p >> goal;\\n msi[s] = msi.size() - 1;\\n msi[p] = msi.size() - 1;\\n msi[goal] = msi.size() - 1;\\n int S = msi[s], P = msi[p], GOAL = msi[goal];\\n vector<vector<edge> > g(n, vector<edge>());\\n vector<vector<int> > dp(2, vector<int>(n, 1e9));\\n for (int i = 0; i < m; i++) {\\n int d, t, from, to;\\n string a, b;\\n cin >> a >> b >> d >> t;\\n if(msi.find(a) == msi.end())\\n msi[a] = msi.size() - 1;\\n if(msi.find(b) == msi.end())\\n msi[b] = msi.size() - 1;\\n to = msi[a];\\n from = msi[b];\\n //std::cout << \\\"to:\\\" << to << \\\" from:\\\" << from << std::endl;\\n g[to].push_back(edge{from, d/40 + t});\\n g[from].push_back(edge{to, d/40 + t});\\n }\\n priority_queue<piii, vector<piii>, greater<piii> > que;\\n que.push(piii(0, pii(S, 0)));\\n dp[0][S] = 0;\\n while(!que.empty()){\\n int v = que.top().second.first;\\n int c = que.top().first;\\n int state = que.top().second.second;\\n que.pop();\\n for (int i = 0; i < g[v].size(); i++) {\\n int st = state;\\n edge e = g[v][i];\\n if(dp[state][e.to] > c + e.cost){\\n if(e.to == P)st = 1;\\n dp[state][e.to] = c + e.cost;\\n que.push(piii(c + e.cost, pii(e.to, st)));\\n }\\n }\\n }\\n std::cout << dp[1][GOAL] << std::endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 1504,\n \"score_of_the_acc\": -0.0714,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1268,"cells":{"group_id":{"kind":"string","value":"aoj_2284_cpp"},"problem_description":{"kind":"string","value":"Problem D: 伝説の剣\n※ この問題には厨二成分が多く含まれます。胸焼けにご注意ください。\nついに復活を遂げた魔王は、再び世界を闇に包むために人間界に攻め入ろうとしていた。\n魔王は、本格的な侵攻を始める前に、まず伝説の剣を破壊することにした。\n前回の戦争において、魔王は伝説の剣を持つ勇者によって倒された。\n魔王の体は闇の衣によって守られているため、生半可な攻撃では魔王を傷つけることはできない。\nしかし、伝説の剣は、神々の加護により、魔王の闇の衣すら容易に貫いてしまう。\nそのため、今回の戦争に勝利するためには、なんとしてもその伝説の剣を手に入れて破壊する必要がある。\n調査の末、伝説の剣はとある遺跡の最奥に安置され、次代の勇者が現われるのを待っていることがわかった。\n伝説の剣は、邪悪な者や盗賊によって奪われるのを防ぐために、周囲に点在する無数の宝珠によって封印されている。\n魔王は、強力な魔力を持っているため、触れるだけで宝珠を破壊することができる。\nただし、宝珠による封印は多重構造になっており、表層から順に破壊していく必要がある。\n例えば、第1の封印の宝珠を破壊する前に第2以降の封印の宝珠に触れたとしても、破壊することはできない。\nまた、複数の宝珠が同じ封印を構成していることもあるが、魔王はそのうちの一つに触れるだけで、同時にその封印を破壊することができる。\n遺跡には神聖な力が満ちており、並の魔物では入ることすらままならない。\nそこで、魔王自ら赴き伝説の剣を回収してくることになった。\nいかに魔王といえど、長時間その力を受け続ければただではすまない。\n魔王の右腕であるあなたの仕事は、念のため魔王が全ての封印を破壊し、伝説の剣の下に辿りつくまでの時間を求めることである。\nInput\n入力は、複数のデータセットからなり、入力の終わりはスペースで区切られたゼロ二つからなる行である。\nデータセットの総数は50以下である。\n各データセットは、次の形式をしている。\nw\nh\ns(1,1)\n...\ns(1,w)\ns(2,1)\n...\ns(2,w)\n...\ns(h,1)\n...\ns(h,w)\nw\nと\nh\nは、それぞれ遺跡のフロアを表現する行列データの幅と高さを示す整数であり、それぞれ\n1 ≤ w, h ≤ 100\nであり、\n2 ≤ w + h ≤ 100\nと仮定して良い。\n続く\nh\n行はそれぞれ、スペースで区切られた\nw\n個の文字から構成されており、文字\ns(y,x)\nは、座標\n(y,x)\nの地点の状態を示す。\nその意味は、以下の通りである。\nS：魔王が最初にいる地点。フロアに必ず1つだけ存在する。\nG：伝説の剣の地点。必ず1つだけ存在する。\n.：なにもない。\n数字：宝珠がある地点。数字は構成する封印の番号を示す。数字は1以上の整数であり、間の数字に抜けはないとしてよい。\nまた、魔王は、遺跡のフロア内の上下左右の隣接する座標に移動することができ、その移動にかかる時間を1とする。\n破壊できる宝珠は触れるだけで破壊できるため、宝珠の破壊には時間はかからない。\nOutput\n各データセットに対して、魔王が全ての封印を破壊し、伝説に剣に辿りつくために必要な最短時間を出力せよ。\nSample Input\n10 10\nS . . . . . . . . .\n. . . . . . . . . .\n. . . . 1 . . . . .\n. . . . . . . . . .\n. . . . . . . . . .\n. . . . . . . 3 . .\n. . . . . . . . . .\n. . . . . 4 . . . .\n. . . . . . . . . .\n2 . . . . . . . . G\n10 10\nS . . . . . 3 . . .\n. . 3 . . . . . . .\n. . . . 1 . . . . .\n. . . . . . 4 . . .\n. . 3 . . . 1 . . .\n. . . . . . . 3 . .\n. . . . . . . . . .\n. . . . . 4 . . . .\n. . . . . 5 . . . .\n2 . . . . . . . . G\n10 10\nS . . . . . . . . 1\n. . . . . 5 . . . .\n. 4 . . . . . . . .\n. . . . 8 . 9 . . .\n. . . . 10 . . . . .\n. . 7 . G . . . . .\n. . . 11 . . . . . .\n3 . . . . . . . . 6\n. . . . . . . 2 . .\n. . . . . . . . . .\n0 0\nOutput for Sample Input\n38\n36\n71"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2284_7936801","code_snippet":"#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <vector>\nusing namespace std;\n#define fr first\n#define sc second\ntypedef pair<int, int> P;\nP s, g;\ntypedef pair<P, P> Q;\nint h, w, sx, sy, gx, gy, c, dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0},\n num[105][105];\nbool used[2500][105][105];\nchar wara[100];\nint bfs();\nint main() {\n while (cin >> w >> h && w || h) {\n memset(num, 0, sizeof(num));\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n cin >> wara;\n if (strcmp(wara, \"S\") == 0)\n s = P(i, j);\n else if (strcmp(wara, \"G\") == 0)\n g = P(i, j);\n else if (strcmp(wara, \".\") != 0) {\n c = max(c, atoi(wara));\n num[i][j] = atoi(wara);\n }\n }\n }\n num[g.fr][g.sc] = c + 1;\n cout << bfs() << endl;\n c = 0;\n }\n}\nint bfs() {\n memset(used, false, sizeof(used));\n queue<Q> que;\n que.push(Q(s, P(1, 0)));\n used[1][s.fr][s.sc] = true;\n while (!que.empty()) {\n Q q = que.front();\n que.pop();\n if (q.sc.fr == c + 1 && q.fr == g)\n return q.sc.sc;\n if (num[q.fr.fr][q.fr.sc] == q.sc.fr &&\n !used[q.sc.fr + 1][q.fr.fr][q.fr.sc]) {\n used[q.sc.fr + 1][q.fr.fr][q.fr.sc] = true;\n q.sc.fr++;\n }\n for (int i = 0; i < 4; i++) {\n int nx = q.fr.fr + dx[i], ny = q.fr.sc + dy[i];\n bool flg = true;\n if (nx >= 0 && nx < h && ny >= 0 && ny < w && !used[q.sc.fr][nx][ny]) {\n used[q.sc.fr][nx][ny] = true;\n que.push(Q(P(nx, ny), P(q.sc.fr + (flg ? 0 : 1), q.sc.sc + 1)));\n }\n }\n }\n return -1;\n}","accuracy":1,"time_ms":210,"memory_kb":30108,"score_of_the_acc":-1.0287,"final_rank":17},{"submission_id":"aoj_2284_7936800","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef pair<int, int> Pi;\ntypedef pair<Pi, int> Pii;\n#define dp second\nconst int INF = 1 << 30;\nint dist(Pi a, Pi b) {\n return abs(a.first - b.first) + abs(a.second - b.second);\n}\nint main() {\n int w, h;\n Pi goal;\n while (cin >> w >> h, w) {\n vector<Pii> num[2500];\n int size = 0, hoge;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n string str;\n cin >> str;\n if (str != \".\") {\n if (str == \"S\")\n num[0].push_back(Pii(Pi(i, j), 0));\n else if (str == \"G\")\n goal = Pi(i, j);\n else {\n num[hoge = atoi(str.c_str())].push_back(Pii(Pi(i, j), INF));\n size = max(hoge, size);\n }\n }\n }\n }\n num[++size].push_back(Pii(goal, INF));\n for (int idx = 1; idx <= size; idx++) {\n for (int i = num[idx].size() - 1; i >= 0; i--) {\n for (int j = num[idx - 1].size() - 1; j >= 0; j--) {\n num[idx][i].dp = min(num[idx][i].dp,\n num[idx - 1][j].dp + dist(num[idx - 1][j].first,\n num[idx][i].first));\n }\n }\n }\n cout << num[size][0].dp << endl;\n }\n return (0);\n}","accuracy":1,"time_ms":10,"memory_kb":3316,"score_of_the_acc":-0.039,"final_rank":3},{"submission_id":"aoj_2284_7936782","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i, a, n) for (int i = a; i < n; i++)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(v) (v).begin(), (v).end()\ntypedef long long int64;\nconst static int INF = 1 << 28;\ntypedef pair<int, int> Pi;\ntypedef pair<int, Pi> Pii;\nint main() {\n int w, h;\n while (cin >> w >> h, w) {\n vector<Pii> mas[2501];\n Pi goal;\n int count = 0;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n string line;\n cin >> line;\n if (isdigit(line[0])) {\n mas[atoi(line.c_str())].push_back(Pii(INF, Pi(i, j)));\n count = max(count, atoi(line.c_str()));\n } else if (line[0] == 'S') {\n mas[0].push_back(Pii(0, Pi(i, j)));\n } else if (line[0] == 'G') {\n goal = Pi(i, j);\n }\n }\n }\n mas[count + 1].push_back(Pii(INF, goal));\n for (int i = 1; !mas[i].empty(); i++) {\n for (int j = 0; j < mas[i].size(); j++) {\n for (int k = 0; k < mas[i - 1].size(); k++) {\n mas[i][j].first = min(\n mas[i][j].first,\n mas[i - 1][k].first +\n abs(mas[i - 1][k].second.first - mas[i][j].second.first) +\n abs(mas[i - 1][k].second.second - mas[i][j].second.second));\n }\n }\n }\n cout << mas[count + 1][0].first << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3188,"score_of_the_acc":-0.0366,"final_rank":1},{"submission_id":"aoj_2284_5032958","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\tint manhattan_distance(const Point& p) const {\n\t\treturn std::abs(x - p.x) + std::abs(y - p.y);\n\t}\n\tint 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> Real distance(const Point& p) const {\n\t\treturn sqrt(static_cast<Real>(distance_square(p)));\n\t}\n\tPoint abs(const Point& p) const {\n\t\treturn {std::abs(x - p.x), std::abs(y - p.y)};\n\t}\n\tPoint abs() const {\n\t\treturn {std::abs(x), std::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\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 3 \"a.cpp\"\n\nint solve(int w, int h) {\n\tvector<vector<string>> s = in[{h, w}];\n\tPoint::set_range(h, w);\n\tint n = 0;\n\trep(i, h) rep(j, w) {\n\t\ttry {\n\t\t\tint val = stoi(s[i][j]);\n\t\t\tchmax(n, val);\n\t\t} catch (...) {\n\t\t}\n\t}\n\n\tvector<vector<Point>> points(n + 2);\n\tpoints.front().push_back(Point::find(s, \"S\").value());\n\tpoints.back().push_back(Point::find(s, \"G\").value());\n\tfor (Point p : Point::enumrate_2D_points()) {\n\t\tstring c = s[p.y][p.x];\n\t\ttry {\n\t\t\tint c_val = stoi(c);\n\t\t\tpoints[c_val].push_back(p);\n\t\t} catch (...) {\n\t\t}\n\t}\n\n\tVVI dp(n + 2);\n\tdp[0].push_back(0);\n\tFOR(i, 1, n + 2) {\n\t\tint s1 = points[i - 1].size(), s2 = points[i].size();\n\t\tdp[i].assign(s2, inf);\n\t\trep(j, s1) rep(k, s2) {\n\t\t\tchmin(dp[i][k],\n\t\t\t dp[i - 1][j] + points[i - 1][j].manhattan_distance(points[i][k]));\n\t\t}\n\t}\n\treturn dp.back().front();\n}\n\nint main() {\n\twhile (true) {\n\t\tini(x, y);\n\t\tif (x + y == 0) break;\n\t\tout(solve(x, y));\n\t}\n}","accuracy":1,"time_ms":80,"memory_kb":3912,"score_of_the_acc":-0.2171,"final_rank":15},{"submission_id":"aoj_2284_3736970","code_snippet":"#include<iostream>\n#include<vector>\n#include<cctype>\nusing namespace std;\n\nint main(){\n int w, h;\n while(cin >> w >> h, w+h){\n vector<int> xi[2525], yj[2525];\n vector<vector<int>> dp(2525, vector<int>(2525,1<<30));\n int gi = -1, gj = -1, ma = 0;\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n string s; cin >> s;\n if(isdigit(s[0])){\n int num = stoi(s);\n ma = max(ma, num);\n xi[num].push_back(i), yj[num].push_back(j);\n }else if(s == \"S\"){\n xi[0].push_back(i), yj[0].push_back(j);\n }else if(s == \"G\"){\n gi = i, gj = j;\n }\n }\n }\n ma++;\n xi[ma].push_back(gi), yj[ma].push_back(gj);\n dp[0][0] = 0;\n for(int i = 0; xi[i+1].size(); i++){\n for(int j = 0; j < xi[i].size(); j++){\n for(int k = 0; k < xi[i+1].size(); k++){\n dp[i+1][k] = min(dp[i+1][k], dp[i][j] + abs(xi[i][j]-xi[i+1][k])+abs(yj[i][j]-yj[i+1][k]));\n }\n }\n }\n cout << dp[ma][0] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":280,"memory_kb":28428,"score_of_the_acc":-1.1631,"final_rank":18},{"submission_id":"aoj_2284_3504690","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<cctype>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define LINF (ll)INF*INF\n#define MOD 1000000007\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define loop(i,a,n) for(int i=a;i<(n);i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vp;\n\nint gcd(int a, int b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\nint lcm(int a, int b){\n return a/gcd(a,b)*b;\n}\n\n\nstruct edge { int to, cost;};\n\nclass Dijkstra{\nprivate:\n vector< vector<edge> > g;\n\npublic:\n Dijkstra(){};\n Dijkstra(int size){\n g.resize(size);\n }\n\n vi dist;\n\n void add(int a, int b, int c){//無向辺\n edge e1 = {b, c}, e2 = {a, c};\n g[a].push_back(e1);\n //g[b].push_back(e2);//有向辺の場合はここをコメントアウトする\n }\n\n void calc(int s){\n priority_queue< pii, vector<pii>, greater<pii> > q;\n int n = g.size();\n dist = vi (n, INF);\n dist[s] = 0;\n q.push(pii(0, s));\n\n while(!q.empty()){\n pii p = q.top();\n q.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(dist[e.to] > dist[v] + e.cost){\n dist[e.to] = dist[v] + e.cost;\n q.push(pii(dist[e.to], e.to));\n }\n }\n }\n }\n\n};\n\n\nint h,w;\n\nint f(pii p){\n return p.first * w + p.second;\n}\nint g(pii x, pii y){\n return abs(x.first - y.first) + abs(x.second - y.second);\n}\nint num(string s){\n int ret = 0;\n rep(i,s.size()){\n ret *= 10;\n ret += s[i] - '0';\n }\n return ret;\n}\n\nsigned main(void) {\n while(cin >> w >> h, h){\n int sx,sy,gx,gy;\n vector<vp> v(h*w);\n rep(i,h)rep(j,w){\n string in;\n cin >> in;\n if(in == \".\");\n else if(in == \"S\")sx = i, sy = j;\n else if(in == \"G\")gx = i, gy = j;\n else v[num(in)].push_back(pii(i,j));\n }\n v[0].push_back(pii(sx,sy));\n int ind = 0;\n while(v[ind].size())ind++;\n v[ind].push_back(pii(gx,gy));\n while(v.back().size() == 0)v.pop_back();\n /*\n rep(i,v.size()){\n cout << i << endl;\n rep(j,v[i].size())cout << v[i][j].first << \" \" << v[i][j].second << endl;\n }\n */\n Dijkstra dij(h*w);\n rep(i,v.size()-1){\n rep(j,v[i].size())rep(k,v[i+1].size()){\n //v[i][j]からv[i+1][k]に辺をはる\n dij.add(f(v[i][j]),f(v[i+1][k]), g(v[i][j],v[i+1][k]));\n }\n }\n dij.calc(f(v.front().front()));\n cout << dij.dist[f(v.back().front())] << endl;\n }\n\n}","accuracy":1,"time_ms":20,"memory_kb":10060,"score_of_the_acc":-0.1921,"final_rank":14},{"submission_id":"aoj_2284_3378229","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<utility>\n#include<string>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<map>\n#include<climits>\n#include<set>\n\n#define REP(i, n) for(int i = 0;i < n;i++)\n#define REPR(i, n) for(int i = n;i >= 0;i--)\n#define FOR(i, m, n) for(int i = m;i < n;i++)\n#define FORR(i, m, n) for(int i = m;i >= n;i--)\n#define SORT(v, n) sort(v, v+n);\n#define VSORT(v) sort(v.begin(), v.end());\n#define llong long long\n#define pb(a) push_back(a)\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\nint dx[4] = {1,0,0,-1};\nint dy[4] = {0,1,-1,0};\n#define MOD 1000000007\n#define ARRAY_MAX 3000\n\nconst int INF = 1e9+7;\n\n\nint main(){\n\n int w,h;\n while(cin >> w >> h,w|h){\n\n vector<pll> g[ARRAY_MAX];\n ll gy,gx,n = 0;\n for(int i = 0;i < h;i++){\n for(int j = 0;j < w;j++){\n string s;\n cin >> s;\n if(s == \".\"){\n continue;\n }\n if(s == \"S\"){\n g[0].push_back({i,j});\n }else if(s == \"G\"){\n gy = i;\n gx = j;\n }else{\n ll num = (ll)stoi(s);\n g[num].push_back({i,j});\n n = max(n,num);//最大の数字\n }\n }\n }\n n++;\n g[n].push_back({gy,gx});\n vector<vector<ll> > dp(n+1);\n for(int i = 0;i < n+1;i++){\n dp[i].resize(g[i].size(),INF);\n }\n dp[0][0] = 0;\n //dp[Y][X]:数字Yのついた地点のX個目の地点までの最短距離\n\n for(int i = 1;i <= n;i++){\n for(int j = 0;j < g[i-1].size();j++){\n for(int k = 0;k < g[i].size();k++){\n ll len = abs(g[i-1][j].first-g[i][k].first) + abs(g[i-1][j].second-g[i][k].second);\n dp[i][k] = min(dp[i][k],dp[i-1][j] + len);\n }\n }\n }\n cout << dp[n][0] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3332,"score_of_the_acc":-0.0393,"final_rank":4},{"submission_id":"aoj_2284_3378221","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<utility>\n#include<string>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<map>\n#include<climits>\n#include<set>\n\n#define REP(i, n) for(int i = 0;i < n;i++)\n#define REPR(i, n) for(int i = n;i >= 0;i--)\n#define FOR(i, m, n) for(int i = m;i < n;i++)\n#define FORR(i, m, n) for(int i = m;i >= n;i--)\n#define SORT(v, n) sort(v, v+n);\n#define VSORT(v) sort(v.begin(), v.end());\n#define llong long long\n#define pb(a) push_back(a)\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef long long int ll;\ntypedef pair<ll,ll> pll;\nint dx[4] = {1,0,0,-1};\nint dy[4] = {0,1,-1,0};\n#define MOD 1000000007\n#define ARRAY_MAX 3000\n\nconst int INF = 1e9+7;\n\n\nint main(){\n\n int w,h;\n while(cin >> w >> h,w|h){\n\n vector<pll> g[ARRAY_MAX];\n ll gy,gx,n = 0;\n for(int i = 0;i < h;i++){\n for(int j = 0;j < w;j++){\n string s;\n cin >> s;\n if(s == \".\"){\n continue;\n }\n if(s == \"S\"){\n g[0].push_back({i,j});\n }else if(s == \"G\"){\n gy = i;\n gx = j;\n }else{\n ll num = (ll)stoi(s);\n g[num].push_back({i,j});\n n = max(n,num);//最大の数字\n }\n }\n }\n n++;\n g[n].push_back({gy,gx});\n vector<vector<ll> > dp(n+1);\n for(int i = 0;i < n+1;i++){\n dp[i].resize(g[i].size(),INF);\n }\n dp[0][0] = 0;\n\n for(int i = 1;i <= n;i++){\n for(int j = 0;j < g[i-1].size();j++){\n for(int k = 0;k < g[i].size();k++){\n ll len = abs(g[i-1][j].first-g[i][k].first) + abs(g[i-1][j].second-g[i][k].second);\n dp[i][k] = min(dp[i][k],dp[i-1][j] + len);\n }\n }\n }\n cout << dp[n][0] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3436,"score_of_the_acc":-0.0413,"final_rank":5},{"submission_id":"aoj_2284_3354246","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\nconst ll MOD = 1000000007;\nconst int IINF = INT_MAX;\nconst ll LLINF = LLONG_MAX;\nconst int MAX_N = int(2e5 + 5);\nconst double EPS = 1e-8;\nconst int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define REPR(i, n) for (int i = n; i >= 0; i--)\n#define SORT(v) sort((v).begin(), (v).end())\n#define ALL(v) (v).begin(), (v).end()\n\nint main() {\n int h, w;\n while(cin >> w >> h, h){\n vector<P> g[10005];\n ll n=0, gi, gj;\n REP(i,h)REP(j,w){\n string s;\n cin >> s;\n if(s==\".\"){\n continue;\n }\n else if(s==\"S\")g[0].push_back({i,j});\n else if(s==\"G\"){\n gi = i;\n gj = j;\n }\n else{\n ll num = stoi(s);\n g[num].push_back({i,j});\n n = max(n,num);\n }\n }\n n++;\n g[n].push_back({gi,gj});\n vector<vector<ll>> dp(n+1);\n REP(i,n+1) dp[i].resize(g[i].size(),LLINF/3);\n dp[0][0] = 0;\n REP(i,n){\n REP(j,g[i].size()){\n REP(k,g[i+1].size()){\n ll d = abs(g[i][j].first-g[i+1][k].first) + abs(g[i][j].second-g[i+1][k].second);\n dp[i+1][k] = min(dp[i+1][k],dp[i][j] + d);\n }\n }\n }\n cout << dp[n][0] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3456,"score_of_the_acc":-0.0417,"final_rank":6},{"submission_id":"aoj_2284_3354155","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define lint long long\n#define P pair<int, int>\n#define LLP pair<long long, long long>\n#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)\n#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)\n#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)\n#define SORT(x) sort((x).begin(), (x).end())\n#define SORT_INV(x) sort((x).rbegin(), (x).rend())\n\nconst int IINF = 1e9 + 10;\nconst long long LLINF = (long long)1e18 + 10;\nconst long long MOD = (long long)1e9 + 7;\nconst int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};\nconst int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};\nconst double EPS = 1e-8;\n\n#define int long long\n\nint w, h;\nvector< vector<string> > s;\nvector< vector< P > > v(2500);\nint sy, sx, gy, gx;\nint maxi;\nint memo[2525][2525];\n\nint solve(int i, int j){\n if(i == maxi + 1){\n return 0;\n }\n if(memo[i][j] >= 0){\n return memo[i][j];\n }\n\n int res = LLINF;\n rep(k, v[i + 1].size()){\n res = min(res, solve(i + 1, k) + abs(v[i][j].first - v[i + 1][k].first) + abs(v[i][j].second - v[i + 1][k].second));\n }\n return memo[i][j] = res;\n}\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n while(cin >> w >> h, w){\n\n rep(i, 2500){\n v[i].clear();\n }\n\n maxi = 0;\n\n fill(memo[0], memo[2525], -1);\n\n s.resize(h);\n rep(i, h){\n s[i].resize(w);\n rep(j, w){\n cin >> s[i][j];\n if(s[i][j] == \"S\"){\n sy = i;\n sx = j;\n }else if(s[i][j] == \"G\"){\n gy = i;\n gx = j;\n }else if(s[i][j] != \".\"){\n int num = 0;\n for(auto x : s[i][j]){\n num *= 10;\n num += x - '0';\n }\n maxi = max(maxi, num);\n v[num].push_back({i, j});\n }\n }\n }\n\n v[0].push_back({sy, sx});\n v[maxi + 1].push_back({gy, gx});\n\n int ans = solve(0, 0);\n cout << ans << endl;\n \n }\n\n return 0;\n}","accuracy":1,"time_ms":430,"memory_kb":53460,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_2284_3341637","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nusing pi = pair<int,int>;\nconst int INF = INT_MAX/3;\n\nint dist(pi p, pi q){\n return abs(p.fi-q.fi) + abs(p.se-q.se);\n}\n\nbool isnumber(string s){\n return isdigit(s[0]);\n}\n\nint main(){\n int w,h;\n while(cin >>w >>h,w){\n vector<vector<string>> s(h, vector<string>(w));\n rep(i,h)rep(j,w) cin >>s[i][j];\n\n int mx = 0;\n rep(i,h)rep(j,w)if(isnumber(s[i][j])) mx = max(mx, stoi(s[i][j]));\n\n vector<vector<pi>> pos(mx+2);\n rep(i,h)rep(j,w){\n if(isnumber(s[i][j])) pos[stoi(s[i][j])].pb({i,j});\n else if(s[i][j]==\"S\") pos[0].pb({i,j});\n else if(s[i][j]==\"G\") pos[mx+1].pb({i,j});\n }\n\n vector<int> dp(1,0);\n for(int i=1; i<=mx+1; ++i){\n int P = pos[i-1].size();\n int Q = pos[i].size();\n\n vector<int> nx(Q,INF);\n rep(j,P)rep(k,Q){\n nx[k] = min(nx[k], dp[j]+dist(pos[i-1][j], pos[i][k]));\n }\n\n dp = nx;\n }\n cout << dp[0] << \"\\n\";\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3288,"score_of_the_acc":-0.0385,"final_rank":2},{"submission_id":"aoj_2284_2451190","code_snippet":"#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\nusing namespace std;\ntypedef pair<int,int> P;\nvector<P>v[100001];\nvector<int> dp[10001];\nint get(string x){\n int res=0;\n r(i,x.size())res=res*10+(x[i]-'0');\n return res;\n}\nint dist(P a,P b){\n return abs(a.first-b.first)+abs(a.second-b.second);\n}\nstring s;\nint e,w,h;\nint main(){\n while(cin>>w>>h,h){\n r(i,100001)v[i].clear();\n r(i,10001)dp[i].clear();\n P t;\n r(i,h)r(j,w){\n cin>>s;\n if(s==\"G\")t=P(i,j);\n if(s==\"S\")v[0].push_back(P(i,j));\n if(isdigit(s[0])){\n int x=get(s);\n v[x].push_back(P(i,j));\n dp[x].push_back(1e9);\n }\n }\n r(i,99999)if(v[i].size()==0){\n v[i].push_back(t);\n dp[i].push_back(1e9);\n e=i;\n break;\n }\n dp[0].push_back(0);\n r(i,e)r(j,v[i].size())r(k,v[i+1].size())\n dp[i+1][k]=min(dp[i+1][k],dp[i][j]+dist(v[i][j],v[i+1][k]));\n cout<<dp[e][0]<<endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":5960,"score_of_the_acc":-0.0897,"final_rank":13},{"submission_id":"aoj_2284_2247068","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef pair<int,int> P;\n#define Y first\n#define X second\nsigned main(){\n int w,h;\n while(cin>>w>>h,w||h){\n string s[h][w];\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)\n cin>>s[i][j];\n vector<P> v[50000];\n int gy,gx,gd=0;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if(s[i][j]==\".\") continue;\n if(s[i][j]==\"S\"){\n v[0].push_back(P(i,j));\n continue;\n }\n if(s[i][j]==\"G\"){\n gy=i;gx=j;\n continue;\n }\n int k=stoi(s[i][j]);\n v[k].push_back(P(i,j));\n gd=max(gd,k);\n }\n }\n v[++gd].push_back(P(gy,gx));\n int dp[h][w];\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)\n dp[i][j]=1LL<<55LL;\n dp[v[0][0].Y][v[0][0].X]=0;\n for(int i=0;i<gd;i++){\n for(int j=0;j<(int)v[i].size();j++){\n for(int k=0;k<(int)v[i+1].size();k++){\n int cost=abs(v[i+1][k].Y-v[i][j].Y)+abs(v[i+1][k].X-v[i][j].X);\n dp[v[i+1][k].Y][v[i+1][k].X]=\n min(dp[v[i+1][k].Y][v[i+1][k].X],dp[v[i][j].Y][v[i][j].X]+cost);\n }\n }\n }\n cout<<dp[v[gd][0].Y][v[gd][0].X]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4544,"score_of_the_acc":-0.0626,"final_rank":12},{"submission_id":"aoj_2284_2244136","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef pair<int,int> P;\n#define Y first\n#define X second\nsigned main(){\n int w,h;\n while(cin>>w>>h,w||h){\n string s[h][w];\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)\n\tcin>>s[i][j];\n vector<P> v[50000];\n int gy,gx,gd=0;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n\tif(s[i][j]==\".\") continue;\n\tif(s[i][j]==\"S\"){\n\t v[0].push_back(P(i,j));\n\t continue;\n\t}\n\tif(s[i][j]==\"G\"){\n\t gy=i;gx=j;\n\t continue;\n\t}\n\tint k=stoi(s[i][j]);\n\tv[k].push_back(P(i,j));\n\tgd=max(gd,k);\n }\n }\n v[++gd].push_back(P(gy,gx));\n int dp[h][w];\n for(int i=0;i<h;i++)\n for(int j=0;j<w;j++)\n\tdp[i][j]=1LL<<55LL;\n dp[v[0][0].Y][v[0][0].X]=0;\n for(int i=0;i<gd;i++){\n for(int j=0;j<(int)v[i].size();j++){\n\tfor(int k=0;k<(int)v[i+1].size();k++){\n\t int cost=abs(v[i+1][k].Y-v[i][j].Y)+abs(v[i+1][k].X-v[i][j].X);\n\t dp[v[i+1][k].Y][v[i+1][k].X]=\n\t min(dp[v[i+1][k].Y][v[i+1][k].X],dp[v[i][j].Y][v[i][j].X]+cost);\n\t}\n }\n }\n cout<<dp[v[gd][0].Y][v[gd][0].X]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4524,"score_of_the_acc":-0.0622,"final_rank":11},{"submission_id":"aoj_2284_2130094","code_snippet":"#include <queue>\n#include <string>\n#include <vector>\n#include <iostream>\nusing namespace std;\nconst vector<int> dir = { 1, 0, -1, 0 };\nint H, W; string s[109][109];\nint main() {\n\twhile (cin >> W >> H, H | W) {\n\t\tint sx, sy, gx, gy, cnt = 0;\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tcin >> s[i][j];\n\t\t\t\tif (s[i][j] == \"S\") sx = j, sy = i;\n\t\t\t\tif (s[i][j] == \"G\") gx = j, gy = i;\n\t\t\t\tif (isdigit(s[i][j][0])) cnt = max(cnt, stoi(s[i][j]));\n\t\t\t}\n\t\t}\n\t\tvector<vector<int> > px(cnt + 2), py(cnt + 2);\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tint val = -1;\n\t\t\t\tif (s[i][j] == \"S\") val = 0;\n\t\t\t\tif (s[i][j] == \"G\") val = cnt + 1;\n\t\t\t\tif (isdigit(s[i][j][0])) val = stoi(s[i][j]);\n\t\t\t\tif (val >= 0) {\n\t\t\t\t\tpx[val].push_back(j);\n\t\t\t\t\tpy[val].push_back(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<vector<int> > dp(cnt + 2);\n\t\tdp[0] = { 0 };\n\t\tfor (int i = 1; i <= cnt + 1; i++) {\n\t\t\tdp[i].resize(px[i].size(), 999999999);\n\t\t\tfor (int j = 0; j < dp[i].size(); j++) {\n\t\t\t\tfor (int k = 0; k < dp[i - 1].size(); k++) {\n\t\t\t\t\tint dist = abs(px[i][j] - px[i - 1][k]) + abs(py[i][j] - py[i - 1][k]);\n\t\t\t\t\tdp[i][j] = min(dp[i][j], dp[i - 1][k] + dist);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[cnt + 1][0] << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3596,"score_of_the_acc":-0.0444,"final_rank":8},{"submission_id":"aoj_2284_2125228","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\n\nvector<int>x[2502], y[2502];\nint d[2502][2502];\nint p;\n\nint main() {\n\tint w, h;\n\twhile (scanf(\"%d%d\", &w, &h), w) {\n\t\trep(i, 2502) {\n\t\t\tx[i].clear(); y[i].clear();\n\t\t}\n\t\tp = 1;//s->0,g->p\n\t\tint gx, gy;\n\t\trep(i, h) {\n\t\t\trep(j, w) {\n\t\t\t\tstring s; cin >> s;\n\t\t\t\tif (s == \".\");\n\t\t\t\telse if (s == \"S\")\n\t\t\t\t\tx[0].push_back(i), y[0].push_back(j);\n\t\t\t\telse if (s == \"G\")gx = i, gy = j;\n\t\t\t\telse {\n\t\t\t\t\tint d = stoi(s); p = max(p, d + 1);\n\t\t\t\t\tx[d].push_back(i); y[d].push_back(j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tx[p].push_back(gx); y[p].push_back(gy);\n\t\tmemset(d, 0x3f, sizeof(d));\n\t\td[0][0] = 0;\n\t\tfor (int i = 1; i <= p; i++) {\n\t\t\trep(j, x[i].size()) {\n\t\t\t\trep(k, x[i - 1].size()) {\n\t\t\t\t\td[i][j] = min(d[i][j], d[i - 1][k] + abs(x[i - 1][k] - x[i][j]) + abs(y[i - 1][k] - y[i][j]));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", d[p][0]);\n\t}\n}","accuracy":1,"time_ms":90,"memory_kb":28004,"score_of_the_acc":-0.7026,"final_rank":16},{"submission_id":"aoj_2284_2118098","code_snippet":"#include<iostream>\n#include<string>\n#include<vector>\n#include<algorithm>\n#define p pair<int,int>\n#define P pair<p,int>\nusing namespace std;\n\nint parse(string a) {\n\tint b = 0;\n\tfor (char c : a)b = b * 10 + c - 48;\n\treturn b;\n}\nint main() {\n\tint a, b;\n\twhile (cin>>b>>a, a | b) {\n\t\tp G;\n\t\tvector<P>d[20000];\n\t\tint MAX = 0;\n\t\tfor (int e = 0; e < a; e++) {\n\t\t\tfor (int g = 0; g < b; g++) {\n\t\t\t\tstring o;\n\t\t\t\tcin >> o;\n\t\t\t\tif (o==\"S\")d[0].push_back(P(p(e,g), 0));\n\t\t\t\telse if (o==\"G\")G = p(e, g);\n\t\t\t\telse if (o!=\".\") {\n\t\t\t\t\td[parse(o)].push_back(P(p(e, g), 0));\n\t\t\t\t\tMAX = max(MAX, parse(o));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= MAX; i++) {\n\t\t\tfor (int j = 0; j < d[i].size();j++) {\n\t\t\t\tint MIN = 1 << 29;\n\t\t\t\tfor (int k = 0; k < d[i - 1].size(); k++) {\n\t\t\t\t\tMIN = min(MIN, d[i - 1][k].second + abs(d[i][j].first.first- d[i - 1][k].first.first) + abs(d[i][j].first.second - d[i - 1][k].first.second));\n\t\t\t\t}\n\t\t\t\td[i][j].second = MIN;\n\t\t\t}\n\t\t}\n\t\tint MINCOST = 1 << 29;\n\t\tfor (P s : d[MAX]) {\n\t\t\tMINCOST = min(MINCOST, s.second + abs(G.first-s.first.first) + abs(G.second-s.first.second));\n\t\t}\n\t\tcout << MINCOST << endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3600,"score_of_the_acc":-0.0445,"final_rank":9},{"submission_id":"aoj_2284_1964715","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i, s, e) for(int i = (int)s; i < (int) e; i++)\n#define rep(i, n) REP(i, 0 ,n)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\n#define fi first\n#define se second\n#define pb push_back\n#define mp nake_pair\n\ntypedef long long ll;\ntypedef vector<int> vi;\n\nstring s;\nint perseInt(const string& s){\n int ret = 0;\n rep(i, s.size()) ret = ret *10 + (s[i]-'0');\n return ret;\n}\n\nstruct P{\n int x, y;\n P(){};\n P(int x, int y) : x(x), y(y){};\n int dist(const P& p){\n return abs(x-p.x)+abs(y-p.y);\n }\n};\nvector<P> ps[2600];\n\nint main(){\n int w, h;\n while(cin>>w>>h && w && h){\n int m = 0;\n P g;\n rep(i, 2600) ps[i].clear();\n rep(i, h) rep(j, w){\n cin>>s;\n if(s == \".\") continue;\n else if(s == \"S\") ps[0].pb({i, j});\n else if(s == \"G\") g = {i, j};\n else {\n int k = perseInt(s);\n ps[k].pb({i, j});\n m = max(m, k);\n }\n }\n ps[++m].pb(g);\n vector<vi> d(2600, vi(2600, 1e9));\n d[0][0] = 0;\n rep(i, m){\n rep(j, ps[i].size()){\n rep(k, ps[i+1].size()){\n d[i+1][k] = min(d[i+1][k], d[i][j]+ps[i][j].dist(ps[i+1][k]));\n }\n }\n }\n cout<<d[m][0]<<endl;\n }\n}","accuracy":1,"time_ms":310,"memory_kb":29612,"score_of_the_acc":-1.2573,"final_rank":19},{"submission_id":"aoj_2284_1879615","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <sstream>\n#include <cstring>\n \nusing namespace std;\n \n#define MAX 10000\n#define INF 1e9\ntypedef pair<int,int> P;\nint ans, N;\nvector<P> vec[MAX];\nint dp[100][100]; \n \nint dist(int x1, int y1, int x2, int y2){\n return abs(x1-x2) + abs(y1-y2);\n}\n \nint getNum(string &s){\n stringstream ss(s);\n int res;\n ss >> res;\n return res;\n}\n \nint main(){\n int W, H;\n \n while(cin >> W >> H, (W | H)){\n\tstring in;\n\tint gx, gy, max = 0;\n\tfor(int i = 0 ; i < MAX ; i++){\n\t vec[i].clear();\n\t}\n\tfor(int i = 0 ; i < H ; i++){\n\t for(int j = 0 ; j < W ; j++){\n\t\tcin >> in;\n\t\tif(in == \".\") continue;\n\t\tif(in == \"S\"){\n\t\t vec[0].push_back(P(i,j));\n\t\t}else if(in == \"G\"){\n\t\t gx = i, gy = j;\n\t\t}else{\n\t\t int num = getNum(in);\n\t\t max = std::max(max, num);\n\t\t vec[num].push_back(P(i,j));\n\t\t}\n\t }\n\t}\n\tvec[max+1].push_back(P(gx,gy));\n\tans = INF; N = max+2;\n\tfill(dp[0],dp[H],INF);\n\tfor(int i = 0 ; i < N-1 ; i++){\n\t for(int j = 0 ; j < vec[i+1].size() ; j++){\n\t\tfor(int k = 0 ; k < vec[i].size() ; k++){\n\t\t int bx = vec[i][k].first;\n\t\t int by = vec[i][k].second;\n\t\t int nx = vec[i+1][j].first;\n\t\t int ny = vec[i+1][j].second;\n\t\t if(dp[bx][by] == INF) dp[bx][by] = 0;\n\t\t dp[nx][ny] = min(dp[nx][ny],dp[bx][by] + dist(bx,by,nx,ny));;\n\t\t}\n\t }\n\t}\n\tcout << dp[gx][gy] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3540,"score_of_the_acc":-0.0433,"final_rank":7},{"submission_id":"aoj_2284_1792061","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<cstdio>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mp make_pair\n#define all(in) in.begin(),in.end()\nconst double PI=acos(-1);\nconst double EPS=1e-10;\nconst int inf=1e9;\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\nint main(){\n\tint n,m;\n\twhile(cin>>m>>n,n+m){\n\t\tvvi in(n,vi(m));\n\t\tint sx,sy,gx,gy;\n\t\trep(i,n)rep(j,m){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\tif(s==\".\")in[i][j]=0;\n\t\t\telse if(s==\"G\"){gx=i,gy=j;}\n\t\t\telse if(s==\"S\"){sx=i;sy=j;}\n\t\t\telse in[i][j]=atoi(&s[0]);\n\n\t\t}\n\t\tvector<pii>now;\n\t\tnow.pb(pii(sx*10000+sy,0));\n\t\tint co=1;\n\t\twhile(1){\n\t\t\tvector<pii>next;\n\t\t\tbool h=false;\n\t\t\trep(i,n)rep(j,m)if(in[i][j]==co){\n\t\t\t\th=true;\n\t\t\t\tint mi=inf;\n\t\t\t\trep(k,now.size()){\n\t\t\t\t\tmi=min(mi,\n\t\t\t\t\tnow[k].second+abs(i-now[k].first/10000)+abs(j-now[k].first%10000));\n\t\t\t\t}\n\t\t\t\tnext.pb(pii(i*10000+j,mi));\n\t\t\t}\n\t\t\tif(!h)break;\n\t\t\tco++;\n\t\t\tnow=next;\n\t\t}\n\t\tint mi=inf;\n\t\trep(i,now.size())mi=min(mi,abs(gx-now[i].first/10000)+abs(gy-now[i].first%10000)+now[i].second);\n\t\tcout<<mi<<endl;\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":1280,"score_of_the_acc":-0.0476,"final_rank":10}],"string":"[\n {\n \"submission_id\": \"aoj_2284_7936801\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cstdlib>\\n#include <cstring>\\n#include <iostream>\\n#include <map>\\n#include <queue>\\n#include <vector>\\nusing namespace std;\\n#define fr first\\n#define sc second\\ntypedef pair<int, int> P;\\nP s, g;\\ntypedef pair<P, P> Q;\\nint h, w, sx, sy, gx, gy, c, dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0},\\n num[105][105];\\nbool used[2500][105][105];\\nchar wara[100];\\nint bfs();\\nint main() {\\n while (cin >> w >> h && w || h) {\\n memset(num, 0, sizeof(num));\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n cin >> wara;\\n if (strcmp(wara, \\\"S\\\") == 0)\\n s = P(i, j);\\n else if (strcmp(wara, \\\"G\\\") == 0)\\n g = P(i, j);\\n else if (strcmp(wara, \\\".\\\") != 0) {\\n c = max(c, atoi(wara));\\n num[i][j] = atoi(wara);\\n }\\n }\\n }\\n num[g.fr][g.sc] = c + 1;\\n cout << bfs() << endl;\\n c = 0;\\n }\\n}\\nint bfs() {\\n memset(used, false, sizeof(used));\\n queue<Q> que;\\n que.push(Q(s, P(1, 0)));\\n used[1][s.fr][s.sc] = true;\\n while (!que.empty()) {\\n Q q = que.front();\\n que.pop();\\n if (q.sc.fr == c + 1 && q.fr == g)\\n return q.sc.sc;\\n if (num[q.fr.fr][q.fr.sc] == q.sc.fr &&\\n !used[q.sc.fr + 1][q.fr.fr][q.fr.sc]) {\\n used[q.sc.fr + 1][q.fr.fr][q.fr.sc] = true;\\n q.sc.fr++;\\n }\\n for (int i = 0; i < 4; i++) {\\n int nx = q.fr.fr + dx[i], ny = q.fr.sc + dy[i];\\n bool flg = true;\\n if (nx >= 0 && nx < h && ny >= 0 && ny < w && !used[q.sc.fr][nx][ny]) {\\n used[q.sc.fr][nx][ny] = true;\\n que.push(Q(P(nx, ny), P(q.sc.fr + (flg ? 0 : 1), q.sc.sc + 1)));\\n }\\n }\\n }\\n return -1;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 30108,\n \"score_of_the_acc\": -1.0287,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2284_7936800\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef pair<int, int> Pi;\\ntypedef pair<Pi, int> Pii;\\n#define dp second\\nconst int INF = 1 << 30;\\nint dist(Pi a, Pi b) {\\n return abs(a.first - b.first) + abs(a.second - b.second);\\n}\\nint main() {\\n int w, h;\\n Pi goal;\\n while (cin >> w >> h, w) {\\n vector<Pii> num[2500];\\n int size = 0, hoge;\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n string str;\\n cin >> str;\\n if (str != \\\".\\\") {\\n if (str == \\\"S\\\")\\n num[0].push_back(Pii(Pi(i, j), 0));\\n else if (str == \\\"G\\\")\\n goal = Pi(i, j);\\n else {\\n num[hoge = atoi(str.c_str())].push_back(Pii(Pi(i, j), INF));\\n size = max(hoge, size);\\n }\\n }\\n }\\n }\\n num[++size].push_back(Pii(goal, INF));\\n for (int idx = 1; idx <= size; idx++) {\\n for (int i = num[idx].size() - 1; i >= 0; i--) {\\n for (int j = num[idx - 1].size() - 1; j >= 0; j--) {\\n num[idx][i].dp = min(num[idx][i].dp,\\n num[idx - 1][j].dp + dist(num[idx - 1][j].first,\\n num[idx][i].first));\\n }\\n }\\n }\\n cout << num[size][0].dp << endl;\\n }\\n return (0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.039,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2284_7936782\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i, a, n) for (int i = a; i < n; i++)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(v) (v).begin(), (v).end()\\ntypedef long long int64;\\nconst static int INF = 1 << 28;\\ntypedef pair<int, int> Pi;\\ntypedef pair<int, Pi> Pii;\\nint main() {\\n int w, h;\\n while (cin >> w >> h, w) {\\n vector<Pii> mas[2501];\\n Pi goal;\\n int count = 0;\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n string line;\\n cin >> line;\\n if (isdigit(line[0])) {\\n mas[atoi(line.c_str())].push_back(Pii(INF, Pi(i, j)));\\n count = max(count, atoi(line.c_str()));\\n } else if (line[0] == 'S') {\\n mas[0].push_back(Pii(0, Pi(i, j)));\\n } else if (line[0] == 'G') {\\n goal = Pi(i, j);\\n }\\n }\\n }\\n mas[count + 1].push_back(Pii(INF, goal));\\n for (int i = 1; !mas[i].empty(); i++) {\\n for (int j = 0; j < mas[i].size(); j++) {\\n for (int k = 0; k < mas[i - 1].size(); k++) {\\n mas[i][j].first = min(\\n mas[i][j].first,\\n mas[i - 1][k].first +\\n abs(mas[i - 1][k].second.first - mas[i][j].second.first) +\\n abs(mas[i - 1][k].second.second - mas[i][j].second.second));\\n }\\n }\\n }\\n cout << mas[count + 1][0].first << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": -0.0366,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2284_5032958\",\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\\tint manhattan_distance(const Point& p) const {\\n\\t\\treturn std::abs(x - p.x) + std::abs(y - p.y);\\n\\t}\\n\\tint 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> Real distance(const Point& p) const {\\n\\t\\treturn sqrt(static_cast<Real>(distance_square(p)));\\n\\t}\\n\\tPoint abs(const Point& p) const {\\n\\t\\treturn {std::abs(x - p.x), std::abs(y - p.y)};\\n\\t}\\n\\tPoint abs() const {\\n\\t\\treturn {std::abs(x), std::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\\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 3 \\\"a.cpp\\\"\\n\\nint solve(int w, int h) {\\n\\tvector<vector<string>> s = in[{h, w}];\\n\\tPoint::set_range(h, w);\\n\\tint n = 0;\\n\\trep(i, h) rep(j, w) {\\n\\t\\ttry {\\n\\t\\t\\tint val = stoi(s[i][j]);\\n\\t\\t\\tchmax(n, val);\\n\\t\\t} catch (...) {\\n\\t\\t}\\n\\t}\\n\\n\\tvector<vector<Point>> points(n + 2);\\n\\tpoints.front().push_back(Point::find(s, \\\"S\\\").value());\\n\\tpoints.back().push_back(Point::find(s, \\\"G\\\").value());\\n\\tfor (Point p : Point::enumrate_2D_points()) {\\n\\t\\tstring c = s[p.y][p.x];\\n\\t\\ttry {\\n\\t\\t\\tint c_val = stoi(c);\\n\\t\\t\\tpoints[c_val].push_back(p);\\n\\t\\t} catch (...) {\\n\\t\\t}\\n\\t}\\n\\n\\tVVI dp(n + 2);\\n\\tdp[0].push_back(0);\\n\\tFOR(i, 1, n + 2) {\\n\\t\\tint s1 = points[i - 1].size(), s2 = points[i].size();\\n\\t\\tdp[i].assign(s2, inf);\\n\\t\\trep(j, s1) rep(k, s2) {\\n\\t\\t\\tchmin(dp[i][k],\\n\\t\\t\\t dp[i - 1][j] + points[i - 1][j].manhattan_distance(points[i][k]));\\n\\t\\t}\\n\\t}\\n\\treturn dp.back().front();\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tini(x, y);\\n\\t\\tif (x + y == 0) break;\\n\\t\\tout(solve(x, y));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3912,\n \"score_of_the_acc\": -0.2171,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2284_3736970\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<cctype>\\nusing namespace std;\\n\\nint main(){\\n int w, h;\\n while(cin >> w >> h, w+h){\\n vector<int> xi[2525], yj[2525];\\n vector<vector<int>> dp(2525, vector<int>(2525,1<<30));\\n int gi = -1, gj = -1, ma = 0;\\n for(int i = 0; i < h; i++){\\n for(int j = 0; j < w; j++){\\n string s; cin >> s;\\n if(isdigit(s[0])){\\n int num = stoi(s);\\n ma = max(ma, num);\\n xi[num].push_back(i), yj[num].push_back(j);\\n }else if(s == \\\"S\\\"){\\n xi[0].push_back(i), yj[0].push_back(j);\\n }else if(s == \\\"G\\\"){\\n gi = i, gj = j;\\n }\\n }\\n }\\n ma++;\\n xi[ma].push_back(gi), yj[ma].push_back(gj);\\n dp[0][0] = 0;\\n for(int i = 0; xi[i+1].size(); i++){\\n for(int j = 0; j < xi[i].size(); j++){\\n for(int k = 0; k < xi[i+1].size(); k++){\\n dp[i+1][k] = min(dp[i+1][k], dp[i][j] + abs(xi[i][j]-xi[i+1][k])+abs(yj[i][j]-yj[i+1][k]));\\n }\\n }\\n }\\n cout << dp[ma][0] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 28428,\n \"score_of_the_acc\": -1.1631,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2284_3504690\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<cstdio>\\n#include<cmath>\\n#include<cctype>\\n#include<math.h>\\n#include<string>\\n#include<string.h>\\n#include<stack>\\n#include<queue>\\n#include<vector>\\n#include<utility>\\n#include<set>\\n#include<map>\\n#include<stdlib.h>\\n#include<iomanip>\\n\\nusing namespace std;\\n\\n#define ll long long\\n#define ld long double\\n#define EPS 0.0000000001\\n#define INF 1e9\\n#define LINF (ll)INF*INF\\n#define MOD 1000000007\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define loop(i,a,n) for(int i=a;i<(n);i++)\\n#define all(in) in.begin(),in.end()\\n#define shosu(x) fixed<<setprecision(x)\\n\\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\\n\\ntypedef vector<int> vi;\\ntypedef vector<string> vs;\\ntypedef pair<int,int> pii;\\ntypedef vector<pii> vp;\\n\\nint gcd(int a, int b){\\n if(b==0) return a;\\n return gcd(b,a%b);\\n}\\nint lcm(int a, int b){\\n return a/gcd(a,b)*b;\\n}\\n\\n\\nstruct edge { int to, cost;};\\n\\nclass Dijkstra{\\nprivate:\\n vector< vector<edge> > g;\\n\\npublic:\\n Dijkstra(){};\\n Dijkstra(int size){\\n g.resize(size);\\n }\\n\\n vi dist;\\n\\n void add(int a, int b, int c){//無向辺\\n edge e1 = {b, c}, e2 = {a, c};\\n g[a].push_back(e1);\\n //g[b].push_back(e2);//有向辺の場合はここをコメントアウトする\\n }\\n\\n void calc(int s){\\n priority_queue< pii, vector<pii>, greater<pii> > q;\\n int n = g.size();\\n dist = vi (n, INF);\\n dist[s] = 0;\\n q.push(pii(0, s));\\n\\n while(!q.empty()){\\n pii p = q.top();\\n q.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(dist[e.to] > dist[v] + e.cost){\\n dist[e.to] = dist[v] + e.cost;\\n q.push(pii(dist[e.to], e.to));\\n }\\n }\\n }\\n }\\n\\n};\\n\\n\\nint h,w;\\n\\nint f(pii p){\\n return p.first * w + p.second;\\n}\\nint g(pii x, pii y){\\n return abs(x.first - y.first) + abs(x.second - y.second);\\n}\\nint num(string s){\\n int ret = 0;\\n rep(i,s.size()){\\n ret *= 10;\\n ret += s[i] - '0';\\n }\\n return ret;\\n}\\n\\nsigned main(void) {\\n while(cin >> w >> h, h){\\n int sx,sy,gx,gy;\\n vector<vp> v(h*w);\\n rep(i,h)rep(j,w){\\n string in;\\n cin >> in;\\n if(in == \\\".\\\");\\n else if(in == \\\"S\\\")sx = i, sy = j;\\n else if(in == \\\"G\\\")gx = i, gy = j;\\n else v[num(in)].push_back(pii(i,j));\\n }\\n v[0].push_back(pii(sx,sy));\\n int ind = 0;\\n while(v[ind].size())ind++;\\n v[ind].push_back(pii(gx,gy));\\n while(v.back().size() == 0)v.pop_back();\\n /*\\n rep(i,v.size()){\\n cout << i << endl;\\n rep(j,v[i].size())cout << v[i][j].first << \\\" \\\" << v[i][j].second << endl;\\n }\\n */\\n Dijkstra dij(h*w);\\n rep(i,v.size()-1){\\n rep(j,v[i].size())rep(k,v[i+1].size()){\\n //v[i][j]からv[i+1][k]に辺をはる\\n dij.add(f(v[i][j]),f(v[i+1][k]), g(v[i][j],v[i+1][k]));\\n }\\n }\\n dij.calc(f(v.front().front()));\\n cout << dij.dist[f(v.back().front())] << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 10060,\n \"score_of_the_acc\": -0.1921,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2284_3378229\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<utility>\\n#include<string>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<map>\\n#include<climits>\\n#include<set>\\n\\n#define REP(i, n) for(int i = 0;i < n;i++)\\n#define REPR(i, n) for(int i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(int i = m;i < n;i++)\\n#define FORR(i, m, n) for(int i = m;i >= n;i--)\\n#define SORT(v, n) sort(v, v+n);\\n#define VSORT(v) sort(v.begin(), v.end());\\n#define llong long long\\n#define pb(a) push_back(a)\\nusing namespace std;\\ntypedef pair<int, int> pii;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\nint dx[4] = {1,0,0,-1};\\nint dy[4] = {0,1,-1,0};\\n#define MOD 1000000007\\n#define ARRAY_MAX 3000\\n\\nconst int INF = 1e9+7;\\n\\n\\nint main(){\\n\\n int w,h;\\n while(cin >> w >> h,w|h){\\n\\n vector<pll> g[ARRAY_MAX];\\n ll gy,gx,n = 0;\\n for(int i = 0;i < h;i++){\\n for(int j = 0;j < w;j++){\\n string s;\\n cin >> s;\\n if(s == \\\".\\\"){\\n continue;\\n }\\n if(s == \\\"S\\\"){\\n g[0].push_back({i,j});\\n }else if(s == \\\"G\\\"){\\n gy = i;\\n gx = j;\\n }else{\\n ll num = (ll)stoi(s);\\n g[num].push_back({i,j});\\n n = max(n,num);//最大の数字\\n }\\n }\\n }\\n n++;\\n g[n].push_back({gy,gx});\\n vector<vector<ll> > dp(n+1);\\n for(int i = 0;i < n+1;i++){\\n dp[i].resize(g[i].size(),INF);\\n }\\n dp[0][0] = 0;\\n //dp[Y][X]:数字Yのついた地点のX個目の地点までの最短距離\\n\\n for(int i = 1;i <= n;i++){\\n for(int j = 0;j < g[i-1].size();j++){\\n for(int k = 0;k < g[i].size();k++){\\n ll len = abs(g[i-1][j].first-g[i][k].first) + abs(g[i-1][j].second-g[i][k].second);\\n dp[i][k] = min(dp[i][k],dp[i-1][j] + len);\\n }\\n }\\n }\\n cout << dp[n][0] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3332,\n \"score_of_the_acc\": -0.0393,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2284_3378221\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<utility>\\n#include<string>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<map>\\n#include<climits>\\n#include<set>\\n\\n#define REP(i, n) for(int i = 0;i < n;i++)\\n#define REPR(i, n) for(int i = n;i >= 0;i--)\\n#define FOR(i, m, n) for(int i = m;i < n;i++)\\n#define FORR(i, m, n) for(int i = m;i >= n;i--)\\n#define SORT(v, n) sort(v, v+n);\\n#define VSORT(v) sort(v.begin(), v.end());\\n#define llong long long\\n#define pb(a) push_back(a)\\nusing namespace std;\\ntypedef pair<int, int> pii;\\ntypedef long long int ll;\\ntypedef pair<ll,ll> pll;\\nint dx[4] = {1,0,0,-1};\\nint dy[4] = {0,1,-1,0};\\n#define MOD 1000000007\\n#define ARRAY_MAX 3000\\n\\nconst int INF = 1e9+7;\\n\\n\\nint main(){\\n\\n int w,h;\\n while(cin >> w >> h,w|h){\\n\\n vector<pll> g[ARRAY_MAX];\\n ll gy,gx,n = 0;\\n for(int i = 0;i < h;i++){\\n for(int j = 0;j < w;j++){\\n string s;\\n cin >> s;\\n if(s == \\\".\\\"){\\n continue;\\n }\\n if(s == \\\"S\\\"){\\n g[0].push_back({i,j});\\n }else if(s == \\\"G\\\"){\\n gy = i;\\n gx = j;\\n }else{\\n ll num = (ll)stoi(s);\\n g[num].push_back({i,j});\\n n = max(n,num);//最大の数字\\n }\\n }\\n }\\n n++;\\n g[n].push_back({gy,gx});\\n vector<vector<ll> > dp(n+1);\\n for(int i = 0;i < n+1;i++){\\n dp[i].resize(g[i].size(),INF);\\n }\\n dp[0][0] = 0;\\n\\n for(int i = 1;i <= n;i++){\\n for(int j = 0;j < g[i-1].size();j++){\\n for(int k = 0;k < g[i].size();k++){\\n ll len = abs(g[i-1][j].first-g[i][k].first) + abs(g[i-1][j].second-g[i][k].second);\\n dp[i][k] = min(dp[i][k],dp[i-1][j] + len);\\n }\\n }\\n }\\n cout << dp[n][0] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.0413,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2284_3354246\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair<ll, ll> P;\\nconst ll MOD = 1000000007;\\nconst int IINF = INT_MAX;\\nconst ll LLINF = LLONG_MAX;\\nconst int MAX_N = int(2e5 + 5);\\nconst double EPS = 1e-8;\\nconst int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};\\n#define REP(i, n) for (int i = 0; i < n; i++)\\n#define REPR(i, n) for (int i = n; i >= 0; i--)\\n#define SORT(v) sort((v).begin(), (v).end())\\n#define ALL(v) (v).begin(), (v).end()\\n\\nint main() {\\n int h, w;\\n while(cin >> w >> h, h){\\n vector<P> g[10005];\\n ll n=0, gi, gj;\\n REP(i,h)REP(j,w){\\n string s;\\n cin >> s;\\n if(s==\\\".\\\"){\\n continue;\\n }\\n else if(s==\\\"S\\\")g[0].push_back({i,j});\\n else if(s==\\\"G\\\"){\\n gi = i;\\n gj = j;\\n }\\n else{\\n ll num = stoi(s);\\n g[num].push_back({i,j});\\n n = max(n,num);\\n }\\n }\\n n++;\\n g[n].push_back({gi,gj});\\n vector<vector<ll>> dp(n+1);\\n REP(i,n+1) dp[i].resize(g[i].size(),LLINF/3);\\n dp[0][0] = 0;\\n REP(i,n){\\n REP(j,g[i].size()){\\n REP(k,g[i+1].size()){\\n ll d = abs(g[i][j].first-g[i+1][k].first) + abs(g[i][j].second-g[i+1][k].second);\\n dp[i+1][k] = min(dp[i+1][k],dp[i][j] + d);\\n }\\n }\\n }\\n cout << dp[n][0] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.0417,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2284_3354155\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define lint long long\\n#define P pair<int, int>\\n#define LLP pair<long long, long long>\\n#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)\\n#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)\\n#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)\\n#define SORT(x) sort((x).begin(), (x).end())\\n#define SORT_INV(x) sort((x).rbegin(), (x).rend())\\n\\nconst int IINF = 1e9 + 10;\\nconst long long LLINF = (long long)1e18 + 10;\\nconst long long MOD = (long long)1e9 + 7;\\nconst int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};\\nconst int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};\\nconst double EPS = 1e-8;\\n\\n#define int long long\\n\\nint w, h;\\nvector< vector<string> > s;\\nvector< vector< P > > v(2500);\\nint sy, sx, gy, gx;\\nint maxi;\\nint memo[2525][2525];\\n\\nint solve(int i, int j){\\n if(i == maxi + 1){\\n return 0;\\n }\\n if(memo[i][j] >= 0){\\n return memo[i][j];\\n }\\n\\n int res = LLINF;\\n rep(k, v[i + 1].size()){\\n res = min(res, solve(i + 1, k) + abs(v[i][j].first - v[i + 1][k].first) + abs(v[i][j].second - v[i + 1][k].second));\\n }\\n return memo[i][j] = res;\\n}\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n while(cin >> w >> h, w){\\n\\n rep(i, 2500){\\n v[i].clear();\\n }\\n\\n maxi = 0;\\n\\n fill(memo[0], memo[2525], -1);\\n\\n s.resize(h);\\n rep(i, h){\\n s[i].resize(w);\\n rep(j, w){\\n cin >> s[i][j];\\n if(s[i][j] == \\\"S\\\"){\\n sy = i;\\n sx = j;\\n }else if(s[i][j] == \\\"G\\\"){\\n gy = i;\\n gx = j;\\n }else if(s[i][j] != \\\".\\\"){\\n int num = 0;\\n for(auto x : s[i][j]){\\n num *= 10;\\n num += x - '0';\\n }\\n maxi = max(maxi, num);\\n v[num].push_back({i, j});\\n }\\n }\\n }\\n\\n v[0].push_back({sy, sx});\\n v[maxi + 1].push_back({gy, gx});\\n\\n int ans = solve(0, 0);\\n cout << ans << endl;\\n \\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 53460,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2284_3341637\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\nusing pi = pair<int,int>;\\nconst int INF = INT_MAX/3;\\n\\nint dist(pi p, pi q){\\n return abs(p.fi-q.fi) + abs(p.se-q.se);\\n}\\n\\nbool isnumber(string s){\\n return isdigit(s[0]);\\n}\\n\\nint main(){\\n int w,h;\\n while(cin >>w >>h,w){\\n vector<vector<string>> s(h, vector<string>(w));\\n rep(i,h)rep(j,w) cin >>s[i][j];\\n\\n int mx = 0;\\n rep(i,h)rep(j,w)if(isnumber(s[i][j])) mx = max(mx, stoi(s[i][j]));\\n\\n vector<vector<pi>> pos(mx+2);\\n rep(i,h)rep(j,w){\\n if(isnumber(s[i][j])) pos[stoi(s[i][j])].pb({i,j});\\n else if(s[i][j]==\\\"S\\\") pos[0].pb({i,j});\\n else if(s[i][j]==\\\"G\\\") pos[mx+1].pb({i,j});\\n }\\n\\n vector<int> dp(1,0);\\n for(int i=1; i<=mx+1; ++i){\\n int P = pos[i-1].size();\\n int Q = pos[i].size();\\n\\n vector<int> nx(Q,INF);\\n rep(j,P)rep(k,Q){\\n nx[k] = min(nx[k], dp[j]+dist(pos[i-1][j], pos[i][k]));\\n }\\n\\n dp = nx;\\n }\\n cout << dp[0] << \\\"\\\\n\\\";\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.0385,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2284_2451190\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define r(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\ntypedef pair<int,int> P;\\nvector<P>v[100001];\\nvector<int> dp[10001];\\nint get(string x){\\n int res=0;\\n r(i,x.size())res=res*10+(x[i]-'0');\\n return res;\\n}\\nint dist(P a,P b){\\n return abs(a.first-b.first)+abs(a.second-b.second);\\n}\\nstring s;\\nint e,w,h;\\nint main(){\\n while(cin>>w>>h,h){\\n r(i,100001)v[i].clear();\\n r(i,10001)dp[i].clear();\\n P t;\\n r(i,h)r(j,w){\\n cin>>s;\\n if(s==\\\"G\\\")t=P(i,j);\\n if(s==\\\"S\\\")v[0].push_back(P(i,j));\\n if(isdigit(s[0])){\\n int x=get(s);\\n v[x].push_back(P(i,j));\\n dp[x].push_back(1e9);\\n }\\n }\\n r(i,99999)if(v[i].size()==0){\\n v[i].push_back(t);\\n dp[i].push_back(1e9);\\n e=i;\\n break;\\n }\\n dp[0].push_back(0);\\n r(i,e)r(j,v[i].size())r(k,v[i+1].size())\\n dp[i+1][k]=min(dp[i+1][k],dp[i][j]+dist(v[i][j],v[i+1][k]));\\n cout<<dp[e][0]<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5960,\n \"score_of_the_acc\": -0.0897,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2284_2247068\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\ntypedef pair<int,int> P;\\n#define Y first\\n#define X second\\nsigned main(){\\n int w,h;\\n while(cin>>w>>h,w||h){\\n string s[h][w];\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)\\n cin>>s[i][j];\\n vector<P> v[50000];\\n int gy,gx,gd=0;\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n if(s[i][j]==\\\".\\\") continue;\\n if(s[i][j]==\\\"S\\\"){\\n v[0].push_back(P(i,j));\\n continue;\\n }\\n if(s[i][j]==\\\"G\\\"){\\n gy=i;gx=j;\\n continue;\\n }\\n int k=stoi(s[i][j]);\\n v[k].push_back(P(i,j));\\n gd=max(gd,k);\\n }\\n }\\n v[++gd].push_back(P(gy,gx));\\n int dp[h][w];\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)\\n dp[i][j]=1LL<<55LL;\\n dp[v[0][0].Y][v[0][0].X]=0;\\n for(int i=0;i<gd;i++){\\n for(int j=0;j<(int)v[i].size();j++){\\n for(int k=0;k<(int)v[i+1].size();k++){\\n int cost=abs(v[i+1][k].Y-v[i][j].Y)+abs(v[i+1][k].X-v[i][j].X);\\n dp[v[i+1][k].Y][v[i+1][k].X]=\\n min(dp[v[i+1][k].Y][v[i+1][k].X],dp[v[i][j].Y][v[i][j].X]+cost);\\n }\\n }\\n }\\n cout<<dp[v[gd][0].Y][v[gd][0].X]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4544,\n \"score_of_the_acc\": -0.0626,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2284_2244136\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\ntypedef pair<int,int> P;\\n#define Y first\\n#define X second\\nsigned main(){\\n int w,h;\\n while(cin>>w>>h,w||h){\\n string s[h][w];\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)\\n\\tcin>>s[i][j];\\n vector<P> v[50000];\\n int gy,gx,gd=0;\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n\\tif(s[i][j]==\\\".\\\") continue;\\n\\tif(s[i][j]==\\\"S\\\"){\\n\\t v[0].push_back(P(i,j));\\n\\t continue;\\n\\t}\\n\\tif(s[i][j]==\\\"G\\\"){\\n\\t gy=i;gx=j;\\n\\t continue;\\n\\t}\\n\\tint k=stoi(s[i][j]);\\n\\tv[k].push_back(P(i,j));\\n\\tgd=max(gd,k);\\n }\\n }\\n v[++gd].push_back(P(gy,gx));\\n int dp[h][w];\\n for(int i=0;i<h;i++)\\n for(int j=0;j<w;j++)\\n\\tdp[i][j]=1LL<<55LL;\\n dp[v[0][0].Y][v[0][0].X]=0;\\n for(int i=0;i<gd;i++){\\n for(int j=0;j<(int)v[i].size();j++){\\n\\tfor(int k=0;k<(int)v[i+1].size();k++){\\n\\t int cost=abs(v[i+1][k].Y-v[i][j].Y)+abs(v[i+1][k].X-v[i][j].X);\\n\\t dp[v[i+1][k].Y][v[i+1][k].X]=\\n\\t min(dp[v[i+1][k].Y][v[i+1][k].X],dp[v[i][j].Y][v[i][j].X]+cost);\\n\\t}\\n }\\n }\\n cout<<dp[v[gd][0].Y][v[gd][0].X]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4524,\n \"score_of_the_acc\": -0.0622,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2284_2130094\",\n \"code_snippet\": \"#include <queue>\\n#include <string>\\n#include <vector>\\n#include <iostream>\\nusing namespace std;\\nconst vector<int> dir = { 1, 0, -1, 0 };\\nint H, W; string s[109][109];\\nint main() {\\n\\twhile (cin >> W >> H, H | W) {\\n\\t\\tint sx, sy, gx, gy, cnt = 0;\\n\\t\\tfor (int i = 0; i < H; i++) {\\n\\t\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\t\\tcin >> s[i][j];\\n\\t\\t\\t\\tif (s[i][j] == \\\"S\\\") sx = j, sy = i;\\n\\t\\t\\t\\tif (s[i][j] == \\\"G\\\") gx = j, gy = i;\\n\\t\\t\\t\\tif (isdigit(s[i][j][0])) cnt = max(cnt, stoi(s[i][j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<int> > px(cnt + 2), py(cnt + 2);\\n\\t\\tfor (int i = 0; i < H; i++) {\\n\\t\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\t\\tint val = -1;\\n\\t\\t\\t\\tif (s[i][j] == \\\"S\\\") val = 0;\\n\\t\\t\\t\\tif (s[i][j] == \\\"G\\\") val = cnt + 1;\\n\\t\\t\\t\\tif (isdigit(s[i][j][0])) val = stoi(s[i][j]);\\n\\t\\t\\t\\tif (val >= 0) {\\n\\t\\t\\t\\t\\tpx[val].push_back(j);\\n\\t\\t\\t\\t\\tpy[val].push_back(i);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<int> > dp(cnt + 2);\\n\\t\\tdp[0] = { 0 };\\n\\t\\tfor (int i = 1; i <= cnt + 1; i++) {\\n\\t\\t\\tdp[i].resize(px[i].size(), 999999999);\\n\\t\\t\\tfor (int j = 0; j < dp[i].size(); j++) {\\n\\t\\t\\t\\tfor (int k = 0; k < dp[i - 1].size(); k++) {\\n\\t\\t\\t\\t\\tint dist = abs(px[i][j] - px[i - 1][k]) + abs(py[i][j] - py[i - 1][k]);\\n\\t\\t\\t\\t\\tdp[i][j] = min(dp[i][j], dp[i - 1][k] + dist);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << dp[cnt + 1][0] << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.0444,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2284_2125228\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n)for(int i=0;i<n;i++)\\nusing namespace std;\\n\\nvector<int>x[2502], y[2502];\\nint d[2502][2502];\\nint p;\\n\\nint main() {\\n\\tint w, h;\\n\\twhile (scanf(\\\"%d%d\\\", &w, &h), w) {\\n\\t\\trep(i, 2502) {\\n\\t\\t\\tx[i].clear(); y[i].clear();\\n\\t\\t}\\n\\t\\tp = 1;//s->0,g->p\\n\\t\\tint gx, gy;\\n\\t\\trep(i, h) {\\n\\t\\t\\trep(j, w) {\\n\\t\\t\\t\\tstring s; cin >> s;\\n\\t\\t\\t\\tif (s == \\\".\\\");\\n\\t\\t\\t\\telse if (s == \\\"S\\\")\\n\\t\\t\\t\\t\\tx[0].push_back(i), y[0].push_back(j);\\n\\t\\t\\t\\telse if (s == \\\"G\\\")gx = i, gy = j;\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tint d = stoi(s); p = max(p, d + 1);\\n\\t\\t\\t\\t\\tx[d].push_back(i); y[d].push_back(j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tx[p].push_back(gx); y[p].push_back(gy);\\n\\t\\tmemset(d, 0x3f, sizeof(d));\\n\\t\\td[0][0] = 0;\\n\\t\\tfor (int i = 1; i <= p; i++) {\\n\\t\\t\\trep(j, x[i].size()) {\\n\\t\\t\\t\\trep(k, x[i - 1].size()) {\\n\\t\\t\\t\\t\\td[i][j] = min(d[i][j], d[i - 1][k] + abs(x[i - 1][k] - x[i][j]) + abs(y[i - 1][k] - y[i][j]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\", d[p][0]);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 28004,\n \"score_of_the_acc\": -0.7026,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2284_2118098\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<algorithm>\\n#define p pair<int,int>\\n#define P pair<p,int>\\nusing namespace std;\\n\\nint parse(string a) {\\n\\tint b = 0;\\n\\tfor (char c : a)b = b * 10 + c - 48;\\n\\treturn b;\\n}\\nint main() {\\n\\tint a, b;\\n\\twhile (cin>>b>>a, a | b) {\\n\\t\\tp G;\\n\\t\\tvector<P>d[20000];\\n\\t\\tint MAX = 0;\\n\\t\\tfor (int e = 0; e < a; e++) {\\n\\t\\t\\tfor (int g = 0; g < b; g++) {\\n\\t\\t\\t\\tstring o;\\n\\t\\t\\t\\tcin >> o;\\n\\t\\t\\t\\tif (o==\\\"S\\\")d[0].push_back(P(p(e,g), 0));\\n\\t\\t\\t\\telse if (o==\\\"G\\\")G = p(e, g);\\n\\t\\t\\t\\telse if (o!=\\\".\\\") {\\n\\t\\t\\t\\t\\td[parse(o)].push_back(P(p(e, g), 0));\\n\\t\\t\\t\\t\\tMAX = max(MAX, parse(o));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int i = 1; i <= MAX; i++) {\\n\\t\\t\\tfor (int j = 0; j < d[i].size();j++) {\\n\\t\\t\\t\\tint MIN = 1 << 29;\\n\\t\\t\\t\\tfor (int k = 0; k < d[i - 1].size(); k++) {\\n\\t\\t\\t\\t\\tMIN = min(MIN, d[i - 1][k].second + abs(d[i][j].first.first- d[i - 1][k].first.first) + abs(d[i][j].first.second - d[i - 1][k].first.second));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\td[i][j].second = MIN;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint MINCOST = 1 << 29;\\n\\t\\tfor (P s : d[MAX]) {\\n\\t\\t\\tMINCOST = min(MINCOST, s.second + abs(G.first-s.first.first) + abs(G.second-s.first.second));\\n\\t\\t}\\n\\t\\tcout << MINCOST << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -0.0445,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2284_1964715\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i, s, e) for(int i = (int)s; i < (int) e; i++)\\n#define rep(i, n) REP(i, 0 ,n)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define mp nake_pair\\n\\ntypedef long long ll;\\ntypedef vector<int> vi;\\n\\nstring s;\\nint perseInt(const string& s){\\n int ret = 0;\\n rep(i, s.size()) ret = ret *10 + (s[i]-'0');\\n return ret;\\n}\\n\\nstruct P{\\n int x, y;\\n P(){};\\n P(int x, int y) : x(x), y(y){};\\n int dist(const P& p){\\n return abs(x-p.x)+abs(y-p.y);\\n }\\n};\\nvector<P> ps[2600];\\n\\nint main(){\\n int w, h;\\n while(cin>>w>>h && w && h){\\n int m = 0;\\n P g;\\n rep(i, 2600) ps[i].clear();\\n rep(i, h) rep(j, w){\\n cin>>s;\\n if(s == \\\".\\\") continue;\\n else if(s == \\\"S\\\") ps[0].pb({i, j});\\n else if(s == \\\"G\\\") g = {i, j};\\n else {\\n int k = perseInt(s);\\n ps[k].pb({i, j});\\n m = max(m, k);\\n }\\n }\\n ps[++m].pb(g);\\n vector<vi> d(2600, vi(2600, 1e9));\\n d[0][0] = 0;\\n rep(i, m){\\n rep(j, ps[i].size()){\\n rep(k, ps[i+1].size()){\\n d[i+1][k] = min(d[i+1][k], d[i][j]+ps[i][j].dist(ps[i+1][k]));\\n }\\n }\\n }\\n cout<<d[m][0]<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 29612,\n \"score_of_the_acc\": -1.2573,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2284_1879615\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <sstream>\\n#include <cstring>\\n \\nusing namespace std;\\n \\n#define MAX 10000\\n#define INF 1e9\\ntypedef pair<int,int> P;\\nint ans, N;\\nvector<P> vec[MAX];\\nint dp[100][100]; \\n \\nint dist(int x1, int y1, int x2, int y2){\\n return abs(x1-x2) + abs(y1-y2);\\n}\\n \\nint getNum(string &s){\\n stringstream ss(s);\\n int res;\\n ss >> res;\\n return res;\\n}\\n \\nint main(){\\n int W, H;\\n \\n while(cin >> W >> H, (W | H)){\\n\\tstring in;\\n\\tint gx, gy, max = 0;\\n\\tfor(int i = 0 ; i < MAX ; i++){\\n\\t vec[i].clear();\\n\\t}\\n\\tfor(int i = 0 ; i < H ; i++){\\n\\t for(int j = 0 ; j < W ; j++){\\n\\t\\tcin >> in;\\n\\t\\tif(in == \\\".\\\") continue;\\n\\t\\tif(in == \\\"S\\\"){\\n\\t\\t vec[0].push_back(P(i,j));\\n\\t\\t}else if(in == \\\"G\\\"){\\n\\t\\t gx = i, gy = j;\\n\\t\\t}else{\\n\\t\\t int num = getNum(in);\\n\\t\\t max = std::max(max, num);\\n\\t\\t vec[num].push_back(P(i,j));\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tvec[max+1].push_back(P(gx,gy));\\n\\tans = INF; N = max+2;\\n\\tfill(dp[0],dp[H],INF);\\n\\tfor(int i = 0 ; i < N-1 ; i++){\\n\\t for(int j = 0 ; j < vec[i+1].size() ; j++){\\n\\t\\tfor(int k = 0 ; k < vec[i].size() ; k++){\\n\\t\\t int bx = vec[i][k].first;\\n\\t\\t int by = vec[i][k].second;\\n\\t\\t int nx = vec[i+1][j].first;\\n\\t\\t int ny = vec[i+1][j].second;\\n\\t\\t if(dp[bx][by] == INF) dp[bx][by] = 0;\\n\\t\\t dp[nx][ny] = min(dp[nx][ny],dp[bx][by] + dist(bx,by,nx,ny));;\\n\\t\\t}\\n\\t }\\n\\t}\\n\\tcout << dp[gx][gy] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3540,\n \"score_of_the_acc\": -0.0433,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2284_1792061\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\n#include<map>\\n#include<set>\\n#include<utility>\\n#include<cmath>\\n#include<cstring>\\n#include<queue>\\n#include<cstdio>\\n#define loop(i,a,b) for(int i=a;i<b;i++) \\n#define rep(i,a) loop(i,0,a)\\n#define pb push_back\\n#define mp make_pair\\n#define all(in) in.begin(),in.end()\\nconst double PI=acos(-1);\\nconst double EPS=1e-10;\\nconst int inf=1e9;\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<int,int> pii;\\nint main(){\\n\\tint n,m;\\n\\twhile(cin>>m>>n,n+m){\\n\\t\\tvvi in(n,vi(m));\\n\\t\\tint sx,sy,gx,gy;\\n\\t\\trep(i,n)rep(j,m){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin>>s;\\n\\t\\t\\tif(s==\\\".\\\")in[i][j]=0;\\n\\t\\t\\telse if(s==\\\"G\\\"){gx=i,gy=j;}\\n\\t\\t\\telse if(s==\\\"S\\\"){sx=i;sy=j;}\\n\\t\\t\\telse in[i][j]=atoi(&s[0]);\\n\\n\\t\\t}\\n\\t\\tvector<pii>now;\\n\\t\\tnow.pb(pii(sx*10000+sy,0));\\n\\t\\tint co=1;\\n\\t\\twhile(1){\\n\\t\\t\\tvector<pii>next;\\n\\t\\t\\tbool h=false;\\n\\t\\t\\trep(i,n)rep(j,m)if(in[i][j]==co){\\n\\t\\t\\t\\th=true;\\n\\t\\t\\t\\tint mi=inf;\\n\\t\\t\\t\\trep(k,now.size()){\\n\\t\\t\\t\\t\\tmi=min(mi,\\n\\t\\t\\t\\t\\tnow[k].second+abs(i-now[k].first/10000)+abs(j-now[k].first%10000));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tnext.pb(pii(i*10000+j,mi));\\n\\t\\t\\t}\\n\\t\\t\\tif(!h)break;\\n\\t\\t\\tco++;\\n\\t\\t\\tnow=next;\\n\\t\\t}\\n\\t\\tint mi=inf;\\n\\t\\trep(i,now.size())mi=min(mi,abs(gx-now[i].first/10000)+abs(gy-now[i].first%10000)+now[i].second);\\n\\t\\tcout<<mi<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1280,\n \"score_of_the_acc\": -0.0476,\n \"final_rank\": 10\n }\n]","isConversational":false}}},{"rowIdx":1269,"cells":{"group_id":{"kind":"string","value":"aoj_2279_cpp"},"problem_description":{"kind":"string","value":"問題 I\n山\n問題文\nL 氏はある都市の市長である．L 氏の市長としての手腕はすさまじく時を止め一瞬にして都市中に鉄道網を引いたり，財政の赤字を一夜にして莫大な黒字にしたり，はては巨大な怪獣をどこからともなく呼んでパフォーマンスに使うこともした．\nそんな L 氏は土地の隣り合った行または列同士を何度も入れ替えることででこぼこな土地を山形にするという遊びを最近発明した．土地は\nH×W\n個のブロックに区切られており，ブロック\n(y,x)\nでは海面からの高さが\nh\ny,x\nであると測定されている．入れ替え後のブロック\n(y,x)\nの高さを\nh'\ny,x\nと書くことにする．この土地が山形であるとは，以下の図のように，あるブロック\n(y^*,x^*)\nがあって，そこを山頂として山頂から離れるに従って高さが単調減少しているものをいう．\nh'\ny^*-1, x^*-2\n<\nh'\ny^*-1, x^*-1\n<\nh'\ny^*-1, x^*\n>\nh'\ny^*-1, x^*+1\n>\nh'\ny^*-1, x^*+2\n∧\n∧\n∧\n∧\n∧\nh'\ny^*, x^*-2\n<\nh'\ny^*, x^*-1\n<\nh'\ny^*, x^*\n>\nh'\ny^*, x^*+1\n>\nh'\ny^*, x^*+2\n∨\n∨\n∨\n∨\n∨\nh'\ny^*+1, x^*-2\n<\nh'\ny^*+1, x^*-1\n<\nh'\ny^*+1, x^*\n>\nh'\ny^*+1, x^*+1\n>\nh'\ny^*+1, x^*+2\nところで，L 氏はいくらがんばっても山形にできないような土地が存在する気がした．そこで，前もってコンピュータにその土地が山形にできるかどうかをチェックさせることにした．\n入力形式\n最初の行に\nH\nと\nW\nがスペース区切りで与えられる．\n次の\nH\n行に土地の高さが与えられる．\n各行は\nW\n個の数値からなり，それぞれ対応する場所の高さを表す．\n出力形式\n土地を山形にできるなら\n\"YES\"\n，できないなら\n\"NO\"\nを出力せよ．\n制約\n1 ≤ H,W ≤ 1,000\n0 ≤ h\ny,x\n≤ 10\n8\n全ての\nh\ny,x\nは相異なる．\n入出力例\n入力例 1\n3 3\n1 3 2\n7 9 8\n4 6 5\n出力例 1\nYES\n入力例 2\n以下の例では\n2\n番目の列と\n3\n番目の列を入れ替えることにより土地を山形にすることができる．\n3 3\n9 3 6\n8 2 5\n7 1 4\n出力例 2\nYES\n入力例 3\n1 1\n100\n出力例 3\nYES\n入力例 4\n3 3\n1 3 2\n4 6 5\n7 8 9\n出力例 4\nNO\n謝辞\nこの問題は京都市の周りに山が多いことから作られた．よって京都市の周りの山に感謝の意を表する．"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2279_10215449","code_snippet":"// AOJ #2279\n// Mountain 2025.2.13\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\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(bool yes) {\n\tif (yes) pc('Y'), pc('E'), pc('S');\n else pc('N'), pc('O');\n pc('\\n');\n}\n \nbool dfsColor(int v, int c, const vector<vector<int>> &g, vector<int>& col) {\n col[v] = c;\n for (int nv : g[v]) {\n if (col[nv] == -1) {\n if (!dfsColor(nv, c^1, g, col)) return false;\n } else if (col[nv] == c) return false;\n }\n return true;\n}\n \nint main(){\n int H = Cin(), W = Cin();\n vector<vector<int>> A(H, vector<int>(W));\n for (int i=0; i<H; i++){\n for (int j=0; j<W; j++) A[i][j] = Cin();\n }\n \n int candCol = -1;\n for (int i=0; i<H; i++){\n int maxVal = -1, maxIdx = -1;\n for (int j=0; j<W; j++){\n if (A[i][j] > maxVal){\n maxVal = A[i][j];\n maxIdx = j;\n }\n }\n if(i==0) candCol = maxIdx;\n else if(maxIdx != candCol){\n Cout(0);\n return 0;\n }\n }\n \n int candRow = -1;\n for (int j=0; j<W; j++){\n int maxVal = -1, maxIdx = -1;\n for (int i=0; i<H; i++){\n if (A[i][j] > maxVal){\n maxVal = A[i][j];\n maxIdx = i;\n }\n }\n if(j==0) candRow = maxIdx;\n else if(maxIdx != candRow){\n Cout(0);;\n return 0;\n }\n }\n \n for (int i=0; i<H; i++){\n for (int j=0; j<W; j++){\n if(i==candRow && j==candCol) continue;\n if(A[i][j] > A[candRow][candCol]){\n Cout(0);\n return 0;\n }\n }\n }\n \n vector<int> rows;\n for (int i=0; i<H; i++){\n if(i==candRow) continue;\n rows.push_back(i);\n }\n vector<int> cols;\n for (int j=0; j<W; j++){\n if(j==candCol) continue;\n cols.push_back(j);\n }\n \n int rn = rows.size();\n vector<vector<int>> graphRows(rn);\n for (int a = 0; a < rn; a++){\n for (int b = a+1; b < rn; b++){\n int i = rows[a], k = rows[b];\n int sign = 0;\n bool comparable = true;\n for (int c : cols){\n int s = (A[i][c] < A[k][c]) ? 1 : -1;\n if(sign==0) sign = s;\n else {\n if(s != sign) { comparable = false; break; }\n }\n }\n if(!comparable){\n graphRows[a].push_back(b);\n graphRows[b].push_back(a);\n }\n }\n }\n vector<int> color(rn, -1);\n for (int i=0; i<rn; i++){\n if(color[i] == -1){\n if(!dfsColor(i, 0, graphRows, color)){\n Cout(0);\n return 0;\n }\n }\n }\n \n int cn = cols.size();\n vector<vector<int>> graphCols(cn);\n for (int a = 0; a < cn; a++){\n for (int b = a+1; b < cn; b++){\n int j = cols[a], k = cols[b];\n int sign = 0;\n bool comparable = true;\n for (int i = 0; i < H; i++){\n if(i==candRow) continue;\n int s = (A[i][j] < A[i][k]) ? 1 : -1;\n if(sign==0) { sign = s; }\n else {\n if(s != sign){ comparable = false; break; }\n }\n }\n if(!comparable){\n graphCols[a].push_back(b);\n graphCols[b].push_back(a);\n }\n }\n }\n vector<int> colorCols(cn, -1);\n for (int i=0; i<cn; i++){\n if(colorCols[i]==-1){\n if(!dfsColor(i, 0, graphCols, colorCols)){\n Cout(0);\n return 0;\n }\n }\n }\n Cout(1);\n return 0;\n}","accuracy":1,"time_ms":1110,"memory_kb":8924,"score_of_the_acc":-0.7892,"final_rank":11},{"submission_id":"aoj_2279_10215444","code_snippet":"// AOJ #2279\n// Mountain 2025.2.13\n\n#include <bits/stdc++.h>\nusing namespace std;\n \nbool dfsColor(int v, int c, const vector<vector<int>> &g, vector<int>& col) {\n col[v] = c;\n for (int nv : g[v]) {\n if (col[nv] == -1) {\n if (!dfsColor(nv, c^1, g, col)) return false;\n } else if (col[nv] == c) return false;\n }\n return true;\n}\n \nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int H, W;\n cin >> H >> W;\n vector<vector<int>> A(H, vector<int>(W));\n for (int i=0; i<H; i++){\n for (int j=0; j<W; j++) cin >> A[i][j];\n }\n \n int candCol = -1;\n for (int i=0; i<H; i++){\n int maxVal = -1, maxIdx = -1;\n for (int j=0; j<W; j++){\n if (A[i][j] > maxVal){\n maxVal = A[i][j];\n maxIdx = j;\n }\n }\n if(i==0) candCol = maxIdx;\n else if(maxIdx != candCol){\n cout << \"NO\\n\";\n return 0;\n }\n }\n \n int candRow = -1;\n for (int j=0; j<W; j++){\n int maxVal = -1, maxIdx = -1;\n for (int i=0; i<H; i++){\n if (A[i][j] > maxVal){\n maxVal = A[i][j];\n maxIdx = i;\n }\n }\n if(j==0) candRow = maxIdx;\n else if(maxIdx != candRow){\n cout << \"NO\\n\";\n return 0;\n }\n }\n \n for (int i=0; i<H; i++){\n for (int j=0; j<W; j++){\n if(i==candRow && j==candCol) continue;\n if(A[i][j] > A[candRow][candCol]){\n cout << \"NO\\n\";\n return 0;\n }\n }\n }\n \n vector<int> rows;\n for (int i=0; i<H; i++){\n if(i==candRow) continue;\n rows.push_back(i);\n }\n vector<int> cols;\n for (int j=0; j<W; j++){\n if(j==candCol) continue;\n cols.push_back(j);\n }\n \n int rn = rows.size();\n vector<vector<int>> graphRows(rn);\n for (int a = 0; a < rn; a++){\n for (int b = a+1; b < rn; b++){\n int i = rows[a], k = rows[b];\n int sign = 0;\n bool comparable = true;\n for (int c : cols){\n int s = (A[i][c] < A[k][c]) ? 1 : -1;\n if(sign==0) sign = s;\n else {\n if(s != sign) { comparable = false; break; }\n }\n }\n if(!comparable){\n graphRows[a].push_back(b);\n graphRows[b].push_back(a);\n }\n }\n }\n vector<int> color(rn, -1);\n for (int i=0; i<rn; i++){\n if(color[i] == -1){\n if(!dfsColor(i, 0, graphRows, color)){\n cout << \"NO\\n\";\n return 0;\n }\n }\n }\n \n int cn = cols.size();\n vector<vector<int>> graphCols(cn);\n for (int a = 0; a < cn; a++){\n for (int b = a+1; b < cn; b++){\n int j = cols[a], k = cols[b];\n int sign = 0;\n bool comparable = true;\n for (int i = 0; i < H; i++){\n if(i==candRow) continue;\n int s = (A[i][j] < A[i][k]) ? 1 : -1;\n if(sign==0) { sign = s; }\n else {\n if(s != sign){ comparable = false; break; }\n }\n }\n if(!comparable){\n graphCols[a].push_back(b);\n graphCols[b].push_back(a);\n }\n }\n }\n vector<int> colorCols(cn, -1);\n for (int i=0; i<cn; i++){\n if(colorCols[i]==-1){\n if(!dfsColor(i, 0, graphCols, colorCols)){\n cout << \"NO\\n\";\n return 0;\n }\n }\n }\n cout << \"YES\\n\";\n return 0;\n}","accuracy":1,"time_ms":1170,"memory_kb":8568,"score_of_the_acc":-0.8258,"final_rank":13},{"submission_id":"aoj_2279_8570852","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint h, w;\nvector<int> g[4004];\nint match[4004];\nbool used[4004];\nbool dfs(int v){\n used[v] = true;\n for(int i=0;i<g[v].size();i++){\n int u = g[v][i];\n int w = match[u];\n if(w<0 || !used[w]&&dfs(w)){\n match[v] = u;\n match[u] = v;\n return true;\n }\n }\n return false;\n}\nbool bm(){\n int res1 = 0;\n memset(match, -1, sizeof(match));\n for(int v=0;v<h;v++){\n if(match[v]<0){\n memset(used, 0, sizeof(used));\n if(dfs(v)) res1++;\n }\n }\n int res2 = 0;\n for(int v=h+h;v<h+h+w;v++){\n if(match[v]<0){\n memset(used, 0, sizeof(used));\n if(dfs(v)) res2++;\n }\n }\n return res1<=2&&res2<=2;\n}\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n int mo[1001][1001];\n cin >> h >> w;\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++) cin >> mo[i][j];\n }\n int hsum[1001]={};\n for(int i=0;i<h;i++){\n for(int j=0;j<i;j++){\n int c1=0,c2=0;\n for(int k=0;k<w;k++){\n if(mo[j][k]>mo[i][k]) c1++;\n else if(mo[j][k]<mo[i][k]) c2++;\n }\n if(c1==w){\n g[j].push_back(i+h);\n hsum[i]++;\n }\n else if(c2==w){\n g[i].push_back(j+h);\n hsum[j]++;\n }\n }\n }\n int wsum[1001]={};\n for(int i=0;i<w;i++){\n for(int j=0;j<i;j++){\n int c1=0,c2=0;\n for(int k=0;k<h;k++){\n if(mo[k][j]>mo[k][i]) c1++;\n else if(mo[k][j]<mo[k][i]) c2++;\n }\n if(c1==w){\n g[j+h+h].push_back(i+h+h+w);\n wsum[i]++;\n }\n else if(c2==w){\n g[i+h+h].push_back(j+h+h+w);\n wsum[j]++;\n }\n }\n }\n bool ok=bm();\n int cnt=0;\n for(int i=0;i<h;i++){\n if(hsum[i]==0) cnt++;\n }\n if(cnt!=1) ok=false;\n cnt=0;\n for(int i=0;i<w;i++){\n if(wsum[i]==0) cnt++;\n }\n if(cnt!=1) ok=false;\n cout << (ok?\"YES\":\"NO\") << endl;\n return(0);\n}","accuracy":0.08108108108108109,"time_ms":90,"memory_kb":9784,"score_of_the_acc":-0.0379,"final_rank":20},{"submission_id":"aoj_2279_5270279","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<ll> vll;\ntypedef pair<int,int> pint;\n\n#define DE 1\n#define FI first\n#define SE second\n#define PB push_back\n#define MP make_pair\n#define ALL(s) (s).begin(),(s).end()\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\", \"<<P.second<<'>';}\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\"{ \";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) {s<<\"{ \";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\", \";s<<'<'<<it->first<<\"->\"<<it->second<<'>';}return s<<\" }\"<<endl;}\n\n\n\nconst int MAX = 1010;\n\nstruct Graph {\n static const int MAX_V_ = ::MAX;\n int L;\n vector<int> list[MAX_V_];\n \n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\n inline vector<int>& operator [] (int i) {return list[i];}\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \" : \" << G.list[i];}return s;}\n \n void addedge(int from, int to) {\n list[from].push_back(to);\n }\n} G;\n\nint L = 0;\nbool seen[MAX];\nbool matched[MAX];\nint level[MAX];\nint matching[MAX];\n\nvoid hobfs(Graph &G) {\n queue<int> que;\n for (int left = 0; left < L; ++left) {\n level[left] = -1;\n if (!matched[left]) {\n que.push(left);\n level[left] = 0;\n }\n }\n level[L] = L;\n while (!que.empty()) {\n int left = que.front();\n que.pop();\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] == -1) {\n level[next] = level[left] + 1;\n que.push(next);\n }\n }\n }\n}\n\nbool hodfs(Graph &G, int left) {\n if (left == L) return true;\n if (seen[left]) return false;\n seen[left] = true;\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] > level[left] && hodfs(G, next)) {\n matching[right] = left;\n return true;\n }\n }\n return false;\n}\n\nint Hopcroft_Karp(Graph &G) {\n L = G.L;\n for (int i = 0; i < MAX; ++i) matching[i] = L;\n memset(matched, 0, sizeof(matched));\n \n int res = 0;\n while (true) {\n hobfs(G);\n memset(seen, 0, sizeof(seen));\n bool finished = true;\n for (int left = 0; left < L; ++left) {\n if (!matched[left] && hodfs(G, left)) {\n matched[left] = true;\n ++res;\n finished = false;\n }\n }\n if (finished) break;\n }\n return res;\n}\n\n\nint H, W;\nvint h[MAX];\nint temp[MAX][MAX];\nbool connected[MAX][MAX];\n\nbool solve() {\n bool res = true;\n \n int pMax = -1, Max = -1;\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\n for (int i = 0; i < W; ++i) {\n int epMax = -1, eMax = -1;\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\n if (epMax != pMax) {res = false; break;}\n }\n if (res) {\n for (int i = 0; i < H; ++i) {\n for (int j = 0; j < H; ++j) {\n if (!connected[i][j]) {\n bool ok = true;\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\n if (ok) {\n connected[i][j] = true;\n for (int k = 0; k < H; ++k) connected[i][k] |= connected[j][k];\n }\n }\n }\n }\n G.init(H);\n for (int i = 0; i < H; ++i)\n for (int j = 0; j < H; ++j) {\n if (i == j) continue;\n if (connected[i][j]) G.addedge(i,j);\n }\n \n int ans = Hopcroft_Karp(G);\n if (H - ans > 2) res = false;\n }\n\n return res;\n}\n\nint main() { \n cin >> H >> W;\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n scanf(\"%d\", &h[i][j]);\n temp[j][i] = h[i][j];\n }\n \n bool can = true;\n if (!solve()) can = false;\n \n if (can) {\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j) \n temp[i][j] = h[j][i];\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j)\n h[i][j] = temp[i][j];\n swap(H, W);\n \n if (!solve()) can = false;\n }\n \n if (can) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":470,"memory_kb":16436,"score_of_the_acc":-0.4917,"final_rank":9},{"submission_id":"aoj_2279_5270277","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<ll> vll;\ntypedef pair<int,int> pint;\n\n#define DE 1\n#define FI first\n#define SE second\n#define PB push_back\n#define MP make_pair\n#define ALL(s) (s).begin(),(s).end()\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\", \"<<P.second<<'>';}\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\"{ \";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) {s<<\"{ \";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\", \";s<<'<'<<it->first<<\"->\"<<it->second<<'>';}return s<<\" }\"<<endl;}\n\n\n\nconst int MAX = 1010;\n\nstruct Graph {\n static const int MAX_V_ = ::MAX;\n int L;\n vector<int> list[MAX_V_];\n \n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\n inline vector<int>& operator [] (int i) {return list[i];}\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \" : \" << G.list[i];}return s;}\n \n void addedge(int from, int to) {\n list[from].push_back(to);\n }\n} G;\n\nint L = 0;\nbool seen[MAX];\nbool matched[MAX];\nint level[MAX];\nint matching[MAX];\n\nvoid hobfs(Graph &G) {\n queue<int> que;\n for (int left = 0; left < L; ++left) {\n level[left] = -1;\n if (!matched[left]) {\n que.push(left);\n level[left] = 0;\n }\n }\n level[L] = L;\n while (!que.empty()) {\n int left = que.front();\n que.pop();\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] == -1) {\n level[next] = level[left] + 1;\n que.push(next);\n }\n }\n }\n}\n\nbool hodfs(Graph &G, int left) {\n if (left == L) return true;\n if (seen[left]) return false;\n seen[left] = true;\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] > level[left] && hodfs(G, next)) {\n matching[right] = left;\n return true;\n }\n }\n return false;\n}\n\nint Hopcroft_Karp(Graph &G) {\n L = G.L;\n for (int i = 0; i < MAX; ++i) matching[i] = L;\n memset(matched, 0, sizeof(matched));\n \n int res = 0;\n while (true) {\n hobfs(G);\n memset(seen, 0, sizeof(seen));\n bool finished = true;\n for (int left = 0; left < L; ++left) {\n if (!matched[left] && hodfs(G, left)) {\n matched[left] = true;\n ++res;\n finished = false;\n }\n }\n if (finished) break;\n }\n return res;\n}\n\n\nint H, W;\nvint h[MAX];\nint temp[MAX][MAX];\nbool connected[MAX][MAX];\n\nbool solve() {\n bool res = true;\n \n int pMax = -1, Max = -1;\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\n for (int i = 0; i < W; ++i) {\n int epMax = -1, eMax = -1;\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\n if (epMax != pMax) {res = false; break;}\n }\n if (res) {\n for (int i = 0; i < H; ++i) {\n for (int j = 0; j < H; ++j) {\n if (!connected[i][j]) {\n bool ok = true;\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\n if (ok) {\n connected[i][j] = true;\n connected[j][i] = false;\n for (int k = 0; k < H; ++k) connected[i][k] |= connected[j][k];\n }\n }\n }\n }\n G.init(H);\n for (int i = 0; i < H; ++i)\n for (int j = 0; j < H; ++j) {\n if (i == j) continue;\n if (connected[i][j]) G.addedge(i,j);\n }\n \n int ans = Hopcroft_Karp(G);\n if (H - ans > 2) res = false;\n }\n\n return res;\n}\n\nint main() { \n cin >> H >> W;\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n scanf(\"%d\", &h[i][j]);\n temp[j][i] = h[i][j];\n }\n \n bool can = true;\n if (!solve()) can = false;\n \n if (can) {\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j) \n temp[i][j] = h[j][i];\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j)\n h[i][j] = temp[i][j];\n swap(H, W);\n \n if (!solve()) can = false;\n }\n \n if (can) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":600,"memory_kb":16308,"score_of_the_acc":-0.587,"final_rank":10},{"submission_id":"aoj_2279_5270208","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<ll> vll;\ntypedef pair<int,int> pint;\n\n#define DE 1\n#define FI first\n#define SE second\n#define PB push_back\n#define MP make_pair\n#define ALL(s) (s).begin(),(s).end()\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\", \"<<P.second<<'>';}\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\"{ \";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) {s<<\"{ \";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\", \";s<<'<'<<it->first<<\"->\"<<it->second<<'>';}return s<<\" }\"<<endl;}\n\n\n\nconst int MAX = 1010;\n\nstruct Graph {\n static const int MAX_V_ = ::MAX;\n int L;\n vector<int> list[MAX_V_];\n \n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\n inline vector<int>& operator [] (int i) {return list[i];}\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \" : \" << G.list[i];}return s;}\n \n void addedge(int from, int to) {\n list[from].push_back(to);\n }\n} G;\n\nint L = 0;\nbool seen[MAX];\nbool matched[MAX];\nint level[MAX];\nint matching[MAX];\n\nvoid hobfs(Graph &G) {\n queue<int> que;\n for (int left = 0; left < L; ++left) {\n level[left] = -1;\n if (!matched[left]) {\n que.push(left);\n level[left] = 0;\n }\n }\n level[L] = L;\n while (!que.empty()) {\n int left = que.front();\n que.pop();\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] == -1) {\n level[next] = level[left] + 1;\n que.push(next);\n }\n }\n }\n}\n\nbool hodfs(Graph &G, int left) {\n if (left == L) return true;\n if (seen[left]) return false;\n seen[left] = true;\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] > level[left] && hodfs(G, next)) {\n matching[right] = left;\n return true;\n }\n }\n return false;\n}\n\nint Hopcroft_Karp(Graph &G) {\n L = G.L;\n for (int i = 0; i < MAX; ++i) matching[i] = L;\n memset(matched, 0, sizeof(matched));\n \n int res = 0;\n while (true) {\n hobfs(G);\n memset(seen, 0, sizeof(seen));\n bool finished = true;\n for (int left = 0; left < L; ++left) {\n if (!matched[left] && hodfs(G, left)) {\n matched[left] = true;\n ++res;\n finished = false;\n }\n }\n if (finished) break;\n }\n return res;\n}\n\n\nint H, W;\nvint h[MAX];\nint temp[MAX][MAX];\nbool connected[MAX][MAX];\n\nbool solve() {\n bool res = true;\n \n int pMax = -1, Max = -1;\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\n for (int i = 0; i < W; ++i) {\n int epMax = -1, eMax = -1;\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\n if (epMax != pMax) {res = false; break;}\n }\n if (res) {\n sort(h, h + H);\n for (int i = 0; i < H; ++i) {\n for (int j = i-1; j >= 0; --j) {\n if (!connected[i][j]) {\n bool ok = true;\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\n if (ok) {\n connected[i][j] = true;\n for (int k = 0; k < j; ++k) connected[i][k] |= connected[j][k];\n }\n }\n }\n }\n G.init(H);\n for (int i = 0; i < H; ++i)\n for (int j = 0; j < H; ++j) {\n if (connected[i][j]) G.addedge(i,j);\n }\n \n int ans = Hopcroft_Karp(G);\n if (H - ans > 2) res = false;\n }\n\n return res;\n}\n\nint main() { \n cin >> H >> W;\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n scanf(\"%d\", &h[i][j]);\n temp[j][i] = h[i][j];\n }\n \n bool can = true;\n if (!solve()) can = false;\n \n if (can) {\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j) \n temp[i][j] = h[j][i];\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j)\n h[i][j] = temp[i][j];\n swap(H, W);\n \n if (!solve()) can = false;\n }\n \n if (can) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":15020,"score_of_the_acc":-0.1609,"final_rank":1},{"submission_id":"aoj_2279_5270207","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<ll> vll;\ntypedef pair<int,int> pint;\n\n#define DE 1\n#define FI first\n#define SE second\n#define PB push_back\n#define MP make_pair\n#define ALL(s) (s).begin(),(s).end()\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\", \"<<P.second<<'>';}\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\"{ \";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) {s<<\"{ \";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\", \";s<<'<'<<it->first<<\"->\"<<it->second<<'>';}return s<<\" }\"<<endl;}\n\n\n\nconst int MAX = 1010;\n\nstruct Graph {\n static const int MAX_V_ = ::MAX;\n int L;\n vector<int> list[MAX_V_];\n \n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\n inline vector<int>& operator [] (int i) {return list[i];}\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \" : \" << G.list[i];}return s;}\n \n void addedge(int from, int to) {\n list[from].push_back(to);\n }\n} G;\n\nint L = 0;\nbool seen[MAX];\nbool matched[MAX];\nint level[MAX];\nint matching[MAX];\n\nvoid hobfs(Graph &G) {\n queue<int> que;\n for (int left = 0; left < L; ++left) {\n level[left] = -1;\n if (!matched[left]) {\n que.push(left);\n level[left] = 0;\n }\n }\n level[L] = L;\n while (!que.empty()) {\n int left = que.front();\n que.pop();\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] == -1) {\n level[next] = level[left] + 1;\n que.push(next);\n }\n }\n }\n}\n\nbool hodfs(Graph &G, int left) {\n if (left == L) return true;\n if (seen[left]) return false;\n seen[left] = true;\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] > level[left] && hodfs(G, next)) {\n matching[right] = left;\n return true;\n }\n }\n return false;\n}\n\nint Hopcroft_Karp(Graph &G) {\n L = G.L;\n for (int i = 0; i < MAX; ++i) matching[i] = L;\n memset(matched, 0, sizeof(matched));\n \n int res = 0;\n while (true) {\n hobfs(G);\n memset(seen, 0, sizeof(seen));\n bool finished = true;\n for (int left = 0; left < L; ++left) {\n if (!matched[left] && hodfs(G, left)) {\n matched[left] = true;\n ++res;\n finished = false;\n }\n }\n if (finished) break;\n }\n return res;\n}\n\n\nint H, W;\nvint h[MAX];\nint temp[MAX][MAX];\nbool connected[MAX][MAX];\n\nbool solve() {\n bool res = true;\n \n int pMax = -1, Max = -1;\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\n for (int i = 0; i < W; ++i) {\n int epMax = -1, eMax = -1;\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\n if (epMax != pMax) {res = false; break;}\n }\n if (res) {\n sort(h, h + H);\n for (int i = 0; i < H; ++i) {\n for (int j = i-1; j >= 0; --j) {\n if (!connected[i][j]) {\n bool ok = true;\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\n if (ok) {\n connected[i][j] = true;\n for (int k = 0; k < j; ++k) connected[i][k] |= connected[j][k];\n }\n }\n }\n }\n G.init(H);\n for (int i = 0; i < H; ++i)\n for (int j = 0; j < H; ++j) {\n if (i == j) continue;\n if (connected[i][j]) G.addedge(i,j);\n }\n \n int ans = Hopcroft_Karp(G);\n if (H - ans > 2) res = false;\n }\n\n return res;\n}\n\nint main() { \n cin >> H >> W;\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n scanf(\"%d\", &h[i][j]);\n temp[j][i] = h[i][j];\n }\n \n bool can = true;\n if (!solve()) can = false;\n \n if (can) {\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j) \n temp[i][j] = h[j][i];\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j)\n h[i][j] = temp[i][j];\n swap(H, W);\n \n if (!solve()) can = false;\n }\n \n if (can) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":15104,"score_of_the_acc":-0.163,"final_rank":2},{"submission_id":"aoj_2279_5267756","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<ll> vll;\ntypedef pair<int,int> pint;\n\n#define DE 1\n#define FI first\n#define SE second\n#define PB push_back\n#define MP make_pair\n#define ALL(s) (s).begin(),(s).end()\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\", \"<<P.second<<'>';}\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\"{ \";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) {s<<\"{ \";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\", \";s<<'<'<<it->first<<\"->\"<<it->second<<'>';}return s<<\" }\"<<endl;}\n\n\n\nconst int MAX = 1010;\n\nstruct Graph {\n static const int MAX_V_ = ::MAX;\n int L;\n vector<int> list[MAX_V_];\n \n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\n inline vector<int>& operator [] (int i) {return list[i];}\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \" : \" << G.list[i];}return s;}\n \n void addedge(int from, int to) {\n list[from].push_back(to);\n }\n} G;\n\nint L = 0;\nbool seen[MAX];\nbool matched[MAX];\nint level[MAX];\nint matching[MAX];\n\nvoid hobfs(Graph &G) {\n queue<int> que;\n for (int left = 0; left < L; ++left) {\n level[left] = -1;\n if (!matched[left]) {\n que.push(left);\n level[left] = 0;\n }\n }\n level[L] = L;\n while (!que.empty()) {\n int left = que.front();\n que.pop();\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] == -1) {\n level[next] = level[left] + 1;\n que.push(next);\n }\n }\n }\n}\n\nbool hodfs(Graph &G, int left) {\n if (left == L) return true;\n if (seen[left]) return false;\n seen[left] = true;\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] > level[left] && hodfs(G, next)) {\n matching[right] = left;\n return true;\n }\n }\n return false;\n}\n\nint Hopcroft_Karp(Graph &G) {\n L = G.L;\n for (int i = 0; i < MAX; ++i) matching[i] = L;\n memset(matched, 0, sizeof(matched));\n \n int res = 0;\n while (true) {\n hobfs(G);\n memset(seen, 0, sizeof(seen));\n bool finished = true;\n for (int left = 0; left < L; ++left) {\n if (!matched[left] && hodfs(G, left)) {\n matched[left] = true;\n ++res;\n finished = false;\n }\n }\n if (finished) break;\n }\n return res;\n}\n\n\nint H, W;\nvint h[MAX];\nint temp[MAX][MAX];\nbool connected[MAX][MAX];\n\nbool solve() {\n bool res = true;\n \n int pMax = -1, Max = -1;\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\n for (int i = 0; i < W; ++i) {\n int epMax = -1, eMax = -1;\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\n if (epMax != pMax) {res = false; break;}\n }\n if (res) {\n sort(h, h + H);\n for (int i = 0; i < H ; ++i) {\n for (int j = i-1; j >= 0; --j) {\n if (!connected[i][j]) {\n bool ok = true;\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\n if (ok) {\n connected[i][j] = true;\n for (int k = 0; k < H; ++k) connected[i][k] |= connected[j][k];\n }\n }\n }\n }\n G.init(H);\n for (int i = 0; i < H; ++i)\n for (int j = 0; j < H; ++j) {\n if (i == j) continue;\n if (connected[i][j]) G.addedge(i,j);\n }\n \n int ans = Hopcroft_Karp(G);\n if (H - ans > 2) res = false;\n }\n\n return res;\n}\n\nint main() { \n cin >> H >> W;\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n scanf(\"%d\", &h[i][j]);\n temp[j][i] = h[i][j];\n }\n \n bool can = true;\n if (!solve()) can = false;\n \n if (can) {\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j) \n temp[i][j] = h[j][i];\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j)\n h[i][j] = temp[i][j];\n swap(H, W);\n \n if (!solve()) can = false;\n }\n \n if (can) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":15124,"score_of_the_acc":-0.1635,"final_rank":4},{"submission_id":"aoj_2279_5267751","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<ll> vll;\ntypedef pair<int,int> pint;\n\n#define DE 1\n#define FI first\n#define SE second\n#define PB push_back\n#define MP make_pair\n#define ALL(s) (s).begin(),(s).end()\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\", \"<<P.second<<'>';}\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\"{ \";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) {s<<\"{ \";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\", \";s<<'<'<<it->first<<\"->\"<<it->second<<'>';}return s<<\" }\"<<endl;}\n\n\n\nconst int MAX = 1010;\n\nstruct Graph {\n static const int MAX_V_ = ::MAX;\n int L;\n vector<int> list[MAX_V_];\n \n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\n inline vector<int>& operator [] (int i) {return list[i];}\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \" : \" << G.list[i];}return s;}\n \n void addedge(int from, int to) {\n list[from].push_back(to);\n }\n} G;\n\nint L = 0;\nbool seen[MAX];\nbool matched[MAX];\nint level[MAX];\nint matching[MAX];\n\nvoid hobfs(Graph &G) {\n queue<int> que;\n for (int left = 0; left < L; ++left) {\n level[left] = -1;\n if (!matched[left]) {\n que.push(left);\n level[left] = 0;\n }\n }\n level[L] = L;\n while (!que.empty()) {\n int left = que.front();\n que.pop();\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] == -1) {\n level[next] = level[left] + 1;\n que.push(next);\n }\n }\n }\n}\n\nbool hodfs(Graph &G, int left) {\n if (left == L) return true;\n if (seen[left]) return false;\n seen[left] = true;\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] > level[left] && hodfs(G, next)) {\n matching[right] = left;\n return true;\n }\n }\n return false;\n}\n\nint Hopcroft_Karp(Graph &G) {\n L = G.L;\n for (int i = 0; i < MAX; ++i) matching[i] = L;\n memset(matched, 0, sizeof(matched));\n \n int res = 0;\n while (true) {\n hobfs(G);\n memset(seen, 0, sizeof(seen));\n bool finished = true;\n for (int left = 0; left < L; ++left) {\n if (!matched[left] && hodfs(G, left)) {\n matched[left] = true;\n ++res;\n finished = false;\n }\n }\n if (finished) break;\n }\n return res;\n}\n\n\nint H, W;\nvint h[MAX];\nint temp[MAX][MAX];\nbool connected[MAX][MAX];\n\nbool solve() {\n bool res = true;\n \n int pMax = -1, Max = -1;\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\n for (int i = 0; i < W; ++i) {\n int epMax = -1, eMax = -1;\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\n if (epMax != pMax) {res = false; break;}\n }\n if (res) {\n sort(h, h + H);\n for (int i = H-1; i >= 0 ; --i) {\n for (int j = 0; j < i; ++j) {\n if (!connected[i][j]) {\n bool ok = true;\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\n if (ok) {\n connected[i][j] = true;\n for (int k = 0; k < H; ++k) connected[i][k] |= connected[j][k];\n }\n }\n }\n }\n G.init(H);\n for (int i = 0; i < H; ++i)\n for (int j = 0; j < H; ++j) {\n if (i == j) continue;\n if (connected[i][j]) G.addedge(i,j);\n }\n \n int ans = Hopcroft_Karp(G);\n if (H - ans > 2) res = false;\n }\n\n return res;\n}\n\nint main() { \n cin >> H >> W;\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n scanf(\"%d\", &h[i][j]);\n temp[j][i] = h[i][j];\n }\n \n bool can = true;\n if (!solve()) can = false;\n \n if (can) {\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j) \n temp[i][j] = h[j][i];\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j)\n h[i][j] = temp[i][j];\n swap(H, W);\n \n if (!solve()) can = false;\n }\n \n if (can) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":480,"memory_kb":15080,"score_of_the_acc":-0.4654,"final_rank":8},{"submission_id":"aoj_2279_5267735","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<ll> vll;\ntypedef pair<int,int> pint;\n\n#define DE 1\n#define FI first\n#define SE second\n#define PB push_back\n#define MP make_pair\n#define ALL(s) (s).begin(),(s).end()\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\", \"<<P.second<<'>';}\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\"{ \";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) {s<<\"{ \";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\", \";s<<'<'<<it->first<<\"->\"<<it->second<<'>';}return s<<\" }\"<<endl;}\n\n\n\nconst int MAX = 1010;\n\nstruct Graph {\n static const int MAX_V_ = ::MAX;\n int L;\n vector<int> list[MAX_V_];\n \n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\n inline vector<int>& operator [] (int i) {return list[i];}\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \" : \" << G.list[i];}return s;}\n \n void addedge(int from, int to) {\n list[from].push_back(to);\n }\n} G;\n\nint L = 0;\nbool seen[MAX];\nbool matched[MAX];\nint level[MAX];\nint matching[MAX];\n\nvoid hobfs(Graph &G) {\n queue<int> que;\n for (int left = 0; left < L; ++left) {\n level[left] = -1;\n if (!matched[left]) {\n que.push(left);\n level[left] = 0;\n }\n }\n level[L] = L;\n while (!que.empty()) {\n int left = que.front();\n que.pop();\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] == -1) {\n level[next] = level[left] + 1;\n que.push(next);\n }\n }\n }\n}\n\nbool hodfs(Graph &G, int left) {\n if (left == L) return true;\n if (seen[left]) return false;\n seen[left] = true;\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] > level[left] && hodfs(G, next)) {\n matching[right] = left;\n return true;\n }\n }\n return false;\n}\n\nint Hopcroft_Karp(Graph &G) {\n L = G.L;\n for (int i = 0; i < MAX; ++i) matching[i] = L;\n memset(matched, 0, sizeof(matched));\n \n int res = 0;\n while (true) {\n hobfs(G);\n memset(seen, 0, sizeof(seen));\n bool finished = true;\n for (int left = 0; left < L; ++left) {\n if (!matched[left] && hodfs(G, left)) {\n matched[left] = true;\n ++res;\n finished = false;\n }\n }\n if (finished) break;\n }\n return res;\n}\n\n\nint H, W;\nvint h[MAX];\nint temp[MAX][MAX];\nbool connected[MAX][MAX];\n\nbool solve() {\n bool res = true;\n \n int pMax = -1, Max = -1;\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\n for (int i = 0; i < W; ++i) {\n int epMax = -1, eMax = -1;\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\n if (epMax != pMax) {res = false; break;}\n }\n if (res) {\n sort(h, h + H);\n for (int i = 0; i < H ; ++i) {\n for (int j = 0; j < i; ++j) {\n if (!connected[i][j]) {\n bool ok = true;\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\n if (ok) {\n connected[i][j] = true;\n for (int k = 0; k < H; ++k) connected[i][k] |= connected[j][k];\n }\n }\n }\n }\n G.init(H);\n for (int i = 0; i < H; ++i)\n for (int j = 0; j < H; ++j) {\n if (i == j) continue;\n if (connected[i][j]) G.addedge(i,j);\n }\n \n int ans = Hopcroft_Karp(G);\n if (H - ans > 2) res = false;\n }\n\n return res;\n}\n\nint main() { \n cin >> H >> W;\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n scanf(\"%d\", &h[i][j]);\n temp[j][i] = h[i][j];\n }\n \n bool can = true;\n if (!solve()) can = false;\n \n if (can) {\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j) \n temp[i][j] = h[j][i];\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j)\n h[i][j] = temp[i][j];\n swap(H, W);\n \n if (!solve()) can = false;\n }\n \n if (can) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":470,"memory_kb":15036,"score_of_the_acc":-0.4568,"final_rank":7},{"submission_id":"aoj_2279_5267717","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<ll> vll;\ntypedef pair<int,int> pint;\n\n#define DE 1\n#define FI first\n#define SE second\n#define PB push_back\n#define MP make_pair\n#define ALL(s) (s).begin(),(s).end()\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\", \"<<P.second<<'>';}\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\"{ \";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) {s<<\"{ \";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\", \";s<<'<'<<it->first<<\"->\"<<it->second<<'>';}return s<<\" }\"<<endl;}\n\n\n\nconst int MAX = 1010;\n\nstruct Graph {\n static const int MAX_V_ = ::MAX;\n int L;\n vector<int> list[MAX_V_];\n \n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\n inline vector<int>& operator [] (int i) {return list[i];}\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \" : \" << G.list[i];}return s;}\n \n void addedge(int from, int to) {\n list[from].push_back(to);\n }\n} G;\n\nint L = 0;\nbool seen[MAX];\nbool matched[MAX];\nint level[MAX];\nint matching[MAX];\n\nvoid hobfs(Graph &G) {\n queue<int> que;\n for (int left = 0; left < L; ++left) {\n level[left] = -1;\n if (!matched[left]) {\n que.push(left);\n level[left] = 0;\n }\n }\n level[L] = L;\n while (!que.empty()) {\n int left = que.front();\n que.pop();\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] == -1) {\n level[next] = level[left] + 1;\n que.push(next);\n }\n }\n }\n}\n\nbool hodfs(Graph &G, int left) {\n if (left == L) return true;\n if (seen[left]) return false;\n seen[left] = true;\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] > level[left] && hodfs(G, next)) {\n matching[right] = left;\n return true;\n }\n }\n return false;\n}\n\nint Hopcroft_Karp(Graph &G) {\n L = G.L;\n for (int i = 0; i < MAX; ++i) matching[i] = L;\n memset(matched, 0, sizeof(matched));\n \n int res = 0;\n while (true) {\n hobfs(G);\n memset(seen, 0, sizeof(seen));\n bool finished = true;\n for (int left = 0; left < L; ++left) {\n if (!matched[left] && hodfs(G, left)) {\n matched[left] = true;\n ++res;\n finished = false;\n }\n }\n if (finished) break;\n }\n return res;\n}\n\n\nint H, W;\nvint h[MAX];\nint temp[MAX][MAX];\nbool connected[MAX][MAX];\n\nbool solve() {\n bool res = true;\n \n int pMax = -1, Max = -1;\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\n for (int i = 0; i < W; ++i) {\n int epMax = -1, eMax = -1;\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\n if (epMax != pMax) {res = false; break;}\n }\n if (res) {\n sort(h, h + H);\n for (int i = H-1; i >= 0 ; --i) {\n for (int j = i-1; j >= 0; --j) {\n if (!connected[i][j]) {\n bool ok = true;\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\n if (ok) {\n connected[i][j] = true;\n for (int k = j-1; k >= 0; --k) connected[i][k] |= connected[j][k];\n }\n }\n }\n }\n G.init(H);\n for (int i = 0; i < H; ++i)\n for (int j = 0; j < H; ++j) {\n if (i == j) continue;\n if (connected[i][j]) G.addedge(i,j);\n }\n \n int ans = Hopcroft_Karp(G);\n if (H - ans > 2) res = false;\n }\n\n return res;\n}\n\nint main() { \n cin >> H >> W;\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n scanf(\"%d\", &h[i][j]);\n temp[j][i] = h[i][j];\n }\n \n bool can = true;\n if (!solve()) can = false;\n \n if (can) {\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j) \n temp[i][j] = h[j][i];\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j)\n h[i][j] = temp[i][j];\n swap(H, W);\n \n if (!solve()) can = false;\n }\n \n if (can) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":350,"memory_kb":15032,"score_of_the_acc":-0.3657,"final_rank":5},{"submission_id":"aoj_2279_5267716","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<ll> vll;\ntypedef pair<int,int> pint;\n\n#define DE 1\n#define FI first\n#define SE second\n#define PB push_back\n#define MP make_pair\n#define ALL(s) (s).begin(),(s).end()\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\", \"<<P.second<<'>';}\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\"{ \";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) {s<<\"{ \";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\", \";s<<'<'<<it->first<<\"->\"<<it->second<<'>';}return s<<\" }\"<<endl;}\n\n\n\nconst int MAX = 1010;\n\nstruct Graph {\n static const int MAX_V_ = ::MAX;\n int L;\n vector<int> list[MAX_V_];\n \n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\n inline vector<int>& operator [] (int i) {return list[i];}\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \" : \" << G.list[i];}return s;}\n \n void addedge(int from, int to) {\n list[from].push_back(to);\n }\n} G;\n\nint L = 0;\nbool seen[MAX];\nbool matched[MAX];\nint level[MAX];\nint matching[MAX];\n\nvoid hobfs(Graph &G) {\n queue<int> que;\n for (int left = 0; left < L; ++left) {\n level[left] = -1;\n if (!matched[left]) {\n que.push(left);\n level[left] = 0;\n }\n }\n level[L] = L;\n while (!que.empty()) {\n int left = que.front();\n que.pop();\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] == -1) {\n level[next] = level[left] + 1;\n que.push(next);\n }\n }\n }\n}\n\nbool hodfs(Graph &G, int left) {\n if (left == L) return true;\n if (seen[left]) return false;\n seen[left] = true;\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] > level[left] && hodfs(G, next)) {\n matching[right] = left;\n return true;\n }\n }\n return false;\n}\n\nint Hopcroft_Karp(Graph &G) {\n L = G.L;\n for (int i = 0; i < MAX; ++i) matching[i] = L;\n memset(matched, 0, sizeof(matched));\n \n int res = 0;\n while (true) {\n hobfs(G);\n memset(seen, 0, sizeof(seen));\n bool finished = true;\n for (int left = 0; left < L; ++left) {\n if (!matched[left] && hodfs(G, left)) {\n matched[left] = true;\n ++res;\n finished = false;\n }\n }\n if (finished) break;\n }\n return res;\n}\n\n\nint H, W;\nvint h[MAX];\nint temp[MAX][MAX];\nbool connected[MAX][MAX];\n\nbool solve() {\n bool res = true;\n \n int pMax = -1, Max = -1;\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\n for (int i = 0; i < W; ++i) {\n int epMax = -1, eMax = -1;\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\n if (epMax != pMax) {res = false; break;}\n }\n if (res) {\n sort(h, h + H);\n for (int i = 0; i < H ; ++i) {\n for (int j = i-1; j >= 0; --j) {\n if (!connected[i][j]) {\n bool ok = true;\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\n if (ok) {\n connected[i][j] = true;\n for (int k = j-1; k >= 0; --k) connected[i][k] |= connected[j][k];\n }\n }\n }\n }\n G.init(H);\n for (int i = 0; i < H; ++i)\n for (int j = 0; j < H; ++j) {\n if (i == j) continue;\n if (connected[i][j]) G.addedge(i,j);\n }\n \n int ans = Hopcroft_Karp(G);\n if (H - ans > 2) res = false;\n }\n\n return res;\n}\n\nint main() { \n cin >> H >> W;\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n scanf(\"%d\", &h[i][j]);\n temp[j][i] = h[i][j];\n }\n \n bool can = true;\n if (!solve()) can = false;\n \n if (can) {\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j) \n temp[i][j] = h[j][i];\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j)\n h[i][j] = temp[i][j];\n swap(H, W);\n \n if (!solve()) can = false;\n }\n \n if (can) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":15108,"score_of_the_acc":-0.1631,"final_rank":3},{"submission_id":"aoj_2279_5267715","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<ll> vll;\ntypedef pair<int,int> pint;\n\n#define DE 1\n#define FI first\n#define SE second\n#define PB push_back\n#define MP make_pair\n#define ALL(s) (s).begin(),(s).end()\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\", \"<<P.second<<'>';}\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\"{ \";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) {s<<\"{ \";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\", \";s<<'<'<<it->first<<\"->\"<<it->second<<'>';}return s<<\" }\"<<endl;}\n\n\n\nconst int MAX = 1010;\n\nstruct Graph {\n static const int MAX_V_ = ::MAX;\n int L;\n vector<int> list[MAX_V_];\n \n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\n inline vector<int>& operator [] (int i) {return list[i];}\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \" : \" << G.list[i];}return s;}\n \n void addedge(int from, int to) {\n list[from].push_back(to);\n }\n} G;\n\nint L = 0;\nbool seen[MAX];\nbool matched[MAX];\nint level[MAX];\nint matching[MAX];\n\nvoid hobfs(Graph &G) {\n queue<int> que;\n for (int left = 0; left < L; ++left) {\n level[left] = -1;\n if (!matched[left]) {\n que.push(left);\n level[left] = 0;\n }\n }\n level[L] = L;\n while (!que.empty()) {\n int left = que.front();\n que.pop();\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] == -1) {\n level[next] = level[left] + 1;\n que.push(next);\n }\n }\n }\n}\n\nbool hodfs(Graph &G, int left) {\n if (left == L) return true;\n if (seen[left]) return false;\n seen[left] = true;\n for (int i = 0; i < G[left].size(); ++i) {\n int right = G[left][i];\n int next = matching[right];\n if (level[next] > level[left] && hodfs(G, next)) {\n matching[right] = left;\n return true;\n }\n }\n return false;\n}\n\nint Hopcroft_Karp(Graph &G) {\n L = G.L;\n for (int i = 0; i < MAX; ++i) matching[i] = L;\n memset(matched, 0, sizeof(matched));\n \n int res = 0;\n while (true) {\n hobfs(G);\n memset(seen, 0, sizeof(seen));\n bool finished = true;\n for (int left = 0; left < L; ++left) {\n if (!matched[left] && hodfs(G, left)) {\n matched[left] = true;\n ++res;\n finished = false;\n }\n }\n if (finished) break;\n }\n return res;\n}\n\n\nint H, W;\nvint h[MAX];\nint temp[MAX][MAX];\nbool connected[MAX][MAX];\n\nbool solve() {\n bool res = true;\n \n int pMax = -1, Max = -1;\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\n for (int i = 0; i < W; ++i) {\n int epMax = -1, eMax = -1;\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\n if (epMax != pMax) {res = false; break;}\n }\n if (res) {\n sort(h, h + H);\n for (int i = 0; i < H ; ++i) {\n for (int j = 0; j < i; ++j) {\n if (!connected[i][j]) {\n bool ok = true;\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\n if (ok) {\n connected[i][j] = true;\n for (int k = j-1; k >= 0; --k) connected[i][k] |= connected[j][k];\n }\n }\n }\n }\n G.init(H);\n for (int i = 0; i < H; ++i)\n for (int j = 0; j < H; ++j) {\n if (i == j) continue;\n if (connected[i][j]) G.addedge(i,j);\n }\n \n int ans = Hopcroft_Karp(G);\n if (H - ans > 2) res = false;\n }\n\n return res;\n}\n\nint main() { \n cin >> H >> W;\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\n scanf(\"%d\", &h[i][j]);\n temp[j][i] = h[i][j];\n }\n \n bool can = true;\n if (!solve()) can = false;\n \n if (can) {\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j) \n temp[i][j] = h[j][i];\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\n for (int i = 0; i < W; ++i) \n for (int j = 0; j < H; ++j)\n h[i][j] = temp[i][j];\n swap(H, W);\n \n if (!solve()) can = false;\n }\n \n if (can) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n\n return 0;\n}","accuracy":1,"time_ms":360,"memory_kb":15080,"score_of_the_acc":-0.3745,"final_rank":6},{"submission_id":"aoj_2279_5208213","code_snippet":"#include <algorithm>\n// #include <atcoder/all>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <map>\n#include <queue>\n#include <random>\n#include <regex>\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>\nusing namespace std;\n// using namespace atcoder;\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\nusing vvvll = vector<vector<vector<ll>>>;\nusing vii = vector<int>;\nusing vvii = vector<vector<int>>;\nusing vvvii = vector<vector<vector<int>>>;\nusing vdd = vector<ld>;\nusing vvdd = vector<vector<ld>>;\nusing vvvdd = vector<vector<vector<ld>>>;\nusing vbb = vector<bool>;\nusing vvbb = vector<vector<bool>>;\nusing vvvbb = vector<vector<vector<bool>>>;\nusing vpll = vector<pll>;\nusing vvpll = vector<vector<pll>>;\nusing vvvpll = vector<vector<vector<pll>>>;\n#define pb push_back\n#define mp make_pair\n#define sc second\n#define fr first\n#define endl '\\n'\n#define stpr std::fixed << setprecision\n#define cYES cout << \"YES\" << endl\n#define cNO cout << \"NO\" << endl\n#define cYes cout << \"Yes\" << endl\n#define cNo cout << \"No\" << endl\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d)\n#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)\n#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)\n#define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d)\n#define rRep(i, a, b) for (ll i = a; i >= b; i--)\n#define crep(i) for (char i = 'a'; i <= 'z'; ++i)\n#define Crep(i) for (char i = 'A'; i <= 'Z'; ++i)\n#define ALL(x) (x).begin(), (x).end()\n#define rALL(x) (x).rbegin(), (x).rend()\n#define sort2(A, N) \\\n sort(A, A + N, \\\n [](const pii &a, const pii &b) { return a.second < b.second; });\n#define debug(v) \\\n cout << #v << \":\"; \\\n for (auto x : v) { \\\n cout << x << ' '; \\\n } \\\n cout << endl;\nint ctoi(const char c) {\n if ('0' <= c && c <= '9') return (c - '0');\n return -1;\n}\nll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }\nll lcm(ll a, ll b) { return a * b / gcd(a, b); }\nconstexpr ll MOD = 1000000007;\nconstexpr ll INF = 1000000011;\nconstexpr ll MOD2 = 998244353;\nconstexpr ll LINF = 1001002003004005006ll;\nconstexpr ld EPS = 10e-10;\ntemplate <class T, class U>\ninline bool chmax(T &lhs, const U &rhs) {\n if (lhs < rhs) {\n lhs = rhs;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class U>\ninline bool chmin(T &lhs, const U &rhs) {\n if (lhs > rhs) {\n lhs = rhs;\n return 1;\n }\n return 0;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (auto &&x : v) is >> x;\n return is;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n is >> p.first;\n is >> p.second;\n return is;\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 <class T>\nostream &operator<<(ostream &os, vector<T> &v) {\n for (auto i = begin(v); i != end(v); ++i) {\n if (i != begin(v)) os << ' ';\n os << *i;\n }\n return os;\n}\n\nnamespace internal {\n\ntemplate <class T>\nstruct 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\ntemplate <class Cap>\nstruct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto &_e = g[pos[i].first][pos[i].second];\n auto &_re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int &i = iter[v]; i < int(g[v].size()); i++) {\n _edge &e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n level[v] = _n;\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\nint main() {\n ll H, W;\n ll C, D;\n cin >> H >> W;\n vvll A(H, vll(W));\n cin >> A;\n if (1) {\n auto B = A;\n sort(ALL(B));\n vvll E(H);\n rep(i, H) {\n Rep(j, i + 1, H) {\n bool Z = 1;\n rep(k, W) {\n if (B[i][k] > B[j][k]) {\n Z = 0;\n }\n }\n if (Z) {\n E[j].pb(i);\n }\n }\n }\n mf_graph<ll> mf(2 * H + 2);\n rep(i, H) {\n mf.add_edge(2 * H, i, 1);\n mf.add_edge(H + i, 2 * H + 1, 1);\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\n }\n if (E[H - 1].size() < H - 1) {\n cNO;\n return 0;\n }\n C = H - mf.flow(2 * H, 2 * H + 1);\n }\n if (1) {\n vvll B(W, vll(H));\n rep(i, H) {\n rep(j, W) { B[j][i] = A[i][j]; }\n }\n swap(H, W);\n sort(ALL(B));\n vvll E(H);\n rep(i, H) {\n Rep(j, i + 1, H) {\n bool Z = 1;\n rep(k, W) {\n if (B[i][k] > B[j][k]) {\n Z = 0;\n }\n }\n if (Z) {\n E[j].pb(i);\n }\n }\n }\n mf_graph<ll> mf(2 * H + 2);\n rep(i, H) {\n mf.add_edge(2 * H, i, 1);\n mf.add_edge(H + i, 2 * H + 1, 1);\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\n }\n if (E[H - 1].size() < H - 1) {\n cNO;\n return 0;\n }\n D = H - mf.flow(2 * H, 2 * H + 1);\n }\n if (C <= 2 && D <= 2) {\n cYES;\n } else {\n cNO;\n }\n}","accuracy":1,"time_ms":630,"memory_kb":48420,"score_of_the_acc":-1.4105,"final_rank":16},{"submission_id":"aoj_2279_5206923","code_snippet":"#include <algorithm>\n// #include <atcoder/all>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <map>\n#include <queue>\n#include <random>\n#include <regex>\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>\nusing namespace std;\n// using namespace atcoder;\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\nusing vvvll = vector<vector<vector<ll>>>;\nusing vii = vector<int>;\nusing vvii = vector<vector<int>>;\nusing vvvii = vector<vector<vector<int>>>;\nusing vdd = vector<ld>;\nusing vvdd = vector<vector<ld>>;\nusing vvvdd = vector<vector<vector<ld>>>;\nusing vbb = vector<bool>;\nusing vvbb = vector<vector<bool>>;\nusing vvvbb = vector<vector<vector<bool>>>;\nusing vpll = vector<pll>;\nusing vvpll = vector<vector<pll>>;\nusing vvvpll = vector<vector<vector<pll>>>;\n#define pb push_back\n#define mp make_pair\n#define sc second\n#define fr first\n#define endl '\\n'\n#define stpr std::fixed << setprecision\n#define cYES cout << \"YES\" << endl\n#define cNO cout << \"NO\" << endl\n#define cYes cout << \"Yes\" << endl\n#define cNo cout << \"No\" << endl\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d)\n#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)\n#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)\n#define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d)\n#define rRep(i, a, b) for (ll i = a; i >= b; i--)\n#define crep(i) for (char i = 'a'; i <= 'z'; ++i)\n#define Crep(i) for (char i = 'A'; i <= 'Z'; ++i)\n#define ALL(x) (x).begin(), (x).end()\n#define rALL(x) (x).rbegin(), (x).rend()\n#define sort2(A, N) \\\n sort(A, A + N, \\\n [](const pii &a, const pii &b) { return a.second < b.second; });\n#define debug(v) \\\n cout << #v << \":\"; \\\n for (auto x : v) { \\\n cout << x << ' '; \\\n } \\\n cout << endl;\nint ctoi(const char c) {\n if ('0' <= c && c <= '9') return (c - '0');\n return -1;\n}\nll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }\nll lcm(ll a, ll b) { return a * b / gcd(a, b); }\nconstexpr ll MOD = 1000000007;\nconstexpr ll INF = 1000000011;\nconstexpr ll MOD2 = 998244353;\nconstexpr ll LINF = 1001002003004005006ll;\nconstexpr ld EPS = 10e-10;\ntemplate <class T, class U>\ninline bool chmax(T &lhs, const U &rhs) {\n if (lhs < rhs) {\n lhs = rhs;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class U>\ninline bool chmin(T &lhs, const U &rhs) {\n if (lhs > rhs) {\n lhs = rhs;\n return 1;\n }\n return 0;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (auto &&x : v) is >> x;\n return is;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n is >> p.first;\n is >> p.second;\n return is;\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 <class T>\nostream &operator<<(ostream &os, vector<T> &v) {\n for (auto i = begin(v); i != end(v); ++i) {\n if (i != begin(v)) os << ' ';\n os << *i;\n }\n return os;\n}\n\nnamespace internal {\n\ntemplate <class T>\nstruct 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\ntemplate <class Cap>\nstruct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto &_e = g[pos[i].first][pos[i].second];\n auto &_re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int &i = iter[v]; i < int(g[v].size()); i++) {\n _edge &e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n level[v] = _n;\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\nint main() {\n ll H, W;\n ll C, D;\n cin >> H >> W;\n vvll A(H, vll(W));\n cin >> A;\n if (1) {\n auto B = A;\n sort(ALL(B));\n vvll E(H);\n rep(i, H) {\n Rep(j, i + 1, H) {\n bool Z = 1;\n rep(k, W) {\n if (B[i][k] > B[j][k]) {\n Z = 0;\n }\n }\n if (Z) {\n E[j].pb(i);\n }\n }\n }\n mf_graph<ll> mf(2 * H + 2);\n rep(i, H) {\n mf.add_edge(2 * H, i, INF);\n mf.add_edge(H + i, 2 * H + 1, 1);\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\n }\n C = H - mf.flow(2 * H, 2 * H + 1);\n }\n if (1) {\n vvll B(W, vll(H));\n rep(i, H) {\n rep(j, W) { B[j][i] = A[i][j]; }\n }\n swap(H, W);\n sort(ALL(B));\n vvll E(H);\n rep(i, H) {\n Rep(j, i + 1, H) {\n bool Z = 1;\n rep(k, W) {\n if (B[i][k] > B[j][k]) {\n Z = 0;\n }\n }\n if (Z) {\n E[j].pb(i);\n }\n }\n }\n mf_graph<ll> mf(2 * H + 2);\n rep(i, H) {\n mf.add_edge(2 * H, i, INF);\n mf.add_edge(H + i, 2 * H + 1, 1);\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\n }\n D = H - mf.flow(2 * H, 2 * H + 1);\n }\n if (C <= 1 && D <= 1) {\n cYES;\n } else {\n cNO;\n }\n}","accuracy":0.6621621621621622,"time_ms":610,"memory_kb":48668,"score_of_the_acc":-1.4015,"final_rank":18},{"submission_id":"aoj_2279_5206812","code_snippet":"#include <algorithm>\n// #include <atcoder/all>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <map>\n#include <queue>\n#include <random>\n#include <regex>\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>\nusing namespace std;\n// using namespace atcoder;\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\nusing vvvll = vector<vector<vector<ll>>>;\nusing vii = vector<int>;\nusing vvii = vector<vector<int>>;\nusing vvvii = vector<vector<vector<int>>>;\nusing vdd = vector<ld>;\nusing vvdd = vector<vector<ld>>;\nusing vvvdd = vector<vector<vector<ld>>>;\nusing vbb = vector<bool>;\nusing vvbb = vector<vector<bool>>;\nusing vvvbb = vector<vector<vector<bool>>>;\nusing vpll = vector<pll>;\nusing vvpll = vector<vector<pll>>;\nusing vvvpll = vector<vector<vector<pll>>>;\n#define pb push_back\n#define mp make_pair\n#define sc second\n#define fr first\n#define endl '\\n'\n#define stpr std::fixed << setprecision\n#define cYES cout << \"YES\" << endl\n#define cNO cout << \"NO\" << endl\n#define cYes cout << \"Yes\" << endl\n#define cNo cout << \"No\" << endl\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d)\n#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)\n#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)\n#define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d)\n#define rRep(i, a, b) for (ll i = a; i >= b; i--)\n#define crep(i) for (char i = 'a'; i <= 'z'; ++i)\n#define Crep(i) for (char i = 'A'; i <= 'Z'; ++i)\n#define ALL(x) (x).begin(), (x).end()\n#define rALL(x) (x).rbegin(), (x).rend()\n#define sort2(A, N) \\\n sort(A, A + N, \\\n [](const pii &a, const pii &b) { return a.second < b.second; });\n#define debug(v) \\\n cout << #v << \":\"; \\\n for (auto x : v) { \\\n cout << x << ' '; \\\n } \\\n cout << endl;\nint ctoi(const char c) {\n if ('0' <= c && c <= '9') return (c - '0');\n return -1;\n}\nll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }\nll lcm(ll a, ll b) { return a * b / gcd(a, b); }\nconstexpr ll MOD = 1000000007;\nconstexpr ll INF = 1000000011;\nconstexpr ll MOD2 = 998244353;\nconstexpr ll LINF = 1001002003004005006ll;\nconstexpr ld EPS = 10e-10;\ntemplate <class T, class U>\ninline bool chmax(T &lhs, const U &rhs) {\n if (lhs < rhs) {\n lhs = rhs;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class U>\ninline bool chmin(T &lhs, const U &rhs) {\n if (lhs > rhs) {\n lhs = rhs;\n return 1;\n }\n return 0;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (auto &&x : v) is >> x;\n return is;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n is >> p.first;\n is >> p.second;\n return is;\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 <class T>\nostream &operator<<(ostream &os, vector<T> &v) {\n for (auto i = begin(v); i != end(v); ++i) {\n if (i != begin(v)) os << ' ';\n os << *i;\n }\n return os;\n}\n\nnamespace internal {\n\ntemplate <class T>\nstruct 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\ntemplate <class Cap>\nstruct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto &_e = g[pos[i].first][pos[i].second];\n auto &_re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int &i = iter[v]; i < int(g[v].size()); i++) {\n _edge &e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n level[v] = _n;\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\nint main() {\n ll H, W;\n ll C, D;\n cin >> H >> W;\n vvll A(H, vll(W));\n cin >> A;\n if (1) {\n auto B = A;\n sort(ALL(B));\n vvll E(H);\n rep(i, H - 1) {\n if (i < H - 2) {\n bool Z = 1;\n rep(j, W) {\n if (B[i][j] > B[i + 1][j]) {\n Z = 0;\n }\n }\n if (Z) {\n E[i + 1].pb(i);\n rep(j, E[i].size()) { E[i + 1].pb(E[i][j]); }\n }\n }\n bool T = 1;\n rep(j, W) {\n if (B[i][j] > B[H - 1][j]) {\n T = 0;\n }\n }\n if (T) {\n E[H - 1].pb(i);\n }\n }\n mf_graph<ll> mf(2 * H + 2);\n rep(i, H) {\n mf.add_edge(2 * H, i, INF);\n mf.add_edge(H + i, 2 * H + 1, 1);\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\n }\n C = H - mf.flow(2 * H, 2 * H + 1);\n }\n if (1) {\n vvll B(W, vll(H));\n rep(i, H) {\n rep(j, W) { B[j][i] = A[i][j]; }\n }\n swap(H, W);\n sort(ALL(B));\n vvll E(H);\n rep(i, H - 1) {\n if (i < H - 2) {\n bool Z = 1;\n rep(j, W) {\n if (B[i][j] > B[i + 1][j]) {\n Z = 0;\n }\n }\n if (Z) {\n E[i + 1].pb(i);\n rep(j, E[i].size()) { E[i + 1].pb(E[i][j]); }\n }\n }\n bool T = 1;\n rep(j, W) {\n if (B[i][j] > B[H - 1][j]) {\n T = 0;\n }\n }\n if (T) {\n E[H - 1].pb(i);\n }\n }\n mf_graph<ll> mf(2 * H + 2);\n rep(i, H) {\n mf.add_edge(2 * H, i, INF);\n mf.add_edge(H + i, 2 * H + 1, 1);\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\n }\n D = H - mf.flow(2 * H, 2 * H + 1);\n // cout << D << endl;\n }\n if (C <= 1 && D <= 1) {\n cYES;\n } else {\n cNO;\n }\n}","accuracy":0.6621621621621622,"time_ms":230,"memory_kb":48528,"score_of_the_acc":-1.1101,"final_rank":17},{"submission_id":"aoj_2279_5206492","code_snippet":"#include <algorithm>\n// #include <atcoder/all>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <map>\n#include <queue>\n#include <random>\n#include <regex>\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>\nusing namespace std;\n// using namespace atcoder;\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\nusing vvvll = vector<vector<vector<ll>>>;\nusing vii = vector<int>;\nusing vvii = vector<vector<int>>;\nusing vvvii = vector<vector<vector<int>>>;\nusing vdd = vector<ld>;\nusing vvdd = vector<vector<ld>>;\nusing vvvdd = vector<vector<vector<ld>>>;\nusing vbb = vector<bool>;\nusing vvbb = vector<vector<bool>>;\nusing vvvbb = vector<vector<vector<bool>>>;\nusing vpll = vector<pll>;\nusing vvpll = vector<vector<pll>>;\nusing vvvpll = vector<vector<vector<pll>>>;\n#define pb push_back\n#define mp make_pair\n#define sc second\n#define fr first\n#define endl '\\n'\n#define stpr std::fixed << setprecision\n#define cYES cout << \"YES\" << endl\n#define cNO cout << \"NO\" << endl\n#define cYes cout << \"Yes\" << endl\n#define cNo cout << \"No\" << endl\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d)\n#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)\n#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)\n#define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d)\n#define rRep(i, a, b) for (ll i = a; i >= b; i--)\n#define crep(i) for (char i = 'a'; i <= 'z'; ++i)\n#define Crep(i) for (char i = 'A'; i <= 'Z'; ++i)\n#define ALL(x) (x).begin(), (x).end()\n#define rALL(x) (x).rbegin(), (x).rend()\n#define sort2(A, N) \\\n sort(A, A + N, \\\n [](const pii &a, const pii &b) { return a.second < b.second; });\n#define debug(v) \\\n cout << #v << \":\"; \\\n for (auto x : v) { \\\n cout << x << ' '; \\\n } \\\n cout << endl;\nint ctoi(const char c) {\n if ('0' <= c && c <= '9') return (c - '0');\n return -1;\n}\nll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }\nll lcm(ll a, ll b) { return a * b / gcd(a, b); }\nconstexpr ll MOD = 1000000007;\nconstexpr ll INF = 1000000011;\nconstexpr ll MOD2 = 998244353;\nconstexpr ll LINF = 1001002003004005006ll;\nconstexpr ld EPS = 10e-10;\ntemplate <class T, class U>\ninline bool chmax(T &lhs, const U &rhs) {\n if (lhs < rhs) {\n lhs = rhs;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class U>\ninline bool chmin(T &lhs, const U &rhs) {\n if (lhs > rhs) {\n lhs = rhs;\n return 1;\n }\n return 0;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (auto &&x : v) is >> x;\n return is;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n is >> p.first;\n is >> p.second;\n return is;\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 <class T>\nostream &operator<<(ostream &os, vector<T> &v) {\n for (auto i = begin(v); i != end(v); ++i) {\n if (i != begin(v)) os << ' ';\n os << *i;\n }\n return os;\n}\n\nnamespace internal {\n\ntemplate <class T>\nstruct 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\ntemplate <class Cap>\nstruct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto &_e = g[pos[i].first][pos[i].second];\n auto &_re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int &i = iter[v]; i < int(g[v].size()); i++) {\n _edge &e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n level[v] = _n;\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\nint main() {\n ll H, W;\n ll C, D;\n cin >> H >> W;\n vvll A(H, vll(W));\n cin >> A;\n if (1) {\n auto B = A;\n sort(ALL(B));\n vvll E(H);\n rep(i, H - 1) {\n bool Z = 1;\n rep(j, W) {\n if (B[i][j] > B[i + 1][j]) {\n Z = 0;\n }\n }\n if (Z) {\n E[i + 1].pb(i);\n rep(j, E[i].size()) { E[i + 1].pb(E[i][j]); }\n }\n }\n mf_graph<ll> mf(2 * H + 2);\n rep(i, H) {\n mf.add_edge(2 * H, i, 1);\n mf.add_edge(H + i, 2 * H + 1, 1);\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\n }\n C = H - mf.flow(2 * H, 2 * H + 1);\n // cout << C << endl;\n }\n if (1) {\n vvll B(W, vll(H));\n rep(i, H) {\n rep(j, W) { B[j][i] = A[i][j]; }\n }\n swap(H, W);\n sort(ALL(B));\n vvll E(H);\n rep(i, H - 1) {\n bool Z = 1;\n rep(j, W) {\n if (B[i][j] > B[i + 1][j]) {\n Z = 0;\n }\n }\n if (Z) {\n E[i + 1].pb(i);\n rep(j, E[i].size()) { E[i + 1].pb(E[i][j]); }\n }\n }\n mf_graph<ll> mf(2 * H + 2);\n rep(i, H) {\n mf.add_edge(2 * H, i, 1);\n mf.add_edge(H + i, 2 * H + 1, 1);\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\n }\n D = H - mf.flow(2 * H, 2 * H + 1);\n // cout << D << endl;\n }\n if (C == D) {\n cYES;\n } else {\n cNO;\n }\n}","accuracy":0.12162162162162163,"time_ms":180,"memory_kb":32656,"score_of_the_acc":-0.6765,"final_rank":19},{"submission_id":"aoj_2279_4762347","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 1005\n#define NUM 2010\n\nint H,W;\nint table[2][SIZE][SIZE];\nint in_num[SIZE];\n\nint V;\nvector<int> G[NUM];\nint match[NUM];\nbool used[NUM];\n\nvoid add_edge(int from,int to){\n\tG[from].push_back(to);\n\tG[to].push_back(from);\n}\n\nint dfs(int node_id){\n\tused[node_id] = true;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tint adj_node_id = G[node_id][i],pair_id = match[adj_node_id];\n\t\tif((pair_id < 0)||\n\t\t\t\t(used[pair_id] == false && dfs(pair_id) == true)){\n\n\t\t\tmatch[node_id] = adj_node_id;\n\t\t\tmatch[adj_node_id] = node_id;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\nint bipartie_matching(){\n\tint ret = 0;\n\tfor(int i = 0; i < V; i++)match[i] = -1;\n\tfor(int node_id = 0; node_id < V; node_id++){\n\t\tif(match[node_id] < 0){\n\t\t\tfor(int i = 0; i < V; i++)used[i] = false;\n\t\t\tif(dfs(node_id)){\n\t\t\t\tret++;\n\t\t\t}\n\t\t}\n\t}\n\treturn ret;\n}\n\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tscanf(\"%d\",&table[0][row][col]);\n\t\t\ttable[1][col][row] = table[0][row][col];\n\t\t}\n\t}\n\n\tbool FLG;\n\n\tfor(int i = 0; i < 2; i++){\n\n\t\tif(H == 1){\n\t\t\tswap(H,W);\n\t\t\tcontinue;\n\t\t}\n\n\t\tV = 2*H;\n\n\t\tfor(int i = 0; i < H; i++){\n\n\t\t\tin_num[i] = 0;\n\t\t}\n\n\t\tfor(int a = 0; a < H; a++){\n\t\t\tfor(int b = 0; b < H; b++){\n\t\t\t\tif(b == a)continue;\n\n\t\t\t\tFLG = true;\n\t\t\t\tfor(int k = 0; k < W; k++){\n\t\t\t\t\tif(table[i][a][k] < table[i][b][k]){\n\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(!FLG)continue;\n\n\t\t\t\tadd_edge(a,b+H);\n\t\t\t\tin_num[b]++;\n\t\t\t}\n\t\t}\n\n\t\tint count = 0;\n\t\tfor(int i = 0; i < H; i++){\n\n\t\t\tif(in_num[i] > 0)count++;\n\t\t}\n\t\tif(count != H-1){\n\n\t\t\tprintf(\"NO\\n\");\n\t\t\treturn 0;\n\t\t}\n\n\t\tint num_match = bipartie_matching();\n\n\t\t//printf(\"i:%d num_match:%d\\n\",i,num_match);\n\n\t\tif(H-num_match > 2){\n\n\t\t\tprintf(\"NO\\n\");\n\t\t\treturn 0;\n\t\t}\n\n\t\tfor(int a = 0; a < V; a++){\n\n\t\t\tG[a].clear();\n\t\t}\n\n\t\tswap(H,W);\n\t}\n\n\tprintf(\"YES\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":820,"memory_kb":18240,"score_of_the_acc":-0.8018,"final_rank":12},{"submission_id":"aoj_2279_4762298","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 1005\n#define NUM 2010\n\nint H,W;\nint table[2][SIZE][SIZE];\n\n\nint V;\nvector<int> G[NUM];\nint match[NUM];\nbool used[NUM];\n\nvoid add_edge(int from,int to){\n\tG[from].push_back(to);\n\tG[to].push_back(from);\n}\n\nint dfs(int node_id){\n\tused[node_id] = true;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\tint adj_node_id = G[node_id][i],pair_id = match[adj_node_id];\n\t\tif((pair_id < 0)||\n\t\t\t\t(used[pair_id] == false && dfs(pair_id) == true)){\n\n\t\t\tmatch[node_id] = adj_node_id;\n\t\t\tmatch[adj_node_id] = node_id;\n\t\t\treturn true;\n\t\t}\n\t}\n\treturn false;\n}\n\n\nint bipartie_matching(){\n\tint ret = 0;\n\tfor(int i = 0; i < V; i++)match[i] = -1;\n\tfor(int node_id = 0; node_id < V; node_id++){\n\t\tif(match[node_id] < 0){\n\t\t\tfor(int i = 0; i < V; i++)used[i] = false;\n\t\t\tif(dfs(node_id)){\n\t\t\t\tret++;\n\t\t\t}\n\t\t}\n\t}\n\treturn ret;\n}\n\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\n\t\t\tscanf(\"%d\",&table[0][row][col]);\n\t\t\ttable[1][col][row] = table[0][row][col];\n\t\t}\n\t}\n\n\tbool FLG;\n\n\tfor(int i = 0; i < 2; i++){\n\n\t\tif(H == 1){\n\t\t\tswap(H,W);\n\t\t\tcontinue;\n\t\t}\n\n\t\tV = 2*H;\n\n\t\tint maximum = 0;\n\n\t\tfor(int a = 0; a < H; a++){\n\t\t\tfor(int b = 0; b < H; b++){\n\t\t\t\tif(b == a)continue;\n\n\t\t\t\tFLG = true;\n\t\t\t\tfor(int k = 0; k < W; k++){\n\t\t\t\t\tif(table[i][a][k] < table[i][b][k]){\n\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(!FLG)continue;\n\n\t\t\t\tadd_edge(a,b+H);\n\t\t\t}\n\t\t\tmaximum = max(maximum,(int)G[a].size());\n\t\t}\n\n\t\tif(maximum < H-1){\n\n\t\t\tprintf(\"NO\\n\");\n\t\t\treturn 0;\n\t\t}\n\n\t\tint num_match = bipartie_matching();\n\n\t\t//printf(\"i:%d num_match:%d\\n\",i,num_match);\n\n\t\tif(H-num_match > 2){\n\n\t\t\tprintf(\"NO\\n\");\n\t\t\treturn 0;\n\t\t}\n\n\t\tfor(int a = 0; a < V; a++){\n\n\t\t\tG[a].clear();\n\t\t}\n\n\t\tswap(H,W);\n\t}\n\n\tprintf(\"YES\\n\");\n\n\treturn 0;\n}","accuracy":1,"time_ms":860,"memory_kb":18088,"score_of_the_acc":-0.8283,"final_rank":14},{"submission_id":"aoj_2279_4501167","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define rrep(i,n) for (int i = (n)-1; i >= 0; i--)\n#define rep2(i,s,n) for (int i = (s); i < (n); ++i)\n#define all(a) a.begin(),a.end()\n#define rall(a) a.rbegin(),a.rend()\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vd vector<double>\n#define vs vector<string>\n#define vc vector<char>\n#define vb vector<bool>\n#define vp vector<P>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\nusing LP = pair<ll,ll>;\ntemplate<class T> istream& operator>>(istream& is,vector<T>& v) { for(T& t:v){is>>t;} return is; }\ntemplate<class T> ostream& operator<<(ostream& os,const vector<T>& v) { for(T t:v){os<<t<<\" \";} os<<\"\\n\"; return os; }\nvoid Yes(bool b) { cout << (b ? \"Yes\" : \"No\") << endl; }\nvoid YES(bool b) { cout << (b ? \"YES\" : \"NO\") << endl; }\ntemplate<class T> inline bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}\ntemplate<class T> inline bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}\nconst int inf = 1001001001;\nconst ll linf = 1001001001001001001;\n\nclass Bipartite_matching {\n int n;\n vvi G;\n vi match;\n vb used;\n bool dfs(int v) {\n used[v] = true;\n for(int u : G[v]) {\n int w = match[u];\n if(w < 0 || !used[w] && dfs(w)) {\n match[v] = u;\n match[u] = v;\n return true;\n }\n }\n return false;\n }\n\npublic:\n Bipartite_matching(int n):n(n),G(n),match(n),used(n) {}\n void add_edge(int v,int u) {\n G[v].pb(u);\n G[u].pb(v);\n }\n int max_matching() {\n int res = 0;\n match.assign(n,-1);\n rep(i,n) {\n if(match[i] >= 0) continue;\n used.assign(n,false);\n if(dfs(i)) res++;\n }\n return res;\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr); cout.tie(nullptr);\n int H,W;\n cin >> H >> W;\n vvi h(H,vi(W));\n cin >> h;\n rep(_,2) {\n Bipartite_matching bp(2*H);\n vb v(H,true);\n rep(i,H) rep(j,H) {\n if(i == j) continue;\n bool ok = true;\n rep(k,W) if(h[i][k] > h[j][k]) ok = false;\n if(ok) bp.add_edge(i,j+H);\n else v[j] = false;\n }\n bool flag = false;\n rep(i,H) if(v[i]) flag = true;\n if(!flag) {\n YES(false);\n return 0;\n }\n if(H-bp.max_matching() > 2) {\n YES(false);\n return 0;\n }\n vvi nh(W,vi(H));\n rep(i,H) rep(j,W) nh[j][i] = h[i][j];\n swap(H,W);\n swap(h,nh);\n }\n YES(true);\n}","accuracy":1,"time_ms":1400,"memory_kb":16272,"score_of_the_acc":-1.1921,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_2279_10215449\",\n \"code_snippet\": \"// AOJ #2279\\n// Mountain 2025.2.13\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() { // 整数の入力\\n\\tint n = 0, c = gc();\\n\\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(bool yes) {\\n\\tif (yes) pc('Y'), pc('E'), pc('S');\\n else pc('N'), pc('O');\\n pc('\\\\n');\\n}\\n \\nbool dfsColor(int v, int c, const vector<vector<int>> &g, vector<int>& col) {\\n col[v] = c;\\n for (int nv : g[v]) {\\n if (col[nv] == -1) {\\n if (!dfsColor(nv, c^1, g, col)) return false;\\n } else if (col[nv] == c) return false;\\n }\\n return true;\\n}\\n \\nint main(){\\n int H = Cin(), W = Cin();\\n vector<vector<int>> A(H, vector<int>(W));\\n for (int i=0; i<H; i++){\\n for (int j=0; j<W; j++) A[i][j] = Cin();\\n }\\n \\n int candCol = -1;\\n for (int i=0; i<H; i++){\\n int maxVal = -1, maxIdx = -1;\\n for (int j=0; j<W; j++){\\n if (A[i][j] > maxVal){\\n maxVal = A[i][j];\\n maxIdx = j;\\n }\\n }\\n if(i==0) candCol = maxIdx;\\n else if(maxIdx != candCol){\\n Cout(0);\\n return 0;\\n }\\n }\\n \\n int candRow = -1;\\n for (int j=0; j<W; j++){\\n int maxVal = -1, maxIdx = -1;\\n for (int i=0; i<H; i++){\\n if (A[i][j] > maxVal){\\n maxVal = A[i][j];\\n maxIdx = i;\\n }\\n }\\n if(j==0) candRow = maxIdx;\\n else if(maxIdx != candRow){\\n Cout(0);;\\n return 0;\\n }\\n }\\n \\n for (int i=0; i<H; i++){\\n for (int j=0; j<W; j++){\\n if(i==candRow && j==candCol) continue;\\n if(A[i][j] > A[candRow][candCol]){\\n Cout(0);\\n return 0;\\n }\\n }\\n }\\n \\n vector<int> rows;\\n for (int i=0; i<H; i++){\\n if(i==candRow) continue;\\n rows.push_back(i);\\n }\\n vector<int> cols;\\n for (int j=0; j<W; j++){\\n if(j==candCol) continue;\\n cols.push_back(j);\\n }\\n \\n int rn = rows.size();\\n vector<vector<int>> graphRows(rn);\\n for (int a = 0; a < rn; a++){\\n for (int b = a+1; b < rn; b++){\\n int i = rows[a], k = rows[b];\\n int sign = 0;\\n bool comparable = true;\\n for (int c : cols){\\n int s = (A[i][c] < A[k][c]) ? 1 : -1;\\n if(sign==0) sign = s;\\n else {\\n if(s != sign) { comparable = false; break; }\\n }\\n }\\n if(!comparable){\\n graphRows[a].push_back(b);\\n graphRows[b].push_back(a);\\n }\\n }\\n }\\n vector<int> color(rn, -1);\\n for (int i=0; i<rn; i++){\\n if(color[i] == -1){\\n if(!dfsColor(i, 0, graphRows, color)){\\n Cout(0);\\n return 0;\\n }\\n }\\n }\\n \\n int cn = cols.size();\\n vector<vector<int>> graphCols(cn);\\n for (int a = 0; a < cn; a++){\\n for (int b = a+1; b < cn; b++){\\n int j = cols[a], k = cols[b];\\n int sign = 0;\\n bool comparable = true;\\n for (int i = 0; i < H; i++){\\n if(i==candRow) continue;\\n int s = (A[i][j] < A[i][k]) ? 1 : -1;\\n if(sign==0) { sign = s; }\\n else {\\n if(s != sign){ comparable = false; break; }\\n }\\n }\\n if(!comparable){\\n graphCols[a].push_back(b);\\n graphCols[b].push_back(a);\\n }\\n }\\n }\\n vector<int> colorCols(cn, -1);\\n for (int i=0; i<cn; i++){\\n if(colorCols[i]==-1){\\n if(!dfsColor(i, 0, graphCols, colorCols)){\\n Cout(0);\\n return 0;\\n }\\n }\\n }\\n Cout(1);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1110,\n \"memory_kb\": 8924,\n \"score_of_the_acc\": -0.7892,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2279_10215444\",\n \"code_snippet\": \"// AOJ #2279\\n// Mountain 2025.2.13\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n \\nbool dfsColor(int v, int c, const vector<vector<int>> &g, vector<int>& col) {\\n col[v] = c;\\n for (int nv : g[v]) {\\n if (col[nv] == -1) {\\n if (!dfsColor(nv, c^1, g, col)) return false;\\n } else if (col[nv] == c) return false;\\n }\\n return true;\\n}\\n \\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n \\n int H, W;\\n cin >> H >> W;\\n vector<vector<int>> A(H, vector<int>(W));\\n for (int i=0; i<H; i++){\\n for (int j=0; j<W; j++) cin >> A[i][j];\\n }\\n \\n int candCol = -1;\\n for (int i=0; i<H; i++){\\n int maxVal = -1, maxIdx = -1;\\n for (int j=0; j<W; j++){\\n if (A[i][j] > maxVal){\\n maxVal = A[i][j];\\n maxIdx = j;\\n }\\n }\\n if(i==0) candCol = maxIdx;\\n else if(maxIdx != candCol){\\n cout << \\\"NO\\\\n\\\";\\n return 0;\\n }\\n }\\n \\n int candRow = -1;\\n for (int j=0; j<W; j++){\\n int maxVal = -1, maxIdx = -1;\\n for (int i=0; i<H; i++){\\n if (A[i][j] > maxVal){\\n maxVal = A[i][j];\\n maxIdx = i;\\n }\\n }\\n if(j==0) candRow = maxIdx;\\n else if(maxIdx != candRow){\\n cout << \\\"NO\\\\n\\\";\\n return 0;\\n }\\n }\\n \\n for (int i=0; i<H; i++){\\n for (int j=0; j<W; j++){\\n if(i==candRow && j==candCol) continue;\\n if(A[i][j] > A[candRow][candCol]){\\n cout << \\\"NO\\\\n\\\";\\n return 0;\\n }\\n }\\n }\\n \\n vector<int> rows;\\n for (int i=0; i<H; i++){\\n if(i==candRow) continue;\\n rows.push_back(i);\\n }\\n vector<int> cols;\\n for (int j=0; j<W; j++){\\n if(j==candCol) continue;\\n cols.push_back(j);\\n }\\n \\n int rn = rows.size();\\n vector<vector<int>> graphRows(rn);\\n for (int a = 0; a < rn; a++){\\n for (int b = a+1; b < rn; b++){\\n int i = rows[a], k = rows[b];\\n int sign = 0;\\n bool comparable = true;\\n for (int c : cols){\\n int s = (A[i][c] < A[k][c]) ? 1 : -1;\\n if(sign==0) sign = s;\\n else {\\n if(s != sign) { comparable = false; break; }\\n }\\n }\\n if(!comparable){\\n graphRows[a].push_back(b);\\n graphRows[b].push_back(a);\\n }\\n }\\n }\\n vector<int> color(rn, -1);\\n for (int i=0; i<rn; i++){\\n if(color[i] == -1){\\n if(!dfsColor(i, 0, graphRows, color)){\\n cout << \\\"NO\\\\n\\\";\\n return 0;\\n }\\n }\\n }\\n \\n int cn = cols.size();\\n vector<vector<int>> graphCols(cn);\\n for (int a = 0; a < cn; a++){\\n for (int b = a+1; b < cn; b++){\\n int j = cols[a], k = cols[b];\\n int sign = 0;\\n bool comparable = true;\\n for (int i = 0; i < H; i++){\\n if(i==candRow) continue;\\n int s = (A[i][j] < A[i][k]) ? 1 : -1;\\n if(sign==0) { sign = s; }\\n else {\\n if(s != sign){ comparable = false; break; }\\n }\\n }\\n if(!comparable){\\n graphCols[a].push_back(b);\\n graphCols[b].push_back(a);\\n }\\n }\\n }\\n vector<int> colorCols(cn, -1);\\n for (int i=0; i<cn; i++){\\n if(colorCols[i]==-1){\\n if(!dfsColor(i, 0, graphCols, colorCols)){\\n cout << \\\"NO\\\\n\\\";\\n return 0;\\n }\\n }\\n }\\n cout << \\\"YES\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1170,\n \"memory_kb\": 8568,\n \"score_of_the_acc\": -0.8258,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2279_8570852\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint h, w;\\nvector<int> g[4004];\\nint match[4004];\\nbool used[4004];\\nbool dfs(int v){\\n used[v] = true;\\n for(int i=0;i<g[v].size();i++){\\n int u = g[v][i];\\n int w = match[u];\\n if(w<0 || !used[w]&&dfs(w)){\\n match[v] = u;\\n match[u] = v;\\n return true;\\n }\\n }\\n return false;\\n}\\nbool bm(){\\n int res1 = 0;\\n memset(match, -1, sizeof(match));\\n for(int v=0;v<h;v++){\\n if(match[v]<0){\\n memset(used, 0, sizeof(used));\\n if(dfs(v)) res1++;\\n }\\n }\\n int res2 = 0;\\n for(int v=h+h;v<h+h+w;v++){\\n if(match[v]<0){\\n memset(used, 0, sizeof(used));\\n if(dfs(v)) res2++;\\n }\\n }\\n return res1<=2&&res2<=2;\\n}\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n int mo[1001][1001];\\n cin >> h >> w;\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++) cin >> mo[i][j];\\n }\\n int hsum[1001]={};\\n for(int i=0;i<h;i++){\\n for(int j=0;j<i;j++){\\n int c1=0,c2=0;\\n for(int k=0;k<w;k++){\\n if(mo[j][k]>mo[i][k]) c1++;\\n else if(mo[j][k]<mo[i][k]) c2++;\\n }\\n if(c1==w){\\n g[j].push_back(i+h);\\n hsum[i]++;\\n }\\n else if(c2==w){\\n g[i].push_back(j+h);\\n hsum[j]++;\\n }\\n }\\n }\\n int wsum[1001]={};\\n for(int i=0;i<w;i++){\\n for(int j=0;j<i;j++){\\n int c1=0,c2=0;\\n for(int k=0;k<h;k++){\\n if(mo[k][j]>mo[k][i]) c1++;\\n else if(mo[k][j]<mo[k][i]) c2++;\\n }\\n if(c1==w){\\n g[j+h+h].push_back(i+h+h+w);\\n wsum[i]++;\\n }\\n else if(c2==w){\\n g[i+h+h].push_back(j+h+h+w);\\n wsum[j]++;\\n }\\n }\\n }\\n bool ok=bm();\\n int cnt=0;\\n for(int i=0;i<h;i++){\\n if(hsum[i]==0) cnt++;\\n }\\n if(cnt!=1) ok=false;\\n cnt=0;\\n for(int i=0;i<w;i++){\\n if(wsum[i]==0) cnt++;\\n }\\n if(cnt!=1) ok=false;\\n cout << (ok?\\\"YES\\\":\\\"NO\\\") << endl;\\n return(0);\\n}\",\n \"accuracy\": 0.08108108108108109,\n \"time_ms\": 90,\n \"memory_kb\": 9784,\n \"score_of_the_acc\": -0.0379,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2279_5270279\",\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<ll> vll;\\ntypedef pair<int,int> pint;\\n\\n#define DE 1\\n#define FI first\\n#define SE second\\n#define PB push_back\\n#define MP make_pair\\n#define ALL(s) (s).begin(),(s).end()\\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\\\", \\\"<<P.second<<'>';}\\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\\\"{ \\\";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) {s<<\\\"{ \\\";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\\\", \\\";s<<'<'<<it->first<<\\\"->\\\"<<it->second<<'>';}return s<<\\\" }\\\"<<endl;}\\n\\n\\n\\nconst int MAX = 1010;\\n\\nstruct Graph {\\n static const int MAX_V_ = ::MAX;\\n int L;\\n vector<int> list[MAX_V_];\\n \\n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\\n inline vector<int>& operator [] (int i) {return list[i];}\\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \\\" : \\\" << G.list[i];}return s;}\\n \\n void addedge(int from, int to) {\\n list[from].push_back(to);\\n }\\n} G;\\n\\nint L = 0;\\nbool seen[MAX];\\nbool matched[MAX];\\nint level[MAX];\\nint matching[MAX];\\n\\nvoid hobfs(Graph &G) {\\n queue<int> que;\\n for (int left = 0; left < L; ++left) {\\n level[left] = -1;\\n if (!matched[left]) {\\n que.push(left);\\n level[left] = 0;\\n }\\n }\\n level[L] = L;\\n while (!que.empty()) {\\n int left = que.front();\\n que.pop();\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] == -1) {\\n level[next] = level[left] + 1;\\n que.push(next);\\n }\\n }\\n }\\n}\\n\\nbool hodfs(Graph &G, int left) {\\n if (left == L) return true;\\n if (seen[left]) return false;\\n seen[left] = true;\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] > level[left] && hodfs(G, next)) {\\n matching[right] = left;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint Hopcroft_Karp(Graph &G) {\\n L = G.L;\\n for (int i = 0; i < MAX; ++i) matching[i] = L;\\n memset(matched, 0, sizeof(matched));\\n \\n int res = 0;\\n while (true) {\\n hobfs(G);\\n memset(seen, 0, sizeof(seen));\\n bool finished = true;\\n for (int left = 0; left < L; ++left) {\\n if (!matched[left] && hodfs(G, left)) {\\n matched[left] = true;\\n ++res;\\n finished = false;\\n }\\n }\\n if (finished) break;\\n }\\n return res;\\n}\\n\\n\\nint H, W;\\nvint h[MAX];\\nint temp[MAX][MAX];\\nbool connected[MAX][MAX];\\n\\nbool solve() {\\n bool res = true;\\n \\n int pMax = -1, Max = -1;\\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\\n for (int i = 0; i < W; ++i) {\\n int epMax = -1, eMax = -1;\\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\\n if (epMax != pMax) {res = false; break;}\\n }\\n if (res) {\\n for (int i = 0; i < H; ++i) {\\n for (int j = 0; j < H; ++j) {\\n if (!connected[i][j]) {\\n bool ok = true;\\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\\n if (ok) {\\n connected[i][j] = true;\\n for (int k = 0; k < H; ++k) connected[i][k] |= connected[j][k];\\n }\\n }\\n }\\n }\\n G.init(H);\\n for (int i = 0; i < H; ++i)\\n for (int j = 0; j < H; ++j) {\\n if (i == j) continue;\\n if (connected[i][j]) G.addedge(i,j);\\n }\\n \\n int ans = Hopcroft_Karp(G);\\n if (H - ans > 2) res = false;\\n }\\n\\n return res;\\n}\\n\\nint main() { \\n cin >> H >> W;\\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n scanf(\\\"%d\\\", &h[i][j]);\\n temp[j][i] = h[i][j];\\n }\\n \\n bool can = true;\\n if (!solve()) can = false;\\n \\n if (can) {\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j) \\n temp[i][j] = h[j][i];\\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j)\\n h[i][j] = temp[i][j];\\n swap(H, W);\\n \\n if (!solve()) can = false;\\n }\\n \\n if (can) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 16436,\n \"score_of_the_acc\": -0.4917,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2279_5270277\",\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<ll> vll;\\ntypedef pair<int,int> pint;\\n\\n#define DE 1\\n#define FI first\\n#define SE second\\n#define PB push_back\\n#define MP make_pair\\n#define ALL(s) (s).begin(),(s).end()\\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\\\", \\\"<<P.second<<'>';}\\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\\\"{ \\\";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) {s<<\\\"{ \\\";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\\\", \\\";s<<'<'<<it->first<<\\\"->\\\"<<it->second<<'>';}return s<<\\\" }\\\"<<endl;}\\n\\n\\n\\nconst int MAX = 1010;\\n\\nstruct Graph {\\n static const int MAX_V_ = ::MAX;\\n int L;\\n vector<int> list[MAX_V_];\\n \\n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\\n inline vector<int>& operator [] (int i) {return list[i];}\\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \\\" : \\\" << G.list[i];}return s;}\\n \\n void addedge(int from, int to) {\\n list[from].push_back(to);\\n }\\n} G;\\n\\nint L = 0;\\nbool seen[MAX];\\nbool matched[MAX];\\nint level[MAX];\\nint matching[MAX];\\n\\nvoid hobfs(Graph &G) {\\n queue<int> que;\\n for (int left = 0; left < L; ++left) {\\n level[left] = -1;\\n if (!matched[left]) {\\n que.push(left);\\n level[left] = 0;\\n }\\n }\\n level[L] = L;\\n while (!que.empty()) {\\n int left = que.front();\\n que.pop();\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] == -1) {\\n level[next] = level[left] + 1;\\n que.push(next);\\n }\\n }\\n }\\n}\\n\\nbool hodfs(Graph &G, int left) {\\n if (left == L) return true;\\n if (seen[left]) return false;\\n seen[left] = true;\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] > level[left] && hodfs(G, next)) {\\n matching[right] = left;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint Hopcroft_Karp(Graph &G) {\\n L = G.L;\\n for (int i = 0; i < MAX; ++i) matching[i] = L;\\n memset(matched, 0, sizeof(matched));\\n \\n int res = 0;\\n while (true) {\\n hobfs(G);\\n memset(seen, 0, sizeof(seen));\\n bool finished = true;\\n for (int left = 0; left < L; ++left) {\\n if (!matched[left] && hodfs(G, left)) {\\n matched[left] = true;\\n ++res;\\n finished = false;\\n }\\n }\\n if (finished) break;\\n }\\n return res;\\n}\\n\\n\\nint H, W;\\nvint h[MAX];\\nint temp[MAX][MAX];\\nbool connected[MAX][MAX];\\n\\nbool solve() {\\n bool res = true;\\n \\n int pMax = -1, Max = -1;\\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\\n for (int i = 0; i < W; ++i) {\\n int epMax = -1, eMax = -1;\\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\\n if (epMax != pMax) {res = false; break;}\\n }\\n if (res) {\\n for (int i = 0; i < H; ++i) {\\n for (int j = 0; j < H; ++j) {\\n if (!connected[i][j]) {\\n bool ok = true;\\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\\n if (ok) {\\n connected[i][j] = true;\\n connected[j][i] = false;\\n for (int k = 0; k < H; ++k) connected[i][k] |= connected[j][k];\\n }\\n }\\n }\\n }\\n G.init(H);\\n for (int i = 0; i < H; ++i)\\n for (int j = 0; j < H; ++j) {\\n if (i == j) continue;\\n if (connected[i][j]) G.addedge(i,j);\\n }\\n \\n int ans = Hopcroft_Karp(G);\\n if (H - ans > 2) res = false;\\n }\\n\\n return res;\\n}\\n\\nint main() { \\n cin >> H >> W;\\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n scanf(\\\"%d\\\", &h[i][j]);\\n temp[j][i] = h[i][j];\\n }\\n \\n bool can = true;\\n if (!solve()) can = false;\\n \\n if (can) {\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j) \\n temp[i][j] = h[j][i];\\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j)\\n h[i][j] = temp[i][j];\\n swap(H, W);\\n \\n if (!solve()) can = false;\\n }\\n \\n if (can) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 600,\n \"memory_kb\": 16308,\n \"score_of_the_acc\": -0.587,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2279_5270208\",\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<ll> vll;\\ntypedef pair<int,int> pint;\\n\\n#define DE 1\\n#define FI first\\n#define SE second\\n#define PB push_back\\n#define MP make_pair\\n#define ALL(s) (s).begin(),(s).end()\\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\\\", \\\"<<P.second<<'>';}\\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\\\"{ \\\";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) {s<<\\\"{ \\\";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\\\", \\\";s<<'<'<<it->first<<\\\"->\\\"<<it->second<<'>';}return s<<\\\" }\\\"<<endl;}\\n\\n\\n\\nconst int MAX = 1010;\\n\\nstruct Graph {\\n static const int MAX_V_ = ::MAX;\\n int L;\\n vector<int> list[MAX_V_];\\n \\n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\\n inline vector<int>& operator [] (int i) {return list[i];}\\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \\\" : \\\" << G.list[i];}return s;}\\n \\n void addedge(int from, int to) {\\n list[from].push_back(to);\\n }\\n} G;\\n\\nint L = 0;\\nbool seen[MAX];\\nbool matched[MAX];\\nint level[MAX];\\nint matching[MAX];\\n\\nvoid hobfs(Graph &G) {\\n queue<int> que;\\n for (int left = 0; left < L; ++left) {\\n level[left] = -1;\\n if (!matched[left]) {\\n que.push(left);\\n level[left] = 0;\\n }\\n }\\n level[L] = L;\\n while (!que.empty()) {\\n int left = que.front();\\n que.pop();\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] == -1) {\\n level[next] = level[left] + 1;\\n que.push(next);\\n }\\n }\\n }\\n}\\n\\nbool hodfs(Graph &G, int left) {\\n if (left == L) return true;\\n if (seen[left]) return false;\\n seen[left] = true;\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] > level[left] && hodfs(G, next)) {\\n matching[right] = left;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint Hopcroft_Karp(Graph &G) {\\n L = G.L;\\n for (int i = 0; i < MAX; ++i) matching[i] = L;\\n memset(matched, 0, sizeof(matched));\\n \\n int res = 0;\\n while (true) {\\n hobfs(G);\\n memset(seen, 0, sizeof(seen));\\n bool finished = true;\\n for (int left = 0; left < L; ++left) {\\n if (!matched[left] && hodfs(G, left)) {\\n matched[left] = true;\\n ++res;\\n finished = false;\\n }\\n }\\n if (finished) break;\\n }\\n return res;\\n}\\n\\n\\nint H, W;\\nvint h[MAX];\\nint temp[MAX][MAX];\\nbool connected[MAX][MAX];\\n\\nbool solve() {\\n bool res = true;\\n \\n int pMax = -1, Max = -1;\\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\\n for (int i = 0; i < W; ++i) {\\n int epMax = -1, eMax = -1;\\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\\n if (epMax != pMax) {res = false; break;}\\n }\\n if (res) {\\n sort(h, h + H);\\n for (int i = 0; i < H; ++i) {\\n for (int j = i-1; j >= 0; --j) {\\n if (!connected[i][j]) {\\n bool ok = true;\\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\\n if (ok) {\\n connected[i][j] = true;\\n for (int k = 0; k < j; ++k) connected[i][k] |= connected[j][k];\\n }\\n }\\n }\\n }\\n G.init(H);\\n for (int i = 0; i < H; ++i)\\n for (int j = 0; j < H; ++j) {\\n if (connected[i][j]) G.addedge(i,j);\\n }\\n \\n int ans = Hopcroft_Karp(G);\\n if (H - ans > 2) res = false;\\n }\\n\\n return res;\\n}\\n\\nint main() { \\n cin >> H >> W;\\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n scanf(\\\"%d\\\", &h[i][j]);\\n temp[j][i] = h[i][j];\\n }\\n \\n bool can = true;\\n if (!solve()) can = false;\\n \\n if (can) {\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j) \\n temp[i][j] = h[j][i];\\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j)\\n h[i][j] = temp[i][j];\\n swap(H, W);\\n \\n if (!solve()) can = false;\\n }\\n \\n if (can) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 15020,\n \"score_of_the_acc\": -0.1609,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2279_5270207\",\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<ll> vll;\\ntypedef pair<int,int> pint;\\n\\n#define DE 1\\n#define FI first\\n#define SE second\\n#define PB push_back\\n#define MP make_pair\\n#define ALL(s) (s).begin(),(s).end()\\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\\\", \\\"<<P.second<<'>';}\\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\\\"{ \\\";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) {s<<\\\"{ \\\";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\\\", \\\";s<<'<'<<it->first<<\\\"->\\\"<<it->second<<'>';}return s<<\\\" }\\\"<<endl;}\\n\\n\\n\\nconst int MAX = 1010;\\n\\nstruct Graph {\\n static const int MAX_V_ = ::MAX;\\n int L;\\n vector<int> list[MAX_V_];\\n \\n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\\n inline vector<int>& operator [] (int i) {return list[i];}\\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \\\" : \\\" << G.list[i];}return s;}\\n \\n void addedge(int from, int to) {\\n list[from].push_back(to);\\n }\\n} G;\\n\\nint L = 0;\\nbool seen[MAX];\\nbool matched[MAX];\\nint level[MAX];\\nint matching[MAX];\\n\\nvoid hobfs(Graph &G) {\\n queue<int> que;\\n for (int left = 0; left < L; ++left) {\\n level[left] = -1;\\n if (!matched[left]) {\\n que.push(left);\\n level[left] = 0;\\n }\\n }\\n level[L] = L;\\n while (!que.empty()) {\\n int left = que.front();\\n que.pop();\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] == -1) {\\n level[next] = level[left] + 1;\\n que.push(next);\\n }\\n }\\n }\\n}\\n\\nbool hodfs(Graph &G, int left) {\\n if (left == L) return true;\\n if (seen[left]) return false;\\n seen[left] = true;\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] > level[left] && hodfs(G, next)) {\\n matching[right] = left;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint Hopcroft_Karp(Graph &G) {\\n L = G.L;\\n for (int i = 0; i < MAX; ++i) matching[i] = L;\\n memset(matched, 0, sizeof(matched));\\n \\n int res = 0;\\n while (true) {\\n hobfs(G);\\n memset(seen, 0, sizeof(seen));\\n bool finished = true;\\n for (int left = 0; left < L; ++left) {\\n if (!matched[left] && hodfs(G, left)) {\\n matched[left] = true;\\n ++res;\\n finished = false;\\n }\\n }\\n if (finished) break;\\n }\\n return res;\\n}\\n\\n\\nint H, W;\\nvint h[MAX];\\nint temp[MAX][MAX];\\nbool connected[MAX][MAX];\\n\\nbool solve() {\\n bool res = true;\\n \\n int pMax = -1, Max = -1;\\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\\n for (int i = 0; i < W; ++i) {\\n int epMax = -1, eMax = -1;\\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\\n if (epMax != pMax) {res = false; break;}\\n }\\n if (res) {\\n sort(h, h + H);\\n for (int i = 0; i < H; ++i) {\\n for (int j = i-1; j >= 0; --j) {\\n if (!connected[i][j]) {\\n bool ok = true;\\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\\n if (ok) {\\n connected[i][j] = true;\\n for (int k = 0; k < j; ++k) connected[i][k] |= connected[j][k];\\n }\\n }\\n }\\n }\\n G.init(H);\\n for (int i = 0; i < H; ++i)\\n for (int j = 0; j < H; ++j) {\\n if (i == j) continue;\\n if (connected[i][j]) G.addedge(i,j);\\n }\\n \\n int ans = Hopcroft_Karp(G);\\n if (H - ans > 2) res = false;\\n }\\n\\n return res;\\n}\\n\\nint main() { \\n cin >> H >> W;\\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n scanf(\\\"%d\\\", &h[i][j]);\\n temp[j][i] = h[i][j];\\n }\\n \\n bool can = true;\\n if (!solve()) can = false;\\n \\n if (can) {\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j) \\n temp[i][j] = h[j][i];\\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j)\\n h[i][j] = temp[i][j];\\n swap(H, W);\\n \\n if (!solve()) can = false;\\n }\\n \\n if (can) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 15104,\n \"score_of_the_acc\": -0.163,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2279_5267756\",\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<ll> vll;\\ntypedef pair<int,int> pint;\\n\\n#define DE 1\\n#define FI first\\n#define SE second\\n#define PB push_back\\n#define MP make_pair\\n#define ALL(s) (s).begin(),(s).end()\\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\\\", \\\"<<P.second<<'>';}\\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\\\"{ \\\";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) {s<<\\\"{ \\\";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\\\", \\\";s<<'<'<<it->first<<\\\"->\\\"<<it->second<<'>';}return s<<\\\" }\\\"<<endl;}\\n\\n\\n\\nconst int MAX = 1010;\\n\\nstruct Graph {\\n static const int MAX_V_ = ::MAX;\\n int L;\\n vector<int> list[MAX_V_];\\n \\n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\\n inline vector<int>& operator [] (int i) {return list[i];}\\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \\\" : \\\" << G.list[i];}return s;}\\n \\n void addedge(int from, int to) {\\n list[from].push_back(to);\\n }\\n} G;\\n\\nint L = 0;\\nbool seen[MAX];\\nbool matched[MAX];\\nint level[MAX];\\nint matching[MAX];\\n\\nvoid hobfs(Graph &G) {\\n queue<int> que;\\n for (int left = 0; left < L; ++left) {\\n level[left] = -1;\\n if (!matched[left]) {\\n que.push(left);\\n level[left] = 0;\\n }\\n }\\n level[L] = L;\\n while (!que.empty()) {\\n int left = que.front();\\n que.pop();\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] == -1) {\\n level[next] = level[left] + 1;\\n que.push(next);\\n }\\n }\\n }\\n}\\n\\nbool hodfs(Graph &G, int left) {\\n if (left == L) return true;\\n if (seen[left]) return false;\\n seen[left] = true;\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] > level[left] && hodfs(G, next)) {\\n matching[right] = left;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint Hopcroft_Karp(Graph &G) {\\n L = G.L;\\n for (int i = 0; i < MAX; ++i) matching[i] = L;\\n memset(matched, 0, sizeof(matched));\\n \\n int res = 0;\\n while (true) {\\n hobfs(G);\\n memset(seen, 0, sizeof(seen));\\n bool finished = true;\\n for (int left = 0; left < L; ++left) {\\n if (!matched[left] && hodfs(G, left)) {\\n matched[left] = true;\\n ++res;\\n finished = false;\\n }\\n }\\n if (finished) break;\\n }\\n return res;\\n}\\n\\n\\nint H, W;\\nvint h[MAX];\\nint temp[MAX][MAX];\\nbool connected[MAX][MAX];\\n\\nbool solve() {\\n bool res = true;\\n \\n int pMax = -1, Max = -1;\\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\\n for (int i = 0; i < W; ++i) {\\n int epMax = -1, eMax = -1;\\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\\n if (epMax != pMax) {res = false; break;}\\n }\\n if (res) {\\n sort(h, h + H);\\n for (int i = 0; i < H ; ++i) {\\n for (int j = i-1; j >= 0; --j) {\\n if (!connected[i][j]) {\\n bool ok = true;\\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\\n if (ok) {\\n connected[i][j] = true;\\n for (int k = 0; k < H; ++k) connected[i][k] |= connected[j][k];\\n }\\n }\\n }\\n }\\n G.init(H);\\n for (int i = 0; i < H; ++i)\\n for (int j = 0; j < H; ++j) {\\n if (i == j) continue;\\n if (connected[i][j]) G.addedge(i,j);\\n }\\n \\n int ans = Hopcroft_Karp(G);\\n if (H - ans > 2) res = false;\\n }\\n\\n return res;\\n}\\n\\nint main() { \\n cin >> H >> W;\\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n scanf(\\\"%d\\\", &h[i][j]);\\n temp[j][i] = h[i][j];\\n }\\n \\n bool can = true;\\n if (!solve()) can = false;\\n \\n if (can) {\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j) \\n temp[i][j] = h[j][i];\\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j)\\n h[i][j] = temp[i][j];\\n swap(H, W);\\n \\n if (!solve()) can = false;\\n }\\n \\n if (can) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 15124,\n \"score_of_the_acc\": -0.1635,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2279_5267751\",\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<ll> vll;\\ntypedef pair<int,int> pint;\\n\\n#define DE 1\\n#define FI first\\n#define SE second\\n#define PB push_back\\n#define MP make_pair\\n#define ALL(s) (s).begin(),(s).end()\\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\\\", \\\"<<P.second<<'>';}\\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\\\"{ \\\";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) {s<<\\\"{ \\\";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\\\", \\\";s<<'<'<<it->first<<\\\"->\\\"<<it->second<<'>';}return s<<\\\" }\\\"<<endl;}\\n\\n\\n\\nconst int MAX = 1010;\\n\\nstruct Graph {\\n static const int MAX_V_ = ::MAX;\\n int L;\\n vector<int> list[MAX_V_];\\n \\n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\\n inline vector<int>& operator [] (int i) {return list[i];}\\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \\\" : \\\" << G.list[i];}return s;}\\n \\n void addedge(int from, int to) {\\n list[from].push_back(to);\\n }\\n} G;\\n\\nint L = 0;\\nbool seen[MAX];\\nbool matched[MAX];\\nint level[MAX];\\nint matching[MAX];\\n\\nvoid hobfs(Graph &G) {\\n queue<int> que;\\n for (int left = 0; left < L; ++left) {\\n level[left] = -1;\\n if (!matched[left]) {\\n que.push(left);\\n level[left] = 0;\\n }\\n }\\n level[L] = L;\\n while (!que.empty()) {\\n int left = que.front();\\n que.pop();\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] == -1) {\\n level[next] = level[left] + 1;\\n que.push(next);\\n }\\n }\\n }\\n}\\n\\nbool hodfs(Graph &G, int left) {\\n if (left == L) return true;\\n if (seen[left]) return false;\\n seen[left] = true;\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] > level[left] && hodfs(G, next)) {\\n matching[right] = left;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint Hopcroft_Karp(Graph &G) {\\n L = G.L;\\n for (int i = 0; i < MAX; ++i) matching[i] = L;\\n memset(matched, 0, sizeof(matched));\\n \\n int res = 0;\\n while (true) {\\n hobfs(G);\\n memset(seen, 0, sizeof(seen));\\n bool finished = true;\\n for (int left = 0; left < L; ++left) {\\n if (!matched[left] && hodfs(G, left)) {\\n matched[left] = true;\\n ++res;\\n finished = false;\\n }\\n }\\n if (finished) break;\\n }\\n return res;\\n}\\n\\n\\nint H, W;\\nvint h[MAX];\\nint temp[MAX][MAX];\\nbool connected[MAX][MAX];\\n\\nbool solve() {\\n bool res = true;\\n \\n int pMax = -1, Max = -1;\\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\\n for (int i = 0; i < W; ++i) {\\n int epMax = -1, eMax = -1;\\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\\n if (epMax != pMax) {res = false; break;}\\n }\\n if (res) {\\n sort(h, h + H);\\n for (int i = H-1; i >= 0 ; --i) {\\n for (int j = 0; j < i; ++j) {\\n if (!connected[i][j]) {\\n bool ok = true;\\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\\n if (ok) {\\n connected[i][j] = true;\\n for (int k = 0; k < H; ++k) connected[i][k] |= connected[j][k];\\n }\\n }\\n }\\n }\\n G.init(H);\\n for (int i = 0; i < H; ++i)\\n for (int j = 0; j < H; ++j) {\\n if (i == j) continue;\\n if (connected[i][j]) G.addedge(i,j);\\n }\\n \\n int ans = Hopcroft_Karp(G);\\n if (H - ans > 2) res = false;\\n }\\n\\n return res;\\n}\\n\\nint main() { \\n cin >> H >> W;\\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n scanf(\\\"%d\\\", &h[i][j]);\\n temp[j][i] = h[i][j];\\n }\\n \\n bool can = true;\\n if (!solve()) can = false;\\n \\n if (can) {\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j) \\n temp[i][j] = h[j][i];\\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j)\\n h[i][j] = temp[i][j];\\n swap(H, W);\\n \\n if (!solve()) can = false;\\n }\\n \\n if (can) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 15080,\n \"score_of_the_acc\": -0.4654,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2279_5267735\",\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<ll> vll;\\ntypedef pair<int,int> pint;\\n\\n#define DE 1\\n#define FI first\\n#define SE second\\n#define PB push_back\\n#define MP make_pair\\n#define ALL(s) (s).begin(),(s).end()\\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\\\", \\\"<<P.second<<'>';}\\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\\\"{ \\\";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) {s<<\\\"{ \\\";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\\\", \\\";s<<'<'<<it->first<<\\\"->\\\"<<it->second<<'>';}return s<<\\\" }\\\"<<endl;}\\n\\n\\n\\nconst int MAX = 1010;\\n\\nstruct Graph {\\n static const int MAX_V_ = ::MAX;\\n int L;\\n vector<int> list[MAX_V_];\\n \\n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\\n inline vector<int>& operator [] (int i) {return list[i];}\\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \\\" : \\\" << G.list[i];}return s;}\\n \\n void addedge(int from, int to) {\\n list[from].push_back(to);\\n }\\n} G;\\n\\nint L = 0;\\nbool seen[MAX];\\nbool matched[MAX];\\nint level[MAX];\\nint matching[MAX];\\n\\nvoid hobfs(Graph &G) {\\n queue<int> que;\\n for (int left = 0; left < L; ++left) {\\n level[left] = -1;\\n if (!matched[left]) {\\n que.push(left);\\n level[left] = 0;\\n }\\n }\\n level[L] = L;\\n while (!que.empty()) {\\n int left = que.front();\\n que.pop();\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] == -1) {\\n level[next] = level[left] + 1;\\n que.push(next);\\n }\\n }\\n }\\n}\\n\\nbool hodfs(Graph &G, int left) {\\n if (left == L) return true;\\n if (seen[left]) return false;\\n seen[left] = true;\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] > level[left] && hodfs(G, next)) {\\n matching[right] = left;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint Hopcroft_Karp(Graph &G) {\\n L = G.L;\\n for (int i = 0; i < MAX; ++i) matching[i] = L;\\n memset(matched, 0, sizeof(matched));\\n \\n int res = 0;\\n while (true) {\\n hobfs(G);\\n memset(seen, 0, sizeof(seen));\\n bool finished = true;\\n for (int left = 0; left < L; ++left) {\\n if (!matched[left] && hodfs(G, left)) {\\n matched[left] = true;\\n ++res;\\n finished = false;\\n }\\n }\\n if (finished) break;\\n }\\n return res;\\n}\\n\\n\\nint H, W;\\nvint h[MAX];\\nint temp[MAX][MAX];\\nbool connected[MAX][MAX];\\n\\nbool solve() {\\n bool res = true;\\n \\n int pMax = -1, Max = -1;\\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\\n for (int i = 0; i < W; ++i) {\\n int epMax = -1, eMax = -1;\\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\\n if (epMax != pMax) {res = false; break;}\\n }\\n if (res) {\\n sort(h, h + H);\\n for (int i = 0; i < H ; ++i) {\\n for (int j = 0; j < i; ++j) {\\n if (!connected[i][j]) {\\n bool ok = true;\\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\\n if (ok) {\\n connected[i][j] = true;\\n for (int k = 0; k < H; ++k) connected[i][k] |= connected[j][k];\\n }\\n }\\n }\\n }\\n G.init(H);\\n for (int i = 0; i < H; ++i)\\n for (int j = 0; j < H; ++j) {\\n if (i == j) continue;\\n if (connected[i][j]) G.addedge(i,j);\\n }\\n \\n int ans = Hopcroft_Karp(G);\\n if (H - ans > 2) res = false;\\n }\\n\\n return res;\\n}\\n\\nint main() { \\n cin >> H >> W;\\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n scanf(\\\"%d\\\", &h[i][j]);\\n temp[j][i] = h[i][j];\\n }\\n \\n bool can = true;\\n if (!solve()) can = false;\\n \\n if (can) {\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j) \\n temp[i][j] = h[j][i];\\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j)\\n h[i][j] = temp[i][j];\\n swap(H, W);\\n \\n if (!solve()) can = false;\\n }\\n \\n if (can) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 470,\n \"memory_kb\": 15036,\n \"score_of_the_acc\": -0.4568,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2279_5267717\",\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<ll> vll;\\ntypedef pair<int,int> pint;\\n\\n#define DE 1\\n#define FI first\\n#define SE second\\n#define PB push_back\\n#define MP make_pair\\n#define ALL(s) (s).begin(),(s).end()\\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\\\", \\\"<<P.second<<'>';}\\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\\\"{ \\\";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) {s<<\\\"{ \\\";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\\\", \\\";s<<'<'<<it->first<<\\\"->\\\"<<it->second<<'>';}return s<<\\\" }\\\"<<endl;}\\n\\n\\n\\nconst int MAX = 1010;\\n\\nstruct Graph {\\n static const int MAX_V_ = ::MAX;\\n int L;\\n vector<int> list[MAX_V_];\\n \\n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\\n inline vector<int>& operator [] (int i) {return list[i];}\\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \\\" : \\\" << G.list[i];}return s;}\\n \\n void addedge(int from, int to) {\\n list[from].push_back(to);\\n }\\n} G;\\n\\nint L = 0;\\nbool seen[MAX];\\nbool matched[MAX];\\nint level[MAX];\\nint matching[MAX];\\n\\nvoid hobfs(Graph &G) {\\n queue<int> que;\\n for (int left = 0; left < L; ++left) {\\n level[left] = -1;\\n if (!matched[left]) {\\n que.push(left);\\n level[left] = 0;\\n }\\n }\\n level[L] = L;\\n while (!que.empty()) {\\n int left = que.front();\\n que.pop();\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] == -1) {\\n level[next] = level[left] + 1;\\n que.push(next);\\n }\\n }\\n }\\n}\\n\\nbool hodfs(Graph &G, int left) {\\n if (left == L) return true;\\n if (seen[left]) return false;\\n seen[left] = true;\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] > level[left] && hodfs(G, next)) {\\n matching[right] = left;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint Hopcroft_Karp(Graph &G) {\\n L = G.L;\\n for (int i = 0; i < MAX; ++i) matching[i] = L;\\n memset(matched, 0, sizeof(matched));\\n \\n int res = 0;\\n while (true) {\\n hobfs(G);\\n memset(seen, 0, sizeof(seen));\\n bool finished = true;\\n for (int left = 0; left < L; ++left) {\\n if (!matched[left] && hodfs(G, left)) {\\n matched[left] = true;\\n ++res;\\n finished = false;\\n }\\n }\\n if (finished) break;\\n }\\n return res;\\n}\\n\\n\\nint H, W;\\nvint h[MAX];\\nint temp[MAX][MAX];\\nbool connected[MAX][MAX];\\n\\nbool solve() {\\n bool res = true;\\n \\n int pMax = -1, Max = -1;\\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\\n for (int i = 0; i < W; ++i) {\\n int epMax = -1, eMax = -1;\\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\\n if (epMax != pMax) {res = false; break;}\\n }\\n if (res) {\\n sort(h, h + H);\\n for (int i = H-1; i >= 0 ; --i) {\\n for (int j = i-1; j >= 0; --j) {\\n if (!connected[i][j]) {\\n bool ok = true;\\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\\n if (ok) {\\n connected[i][j] = true;\\n for (int k = j-1; k >= 0; --k) connected[i][k] |= connected[j][k];\\n }\\n }\\n }\\n }\\n G.init(H);\\n for (int i = 0; i < H; ++i)\\n for (int j = 0; j < H; ++j) {\\n if (i == j) continue;\\n if (connected[i][j]) G.addedge(i,j);\\n }\\n \\n int ans = Hopcroft_Karp(G);\\n if (H - ans > 2) res = false;\\n }\\n\\n return res;\\n}\\n\\nint main() { \\n cin >> H >> W;\\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n scanf(\\\"%d\\\", &h[i][j]);\\n temp[j][i] = h[i][j];\\n }\\n \\n bool can = true;\\n if (!solve()) can = false;\\n \\n if (can) {\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j) \\n temp[i][j] = h[j][i];\\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j)\\n h[i][j] = temp[i][j];\\n swap(H, W);\\n \\n if (!solve()) can = false;\\n }\\n \\n if (can) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 15032,\n \"score_of_the_acc\": -0.3657,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2279_5267716\",\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<ll> vll;\\ntypedef pair<int,int> pint;\\n\\n#define DE 1\\n#define FI first\\n#define SE second\\n#define PB push_back\\n#define MP make_pair\\n#define ALL(s) (s).begin(),(s).end()\\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\\\", \\\"<<P.second<<'>';}\\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\\\"{ \\\";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) {s<<\\\"{ \\\";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\\\", \\\";s<<'<'<<it->first<<\\\"->\\\"<<it->second<<'>';}return s<<\\\" }\\\"<<endl;}\\n\\n\\n\\nconst int MAX = 1010;\\n\\nstruct Graph {\\n static const int MAX_V_ = ::MAX;\\n int L;\\n vector<int> list[MAX_V_];\\n \\n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\\n inline vector<int>& operator [] (int i) {return list[i];}\\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \\\" : \\\" << G.list[i];}return s;}\\n \\n void addedge(int from, int to) {\\n list[from].push_back(to);\\n }\\n} G;\\n\\nint L = 0;\\nbool seen[MAX];\\nbool matched[MAX];\\nint level[MAX];\\nint matching[MAX];\\n\\nvoid hobfs(Graph &G) {\\n queue<int> que;\\n for (int left = 0; left < L; ++left) {\\n level[left] = -1;\\n if (!matched[left]) {\\n que.push(left);\\n level[left] = 0;\\n }\\n }\\n level[L] = L;\\n while (!que.empty()) {\\n int left = que.front();\\n que.pop();\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] == -1) {\\n level[next] = level[left] + 1;\\n que.push(next);\\n }\\n }\\n }\\n}\\n\\nbool hodfs(Graph &G, int left) {\\n if (left == L) return true;\\n if (seen[left]) return false;\\n seen[left] = true;\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] > level[left] && hodfs(G, next)) {\\n matching[right] = left;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint Hopcroft_Karp(Graph &G) {\\n L = G.L;\\n for (int i = 0; i < MAX; ++i) matching[i] = L;\\n memset(matched, 0, sizeof(matched));\\n \\n int res = 0;\\n while (true) {\\n hobfs(G);\\n memset(seen, 0, sizeof(seen));\\n bool finished = true;\\n for (int left = 0; left < L; ++left) {\\n if (!matched[left] && hodfs(G, left)) {\\n matched[left] = true;\\n ++res;\\n finished = false;\\n }\\n }\\n if (finished) break;\\n }\\n return res;\\n}\\n\\n\\nint H, W;\\nvint h[MAX];\\nint temp[MAX][MAX];\\nbool connected[MAX][MAX];\\n\\nbool solve() {\\n bool res = true;\\n \\n int pMax = -1, Max = -1;\\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\\n for (int i = 0; i < W; ++i) {\\n int epMax = -1, eMax = -1;\\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\\n if (epMax != pMax) {res = false; break;}\\n }\\n if (res) {\\n sort(h, h + H);\\n for (int i = 0; i < H ; ++i) {\\n for (int j = i-1; j >= 0; --j) {\\n if (!connected[i][j]) {\\n bool ok = true;\\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\\n if (ok) {\\n connected[i][j] = true;\\n for (int k = j-1; k >= 0; --k) connected[i][k] |= connected[j][k];\\n }\\n }\\n }\\n }\\n G.init(H);\\n for (int i = 0; i < H; ++i)\\n for (int j = 0; j < H; ++j) {\\n if (i == j) continue;\\n if (connected[i][j]) G.addedge(i,j);\\n }\\n \\n int ans = Hopcroft_Karp(G);\\n if (H - ans > 2) res = false;\\n }\\n\\n return res;\\n}\\n\\nint main() { \\n cin >> H >> W;\\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n scanf(\\\"%d\\\", &h[i][j]);\\n temp[j][i] = h[i][j];\\n }\\n \\n bool can = true;\\n if (!solve()) can = false;\\n \\n if (can) {\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j) \\n temp[i][j] = h[j][i];\\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j)\\n h[i][j] = temp[i][j];\\n swap(H, W);\\n \\n if (!solve()) can = false;\\n }\\n \\n if (can) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 15108,\n \"score_of_the_acc\": -0.1631,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2279_5267715\",\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<ll> vll;\\ntypedef pair<int,int> pint;\\n\\n#define DE 1\\n#define FI first\\n#define SE second\\n#define PB push_back\\n#define MP make_pair\\n#define ALL(s) (s).begin(),(s).end()\\n#define REP(i,n) for (int i = 0; i < (int)(n); ++i)\\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 T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<\\\", \\\"<<P.second<<'>';}\\ntemplate<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<\\\"{ \\\";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) {s<<\\\"{ \\\";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<\\\", \\\";s<<'<'<<it->first<<\\\"->\\\"<<it->second<<'>';}return s<<\\\" }\\\"<<endl;}\\n\\n\\n\\nconst int MAX = 1010;\\n\\nstruct Graph {\\n static const int MAX_V_ = ::MAX;\\n int L;\\n vector<int> list[MAX_V_];\\n \\n void init(int n = 0) {L = n; for (int i = 0; i < MAX_V_; ++i) list[i].clear();}\\n inline vector<int>& operator [] (int i) {return list[i];}\\n friend ostream& operator << (ostream& s, const Graph& G) {for (int i = 0; i < G.L; ++i) {s << i << \\\" : \\\" << G.list[i];}return s;}\\n \\n void addedge(int from, int to) {\\n list[from].push_back(to);\\n }\\n} G;\\n\\nint L = 0;\\nbool seen[MAX];\\nbool matched[MAX];\\nint level[MAX];\\nint matching[MAX];\\n\\nvoid hobfs(Graph &G) {\\n queue<int> que;\\n for (int left = 0; left < L; ++left) {\\n level[left] = -1;\\n if (!matched[left]) {\\n que.push(left);\\n level[left] = 0;\\n }\\n }\\n level[L] = L;\\n while (!que.empty()) {\\n int left = que.front();\\n que.pop();\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] == -1) {\\n level[next] = level[left] + 1;\\n que.push(next);\\n }\\n }\\n }\\n}\\n\\nbool hodfs(Graph &G, int left) {\\n if (left == L) return true;\\n if (seen[left]) return false;\\n seen[left] = true;\\n for (int i = 0; i < G[left].size(); ++i) {\\n int right = G[left][i];\\n int next = matching[right];\\n if (level[next] > level[left] && hodfs(G, next)) {\\n matching[right] = left;\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint Hopcroft_Karp(Graph &G) {\\n L = G.L;\\n for (int i = 0; i < MAX; ++i) matching[i] = L;\\n memset(matched, 0, sizeof(matched));\\n \\n int res = 0;\\n while (true) {\\n hobfs(G);\\n memset(seen, 0, sizeof(seen));\\n bool finished = true;\\n for (int left = 0; left < L; ++left) {\\n if (!matched[left] && hodfs(G, left)) {\\n matched[left] = true;\\n ++res;\\n finished = false;\\n }\\n }\\n if (finished) break;\\n }\\n return res;\\n}\\n\\n\\nint H, W;\\nvint h[MAX];\\nint temp[MAX][MAX];\\nbool connected[MAX][MAX];\\n\\nbool solve() {\\n bool res = true;\\n \\n int pMax = -1, Max = -1;\\n for (int i = 0; i < H; ++i) if (Max < h[i][0]) {Max = h[i][0], pMax = i;}\\n for (int i = 0; i < W; ++i) {\\n int epMax = -1, eMax = -1;\\n for (int j = 0; j < H; ++j) if (eMax < h[j][i]) {eMax = h[j][i], epMax = j;}\\n if (epMax != pMax) {res = false; break;}\\n }\\n if (res) {\\n sort(h, h + H);\\n for (int i = 0; i < H ; ++i) {\\n for (int j = 0; j < i; ++j) {\\n if (!connected[i][j]) {\\n bool ok = true;\\n for (int k = 0; k < W; ++k) if (h[i][k] <= h[j][k]) {ok = false; break;}\\n if (ok) {\\n connected[i][j] = true;\\n for (int k = j-1; k >= 0; --k) connected[i][k] |= connected[j][k];\\n }\\n }\\n }\\n }\\n G.init(H);\\n for (int i = 0; i < H; ++i)\\n for (int j = 0; j < H; ++j) {\\n if (i == j) continue;\\n if (connected[i][j]) G.addedge(i,j);\\n }\\n \\n int ans = Hopcroft_Karp(G);\\n if (H - ans > 2) res = false;\\n }\\n\\n return res;\\n}\\n\\nint main() { \\n cin >> H >> W;\\n for (int i = 0; i < H; ++i) h[i].resize(W, 0);\\n for (int i = 0; i < H; ++i) for (int j = 0; j < W; ++j) {\\n scanf(\\\"%d\\\", &h[i][j]);\\n temp[j][i] = h[i][j];\\n }\\n \\n bool can = true;\\n if (!solve()) can = false;\\n \\n if (can) {\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j) \\n temp[i][j] = h[j][i];\\n for (int i = 0; i < W; ++i) h[i].resize(H, 0);\\n for (int i = 0; i < W; ++i) \\n for (int j = 0; j < H; ++j)\\n h[i][j] = temp[i][j];\\n swap(H, W);\\n \\n if (!solve()) can = false;\\n }\\n \\n if (can) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 15080,\n \"score_of_the_acc\": -0.3745,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2279_5208213\",\n \"code_snippet\": \"#include <algorithm>\\n// #include <atcoder/all>\\n#include <cassert>\\n#include <chrono>\\n#include <cmath>\\n#include <complex>\\n#include <cstdint>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <random>\\n#include <regex>\\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>\\nusing namespace std;\\n// using namespace atcoder;\\nusing ll = long long;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vector<ll>>;\\nusing vvvll = vector<vector<vector<ll>>>;\\nusing vii = vector<int>;\\nusing vvii = vector<vector<int>>;\\nusing vvvii = vector<vector<vector<int>>>;\\nusing vdd = vector<ld>;\\nusing vvdd = vector<vector<ld>>;\\nusing vvvdd = vector<vector<vector<ld>>>;\\nusing vbb = vector<bool>;\\nusing vvbb = vector<vector<bool>>;\\nusing vvvbb = vector<vector<vector<bool>>>;\\nusing vpll = vector<pll>;\\nusing vvpll = vector<vector<pll>>;\\nusing vvvpll = vector<vector<vector<pll>>>;\\n#define pb push_back\\n#define mp make_pair\\n#define sc second\\n#define fr first\\n#define endl '\\\\n'\\n#define stpr std::fixed << setprecision\\n#define cYES cout << \\\"YES\\\" << endl\\n#define cNO cout << \\\"NO\\\" << endl\\n#define cYes cout << \\\"Yes\\\" << endl\\n#define cNo cout << \\\"No\\\" << endl\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d)\\n#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)\\n#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)\\n#define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d)\\n#define rRep(i, a, b) for (ll i = a; i >= b; i--)\\n#define crep(i) for (char i = 'a'; i <= 'z'; ++i)\\n#define Crep(i) for (char i = 'A'; i <= 'Z'; ++i)\\n#define ALL(x) (x).begin(), (x).end()\\n#define rALL(x) (x).rbegin(), (x).rend()\\n#define sort2(A, N) \\\\\\n sort(A, A + N, \\\\\\n [](const pii &a, const pii &b) { return a.second < b.second; });\\n#define debug(v) \\\\\\n cout << #v << \\\":\\\"; \\\\\\n for (auto x : v) { \\\\\\n cout << x << ' '; \\\\\\n } \\\\\\n cout << endl;\\nint ctoi(const char c) {\\n if ('0' <= c && c <= '9') return (c - '0');\\n return -1;\\n}\\nll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }\\nll lcm(ll a, ll b) { return a * b / gcd(a, b); }\\nconstexpr ll MOD = 1000000007;\\nconstexpr ll INF = 1000000011;\\nconstexpr ll MOD2 = 998244353;\\nconstexpr ll LINF = 1001002003004005006ll;\\nconstexpr ld EPS = 10e-10;\\ntemplate <class T, class U>\\ninline bool chmax(T &lhs, const U &rhs) {\\n if (lhs < rhs) {\\n lhs = rhs;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &lhs, const U &rhs) {\\n if (lhs > rhs) {\\n lhs = rhs;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v) {\\n for (auto &&x : v) is >> x;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n is >> p.first;\\n is >> p.second;\\n return is;\\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 <class T>\\nostream &operator<<(ostream &os, vector<T> &v) {\\n for (auto i = begin(v); i != end(v); ++i) {\\n if (i != begin(v)) os << ' ';\\n os << *i;\\n }\\n return os;\\n}\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nstruct 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\\ntemplate <class Cap>\\nstruct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto &_e = g[pos[i].first][pos[i].second];\\n auto &_re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int &i = iter[v]; i < int(g[v].size()); i++) {\\n _edge &e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) return res;\\n }\\n level[v] = _n;\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\nint main() {\\n ll H, W;\\n ll C, D;\\n cin >> H >> W;\\n vvll A(H, vll(W));\\n cin >> A;\\n if (1) {\\n auto B = A;\\n sort(ALL(B));\\n vvll E(H);\\n rep(i, H) {\\n Rep(j, i + 1, H) {\\n bool Z = 1;\\n rep(k, W) {\\n if (B[i][k] > B[j][k]) {\\n Z = 0;\\n }\\n }\\n if (Z) {\\n E[j].pb(i);\\n }\\n }\\n }\\n mf_graph<ll> mf(2 * H + 2);\\n rep(i, H) {\\n mf.add_edge(2 * H, i, 1);\\n mf.add_edge(H + i, 2 * H + 1, 1);\\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\\n }\\n if (E[H - 1].size() < H - 1) {\\n cNO;\\n return 0;\\n }\\n C = H - mf.flow(2 * H, 2 * H + 1);\\n }\\n if (1) {\\n vvll B(W, vll(H));\\n rep(i, H) {\\n rep(j, W) { B[j][i] = A[i][j]; }\\n }\\n swap(H, W);\\n sort(ALL(B));\\n vvll E(H);\\n rep(i, H) {\\n Rep(j, i + 1, H) {\\n bool Z = 1;\\n rep(k, W) {\\n if (B[i][k] > B[j][k]) {\\n Z = 0;\\n }\\n }\\n if (Z) {\\n E[j].pb(i);\\n }\\n }\\n }\\n mf_graph<ll> mf(2 * H + 2);\\n rep(i, H) {\\n mf.add_edge(2 * H, i, 1);\\n mf.add_edge(H + i, 2 * H + 1, 1);\\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\\n }\\n if (E[H - 1].size() < H - 1) {\\n cNO;\\n return 0;\\n }\\n D = H - mf.flow(2 * H, 2 * H + 1);\\n }\\n if (C <= 2 && D <= 2) {\\n cYES;\\n } else {\\n cNO;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 48420,\n \"score_of_the_acc\": -1.4105,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2279_5206923\",\n \"code_snippet\": \"#include <algorithm>\\n// #include <atcoder/all>\\n#include <cassert>\\n#include <chrono>\\n#include <cmath>\\n#include <complex>\\n#include <cstdint>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <random>\\n#include <regex>\\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>\\nusing namespace std;\\n// using namespace atcoder;\\nusing ll = long long;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vector<ll>>;\\nusing vvvll = vector<vector<vector<ll>>>;\\nusing vii = vector<int>;\\nusing vvii = vector<vector<int>>;\\nusing vvvii = vector<vector<vector<int>>>;\\nusing vdd = vector<ld>;\\nusing vvdd = vector<vector<ld>>;\\nusing vvvdd = vector<vector<vector<ld>>>;\\nusing vbb = vector<bool>;\\nusing vvbb = vector<vector<bool>>;\\nusing vvvbb = vector<vector<vector<bool>>>;\\nusing vpll = vector<pll>;\\nusing vvpll = vector<vector<pll>>;\\nusing vvvpll = vector<vector<vector<pll>>>;\\n#define pb push_back\\n#define mp make_pair\\n#define sc second\\n#define fr first\\n#define endl '\\\\n'\\n#define stpr std::fixed << setprecision\\n#define cYES cout << \\\"YES\\\" << endl\\n#define cNO cout << \\\"NO\\\" << endl\\n#define cYes cout << \\\"Yes\\\" << endl\\n#define cNo cout << \\\"No\\\" << endl\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d)\\n#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)\\n#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)\\n#define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d)\\n#define rRep(i, a, b) for (ll i = a; i >= b; i--)\\n#define crep(i) for (char i = 'a'; i <= 'z'; ++i)\\n#define Crep(i) for (char i = 'A'; i <= 'Z'; ++i)\\n#define ALL(x) (x).begin(), (x).end()\\n#define rALL(x) (x).rbegin(), (x).rend()\\n#define sort2(A, N) \\\\\\n sort(A, A + N, \\\\\\n [](const pii &a, const pii &b) { return a.second < b.second; });\\n#define debug(v) \\\\\\n cout << #v << \\\":\\\"; \\\\\\n for (auto x : v) { \\\\\\n cout << x << ' '; \\\\\\n } \\\\\\n cout << endl;\\nint ctoi(const char c) {\\n if ('0' <= c && c <= '9') return (c - '0');\\n return -1;\\n}\\nll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }\\nll lcm(ll a, ll b) { return a * b / gcd(a, b); }\\nconstexpr ll MOD = 1000000007;\\nconstexpr ll INF = 1000000011;\\nconstexpr ll MOD2 = 998244353;\\nconstexpr ll LINF = 1001002003004005006ll;\\nconstexpr ld EPS = 10e-10;\\ntemplate <class T, class U>\\ninline bool chmax(T &lhs, const U &rhs) {\\n if (lhs < rhs) {\\n lhs = rhs;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &lhs, const U &rhs) {\\n if (lhs > rhs) {\\n lhs = rhs;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v) {\\n for (auto &&x : v) is >> x;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n is >> p.first;\\n is >> p.second;\\n return is;\\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 <class T>\\nostream &operator<<(ostream &os, vector<T> &v) {\\n for (auto i = begin(v); i != end(v); ++i) {\\n if (i != begin(v)) os << ' ';\\n os << *i;\\n }\\n return os;\\n}\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nstruct 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\\ntemplate <class Cap>\\nstruct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto &_e = g[pos[i].first][pos[i].second];\\n auto &_re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int &i = iter[v]; i < int(g[v].size()); i++) {\\n _edge &e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) return res;\\n }\\n level[v] = _n;\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\nint main() {\\n ll H, W;\\n ll C, D;\\n cin >> H >> W;\\n vvll A(H, vll(W));\\n cin >> A;\\n if (1) {\\n auto B = A;\\n sort(ALL(B));\\n vvll E(H);\\n rep(i, H) {\\n Rep(j, i + 1, H) {\\n bool Z = 1;\\n rep(k, W) {\\n if (B[i][k] > B[j][k]) {\\n Z = 0;\\n }\\n }\\n if (Z) {\\n E[j].pb(i);\\n }\\n }\\n }\\n mf_graph<ll> mf(2 * H + 2);\\n rep(i, H) {\\n mf.add_edge(2 * H, i, INF);\\n mf.add_edge(H + i, 2 * H + 1, 1);\\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\\n }\\n C = H - mf.flow(2 * H, 2 * H + 1);\\n }\\n if (1) {\\n vvll B(W, vll(H));\\n rep(i, H) {\\n rep(j, W) { B[j][i] = A[i][j]; }\\n }\\n swap(H, W);\\n sort(ALL(B));\\n vvll E(H);\\n rep(i, H) {\\n Rep(j, i + 1, H) {\\n bool Z = 1;\\n rep(k, W) {\\n if (B[i][k] > B[j][k]) {\\n Z = 0;\\n }\\n }\\n if (Z) {\\n E[j].pb(i);\\n }\\n }\\n }\\n mf_graph<ll> mf(2 * H + 2);\\n rep(i, H) {\\n mf.add_edge(2 * H, i, INF);\\n mf.add_edge(H + i, 2 * H + 1, 1);\\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\\n }\\n D = H - mf.flow(2 * H, 2 * H + 1);\\n }\\n if (C <= 1 && D <= 1) {\\n cYES;\\n } else {\\n cNO;\\n }\\n}\",\n \"accuracy\": 0.6621621621621622,\n \"time_ms\": 610,\n \"memory_kb\": 48668,\n \"score_of_the_acc\": -1.4015,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2279_5206812\",\n \"code_snippet\": \"#include <algorithm>\\n// #include <atcoder/all>\\n#include <cassert>\\n#include <chrono>\\n#include <cmath>\\n#include <complex>\\n#include <cstdint>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <random>\\n#include <regex>\\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>\\nusing namespace std;\\n// using namespace atcoder;\\nusing ll = long long;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vector<ll>>;\\nusing vvvll = vector<vector<vector<ll>>>;\\nusing vii = vector<int>;\\nusing vvii = vector<vector<int>>;\\nusing vvvii = vector<vector<vector<int>>>;\\nusing vdd = vector<ld>;\\nusing vvdd = vector<vector<ld>>;\\nusing vvvdd = vector<vector<vector<ld>>>;\\nusing vbb = vector<bool>;\\nusing vvbb = vector<vector<bool>>;\\nusing vvvbb = vector<vector<vector<bool>>>;\\nusing vpll = vector<pll>;\\nusing vvpll = vector<vector<pll>>;\\nusing vvvpll = vector<vector<vector<pll>>>;\\n#define pb push_back\\n#define mp make_pair\\n#define sc second\\n#define fr first\\n#define endl '\\\\n'\\n#define stpr std::fixed << setprecision\\n#define cYES cout << \\\"YES\\\" << endl\\n#define cNO cout << \\\"NO\\\" << endl\\n#define cYes cout << \\\"Yes\\\" << endl\\n#define cNo cout << \\\"No\\\" << endl\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d)\\n#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)\\n#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)\\n#define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d)\\n#define rRep(i, a, b) for (ll i = a; i >= b; i--)\\n#define crep(i) for (char i = 'a'; i <= 'z'; ++i)\\n#define Crep(i) for (char i = 'A'; i <= 'Z'; ++i)\\n#define ALL(x) (x).begin(), (x).end()\\n#define rALL(x) (x).rbegin(), (x).rend()\\n#define sort2(A, N) \\\\\\n sort(A, A + N, \\\\\\n [](const pii &a, const pii &b) { return a.second < b.second; });\\n#define debug(v) \\\\\\n cout << #v << \\\":\\\"; \\\\\\n for (auto x : v) { \\\\\\n cout << x << ' '; \\\\\\n } \\\\\\n cout << endl;\\nint ctoi(const char c) {\\n if ('0' <= c && c <= '9') return (c - '0');\\n return -1;\\n}\\nll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }\\nll lcm(ll a, ll b) { return a * b / gcd(a, b); }\\nconstexpr ll MOD = 1000000007;\\nconstexpr ll INF = 1000000011;\\nconstexpr ll MOD2 = 998244353;\\nconstexpr ll LINF = 1001002003004005006ll;\\nconstexpr ld EPS = 10e-10;\\ntemplate <class T, class U>\\ninline bool chmax(T &lhs, const U &rhs) {\\n if (lhs < rhs) {\\n lhs = rhs;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &lhs, const U &rhs) {\\n if (lhs > rhs) {\\n lhs = rhs;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v) {\\n for (auto &&x : v) is >> x;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n is >> p.first;\\n is >> p.second;\\n return is;\\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 <class T>\\nostream &operator<<(ostream &os, vector<T> &v) {\\n for (auto i = begin(v); i != end(v); ++i) {\\n if (i != begin(v)) os << ' ';\\n os << *i;\\n }\\n return os;\\n}\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nstruct 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\\ntemplate <class Cap>\\nstruct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto &_e = g[pos[i].first][pos[i].second];\\n auto &_re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int &i = iter[v]; i < int(g[v].size()); i++) {\\n _edge &e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) return res;\\n }\\n level[v] = _n;\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\nint main() {\\n ll H, W;\\n ll C, D;\\n cin >> H >> W;\\n vvll A(H, vll(W));\\n cin >> A;\\n if (1) {\\n auto B = A;\\n sort(ALL(B));\\n vvll E(H);\\n rep(i, H - 1) {\\n if (i < H - 2) {\\n bool Z = 1;\\n rep(j, W) {\\n if (B[i][j] > B[i + 1][j]) {\\n Z = 0;\\n }\\n }\\n if (Z) {\\n E[i + 1].pb(i);\\n rep(j, E[i].size()) { E[i + 1].pb(E[i][j]); }\\n }\\n }\\n bool T = 1;\\n rep(j, W) {\\n if (B[i][j] > B[H - 1][j]) {\\n T = 0;\\n }\\n }\\n if (T) {\\n E[H - 1].pb(i);\\n }\\n }\\n mf_graph<ll> mf(2 * H + 2);\\n rep(i, H) {\\n mf.add_edge(2 * H, i, INF);\\n mf.add_edge(H + i, 2 * H + 1, 1);\\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\\n }\\n C = H - mf.flow(2 * H, 2 * H + 1);\\n }\\n if (1) {\\n vvll B(W, vll(H));\\n rep(i, H) {\\n rep(j, W) { B[j][i] = A[i][j]; }\\n }\\n swap(H, W);\\n sort(ALL(B));\\n vvll E(H);\\n rep(i, H - 1) {\\n if (i < H - 2) {\\n bool Z = 1;\\n rep(j, W) {\\n if (B[i][j] > B[i + 1][j]) {\\n Z = 0;\\n }\\n }\\n if (Z) {\\n E[i + 1].pb(i);\\n rep(j, E[i].size()) { E[i + 1].pb(E[i][j]); }\\n }\\n }\\n bool T = 1;\\n rep(j, W) {\\n if (B[i][j] > B[H - 1][j]) {\\n T = 0;\\n }\\n }\\n if (T) {\\n E[H - 1].pb(i);\\n }\\n }\\n mf_graph<ll> mf(2 * H + 2);\\n rep(i, H) {\\n mf.add_edge(2 * H, i, INF);\\n mf.add_edge(H + i, 2 * H + 1, 1);\\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\\n }\\n D = H - mf.flow(2 * H, 2 * H + 1);\\n // cout << D << endl;\\n }\\n if (C <= 1 && D <= 1) {\\n cYES;\\n } else {\\n cNO;\\n }\\n}\",\n \"accuracy\": 0.6621621621621622,\n \"time_ms\": 230,\n \"memory_kb\": 48528,\n \"score_of_the_acc\": -1.1101,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2279_5206492\",\n \"code_snippet\": \"#include <algorithm>\\n// #include <atcoder/all>\\n#include <cassert>\\n#include <chrono>\\n#include <cmath>\\n#include <complex>\\n#include <cstdint>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <random>\\n#include <regex>\\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>\\nusing namespace std;\\n// using namespace atcoder;\\nusing ll = long long;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vector<ll>>;\\nusing vvvll = vector<vector<vector<ll>>>;\\nusing vii = vector<int>;\\nusing vvii = vector<vector<int>>;\\nusing vvvii = vector<vector<vector<int>>>;\\nusing vdd = vector<ld>;\\nusing vvdd = vector<vector<ld>>;\\nusing vvvdd = vector<vector<vector<ld>>>;\\nusing vbb = vector<bool>;\\nusing vvbb = vector<vector<bool>>;\\nusing vvvbb = vector<vector<vector<bool>>>;\\nusing vpll = vector<pll>;\\nusing vvpll = vector<vector<pll>>;\\nusing vvvpll = vector<vector<vector<pll>>>;\\n#define pb push_back\\n#define mp make_pair\\n#define sc second\\n#define fr first\\n#define endl '\\\\n'\\n#define stpr std::fixed << setprecision\\n#define cYES cout << \\\"YES\\\" << endl\\n#define cNO cout << \\\"NO\\\" << endl\\n#define cYes cout << \\\"Yes\\\" << endl\\n#define cNo cout << \\\"No\\\" << endl\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define drep(i, a, b, d) for (ll i = (a); i <= (b); i += d)\\n#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)\\n#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)\\n#define drrep(i, a, b, d) for (ll i = (a); i >= (b); i -= d)\\n#define rRep(i, a, b) for (ll i = a; i >= b; i--)\\n#define crep(i) for (char i = 'a'; i <= 'z'; ++i)\\n#define Crep(i) for (char i = 'A'; i <= 'Z'; ++i)\\n#define ALL(x) (x).begin(), (x).end()\\n#define rALL(x) (x).rbegin(), (x).rend()\\n#define sort2(A, N) \\\\\\n sort(A, A + N, \\\\\\n [](const pii &a, const pii &b) { return a.second < b.second; });\\n#define debug(v) \\\\\\n cout << #v << \\\":\\\"; \\\\\\n for (auto x : v) { \\\\\\n cout << x << ' '; \\\\\\n } \\\\\\n cout << endl;\\nint ctoi(const char c) {\\n if ('0' <= c && c <= '9') return (c - '0');\\n return -1;\\n}\\nll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }\\nll lcm(ll a, ll b) { return a * b / gcd(a, b); }\\nconstexpr ll MOD = 1000000007;\\nconstexpr ll INF = 1000000011;\\nconstexpr ll MOD2 = 998244353;\\nconstexpr ll LINF = 1001002003004005006ll;\\nconstexpr ld EPS = 10e-10;\\ntemplate <class T, class U>\\ninline bool chmax(T &lhs, const U &rhs) {\\n if (lhs < rhs) {\\n lhs = rhs;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &lhs, const U &rhs) {\\n if (lhs > rhs) {\\n lhs = rhs;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v) {\\n for (auto &&x : v) is >> x;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n is >> p.first;\\n is >> p.second;\\n return is;\\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 <class T>\\nostream &operator<<(ostream &os, vector<T> &v) {\\n for (auto i = begin(v); i != end(v); ++i) {\\n if (i != begin(v)) os << ' ';\\n os << *i;\\n }\\n return os;\\n}\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nstruct 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\\ntemplate <class Cap>\\nstruct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto &_e = g[pos[i].first][pos[i].second];\\n auto &_re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int &i = iter[v]; i < int(g[v].size()); i++) {\\n _edge &e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) return res;\\n }\\n level[v] = _n;\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\nint main() {\\n ll H, W;\\n ll C, D;\\n cin >> H >> W;\\n vvll A(H, vll(W));\\n cin >> A;\\n if (1) {\\n auto B = A;\\n sort(ALL(B));\\n vvll E(H);\\n rep(i, H - 1) {\\n bool Z = 1;\\n rep(j, W) {\\n if (B[i][j] > B[i + 1][j]) {\\n Z = 0;\\n }\\n }\\n if (Z) {\\n E[i + 1].pb(i);\\n rep(j, E[i].size()) { E[i + 1].pb(E[i][j]); }\\n }\\n }\\n mf_graph<ll> mf(2 * H + 2);\\n rep(i, H) {\\n mf.add_edge(2 * H, i, 1);\\n mf.add_edge(H + i, 2 * H + 1, 1);\\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\\n }\\n C = H - mf.flow(2 * H, 2 * H + 1);\\n // cout << C << endl;\\n }\\n if (1) {\\n vvll B(W, vll(H));\\n rep(i, H) {\\n rep(j, W) { B[j][i] = A[i][j]; }\\n }\\n swap(H, W);\\n sort(ALL(B));\\n vvll E(H);\\n rep(i, H - 1) {\\n bool Z = 1;\\n rep(j, W) {\\n if (B[i][j] > B[i + 1][j]) {\\n Z = 0;\\n }\\n }\\n if (Z) {\\n E[i + 1].pb(i);\\n rep(j, E[i].size()) { E[i + 1].pb(E[i][j]); }\\n }\\n }\\n mf_graph<ll> mf(2 * H + 2);\\n rep(i, H) {\\n mf.add_edge(2 * H, i, 1);\\n mf.add_edge(H + i, 2 * H + 1, 1);\\n rep(j, E[i].size()) { mf.add_edge(i, H + E[i][j], 1); }\\n }\\n D = H - mf.flow(2 * H, 2 * H + 1);\\n // cout << D << endl;\\n }\\n if (C == D) {\\n cYES;\\n } else {\\n cNO;\\n }\\n}\",\n \"accuracy\": 0.12162162162162163,\n \"time_ms\": 180,\n \"memory_kb\": 32656,\n \"score_of_the_acc\": -0.6765,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2279_4762347\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 1005\\n#define NUM 2010\\n\\nint H,W;\\nint table[2][SIZE][SIZE];\\nint in_num[SIZE];\\n\\nint V;\\nvector<int> G[NUM];\\nint match[NUM];\\nbool used[NUM];\\n\\nvoid add_edge(int from,int to){\\n\\tG[from].push_back(to);\\n\\tG[to].push_back(from);\\n}\\n\\nint dfs(int node_id){\\n\\tused[node_id] = true;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tint adj_node_id = G[node_id][i],pair_id = match[adj_node_id];\\n\\t\\tif((pair_id < 0)||\\n\\t\\t\\t\\t(used[pair_id] == false && dfs(pair_id) == true)){\\n\\n\\t\\t\\tmatch[node_id] = adj_node_id;\\n\\t\\t\\tmatch[adj_node_id] = node_id;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\n\\n\\nint bipartie_matching(){\\n\\tint ret = 0;\\n\\tfor(int i = 0; i < V; i++)match[i] = -1;\\n\\tfor(int node_id = 0; node_id < V; node_id++){\\n\\t\\tif(match[node_id] < 0){\\n\\t\\t\\tfor(int i = 0; i < V; i++)used[i] = false;\\n\\t\\t\\tif(dfs(node_id)){\\n\\t\\t\\t\\tret++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&H,&W);\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\n\\t\\t\\tscanf(\\\"%d\\\",&table[0][row][col]);\\n\\t\\t\\ttable[1][col][row] = table[0][row][col];\\n\\t\\t}\\n\\t}\\n\\n\\tbool FLG;\\n\\n\\tfor(int i = 0; i < 2; i++){\\n\\n\\t\\tif(H == 1){\\n\\t\\t\\tswap(H,W);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tV = 2*H;\\n\\n\\t\\tfor(int i = 0; i < H; i++){\\n\\n\\t\\t\\tin_num[i] = 0;\\n\\t\\t}\\n\\n\\t\\tfor(int a = 0; a < H; a++){\\n\\t\\t\\tfor(int b = 0; b < H; b++){\\n\\t\\t\\t\\tif(b == a)continue;\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\tfor(int k = 0; k < W; k++){\\n\\t\\t\\t\\t\\tif(table[i][a][k] < table[i][b][k]){\\n\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t\\tadd_edge(a,b+H);\\n\\t\\t\\t\\tin_num[b]++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tint count = 0;\\n\\t\\tfor(int i = 0; i < H; i++){\\n\\n\\t\\t\\tif(in_num[i] > 0)count++;\\n\\t\\t}\\n\\t\\tif(count != H-1){\\n\\n\\t\\t\\tprintf(\\\"NO\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tint num_match = bipartie_matching();\\n\\n\\t\\t//printf(\\\"i:%d num_match:%d\\\\n\\\",i,num_match);\\n\\n\\t\\tif(H-num_match > 2){\\n\\n\\t\\t\\tprintf(\\\"NO\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tfor(int a = 0; a < V; a++){\\n\\n\\t\\t\\tG[a].clear();\\n\\t\\t}\\n\\n\\t\\tswap(H,W);\\n\\t}\\n\\n\\tprintf(\\\"YES\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 820,\n \"memory_kb\": 18240,\n \"score_of_the_acc\": -0.8018,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2279_4762298\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 1000000000000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define SIZE 1005\\n#define NUM 2010\\n\\nint H,W;\\nint table[2][SIZE][SIZE];\\n\\n\\nint V;\\nvector<int> G[NUM];\\nint match[NUM];\\nbool used[NUM];\\n\\nvoid add_edge(int from,int to){\\n\\tG[from].push_back(to);\\n\\tG[to].push_back(from);\\n}\\n\\nint dfs(int node_id){\\n\\tused[node_id] = true;\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\t\\tint adj_node_id = G[node_id][i],pair_id = match[adj_node_id];\\n\\t\\tif((pair_id < 0)||\\n\\t\\t\\t\\t(used[pair_id] == false && dfs(pair_id) == true)){\\n\\n\\t\\t\\tmatch[node_id] = adj_node_id;\\n\\t\\t\\tmatch[adj_node_id] = node_id;\\n\\t\\t\\treturn true;\\n\\t\\t}\\n\\t}\\n\\treturn false;\\n}\\n\\n\\nint bipartie_matching(){\\n\\tint ret = 0;\\n\\tfor(int i = 0; i < V; i++)match[i] = -1;\\n\\tfor(int node_id = 0; node_id < V; node_id++){\\n\\t\\tif(match[node_id] < 0){\\n\\t\\t\\tfor(int i = 0; i < V; i++)used[i] = false;\\n\\t\\t\\tif(dfs(node_id)){\\n\\t\\t\\t\\tret++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&H,&W);\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\n\\t\\t\\tscanf(\\\"%d\\\",&table[0][row][col]);\\n\\t\\t\\ttable[1][col][row] = table[0][row][col];\\n\\t\\t}\\n\\t}\\n\\n\\tbool FLG;\\n\\n\\tfor(int i = 0; i < 2; i++){\\n\\n\\t\\tif(H == 1){\\n\\t\\t\\tswap(H,W);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tV = 2*H;\\n\\n\\t\\tint maximum = 0;\\n\\n\\t\\tfor(int a = 0; a < H; a++){\\n\\t\\t\\tfor(int b = 0; b < H; b++){\\n\\t\\t\\t\\tif(b == a)continue;\\n\\n\\t\\t\\t\\tFLG = true;\\n\\t\\t\\t\\tfor(int k = 0; k < W; k++){\\n\\t\\t\\t\\t\\tif(table[i][a][k] < table[i][b][k]){\\n\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t\\tadd_edge(a,b+H);\\n\\t\\t\\t}\\n\\t\\t\\tmaximum = max(maximum,(int)G[a].size());\\n\\t\\t}\\n\\n\\t\\tif(maximum < H-1){\\n\\n\\t\\t\\tprintf(\\\"NO\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tint num_match = bipartie_matching();\\n\\n\\t\\t//printf(\\\"i:%d num_match:%d\\\\n\\\",i,num_match);\\n\\n\\t\\tif(H-num_match > 2){\\n\\n\\t\\t\\tprintf(\\\"NO\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\n\\t\\tfor(int a = 0; a < V; a++){\\n\\n\\t\\t\\tG[a].clear();\\n\\t\\t}\\n\\n\\t\\tswap(H,W);\\n\\t}\\n\\n\\tprintf(\\\"YES\\\\n\\\");\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 860,\n \"memory_kb\": 18088,\n \"score_of_the_acc\": -0.8283,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2279_4501167\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\n#define rrep(i,n) for (int i = (n)-1; i >= 0; i--)\\n#define rep2(i,s,n) for (int i = (s); i < (n); ++i)\\n#define all(a) a.begin(),a.end()\\n#define rall(a) a.rbegin(),a.rend()\\n#define pb push_back\\n#define eb emplace_back\\n#define vi vector<int>\\n#define vvi vector<vector<int>>\\n#define vl vector<ll>\\n#define vvl vector<vector<ll>>\\n#define vd vector<double>\\n#define vs vector<string>\\n#define vc vector<char>\\n#define vb vector<bool>\\n#define vp vector<P>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int,int>;\\nusing LP = pair<ll,ll>;\\ntemplate<class T> istream& operator>>(istream& is,vector<T>& v) { for(T& t:v){is>>t;} return is; }\\ntemplate<class T> ostream& operator<<(ostream& os,const vector<T>& v) { for(T t:v){os<<t<<\\\" \\\";} os<<\\\"\\\\n\\\"; return os; }\\nvoid Yes(bool b) { cout << (b ? \\\"Yes\\\" : \\\"No\\\") << endl; }\\nvoid YES(bool b) { cout << (b ? \\\"YES\\\" : \\\"NO\\\") << endl; }\\ntemplate<class T> inline bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}\\ntemplate<class T> inline bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}\\nconst int inf = 1001001001;\\nconst ll linf = 1001001001001001001;\\n\\nclass Bipartite_matching {\\n int n;\\n vvi G;\\n vi match;\\n vb used;\\n bool dfs(int v) {\\n used[v] = true;\\n for(int u : G[v]) {\\n int w = match[u];\\n if(w < 0 || !used[w] && dfs(w)) {\\n match[v] = u;\\n match[u] = v;\\n return true;\\n }\\n }\\n return false;\\n }\\n\\npublic:\\n Bipartite_matching(int n):n(n),G(n),match(n),used(n) {}\\n void add_edge(int v,int u) {\\n G[v].pb(u);\\n G[u].pb(v);\\n }\\n int max_matching() {\\n int res = 0;\\n match.assign(n,-1);\\n rep(i,n) {\\n if(match[i] >= 0) continue;\\n used.assign(n,false);\\n if(dfs(i)) res++;\\n }\\n return res;\\n }\\n};\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr); cout.tie(nullptr);\\n int H,W;\\n cin >> H >> W;\\n vvi h(H,vi(W));\\n cin >> h;\\n rep(_,2) {\\n Bipartite_matching bp(2*H);\\n vb v(H,true);\\n rep(i,H) rep(j,H) {\\n if(i == j) continue;\\n bool ok = true;\\n rep(k,W) if(h[i][k] > h[j][k]) ok = false;\\n if(ok) bp.add_edge(i,j+H);\\n else v[j] = false;\\n }\\n bool flag = false;\\n rep(i,H) if(v[i]) flag = true;\\n if(!flag) {\\n YES(false);\\n return 0;\\n }\\n if(H-bp.max_matching() > 2) {\\n YES(false);\\n return 0;\\n }\\n vvi nh(W,vi(H));\\n rep(i,H) rep(j,W) nh[j][i] = h[i][j];\\n swap(H,W);\\n swap(h,nh);\\n }\\n YES(true);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1400,\n \"memory_kb\": 16272,\n \"score_of_the_acc\": -1.1921,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":1270,"cells":{"group_id":{"kind":"string","value":"aoj_2285_cpp"},"problem_description":{"kind":"string","value":"Problem E: アニペロ\n猛暑が続いた、長かったようで短かったような夏がもうすぐ終わろうとしていた。\nそんな8月下旬のある日、とある2D好きな人物とその先輩のslipは、アニペロサマーライブ、通称アニペロと呼ばれるイベントに参加していた。\nアニペロとは、さまざまなアニメソングアーティストたちが集結する、日本国内最大のアニメソングライブイベントである。\n今年のアニペロは、公式で公表されていたアーティストの他に、シークレットで超豪華歌手も出演し、大盛況の内に幕を閉じた。\nアニペロには初参戦だった2D好きな彼は、ライブ後の余韻にひたりつつも、ひとつの疑問を抱えていた。\n「アニペロに出演するアーティストはどのように決めているのだろうか？」\n彼は、数あるアーティストの中から、出演アーティストの選出をするのに、次のような方法があるのではないかと、選出法を考えてみた。\nまず、アニペロのアーティストには、シークレットアーティストとスタンダードアーティストの2種類の分類があるものとする。\nシークレットアーティストとは、ライブに出演することを事前公表せず、ライブ本番になって突然現れるアーティストのことを指す。\nスタンダードアーティストとは、ライブに出演することを事前に公表してよいアーティストのことを指す。\n全てのアーティストは、次のステータスを持つ。\nアーティスト名：文字列\nアーティストを雇うための金額（以下、雇用金と呼ぶ）：自然数\nこのアーティストが出演することで、お客をどれほど満足させられるか（以下、満足度と呼ぶ）：自然数\n今回、ライブに出演するアーティストを選ぶために、シークレットアーティスト候補\nN\n人、スタンダードアーティスト候補\nM\n人が、すでに用意されているものとする。さらに、ライブの主催者は、アーティストを雇用するために使用できる資金\nLIMIT\nを持っているものとする。\n主催者は、次の条件を満たすように、アーティストを選出しなければならない。\nN\n人のシークレットアーティスト枠から、1人以上、2人以下を選出する(1人or2人なのは、シークレットがいなかったり多かったりすることを避けるためである)\nM\n人のスタンダードアーティスト枠から、\nX\n人以上のアーティストを選出する\nアーティストを全て選出し終えたとき、雇用金の合計を、\nLIMIT\n以下にする\n選出したアーティスト全員で得られる満足度の合計を最大化する\nさて、ここまで選出法を考えた2D好きな彼は、この方法でプログラムを書いてみようと思った。しかし、彼は選出法を考えるのに気力を使ってしまい、プログラムを書く気力がなくなってしまったようなので、彼の代わりにプログラムを書いてあげてほしい。\nあなたの仕事は、上記の選出法に従い、アーティストを選出したときのお客の最大満足度を出力するプログラムを作成することである。\nInput\n入力は、複数のデータセットからなる。データセットの総数は20以下である。\n各データセットは、次の形をしている。\nLIMIT\nN\nM\nX\nSEC_NAME\n1\nSEC_E\n1\nSEC_S\n1\n...\nSEC_NAME\ni\nSEC_E\ni\nSEC_S\ni\n...\nSEC_NAME\nN\nSEC_E\nN\nSEC_S\nN\nNAME\n1\nE\n1\nS\n1\n...\nNAME\ni\nE\ni\nS\ni\n...\nNAME\nM\nE\nM\nS\nM\n整数\nLIMIT\n(\n4 ≤\nLIMIT\n≤ 1000\n)、\nN\n(\n2 ≤ N ≤ 100\n)、\nM\n(\n2 ≤ M ≤ 100\n)、\nX\n(\n2 ≤ X ≤ M\n)は、\nそれぞれアーティストを雇用するのに使用できる資金、シークレットアーティスト候補の数、スタンダードアーティスト候補の数、スタンダードアーティストから選出しなければならない最低人数を表す。\nSEC_NAME\ni\n、\nNAME\ni\n、はそれぞれシークレットアーティスト候補、スタンダードアーティスト候補の名前を指す30文字以下の文字列である。\n文字列には、アルファベット('A'-'Z', 'a'-'z')のみが使用される。\n同じアーティスト名が2回以上出現することはない。\n整数\nSEC_E\ni\n、\nE\ni\n(\n1 ≤\nSEC_E\ni\n,\nE\ni\n≤ 10\n)、\nSEC_S\ni\n、\nS\ni\n(\n1 ≤\nSEC_S\ni\n,\nS\ni\n≤ 10\n) は、それぞれシークレットアーティスト候補の雇用金、スタンダードアーティスト候補の雇用金、シークレットアーティスト候補が出演したときに得られる満足度、スタンダードアーティスト候補が出演したときに得られる満足度を表す。\n入力の終了は、0が4つの行で示される。このデータについては処理する必要はない。\nOutput\n選出法を適用してアーティストを選出したとき、お客の満足度の最大値を出力せよ。\nアーティストの選出の仕方は、必ずあると仮定してよい。\nSample Input\n100 2 2 2\nA 5 6\nB 7 8\nC 1 2\nD 3 4\n27 2 3 3\nA 8 10\nB 8 10\nC 6 7\nD 5 4\nE 8 9\n27 2 3 2\nA 8 10\nB 8 10\nC 6 7\nD 5 4\nE 8 9\n44 3 6 5\nYamatoNoHito 9 10\nZettoNoHito 9 10\nTMR 10 10\nSkillNoGroup 8 10\nNanaSama 6 9\nFRPSD 6 8\nMagi3rdDeshi 5 7\nMagi13thDeshi 2 2\nMagicalItoh 4 6\n0 0 0 0\nOutput for Sample Input\n20\n30\n31\n55"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2285_9658651","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define N 110\n\nint limit, n, m, x;\nint e1[N], s1[N];\nint e2[N], s2[N];\nint dp[1010][N][N];\nint ep[1010];\n\nint main(){\n\twhile (1){\n\t\tcin >> limit >> n >> m >> x;\n\t\tif (limit == 0 && n == 0 && m == 0 && x == 0) break;\n\t\tstring name;\n\t\tfor (int i = 1; i <= n; i++) cin >> name >> e1[i] >> s1[i];\n\t\tfor (int i = 1; i <= m; i++) cin >> name >> e2[i] >> s2[i];\n\t\tfor (int i = 0; i <= 1000; i++){\n\t\t\tfor (int j = 0; j <= m; j++){\n\t\t\t\tfor (int k = 0; k <= m; k++) dp[i][j][k] = -1e9;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i <= 1000; i++) {\n\t\t\tfor (int j = 0; j <= m; j++) dp[i][j][0] = 0;\n\t\t}\n\t\tfor (int i = 1; i <= 1000; i++){\n\t\t\tfor (int j = 1; j <= m; j++){\n\t\t\t\tfor (int k = 1; k <= j; k++){\n\t\t\t\t\tdp[i][j][k] = dp[i][j - 1][k];\n\t\t\t\t\tif (i >= e2[j]) dp[i][j][k] = max(dp[i][j][k], dp[i - e2[j]][j - 1][k - 1] + s2[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= 1000; i++){\n\t\t\tep[i] = 0;\n\t\t\tfor (int k = x; k <= m; k++) ep[i] = max(ep[i], dp[i][m][k]);\n\t\t}\n\t\tint ans = 0;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tif (limit >= e1[i]) ans = max(ans, s1[i] + ep[limit - e1[i]]);\n\t\t}\n\t\tfor (int i = 1; i <= n; i++){\n\t\t\tfor (int j = i + 1; j <= n; j++){\n\t\t\t\tif (limit >= e1[i] + e1[j]) ans = max(ans, s1[i] + s1[j] + ep[limit - e1[i] - e1[j]]);\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\t\n}","accuracy":1,"time_ms":30,"memory_kb":50680,"score_of_the_acc":-1.0699,"final_rank":17},{"submission_id":"aoj_2285_5033123","code_snippet":"#line 2 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#include <bits/stdc++.h>\n#line 4 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n#include <string_view>\n#line 7 \"/home/yuruhiya/programming/library/template/constants.cpp\"\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\n#define unless(c) if (!(c))\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\n\nusing namespace std;\nusing ll = long long;\nusing LD = long double;\nusing VB = vector<bool>;\nusing VVB = vector<VB>;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VS = vector<string>;\nusing VD = vector<LD>;\nusing PII = pair<int, int>;\nusing VP = vector<PII>;\nusing PLL = pair<ll, ll>;\nusing VPL = vector<PLL>;\ntemplate <class T> using PQ = priority_queue<T>;\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\nconstexpr int inf = 1000000000;\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\nnamespace CharacterClass {\n\tconstexpr string_view\n\t digit = \"0123456789\",\n\t xdigit = \"0123456789ABCDEFabcdef\", lower = \"abcdefghijklmnopqrstuvwxyz\",\n\t upper = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\n\t alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t alnum = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\",\n\t word = \"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\",\n\t punct = R\"(!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~)\",\n\t graph =\n\t R\"(!\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t print =\n\t R\"( !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\",\n\t blank = \" \\t\", space = \" \\t\\n\\r\\f\\v\";\n} // namespace CharacterClass\n#line 7 \"/home/yuruhiya/programming/library/template/Input.cpp\"\nusing namespace std;\n\n#ifdef _WIN32\n#define getchar_unlocked _getchar_nolock\n#define putchar_unlocked _putchar_nolock\n#define fwrite_unlocked fwrite\n#define fflush_unlocked fflush\n#endif\nclass Scanner {\n\tstatic int gc() {\n\t\treturn getchar_unlocked();\n\t}\n\tstatic char next_char() {\n\t\tchar c;\n\t\tread(c);\n\t\treturn c;\n\t}\n\ttemplate <class T> static void read(T& v) {\n\t\tcin >> v;\n\t}\n\tstatic void read(char& v) {\n\t\twhile (isspace(v = gc()))\n\t\t\t;\n\t}\n\tstatic void read(bool& v) {\n\t\tv = next_char() != '0';\n\t}\n\tstatic void read(string& v) {\n\t\tv.clear();\n\t\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\n\t}\n\tstatic void read(int& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long long& v) {\n\t\tv = 0;\n\t\tbool neg = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(double& v) {\n\t\tv = 0;\n\t\tdouble dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\tstatic void read(long double& v) {\n\t\tv = 0;\n\t\tlong double dp = 1;\n\t\tbool neg = false, after_dp = false;\n\t\tchar c = next_char();\n\t\tif (c == '-') {\n\t\t\tneg = true;\n\t\t\tc = gc();\n\t\t}\n\t\tfor (; isdigit(c) || c == '.'; c = gc()) {\n\t\t\tif (c == '.') {\n\t\t\t\tafter_dp = true;\n\t\t\t} else if (after_dp) {\n\t\t\t\tv += (c - '0') * (dp *= 0.1);\n\t\t\t} else {\n\t\t\t\tv = v * 10 + (c - '0');\n\t\t\t}\n\t\t}\n\t\tif (neg) v = -v;\n\t}\n\ttemplate <class T, class U> static void read(pair<T, U>& v) {\n\t\tread(v.first);\n\t\tread(v.second);\n\t}\n\ttemplate <class T> static void read(vector<T>& v) {\n\t\tfor (auto& e : v) read(e);\n\t}\n\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tread(get<N>(v));\n\t\t\tread_tuple_impl<N + 1>(v);\n\t\t}\n\t}\n\ttemplate <class... T> static void read(tuple<T...>& v) {\n\t\tread_tuple_impl(v);\n\t}\n\tstruct ReadVectorHelper {\n\t\tsize_t n;\n\t\tReadVectorHelper(size_t _n) : n(_n) {}\n\t\ttemplate <class T> operator vector<T>() {\n\t\t\tvector<T> v(n);\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\tstruct Read2DVectorHelper {\n\t\tsize_t n, m;\n\t\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\n\t\ttemplate <class T> operator vector<vector<T>>() {\n\t\t\tvector<vector<T>> v(n, vector<T>(m));\n\t\t\tread(v);\n\t\t\treturn v;\n\t\t}\n\t};\n\npublic:\n\tstring read_line() const {\n\t\tstring v;\n\t\tfor (char c = gc(); c != '\\n' && c != '\\0'; c = gc()) v += c;\n\t\treturn v;\n\t}\n\ttemplate <class T> T read() const {\n\t\tT v;\n\t\tread(v);\n\t\treturn v;\n\t}\n\ttemplate <class T> vector<T> read_vector(size_t n) const {\n\t\tvector<T> a(n);\n\t\tread(a);\n\t\treturn a;\n\t}\n\ttemplate <class T> operator T() const {\n\t\treturn read<T>();\n\t}\n\tint operator--(int) const {\n\t\treturn read<int>() - 1;\n\t}\n\tReadVectorHelper operator[](size_t n) const {\n\t\treturn ReadVectorHelper(n);\n\t}\n\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\n\t\treturn Read2DVectorHelper(nm);\n\t}\n\tvoid operator()() const {}\n\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\n\t\tread(h);\n\t\toperator()(forward<T>(t)...);\n\t}\n\nprivate:\n\ttemplate <template <class...> class, class...> struct Multiple;\n\ttemplate <template <class...> class V, class Head, class... Tail>\n\tstruct Multiple<V, Head, Tail...> {\n\t\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\n\t\tusing type = typename Multiple<vec, Tail...>::type;\n\t};\n\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\n\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\n\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\n\t\tif constexpr (N < tuple_size_v<T>) {\n\t\t\tauto& vec = get<N>(t);\n\t\t\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\n\t\t\tvec.push_back(read<V>());\n\t\t\tmultiple_impl<N + 1>(t);\n\t\t}\n\t}\n\npublic:\n\ttemplate <class... T> auto multiple(size_t h) const {\n\t\tmultiple_t<T...> result;\n\t\twhile (h--) multiple_impl(result);\n\t\treturn result;\n\t}\n} in;\n#define inputs(T, ...) \\\n\tT __VA_ARGS__; \\\n\tin(__VA_ARGS__)\n#define ini(...) inputs(int, __VA_ARGS__)\n#define inl(...) inputs(long long, __VA_ARGS__)\n#define ins(...) inputs(string, __VA_ARGS__)\n#line 7 \"/home/yuruhiya/programming/library/template/Output.cpp\"\n#include <charconv>\n#line 10 \"/home/yuruhiya/programming/library/template/Output.cpp\"\nusing namespace std;\n\nstruct BoolStr {\n\tconst char *t, *f;\n\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\n} Yes(\"Yes\", \"No\"), yes(\"yes\", \"no\"), YES(\"YES\", \"NO\"), Int(\"1\", \"0\");\nstruct DivStr {\n\tconst char *d, *l;\n\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\n} spc(\" \", \"\\n\"), no_spc(\"\", \"\\n\"), end_line(\"\\n\", \"\\n\"), comma(\",\", \"\\n\"),\n no_endl(\" \", \"\");\nclass Output {\n\tBoolStr B{Yes};\n\tDivStr D{spc};\n\npublic:\n\tvoid put(int v) const {\n\t\tchar buf[12]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(long long v) const {\n\t\tchar buf[21]{};\n\t\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\n\t\t\tfwrite(buf, sizeof(char), ptr - buf, stdout);\n\t\t} else {\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid put(bool v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(vector<bool>::reference v) const {\n\t\tput(v ? B.t : B.f);\n\t}\n\tvoid put(char v) const {\n\t\tputchar_unlocked(v);\n\t}\n\tvoid put(const char* v) const {\n\t\tfwrite_unlocked(v, 1, strlen(v), stdout);\n\t}\n\tvoid put(double v) const {\n\t\tprintf(\"%.20f\", v);\n\t}\n\tvoid put(long double v) const {\n\t\tprintf(\"%.20Lf\", v);\n\t}\n\ttemplate <class T> void put(const T& v) const {\n\t\tcout << v;\n\t}\n\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\n\t\tput(v.first);\n\t\tput(D.d);\n\t\tput(v.second);\n\t}\n\ttemplate <class InputIterater>\n\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\n\t\tfor (InputIterater i = begin; i != end; ++i) {\n\t\t\tif (i != begin) put(D.d);\n\t\t\tput(*i);\n\t\t}\n\t}\n\ttemplate <class T> void put(const vector<T>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\n\t\tput_range(v.begin(), v.end());\n\t}\n\ttemplate <class T> void put(const vector<vector<T>>& v) const {\n\t\tfor (size_t i = 0; i < v.size(); ++i) {\n\t\t\tif (i) put(D.l);\n\t\t\tput(v[i]);\n\t\t}\n\t}\n\n\tOutput() = default;\n\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\n\tOutput& operator()() {\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H> Output& operator()(H&& h) {\n\t\tput(h);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\n\t\tput(h);\n\t\tput(D.d);\n\t\treturn operator()(forward<T>(t)...);\n\t}\n\ttemplate <class InputIterator>\n\tOutput& range(const InputIterator& begin, const InputIterator& end) {\n\t\tput_range(begin, end);\n\t\tput(D.l);\n\t\treturn *this;\n\t}\n\ttemplate <class T> Output& range(const T& a) {\n\t\trange(a.begin(), a.end());\n\t\treturn *this;\n\t}\n\ttemplate <class... T> void exit(T&&... t) {\n\t\toperator()(forward<T>(t)...);\n\t\tstd::exit(EXIT_SUCCESS);\n\t}\n\tOutput& flush() {\n\t\tfflush_unlocked(stdout);\n\t\treturn *this;\n\t}\n\tOutput& set(const BoolStr& b) {\n\t\tB = b;\n\t\treturn *this;\n\t}\n\tOutput& set(const DivStr& d) {\n\t\tD = d;\n\t\treturn *this;\n\t}\n\tOutput& set(const char* t, const char* f) {\n\t\tB = BoolStr(t, f);\n\t\treturn *this;\n\t}\n} out;\n#line 3 \"/home/yuruhiya/programming/library/template/Step.cpp\"\nusing namespace std;\n\ntemplate <class T> struct Step {\n\tusing value_type = T;\n\n\tclass iterator {\n\t\tvalue_type a, b, c;\n\n\tpublic:\n\t\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\n\t\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\n\t\t : a(_b), b(_c), c(_s) {}\n\t\tconstexpr iterator& operator++() {\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn *this;\n\t\t}\n\t\tconstexpr iterator operator++(int) {\n\t\t\titerator tmp = *this;\n\t\t\t--b;\n\t\t\ta += c;\n\t\t\treturn tmp;\n\t\t}\n\t\tconstexpr const value_type& operator*() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr const value_type* operator->() const {\n\t\t\treturn &a;\n\t\t}\n\t\tconstexpr bool operator==(const iterator& i) const {\n\t\t\treturn b == i.b;\n\t\t}\n\t\tconstexpr bool operator!=(const iterator& i) const {\n\t\t\treturn !(b == i.b);\n\t\t}\n\t\tconstexpr value_type start() const {\n\t\t\treturn a;\n\t\t}\n\t\tconstexpr value_type size() const {\n\t\t\treturn b;\n\t\t}\n\t\tconstexpr value_type step() const {\n\t\t\treturn c;\n\t\t}\n\t};\n\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\n\tconstexpr iterator begin() const {\n\t\treturn be;\n\t}\n\tconstexpr iterator end() const {\n\t\treturn en;\n\t}\n\tconstexpr value_type start() const {\n\t\treturn be.start();\n\t}\n\tconstexpr value_type size() const {\n\t\treturn be.size();\n\t}\n\tconstexpr value_type step() const {\n\t\treturn be.step();\n\t}\n\tconstexpr value_type sum() const {\n\t\treturn start() * size() + step() * (size() * (size() - 1) / 2);\n\t}\n\toperator vector<value_type>() const {\n\t\treturn to_a();\n\t}\n\tauto to_a() const {\n\t\tvector<value_type> result;\n\t\tresult.reserve(size());\n\t\tfor (auto i : *this) {\n\t\t\tresult.push_back(i);\n\t\t}\n\t\treturn result;\n\t}\n\nprivate:\n\titerator be, en;\n};\ntemplate <class T> constexpr auto step(T a) {\n\treturn Step<T>(0, a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b) {\n\treturn Step<T>(a, b - a, 1);\n}\ntemplate <class T> constexpr auto step(T a, T b, T c) {\n\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\n}\n#line 8 \"/home/yuruhiya/programming/library/template/Ruby.cpp\"\nusing namespace std;\n\ntemplate <class F> struct Callable {\n\tF func;\n\tCallable(const F& f) : func(f) {}\n};\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\n\treturn c.func(v);\n}\n\nstruct Sort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\treturn v;\n\t}\n} Sort;\nstruct SortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} SortBy;\nstruct RSort_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(rbegin(v), rend(v), f);\n\t\t\treturn v;\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\n\t\tsort(rbegin(v), rend(v));\n\t\treturn v;\n\t}\n} RSort;\nstruct RSortBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tsort(begin(v), end(v),\n\t\t\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\n\t\t\treturn v;\n\t\t});\n\t}\n} RSortBy;\nstruct Reverse_impl {\n\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\n\t\treverse(begin(v), end(v));\n\t\treturn v;\n\t}\n} Reverse;\nstruct Unique_impl {\n\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\n\t\tv.erase(unique(begin(v), end(v), end(v)));\n\t\treturn v;\n\t}\n} Unique;\nstruct Uniq_impl {\n\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\n\t\tsort(begin(v), end(v));\n\t\tv.erase(unique(begin(v), end(v)), end(v));\n\t\treturn v;\n\t}\n} Uniq;\nstruct Rotate_impl {\n\tauto operator()(int&& left) {\n\t\treturn Callable([&](auto v) {\n\t\t\tint s = static_cast<int>(size(v));\n\t\t\tassert(-s <= left && left <= s);\n\t\t\tif (0 <= left) {\n\t\t\t\trotate(begin(v), begin(v) + left, end(v));\n\t\t\t} else {\n\t\t\t\trotate(begin(v), end(v) + left, end(v));\n\t\t\t}\n\t\t\treturn v;\n\t\t});\n\t}\n} Rotate;\nstruct Max_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\n\t\treturn *max_element(begin(v), end(v));\n\t}\n} Max;\nstruct Min_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\n\t\treturn *min_element(begin(v), end(v));\n\t}\n} Min;\nstruct MaxPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\n\t\treturn max_element(begin(v), end(v)) - begin(v);\n\t}\n} MaxPos;\nstruct MinPos_impl {\n\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\n\t\treturn min_element(begin(v), end(v)) - begin(v);\n\t}\n} MinPos;\nstruct MaxBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_it = begin(v);\n\t\t\tauto max_val = f(*max_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_it = it;\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *max_it;\n\t\t});\n\t}\n} MaxBy;\nstruct MinBy_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_it = begin(v);\n\t\t\tauto min_val = f(*min_it);\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_it = it;\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn *min_it;\n\t\t});\n\t}\n} MinBy;\nstruct MaxOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto max_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); max_val < val) {\n\t\t\t\t\tmax_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn max_val;\n\t\t});\n\t}\n} MaxOf;\nstruct MinOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tauto min_val = f(*begin(v));\n\t\t\tfor (auto it = next(begin(v)); it != end(v); ++it) {\n\t\t\t\tif (auto val = f(*it); min_val > val) {\n\t\t\t\t\tmin_val = val;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn min_val;\n\t\t});\n\t}\n} MinOf;\nstruct Count_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\n\t}\n} Count;\nstruct CountIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\n\t}\n} CountIf;\nstruct Index_impl {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find(begin(v), end(v), val);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} Index;\nstruct IndexIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<int> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\n\t\t});\n\t}\n} IndexIf;\nstruct FindIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\n\t\t\tauto result = find_if(begin(v), end(v), f);\n\t\t\treturn result != end(v) ? optional(*result) : nullopt;\n\t\t});\n\t}\n} FindIf;\nstruct Sum_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\n\t\t\t [&](const auto& a, const auto& b) { return a + f(b); });\n\t\t});\n\t}\n\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\n\t\treturn accumulate(begin(v), end(v), typename T::value_type{});\n\t}\n} Sum;\nstruct Includes {\n\ttemplate <class V> auto operator()(const V& val) {\n\t\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\n\t}\n} Includes;\nstruct IncludesIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\n\t}\n} IncludesIf;\nstruct RemoveIf_impl {\n\ttemplate <class F> auto operator()(const F& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tv.erase(remove_if(begin(v), end(v), f), end(v));\n\t\t\treturn v;\n\t\t});\n\t}\n} RemoveIf;\nstruct Each_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tf(i);\n\t\t\t}\n\t\t});\n\t}\n} Each;\nstruct Select_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing value_type = typename decltype(v)::value_type;\n\t\t\tvector<value_type> result;\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) result.push_back(i);\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Select;\nstruct Map_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\n\t\t\tvector<result_type> result;\n\t\t\tresult.reserve(size(v));\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult.push_back(f(i));\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n} Map;\nstruct Indexed_impl {\n\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\n\t\tusing value_type = typename T::value_type;\n\t\tvector<pair<value_type, int>> result;\n\t\tresult.reserve(size(v));\n\t\tint index = 0;\n\t\tfor (const auto& i : v) {\n\t\t\tresult.emplace_back(i, index++);\n\t\t}\n\t\treturn result;\n\t}\n} Indexed;\nstruct AllOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (!f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} AllOf;\nstruct AnyOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return true;\n\t\t\t}\n\t\t\treturn false;\n\t\t});\n\t}\n} AnyOf;\nstruct NoneOf_impl {\n\ttemplate <class F> auto operator()(F&& f) {\n\t\treturn Callable([&](auto v) {\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tif (f(i)) return false;\n\t\t\t}\n\t\t\treturn true;\n\t\t});\n\t}\n} NoneOf;\n\nstruct Tally_impl {\n\ttemplate <class F> auto operator()(size_t max_val) {\n\t\treturn Callable([&](auto v) {\n\t\t\tvector<size_t> result(max_val);\n\t\t\tfor (const auto& i : v) {\n\t\t\t\tresult[static_cast<size_t>(i)]++;\n\t\t\t}\n\t\t\treturn result;\n\t\t});\n\t}\n\ttemplate <class T, class value_type = typename T::value_type>\n\tfriend auto operator|(const T& v, Tally_impl& c) {\n\t\tmap<value_type, size_t> result;\n\t\tfor (const auto& i : v) {\n\t\t\tresult[i]++;\n\t\t}\n\t\treturn result;\n\t}\n} Tally;\n\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\n\tT result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult.insert(result.end(), a.begin(), a.end());\n\t}\n\treturn result;\n}\nauto operator*(string a, size_t n) {\n\tstring result;\n\tfor (size_t i = 0; i < n; ++i) {\n\t\tresult += a;\n\t}\n\treturn result;\n}\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T> auto& operator<<(string& a, const T& b) {\n\ta.insert(a.end(), all(b));\n\treturn a;\n}\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\n\ta << b;\n\treturn a;\n}\ntemplate <class T> auto operator+(string a, const T& b) {\n\ta << b;\n\treturn a;\n}\n#line 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 9 \"/home/yuruhiya/programming/library/template/template.cpp\"\n#if __has_include(<library/dump.hpp>)\n#include <library/dump.hpp>\n#define LOCAL\n#else\n#define dump(...) ((void)0)\n#endif\n\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\n#ifndef LOCAL\n\treturn oj;\n#else\n\treturn local;\n#endif\n}\n#line 2 \"a.cpp\"\n\nint solve(int limit, int n, int m, int x) {\n\tauto [s_name, s_weight, s_value] = in.multiple<string, int, int>(n);\n\tauto [name, weight, value] = in.multiple<string, int, int>(m);\n\n\tauto dp = make_vector<int>({m + 1, limit + 1}, -1);\n\trep(i, limit + 1) dp[0][i] = 0;\n\trep(i, m) {\n\t\tauto dp2 = dp;\n\t\trep(j, m + 1) rep(k, limit) {\n\t\t\tif (j < m && k + weight[i] <= limit && dp[j][k] != -1) {\n\t\t\t\tchmax(dp2[j + 1][k + weight[i]], dp[j][k] + value[i]);\n\t\t\t}\n\t\t\tchmax(dp2[j][k + 1], dp2[j][k]);\n\t\t}\n\t\tdp = dp2;\n\t}\n\n\tint ans = 0;\n\tauto update = [&](int val, int wei) {\n\t\tFOR(i, x, m + 1) {\n\t\t\tif (limit - wei >= 0) {\n\t\t\t\tchmax(ans, dp[i][limit - wei] + val);\n\t\t\t}\n\t\t}\n\t};\n\trep(i, n) {\n\t\tupdate(s_value[i], s_weight[i]);\n\t}\n\trep(i, n) FOR(j, i + 1, n) {\n\t\tupdate(s_value[i] + s_value[j], s_weight[i] + s_weight[j]);\n\t}\n\treturn ans;\n}\n\nint main() {\n\twhile (true) {\n\t\tini(limit, n, m, x);\n\t\tif (n == 0) break;\n\t\tout(solve(limit, n, m, x));\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":3644,"score_of_the_acc":-0.1685,"final_rank":12},{"submission_id":"aoj_2285_3341687","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<((x))<<endl\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\"(\"<<p.fi<<\",\"<<p.se<<\")\";return o;}\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\"[\";for(T t:v){o<<t<<\",\";}o<<\"]\";return o;}\n\nstruct artist{\n int cost;\n int val;\n\n void READ(){\n char name[33];\n scanf(\" %s %d %d\", name, &cost, &val);\n }\n};\n\nconst int M = 111;\nconst int L = 1001;\nconst int INF = 10101010;\n\nint dp[M][M][L];\nint mx[L];\n\nint main(){\n int lim,n,m,x;\n while(scanf(\" %d %d %d %d\", &lim, &n, &m, &x),lim){\n vector<artist> a(n),b(m);\n rep(i,n) a[i].READ();\n rep(i,m) b[i].READ();\n\n rep(i,M)rep(j,M)rep(k,L) dp[i][j][k] = -INF;\n dp[0][0][0] = 0;\n rep(i,m)rep(j,i+1)rep(k,L)if(dp[i][j][k]>=0){\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]);\n\n int nk = k+b[i].cost;\n if(nk<L) dp[i+1][j+1][nk] = max(dp[i+1][j+1][nk], dp[i][j][k]+b[i].val);\n }\n\n rep(i,L) mx[i] = -INF;\n for(int i=x; i<=m; ++i)rep(j,L) mx[j] = max(mx[j], dp[m][i][j]);\n rep(i,L-1) mx[i+1] = max(mx[i+1],mx[i]);\n\n int ans = -INF;\n rep(i,n){\n int rem = lim-a[i].cost;\n if(rem<0) continue;\n ans = max(ans, a[i].val+mx[rem]);\n\n rep(j,n)if(i!=j){\n int rr = rem-a[j].cost;\n if(rr<0) continue;\n ans = max(ans, a[i].val+a[j].val+mx[rr]);\n }\n }\n printf(\"%d\\n\", ans);\n }\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":51352,"score_of_the_acc":-1.6667,"final_rank":19},{"submission_id":"aoj_2285_2890938","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n\nint limit,n,m,x;\n\nint a[111],b[111],c[111],d[111];\nstring damy;\nint dp[1111][111];\nbool used[1111][111];\nint MAX[1111];\n\nvoid Input(){\n rep(i,m){\n cin>>damy>>c[i]>>d[i];\n }\n rep(i,n){\n cin>>damy>>a[i]>>b[i];\n }\n}\n\nvoid init(){\n memset(MAX,0,sizeof(MAX));\n memset(dp,0,sizeof(dp));\n memset(used,0,sizeof(used));\n}\n\nvoid DP(){\n used[0][0]=1;\n for(int k=0;k<n;k++){\n for(int i=limit;i>=0;i--){\n for(int j=n;j>=0;j--){\n\tif(used[i][j]){\n\t if(i+a[k]<=limit){\n\t used[i+a[k]][j+1]=1;\n\t dp[i+a[k]][j+1]=max(dp[i+a[k]][j+1],dp[i][j]+b[k]);\n\t }\n\t}\n }\n }\n }\n\n for(int i=0;i<=limit;i++){\n for(int j=x;j<=n;j++){\n MAX[i]=max(MAX[i],dp[i][j]);\n }\n }\n\n int ans=0;\n\n for(int i=0;i<m;i++){\n for(int j=i+1;j<m;j++){\n for(int k=0;k<limit;k++){\n\tif(k+c[i]+c[j]>limit)break;\n\tans=max(ans,MAX[k]+d[i]+d[j]);\n }\n }\n }\n\n for(int i=0;i<m;i++){\n for(int k=0;k<limit;k++){\n if(k+c[i]>limit)break;\n ans=max(ans,MAX[k]+d[i]);\n }\n }\n\n cout << ans << endl;\n \n}\n\n\nint main(){\n while( cin>>limit>>m>>n>>x,limit){\n Input();\n init();\n DP();\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3612,"score_of_the_acc":-0.0846,"final_rank":8},{"submission_id":"aoj_2285_2890891","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nInt dp[111][1111];\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;}\nsigned main(){ \n cin.tie(0);\n ios::sync_with_stdio(0);\n Int l,n,m,x;\n while(cin>>l>>n>>m>>x,l){\n string st;\n vector<Int> se(n),ss(n);\n vector<Int> e(m),s(m);\n for(Int i=0;i<n;i++) cin>>st>>se[i]>>ss[i];\n for(Int i=0;i<m;i++) cin>>st>>e[i]>>s[i];\n \n const Int INF = 1e9;\n for(Int i=0;i<111;i++)\n for(Int j=0;j<1111;j++)\n\tdp[i][j]=-INF;\n\n dp[0][0]=0;\n for(Int k=0;k<m;k++)\n for(Int i=m;i>=0;i--)\n\tfor(Int j=l;j>=0;j--)\n\t chmax(dp[i+1][j+e[k]],dp[i][j]+s[k]);\n \n vector<Int> dp2(l+1,-INF);\n for(Int i=x;i<=m;i++)\n for(Int j=0;j<=l;j++)\n\tchmax(dp2[j],dp[i][j]);\n\n for(Int j=1;j<=l;j++) chmax(dp2[j],dp2[j-1]);\n\n Int ans=-INF;\n for(Int i=0;i<n;i++){\n if(se[i]>l) continue;\n chmax(ans,dp2[l-se[i]]+ss[i]);\n for(Int j=0;j<i;j++){\n\tif(se[i]+se[j]>l) continue;\n\tchmax(ans,dp2[l-(se[i]+se[j])]+ss[i]+ss[j]);\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4156,"score_of_the_acc":-0.0538,"final_rank":6},{"submission_id":"aoj_2285_2890455","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n\nint limit,n,m,x;\n\nint a[111],b[111],c[111],d[111];\nstring damy;\nint dp[1111][111];\nbool used[1111][111];\nint MAX[1111];\n\nvoid Input(){\n rep(i,m){\n cin>>damy>>c[i]>>d[i];\n }\n rep(i,n){\n cin>>damy>>a[i]>>b[i];\n }\n}\n\nvoid init(){\n memset(MAX,0,sizeof(MAX));\n memset(dp,0,sizeof(dp));\n memset(used,0,sizeof(used));\n}\n\nvoid DP(){\n used[0][0]=1;\n for(int k=0;k<n;k++){\n for(int i=limit;i>=0;i--){\n for(int j=n;j>=0;j--){\n\tif(used[i][j]){\n\t if(i+a[k]<=limit){\n\t used[i+a[k]][j+1]=1;\n\t dp[i+a[k]][j+1]=max(dp[i+a[k]][j+1],dp[i][j]+b[k]);\n\t }\n\t}\n }\n }\n }\n\n for(int i=0;i<=limit;i++){\n for(int j=x;j<=n;j++){\n MAX[i]=max(MAX[i],dp[i][j]);\n }\n }\n\n int ans=0;\n\n for(int i=0;i<m;i++){\n for(int j=i+1;j<m;j++){\n for(int k=0;k<limit;k++){\n\tif(k+c[i]+c[j]>limit)break;\n\tans=max(ans,MAX[k]+d[i]+d[j]);\n }\n }\n }\n\n for(int i=0;i<m;i++){\n for(int k=0;k<limit;k++){\n if(k+c[i]>limit)break;\n ans=max(ans,MAX[k]+d[i]);\n }\n }\n\n cout << ans << endl;\n \n}\n\n\nint main(){\n while( cin>>limit>>m>>n>>x,limit){\n Input();\n init();\n DP();\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3756,"score_of_the_acc":-0.0875,"final_rank":10},{"submission_id":"aoj_2285_2890421","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nInt dp[111][1111];\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;}\nsigned main(){ \n cin.tie(0);\n ios::sync_with_stdio(0);\n Int l,n,m,x;\n while(cin>>l>>n>>m>>x,l){\n string st;\n vector<Int> se(n),ss(n);\n vector<Int> e(m),s(m);\n for(Int i=0;i<n;i++) cin>>st>>se[i]>>ss[i];\n for(Int i=0;i<m;i++) cin>>st>>e[i]>>s[i];\n \n const Int INF = 1e9;\n for(Int i=0;i<111;i++)\n for(Int j=0;j<1111;j++)\n\tdp[i][j]=-INF;\n\n dp[0][0]=0;\n for(Int k=0;k<m;k++)\n for(Int i=m;i>=0;i--)\n\tfor(Int j=l;j>=0;j--)\n\t chmax(dp[i+1][j+e[k]],dp[i][j]+s[k]);\n \n vector<Int> dp2(l+1,-INF);\n for(Int i=x;i<=m;i++)\n for(Int j=0;j<=l;j++)\n\tchmax(dp2[j],dp[i][j]);\n\n for(Int j=1;j<=l;j++) chmax(dp2[j],dp2[j-1]);\n\n Int ans=-INF;\n for(Int i=0;i<n;i++){\n if(se[i]>l) continue;\n chmax(ans,dp2[l-se[i]]+ss[i]);\n for(Int j=0;j<i;j++){\n\tif(se[i]+se[j]>l) continue;\n\tchmax(ans,dp2[l-(se[i]+se[j])]+ss[i]+ss[j]);\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4036,"score_of_the_acc":-0.0514,"final_rank":4},{"submission_id":"aoj_2285_2560007","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\nint LIMIT,N,M,X;\n\nstruct Info{\n\tint cost,value;\n};\n\nstruct Data{\n\tData(int arg_num,int arg_cost){\n\t\tnum = arg_num;\n\t\tcost = arg_cost;\n\t}\n\tint num,cost;\n};\n\nvoid func(){\n\n\tInfo sec[N];\n\n\tchar buf[31];\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%s %d %d\",buf,&sec[i].cost,&sec[i].value);\n\t}\n\n\tint dp_sec[3][21],next_sec[3][21];\n\n\tfor(int num = 0; num <= 2; num++){\n\t\tfor(int total_cost = 0; total_cost <= 20; total_cost++){\n\t\t\tdp_sec[num][total_cost] = -1;\n\t\t\tnext_sec[num][total_cost] = -1;\n\t\t}\n\t}\n\n\tdp_sec[0][0] = 0;\n\tnext_sec[0][0] = 0;\n\n\tvector<Data> Updated;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tfor(int num = 0; num <= 1; num++){\n\t\t\tfor(int total_cost = 0; total_cost+sec[i].cost <= 20; total_cost++){\n\t\t\t\tif(dp_sec[num][total_cost] == -1)continue;\n\n\t\t\t\tif(next_sec[num+1][total_cost+sec[i].cost] < dp_sec[num][total_cost]+sec[i].value){\n\t\t\t\t\tnext_sec[num+1][total_cost+sec[i].cost] = dp_sec[num][total_cost]+sec[i].value;\n\t\t\t\t\tUpdated.push_back(Data(num+1,total_cost+sec[i].cost));\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_sec[Updated[k].num][Updated[k].cost] = next_sec[Updated[k].num][Updated[k].cost];\n\t\t}\n\t\tUpdated.clear();\n\t}\n\n\tInfo stan[M];\n\tint cost_sum = 0;\n\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%s %d %d\",buf,&stan[i].cost,&stan[i].value);\n\t\tcost_sum += stan[i].cost;\n\t}\n\n\tint dp_stan[M+1][cost_sum+1],next_stan[M+1][cost_sum+1];\n\n\tfor(int num = 0; num <= M; num++){\n\t\tfor(int total_cost = 0; total_cost <= cost_sum; total_cost++){\n\t\t\tdp_stan[num][total_cost] = -1;\n\t\t\tnext_stan[num][total_cost] = -1;\n\t\t}\n\t}\n\n\tdp_stan[0][0] = 0;\n\tnext_stan[0][0] = 0;\n\tUpdated.clear();\n\n\tfor(int i = 0; i < M; i++){ //100\n\n\t\tfor(int num = 0; num <= M-1; num++){ //100\n\t\t\tfor(int total_cost = 0; total_cost+stan[i].cost <= cost_sum; total_cost++){ //1000\n\t\t\t\tif(dp_stan[num][total_cost] == -1)continue;\n\n\t\t\t\tif(next_stan[num+1][total_cost+stan[i].cost] < dp_stan[num][total_cost]+stan[i].value){\n\t\t\t\t\tnext_stan[num+1][total_cost+stan[i].cost] = dp_stan[num][total_cost]+stan[i].value;\n\t\t\t\t\tUpdated.push_back(Data(num+1,total_cost+stan[i].cost));\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_stan[Updated[k].num][Updated[k].cost] = next_stan[Updated[k].num][Updated[k].cost];\n\t\t}\n\t\tUpdated.clear();\n\t}\n\n\tint ans = 0;\n\n\tfor(int sec_num = 1; sec_num <= 2; sec_num++){\n\t\tfor(int sec_cost = 0; sec_cost <= 20; sec_cost++){\n\t\t\tif(dp_sec[sec_num][sec_cost] == -1)continue;\n\t\t\tfor(int stan_num = X; stan_num <= M; stan_num++){\n\t\t\t\tfor(int stan_cost = 0; stan_cost <= min(LIMIT,cost_sum); stan_cost++){\n\t\t\t\t\tif(dp_stan[stan_num][stan_cost] == -1)continue;\n\t\t\t\t\tif(sec_cost+stan_cost > LIMIT)continue;\n\n\t\t\t\t\tans = max(ans,dp_sec[sec_num][sec_cost]+dp_stan[stan_num][stan_cost]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %d %d\",&LIMIT,&N,&M,&X);\n\t\tif(LIMIT == 0 && N == 0 && M == 0 && X == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3748,"score_of_the_acc":-0.0456,"final_rank":3},{"submission_id":"aoj_2285_2560006","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\nint LIMIT,N,M,X;\nint dp_sec[3][21],next_sec[3][21];\nint dp_stan[101][1001],next_stan[101][1001];\n\nstruct Info{\n\tint cost,value;\n};\n\nstruct Data{\n\tData(int arg_num,int arg_cost){\n\t\tnum = arg_num;\n\t\tcost = arg_cost;\n\t}\n\tint num,cost;\n};\n\nvoid func(){\n\n\tInfo sec[N];\n\n\tchar buf[31];\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%s %d %d\",buf,&sec[i].cost,&sec[i].value);\n\t}\n\n\tfor(int num = 0; num <= 2; num++){\n\t\tfor(int total_cost = 0; total_cost <= 20; total_cost++){\n\t\t\tdp_sec[num][total_cost] = -1;\n\t\t\tnext_sec[num][total_cost] = -1;\n\t\t}\n\t}\n\n\tdp_sec[0][0] = 0;\n\tnext_sec[0][0] = 0;\n\n\tvector<Data> Updated;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tfor(int num = 0; num <= 1; num++){\n\t\t\tfor(int total_cost = 0; total_cost+sec[i].cost <= 20; total_cost++){\n\t\t\t\tif(dp_sec[num][total_cost] == -1)continue;\n\n\t\t\t\tif(next_sec[num+1][total_cost+sec[i].cost] < dp_sec[num][total_cost]+sec[i].value){\n\t\t\t\t\tnext_sec[num+1][total_cost+sec[i].cost] = dp_sec[num][total_cost]+sec[i].value;\n\t\t\t\t\tUpdated.push_back(Data(num+1,total_cost+sec[i].cost));\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_sec[Updated[k].num][Updated[k].cost] = next_sec[Updated[k].num][Updated[k].cost];\n\t\t}\n\t\tUpdated.clear();\n\t}\n\n\tInfo stan[M];\n\tint cost_sum = 0;\n\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%s %d %d\",buf,&stan[i].cost,&stan[i].value);\n\t\tcost_sum += stan[i].cost;\n\t}\n\n\tfor(int num = 0; num <= M; num++){\n\t\tfor(int total_cost = 0; total_cost <= 1000; total_cost++){\n\t\t\tdp_stan[num][total_cost] = -1;\n\t\t\tnext_stan[num][total_cost] = -1;\n\t\t}\n\t}\n\n\tdp_stan[0][0] = 0;\n\tnext_stan[0][0] = 0;\n\tUpdated.clear();\n\n\tfor(int i = 0; i < M; i++){ //100\n\n\t\tfor(int num = 0; num <= M-1; num++){ //100\n\t\t\tfor(int total_cost = 0; total_cost+stan[i].cost <= cost_sum; total_cost++){ //1000\n\t\t\t\tif(dp_stan[num][total_cost] == -1)continue;\n\n\t\t\t\tif(next_stan[num+1][total_cost+stan[i].cost] < dp_stan[num][total_cost]+stan[i].value){\n\t\t\t\t\tnext_stan[num+1][total_cost+stan[i].cost] = dp_stan[num][total_cost]+stan[i].value;\n\t\t\t\t\tUpdated.push_back(Data(num+1,total_cost+stan[i].cost));\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_stan[Updated[k].num][Updated[k].cost] = next_stan[Updated[k].num][Updated[k].cost];\n\t\t}\n\t\tUpdated.clear();\n\t}\n\n\tint ans = 0;\n\n\tfor(int sec_num = 1; sec_num <= 2; sec_num++){\n\t\tfor(int sec_cost = 0; sec_cost <= 20; sec_cost++){\n\t\t\tif(dp_sec[sec_num][sec_cost] == -1)continue;\n\t\t\tfor(int stan_num = X; stan_num <= M; stan_num++){\n\t\t\t\tfor(int stan_cost = 0; stan_cost <= LIMIT; stan_cost++){\n\t\t\t\t\tif(dp_stan[stan_num][stan_cost] == -1)continue;\n\t\t\t\t\tif(sec_cost+stan_cost > LIMIT)continue;\n\n\t\t\t\t\tans = max(ans,dp_sec[sec_num][sec_cost]+dp_stan[stan_num][stan_cost]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n}\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %d %d\",&LIMIT,&N,&M,&X);\n\t\tif(LIMIT == 0 && N == 0 && M == 0 && X == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4084,"score_of_the_acc":-0.0524,"final_rank":5},{"submission_id":"aoj_2285_1879617","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 1010\n#define MAX_M 101\n\nint dp[MAX_M][MAX];\n\nint main()\n{\n int LIMIT, N, M, X;\n string name;\n while (cin >> LIMIT >> N >> M >> X, LIMIT) {\n vector<int> c(N), s(N);\n for (int i = 0; i < N; i++) {\n cin >> name >> c[i] >> s[i];\n }\n int max_s[MAX];\n fill(max_s, max_s + MAX, -1);\n for (int i = 0; i < N; i++) {\n max_s[c[i]] = max(max_s[c[i]], s[i]);\n for (int j = i + 1; j < N; j++) {\n max_s[c[i] + c[j]] = max(max_s[c[i] + c[j]], s[i] + s[j]);\n }\n }\n for (int i = 0; i < LIMIT; i++) {\n max_s[i+1] = max(max_s[i+1], max_s[i]);\n }\n vector<int> sc(M), ss(M);\n for (int i = 0; i < M; i++) {\n cin >> name >> sc[i] >> ss[i];\n }\n for (int i = 0; i <= M; i++) {\n for (int j = 0; j <= LIMIT; j++) {\n dp[i][j] = -1;\n }\n }\n dp[0][0] = 0;\n for (int i = 0; i < M; i++) {\n for (int j = M-1; j >= 0; j--) {\n for (int k = LIMIT-sc[i]; k >= 0; k--) {\n if (dp[j][k] == -1) continue;\n int nk = k + sc[i];\n if (nk <= LIMIT) {\n dp[j+1][nk] = max(dp[j+1][nk], dp[j][k] + ss[i]);\n }\n }\n }\n }\n \n int res = 0;\n for (int i = 0; i <= LIMIT; i++) {\n if (max_s[i] == -1) continue;\n for (int j = X; j <= M; j++) {\n if (dp[j][LIMIT-i] == -1) continue;\n res = max(res, max_s[i] + dp[j][LIMIT-i]); \n }\n }\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3540,"score_of_the_acc":-0.0415,"final_rank":1},{"submission_id":"aoj_2285_1805140","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 1010\n#define MAX_M 101\n\nint dp[MAX_M][MAX_M][MAX];\n\nint main()\n{\n int LIMIT, N, M, X;\n string name;\n while (cin >> LIMIT >> N >> M >> X, LIMIT) {\n vector<int> c(N), s(N);\n for (int i = 0; i < N; i++) {\n cin >> name >> c[i] >> s[i];\n }\n int max_s[MAX];\n fill(max_s, max_s + MAX, -1);\n for (int i = 0; i < N; i++) {\n max_s[c[i]] = max(max_s[c[i]], s[i]);\n for (int j = i + 1; j < N; j++) {\n max_s[c[i] + c[j]] = max(max_s[c[i] + c[j]], s[i] + s[j]);\n }\n }\n for (int i = 0; i < LIMIT; i++) {\n max_s[i+1] = max(max_s[i+1], max_s[i]);\n }\n vector<int> sc(M), ss(M);\n for (int i = 0; i < M; i++) {\n cin >> name >> sc[i] >> ss[i];\n }\n for (int i = 0; i <= M; i++) {\n for (int j = 0; j <= M; j++) {\n for (int k = 0; k <= LIMIT; k++) {\n dp[i][j][k] = -1;\n }\n }\n dp[i][0][0] = 0;\n }\n \n for (int i = 0; i < M; i++) {\n for (int j = 0; j <= M; j++) {\n for (int k = LIMIT; k >= 0; k--) {\n if (dp[i][j][k] == -1) continue;\n int nk = k + sc[i];\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]);\n if (nk <= LIMIT) {\n dp[i+1][j+1][nk] = max(dp[i+1][j+1][nk], dp[i][j][k] + ss[i]);\n }\n }\n }\n } \n \n int res = 0;\n for (int i = 0; i <= LIMIT; i++) {\n if (max_s[i] == -1) continue;\n for (int j = 0; j <= M; j++) {\n for (int k = X; k <= M; k++) {\n if (dp[j][k][LIMIT-i] == -1) continue;\n res = max(res, max_s[i] + dp[j][k][LIMIT-i]); \n }\n }\n }\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":41452,"score_of_the_acc":-1.0099,"final_rank":15},{"submission_id":"aoj_2285_1805138","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define MAX 1010\n#define MAX_M 101\n\nint dp[MAX_M][MAX_M][MAX];\n\nint main()\n{\n int LIMIT, N, M, X;\n string name;\n while (cin >> LIMIT >> N >> M >> X, LIMIT) {\n vector<int> c(N), s(N);\n for (int i = 0; i < N; i++) {\n cin >> name >> c[i] >> s[i];\n }\n int max_s[MAX];\n fill(max_s, max_s + MAX, -1);\n for (int i = 0; i < N; i++) {\n max_s[c[i]] = max(max_s[c[i]], s[i]);\n for (int j = i + 1; j < N; j++) {\n max_s[c[i] + c[j]] = max(max_s[c[i] + c[j]], s[i] + s[j]);\n }\n }\n for (int i = 0; i < LIMIT; i++) {\n max_s[i+1] = max(max_s[i+1], max_s[i]);\n }\n vector<int> sc(M), ss(M);\n for (int i = 0; i < M; i++) {\n cin >> name >> sc[i] >> ss[i];\n }\n for (int i = 0; i <= M; i++) {\n for (int j = 0; j <= M; j++) {\n for (int k = 0; k <= LIMIT; k++) {\n dp[i][j][k] = -1;\n }\n }\n dp[i][0][0] = 0;\n }\n \n for (int i = 0; i < M; i++) {\n for (int j = 0; j <= M; j++) {\n for (int k = LIMIT; k >= 0; k--) {\n if (dp[i][j][k] == -1) continue;\n int nk = k + sc[i];\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]);\n dp[i+1][j+1][nk] = max(dp[i+1][j+1][nk], dp[i][j][k] + ss[i]);\n }\n }\n } \n \n int res = 0;\n for (int i = 0; i <= LIMIT; i++) {\n if (max_s[i] == -1) continue;\n for (int j = 0; j <= M; j++) {\n for (int k = X; k <= M; k++) {\n if (dp[j][k][LIMIT-i] == -1) continue;\n res = max(res, max_s[i] + dp[j][k][LIMIT-i]); \n }\n }\n }\n cout << res << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":41456,"score_of_the_acc":-1.0099,"final_rank":16},{"submission_id":"aoj_2285_1472640","code_snippet":"#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<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_L = 1000;\nconst int MAX_N = 100;\nconst int MAX_M = 100;\n\n/* typedef */\n\ntypedef pair<int,int> pii;\n\n/* global variables */\n\nint lim, n, m, x;\npii secs[MAX_N], stds[MAX_M];\nint dp0[3][MAX_L + 1], dp1[MAX_M + 1][MAX_L + 1];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n for (;;) {\n cin >> lim >> n >> m >> x;\n if (lim == 0) break;\n\n string name;\n for (int i = 0; i < n; i++)\n cin >> name >> secs[i].first >> secs[i].second;\n for (int i = 0; i < m; i++)\n cin >> name >> stds[i].first >> stds[i].second;\n\n memset(dp0, -1, sizeof(dp0));\n dp0[0][0] = 0;\n\n for (int i = 0; i < n; i++) {\n int &ei = secs[i].first, &si = secs[i].second;\n int maxl = lim - ei;\n for (int j = 1; j >= 0; j--)\n\tfor (int l = 0; l <= maxl; l++)\n\t if (dp0[j][l] >= 0 && dp0[j + 1][l + ei] < dp0[j][l] + si)\n\t dp0[j + 1][l + ei] = dp0[j][l] + si;\n }\n\n for (int i = 1; i <= 2; i++)\n for (int l = 1; l <= lim; l++)\n\tif (dp0[i][l] < dp0[i][l - 1]) dp0[i][l] = dp0[i][l - 1];\n \n memset(dp1, -1, sizeof(dp1));\n dp1[0][0] = 0;\n\n for (int i = 0; i < m; i++) {\n int &ei = stds[i].first, &si = stds[i].second;\n int maxl = lim - ei;\n for (int j = m - 1; j >= 0; j--)\n\tfor (int l = 0; l <= maxl; l++)\n\t if (dp1[j][l] >= 0 && dp1[j + 1][l + ei] < dp1[j][l] + si)\n\t dp1[j + 1][l + ei] = dp1[j][l] + si;\n }\n \n for (int i = 1; i <= m; i++)\n for (int l = 1; l <= lim; l++)\n\tif (dp1[i][l] < dp1[i][l - 1]) dp1[i][l] = dp1[i][l - 1];\n\n int maxsum = 0;\n\n for (int i = 1; i <= 2; i++)\n for (int j = x; j <= m; j++)\n\tfor (int l = 0; l <= lim; l++)\n\t if (dp0[i][l] >= 0 && dp1[j][lim - l] >= 0) {\n\t int sum = dp0[i][l] + dp1[j][lim - l];\n\t if (maxsum < sum) maxsum = sum;\n\t }\n\n cout << maxsum << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1620,"score_of_the_acc":-0.0446,"final_rank":2},{"submission_id":"aoj_2285_1358203","code_snippet":"#include <algorithm>\n#include <functional>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <bitset>\n#include <climits>\n\n#define all(c) (c).begin(), (c).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb(e) push_back(e)\n#define mp(a, b) make_pair(a, b)\n#define fr first\n#define sc second\n\nconst int INF=100000000;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nusing namespace std;\ntypedef pair<int ,int > P;\ntypedef long long ll;\ntemplate<class T>\nbool chmax(T &a, const T &b) {\n if(a<b) {\n a=b;\n return true;\n }\n\n return false;\n}\nstruct Artist {\n int e,s;\n Artist(int e=0,int s=0) :\n e(e),s(s) {}\n};\nvoid input(int len, Artist *a) {\n rep(i,len) {\n string ss;\n int e,s;\n cin>>ss>>e>>s;\n a[i]=Artist(e,s);\n }\n}\nArtist artist1[102], artist2[102];\n// ??????????????????????????°?????????\nint dp1[102][5][1003];\nint dp2[102][102][1003];\n\nint lim,n,m,x;\n\nvoid solve() {\n rep(i,102) rep(j,5) rep(k,1003) dp1[i][j][k]=-1;\n rep(i,102) rep(j,102) rep(k,1003) dp2[i][j][k]=-1;\n\n input(n,artist1);\n input(m,artist2);\n dp1[0][0][0]=dp2[0][0][0]=0;\n\n rep(k,lim) rep(i,n) rep(j,3) {\n Artist a=artist1[i];\n int lim_n = k+a.e;\n if(lim_n <= lim&&dp1[i][j][k]!=-1) \n chmax(dp1[i+1][j+1][lim_n],dp1[i][j][k]+a.s);\n chmax(dp1[i+1][j][k],dp1[i][j][k]);\n }\n rep(k,lim) rep(i,m) rep(j,m) {\n Artist a=artist2[i];\n int lim_n = k+a.e;\n if(lim_n <= lim&&dp2[i][j][k]!=-1) \n chmax(dp2[i+1][j+1][lim_n],dp2[i][j][k]+a.s);\n chmax(dp2[i+1][j][k],dp2[i][j][k]);\n }\n\n //rep(i,20) printf(\"%d %d\\n\",i,dp1[n][2][i]);\n //rep(i,20) printf(\"%d %d\\n\",i,dp2[m][2][i]);\n\n int ans=0;\n rep(i,lim) {\n int max1=max(dp1[n][1][i],dp1[n][2][i]);\n int max2=0;\n for(int j=x;j<=m;j++) for(int k=0;k<=lim-i;k++) chmax(max2,dp2[m][j][k]);\n\n chmax(ans,max1+max2);\n // printf(\"%d %d : %d\\n\",i,lim-i,max1+max2);\n }\n\n cout<<ans<<endl;\n}\n\nint main() {\n while(cin>>lim>>n>>m>>x) {\n if(lim+n+m+x==0) break;\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":230,"memory_kb":43968,"score_of_the_acc":-1.7686,"final_rank":20},{"submission_id":"aoj_2285_1358081","code_snippet":"#include <algorithm>\n#include <functional>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <string>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <bitset>\n#include <climits>\n\n#define all(c) (c).begin(), (c).end()\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define pb(e) push_back(e)\n#define mp(a, b) make_pair(a, b)\n#define fr first\n#define sc second\n\nconst int INF=100000000;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nusing namespace std;\ntypedef pair<int ,int > P;\ntypedef long long ll;\ntemplate<class T>\nbool chmax(T &a, const T &b) {\n if(a<b) {\n a=b;\n return true;\n }\n\n return false;\n}\nstruct Artist {\n int e,s;\n Artist(int e=0,int s=0) :\n e(e),s(s) {}\n};\nvoid input(int len, Artist *a) {\n rep(i,len) {\n string ss;\n int e,s;\n cin>>ss>>e>>s;\n a[i]=Artist(e,s);\n }\n}\nArtist artist1[102], artist2[102];\n// ??????????????????????????°?????????\nint dp1[102][5][1003];\nint dp2[102][102][1003];\n\nint lim,n,m,x;\n\nvoid solve() {\n rep(i,102) rep(j,5) rep(k,1003) dp1[i][j][k]=-1;\n rep(i,102) rep(j,102) rep(k,1003) dp2[i][j][k]=-1;\n\n input(n,artist1);\n input(m,artist2);\n dp1[0][0][0]=dp2[0][0][0]=0;\n\n rep(i,n) rep(j,3) rep(k,lim) {\n Artist a=artist1[i];\n int lim_n = k+a.e;\n if(lim_n <= lim&&dp1[i][j][k]!=-1) \n chmax(dp1[i+1][j+1][lim_n],dp1[i][j][k]+a.s);\n chmax(dp1[i+1][j][k],dp1[i][j][k]);\n }\n rep(i,m) rep(j,m) rep(k,lim) {\n Artist a=artist2[i];\n int lim_n = k+a.e;\n if(lim_n <= lim&&dp2[i][j][k]!=-1) \n chmax(dp2[i+1][j+1][lim_n],dp2[i][j][k]+a.s);\n chmax(dp2[i+1][j][k],dp2[i][j][k]);\n }\n\n //rep(i,20) printf(\"%d %d\\n\",i,dp1[n][2][i]);\n //rep(i,20) printf(\"%d %d\\n\",i,dp2[m][2][i]);\n\n int ans=0;\n rep(i,lim) {\n int max1=max(dp1[n][1][i],dp1[n][2][i]);\n int max2=0;\n for(int j=x;j<=m;j++) for(int k=0;k<=lim-i;k++) chmax(max2,dp2[m][j][k]);\n\n chmax(ans,max1+max2);\n // printf(\"%d %d : %d\\n\",i,lim-i,max1+max2);\n }\n\n cout<<ans<<endl;\n}\n\nint main() {\n while(cin>>lim>>n>>m>>x) {\n if(lim+n+m+x==0) break;\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":43968,"score_of_the_acc":-1.4353,"final_rank":18},{"submission_id":"aoj_2285_1111626","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar in[100];\nint dp[110][1010];\nint val[1010];\nint sp[110];\nint sq[110];\nint np[110];\nint nq[110];\nint main(){\n\tint a,b,c,d;\n\twhile(scanf(\"%d%d%d%d\",&a,&b,&c,&d),a){\n\t\tfor(int i=0;i<b;i++){\n\t\t\tscanf(\"%s%d%d\",in,sp+i,sq+i);\n\t\t}\n\t\tfor(int i=0;i<c;i++)scanf(\"%s%d%d\",in,np+i,nq+i);\n\t\tfor(int i=0;i<110;i++)for(int j=0;j<1010;j++)dp[i][j]=-99999999;\n\t\tdp[0][0]=0;\n\t\tfor(int i=0;i<c;i++){\n\t\t\tfor(int j=i;j>=0;j--){\n\t\t\t\tfor(int k=a-np[i];k>=0;k--){\n\t\t\t\t\tdp[j+1][k+np[i]]=max(dp[j+1][k+np[i]],dp[j][k]+nq[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<1010;i++)val[i]=-99999999;\n\t\tfor(int i=d;i<=c;i++)for(int j=0;j<=a;j++)val[j]=max(val[j],dp[i][j]);\n\t\tint ret=0;\n\t\tfor(int i=0;i<b;i++){\n\t\t\tfor(int j=0;j<=a-sp[i];j++){\n\t\t//\t\tif(sq[i]+val[j]==59)printf(\"%d %d\\n\",i,j);\n\t\t\t\tret=max(ret,sq[i]+val[j]);\n\t\t\t}\n\t\t\tfor(int j=i+1;j<b;j++){\n\t\t\t\tfor(int k=0;k<=a-sp[i]-sp[j];k++){\n\t\t\t//\t\tif(sq[i]+sq[j]+val[k]==59)printf(\"%d %d %d\\n\",i,j,k);\n\t\t\t\t\tret=max(ret,sq[i]+sq[j]+val[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",ret);\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":1472,"score_of_the_acc":-0.0833,"final_rank":7},{"submission_id":"aoj_2285_1096584","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <complex>\n#include <string>\n#include <sstream>\n#include <algorithm>\n#include <numeric>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <set>\nusing namespace std;\ntypedef pair<int,int> P;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\n#define pu push\n#define pb push_back\n#define mp make_pair\n#define eps 1e-9\n#define INF 2000000000\n#define sz(x) ((int)(x).size())\n#define fi first\n#define sec second\n#define SORT(x) sort((x).begin(),(x).end())\n#define all(x) (x).begin(),(x).end()\n#define EQ(a,b) (abs((a)-(b))<eps)\ntemplate<class T> void chmax(T& a,const T b){if(a<b)a=b;}\nchar name[105][40],sname[105][40];\nint se[105],ss[105],e[105],s[105];\nint dp[2][1005][3][105];\nint Limit,N,M,X;\nint main()\n{\n\twhile(1)\n\t{\n\t\tscanf(\"%d %d %d %d\",&Limit,&N,&M,&X);\n\t\tif(Limit==0&&N==0&&M==0&&X==0)break;\n\t\tfor(int i=0;i<N;i++)scanf(\"%s %d %d\",sname[i],&se[i],&ss[i]);\n\t\tfor(int i=0;i<M;i++)scanf(\"%s %d %d\",name[i],&e[i],&s[i]);\n\t\tmemset(dp,-1,sizeof(dp));\n\t\tdp[0][0][0][0]=0;\n\t\tint ans=0;\n\t\tfor(int i=0;i<N+M;i++)\n\t\t{\n\t\t\tmemset(dp[(i+1)%2],-1,sizeof(dp[(i+1)%2]));\n\t\t\tfor(int j=0;j<=Limit;j++)\n\t\t\t{\n\t\t\t\tif(i<N)\n\t\t\t\t{\n\t\t\t\t\tfor(int k=0;k<3;k++)\n\t\t\t\t\t{\n\t\t\t\t\t\tif(dp[i%2][j][k][0]==-1)continue;\n\t\t\t\t\t\tchmax(dp[(i+1)%2][j][k][0],dp[i%2][j][k][0]);\n\t\t\t\t\t\tif(j+se[i]>Limit||k>=2)continue;\n\t\t\t\t\t\tchmax(dp[(i+1)%2][j+se[i]][k+1][0],dp[i%2][j][k][0]+ss[i]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tint idx=i-N;\n\t\t\t\t\tfor(int k=1;k<3;k++)\n\t\t\t\t\t{\n\t\t\t\t\t\tfor(int l=0;l<=M;l++)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif(dp[i%2][j][k][l]==-1)continue;\n\t\t\t\t\t\t\tchmax(dp[(i+1)%2][j][k][l],dp[i%2][j][k][l]);\n\t\t\t\t\t\t\tif(j+e[idx]>Limit||l>=M)continue;\n\t\t\t\t\t\t\tchmax(dp[(i+1)%2][j+e[idx]][k][l+1],dp[i%2][j][k][l]+s[idx]);\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\tfor(int j=0;j<=Limit;j++)\n\t\t{\n\t\t\tfor(int k=1;k<3;k++)\n\t\t\t{\n\t\t\t\tfor(int l=X;l<=M;l++)\n\t\t\t\t{\n\t\t\t\t\tchmax(ans,dp[(N+M)%2][j][k][l]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":150,"memory_kb":3680,"score_of_the_acc":-0.6276,"final_rank":13},{"submission_id":"aoj_2285_1008804","code_snippet":"#define _USE_MATH_DEFINES\n#define INF 0x3f3f3f3f\n#include <cstdio>\n#include <iostream>\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 int tx[] = {0,1,0,-1};\nstatic const int ty[] = {-1,0,1,0};\n \nstatic const double EPS = 1e-8;\n\n// dp[picked secret][picked standard][money] ::= max satisfaction\nint dp[3][105][1005]; \n\nint main(){\n int money_limit;\n int total_secret_artists;\n int total_standard_artists;\n int to_pick_standard_artists;\n while(~scanf(\"%d %d %d %d\",\n &money_limit,\n &total_secret_artists,\n &total_standard_artists,\n &to_pick_standard_artists)){\n \n if(money_limit == 0\n && total_secret_artists == 0\n && total_standard_artists == 0\n && to_pick_standard_artists == 0) break;\n\n memset(dp,-1,sizeof(dp));\n dp[0][0][0] = 0;\n for(int artist_idx=0;artist_idx<total_secret_artists;artist_idx++){\n string name;\n int cost;\n int satisfaction;\n\n cin >> name >> cost >> satisfaction;\n for(int prev_picked=1;prev_picked>=0;prev_picked--){\n for(int prev_money=1000;prev_money>=0;prev_money--){\n if(prev_money + cost > 1000) continue;\n\n if(dp[prev_picked][0][prev_money] == -1) continue;\n dp[prev_picked + 1][0][prev_money + cost]\n = max(dp[prev_picked][0][prev_money] + satisfaction,\n dp[prev_picked + 1][0][prev_money + cost]);\n }\n }\n }\n for(int artist_idx=0;artist_idx<total_standard_artists;artist_idx++){\n string name;\n int cost;\n int satisfaction;\n cin >> name >> cost >> satisfaction;\n for(int picked_secret=min(2,total_secret_artists);picked_secret>=1;picked_secret--){\n for(int prev_picked_standard = artist_idx; prev_picked_standard >= 0; prev_picked_standard--){\n for(int prev_money=1000;prev_money>=0;prev_money--){\n if(prev_money + cost > 1000) continue;\n\n if(dp[picked_secret][prev_picked_standard][prev_money] == -1) continue;\n dp[picked_secret][prev_picked_standard + 1][prev_money + cost]\n = max(dp[picked_secret][prev_picked_standard + 1][prev_money + cost],\n dp[picked_secret][prev_picked_standard][prev_money] + satisfaction);\n }\n\n }\n } \n }\n\n int res = 0;\n for(int picked_secret=min(2,total_secret_artists);picked_secret>=1;picked_secret--){\n for(int picked_standard = total_standard_artists; picked_standard >=to_pick_standard_artists; picked_standard--){\n for(int money=money_limit;money>=0;money--){\n res = max(dp[picked_secret][picked_standard][money],res);\n }\n }\n }\n\n printf(\"%d\\n\",res);\n }\n}","accuracy":1,"time_ms":40,"memory_kb":2496,"score_of_the_acc":-0.1455,"final_rank":11},{"submission_id":"aoj_2285_904780","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <set>\n#include <map>\n#include <algorithm>\t// require sort next_permutation count __gcd reverse etc.\n#include <cstdlib>\t// require abs exit atof atoi \n#include <cstdio>\t\t// require scanf printf\n#include <functional>\n#include <numeric>\t// require accumulate\n#include <cmath>\t\t// require fabs\n#include <climits>\n#include <limits>\n#include <cfloat>\n#include <iomanip>\t// require setw\n#include <sstream>\t// require stringstream \n#include <cstring>\t// require memset\n#include <cctype>\t\t// require tolower, toupper\n#include <fstream>\t// require freopen\n#include <ctime>\t\t// require srand\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define ALL(A) A.begin(), A.end()\n#define INF 1<<29\n#define DEBUG 0\n/*\n\tRitsumeikan University Programming Contest 2011 , Japan, 2011-10-05\n\n\t2285 - Anipero\n\n\tAnipero01.cpp\n\tまずは全探索.\n\n\tAnipero02.cpp\n\tメモ化再帰\n\n\tAnipero03.cpp\n\tDPに書き直す\n\n\tAnipero04.cpp\n\tループの向きを反対にする\n\n*/\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nconst int MAX_LIMIT = 1000;\nconst int MAX_N = 100;\nconst int MAX_M = 100;\n\nint LIMIT, N, M, X;\n\nint sec_e[MAX_N+1], sec_s[MAX_N+1], e[MAX_M+1], s[MAX_M+1];\n\nint dp[MAX_M+1][MAX_LIMIT+1];\n/*\nint dfs (int depth, int cnt, int cost ){\n\tif (cost > LIMIT ) return -INF;\n\tif (depth >= M ){\n\t\treturn 0;\n\t} // end if\n\tif (memo[depth][cnt][cost] != -1 ) return memo[depth][cnt][cost];\n\n\tint res = -INF;\n\tres = max (res, dfs (depth + 1, cnt, cost ) );\n\tres = max (res, dfs (depth + 1, cnt + 1, cost + e[depth] ) + s[depth] );\n\n\treturn memo[depth][cnt][cost] = res;\n}\n*/\n\nint solve (void ){\n\trep (j, MAX_M+1 ) rep (k, MAX_LIMIT + 1 ) dp[j][k] = -INF;\n\tdp[0][0] = 0;\n\n\trep (i, M ){\n\t\tfor (int j = i; j >= 0; j-- ){\n\t\t\tfor (int k = 0; k <= LIMIT; k++ ){\n\t\t\t\tif (k + e[i] <= LIMIT ){\n\t\t\t\t\tdp[j+1][k+e[i]] = max (dp[j+1][k+e[i]], dp[j][k]+s[i] );\n\t\t\t\t\tdp[j][k+e[i]] = max (dp[j][k+e[i]], dp[j][k] );\n\t\t\t\t} // end if\n\t\t\t} // end for\n\t\t} // end for\n\t} // end for\n\n#if DEBUG\n\trep (i, M+1 ){\n\t\tfor (int j = 0; j <= LIMIT; j++ ){\n\t\t\tcerr << (dp[i][j] <= -INF/2 ? -1 : dp[i][j] ) << (j != LIMIT ? ' ' : '\\n' );\n\t\t} // end for\n\t} // end rep\n#endif\n\n\tint res = 0;\n\tfor (int j = X; j <= M; j++ )\n\trep (k, LIMIT+1 ){\n\t\tif (dp[j][k] >= 0 ){\n\t\t\tint curr = -INF;\n\t\t\trep (ii, N ){\n\t\t\t\tif (k + sec_e[ii] <= LIMIT )\n\t\t\t\t\tcurr = max (curr, sec_s[ii] );\n\t\t\t\trep (jj, ii )\n\t\t\t\t\tif (k + sec_e[ii] + sec_e[jj] <= LIMIT )\n\t\t\t\t\t\tcurr = max (curr, sec_s[ii] + sec_s[jj] );\n\t\t\t} // end rep\n\t\t\tres = max (res, dp[j][k] + curr );\n\t\t} // end if\n\t} // end rep\n\t\n\treturn res;\n}\n\nint main()\n{\n\tios_base::sync_with_stdio(0);\n\twhile (cin >> LIMIT >> N >> M >> X, LIMIT ){\n\t\tmemset (sec_e, 0, sizeof (sec_e ) );\n\t\tmemset (sec_s, 0, sizeof (sec_s ) );\n\t\tmemset (e, 0, sizeof (e ) );\n\t\tmemset (s, 0, sizeof (s ) );\n\t\tstring str;\n\t\trep (i, N ) cin >> str >> sec_e[i] >> sec_s[i];\n\t\trep (j, M ) cin >> str >> e[j] >> s[j];\n\t\tint res = solve() ;\n\t\tcout << res << endl;\n\t} // end while\t\n\t\t\n\treturn 0;\n}","accuracy":1,"time_ms":250,"memory_kb":1612,"score_of_the_acc":-1.0028,"final_rank":14},{"submission_id":"aoj_2285_893162","code_snippet":"#include<bits/stdc++.h>\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 IINF (INT_MAX)\n#define MAX_LIMIT 1100\n#define MAX 110\n\nusing namespace std;\n\nint pre[MAX_LIMIT][3],pre2[MAX_LIMIT][MAX],LIMIT,N,M,X,SEC_E[MAX],SEC_S[MAX],E[MAX],S[MAX];\nstring tmp;\n\n\nint main(){\n while(cin >> LIMIT >> N >> M >> X, LIMIT|N|M|X){\n rep(i,N)cin >> tmp >> SEC_E[i] >> SEC_S[i];\n rep(i,M)cin >> tmp >> E[i] >> S[i];\n rep(i,LIMIT+1)rep(j,3)pre[i][j] = -1;\n rep(i,LIMIT+1)rep(j,MAX)pre2[i][j] = -1;\n pre[0][0] = pre2[0][0] = 0;\n\n rep(i,N)for(int j=1;j>=0;j--)rep(k,LIMIT+1){\n\tif( pre[k][j] == -1 ) continue;\n\tint total_money = k + SEC_E[i];\n\tif( total_money > LIMIT ) continue;\n\tpre[total_money][j+1] = max(pre[total_money][j+1],pre[k][j]+SEC_S[i]);\n }\n\n rep(i,3)rep(j,LIMIT+1)if( j ) pre[j][i] = max(pre[j][i],pre[j-1][i]);\n\n rep(i,M)for(int j=M-1;j>=0;j--)rep(k,LIMIT+1){\n\tif( pre2[k][j] == -1 ) continue;\n\tint total_money = k + E[i];\n\tif( total_money > LIMIT ) continue;\n\tpre2[total_money][j+1] = max(pre2[total_money][j+1],pre2[k][j]+S[i]);\n }\n\n rep(i,M+1)rep(j,LIMIT+1)if( j ) pre2[j][i] = max(pre2[j][i],pre2[j-1][i]);\n\n int ans = 0;\n\n REP(i,X,M+1)REP(j,1,3)rep(k,LIMIT+1){\n if( pre2[k][i] == -1 || pre[LIMIT-k][j] == -1 ) continue;\n int points = pre2[k][i] + pre[LIMIT-k][j];\n ans = max(ans,points);\n }\n\n cout << ans << endl;\n\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1648,"score_of_the_acc":-0.0869,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_2285_9658651\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define N 110\\n\\nint limit, n, m, x;\\nint e1[N], s1[N];\\nint e2[N], s2[N];\\nint dp[1010][N][N];\\nint ep[1010];\\n\\nint main(){\\n\\twhile (1){\\n\\t\\tcin >> limit >> n >> m >> x;\\n\\t\\tif (limit == 0 && n == 0 && m == 0 && x == 0) break;\\n\\t\\tstring name;\\n\\t\\tfor (int i = 1; i <= n; i++) cin >> name >> e1[i] >> s1[i];\\n\\t\\tfor (int i = 1; i <= m; i++) cin >> name >> e2[i] >> s2[i];\\n\\t\\tfor (int i = 0; i <= 1000; i++){\\n\\t\\t\\tfor (int j = 0; j <= m; j++){\\n\\t\\t\\t\\tfor (int k = 0; k <= m; k++) dp[i][j][k] = -1e9;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int i = 0; i <= 1000; i++) {\\n\\t\\t\\tfor (int j = 0; j <= m; j++) dp[i][j][0] = 0;\\n\\t\\t}\\n\\t\\tfor (int i = 1; i <= 1000; i++){\\n\\t\\t\\tfor (int j = 1; j <= m; j++){\\n\\t\\t\\t\\tfor (int k = 1; k <= j; k++){\\n\\t\\t\\t\\t\\tdp[i][j][k] = dp[i][j - 1][k];\\n\\t\\t\\t\\t\\tif (i >= e2[j]) dp[i][j][k] = max(dp[i][j][k], dp[i - e2[j]][j - 1][k - 1] + s2[j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int i = 1; i <= 1000; i++){\\n\\t\\t\\tep[i] = 0;\\n\\t\\t\\tfor (int k = x; k <= m; k++) ep[i] = max(ep[i], dp[i][m][k]);\\n\\t\\t}\\n\\t\\tint ans = 0;\\n\\t\\tfor (int i = 1; i <= n; i++) {\\n\\t\\t\\tif (limit >= e1[i]) ans = max(ans, s1[i] + ep[limit - e1[i]]);\\n\\t\\t}\\n\\t\\tfor (int i = 1; i <= n; i++){\\n\\t\\t\\tfor (int j = i + 1; j <= n; j++){\\n\\t\\t\\t\\tif (limit >= e1[i] + e1[j]) ans = max(ans, s1[i] + s1[j] + ep[limit - e1[i] - e1[j]]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\t\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 50680,\n \"score_of_the_acc\": -1.0699,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2285_5033123\",\n \"code_snippet\": \"#line 2 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 4 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n#include <string_view>\\n#line 7 \\\"/home/yuruhiya/programming/library/template/constants.cpp\\\"\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define FOR(i, m, n) for (int i = (m); i < (n); ++i)\\n#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)\\n#define rfor(i, m, n) for (int i = (m); i >= (n); --i)\\n#define unless(c) if (!(c))\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\n#define range_it(a, l, r) (a).begin() + (l), (a).begin() + (r)\\n\\nusing namespace std;\\nusing ll = long long;\\nusing LD = long double;\\nusing VB = vector<bool>;\\nusing VVB = vector<VB>;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VS = vector<string>;\\nusing VD = vector<LD>;\\nusing PII = pair<int, int>;\\nusing VP = vector<PII>;\\nusing PLL = pair<ll, ll>;\\nusing VPL = vector<PLL>;\\ntemplate <class T> using PQ = priority_queue<T>;\\ntemplate <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;\\nconstexpr int inf = 1000000000;\\nconstexpr long long inf_ll = 1000000000000000000ll, MOD = 1000000007;\\nconstexpr long double PI = 3.14159265358979323846, EPS = 1e-12;\\nnamespace CharacterClass {\\n\\tconstexpr string_view\\n\\t digit = \\\"0123456789\\\",\\n\\t xdigit = \\\"0123456789ABCDEFabcdef\\\", lower = \\\"abcdefghijklmnopqrstuvwxyz\\\",\\n\\t upper = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\",\\n\\t alpha = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t alnum = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz\\\",\\n\\t word = \\\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ_abcdefghijklmnopqrstuvwxyz\\\",\\n\\t punct = R\\\"(!\\\"#$%&'()*+,-./:;<=>?@[\\\\]^_`{|}~)\\\",\\n\\t graph =\\n\\t R\\\"(!\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t print =\\n\\t R\\\"( !\\\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\\\]^_`abcdefghijklmnopqrstuvwxyz{|}~)\\\",\\n\\t blank = \\\" \\\\t\\\", space = \\\" \\\\t\\\\n\\\\r\\\\f\\\\v\\\";\\n} // namespace CharacterClass\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Input.cpp\\\"\\nusing namespace std;\\n\\n#ifdef _WIN32\\n#define getchar_unlocked _getchar_nolock\\n#define putchar_unlocked _putchar_nolock\\n#define fwrite_unlocked fwrite\\n#define fflush_unlocked fflush\\n#endif\\nclass Scanner {\\n\\tstatic int gc() {\\n\\t\\treturn getchar_unlocked();\\n\\t}\\n\\tstatic char next_char() {\\n\\t\\tchar c;\\n\\t\\tread(c);\\n\\t\\treturn c;\\n\\t}\\n\\ttemplate <class T> static void read(T& v) {\\n\\t\\tcin >> v;\\n\\t}\\n\\tstatic void read(char& v) {\\n\\t\\twhile (isspace(v = gc()))\\n\\t\\t\\t;\\n\\t}\\n\\tstatic void read(bool& v) {\\n\\t\\tv = next_char() != '0';\\n\\t}\\n\\tstatic void read(string& v) {\\n\\t\\tv.clear();\\n\\t\\tfor (char c = next_char(); !isspace(c); c = gc()) v += c;\\n\\t}\\n\\tstatic void read(int& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long long& v) {\\n\\t\\tv = 0;\\n\\t\\tbool neg = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c); c = gc()) v = v * 10 + (c - '0');\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(double& v) {\\n\\t\\tv = 0;\\n\\t\\tdouble dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\tstatic void read(long double& v) {\\n\\t\\tv = 0;\\n\\t\\tlong double dp = 1;\\n\\t\\tbool neg = false, after_dp = false;\\n\\t\\tchar c = next_char();\\n\\t\\tif (c == '-') {\\n\\t\\t\\tneg = true;\\n\\t\\t\\tc = gc();\\n\\t\\t}\\n\\t\\tfor (; isdigit(c) || c == '.'; c = gc()) {\\n\\t\\t\\tif (c == '.') {\\n\\t\\t\\t\\tafter_dp = true;\\n\\t\\t\\t} else if (after_dp) {\\n\\t\\t\\t\\tv += (c - '0') * (dp *= 0.1);\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tv = v * 10 + (c - '0');\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (neg) v = -v;\\n\\t}\\n\\ttemplate <class T, class U> static void read(pair<T, U>& v) {\\n\\t\\tread(v.first);\\n\\t\\tread(v.second);\\n\\t}\\n\\ttemplate <class T> static void read(vector<T>& v) {\\n\\t\\tfor (auto& e : v) read(e);\\n\\t}\\n\\ttemplate <size_t N = 0, class T> static void read_tuple_impl(T& v) {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tread(get<N>(v));\\n\\t\\t\\tread_tuple_impl<N + 1>(v);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class... T> static void read(tuple<T...>& v) {\\n\\t\\tread_tuple_impl(v);\\n\\t}\\n\\tstruct ReadVectorHelper {\\n\\t\\tsize_t n;\\n\\t\\tReadVectorHelper(size_t _n) : n(_n) {}\\n\\t\\ttemplate <class T> operator vector<T>() {\\n\\t\\t\\tvector<T> v(n);\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\tstruct Read2DVectorHelper {\\n\\t\\tsize_t n, m;\\n\\t\\tRead2DVectorHelper(const pair<size_t, size_t>& nm) : n(nm.first), m(nm.second) {}\\n\\t\\ttemplate <class T> operator vector<vector<T>>() {\\n\\t\\t\\tvector<vector<T>> v(n, vector<T>(m));\\n\\t\\t\\tread(v);\\n\\t\\t\\treturn v;\\n\\t\\t}\\n\\t};\\n\\npublic:\\n\\tstring read_line() const {\\n\\t\\tstring v;\\n\\t\\tfor (char c = gc(); c != '\\\\n' && c != '\\\\0'; c = gc()) v += c;\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> T read() const {\\n\\t\\tT v;\\n\\t\\tread(v);\\n\\t\\treturn v;\\n\\t}\\n\\ttemplate <class T> vector<T> read_vector(size_t n) const {\\n\\t\\tvector<T> a(n);\\n\\t\\tread(a);\\n\\t\\treturn a;\\n\\t}\\n\\ttemplate <class T> operator T() const {\\n\\t\\treturn read<T>();\\n\\t}\\n\\tint operator--(int) const {\\n\\t\\treturn read<int>() - 1;\\n\\t}\\n\\tReadVectorHelper operator[](size_t n) const {\\n\\t\\treturn ReadVectorHelper(n);\\n\\t}\\n\\tRead2DVectorHelper operator[](const pair<size_t, size_t>& nm) const {\\n\\t\\treturn Read2DVectorHelper(nm);\\n\\t}\\n\\tvoid operator()() const {}\\n\\ttemplate <class H, class... T> void operator()(H&& h, T&&... t) const {\\n\\t\\tread(h);\\n\\t\\toperator()(forward<T>(t)...);\\n\\t}\\n\\nprivate:\\n\\ttemplate <template <class...> class, class...> struct Multiple;\\n\\ttemplate <template <class...> class V, class Head, class... Tail>\\n\\tstruct Multiple<V, Head, Tail...> {\\n\\t\\ttemplate <class... Args> using vec = V<vector<Head>, Args...>;\\n\\t\\tusing type = typename Multiple<vec, Tail...>::type;\\n\\t};\\n\\ttemplate <template <class...> class V> struct Multiple<V> { using type = V<>; };\\n\\ttemplate <class... T> using multiple_t = typename Multiple<tuple, T...>::type;\\n\\ttemplate <size_t N = 0, class T> void multiple_impl(T& t) const {\\n\\t\\tif constexpr (N < tuple_size_v<T>) {\\n\\t\\t\\tauto& vec = get<N>(t);\\n\\t\\t\\tusing V = typename remove_reference_t<decltype(vec)>::value_type;\\n\\t\\t\\tvec.push_back(read<V>());\\n\\t\\t\\tmultiple_impl<N + 1>(t);\\n\\t\\t}\\n\\t}\\n\\npublic:\\n\\ttemplate <class... T> auto multiple(size_t h) const {\\n\\t\\tmultiple_t<T...> result;\\n\\t\\twhile (h--) multiple_impl(result);\\n\\t\\treturn result;\\n\\t}\\n} in;\\n#define inputs(T, ...) \\\\\\n\\tT __VA_ARGS__; \\\\\\n\\tin(__VA_ARGS__)\\n#define ini(...) inputs(int, __VA_ARGS__)\\n#define inl(...) inputs(long long, __VA_ARGS__)\\n#define ins(...) inputs(string, __VA_ARGS__)\\n#line 7 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\n#include <charconv>\\n#line 10 \\\"/home/yuruhiya/programming/library/template/Output.cpp\\\"\\nusing namespace std;\\n\\nstruct BoolStr {\\n\\tconst char *t, *f;\\n\\tBoolStr(const char* _t, const char* _f) : t(_t), f(_f) {}\\n} Yes(\\\"Yes\\\", \\\"No\\\"), yes(\\\"yes\\\", \\\"no\\\"), YES(\\\"YES\\\", \\\"NO\\\"), Int(\\\"1\\\", \\\"0\\\");\\nstruct DivStr {\\n\\tconst char *d, *l;\\n\\tDivStr(const char* _d, const char* _l) : d(_d), l(_l) {}\\n} spc(\\\" \\\", \\\"\\\\n\\\"), no_spc(\\\"\\\", \\\"\\\\n\\\"), end_line(\\\"\\\\n\\\", \\\"\\\\n\\\"), comma(\\\",\\\", \\\"\\\\n\\\"),\\n no_endl(\\\" \\\", \\\"\\\");\\nclass Output {\\n\\tBoolStr B{Yes};\\n\\tDivStr D{spc};\\n\\npublic:\\n\\tvoid put(int v) const {\\n\\t\\tchar buf[12]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(long long v) const {\\n\\t\\tchar buf[21]{};\\n\\t\\tif (auto [ptr, e] = to_chars(begin(buf), end(buf), v); e == errc{}) {\\n\\t\\t\\tfwrite(buf, sizeof(char), ptr - buf, stdout);\\n\\t\\t} else {\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\tvoid put(bool v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(vector<bool>::reference v) const {\\n\\t\\tput(v ? B.t : B.f);\\n\\t}\\n\\tvoid put(char v) const {\\n\\t\\tputchar_unlocked(v);\\n\\t}\\n\\tvoid put(const char* v) const {\\n\\t\\tfwrite_unlocked(v, 1, strlen(v), stdout);\\n\\t}\\n\\tvoid put(double v) const {\\n\\t\\tprintf(\\\"%.20f\\\", v);\\n\\t}\\n\\tvoid put(long double v) const {\\n\\t\\tprintf(\\\"%.20Lf\\\", v);\\n\\t}\\n\\ttemplate <class T> void put(const T& v) const {\\n\\t\\tcout << v;\\n\\t}\\n\\ttemplate <class T, class U> void put(const pair<T, U>& v) const {\\n\\t\\tput(v.first);\\n\\t\\tput(D.d);\\n\\t\\tput(v.second);\\n\\t}\\n\\ttemplate <class InputIterater>\\n\\tvoid put_range(const InputIterater& begin, const InputIterater& end) const {\\n\\t\\tfor (InputIterater i = begin; i != end; ++i) {\\n\\t\\t\\tif (i != begin) put(D.d);\\n\\t\\t\\tput(*i);\\n\\t\\t}\\n\\t}\\n\\ttemplate <class T> void put(const vector<T>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T, size_t N> void put(const array<T, N>& v) const {\\n\\t\\tput_range(v.begin(), v.end());\\n\\t}\\n\\ttemplate <class T> void put(const vector<vector<T>>& v) const {\\n\\t\\tfor (size_t i = 0; i < v.size(); ++i) {\\n\\t\\t\\tif (i) put(D.l);\\n\\t\\t\\tput(v[i]);\\n\\t\\t}\\n\\t}\\n\\n\\tOutput() = default;\\n\\tOutput(const BoolStr& _boolstr, const DivStr& _divstr) : B(_boolstr), D(_divstr) {}\\n\\tOutput& operator()() {\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H> Output& operator()(H&& h) {\\n\\t\\tput(h);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class H, class... T> Output& operator()(H&& h, T&&... t) {\\n\\t\\tput(h);\\n\\t\\tput(D.d);\\n\\t\\treturn operator()(forward<T>(t)...);\\n\\t}\\n\\ttemplate <class InputIterator>\\n\\tOutput& range(const InputIterator& begin, const InputIterator& end) {\\n\\t\\tput_range(begin, end);\\n\\t\\tput(D.l);\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class T> Output& range(const T& a) {\\n\\t\\trange(a.begin(), a.end());\\n\\t\\treturn *this;\\n\\t}\\n\\ttemplate <class... T> void exit(T&&... t) {\\n\\t\\toperator()(forward<T>(t)...);\\n\\t\\tstd::exit(EXIT_SUCCESS);\\n\\t}\\n\\tOutput& flush() {\\n\\t\\tfflush_unlocked(stdout);\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const BoolStr& b) {\\n\\t\\tB = b;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const DivStr& d) {\\n\\t\\tD = d;\\n\\t\\treturn *this;\\n\\t}\\n\\tOutput& set(const char* t, const char* f) {\\n\\t\\tB = BoolStr(t, f);\\n\\t\\treturn *this;\\n\\t}\\n} out;\\n#line 3 \\\"/home/yuruhiya/programming/library/template/Step.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class T> struct Step {\\n\\tusing value_type = T;\\n\\n\\tclass iterator {\\n\\t\\tvalue_type a, b, c;\\n\\n\\tpublic:\\n\\t\\tconstexpr iterator() : a(value_type()), b(value_type()), c(value_type()) {}\\n\\t\\tconstexpr iterator(value_type _b, value_type _c, value_type _s)\\n\\t\\t : a(_b), b(_c), c(_s) {}\\n\\t\\tconstexpr iterator& operator++() {\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\t\\tconstexpr iterator operator++(int) {\\n\\t\\t\\titerator tmp = *this;\\n\\t\\t\\t--b;\\n\\t\\t\\ta += c;\\n\\t\\t\\treturn tmp;\\n\\t\\t}\\n\\t\\tconstexpr const value_type& operator*() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr const value_type* operator->() const {\\n\\t\\t\\treturn &a;\\n\\t\\t}\\n\\t\\tconstexpr bool operator==(const iterator& i) const {\\n\\t\\t\\treturn b == i.b;\\n\\t\\t}\\n\\t\\tconstexpr bool operator!=(const iterator& i) const {\\n\\t\\t\\treturn !(b == i.b);\\n\\t\\t}\\n\\t\\tconstexpr value_type start() const {\\n\\t\\t\\treturn a;\\n\\t\\t}\\n\\t\\tconstexpr value_type size() const {\\n\\t\\t\\treturn b;\\n\\t\\t}\\n\\t\\tconstexpr value_type step() const {\\n\\t\\t\\treturn c;\\n\\t\\t}\\n\\t};\\n\\tconstexpr Step(value_type b, value_type c, value_type s) : be(b, c, s) {}\\n\\tconstexpr iterator begin() const {\\n\\t\\treturn be;\\n\\t}\\n\\tconstexpr iterator end() const {\\n\\t\\treturn en;\\n\\t}\\n\\tconstexpr value_type start() const {\\n\\t\\treturn be.start();\\n\\t}\\n\\tconstexpr value_type size() const {\\n\\t\\treturn be.size();\\n\\t}\\n\\tconstexpr value_type step() const {\\n\\t\\treturn be.step();\\n\\t}\\n\\tconstexpr value_type sum() const {\\n\\t\\treturn start() * size() + step() * (size() * (size() - 1) / 2);\\n\\t}\\n\\toperator vector<value_type>() const {\\n\\t\\treturn to_a();\\n\\t}\\n\\tauto to_a() const {\\n\\t\\tvector<value_type> result;\\n\\t\\tresult.reserve(size());\\n\\t\\tfor (auto i : *this) {\\n\\t\\t\\tresult.push_back(i);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n\\nprivate:\\n\\titerator be, en;\\n};\\ntemplate <class T> constexpr auto step(T a) {\\n\\treturn Step<T>(0, a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b) {\\n\\treturn Step<T>(a, b - a, 1);\\n}\\ntemplate <class T> constexpr auto step(T a, T b, T c) {\\n\\treturn Step<T>(a, a < b ? (b - a - 1) / c + 1 : 0, c);\\n}\\n#line 8 \\\"/home/yuruhiya/programming/library/template/Ruby.cpp\\\"\\nusing namespace std;\\n\\ntemplate <class F> struct Callable {\\n\\tF func;\\n\\tCallable(const F& f) : func(f) {}\\n};\\ntemplate <class T, class F> auto operator|(const T& v, const Callable<F>& c) {\\n\\treturn c.func(v);\\n}\\n\\nstruct Sort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const Sort_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Sort;\\nstruct SortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) < f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} SortBy;\\nstruct RSort_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(rbegin(v), rend(v), f);\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, [[maybe_unused]] const RSort_impl& c) {\\n\\t\\tsort(rbegin(v), rend(v));\\n\\t\\treturn v;\\n\\t}\\n} RSort;\\nstruct RSortBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tsort(begin(v), end(v),\\n\\t\\t\\t [&](const auto& i, const auto& j) { return f(i) > f(j); });\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RSortBy;\\nstruct Reverse_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Reverse_impl& c) {\\n\\t\\treverse(begin(v), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Reverse;\\nstruct Unique_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Unique_impl& c) {\\n\\t\\tv.erase(unique(begin(v), end(v), end(v)));\\n\\t\\treturn v;\\n\\t}\\n} Unique;\\nstruct Uniq_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const Uniq_impl& c) {\\n\\t\\tsort(begin(v), end(v));\\n\\t\\tv.erase(unique(begin(v), end(v)), end(v));\\n\\t\\treturn v;\\n\\t}\\n} Uniq;\\nstruct Rotate_impl {\\n\\tauto operator()(int&& left) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tint s = static_cast<int>(size(v));\\n\\t\\t\\tassert(-s <= left && left <= s);\\n\\t\\t\\tif (0 <= left) {\\n\\t\\t\\t\\trotate(begin(v), begin(v) + left, end(v));\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trotate(begin(v), end(v) + left, end(v));\\n\\t\\t\\t}\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} Rotate;\\nstruct Max_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *max_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Max_impl& c) {\\n\\t\\treturn *max_element(begin(v), end(v));\\n\\t}\\n} Max;\\nstruct Min_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) { return *min_element(begin(v), end(v), f); });\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Min_impl& c) {\\n\\t\\treturn *min_element(begin(v), end(v));\\n\\t}\\n} Min;\\nstruct MaxPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MaxPos_impl& c) {\\n\\t\\treturn max_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MaxPos;\\nstruct MinPos_impl {\\n\\ttemplate <class T> friend auto operator|(T v, const MinPos_impl& c) {\\n\\t\\treturn min_element(begin(v), end(v)) - begin(v);\\n\\t}\\n} MinPos;\\nstruct MaxBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_it = begin(v);\\n\\t\\t\\tauto max_val = f(*max_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_it = it;\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *max_it;\\n\\t\\t});\\n\\t}\\n} MaxBy;\\nstruct MinBy_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_it = begin(v);\\n\\t\\t\\tauto min_val = f(*min_it);\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_it = it;\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn *min_it;\\n\\t\\t});\\n\\t}\\n} MinBy;\\nstruct MaxOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto max_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); max_val < val) {\\n\\t\\t\\t\\t\\tmax_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn max_val;\\n\\t\\t});\\n\\t}\\n} MaxOf;\\nstruct MinOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tauto min_val = f(*begin(v));\\n\\t\\t\\tfor (auto it = next(begin(v)); it != end(v); ++it) {\\n\\t\\t\\t\\tif (auto val = f(*it); min_val > val) {\\n\\t\\t\\t\\t\\tmin_val = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn min_val;\\n\\t\\t});\\n\\t}\\n} MinOf;\\nstruct Count_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return count(begin(v), end(v), val); });\\n\\t}\\n} Count;\\nstruct CountIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return count_if(begin(v), end(v), f); });\\n\\t}\\n} CountIf;\\nstruct Index_impl {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find(begin(v), end(v), val);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} Index;\\nstruct IndexIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<int> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(result - begin(v)) : nullopt;\\n\\t\\t});\\n\\t}\\n} IndexIf;\\nstruct FindIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) -> optional<typename decltype(v)::value_type> {\\n\\t\\t\\tauto result = find_if(begin(v), end(v), f);\\n\\t\\t\\treturn result != end(v) ? optional(*result) : nullopt;\\n\\t\\t});\\n\\t}\\n} FindIf;\\nstruct Sum_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\treturn accumulate(next(begin(v)), end(v), f(*begin(v)),\\n\\t\\t\\t [&](const auto& a, const auto& b) { return a + f(b); });\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T> friend auto operator|(T v, const Sum_impl& c) {\\n\\t\\treturn accumulate(begin(v), end(v), typename T::value_type{});\\n\\t}\\n} Sum;\\nstruct Includes {\\n\\ttemplate <class V> auto operator()(const V& val) {\\n\\t\\treturn Callable([&](auto v) { return find(begin(v), end(v), val) != end(v); });\\n\\t}\\n} Includes;\\nstruct IncludesIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) { return find_if(begin(v), end(v), f) != end(v); });\\n\\t}\\n} IncludesIf;\\nstruct RemoveIf_impl {\\n\\ttemplate <class F> auto operator()(const F& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tv.erase(remove_if(begin(v), end(v), f), end(v));\\n\\t\\t\\treturn v;\\n\\t\\t});\\n\\t}\\n} RemoveIf;\\nstruct Each_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tf(i);\\n\\t\\t\\t}\\n\\t\\t});\\n\\t}\\n} Each;\\nstruct Select_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing value_type = typename decltype(v)::value_type;\\n\\t\\t\\tvector<value_type> result;\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) result.push_back(i);\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Select;\\nstruct Map_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tusing result_type = invoke_result_t<F, typename decltype(v)::value_type>;\\n\\t\\t\\tvector<result_type> result;\\n\\t\\t\\tresult.reserve(size(v));\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult.push_back(f(i));\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n} Map;\\nstruct Indexed_impl {\\n\\ttemplate <class T> friend auto operator|(const T& v, Indexed_impl& c) {\\n\\t\\tusing value_type = typename T::value_type;\\n\\t\\tvector<pair<value_type, int>> result;\\n\\t\\tresult.reserve(size(v));\\n\\t\\tint index = 0;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult.emplace_back(i, index++);\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Indexed;\\nstruct AllOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (!f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} AllOf;\\nstruct AnyOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return true;\\n\\t\\t\\t}\\n\\t\\t\\treturn false;\\n\\t\\t});\\n\\t}\\n} AnyOf;\\nstruct NoneOf_impl {\\n\\ttemplate <class F> auto operator()(F&& f) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tif (f(i)) return false;\\n\\t\\t\\t}\\n\\t\\t\\treturn true;\\n\\t\\t});\\n\\t}\\n} NoneOf;\\n\\nstruct Tally_impl {\\n\\ttemplate <class F> auto operator()(size_t max_val) {\\n\\t\\treturn Callable([&](auto v) {\\n\\t\\t\\tvector<size_t> result(max_val);\\n\\t\\t\\tfor (const auto& i : v) {\\n\\t\\t\\t\\tresult[static_cast<size_t>(i)]++;\\n\\t\\t\\t}\\n\\t\\t\\treturn result;\\n\\t\\t});\\n\\t}\\n\\ttemplate <class T, class value_type = typename T::value_type>\\n\\tfriend auto operator|(const T& v, Tally_impl& c) {\\n\\t\\tmap<value_type, size_t> result;\\n\\t\\tfor (const auto& i : v) {\\n\\t\\t\\tresult[i]++;\\n\\t\\t}\\n\\t\\treturn result;\\n\\t}\\n} Tally;\\n\\ntemplate <class T> auto operator*(const vector<T>& a, size_t n) {\\n\\tT result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult.insert(result.end(), a.begin(), a.end());\\n\\t}\\n\\treturn result;\\n}\\nauto operator*(string a, size_t n) {\\n\\tstring result;\\n\\tfor (size_t i = 0; i < n; ++i) {\\n\\t\\tresult += a;\\n\\t}\\n\\treturn result;\\n}\\ntemplate <class T, class U> auto& operator<<(vector<T>& a, const U& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T> auto& operator<<(string& a, const T& b) {\\n\\ta.insert(a.end(), all(b));\\n\\treturn a;\\n}\\ntemplate <class T, class U> auto operator+(vector<T> a, const U& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\ntemplate <class T> auto operator+(string a, const T& b) {\\n\\ta << b;\\n\\treturn a;\\n}\\n#line 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 9 \\\"/home/yuruhiya/programming/library/template/template.cpp\\\"\\n#if __has_include(<library/dump.hpp>)\\n#include <library/dump.hpp>\\n#define LOCAL\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\ntemplate <class T> constexpr T oj_local(const T& oj, const T& local) {\\n#ifndef LOCAL\\n\\treturn oj;\\n#else\\n\\treturn local;\\n#endif\\n}\\n#line 2 \\\"a.cpp\\\"\\n\\nint solve(int limit, int n, int m, int x) {\\n\\tauto [s_name, s_weight, s_value] = in.multiple<string, int, int>(n);\\n\\tauto [name, weight, value] = in.multiple<string, int, int>(m);\\n\\n\\tauto dp = make_vector<int>({m + 1, limit + 1}, -1);\\n\\trep(i, limit + 1) dp[0][i] = 0;\\n\\trep(i, m) {\\n\\t\\tauto dp2 = dp;\\n\\t\\trep(j, m + 1) rep(k, limit) {\\n\\t\\t\\tif (j < m && k + weight[i] <= limit && dp[j][k] != -1) {\\n\\t\\t\\t\\tchmax(dp2[j + 1][k + weight[i]], dp[j][k] + value[i]);\\n\\t\\t\\t}\\n\\t\\t\\tchmax(dp2[j][k + 1], dp2[j][k]);\\n\\t\\t}\\n\\t\\tdp = dp2;\\n\\t}\\n\\n\\tint ans = 0;\\n\\tauto update = [&](int val, int wei) {\\n\\t\\tFOR(i, x, m + 1) {\\n\\t\\t\\tif (limit - wei >= 0) {\\n\\t\\t\\t\\tchmax(ans, dp[i][limit - wei] + val);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t};\\n\\trep(i, n) {\\n\\t\\tupdate(s_value[i], s_weight[i]);\\n\\t}\\n\\trep(i, n) FOR(j, i + 1, n) {\\n\\t\\tupdate(s_value[i] + s_value[j], s_weight[i] + s_weight[j]);\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tini(limit, n, m, x);\\n\\t\\tif (n == 0) break;\\n\\t\\tout(solve(limit, n, m, x));\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3644,\n \"score_of_the_acc\": -0.1685,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2285_3341687\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\\n#define all(x) (x).begin(),(x).end()\\n#define pb push_back\\n#define fi first\\n#define se second\\n#define dbg(x) cout<<#x\\\" = \\\"<<((x))<<endl\\ntemplate<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<\\\"(\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\")\\\";return o;}\\ntemplate<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<\\\"[\\\";for(T t:v){o<<t<<\\\",\\\";}o<<\\\"]\\\";return o;}\\n\\nstruct artist{\\n int cost;\\n int val;\\n\\n void READ(){\\n char name[33];\\n scanf(\\\" %s %d %d\\\", name, &cost, &val);\\n }\\n};\\n\\nconst int M = 111;\\nconst int L = 1001;\\nconst int INF = 10101010;\\n\\nint dp[M][M][L];\\nint mx[L];\\n\\nint main(){\\n int lim,n,m,x;\\n while(scanf(\\\" %d %d %d %d\\\", &lim, &n, &m, &x),lim){\\n vector<artist> a(n),b(m);\\n rep(i,n) a[i].READ();\\n rep(i,m) b[i].READ();\\n\\n rep(i,M)rep(j,M)rep(k,L) dp[i][j][k] = -INF;\\n dp[0][0][0] = 0;\\n rep(i,m)rep(j,i+1)rep(k,L)if(dp[i][j][k]>=0){\\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]);\\n\\n int nk = k+b[i].cost;\\n if(nk<L) dp[i+1][j+1][nk] = max(dp[i+1][j+1][nk], dp[i][j][k]+b[i].val);\\n }\\n\\n rep(i,L) mx[i] = -INF;\\n for(int i=x; i<=m; ++i)rep(j,L) mx[j] = max(mx[j], dp[m][i][j]);\\n rep(i,L-1) mx[i+1] = max(mx[i+1],mx[i]);\\n\\n int ans = -INF;\\n rep(i,n){\\n int rem = lim-a[i].cost;\\n if(rem<0) continue;\\n ans = max(ans, a[i].val+mx[rem]);\\n\\n rep(j,n)if(i!=j){\\n int rr = rem-a[j].cost;\\n if(rr<0) continue;\\n ans = max(ans, a[i].val+a[j].val+mx[rr]);\\n }\\n }\\n printf(\\\"%d\\\\n\\\", ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 51352,\n \"score_of_the_acc\": -1.6667,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2285_2890938\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\n\\nint limit,n,m,x;\\n\\nint a[111],b[111],c[111],d[111];\\nstring damy;\\nint dp[1111][111];\\nbool used[1111][111];\\nint MAX[1111];\\n\\nvoid Input(){\\n rep(i,m){\\n cin>>damy>>c[i]>>d[i];\\n }\\n rep(i,n){\\n cin>>damy>>a[i]>>b[i];\\n }\\n}\\n\\nvoid init(){\\n memset(MAX,0,sizeof(MAX));\\n memset(dp,0,sizeof(dp));\\n memset(used,0,sizeof(used));\\n}\\n\\nvoid DP(){\\n used[0][0]=1;\\n for(int k=0;k<n;k++){\\n for(int i=limit;i>=0;i--){\\n for(int j=n;j>=0;j--){\\n\\tif(used[i][j]){\\n\\t if(i+a[k]<=limit){\\n\\t used[i+a[k]][j+1]=1;\\n\\t dp[i+a[k]][j+1]=max(dp[i+a[k]][j+1],dp[i][j]+b[k]);\\n\\t }\\n\\t}\\n }\\n }\\n }\\n\\n for(int i=0;i<=limit;i++){\\n for(int j=x;j<=n;j++){\\n MAX[i]=max(MAX[i],dp[i][j]);\\n }\\n }\\n\\n int ans=0;\\n\\n for(int i=0;i<m;i++){\\n for(int j=i+1;j<m;j++){\\n for(int k=0;k<limit;k++){\\n\\tif(k+c[i]+c[j]>limit)break;\\n\\tans=max(ans,MAX[k]+d[i]+d[j]);\\n }\\n }\\n }\\n\\n for(int i=0;i<m;i++){\\n for(int k=0;k<limit;k++){\\n if(k+c[i]>limit)break;\\n ans=max(ans,MAX[k]+d[i]);\\n }\\n }\\n\\n cout << ans << endl;\\n \\n}\\n\\n\\nint main(){\\n while( cin>>limit>>m>>n>>x,limit){\\n Input();\\n init();\\n DP();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3612,\n \"score_of_the_acc\": -0.0846,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2285_2890891\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nInt dp[111][1111];\\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;}\\nsigned main(){ \\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n Int l,n,m,x;\\n while(cin>>l>>n>>m>>x,l){\\n string st;\\n vector<Int> se(n),ss(n);\\n vector<Int> e(m),s(m);\\n for(Int i=0;i<n;i++) cin>>st>>se[i]>>ss[i];\\n for(Int i=0;i<m;i++) cin>>st>>e[i]>>s[i];\\n \\n const Int INF = 1e9;\\n for(Int i=0;i<111;i++)\\n for(Int j=0;j<1111;j++)\\n\\tdp[i][j]=-INF;\\n\\n dp[0][0]=0;\\n for(Int k=0;k<m;k++)\\n for(Int i=m;i>=0;i--)\\n\\tfor(Int j=l;j>=0;j--)\\n\\t chmax(dp[i+1][j+e[k]],dp[i][j]+s[k]);\\n \\n vector<Int> dp2(l+1,-INF);\\n for(Int i=x;i<=m;i++)\\n for(Int j=0;j<=l;j++)\\n\\tchmax(dp2[j],dp[i][j]);\\n\\n for(Int j=1;j<=l;j++) chmax(dp2[j],dp2[j-1]);\\n\\n Int ans=-INF;\\n for(Int i=0;i<n;i++){\\n if(se[i]>l) continue;\\n chmax(ans,dp2[l-se[i]]+ss[i]);\\n for(Int j=0;j<i;j++){\\n\\tif(se[i]+se[j]>l) continue;\\n\\tchmax(ans,dp2[l-(se[i]+se[j])]+ss[i]+ss[j]);\\n }\\n }\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4156,\n \"score_of_the_acc\": -0.0538,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2285_2890455\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\n\\nint limit,n,m,x;\\n\\nint a[111],b[111],c[111],d[111];\\nstring damy;\\nint dp[1111][111];\\nbool used[1111][111];\\nint MAX[1111];\\n\\nvoid Input(){\\n rep(i,m){\\n cin>>damy>>c[i]>>d[i];\\n }\\n rep(i,n){\\n cin>>damy>>a[i]>>b[i];\\n }\\n}\\n\\nvoid init(){\\n memset(MAX,0,sizeof(MAX));\\n memset(dp,0,sizeof(dp));\\n memset(used,0,sizeof(used));\\n}\\n\\nvoid DP(){\\n used[0][0]=1;\\n for(int k=0;k<n;k++){\\n for(int i=limit;i>=0;i--){\\n for(int j=n;j>=0;j--){\\n\\tif(used[i][j]){\\n\\t if(i+a[k]<=limit){\\n\\t used[i+a[k]][j+1]=1;\\n\\t dp[i+a[k]][j+1]=max(dp[i+a[k]][j+1],dp[i][j]+b[k]);\\n\\t }\\n\\t}\\n }\\n }\\n }\\n\\n for(int i=0;i<=limit;i++){\\n for(int j=x;j<=n;j++){\\n MAX[i]=max(MAX[i],dp[i][j]);\\n }\\n }\\n\\n int ans=0;\\n\\n for(int i=0;i<m;i++){\\n for(int j=i+1;j<m;j++){\\n for(int k=0;k<limit;k++){\\n\\tif(k+c[i]+c[j]>limit)break;\\n\\tans=max(ans,MAX[k]+d[i]+d[j]);\\n }\\n }\\n }\\n\\n for(int i=0;i<m;i++){\\n for(int k=0;k<limit;k++){\\n if(k+c[i]>limit)break;\\n ans=max(ans,MAX[k]+d[i]);\\n }\\n }\\n\\n cout << ans << endl;\\n \\n}\\n\\n\\nint main(){\\n while( cin>>limit>>m>>n>>x,limit){\\n Input();\\n init();\\n DP();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3756,\n \"score_of_the_acc\": -0.0875,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2285_2890421\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nInt dp[111][1111];\\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;}\\nsigned main(){ \\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n Int l,n,m,x;\\n while(cin>>l>>n>>m>>x,l){\\n string st;\\n vector<Int> se(n),ss(n);\\n vector<Int> e(m),s(m);\\n for(Int i=0;i<n;i++) cin>>st>>se[i]>>ss[i];\\n for(Int i=0;i<m;i++) cin>>st>>e[i]>>s[i];\\n \\n const Int INF = 1e9;\\n for(Int i=0;i<111;i++)\\n for(Int j=0;j<1111;j++)\\n\\tdp[i][j]=-INF;\\n\\n dp[0][0]=0;\\n for(Int k=0;k<m;k++)\\n for(Int i=m;i>=0;i--)\\n\\tfor(Int j=l;j>=0;j--)\\n\\t chmax(dp[i+1][j+e[k]],dp[i][j]+s[k]);\\n \\n vector<Int> dp2(l+1,-INF);\\n for(Int i=x;i<=m;i++)\\n for(Int j=0;j<=l;j++)\\n\\tchmax(dp2[j],dp[i][j]);\\n\\n for(Int j=1;j<=l;j++) chmax(dp2[j],dp2[j-1]);\\n\\n Int ans=-INF;\\n for(Int i=0;i<n;i++){\\n if(se[i]>l) continue;\\n chmax(ans,dp2[l-se[i]]+ss[i]);\\n for(Int j=0;j<i;j++){\\n\\tif(se[i]+se[j]>l) continue;\\n\\tchmax(ans,dp2[l-(se[i]+se[j])]+ss[i]+ss[j]);\\n }\\n }\\n cout<<ans<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4036,\n \"score_of_the_acc\": -0.0514,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2285_2560007\",\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\\nint LIMIT,N,M,X;\\n\\nstruct Info{\\n\\tint cost,value;\\n};\\n\\nstruct Data{\\n\\tData(int arg_num,int arg_cost){\\n\\t\\tnum = arg_num;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\tint num,cost;\\n};\\n\\nvoid func(){\\n\\n\\tInfo sec[N];\\n\\n\\tchar buf[31];\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%s %d %d\\\",buf,&sec[i].cost,&sec[i].value);\\n\\t}\\n\\n\\tint dp_sec[3][21],next_sec[3][21];\\n\\n\\tfor(int num = 0; num <= 2; num++){\\n\\t\\tfor(int total_cost = 0; total_cost <= 20; total_cost++){\\n\\t\\t\\tdp_sec[num][total_cost] = -1;\\n\\t\\t\\tnext_sec[num][total_cost] = -1;\\n\\t\\t}\\n\\t}\\n\\n\\tdp_sec[0][0] = 0;\\n\\tnext_sec[0][0] = 0;\\n\\n\\tvector<Data> Updated;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tfor(int num = 0; num <= 1; num++){\\n\\t\\t\\tfor(int total_cost = 0; total_cost+sec[i].cost <= 20; total_cost++){\\n\\t\\t\\t\\tif(dp_sec[num][total_cost] == -1)continue;\\n\\n\\t\\t\\t\\tif(next_sec[num+1][total_cost+sec[i].cost] < dp_sec[num][total_cost]+sec[i].value){\\n\\t\\t\\t\\t\\tnext_sec[num+1][total_cost+sec[i].cost] = dp_sec[num][total_cost]+sec[i].value;\\n\\t\\t\\t\\t\\tUpdated.push_back(Data(num+1,total_cost+sec[i].cost));\\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_sec[Updated[k].num][Updated[k].cost] = next_sec[Updated[k].num][Updated[k].cost];\\n\\t\\t}\\n\\t\\tUpdated.clear();\\n\\t}\\n\\n\\tInfo stan[M];\\n\\tint cost_sum = 0;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tscanf(\\\"%s %d %d\\\",buf,&stan[i].cost,&stan[i].value);\\n\\t\\tcost_sum += stan[i].cost;\\n\\t}\\n\\n\\tint dp_stan[M+1][cost_sum+1],next_stan[M+1][cost_sum+1];\\n\\n\\tfor(int num = 0; num <= M; num++){\\n\\t\\tfor(int total_cost = 0; total_cost <= cost_sum; total_cost++){\\n\\t\\t\\tdp_stan[num][total_cost] = -1;\\n\\t\\t\\tnext_stan[num][total_cost] = -1;\\n\\t\\t}\\n\\t}\\n\\n\\tdp_stan[0][0] = 0;\\n\\tnext_stan[0][0] = 0;\\n\\tUpdated.clear();\\n\\n\\tfor(int i = 0; i < M; i++){ //100\\n\\n\\t\\tfor(int num = 0; num <= M-1; num++){ //100\\n\\t\\t\\tfor(int total_cost = 0; total_cost+stan[i].cost <= cost_sum; total_cost++){ //1000\\n\\t\\t\\t\\tif(dp_stan[num][total_cost] == -1)continue;\\n\\n\\t\\t\\t\\tif(next_stan[num+1][total_cost+stan[i].cost] < dp_stan[num][total_cost]+stan[i].value){\\n\\t\\t\\t\\t\\tnext_stan[num+1][total_cost+stan[i].cost] = dp_stan[num][total_cost]+stan[i].value;\\n\\t\\t\\t\\t\\tUpdated.push_back(Data(num+1,total_cost+stan[i].cost));\\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_stan[Updated[k].num][Updated[k].cost] = next_stan[Updated[k].num][Updated[k].cost];\\n\\t\\t}\\n\\t\\tUpdated.clear();\\n\\t}\\n\\n\\tint ans = 0;\\n\\n\\tfor(int sec_num = 1; sec_num <= 2; sec_num++){\\n\\t\\tfor(int sec_cost = 0; sec_cost <= 20; sec_cost++){\\n\\t\\t\\tif(dp_sec[sec_num][sec_cost] == -1)continue;\\n\\t\\t\\tfor(int stan_num = X; stan_num <= M; stan_num++){\\n\\t\\t\\t\\tfor(int stan_cost = 0; stan_cost <= min(LIMIT,cost_sum); stan_cost++){\\n\\t\\t\\t\\t\\tif(dp_stan[stan_num][stan_cost] == -1)continue;\\n\\t\\t\\t\\t\\tif(sec_cost+stan_cost > LIMIT)continue;\\n\\n\\t\\t\\t\\t\\tans = max(ans,dp_sec[sec_num][sec_cost]+dp_stan[stan_num][stan_cost]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d %d %d\\\",&LIMIT,&N,&M,&X);\\n\\t\\tif(LIMIT == 0 && N == 0 && M == 0 && X == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -0.0456,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2285_2560006\",\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\\nint LIMIT,N,M,X;\\nint dp_sec[3][21],next_sec[3][21];\\nint dp_stan[101][1001],next_stan[101][1001];\\n\\nstruct Info{\\n\\tint cost,value;\\n};\\n\\nstruct Data{\\n\\tData(int arg_num,int arg_cost){\\n\\t\\tnum = arg_num;\\n\\t\\tcost = arg_cost;\\n\\t}\\n\\tint num,cost;\\n};\\n\\nvoid func(){\\n\\n\\tInfo sec[N];\\n\\n\\tchar buf[31];\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%s %d %d\\\",buf,&sec[i].cost,&sec[i].value);\\n\\t}\\n\\n\\tfor(int num = 0; num <= 2; num++){\\n\\t\\tfor(int total_cost = 0; total_cost <= 20; total_cost++){\\n\\t\\t\\tdp_sec[num][total_cost] = -1;\\n\\t\\t\\tnext_sec[num][total_cost] = -1;\\n\\t\\t}\\n\\t}\\n\\n\\tdp_sec[0][0] = 0;\\n\\tnext_sec[0][0] = 0;\\n\\n\\tvector<Data> Updated;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tfor(int num = 0; num <= 1; num++){\\n\\t\\t\\tfor(int total_cost = 0; total_cost+sec[i].cost <= 20; total_cost++){\\n\\t\\t\\t\\tif(dp_sec[num][total_cost] == -1)continue;\\n\\n\\t\\t\\t\\tif(next_sec[num+1][total_cost+sec[i].cost] < dp_sec[num][total_cost]+sec[i].value){\\n\\t\\t\\t\\t\\tnext_sec[num+1][total_cost+sec[i].cost] = dp_sec[num][total_cost]+sec[i].value;\\n\\t\\t\\t\\t\\tUpdated.push_back(Data(num+1,total_cost+sec[i].cost));\\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_sec[Updated[k].num][Updated[k].cost] = next_sec[Updated[k].num][Updated[k].cost];\\n\\t\\t}\\n\\t\\tUpdated.clear();\\n\\t}\\n\\n\\tInfo stan[M];\\n\\tint cost_sum = 0;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tscanf(\\\"%s %d %d\\\",buf,&stan[i].cost,&stan[i].value);\\n\\t\\tcost_sum += stan[i].cost;\\n\\t}\\n\\n\\tfor(int num = 0; num <= M; num++){\\n\\t\\tfor(int total_cost = 0; total_cost <= 1000; total_cost++){\\n\\t\\t\\tdp_stan[num][total_cost] = -1;\\n\\t\\t\\tnext_stan[num][total_cost] = -1;\\n\\t\\t}\\n\\t}\\n\\n\\tdp_stan[0][0] = 0;\\n\\tnext_stan[0][0] = 0;\\n\\tUpdated.clear();\\n\\n\\tfor(int i = 0; i < M; i++){ //100\\n\\n\\t\\tfor(int num = 0; num <= M-1; num++){ //100\\n\\t\\t\\tfor(int total_cost = 0; total_cost+stan[i].cost <= cost_sum; total_cost++){ //1000\\n\\t\\t\\t\\tif(dp_stan[num][total_cost] == -1)continue;\\n\\n\\t\\t\\t\\tif(next_stan[num+1][total_cost+stan[i].cost] < dp_stan[num][total_cost]+stan[i].value){\\n\\t\\t\\t\\t\\tnext_stan[num+1][total_cost+stan[i].cost] = dp_stan[num][total_cost]+stan[i].value;\\n\\t\\t\\t\\t\\tUpdated.push_back(Data(num+1,total_cost+stan[i].cost));\\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_stan[Updated[k].num][Updated[k].cost] = next_stan[Updated[k].num][Updated[k].cost];\\n\\t\\t}\\n\\t\\tUpdated.clear();\\n\\t}\\n\\n\\tint ans = 0;\\n\\n\\tfor(int sec_num = 1; sec_num <= 2; sec_num++){\\n\\t\\tfor(int sec_cost = 0; sec_cost <= 20; sec_cost++){\\n\\t\\t\\tif(dp_sec[sec_num][sec_cost] == -1)continue;\\n\\t\\t\\tfor(int stan_num = X; stan_num <= M; stan_num++){\\n\\t\\t\\t\\tfor(int stan_cost = 0; stan_cost <= LIMIT; stan_cost++){\\n\\t\\t\\t\\t\\tif(dp_stan[stan_num][stan_cost] == -1)continue;\\n\\t\\t\\t\\t\\tif(sec_cost+stan_cost > LIMIT)continue;\\n\\n\\t\\t\\t\\t\\tans = max(ans,dp_sec[sec_num][sec_cost]+dp_stan[stan_num][stan_cost]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%d %d %d %d\\\",&LIMIT,&N,&M,&X);\\n\\t\\tif(LIMIT == 0 && N == 0 && M == 0 && X == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4084,\n \"score_of_the_acc\": -0.0524,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2285_1879617\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX 1010\\n#define MAX_M 101\\n\\nint dp[MAX_M][MAX];\\n\\nint main()\\n{\\n int LIMIT, N, M, X;\\n string name;\\n while (cin >> LIMIT >> N >> M >> X, LIMIT) {\\n vector<int> c(N), s(N);\\n for (int i = 0; i < N; i++) {\\n cin >> name >> c[i] >> s[i];\\n }\\n int max_s[MAX];\\n fill(max_s, max_s + MAX, -1);\\n for (int i = 0; i < N; i++) {\\n max_s[c[i]] = max(max_s[c[i]], s[i]);\\n for (int j = i + 1; j < N; j++) {\\n max_s[c[i] + c[j]] = max(max_s[c[i] + c[j]], s[i] + s[j]);\\n }\\n }\\n for (int i = 0; i < LIMIT; i++) {\\n max_s[i+1] = max(max_s[i+1], max_s[i]);\\n }\\n vector<int> sc(M), ss(M);\\n for (int i = 0; i < M; i++) {\\n cin >> name >> sc[i] >> ss[i];\\n }\\n for (int i = 0; i <= M; i++) {\\n for (int j = 0; j <= LIMIT; j++) {\\n dp[i][j] = -1;\\n }\\n }\\n dp[0][0] = 0;\\n for (int i = 0; i < M; i++) {\\n for (int j = M-1; j >= 0; j--) {\\n for (int k = LIMIT-sc[i]; k >= 0; k--) {\\n if (dp[j][k] == -1) continue;\\n int nk = k + sc[i];\\n if (nk <= LIMIT) {\\n dp[j+1][nk] = max(dp[j+1][nk], dp[j][k] + ss[i]);\\n }\\n }\\n }\\n }\\n \\n int res = 0;\\n for (int i = 0; i <= LIMIT; i++) {\\n if (max_s[i] == -1) continue;\\n for (int j = X; j <= M; j++) {\\n if (dp[j][LIMIT-i] == -1) continue;\\n res = max(res, max_s[i] + dp[j][LIMIT-i]); \\n }\\n }\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3540,\n \"score_of_the_acc\": -0.0415,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2285_1805140\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX 1010\\n#define MAX_M 101\\n\\nint dp[MAX_M][MAX_M][MAX];\\n\\nint main()\\n{\\n int LIMIT, N, M, X;\\n string name;\\n while (cin >> LIMIT >> N >> M >> X, LIMIT) {\\n vector<int> c(N), s(N);\\n for (int i = 0; i < N; i++) {\\n cin >> name >> c[i] >> s[i];\\n }\\n int max_s[MAX];\\n fill(max_s, max_s + MAX, -1);\\n for (int i = 0; i < N; i++) {\\n max_s[c[i]] = max(max_s[c[i]], s[i]);\\n for (int j = i + 1; j < N; j++) {\\n max_s[c[i] + c[j]] = max(max_s[c[i] + c[j]], s[i] + s[j]);\\n }\\n }\\n for (int i = 0; i < LIMIT; i++) {\\n max_s[i+1] = max(max_s[i+1], max_s[i]);\\n }\\n vector<int> sc(M), ss(M);\\n for (int i = 0; i < M; i++) {\\n cin >> name >> sc[i] >> ss[i];\\n }\\n for (int i = 0; i <= M; i++) {\\n for (int j = 0; j <= M; j++) {\\n for (int k = 0; k <= LIMIT; k++) {\\n dp[i][j][k] = -1;\\n }\\n }\\n dp[i][0][0] = 0;\\n }\\n \\n for (int i = 0; i < M; i++) {\\n for (int j = 0; j <= M; j++) {\\n for (int k = LIMIT; k >= 0; k--) {\\n if (dp[i][j][k] == -1) continue;\\n int nk = k + sc[i];\\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]);\\n if (nk <= LIMIT) {\\n dp[i+1][j+1][nk] = max(dp[i+1][j+1][nk], dp[i][j][k] + ss[i]);\\n }\\n }\\n }\\n } \\n \\n int res = 0;\\n for (int i = 0; i <= LIMIT; i++) {\\n if (max_s[i] == -1) continue;\\n for (int j = 0; j <= M; j++) {\\n for (int k = X; k <= M; k++) {\\n if (dp[j][k][LIMIT-i] == -1) continue;\\n res = max(res, max_s[i] + dp[j][k][LIMIT-i]); \\n }\\n }\\n }\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 41452,\n \"score_of_the_acc\": -1.0099,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2285_1805138\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define MAX 1010\\n#define MAX_M 101\\n\\nint dp[MAX_M][MAX_M][MAX];\\n\\nint main()\\n{\\n int LIMIT, N, M, X;\\n string name;\\n while (cin >> LIMIT >> N >> M >> X, LIMIT) {\\n vector<int> c(N), s(N);\\n for (int i = 0; i < N; i++) {\\n cin >> name >> c[i] >> s[i];\\n }\\n int max_s[MAX];\\n fill(max_s, max_s + MAX, -1);\\n for (int i = 0; i < N; i++) {\\n max_s[c[i]] = max(max_s[c[i]], s[i]);\\n for (int j = i + 1; j < N; j++) {\\n max_s[c[i] + c[j]] = max(max_s[c[i] + c[j]], s[i] + s[j]);\\n }\\n }\\n for (int i = 0; i < LIMIT; i++) {\\n max_s[i+1] = max(max_s[i+1], max_s[i]);\\n }\\n vector<int> sc(M), ss(M);\\n for (int i = 0; i < M; i++) {\\n cin >> name >> sc[i] >> ss[i];\\n }\\n for (int i = 0; i <= M; i++) {\\n for (int j = 0; j <= M; j++) {\\n for (int k = 0; k <= LIMIT; k++) {\\n dp[i][j][k] = -1;\\n }\\n }\\n dp[i][0][0] = 0;\\n }\\n \\n for (int i = 0; i < M; i++) {\\n for (int j = 0; j <= M; j++) {\\n for (int k = LIMIT; k >= 0; k--) {\\n if (dp[i][j][k] == -1) continue;\\n int nk = k + sc[i];\\n dp[i+1][j][k] = max(dp[i+1][j][k], dp[i][j][k]);\\n dp[i+1][j+1][nk] = max(dp[i+1][j+1][nk], dp[i][j][k] + ss[i]);\\n }\\n }\\n } \\n \\n int res = 0;\\n for (int i = 0; i <= LIMIT; i++) {\\n if (max_s[i] == -1) continue;\\n for (int j = 0; j <= M; j++) {\\n for (int k = X; k <= M; k++) {\\n if (dp[j][k][LIMIT-i] == -1) continue;\\n res = max(res, max_s[i] + dp[j][k][LIMIT-i]); \\n }\\n }\\n }\\n cout << res << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 41456,\n \"score_of_the_acc\": -1.0099,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2285_1472640\",\n \"code_snippet\": \"#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<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_L = 1000;\\nconst int MAX_N = 100;\\nconst int MAX_M = 100;\\n\\n/* typedef */\\n\\ntypedef pair<int,int> pii;\\n\\n/* global variables */\\n\\nint lim, n, m, x;\\npii secs[MAX_N], stds[MAX_M];\\nint dp0[3][MAX_L + 1], dp1[MAX_M + 1][MAX_L + 1];\\n\\n/* subroutines */\\n\\n/* main */\\n\\nint main() {\\n for (;;) {\\n cin >> lim >> n >> m >> x;\\n if (lim == 0) break;\\n\\n string name;\\n for (int i = 0; i < n; i++)\\n cin >> name >> secs[i].first >> secs[i].second;\\n for (int i = 0; i < m; i++)\\n cin >> name >> stds[i].first >> stds[i].second;\\n\\n memset(dp0, -1, sizeof(dp0));\\n dp0[0][0] = 0;\\n\\n for (int i = 0; i < n; i++) {\\n int &ei = secs[i].first, &si = secs[i].second;\\n int maxl = lim - ei;\\n for (int j = 1; j >= 0; j--)\\n\\tfor (int l = 0; l <= maxl; l++)\\n\\t if (dp0[j][l] >= 0 && dp0[j + 1][l + ei] < dp0[j][l] + si)\\n\\t dp0[j + 1][l + ei] = dp0[j][l] + si;\\n }\\n\\n for (int i = 1; i <= 2; i++)\\n for (int l = 1; l <= lim; l++)\\n\\tif (dp0[i][l] < dp0[i][l - 1]) dp0[i][l] = dp0[i][l - 1];\\n \\n memset(dp1, -1, sizeof(dp1));\\n dp1[0][0] = 0;\\n\\n for (int i = 0; i < m; i++) {\\n int &ei = stds[i].first, &si = stds[i].second;\\n int maxl = lim - ei;\\n for (int j = m - 1; j >= 0; j--)\\n\\tfor (int l = 0; l <= maxl; l++)\\n\\t if (dp1[j][l] >= 0 && dp1[j + 1][l + ei] < dp1[j][l] + si)\\n\\t dp1[j + 1][l + ei] = dp1[j][l] + si;\\n }\\n \\n for (int i = 1; i <= m; i++)\\n for (int l = 1; l <= lim; l++)\\n\\tif (dp1[i][l] < dp1[i][l - 1]) dp1[i][l] = dp1[i][l - 1];\\n\\n int maxsum = 0;\\n\\n for (int i = 1; i <= 2; i++)\\n for (int j = x; j <= m; j++)\\n\\tfor (int l = 0; l <= lim; l++)\\n\\t if (dp0[i][l] >= 0 && dp1[j][lim - l] >= 0) {\\n\\t int sum = dp0[i][l] + dp1[j][lim - l];\\n\\t if (maxsum < sum) maxsum = sum;\\n\\t }\\n\\n cout << maxsum << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1620,\n \"score_of_the_acc\": -0.0446,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2285_1358203\",\n \"code_snippet\": \"#include <algorithm>\\n#include <functional>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <string>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <climits>\\n\\n#define all(c) (c).begin(), (c).end()\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define pb(e) push_back(e)\\n#define mp(a, b) make_pair(a, b)\\n#define fr first\\n#define sc second\\n\\nconst int INF=100000000;\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nusing namespace std;\\ntypedef pair<int ,int > P;\\ntypedef long long ll;\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {\\n if(a<b) {\\n a=b;\\n return true;\\n }\\n\\n return false;\\n}\\nstruct Artist {\\n int e,s;\\n Artist(int e=0,int s=0) :\\n e(e),s(s) {}\\n};\\nvoid input(int len, Artist *a) {\\n rep(i,len) {\\n string ss;\\n int e,s;\\n cin>>ss>>e>>s;\\n a[i]=Artist(e,s);\\n }\\n}\\nArtist artist1[102], artist2[102];\\n// ??????????????????????????°?????????\\nint dp1[102][5][1003];\\nint dp2[102][102][1003];\\n\\nint lim,n,m,x;\\n\\nvoid solve() {\\n rep(i,102) rep(j,5) rep(k,1003) dp1[i][j][k]=-1;\\n rep(i,102) rep(j,102) rep(k,1003) dp2[i][j][k]=-1;\\n\\n input(n,artist1);\\n input(m,artist2);\\n dp1[0][0][0]=dp2[0][0][0]=0;\\n\\n rep(k,lim) rep(i,n) rep(j,3) {\\n Artist a=artist1[i];\\n int lim_n = k+a.e;\\n if(lim_n <= lim&&dp1[i][j][k]!=-1) \\n chmax(dp1[i+1][j+1][lim_n],dp1[i][j][k]+a.s);\\n chmax(dp1[i+1][j][k],dp1[i][j][k]);\\n }\\n rep(k,lim) rep(i,m) rep(j,m) {\\n Artist a=artist2[i];\\n int lim_n = k+a.e;\\n if(lim_n <= lim&&dp2[i][j][k]!=-1) \\n chmax(dp2[i+1][j+1][lim_n],dp2[i][j][k]+a.s);\\n chmax(dp2[i+1][j][k],dp2[i][j][k]);\\n }\\n\\n //rep(i,20) printf(\\\"%d %d\\\\n\\\",i,dp1[n][2][i]);\\n //rep(i,20) printf(\\\"%d %d\\\\n\\\",i,dp2[m][2][i]);\\n\\n int ans=0;\\n rep(i,lim) {\\n int max1=max(dp1[n][1][i],dp1[n][2][i]);\\n int max2=0;\\n for(int j=x;j<=m;j++) for(int k=0;k<=lim-i;k++) chmax(max2,dp2[m][j][k]);\\n\\n chmax(ans,max1+max2);\\n // printf(\\\"%d %d : %d\\\\n\\\",i,lim-i,max1+max2);\\n }\\n\\n cout<<ans<<endl;\\n}\\n\\nint main() {\\n while(cin>>lim>>n>>m>>x) {\\n if(lim+n+m+x==0) break;\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 43968,\n \"score_of_the_acc\": -1.7686,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2285_1358081\",\n \"code_snippet\": \"#include <algorithm>\\n#include <functional>\\n#include <cmath>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <string>\\n#include <sstream>\\n#include <iostream>\\n#include <iomanip>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <climits>\\n\\n#define all(c) (c).begin(), (c).end()\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define pb(e) push_back(e)\\n#define mp(a, b) make_pair(a, b)\\n#define fr first\\n#define sc second\\n\\nconst int INF=100000000;\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nusing namespace std;\\ntypedef pair<int ,int > P;\\ntypedef long long ll;\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {\\n if(a<b) {\\n a=b;\\n return true;\\n }\\n\\n return false;\\n}\\nstruct Artist {\\n int e,s;\\n Artist(int e=0,int s=0) :\\n e(e),s(s) {}\\n};\\nvoid input(int len, Artist *a) {\\n rep(i,len) {\\n string ss;\\n int e,s;\\n cin>>ss>>e>>s;\\n a[i]=Artist(e,s);\\n }\\n}\\nArtist artist1[102], artist2[102];\\n// ??????????????????????????°?????????\\nint dp1[102][5][1003];\\nint dp2[102][102][1003];\\n\\nint lim,n,m,x;\\n\\nvoid solve() {\\n rep(i,102) rep(j,5) rep(k,1003) dp1[i][j][k]=-1;\\n rep(i,102) rep(j,102) rep(k,1003) dp2[i][j][k]=-1;\\n\\n input(n,artist1);\\n input(m,artist2);\\n dp1[0][0][0]=dp2[0][0][0]=0;\\n\\n rep(i,n) rep(j,3) rep(k,lim) {\\n Artist a=artist1[i];\\n int lim_n = k+a.e;\\n if(lim_n <= lim&&dp1[i][j][k]!=-1) \\n chmax(dp1[i+1][j+1][lim_n],dp1[i][j][k]+a.s);\\n chmax(dp1[i+1][j][k],dp1[i][j][k]);\\n }\\n rep(i,m) rep(j,m) rep(k,lim) {\\n Artist a=artist2[i];\\n int lim_n = k+a.e;\\n if(lim_n <= lim&&dp2[i][j][k]!=-1) \\n chmax(dp2[i+1][j+1][lim_n],dp2[i][j][k]+a.s);\\n chmax(dp2[i+1][j][k],dp2[i][j][k]);\\n }\\n\\n //rep(i,20) printf(\\\"%d %d\\\\n\\\",i,dp1[n][2][i]);\\n //rep(i,20) printf(\\\"%d %d\\\\n\\\",i,dp2[m][2][i]);\\n\\n int ans=0;\\n rep(i,lim) {\\n int max1=max(dp1[n][1][i],dp1[n][2][i]);\\n int max2=0;\\n for(int j=x;j<=m;j++) for(int k=0;k<=lim-i;k++) chmax(max2,dp2[m][j][k]);\\n\\n chmax(ans,max1+max2);\\n // printf(\\\"%d %d : %d\\\\n\\\",i,lim-i,max1+max2);\\n }\\n\\n cout<<ans<<endl;\\n}\\n\\nint main() {\\n while(cin>>lim>>n>>m>>x) {\\n if(lim+n+m+x==0) break;\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 43968,\n \"score_of_the_acc\": -1.4353,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2285_1111626\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar in[100];\\nint dp[110][1010];\\nint val[1010];\\nint sp[110];\\nint sq[110];\\nint np[110];\\nint nq[110];\\nint main(){\\n\\tint a,b,c,d;\\n\\twhile(scanf(\\\"%d%d%d%d\\\",&a,&b,&c,&d),a){\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tscanf(\\\"%s%d%d\\\",in,sp+i,sq+i);\\n\\t\\t}\\n\\t\\tfor(int i=0;i<c;i++)scanf(\\\"%s%d%d\\\",in,np+i,nq+i);\\n\\t\\tfor(int i=0;i<110;i++)for(int j=0;j<1010;j++)dp[i][j]=-99999999;\\n\\t\\tdp[0][0]=0;\\n\\t\\tfor(int i=0;i<c;i++){\\n\\t\\t\\tfor(int j=i;j>=0;j--){\\n\\t\\t\\t\\tfor(int k=a-np[i];k>=0;k--){\\n\\t\\t\\t\\t\\tdp[j+1][k+np[i]]=max(dp[j+1][k+np[i]],dp[j][k]+nq[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(int i=0;i<1010;i++)val[i]=-99999999;\\n\\t\\tfor(int i=d;i<=c;i++)for(int j=0;j<=a;j++)val[j]=max(val[j],dp[i][j]);\\n\\t\\tint ret=0;\\n\\t\\tfor(int i=0;i<b;i++){\\n\\t\\t\\tfor(int j=0;j<=a-sp[i];j++){\\n\\t\\t//\\t\\tif(sq[i]+val[j]==59)printf(\\\"%d %d\\\\n\\\",i,j);\\n\\t\\t\\t\\tret=max(ret,sq[i]+val[j]);\\n\\t\\t\\t}\\n\\t\\t\\tfor(int j=i+1;j<b;j++){\\n\\t\\t\\t\\tfor(int k=0;k<=a-sp[i]-sp[j];k++){\\n\\t\\t\\t//\\t\\tif(sq[i]+sq[j]+val[k]==59)printf(\\\"%d %d %d\\\\n\\\",i,j,k);\\n\\t\\t\\t\\t\\tret=max(ret,sq[i]+sq[j]+val[k]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",ret);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1472,\n \"score_of_the_acc\": -0.0833,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2285_1096584\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <complex>\\n#include <string>\\n#include <sstream>\\n#include <algorithm>\\n#include <numeric>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <iostream>\\n#include <map>\\n#include <set>\\nusing namespace std;\\ntypedef pair<int,int> P;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\n#define pu push\\n#define pb push_back\\n#define mp make_pair\\n#define eps 1e-9\\n#define INF 2000000000\\n#define sz(x) ((int)(x).size())\\n#define fi first\\n#define sec second\\n#define SORT(x) sort((x).begin(),(x).end())\\n#define all(x) (x).begin(),(x).end()\\n#define EQ(a,b) (abs((a)-(b))<eps)\\ntemplate<class T> void chmax(T& a,const T b){if(a<b)a=b;}\\nchar name[105][40],sname[105][40];\\nint se[105],ss[105],e[105],s[105];\\nint dp[2][1005][3][105];\\nint Limit,N,M,X;\\nint main()\\n{\\n\\twhile(1)\\n\\t{\\n\\t\\tscanf(\\\"%d %d %d %d\\\",&Limit,&N,&M,&X);\\n\\t\\tif(Limit==0&&N==0&&M==0&&X==0)break;\\n\\t\\tfor(int i=0;i<N;i++)scanf(\\\"%s %d %d\\\",sname[i],&se[i],&ss[i]);\\n\\t\\tfor(int i=0;i<M;i++)scanf(\\\"%s %d %d\\\",name[i],&e[i],&s[i]);\\n\\t\\tmemset(dp,-1,sizeof(dp));\\n\\t\\tdp[0][0][0][0]=0;\\n\\t\\tint ans=0;\\n\\t\\tfor(int i=0;i<N+M;i++)\\n\\t\\t{\\n\\t\\t\\tmemset(dp[(i+1)%2],-1,sizeof(dp[(i+1)%2]));\\n\\t\\t\\tfor(int j=0;j<=Limit;j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(i<N)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor(int k=0;k<3;k++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tif(dp[i%2][j][k][0]==-1)continue;\\n\\t\\t\\t\\t\\t\\tchmax(dp[(i+1)%2][j][k][0],dp[i%2][j][k][0]);\\n\\t\\t\\t\\t\\t\\tif(j+se[i]>Limit||k>=2)continue;\\n\\t\\t\\t\\t\\t\\tchmax(dp[(i+1)%2][j+se[i]][k+1][0],dp[i%2][j][k][0]+ss[i]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tint idx=i-N;\\n\\t\\t\\t\\t\\tfor(int k=1;k<3;k++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tfor(int l=0;l<=M;l++)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif(dp[i%2][j][k][l]==-1)continue;\\n\\t\\t\\t\\t\\t\\t\\tchmax(dp[(i+1)%2][j][k][l],dp[i%2][j][k][l]);\\n\\t\\t\\t\\t\\t\\t\\tif(j+e[idx]>Limit||l>=M)continue;\\n\\t\\t\\t\\t\\t\\t\\tchmax(dp[(i+1)%2][j+e[idx]][k][l+1],dp[i%2][j][k][l]+s[idx]);\\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\\tfor(int j=0;j<=Limit;j++)\\n\\t\\t{\\n\\t\\t\\tfor(int k=1;k<3;k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor(int l=X;l<=M;l++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tchmax(ans,dp[(N+M)%2][j][k][l]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3680,\n \"score_of_the_acc\": -0.6276,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2285_1008804\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#define INF 0x3f3f3f3f\\n#include <cstdio>\\n#include <iostream>\\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 int tx[] = {0,1,0,-1};\\nstatic const int ty[] = {-1,0,1,0};\\n \\nstatic const double EPS = 1e-8;\\n\\n// dp[picked secret][picked standard][money] ::= max satisfaction\\nint dp[3][105][1005]; \\n\\nint main(){\\n int money_limit;\\n int total_secret_artists;\\n int total_standard_artists;\\n int to_pick_standard_artists;\\n while(~scanf(\\\"%d %d %d %d\\\",\\n &money_limit,\\n &total_secret_artists,\\n &total_standard_artists,\\n &to_pick_standard_artists)){\\n \\n if(money_limit == 0\\n && total_secret_artists == 0\\n && total_standard_artists == 0\\n && to_pick_standard_artists == 0) break;\\n\\n memset(dp,-1,sizeof(dp));\\n dp[0][0][0] = 0;\\n for(int artist_idx=0;artist_idx<total_secret_artists;artist_idx++){\\n string name;\\n int cost;\\n int satisfaction;\\n\\n cin >> name >> cost >> satisfaction;\\n for(int prev_picked=1;prev_picked>=0;prev_picked--){\\n for(int prev_money=1000;prev_money>=0;prev_money--){\\n if(prev_money + cost > 1000) continue;\\n\\n if(dp[prev_picked][0][prev_money] == -1) continue;\\n dp[prev_picked + 1][0][prev_money + cost]\\n = max(dp[prev_picked][0][prev_money] + satisfaction,\\n dp[prev_picked + 1][0][prev_money + cost]);\\n }\\n }\\n }\\n for(int artist_idx=0;artist_idx<total_standard_artists;artist_idx++){\\n string name;\\n int cost;\\n int satisfaction;\\n cin >> name >> cost >> satisfaction;\\n for(int picked_secret=min(2,total_secret_artists);picked_secret>=1;picked_secret--){\\n for(int prev_picked_standard = artist_idx; prev_picked_standard >= 0; prev_picked_standard--){\\n for(int prev_money=1000;prev_money>=0;prev_money--){\\n if(prev_money + cost > 1000) continue;\\n\\n if(dp[picked_secret][prev_picked_standard][prev_money] == -1) continue;\\n dp[picked_secret][prev_picked_standard + 1][prev_money + cost]\\n = max(dp[picked_secret][prev_picked_standard + 1][prev_money + cost],\\n dp[picked_secret][prev_picked_standard][prev_money] + satisfaction);\\n }\\n\\n }\\n } \\n }\\n\\n int res = 0;\\n for(int picked_secret=min(2,total_secret_artists);picked_secret>=1;picked_secret--){\\n for(int picked_standard = total_standard_artists; picked_standard >=to_pick_standard_artists; picked_standard--){\\n for(int money=money_limit;money>=0;money--){\\n res = max(dp[picked_secret][picked_standard][money],res);\\n }\\n }\\n }\\n\\n printf(\\\"%d\\\\n\\\",res);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 2496,\n \"score_of_the_acc\": -0.1455,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2285_904780\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <set>\\n#include <map>\\n#include <algorithm>\\t// require sort next_permutation count __gcd reverse etc.\\n#include <cstdlib>\\t// require abs exit atof atoi \\n#include <cstdio>\\t\\t// require scanf printf\\n#include <functional>\\n#include <numeric>\\t// require accumulate\\n#include <cmath>\\t\\t// require fabs\\n#include <climits>\\n#include <limits>\\n#include <cfloat>\\n#include <iomanip>\\t// require setw\\n#include <sstream>\\t// require stringstream \\n#include <cstring>\\t// require memset\\n#include <cctype>\\t\\t// require tolower, toupper\\n#include <fstream>\\t// require freopen\\n#include <ctime>\\t\\t// require srand\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define ALL(A) A.begin(), A.end()\\n#define INF 1<<29\\n#define DEBUG 0\\n/*\\n\\tRitsumeikan University Programming Contest 2011 , Japan, 2011-10-05\\n\\n\\t2285 - Anipero\\n\\n\\tAnipero01.cpp\\n\\tまずは全探索.\\n\\n\\tAnipero02.cpp\\n\\tメモ化再帰\\n\\n\\tAnipero03.cpp\\n\\tDPに書き直す\\n\\n\\tAnipero04.cpp\\n\\tループの向きを反対にする\\n\\n*/\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\n\\nconst int MAX_LIMIT = 1000;\\nconst int MAX_N = 100;\\nconst int MAX_M = 100;\\n\\nint LIMIT, N, M, X;\\n\\nint sec_e[MAX_N+1], sec_s[MAX_N+1], e[MAX_M+1], s[MAX_M+1];\\n\\nint dp[MAX_M+1][MAX_LIMIT+1];\\n/*\\nint dfs (int depth, int cnt, int cost ){\\n\\tif (cost > LIMIT ) return -INF;\\n\\tif (depth >= M ){\\n\\t\\treturn 0;\\n\\t} // end if\\n\\tif (memo[depth][cnt][cost] != -1 ) return memo[depth][cnt][cost];\\n\\n\\tint res = -INF;\\n\\tres = max (res, dfs (depth + 1, cnt, cost ) );\\n\\tres = max (res, dfs (depth + 1, cnt + 1, cost + e[depth] ) + s[depth] );\\n\\n\\treturn memo[depth][cnt][cost] = res;\\n}\\n*/\\n\\nint solve (void ){\\n\\trep (j, MAX_M+1 ) rep (k, MAX_LIMIT + 1 ) dp[j][k] = -INF;\\n\\tdp[0][0] = 0;\\n\\n\\trep (i, M ){\\n\\t\\tfor (int j = i; j >= 0; j-- ){\\n\\t\\t\\tfor (int k = 0; k <= LIMIT; k++ ){\\n\\t\\t\\t\\tif (k + e[i] <= LIMIT ){\\n\\t\\t\\t\\t\\tdp[j+1][k+e[i]] = max (dp[j+1][k+e[i]], dp[j][k]+s[i] );\\n\\t\\t\\t\\t\\tdp[j][k+e[i]] = max (dp[j][k+e[i]], dp[j][k] );\\n\\t\\t\\t\\t} // end if\\n\\t\\t\\t} // end for\\n\\t\\t} // end for\\n\\t} // end for\\n\\n#if DEBUG\\n\\trep (i, M+1 ){\\n\\t\\tfor (int j = 0; j <= LIMIT; j++ ){\\n\\t\\t\\tcerr << (dp[i][j] <= -INF/2 ? -1 : dp[i][j] ) << (j != LIMIT ? ' ' : '\\\\n' );\\n\\t\\t} // end for\\n\\t} // end rep\\n#endif\\n\\n\\tint res = 0;\\n\\tfor (int j = X; j <= M; j++ )\\n\\trep (k, LIMIT+1 ){\\n\\t\\tif (dp[j][k] >= 0 ){\\n\\t\\t\\tint curr = -INF;\\n\\t\\t\\trep (ii, N ){\\n\\t\\t\\t\\tif (k + sec_e[ii] <= LIMIT )\\n\\t\\t\\t\\t\\tcurr = max (curr, sec_s[ii] );\\n\\t\\t\\t\\trep (jj, ii )\\n\\t\\t\\t\\t\\tif (k + sec_e[ii] + sec_e[jj] <= LIMIT )\\n\\t\\t\\t\\t\\t\\tcurr = max (curr, sec_s[ii] + sec_s[jj] );\\n\\t\\t\\t} // end rep\\n\\t\\t\\tres = max (res, dp[j][k] + curr );\\n\\t\\t} // end if\\n\\t} // end rep\\n\\t\\n\\treturn res;\\n}\\n\\nint main()\\n{\\n\\tios_base::sync_with_stdio(0);\\n\\twhile (cin >> LIMIT >> N >> M >> X, LIMIT ){\\n\\t\\tmemset (sec_e, 0, sizeof (sec_e ) );\\n\\t\\tmemset (sec_s, 0, sizeof (sec_s ) );\\n\\t\\tmemset (e, 0, sizeof (e ) );\\n\\t\\tmemset (s, 0, sizeof (s ) );\\n\\t\\tstring str;\\n\\t\\trep (i, N ) cin >> str >> sec_e[i] >> sec_s[i];\\n\\t\\trep (j, M ) cin >> str >> e[j] >> s[j];\\n\\t\\tint res = solve() ;\\n\\t\\tcout << res << endl;\\n\\t} // end while\\t\\n\\t\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 1612,\n \"score_of_the_acc\": -1.0028,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2285_893162\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\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 IINF (INT_MAX)\\n#define MAX_LIMIT 1100\\n#define MAX 110\\n\\nusing namespace std;\\n\\nint pre[MAX_LIMIT][3],pre2[MAX_LIMIT][MAX],LIMIT,N,M,X,SEC_E[MAX],SEC_S[MAX],E[MAX],S[MAX];\\nstring tmp;\\n\\n\\nint main(){\\n while(cin >> LIMIT >> N >> M >> X, LIMIT|N|M|X){\\n rep(i,N)cin >> tmp >> SEC_E[i] >> SEC_S[i];\\n rep(i,M)cin >> tmp >> E[i] >> S[i];\\n rep(i,LIMIT+1)rep(j,3)pre[i][j] = -1;\\n rep(i,LIMIT+1)rep(j,MAX)pre2[i][j] = -1;\\n pre[0][0] = pre2[0][0] = 0;\\n\\n rep(i,N)for(int j=1;j>=0;j--)rep(k,LIMIT+1){\\n\\tif( pre[k][j] == -1 ) continue;\\n\\tint total_money = k + SEC_E[i];\\n\\tif( total_money > LIMIT ) continue;\\n\\tpre[total_money][j+1] = max(pre[total_money][j+1],pre[k][j]+SEC_S[i]);\\n }\\n\\n rep(i,3)rep(j,LIMIT+1)if( j ) pre[j][i] = max(pre[j][i],pre[j-1][i]);\\n\\n rep(i,M)for(int j=M-1;j>=0;j--)rep(k,LIMIT+1){\\n\\tif( pre2[k][j] == -1 ) continue;\\n\\tint total_money = k + E[i];\\n\\tif( total_money > LIMIT ) continue;\\n\\tpre2[total_money][j+1] = max(pre2[total_money][j+1],pre2[k][j]+S[i]);\\n }\\n\\n rep(i,M+1)rep(j,LIMIT+1)if( j ) pre2[j][i] = max(pre2[j][i],pre2[j-1][i]);\\n\\n int ans = 0;\\n\\n REP(i,X,M+1)REP(j,1,3)rep(k,LIMIT+1){\\n if( pre2[k][i] == -1 || pre[LIMIT-k][j] == -1 ) continue;\\n int points = pre2[k][i] + pre[LIMIT-k][j];\\n ans = max(ans,points);\\n }\\n\\n cout << ans << endl;\\n\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1648,\n \"score_of_the_acc\": -0.0869,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":1271,"cells":{"group_id":{"kind":"string","value":"aoj_2288_cpp"},"problem_description":{"kind":"string","value":"Problem H: Oh, My Goat!\n太郎君は、次郎君に古文のノートを借りた。\n明日の古文の宿題を写させてもらうためだ。\n太郎君は、用心深い性格をしているため、万が一のことを考えて、近所のコンビニで次郎君のノートのコピーを取って自宅へ帰った。\n太郎君は、自宅で宿題を始めようとしたときに、慌てた。\n次郎君から借りたノートが鞄に入っていなかったからだ。\nどうやら、コンビニに忘れてきてしまったようだ。\n太郎君は、急いでコンビニに引き返した。\nコピー機とその周辺を懸命に捜索したが、ノートを見つけることはできなかった。\n困り果てた太郎君は、コンビニの店長に助けを求めた。\n余談だが、店長は地球環境に優しい人で、白ヤギさんを飼っている。\n店長は、地球環境に気を配る心遣いを持っているため、常日頃から、ペットの白ヤギさんに、餌としてコピー機周辺の客の忘れものを与えている。\n店長によると、ノートは、今晩の白ヤギさんの晩御飯であり、白ヤギさんは現在食事中だそうである。\n太郎君は白ヤギさんに頼みこみ、食べかけのノートを取り返すことはできたが、ノートはビリビリに破れぼろぼろである。\n太郎君は、急いで自宅に引き返した。\n自室の机とその周辺を懸命に捜索したが、ノートのコピーを見つけることはできなかった。\n困り果てた太郎君は、お母さんに助けを求めた。\n余談だが、太郎君のお母さんは地球環境に優しい人で、黒ヤギさんを飼っている。\n太郎君のお母さんは、地球環境に気を配る心遣いを持っているため、常日頃から、ペットの黒ヤギさんに、餌として太郎君の宿題を与えている。\nお母さんによると、ノートのコピーは、今晩の黒ヤギさんの晩御飯であり、黒ヤギさんは現在食事中だそうである。\n太郎君は黒ヤギさんに頼みこみ、食べかけのノートを取り返すことはできたが、ノートのコピーはビリビリに破れぼろぼろである。\n次郎君のノートとそのコピーをビリビリのぼろぼろにされてしまった太郎君は、ノートを可能な限り復元しようと考えた。\nそこで、繋がりそうなノートの切れ端同士を繋ぎ合わせて、「繋ぎ合せたノート」を作成した。\n同様に、繋がりそうなノートのコピーの切れ端同士を繋き合わせて、「繋ぎ合せたノートのコピー」を作成した。\n太郎君は、あらゆる可能性を考えるために、繋がりそうな切れ端同士をつなぎ合わせた。\nこのため、1つの切れ目に2つ以上の切れ端が繋がれてしまった箇所もあった。\n繋ぎ合わせ方の例を図1に示す。\n図1は、7つの切れ端と6つの切れ目からなる。\n図1\n切れ端\"haru\"と\"natsu\"に続く切れ目には、切れ端\"wa\"が繋がり、文章が合流している。\n切れ端\"wa\"に続く切れ目には、切れ端\"ake\"と\"saron\"が繋がり、文章が分岐している。\nこのような合流や切れ端があるため、図1は次のような4つの文章を表す。\nharuwaakebono\nharuwasaronpusu\nnatsuwaakebono\nnatsuwasaronpusu\nノートやノートのコピーは、白ヤギさんや黒ヤギさんが、食べてしまったため、復元できない部分があったり、彼らのご飯に混ざっていた関係のない書類の切れ端が混在していることもある。\n太郎君の代わりに、「繋ぎ合わせたノート」と「繋ぎ合わせたノートのコピー」の2つを入力として受け取って、両方に共通して現れる文章の数を求めるプログラムを作成せよ。\nInput\n入力の1行目では、データセットの数\nT\n(\n1 ≤ T ≤ 100\n)が与えられる。\nデータセットは、「繋ぎ合せたノート」の情報と、「繋ぎ合せたノートのコピー」の情報から成る。\n「繋ぎ合せたノート」の情報として、\n1行目に\nn\n(\n2 ≤ n ≤ 500\n)と\nm\n(\n1 ≤ m ≤ 600\n)が与えられる。\nn\nは、切れ端と切れ端を繋ぎ合せる切れ目の数である。\n続く\nm\n行で繋ぎ合せ方が与えられる。\n各行は、切れ端の上端に繋がる切れ目の番号\na\n、切れ端の下端につながる切れ目の番号\nb\n、切れ端を表す文字列\ns\nからなる。\nただし、\n0 ≤ a < b < n\nが満たされる。\ns\nは長さが1以上5以下の文字列で、アルファベットの小文字のみから成る。\n「繋ぎ合せたノートのコピー」も「繋ぎ合せたノート」と同じ形式で与えられる。\nなお、0番目の切れ目から繋ぎ合せ情報を辿り、\nn-1\n番目の切れ目に到達する過程で得られる文字列を連結したもののみを文章と呼ぶものとする。\nまた、それぞれの繋ぎ合せの中で同じ文章が2つ以上出現することはない。\nOutput\nそれぞれのデータセット毎に、答えの整数を1,000,000,007で割った余りを1行で出力せよ。\nSample Input\n4\n2 1\n0 1 a\n2 2\n0 1 a\n0 1 b\n5 5\n0 1 a\n0 2 b\n1 3 a\n2 3 c\n3 4 e\n3 3\n0 1 aa\n0 2 bce\n1 2 a\n2 4\n0 1 abc\n0 1 def\n0 1 ghi\n0 1 jkl\n2 4\n0 1 ghi\n0 1 jkl\n0 1 mno\n0 1 pqr\n6 7\n0 1 haru\n0 1 natsu\n1 2 wa\n2 3 ake\n2 4 saron\n3 5 bono\n4 5 pusu\n5 4\n0 1 haruw\n1 2 aakeb\n2 3 o\n3 4 no\nOutput for Sample Input\n1\n1\n2\n1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2288_10339676","code_snippet":"// AOJ #2288 Oh, My Goat!\n// 2025.3.31\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MOD = 1000000007;\n\ntypedef vector<vector<pair<char,int>>> Automaton;\n\npair<Automaton, int> buildAutomaton(int n, int m, vector<tuple<int,int,string>> &edges) {\n int stateCount = n;\n Automaton aut;\n aut.resize(n + m*5);\n\n for(auto &edge : edges) {\n int u, v;\n string s;\n tie(u, v, s) = edge;\n int cur = u;\n for (int i = 0; i < (int)s.size(); i++) {\n char c = s[i];\n if(i == (int)s.size()-1) aut[cur].push_back({c, v});\n else {\n aut[cur].push_back({c, stateCount});\n cur = stateCount;\n stateCount++;\n }\n }\n }\n aut.resize(stateCount);\n return {aut, n-1};\n}\n\nll dfs(int p, int q, const Automaton &aut1, const Automaton &aut2, int F1, int F2, int tot2, vector<ll> &dp) {\n int idx = p * tot2 + q;\n if(dp[idx] != -1) return dp[idx];\n ll ways = 0;\n if(p == F1 && q == F2) ways = 1;\n for(auto &edge1 : aut1[p]){\n char c = edge1.first;\n int np = edge1.second;\n for(auto &edge2 : aut2[q]){\n if(edge2.first == c){\n int nq = edge2.second;\n ways = (ways + dfs(np, nq, aut1, aut2, F1, F2, tot2, dp)) % MOD;\n }\n }\n }\n dp[idx] = ways;\n return ways;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int T;\n cin >> T;\n while(T--){\n int n1, m1;\n cin >> n1 >> m1;\n vector<tuple<int,int,string>> edges1;\n for (int i = 0; i < m1; i++){\n int a, b;\n string s;\n cin >> a >> b >> s;\n edges1.push_back({a, b, s});\n }\n auto res1 = buildAutomaton(n1, m1, edges1);\n Automaton aut1 = res1.first;\n int F1 = res1.second;\n\n int n2, m2;\n cin >> n2 >> m2;\n vector<tuple<int,int,string>> edges2;\n for (int i = 0; i < m2; i++){\n int a, b;\n string s;\n cin >> a >> b >> s;\n edges2.push_back({a, b, s});\n }\n auto res2 = buildAutomaton(n2, m2, edges2);\n Automaton aut2 = res2.first;\n int F2 = res2.second;\n\n int tot1 = aut1.size();\n int tot2 = aut2.size();\n\n vector<ll> dp(tot1 * tot2, -1);\n\n ll ans = dfs(0, 0, aut1, aut2, F1, F2, tot2, dp);\n cout << ans<< endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":56788,"score_of_the_acc":-0.5387,"final_rank":11},{"submission_id":"aoj_2288_4371957","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 605\nstruct Edge{\n\n\tint from,to;\n\tchar buf[6];\n\tint len;\n};\n\nint N1,N2,M1,M2;\nll dp[SIZE][SIZE][6][6];\nEdge edge1[SIZE],edge2[SIZE];\nvector<int> G1[SIZE],G2[SIZE];\n\nll recursive(int e1,int loc1,int e2,int loc2){\n\n\tif(dp[e1][e2][loc1][loc2] != -1){\n\n\t\treturn dp[e1][e2][loc1][loc2];\n\t}\n\n\tif(edge1[e1].buf[loc1] != edge2[e2].buf[loc2]){\n\n\t\treturn dp[e1][e2][loc1][loc2] = 0;\n\t}\n\n\tll ret = 0;\n\n\tif(loc1+1 < edge1[e1].len && loc2+1 < edge2[e2].len){ //両方非終端\n\n\t\tret = recursive(e1,loc1+1,e2,loc2+1);\n\n\t}else if(loc1+1 == edge1[e1].len && loc2+1 < edge2[e2].len){ //DAG1が終端\n\n\t\tif(edge1[e1].to == N1-1){\n\n\t\t\tret = 0;\n\n\t\t}else{ //DAG1が新しいノードへ\n\n\t\t\tfor(int i = 0; i < G1[edge1[e1].to].size(); i++){\n\n\t\t\t\tret += recursive(G1[edge1[e1].to][i],0,e2,loc2+1);\n\t\t\t\tret %= MOD;\n\t\t\t}\n\t\t}\n\n\t}else if(loc1+1 < edge1[e1].len && loc2+1 == edge2[e2].len){ //DAG2が終端\n\n\t\tif(edge2[e2].to == N2-1){\n\n\t\t\tret = 0;\n\n\t\t}else{ //DAG2が新しいノードへ\n\n\t\t\tfor(int i = 0; i < G2[edge2[e2].to].size(); i++){\n\n\t\t\t\tret += recursive(e1,loc1+1,G2[edge2[e2].to][i],0);\n\t\t\t\tret %= MOD;\n\t\t\t}\n\t\t}\n\n\t}else{ //両方終端\n\n\t\tif((edge1[e1].to == N1-1 && edge2[e2].to != N2-1) ||\n\t\t\t\t(edge1[e1].to != N1-1 && edge2[e2].to == N2-1)){ //片方だけ文章完成\n\n\t\t\tret = 0;\n\n\t\t}else if(edge1[e1].to == N1-1 && edge2[e2].to == N2-1){ //両方文章完成\n\n\t\t\tret = 1;\n\n\t\t}else{ //両方新しいノードへ\n\n\t\t\tfor(int i = 0; i < G1[edge1[e1].to].size(); i++){\n\t\t\t\tfor(int k = 0; k < G2[edge2[e2].to].size(); k++){\n\n\t\t\t\t\tret += recursive(G1[edge1[e1].to][i],0,G2[edge2[e2].to][k],0);\n\t\t\t\t\tret %= MOD;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\treturn dp[e1][e2][loc1][loc2] = ret;\n}\n\n\nvoid func(){\n\n\tfor(int i = 0; i < SIZE; i++){\n\t\tG1[i].clear();\n\t\tG2[i].clear();\n\t}\n\n\tscanf(\"%d %d\",&N1,&M1);\n\n\tfor(int i = 0; i < M1; i++){\n\n\t\tscanf(\"%d %d %s\",&edge1[i].from,&edge1[i].to,edge1[i].buf);\n\t\tfor(edge1[i].len = 0; edge1[i].buf[edge1[i].len] != '\\0'; edge1[i].len++);\n\n\t\tG1[edge1[i].from].push_back(i);\n\t}\n\n\tscanf(\"%d %d\",&N2,&M2);\n\n\tfor(int i = 0; i < M2; i++){\n\n\t\tscanf(\"%d %d %s\",&edge2[i].from,&edge2[i].to,edge2[i].buf);\n\t\tfor(edge2[i].len = 0; edge2[i].buf[edge2[i].len] != '\\0'; edge2[i].len++);\n\n\t\tG2[edge2[i].from].push_back(i);\n\t}\n\n\tfor(int i = 0; i < M1; i++){\n\t\tfor(int k = 0; k < M2; k++){\n\t\t\tfor(int a = 0; a < 6; a++){\n\t\t\t\tfor(int b = 0; b < 6; b++){\n\t\t\t\t\tdp[i][k][a][b] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tll ans = 0;\n\tint root = 0;\n\n\tfor(int i = 0; i < G1[root].size(); i++){\n\t\tfor(int k = 0; k < G2[root].size(); k++){\n\n\t\t\tans += recursive(G1[root][i],0,G2[root][k],0);\n\t\t\tans %= MOD;\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n}\n\nint main(){\n\n\tint num_case;\n\tscanf(\"%d\",&num_case);\n\n\tfor(int loop = 0; loop < num_case; loop++){\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":105420,"score_of_the_acc":-1.1754,"final_rank":14},{"submission_id":"aoj_2288_365380","code_snippet":"#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\nconst int MOD = 1000000007;\n\nvoid input(int &n, int &m, vector<vector<int> >& to, vector<vector<string> >& str)\n{\n cin >> n >> m;\n to.assign(n, vector<int>());\n str.assign(n, vector<string>());\n\n for(int i=0; i<m; ++i){\n int a, b;\n string s;\n cin >> a >> b >> s;\n to[a].push_back(b);\n str[a].push_back(s);\n }\n}\n\nbool compare(string& s, string& t)\n{\n int n = min(s.size(), t.size());\n if(s.substr(0, n) != t.substr(0, n))\n return false;\n\n s = s.substr(n);\n t = t.substr(n);\n return true;\n}\n\nint main()\n{\n int t;\n cin >> t;\n\n while(--t >= 0){\n int n1, m1, n2, m2;\n vector<vector<int> > to1, to2;\n vector<vector<string> > str1, str2;\n input(n1, m1, to1, str1);\n input(n2, m2, to2, str2);\n\n vector<vector<vector<map<string, int> > > > dp(n1, vector<vector<map<string, int> > >(n2, vector<map<string, int> >(2)));\n dp[0][0][0][\"\"] = 1;\n\n for(int i=0; i<n1; ++i){\n for(int j=0; j<n2; ++j){\n if(i == n1-1 && j == n2-1)\n break;\n\n while(!dp[i][j][0].empty()){\n map<string, int>::iterator it = dp[i][j][0].begin();\n string s0 = it->first;\n int num = it->second;\n dp[i][j][0].erase(it);\n\n for(unsigned k=0; k<to1[i].size(); ++k){\n int to = to1[i][k];\n string s = s0;\n string t = str1[i][k];\n if(compare(s, t)){\n if(t.size() == 0){\n dp[to][j][0][s] += num;\n dp[to][j][0][s] %= MOD;\n }else{\n dp[to][j][1][t] += num;\n dp[to][j][1][t] %= MOD;\n }\n }\n }\n }\n\n while(!dp[i][j][1].empty()){\n map<string, int>::iterator it = dp[i][j][1].begin();\n string s0 = it->first;\n int num = it->second;\n dp[i][j][1].erase(it);\n\n for(unsigned k=0; k<to2[j].size(); ++k){\n int to = to2[j][k];\n string s = s0;\n string t = str2[j][k];\n if(compare(s, t)){\n if(s.size() == 0){\n dp[i][to][0][t] += num;\n dp[i][to][0][t] %= MOD;\n }else{\n dp[i][to][1][s] += num;\n dp[i][to][1][s] %= MOD;\n }\n }\n }\n }\n }\n }\n\n cout << dp[n1-1][n2-1][0][\"\"] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":17000,"score_of_the_acc":-0.4069,"final_rank":10},{"submission_id":"aoj_2288_364629","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\nconst int MOD = 1e9+7;\n\nstring str1[600];\nstring str2[600];\nvector<int> g1[600], g2[600];\nbool goal1[600], goal2[600];\nint A[600], B[600];\nint n1, m1;\nint n2, m2;\n\nint memo[600][6][600];\n\nint solve(int p1, int q1, int p2, int q2) {\n //cout << p1 << \" \" << q1 << \" \" << p2 << \" \" << q2 << endl;\n if (q2 == 0 && memo[p1][q1][p2] >= 0) return memo[p1][q1][p2];\n if (!goal1[p1] && q1 == str1[p1].size()) {\n ll res = 0;\n FOR(it, g1[p1])\n res = (res + solve(*it, 0, p2, q2)) % MOD;\n if (q2 == 0) memo[p1][q1][p2] = res;\n return res;\n }\n if (!goal2[p2] && q2 == str2[p2].size()) {\n ll res = 0;\n FOR(it, g2[p2])\n res = (res + solve(p1, q1, *it, 0)) % MOD;\n return res;\n }\n bool f1 = (goal1[p1] && q1 == str1[p1].size());\n bool f2 = (goal2[p2] && q2 == str2[p2].size());\n int res;\n if (f1 || f2) {\n res = f1 && f2;\n } else {\n if (str1[p1][q1] == str2[p2][q2]) {\n res = solve(p1, q1+1, p2, q2+1);\n } else {\n res = 0;\n }\n }\n if (q2 == 0) memo[p1][q1][p2] = res;\n return res;\n}\n\nint main() {\n int T;\n cin >> T;\n while(T--) {\n cin >> n1 >> m1;\n REP(i, m1) g1[i].clear();\n memset(goal1, 0, sizeof(goal1));\n vector<int> start1;\n REP(i, m1) {\n cin >> A[i] >> B[i] >> str1[i];\n if (A[i] == 0) start1.push_back(i);\n if (B[i] == n1-1) goal1[i] = 1;\n REP(j, i) {\n if (B[j] == A[i]) {\n g1[j].push_back(i);\n }\n }\n }\n cin >> n2 >> m2;\n REP(i, m2) g2[i].clear();\n memset(goal2, 0, sizeof(goal2));\n vector<int> start2;\n REP(i, m2) {\n cin >> A[i] >> B[i] >> str2[i];\n if (A[i] == 0) start2.push_back(i);\n if (B[i] == n2-1) goal2[i] = 1;\n REP(j, i) {\n if (B[j] == A[i]) {\n g2[j].push_back(i);\n }\n }\n }\n ll res = 0;\n memset(memo,-1,sizeof(memo));\n FOR(it, start1) {\n FOR(jt, start2) {\n res = (res + solve(*it,0,*jt,0)) % MOD;\n }\n }\n cout << res << endl;\n }\n}","accuracy":1,"time_ms":70,"memory_kb":9688,"score_of_the_acc":-0.1972,"final_rank":8},{"submission_id":"aoj_2288_329212","code_snippet":"#include<string>\n#include<vector>\n#include<cstring>\n#include<iostream>\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n\nusing namespace std;\n\nconst int M=1000000007;\n\nstruct edge{\n\tint u,v,id;\n\tstring s;\n};\n\nint n1,n2;\nedge E1[600],E2[600];\nvector<int> adj1[500],adj2[500];\n\nint dp[600][600][6];\nint dfs(int i1,int i2,int p1,int p2){\n\tint dummy,&res=(p1==0?dp[i1][i2][p2]:dummy);\n\tif(p1==0 && ~res) return res;\n\n\t// 2 ÂÌ|C^ª¯É DAG ÌI[ɽ\n\tif(p1==E1[i1].s.length() && p2==E2[i2].s.length()){\n\t\tint v1=E1[i1].v,v2=E2[i2].v;\n\t\tif(v1==n1-1 && v2==n2-1) return res=1;\n\t}\n\n\t// |C^ 1 ª¶ñI[ɽ\n\tif(p1==E1[i1].s.length()){\n\t\tint v=E1[i1].v,cnt=0;\n\t\trep(k,adj1[v].size()) cnt=(cnt+dfs(adj1[v][k],i2,0,p2))%M;\n\t\treturn res=cnt;\n\t}\n\n\t// |C^ 2 ª¶ñI[ɽ\n\tif(p2==E2[i2].s.length()){\n\t\tint v=E2[i2].v,cnt=0;\n\t\trep(k,adj2[v].size()) cnt=(cnt+dfs(i1,adj2[v][k],p1,0))%M;\n\t\treturn res=cnt;\n\t}\n\n\t// wµÄ¢é¶ªá¤ÈçTõÅ¿Øè\n\tif(E1[i1].s[p1]!=E2[i2].s[p2]) return res=0;\n\n\treturn res=dfs(i1,i2,p1+1,p2+1);\n}\n\nint main(){\n\tint T; cin>>T;\n\twhile(T--){\n\t\tmemset(dp,-1,sizeof dp);\n\t\tint m1; cin>>n1>>m1;\n\t\trep(u,n1) adj1[u].clear();\n\t\trep(j,m1){\n\t\t\tint u,v;\n\t\t\tstring s; cin>>u>>v>>s;\n\t\t\tadj1[u].push_back(j);\n\t\t\tE1[j]=(edge){u,v,j,s};\n\t\t}\n\t\tint m2; cin>>n2>>m2;\n\t\trep(u,n2) adj2[u].clear();\n\t\trep(j,m2){\n\t\t\tint u,v;\n\t\t\tstring s; cin>>u>>v>>s;\n\t\t\tadj2[u].push_back(j);\n\t\t\tE2[j]=(edge){u,v,j,s};\n\t\t}\n\n\t\tint ans=0;\n\t\trep(i,adj1[0].size()) rep(j,adj2[0].size()) {\n\t\t\tans=(ans+dfs(adj1[0][i],adj2[0][j],0,0))%M;\n\t\t}\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":9584,"score_of_the_acc":-0.1786,"final_rank":5},{"submission_id":"aoj_2288_294086","code_snippet":"#include <iostream>\n#include <fstream>\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <iomanip>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <sstream>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define EPS 1e-9\n#define INF MOD\n#define MOD 1000000007LL\n#define fir first\n#define iss istringstream\n#define sst stringstream\n#define ite iterator\n#define ll long long\n#define mp make_pair\n#define rep(i,n) rep2(i,0,n)\n#define rep2(i,m,n) for(int i=m;i<n;i++)\n#define pi pair<int,int>\n#define pb push_back\n#define sec second\n#define sh(i) (1LL<<i)\n#define sz size()\n#define vi vector<int>\n#define vc vector\n#define vl vector<ll>\n#define vs vector<string>\n\nint T,n,m,N,M,a,b;\nmap<pi,int> dp;\nstring s;\nstruct E{int from;char c;E(int a,char b):from(a),c(b){}};\nvc<E> e[3010],f[3010];\n\nint F(int a,int b){\n\tif(dp.find(pi(a,b))!=dp.end())return dp[pi(a,b)];\n\tint& res=dp[pi(a,b)];\n\tif(!a&&!b)return res=1;\n\trep(i,e[a].sz)rep(j,f[b].sz)if(e[a][i].c==f[b][j].c){\n\t\tres=(res+F(e[a][i].from,f[b][j].from))%MOD;\n\t}\n\treturn res;\n}\n\nint main(){\n\tcin>>T;\n\trep(tc,T){\n\t\trep(i,3010)e[i].clear(),f[i].clear();\n\t\tcin>>n>>m;\n\t\tint cur=n;\n\t\trep(i,m){\n\t\t\tcin>>a>>b>>s;\n\t\t\tif(s.sz==1)e[b].pb(E(a,s[0]));\n\t\t\telse rep(j,s.sz){\n\t\t\t\tif(j==0)e[cur].pb(E(a,s[j])),cur++;\n\t\t\t\telse if(j==s.sz-1)e[b].pb(E(cur-1,s[j]));\n\t\t\t\telse e[cur].pb(E(cur-1,s[j])),cur++;\n\t\t\t}\n\t\t}\n\t\tcin>>N>>M;\n\t\tcur=N;\n\t\trep(i,M){\n\t\t\tcin>>a>>b>>s;\n\t\t\tif(s.sz==1)f[b].pb(E(a,s[0]));\n\t\t\telse rep(j,s.sz){\n\t\t\t\tif(j==0)f[cur].pb(E(a,s[j])),cur++;\n\t\t\t\telse if(j==s.sz-1)f[b].pb(E(cur-1,s[j]));\n\t\t\t\telse f[cur].pb(E(cur-1,s[j])),cur++;\n\t\t\t}\n\t\t}\n\t\tdp.clear();\n\t\tcout<<F(n-1,N-1)<<endl;\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":0,"score_of_the_acc":-0.0175,"final_rank":2},{"submission_id":"aoj_2288_289836","code_snippet":"#include <cstring>\n#include <iostream>\n#include <cstdio>\n#include <queue>\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\n\n#define f first\n#define s second\n#define mp make_pair\n\nusing namespace std;\n\nint n[2], m[2];\n\nstruct edge{\n int src;\n int dst;\n string label;\n\n edge(int s = 0, int d = 0, string l = \"\") :\n src(s), dst(d), label(l) {}\n};\n\nvector<edge> e[2];\nvector<vector<int> > re[2];\n\nint memo[600][600];\nconst int mod = 1000000007;\n\nint solve(int id1, int id2, int l1, int l2){\n if(e[0][id1].dst == n[0] - 1 &&\n e[1][id2].dst == n[1] - 1 &&\n l1 == e[0][id1].label.size() &&\n l2 == e[1][id2].label.size())\n return 1;\n\n if(l1 == e[0][id1].label.size() &&\n l2 == e[1][id2].label.size() &&\n memo[id1][id2] != -1)\n return memo[id1][id2];\n \n int ret = 0;\n\n if(l1 == e[0][id1].label.size()){\n int src = e[0][id1].dst;\n\n REP(i, re[0][src].size()){\n int i1 = re[0][src][i];\n int i2 = id2;\n int ln1 = 0;\n int ln2 = l2;\n const string &s1 = e[0][i1].label;\n const string &s2 = e[1][i2].label;\n\n while(ln1 < s1.size() && ln2 < s2.size() && s1[ln1] == s2[ln2]){\n\tln1++; ln2++;\n }\n\n if(ln1 == s1.size() || ln2 == s2.size()){\n\tret = ((long long)ret + solve(i1, i2, ln1, ln2)) % mod;\n }\n }\n }else if(l2 == e[1][id2].label.size()){\n int src = e[1][id2].dst;\n\n REP(i, re[1][src].size()){\n int i1 = id1;\n int i2 = re[1][src][i];\n int ln1 = l1;\n int ln2 = 0;\n const string &s1 = e[0][i1].label;\n const string &s2 = e[1][i2].label;\n\n while(ln1 < s1.size() && ln2 < s2.size() && s1[ln1] == s2[ln2]){\n\tln1++; ln2++;\n }\n\n if(ln1 == s1.size() || ln2 == s2.size()){\n\tret = ((long long)ret + solve(i1, i2, ln1, ln2)) % mod;\n }\n }\n }else{\n printf(\"solve(%d, %d, %d, %d)\\n\", id1, id2, l1, l2);\n\n printf(\"e[0][%d].label: %s\\n\", id1, e[0][id1].label.c_str());\n printf(\"e[1][%d].label: %s\\n\", id2, e[1][id2].label.c_str());\n\n throw \"error\";\n }\n\n if(l1 == e[0][id1].label.size() &&\n l2 == e[1][id2].label.size())\n memo[id1][id2] = ret;\n\n return ret;\n}\n\nint main(){\n int t; cin >> t;\n while(t --> 0){\n REP(i,2){\n cin >> n[i] >> m[i];\n\n e[i] = vector<edge>(m[i]);\n re[i] = vector<vector<int> >(n[i]);\n\n REP(j,m[i]){\n\tint s, d;\n\tstring l;\n\tcin >> s >> d >> l;\n\te[i][j] = edge(s, d, l);\n\tre[i][s].push_back(j);\n }\n }\n\n memset(memo, -1, sizeof(memo));\n\n int ans = 0;\n REP(i, re[0][0].size()) REP(j, re[1][0].size()){\n int id1 = re[0][0][i];\n int id2 = re[1][0][j];\n int l1 = 0;\n int l2 = 0;\n const string &s1 = e[0][id1].label;\n const string &s2 = e[1][id2].label;\n\n while(l1 != s1.size() && l2 != s2.size() && s1[l1] == s2[l2]){\n\tl1++; l2++;\n }\n\n if(l1 == s1.size() || l2 == s2.size()){\n\tans = ((long long)ans + solve(id1, id2, l1, l2)) % mod;\n }\n }\n\n printf(\"%d\\n\", ans);\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":0,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2288_286538","code_snippet":"#include <stdio.h>\n#include <iostream>\n#include <vector>\n#include <list>\n#include <cmath>\n#include <fstream>\n#include <algorithm>\n#include <string>\n#include <queue>\n#include <set>\n#include <map>\n#include <complex>\n#include <iterator>\n#include <cstdlib>\n#include <cstring>\n#include <sstream>\n\nusing namespace std;\n\n#define EPS (1e-10)\n#define EQ(a,b) (abs((a) - (b)) < EPS)\n#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))\n\ntypedef complex<double> P;\ntypedef long long ll;\n\nstruct edge{\n int to;\n char ch;\n};\n\nvector<edge> G[2][4000];\n// dp[i][j]->m[gÌm[hði,m[gÌRs[Ìm[hðjƵ½Æ«A»±ÜÅɤʵĻêé¶ÍÌ\n//int dp[3600][3600];\nmap<int,map<int,int> > dp;\nint n[2],m[2];\n\nconst int INF=-1;\nconst int MOD=1000000007;\n\nint dfs(int idx1,int idx2){\n //if(dp[idx1][idx2]!=-1)\n // return dp[idx1][idx2];\n if(!(dp.find(idx1)==dp.end()||dp[idx1].find(idx2)==dp[idx1].end()))\n return dp[idx1][idx2];\n if(idx1==0&&idx2==0)\n return 1;\n else if(idx1==0||idx2==0)\n return 0;\n // »ÝÌn_É¢½é[gð·×IJ×ã°é\n // ßèûÌgÝí¹ðXgAbvµA·×IJ×é\n int res=0;\n for(int i = 0; i < G[0][idx1].size(); i++){\n edge back=G[0][idx1][i];\n for(int j = 0; j < G[1][idx2].size(); j++){\n edge back2=G[1][idx2][j];\n if(back.ch==back2.ch){\n res+=dfs(back.to,back2.to);\n res%=MOD;\n }\n }\n }\n return dp[idx1][idx2]=res%MOD;\n}\n\nint main(){\n\n int t;\n cin>>t;\n while(t--){\n dp.clear();\n //memset(dp,0,sizeof(dp));\n //for(int i = 0; i < 3600; i++)\n // fill(dp[i],dp[i]+3600,INF);\n for(int j = 0; j < 2; j++)\n for(int i = 0; i < 4000; i++)\n G[j][i].clear();\n for(int j = 0; j < 2; j++){\n cin>>n[j]>>m[j];\n int idx=n[j];\n for(int i = 0; i < m[j]; i++){\n int from,to;\n string str;\n cin>>from>>to>>str;\n // ¶ñ𪣵Ļê¼êÉidð¯ÄGÉi[·é\n int prv=from;\n for(int k = 0; k < str.size(); k++){\n edge e;\n e.to=prv;\n e.ch=str[k];\n int tmp=idx;\n if(k==str.size()-1){\n tmp=to;\n }\n G[j][tmp].push_back(e);\n prv=tmp;\n if(k==str.size()-1)\n break;\n idx++;\n }\n }\n }\n // »ÄAŦã°\n int res=dfs(n[0]-1,n[1]-1);\n cout<<res%MOD<<endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":0,"score_of_the_acc":-0.0175,"final_rank":2},{"submission_id":"aoj_2288_286537","code_snippet":"#include <stdio.h>\n#include <iostream>\n#include <vector>\n#include <list>\n#include <cmath>\n#include <fstream>\n#include <algorithm>\n#include <string>\n#include <queue>\n#include <set>\n#include <map>\n#include <complex>\n#include <iterator>\n#include <cstdlib>\n#include <cstring>\n#include <sstream>\n\nusing namespace std;\n\n#define EPS (1e-10)\n#define EQ(a,b) (abs((a) - (b)) < EPS)\n#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))\n\ntypedef complex<double> P;\ntypedef long long ll;\n\nstruct edge{\n int to;\n char ch;\n};\n\nvector<edge> G[2][4000];\n// dp[i][j]->m[gÌm[hði,m[gÌRs[Ìm[hðjƵ½Æ«A»±ÜÅɤʵĻêé¶ÍÌ\nint dp[3600][3600];\nint n[2],m[2];\n\nconst int INF=-1;\nconst int MOD=1000000007;\n\nint dfs(int idx1,int idx2){\n if(dp[idx1][idx2]!=-1)\n return dp[idx1][idx2];\n if(idx1==0&&idx2==0)\n return 1;\n else if(idx1==0||idx2==0){\n return 0;\n }\n // »ÝÌn_É¢½é[gð·×IJ×ã°é\n // ßèûÌgÝí¹ðXgAbvµA·×IJ×é\n int res=0;\n for(int i = 0; i < G[0][idx1].size(); i++){\n edge back=G[0][idx1][i];\n for(int j = 0; j < G[1][idx2].size(); j++){\n edge back2=G[1][idx2][j];\n if(back.ch==back2.ch){\n res+=dfs(back.to,back2.to);\n res%=MOD;\n }\n }\n }\n return dp[idx1][idx2]=res%MOD;\n}\n\nint main(){\n\n int t;\n cin>>t;\n while(t--){\n //memset(dp,0,sizeof(dp));\n for(int i = 0; i < 3600; i++)\n fill(dp[i],dp[i]+3600,INF);\n for(int j = 0; j < 2; j++)\n for(int i = 0; i < 4000; i++)\n G[j][i].clear();\n for(int j = 0; j < 2; j++){\n cin>>n[j]>>m[j];\n int idx=n[j];\n for(int i = 0; i < m[j]; i++){\n int from,to;\n string str;\n cin>>from>>to>>str;\n // ¶ñ𪣵Ļê¼êÉidð¯ÄGÉi[·é\n int prv=from;\n for(int k = 0; k < str.size(); k++){\n edge e;\n e.to=prv;\n e.ch=str[k];\n int tmp=idx;\n if(k==str.size()-1){\n tmp=to;\n }\n G[j][tmp].push_back(e);\n prv=tmp;\n if(k==str.size()-1)\n break;\n idx++;\n }\n }\n }\n // »ÄAŦã°\n int res=dfs(n[0]-1,n[1]-1);\n cout<<res%MOD<<endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":580,"memory_kb":0,"score_of_the_acc":-1,"final_rank":13},{"submission_id":"aoj_2288_284039","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <map>\n\nusing namespace std;\n \nint n[2],m[2];\nmap< pair<string,string> , int > memo[501][501];\nvector< vector<int> > a[2];\nvector< vector<string> > b[2];\n \nint dfs(int p1,int p2,string s1,string s2){\n if(p1 == n[0]-1 && p2 == n[1]-1) return (s1 == \"\" && s2 == \"\");\n\t\tif(memo[p1][p2].count(make_pair(s1,s2))) return memo[p1][p2][make_pair(s1,s2)];\n\n int ans = 0;\n\t\tif(p1 <= p2 || p2 == n[1]-1){\n\t\t\tfor(int i = 0 ; i < a[0][p1].size() ; i++){\n\t\t\t\t\tstring x = s1 + b[0][p1][i];\n\t\t\t\t\tstring y = s2;\n\t\t\t\t\tint I = 0 , J = 0;\n\t\t\t\t\tfor( ; I < x.size() && J < y.size() && x[I] == y[J] ; ) I++ , J++ ;\n\t\t\t\t\tif( I == x.size() || J == y.size() ){\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif( I == x.size() && I == y.size() ) x = \"\" , y = \"\";\n\t\t\t\t\t\t\telse if( I == x.size() ) x = \"\" , y = y.substr(J);\n\t\t\t\t\t\t\telse if( J == y.size() ) x = x.substr(I) , y = \"\";\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tans = ( ans + dfs(a[0][p1][i],p2,x,y) ) % 1000000007;\n\t\t\t\t\t}\n\t\t\t}\n\t\t}\n \n\t\tif(p1 > p2 || p1 == n[0]-1){\n\t\t\tfor(int j = 0 ; j < a[1][p2].size() ; j++){\n\t\t\t\t\tstring x = s1;\n\t\t\t\t\tstring y = s2 + b[1][p2][j] ;\n\t\t\t\t\tint I = 0 , J = 0;\n\t\t\t\t\tfor( ; I < x.size() && J < y.size() && x[I] == y[J] ; ) I++ , J++ ;\n\t\t\t\t\tif( I == x.size() || J == y.size() ){\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif( I == x.size() && I == y.size() ) x = \"\" , y = \"\";\n\t\t\t\t\t\t\telse if( I == x.size() ) x = \"\" , y = y.substr(J);\n\t\t\t\t\t\t\telse if( J == y.size() ) x = x.substr(I) , y = \"\";\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tans = ( ans + dfs(p1, a[1][p2][j],x,y) ) % 1000000007;\n\t\t\t\t\t}\n\t\t\t}\n\t\t}\n return memo[p1][p2][make_pair(s1,s2)] = ans;\n}\n \nint main(){\n int T;cin >> T;\n while(T--){\n for(int i = 0 ; i < 2 ; i++){\n cin >> n[i] >> m[i];\n //cout << n[i] << \" \" << m[i] << endl;\n a[i].clear(); b[i].clear(); a[i].resize((unsigned)n[i]) , b[i].resize((unsigned)n[i]);\n for(int j = 0 ; j < m[i] ; j++){\n int A,B; string C;\n cin >> A >> B >> C;\n a[i][A].push_back(B);\n b[i][A].push_back(C);\n }\n }\n\t\t\t\tfor(int i = 0 ; i < 501 ; i++)\n\t\t\t\t\tfor(int j = 0 ; j < 501 ; j++)\n\t\t\t\t\t\tmemo[i][j].clear();\n cout << dfs(0,0,\"\",\"\") << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":7756,"score_of_the_acc":-0.1964,"final_rank":7},{"submission_id":"aoj_2288_283931","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <map>\n\nusing namespace std;\n \nint n[2],m[2];\nmap< pair<string,string> , int > memo[501][501];\nvector< vector<int> > a[2];\nvector< vector<string> > b[2];\n \nint dfs(int p1,int p2,string s1,string s2){\n //cout << p1 << \" \" << p2 << \" [\" << s1 << \"] [\" << s2 << \"]\" << \"{\" << n[0] << \" \" << n[1] << endl;\n if(p1 == n[0]-1 && p2 == n[1]-1) return (s1 == \"\" && s2 == \"\");\n\t\tif(memo[p1][p2].count(make_pair(s1,s2))) return memo[p1][p2][make_pair(s1,s2)];\n\n int ans = 0;\n\t\tif(p1 <= p2 || p2 == n[1]-1){\n\t\t\tfor(int i = 0 ; i < a[0][p1].size() ; i++){\n\t\t\t\t\tstring x = s1 + b[0][p1][i];\n\t\t\t\t\tstring y = s2;\n\t\t\t\t\tint I = 0 , J = 0;\n\t\t\t\t\tfor( ; I < x.size() && J < y.size() && x[I] == y[J] ; ) I++ , J++ ;\n\t\t\t\t\tif( I == x.size() || J == y.size() ){\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif( I == x.size() && I == y.size() ) x = \"\" , y = \"\";\n\t\t\t\t\t\t\telse if( I == x.size() ) x = \"\" , y = y.substr(J);\n\t\t\t\t\t\t\telse if( J == y.size() ) x = x.substr(I) , y = \"\";\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tans = ( ans + dfs(a[0][p1][i],p2,x,y) ) % 1000000007;\n\t\t\t\t\t}\n\t\t\t}\n\t\t}\n \n\t\tif(p1 > p2 || p1 == n[0]-1){\n\t\t\tfor(int j = 0 ; j < a[1][p2].size() ; j++){\n\t\t\t\t\tstring x = s1;\n\t\t\t\t\tstring y = s2 + b[1][p2][j] ;\n\t\t\t\t\tint I = 0 , J = 0;\n\t\t\t\t\tfor( ; I < x.size() && J < y.size() && x[I] == y[J] ; ) I++ , J++ ;\n\t\t\t\t\tif( I == x.size() || J == y.size() ){\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tif( I == x.size() && I == y.size() ) x = \"\" , y = \"\";\n\t\t\t\t\t\t\telse if( I == x.size() ) x = \"\" , y = y.substr(J);\n\t\t\t\t\t\t\telse if( J == y.size() ) x = x.substr(I) , y = \"\";\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tans = ( ans + dfs(p1, a[1][p2][j],x,y) ) % 1000000007;\n\t\t\t\t\t}\n\t\t\t}\n\t\t}\n return memo[p1][p2][make_pair(s1,s2)] = ans;\n}\n \nint main(){\n int T;cin >> T;\n while(T--){\n for(int i = 0 ; i < 2 ; i++){\n cin >> n[i] >> m[i];\n //cout << n[i] << \" \" << m[i] << endl;\n a[i].clear(); b[i].clear(); a[i].resize((unsigned)n[i]) , b[i].resize((unsigned)n[i]);\n for(int j = 0 ; j < m[i] ; j++){\n int A,B; string C;\n cin >> A >> B >> C;\n a[i][A].push_back(B);\n b[i][A].push_back(C);\n }\n }\n\t\t\t\tfor(int i = 0 ; i < 501 ; i++)\n\t\t\t\t\tfor(int j = 0 ; j < 501 ; j++)\n\t\t\t\t\t\tmemo[i][j].clear();\n cout << dfs(0,0,\"\",\"\") << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":0,"score_of_the_acc":-0.1228,"final_rank":4},{"submission_id":"aoj_2288_282229","code_snippet":"#include <stdio.h>\n#include <string.h>\n#include <string>\n#include <vector>\n#include <map>\n#include <algorithm>\nusing namespace std;\n#define rep(i, n) for(int i=0; i<(int)(n); i++)\ntypedef long long Int;\n#define MOD (1000000007)\ninline void up(int &a, int b) { a = (a+b)%MOD; }\n\ntemplate<class W>\nstruct E {\n int u, v;\n W w;\n E() {}\n E(int u, int v, const W& w) : u(u), v(v), w(w) {}\n};\ntemplate<class W>\nbool less_u(const E<W>& l, const E<W>& r) {\n return l.u!=r.u ? l.u<r.u : l.v!=r.v ? l.v<r.v : l.w<r.w;\n}\n\nint N[2], M[2];\nint of(int x, int y, int i, int j) {\n return (((x*600)+y)*16+i)*16+j;\n}\n\nint main() {\n int T;\n scanf(\"%d\", &T);\n vector<E<string> > g[2];\n map<int, int> dp;\n while(T--) {\n vector<vector<int> > to[2];\n rep(k, 2) {\n scanf(\"%d%d\", N+k, M+k);\n g[k].clear();\n rep(i, M[k]) {\n int a, b;\n char buf[8];\n scanf(\"%d%d%s\", &a, &b, buf);\n g[k].push_back(E<string>(a, b, buf));\n }\n sort(g[k].begin(), g[k].end(), less_u<string>);\n to[k] = vector<vector<int> >(N[k]);\n rep(i, M[k]) {\n const int u = g[k][i].u;\n to[k][u].push_back(i);\n }\n to[k][N[k]-1].push_back(M[k]);\n }\n dp.clear();\n rep(i, to[0][0].size()) rep(j, to[1][0].size()) {\n const int ix = to[0][0][i], jx = to[1][0][j];\n dp[of(ix, jx, 0, 0)] = 1;\n }\n rep(x, M[0]) rep(y, M[1]) {\n const int v0 = g[0][x].v, v1 = g[1][y].v;\n const string &a = g[0][x].w, &b = g[1][y].w;\n rep(i, a.size()) rep(j, b.size()) if(a[i]==b[j]) {\n const int cur = of(x, y, i, j);\n if(dp.count(cur)==0) continue;\n const int val = dp[cur];\n if(i<(int)a.size()-1 && j<(int)b.size()-1) {\n up(dp[of(x, y, i+1, j+1)], val);\n }\n else if(i<(int)a.size()-1) {\n rep(p, to[1][v1].size()) {\n const int ix = to[1][v1][p];\n up(dp[of(x, ix, i+1, 0)], val);\n }\n }\n else if(j<(int)b.size()-1) {\n rep(p, to[0][v0].size()) {\n const int ix = to[0][v0][p];\n up(dp[of(ix, y, 0, j+1)], val);\n }\n }\n else {\n rep(p, to[0][v0].size()) rep(q, to[1][v1].size()) {\n const int ix = to[0][v0][p];\n const int jx = to[1][v1][q];\n up(dp[of(ix, jx, 0, 0)], val);\n }\n }\n }\n }\n printf(\"%d\\n\", dp[of(M[0], M[1], 0, 0)]);\n }\n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":2388,"score_of_the_acc":-0.6542,"final_rank":12},{"submission_id":"aoj_2288_281893","code_snippet":"#include <iostream>\n#include <cctype>\n#include <cstdlib>\n#include <string>\n#include <memory.h>\n#include <cmath>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <map>\nusing namespace std;\n\n#define rep(i, n) for(int i = 0; i < n; i++)\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<int,P> PP;\nconst int INF = 1 << 29;\nconst int mod = 1000000007;\n\nstruct edge{\n int to;\n string s;\n edge(){}\n edge(int to, string s){\n this->to = to;\n this->s = s;\n }\n};\n\nbool ok(const string &s1, const string &s2){\n int n = s1.size();\n rep(i, n) if(s1[i] != s2[i]) return false;\n return true;\n}\n\n\nmap<string, ll> dp[600][600][2];\n\nvector<edge> G[2][600];\n\n\nint main(){\n int T;\n cin >> T;\n int n1, m1, n2, m2;\n int a, b;\n string s, nxt;\n edge e;\n rep(t, T){\n cin >> n1 >> m1;\n rep(i, 600)rep(j, 2) G[j][i].clear();\n rep(i, 600)rep(j, 600)rep(k, 2) dp[i][j][k].clear(); \n rep(i, m1){\n cin >> a >> b >> s;\n G[0][a].push_back(edge(b, s));\n }\n cin >> n2 >> m2;\n rep(i, m2){\n cin >> a >> b >> s;\n G[1][a].push_back(edge(b, s));\n }\n dp[0][0][0][\"\"] = 1;\n rep(i, n1)rep(j, n2){\n rep(k, 2){\n\tfor(map<string, ll>::iterator iter = dp[i][j][k].begin(); \n\t iter != dp[i][j][k].end(); iter++){\n\t string s = (*iter).first;\n\t ll d = (*iter).second;\n\t if(k == 1){\n\t rep(v, (int)G[k][j].size()){\n\t e = G[k][j][v];\n\t if(e.s.size() < s.size() && ok(e.s, s)){\n\t\tnxt = string(s.begin() + e.s.size(), s.end());\n\t\tdp[i][e.to][1][nxt] = (dp[i][e.to][1][nxt] + d) % mod;\n\t }\n\t if(e.s.size() >= s.size() && ok(s, e.s)){\n\t\tnxt = string(e.s.begin() + s.size(), e.s.end());\n\t\tdp[i][e.to][0][nxt] = (dp[i][e.to][0][nxt] + d) % mod;\n\t }\n\t }\n\t }else{\n\t rep(v, (int)G[k][i].size()){ \n\t e = G[k][i][v];\n\t if(e.s.size() <= s.size() && ok(e.s, s)){\n\t\tnxt = string(s.begin() + e.s.size(), s.end());\n\t\tdp[e.to][j][0][nxt] = (dp[e.to][j][0][nxt] + d) % mod;\n\t }\n\t if(e.s.size() > s.size() && ok(s, e.s)){\n\t\tnxt = string(e.s.begin() + s.size(), e.s.end());\n\t\tdp[e.to][j][1][nxt] = (dp[e.to][j][1][nxt] + d) % mod;\n\t }\n\t }\n\t }\n\t}\n }\n }\n\n cout << dp[n1-1][n2-1][0][\"\"] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":240,"memory_kb":0,"score_of_the_acc":-0.4035,"final_rank":9},{"submission_id":"aoj_2288_281823","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 <string>\n#include <map>\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 State {\n int left;\n int right;\n int lr;\n int cnt;\n State() {;}\n State(int left, int right, int lr, int cnt) : left(left), right(right), lr(lr), cnt(cnt) {;}\n bool operator<(const State &rhs) const {\n if (left != rhs.left) { return left < rhs.left; }\n if (right != rhs.right) { return right < rhs.right; }\n if (lr != rhs.lr) { return lr < rhs.lr; }\n return cnt < rhs.cnt;\n }\n};\n\nconst ll MOD = 1000000007;\nint n[2];\nint m[2];\nvector<string> strs[2];\nvector<vector<int> > from[2];\nvector<int> to[2];\nmap<State, ll> memo;\n\nll calc(int left, int right, int lr, int cnt);\nll NextState(int left, int right, int lr, int cnt) {\n ll ret = 0;\n if (lr == 0) {\n FORIT(it, from[1][right]) {\n ret = (ret + calc(left, *it, lr, cnt)) % MOD;\n }\n } else {\n FORIT(it, from[0][left]) {\n ret = (ret + calc(*it, right, lr, cnt)) % MOD;\n }\n }\n return ret;\n}\n\nll calc(int left, int right, int lr, int cnt) {\n if (left == m[0] && right == m[1]) { return 1; }\n State state(left, right, lr, cnt);\n if (memo.count(state)) { return memo[state]; }\n ll ret = 0;\n const string &lstr = strs[0][left];\n const string &rstr = strs[1][right];\n if (lr == 0 && (int)lstr.size() == cnt) {\n ret = NextState(to[0][left], right, 1, 0);\n } else if (lr == 1 && (int)rstr.size() == cnt) {\n ret = NextState(left, to[1][right], 0, 0);\n } else {\n int lindex = 0;\n int rindex = 0;\n if (lr == 0) { lindex = cnt; }\n else { rindex = cnt; }\n while (lindex < (int)lstr.size() && rindex < (int)rstr.size()) {\n if (lstr[lindex] != rstr[rindex]) { goto end; }\n lindex++;\n rindex++;\n }\n if (lindex == (int)lstr.size()) {\n ret = NextState(to[0][left], right, 1, rindex);\n } else {\n ret = NextState(left, to[1][right], 0, lindex);\n }\n }\nend:\n return memo[state] = ret;\n}\n\nchar str[100];\nint main() {\n int test;\n scanf(\"%d\", &test);\n while (test--) {\n memo.clear();\n REP(iter, 2) {\n scanf(\"%d %d\", &n[iter], &m[iter]);\n from[iter].clear();\n strs[iter].resize(m[iter] + 1);\n from[iter].resize(n[iter]);\n to[iter].resize(m[iter]);\n REP(i, m[iter]) {\n int f, t;\n scanf(\"%d %d %s\", &f, &t, str);\n from[iter][f].push_back(i);\n to[iter][i] = t;\n strs[iter][i] = str;\n }\n from[iter][n[iter] - 1].push_back(m[iter]);\n strs[iter][m[iter]] = \"!\";\n }\n ll ans = 0;\n FORIT(lit, from[0][0]) {\n ans = (ans + NextState(*lit, 0, 0, 0)) % MOD;\n }\n printf(\"%lld\\n\", ans);\n }\n}","accuracy":1,"time_ms":100,"memory_kb":2576,"score_of_the_acc":-0.1823,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_2288_10339676\",\n \"code_snippet\": \"// AOJ #2288 Oh, My Goat!\\n// 2025.3.31\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int MOD = 1000000007;\\n\\ntypedef vector<vector<pair<char,int>>> Automaton;\\n\\npair<Automaton, int> buildAutomaton(int n, int m, vector<tuple<int,int,string>> &edges) {\\n int stateCount = n;\\n Automaton aut;\\n aut.resize(n + m*5);\\n\\n for(auto &edge : edges) {\\n int u, v;\\n string s;\\n tie(u, v, s) = edge;\\n int cur = u;\\n for (int i = 0; i < (int)s.size(); i++) {\\n char c = s[i];\\n if(i == (int)s.size()-1) aut[cur].push_back({c, v});\\n else {\\n aut[cur].push_back({c, stateCount});\\n cur = stateCount;\\n stateCount++;\\n }\\n }\\n }\\n aut.resize(stateCount);\\n return {aut, n-1};\\n}\\n\\nll dfs(int p, int q, const Automaton &aut1, const Automaton &aut2, int F1, int F2, int tot2, vector<ll> &dp) {\\n int idx = p * tot2 + q;\\n if(dp[idx] != -1) return dp[idx];\\n ll ways = 0;\\n if(p == F1 && q == F2) ways = 1;\\n for(auto &edge1 : aut1[p]){\\n char c = edge1.first;\\n int np = edge1.second;\\n for(auto &edge2 : aut2[q]){\\n if(edge2.first == c){\\n int nq = edge2.second;\\n ways = (ways + dfs(np, nq, aut1, aut2, F1, F2, tot2, dp)) % MOD;\\n }\\n }\\n }\\n dp[idx] = ways;\\n return ways;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n int T;\\n cin >> T;\\n while(T--){\\n int n1, m1;\\n cin >> n1 >> m1;\\n vector<tuple<int,int,string>> edges1;\\n for (int i = 0; i < m1; i++){\\n int a, b;\\n string s;\\n cin >> a >> b >> s;\\n edges1.push_back({a, b, s});\\n }\\n auto res1 = buildAutomaton(n1, m1, edges1);\\n Automaton aut1 = res1.first;\\n int F1 = res1.second;\\n\\n int n2, m2;\\n cin >> n2 >> m2;\\n vector<tuple<int,int,string>> edges2;\\n for (int i = 0; i < m2; i++){\\n int a, b;\\n string s;\\n cin >> a >> b >> s;\\n edges2.push_back({a, b, s});\\n }\\n auto res2 = buildAutomaton(n2, m2, edges2);\\n Automaton aut2 = res2.first;\\n int F2 = res2.second;\\n\\n int tot1 = aut1.size();\\n int tot2 = aut2.size();\\n\\n vector<ll> dp(tot1 * tot2, -1);\\n\\n ll ans = dfs(0, 0, aut1, aut2, F1, F2, tot2, dp);\\n cout << ans<< endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 56788,\n \"score_of_the_acc\": -0.5387,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2288_4371957\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 99999999999999999\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n\\n#define SIZE 605\\nstruct Edge{\\n\\n\\tint from,to;\\n\\tchar buf[6];\\n\\tint len;\\n};\\n\\nint N1,N2,M1,M2;\\nll dp[SIZE][SIZE][6][6];\\nEdge edge1[SIZE],edge2[SIZE];\\nvector<int> G1[SIZE],G2[SIZE];\\n\\nll recursive(int e1,int loc1,int e2,int loc2){\\n\\n\\tif(dp[e1][e2][loc1][loc2] != -1){\\n\\n\\t\\treturn dp[e1][e2][loc1][loc2];\\n\\t}\\n\\n\\tif(edge1[e1].buf[loc1] != edge2[e2].buf[loc2]){\\n\\n\\t\\treturn dp[e1][e2][loc1][loc2] = 0;\\n\\t}\\n\\n\\tll ret = 0;\\n\\n\\tif(loc1+1 < edge1[e1].len && loc2+1 < edge2[e2].len){ //両方非終端\\n\\n\\t\\tret = recursive(e1,loc1+1,e2,loc2+1);\\n\\n\\t}else if(loc1+1 == edge1[e1].len && loc2+1 < edge2[e2].len){ //DAG1が終端\\n\\n\\t\\tif(edge1[e1].to == N1-1){\\n\\n\\t\\t\\tret = 0;\\n\\n\\t\\t}else{ //DAG1が新しいノードへ\\n\\n\\t\\t\\tfor(int i = 0; i < G1[edge1[e1].to].size(); i++){\\n\\n\\t\\t\\t\\tret += recursive(G1[edge1[e1].to][i],0,e2,loc2+1);\\n\\t\\t\\t\\tret %= MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}else if(loc1+1 < edge1[e1].len && loc2+1 == edge2[e2].len){ //DAG2が終端\\n\\n\\t\\tif(edge2[e2].to == N2-1){\\n\\n\\t\\t\\tret = 0;\\n\\n\\t\\t}else{ //DAG2が新しいノードへ\\n\\n\\t\\t\\tfor(int i = 0; i < G2[edge2[e2].to].size(); i++){\\n\\n\\t\\t\\t\\tret += recursive(e1,loc1+1,G2[edge2[e2].to][i],0);\\n\\t\\t\\t\\tret %= MOD;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t}else{ //両方終端\\n\\n\\t\\tif((edge1[e1].to == N1-1 && edge2[e2].to != N2-1) ||\\n\\t\\t\\t\\t(edge1[e1].to != N1-1 && edge2[e2].to == N2-1)){ //片方だけ文章完成\\n\\n\\t\\t\\tret = 0;\\n\\n\\t\\t}else if(edge1[e1].to == N1-1 && edge2[e2].to == N2-1){ //両方文章完成\\n\\n\\t\\t\\tret = 1;\\n\\n\\t\\t}else{ //両方新しいノードへ\\n\\n\\t\\t\\tfor(int i = 0; i < G1[edge1[e1].to].size(); i++){\\n\\t\\t\\t\\tfor(int k = 0; k < G2[edge2[e2].to].size(); k++){\\n\\n\\t\\t\\t\\t\\tret += recursive(G1[edge1[e1].to][i],0,G2[edge2[e2].to][k],0);\\n\\t\\t\\t\\t\\tret %= MOD;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn dp[e1][e2][loc1][loc2] = ret;\\n}\\n\\n\\nvoid func(){\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\t\\tG1[i].clear();\\n\\t\\tG2[i].clear();\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N1,&M1);\\n\\n\\tfor(int i = 0; i < M1; i++){\\n\\n\\t\\tscanf(\\\"%d %d %s\\\",&edge1[i].from,&edge1[i].to,edge1[i].buf);\\n\\t\\tfor(edge1[i].len = 0; edge1[i].buf[edge1[i].len] != '\\\\0'; edge1[i].len++);\\n\\n\\t\\tG1[edge1[i].from].push_back(i);\\n\\t}\\n\\n\\tscanf(\\\"%d %d\\\",&N2,&M2);\\n\\n\\tfor(int i = 0; i < M2; i++){\\n\\n\\t\\tscanf(\\\"%d %d %s\\\",&edge2[i].from,&edge2[i].to,edge2[i].buf);\\n\\t\\tfor(edge2[i].len = 0; edge2[i].buf[edge2[i].len] != '\\\\0'; edge2[i].len++);\\n\\n\\t\\tG2[edge2[i].from].push_back(i);\\n\\t}\\n\\n\\tfor(int i = 0; i < M1; i++){\\n\\t\\tfor(int k = 0; k < M2; k++){\\n\\t\\t\\tfor(int a = 0; a < 6; a++){\\n\\t\\t\\t\\tfor(int b = 0; b < 6; b++){\\n\\t\\t\\t\\t\\tdp[i][k][a][b] = -1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tll ans = 0;\\n\\tint root = 0;\\n\\n\\tfor(int i = 0; i < G1[root].size(); i++){\\n\\t\\tfor(int k = 0; k < G2[root].size(); k++){\\n\\n\\t\\t\\tans += recursive(G1[root][i],0,G2[root][k],0);\\n\\t\\t\\tans %= MOD;\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n}\\n\\nint main(){\\n\\n\\tint num_case;\\n\\tscanf(\\\"%d\\\",&num_case);\\n\\n\\tfor(int loop = 0; loop < num_case; loop++){\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 105420,\n \"score_of_the_acc\": -1.1754,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2288_365380\",\n \"code_snippet\": \"#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\\nconst int MOD = 1000000007;\\n\\nvoid input(int &n, int &m, vector<vector<int> >& to, vector<vector<string> >& str)\\n{\\n cin >> n >> m;\\n to.assign(n, vector<int>());\\n str.assign(n, vector<string>());\\n\\n for(int i=0; i<m; ++i){\\n int a, b;\\n string s;\\n cin >> a >> b >> s;\\n to[a].push_back(b);\\n str[a].push_back(s);\\n }\\n}\\n\\nbool compare(string& s, string& t)\\n{\\n int n = min(s.size(), t.size());\\n if(s.substr(0, n) != t.substr(0, n))\\n return false;\\n\\n s = s.substr(n);\\n t = t.substr(n);\\n return true;\\n}\\n\\nint main()\\n{\\n int t;\\n cin >> t;\\n\\n while(--t >= 0){\\n int n1, m1, n2, m2;\\n vector<vector<int> > to1, to2;\\n vector<vector<string> > str1, str2;\\n input(n1, m1, to1, str1);\\n input(n2, m2, to2, str2);\\n\\n vector<vector<vector<map<string, int> > > > dp(n1, vector<vector<map<string, int> > >(n2, vector<map<string, int> >(2)));\\n dp[0][0][0][\\\"\\\"] = 1;\\n\\n for(int i=0; i<n1; ++i){\\n for(int j=0; j<n2; ++j){\\n if(i == n1-1 && j == n2-1)\\n break;\\n\\n while(!dp[i][j][0].empty()){\\n map<string, int>::iterator it = dp[i][j][0].begin();\\n string s0 = it->first;\\n int num = it->second;\\n dp[i][j][0].erase(it);\\n\\n for(unsigned k=0; k<to1[i].size(); ++k){\\n int to = to1[i][k];\\n string s = s0;\\n string t = str1[i][k];\\n if(compare(s, t)){\\n if(t.size() == 0){\\n dp[to][j][0][s] += num;\\n dp[to][j][0][s] %= MOD;\\n }else{\\n dp[to][j][1][t] += num;\\n dp[to][j][1][t] %= MOD;\\n }\\n }\\n }\\n }\\n\\n while(!dp[i][j][1].empty()){\\n map<string, int>::iterator it = dp[i][j][1].begin();\\n string s0 = it->first;\\n int num = it->second;\\n dp[i][j][1].erase(it);\\n\\n for(unsigned k=0; k<to2[j].size(); ++k){\\n int to = to2[j][k];\\n string s = s0;\\n string t = str2[j][k];\\n if(compare(s, t)){\\n if(s.size() == 0){\\n dp[i][to][0][t] += num;\\n dp[i][to][0][t] %= MOD;\\n }else{\\n dp[i][to][1][s] += num;\\n dp[i][to][1][s] %= MOD;\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n cout << dp[n1-1][n2-1][0][\\\"\\\"] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 17000,\n \"score_of_the_acc\": -0.4069,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2288_364629\",\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\\nconst int MOD = 1e9+7;\\n\\nstring str1[600];\\nstring str2[600];\\nvector<int> g1[600], g2[600];\\nbool goal1[600], goal2[600];\\nint A[600], B[600];\\nint n1, m1;\\nint n2, m2;\\n\\nint memo[600][6][600];\\n\\nint solve(int p1, int q1, int p2, int q2) {\\n //cout << p1 << \\\" \\\" << q1 << \\\" \\\" << p2 << \\\" \\\" << q2 << endl;\\n if (q2 == 0 && memo[p1][q1][p2] >= 0) return memo[p1][q1][p2];\\n if (!goal1[p1] && q1 == str1[p1].size()) {\\n ll res = 0;\\n FOR(it, g1[p1])\\n res = (res + solve(*it, 0, p2, q2)) % MOD;\\n if (q2 == 0) memo[p1][q1][p2] = res;\\n return res;\\n }\\n if (!goal2[p2] && q2 == str2[p2].size()) {\\n ll res = 0;\\n FOR(it, g2[p2])\\n res = (res + solve(p1, q1, *it, 0)) % MOD;\\n return res;\\n }\\n bool f1 = (goal1[p1] && q1 == str1[p1].size());\\n bool f2 = (goal2[p2] && q2 == str2[p2].size());\\n int res;\\n if (f1 || f2) {\\n res = f1 && f2;\\n } else {\\n if (str1[p1][q1] == str2[p2][q2]) {\\n res = solve(p1, q1+1, p2, q2+1);\\n } else {\\n res = 0;\\n }\\n }\\n if (q2 == 0) memo[p1][q1][p2] = res;\\n return res;\\n}\\n\\nint main() {\\n int T;\\n cin >> T;\\n while(T--) {\\n cin >> n1 >> m1;\\n REP(i, m1) g1[i].clear();\\n memset(goal1, 0, sizeof(goal1));\\n vector<int> start1;\\n REP(i, m1) {\\n cin >> A[i] >> B[i] >> str1[i];\\n if (A[i] == 0) start1.push_back(i);\\n if (B[i] == n1-1) goal1[i] = 1;\\n REP(j, i) {\\n if (B[j] == A[i]) {\\n g1[j].push_back(i);\\n }\\n }\\n }\\n cin >> n2 >> m2;\\n REP(i, m2) g2[i].clear();\\n memset(goal2, 0, sizeof(goal2));\\n vector<int> start2;\\n REP(i, m2) {\\n cin >> A[i] >> B[i] >> str2[i];\\n if (A[i] == 0) start2.push_back(i);\\n if (B[i] == n2-1) goal2[i] = 1;\\n REP(j, i) {\\n if (B[j] == A[i]) {\\n g2[j].push_back(i);\\n }\\n }\\n }\\n ll res = 0;\\n memset(memo,-1,sizeof(memo));\\n FOR(it, start1) {\\n FOR(jt, start2) {\\n res = (res + solve(*it,0,*jt,0)) % MOD;\\n }\\n }\\n cout << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 9688,\n \"score_of_the_acc\": -0.1972,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2288_329212\",\n \"code_snippet\": \"#include<string>\\n#include<vector>\\n#include<cstring>\\n#include<iostream>\\n\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n\\nusing namespace std;\\n\\nconst int M=1000000007;\\n\\nstruct edge{\\n\\tint u,v,id;\\n\\tstring s;\\n};\\n\\nint n1,n2;\\nedge E1[600],E2[600];\\nvector<int> adj1[500],adj2[500];\\n\\nint dp[600][600][6];\\nint dfs(int i1,int i2,int p1,int p2){\\n\\tint dummy,&res=(p1==0?dp[i1][i2][p2]:dummy);\\n\\tif(p1==0 && ~res) return res;\\n\\n\\t// 2 ÂÌ|C^ª¯É DAG ÌI[ɽ\\n\\tif(p1==E1[i1].s.length() && p2==E2[i2].s.length()){\\n\\t\\tint v1=E1[i1].v,v2=E2[i2].v;\\n\\t\\tif(v1==n1-1 && v2==n2-1) return res=1;\\n\\t}\\n\\n\\t// |C^ 1 ª¶ñI[ɽ\\n\\tif(p1==E1[i1].s.length()){\\n\\t\\tint v=E1[i1].v,cnt=0;\\n\\t\\trep(k,adj1[v].size()) cnt=(cnt+dfs(adj1[v][k],i2,0,p2))%M;\\n\\t\\treturn res=cnt;\\n\\t}\\n\\n\\t// |C^ 2 ª¶ñI[ɽ\\n\\tif(p2==E2[i2].s.length()){\\n\\t\\tint v=E2[i2].v,cnt=0;\\n\\t\\trep(k,adj2[v].size()) cnt=(cnt+dfs(i1,adj2[v][k],p1,0))%M;\\n\\t\\treturn res=cnt;\\n\\t}\\n\\n\\t// wµÄ¢é¶ªá¤ÈçTõÅ¿Øè\\n\\tif(E1[i1].s[p1]!=E2[i2].s[p2]) return res=0;\\n\\n\\treturn res=dfs(i1,i2,p1+1,p2+1);\\n}\\n\\nint main(){\\n\\tint T; cin>>T;\\n\\twhile(T--){\\n\\t\\tmemset(dp,-1,sizeof dp);\\n\\t\\tint m1; cin>>n1>>m1;\\n\\t\\trep(u,n1) adj1[u].clear();\\n\\t\\trep(j,m1){\\n\\t\\t\\tint u,v;\\n\\t\\t\\tstring s; cin>>u>>v>>s;\\n\\t\\t\\tadj1[u].push_back(j);\\n\\t\\t\\tE1[j]=(edge){u,v,j,s};\\n\\t\\t}\\n\\t\\tint m2; cin>>n2>>m2;\\n\\t\\trep(u,n2) adj2[u].clear();\\n\\t\\trep(j,m2){\\n\\t\\t\\tint u,v;\\n\\t\\t\\tstring s; cin>>u>>v>>s;\\n\\t\\t\\tadj2[u].push_back(j);\\n\\t\\t\\tE2[j]=(edge){u,v,j,s};\\n\\t\\t}\\n\\n\\t\\tint ans=0;\\n\\t\\trep(i,adj1[0].size()) rep(j,adj2[0].size()) {\\n\\t\\t\\tans=(ans+dfs(adj1[0][i],adj2[0][j],0,0))%M;\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 9584,\n \"score_of_the_acc\": -0.1786,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2288_294086\",\n \"code_snippet\": \"#include <iostream>\\n#include <fstream>\\n#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <cctype>\\n#include <cmath>\\n#include <complex>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <deque>\\n#include <iomanip>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <set>\\n#include <stack>\\n#include <sstream>\\n#include <string>\\n#include <vector>\\nusing namespace std;\\n\\n#define EPS 1e-9\\n#define INF MOD\\n#define MOD 1000000007LL\\n#define fir first\\n#define iss istringstream\\n#define sst stringstream\\n#define ite iterator\\n#define ll long long\\n#define mp make_pair\\n#define rep(i,n) rep2(i,0,n)\\n#define rep2(i,m,n) for(int i=m;i<n;i++)\\n#define pi pair<int,int>\\n#define pb push_back\\n#define sec second\\n#define sh(i) (1LL<<i)\\n#define sz size()\\n#define vi vector<int>\\n#define vc vector\\n#define vl vector<ll>\\n#define vs vector<string>\\n\\nint T,n,m,N,M,a,b;\\nmap<pi,int> dp;\\nstring s;\\nstruct E{int from;char c;E(int a,char b):from(a),c(b){}};\\nvc<E> e[3010],f[3010];\\n\\nint F(int a,int b){\\n\\tif(dp.find(pi(a,b))!=dp.end())return dp[pi(a,b)];\\n\\tint& res=dp[pi(a,b)];\\n\\tif(!a&&!b)return res=1;\\n\\trep(i,e[a].sz)rep(j,f[b].sz)if(e[a][i].c==f[b][j].c){\\n\\t\\tres=(res+F(e[a][i].from,f[b][j].from))%MOD;\\n\\t}\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tcin>>T;\\n\\trep(tc,T){\\n\\t\\trep(i,3010)e[i].clear(),f[i].clear();\\n\\t\\tcin>>n>>m;\\n\\t\\tint cur=n;\\n\\t\\trep(i,m){\\n\\t\\t\\tcin>>a>>b>>s;\\n\\t\\t\\tif(s.sz==1)e[b].pb(E(a,s[0]));\\n\\t\\t\\telse rep(j,s.sz){\\n\\t\\t\\t\\tif(j==0)e[cur].pb(E(a,s[j])),cur++;\\n\\t\\t\\t\\telse if(j==s.sz-1)e[b].pb(E(cur-1,s[j]));\\n\\t\\t\\t\\telse e[cur].pb(E(cur-1,s[j])),cur++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcin>>N>>M;\\n\\t\\tcur=N;\\n\\t\\trep(i,M){\\n\\t\\t\\tcin>>a>>b>>s;\\n\\t\\t\\tif(s.sz==1)f[b].pb(E(a,s[0]));\\n\\t\\t\\telse rep(j,s.sz){\\n\\t\\t\\t\\tif(j==0)f[cur].pb(E(a,s[j])),cur++;\\n\\t\\t\\t\\telse if(j==s.sz-1)f[b].pb(E(cur-1,s[j]));\\n\\t\\t\\t\\telse f[cur].pb(E(cur-1,s[j])),cur++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdp.clear();\\n\\t\\tcout<<F(n-1,N-1)<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.0175,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2288_289836\",\n \"code_snippet\": \"#include <cstring>\\n#include <iostream>\\n#include <cstdio>\\n#include <queue>\\n#define REP(i,n) for(int i=0; i<(int)(n); i++)\\n\\n#define f first\\n#define s second\\n#define mp make_pair\\n\\nusing namespace std;\\n\\nint n[2], m[2];\\n\\nstruct edge{\\n int src;\\n int dst;\\n string label;\\n\\n edge(int s = 0, int d = 0, string l = \\\"\\\") :\\n src(s), dst(d), label(l) {}\\n};\\n\\nvector<edge> e[2];\\nvector<vector<int> > re[2];\\n\\nint memo[600][600];\\nconst int mod = 1000000007;\\n\\nint solve(int id1, int id2, int l1, int l2){\\n if(e[0][id1].dst == n[0] - 1 &&\\n e[1][id2].dst == n[1] - 1 &&\\n l1 == e[0][id1].label.size() &&\\n l2 == e[1][id2].label.size())\\n return 1;\\n\\n if(l1 == e[0][id1].label.size() &&\\n l2 == e[1][id2].label.size() &&\\n memo[id1][id2] != -1)\\n return memo[id1][id2];\\n \\n int ret = 0;\\n\\n if(l1 == e[0][id1].label.size()){\\n int src = e[0][id1].dst;\\n\\n REP(i, re[0][src].size()){\\n int i1 = re[0][src][i];\\n int i2 = id2;\\n int ln1 = 0;\\n int ln2 = l2;\\n const string &s1 = e[0][i1].label;\\n const string &s2 = e[1][i2].label;\\n\\n while(ln1 < s1.size() && ln2 < s2.size() && s1[ln1] == s2[ln2]){\\n\\tln1++; ln2++;\\n }\\n\\n if(ln1 == s1.size() || ln2 == s2.size()){\\n\\tret = ((long long)ret + solve(i1, i2, ln1, ln2)) % mod;\\n }\\n }\\n }else if(l2 == e[1][id2].label.size()){\\n int src = e[1][id2].dst;\\n\\n REP(i, re[1][src].size()){\\n int i1 = id1;\\n int i2 = re[1][src][i];\\n int ln1 = l1;\\n int ln2 = 0;\\n const string &s1 = e[0][i1].label;\\n const string &s2 = e[1][i2].label;\\n\\n while(ln1 < s1.size() && ln2 < s2.size() && s1[ln1] == s2[ln2]){\\n\\tln1++; ln2++;\\n }\\n\\n if(ln1 == s1.size() || ln2 == s2.size()){\\n\\tret = ((long long)ret + solve(i1, i2, ln1, ln2)) % mod;\\n }\\n }\\n }else{\\n printf(\\\"solve(%d, %d, %d, %d)\\\\n\\\", id1, id2, l1, l2);\\n\\n printf(\\\"e[0][%d].label: %s\\\\n\\\", id1, e[0][id1].label.c_str());\\n printf(\\\"e[1][%d].label: %s\\\\n\\\", id2, e[1][id2].label.c_str());\\n\\n throw \\\"error\\\";\\n }\\n\\n if(l1 == e[0][id1].label.size() &&\\n l2 == e[1][id2].label.size())\\n memo[id1][id2] = ret;\\n\\n return ret;\\n}\\n\\nint main(){\\n int t; cin >> t;\\n while(t --> 0){\\n REP(i,2){\\n cin >> n[i] >> m[i];\\n\\n e[i] = vector<edge>(m[i]);\\n re[i] = vector<vector<int> >(n[i]);\\n\\n REP(j,m[i]){\\n\\tint s, d;\\n\\tstring l;\\n\\tcin >> s >> d >> l;\\n\\te[i][j] = edge(s, d, l);\\n\\tre[i][s].push_back(j);\\n }\\n }\\n\\n memset(memo, -1, sizeof(memo));\\n\\n int ans = 0;\\n REP(i, re[0][0].size()) REP(j, re[1][0].size()){\\n int id1 = re[0][0][i];\\n int id2 = re[1][0][j];\\n int l1 = 0;\\n int l2 = 0;\\n const string &s1 = e[0][id1].label;\\n const string &s2 = e[1][id2].label;\\n\\n while(l1 != s1.size() && l2 != s2.size() && s1[l1] == s2[l2]){\\n\\tl1++; l2++;\\n }\\n\\n if(l1 == s1.size() || l2 == s2.size()){\\n\\tans = ((long long)ans + solve(id1, id2, l1, l2)) % mod;\\n }\\n }\\n\\n printf(\\\"%d\\\\n\\\", ans);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 0,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2288_286538\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <iostream>\\n#include <vector>\\n#include <list>\\n#include <cmath>\\n#include <fstream>\\n#include <algorithm>\\n#include <string>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <complex>\\n#include <iterator>\\n#include <cstdlib>\\n#include <cstring>\\n#include <sstream>\\n\\nusing namespace std;\\n\\n#define EPS (1e-10)\\n#define EQ(a,b) (abs((a) - (b)) < EPS)\\n#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))\\n\\ntypedef complex<double> P;\\ntypedef long long ll;\\n\\nstruct edge{\\n int to;\\n char ch;\\n};\\n\\nvector<edge> G[2][4000];\\n// dp[i][j]->m[gÌm[hði,m[gÌRs[Ìm[hðjƵ½Æ«A»±ÜÅɤʵĻêé¶ÍÌ\\n//int dp[3600][3600];\\nmap<int,map<int,int> > dp;\\nint n[2],m[2];\\n\\nconst int INF=-1;\\nconst int MOD=1000000007;\\n\\nint dfs(int idx1,int idx2){\\n //if(dp[idx1][idx2]!=-1)\\n // return dp[idx1][idx2];\\n if(!(dp.find(idx1)==dp.end()||dp[idx1].find(idx2)==dp[idx1].end()))\\n return dp[idx1][idx2];\\n if(idx1==0&&idx2==0)\\n return 1;\\n else if(idx1==0||idx2==0)\\n return 0;\\n // »ÝÌn_É¢½é[gð·×IJ×ã°é\\n // ßèûÌgÝí¹ðXgAbvµA·×IJ×é\\n int res=0;\\n for(int i = 0; i < G[0][idx1].size(); i++){\\n edge back=G[0][idx1][i];\\n for(int j = 0; j < G[1][idx2].size(); j++){\\n edge back2=G[1][idx2][j];\\n if(back.ch==back2.ch){\\n res+=dfs(back.to,back2.to);\\n res%=MOD;\\n }\\n }\\n }\\n return dp[idx1][idx2]=res%MOD;\\n}\\n\\nint main(){\\n\\n int t;\\n cin>>t;\\n while(t--){\\n dp.clear();\\n //memset(dp,0,sizeof(dp));\\n //for(int i = 0; i < 3600; i++)\\n // fill(dp[i],dp[i]+3600,INF);\\n for(int j = 0; j < 2; j++)\\n for(int i = 0; i < 4000; i++)\\n G[j][i].clear();\\n for(int j = 0; j < 2; j++){\\n cin>>n[j]>>m[j];\\n int idx=n[j];\\n for(int i = 0; i < m[j]; i++){\\n int from,to;\\n string str;\\n cin>>from>>to>>str;\\n // ¶ñ𪣵Ļê¼êÉidð¯ÄGÉi[·é\\n int prv=from;\\n for(int k = 0; k < str.size(); k++){\\n edge e;\\n e.to=prv;\\n e.ch=str[k];\\n int tmp=idx;\\n if(k==str.size()-1){\\n tmp=to;\\n }\\n G[j][tmp].push_back(e);\\n prv=tmp;\\n if(k==str.size()-1)\\n break;\\n idx++;\\n }\\n }\\n }\\n // »ÄAŦã°\\n int res=dfs(n[0]-1,n[1]-1);\\n cout<<res%MOD<<endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.0175,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2288_286537\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <iostream>\\n#include <vector>\\n#include <list>\\n#include <cmath>\\n#include <fstream>\\n#include <algorithm>\\n#include <string>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <complex>\\n#include <iterator>\\n#include <cstdlib>\\n#include <cstring>\\n#include <sstream>\\n\\nusing namespace std;\\n\\n#define EPS (1e-10)\\n#define EQ(a,b) (abs((a) - (b)) < EPS)\\n#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))\\n\\ntypedef complex<double> P;\\ntypedef long long ll;\\n\\nstruct edge{\\n int to;\\n char ch;\\n};\\n\\nvector<edge> G[2][4000];\\n// dp[i][j]->m[gÌm[hði,m[gÌRs[Ìm[hðjƵ½Æ«A»±ÜÅɤʵĻêé¶ÍÌ\\nint dp[3600][3600];\\nint n[2],m[2];\\n\\nconst int INF=-1;\\nconst int MOD=1000000007;\\n\\nint dfs(int idx1,int idx2){\\n if(dp[idx1][idx2]!=-1)\\n return dp[idx1][idx2];\\n if(idx1==0&&idx2==0)\\n return 1;\\n else if(idx1==0||idx2==0){\\n return 0;\\n }\\n // »ÝÌn_É¢½é[gð·×IJ×ã°é\\n // ßèûÌgÝí¹ðXgAbvµA·×IJ×é\\n int res=0;\\n for(int i = 0; i < G[0][idx1].size(); i++){\\n edge back=G[0][idx1][i];\\n for(int j = 0; j < G[1][idx2].size(); j++){\\n edge back2=G[1][idx2][j];\\n if(back.ch==back2.ch){\\n res+=dfs(back.to,back2.to);\\n res%=MOD;\\n }\\n }\\n }\\n return dp[idx1][idx2]=res%MOD;\\n}\\n\\nint main(){\\n\\n int t;\\n cin>>t;\\n while(t--){\\n //memset(dp,0,sizeof(dp));\\n for(int i = 0; i < 3600; i++)\\n fill(dp[i],dp[i]+3600,INF);\\n for(int j = 0; j < 2; j++)\\n for(int i = 0; i < 4000; i++)\\n G[j][i].clear();\\n for(int j = 0; j < 2; j++){\\n cin>>n[j]>>m[j];\\n int idx=n[j];\\n for(int i = 0; i < m[j]; i++){\\n int from,to;\\n string str;\\n cin>>from>>to>>str;\\n // ¶ñ𪣵Ļê¼êÉidð¯ÄGÉi[·é\\n int prv=from;\\n for(int k = 0; k < str.size(); k++){\\n edge e;\\n e.to=prv;\\n e.ch=str[k];\\n int tmp=idx;\\n if(k==str.size()-1){\\n tmp=to;\\n }\\n G[j][tmp].push_back(e);\\n prv=tmp;\\n if(k==str.size()-1)\\n break;\\n idx++;\\n }\\n }\\n }\\n // »ÄAŦã°\\n int res=dfs(n[0]-1,n[1]-1);\\n cout<<res%MOD<<endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 580,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -1,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2288_284039\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n\\nusing namespace std;\\n \\nint n[2],m[2];\\nmap< pair<string,string> , int > memo[501][501];\\nvector< vector<int> > a[2];\\nvector< vector<string> > b[2];\\n \\nint dfs(int p1,int p2,string s1,string s2){\\n if(p1 == n[0]-1 && p2 == n[1]-1) return (s1 == \\\"\\\" && s2 == \\\"\\\");\\n\\t\\tif(memo[p1][p2].count(make_pair(s1,s2))) return memo[p1][p2][make_pair(s1,s2)];\\n\\n int ans = 0;\\n\\t\\tif(p1 <= p2 || p2 == n[1]-1){\\n\\t\\t\\tfor(int i = 0 ; i < a[0][p1].size() ; i++){\\n\\t\\t\\t\\t\\tstring x = s1 + b[0][p1][i];\\n\\t\\t\\t\\t\\tstring y = s2;\\n\\t\\t\\t\\t\\tint I = 0 , J = 0;\\n\\t\\t\\t\\t\\tfor( ; I < x.size() && J < y.size() && x[I] == y[J] ; ) I++ , J++ ;\\n\\t\\t\\t\\t\\tif( I == x.size() || J == y.size() ){\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tif( I == x.size() && I == y.size() ) x = \\\"\\\" , y = \\\"\\\";\\n\\t\\t\\t\\t\\t\\t\\telse if( I == x.size() ) x = \\\"\\\" , y = y.substr(J);\\n\\t\\t\\t\\t\\t\\t\\telse if( J == y.size() ) x = x.substr(I) , y = \\\"\\\";\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tans = ( ans + dfs(a[0][p1][i],p2,x,y) ) % 1000000007;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n \\n\\t\\tif(p1 > p2 || p1 == n[0]-1){\\n\\t\\t\\tfor(int j = 0 ; j < a[1][p2].size() ; j++){\\n\\t\\t\\t\\t\\tstring x = s1;\\n\\t\\t\\t\\t\\tstring y = s2 + b[1][p2][j] ;\\n\\t\\t\\t\\t\\tint I = 0 , J = 0;\\n\\t\\t\\t\\t\\tfor( ; I < x.size() && J < y.size() && x[I] == y[J] ; ) I++ , J++ ;\\n\\t\\t\\t\\t\\tif( I == x.size() || J == y.size() ){\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tif( I == x.size() && I == y.size() ) x = \\\"\\\" , y = \\\"\\\";\\n\\t\\t\\t\\t\\t\\t\\telse if( I == x.size() ) x = \\\"\\\" , y = y.substr(J);\\n\\t\\t\\t\\t\\t\\t\\telse if( J == y.size() ) x = x.substr(I) , y = \\\"\\\";\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tans = ( ans + dfs(p1, a[1][p2][j],x,y) ) % 1000000007;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n return memo[p1][p2][make_pair(s1,s2)] = ans;\\n}\\n \\nint main(){\\n int T;cin >> T;\\n while(T--){\\n for(int i = 0 ; i < 2 ; i++){\\n cin >> n[i] >> m[i];\\n //cout << n[i] << \\\" \\\" << m[i] << endl;\\n a[i].clear(); b[i].clear(); a[i].resize((unsigned)n[i]) , b[i].resize((unsigned)n[i]);\\n for(int j = 0 ; j < m[i] ; j++){\\n int A,B; string C;\\n cin >> A >> B >> C;\\n a[i][A].push_back(B);\\n b[i][A].push_back(C);\\n }\\n }\\n\\t\\t\\t\\tfor(int i = 0 ; i < 501 ; i++)\\n\\t\\t\\t\\t\\tfor(int j = 0 ; j < 501 ; j++)\\n\\t\\t\\t\\t\\t\\tmemo[i][j].clear();\\n cout << dfs(0,0,\\\"\\\",\\\"\\\") << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 7756,\n \"score_of_the_acc\": -0.1964,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2288_283931\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n\\nusing namespace std;\\n \\nint n[2],m[2];\\nmap< pair<string,string> , int > memo[501][501];\\nvector< vector<int> > a[2];\\nvector< vector<string> > b[2];\\n \\nint dfs(int p1,int p2,string s1,string s2){\\n //cout << p1 << \\\" \\\" << p2 << \\\" [\\\" << s1 << \\\"] [\\\" << s2 << \\\"]\\\" << \\\"{\\\" << n[0] << \\\" \\\" << n[1] << endl;\\n if(p1 == n[0]-1 && p2 == n[1]-1) return (s1 == \\\"\\\" && s2 == \\\"\\\");\\n\\t\\tif(memo[p1][p2].count(make_pair(s1,s2))) return memo[p1][p2][make_pair(s1,s2)];\\n\\n int ans = 0;\\n\\t\\tif(p1 <= p2 || p2 == n[1]-1){\\n\\t\\t\\tfor(int i = 0 ; i < a[0][p1].size() ; i++){\\n\\t\\t\\t\\t\\tstring x = s1 + b[0][p1][i];\\n\\t\\t\\t\\t\\tstring y = s2;\\n\\t\\t\\t\\t\\tint I = 0 , J = 0;\\n\\t\\t\\t\\t\\tfor( ; I < x.size() && J < y.size() && x[I] == y[J] ; ) I++ , J++ ;\\n\\t\\t\\t\\t\\tif( I == x.size() || J == y.size() ){\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tif( I == x.size() && I == y.size() ) x = \\\"\\\" , y = \\\"\\\";\\n\\t\\t\\t\\t\\t\\t\\telse if( I == x.size() ) x = \\\"\\\" , y = y.substr(J);\\n\\t\\t\\t\\t\\t\\t\\telse if( J == y.size() ) x = x.substr(I) , y = \\\"\\\";\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tans = ( ans + dfs(a[0][p1][i],p2,x,y) ) % 1000000007;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n \\n\\t\\tif(p1 > p2 || p1 == n[0]-1){\\n\\t\\t\\tfor(int j = 0 ; j < a[1][p2].size() ; j++){\\n\\t\\t\\t\\t\\tstring x = s1;\\n\\t\\t\\t\\t\\tstring y = s2 + b[1][p2][j] ;\\n\\t\\t\\t\\t\\tint I = 0 , J = 0;\\n\\t\\t\\t\\t\\tfor( ; I < x.size() && J < y.size() && x[I] == y[J] ; ) I++ , J++ ;\\n\\t\\t\\t\\t\\tif( I == x.size() || J == y.size() ){\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tif( I == x.size() && I == y.size() ) x = \\\"\\\" , y = \\\"\\\";\\n\\t\\t\\t\\t\\t\\t\\telse if( I == x.size() ) x = \\\"\\\" , y = y.substr(J);\\n\\t\\t\\t\\t\\t\\t\\telse if( J == y.size() ) x = x.substr(I) , y = \\\"\\\";\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tans = ( ans + dfs(p1, a[1][p2][j],x,y) ) % 1000000007;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n return memo[p1][p2][make_pair(s1,s2)] = ans;\\n}\\n \\nint main(){\\n int T;cin >> T;\\n while(T--){\\n for(int i = 0 ; i < 2 ; i++){\\n cin >> n[i] >> m[i];\\n //cout << n[i] << \\\" \\\" << m[i] << endl;\\n a[i].clear(); b[i].clear(); a[i].resize((unsigned)n[i]) , b[i].resize((unsigned)n[i]);\\n for(int j = 0 ; j < m[i] ; j++){\\n int A,B; string C;\\n cin >> A >> B >> C;\\n a[i][A].push_back(B);\\n b[i][A].push_back(C);\\n }\\n }\\n\\t\\t\\t\\tfor(int i = 0 ; i < 501 ; i++)\\n\\t\\t\\t\\t\\tfor(int j = 0 ; j < 501 ; j++)\\n\\t\\t\\t\\t\\t\\tmemo[i][j].clear();\\n cout << dfs(0,0,\\\"\\\",\\\"\\\") << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.1228,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2288_282229\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <string.h>\\n#include <string>\\n#include <vector>\\n#include <map>\\n#include <algorithm>\\nusing namespace std;\\n#define rep(i, n) for(int i=0; i<(int)(n); i++)\\ntypedef long long Int;\\n#define MOD (1000000007)\\ninline void up(int &a, int b) { a = (a+b)%MOD; }\\n\\ntemplate<class W>\\nstruct E {\\n int u, v;\\n W w;\\n E() {}\\n E(int u, int v, const W& w) : u(u), v(v), w(w) {}\\n};\\ntemplate<class W>\\nbool less_u(const E<W>& l, const E<W>& r) {\\n return l.u!=r.u ? l.u<r.u : l.v!=r.v ? l.v<r.v : l.w<r.w;\\n}\\n\\nint N[2], M[2];\\nint of(int x, int y, int i, int j) {\\n return (((x*600)+y)*16+i)*16+j;\\n}\\n\\nint main() {\\n int T;\\n scanf(\\\"%d\\\", &T);\\n vector<E<string> > g[2];\\n map<int, int> dp;\\n while(T--) {\\n vector<vector<int> > to[2];\\n rep(k, 2) {\\n scanf(\\\"%d%d\\\", N+k, M+k);\\n g[k].clear();\\n rep(i, M[k]) {\\n int a, b;\\n char buf[8];\\n scanf(\\\"%d%d%s\\\", &a, &b, buf);\\n g[k].push_back(E<string>(a, b, buf));\\n }\\n sort(g[k].begin(), g[k].end(), less_u<string>);\\n to[k] = vector<vector<int> >(N[k]);\\n rep(i, M[k]) {\\n const int u = g[k][i].u;\\n to[k][u].push_back(i);\\n }\\n to[k][N[k]-1].push_back(M[k]);\\n }\\n dp.clear();\\n rep(i, to[0][0].size()) rep(j, to[1][0].size()) {\\n const int ix = to[0][0][i], jx = to[1][0][j];\\n dp[of(ix, jx, 0, 0)] = 1;\\n }\\n rep(x, M[0]) rep(y, M[1]) {\\n const int v0 = g[0][x].v, v1 = g[1][y].v;\\n const string &a = g[0][x].w, &b = g[1][y].w;\\n rep(i, a.size()) rep(j, b.size()) if(a[i]==b[j]) {\\n const int cur = of(x, y, i, j);\\n if(dp.count(cur)==0) continue;\\n const int val = dp[cur];\\n if(i<(int)a.size()-1 && j<(int)b.size()-1) {\\n up(dp[of(x, y, i+1, j+1)], val);\\n }\\n else if(i<(int)a.size()-1) {\\n rep(p, to[1][v1].size()) {\\n const int ix = to[1][v1][p];\\n up(dp[of(x, ix, i+1, 0)], val);\\n }\\n }\\n else if(j<(int)b.size()-1) {\\n rep(p, to[0][v0].size()) {\\n const int ix = to[0][v0][p];\\n up(dp[of(ix, y, 0, j+1)], val);\\n }\\n }\\n else {\\n rep(p, to[0][v0].size()) rep(q, to[1][v1].size()) {\\n const int ix = to[0][v0][p];\\n const int jx = to[1][v1][q];\\n up(dp[of(ix, jx, 0, 0)], val);\\n }\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", dp[of(M[0], M[1], 0, 0)]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 2388,\n \"score_of_the_acc\": -0.6542,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2288_281893\",\n \"code_snippet\": \"#include <iostream>\\n#include <cctype>\\n#include <cstdlib>\\n#include <string>\\n#include <memory.h>\\n#include <cmath>\\n#include <vector>\\n#include <algorithm>\\n#include <queue>\\n#include <map>\\nusing namespace std;\\n\\n#define rep(i, n) for(int i = 0; i < n; i++)\\ntypedef long long ll;\\ntypedef pair<int, int> P;\\ntypedef pair<int,P> PP;\\nconst int INF = 1 << 29;\\nconst int mod = 1000000007;\\n\\nstruct edge{\\n int to;\\n string s;\\n edge(){}\\n edge(int to, string s){\\n this->to = to;\\n this->s = s;\\n }\\n};\\n\\nbool ok(const string &s1, const string &s2){\\n int n = s1.size();\\n rep(i, n) if(s1[i] != s2[i]) return false;\\n return true;\\n}\\n\\n\\nmap<string, ll> dp[600][600][2];\\n\\nvector<edge> G[2][600];\\n\\n\\nint main(){\\n int T;\\n cin >> T;\\n int n1, m1, n2, m2;\\n int a, b;\\n string s, nxt;\\n edge e;\\n rep(t, T){\\n cin >> n1 >> m1;\\n rep(i, 600)rep(j, 2) G[j][i].clear();\\n rep(i, 600)rep(j, 600)rep(k, 2) dp[i][j][k].clear(); \\n rep(i, m1){\\n cin >> a >> b >> s;\\n G[0][a].push_back(edge(b, s));\\n }\\n cin >> n2 >> m2;\\n rep(i, m2){\\n cin >> a >> b >> s;\\n G[1][a].push_back(edge(b, s));\\n }\\n dp[0][0][0][\\\"\\\"] = 1;\\n rep(i, n1)rep(j, n2){\\n rep(k, 2){\\n\\tfor(map<string, ll>::iterator iter = dp[i][j][k].begin(); \\n\\t iter != dp[i][j][k].end(); iter++){\\n\\t string s = (*iter).first;\\n\\t ll d = (*iter).second;\\n\\t if(k == 1){\\n\\t rep(v, (int)G[k][j].size()){\\n\\t e = G[k][j][v];\\n\\t if(e.s.size() < s.size() && ok(e.s, s)){\\n\\t\\tnxt = string(s.begin() + e.s.size(), s.end());\\n\\t\\tdp[i][e.to][1][nxt] = (dp[i][e.to][1][nxt] + d) % mod;\\n\\t }\\n\\t if(e.s.size() >= s.size() && ok(s, e.s)){\\n\\t\\tnxt = string(e.s.begin() + s.size(), e.s.end());\\n\\t\\tdp[i][e.to][0][nxt] = (dp[i][e.to][0][nxt] + d) % mod;\\n\\t }\\n\\t }\\n\\t }else{\\n\\t rep(v, (int)G[k][i].size()){ \\n\\t e = G[k][i][v];\\n\\t if(e.s.size() <= s.size() && ok(e.s, s)){\\n\\t\\tnxt = string(s.begin() + e.s.size(), s.end());\\n\\t\\tdp[e.to][j][0][nxt] = (dp[e.to][j][0][nxt] + d) % mod;\\n\\t }\\n\\t if(e.s.size() > s.size() && ok(s, e.s)){\\n\\t\\tnxt = string(e.s.begin() + s.size(), e.s.end());\\n\\t\\tdp[e.to][j][1][nxt] = (dp[e.to][j][1][nxt] + d) % mod;\\n\\t }\\n\\t }\\n\\t }\\n\\t}\\n }\\n }\\n\\n cout << dp[n1-1][n2-1][0][\\\"\\\"] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.4035,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2288_281823\",\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 <string>\\n#include <map>\\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 State {\\n int left;\\n int right;\\n int lr;\\n int cnt;\\n State() {;}\\n State(int left, int right, int lr, int cnt) : left(left), right(right), lr(lr), cnt(cnt) {;}\\n bool operator<(const State &rhs) const {\\n if (left != rhs.left) { return left < rhs.left; }\\n if (right != rhs.right) { return right < rhs.right; }\\n if (lr != rhs.lr) { return lr < rhs.lr; }\\n return cnt < rhs.cnt;\\n }\\n};\\n\\nconst ll MOD = 1000000007;\\nint n[2];\\nint m[2];\\nvector<string> strs[2];\\nvector<vector<int> > from[2];\\nvector<int> to[2];\\nmap<State, ll> memo;\\n\\nll calc(int left, int right, int lr, int cnt);\\nll NextState(int left, int right, int lr, int cnt) {\\n ll ret = 0;\\n if (lr == 0) {\\n FORIT(it, from[1][right]) {\\n ret = (ret + calc(left, *it, lr, cnt)) % MOD;\\n }\\n } else {\\n FORIT(it, from[0][left]) {\\n ret = (ret + calc(*it, right, lr, cnt)) % MOD;\\n }\\n }\\n return ret;\\n}\\n\\nll calc(int left, int right, int lr, int cnt) {\\n if (left == m[0] && right == m[1]) { return 1; }\\n State state(left, right, lr, cnt);\\n if (memo.count(state)) { return memo[state]; }\\n ll ret = 0;\\n const string &lstr = strs[0][left];\\n const string &rstr = strs[1][right];\\n if (lr == 0 && (int)lstr.size() == cnt) {\\n ret = NextState(to[0][left], right, 1, 0);\\n } else if (lr == 1 && (int)rstr.size() == cnt) {\\n ret = NextState(left, to[1][right], 0, 0);\\n } else {\\n int lindex = 0;\\n int rindex = 0;\\n if (lr == 0) { lindex = cnt; }\\n else { rindex = cnt; }\\n while (lindex < (int)lstr.size() && rindex < (int)rstr.size()) {\\n if (lstr[lindex] != rstr[rindex]) { goto end; }\\n lindex++;\\n rindex++;\\n }\\n if (lindex == (int)lstr.size()) {\\n ret = NextState(to[0][left], right, 1, rindex);\\n } else {\\n ret = NextState(left, to[1][right], 0, lindex);\\n }\\n }\\nend:\\n return memo[state] = ret;\\n}\\n\\nchar str[100];\\nint main() {\\n int test;\\n scanf(\\\"%d\\\", &test);\\n while (test--) {\\n memo.clear();\\n REP(iter, 2) {\\n scanf(\\\"%d %d\\\", &n[iter], &m[iter]);\\n from[iter].clear();\\n strs[iter].resize(m[iter] + 1);\\n from[iter].resize(n[iter]);\\n to[iter].resize(m[iter]);\\n REP(i, m[iter]) {\\n int f, t;\\n scanf(\\\"%d %d %s\\\", &f, &t, str);\\n from[iter][f].push_back(i);\\n to[iter][i] = t;\\n strs[iter][i] = str;\\n }\\n from[iter][n[iter] - 1].push_back(m[iter]);\\n strs[iter][m[iter]] = \\\"!\\\";\\n }\\n ll ans = 0;\\n FORIT(lit, from[0][0]) {\\n ans = (ans + NextState(*lit, 0, 0, 0)) % MOD;\\n }\\n printf(\\\"%lld\\\\n\\\", ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 2576,\n \"score_of_the_acc\": -0.1823,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":1272,"cells":{"group_id":{"kind":"string","value":"aoj_2286_cpp"},"problem_description":{"kind":"string","value":"Problem F: Farey Sequence\nslipは数字を眺めるのが好きである。\nファイルをダウンロードしているときの、残り時間を眺めているだけで、時間を潰せるほどである。\nそんなslipが友人から面白い数列を教えられた。\nその数列の定義は以下のとおりである。\n一般項を\nF\nn\nと表わす。\nF\nn\nとは、\nn\n以下の分母を持つ0以上1以下のすべての約分された分数(既約分数)を小さな順から並べたものである。\nただし、整数0、1はそれぞれ分数0/1、1/1として扱われる。\nつまり\nF\n3\nは、\nF\n3\n= (0/1, 1/3, 1/2, 2/3, 1/1)\nのように表される。\nF\n5\nであれば\nF\n5\n= (0/1, 1/5, 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5, 1/1)\nと表される。\nslipはこの数列にすぐにのめり込んだ。\nしかしこの数列を眺めていても、なかなか特徴がつかめなかった。\n特徴をつかむためにまずは各項の項数がいくつあるのか調べようと思ったが、\n増え方の規則がわからず、自力で理解することを断念した。\nそこで、\n勝手に友人と思っているあなたに、指定した項にどれだけの項数があるのかを聞くことにした。\nあなたの仕事は、与えられた項における項数を求めることである。\nInput\n入力は以下の形式で与えられる。\nt\nn\n1\n...\nn\ni\n...\nn\nt\nt\n(\n1 ≤ t ≤ 10000\n)はテストケースの数である。\nn\ni\n(\n1 ≤ n\ni\n≤ 1000000\n)は与えられた項の番号である。\nOutput\n各テストケースごとに、項数を1行に表示せよ。\nSample Input\n2\n3\n5\nOutput for Sample Input\n5\n11"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2286_11042230","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\nusing vvvll = vector<vector<vector<ll>>>;\nusing vd = vector<double>;\nusing vvd = vector<vector<double>>;\nusing vstr = vector<string>;\nusing vchar = vector<char>;\nusing vvchar = vector<vector<char>>;\nusing vb = vector<bool>;\nusing vvb = vector<vector<bool>>;\nusing vvvb = vector<vector<vector<bool>>>;\nusing pii = pair<int,int>;\nusing pll = pair<long long, long long>;\nusing Graph = vector<vector<int>>;\nusing WeightedGraph = vector<vector<pair<int,ll>>>;\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#define rep(i, a, b) for(ll i = (ll)a; i < (ll)b; i++)\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 RREP(i, a, b) for(ll i = (ll)b; i >= (ll)a; i--)\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define YESNO(flag) cout << (flag ? \"Yes\" : \"No\") << \"\\n\"\n#define spa \" \"\n#define mint modint\n\nconst int inf = 1070000000;\nconst long long INF = 4500000000000000000;\n//const long long MOD = 998244353;\nconst long long MOD = 1000000007;\nconst double pi = 3.141592653589793238;\nconst double eps = (1e-10);\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\n\ntemplate<typename T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<typename T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<typename S, typename T> pair<S, T> operator+(pair<S, T> a, pair<S, T> b) {\n pair<S, T> ans;\n ans.first = a.first + b.first;\n ans.second = a.second + b.second;\n return ans;\n} \n\n//拡張ユークリッド\nll ext_gcd(ll a, ll b, ll &x, ll &y) {\n if(b == 0) {\n x = 1, y = 0;\n return a;\n }\n\n ll q = a/b;\n ll g = ext_gcd(b, a-q*b, x, y);\n ll z = x-q*y;\n x = y, y = z;\n return g;\n}\n//mod mにおけるaの逆元. aとmは互いに素.\nll inverse(ll a, ll m) {\n ll x, y;\n ext_gcd(a, m, x, y);\n x = (x+m) % m;\n return x;\n}\n//modint\ntemplate<std::uint_fast64_t mod> struct modint {\n using u64 = std::uint_fast64_t;\n u64 val;\n\n modint(u64 v = 0) : val(v % mod) {}\n\n bool operator==(modint other) {\n return val == other.val;\n }\n modint operator+(modint other) {\n modint<mod> ans;\n ans.val = val + other.val;\n if(ans.val >= mod) ans.val -= mod;\n return ans;\n }\n modint operator-(modint other) {\n modint<mod> ans;\n if(val < other.val) val += mod;\n ans.val = val - other.val;\n return ans;\n }\n modint operator*(modint other) {\n modint<mod> ans;\n ans.val = (val * other.val) % mod;\n return ans;\n }\n modint operator/(modint other) {\n modint<mod> ans;\n ans.val = (val * inverse(other.val, mod)) % mod;\n return ans;\n }\n modint &operator+=(modint other) {\n *this = *this + other;\n return *this;\n }\n modint &operator-=(modint other) {\n *this = *this - other;\n return *this;\n }\n modint &operator*=(modint other) {\n *this = *this * other;\n return *this;\n }\n modint &operator/=(modint other) {\n *this = *this / other;\n return *this;\n }\n modint &operator++() {\n *this += 1;\n return *this;\n }\n modint &operator++(int) {\n ++(*this);\n return *this;\n }\n modint &operator--() {\n *this -= 1;\n return *this;\n }\n modint &operator--(int) {\n --(*this);\n return *this;\n }\n};\n//modintの入出力\ntemplate<std::uint_fast64_t mod> std::ostream& operator<<(std::ostream &os, const modint<mod> &x) {\n // modint の 'val' メンバを出力ストリーム(os)に渡す\n os << x.val;\n return os; // ストリームを返す (チェーンのため)\n}\ntemplate<std::uint_fast64_t mod> std::istream& operator>>(std::istream& is, modint<mod> &x) {\n // modintが内部で使っているu64型を取得\n using u64 = typename modint<mod>::u64; \n \n u64 input_value;\n is >> input_value; // (1) istream(cin) から一時変数に値を読み込む\n \n // (2) 読み込んだ値を使って modint を再構築する\n // modintのコンストラクタが (input_value % mod) を処理してくれる\n x = modint<mod>(input_value); \n \n return is; // (3) ストリームを返す (チェーンのため)\n}\n//累乗, x^n\ntemplate<typename T> T pow(T x, int n) {\n T ans = 1;\n while(n > 0) {\n if(n & 1) ans *= x;\n x *= x;\n n >>= 1; \n }\n return ans;\n}\n//階乗, n!\ntemplate<typename T> T fact(T n) {\n if(n == 0) return 1;\n return n * fact(n-1);\n}\n//nPk\ntemplate<typename T> T perm(T n, T k) {\n if(k == 0) return 1;\n return n * perm(n-1, k-1);\n}\n//nCk\ntemplate<typename T> T comb(T n, T k) {\n if(k > n) return 0;\n return perm(n, min(k, n-k))/fact(min(k, n-k));\n}\n//ord(n)\nll ord(ll n, ll p) {\n int ans = 0;\n while(n % p == 0) {\n n /= p;\n ans++;\n }\n return ans;\n}\n//ルジャンドルの公式ord(n!)\nll factord(ll n, ll p) {\n ll ans = 0;\n ll q = p, tmp = n;\n while(tmp > 0) {\n tmp = n/q;\n ans += tmp;\n q *= p;\n }\n return ans;\n}\n//素因数分解, O(√N)\nvector<pair<ll,ll>> factorize(ll N) {\n vector<pair<ll,ll>> ans;\n for(ll p = 2; p*p <= N; p++) {\n int ex = 0;\n while(N % p == 0) {\n N /= p;\n ex++;\n }\n if(ex != 0) ans.push_back({p,ex});\n }\n if(N != 1) ans.push_back({N,1});\n return ans;\n}\n//素数判定\nbool isprime(long long x) {\n if(x == 1) return false;\n \n for(long long i = 2; i*i <= x; i++) {\n if(x % i == 0) return false;\n }\n return true;\n}\n//エラトステネスの篩\nstruct Eratosthenes {\n vector<bool> prime;\n vector<int> minfactor;\n vector<int> mobius;\n vector<ll> euler;\n\n //コンストラクタ O(NloglogN)\n Eratosthenes(int N) : prime(N+1, true),\n minfactor(N+1, -1),\n mobius(N+1, 1),\n euler(N+1, 1) {\n prime[0] = false;\n prime[1] = false;\n minfactor[1] = 1;\n REP(i,1,N) euler[i] = i;\n\n for(int p = 2; p <= N; p++) {\n if(!prime[p]) continue;\n\n minfactor[p] = p;\n mobius[p] = -1;\n euler[p] = p-1;\n\n for(int q = 2; p*q <= N; q++) {\n prime[p*q] = false;\n if(minfactor[p*q] == -1) minfactor[p*q] = p;\n if(q % p == 0) mobius[p*q] = 0;\n else mobius[p*q] *= -1;\n euler[p*q] = euler[p*q]*(p-1)/p;\n }\n }\n }\n\n //素因数分解 O(logn)\n vector<pair<int,int>> factorize(int n) {\n vector<pair<int,int>> ans;\n while(n > 1) {\n int p = minfactor[n], exp = 0;\n while(n % p == 0) {\n n /= p;\n exp++;\n }\n ans.push_back({p, exp});\n }\n return ans;\n }\n //約数列挙 O(σ(n))\n vector<int> divisors(int n) {\n vector<int> ans = {1};\n while(n > 1) {\n int p = minfactor[n], d = 1, s = ans.size();\n while(n % p == 0) {\n d *= p;\n for(int i = 0; i < s; i++) {\n ans.push_back(ans[i]*d);\n }\n n /= p;\n }\n }\n return ans;\n }\n};\n//高速ゼータ変換\ntemplate<typename T> void fast_zeta(vector<T> &f) {\n int N = f.size();\n Eratosthenes sieve(N);\n for(int p = 2; p < N; p++) {\n if(!sieve.prime[p]) continue;\n \n for(int k = N/p; k >= 1; k--) {\n f[k] += f[k*p];\n }\n }\n}\n//高速メビウス変換\ntemplate<typename T> void fast_mobius(vector<T> &F) {\n int N = F.size();\n Eratosthenes sieve(N);\n for(int p = 2; p < N; p++) {\n if(!sieve.prime[p]) continue;\n\n for(int k = 1; k*p < N; k++) {\n F[k] -= F[k*p];\n }\n }\n}\n//添字GCD畳み込み\ntemplate<typename T> vector<T> gcd_conv(vector<T> &f, vector<T> &g) {\n int N = max(f.size(), g.size());\n vector<T> F(N, 0), G(N, 0), H(N);\n for(int i = 0; i < f.size(); i++) F[i] = f[i];\n for(int i = 0; i < g.size(); i++) G[i] = g[i];\n fast_zeta(F);\n fast_zeta(G);\n \n for(int i = 0; i < N; i++) H[i] = F[i]*G[i];\n fast_mobius(H);\n \n return H;\n}\n\n//行列積\nvvll matrix_product(vvll A, vvll B) {\n int H = A.size(), W = A[0].size(), S = B.size(), T = B[0].size();\n if(W != S) {\n cout << \"matrix_size_error\" << \"\\n\";\n return vvll(0);\n }\n\n vvll C(H, vll(T, 0));\n rep(i,0,H) rep(j,0,T) {\n rep(k,0,W) {\n C[i][j] += A[i][k]*B[k][j];\n //C[i][j] %= M;\n }\n }\n return C;\n}\nvvll matrix_pow(vvll A, ll n) {\n int N = A.size();\n vvll ans(N, vll(N, 0));\n rep(i,0,N) ans[i][i] = 1;\n \n while(n > 0) {\n if(n & 1) ans = matrix_product(ans, A);\n A = matrix_product(A, A);\n n >>= 1; \n }\n return ans;\n}\n\n//1+2+...+n = n(n+1)/2\nll tri(ll n) {\n ll x = n*(n+1);\n return x/2;\n}\n\n//座標圧縮\nvector<int> compress(vector<int> A) {\n vector<int> B = A;\n\n sort(B.begin(), B.end());\n B.erase(unique(B.begin(), B.end()), B.end());\n\n vector<int> res(A.size());\n for(int i = 0; i < (int)A.size(); i++) {\n res[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();\n }\n return res;\n}\n\n//正方形グリッドの右回転, 左回転\nvoid rotate_right(vector<vector<char>> &S) {\n int N = S.size();\n auto T = S;\n rep(i,0,N) rep(j,0,N) {\n T[i][j] = S[N-1-j][i];\n }\n S = T;\n}\nvoid rotate_left(vector<vector<char>> &S) {\n int N = S.size();\n auto T = S;\n rep(i,0,N) rep(j,0,N) {\n T[i][j] = S[j][N-1-i];\n }\n S = T;\n}\n\n//2点(a,b)と(x,y)の距離\nlong double dist(pair<long double, long double> a, pair<long double, long double> b) {\n return sqrt((a.first-b.first)*(a.first-b.first) + (a.second-b.second)*(a.second-b.second));\n}\nlong double man(pair<long double, long double> a, pair<long double, long double> b) {\n return abs(a.first-b.first) + abs(a.second-b.second);\n}\n//内分点\npair<long double, long double> internal_division(pair<long double, long double> a, pair<long double, long double> b, long double p) {\n long double x = a.first + (b.first - a.first) * p;\n long double y = a.second + (b.second - a.second) * p;\n return {x, y};\n}\n\n//桁数\nint digit(ll N) {\n if(N <= 9) return 1;\n\n return 1 + digit(N / 10);\n}\n//A進数文字列NをB進数に変換. A,Bは10以下\nstring base_change(string N, ll A, ll B) {\n ll X = stoll(N), Y = 0;\n\n ll i = 1;\n while(X != 0) {\n Y += (X % 10) * i;\n i *= A;\n X /= 10;\n }\n\n X = Y, Y = 0;\n i = 1;\n while(X != 0) {\n Y += (X % B) * i;\n i *= 10;\n X /= B;\n }\n\n return to_string(Y);\n}\n//回文判定\nbool palin(string S) {\n rep(i,0,S.size()) {\n if(S[i] != S[S.size()-1-i]) return false;\n }\n return true;\n}\n\n//hh:mm:ss to second\nint convert_to_time(string S) {\n ll h = 10*(S[0]-'0') + (S[1]-'0');\n ll m = 10*(S[3]-'0') + (S[4]-'0');\n ll s = 10*(S[6]-'0') + (S[7]-'0');\n \n return h*3600+m*60+s;\n}\n\n//DFS\nvoid dfs(const Graph &G, int v, vector<bool> &seen) { \n seen[v] = true;\n \n for (auto next_v : G[v]) { \n if (!seen[next_v]) {\n dfs(G, next_v, seen);\n }\n }\n}\nvoid griddfs(const vector<vector<char>> &G, int x, int y, vector<vector<bool>> &seen) {\n int H = G.size(), W = G[0].size();\n seen[x][y] = true;\n \n for (int i = 0; i < 8; i++) { \n int nx = x + dx[i], ny = y + dy[i];\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\n if (!seen[nx][ny] and G[nx][ny] != '#') griddfs(G, nx, ny, seen);\n }\n}\n//BFS\nvoid bfs(const Graph &G, int v, vector<int> &dist) {\n rep(i,0,dist.size()) dist[i] = inf;\n dist[v] = 0;\n queue<int> q;\n q.push(v);\n while(!q.empty()) {\n int u = q.front();\n q.pop();\n for(auto next_u : G[u]) {\n if(dist[next_u] == inf) {\n dist[next_u] = dist[u] + 1;\n q.push(next_u);\n }\n }\n }\n}\nvoid gridbfs(const vector<vector<char>> &G, int x, int y, vector<vector<int>> &dist) {\n int H = G.size(), W = G[0].size();\n dist[x][y] = 0;\n queue<pair<int, int>> q;\n q.push(make_pair(x, y));\n while(!q.empty()) {\n int x = q.front().first, y = q.front().second;\n q.pop();\n for(int i = 0; i < 4; i++) {\n int nx = x + dx[i], ny = y + dy[i];\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\n if(dist[nx][ny] == inf and G[nx][ny] != '#') {\n dist[nx][ny] = dist[x][y] + 1;\n q.push(make_pair(nx, ny));\n }\n }\n }\n}\n//ワーシャル・フロイド\nvector<vector<ll>> floyd(vector<vector<ll>> G) {\n int N = G.size();\n auto dp = G;\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(dp[i][j] > dp[i][k] + dp[k][j] and dp[i][k] != INF and dp[k][j] != INF) {\n dp[i][j] = dp[i][k] + dp[k][j];\n }\n }\n }\n }\n return dp;\n}\n//サイクルがあるか判定\nbool cycle(const Graph &G, int v, vector<bool> &seen, vector<bool> &finished) {\n seen[v] = true; // 行きがけ時に true になる\n for (auto v2 : G[v]) {\n //if (v2 が逆戻りの場合) continue; // 無向グラフの場合は必要\n\n // 頂点 v2 がすでに探索済みの場合はスキップ \n if (finished[v2]) continue;\n\n // サイクル検出\n if (seen[v2] && !finished[v2]) return true;\n\n // 頂点 v2 を再帰的に探索\n if (cycle(G, v2, seen, finished)) return true;\n }\n finished[v] = true; // 帰りがけ時に true になる\n return false;\n}\n\n//Union-Find\nstruct UnionFind {\n vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2\n \n UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化\n for(int i = 0; i < N; i++) par[i] = i;\n }\n \n int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}\n if (par[x] == x) return x;\n return par[x] = root(par[x]);\n }\n \n void unite(int x, int y) { // xとyの木を併合\n int rx = root(x); //xの根をrx\n int ry = root(y); //yの根をry\n if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま\n par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける\n }\n \n bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す\n int rx = root(x);\n int ry = root(y);\n return rx == ry;\n }\n};\n\nvoid solve() {\n}\n\nint main() {\n int t; cin >> t;\n Eratosthenes sieve(1000000);\n vll phi(1000001, 1);\n REP(i,1,1000000) {\n phi[i] = phi[i-1]+sieve.euler[i];\n }\n while(t--) {\n int n; cin >> n;\n cout << phi[n] << \"\\n\";\n }\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":26504,"score_of_the_acc":-0.2487,"final_rank":15},{"submission_id":"aoj_2286_11015246","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 = 1000010;\nconst int MAX_ARRAYK = 100000;\ndouble PI = 3.14159265358979323846;\nconst int INF = 2147483647;\n//using ll = long long;\n\n// Farey Sequence\n// AOJ 2286\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2286\n// https://ncastar.hatenablog.com/entry/20140320/1395323746\n// https://qiita.com/hidekikangeki/items/e2524f199ae1d483f060\n// 包除原理、オイラーのφ関数\n// https://nanikaka.hatenadiary.org/entry/20111224/1324690802\n\nlong long euler[MAX_N];\nlong long answer[MAX_N];\nvoid euler_phi2() {\n\tfor (long long i = 0; i < MAX_N; i++) {\n\t\teuler[i] = i;\n\t}\n\tfor (long long i = 2; i < MAX_N; i++) {\n\t\tif (euler[i] == i) {\n\t\t\tfor (long long j = i; j < MAX_N; j += i) {\n\t\t\t\teuler[j] = euler[j] / i * (i - 1);\n\t\t\t}\n\t\t}\n\t}\n}\n\n\nint main() {\n\n\t\n\t// Farey Sequence\n\teuler_phi2();\n\tanswer[1] = 2;\n\tfor (long long i = 2; i < MAX_N; i++) {\n\t\tanswer[i] = answer[i - 1] + euler[i];\n\t}\n\tint T, M;\n\tcin >> T;\n\tfor (int t = 0; t < T; t++) {\n\t\tcin >> M;\n\t\tcout << answer[M] << endl;\n\t}\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":260,"memory_kb":81456,"score_of_the_acc":-1.1479,"final_rank":19},{"submission_id":"aoj_2286_10881475","code_snippet":"// #pragma GCC target(\"avx2\")\n// #pragma GCC optimize(\"O3\")\n// #pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\nusing ld=long double;\nusing pl=pair<ll,ll>;\nusing vpl=vector<pl>;\nusing vl=vector<ll>;\nusing vvl=vector<vl>;\n\n#define rep(i,n) for(long long i=0LL;i<n;i++)\n#define rrep(i,a,b) for(long long i=a;i>=b;i--)\n#define FOR(i,k,n) for(long long i=k;i<n;i++)\n#define ALL(v) v.begin(),v.end()\ntemplate<typename T>ostream&operator<<(ostream& os,vector<T>&v){for(int i = 0;i < int(size(v));i++)os << v[i] << (i+1==int(size(v))?\"\":\" \");return os;}\ntemplate<typename T>istream&operator>>(istream& is,vector<T>&v){for(auto &in : v)is >> in;return is;}\nll INF = (1LL << 60) - 6846976;\n/* INF = (1LL << 60) - 6846976*/\n\n\n// #include<atcoder/all> \n// using namespace atcoder;\n// using mint = modint998244353;ll mod = 998244353;\n// // using mint = modint1000000007;ll mod = 1000000007;\n// //using mint = modint;\n// using vm = vector<mint>;\n// using vvm = vector<vm>;\n// ostream&operator<<(ostream& os,vector<mint>&v){for(int i = 0;i < int(size(v));i++)os << v[i].val() << (i+1==int(size(v))?\"\":\" \");return os;}\n\n#define LB(A,x) int(lower_bound(ALL(A),x)-A.begin())\n\n\n// vl dx = {1,0,-1,0}, dy = {0,1,0,-1};\n// vl dx = {1,1,1,0,-1,-1,-1,0},dy={-1,0,1,1,-1,0,1,-1};\n//----------------------------------------------\n\nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(15);\n//==============================================\n ll T;\n cin>>T;\n ll MAX_N=1000009;\n vector<ll> phi(MAX_N);\n iota(ALL(phi),0LL);\n vector<bool> is_prime(MAX_N,1);\n for(int p=2;p<MAX_N;p++) if(is_prime[p]){\n phi[p]/=p;\n phi[p]*=p-1;\n for(int nx=2*p;nx<=MAX_N;nx+=p){\n is_prime[nx]=0;\n phi[nx]/=p;\n phi[nx]*=p-1;\n }\n }\n\n rep(i,MAX_N-1) phi[i+1]+=phi[i];\n\n while(T--){\n ll N; cin>>N;\n cout << phi[N]+1<<endl;\n\n }\n\n}","accuracy":1,"time_ms":20,"memory_kb":11128,"score_of_the_acc":-0.0142,"final_rank":1},{"submission_id":"aoj_2286_9605472","code_snippet":"#include <iostream>\n#include <cstdint>\n#include <vector>\n\nusing namespace std;\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\tuint16_t t, i;\n\tuint32_t n[10000];\n\tcin >> t;\n\tfor (i = 0; i != t; ++i) cin >> n[i];\n\n\tvector<uint64_t> ans(1'000'001), ex(1'000'001, 1);\n\tans[0] = 0, ans[1] = 2;\n\tfor (uint32_t i = 2; i <= 1'000'000; ++i)\n\t{\n\t\tans[i] = ans[i - 1] + (i - ex[i]);\n\t\tfor (uint32_t j = i * 2; j <= 1'000'000; j += i)\n\t\t\tex[j] += i - ex[i];\n\t}\n\n\tfor (i = 0; i != t; ++i)\n\t\tcout << ans[n[i]] << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":18660,"score_of_the_acc":-0.1145,"final_rank":3},{"submission_id":"aoj_2286_9415424","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=int64_t;\n\n// エラトステネスの篩\nvector<bool> Erame(vector<vector<int>> &prs,int N) {\n vector<bool> isprime(N+1, true);\n prs.resize(N+1);\n isprime[1] = false;\n for (int p = 2; p <= N; ++p) {\n if (!isprime[p]) continue;\n prs[p].push_back(p);\n for (int q = p * 2; q <= N; q += p) {\n isprime[q] = false;\n prs[q].push_back(p);\n }\n }\n return isprime;\n}\n\n\n\nint main() {\n \n int m=1000000;\n vector<vector<int>> prs;\n vector<bool> pr=Erame(prs,m);\n \n //オイラー数追加\n vector<ll> sphi(m+1);\n sphi[1]=2;\n for(int i=2;i<=m;i++){\n int phi=i;\n for(int j=0;j<(int)prs[i].size();j++){\n phi=phi/prs[i][j]*(prs[i][j]-1);\n }\n sphi[i]=sphi[i-1]+phi;\n }\n //cout << sphi[1000000] << endl;\n\n int t,n;\n cin >> t;\n for(int k=0;k<t;k++){\n cin >> n;\n cout << sphi[n] << endl; \n }\n\n}","accuracy":1,"time_ms":180,"memory_kb":66060,"score_of_the_acc":-0.8835,"final_rank":18},{"submission_id":"aoj_2286_9046612","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\nconst int N = 1000005;\nbool not_prime[N];\nll phi[N];\n\nvoid make_phi() {\n not_prime[0] = not_prime[1] = true;\n for (int i = 1; i < N; ++i) {\n phi[i] = i;\n }\n for (int i = 2; i < N; ++i) {\n if (!not_prime[i]) {\n phi[i] = i - 1;\n for (int j = i + i; j < N; j += i) {\n not_prime[j] = true;\n phi[j] -= phi[j] / i;\n }\n }\n }\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n make_phi();\n for (int i = 1; i < N; ++i) {\n phi[i] += phi[i - 1];\n }\n int q;\n cin >> q;\n while (q--) {\n int n;\n cin >> n;\n cout << phi[n]+1 << \"\\n\";\n }\n}","accuracy":1,"time_ms":20,"memory_kb":12084,"score_of_the_acc":-0.0276,"final_rank":2},{"submission_id":"aoj_2286_8574655","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#if USE_MP\n#include <boost/multiprecision/cpp_int.hpp>\n#endif\n#include <cassert>\n#include <cstdio>\n#include <iostream>\n#include <iomanip>\n#include <string>\n#include <array>\n#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <unordered_set>\n#include <unordered_map>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <algorithm>\n#include <cmath>\n#include <tuple>\n#include <bitset>\n#include <string.h>\n#include <numeric>\n#include <random>\n#if defined _DEBUG\n//#include \"TestCase.h\"\n//#include \"Util.h\"\n#endif\n\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef tuple<ll, ll, ll> tlll;\ntypedef tuple<int, int, int> tiii;\n\nusing ai2 = array<int, 2>;\nusing ai3 = array<int, 3>;\nusing ai4 = array<int, 4>;\nusing al2 = array<ll, 2>;\nusing al3 = array<ll, 3>;\nusing al4 = array<ll, 4>;\nusing ad2 = array<double, 2>;\nusing ad3 = array<double, 3>;\nusing ad4 = array<double, 4>;\n\ninline void Yes(bool upper = false) { cout << (upper ? \"YES\" : \"Yes\") << \"\\n\"; }\ninline void No(bool upper = false) { cout << (upper ? \"NO\" : \"No\") << \"\\n\"; }\n\ninline ll DivCeil(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -(-nume / deno);\n\telse return (nume + deno - 1) / deno;\n}\ninline ll DivFloor(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -((-nume + deno - 1) / deno);\n\telse return nume / deno;\n}\ninline ll DivRound(ll nume, ll deno)\n{\n\tassert(deno != 0);\n\tif (deno < 0) { nume = -nume; deno = -deno; }\n\tif (nume < 0) return -((-nume + deno / 2) / deno);\n\telse return (nume + deno / 2) / deno;\n}\n\ntemplate <typename T, int S>\nauto MakeVecImpl(queue<int>& size, const T& ini)\n{\n\tif constexpr (S == 1)\n\t{\n\t\treturn vector<T>(size.front(), ini);\n\t}\n\telse\n\t{\n\t\tint fsize = size.front();\n\t\tsize.pop();\n\t\treturn vector(fsize, MakeVecImpl<T, S - 1>(size, ini));\n\t}\n}\n\ntemplate <typename T, int S>\nauto MakeVec(const array<int, S>& size, const T ini = T())\n{\n\tqueue<int> qsize;\n\tfor (const auto v : size) qsize.push(v);\n\treturn MakeVecImpl<T, S>(qsize, ini);\n}\nint d4[][2] =\n{\n\t{0,-1},\n\t{0,1},\n\t{-1,0},\n\t{1,0},\n};\nint d8[][2] =\n{\n\t{-1,-1},\n\t{0,-1},\n\t{1,-1},\n\n\t{-1,0},\n\t{1,0},\n\n\t{-1,1},\n\t{0,1},\n\t{1,1},\n};\nvector<array<int, 2>> Neighbor4(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\tret.push_back({ y - 1, x });\n\tret.push_back({ y + 1, x });\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor6(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tconst int ofs = (y & 1); // 1 - (y & 1); //\n\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\n\tret.push_back({ y - 1, x - 1 + ofs });\n\tret.push_back({ y - 1, x + ofs });\n\n\tret.push_back({ y + 1, x - 1 + ofs });\n\tret.push_back({ y + 1, x + ofs });\n\n\treturn ret;\n}\nvector<array<int, 2>> Neighbor8(int y, int x)\n{\n\tvector<array<int, 2>> ret;\n\tret.push_back({ y - 1, x - 1 });\n\tret.push_back({ y - 1, x });\n\tret.push_back({ y - 1, x + 1 });\n\n\tret.push_back({ y, x - 1 });\n\tret.push_back({ y, x + 1 });\n\n\tret.push_back({ y + 1, x - 1 });\n\tret.push_back({ y + 1, x });\n\tret.push_back({ y + 1, x + 1 });\n\treturn ret;\n}\n\nvector<int> DecompDigit(ull val)\n{\n\tif (val == 0)\n\t\treturn { 0 };\n\n\tvector<int> ret;\n\twhile (val)\n\t{\n\t\tret.emplace_back(val % 10);\n\t\tval /= 10;\n\t}\n\treverse(ret.begin(), ret.end());\n\treturn ret;\n}\n\n\n#define PI 3.14159265358979l\nlong double R2D = 180 / PI;\nlong double D2R = PI / 180;\n\nstatic const ll Mod = 1000000007;\nstatic const ll Mod9 = 998244353;// 1000000007;\nstatic const ll INF64 = 4500000000000000000;// 10000000000000000;\nstatic const int INF32 = 2000000000;\n\nrandom_device rd;\nmt19937 mt(0);//(rd());\n#if USE_MP\nusing mpint = boost::multiprecision::cpp_int;\n#endif\n\nconst double EPS = 1e-10;\n\nvector<bool> isPrime;\t\t// 素数\nvector<int> prime;\t\t\t// 素数\nvector<int> minPF;\t\t\t// 約数である最小の素数\nvector<int> phi;\t\t\t// オイラーのφ関数\nvector<int> mobius;\t\t\t// メビウス関数\nvector<ll> phiSum{ 0 };\nvoid Eratosthenes(int SIZE=1e6)\n{\n\tisPrime.resize(SIZE, true);\n\tminPF.resize(SIZE); iota(minPF.begin(), minPF.end(), 0);\n\tphi.resize(SIZE); iota(phi.begin(), phi.end(), 0);\n\tmobius.resize(SIZE, 1);\n\n\tisPrime[0] = isPrime[1] = false;\n\n\t// 素因数\n\tfor (int i = 2; i < SIZE; i++) {\n\t\tif (!isPrime[i]) continue;\n\t\tprime.emplace_back(i);\n\t\tfor (int j = i + i; j < SIZE; j += i) {\n\t\t\tisPrime[j] = false;\n\t\t\tminPF[j] = min(minPF[j], i);\n\t\t}\n\t}\n\n\t// φ関数\n\tfor (int i = 1; i < SIZE; i++) {\n\t\tfor (int j = i + i; j < SIZE; j += i) {\n\t\t\tphi[j] -= phi[i];\n\t\t}\n\t\tphiSum.emplace_back(phiSum.back() + phi[i]);\n\t}\n\n\t// メビウス関数\n\tfor (int i = 2; i < SIZE; i++) {\n\t\tif (!isPrime[i]) continue;\n\t\tmobius[i] = -1;\n\t\tfor (int j = i + i; j < SIZE; j += i) {\n\t\t\tif ((j / i) % i == 0) mobius[j] = 0;\n\t\t\telse mobius[j] = -mobius[j];\n\t\t}\n\t}\n}\n\n// 高速ゼータ変換\nvoid FastZeta(vector<ll>& X) {\n\tint N = X.size();\n\tif (isPrime.size() < N)\n\t\tEratosthenes(N);\n\n\tfor (auto p : prime) {\n\t\tif (p >= N) break;\n\n\t\tfor (int i = (N - 1) / p; i >= 1; i--) {\n\t\t\tX[i] += X[i*p];\n\t\t}\n\t}\n}\n\n// 高速メビウス変換\nvoid FastMobius(vector<ll>& X) {\n\tint N = X.size();\n\tif (isPrime.size() < N)\n\t\tEratosthenes(N);\n\t\n\tfor (auto p : prime) {\n\t\tif (p >= N) break;\n\n\t\tfor (int i = 1; i * p <= N - 1; i++) {\n\t\t\tX[i] -= X[i * p];\n\t\t}\n\t}\n}\n\nint EulerPhi(int N) {\n\tint phi = N;\n\tfor (int i = 2; i * i <= N; i++) {\n\t\tif (N % i) continue;\n\t\tphi = phi / i * (i - 1);\n\t\twhile ((N % i) == 0) N /= i;\n\t}\n\tif (N > 1)\n\t\tphi = phi / N * (N - 1);\n\treturn phi;\n}\nstruct Solver\n{\n\tvoid Run()\n\t{\n\t\tint N;\n\t\tcin >> N;\n\t\tcout << 1+phiSum[N] << \"\\n\";\n\t}\n};\n\nint main()\n{\n\tstd::cin.tie(nullptr); //★インタラクティブ注意★\n\tstd::ios_base::sync_with_stdio(false);\n\tint T = 1;\n\tEratosthenes(1000010);\n\n\tcin >> T;\n\twhile (T--)\n\t{\n\t\tSolver S;\n\t\tS.Run();\n\t}\n\n\treturn 0;\n}\n\n/// 値渡しになっていないか?\n/// 入力を全部読んでいるか? 途中でreturnしない\n/// 32bitで収まるか? 10^5数えるとき\n/// modは正しいか?\n/// multisetでcountしていないか?","accuracy":1,"time_ms":30,"memory_kb":23736,"score_of_the_acc":-0.1979,"final_rank":13},{"submission_id":"aoj_2286_7850625","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing pl = pair<ll,ll>;\nusing vp = vector<pl>;\n#define rep(i,n) for(ll i=0;i<(ll)(n);++i)\n#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)\n#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)\ntemplate<typename T>inline bool chmax(T &a,T b){return a<b?a=b,true:false;}\ntemplate<typename T>inline bool chmin(T &a,T b){return a>b?a=b,true:false;}\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define be(v) (v).begin(),(v).end()\nconst long long INF = 1e18;\n#ifdef DEBUG\n#include <debug.hpp>\n#endif\n\n\n// エラトステネスの篩\nstruct Eratosthenes {\n\tvector<bool> isprime;\n\tvector<ll> minfactor;\n\tEratosthenes(ll N) : isprime(N+1, true),\n\t\t\t\t\t\t\tminfactor(N+1, -1) {\n\t\tisprime[1] = false;\n\t\tminfactor[1] = 1;\n\t\tfor (ll p = 2; p <= N; ++p) {\n\t\t\tif (!isprime[p]) continue;\n\t\t\tminfactor[p] = p;\n\t\t\tfor (ll q = p * 2; q <= N; q += p) {\n\t\t\t\tisprime[q] = false;\n\t\t\t\tif (minfactor[q] == -1) minfactor[q] = p;\n\t\t\t}\n\t\t}\n\t}\n\tvector<pair<ll,ll>> factorize(ll n) {\n\t\tvector<pair<ll,ll>> res;\n\t\twhile (n > 1) {\n\t\t\tll p = minfactor[n];\n\t\t\tll exp = 0;\n\t\t\twhile (minfactor[n] == p) {\n\t\t\t\tn /= p;\n\t\t\t\t++exp;\n\t\t\t}\n\t\t\tres.emplace_back(p, exp);\n\t\t}\n\t\treturn res;\n\t}\n\t// 高速約数列挙\n\tvector<ll> divisors(ll n) {\n\t\tvector<ll> res({1});\n\t\tauto pf = factorize(n);\n\t\tfor (auto p : pf) {\n\t\t\tll s = (ll)res.size();\n\t\t\tfor (ll i = 0; i < s; ++i) {\n\t\t\t\tll v = 1;\n\t\t\t\tfor (ll j = 0; j < p.second; ++j) {\n\t\t\t\t\tv *= p.first;\n\t\t\t\t\tres.push_back(res[i] * v);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\nll solve(){\n\t#ifdef DEBUG\n\tcout << \"--- Input ---\" << endl;\n\t#endif\n\tll N=1000000;\n\tEratosthenes er(N);\n\tvl euler(N+1);\n\trep(n,N+1){\n\t\tvp p=er.factorize(n);\n\t\teuler.at(n)=n;\n\t\tfor(auto e:p){\n\t\t\teuler.at(n) *= e.fi-1;\n\t\t\teuler.at(n) /= e.fi;\n\t\t}\n\t}\n\tvl sum(N+2);\n\trep(n,N+1){\n\t\tsum.at(n)+=euler.at(n);\n\t\tsum.at(n+1)+=sum.at(n);\n\t}\n\t#ifdef DEBUG\n\tcout<<\"N=\"<<N<<endl;\n\trep(i,100){\n\t\tcout<<\"i=\"<<i<<\" \"<<euler.at(i)<<\" \"<<sum.at(i)<<endl;\n\t}\n\tcout << \"--- Logic ---\" << endl;\n\t#endif\n\tll Q;cin>>Q;\n\trep(qi,Q){\n\t\tll n; cin>>n;\n\t\tcout<<sum.at(n)+1<<endl;\n\t}\n\t#ifdef DEBUG\n\tcout << \"--- Answer ---\" << endl;\n\t#endif\n\treturn true;\n}\nint main(){\n\t#ifdef DEBUG\n\tcout << \"--- Main ---\" << endl;\n\t#endif\n\tsolve();\n\t//while(solve());\n\treturn 0;\n}\n//cout << fixed << setprecision(9);","accuracy":1,"time_ms":100,"memory_kb":26372,"score_of_the_acc":-0.2765,"final_rank":16},{"submission_id":"aoj_2286_7589131","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 = 100000000;\nconst long long LINF = 3e18 + 7;\nconst int MAX_N = 1000010;\nconst int MAX_W = 10002;\nconst int MAX_ARRAYK = 100000;\ndouble PI = 3.14159265358979323846;\n//using ll = long long;\n\n\nlong long euler[MAX_N];\nlong long answer[MAX_N];\nvoid euler_phi2() {\n\tfor (long long i = 0; i < MAX_N; i++) {\n\t\teuler[i] = i;\n\t}\n\tfor (long long i = 2; i < MAX_N; i++) {\n\t\tif (euler[i] == i) {\n\t\t\tfor (long long j = i; j < MAX_N; j += i) {\n\t\t\t\teuler[j] = euler[j] / i * (i - 1);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\n\t// Farey Sequence\n\teuler_phi2();\n\tanswer[1] = 2;\n\tfor (long long i = 2; i < MAX_N; i++) {\n\t\tanswer[i] = answer[i - 1] + euler[i];\n\t}\n\tint T, M;\n\tcin >> T;\n\tfor (int t = 0; t < T; t++) {\n\t\tcin >> M;\n\t\tcout << answer[M] << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":18740,"score_of_the_acc":-0.1274,"final_rank":7},{"submission_id":"aoj_2286_7578208","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define rep(i,n) for(int i=0;i<n;++i)\n#define rep1(i,n) for(int i=1;i<=n;++i)\n#define reps(i,a,b) for(int i=a;i<b;++i)\n#define mod 998244353\n#define endl '\\n'\n#define AC ios_base::sync_with_stdio(false);cin.tie(0);\n#define INF 10e17\n\nint cnt[(int)10e6];\n\nvoid del(int pos){\n for(int i=pos*2;i<=10e6;i+=pos){\n cnt[i]-=cnt[pos];\n }\n}\n\nsigned main(){\n cnt[0]=0;\n rep1(i,(int)10e6)cnt[i]=i+1;\n rep1(i,(int)10e6)del(i);\n //累積和をとる\n rep1(i,(int)10e6)cnt[i]+=cnt[i-1];\n int t;\n cin>>t;\n rep(i,t){\n int n;\n cin>>n;\n cout<<cnt[n]<<endl;\n }\n\n \n}","accuracy":1,"time_ms":1700,"memory_kb":81136,"score_of_the_acc":-1.9955,"final_rank":20},{"submission_id":"aoj_2286_7576282","code_snippet":"#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2286\"\n\n#include <bits/stdc++.h>\n\ntemplate <class T> struct CumulativeSum {\n std::vector<T> seg;\n int n;\n\n CumulativeSum(int n) : n(n), seg(n + 1, 0) {}\n CumulativeSum(std::vector<T> &A) {\n n = (int)A.size();\n seg.assign(n + 1, T(0));\n for (int i = 0; i < n; i++) seg[i + 1] = seg[i] + A[i];\n }\n\n // [l, r)\n T sum(int l, int r) const {\n assert(0 <= l and l <= r and r <= n);\n return seg[r] - seg[l];\n }\n\n // A[p] = x\n void set(int p, T x) {\n assert(0 <= p and p < n);\n seg[p + 1] = x;\n }\n\n // A[p] += x\n void add(int p, T x) {\n assert(0 <= p and p < n);\n seg[p + 1] += x;\n }\n\n // A[l] += x, A[l + 1] += x, ... , A[r - 1] += x\n void imos(int l, int r, T x = T(1)) {\n add(l, x);\n add(r, -x);\n }\n\n void build() {\n for (int i = 0; i < n; i++) seg[i + 1] += seg[i];\n }\n\n T operator[](int p) const {\n assert(0 <= p and p < n);\n return seg[p + 1];\n }\n\n // output\n friend std::ostream &operator<<(std::ostream &os, const CumulativeSum &A) {\n for (int i = 0; i <= A.n; i++) os << A.seg[i] << \" \\n\"[i == A.n];\n return os;\n }\n};\n\nstd::vector<int> totient_table(int n) {\n std::vector<int> res(n + 1);\n std::iota(res.begin(), res.end(), 0);\n for (int p = 2; p <= n; p++) {\n if (res[p] != p) continue;\n for (int i = p; i <= n; i += p) {\n res[i] /= p;\n res[i] *= p - 1;\n }\n }\n return res;\n}\n\nint main() {\n auto ttt = totient_table(1000000);\n std::vector<long long> tl(ttt.size());\n for (int i = 0; i < (int)ttt.size(); i++) tl[i] = ttt[i];\n CumulativeSum<long long> rui(tl);\n int tt;\n std::cin >> tt;\n while (tt--) {\n int n;\n std::cin >> n;\n std::cout << rui.sum(0, n + 1) + 1 << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":22296,"score_of_the_acc":-0.1657,"final_rank":12},{"submission_id":"aoj_2286_7475843","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 = 100000000;\nconst long long LINF = 3e18 + 7;\nconst int MAX_N = 1000010;\nconst int MAX_W = 10002;\nconst int MAX_ARRAYK = 100000;\ndouble PI = 3.14159265358979323846;\n//using ll = long long;\n\n\nlong long prime[MAX_N];\nbool is_prime[MAX_N];\n\nlong long sieve(long long n) {\n\tlong long p = 0;\n\tfor (long long i = 0; i <= n; i++) {\n\t\tis_prime[i] = true;\n\t}\n\tis_prime[0] = is_prime[1] = false;\n\tfor (long long i = 2; i <= n; i++) {\n\t\tif (is_prime[i]) {\n\t\t\tprime[p++] = i;\n\t\t\tfor (long long j = 2 * i; j <= n; j += i) {\n\t\t\t\tis_prime[j] = false;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn p;\n}\n\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2286\n// https://ncastar.hatenablog.com/entry/20140320/1395323746\n// https://qiita.com/hidekikangeki/items/e2524f199ae1d483f060\n// 包除原理、オイラーのφ関数\n// https://nanikaka.hatenadiary.org/entry/20111224/1324690802\n\nlong long euler[MAX_N];\nlong long answer[MAX_N];\nvoid euler_phi2() {\n\tfor (long long i = 0; i < MAX_N; i++) {\n\t\teuler[i] = i;\n\t}\n\tfor (long long i = 2; i < MAX_N; i++) {\n\t\tif (euler[i] == i) {\n\t\t\tfor (long long j = i; j < MAX_N; j += i) {\n\t\t\t\teuler[j] = euler[j] / i * (i - 1);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\n\t//long long N = sieve(100);\n\t//cout << N << endl;\n\t//for (long long i = 0; i < N; i++) {\n\t//\tcout << prime[i] << \" \";\n\t//}\n\t//cout << endl;\n\n\teuler_phi2();\n\tanswer[1] = 2;\n\tfor (long long i = 2; i < MAX_N; i++) {\n\t\tanswer[i] = answer[i - 1] + euler[i];\n\t}\n\tint T, M;\n\tcin >> T;\n\tfor (int t = 0; t < T;t++) {\n\t\tcin >> M;\n\t\tcout << answer[M] << endl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":18600,"score_of_the_acc":-0.1314,"final_rank":9},{"submission_id":"aoj_2286_7372499","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing i32 = int;\n\ni32 main() {\n\ti32 size = 1000000;\n\tvector ps(size + 1, 0LL);\n\tfor (i32 i = 0 ; i < size + 1 ; i++) {\n\t\tps[i] = i;\n\t}\n\tfor (i32 i = 1 ; i < size + 1 ; i++) {\n\t\tfor (i32 j = i * 2 ; j < size + 1 ; j += i) {\n\t\t\tps[j] -= ps[i];\n\t\t}\n\t}\n\tvector s = { 0LL };\n\tpartial_sum(ps.begin(), ps.end(), back_inserter(s));\n\ti32 t; cin >> t;\n\tfor (i32 _ = 0 ; _ < t ; _++) {\n\t\ti32 n; cin >> n;\n\t\tcout << s.at(n + 1) + 1 << endl;\n\t}\n}","accuracy":1,"time_ms":30,"memory_kb":18820,"score_of_the_acc":-0.1285,"final_rank":8},{"submission_id":"aoj_2286_7277890","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing C = complex<double>;\nconst int mod = 998244353;\nconst long long LINF = 1001002003004005006;\nconst int INF = 1001001001;\nconst double PI = acos(-1);\nconst double EPS = 1e-10;\nconst int di[4] = {-1,0,1,0};\nconst int dj[4] = {0,-1,0,1};\nconst int dx[8] = {1,1,1,0,0,-1,-1,-1};\nconst int dy[8] = {1,0,-1,1,-1,1,0,-1};\n# define sz(x) (int)(x).size()\n# define rsz(x,n) x.resize(n)\n# define yosupo(x) {cout << (x) << endl; return 0;}\n# define ll long long\n# define fi first\n# define se second\n# define pb push_back\n# define pf push_front\n# define eb emplace_back\n# define ef emplace_front\n# define pob pop_back\n# define pof pop_front\n# define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n# define _rep(i, n) _rep2(i, 0, n)\n# define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\n# define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)\n# define srep(i, a, b) for(int i = a; i <= b; ++i)\n# define all(obj) (obj).begin(), (obj).end()\n# define rall(obj) (obj).rbegin(), (obj).rend()\ninline void YesNo(bool f) { std::cout << (f? \"Yes\": \"No\") << std::endl; }\nvoid read() {}\ntemplate <typename T, class... U> void read(T &t, U &...u) { cin >> t; read(u...); }\nvoid writeln() { cout << endl; }\ntemplate <typename T, class... U, char sep = ' '> void writeln(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; writeln(u...); }\n# define Pll pair<ll, ll>\n# define P pair<int,int>\n# define bit(x,i) (((x) >> (i)) & 1)\n# define equals(a, b) (fabs((a) - (b)) < EPS) // 誤差を考慮した同値判定\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<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}\ntemplate<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\ntemplate <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { return os << \"P(\" << p.first << \" \" << p.second << \")\";}\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\nusing vi = vc<int>; using vvi = vv<int>;\nusing vl = vc<ll>; using vvl = vv<ll>;\n\n#define MAX_N 1000100\n\nll euler[MAX_N], ans[MAX_N];\n\nvoid euler_phi2() {\n rep(i,MAX_N) euler[i] = i;\n rep(i,2,MAX_N) {\n if(euler[i] == i) {\n for(int j = i; j < MAX_N; j+=i) euler[j] = euler[j]*(i-1)/i;\n }\n }\n}\n\nint main() {\n euler_phi2();\n int t;\n scanf(\"%d\",&t);\n ans[1] = 2;\n rep(i,1,MAX_N-1) ans[i+1] = ans[i]+euler[i+1];\n rep(ti,t) {\n int n;\n scanf(\"%d\",&n);\n cout << ans[n] << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":18832,"score_of_the_acc":-0.1228,"final_rank":4},{"submission_id":"aoj_2286_7277883","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing C = complex<double>;\nconst int mod = 998244353;\nconst long long LINF = 1001002003004005006;\nconst int INF = 1001001001;\nconst double PI = acos(-1);\nconst double EPS = 1e-10;\nconst int di[4] = {-1,0,1,0};\nconst int dj[4] = {0,-1,0,1};\nconst int dx[8] = {1,1,1,0,0,-1,-1,-1};\nconst int dy[8] = {1,0,-1,1,-1,1,0,-1};\n# define sz(x) (int)(x).size()\n# define rsz(x,n) x.resize(n)\n# define yosupo(x) {cout << (x) << endl; return 0;}\n# define ll long long\n# define fi first\n# define se second\n# define pb push_back\n# define pf push_front\n# define eb emplace_back\n# define ef emplace_front\n# define pob pop_back\n# define pof pop_front\n# define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n# define _rep(i, n) _rep2(i, 0, n)\n# define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\n# define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)\n# define srep(i, a, b) for(int i = a; i <= b; ++i)\n# define all(obj) (obj).begin(), (obj).end()\n# define rall(obj) (obj).rbegin(), (obj).rend()\ninline void YesNo(bool f) { std::cout << (f? \"Yes\": \"No\") << std::endl; }\nvoid read() {}\ntemplate <typename T, class... U> void read(T &t, U &...u) { cin >> t; read(u...); }\nvoid writeln() { cout << endl; }\ntemplate <typename T, class... U, char sep = ' '> void writeln(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; writeln(u...); }\n# define Pll pair<ll, ll>\n# define P pair<int,int>\n# define bit(x,i) (((x) >> (i)) & 1)\n# define equals(a, b) (fabs((a) - (b)) < EPS) // 誤差を考慮した同値判定\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<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}\ntemplate<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\ntemplate <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { return os << \"P(\" << p.first << \" \" << p.second << \")\";}\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\nusing vi = vc<int>; using vvi = vv<int>;\nusing vl = vc<ll>; using vvl = vv<ll>;\n\n#define MAX_N 1000100\n\nll euler[MAX_N], ans[MAX_N];\n\nvoid euler_Phi() {\n rep(i,MAX_N) euler[i] = i;\n rep(i,2,MAX_N) {\n if(euler[i] == i) {\n for(int j = i; j < MAX_N; j+=i) euler[j] = euler[j]*(i-1)/i;\n }\n }\n}\n\nint main() {\n euler_Phi();\n int t;\n scanf(\"%d\",&t);\n ans[1] = 2;\n rep(i,1,MAX_N-1) ans[i+1] = ans[i]+euler[i+1];\n rep(ti,t) {\n int n;\n scanf(\"%d\",&n);\n cout << ans[n] << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":18888,"score_of_the_acc":-0.1236,"final_rank":5},{"submission_id":"aoj_2286_7044807","code_snippet":"// 2021.12.2\n// #define _GLIBCXX_DEBUG\n// #define __USE_MATH_DEFINES // const double PI = acos(-1.0)\n#include <bits/stdc++.h>\nusing namespace std;\n// (*) snipet\n// type name\nusing ll = long long;\nusing pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>;\nusing vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;\nusing vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;\nusing vpii = vector<pii>; using vpil = vector<pil>; using vpli = vector<pli>; using vpll = vector<pll>;\nusing vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;\nusing vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;\ntemplate <typename T> using pq = priority_queue<T, vector<T>>;\ntemplate <typename T> using pql = priority_queue<T, vector<T>, greater<T>>;\n// rep\n#define rep0(goal) for (int cnt = 0; cnt < int(goal); ++cnt)\n#define rep(cnt, goal) for (int cnt = 0; cnt < int(goal); ++cnt)\n#define rep2(cnt, start, goal) for (int cnt = int(start); cnt < int(goal); ++cnt)\n#define rep3(cnt, start, goal) for (int cnt = int(start); cnt > int(goal); --cnt)\n// all\n#define all(ctn) begin(ctn), end(ctn)\n// chmax, chmin\ntemplate <typename T> bool chmax(T &x, const T y) { if (x < y) { x = y; return true; } else { return false; }}\ntemplate <typename T> bool chmin(T &x, const T y) { if (x > y) { x = y; return true; } else { return false; }}\n// etc.\nvoid Yn(const bool &exp) { if (exp) cout << \"Yes\" << endl; else cout << \"No\" << endl;}\nvoid set_prec(const int &dig) { cout << fixed << setprecision(dig); cerr << fixed << setprecision(dig);}\n// template <typename T> T INF() { return numeric_limits<T>::max();}\n// template <typename T> T MIN_INF() { return numeric_limits<T>::min();}\n\n// #include <atcoder/all>\n// using namespace atcoder;\n// using mint = atcoder::modint1000000007;\n// using mint = atcoder::modint998244353;\n// // using mint = atcoder::modint;\n// void pr(const mint &MINT) { cerr << MINT.val(); } // mint\n// using pmm = pair<mint, mint>; using pim = pair<int, mint>; using pmi = pair<mint, int>; using plm = pair<ll, mint>; using pml = pair<mint, ll>;\n// using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\n\n// debug\ntemplate <typename T> void pr(const T &obj) { cerr << obj; } // single\ntemplate <typename T, typename ...Ts> void pr(const T &first, const Ts &...rest) { pr(first); cerr << \", \"; pr(rest...); } // multi(plural)\ntemplate <typename S, typename T> void pr(const pair<S, T> &PAIR) { cerr << \"(\"; pr(PAIR.first); cerr << \", \"; pr(PAIR.second); cerr << \")\"; } // pair\ntemplate <typename S, typename T, typename U> void pr(const tuple<S, T, U> &trp) { cerr << \"(\"; pr(get<0>(trp)); cerr << \", \"; pr(get<1>(trp)); cerr << \", \"; pr(get<2>(trp)); cerr << \")\"; } // tuple(3)\ntemplate <typename T> void pr(const vector<T> &vec) { cerr << \"{\"; for (T obj : vec) { pr(obj); cerr << \", \"; } cerr << \"}\"; } // vector\ntemplate <typename T> void pr(const vector<vector<T>> &vv) { rep(row, vv.size()) { cerr << endl; cerr << \"[\" << row << \"]: \"; pr(vv[row]); }} // vector(multi-D)\ntemplate <typename T> void pr(const set<T> &SET) { cerr << \"{\"; for (T obj : SET) { pr(obj); cerr << \", \"; } cerr << \"}\"; } // set\ntemplate <typename T> void pr(const multiset<T> &MS) { cerr << \"{\"; for (T obj : MS) { pr(obj); cerr << \", \"; } cerr << \"}\"; } // multiset\ntemplate <typename S, typename T> void pr(const map<S, T> &MAP) { cerr << \"{\"; for (pair<S, T> p : MAP) { pr(p.first); cerr << \": \"; pr(p.second); cerr << \", \"; } cerr << \"}\";} // map\ntemplate <typename T> void pr(const queue<T> &que) { queue<T> q = que; cerr << \"{\"; while (!q.empty()) { pr(q.front()); q.pop(); cerr << \", \";} cerr << \"}\";} // queue\ntemplate <typename T> void pr(const deque<T> &deq) { deque<T> d = deq; cerr << \"{\"; while (!d.empty()) { pr(d.front()); d.pop_front(); cerr << \", \";} cerr << \"}\";} // deque\ntemplate <typename T> void pr(const stack<T> &stc) { stack<T> s = stc; vector<T> v; while (!s.empty()) { v.push_back(s.top()); s.pop();} reverse(all(v)); cerr << \"{\"; for (T obj : v) cerr << obj << \", \"; cerr << \"}\";} // stack\ntemplate <typename T> void pr(const priority_queue<T> &pq) { priority_queue<T> p = pq; cerr << \"{\"; while (!p.empty()) { pr(p.top()); p.pop(); cerr << \", \"; } cerr << \"}\";} // priority_queue\ntemplate <typename T> void pr(const priority_queue<T, vector<T>, greater<T>> &pq) { priority_queue<T, vector<T>, greater<T>> p = pq; cerr << \"{\"; while (!p.empty()) { pr(p.top()); p.pop(); cerr << \", \";} cerr << \"}\";} // priority_queue(from less)\n\n#define db(obj) cerr << #obj << \": \"; pr(obj); cerr << \" \";\n#define dl(obj) db(obj); cerr << endl;\n#define dm(...) cerr << \"(\" << #__VA_ARGS__ << \"): (\"; pr(__VA_ARGS__); cerr << \") \";\n#define dml(...) dm(__VA_ARGS__); cerr << endl;\n\n\n// global\nint t;\nvi n;\n\nvl a, b;\nconst int MAX_n = 1000000;\n\nvoid input() {\n\tcin >> t;\n\tn = vi(t);\n\trep(i, t) cin >> n[i];\n}\n\nvoid init() {\n\tinput();\n\ta = vl(MAX_n + 1);\n\tb = vl(MAX_n + 2);\n}\n\nvector<pair<ll, int>> prime_factorization(ll N) {\n\tassert(1 <= N);\n\tvector<pair<ll, int>> res;\n\tfor (ll p = 2; p * p <= N; ++ p) if (N % p == 0) {\n\t\tint d = 0;\n\t\tfor (; N % p == 0; N /= p) ++d;\n\t\tres.push_back(make_pair(p, d));\n\t}\n\tif (N > 1) res.push_back(make_pair(N, 1));\n\treturn res;\n}\n\n// オイラーのφ関数\nll phi(ll N) {\n\tfor (auto &[p, d] : prime_factorization(N)) N = N / p * (p - 1);\n\treturn N;\n}\n\nll sub_solve(ll N) {\n\tll res = 1;\n\trep2(k, 1, N + 1) res += phi(k);\n\treturn res;\n}\n\nvoid solve() {\n\ta[0] = 1;\n\trep2(N, 1, MAX_n + 1) a[N] = phi(N);\n\trep(N, MAX_n + 1) b[N + 1] = b[N] + a[N];\n\t// dl(a); dl(b); //\n\trep(i, t) cout << b[n[i] + 1] << endl;\n}\n\nvoid test() {\n}\n\nint main() {\n\tinit();\n\t// test(); //\n\tsolve();\n}","accuracy":1,"time_ms":1180,"memory_kb":18668,"score_of_the_acc":-0.8069,"final_rank":17},{"submission_id":"aoj_2286_7029406","code_snippet":"#include <iostream>\n#include <sstream>\n#include <vector>\n#include <map>\n#include <algorithm>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cmath>\n#include <iomanip>\n#include <numeric>\n#include <string>\n#include <bitset>\n#include <assert.h>\n#include <functional>\n\n// #define _GLIBCXX_DEBUG\n// #define _LIBCPP_DEBUG 0\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n#define revrep(i, n) for(int i = (int)(n - 1); i >= 0; --i)\n#define range(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\n#define revrange(i, s, t) for(int i = (int)(t - 1); i >= (int)(s); --i)\n#define srange(i, s, t, step) for(int i = (int)(s); i < (int)(t); i += (int)(step))\n#define popcnt(x) __builtin_popcountll(x)\n#define hayai std::ios::sync_with_stdio(false);std::cin.tie(nullptr)\n#define SORT(x) sort(x.begin(), x.end())\n#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())\n\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<long long, 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; }\ninline bool inside(int x, int y, int h, int w) { return (x >= 0 && x < h && y >= 0 && y < w); }\nint dx[] = {0, -1, 0, 1};\nint dy[] = {-1, 0, 1, 0};\n\n\n\n//https://qiita.com/drken/items/3beb679e54266f20ab63\nstruct Erastothenes {\n vector<bool> is_prime; \n vector<int> min_factor; \n vector<int> moebius; \n Erastothenes(int n): is_prime(n + 1, true),\n min_factor(n + 1, -1),\n moebius(n + 1, 1) {\n is_prime[1] = false;\n min_factor[1] = 1;\n\n for(int p = 2; p <= n; ++p) {\n if (!is_prime[p]) continue;\n min_factor[p] = p;\n moebius[p] = -1;\n for(int q = p + p; q <= n; q += p) {\n is_prime[q] = false;\n if (min_factor[q] == -1) min_factor[q] = p;\n if ((q / p) % p == 0) moebius[q] = 0;\n else moebius[q] = -moebius[q];\n }\n }\n }\n};\n\n\nconst int NMAX = 1e6+1;\nll farey_size[NMAX];\n\nvoid pre_calc() {\n Erastothenes sieve(NMAX);\n range(i, 1, NMAX) {\n srange(j, i, NMAX, i) {\n farey_size[j] += sieve.moebius[i] * (j / i);\n }\n }\n farey_size[1] = 2;\n range(i, 2, NMAX) farey_size[i] += farey_size[i-1];\n}\n\n\nint main() {\n hayai; pre_calc();\n int n;\n cin >> n;\n rep(i, n) {\n int k;\n cin >> k;\n cout << farey_size[k] << \"\\n\";\n }\n}","accuracy":1,"time_ms":50,"memory_kb":18572,"score_of_the_acc":-0.1369,"final_rank":10},{"submission_id":"aoj_2286_6985267","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nll Euler_Phi_Function(ll v){\n ll ans=v,v2=v;\n if(v2%2==0){ans-=ans/2;while(v2%2==0)v2/=2;}\n if(v2%3==0){ans-=ans/3;while(v2%3==0)v2/=3;}\n for(ll i=5;i*i<=v2;i+=4){\n if(v2%i==0){ans-=ans/i;while(v2%i==0)v2/=i;}\n i+=2;\n if(v2%i==0){ans-=ans/i;while(v2%i==0)v2/=i;}\n }\n if(v2!=1)ans-=ans/v2;\n return ans;\n}\n\nint main(){\n vector<ll> tb(1000001);\n tb[1] = 2;\n for(int i = 2; i <= 1000000; i++){\n tb[i] = tb[i - 1] + Euler_Phi_Function(i);\n }\n int T, v;\n cin >> T;\n while(T--){\n cin >> v;\n cout << tb[v] << '\\n';\n }\n}","accuracy":1,"time_ms":390,"memory_kb":10544,"score_of_the_acc":-0.2249,"final_rank":14},{"submission_id":"aoj_2286_6976894","code_snippet":"#include <bits/stdc++.h>\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\n#define INF (1LL << 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// 幅優先の例\n// 入力: グラフ G と，探索の始点 s\n// 出力: s から各頂点への最短路長を表す配列\nvector<int> BFS(const Graph &G, int s)\n{\n int N = (int)G.size(); // 頂点数\n // vector<bool> seen(N, false);\n vector<int> dist(N, -1); // 全頂点を「未訪問」に初期化\n queue<int> que;\n\n dist[s] = 0;\n que.push(s);\n\n while (!que.empty())\n {\n int v = que.front();\n que.pop();\n\n for (int x : G[v])\n {\n if (dist[x] != -1)\n continue;\n\n dist[x] = dist[v] + 1;\n que.push(x);\n }\n }\n return dist;\n}\n\n// エラトステネスの篩\nstruct Eratosthenes\n{\n // テーブル\n vector<bool> isprime;\n\n // 整数 i を割り切る最小の素数\n vector<int> minfactor;\n\n // メビウス関数値\n // * μ(1)=1\n // * nがある素数pで2回以上割り切れるとき、μ(n)=0\n // * n=p1×p2×…pkと素因数分解できるとき、μ(n)=(−1)^K\n vector<int> mobius;\n\n // コンストラクタで篩を回す\n Eratosthenes(int N) : isprime(N + 1, true),\n minfactor(N + 1, -1),\n mobius(N + 1, 1)\n {\n // 1 は予めふるい落としておく\n isprime[1] = false;\n minfactor[1] = 1;\n\n // 篩\n for (int p = 2; p <= N; ++p)\n {\n // すでに合成数であるものはスキップする\n if (!isprime[p])\n continue;\n\n // p についての情報更新\n minfactor[p] = p;\n mobius[p] = -1;\n\n // p 以外の p の倍数から素数ラベルを剥奪\n for (int q = p * 2; q <= N; q += p)\n {\n // q は合成数なのでふるい落とす\n isprime[q] = false;\n\n // q は p で割り切れる旨を更新\n if (minfactor[q] == -1)\n minfactor[q] = p;\n // update mobius\n if ((q / p) % p == 0)\n mobius[q] = 0;\n else\n mobius[q] = -mobius[q];\n }\n }\n }\n\n // 高速素因数分解\n // pair (素因子, 指数) の vector を返す\n vector<pair<int, int>> factorize(int n)\n {\n vector<pair<int, int>> res;\n while (n > 1)\n {\n int p = minfactor[n];\n int exp = 0;\n\n // n で割り切れる限り割る\n while (minfactor[n] == p)\n {\n n /= p;\n ++exp;\n }\n res.emplace_back(p, exp);\n }\n return res;\n }\n\n // 高速約数列挙\n // 計算量はnの約数の個数をσ(n)として、O(σ(n))となります。n≤10^9の範囲では、σ(n)≤1344(n=735134400で最大)\n vector<int> divisors(int n)\n {\n vector<int> res({1});\n\n // n を素因数分解 (メンバ関数使用)\n auto pf = factorize(n);\n\n // 約数列挙\n for (auto p : pf)\n {\n int s = (int)res.size();\n for (int i = 0; i < s; ++i)\n {\n int v = 1;\n for (int j = 0; j < p.second; ++j)\n {\n v *= p.first;\n res.push_back(res[i] * v);\n }\n }\n }\n return res;\n }\n};\n\nint main()\n{\n cout << fixed << setprecision(16);\n int t;\n cin >> t;\n\n int MAXN = 1e6;\n vector<ll> sum(MAXN + 1);\n sum[1] = 2;\n Eratosthenes er(MAXN);\n\n rep(x, 2, MAXN + 1)\n {\n // i以下の互いに素な個数\n ll cnt = x;\n for (auto [p, r] : er.factorize(x))\n {\n cnt = cnt / p * (p - 1);\n }\n sum[x] = sum[x - 1] + cnt;\n }\n\n rep(i, 0, t)\n {\n int n;\n cin >> n;\n cout << sum[n] << endl;\n }\n}","accuracy":1,"time_ms":90,"memory_kb":18804,"score_of_the_acc":-0.1638,"final_rank":11},{"submission_id":"aoj_2286_6681186","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <tuple>\n#include <map>\n#include <queue>\n\nusing namespace std;\n\nusing ll = long long;\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>;\nusing vll = vector<ll>;\t\tusing vvll = vector<vll>;\tusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\tusing vvb = vector<vb>;\t\tusing vvvb = vector<vvb>;\ntemplate <class T> using pqr = priority_queue<T, vector<T>, greater<T>>;\n\nconst ll INFL = (ll)1e18;\tconst int INF = (int)1e9;\nconst int MOD = 1000000007;\n\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 を返す）\n\n\n//ユークリッドの互除法\nll gcd(ll a, ll b) {\n\tif (b == 0) return a;\n\treturn gcd(b, a % b);\n}\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}\n\telse {\n\t\tx = 1; y = 0;\n\t}\n\treturn d;\n}\n\n//素数判定O(\\sqrt(n))\nbool is_prime(int n) {\n\tfor (int i = 2; i * i <= n; i++) {\n\t\tif (n % i == 0)\n\t\t\treturn false;\n\t}\n\treturn n != 1;\n}\n\n//エラトステネスの篩\nint sieve(int n, vi& prime, vb& is_prime) {\n\tint p = 0;\n\tfor (int i = 0; i <= n; i++)\n\t\tis_prime[i] = true;\n\tis_prime[0] = is_prime[1] = false;\n\tfor (int i = 2; i <= n; i++) {\n\t\tif (is_prime[i]) {\n\t\t\tprime[p++] = i;\n\t\t\tfor (int j = 2 * i; j <= n; j += i)\n\t\t\t\tis_prime[j] = false;\n\t\t}\n\t}\n\treturn p;\n}\n\nint main()\n{\n\tconst int MAX_NUM = 1000000;\n\tint t;\n\tcin >> t;\n\n\n\t//素数とオイラー関数の計算\n\tvi prime(MAX_NUM + 1);\n\tvb is_prime(MAX_NUM + 1);\n\tvi euler(MAX_NUM + 1, 1);\n\tint p = 0;\n\t//初期化\n\tfor (int i = 0; i <= MAX_NUM; i++)\n\t\tis_prime[i] = true;\n\n\tis_prime[0] = is_prime[1] = false;\n\tfor (int i = 2; i <= MAX_NUM; i++) {\n\t\tif (is_prime[i]) {\n\t\t\tprime[p++] = i;\n\t\t\teuler[i] = i - 1;\n\t\t\tfor (int j = 2 * i; j <= MAX_NUM; j += i) {\n\t\t\t\tis_prime[j] = false;\n\t\t\t\tint tmp = j, pow = 1;\n\t\t\t\t//素因数のべきを求める\n\t\t\t\twhile (tmp % i == 0) {\n\t\t\t\t\ttmp /= i;\n\t\t\t\t\tpow *= i;\n\t\t\t\t}\n\t\t\t\t//オイラー関数の計算\n\t\t\t\teuler[j] *= pow - pow / i;\n\n\t\t\t}\n\t\t}\n\t}\n\n\n\t//数列計算\n\tvll F(MAX_NUM + 1);\n\tF[1] = 2;\n\tfor (int i = 2; i <= MAX_NUM; i++) {\n\t\tF[i] = F[i - 1] + euler[i];\n\t}\n\n\tvll ans;\n\tfor (int i = 0; i < t; i++) {\n\t\tint n;\n\t\tcin >> n;\n\t\tans.push_back(F[n]);\n\t}\n\n\n\tfor (auto a : ans)\n\t\tcout << a << endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":19064,"score_of_the_acc":-0.1261,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_2286_11042230\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vector<ll>>;\\nusing vvvll = vector<vector<vector<ll>>>;\\nusing vd = vector<double>;\\nusing vvd = vector<vector<double>>;\\nusing vstr = vector<string>;\\nusing vchar = vector<char>;\\nusing vvchar = vector<vector<char>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vector<bool>>;\\nusing vvvb = vector<vector<vector<bool>>>;\\nusing pii = pair<int,int>;\\nusing pll = pair<long long, long long>;\\nusing Graph = vector<vector<int>>;\\nusing WeightedGraph = vector<vector<pair<int,ll>>>;\\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#define rep(i, a, b) for(ll i = (ll)a; i < (ll)b; i++)\\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 RREP(i, a, b) for(ll i = (ll)b; i >= (ll)a; i--)\\n#define all(v) v.begin(), v.end()\\n#define rall(v) v.rbegin(), v.rend()\\n#define YESNO(flag) cout << (flag ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"\\n#define spa \\\" \\\"\\n#define mint modint\\n\\nconst int inf = 1070000000;\\nconst long long INF = 4500000000000000000;\\n//const long long MOD = 998244353;\\nconst long long MOD = 1000000007;\\nconst double pi = 3.141592653589793238;\\nconst double eps = (1e-10);\\nconst string ABC = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string abc = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n\\ntemplate<typename T> inline bool chmin(T& a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<typename T> inline bool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<typename S, typename T> pair<S, T> operator+(pair<S, T> a, pair<S, T> b) {\\n pair<S, T> ans;\\n ans.first = a.first + b.first;\\n ans.second = a.second + b.second;\\n return ans;\\n} \\n\\n//拡張ユークリッド\\nll ext_gcd(ll a, ll b, ll &x, ll &y) {\\n if(b == 0) {\\n x = 1, y = 0;\\n return a;\\n }\\n\\n ll q = a/b;\\n ll g = ext_gcd(b, a-q*b, x, y);\\n ll z = x-q*y;\\n x = y, y = z;\\n return g;\\n}\\n//mod mにおけるaの逆元. aとmは互いに素.\\nll inverse(ll a, ll m) {\\n ll x, y;\\n ext_gcd(a, m, x, y);\\n x = (x+m) % m;\\n return x;\\n}\\n//modint\\ntemplate<std::uint_fast64_t mod> struct modint {\\n using u64 = std::uint_fast64_t;\\n u64 val;\\n\\n modint(u64 v = 0) : val(v % mod) {}\\n\\n bool operator==(modint other) {\\n return val == other.val;\\n }\\n modint operator+(modint other) {\\n modint<mod> ans;\\n ans.val = val + other.val;\\n if(ans.val >= mod) ans.val -= mod;\\n return ans;\\n }\\n modint operator-(modint other) {\\n modint<mod> ans;\\n if(val < other.val) val += mod;\\n ans.val = val - other.val;\\n return ans;\\n }\\n modint operator*(modint other) {\\n modint<mod> ans;\\n ans.val = (val * other.val) % mod;\\n return ans;\\n }\\n modint operator/(modint other) {\\n modint<mod> ans;\\n ans.val = (val * inverse(other.val, mod)) % mod;\\n return ans;\\n }\\n modint &operator+=(modint other) {\\n *this = *this + other;\\n return *this;\\n }\\n modint &operator-=(modint other) {\\n *this = *this - other;\\n return *this;\\n }\\n modint &operator*=(modint other) {\\n *this = *this * other;\\n return *this;\\n }\\n modint &operator/=(modint other) {\\n *this = *this / other;\\n return *this;\\n }\\n modint &operator++() {\\n *this += 1;\\n return *this;\\n }\\n modint &operator++(int) {\\n ++(*this);\\n return *this;\\n }\\n modint &operator--() {\\n *this -= 1;\\n return *this;\\n }\\n modint &operator--(int) {\\n --(*this);\\n return *this;\\n }\\n};\\n//modintの入出力\\ntemplate<std::uint_fast64_t mod> std::ostream& operator<<(std::ostream &os, const modint<mod> &x) {\\n // modint の 'val' メンバを出力ストリーム(os)に渡す\\n os << x.val;\\n return os; // ストリームを返す (チェーンのため)\\n}\\ntemplate<std::uint_fast64_t mod> std::istream& operator>>(std::istream& is, modint<mod> &x) {\\n // modintが内部で使っているu64型を取得\\n using u64 = typename modint<mod>::u64; \\n \\n u64 input_value;\\n is >> input_value; // (1) istream(cin) から一時変数に値を読み込む\\n \\n // (2) 読み込んだ値を使って modint を再構築する\\n // modintのコンストラクタが (input_value % mod) を処理してくれる\\n x = modint<mod>(input_value); \\n \\n return is; // (3) ストリームを返す (チェーンのため)\\n}\\n//累乗, x^n\\ntemplate<typename T> T pow(T x, int n) {\\n T ans = 1;\\n while(n > 0) {\\n if(n & 1) ans *= x;\\n x *= x;\\n n >>= 1; \\n }\\n return ans;\\n}\\n//階乗, n!\\ntemplate<typename T> T fact(T n) {\\n if(n == 0) return 1;\\n return n * fact(n-1);\\n}\\n//nPk\\ntemplate<typename T> T perm(T n, T k) {\\n if(k == 0) return 1;\\n return n * perm(n-1, k-1);\\n}\\n//nCk\\ntemplate<typename T> T comb(T n, T k) {\\n if(k > n) return 0;\\n return perm(n, min(k, n-k))/fact(min(k, n-k));\\n}\\n//ord(n)\\nll ord(ll n, ll p) {\\n int ans = 0;\\n while(n % p == 0) {\\n n /= p;\\n ans++;\\n }\\n return ans;\\n}\\n//ルジャンドルの公式ord(n!)\\nll factord(ll n, ll p) {\\n ll ans = 0;\\n ll q = p, tmp = n;\\n while(tmp > 0) {\\n tmp = n/q;\\n ans += tmp;\\n q *= p;\\n }\\n return ans;\\n}\\n//素因数分解, O(√N)\\nvector<pair<ll,ll>> factorize(ll N) {\\n vector<pair<ll,ll>> ans;\\n for(ll p = 2; p*p <= N; p++) {\\n int ex = 0;\\n while(N % p == 0) {\\n N /= p;\\n ex++;\\n }\\n if(ex != 0) ans.push_back({p,ex});\\n }\\n if(N != 1) ans.push_back({N,1});\\n return ans;\\n}\\n//素数判定\\nbool isprime(long long x) {\\n if(x == 1) return false;\\n \\n for(long long i = 2; i*i <= x; i++) {\\n if(x % i == 0) return false;\\n }\\n return true;\\n}\\n//エラトステネスの篩\\nstruct Eratosthenes {\\n vector<bool> prime;\\n vector<int> minfactor;\\n vector<int> mobius;\\n vector<ll> euler;\\n\\n //コンストラクタ O(NloglogN)\\n Eratosthenes(int N) : prime(N+1, true),\\n minfactor(N+1, -1),\\n mobius(N+1, 1),\\n euler(N+1, 1) {\\n prime[0] = false;\\n prime[1] = false;\\n minfactor[1] = 1;\\n REP(i,1,N) euler[i] = i;\\n\\n for(int p = 2; p <= N; p++) {\\n if(!prime[p]) continue;\\n\\n minfactor[p] = p;\\n mobius[p] = -1;\\n euler[p] = p-1;\\n\\n for(int q = 2; p*q <= N; q++) {\\n prime[p*q] = false;\\n if(minfactor[p*q] == -1) minfactor[p*q] = p;\\n if(q % p == 0) mobius[p*q] = 0;\\n else mobius[p*q] *= -1;\\n euler[p*q] = euler[p*q]*(p-1)/p;\\n }\\n }\\n }\\n\\n //素因数分解 O(logn)\\n vector<pair<int,int>> factorize(int n) {\\n vector<pair<int,int>> ans;\\n while(n > 1) {\\n int p = minfactor[n], exp = 0;\\n while(n % p == 0) {\\n n /= p;\\n exp++;\\n }\\n ans.push_back({p, exp});\\n }\\n return ans;\\n }\\n //約数列挙 O(σ(n))\\n vector<int> divisors(int n) {\\n vector<int> ans = {1};\\n while(n > 1) {\\n int p = minfactor[n], d = 1, s = ans.size();\\n while(n % p == 0) {\\n d *= p;\\n for(int i = 0; i < s; i++) {\\n ans.push_back(ans[i]*d);\\n }\\n n /= p;\\n }\\n }\\n return ans;\\n }\\n};\\n//高速ゼータ変換\\ntemplate<typename T> void fast_zeta(vector<T> &f) {\\n int N = f.size();\\n Eratosthenes sieve(N);\\n for(int p = 2; p < N; p++) {\\n if(!sieve.prime[p]) continue;\\n \\n for(int k = N/p; k >= 1; k--) {\\n f[k] += f[k*p];\\n }\\n }\\n}\\n//高速メビウス変換\\ntemplate<typename T> void fast_mobius(vector<T> &F) {\\n int N = F.size();\\n Eratosthenes sieve(N);\\n for(int p = 2; p < N; p++) {\\n if(!sieve.prime[p]) continue;\\n\\n for(int k = 1; k*p < N; k++) {\\n F[k] -= F[k*p];\\n }\\n }\\n}\\n//添字GCD畳み込み\\ntemplate<typename T> vector<T> gcd_conv(vector<T> &f, vector<T> &g) {\\n int N = max(f.size(), g.size());\\n vector<T> F(N, 0), G(N, 0), H(N);\\n for(int i = 0; i < f.size(); i++) F[i] = f[i];\\n for(int i = 0; i < g.size(); i++) G[i] = g[i];\\n fast_zeta(F);\\n fast_zeta(G);\\n \\n for(int i = 0; i < N; i++) H[i] = F[i]*G[i];\\n fast_mobius(H);\\n \\n return H;\\n}\\n\\n//行列積\\nvvll matrix_product(vvll A, vvll B) {\\n int H = A.size(), W = A[0].size(), S = B.size(), T = B[0].size();\\n if(W != S) {\\n cout << \\\"matrix_size_error\\\" << \\\"\\\\n\\\";\\n return vvll(0);\\n }\\n\\n vvll C(H, vll(T, 0));\\n rep(i,0,H) rep(j,0,T) {\\n rep(k,0,W) {\\n C[i][j] += A[i][k]*B[k][j];\\n //C[i][j] %= M;\\n }\\n }\\n return C;\\n}\\nvvll matrix_pow(vvll A, ll n) {\\n int N = A.size();\\n vvll ans(N, vll(N, 0));\\n rep(i,0,N) ans[i][i] = 1;\\n \\n while(n > 0) {\\n if(n & 1) ans = matrix_product(ans, A);\\n A = matrix_product(A, A);\\n n >>= 1; \\n }\\n return ans;\\n}\\n\\n//1+2+...+n = n(n+1)/2\\nll tri(ll n) {\\n ll x = n*(n+1);\\n return x/2;\\n}\\n\\n//座標圧縮\\nvector<int> compress(vector<int> A) {\\n vector<int> B = A;\\n\\n sort(B.begin(), B.end());\\n B.erase(unique(B.begin(), B.end()), B.end());\\n\\n vector<int> res(A.size());\\n for(int i = 0; i < (int)A.size(); i++) {\\n res[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();\\n }\\n return res;\\n}\\n\\n//正方形グリッドの右回転, 左回転\\nvoid rotate_right(vector<vector<char>> &S) {\\n int N = S.size();\\n auto T = S;\\n rep(i,0,N) rep(j,0,N) {\\n T[i][j] = S[N-1-j][i];\\n }\\n S = T;\\n}\\nvoid rotate_left(vector<vector<char>> &S) {\\n int N = S.size();\\n auto T = S;\\n rep(i,0,N) rep(j,0,N) {\\n T[i][j] = S[j][N-1-i];\\n }\\n S = T;\\n}\\n\\n//2点(a,b)と(x,y)の距離\\nlong double dist(pair<long double, long double> a, pair<long double, long double> b) {\\n return sqrt((a.first-b.first)*(a.first-b.first) + (a.second-b.second)*(a.second-b.second));\\n}\\nlong double man(pair<long double, long double> a, pair<long double, long double> b) {\\n return abs(a.first-b.first) + abs(a.second-b.second);\\n}\\n//内分点\\npair<long double, long double> internal_division(pair<long double, long double> a, pair<long double, long double> b, long double p) {\\n long double x = a.first + (b.first - a.first) * p;\\n long double y = a.second + (b.second - a.second) * p;\\n return {x, y};\\n}\\n\\n//桁数\\nint digit(ll N) {\\n if(N <= 9) return 1;\\n\\n return 1 + digit(N / 10);\\n}\\n//A進数文字列NをB進数に変換. A,Bは10以下\\nstring base_change(string N, ll A, ll B) {\\n ll X = stoll(N), Y = 0;\\n\\n ll i = 1;\\n while(X != 0) {\\n Y += (X % 10) * i;\\n i *= A;\\n X /= 10;\\n }\\n\\n X = Y, Y = 0;\\n i = 1;\\n while(X != 0) {\\n Y += (X % B) * i;\\n i *= 10;\\n X /= B;\\n }\\n\\n return to_string(Y);\\n}\\n//回文判定\\nbool palin(string S) {\\n rep(i,0,S.size()) {\\n if(S[i] != S[S.size()-1-i]) return false;\\n }\\n return true;\\n}\\n\\n//hh:mm:ss to second\\nint convert_to_time(string S) {\\n ll h = 10*(S[0]-'0') + (S[1]-'0');\\n ll m = 10*(S[3]-'0') + (S[4]-'0');\\n ll s = 10*(S[6]-'0') + (S[7]-'0');\\n \\n return h*3600+m*60+s;\\n}\\n\\n//DFS\\nvoid dfs(const Graph &G, int v, vector<bool> &seen) { \\n seen[v] = true;\\n \\n for (auto next_v : G[v]) { \\n if (!seen[next_v]) {\\n dfs(G, next_v, seen);\\n }\\n }\\n}\\nvoid griddfs(const vector<vector<char>> &G, int x, int y, vector<vector<bool>> &seen) {\\n int H = G.size(), W = G[0].size();\\n seen[x][y] = true;\\n \\n for (int i = 0; i < 8; i++) { \\n int nx = x + dx[i], ny = y + dy[i];\\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\\n if (!seen[nx][ny] and G[nx][ny] != '#') griddfs(G, nx, ny, seen);\\n }\\n}\\n//BFS\\nvoid bfs(const Graph &G, int v, vector<int> &dist) {\\n rep(i,0,dist.size()) dist[i] = inf;\\n dist[v] = 0;\\n queue<int> q;\\n q.push(v);\\n while(!q.empty()) {\\n int u = q.front();\\n q.pop();\\n for(auto next_u : G[u]) {\\n if(dist[next_u] == inf) {\\n dist[next_u] = dist[u] + 1;\\n q.push(next_u);\\n }\\n }\\n }\\n}\\nvoid gridbfs(const vector<vector<char>> &G, int x, int y, vector<vector<int>> &dist) {\\n int H = G.size(), W = G[0].size();\\n dist[x][y] = 0;\\n queue<pair<int, int>> q;\\n q.push(make_pair(x, y));\\n while(!q.empty()) {\\n int x = q.front().first, y = q.front().second;\\n q.pop();\\n for(int i = 0; i < 4; i++) {\\n int nx = x + dx[i], ny = y + dy[i];\\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\\n if(dist[nx][ny] == inf and G[nx][ny] != '#') {\\n dist[nx][ny] = dist[x][y] + 1;\\n q.push(make_pair(nx, ny));\\n }\\n }\\n }\\n}\\n//ワーシャル・フロイド\\nvector<vector<ll>> floyd(vector<vector<ll>> G) {\\n int N = G.size();\\n auto dp = G;\\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(dp[i][j] > dp[i][k] + dp[k][j] and dp[i][k] != INF and dp[k][j] != INF) {\\n dp[i][j] = dp[i][k] + dp[k][j];\\n }\\n }\\n }\\n }\\n return dp;\\n}\\n//サイクルがあるか判定\\nbool cycle(const Graph &G, int v, vector<bool> &seen, vector<bool> &finished) {\\n seen[v] = true; // 行きがけ時に true になる\\n for (auto v2 : G[v]) {\\n //if (v2 が逆戻りの場合) continue; // 無向グラフの場合は必要\\n\\n // 頂点 v2 がすでに探索済みの場合はスキップ \\n if (finished[v2]) continue;\\n\\n // サイクル検出\\n if (seen[v2] && !finished[v2]) return true;\\n\\n // 頂点 v2 を再帰的に探索\\n if (cycle(G, v2, seen, finished)) return true;\\n }\\n finished[v] = true; // 帰りがけ時に true になる\\n return false;\\n}\\n\\n//Union-Find\\nstruct UnionFind {\\n vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2\\n \\n UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化\\n for(int i = 0; i < N; i++) par[i] = i;\\n }\\n \\n int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}\\n if (par[x] == x) return x;\\n return par[x] = root(par[x]);\\n }\\n \\n void unite(int x, int y) { // xとyの木を併合\\n int rx = root(x); //xの根をrx\\n int ry = root(y); //yの根をry\\n if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま\\n par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける\\n }\\n \\n bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す\\n int rx = root(x);\\n int ry = root(y);\\n return rx == ry;\\n }\\n};\\n\\nvoid solve() {\\n}\\n\\nint main() {\\n int t; cin >> t;\\n Eratosthenes sieve(1000000);\\n vll phi(1000001, 1);\\n REP(i,1,1000000) {\\n phi[i] = phi[i-1]+sieve.euler[i];\\n }\\n while(t--) {\\n int n; cin >> n;\\n cout << phi[n] << \\\"\\\\n\\\";\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 26504,\n \"score_of_the_acc\": -0.2487,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2286_11015246\",\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 = 1000010;\\nconst int MAX_ARRAYK = 100000;\\ndouble PI = 3.14159265358979323846;\\nconst int INF = 2147483647;\\n//using ll = long long;\\n\\n// Farey Sequence\\n// AOJ 2286\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2286\\n// https://ncastar.hatenablog.com/entry/20140320/1395323746\\n// https://qiita.com/hidekikangeki/items/e2524f199ae1d483f060\\n// 包除原理、オイラーのφ関数\\n// https://nanikaka.hatenadiary.org/entry/20111224/1324690802\\n\\nlong long euler[MAX_N];\\nlong long answer[MAX_N];\\nvoid euler_phi2() {\\n\\tfor (long long i = 0; i < MAX_N; i++) {\\n\\t\\teuler[i] = i;\\n\\t}\\n\\tfor (long long i = 2; i < MAX_N; i++) {\\n\\t\\tif (euler[i] == i) {\\n\\t\\t\\tfor (long long j = i; j < MAX_N; j += i) {\\n\\t\\t\\t\\teuler[j] = euler[j] / i * (i - 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main() {\\n\\n\\t\\n\\t// Farey Sequence\\n\\teuler_phi2();\\n\\tanswer[1] = 2;\\n\\tfor (long long i = 2; i < MAX_N; i++) {\\n\\t\\tanswer[i] = answer[i - 1] + euler[i];\\n\\t}\\n\\tint T, M;\\n\\tcin >> T;\\n\\tfor (int t = 0; t < T; t++) {\\n\\t\\tcin >> M;\\n\\t\\tcout << answer[M] << endl;\\n\\t}\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 81456,\n \"score_of_the_acc\": -1.1479,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2286_10881475\",\n \"code_snippet\": \"// #pragma GCC target(\\\"avx2\\\")\\n// #pragma GCC optimize(\\\"O3\\\")\\n// #pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll=long long;\\nusing ld=long double;\\nusing pl=pair<ll,ll>;\\nusing vpl=vector<pl>;\\nusing vl=vector<ll>;\\nusing vvl=vector<vl>;\\n\\n#define rep(i,n) for(long long i=0LL;i<n;i++)\\n#define rrep(i,a,b) for(long long i=a;i>=b;i--)\\n#define FOR(i,k,n) for(long long i=k;i<n;i++)\\n#define ALL(v) v.begin(),v.end()\\ntemplate<typename T>ostream&operator<<(ostream& os,vector<T>&v){for(int i = 0;i < int(size(v));i++)os << v[i] << (i+1==int(size(v))?\\\"\\\":\\\" \\\");return os;}\\ntemplate<typename T>istream&operator>>(istream& is,vector<T>&v){for(auto &in : v)is >> in;return is;}\\nll INF = (1LL << 60) - 6846976;\\n/* INF = (1LL << 60) - 6846976*/\\n\\n\\n// #include<atcoder/all> \\n// using namespace atcoder;\\n// using mint = modint998244353;ll mod = 998244353;\\n// // using mint = modint1000000007;ll mod = 1000000007;\\n// //using mint = modint;\\n// using vm = vector<mint>;\\n// using vvm = vector<vm>;\\n// ostream&operator<<(ostream& os,vector<mint>&v){for(int i = 0;i < int(size(v));i++)os << v[i].val() << (i+1==int(size(v))?\\\"\\\":\\\" \\\");return os;}\\n\\n#define LB(A,x) int(lower_bound(ALL(A),x)-A.begin())\\n\\n\\n// vl dx = {1,0,-1,0}, dy = {0,1,0,-1};\\n// vl dx = {1,1,1,0,-1,-1,-1,0},dy={-1,0,1,1,-1,0,1,-1};\\n//----------------------------------------------\\n\\nint main(){\\n ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(15);\\n//==============================================\\n ll T;\\n cin>>T;\\n ll MAX_N=1000009;\\n vector<ll> phi(MAX_N);\\n iota(ALL(phi),0LL);\\n vector<bool> is_prime(MAX_N,1);\\n for(int p=2;p<MAX_N;p++) if(is_prime[p]){\\n phi[p]/=p;\\n phi[p]*=p-1;\\n for(int nx=2*p;nx<=MAX_N;nx+=p){\\n is_prime[nx]=0;\\n phi[nx]/=p;\\n phi[nx]*=p-1;\\n }\\n }\\n\\n rep(i,MAX_N-1) phi[i+1]+=phi[i];\\n\\n while(T--){\\n ll N; cin>>N;\\n cout << phi[N]+1<<endl;\\n\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 11128,\n \"score_of_the_acc\": -0.0142,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2286_9605472\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdint>\\n#include <vector>\\n\\nusing namespace std;\\n\\nint main()\\n{\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\tuint16_t t, i;\\n\\tuint32_t n[10000];\\n\\tcin >> t;\\n\\tfor (i = 0; i != t; ++i) cin >> n[i];\\n\\n\\tvector<uint64_t> ans(1'000'001), ex(1'000'001, 1);\\n\\tans[0] = 0, ans[1] = 2;\\n\\tfor (uint32_t i = 2; i <= 1'000'000; ++i)\\n\\t{\\n\\t\\tans[i] = ans[i - 1] + (i - ex[i]);\\n\\t\\tfor (uint32_t j = i * 2; j <= 1'000'000; j += i)\\n\\t\\t\\tex[j] += i - ex[i];\\n\\t}\\n\\n\\tfor (i = 0; i != t; ++i)\\n\\t\\tcout << ans[n[i]] << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 18660,\n \"score_of_the_acc\": -0.1145,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2286_9415424\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=int64_t;\\n\\n// エラトステネスの篩\\nvector<bool> Erame(vector<vector<int>> &prs,int N) {\\n vector<bool> isprime(N+1, true);\\n prs.resize(N+1);\\n isprime[1] = false;\\n for (int p = 2; p <= N; ++p) {\\n if (!isprime[p]) continue;\\n prs[p].push_back(p);\\n for (int q = p * 2; q <= N; q += p) {\\n isprime[q] = false;\\n prs[q].push_back(p);\\n }\\n }\\n return isprime;\\n}\\n\\n\\n\\nint main() {\\n \\n int m=1000000;\\n vector<vector<int>> prs;\\n vector<bool> pr=Erame(prs,m);\\n \\n //オイラー数追加\\n vector<ll> sphi(m+1);\\n sphi[1]=2;\\n for(int i=2;i<=m;i++){\\n int phi=i;\\n for(int j=0;j<(int)prs[i].size();j++){\\n phi=phi/prs[i][j]*(prs[i][j]-1);\\n }\\n sphi[i]=sphi[i-1]+phi;\\n }\\n //cout << sphi[1000000] << endl;\\n\\n int t,n;\\n cin >> t;\\n for(int k=0;k<t;k++){\\n cin >> n;\\n cout << sphi[n] << endl; \\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 66060,\n \"score_of_the_acc\": -0.8835,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2286_9046612\",\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\\nconst int N = 1000005;\\nbool not_prime[N];\\nll phi[N];\\n\\nvoid make_phi() {\\n not_prime[0] = not_prime[1] = true;\\n for (int i = 1; i < N; ++i) {\\n phi[i] = i;\\n }\\n for (int i = 2; i < N; ++i) {\\n if (!not_prime[i]) {\\n phi[i] = i - 1;\\n for (int j = i + i; j < N; j += i) {\\n not_prime[j] = true;\\n phi[j] -= phi[j] / i;\\n }\\n }\\n }\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n make_phi();\\n for (int i = 1; i < N; ++i) {\\n phi[i] += phi[i - 1];\\n }\\n int q;\\n cin >> q;\\n while (q--) {\\n int n;\\n cin >> n;\\n cout << phi[n]+1 << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 12084,\n \"score_of_the_acc\": -0.0276,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2286_8574655\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#if USE_MP\\n#include <boost/multiprecision/cpp_int.hpp>\\n#endif\\n#include <cassert>\\n#include <cstdio>\\n#include <iostream>\\n#include <iomanip>\\n#include <string>\\n#include <array>\\n#include <vector>\\n#include <list>\\n#include <map>\\n#include <set>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <algorithm>\\n#include <cmath>\\n#include <tuple>\\n#include <bitset>\\n#include <string.h>\\n#include <numeric>\\n#include <random>\\n#if defined _DEBUG\\n//#include \\\"TestCase.h\\\"\\n//#include \\\"Util.h\\\"\\n#endif\\n\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\ntypedef tuple<ll, ll, ll> tlll;\\ntypedef tuple<int, int, int> tiii;\\n\\nusing ai2 = array<int, 2>;\\nusing ai3 = array<int, 3>;\\nusing ai4 = array<int, 4>;\\nusing al2 = array<ll, 2>;\\nusing al3 = array<ll, 3>;\\nusing al4 = array<ll, 4>;\\nusing ad2 = array<double, 2>;\\nusing ad3 = array<double, 3>;\\nusing ad4 = array<double, 4>;\\n\\ninline void Yes(bool upper = false) { cout << (upper ? \\\"YES\\\" : \\\"Yes\\\") << \\\"\\\\n\\\"; }\\ninline void No(bool upper = false) { cout << (upper ? \\\"NO\\\" : \\\"No\\\") << \\\"\\\\n\\\"; }\\n\\ninline ll DivCeil(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -(-nume / deno);\\n\\telse return (nume + deno - 1) / deno;\\n}\\ninline ll DivFloor(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -((-nume + deno - 1) / deno);\\n\\telse return nume / deno;\\n}\\ninline ll DivRound(ll nume, ll deno)\\n{\\n\\tassert(deno != 0);\\n\\tif (deno < 0) { nume = -nume; deno = -deno; }\\n\\tif (nume < 0) return -((-nume + deno / 2) / deno);\\n\\telse return (nume + deno / 2) / deno;\\n}\\n\\ntemplate <typename T, int S>\\nauto MakeVecImpl(queue<int>& size, const T& ini)\\n{\\n\\tif constexpr (S == 1)\\n\\t{\\n\\t\\treturn vector<T>(size.front(), ini);\\n\\t}\\n\\telse\\n\\t{\\n\\t\\tint fsize = size.front();\\n\\t\\tsize.pop();\\n\\t\\treturn vector(fsize, MakeVecImpl<T, S - 1>(size, ini));\\n\\t}\\n}\\n\\ntemplate <typename T, int S>\\nauto MakeVec(const array<int, S>& size, const T ini = T())\\n{\\n\\tqueue<int> qsize;\\n\\tfor (const auto v : size) qsize.push(v);\\n\\treturn MakeVecImpl<T, S>(qsize, ini);\\n}\\nint d4[][2] =\\n{\\n\\t{0,-1},\\n\\t{0,1},\\n\\t{-1,0},\\n\\t{1,0},\\n};\\nint d8[][2] =\\n{\\n\\t{-1,-1},\\n\\t{0,-1},\\n\\t{1,-1},\\n\\n\\t{-1,0},\\n\\t{1,0},\\n\\n\\t{-1,1},\\n\\t{0,1},\\n\\t{1,1},\\n};\\nvector<array<int, 2>> Neighbor4(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\tret.push_back({ y - 1, x });\\n\\tret.push_back({ y + 1, x });\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor6(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tconst int ofs = (y & 1); // 1 - (y & 1); //\\n\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\n\\tret.push_back({ y - 1, x - 1 + ofs });\\n\\tret.push_back({ y - 1, x + ofs });\\n\\n\\tret.push_back({ y + 1, x - 1 + ofs });\\n\\tret.push_back({ y + 1, x + ofs });\\n\\n\\treturn ret;\\n}\\nvector<array<int, 2>> Neighbor8(int y, int x)\\n{\\n\\tvector<array<int, 2>> ret;\\n\\tret.push_back({ y - 1, x - 1 });\\n\\tret.push_back({ y - 1, x });\\n\\tret.push_back({ y - 1, x + 1 });\\n\\n\\tret.push_back({ y, x - 1 });\\n\\tret.push_back({ y, x + 1 });\\n\\n\\tret.push_back({ y + 1, x - 1 });\\n\\tret.push_back({ y + 1, x });\\n\\tret.push_back({ y + 1, x + 1 });\\n\\treturn ret;\\n}\\n\\nvector<int> DecompDigit(ull val)\\n{\\n\\tif (val == 0)\\n\\t\\treturn { 0 };\\n\\n\\tvector<int> ret;\\n\\twhile (val)\\n\\t{\\n\\t\\tret.emplace_back(val % 10);\\n\\t\\tval /= 10;\\n\\t}\\n\\treverse(ret.begin(), ret.end());\\n\\treturn ret;\\n}\\n\\n\\n#define PI 3.14159265358979l\\nlong double R2D = 180 / PI;\\nlong double D2R = PI / 180;\\n\\nstatic const ll Mod = 1000000007;\\nstatic const ll Mod9 = 998244353;// 1000000007;\\nstatic const ll INF64 = 4500000000000000000;// 10000000000000000;\\nstatic const int INF32 = 2000000000;\\n\\nrandom_device rd;\\nmt19937 mt(0);//(rd());\\n#if USE_MP\\nusing mpint = boost::multiprecision::cpp_int;\\n#endif\\n\\nconst double EPS = 1e-10;\\n\\nvector<bool> isPrime;\\t\\t// 素数\\nvector<int> prime;\\t\\t\\t// 素数\\nvector<int> minPF;\\t\\t\\t// 約数である最小の素数\\nvector<int> phi;\\t\\t\\t// オイラーのφ関数\\nvector<int> mobius;\\t\\t\\t// メビウス関数\\nvector<ll> phiSum{ 0 };\\nvoid Eratosthenes(int SIZE=1e6)\\n{\\n\\tisPrime.resize(SIZE, true);\\n\\tminPF.resize(SIZE); iota(minPF.begin(), minPF.end(), 0);\\n\\tphi.resize(SIZE); iota(phi.begin(), phi.end(), 0);\\n\\tmobius.resize(SIZE, 1);\\n\\n\\tisPrime[0] = isPrime[1] = false;\\n\\n\\t// 素因数\\n\\tfor (int i = 2; i < SIZE; i++) {\\n\\t\\tif (!isPrime[i]) continue;\\n\\t\\tprime.emplace_back(i);\\n\\t\\tfor (int j = i + i; j < SIZE; j += i) {\\n\\t\\t\\tisPrime[j] = false;\\n\\t\\t\\tminPF[j] = min(minPF[j], i);\\n\\t\\t}\\n\\t}\\n\\n\\t// φ関数\\n\\tfor (int i = 1; i < SIZE; i++) {\\n\\t\\tfor (int j = i + i; j < SIZE; j += i) {\\n\\t\\t\\tphi[j] -= phi[i];\\n\\t\\t}\\n\\t\\tphiSum.emplace_back(phiSum.back() + phi[i]);\\n\\t}\\n\\n\\t// メビウス関数\\n\\tfor (int i = 2; i < SIZE; i++) {\\n\\t\\tif (!isPrime[i]) continue;\\n\\t\\tmobius[i] = -1;\\n\\t\\tfor (int j = i + i; j < SIZE; j += i) {\\n\\t\\t\\tif ((j / i) % i == 0) mobius[j] = 0;\\n\\t\\t\\telse mobius[j] = -mobius[j];\\n\\t\\t}\\n\\t}\\n}\\n\\n// 高速ゼータ変換\\nvoid FastZeta(vector<ll>& X) {\\n\\tint N = X.size();\\n\\tif (isPrime.size() < N)\\n\\t\\tEratosthenes(N);\\n\\n\\tfor (auto p : prime) {\\n\\t\\tif (p >= N) break;\\n\\n\\t\\tfor (int i = (N - 1) / p; i >= 1; i--) {\\n\\t\\t\\tX[i] += X[i*p];\\n\\t\\t}\\n\\t}\\n}\\n\\n// 高速メビウス変換\\nvoid FastMobius(vector<ll>& X) {\\n\\tint N = X.size();\\n\\tif (isPrime.size() < N)\\n\\t\\tEratosthenes(N);\\n\\t\\n\\tfor (auto p : prime) {\\n\\t\\tif (p >= N) break;\\n\\n\\t\\tfor (int i = 1; i * p <= N - 1; i++) {\\n\\t\\t\\tX[i] -= X[i * p];\\n\\t\\t}\\n\\t}\\n}\\n\\nint EulerPhi(int N) {\\n\\tint phi = N;\\n\\tfor (int i = 2; i * i <= N; i++) {\\n\\t\\tif (N % i) continue;\\n\\t\\tphi = phi / i * (i - 1);\\n\\t\\twhile ((N % i) == 0) N /= i;\\n\\t}\\n\\tif (N > 1)\\n\\t\\tphi = phi / N * (N - 1);\\n\\treturn phi;\\n}\\nstruct Solver\\n{\\n\\tvoid Run()\\n\\t{\\n\\t\\tint N;\\n\\t\\tcin >> N;\\n\\t\\tcout << 1+phiSum[N] << \\\"\\\\n\\\";\\n\\t}\\n};\\n\\nint main()\\n{\\n\\tstd::cin.tie(nullptr); //★インタラクティブ注意★\\n\\tstd::ios_base::sync_with_stdio(false);\\n\\tint T = 1;\\n\\tEratosthenes(1000010);\\n\\n\\tcin >> T;\\n\\twhile (T--)\\n\\t{\\n\\t\\tSolver S;\\n\\t\\tS.Run();\\n\\t}\\n\\n\\treturn 0;\\n}\\n\\n/// 値渡しになっていないか?\\n/// 入力を全部読んでいるか? 途中でreturnしない\\n/// 32bitで収まるか? 10^5数えるとき\\n/// modは正しいか?\\n/// multisetでcountしていないか?\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 23736,\n \"score_of_the_acc\": -0.1979,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2286_7850625\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vl = vector<ll>;\\nusing vvl = vector<vl>;\\nusing pl = pair<ll,ll>;\\nusing vp = vector<pl>;\\n#define rep(i,n) for(ll i=0;i<(ll)(n);++i)\\n#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)\\n#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)\\ntemplate<typename T>inline bool chmax(T &a,T b){return a<b?a=b,true:false;}\\ntemplate<typename T>inline bool chmin(T &a,T b){return a>b?a=b,true:false;}\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define eb emplace_back\\n#define be(v) (v).begin(),(v).end()\\nconst long long INF = 1e18;\\n#ifdef DEBUG\\n#include <debug.hpp>\\n#endif\\n\\n\\n// エラトステネスの篩\\nstruct Eratosthenes {\\n\\tvector<bool> isprime;\\n\\tvector<ll> minfactor;\\n\\tEratosthenes(ll N) : isprime(N+1, true),\\n\\t\\t\\t\\t\\t\\t\\tminfactor(N+1, -1) {\\n\\t\\tisprime[1] = false;\\n\\t\\tminfactor[1] = 1;\\n\\t\\tfor (ll p = 2; p <= N; ++p) {\\n\\t\\t\\tif (!isprime[p]) continue;\\n\\t\\t\\tminfactor[p] = p;\\n\\t\\t\\tfor (ll q = p * 2; q <= N; q += p) {\\n\\t\\t\\t\\tisprime[q] = false;\\n\\t\\t\\t\\tif (minfactor[q] == -1) minfactor[q] = p;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<pair<ll,ll>> factorize(ll n) {\\n\\t\\tvector<pair<ll,ll>> res;\\n\\t\\twhile (n > 1) {\\n\\t\\t\\tll p = minfactor[n];\\n\\t\\t\\tll exp = 0;\\n\\t\\t\\twhile (minfactor[n] == p) {\\n\\t\\t\\t\\tn /= p;\\n\\t\\t\\t\\t++exp;\\n\\t\\t\\t}\\n\\t\\t\\tres.emplace_back(p, exp);\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\t// 高速約数列挙\\n\\tvector<ll> divisors(ll n) {\\n\\t\\tvector<ll> res({1});\\n\\t\\tauto pf = factorize(n);\\n\\t\\tfor (auto p : pf) {\\n\\t\\t\\tll s = (ll)res.size();\\n\\t\\t\\tfor (ll i = 0; i < s; ++i) {\\n\\t\\t\\t\\tll v = 1;\\n\\t\\t\\t\\tfor (ll j = 0; j < p.second; ++j) {\\n\\t\\t\\t\\t\\tv *= p.first;\\n\\t\\t\\t\\t\\tres.push_back(res[i] * v);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n};\\nll solve(){\\n\\t#ifdef DEBUG\\n\\tcout << \\\"--- Input ---\\\" << endl;\\n\\t#endif\\n\\tll N=1000000;\\n\\tEratosthenes er(N);\\n\\tvl euler(N+1);\\n\\trep(n,N+1){\\n\\t\\tvp p=er.factorize(n);\\n\\t\\teuler.at(n)=n;\\n\\t\\tfor(auto e:p){\\n\\t\\t\\teuler.at(n) *= e.fi-1;\\n\\t\\t\\teuler.at(n) /= e.fi;\\n\\t\\t}\\n\\t}\\n\\tvl sum(N+2);\\n\\trep(n,N+1){\\n\\t\\tsum.at(n)+=euler.at(n);\\n\\t\\tsum.at(n+1)+=sum.at(n);\\n\\t}\\n\\t#ifdef DEBUG\\n\\tcout<<\\\"N=\\\"<<N<<endl;\\n\\trep(i,100){\\n\\t\\tcout<<\\\"i=\\\"<<i<<\\\" \\\"<<euler.at(i)<<\\\" \\\"<<sum.at(i)<<endl;\\n\\t}\\n\\tcout << \\\"--- Logic ---\\\" << endl;\\n\\t#endif\\n\\tll Q;cin>>Q;\\n\\trep(qi,Q){\\n\\t\\tll n; cin>>n;\\n\\t\\tcout<<sum.at(n)+1<<endl;\\n\\t}\\n\\t#ifdef DEBUG\\n\\tcout << \\\"--- Answer ---\\\" << endl;\\n\\t#endif\\n\\treturn true;\\n}\\nint main(){\\n\\t#ifdef DEBUG\\n\\tcout << \\\"--- Main ---\\\" << endl;\\n\\t#endif\\n\\tsolve();\\n\\t//while(solve());\\n\\treturn 0;\\n}\\n//cout << fixed << setprecision(9);\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 26372,\n \"score_of_the_acc\": -0.2765,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2286_7589131\",\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 = 100000000;\\nconst long long LINF = 3e18 + 7;\\nconst int MAX_N = 1000010;\\nconst int MAX_W = 10002;\\nconst int MAX_ARRAYK = 100000;\\ndouble PI = 3.14159265358979323846;\\n//using ll = long long;\\n\\n\\nlong long euler[MAX_N];\\nlong long answer[MAX_N];\\nvoid euler_phi2() {\\n\\tfor (long long i = 0; i < MAX_N; i++) {\\n\\t\\teuler[i] = i;\\n\\t}\\n\\tfor (long long i = 2; i < MAX_N; i++) {\\n\\t\\tif (euler[i] == i) {\\n\\t\\t\\tfor (long long j = i; j < MAX_N; j += i) {\\n\\t\\t\\t\\teuler[j] = euler[j] / i * (i - 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\n\\t// Farey Sequence\\n\\teuler_phi2();\\n\\tanswer[1] = 2;\\n\\tfor (long long i = 2; i < MAX_N; i++) {\\n\\t\\tanswer[i] = answer[i - 1] + euler[i];\\n\\t}\\n\\tint T, M;\\n\\tcin >> T;\\n\\tfor (int t = 0; t < T; t++) {\\n\\t\\tcin >> M;\\n\\t\\tcout << answer[M] << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 18740,\n \"score_of_the_acc\": -0.1274,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2286_7578208\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n#define rep(i,n) for(int i=0;i<n;++i)\\n#define rep1(i,n) for(int i=1;i<=n;++i)\\n#define reps(i,a,b) for(int i=a;i<b;++i)\\n#define mod 998244353\\n#define endl '\\\\n'\\n#define AC ios_base::sync_with_stdio(false);cin.tie(0);\\n#define INF 10e17\\n\\nint cnt[(int)10e6];\\n\\nvoid del(int pos){\\n for(int i=pos*2;i<=10e6;i+=pos){\\n cnt[i]-=cnt[pos];\\n }\\n}\\n\\nsigned main(){\\n cnt[0]=0;\\n rep1(i,(int)10e6)cnt[i]=i+1;\\n rep1(i,(int)10e6)del(i);\\n //累積和をとる\\n rep1(i,(int)10e6)cnt[i]+=cnt[i-1];\\n int t;\\n cin>>t;\\n rep(i,t){\\n int n;\\n cin>>n;\\n cout<<cnt[n]<<endl;\\n }\\n\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1700,\n \"memory_kb\": 81136,\n \"score_of_the_acc\": -1.9955,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2286_7576282\",\n \"code_snippet\": \"#define PROBLEM \\\"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2286\\\"\\n\\n#include <bits/stdc++.h>\\n\\ntemplate <class T> struct CumulativeSum {\\n std::vector<T> seg;\\n int n;\\n\\n CumulativeSum(int n) : n(n), seg(n + 1, 0) {}\\n CumulativeSum(std::vector<T> &A) {\\n n = (int)A.size();\\n seg.assign(n + 1, T(0));\\n for (int i = 0; i < n; i++) seg[i + 1] = seg[i] + A[i];\\n }\\n\\n // [l, r)\\n T sum(int l, int r) const {\\n assert(0 <= l and l <= r and r <= n);\\n return seg[r] - seg[l];\\n }\\n\\n // A[p] = x\\n void set(int p, T x) {\\n assert(0 <= p and p < n);\\n seg[p + 1] = x;\\n }\\n\\n // A[p] += x\\n void add(int p, T x) {\\n assert(0 <= p and p < n);\\n seg[p + 1] += x;\\n }\\n\\n // A[l] += x, A[l + 1] += x, ... , A[r - 1] += x\\n void imos(int l, int r, T x = T(1)) {\\n add(l, x);\\n add(r, -x);\\n }\\n\\n void build() {\\n for (int i = 0; i < n; i++) seg[i + 1] += seg[i];\\n }\\n\\n T operator[](int p) const {\\n assert(0 <= p and p < n);\\n return seg[p + 1];\\n }\\n\\n // output\\n friend std::ostream &operator<<(std::ostream &os, const CumulativeSum &A) {\\n for (int i = 0; i <= A.n; i++) os << A.seg[i] << \\\" \\\\n\\\"[i == A.n];\\n return os;\\n }\\n};\\n\\nstd::vector<int> totient_table(int n) {\\n std::vector<int> res(n + 1);\\n std::iota(res.begin(), res.end(), 0);\\n for (int p = 2; p <= n; p++) {\\n if (res[p] != p) continue;\\n for (int i = p; i <= n; i += p) {\\n res[i] /= p;\\n res[i] *= p - 1;\\n }\\n }\\n return res;\\n}\\n\\nint main() {\\n auto ttt = totient_table(1000000);\\n std::vector<long long> tl(ttt.size());\\n for (int i = 0; i < (int)ttt.size(); i++) tl[i] = ttt[i];\\n CumulativeSum<long long> rui(tl);\\n int tt;\\n std::cin >> tt;\\n while (tt--) {\\n int n;\\n std::cin >> n;\\n std::cout << rui.sum(0, n + 1) + 1 << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 22296,\n \"score_of_the_acc\": -0.1657,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2286_7475843\",\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 = 100000000;\\nconst long long LINF = 3e18 + 7;\\nconst int MAX_N = 1000010;\\nconst int MAX_W = 10002;\\nconst int MAX_ARRAYK = 100000;\\ndouble PI = 3.14159265358979323846;\\n//using ll = long long;\\n\\n\\nlong long prime[MAX_N];\\nbool is_prime[MAX_N];\\n\\nlong long sieve(long long n) {\\n\\tlong long p = 0;\\n\\tfor (long long i = 0; i <= n; i++) {\\n\\t\\tis_prime[i] = true;\\n\\t}\\n\\tis_prime[0] = is_prime[1] = false;\\n\\tfor (long long i = 2; i <= n; i++) {\\n\\t\\tif (is_prime[i]) {\\n\\t\\t\\tprime[p++] = i;\\n\\t\\t\\tfor (long long j = 2 * i; j <= n; j += i) {\\n\\t\\t\\t\\tis_prime[j] = false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn p;\\n}\\n\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2286\\n// https://ncastar.hatenablog.com/entry/20140320/1395323746\\n// https://qiita.com/hidekikangeki/items/e2524f199ae1d483f060\\n// 包除原理、オイラーのφ関数\\n// https://nanikaka.hatenadiary.org/entry/20111224/1324690802\\n\\nlong long euler[MAX_N];\\nlong long answer[MAX_N];\\nvoid euler_phi2() {\\n\\tfor (long long i = 0; i < MAX_N; i++) {\\n\\t\\teuler[i] = i;\\n\\t}\\n\\tfor (long long i = 2; i < MAX_N; i++) {\\n\\t\\tif (euler[i] == i) {\\n\\t\\t\\tfor (long long j = i; j < MAX_N; j += i) {\\n\\t\\t\\t\\teuler[j] = euler[j] / i * (i - 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\n\\t//long long N = sieve(100);\\n\\t//cout << N << endl;\\n\\t//for (long long i = 0; i < N; i++) {\\n\\t//\\tcout << prime[i] << \\\" \\\";\\n\\t//}\\n\\t//cout << endl;\\n\\n\\teuler_phi2();\\n\\tanswer[1] = 2;\\n\\tfor (long long i = 2; i < MAX_N; i++) {\\n\\t\\tanswer[i] = answer[i - 1] + euler[i];\\n\\t}\\n\\tint T, M;\\n\\tcin >> T;\\n\\tfor (int t = 0; t < T;t++) {\\n\\t\\tcin >> M;\\n\\t\\tcout << answer[M] << endl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 18600,\n \"score_of_the_acc\": -0.1314,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2286_7372499\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing i32 = int;\\n\\ni32 main() {\\n\\ti32 size = 1000000;\\n\\tvector ps(size + 1, 0LL);\\n\\tfor (i32 i = 0 ; i < size + 1 ; i++) {\\n\\t\\tps[i] = i;\\n\\t}\\n\\tfor (i32 i = 1 ; i < size + 1 ; i++) {\\n\\t\\tfor (i32 j = i * 2 ; j < size + 1 ; j += i) {\\n\\t\\t\\tps[j] -= ps[i];\\n\\t\\t}\\n\\t}\\n\\tvector s = { 0LL };\\n\\tpartial_sum(ps.begin(), ps.end(), back_inserter(s));\\n\\ti32 t; cin >> t;\\n\\tfor (i32 _ = 0 ; _ < t ; _++) {\\n\\t\\ti32 n; cin >> n;\\n\\t\\tcout << s.at(n + 1) + 1 << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 18820,\n \"score_of_the_acc\": -0.1285,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2286_7277890\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing C = complex<double>;\\nconst int mod = 998244353;\\nconst long long LINF = 1001002003004005006;\\nconst int INF = 1001001001;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-10;\\nconst int di[4] = {-1,0,1,0};\\nconst int dj[4] = {0,-1,0,1};\\nconst int dx[8] = {1,1,1,0,0,-1,-1,-1};\\nconst int dy[8] = {1,0,-1,1,-1,1,0,-1};\\n# define sz(x) (int)(x).size()\\n# define rsz(x,n) x.resize(n)\\n# define yosupo(x) {cout << (x) << endl; return 0;}\\n# define ll long long\\n# define fi first\\n# define se second\\n# define pb push_back\\n# define pf push_front\\n# define eb emplace_back\\n# define ef emplace_front\\n# define pob pop_back\\n# define pof pop_front\\n# define GET_MACRO(_1, _2, _3, NAME, ...) NAME\\n# define _rep(i, n) _rep2(i, 0, n)\\n# define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\\n# define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)\\n# define srep(i, a, b) for(int i = a; i <= b; ++i)\\n# define all(obj) (obj).begin(), (obj).end()\\n# define rall(obj) (obj).rbegin(), (obj).rend()\\ninline void YesNo(bool f) { std::cout << (f? \\\"Yes\\\": \\\"No\\\") << std::endl; }\\nvoid read() {}\\ntemplate <typename T, class... U> void read(T &t, U &...u) { cin >> t; read(u...); }\\nvoid writeln() { cout << endl; }\\ntemplate <typename T, class... U, char sep = ' '> void writeln(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; writeln(u...); }\\n# define Pll pair<ll, ll>\\n# define P pair<int,int>\\n# define bit(x,i) (((x) >> (i)) & 1)\\n# define equals(a, b) (fabs((a) - (b)) < EPS) // 誤差を考慮した同値判定\\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<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}\\ntemplate<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\\ntemplate <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { return os << \\\"P(\\\" << p.first << \\\" \\\" << p.second << \\\")\\\";}\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\nusing vi = vc<int>; using vvi = vv<int>;\\nusing vl = vc<ll>; using vvl = vv<ll>;\\n\\n#define MAX_N 1000100\\n\\nll euler[MAX_N], ans[MAX_N];\\n\\nvoid euler_phi2() {\\n rep(i,MAX_N) euler[i] = i;\\n rep(i,2,MAX_N) {\\n if(euler[i] == i) {\\n for(int j = i; j < MAX_N; j+=i) euler[j] = euler[j]*(i-1)/i;\\n }\\n }\\n}\\n\\nint main() {\\n euler_phi2();\\n int t;\\n scanf(\\\"%d\\\",&t);\\n ans[1] = 2;\\n rep(i,1,MAX_N-1) ans[i+1] = ans[i]+euler[i+1];\\n rep(ti,t) {\\n int n;\\n scanf(\\\"%d\\\",&n);\\n cout << ans[n] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 18832,\n \"score_of_the_acc\": -0.1228,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2286_7277883\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing C = complex<double>;\\nconst int mod = 998244353;\\nconst long long LINF = 1001002003004005006;\\nconst int INF = 1001001001;\\nconst double PI = acos(-1);\\nconst double EPS = 1e-10;\\nconst int di[4] = {-1,0,1,0};\\nconst int dj[4] = {0,-1,0,1};\\nconst int dx[8] = {1,1,1,0,0,-1,-1,-1};\\nconst int dy[8] = {1,0,-1,1,-1,1,0,-1};\\n# define sz(x) (int)(x).size()\\n# define rsz(x,n) x.resize(n)\\n# define yosupo(x) {cout << (x) << endl; return 0;}\\n# define ll long long\\n# define fi first\\n# define se second\\n# define pb push_back\\n# define pf push_front\\n# define eb emplace_back\\n# define ef emplace_front\\n# define pob pop_back\\n# define pof pop_front\\n# define GET_MACRO(_1, _2, _3, NAME, ...) NAME\\n# define _rep(i, n) _rep2(i, 0, n)\\n# define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\\n# define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)\\n# define srep(i, a, b) for(int i = a; i <= b; ++i)\\n# define all(obj) (obj).begin(), (obj).end()\\n# define rall(obj) (obj).rbegin(), (obj).rend()\\ninline void YesNo(bool f) { std::cout << (f? \\\"Yes\\\": \\\"No\\\") << std::endl; }\\nvoid read() {}\\ntemplate <typename T, class... U> void read(T &t, U &...u) { cin >> t; read(u...); }\\nvoid writeln() { cout << endl; }\\ntemplate <typename T, class... U, char sep = ' '> void writeln(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; writeln(u...); }\\n# define Pll pair<ll, ll>\\n# define P pair<int,int>\\n# define bit(x,i) (((x) >> (i)) & 1)\\n# define equals(a, b) (fabs((a) - (b)) < EPS) // 誤差を考慮した同値判定\\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<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}\\ntemplate<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\\ntemplate <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { return os << \\\"P(\\\" << p.first << \\\" \\\" << p.second << \\\")\\\";}\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\nusing vi = vc<int>; using vvi = vv<int>;\\nusing vl = vc<ll>; using vvl = vv<ll>;\\n\\n#define MAX_N 1000100\\n\\nll euler[MAX_N], ans[MAX_N];\\n\\nvoid euler_Phi() {\\n rep(i,MAX_N) euler[i] = i;\\n rep(i,2,MAX_N) {\\n if(euler[i] == i) {\\n for(int j = i; j < MAX_N; j+=i) euler[j] = euler[j]*(i-1)/i;\\n }\\n }\\n}\\n\\nint main() {\\n euler_Phi();\\n int t;\\n scanf(\\\"%d\\\",&t);\\n ans[1] = 2;\\n rep(i,1,MAX_N-1) ans[i+1] = ans[i]+euler[i+1];\\n rep(ti,t) {\\n int n;\\n scanf(\\\"%d\\\",&n);\\n cout << ans[n] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 18888,\n \"score_of_the_acc\": -0.1236,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2286_7044807\",\n \"code_snippet\": \"// 2021.12.2\\n// #define _GLIBCXX_DEBUG\\n// #define __USE_MATH_DEFINES // const double PI = acos(-1.0)\\n#include <bits/stdc++.h>\\nusing namespace std;\\n// (*) snipet\\n// type name\\nusing ll = long long;\\nusing pii = pair<int, int>; using pil = pair<int, ll>; using pli = pair<ll, int>; using pll = pair<ll, ll>;\\nusing vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;\\nusing vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;\\nusing vpii = vector<pii>; using vpil = vector<pil>; using vpli = vector<pli>; using vpll = vector<pll>;\\nusing vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;\\nusing vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;\\ntemplate <typename T> using pq = priority_queue<T, vector<T>>;\\ntemplate <typename T> using pql = priority_queue<T, vector<T>, greater<T>>;\\n// rep\\n#define rep0(goal) for (int cnt = 0; cnt < int(goal); ++cnt)\\n#define rep(cnt, goal) for (int cnt = 0; cnt < int(goal); ++cnt)\\n#define rep2(cnt, start, goal) for (int cnt = int(start); cnt < int(goal); ++cnt)\\n#define rep3(cnt, start, goal) for (int cnt = int(start); cnt > int(goal); --cnt)\\n// all\\n#define all(ctn) begin(ctn), end(ctn)\\n// chmax, chmin\\ntemplate <typename T> bool chmax(T &x, const T y) { if (x < y) { x = y; return true; } else { return false; }}\\ntemplate <typename T> bool chmin(T &x, const T y) { if (x > y) { x = y; return true; } else { return false; }}\\n// etc.\\nvoid Yn(const bool &exp) { if (exp) cout << \\\"Yes\\\" << endl; else cout << \\\"No\\\" << endl;}\\nvoid set_prec(const int &dig) { cout << fixed << setprecision(dig); cerr << fixed << setprecision(dig);}\\n// template <typename T> T INF() { return numeric_limits<T>::max();}\\n// template <typename T> T MIN_INF() { return numeric_limits<T>::min();}\\n\\n// #include <atcoder/all>\\n// using namespace atcoder;\\n// using mint = atcoder::modint1000000007;\\n// using mint = atcoder::modint998244353;\\n// // using mint = atcoder::modint;\\n// void pr(const mint &MINT) { cerr << MINT.val(); } // mint\\n// using pmm = pair<mint, mint>; using pim = pair<int, mint>; using pmi = pair<mint, int>; using plm = pair<ll, mint>; using pml = pair<mint, ll>;\\n// using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\\n\\n// debug\\ntemplate <typename T> void pr(const T &obj) { cerr << obj; } // single\\ntemplate <typename T, typename ...Ts> void pr(const T &first, const Ts &...rest) { pr(first); cerr << \\\", \\\"; pr(rest...); } // multi(plural)\\ntemplate <typename S, typename T> void pr(const pair<S, T> &PAIR) { cerr << \\\"(\\\"; pr(PAIR.first); cerr << \\\", \\\"; pr(PAIR.second); cerr << \\\")\\\"; } // pair\\ntemplate <typename S, typename T, typename U> void pr(const tuple<S, T, U> &trp) { cerr << \\\"(\\\"; pr(get<0>(trp)); cerr << \\\", \\\"; pr(get<1>(trp)); cerr << \\\", \\\"; pr(get<2>(trp)); cerr << \\\")\\\"; } // tuple(3)\\ntemplate <typename T> void pr(const vector<T> &vec) { cerr << \\\"{\\\"; for (T obj : vec) { pr(obj); cerr << \\\", \\\"; } cerr << \\\"}\\\"; } // vector\\ntemplate <typename T> void pr(const vector<vector<T>> &vv) { rep(row, vv.size()) { cerr << endl; cerr << \\\"[\\\" << row << \\\"]: \\\"; pr(vv[row]); }} // vector(multi-D)\\ntemplate <typename T> void pr(const set<T> &SET) { cerr << \\\"{\\\"; for (T obj : SET) { pr(obj); cerr << \\\", \\\"; } cerr << \\\"}\\\"; } // set\\ntemplate <typename T> void pr(const multiset<T> &MS) { cerr << \\\"{\\\"; for (T obj : MS) { pr(obj); cerr << \\\", \\\"; } cerr << \\\"}\\\"; } // multiset\\ntemplate <typename S, typename T> void pr(const map<S, T> &MAP) { cerr << \\\"{\\\"; for (pair<S, T> p : MAP) { pr(p.first); cerr << \\\": \\\"; pr(p.second); cerr << \\\", \\\"; } cerr << \\\"}\\\";} // map\\ntemplate <typename T> void pr(const queue<T> &que) { queue<T> q = que; cerr << \\\"{\\\"; while (!q.empty()) { pr(q.front()); q.pop(); cerr << \\\", \\\";} cerr << \\\"}\\\";} // queue\\ntemplate <typename T> void pr(const deque<T> &deq) { deque<T> d = deq; cerr << \\\"{\\\"; while (!d.empty()) { pr(d.front()); d.pop_front(); cerr << \\\", \\\";} cerr << \\\"}\\\";} // deque\\ntemplate <typename T> void pr(const stack<T> &stc) { stack<T> s = stc; vector<T> v; while (!s.empty()) { v.push_back(s.top()); s.pop();} reverse(all(v)); cerr << \\\"{\\\"; for (T obj : v) cerr << obj << \\\", \\\"; cerr << \\\"}\\\";} // stack\\ntemplate <typename T> void pr(const priority_queue<T> &pq) { priority_queue<T> p = pq; cerr << \\\"{\\\"; while (!p.empty()) { pr(p.top()); p.pop(); cerr << \\\", \\\"; } cerr << \\\"}\\\";} // priority_queue\\ntemplate <typename T> void pr(const priority_queue<T, vector<T>, greater<T>> &pq) { priority_queue<T, vector<T>, greater<T>> p = pq; cerr << \\\"{\\\"; while (!p.empty()) { pr(p.top()); p.pop(); cerr << \\\", \\\";} cerr << \\\"}\\\";} // priority_queue(from less)\\n\\n#define db(obj) cerr << #obj << \\\": \\\"; pr(obj); cerr << \\\" \\\";\\n#define dl(obj) db(obj); cerr << endl;\\n#define dm(...) cerr << \\\"(\\\" << #__VA_ARGS__ << \\\"): (\\\"; pr(__VA_ARGS__); cerr << \\\") \\\";\\n#define dml(...) dm(__VA_ARGS__); cerr << endl;\\n\\n\\n// global\\nint t;\\nvi n;\\n\\nvl a, b;\\nconst int MAX_n = 1000000;\\n\\nvoid input() {\\n\\tcin >> t;\\n\\tn = vi(t);\\n\\trep(i, t) cin >> n[i];\\n}\\n\\nvoid init() {\\n\\tinput();\\n\\ta = vl(MAX_n + 1);\\n\\tb = vl(MAX_n + 2);\\n}\\n\\nvector<pair<ll, int>> prime_factorization(ll N) {\\n\\tassert(1 <= N);\\n\\tvector<pair<ll, int>> res;\\n\\tfor (ll p = 2; p * p <= N; ++ p) if (N % p == 0) {\\n\\t\\tint d = 0;\\n\\t\\tfor (; N % p == 0; N /= p) ++d;\\n\\t\\tres.push_back(make_pair(p, d));\\n\\t}\\n\\tif (N > 1) res.push_back(make_pair(N, 1));\\n\\treturn res;\\n}\\n\\n// オイラーのφ関数\\nll phi(ll N) {\\n\\tfor (auto &[p, d] : prime_factorization(N)) N = N / p * (p - 1);\\n\\treturn N;\\n}\\n\\nll sub_solve(ll N) {\\n\\tll res = 1;\\n\\trep2(k, 1, N + 1) res += phi(k);\\n\\treturn res;\\n}\\n\\nvoid solve() {\\n\\ta[0] = 1;\\n\\trep2(N, 1, MAX_n + 1) a[N] = phi(N);\\n\\trep(N, MAX_n + 1) b[N + 1] = b[N] + a[N];\\n\\t// dl(a); dl(b); //\\n\\trep(i, t) cout << b[n[i] + 1] << endl;\\n}\\n\\nvoid test() {\\n}\\n\\nint main() {\\n\\tinit();\\n\\t// test(); //\\n\\tsolve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1180,\n \"memory_kb\": 18668,\n \"score_of_the_acc\": -0.8069,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2286_7029406\",\n \"code_snippet\": \"#include <iostream>\\n#include <sstream>\\n#include <vector>\\n#include <map>\\n#include <algorithm>\\n#include <set>\\n#include <stack>\\n#include <queue>\\n#include <cmath>\\n#include <iomanip>\\n#include <numeric>\\n#include <string>\\n#include <bitset>\\n#include <assert.h>\\n#include <functional>\\n\\n// #define _GLIBCXX_DEBUG\\n// #define _LIBCPP_DEBUG 0\\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\\n#define revrep(i, n) for(int i = (int)(n - 1); i >= 0; --i)\\n#define range(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define revrange(i, s, t) for(int i = (int)(t - 1); i >= (int)(s); --i)\\n#define srange(i, s, t, step) for(int i = (int)(s); i < (int)(t); i += (int)(step))\\n#define popcnt(x) __builtin_popcountll(x)\\n#define hayai std::ios::sync_with_stdio(false);std::cin.tie(nullptr)\\n#define SORT(x) sort(x.begin(), x.end())\\n#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())\\n\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<long long, 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; }\\ninline bool inside(int x, int y, int h, int w) { return (x >= 0 && x < h && y >= 0 && y < w); }\\nint dx[] = {0, -1, 0, 1};\\nint dy[] = {-1, 0, 1, 0};\\n\\n\\n\\n//https://qiita.com/drken/items/3beb679e54266f20ab63\\nstruct Erastothenes {\\n vector<bool> is_prime; \\n vector<int> min_factor; \\n vector<int> moebius; \\n Erastothenes(int n): is_prime(n + 1, true),\\n min_factor(n + 1, -1),\\n moebius(n + 1, 1) {\\n is_prime[1] = false;\\n min_factor[1] = 1;\\n\\n for(int p = 2; p <= n; ++p) {\\n if (!is_prime[p]) continue;\\n min_factor[p] = p;\\n moebius[p] = -1;\\n for(int q = p + p; q <= n; q += p) {\\n is_prime[q] = false;\\n if (min_factor[q] == -1) min_factor[q] = p;\\n if ((q / p) % p == 0) moebius[q] = 0;\\n else moebius[q] = -moebius[q];\\n }\\n }\\n }\\n};\\n\\n\\nconst int NMAX = 1e6+1;\\nll farey_size[NMAX];\\n\\nvoid pre_calc() {\\n Erastothenes sieve(NMAX);\\n range(i, 1, NMAX) {\\n srange(j, i, NMAX, i) {\\n farey_size[j] += sieve.moebius[i] * (j / i);\\n }\\n }\\n farey_size[1] = 2;\\n range(i, 2, NMAX) farey_size[i] += farey_size[i-1];\\n}\\n\\n\\nint main() {\\n hayai; pre_calc();\\n int n;\\n cin >> n;\\n rep(i, n) {\\n int k;\\n cin >> k;\\n cout << farey_size[k] << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 18572,\n \"score_of_the_acc\": -0.1369,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2286_6985267\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nll Euler_Phi_Function(ll v){\\n ll ans=v,v2=v;\\n if(v2%2==0){ans-=ans/2;while(v2%2==0)v2/=2;}\\n if(v2%3==0){ans-=ans/3;while(v2%3==0)v2/=3;}\\n for(ll i=5;i*i<=v2;i+=4){\\n if(v2%i==0){ans-=ans/i;while(v2%i==0)v2/=i;}\\n i+=2;\\n if(v2%i==0){ans-=ans/i;while(v2%i==0)v2/=i;}\\n }\\n if(v2!=1)ans-=ans/v2;\\n return ans;\\n}\\n\\nint main(){\\n vector<ll> tb(1000001);\\n tb[1] = 2;\\n for(int i = 2; i <= 1000000; i++){\\n tb[i] = tb[i - 1] + Euler_Phi_Function(i);\\n }\\n int T, v;\\n cin >> T;\\n while(T--){\\n cin >> v;\\n cout << tb[v] << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 10544,\n \"score_of_the_acc\": -0.2249,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2286_6976894\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\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\\n#define INF (1LL << 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// 幅優先の例\\n// 入力: グラフ G と，探索の始点 s\\n// 出力: s から各頂点への最短路長を表す配列\\nvector<int> BFS(const Graph &G, int s)\\n{\\n int N = (int)G.size(); // 頂点数\\n // vector<bool> seen(N, false);\\n vector<int> dist(N, -1); // 全頂点を「未訪問」に初期化\\n queue<int> que;\\n\\n dist[s] = 0;\\n que.push(s);\\n\\n while (!que.empty())\\n {\\n int v = que.front();\\n que.pop();\\n\\n for (int x : G[v])\\n {\\n if (dist[x] != -1)\\n continue;\\n\\n dist[x] = dist[v] + 1;\\n que.push(x);\\n }\\n }\\n return dist;\\n}\\n\\n// エラトステネスの篩\\nstruct Eratosthenes\\n{\\n // テーブル\\n vector<bool> isprime;\\n\\n // 整数 i を割り切る最小の素数\\n vector<int> minfactor;\\n\\n // メビウス関数値\\n // * μ(1)=1\\n // * nがある素数pで2回以上割り切れるとき、μ(n)=0\\n // * n=p1×p2×…pkと素因数分解できるとき、μ(n)=(−1)^K\\n vector<int> mobius;\\n\\n // コンストラクタで篩を回す\\n Eratosthenes(int N) : isprime(N + 1, true),\\n minfactor(N + 1, -1),\\n mobius(N + 1, 1)\\n {\\n // 1 は予めふるい落としておく\\n isprime[1] = false;\\n minfactor[1] = 1;\\n\\n // 篩\\n for (int p = 2; p <= N; ++p)\\n {\\n // すでに合成数であるものはスキップする\\n if (!isprime[p])\\n continue;\\n\\n // p についての情報更新\\n minfactor[p] = p;\\n mobius[p] = -1;\\n\\n // p 以外の p の倍数から素数ラベルを剥奪\\n for (int q = p * 2; q <= N; q += p)\\n {\\n // q は合成数なのでふるい落とす\\n isprime[q] = false;\\n\\n // q は p で割り切れる旨を更新\\n if (minfactor[q] == -1)\\n minfactor[q] = p;\\n // update mobius\\n if ((q / p) % p == 0)\\n mobius[q] = 0;\\n else\\n mobius[q] = -mobius[q];\\n }\\n }\\n }\\n\\n // 高速素因数分解\\n // pair (素因子, 指数) の vector を返す\\n vector<pair<int, int>> factorize(int n)\\n {\\n vector<pair<int, int>> res;\\n while (n > 1)\\n {\\n int p = minfactor[n];\\n int exp = 0;\\n\\n // n で割り切れる限り割る\\n while (minfactor[n] == p)\\n {\\n n /= p;\\n ++exp;\\n }\\n res.emplace_back(p, exp);\\n }\\n return res;\\n }\\n\\n // 高速約数列挙\\n // 計算量はnの約数の個数をσ(n)として、O(σ(n))となります。n≤10^9の範囲では、σ(n)≤1344(n=735134400で最大)\\n vector<int> divisors(int n)\\n {\\n vector<int> res({1});\\n\\n // n を素因数分解 (メンバ関数使用)\\n auto pf = factorize(n);\\n\\n // 約数列挙\\n for (auto p : pf)\\n {\\n int s = (int)res.size();\\n for (int i = 0; i < s; ++i)\\n {\\n int v = 1;\\n for (int j = 0; j < p.second; ++j)\\n {\\n v *= p.first;\\n res.push_back(res[i] * v);\\n }\\n }\\n }\\n return res;\\n }\\n};\\n\\nint main()\\n{\\n cout << fixed << setprecision(16);\\n int t;\\n cin >> t;\\n\\n int MAXN = 1e6;\\n vector<ll> sum(MAXN + 1);\\n sum[1] = 2;\\n Eratosthenes er(MAXN);\\n\\n rep(x, 2, MAXN + 1)\\n {\\n // i以下の互いに素な個数\\n ll cnt = x;\\n for (auto [p, r] : er.factorize(x))\\n {\\n cnt = cnt / p * (p - 1);\\n }\\n sum[x] = sum[x - 1] + cnt;\\n }\\n\\n rep(i, 0, t)\\n {\\n int n;\\n cin >> n;\\n cout << sum[n] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 18804,\n \"score_of_the_acc\": -0.1638,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2286_6681186\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <tuple>\\n#include <map>\\n#include <queue>\\n\\nusing namespace std;\\n\\nusing ll = long long;\\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>;\\nusing vll = vector<ll>;\\t\\tusing vvll = vector<vll>;\\tusing vvvll = vector<vvll>;\\nusing vb = vector<bool>;\\tusing vvb = vector<vb>;\\t\\tusing vvvb = vector<vvb>;\\ntemplate <class T> using pqr = priority_queue<T, vector<T>, greater<T>>;\\n\\nconst ll INFL = (ll)1e18;\\tconst int INF = (int)1e9;\\nconst int MOD = 1000000007;\\n\\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 を返す）\\n\\n\\n//ユークリッドの互除法\\nll gcd(ll a, ll b) {\\n\\tif (b == 0) return a;\\n\\treturn gcd(b, a % b);\\n}\\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}\\n\\telse {\\n\\t\\tx = 1; y = 0;\\n\\t}\\n\\treturn d;\\n}\\n\\n//素数判定O(\\\\sqrt(n))\\nbool is_prime(int n) {\\n\\tfor (int i = 2; i * i <= n; i++) {\\n\\t\\tif (n % i == 0)\\n\\t\\t\\treturn false;\\n\\t}\\n\\treturn n != 1;\\n}\\n\\n//エラトステネスの篩\\nint sieve(int n, vi& prime, vb& is_prime) {\\n\\tint p = 0;\\n\\tfor (int i = 0; i <= n; i++)\\n\\t\\tis_prime[i] = true;\\n\\tis_prime[0] = is_prime[1] = false;\\n\\tfor (int i = 2; i <= n; i++) {\\n\\t\\tif (is_prime[i]) {\\n\\t\\t\\tprime[p++] = i;\\n\\t\\t\\tfor (int j = 2 * i; j <= n; j += i)\\n\\t\\t\\t\\tis_prime[j] = false;\\n\\t\\t}\\n\\t}\\n\\treturn p;\\n}\\n\\nint main()\\n{\\n\\tconst int MAX_NUM = 1000000;\\n\\tint t;\\n\\tcin >> t;\\n\\n\\n\\t//素数とオイラー関数の計算\\n\\tvi prime(MAX_NUM + 1);\\n\\tvb is_prime(MAX_NUM + 1);\\n\\tvi euler(MAX_NUM + 1, 1);\\n\\tint p = 0;\\n\\t//初期化\\n\\tfor (int i = 0; i <= MAX_NUM; i++)\\n\\t\\tis_prime[i] = true;\\n\\n\\tis_prime[0] = is_prime[1] = false;\\n\\tfor (int i = 2; i <= MAX_NUM; i++) {\\n\\t\\tif (is_prime[i]) {\\n\\t\\t\\tprime[p++] = i;\\n\\t\\t\\teuler[i] = i - 1;\\n\\t\\t\\tfor (int j = 2 * i; j <= MAX_NUM; j += i) {\\n\\t\\t\\t\\tis_prime[j] = false;\\n\\t\\t\\t\\tint tmp = j, pow = 1;\\n\\t\\t\\t\\t//素因数のべきを求める\\n\\t\\t\\t\\twhile (tmp % i == 0) {\\n\\t\\t\\t\\t\\ttmp /= i;\\n\\t\\t\\t\\t\\tpow *= i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//オイラー関数の計算\\n\\t\\t\\t\\teuler[j] *= pow - pow / i;\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\n\\t//数列計算\\n\\tvll F(MAX_NUM + 1);\\n\\tF[1] = 2;\\n\\tfor (int i = 2; i <= MAX_NUM; i++) {\\n\\t\\tF[i] = F[i - 1] + euler[i];\\n\\t}\\n\\n\\tvll ans;\\n\\tfor (int i = 0; i < t; i++) {\\n\\t\\tint n;\\n\\t\\tcin >> n;\\n\\t\\tans.push_back(F[n]);\\n\\t}\\n\\n\\n\\tfor (auto a : ans)\\n\\t\\tcout << a << endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 19064,\n \"score_of_the_acc\": -0.1261,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":1273,"cells":{"group_id":{"kind":"string","value":"aoj_2290_cpp"},"problem_description":{"kind":"string","value":"A: Attack the Moles\nICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．\n今日の修行は，もぐらたたきを何回も行って，反射神経と記憶力を高めようというものである．出てくるもぐらを次々に叩き，出来るだけ多くのポイントを獲得したい．\nもぐらが出てくる可能性のある場所は直線状に並んでいて，基準点からの距離によって座標が定まっている．うさぎはしばらく修行を続けるうちに，もぐらの出現する場所と時間が常に一緒であることに気が付いた．うさぎは，その情報をすべて記録し，コンピュータで解析を行うことにした．\nもぐらを叩くには，もぐらの出現位置に手を動かした後，もぐらの出てくるタイミングにぴったり合わせてもぐらを叩かなければならない．もぐらをうまく叩けると，そのもぐらに応じてポイントを得ることが出来る．もぐらを叩く動作は一瞬で行うことが出来るが，手を移動させる速さには限界がある．うさぎはもぐらを叩くにあたって左右両方の手を用いることができる．左手と右手は独立に動かすことが可能であるが，左手は常に右手より座標が小さい位置に存在しなければならない．このような条件下で，最大でどれだけのポイントが得られるかを調べたい．\nInput\nN\nV\nX\nLeft\nX\nRight\nX\n1\nT\n1\nP\n1\n...\nX\nN\nT\nN\nP\nN\nN\nは出てくるもぐらの数，\nV\nは手を移動させられる最大の速さ，\nX\nLeft\n,\nX\nRight\nはそれぞれ，左手，右手の初期位置の座標である．\nX\ni\n,\nT\ni\n,\nP\ni\nはそれぞれ，\ni\n番目のもぐらの，出現する位置の座標，ゲーム開始から出現までの時間，叩けた際に得られるポイントである．\n1 ≤\nN\n≤ 3,000，1 ≤\nV\n≤ 10,000，1 ≤\nX\nLeft\n<\nX\nRight\n≤ 100,000，1 ≤\nX\n1\n≤\nX\n2\n≤ ... ≤\nX\nN\n≤ 100,000，1 ≤\nT\ni\n≤ 100,000，1 ≤\nP\ni\n≤ 100,000 を満たす．(\nX\ni\n,\nT\ni\n) として同一の組は複数回現れない．\nOutput\nうさぎが得られる最大のポイントを 1 行に出力せよ．\nSample Input 1\n3 10 150 250\n100 20 123\n201 10 67\n202 10 45\nSample Output 1\n190\nSample Input 2\n1 7 20 90\n55 5 73\nSample Output 2\n73\nSample Input 3\n10 2 1000 2000\n400 300 1\n600 200 1\n700 800 1\n700 500 1\n900 600 1\n1000 700 1\n1300 900 1\n1400 400 1\n1500 1000 1\n2000 100 1\nSample Output 3\n10"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2290_9372895","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\ntemplate<class T>\nstruct MCF {\nprivate:\n const T inf = 1e9;\n vector<T> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; int cap; T cost;\n edge(int t = 0, int r = 0, int ca = 0, T co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n T d; int v; //最短距離(費用)、頂点番号\n pii(T d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<T> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, int cap, T cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n bool bellmanford(int s, int t) {\n dist.assign(n, inf);\n dist[s] = 0;\n int cnt = 0;\n while (cnt < n) {\n bool end = true;\n for (int v = 0; v < n; v++) {\n if (dist[v] == inf) continue;\n for (auto e : to[v]) {\n if (e.cap == 0) continue;\n if (dist[v] + e.cost < dist[e.to]) {\n dist[e.to] = dist[v] + e.cost;\n end = false;\n }\n }\n }\n cerr << cnt << \" \";\n\n if (end) break;\n cnt++;\n }\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n return (cnt == n);\n }\n\n //s->tへ流量fの最小費用流、流せないときは-1\n T mincostflow(int s, int t, int f) {\n T res = 0;\n pot.assign(n, 0);\n bellmanford(s, t);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n int nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return res;\n }\n\n //s->tへ流量fの最小費用流、流せないときは費用と流せなかった流量のペア\n pair<T, int> mincostflow_pair(int s, int t, int f) {\n T res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return { res, f }; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return { res, f };\n }\n};\n\nvi<int> x(3010), t(3010), p(3010);\nvi<tuple<int, int, int>> xtp(3010, { 1e9, 1e9, 1e9 });\nMCF<int> mcf(6020);\n\nint main()\n{\n int n; ll v, xl, xr;\n cin >> n >> v >> xl >> xr;\n rep(i, n) cin >> x[i] >> t[i] >> p[i];\n rep(i, n) xtp[i] = { t[i], x[i], p[i] };\n sort(xtp.begin(), xtp.end());\n rep(i, n) {\n t[i] = get<0>(xtp[i]);\n x[i] = get<1>(xtp[i]);\n p[i] = get<2>(xtp[i]);\n }\n\n int S = 0, S1 = 1, S2 = 2, T = 2 * n + 3;\n\n mcf.addedge(S, S1, 1, 0);\n mcf.addedge(S, S2, 1, 0);\n\n rep(_, 2) {\n rep(i, n) {\n ll dx = abs(x[i] - xl);\n ll dt = t[i];\n if (dx <= dt * v) mcf.addedge(S1, 2 * i + 3, 1, -p[i]);\n }\n swap(xl, xr);\n swap(S1, S2);\n }\n\n rep(i, n) {\n mcf.addedge(2 * i + 3, 2 * i + 4, 1, 0);\n rep(j, n) {\n if (i == j) continue;\n if (t[i] > t[j]) continue;\n ll dx = abs(x[j] - x[i]);\n ll dt = t[j] - t[i];\n if (dx <= dt * v) mcf.addedge(2 * i + 4, 2 * j + 3, 1, -p[j]);\n }\n mcf.addedge(2 * i + 4, T, 1, 0);\n }\n\n mcf.addedge(S1, T, 1, 0);\n mcf.addedge(S2, T, 1, 0);\n\n ll ans = mcf.mincostflow(S, T, 2);\n cout << -ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":242836,"score_of_the_acc":-0.9285,"final_rank":3},{"submission_id":"aoj_2290_9372891","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\ntemplate<class T>\nstruct MCF {\nprivate:\n const T inf = 1e9;\n vector<T> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; int cap; T cost;\n edge(int t = 0, int r = 0, int ca = 0, T co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n T d; int v; //最短距離(費用)、頂点番号\n pii(T d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<T> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, int cap, T cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n bool bellmanford(int s, int t) {\n dist.assign(n, inf);\n dist[s] = 0;\n int cnt = 0;\n while (cnt < n) {\n bool end = true;\n for (int v = 0; v < n; v++) {\n if (dist[v] == inf) continue;\n for (auto e : to[v]) {\n if (e.cap == 0) continue;\n if (dist[v] + e.cost < dist[e.to]) {\n dist[e.to] = dist[v] + e.cost;\n end = false;\n }\n }\n }\n //cerr << cnt << \" \";\n\n if (end) break;\n cnt++;\n }\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n return (cnt == n);\n }\n\n //s->tへ流量fの最小費用流、流せないときは-1\n T mincostflow(int s, int t, int f) {\n T res = 0;\n pot.assign(n, 0);\n bellmanford(s, t);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n int nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return res;\n }\n\n //s->tへ流量fの最小費用流、流せないときは費用と流せなかった流量のペア\n pair<T, int> mincostflow_pair(int s, int t, int f) {\n T res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return { res, f }; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return { res, f };\n }\n};\n\nvi<int> x(3010), t(3010), p(3010);\nvi<tuple<int, int, int>> xtp(3010, { 1e9, 1e9, 1e9 });\nMCF<int> mcf(6020);\n\nint main()\n{\n int n; ll v, xl, xr;\n cin >> n >> v >> xl >> xr;\n rep(i, n) cin >> x[i] >> t[i] >> p[i];\n rep(i, n) xtp[i] = { t[i], x[i], p[i] };\n sort(xtp.begin(), xtp.end());\n rep(i, n) {\n t[i] = get<0>(xtp[i]);\n x[i] = get<1>(xtp[i]);\n p[i] = get<2>(xtp[i]);\n }\n\n int S = 0, S1 = 1, S2 = 2, T = 2 * n + 3;\n\n mcf.addedge(S, S1, 1, 0);\n mcf.addedge(S, S2, 1, 0);\n\n rep(_, 2) {\n rep(i, n) {\n ll dx = abs(x[i] - xl);\n ll dt = t[i];\n if (dx <= dt * v) mcf.addedge(S1, 2 * i + 3, 1, -p[i]);\n }\n swap(xl, xr);\n swap(S1, S2);\n }\n\n rep(i, n) {\n mcf.addedge(2 * i + 3, 2 * i + 4, 1, 0);\n rep(j, n) {\n if (i == j) continue;\n if (t[i] > t[j]) continue;\n ll dx = abs(x[j] - x[i]);\n ll dt = t[j] - t[i];\n if (dx <= dt * v) mcf.addedge(2 * i + 4, 2 * j + 3, 1, -p[j]);\n }\n mcf.addedge(2 * i + 4, T, 1, 0);\n }\n\n mcf.addedge(S1, T, 1, 0);\n mcf.addedge(S2, T, 1, 0);\n\n ll ans = mcf.mincostflow(S, T, 2);\n cout << -ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":920,"memory_kb":243460,"score_of_the_acc":-1.0815,"final_rank":9},{"submission_id":"aoj_2290_8978893","code_snippet":"#line 1 \"main.cpp\"\n#include <bits/stdc++.h>\n// #include \"Utils/FastIO.hpp\"\n#line 7 \"/home/kokoro601/compro_library/Flow/MinCostFlow.hpp\"\n\n// this implementation is based on\n// https://megalodon.jp/2022-0321-1006-53/https://ei1333.hateblo.jp:443/entry/2019/12/15/094229\n// verify:\n// https://atcoder.jp/contests/practice2/submissions/30316518\n// https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6331152\n\ntemplate<class CapType, class CostType> class MinCostFlow {\n struct Edge {\n int to, rev;\n CapType cap;\n CostType cost;\n };\n\n struct EdgeInfo {\n int v, offset;\n };\n\n using P = std::pair<CostType, int>;\n\n int n;\n const CostType inf;\n std::vector<CostType> h, dist;\n std::vector<int> prevv, preve;\n std::vector<CapType> b;\n std::vector<EdgeInfo> edge_infos;\n CostType res = 0;\n\npublic:\n std::vector< std::vector<Edge> > g;\n\n MinCostFlow(int node_size) : \n n(node_size), inf(std::numeric_limits<CostType>::max()),\n g(n), h(n, 0), dist(n), prevv(n), preve(n), b(n) {}\n\n CostType solve(int s, int t, CapType f) {\n while(f > 0) {\n std::priority_queue<P, std::vector<P>, std::greater<P> > que;\n std::fill(dist.begin(), dist.end(), inf);\n dist[s] = 0;\n que.push({0, s});\n while(!que.empty()) {\n P p = que.top(); que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i = 0; i < (int)g[v].size(); i++) {\n Edge &e = g[v][i];\n CostType diff = e.cost + h[v] - h[e.to];\n if (e.cap > 0 && dist[e.to] > dist[v] + diff) {\n dist[e.to] = dist[v] + diff;\n prevv[e.to] = v, preve[e.to] = i;\n que.push({dist[e.to], e.to});\n }\n }\n }\n\n if (dist[t] == inf) {\n std::cout << \"-1\" << std::endl;\n exit(0);\n }\n\n for (int i = 0; i < n; i++) h[i] += dist[i];\n\n CapType d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = std::min(d, g[prevv[v]][preve[v]].cap);\n }\n\n f -= d;\n res += h[t] * d;\n for (int v = t; v != s; v = prevv[v]) {\n Edge& e = g[prevv[v]][preve[v]];\n e.cap -= d;\n g[v][e.rev].cap += d;\n }\n }\n\n return res;\n }\n\n void set_potential(std::vector<CostType> &potential) {\n h = potential;\n }\n\n void add_edge(int from, int to, CapType cap, CostType cost) {\n assert(from != to); \n g[from].push_back({to, (int)g[to].size(), cap, cost});\n g[to].push_back({from, (int)g[from].size() - 1, 0, -cost});\n edge_infos.push_back({to, (int)g[to].size() - 1});\n }\n\n CapType get_edge(int i) {\n EdgeInfo &ei = edge_infos[i];\n Edge &e = g[ei.v][ei.offset];\n CapType ret = e.cap;\n return ret;\n }\n};\n#line 4 \"/home/kokoro601/compro_library/Graph/SCC.hpp\"\n\n// verify:\n// https://judge.yosupo.jp/submission/83473\n// https://atcoder.jp/contests/arc010/submissions/30376565\n\n\nclass SCC {\n using Graph = std::vector< std::vector<int> >;\n\n void dfs(int v) {\n used[v] = true;\n for (auto &to: g[v]) {\n if (!used[to]) dfs(to);\n }\n ord.push_back(v);\n }\n\n void rdfs(int v, int group_id) {\n used[v] = true;\n cmp[v] = group_id;\n for (auto &to: rg[v]) {\n if (!used[to]) rdfs(to, group_id);\n }\n }\n\n void build() {\n for (int v = 0; v < n; v++)\n if (!used[v]) dfs(v);\n\n std::fill(used.begin(), used.end(), 0);\n\n std::reverse(ord.begin(), ord.end());\n for (auto &v: ord)\n if (!used[v]) rdfs(v, n_group++);\n }\n\n int n;\n Graph g, rg;\n std::vector<bool> used;\n std::vector<int> ord;\npublic:\n int n_group;\n std::vector<int> cmp;\n\n SCC(Graph &g): n((int)g.size()), g(g), used(n), n_group(0), cmp(n){\n rg.resize(n);\n for (int i = 0; i < n; i++)\n for (auto to: g[i]) \n rg[to].push_back(i);\n build();\n }\n\n std::vector< std::vector<int> > make_group_list() {\n std::vector< std::vector<int> > group_list(n_group);\n for (int i = 0; i < n; i++) group_list[cmp[i]].push_back(i);\n return group_list;\n }\n\n Graph rebuild() {\n Graph ret_g(n_group);\n auto group_list = make_group_list();\n\n std::vector<bool> marked_fl(n_group, false);\n for (int i = 0; i < n_group; i++) {\n std::vector<int> rec_marked_group;\n for (auto &v: group_list[i]) {\n for (auto &to: g[v]) {\n int to_group_id = cmp[to];\n if (to_group_id != i && !marked_fl[to_group_id]) {\n marked_fl[to_group_id] = true;\n rec_marked_group.push_back(to_group_id);\n ret_g[i].push_back(to_group_id);\n }\n }\n }\n for (auto &group_id: rec_marked_group) marked_fl[group_id] = false;\n }\n\n return ret_g;\n }\n};\n#line 5 \"main.cpp\"\n\nusing namespace std;\nusing ull = unsigned long long;\nusing ll = long long;\nusing Graph = vector<vector<int>>;\n// using u128 = __uint128_t; \nusing u64 = uint64_t;\n\n\n// vector<Mint> inv(vector<Mint> &v) {\n// size_t n = v.size();\n\n// vector<Mint> ret = { modpow(v[0].v, MOD-2, MOD) };\n// vector<Mint> cur = { v[0] }; \n// size_t cursz = 1;\n// while (cursz < n) {\n// cur.resize(2*cursz); memcpy(cur.data() + cursz, v.data() + cursz, sizeof(unsigned int) * min(n-cursz, cursz));\n// auto tmp = ntt.convolution(cur, ret);\n// tmp[0] = Mint(2) - tmp[0];\n// for (int i = 1; i < tmp.size(); i++) tmp[i] *= -1;\n// tmp.resize(2*cursz);\n// ret = ntt.convolution(ret, tmp);\n// ret.resize(2*cursz);\n// cursz *= 2;\n// }\n\n// ret.resize(n);\n// return ret;\n// }\n\ntypedef struct {\n int x, t, p;\n} Item;\n\nint main() {\n int n, v; cin >> n >> v;\n int xleft, xright; cin >> xleft >> xright;\n\n vector<Item> items(n);\n for (int i = 0; i < n; i++) cin >> items[i].x >> items[i].t >> items[i].p;\n\n // 時間でソート\n sort(items.begin(), items.end(), [](auto &a, auto &b) { return a.t < b.t; }); \n\n int s = 2*n, t = 2*n + 1;\n MinCostFlow<int, int> mcf(2*n + 2);\n mcf.add_edge(s, t, 2, 0);\n for (int i = 0; i < n; i++) { // s ⇒ 各頂点\n if (abs(xleft - items[i].x) <= items[i].t * v)\n mcf.add_edge(s, i, 1, 0);\n if (abs(xright - items[i].x) <= items[i].t * v)\n mcf.add_edge(s, i, 1, 0);\n }\n for (int i = 0; i < n; i++) // 各頂点 ⇒ t\n mcf.add_edge(i+n, t, 1, 0);\n for (int i = 0; i < n; i++)\n mcf.add_edge(i, i+n, 1, -items[i].p); // ポイント\n \n for (int i = 0; i < n; i++) \n for (int j = i+1; j < n; j++) \n if (abs(items[i].x - items[j].x) <= v * (items[j].t - items[i].t))\n mcf.add_edge(i+n, j, 1, 0);\n\n vector<int> potential(2*n + 2, 1e9);\n potential[s] = 0;\n for (auto e: mcf.g[s])\n if (e.cap != 0)\n potential[e.to] = min(potential[e.to], potential[s] + e.cost); \n for (int i = 0; i < n; i++) {\n for (auto e: mcf.g[i]) \n if (e.cap != 0)\n potential[e.to] = min(potential[e.to], potential[i] + e.cost);\n for (auto e: mcf.g[i+n]) \n if (e.cap != 0)\n potential[e.to] = min(potential[e.to], potential[i+n] + e.cost);\n }\n\n mcf.set_potential(potential);\n\n cout << -mcf.solve(s, t, 2) << \"\\n\";\n}","accuracy":0.2653061224489796,"time_ms":110,"memory_kb":120300,"score_of_the_acc":-0.2921,"final_rank":19},{"submission_id":"aoj_2290_8877953","code_snippet":"#line 1 \"main.cpp\"\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <iomanip>\n#include <math.h>\n#include <functional>\n#include <map>\n#include <set>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <queue>\n#include <stack>\n#include <cstring>\n#include <assert.h>\n#include <unistd.h>\n#include <chrono>\n#include <numeric>\n#include <cstdint>\n#include <variant>\n#include <random>\n#include <memory>\n// #include <bit>\n// #include \"Utils/FastIO.hpp\"\n#line 5 \"/home/kokoro601/compro_library/Flow/MinCostFlow.hpp\"\n#include <limits>\n#line 7 \"/home/kokoro601/compro_library/Flow/MinCostFlow.hpp\"\n\n// this implementation is based on\n// https://megalodon.jp/2022-0321-1006-53/https://ei1333.hateblo.jp:443/entry/2019/12/15/094229\n// verify:\n// https://atcoder.jp/contests/practice2/submissions/30316518\n// https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6331152\n\n\n\n\ntemplate<class CapType, class CostType> class MinCostFlow {\n struct Edge {\n int to, rev;\n CapType cap;\n CostType cost;\n };\n\n struct EdgeInfo {\n int v, offset;\n };\n\n using P = std::pair<CostType, int>;\n\n int n;\n const CostType inf;\n std::vector<CostType> h, dist;\n std::vector<int> prevv, preve;\n std::vector<CapType> b;\n std::vector<EdgeInfo> edge_infos;\n CostType res = 0;\n\npublic:\n // std::vector< std::vector<Edge> > g;\n Edge *g[7000];\n short hi[7000] = {}, lim[7000] = {};\n\n MinCostFlow(int node_size) : \n n(node_size), inf(std::numeric_limits<CostType>::max()),\n h(n, 0), dist(n), prevv(n), preve(n), b(n) {}\n\n CostType solve(int s, int t, CapType f) {\n while(f > 0) {\n std::priority_queue<P, std::vector<P>, std::greater<P> > que;\n std::fill(dist.begin(), dist.end(), inf);\n dist[s] = 0;\n que.push({0, s});\n while(!que.empty()) {\n P p = que.top(); que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i = 0; i < (int)hi[v]; i++) {\n Edge &e = g[v][i];\n CostType diff = e.cost + h[v] - h[e.to];\n if (e.cap > 0 && dist[e.to] > dist[v] + diff) {\n dist[e.to] = dist[v] + diff;\n prevv[e.to] = v, preve[e.to] = i;\n que.push({dist[e.to], e.to});\n }\n }\n }\n\n if (dist[t] == inf) {\n std::cout << \"-1\" << std::endl;\n exit(0);\n }\n\n for (int i = 0; i < n; i++) h[i] += dist[i];\n\n CapType d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = std::min(d, g[prevv[v]][preve[v]].cap);\n }\n\n f -= d;\n res += h[t] * d;\n for (int v = t; v != s; v = prevv[v]) {\n Edge& e = g[prevv[v]][preve[v]];\n e.cap -= d;\n g[v][e.rev].cap += d;\n }\n }\n\n return res;\n }\n\n void set_potential(std::vector<CostType> &potential) {\n h = potential;\n }\n\n void add_edge(int from, int to, CapType cap, CostType cost) {\n assert(from != to); \n\n if (lim[from] == hi[from]) {\n lim[from] += 8;\n g[from] = (Edge*)realloc(g[from], sizeof(Edge) * lim[from]);\n }\n if (lim[to] == hi[to]) {\n lim[to] += 8;\n g[to] = (Edge*)realloc(g[to], sizeof(Edge) * lim[to]);\n }\n\n g[from][hi[from]++] = {to, (int)hi[to], cap, cost};\n g[to][hi[to]++] = {from, (int)hi[from] - 1, 0, -cost};\n // edge_infos.push_back({to, (int)g[to].size() - 1});\n }\n\n CapType get_edge(int i) {\n EdgeInfo &ei = edge_infos[i];\n Edge &e = g[ei.v][ei.offset];\n CapType ret = e.cap;\n return ret;\n }\n};\n#line 26 \"main.cpp\"\n\nusing namespace std;\nusing ull = unsigned long long;\nusing ll = long long;\nusing Graph = vector<vector<int>>;\nusing u128 = __uint128_t; \nusing u64 = uint64_t;\n\n// 番兵は入っているとする\n// ll garner(vector<ll> &b, vector<ll> &m) {\n// vector<ll> coeffs(m.size(), 1);\n// vector<ll> constants(m.size(), 0);\n// for (size_t k = 0; k < b.size(); k++) {\n// ll diff = (b[k] > constants[k]) ? (b[k] - constants[k]) : (b[k] - constants[k] + m[k]);\n// ll t = (diff * modinv(coeffs[k], m[k])) % m[k];\n// for (size_t i = k + 1; i < m.size(); i++) {\n// (constants[i] += t * coeffs[i]) %= m[i];\n// (coeffs[i] *= m[k]) %= m[i];\n// }\n// }\n\n// return constants.back();\n// }\n\nstruct Item {\n int x, t, p;\n};\n\nint main() {\n int n, v, xl, xr;\n cin >> n >> v >> xl >> xr;\n vector<Item> items(n);\n for (int i = 0; i < n; i++) cin >> items[i].x >> items[i].t >> items[i].p;\n items.push_back({xl, 0, 0});\n items.push_back({xr, 0, 0});\n // 時間でソート\n sort(items.begin(), items.end(), [](auto &a, auto &b) { return a.t < b.t; });\n\n n += 2;\n\n MinCostFlow<int, int> mcf(2*n+2);\n int s = 2*n, t = 2*n+1;\n mcf.add_edge(s, 0, 1, 0), mcf.add_edge(s, 1, 1, 0);\n for (int i = 0; i < n; i++) mcf.add_edge(i, i+n, 1, -items[i].p);\n for (int i = 0; i < n; i++) mcf.add_edge(i+n, t, 1, 0);\n for (int i = 0; i < n; i++) {\n for (int j = i+1; j < n; j++) {\n // 到達可能\n if (abs(items[i].x - items[j].x) <= v * (items[j].t - items[i].t)) {\n mcf.add_edge(i+n, j, 1, 0);\n }\n }\n }\n\n vector<int> potential(2*n+2, 1e9), top(2*n+2);\n top[0] = s;\n for (int i = 0; i < n; i++) top[2*i + 1] = i, top[2*i + 2] = i+n; \n top[2*n+1] = t;\n\n potential[s] = 0;\n for (auto cur: top) {\n for (int i = 0; i < mcf.hi[cur]; i++) {\n auto e = mcf.g[cur][i];\n if (e.cap == 0) continue;\n potential[e.to] = min(potential[e.to], potential[cur] + e.cost);\n }\n }\n\n mcf.set_potential(potential);\n\n cout << -mcf.solve(s, t, 2) << \"\\n\";\n}","accuracy":1,"time_ms":1050,"memory_kb":240792,"score_of_the_acc":-1.0895,"final_rank":13},{"submission_id":"aoj_2290_8877946","code_snippet":"#line 1 \"main.cpp\"\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <iomanip>\n#include <math.h>\n#include <functional>\n#include <map>\n#include <set>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <queue>\n#include <stack>\n#include <cstring>\n#include <assert.h>\n#include <unistd.h>\n#include <chrono>\n#include <numeric>\n#include <cstdint>\n#include <variant>\n#include <random>\n#include <memory>\n// #include <bit>\n// #include \"Utils/FastIO.hpp\"\n#line 5 \"/home/kokoro601/compro_library/Flow/MinCostFlow.hpp\"\n#include <limits>\n#line 7 \"/home/kokoro601/compro_library/Flow/MinCostFlow.hpp\"\n\n// this implementation is based on\n// https://megalodon.jp/2022-0321-1006-53/https://ei1333.hateblo.jp:443/entry/2019/12/15/094229\n// verify:\n// https://atcoder.jp/contests/practice2/submissions/30316518\n// https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6331152\n\n\n\n\ntemplate<class CapType, class CostType> class MinCostFlow {\n struct Edge {\n int to, rev;\n CapType cap;\n CostType cost;\n };\n\n struct EdgeInfo {\n int v, offset;\n };\n\n using P = std::pair<CostType, int>;\n\n int n;\n const CostType inf;\n std::vector<CostType> h, dist;\n std::vector<int> prevv, preve;\n std::vector<CapType> b;\n std::vector<EdgeInfo> edge_infos;\n CostType res = 0;\n\npublic:\n // std::vector< std::vector<Edge> > g;\n Edge *g[7000];\n int hi[7000] = {}, lim[7000] = {};\n\n MinCostFlow(int node_size) : \n n(node_size), inf(std::numeric_limits<CostType>::max()),\n h(n, 0), dist(n), prevv(n), preve(n), b(n) {}\n\n CostType solve(int s, int t, CapType f) {\n while(f > 0) {\n std::priority_queue<P, std::vector<P>, std::greater<P> > que;\n std::fill(dist.begin(), dist.end(), inf);\n dist[s] = 0;\n que.push({0, s});\n while(!que.empty()) {\n P p = que.top(); que.pop();\n int v = p.second;\n if (dist[v] < p.first) continue;\n for (int i = 0; i < (int)hi[v]; i++) {\n Edge &e = g[v][i];\n CostType diff = e.cost + h[v] - h[e.to];\n if (e.cap > 0 && dist[e.to] > dist[v] + diff) {\n dist[e.to] = dist[v] + diff;\n prevv[e.to] = v, preve[e.to] = i;\n que.push({dist[e.to], e.to});\n }\n }\n }\n\n if (dist[t] == inf) {\n std::cout << \"-1\" << std::endl;\n exit(0);\n }\n\n for (int i = 0; i < n; i++) h[i] += dist[i];\n\n CapType d = f;\n for (int v = t; v != s; v = prevv[v]) {\n d = std::min(d, g[prevv[v]][preve[v]].cap);\n }\n\n f -= d;\n res += h[t] * d;\n for (int v = t; v != s; v = prevv[v]) {\n Edge& e = g[prevv[v]][preve[v]];\n e.cap -= d;\n g[v][e.rev].cap += d;\n }\n }\n\n return res;\n }\n\n void set_potential(std::vector<CostType> &potential) {\n h = potential;\n }\n\n void add_edge(int from, int to, CapType cap, CostType cost) {\n assert(from != to); \n\n if (lim[from] == hi[from]) {\n lim[from] += 8;\n g[from] = (Edge*)realloc(g[from], sizeof(Edge) * lim[from]);\n }\n if (lim[to] == hi[to]) {\n lim[to] += 8;\n g[to] = (Edge*)realloc(g[to], sizeof(Edge) * lim[to]);\n }\n\n g[from][hi[from]++] = {to, (int)hi[to], cap, cost};\n g[to][hi[to]++] = {from, (int)hi[from] - 1, 0, -cost};\n // edge_infos.push_back({to, (int)g[to].size() - 1});\n }\n\n CapType get_edge(int i) {\n EdgeInfo &ei = edge_infos[i];\n Edge &e = g[ei.v][ei.offset];\n CapType ret = e.cap;\n return ret;\n }\n};\n#line 26 \"main.cpp\"\n\nusing namespace std;\nusing ull = unsigned long long;\nusing ll = long long;\nusing Graph = vector<vector<int>>;\nusing u128 = __uint128_t; \nusing u64 = uint64_t;\n\n// 番兵は入っているとする\n// ll garner(vector<ll> &b, vector<ll> &m) {\n// vector<ll> coeffs(m.size(), 1);\n// vector<ll> constants(m.size(), 0);\n// for (size_t k = 0; k < b.size(); k++) {\n// ll diff = (b[k] > constants[k]) ? (b[k] - constants[k]) : (b[k] - constants[k] + m[k]);\n// ll t = (diff * modinv(coeffs[k], m[k])) % m[k];\n// for (size_t i = k + 1; i < m.size(); i++) {\n// (constants[i] += t * coeffs[i]) %= m[i];\n// (coeffs[i] *= m[k]) %= m[i];\n// }\n// }\n\n// return constants.back();\n// }\n\nstruct Item {\n int x, t, p;\n};\n\nint main() {\n int n, v, xl, xr;\n cin >> n >> v >> xl >> xr;\n vector<Item> items(n);\n for (int i = 0; i < n; i++) cin >> items[i].x >> items[i].t >> items[i].p;\n items.push_back({xl, 0, 0});\n items.push_back({xr, 0, 0});\n // 時間でソート\n sort(items.begin(), items.end(), [](auto &a, auto &b) { return a.t < b.t; });\n\n n += 2;\n\n MinCostFlow<int, int> mcf(2*n+2);\n int s = 2*n, t = 2*n+1;\n mcf.add_edge(s, 0, 1, 0), mcf.add_edge(s, 1, 1, 0);\n for (int i = 0; i < n; i++) mcf.add_edge(i, i+n, 1, -items[i].p);\n for (int i = 0; i < n; i++) mcf.add_edge(i+n, t, 1, 0);\n for (int i = 0; i < n; i++) {\n for (int j = i+1; j < n; j++) {\n // 到達可能\n if (abs(items[i].x - items[j].x) <= v * (items[j].t - items[i].t)) {\n mcf.add_edge(i+n, j, 1, 0);\n }\n }\n }\n\n vector<int> potential(2*n+2, 1e9), top(2*n+2);\n top[0] = s;\n for (int i = 0; i < n; i++) top[2*i + 1] = i, top[2*i + 2] = i+n; \n top[2*n+1] = t;\n\n potential[s] = 0;\n for (auto cur: top) {\n for (int i = 0; i < mcf.hi[cur]; i++) {\n auto e = mcf.g[cur][i];\n if (e.cap == 0) continue;\n potential[e.to] = min(potential[e.to], potential[cur] + e.cost);\n }\n }\n\n mcf.set_potential(potential);\n\n cout << -mcf.solve(s, t, 2) << \"\\n\";\n}","accuracy":1,"time_ms":1070,"memory_kb":241564,"score_of_the_acc":-1.097,"final_rank":15},{"submission_id":"aoj_2290_8334069","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1012345678;\n\nint mincostflow(int N, int S, int T, int F, vector<vector<char> >& cap, vector<vector<int> >& cost) {\n\tint ans = 0;\n\tvector<int> height(N, 0); // potential\n\tfor (int rep = 0; rep < F; rep++) {\n\t\tvector<int> dist(N, INF);\n\t\tvector<int> pre(N, -1);\n\t\tvector<bool> vis(N, false);\n\t\tdist[S] = 0;\n\t\twhile (true) {\n\t\t\tint pos = -1;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tif (!vis[i] && dist[i] != INF && (pos == -1 || dist[pos] > dist[i])) {\n\t\t\t\t\tpos = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (pos == -1) {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tvis[pos] = true;\n\t\t\tfor (int i = 0; i < N; i++) {\n\t\t\t\tint ndist = dist[pos] + cost[pos][i] - (height[i] - height[pos]);\n\t\t\t\tif (cap[pos][i] > 0 && dist[i] > ndist) {\n\t\t\t\t\tdist[i] = ndist;\n\t\t\t\t\tpre[i] = pos;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (dist[T] == INF) {\n\t\t\treturn INF;\n\t\t}\n\t\tans += dist[T] + height[T];\n\t\tint pos = T;\n\t\twhile (pos != S) {\n\t\t\tint nxt = pre[pos];\n\t\t\tcap[nxt][pos] -= 1;\n\t\t\tcap[pos][nxt] += 1;\n\t\t\tpos = nxt;\n\t\t}\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tif (height[i] == INF || dist[i] == INF) {\n\t\t\t\theight[i] = INF;\n\t\t\t}\n\t\t\telse {\n\t\t\t\theight[i] += dist[i];\n\t\t\t}\n\t\t}\n\t}\n\treturn ans;\n}\n\nstruct enemy {\n\tint x, t, p;\n};\n\nint main() {\n\tint N, V, XL, XR;\n\tcin >> N >> V >> XL >> XR;\n\tvector<enemy> E(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> E[i].x >> E[i].t >> E[i].p;\n\t}\n\tsort(E.begin(), E.end(), [&](const enemy& e1, const enemy& e2) {\n\t\treturn e1.t < e2.t;\n\t});\n\tvector<int> ps(N + 1);\n\tfor (int i = 0; i < N; i++) {\n\t\tps[i + 1] = ps[i] + E[i].p;\n\t}\n\tauto psum = [&](int l, int r) -> int {\n\t\treturn ps[r] - ps[l];\n\t};\n\tauto reachable = [&](int xa, int ta, int xb, int tb) -> bool {\n\t\treturn (ta < tb && abs(xa - xb) <= V * (tb - ta));\n\t};\n\tvector<vector<char> > cap(N * 2 + 4, vector<char>(N * 2 + 4));\n\tvector<vector<int> > cost(N * 2 + 4, vector<int>(N * 2 + 4));\n\tauto add_edge = [&](int va, int vb, int cap_, int cost_) -> void {\n\t\tcap[va][vb] = cap_;\n\t\tcap[vb][va] = 0;\n\t\tcost[va][vb] = cost_;\n\t\tcost[vb][va] = -cost_;\n\t};\n\tfor (int i = 0; i < N; i++) {\n\t\tadd_edge(i, N + i, 1, 0);\n\t}\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = i + 1; j < N; j++) {\n\t\t\tif (reachable(E[i].x, E[i].t, E[j].x, E[j].t)) {\n\t\t\t\tadd_edge(N + i, j, 1, psum(i + 1, j));\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < N; i++) {\n\t\tif (reachable(XL, 0, E[i].x, E[i].t)) {\n\t\t\tadd_edge(2 * N + 0, i, 1, psum(0, i));\n\t\t}\n\t\tif (reachable(XR, 0, E[i].x, E[i].t)) {\n\t\t\tadd_edge(2 * N + 1, i, 1, psum(0, i));\n\t\t}\n\t\tadd_edge(N + i, 2 * N + 3, 1, psum(i + 1, N));\n\t}\n\tadd_edge(2 * N + 2, 2 * N + 0, 1, 0);\n\tadd_edge(2 * N + 2, 2 * N + 1, 1, 0);\n\tadd_edge(2 * N + 0, 2 * N + 3, 1, psum(0, N));\n\tadd_edge(2 * N + 1, 2 * N + 3, 1, psum(0, N));\n\tint ans = mincostflow(2 * N + 4, 2 * N + 2, 2 * N + 3, 2, cap, cost);\n\tcout << psum(0, N) * 2 - ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":290,"memory_kb":179712,"score_of_the_acc":-0.6371,"final_rank":1},{"submission_id":"aoj_2290_6027738","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 = 998244353;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 2;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\ntemplate<typename T>\nstruct mcf {\nprivate:\n\tstruct edge {\n\t\tint to, cap; T cost; int rev;\n\t};\n\tvector<vector<edge>> G;\n\tvector<P> par;\n\tvector<T> dist;\n\tT inf = mod;\npublic:\n\tmcf(int n) {\n\t\tG.resize(n);\n\t\tpar.resize(n);\n\t\tdist.resize(n);\n\t}\n\tvoid add_edge(int from, int to, int cap, T cost) {\n\t\tG[from].push_back({ to,cap,cost,(int)G[to].size() });\n\t\tG[to].push_back({ from,0,-cost,(int)G[from].size() - 1 });\n\t}\n\tpair<T, int> minimum_road(int s, int t) {\n\t\tfill(all(par), P{ -1,-1 });\n\t\tfill(all(dist), inf);\n\t\tdist[s] = 0;\n\t\tpriority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> q;\n\t\tq.push({ 0,s });\n\t\twhile (!q.empty()) {\n\t\t\tpair<T, int> p = q.top(); q.pop();\n\t\t\tint id = p.second;\n\t\t\tif (id == t)continue;\n\t\t\tif (p.first > dist[id])continue;\n\t\t\trep(j, G[id].size()) {\n\t\t\t\tif (G[id][j].cap > 0) {\n\t\t\t\t\tint to = G[id][j].to;\n\t\t\t\t\tT nd = p.first + G[id][j].cost;\n\t\t\t\t\tif (nd < dist[to]) {\n\t\t\t\t\t\tdist[to] = nd;\n\t\t\t\t\t\tpar[to] = { id,j };\n\t\t\t\t\t\tq.push({ dist[to],to });\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint cur = t;\n\t\tint f = mod;\n\t\twhile (cur != s) {\n\t\t\tint p = par[cur].first, j = par[cur].second;\n\t\t\tif (p < 0)return { -1,-1 };\n\t\t\tf = min(f, G[p][j].cap);\n\t\t\tcur = p;\n\t\t}\n\t\tcur = t;\n\t\twhile (cur != s) {\n\t\t\tint p = par[cur].first, j = par[cur].second;\n\t\t\tif (p < 0)return { -1,-1 };\n\t\t\tG[p][j].cap -= f;\n\t\t\tif (G[p][j].rev >= 0) {\n\t\t\t\tG[cur][G[p][j].rev].cap += f;\n\t\t\t}\n\t\t\tcur = p;\n\t\t}\n\t\treturn { dist[t],f };\n\t}\n\tT minimum_cost_flow(int s, int t, int k) {\n\t\tT ret = 0;\n\t\trep(i, k) {\n\t\t\tpair<T, int> z = minimum_road(s, t);\n\t\t\tif (z.first < 0)return -1;\n\t\t\tif (k - i <= z.second) {\n\t\t\t\tret += z.first * (k - i); break;\n\t\t\t}\n\t\t\ti += z.second - 1;\n\t\t\tret += z.first * z.second;\n\t\t}\n\t\treturn ret;\n\t}\n};\n\nvoid solve() {\n\tint n, v, xl, xr; cin >> n >> v >> xl >> xr;\n\tvector<int> x(n), t(n), p(n);\n\trep(i, n) {\n\t\tcin >> x[i] >> t[i] >> p[i];\n\t}\n\n\tx.push_back(xl);\n\tt.push_back(0);\n\tp.push_back(0);\n\tx.push_back(xr);\n\tt.push_back(0);\n\tp.push_back(0);\n\n\tn += 2;\n\tvector<P> vp;\n\trep(i, n)vp.push_back({ t[i],i });\n\tsort(all(vp));\n\tvector<int> nx(n), nt(n), np(n);\n\trep(i, n) {\n\t\tint id = vp[i].second;\n\t\tnx[i] = x[id];\n\t\tnt[i] = t[id];\n\t\tnp[i] = p[id];\n\t}\n\tswap(x, nx);\n\tswap(t, nt);\n\tswap(p, np);\n\tvector<int> rp(n + 1);\n\trep(i, n)rp[i + 1] = rp[i] + p[i];\n\n\n\tmcf<int> mc(2*n + 1);\n\trep(i, n) {\n\t\tmc.add_edge(i, i + n, 1, 0);\n\t\tmc.add_edge(i, i + n, 2, p[i]);\n\n\t\tmc.add_edge(i + n, 2 * n, 2, rp[n] - rp[i + 1]);\n\t}\n\trep(i, n)Rep(j, i+1, n) {\n\t\tint idl = i;\n\t\tint idr = j;\n\t\tint dx = abs(x[idl] - x[idr]);\n\t\tint dt = t[idr] - t[idl];\n\t\tif (v * dt >= dx) {\n\t\t\tmc.add_edge(idl + n, idr, 2, rp[idr] - rp[idl + 1]);\n\t\t}\n\t}\n\n\tint ans = 0;\n\tans += mc.minimum_cost_flow(0, 2*n, 1);\n\t//cout << rp[n] - ans << \"\\n\";\n\tans += mc.minimum_cost_flow(1, 2 * n, 1);\n\n\tans = 2 * rp[n] - ans;\n\tcout << ans << \"\\n\";\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//int t; cin >> t; rep(i, t)\n\t//while (cin>>s,s!=\".\")\n\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":780,"memory_kb":243348,"score_of_the_acc":-1.0571,"final_rank":6},{"submission_id":"aoj_2290_5801620","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=6005,INF=1<<29;\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];\nvector<int> id;\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 for(int v:id){\n for(auto e:G[v]){\n if(e.cap>0) chmin(h[e.to],h[v]+e.cost);\n }\n }\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 ll N,VV,xl,xr;cin>>N>>VV>>xl>>xr;\n vector<ll> X(N),T(N),P(N);\n for(int i=0;i<N;i++) cin>>X[i]>>T[i]>>P[i];\n V=2*N+4;\n int s=2*N,t=s+1,sl=s+2,sr=s+3;\n \n for(int i=0;i<N;i++){\n add_edge(i,N+i,1,-P[i]);\n add_edge(i,N+i,1,0);\n add_edge(N+i,t,2,0);\n \n if(abs(X[i]-xl)<=VV*T[i]) add_edge(sl,i,1,0);\n if(abs(X[i]-xr)<=VV*T[i]) add_edge(sr,i,1,0);\n \n for(int j=0;j<N;j++){\n if(T[i]>=T[j]) continue;\n if(abs(X[i]-X[j])<=VV*(T[j]-T[i])) add_edge(N+i,j,2,0);\n }\n }\n add_edge(s,sl,1,0);\n add_edge(s,sr,1,0);\n add_edge(s,t,2,0);\n \n vector<pair<ll,int>> S(N);\n for(int i=0;i<N;i++) S[i]=mp(T[i],i);\n sort(all(S));\n id.push_back(s);\n id.push_back(sl);\n id.push_back(sr);\n for(auto a:S){\n id.push_back(a.se);\n id.push_back(N+a.se);\n }\n id.push_back(t);\n \n cout<<-min_cost_flow(s,t,2)<<endl;\n}","accuracy":1,"time_ms":890,"memory_kb":244012,"score_of_the_acc":-1.0793,"final_rank":8},{"submission_id":"aoj_2290_5801611","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=6005;\nconst ll INF=1LL<<57;\n\ntypedef pair<ll,int> P;\n\nstruct edge{int to,cap;ll cost;int rev;};\n\nint V;\nvector<edge> G[MAX];\nll h[MAX];\nll dist[MAX];\nint prevv[MAX],preve[MAX];\nvector<int> id;\n\nvoid add_edge(int from,int to,int cap,ll 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\nll min_cost_flow(int s,int t,int f){\n ll res=0;\n fill(h,h+V,0);\n for(int v:id){\n for(auto e:G[v]){\n if(e.cap>0) chmin(h[e.to],h[v]+e.cost);\n }\n }\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 ll N,VV,xl,xr;cin>>N>>VV>>xl>>xr;\n vector<ll> X(N),T(N),P(N);\n for(int i=0;i<N;i++) cin>>X[i]>>T[i]>>P[i];\n V=2*N+2;\n int s=2*N,t=s+1;\n \n for(int i=0;i<N;i++){\n add_edge(i,N+i,1,-P[i]);\n add_edge(i,N+i,1,0);\n add_edge(N+i,t,2,0);\n \n if(abs(X[i]-xl)<=VV*T[i]) add_edge(s,i,1,0);\n if(abs(X[i]-xr)<=VV*T[i]) add_edge(s,i,1,0);\n \n for(int j=0;j<N;j++){\n if(T[i]>=T[j]) continue;\n if(abs(X[i]-X[j])<=VV*(T[j]-T[i])) add_edge(N+i,j,2,0);\n }\n }\n add_edge(s,t,2,0);\n \n vector<pair<ll,int>> S(N);\n for(int i=0;i<N;i++) S[i]=mp(T[i],i);\n sort(all(S));\n id.push_back(s);\n for(auto a:S){\n id.push_back(a.se);\n id.push_back(N+a.se);\n }\n id.push_back(t);\n \n cout<<-min_cost_flow(s,t,2)<<endl;\n}","accuracy":0.2653061224489796,"time_ms":150,"memory_kb":133056,"score_of_the_acc":-0.3664,"final_rank":20},{"submission_id":"aoj_2290_4869085","code_snippet":"#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2290\"\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\n// O(F E log V)\ntemplate<typename Flow, typename Cost>\nstruct PrimalDual{\n struct Edge{\n int dst;\n Flow cap;\n Cost cost;\n int rev;\n Edge(int dst,Flow cap,Cost cost,int rev):\n dst(dst),cap(cap),cost(cost),rev(rev){}\n };\n\n vector<vector<Edge>> G;\n vector<Cost> h,dist;\n vector<int> prevv,preve;\n\n PrimalDual(int n):G(n),h(n),dist(n),prevv(n),preve(n){}\n\n void add_edge(int u,int v,Flow cap,Cost cost){\n int e=G[u].size();\n int r=(u==v?e+1:G[v].size());\n G[u].emplace_back(v,cap,cost,r);\n G[v].emplace_back(u,0,-cost,e);\n }\n\n Cost residual_cost(int src,Edge &e){\n return e.cost+h[src]-h[e.dst];\n }\n\n void dijkstra(int s){\n struct P{\n Cost first;\n int second;\n P(Cost first,int second):first(first),second(second){}\n bool operator<(const P&a) const{return first>a.first;}\n };\n priority_queue<P> pq;\n\n dist[s]=0;\n pq.emplace(dist[s],s);\n while(!pq.empty()){\n P p=pq.top();pq.pop();\n int v=p.second;\n if(dist[v]<p.first) continue;\n for(int i=0;i<(int)G[v].size();i++){\n Edge &e=G[v][i];\n if(e.cap==0) continue;\n if(dist[v]+residual_cost(v,e)<dist[e.dst]){\n dist[e.dst]=dist[v]+e.cost+h[v]-h[e.dst];\n prevv[e.dst]=v;\n preve[e.dst]=i;\n pq.emplace(dist[e.dst],e.dst);\n }\n }\n }\n }\n\n Cost res;\n\n bool build(int s,int t,Flow f,\n function<void(decltype(h)&)> init=[](decltype(h) &p){\n fill(p.begin(),p.end(),0);\n }){\n res=0;\n init(h);\n const Cost INF = numeric_limits<Cost>::max();\n while(f>0){\n fill(dist.begin(),dist.end(),INF);\n dijkstra(s);\n if(dist[t]==INF) return false;\n\n for(int v=0;v<(int)h.size();v++)\n if(dist[v]<INF) h[v]=h[v]+dist[v];\n\n Flow d=f;\n for(int v=t;v!=s;v=prevv[v])\n d=min(d,G[prevv[v]][preve[v]].cap);\n\n f-=d;\n res=res+h[t]*d;\n for(int v=t;v!=s;v=prevv[v]){\n Edge &e=G[prevv[v]][preve[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n return true;\n }\n\n Cost get_cost(){return res;}\n};\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned geocon2013_B(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n using D = double;\n\n int n;\n cin>>n;\n vector<D> xs(n),ys(n);\n for(int i=0;i<n;i++) cin>>xs[i]>>ys[i];\n\n vector<int> pos,neg;\n for(int i=0;i<n;i++){\n if(xs[i]>0) pos.emplace_back(i);\n if(xs[i]<0) neg.emplace_back(i);\n }\n\n int f=max(pos.size(),neg.size());\n if(f==0){\n cout<<0<<endl;\n return 0;\n }\n\n PrimalDual<int, D> G(n+3);\n int S=n,T=n+1,U=n+2;\n for(int z:pos) G.add_edge(S,z,1,0);\n for(int z:neg) G.add_edge(z,T,1,0);\n\n int dif=pos.size()-neg.size();\n if(dif>0){\n G.add_edge(U,T,dif,0);\n for(int p:pos)\n G.add_edge(p,U,1,abs(xs[p]));\n }\n if(dif<0){\n G.add_edge(S,U,-dif,0);\n for(int q:neg)\n G.add_edge(U,q,1,abs(xs[q]));\n }\n\n for(int p:pos)\n for(int q:neg)\n G.add_edge(p,q,1,\n min(hypot(xs[p]+xs[q],ys[p]-ys[q]),abs(xs[p])+abs(xs[q])));\n\n assert(G.build(S,T,f));\n cout<<fixed<<setprecision(12)<<G.get_cost()<<endl;\n return 0;\n}\n/*\n verified on 2020/09/25\n https://atcoder.jp/contests/geocon2013/tasks/geocon2013_b\n*/\n\nsigned main(){\n geocon2013_B();\n return 0;\n}\n#endif\n\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n\n//BEGIN CUT HERE\nvector<int> identity(int n){\n vector<int> ord(n);\n iota(ord.begin(),ord.end(),0);\n return ord;\n}\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n,v,xleft,xright;\n cin>>n>>v>>xleft>>xright;\n\n int S=n+n,T=n+n+1,L=n+n+2,R=n+n+3;\n PrimalDual<int, int> G(n+n+4);\n\n G.add_edge(S,L,1,0);\n G.add_edge(L,T,1,0);\n\n G.add_edge(S,R,1,0);\n G.add_edge(R,T,1,0);\n\n vector<int> xs(n),ts(n),ps(n);\n for(int i=0;i<n;i++){\n cin>>xs[i]>>ts[i]>>ps[i];\n\n if(abs(xs[i]-xleft)<=ts[i]*v)\n G.add_edge(L,i,1,0);\n\n if(abs(xs[i]-xright)<=ts[i]*v)\n G.add_edge(R,i,1,0);\n }\n\n auto init=[&](auto &h)->void{\n fill(h.begin(),h.end(),0);\n\n auto ord=identity(n);\n sort(ord.begin(),ord.end(),\n [&](int i,int j){return ts[i]<ts[j];});\n\n auto add_edge=[&](int u,int v,int f,int c){\n G.add_edge(u,v,f,c);\n chmin(h[v],h[u]+c);\n };\n\n for(int i=0;i<n;i++){\n int x=ord[i];\n add_edge(x,n+x,1,-ps[x]);\n for(int j=i+1;j<n;j++){\n int y=ord[j];\n if(abs(xs[x]-xs[y])<=(ts[y]-ts[x])*v)\n add_edge(n+x,y,1,0);\n }\n add_edge(n+x,T,1,0);\n }\n };\n assert(G.build(S,T,2,init));\n cout<<-G.get_cost()<<endl;\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":245160,"score_of_the_acc":-1.065,"final_rank":7},{"submission_id":"aoj_2290_4869075","code_snippet":"#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2290\"\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\n// O(F E log V)\ntemplate<typename Flow, typename Cost>\nstruct PrimalDual{\n struct Edge{\n int dst;\n Flow cap;\n Cost cost;\n int rev;\n Edge(int dst,Flow cap,Cost cost,int rev):\n dst(dst),cap(cap),cost(cost),rev(rev){}\n };\n\n vector<vector<Edge>> G;\n vector<Cost> h,dist;\n vector<int> prevv,preve;\n\n PrimalDual(int n):G(n),h(n),dist(n),prevv(n),preve(n){}\n\n void add_edge(int u,int v,Flow cap,Cost cost){\n int e=G[u].size();\n int r=(u==v?e+1:G[v].size());\n G[u].emplace_back(v,cap,cost,r);\n G[v].emplace_back(u,0,-cost,e);\n }\n\n Cost residual_cost(int src,Edge &e){\n return e.cost+h[src]-h[e.dst];\n }\n\n void dijkstra(int s){\n struct P{\n Cost first;\n int second;\n P(Cost first,int second):first(first),second(second){}\n bool operator<(const P&a) const{return first>a.first;}\n };\n priority_queue<P> pq;\n\n dist[s]=0;\n pq.emplace(dist[s],s);\n while(!pq.empty()){\n P p=pq.top();pq.pop();\n int v=p.second;\n if(dist[v]<p.first) continue;\n for(int i=0;i<(int)G[v].size();i++){\n Edge &e=G[v][i];\n if(e.cap==0) continue;\n if(dist[v]+residual_cost(v,e)<dist[e.dst]){\n dist[e.dst]=dist[v]+e.cost+h[v]-h[e.dst];\n prevv[e.dst]=v;\n preve[e.dst]=i;\n pq.emplace(dist[e.dst],e.dst);\n }\n }\n }\n }\n\n Cost res;\n\n bool build(int s,int t,Flow f,\n function<void(decltype(h)&)> init=[](decltype(h) &p){\n fill(p.begin(),p.end(),0);\n }){\n res=0;\n init(h);\n const Cost INF = numeric_limits<Cost>::max();\n while(f>0){\n fill(dist.begin(),dist.end(),INF);\n dijkstra(s);\n if(dist[t]==INF) return false;\n\n for(int v=0;v<(int)h.size();v++)\n if(dist[v]<INF) h[v]=h[v]+dist[v];\n\n Flow d=f;\n for(int v=t;v!=s;v=prevv[v])\n d=min(d,G[prevv[v]][preve[v]].cap);\n\n f-=d;\n res=res+h[t]*d;\n for(int v=t;v!=s;v=prevv[v]){\n Edge &e=G[prevv[v]][preve[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n return true;\n }\n\n Cost get_cost(){return res;}\n};\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned geocon2013_B(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n using D = double;\n\n int n;\n cin>>n;\n vector<D> xs(n),ys(n);\n for(int i=0;i<n;i++) cin>>xs[i]>>ys[i];\n\n vector<int> pos,neg;\n for(int i=0;i<n;i++){\n if(xs[i]>0) pos.emplace_back(i);\n if(xs[i]<0) neg.emplace_back(i);\n }\n\n int f=max(pos.size(),neg.size());\n if(f==0){\n cout<<0<<endl;\n return 0;\n }\n\n PrimalDual<int, D> G(n+3);\n int S=n,T=n+1,U=n+2;\n for(int z:pos) G.add_edge(S,z,1,0);\n for(int z:neg) G.add_edge(z,T,1,0);\n\n int dif=pos.size()-neg.size();\n if(dif>0){\n G.add_edge(U,T,dif,0);\n for(int p:pos)\n G.add_edge(p,U,1,abs(xs[p]));\n }\n if(dif<0){\n G.add_edge(S,U,-dif,0);\n for(int q:neg)\n G.add_edge(U,q,1,abs(xs[q]));\n }\n\n for(int p:pos)\n for(int q:neg)\n G.add_edge(p,q,1,\n min(hypot(xs[p]+xs[q],ys[p]-ys[q]),abs(xs[p])+abs(xs[q])));\n\n assert(G.build(S,T,f));\n cout<<fixed<<setprecision(12)<<G.get_cost()<<endl;\n return 0;\n}\n/*\n verified on 2020/09/25\n https://atcoder.jp/contests/geocon2013/tasks/geocon2013_b\n*/\n\nsigned main(){\n geocon2013_B();\n return 0;\n}\n#endif\n\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n\n//BEGIN CUT HERE\nvector<int> identity(int n){\n vector<int> ord(n);\n iota(ord.begin(),ord.end(),0);\n return ord;\n}\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n,v,xleft,xright;\n cin>>n>>v>>xleft>>xright;\n\n int S=n+n,T=n+n+1,L=n+n+2,R=n+n+3;\n PrimalDual<int, int> G(n+n+4);\n\n G.add_edge(S,L,1,0);\n G.add_edge(L,T,1,0);\n\n G.add_edge(S,R,1,0);\n G.add_edge(R,T,1,0);\n\n vector<int> xs(n),ts(n),ps(n);\n for(int i=0;i<n;i++){\n cin>>xs[i]>>ts[i]>>ps[i];\n\n if(abs(xs[i]-xleft)<=ts[i]*v)\n G.add_edge(L,i,1,0);\n\n if(abs(xs[i]-xright)<=ts[i]*v)\n G.add_edge(R,i,1,0);\n\n G.add_edge(i,n+i,1,-ps[i]);\n G.add_edge(n+i,T,1,0);\n }\n\n for(int i=0;i<n;i++)\n for(int j=0;j<n;j++)\n if(ts[i]<ts[j] and abs(xs[i]-xs[j])<=(ts[j]-ts[i])*v)\n G.add_edge(n+i,j,1,0);\n\n auto init=[&](auto &h)->void{\n auto ord=identity(n);\n sort(ord.begin(),ord.end(),\n [&](int i,int j){return ts[i]<ts[j];});\n fill(h.begin(),h.end(),0);\n\n for(int i=0;i<n;i++){\n int x=ord[i];\n chmin(h[n+x],h[x]-ps[x]);\n for(int j=i+1;j<n;j++){\n int y=ord[j];\n if(abs(xs[x]-xs[y])<=(ts[y]-ts[x])*v)\n chmin(h[y],h[n+x]);\n }\n chmin(h[T],h[n+x]);\n }\n };\n assert(G.build(S,T,2,init));\n cout<<-G.get_cost()<<endl;\n return 0;\n}","accuracy":1,"time_ms":1050,"memory_kb":243112,"score_of_the_acc":-1.1017,"final_rank":16},{"submission_id":"aoj_2290_4869066","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Int = long long;\nconst char newl = '\\n';\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\ntemplate<typename T=int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n\n\n// O(F E log V)\ntemplate<typename Flow, typename Cost>\nstruct PrimalDual{\n struct Edge{\n int to;\n Flow cap;\n Cost cost;\n int rev;\n Edge(int to,Flow cap,Cost cost,int rev):\n to(to),cap(cap),cost(cost),rev(rev){}\n };\n\n vector<vector<Edge>> G;\n vector<Cost> h,dist;\n vector<int> prevv,preve;\n\n PrimalDual(int n):G(n),h(n),dist(n),prevv(n),preve(n){}\n\n void add_edge(int u,int v,Flow cap,Cost cost){\n int e=G[u].size();\n int r=(u==v?e+1:G[v].size());\n G[u].emplace_back(v,cap,cost,r);\n G[v].emplace_back(u,0,-cost,e);\n }\n\n void dijkstra(int s){\n // cout<<\"dijkstra\"<<endl;\n struct P{\n Cost first;\n int second;\n P(Cost first,int second):first(first),second(second){}\n bool operator<(const P&a) const{return first>a.first;}\n };\n priority_queue<P> pq;\n\n dist[s]=0;\n pq.emplace(dist[s],s);\n while(!pq.empty()){\n P p=pq.top();pq.pop();\n int v=p.second;\n if(dist[v]<p.first) continue;\n for(int i=0;i<(int)G[v].size();i++){\n Edge &e=G[v][i];\n if(e.cap==0) continue;\n // if(e.cost+h[v]-h[e.to]<0) cout<<e.cost+h[v]-h[e.to]<<endl;\n assert(e.cost+h[v]-h[e.to]>=0);\n if(dist[v]+e.cost+h[v]-h[e.to]<dist[e.to]){\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\n prevv[e.to]=v;\n preve[e.to]=i;\n pq.emplace(dist[e.to],e.to);\n }\n }\n }\n }\n\n Cost res;\n\n bool build(int s,int t,Flow f,\n function<void(decltype(h)&)> init=[](decltype(h) &p){\n fill(p.begin(),p.end(),0);\n }){\n res=0;\n init(h);\n const Cost INF = numeric_limits<Cost>::max();\n while(f>0){\n fill(dist.begin(),dist.end(),INF);\n dijkstra(s);\n if(dist[t]==INF) return false;\n\n for(int v=0;v<(int)h.size();v++)\n if(dist[v]<INF) h[v]=h[v]+dist[v];\n\n Flow d=f;\n for(int v=t;v!=s;v=prevv[v])\n d=min(d,G[prevv[v]][preve[v]].cap);\n\n f-=d;\n res=res+h[t]*d;\n for(int v=t;v!=s;v=prevv[v]){\n Edge &e=G[prevv[v]][preve[v]];\n e.cap-=d;\n G[v][e.rev].cap+=d;\n }\n }\n return true;\n }\n\n Cost get_cost(){return res;}\n};\n\n\nvector<int> identity(int n){\n vector<int> ord(n);\n iota(ord.begin(),ord.end(),0);\n return ord;\n}\n\n//INSERT ABOVE HERE\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n,v,xleft,xright;\n cin>>n>>v>>xleft>>xright;\n\n int S=n+n,T=n+n+1,L=n+n+2,R=n+n+3;\n PrimalDual<int, int> G(n+n+4);\n\n G.add_edge(S,L,1,0);\n G.add_edge(L,T,1,0);\n\n G.add_edge(S,R,1,0);\n G.add_edge(R,T,1,0);\n\n vector<int> xs(n),ts(n),ps(n);\n for(int i=0;i<n;i++){\n cin>>xs[i]>>ts[i]>>ps[i];\n\n if(abs(xs[i]-xleft)<=ts[i]*v)\n G.add_edge(L,i,1,0);\n\n if(abs(xs[i]-xright)<=ts[i]*v)\n G.add_edge(R,i,1,0);\n\n G.add_edge(i,n+i,1,-ps[i]);\n G.add_edge(n+i,T,1,0);\n }\n\n for(int i=0;i<n;i++)\n for(int j=0;j<n;j++)\n if(ts[i]<ts[j] and abs(xs[i]-xs[j])<=(ts[j]-ts[i])*v)\n G.add_edge(n+i,j,1,0);\n\n auto init=[&](auto &h)->void{\n auto ord=identity(n);\n sort(ord.begin(),ord.end(),\n [&](int i,int j){return ts[i]<ts[j];});\n fill(h.begin(),h.end(),0);\n\n for(int i=0;i<n;i++){\n int x=ord[i];\n chmin(h[n+x],h[x]-ps[x]);\n for(int j=i+1;j<n;j++){\n int y=ord[j];\n if(abs(xs[x]-xs[y])<=(ts[y]-ts[x])*v)\n chmin(h[y],h[n+x]);\n }\n chmin(h[T],h[n+x]);\n }\n };\n assert(G.build(S,T,2,init));\n cout<<-G.get_cost()<<endl;\n return 0;\n}","accuracy":1,"time_ms":1020,"memory_kb":243100,"score_of_the_acc":-1.0966,"final_rank":14},{"submission_id":"aoj_2290_4108846","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int mod = 1e9 + 7;\n// const int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\ntemplate< typename CapType, typename CostType >\nclass MinCostFlowDAG {\npublic:\n using Cat = CapType;\n using Cot = CostType;\n using pti = pair< Cot, int >;\n struct edge {\n int to, rev;\n Cat cap;\n Cot cost;\n };\n const int V;\n const Cot inf;\n vector< vector< edge > > G;\n vector< Cot > h, dist;\n vector< int > deg, ord, prevv, preve;\n\n MinCostFlowDAG(const int node_size) : V(node_size), inf(numeric_limits< Cot >::max() / 4),\n G(V), h(V, inf), dist(V), deg(V, 0), prevv(V), preve(V) {}\n\n void add_edge(const int from, const int to, const Cat cap, const Cot cost) {\n G[from].push_back((edge) {to, (int) G[to].size(), cap, cost});\n G[to].push_back((edge) {from, (int) G[from].size() - 1, 0, -cost});\n ++deg[to];\n }\n\n bool tsort() {\n queue< int > que;\n for(int i = 0; i < V; ++i) {\n if(deg[i] == 0) que.push(i);\n }\n while(!que.empty()) {\n const int p = que.front();\n que.pop();\n ord.push_back(p);\n for(auto &e : G[p]) {\n if(e.cap > 0 && --deg[e.to] == 0) que.push(e.to);\n }\n }\n return (*max_element(deg.begin(), deg.end()) == 0);\n }\n\n void calc_potential(const int s) {\n h[s] = 0;\n for(const int v : ord) {\n if(h[v] == inf) continue;\n for(edge &e : G[v]) {\n if(e.cap > 0) h[e.to] = min(h[e.to], h[v] + e.cost);\n }\n }\n }\n\n void Dijkstra(const int s) {\n priority_queue< pti, vector< pti >, greater< pti > > que;\n fill(dist.begin(), dist.end(), inf);\n dist[s] = 0;\n que.push(pti(0, s));\n while(!que.empty()) {\n pti p = que.top();\n que.pop();\n const int v = p.second;\n if(dist[v] < p.first) continue;\n for(int i = 0; i < (int) G[v].size(); ++i) {\n edge &e = G[v][i];\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\n prevv[e.to] = v, preve[e.to] = i;\n que.push(pti(dist[e.to], e.to));\n }\n }\n }\n }\n\n void update(const int s, const int t, Cat &f, Cot &res) {\n for(int i = 0; i < V; i++) {\n h[i] += dist[i];\n }\n Cat 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 += h[t] * d;\n for(int v = t; v != s; v = prevv[v]) {\n edge &e = G[prevv[v]][preve[v]];\n e.cap -= d;\n G[v][e.rev].cap += d;\n }\n }\n\n Cot solve(const int s, const int t, Cat f) {\n if(!tsort()) assert(false); // not DAG\n calc_potential(s);\n Cot res = 0;\n while(f > 0) {\n Dijkstra(s);\n if(dist[t] == inf) return -inf;\n update(s, t, f, res);\n }\n return res;\n }\n};\n\nint main() {\n int N, V, X[2];\n cin >> N >> V >> X[0] >> X[1];\n vector< int > P(N), T(N), S(N);\n for(int i = 0; i < N; i++) {\n cin >> P[i] >> T[i] >> S[i];\n }\n int src = 2 * N;\n int snk = src + 1;\n int latte = snk + 1;\n int malta = latte + 1;\n MinCostFlowDAG< int, int > flow(2 * N + 4);\n for(int i = 0; i < N; i++) {\n flow.add_edge(2 * i, 2 * i + 1, 1, -S[i]);\n flow.add_edge(2 * i + 1, snk, 1, 0);\n if(abs(X[0] - P[i]) <= 1LL * T[i] * V) flow.add_edge(latte, 2 * i, 1, 0);\n if(abs(X[1] - P[i]) <= 1LL * T[i] * V) flow.add_edge(malta, 2 * i, 1, 0);\n for(int j = 0; j < N; j++) {\n if(i == j) continue;\n if(abs(P[i] - P[j]) <= 1LL * V * (T[j] - T[i])) {\n flow.add_edge(2 * i + 1, 2 * j, 1, 0);\n }\n }\n }\n flow.add_edge(src, snk, 2, 0);\n flow.add_edge(src, latte, 1, 0);\n flow.add_edge(src, malta, 1, 0);\n cout << -flow.solve(src, snk, 2) << endl;\n}","accuracy":1,"time_ms":1200,"memory_kb":242392,"score_of_the_acc":-1.1234,"final_rank":18},{"submission_id":"aoj_2290_4108810","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 ...Ts>\ndecltype(auto) zip(vector<Ts>... args){\n vector<decltype(make_tuple(args[0]...))> res;\n int n=min({args.size()...});\n res.reserve(n);\n for(int i=0;i<n;i++) res.emplace_back(args[i]...);\n return res;\n}\n\ntemplate<typename V>\nV compress(V v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n return v;\n}\ntemplate<typename T>\nmap<T, int> dict(const vector<T> &v){\n map<T, int> res;\n for(int i=0;i<(int)v.size();i++)\n res[v[i]]=i;\n return res;\n}\nmap<char, int> dict(const string &v){\n return dict(vector<char>(v.begin(),v.end()));\n}\n\n\ntemplate<typename F>\nstruct FixPoint : F{\n FixPoint(F&& f):F(forward<F>(f)){}\n template<typename... Args>\n decltype(auto) operator()(Args&&... args) const{\n return F::operator()(*this,forward<Args>(args)...);\n }\n};\ntemplate<typename F>\ninline decltype(auto) MFP(F&& f){\n return FixPoint<F>{forward<F>(f)};\n}\n\n//INSERT ABOVE HERE\nconst int MAX = 3030;\nint dp[MAX][MAX]={};\nint rs[MAX][MAX]={};\n\nconst int INF = 1e9;\ntemplate<typename T>\nstruct BIT{\n int n;\n vector<T> bit;\n //1-indexed\n BIT(int n_):n(n_+2),bit(n,-INF){}\n\n T sum(int i){\n i++;\n\n T s(-INF);\n for(int x=i;x>0;x-=(x&-x))\n chmax(s,bit[x]);\n return s;\n }\n\n void add(int i,T a){\n i++;\n\n for(int x=i;x<n;x+=(x&-x))\n chmax(bit[x],a);\n }\n};\n\nsigned main(){\n int n,v,xl,xr;\n cin>>n>>v>>xl>>xr;\n\n vector<int> xs(n),ts(n),ps(n);\n for(int i=0;i<n;i++) cin>>xs[i]>>ts[i]>>ps[i];\n xs.emplace_back(xl);\n ts.emplace_back(0);\n ps.emplace_back(0);\n xs.emplace_back(xr);\n ts.emplace_back(0);\n ps.emplace_back(0);\n\n xs.emplace_back(0);\n ts.emplace_back(INF);\n ps.emplace_back(0);\n\n n=xs.size();\n auto zs=zip(ts,xs,ps);\n sort(zs.begin(),zs.end());\n for(int i=0;i<n;i++)\n tie(ts[i],xs[i],ps[i])=zs[i];\n\n using ll = long long;\n for(int i=0;i<n;i++)\n for(int j=i+1;j<n;j++)\n rs[i][j]=abs(xs[j]-xs[i])<=(ll)v*(ts[j]-ts[i]);\n\n for(int i=0;i<MAX;i++)\n for(int j=0;j<MAX;j++)\n dp[i][j]=-INF;\n dp[0][1]=0;\n\n vector<ll> as(n),bs(n);\n for(int i=0;i<n;i++){\n as[i]=-xs[i]+(ll)v*ts[i];\n bs[i]=+xs[i]+(ll)v*ts[i];\n }\n\n auto da=dict(compress(as));\n auto db=dict(compress(bs));\n vector<int> va(n),vb(n);\n for(int i=0;i<n;i++){\n va[i]=da[as[i]];\n vb[i]=db[bs[i]];\n }\n\n using P = pair<ll, ll>;\n vector<P> vp,vq;\n for(int l=0;l<n;l++){\n vp.emplace_back(+xs[l],l);\n vq.emplace_back(-xs[l],l);\n }\n sort(vp.begin(),vp.end());\n sort(vq.begin(),vq.end());\n\n for(int c=1;c<n;c++){\n {\n MFP([&](auto dfs,int l,int r)->void{\n if(l+1==r) return;\n int m=(l+r)>>1;\n\n dfs(l,m);\n\n if(r-l<=100){\n for(int a=l;a<m;a++)\n for(int b=m;b<r;b++)\n if(rs[a][b])\n chmax(dp[b][c],dp[a][c]+ps[b]);\n\n }else{\n for(int k=0;k<2;k++){\n vector<P> vp;\n for(int a=l;a<m;a++)\n vp.emplace_back(k?+xs[a]:-xs[a],a+0);\n for(int b=m;b<r;b++)\n vp.emplace_back(k?+xs[b]:-xs[b],b+n);\n sort(vp.begin(),vp.end());\n\n vector<ll> vs;\n for(int i=l;i<r;i++)\n vs.emplace_back(k?as[i]:bs[i]);\n auto cs=compress(vs);\n vector<ll> ws(r-l);\n for(int i=0;i<r-l;i++)\n ws[i]=lower_bound(cs.begin(),cs.end(),vs[i])-cs.begin();\n\n BIT<int> bit(cs.size());\n for(auto p:vp){\n if(p.second<n){\n int a=p.second;\n bit.add(ws[a-l],dp[a][c]);\n }else{\n int b=p.second-n;\n chmax(dp[b][c],bit.sum(ws[b-l])+ps[b]);\n }\n }\n }\n }\n\n dfs(m,r);\n })(0,c);\n }\n\n\n for(int k=0;k<2;k++){\n auto &vv=k?vp:vq;\n auto &vw=k?va:vb;\n BIT<int> bit(n+10);\n for(auto p:vv){\n if(p.second<c){\n int l=p.second;\n bit.add(vw[l],dp[l][c]);\n }\n if(p.second>c){\n int r=p.second;\n chmax(dp[c][r],bit.sum(vw[r])+ps[r]);\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 chmax(ans,dp[i][j]);\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":5920,"memory_kb":67332,"score_of_the_acc":-1,"final_rank":4},{"submission_id":"aoj_2290_4107478","code_snippet":"//#define NDEBUG\n#include <algorithm>\n#include <cstddef>\n#include <cstdint>\n#include <iostream>\n#include <utility>\n#include <vector>\n\nnamespace n91 {\n\nusing i8 = std::int_fast8_t;\nusing i32 = std::int_fast32_t;\nusing i64 = std::int_fast64_t;\nusing u8 = std::uint_fast8_t;\nusing u32 = std::uint_fast32_t;\nusing u64 = std::uint_fast64_t;\nusing isize = std::ptrdiff_t;\nusing usize = std::size_t;\n\nstruct rep {\n struct itr {\n usize i;\n constexpr itr(const usize i) noexcept : i(i) {}\n void operator++() noexcept { ++i; }\n constexpr usize operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\n };\n const itr f, l;\n constexpr rep(const usize f, const usize l) noexcept\n : f(std::min(f, l)), l(l) {}\n constexpr auto begin() const noexcept { return f; }\n constexpr auto end() const noexcept { return l; }\n};\nstruct revrep {\n struct itr {\n usize i;\n constexpr itr(const usize i) noexcept : i(i) {}\n void operator++() noexcept { --i; }\n constexpr usize operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\n };\n const itr f, l;\n constexpr revrep(const usize f, const usize l) noexcept\n : f(l - 1), l(std::min(f, l) - 1) {}\n constexpr auto begin() const noexcept { return f; }\n constexpr auto end() const noexcept { return l; }\n};\ntemplate <class T> auto md_vec(const usize n, const T &value) {\n return std::vector<T>(n, value);\n}\ntemplate <class... Args> auto md_vec(const usize n, Args... args) {\n return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));\n}\ntemplate <class T> constexpr T difference(const T &a, const T &b) noexcept {\n if (a < b) {\n return b - a;\n } else {\n return a - b;\n }\n}\ntemplate <class T> void chmin(T &a, const T &b) noexcept {\n if (b < a) {\n a = b;\n }\n}\ntemplate <class T> void chmax(T &a, const T &b) noexcept {\n if (a < b) {\n a = b;\n }\n}\ntemplate <class F> class fix_point : private F {\npublic:\n explicit constexpr fix_point(F &&f) : F(std::forward<F>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n};\ntemplate <class F> constexpr decltype(auto) make_fix(F &&f) {\n return fix_point<F>(std::forward<F>(f));\n}\ntemplate <class T> T scan() {\n T ret;\n std::cin >> ret;\n return ret;\n}\n\n} // namespace n91\n#include <cassert>\n#include <cstddef>\n#include <vector>\n\ntemplate <class Monoid> class segment_tree {\npublic:\n using T = typename Monoid::value_type;\n using size_t = std::size_t;\n\nprivate:\n std::vector<T> tree;\n\n template <class F>\n size_t search_subtree(size_t index, const F f, T fold_l) const {\n while (index < size()) {\n const T temp = Monoid::operation(fold_l, tree[index * 2]);\n if (!f(temp)) {\n index = index * 2;\n } else {\n fold_l = temp;\n index = index * 2 + 1;\n }\n }\n return index - size();\n }\n\npublic:\n segment_tree() = default;\n explicit segment_tree(const size_t n) : tree(n * 2, Monoid::identity) {}\n\n size_t size() const noexcept { return tree.size() / 2; }\n\n T fold(size_t first, size_t last) const {\n assert(first <= last);\n assert(last <= size());\n first += size();\n last += size();\n T fold_l = Monoid::identity;\n T fold_r = Monoid::identity;\n while (first != last) {\n if (first % 2 != 0) {\n fold_l = Monoid::operation(fold_l, tree[first]);\n first += 1;\n }\n first /= 2;\n if (last % 2 != 0) {\n last -= 1;\n fold_r = Monoid::operation(tree[last], fold_r);\n }\n last /= 2;\n }\n return Monoid::operation(fold_l, fold_r);\n }\n template <class F> size_t search(size_t first, size_t last, const F f) const {\n assert(first <= last);\n assert(last <= size());\n first += size();\n last += size();\n const size_t last_cp = last;\n size_t shift = 0;\n T fold_l = Monoid::identity;\n while (first != last) {\n if (first % 2 != 0) {\n const T temp = Monoid::operation(fold_l, tree[first]);\n if (!f(temp))\n return search_subtree(first, f, fold_l);\n fold_l = temp;\n first += 1;\n }\n first /= 2;\n last /= 2;\n shift += 1;\n }\n while (shift != 0) {\n shift -= 1;\n last = last_cp >> shift;\n if (last % 2 != 0) {\n last -= 1;\n const T temp = Monoid::operation(fold_l, tree[last]);\n if (!f(temp))\n return search_subtree(last, f, fold_l);\n fold_l = temp;\n }\n }\n return last_cp - size();\n }\n\n void update(size_t index, const T x) {\n assert(index < size());\n index += size();\n tree[index] = x;\n while (index != 1) {\n index /= 2;\n tree[index] = Monoid::operation(tree[index * 2], tree[index * 2 + 1]);\n }\n }\n};\n#include <algorithm>\n#include <limits>\n\ntemplate <class T> class max_monoid {\npublic:\n using value_type = T;\n static constexpr T operation(const T &x, const T &y) noexcept {\n return std::max(x, y);\n }\n static constexpr T identity = std::numeric_limits<T>::lowest();\n};\ntemplate <class T> constexpr T max_monoid<T>::identity;\n#include <algorithm>\n#include <iostream>\n#include <map>\n#include <tuple>\n#include <utility>\n#include <vector>\n\nnamespace n91 {\n\nvoid main_() {\n /*\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n //*/\n const usize n = scan<usize>();\n const i32 v = scan<i32>();\n const i32 xl = scan<i32>();\n const i32 xr = scan<i32>();\n struct mogu_t {\n i32 x;\n i32 y;\n u32 p;\n bool f;\n };\n std::vector<mogu_t> ms(n);\n std::map<i32, usize> mp;\n for (auto &e : ms) {\n e.f = false;\n const i32 x = scan<i32>();\n const i32 t = scan<i32>();\n const u32 p = scan<u32>();\n e.x = -t * v + x;\n e.y = -t * v - x;\n e.p = p;\n mp[e.y];\n }\n ms.push_back({xl, -xl, 0, true});\n ms.push_back({xr, -xr, 0, true});\n mp[-xl];\n mp[-xr];\n {\n usize c = 0;\n for (auto &e : mp)\n e.second = c++;\n }\n std::sort(ms.begin(), ms.end(), [](auto l, auto r) {\n return std::tie(l.x, l.y) < std::tie(r.x, r.y);\n });\n using seg_t = segment_tree<max_monoid<u32>>;\n const usize m = mp.size();\n std::vector<seg_t> dp(m, seg_t(m));\n usize ph = 0;\n for (const auto &e : ms) {\n if (e.f) {\n ph += 1;\n continue;\n }\n const usize k = mp[e.y];\n if (ph <= 1)\n dp[k].update(k, dp[k].fold(0, k + 1) + e.p);\n for (const usize i : rep(0, m)) {\n if (i == k)\n continue;\n const u32 v = dp[i].fold(0, k + 1) + e.p;\n if (ph <= 1)\n dp[i].update(k, v);\n if (ph <= 0)\n dp[k].update(i, v);\n }\n /*\n std::cout << \"\\n\";\n for (const auto i : rep(0, m)) {\n for (const auto j : rep(0, m)) {\n std::cout << dp[i].fold(j, j + 1) << \" \";\n }\n std::cout << \"\\n\";\n }\n */\n }\n u32 ans = 0;\n for (const auto i : rep(0, mp[-xl] + 1)) {\n chmax(ans, dp[i].fold(0, mp[-xr] + 1));\n }\n std::cout << ans << std::endl;\n}\n\n} // namespace n91\n\nint main() {\n n91::main_();\n return 0;\n}","accuracy":1,"time_ms":1580,"memory_kb":144140,"score_of_the_acc":-0.6683,"final_rank":2},{"submission_id":"aoj_2290_3546450","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <queue>\n#include <functional>\n#include <climits>\nstruct Mole {\n\tint position, time, score;\n\tMole(const int x, const int t, const int p) : position{ x }, time{ t }, score{ p }{};\n\tMole() :Mole(0, 0, 0) {};\n};\nstruct Edge {\n\tint to, pair, cost;\n\tbool flow;\n\tEdge(int t, int p, int c, bool f) : to{ t }, pair{ p }, cost{ c }, flow{ f }{};\n\tEdge() : Edge(0, 0, 0, false) {}\n};\nvoid setEdge(const int from, const int to, const int cost, std::vector<std::vector<Edge>>& nodes) {\n\tnodes[from].push_back(Edge(to, nodes[to].size(), cost, true));\n\tnodes[to].push_back(Edge(from, nodes[from].size() - 1, -cost, false));\n}\nint solve(const long velocity, const int left, const int right, const std::vector<Mole>& mole) {\n\tstd::vector<std::vector<Edge>> nodes(mole.size() * 2 + 4);\n\tconst int start_left = nodes.size() - 4;\n\tconst int start_right = nodes.size() - 3;\n\tconst int start = nodes.size() - 2;\n\tconst int goal = nodes.size() - 1;\n\tsetEdge(start, start_left, 0, nodes);\n\tsetEdge(start, start_right, 0, nodes);\n\tstd::vector<int> sum_cost(mole.size() + 1, 0);\n\tfor (auto i = 1; i < sum_cost.size(); ++i) sum_cost[i] = sum_cost[i - 1] + mole[i - 1].score;\n\tsetEdge(start_left, goal, sum_cost.back(), nodes);\n\tsetEdge(start_right, goal, sum_cost.back(), nodes);\n\tfor (auto i = 0; i < mole.size(); ++i) {\n\t\tauto m = mole[i];\n\t\tif (std::abs(left - m.position) <= m.time * velocity) {\n\t\t\tsetEdge(start_left, i * 2, sum_cost[i], nodes);\n\t\t}\n\t\tif (std::abs(right - m.position) <= m.time * velocity) {\n\t\t\tsetEdge(start_right, i * 2, sum_cost[i], nodes);\n\t\t}\n\t\tsetEdge(i * 2, i * 2 + 1, 0, nodes);\n\t\tsetEdge(i * 2 + 1, goal, sum_cost.back() - sum_cost[i + 1], nodes);\n\t}\n\tfor (auto i = 0; i < mole.size(); ++i) {\n\t\tfor (auto j = i + 1; j < mole.size(); ++j) {\n\t\t\tif (std::abs(mole[i].position - mole[j].position) <= (mole[j].time - mole[i].time) * velocity) {\n\t\t\t\tsetEdge(i * 2 + 1, j * 2, sum_cost[j] - sum_cost[i + 1], nodes);\n\t\t\t}\n\t\t}\n\t}\n\tstd::vector<int> potential(nodes.size(), 0);\n\tstd::vector<int> min_cost(nodes.size(), 0);\n\tstd::priority_queue<std::tuple<int, int>, std::vector<std::tuple<int, int>>, std::function<bool(const std::tuple<int, int>&, const std::tuple<int, int>&)>> empty_queue([](const std::tuple<int, int> & a, const std::tuple<int, int> & b) {return std::get<1>(a) > std::get<1>(b); });\n\tstd::vector<Edge> prev_edge(nodes.size());\n\tint result = 0;\n\tfor (auto repeat = 0; repeat < 2; ++repeat) {\n\t\tfor (auto i = 0; i < min_cost.size(); ++i) min_cost[i] = INT_MAX;\n\t\tauto queue = empty_queue;\n\t\tmin_cost[start] = 0;\n\t\tqueue.push(std::make_tuple(start, 0));\n\t\twhile (std::get<0>(queue.top()) != goal) {\n\t\t\tauto current = std::get<0>(queue.top());\n\t\t\tauto cost = std::get<1>(queue.top());\n\t\t\tqueue.pop();\n\t\t\tif (min_cost[current] == cost) {\n\t\t\t\tfor (const auto next : nodes[current]) if (next.flow) {\n\t\t\t\t\tif (min_cost[next.to] > cost + potential[current] - potential[next.to] + next.cost) {\n\t\t\t\t\t\tmin_cost[next.to] = cost + potential[current] - potential[next.to] + next.cost;\n\t\t\t\t\t\tprev_edge[next.to] = next;\n\t\t\t\t\t\tqueue.push(std::make_tuple(next.to, min_cost[next.to]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tresult += sum_cost.back() - min_cost[goal];\n\t\tauto last = goal;\n\t\twhile (last != start) {\n\t\t\tauto edge = prev_edge[last];\n\t\t\tauto& rev = nodes[edge.to][edge.pair];\n\t\t\trev.flow = true;\n\t\t\tnodes[rev.to][rev.pair].flow = false;\n\t\t\tlast = rev.to;\n\t\t}\n\t\tfor (auto i = 0; i < start; ++i) potential[i] += min_cost[i];\n\t}\n\treturn result;\n}\nint main() {\n\tint n, v, left, right; std::cin >> n >> v >> left >> right;\n\tstd::vector<Mole> mole(n);\n\tfor (auto& m : mole) std::cin >> m.position >> m.time >> m.score;\n\tstd::sort(mole.begin(), mole.end(), [](const Mole a, const Mole b) {return a.time < b.time; });\n\tstd::cout << solve(v, left, right, mole) << std::endl;\n}","accuracy":1,"time_ms":1150,"memory_kb":240728,"score_of_the_acc":-1.1061,"final_rank":17},{"submission_id":"aoj_2290_3375794","code_snippet":"// https://onlinejudge.u-aizu.ac.jp/challenges/search/categories/2290\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <limits>\ntemplate <typename T>\nconstexpr T INF() { return std::numeric_limits<T>::max() / 16; }\n#include <vector>\ntemplate <typename Cap, typename Cost, typename Ind = std::size_t>\nstruct CostFlow\n{\n CostFlow(const Ind v) : V(v), edge(v) { edge.shrink_to_fit(); }\n void addEdge(const Ind from, const Ind to, const Cap cap, const Cost cost) { edge[from].push_back(Edge{to, (Ind)edge[to].size(), cap, cost, false}), edge[to].push_back(Edge{from, (Ind)(edge[from].size() - 1), 0, -cost, true}); }\n struct Edge\n {\n Ind to, rev;\n Cap cap;\n Cost cost;\n const bool isrev;\n };\n const Ind V;\n std::vector<std::vector<Edge>> edge;\n};\ntemplate <typename T, template <typename, typename, typename, typename> class PotFunc, typename Cap, typename Cost, typename Ind>\nstd::pair<bool, T> PrimalDual(CostFlow<Cap, Cost, Ind>& cflow, const Ind s, const Ind t, Cap f)\n{\n const Ind V = cflow.V;\n T ans = 0;\n std::vector<T> potential = PotFunc<T, Cap, Cost, Ind>()(cflow, s);\n std::vector<T> dist(V, INF<T>());\n using P = std::pair<T, Ind>;\n std::priority_queue<P, std::vector<P>, std::greater<P>> Q;\n std::vector<Ind> prev_v(V), prev_e(V);\n dist.shrink_to_fit(), prev_v.shrink_to_fit(), prev_e.shrink_to_fit();\n while (f > 0) {\n std::fill(dist.begin(), dist.end(), INF<T>());\n dist[s] = 0, Q.push({0, s});\n while (not Q.empty()) {\n const T cost = Q.top().first;\n const Ind v = Q.top().second;\n Q.pop();\n if (dist[v] < cost) { continue; }\n for (Ind i = 0; i < (Ind)cflow.edge[v].size(); i++) {\n const auto& e = cflow.edge[v][i];\n const T pd = potential[v] - potential[e.to];\n if (e.cap == 0 or dist[e.to] <= dist[v] + (T)e.cost + pd) { continue; }\n dist[e.to] = dist[v] + (T)e.cost + pd, prev_v[e.to] = v, prev_e[e.to] = i;\n Q.push({dist[e.to], e.to});\n }\n }\n if (dist[t] == INF<T>()) { return {false, ans}; }\n for (Ind v = 0; v < V; v++) { potential[v] += dist[v]; }\n Cap d = f;\n for (Ind v = t; v != s; v = prev_v[v]) {\n const auto& e = cflow.edge[prev_v[v]][prev_e[v]];\n d = std::min(d, e.cap);\n }\n f = (Cap)(f - d), ans += (T)d * potential[t];\n for (Ind v = t; v != s; v = prev_v[v]) {\n auto& e = cflow.edge[prev_v[v]][prev_e[v]];\n e.cap = (Cap)(e.cap - d), cflow.edge[v][e.rev].cap = (Cap)(cflow.edge[v][e.rev].cap + d);\n }\n }\n return {true, ans};\n}\n#include <algorithm>\n#include <algorithm>\n#include <vector>\nstruct Graph\n{\n Graph(const std::size_t v) : V{v}, edge(v), rev_edge(v) {}\n void addEdge(const std::size_t from, const std::size_t to) { edge[from].push_back(to), rev_edge[to].push_back(from); }\n const std::size_t V;\n std::vector<std::vector<std::size_t>> edge, rev_edge;\n};\nstd::pair<bool, std::vector<std::size_t>> TopSort(const Graph& g)\n{\n std::vector<std::size_t> srt, used(g.V, 0);\n auto dfs = [&](auto&& self, const std::size_t s) -> bool {\n if (used[s] == 1) {\n return false;\n } else if (used[s] == 0) {\n used[s] = 1;\n for (const std::size_t to : g.edge[s]) {\n if (not self(self, to)) { return false; }\n }\n used[s] = 2, srt.push_back(s);\n }\n return true;\n };\n for (std::size_t i = 0; i < g.V; i++) {\n if (not dfs(dfs, i)) { return {false, srt}; }\n }\n std::reverse(srt.begin(), srt.end());\n return {true, srt};\n}\ntemplate <typename T, typename Cap, typename Cost, typename Ind>\nstruct PotDAG\n{\n std::vector<T> operator()(const CostFlow<Cap, Cost, Ind>& cflow, const Ind s) const\n {\n const Ind V = cflow.V;\n std::vector<Ind> ord;\n std::vector<bool> used(V, 0);\n auto dfs = [&](auto&& self, const Ind s) -> void {\n if (not used[s]) {\n used[s] = true;\n for (const auto& e : cflow.edge[s]) {\n if (e.cap == 0) { continue; }\n self(self, e.to);\n }\n ord.push_back(s);\n }\n };\n for (Ind i = 0; i < V; i++) { dfs(dfs, i); }\n std::reverse(ord.begin(), ord.end());\n std::vector<T> ans(V, INF<T>());\n ans.shrink_to_fit();\n for (Ind i = 0; i < V; i++) {\n if (ord[i] == s) { ans[s] = (T)0; }\n for (const auto& e : cflow.edge[ord[i]]) {\n if (e.cap == 0) { continue; }\n ans[e.to] = std::min(ans[e.to], ans[ord[i]] + (T)e.cost);\n }\n }\n return ans;\n }\n};\nstruct Point\n{\n int X, T, P;\n bool operator<(const Point& p) const\n {\n return T < p.T;\n }\n};\n\nint main()\n{\n short N;\n std::cin >> N;\n std::size_t V, L, R;\n std::cin >> V >> L >> R;\n std::vector<Point> point(N);\n point.shrink_to_fit();\n for (short i = 0; i < N; i++) { std::cin >> point[i].X >> point[i].T >> point[i].P; }\n std::sort(point.begin(), point.end());\n CostFlow<char, int, short> cflow((short)(2 * N + 4));\n const short s = 0, t = (short)(2 * N + 3), l = 1, r = 2;\n cflow.addEdge(s, l, 1, 0), cflow.addEdge(s, r, 1, 0);\n for (short i = 0; i < N; i++) {\n cflow.addEdge((short)(2 * i + 3), (short)(2 * i + 4), 1, 0), cflow.addEdge((short)(2 * i + 4), t, 1, -point[i].P);\n if (std::abs(point[i].X - (int)L) <= V * point[i].T) { cflow.addEdge(l, (short)(2 * i + 3), 1, 0); }\n if (std::abs(point[i].X - (int)R) <= V * point[i].T) { cflow.addEdge(r, (short)(2 * i + 3), 1, 0); }\n }\n for (short i = 0; i < N; i++) {\n for (short j = (short)(i + 1); j < N; j++) {\n if (std::abs(point[i].X - point[j].X) <= V * (point[j].T - point[i].T)) { cflow.addEdge((short)(2 * i + 4), (short)(2 * j + 3), 1, -point[i].P); }\n }\n }\n point.clear(), point.shrink_to_fit();\n std::cout << -PrimalDual<int, PotDAG>(cflow, s, t, (char)2).second << std::endl;\n\n return 0;\n}","accuracy":1,"time_ms":1010,"memory_kb":241836,"score_of_the_acc":-1.0882,"final_rank":11},{"submission_id":"aoj_2290_3375076","code_snippet":"// https://onlinejudge.u-aizu.ac.jp/challenges/search/categories/2290\n// MLEです (頂点型をshortにして、容量型をcharにすると多分通ります)\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <limits>\ntemplate <typename T>\nconstexpr T INF() { return std::numeric_limits<T>::max() / 16; }\n#include <vector>\ntemplate <typename Cap, typename Cost, typename Ind = std::size_t>\nstruct CostFlow\n{\n CostFlow(const Ind v) : V(v), edge(v) { edge.shrink_to_fit(); }\n void addEdge(const Ind from, const Ind to, const Cap cap, const Cost cost) { edge[from].push_back(Edge{to, (Ind)edge[to].size(), cap, cost, false}), edge[to].push_back(Edge{from, (Ind)(edge[from].size() - 1), 0, -cost, true}); }\n struct Edge\n {\n Ind to, rev;\n Cap cap;\n Cost cost;\n const bool isrev;\n };\n const Ind V;\n std::vector<std::vector<Edge>> edge;\n};\ntemplate <typename T, template <typename, typename, typename, typename> class PotFunc, typename Cap, typename Cost, typename Ind>\nstd::pair<bool, T> PrimalDual(CostFlow<Cap, Cost, Ind>& cflow, const Ind s, const Ind t, Cap f)\n{\n const Ind V = cflow.V;\n T ans = 0;\n std::vector<T> potential = PotFunc<T, Cap, Cost, Ind>()(cflow, s);\n std::vector<T> dist(V, INF<T>());\n using P = std::pair<T, Ind>;\n std::priority_queue<P, std::vector<P>, std::greater<P>> Q;\n std::vector<Ind> prev_v(V), prev_e(V);\n dist.shrink_to_fit(), prev_v.shrink_to_fit(), prev_e.shrink_to_fit();\n while (f > 0) {\n std::fill(dist.begin(), dist.end(), INF<T>());\n dist[s] = 0, Q.push({0, s});\n while (not Q.empty()) {\n const T cost = Q.top().first;\n const Ind v = Q.top().second;\n Q.pop();\n if (dist[v] < cost) { continue; }\n for (Ind i = 0; i < cflow.edge[v].size(); i++) {\n const auto& e = cflow.edge[v][i];\n const T pd = potential[v] - potential[e.to];\n if (e.cap == 0 or dist[e.to] <= dist[v] + e.cost + pd) { continue; }\n dist[e.to] = dist[v] + e.cost + pd, prev_v[e.to] = v, prev_e[e.to] = i;\n Q.push({dist[e.to], e.to});\n }\n }\n if (dist[t] == INF<T>()) { return {false, ans}; }\n for (Ind v = 0; v < V; v++) { potential[v] += dist[v]; }\n Cap d = f;\n for (Ind v = t; v != s; v = prev_v[v]) {\n const auto& e = cflow.edge[prev_v[v]][prev_e[v]];\n d = std::min(d, e.cap);\n }\n f -= d, ans += (T)d * potential[t];\n for (Ind v = t; v != s; v = prev_v[v]) {\n auto& e = cflow.edge[prev_v[v]][prev_e[v]];\n e.cap -= d, cflow.edge[v][e.rev].cap += d;\n }\n }\n return {true, ans};\n}\n#include <algorithm>\n#include <algorithm>\n#include <vector>\nstruct Graph\n{\n Graph(const std::size_t v) : V{v}, edge(v), rev_edge(v) {}\n void addEdge(const std::size_t from, const std::size_t to) { edge[from].push_back(to), rev_edge[to].push_back(from); }\n const std::size_t V;\n std::vector<std::vector<std::size_t>> edge, rev_edge;\n};\nstd::pair<bool, std::vector<std::size_t>> TopSort(const Graph& g)\n{\n std::vector<std::size_t> srt, used(g.V, 0);\n auto dfs = [&](auto&& self, const std::size_t s) -> bool {\n if (used[s] == 1) {\n return false;\n } else if (used[s] == 0) {\n used[s] = 1;\n for (const std::size_t to : g.edge[s]) {\n if (not self(self, to)) { return false; }\n }\n used[s] = 2, srt.push_back(s);\n }\n return true;\n };\n for (std::size_t i = 0; i < g.V; i++) {\n if (not dfs(dfs, i)) { return {false, srt}; }\n }\n std::reverse(srt.begin(), srt.end());\n return {true, srt};\n}\ntemplate <typename T, typename Cap, typename Cost, typename Ind>\nstruct PotDAG\n{\n std::vector<T> operator()(const CostFlow<Cap, Cost, Ind>& cflow, const Ind s) const\n {\n const Ind V = cflow.V;\n std::vector<Ind> ord;\n std::vector<bool> used(V, 0);\n auto dfs = [&](auto&& self, const Ind s) -> void {\n if (not used[s]) {\n used[s] = true;\n for (const auto& e : cflow.edge[s]) {\n if (e.cap == 0) { continue; }\n self(self, e.to);\n }\n ord.push_back(s);\n }\n };\n for (Ind i = 0; i < V; i++) { dfs(dfs, i); }\n std::reverse(ord.begin(), ord.end());\n std::vector<T> ans(V, INF<T>());\n ans.shrink_to_fit();\n for (Ind i = 0; i < V; i++) {\n if (ord[i] == s) { ans[s] = 0; }\n for (const auto& e : cflow.edge[ord[i]]) {\n if (e.cap == 0) { continue; }\n ans[e.to] = std::min(ans[e.to], ans[ord[i]] + e.cost);\n }\n }\n return ans;\n }\n};\nstruct Point\n{\n int X, T, P;\n bool operator<(const Point& p) const\n {\n return T < p.T;\n }\n};\n\nint main()\n{\n short N;\n std::cin >> N;\n std::size_t V, L, R;\n std::cin >> V >> L >> R;\n std::vector<Point> point(N);\n point.shrink_to_fit();\n for (short i = 0; i < N; i++) { std::cin >> point[i].X >> point[i].T >> point[i].P; }\n std::sort(point.begin(), point.end());\n CostFlow<char, int, short> cflow(2 * N + 4);\n const short s = 0, t = 2 * N + 3, l = 1, r = 2;\n cflow.addEdge(s, l, 1, 0), cflow.addEdge(s, r, 1, 0);\n for (short i = 0; i < N; i++) {\n cflow.addEdge(2 * i + 3, 2 * i + 4, 1, 0), cflow.addEdge(2 * i + 4, t, 1, -point[i].P);\n if (std::abs(point[i].X - (int)L) <= V * point[i].T) { cflow.addEdge(l, 2 * i + 3, 1, 0); }\n if (std::abs(point[i].X - (int)R) <= V * point[i].T) { cflow.addEdge(r, 2 * i + 3, 1, 0); }\n }\n for (short i = 0; i < N; i++) {\n for (short j = i + 1; j < N; j++) {\n if (std::abs(point[i].X - point[j].X) <= V * (point[j].T - point[i].T)) { cflow.addEdge(2 * i + 4, 2 * j + 3, 1, -point[i].P); }\n }\n }\n point.clear(), point.shrink_to_fit();\n std::cout << -PrimalDual<int, PotDAG>(cflow, s, t, (char)2).second << std::endl;\n\n return 0;\n}","accuracy":1,"time_ms":1010,"memory_kb":241908,"score_of_the_acc":-1.0886,"final_rank":12},{"submission_id":"aoj_2290_3375072","code_snippet":"// https://onlinejudge.u-aizu.ac.jp/challenges/search/categories/2290\n// MLEです (頂点型をshortにして、容量型をcharにすると多分通ります)\n#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <queue>\n#include <limits>\ntemplate <typename T>\nconstexpr T INF() { return std::numeric_limits<T>::max() / 16; }\n#include <vector>\ntemplate <typename Cap, typename Cost, typename Ind = std::size_t>\nstruct CostFlow\n{\n CostFlow(const Ind v) : V(v), edge(v) { edge.shrink_to_fit(); }\n void addEdge(const Ind from, const Ind to, const Cap cap, const Cost cost) { edge[from].push_back(Edge{to, (Ind)edge[to].size(), cap, cost, false}), edge[to].push_back(Edge{from, (Ind)(edge[from].size() - 1), 0, -cost, true}); }\n struct Edge\n {\n Ind to, rev;\n Cap cap;\n Cost cost;\n const bool isrev;\n };\n const Ind V;\n std::vector<std::vector<Edge>> edge;\n};\ntemplate <typename T, template <typename, typename, typename, typename> class PotFunc, typename Cap, typename Cost, typename Ind>\nstd::pair<bool, T> PrimalDual(CostFlow<Cap, Cost, Ind>& cflow, const Ind s, const Ind t, Cap f)\n{\n const Ind V = cflow.V;\n T ans = 0;\n std::vector<T> potential = PotFunc<T, Cap, Cost, Ind>()(cflow, s);\n std::vector<T> dist(V, INF<T>());\n using P = std::pair<T, Ind>;\n std::priority_queue<P, std::vector<P>, std::greater<P>> Q;\n std::vector<Ind> prev_v(V), prev_e(V);\n dist.shrink_to_fit(), prev_v.shrink_to_fit(), prev_e.shrink_to_fit();\n while (f > 0) {\n std::fill(dist.begin(), dist.end(), INF<T>());\n dist[s] = 0, Q.push({0, s});\n while (not Q.empty()) {\n const T cost = Q.top().first;\n const Ind v = Q.top().second;\n Q.pop();\n if (dist[v] < cost) { continue; }\n for (Ind i = 0; i < cflow.edge[v].size(); i++) {\n const auto& e = cflow.edge[v][i];\n const T pd = potential[v] - potential[e.to];\n if (e.cap == 0 or dist[e.to] <= dist[v] + e.cost + pd) { continue; }\n dist[e.to] = dist[v] + e.cost + pd, prev_v[e.to] = v, prev_e[e.to] = i;\n Q.push({dist[e.to], e.to});\n }\n }\n if (dist[t] == INF<T>()) { return {false, ans}; }\n for (Ind v = 0; v < V; v++) { potential[v] += dist[v]; }\n Cap d = f;\n for (Ind v = t; v != s; v = prev_v[v]) {\n const auto& e = cflow.edge[prev_v[v]][prev_e[v]];\n d = std::min(d, e.cap);\n }\n f -= d, ans += (T)d * potential[t];\n for (Ind v = t; v != s; v = prev_v[v]) {\n auto& e = cflow.edge[prev_v[v]][prev_e[v]];\n e.cap -= d, cflow.edge[v][e.rev].cap += d;\n }\n }\n return {true, ans};\n}\n#include <algorithm>\n#include <vector>\nstruct Graph\n{\n Graph(const std::size_t v) : V{v}, edge(v), rev_edge(v) {}\n void addEdge(const std::size_t from, const std::size_t to) { edge[from].push_back(to), rev_edge[to].push_back(from); }\n const std::size_t V;\n std::vector<std::vector<std::size_t>> edge, rev_edge;\n};\nstd::pair<bool, std::vector<std::size_t>> TopSort(const Graph& g)\n{\n std::vector<std::size_t> srt, used(g.V, 0);\n auto dfs = [&](auto&& self, const std::size_t s) -> bool {\n if (used[s] == 1) {\n return false;\n } else if (used[s] == 0) {\n used[s] = 1;\n for (const std::size_t to : g.edge[s]) {\n if (not self(self, to)) { return false; }\n }\n used[s] = 2, srt.push_back(s);\n }\n return true;\n };\n for (std::size_t i = 0; i < g.V; i++) {\n if (not dfs(dfs, i)) { return {false, srt}; }\n }\n std::reverse(srt.begin(), srt.end());\n return {true, srt};\n}\ntemplate <typename T, typename Cap, typename Cost, typename Ind>\nstruct PotDAG\n{\n std::vector<T> operator()(const CostFlow<Cap, Cost, Ind>& cflow, const Ind s) const\n {\n const Ind V = cflow.V;\n std::vector<Ind> ord(V);\n for (Ind i = 0; i < V; i++) { ord[i] = i; }\n std::vector<T> ans(V, INF<T>());\n ans.shrink_to_fit();\n for (Ind i = 0; i < V; i++) {\n if (ord[i] == s) { ans[s] = 0; }\n for (const auto& e : cflow.edge[ord[i]]) {\n if (e.cap == 0) { continue; }\n ans[e.to] = std::min(ans[e.to], ans[ord[i]] + e.cost);\n }\n }\n return ans;\n }\n};\nstruct Point\n{\n int X, T, P;\n bool operator<(const Point& p) const\n {\n return T < p.T;\n }\n};\n\nint main()\n{\n short N;\n std::cin >> N;\n std::size_t V, L, R;\n std::cin >> V >> L >> R;\n std::vector<Point> point(N);\n point.shrink_to_fit();\n for (short i = 0; i < N; i++) { std::cin >> point[i].X >> point[i].T >> point[i].P; }\n std::sort(point.begin(), point.end());\n CostFlow<char, int, short> cflow(2 * N + 4);\n const short s = 0, t = 2 * N + 3, l = 1, r = 2;\n cflow.addEdge(s, l, 1, 0), cflow.addEdge(s, r, 1, 0);\n for (short i = 0; i < N; i++) {\n cflow.addEdge(2 * i + 3, 2 * i + 4, 1, 0), cflow.addEdge(2 * i + 4, t, 1, -point[i].P);\n if (std::abs(point[i].X - (int)L) <= V * point[i].T) { cflow.addEdge(l, 2 * i + 3, 1, 0); }\n if (std::abs(point[i].X - (int)R) <= V * point[i].T) { cflow.addEdge(r, 2 * i + 3, 1, 0); }\n }\n for (short i = 0; i < N; i++) {\n for (short j = i + 1; j < N; j++) {\n if (std::abs(point[i].X - point[j].X) <= V * (point[j].T - point[i].T)) { cflow.addEdge(2 * i + 4, 2 * j + 3, 1, -point[i].P); }\n }\n }\n point.clear(), point.shrink_to_fit();\n std::cout << -PrimalDual<int, PotDAG>(cflow, s, t, (char)2).second << std::endl;\n\n return 0;\n}","accuracy":1,"time_ms":1000,"memory_kb":241684,"score_of_the_acc":-1.0857,"final_rank":10},{"submission_id":"aoj_2290_3268397","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 HUGE_NUM 10000000000\n#define NUM 6050\n\ntypedef pair<ll,ll> P;\n\nstruct Edge{\n Edge(int arg_to,ll arg_capacity,ll arg_cost,int arg_rev_index){\n to = arg_to;\n capacity = arg_capacity;\n cost = arg_cost;\n rev_index = arg_rev_index;\n }\n\n int to,rev_index;\n ll capacity,cost;\n};\n\nstruct Info{\n void set(int arg_x,int arg_appear_time,ll arg_value){\n x = arg_x;\n appear_time = arg_appear_time;\n value = arg_value;\n }\n bool operator<(const struct Info & arg) const{\n return appear_time < arg.appear_time;\n }\n int x,appear_time;\n ll value;\n};\n\nint N,speed;\nint V;\nvector<Edge> G[NUM];\nll h[NUM];\nll dist[NUM];\nint pre_node[NUM],pre_edge[NUM];\nint index_IN[NUM],index_OUT[NUM];\nint in_num[NUM];\nbool visited[NUM];\nInfo LEFT,RIGHT,info[NUM];\n\n\nvoid add_edge(int from,int to,ll capacity,ll cost){\n G[from].push_back(Edge(to,capacity,cost,G[to].size()));\n G[to].push_back(Edge(from,0,-cost,G[from].size()-1));\n}\n\n\nll min_cost_flow(int source,int sink,ll flow){\n ll ret = 0;\n for(int i = 0; i < V; i++){\n h[i] = HUGE_NUM;\n in_num[i] = 0;\n }\n\n h[source] = 0;\n\n for(int i = 0; i < V; i++){\n for(ll k = 0; k < G[i].size(); k++){\n if(G[i][k].capacity == 0)continue;\n\n in_num[G[i][k].to]++;\n }\n }\n\n queue<int> TOPO;\n for(int i = 0; i < V; i++){\n\n if(in_num[i] == 0){\n TOPO.push(i);\n }\n }\n\n int tmp_node;\n\n while(!TOPO.empty()){\n tmp_node = TOPO.front();\n TOPO.pop();\n\n for(int i = 0; i < G[tmp_node].size(); i++){\n if(G[tmp_node][i].capacity <= 0)continue;\n\n h[G[tmp_node][i].to] = min(h[G[tmp_node][i].to],h[tmp_node]+G[tmp_node][i].cost);\n\n in_num[G[tmp_node][i].to]--;\n if(in_num[G[tmp_node][i].to] == 0){\n TOPO.push(G[tmp_node][i].to);\n }\n }\n }\n\n while(flow > 0){\n\n for(int i = 0; i < V; i++)dist[i] = HUGE_NUM;\n dist[source] = 0;\n\n for(int i = 0; i < V; i++)visited[i] = false;\n\n while(true){\n\n tmp_node = -1;\n\n for(ll i = 0; i < V; i++){\n if(visited[i] == false && (tmp_node == -1 || dist[tmp_node] > dist[i])){\n tmp_node = i;\n }\n }\n\n if(tmp_node == -1)break;\n\n visited[tmp_node] = true;\n\n for(int i = 0; i < G[tmp_node].size(); i++){\n Edge &e = G[tmp_node][i];\n if(e.capacity == 0 || dist[e.to] <= dist[tmp_node]+e.cost+h[tmp_node]-h[e.to])continue;\n dist[e.to] = dist[tmp_node]+e.cost+h[tmp_node]-h[e.to];\n pre_node[e.to] = tmp_node;\n pre_edge[e.to] = i;\n\n }\n }\n\n if(dist[sink] == HUGE_NUM){\n return -1;\n }\n\n for(int node_id = 0; node_id < V; node_id++)h[node_id] += dist[node_id];\n\n ll tmp_flow = flow;\n\n for(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n\n tmp_flow = min(tmp_flow,G[pre_node[node_id]][pre_edge[node_id]].capacity);\n }\n flow -= tmp_flow;\n ret += tmp_flow*h[sink];\n\n for(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\n Edge &e = G[pre_node[node_id]][pre_edge[node_id]];\n e.capacity -= tmp_flow;\n G[node_id][e.rev_index].capacity += tmp_flow;\n }\n }\n return ret;\n}\n\n\nint main(){\n\n scanf(\"%d %d %d %d\",&N,&speed,&LEFT.x,&RIGHT.x);\n\n for(int i = 0; i < N; i++){\n\n scanf(\"%d %d %d\",&info[i].x,&info[i].appear_time,&info[i].value);\n }\n sort(info,info+N);\n\n int source = 0,sink = 1,first_left = 2,first_right = 3,index = 4;\n\n for(int i = 0; i < N; i++){\n\n index_IN[i] = index++;\n }\n for(int i = 0; i < N; i++){\n\n index_OUT[i] = index++;\n add_edge(index_OUT[i],sink,1,0);\n }\n for(ll i = 0; i < N; i++){\n\n add_edge(index_IN[i],index_OUT[i],1,-info[i].value);\n }\n\n add_edge(source,first_left,1,0);\n add_edge(first_left,sink,1,0);\n\n for(int i = 0; i < N; i++){\n\n if(abs(info[i].x-LEFT.x) <= speed*info[i].appear_time){\n\n add_edge(first_left,index_IN[i],1,0);\n }\n }\n\n add_edge(source,first_right,1,0);\n add_edge(first_right,sink,1,0);\n\n for(int i = 0; i < N; i++){\n\n if(abs(info[i].x-RIGHT.x) <= speed*info[i].appear_time){\n\n add_edge(first_right,index_IN[i],1,0);\n }\n }\n\n for(int i = 0; i < N-1; i++){\n for(int k = i+1; k < N; k++){\n if(abs(info[k].x-info[i].x) <= speed*(info[k].appear_time-info[i].appear_time)){\n\n add_edge(index_OUT[i],index_IN[k],1,0);\n }\n }\n }\n\n add_edge(source,sink,2,0);\n\n V = index;\n\n ll ans = min_cost_flow(source,sink,2);\n\n printf(\"%lld\\n\",-ans);\n\n return 0;\n}","accuracy":1,"time_ms":340,"memory_kb":256348,"score_of_the_acc":-1.051,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2290_9372895\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\n\\ntemplate<class T>\\nstruct MCF {\\nprivate:\\n const T inf = 1e9;\\n vector<T> dist; //最短距離(費用)\\n vector<int> pv, pe; //直前の頂点、辺 \\n\\npublic:\\n struct edge {\\n int to, rev; int cap; T cost;\\n edge(int t = 0, int r = 0, int ca = 0, T co = 0)\\n : to(t), rev(r), cap(ca), cost(co) {}\\n };\\n\\n struct pii {\\n T d; int v; //最短距離(費用)、頂点番号\\n pii(T d_ = 0, int v_ = 0) : d(d_), v(v_) {}\\n\\n bool operator<(const pii& other) const {\\n if (d != other.d) return d < other.d;\\n return v < other.v;\\n }\\n\\n bool operator>(const pii& other) const {\\n if (d != other.d) return d > other.d;\\n return v > other.v;\\n }\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n vector<T> pot; //ポテンシャル\\n\\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\\n\\n void addedge(int u, int v, int cap, T cost) {\\n int su = (int)to[u].size();\\n int sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap, cost });\\n to[v].push_back({ u, su, 0, -cost });\\n }\\n\\n bool bellmanford(int s, int t) {\\n dist.assign(n, inf);\\n dist[s] = 0;\\n int cnt = 0;\\n while (cnt < n) {\\n bool end = true;\\n for (int v = 0; v < n; v++) {\\n if (dist[v] == inf) continue;\\n for (auto e : to[v]) {\\n if (e.cap == 0) continue;\\n if (dist[v] + e.cost < dist[e.to]) {\\n dist[e.to] = dist[v] + e.cost;\\n end = false;\\n }\\n }\\n }\\n cerr << cnt << \\\" \\\";\\n\\n if (end) break;\\n cnt++;\\n }\\n\\n for (int v = 0; v < n; v++) pot[v] += dist[v];\\n\\n return (cnt == n);\\n }\\n\\n //s->tへ流量fの最小費用流、流せないときは-1\\n T mincostflow(int s, int t, int f) {\\n T res = 0;\\n pot.assign(n, 0);\\n bellmanford(s, t);\\n while (f) {\\n priority_queue<pii, vector<pii>, greater<pii>> pq;\\n dist.assign(n, inf);\\n dist[s] = 0;\\n pq.push({ 0, s });\\n while (!pq.empty()) {\\n pii elem = pq.top();\\n pq.pop();\\n if (dist[elem.v] < elem.d) continue;\\n int sv = (int)to[elem.v].size();\\n for (int i = 0; i < sv; i++) {\\n edge& nv = to[elem.v][i];\\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\\n pv[nv.to] = elem.v;\\n pe[nv.to] = i;\\n pq.push({ dist[nv.to], nv.to });\\n }\\n }\\n\\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\\n\\n for (int v = 0; v < n; v++) pot[v] += dist[v];\\n\\n int nf = f;\\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\\n f -= nf;\\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\\n for (int v = t; v != s; v = pv[v]) {\\n edge& nv = to[pv[v]][pe[v]];\\n nv.cap -= nf;\\n to[v][nv.rev].cap += nf;\\n }\\n }\\n return res;\\n }\\n\\n //s->tへ流量fの最小費用流、流せないときは費用と流せなかった流量のペア\\n pair<T, int> mincostflow_pair(int s, int t, int f) {\\n T res = 0;\\n pot.assign(n, 0);\\n while (f) {\\n priority_queue<pii, vector<pii>, greater<pii>> pq;\\n dist.assign(n, inf);\\n dist[s] = 0;\\n pq.push({ 0, s });\\n while (!pq.empty()) {\\n pii elem = pq.top();\\n pq.pop();\\n if (dist[elem.v] < elem.d) continue;\\n int sv = (int)to[elem.v].size();\\n for (int i = 0; i < sv; i++) {\\n edge& nv = to[elem.v][i];\\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\\n pv[nv.to] = elem.v;\\n pe[nv.to] = i;\\n pq.push({ dist[nv.to], nv.to });\\n }\\n }\\n\\n if (dist[t] == inf) return { res, f }; //流せる最小費用流が存在しない\\n\\n for (int v = 0; v < n; v++) pot[v] += dist[v];\\n\\n long long nf = f;\\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\\n f -= nf;\\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\\n for (int v = t; v != s; v = pv[v]) {\\n edge& nv = to[pv[v]][pe[v]];\\n nv.cap -= nf;\\n to[v][nv.rev].cap += nf;\\n }\\n }\\n return { res, f };\\n }\\n};\\n\\nvi<int> x(3010), t(3010), p(3010);\\nvi<tuple<int, int, int>> xtp(3010, { 1e9, 1e9, 1e9 });\\nMCF<int> mcf(6020);\\n\\nint main()\\n{\\n int n; ll v, xl, xr;\\n cin >> n >> v >> xl >> xr;\\n rep(i, n) cin >> x[i] >> t[i] >> p[i];\\n rep(i, n) xtp[i] = { t[i], x[i], p[i] };\\n sort(xtp.begin(), xtp.end());\\n rep(i, n) {\\n t[i] = get<0>(xtp[i]);\\n x[i] = get<1>(xtp[i]);\\n p[i] = get<2>(xtp[i]);\\n }\\n\\n int S = 0, S1 = 1, S2 = 2, T = 2 * n + 3;\\n\\n mcf.addedge(S, S1, 1, 0);\\n mcf.addedge(S, S2, 1, 0);\\n\\n rep(_, 2) {\\n rep(i, n) {\\n ll dx = abs(x[i] - xl);\\n ll dt = t[i];\\n if (dx <= dt * v) mcf.addedge(S1, 2 * i + 3, 1, -p[i]);\\n }\\n swap(xl, xr);\\n swap(S1, S2);\\n }\\n\\n rep(i, n) {\\n mcf.addedge(2 * i + 3, 2 * i + 4, 1, 0);\\n rep(j, n) {\\n if (i == j) continue;\\n if (t[i] > t[j]) continue;\\n ll dx = abs(x[j] - x[i]);\\n ll dt = t[j] - t[i];\\n if (dx <= dt * v) mcf.addedge(2 * i + 4, 2 * j + 3, 1, -p[j]);\\n }\\n mcf.addedge(2 * i + 4, T, 1, 0);\\n }\\n\\n mcf.addedge(S1, T, 1, 0);\\n mcf.addedge(S2, T, 1, 0);\\n\\n ll ans = mcf.mincostflow(S, T, 2);\\n cout << -ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 242836,\n \"score_of_the_acc\": -0.9285,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2290_9372891\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\n\\ntemplate<class T>\\nstruct MCF {\\nprivate:\\n const T inf = 1e9;\\n vector<T> dist; //最短距離(費用)\\n vector<int> pv, pe; //直前の頂点、辺 \\n\\npublic:\\n struct edge {\\n int to, rev; int cap; T cost;\\n edge(int t = 0, int r = 0, int ca = 0, T co = 0)\\n : to(t), rev(r), cap(ca), cost(co) {}\\n };\\n\\n struct pii {\\n T d; int v; //最短距離(費用)、頂点番号\\n pii(T d_ = 0, int v_ = 0) : d(d_), v(v_) {}\\n\\n bool operator<(const pii& other) const {\\n if (d != other.d) return d < other.d;\\n return v < other.v;\\n }\\n\\n bool operator>(const pii& other) const {\\n if (d != other.d) return d > other.d;\\n return v > other.v;\\n }\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n vector<T> pot; //ポテンシャル\\n\\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\\n\\n void addedge(int u, int v, int cap, T cost) {\\n int su = (int)to[u].size();\\n int sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap, cost });\\n to[v].push_back({ u, su, 0, -cost });\\n }\\n\\n bool bellmanford(int s, int t) {\\n dist.assign(n, inf);\\n dist[s] = 0;\\n int cnt = 0;\\n while (cnt < n) {\\n bool end = true;\\n for (int v = 0; v < n; v++) {\\n if (dist[v] == inf) continue;\\n for (auto e : to[v]) {\\n if (e.cap == 0) continue;\\n if (dist[v] + e.cost < dist[e.to]) {\\n dist[e.to] = dist[v] + e.cost;\\n end = false;\\n }\\n }\\n }\\n //cerr << cnt << \\\" \\\";\\n\\n if (end) break;\\n cnt++;\\n }\\n\\n for (int v = 0; v < n; v++) pot[v] += dist[v];\\n\\n return (cnt == n);\\n }\\n\\n //s->tへ流量fの最小費用流、流せないときは-1\\n T mincostflow(int s, int t, int f) {\\n T res = 0;\\n pot.assign(n, 0);\\n bellmanford(s, t);\\n while (f) {\\n priority_queue<pii, vector<pii>, greater<pii>> pq;\\n dist.assign(n, inf);\\n dist[s] = 0;\\n pq.push({ 0, s });\\n while (!pq.empty()) {\\n pii elem = pq.top();\\n pq.pop();\\n if (dist[elem.v] < elem.d) continue;\\n int sv = (int)to[elem.v].size();\\n for (int i = 0; i < sv; i++) {\\n edge& nv = to[elem.v][i];\\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\\n pv[nv.to] = elem.v;\\n pe[nv.to] = i;\\n pq.push({ dist[nv.to], nv.to });\\n }\\n }\\n\\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\\n\\n for (int v = 0; v < n; v++) pot[v] += dist[v];\\n\\n int nf = f;\\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\\n f -= nf;\\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\\n for (int v = t; v != s; v = pv[v]) {\\n edge& nv = to[pv[v]][pe[v]];\\n nv.cap -= nf;\\n to[v][nv.rev].cap += nf;\\n }\\n }\\n return res;\\n }\\n\\n //s->tへ流量fの最小費用流、流せないときは費用と流せなかった流量のペア\\n pair<T, int> mincostflow_pair(int s, int t, int f) {\\n T res = 0;\\n pot.assign(n, 0);\\n while (f) {\\n priority_queue<pii, vector<pii>, greater<pii>> pq;\\n dist.assign(n, inf);\\n dist[s] = 0;\\n pq.push({ 0, s });\\n while (!pq.empty()) {\\n pii elem = pq.top();\\n pq.pop();\\n if (dist[elem.v] < elem.d) continue;\\n int sv = (int)to[elem.v].size();\\n for (int i = 0; i < sv; i++) {\\n edge& nv = to[elem.v][i];\\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\\n pv[nv.to] = elem.v;\\n pe[nv.to] = i;\\n pq.push({ dist[nv.to], nv.to });\\n }\\n }\\n\\n if (dist[t] == inf) return { res, f }; //流せる最小費用流が存在しない\\n\\n for (int v = 0; v < n; v++) pot[v] += dist[v];\\n\\n long long nf = f;\\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\\n f -= nf;\\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\\n for (int v = t; v != s; v = pv[v]) {\\n edge& nv = to[pv[v]][pe[v]];\\n nv.cap -= nf;\\n to[v][nv.rev].cap += nf;\\n }\\n }\\n return { res, f };\\n }\\n};\\n\\nvi<int> x(3010), t(3010), p(3010);\\nvi<tuple<int, int, int>> xtp(3010, { 1e9, 1e9, 1e9 });\\nMCF<int> mcf(6020);\\n\\nint main()\\n{\\n int n; ll v, xl, xr;\\n cin >> n >> v >> xl >> xr;\\n rep(i, n) cin >> x[i] >> t[i] >> p[i];\\n rep(i, n) xtp[i] = { t[i], x[i], p[i] };\\n sort(xtp.begin(), xtp.end());\\n rep(i, n) {\\n t[i] = get<0>(xtp[i]);\\n x[i] = get<1>(xtp[i]);\\n p[i] = get<2>(xtp[i]);\\n }\\n\\n int S = 0, S1 = 1, S2 = 2, T = 2 * n + 3;\\n\\n mcf.addedge(S, S1, 1, 0);\\n mcf.addedge(S, S2, 1, 0);\\n\\n rep(_, 2) {\\n rep(i, n) {\\n ll dx = abs(x[i] - xl);\\n ll dt = t[i];\\n if (dx <= dt * v) mcf.addedge(S1, 2 * i + 3, 1, -p[i]);\\n }\\n swap(xl, xr);\\n swap(S1, S2);\\n }\\n\\n rep(i, n) {\\n mcf.addedge(2 * i + 3, 2 * i + 4, 1, 0);\\n rep(j, n) {\\n if (i == j) continue;\\n if (t[i] > t[j]) continue;\\n ll dx = abs(x[j] - x[i]);\\n ll dt = t[j] - t[i];\\n if (dx <= dt * v) mcf.addedge(2 * i + 4, 2 * j + 3, 1, -p[j]);\\n }\\n mcf.addedge(2 * i + 4, T, 1, 0);\\n }\\n\\n mcf.addedge(S1, T, 1, 0);\\n mcf.addedge(S2, T, 1, 0);\\n\\n ll ans = mcf.mincostflow(S, T, 2);\\n cout << -ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 920,\n \"memory_kb\": 243460,\n \"score_of_the_acc\": -1.0815,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2290_8978893\",\n \"code_snippet\": \"#line 1 \\\"main.cpp\\\"\\n#include <bits/stdc++.h>\\n// #include \\\"Utils/FastIO.hpp\\\"\\n#line 7 \\\"/home/kokoro601/compro_library/Flow/MinCostFlow.hpp\\\"\\n\\n// this implementation is based on\\n// https://megalodon.jp/2022-0321-1006-53/https://ei1333.hateblo.jp:443/entry/2019/12/15/094229\\n// verify:\\n// https://atcoder.jp/contests/practice2/submissions/30316518\\n// https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6331152\\n\\ntemplate<class CapType, class CostType> class MinCostFlow {\\n struct Edge {\\n int to, rev;\\n CapType cap;\\n CostType cost;\\n };\\n\\n struct EdgeInfo {\\n int v, offset;\\n };\\n\\n using P = std::pair<CostType, int>;\\n\\n int n;\\n const CostType inf;\\n std::vector<CostType> h, dist;\\n std::vector<int> prevv, preve;\\n std::vector<CapType> b;\\n std::vector<EdgeInfo> edge_infos;\\n CostType res = 0;\\n\\npublic:\\n std::vector< std::vector<Edge> > g;\\n\\n MinCostFlow(int node_size) : \\n n(node_size), inf(std::numeric_limits<CostType>::max()),\\n g(n), h(n, 0), dist(n), prevv(n), preve(n), b(n) {}\\n\\n CostType solve(int s, int t, CapType f) {\\n while(f > 0) {\\n std::priority_queue<P, std::vector<P>, std::greater<P> > que;\\n std::fill(dist.begin(), dist.end(), inf);\\n dist[s] = 0;\\n que.push({0, s});\\n while(!que.empty()) {\\n P p = que.top(); que.pop();\\n int v = p.second;\\n if (dist[v] < p.first) continue;\\n for (int i = 0; i < (int)g[v].size(); i++) {\\n Edge &e = g[v][i];\\n CostType diff = e.cost + h[v] - h[e.to];\\n if (e.cap > 0 && dist[e.to] > dist[v] + diff) {\\n dist[e.to] = dist[v] + diff;\\n prevv[e.to] = v, preve[e.to] = i;\\n que.push({dist[e.to], e.to});\\n }\\n }\\n }\\n\\n if (dist[t] == inf) {\\n std::cout << \\\"-1\\\" << std::endl;\\n exit(0);\\n }\\n\\n for (int i = 0; i < n; i++) h[i] += dist[i];\\n\\n CapType d = f;\\n for (int v = t; v != s; v = prevv[v]) {\\n d = std::min(d, g[prevv[v]][preve[v]].cap);\\n }\\n\\n f -= d;\\n res += h[t] * d;\\n for (int v = t; v != s; v = prevv[v]) {\\n Edge& e = g[prevv[v]][preve[v]];\\n e.cap -= d;\\n g[v][e.rev].cap += d;\\n }\\n }\\n\\n return res;\\n }\\n\\n void set_potential(std::vector<CostType> &potential) {\\n h = potential;\\n }\\n\\n void add_edge(int from, int to, CapType cap, CostType cost) {\\n assert(from != to); \\n g[from].push_back({to, (int)g[to].size(), cap, cost});\\n g[to].push_back({from, (int)g[from].size() - 1, 0, -cost});\\n edge_infos.push_back({to, (int)g[to].size() - 1});\\n }\\n\\n CapType get_edge(int i) {\\n EdgeInfo &ei = edge_infos[i];\\n Edge &e = g[ei.v][ei.offset];\\n CapType ret = e.cap;\\n return ret;\\n }\\n};\\n#line 4 \\\"/home/kokoro601/compro_library/Graph/SCC.hpp\\\"\\n\\n// verify:\\n// https://judge.yosupo.jp/submission/83473\\n// https://atcoder.jp/contests/arc010/submissions/30376565\\n\\n\\nclass SCC {\\n using Graph = std::vector< std::vector<int> >;\\n\\n void dfs(int v) {\\n used[v] = true;\\n for (auto &to: g[v]) {\\n if (!used[to]) dfs(to);\\n }\\n ord.push_back(v);\\n }\\n\\n void rdfs(int v, int group_id) {\\n used[v] = true;\\n cmp[v] = group_id;\\n for (auto &to: rg[v]) {\\n if (!used[to]) rdfs(to, group_id);\\n }\\n }\\n\\n void build() {\\n for (int v = 0; v < n; v++)\\n if (!used[v]) dfs(v);\\n\\n std::fill(used.begin(), used.end(), 0);\\n\\n std::reverse(ord.begin(), ord.end());\\n for (auto &v: ord)\\n if (!used[v]) rdfs(v, n_group++);\\n }\\n\\n int n;\\n Graph g, rg;\\n std::vector<bool> used;\\n std::vector<int> ord;\\npublic:\\n int n_group;\\n std::vector<int> cmp;\\n\\n SCC(Graph &g): n((int)g.size()), g(g), used(n), n_group(0), cmp(n){\\n rg.resize(n);\\n for (int i = 0; i < n; i++)\\n for (auto to: g[i]) \\n rg[to].push_back(i);\\n build();\\n }\\n\\n std::vector< std::vector<int> > make_group_list() {\\n std::vector< std::vector<int> > group_list(n_group);\\n for (int i = 0; i < n; i++) group_list[cmp[i]].push_back(i);\\n return group_list;\\n }\\n\\n Graph rebuild() {\\n Graph ret_g(n_group);\\n auto group_list = make_group_list();\\n\\n std::vector<bool> marked_fl(n_group, false);\\n for (int i = 0; i < n_group; i++) {\\n std::vector<int> rec_marked_group;\\n for (auto &v: group_list[i]) {\\n for (auto &to: g[v]) {\\n int to_group_id = cmp[to];\\n if (to_group_id != i && !marked_fl[to_group_id]) {\\n marked_fl[to_group_id] = true;\\n rec_marked_group.push_back(to_group_id);\\n ret_g[i].push_back(to_group_id);\\n }\\n }\\n }\\n for (auto &group_id: rec_marked_group) marked_fl[group_id] = false;\\n }\\n\\n return ret_g;\\n }\\n};\\n#line 5 \\\"main.cpp\\\"\\n\\nusing namespace std;\\nusing ull = unsigned long long;\\nusing ll = long long;\\nusing Graph = vector<vector<int>>;\\n// using u128 = __uint128_t; \\nusing u64 = uint64_t;\\n\\n\\n// vector<Mint> inv(vector<Mint> &v) {\\n// size_t n = v.size();\\n\\n// vector<Mint> ret = { modpow(v[0].v, MOD-2, MOD) };\\n// vector<Mint> cur = { v[0] }; \\n// size_t cursz = 1;\\n// while (cursz < n) {\\n// cur.resize(2*cursz); memcpy(cur.data() + cursz, v.data() + cursz, sizeof(unsigned int) * min(n-cursz, cursz));\\n// auto tmp = ntt.convolution(cur, ret);\\n// tmp[0] = Mint(2) - tmp[0];\\n// for (int i = 1; i < tmp.size(); i++) tmp[i] *= -1;\\n// tmp.resize(2*cursz);\\n// ret = ntt.convolution(ret, tmp);\\n// ret.resize(2*cursz);\\n// cursz *= 2;\\n// }\\n\\n// ret.resize(n);\\n// return ret;\\n// }\\n\\ntypedef struct {\\n int x, t, p;\\n} Item;\\n\\nint main() {\\n int n, v; cin >> n >> v;\\n int xleft, xright; cin >> xleft >> xright;\\n\\n vector<Item> items(n);\\n for (int i = 0; i < n; i++) cin >> items[i].x >> items[i].t >> items[i].p;\\n\\n // 時間でソート\\n sort(items.begin(), items.end(), [](auto &a, auto &b) { return a.t < b.t; }); \\n\\n int s = 2*n, t = 2*n + 1;\\n MinCostFlow<int, int> mcf(2*n + 2);\\n mcf.add_edge(s, t, 2, 0);\\n for (int i = 0; i < n; i++) { // s ⇒ 各頂点\\n if (abs(xleft - items[i].x) <= items[i].t * v)\\n mcf.add_edge(s, i, 1, 0);\\n if (abs(xright - items[i].x) <= items[i].t * v)\\n mcf.add_edge(s, i, 1, 0);\\n }\\n for (int i = 0; i < n; i++) // 各頂点 ⇒ t\\n mcf.add_edge(i+n, t, 1, 0);\\n for (int i = 0; i < n; i++)\\n mcf.add_edge(i, i+n, 1, -items[i].p); // ポイント\\n \\n for (int i = 0; i < n; i++) \\n for (int j = i+1; j < n; j++) \\n if (abs(items[i].x - items[j].x) <= v * (items[j].t - items[i].t))\\n mcf.add_edge(i+n, j, 1, 0);\\n\\n vector<int> potential(2*n + 2, 1e9);\\n potential[s] = 0;\\n for (auto e: mcf.g[s])\\n if (e.cap != 0)\\n potential[e.to] = min(potential[e.to], potential[s] + e.cost); \\n for (int i = 0; i < n; i++) {\\n for (auto e: mcf.g[i]) \\n if (e.cap != 0)\\n potential[e.to] = min(potential[e.to], potential[i] + e.cost);\\n for (auto e: mcf.g[i+n]) \\n if (e.cap != 0)\\n potential[e.to] = min(potential[e.to], potential[i+n] + e.cost);\\n }\\n\\n mcf.set_potential(potential);\\n\\n cout << -mcf.solve(s, t, 2) << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.2653061224489796,\n \"time_ms\": 110,\n \"memory_kb\": 120300,\n \"score_of_the_acc\": -0.2921,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2290_8877953\",\n \"code_snippet\": \"#line 1 \\\"main.cpp\\\"\\n#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <iomanip>\\n#include <math.h>\\n#include <functional>\\n#include <map>\\n#include <set>\\n#include <string>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <queue>\\n#include <stack>\\n#include <cstring>\\n#include <assert.h>\\n#include <unistd.h>\\n#include <chrono>\\n#include <numeric>\\n#include <cstdint>\\n#include <variant>\\n#include <random>\\n#include <memory>\\n// #include <bit>\\n// #include \\\"Utils/FastIO.hpp\\\"\\n#line 5 \\\"/home/kokoro601/compro_library/Flow/MinCostFlow.hpp\\\"\\n#include <limits>\\n#line 7 \\\"/home/kokoro601/compro_library/Flow/MinCostFlow.hpp\\\"\\n\\n// this implementation is based on\\n// https://megalodon.jp/2022-0321-1006-53/https://ei1333.hateblo.jp:443/entry/2019/12/15/094229\\n// verify:\\n// https://atcoder.jp/contests/practice2/submissions/30316518\\n// https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6331152\\n\\n\\n\\n\\ntemplate<class CapType, class CostType> class MinCostFlow {\\n struct Edge {\\n int to, rev;\\n CapType cap;\\n CostType cost;\\n };\\n\\n struct EdgeInfo {\\n int v, offset;\\n };\\n\\n using P = std::pair<CostType, int>;\\n\\n int n;\\n const CostType inf;\\n std::vector<CostType> h, dist;\\n std::vector<int> prevv, preve;\\n std::vector<CapType> b;\\n std::vector<EdgeInfo> edge_infos;\\n CostType res = 0;\\n\\npublic:\\n // std::vector< std::vector<Edge> > g;\\n Edge *g[7000];\\n short hi[7000] = {}, lim[7000] = {};\\n\\n MinCostFlow(int node_size) : \\n n(node_size), inf(std::numeric_limits<CostType>::max()),\\n h(n, 0), dist(n), prevv(n), preve(n), b(n) {}\\n\\n CostType solve(int s, int t, CapType f) {\\n while(f > 0) {\\n std::priority_queue<P, std::vector<P>, std::greater<P> > que;\\n std::fill(dist.begin(), dist.end(), inf);\\n dist[s] = 0;\\n que.push({0, s});\\n while(!que.empty()) {\\n P p = que.top(); que.pop();\\n int v = p.second;\\n if (dist[v] < p.first) continue;\\n for (int i = 0; i < (int)hi[v]; i++) {\\n Edge &e = g[v][i];\\n CostType diff = e.cost + h[v] - h[e.to];\\n if (e.cap > 0 && dist[e.to] > dist[v] + diff) {\\n dist[e.to] = dist[v] + diff;\\n prevv[e.to] = v, preve[e.to] = i;\\n que.push({dist[e.to], e.to});\\n }\\n }\\n }\\n\\n if (dist[t] == inf) {\\n std::cout << \\\"-1\\\" << std::endl;\\n exit(0);\\n }\\n\\n for (int i = 0; i < n; i++) h[i] += dist[i];\\n\\n CapType d = f;\\n for (int v = t; v != s; v = prevv[v]) {\\n d = std::min(d, g[prevv[v]][preve[v]].cap);\\n }\\n\\n f -= d;\\n res += h[t] * d;\\n for (int v = t; v != s; v = prevv[v]) {\\n Edge& e = g[prevv[v]][preve[v]];\\n e.cap -= d;\\n g[v][e.rev].cap += d;\\n }\\n }\\n\\n return res;\\n }\\n\\n void set_potential(std::vector<CostType> &potential) {\\n h = potential;\\n }\\n\\n void add_edge(int from, int to, CapType cap, CostType cost) {\\n assert(from != to); \\n\\n if (lim[from] == hi[from]) {\\n lim[from] += 8;\\n g[from] = (Edge*)realloc(g[from], sizeof(Edge) * lim[from]);\\n }\\n if (lim[to] == hi[to]) {\\n lim[to] += 8;\\n g[to] = (Edge*)realloc(g[to], sizeof(Edge) * lim[to]);\\n }\\n\\n g[from][hi[from]++] = {to, (int)hi[to], cap, cost};\\n g[to][hi[to]++] = {from, (int)hi[from] - 1, 0, -cost};\\n // edge_infos.push_back({to, (int)g[to].size() - 1});\\n }\\n\\n CapType get_edge(int i) {\\n EdgeInfo &ei = edge_infos[i];\\n Edge &e = g[ei.v][ei.offset];\\n CapType ret = e.cap;\\n return ret;\\n }\\n};\\n#line 26 \\\"main.cpp\\\"\\n\\nusing namespace std;\\nusing ull = unsigned long long;\\nusing ll = long long;\\nusing Graph = vector<vector<int>>;\\nusing u128 = __uint128_t; \\nusing u64 = uint64_t;\\n\\n// 番兵は入っているとする\\n// ll garner(vector<ll> &b, vector<ll> &m) {\\n// vector<ll> coeffs(m.size(), 1);\\n// vector<ll> constants(m.size(), 0);\\n// for (size_t k = 0; k < b.size(); k++) {\\n// ll diff = (b[k] > constants[k]) ? (b[k] - constants[k]) : (b[k] - constants[k] + m[k]);\\n// ll t = (diff * modinv(coeffs[k], m[k])) % m[k];\\n// for (size_t i = k + 1; i < m.size(); i++) {\\n// (constants[i] += t * coeffs[i]) %= m[i];\\n// (coeffs[i] *= m[k]) %= m[i];\\n// }\\n// }\\n\\n// return constants.back();\\n// }\\n\\nstruct Item {\\n int x, t, p;\\n};\\n\\nint main() {\\n int n, v, xl, xr;\\n cin >> n >> v >> xl >> xr;\\n vector<Item> items(n);\\n for (int i = 0; i < n; i++) cin >> items[i].x >> items[i].t >> items[i].p;\\n items.push_back({xl, 0, 0});\\n items.push_back({xr, 0, 0});\\n // 時間でソート\\n sort(items.begin(), items.end(), [](auto &a, auto &b) { return a.t < b.t; });\\n\\n n += 2;\\n\\n MinCostFlow<int, int> mcf(2*n+2);\\n int s = 2*n, t = 2*n+1;\\n mcf.add_edge(s, 0, 1, 0), mcf.add_edge(s, 1, 1, 0);\\n for (int i = 0; i < n; i++) mcf.add_edge(i, i+n, 1, -items[i].p);\\n for (int i = 0; i < n; i++) mcf.add_edge(i+n, t, 1, 0);\\n for (int i = 0; i < n; i++) {\\n for (int j = i+1; j < n; j++) {\\n // 到達可能\\n if (abs(items[i].x - items[j].x) <= v * (items[j].t - items[i].t)) {\\n mcf.add_edge(i+n, j, 1, 0);\\n }\\n }\\n }\\n\\n vector<int> potential(2*n+2, 1e9), top(2*n+2);\\n top[0] = s;\\n for (int i = 0; i < n; i++) top[2*i + 1] = i, top[2*i + 2] = i+n; \\n top[2*n+1] = t;\\n\\n potential[s] = 0;\\n for (auto cur: top) {\\n for (int i = 0; i < mcf.hi[cur]; i++) {\\n auto e = mcf.g[cur][i];\\n if (e.cap == 0) continue;\\n potential[e.to] = min(potential[e.to], potential[cur] + e.cost);\\n }\\n }\\n\\n mcf.set_potential(potential);\\n\\n cout << -mcf.solve(s, t, 2) << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1050,\n \"memory_kb\": 240792,\n \"score_of_the_acc\": -1.0895,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2290_8877946\",\n \"code_snippet\": \"#line 1 \\\"main.cpp\\\"\\n#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <iomanip>\\n#include <math.h>\\n#include <functional>\\n#include <map>\\n#include <set>\\n#include <string>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <queue>\\n#include <stack>\\n#include <cstring>\\n#include <assert.h>\\n#include <unistd.h>\\n#include <chrono>\\n#include <numeric>\\n#include <cstdint>\\n#include <variant>\\n#include <random>\\n#include <memory>\\n// #include <bit>\\n// #include \\\"Utils/FastIO.hpp\\\"\\n#line 5 \\\"/home/kokoro601/compro_library/Flow/MinCostFlow.hpp\\\"\\n#include <limits>\\n#line 7 \\\"/home/kokoro601/compro_library/Flow/MinCostFlow.hpp\\\"\\n\\n// this implementation is based on\\n// https://megalodon.jp/2022-0321-1006-53/https://ei1333.hateblo.jp:443/entry/2019/12/15/094229\\n// verify:\\n// https://atcoder.jp/contests/practice2/submissions/30316518\\n// https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=6331152\\n\\n\\n\\n\\ntemplate<class CapType, class CostType> class MinCostFlow {\\n struct Edge {\\n int to, rev;\\n CapType cap;\\n CostType cost;\\n };\\n\\n struct EdgeInfo {\\n int v, offset;\\n };\\n\\n using P = std::pair<CostType, int>;\\n\\n int n;\\n const CostType inf;\\n std::vector<CostType> h, dist;\\n std::vector<int> prevv, preve;\\n std::vector<CapType> b;\\n std::vector<EdgeInfo> edge_infos;\\n CostType res = 0;\\n\\npublic:\\n // std::vector< std::vector<Edge> > g;\\n Edge *g[7000];\\n int hi[7000] = {}, lim[7000] = {};\\n\\n MinCostFlow(int node_size) : \\n n(node_size), inf(std::numeric_limits<CostType>::max()),\\n h(n, 0), dist(n), prevv(n), preve(n), b(n) {}\\n\\n CostType solve(int s, int t, CapType f) {\\n while(f > 0) {\\n std::priority_queue<P, std::vector<P>, std::greater<P> > que;\\n std::fill(dist.begin(), dist.end(), inf);\\n dist[s] = 0;\\n que.push({0, s});\\n while(!que.empty()) {\\n P p = que.top(); que.pop();\\n int v = p.second;\\n if (dist[v] < p.first) continue;\\n for (int i = 0; i < (int)hi[v]; i++) {\\n Edge &e = g[v][i];\\n CostType diff = e.cost + h[v] - h[e.to];\\n if (e.cap > 0 && dist[e.to] > dist[v] + diff) {\\n dist[e.to] = dist[v] + diff;\\n prevv[e.to] = v, preve[e.to] = i;\\n que.push({dist[e.to], e.to});\\n }\\n }\\n }\\n\\n if (dist[t] == inf) {\\n std::cout << \\\"-1\\\" << std::endl;\\n exit(0);\\n }\\n\\n for (int i = 0; i < n; i++) h[i] += dist[i];\\n\\n CapType d = f;\\n for (int v = t; v != s; v = prevv[v]) {\\n d = std::min(d, g[prevv[v]][preve[v]].cap);\\n }\\n\\n f -= d;\\n res += h[t] * d;\\n for (int v = t; v != s; v = prevv[v]) {\\n Edge& e = g[prevv[v]][preve[v]];\\n e.cap -= d;\\n g[v][e.rev].cap += d;\\n }\\n }\\n\\n return res;\\n }\\n\\n void set_potential(std::vector<CostType> &potential) {\\n h = potential;\\n }\\n\\n void add_edge(int from, int to, CapType cap, CostType cost) {\\n assert(from != to); \\n\\n if (lim[from] == hi[from]) {\\n lim[from] += 8;\\n g[from] = (Edge*)realloc(g[from], sizeof(Edge) * lim[from]);\\n }\\n if (lim[to] == hi[to]) {\\n lim[to] += 8;\\n g[to] = (Edge*)realloc(g[to], sizeof(Edge) * lim[to]);\\n }\\n\\n g[from][hi[from]++] = {to, (int)hi[to], cap, cost};\\n g[to][hi[to]++] = {from, (int)hi[from] - 1, 0, -cost};\\n // edge_infos.push_back({to, (int)g[to].size() - 1});\\n }\\n\\n CapType get_edge(int i) {\\n EdgeInfo &ei = edge_infos[i];\\n Edge &e = g[ei.v][ei.offset];\\n CapType ret = e.cap;\\n return ret;\\n }\\n};\\n#line 26 \\\"main.cpp\\\"\\n\\nusing namespace std;\\nusing ull = unsigned long long;\\nusing ll = long long;\\nusing Graph = vector<vector<int>>;\\nusing u128 = __uint128_t; \\nusing u64 = uint64_t;\\n\\n// 番兵は入っているとする\\n// ll garner(vector<ll> &b, vector<ll> &m) {\\n// vector<ll> coeffs(m.size(), 1);\\n// vector<ll> constants(m.size(), 0);\\n// for (size_t k = 0; k < b.size(); k++) {\\n// ll diff = (b[k] > constants[k]) ? (b[k] - constants[k]) : (b[k] - constants[k] + m[k]);\\n// ll t = (diff * modinv(coeffs[k], m[k])) % m[k];\\n// for (size_t i = k + 1; i < m.size(); i++) {\\n// (constants[i] += t * coeffs[i]) %= m[i];\\n// (coeffs[i] *= m[k]) %= m[i];\\n// }\\n// }\\n\\n// return constants.back();\\n// }\\n\\nstruct Item {\\n int x, t, p;\\n};\\n\\nint main() {\\n int n, v, xl, xr;\\n cin >> n >> v >> xl >> xr;\\n vector<Item> items(n);\\n for (int i = 0; i < n; i++) cin >> items[i].x >> items[i].t >> items[i].p;\\n items.push_back({xl, 0, 0});\\n items.push_back({xr, 0, 0});\\n // 時間でソート\\n sort(items.begin(), items.end(), [](auto &a, auto &b) { return a.t < b.t; });\\n\\n n += 2;\\n\\n MinCostFlow<int, int> mcf(2*n+2);\\n int s = 2*n, t = 2*n+1;\\n mcf.add_edge(s, 0, 1, 0), mcf.add_edge(s, 1, 1, 0);\\n for (int i = 0; i < n; i++) mcf.add_edge(i, i+n, 1, -items[i].p);\\n for (int i = 0; i < n; i++) mcf.add_edge(i+n, t, 1, 0);\\n for (int i = 0; i < n; i++) {\\n for (int j = i+1; j < n; j++) {\\n // 到達可能\\n if (abs(items[i].x - items[j].x) <= v * (items[j].t - items[i].t)) {\\n mcf.add_edge(i+n, j, 1, 0);\\n }\\n }\\n }\\n\\n vector<int> potential(2*n+2, 1e9), top(2*n+2);\\n top[0] = s;\\n for (int i = 0; i < n; i++) top[2*i + 1] = i, top[2*i + 2] = i+n; \\n top[2*n+1] = t;\\n\\n potential[s] = 0;\\n for (auto cur: top) {\\n for (int i = 0; i < mcf.hi[cur]; i++) {\\n auto e = mcf.g[cur][i];\\n if (e.cap == 0) continue;\\n potential[e.to] = min(potential[e.to], potential[cur] + e.cost);\\n }\\n }\\n\\n mcf.set_potential(potential);\\n\\n cout << -mcf.solve(s, t, 2) << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1070,\n \"memory_kb\": 241564,\n \"score_of_the_acc\": -1.097,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2290_8334069\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int INF = 1012345678;\\n\\nint mincostflow(int N, int S, int T, int F, vector<vector<char> >& cap, vector<vector<int> >& cost) {\\n\\tint ans = 0;\\n\\tvector<int> height(N, 0); // potential\\n\\tfor (int rep = 0; rep < F; rep++) {\\n\\t\\tvector<int> dist(N, INF);\\n\\t\\tvector<int> pre(N, -1);\\n\\t\\tvector<bool> vis(N, false);\\n\\t\\tdist[S] = 0;\\n\\t\\twhile (true) {\\n\\t\\t\\tint pos = -1;\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tif (!vis[i] && dist[i] != INF && (pos == -1 || dist[pos] > dist[i])) {\\n\\t\\t\\t\\t\\tpos = i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (pos == -1) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tvis[pos] = true;\\n\\t\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\t\\tint ndist = dist[pos] + cost[pos][i] - (height[i] - height[pos]);\\n\\t\\t\\t\\tif (cap[pos][i] > 0 && dist[i] > ndist) {\\n\\t\\t\\t\\t\\tdist[i] = ndist;\\n\\t\\t\\t\\t\\tpre[i] = pos;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (dist[T] == INF) {\\n\\t\\t\\treturn INF;\\n\\t\\t}\\n\\t\\tans += dist[T] + height[T];\\n\\t\\tint pos = T;\\n\\t\\twhile (pos != S) {\\n\\t\\t\\tint nxt = pre[pos];\\n\\t\\t\\tcap[nxt][pos] -= 1;\\n\\t\\t\\tcap[pos][nxt] += 1;\\n\\t\\t\\tpos = nxt;\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < N; i++) {\\n\\t\\t\\tif (height[i] == INF || dist[i] == INF) {\\n\\t\\t\\t\\theight[i] = INF;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\theight[i] += dist[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nstruct enemy {\\n\\tint x, t, p;\\n};\\n\\nint main() {\\n\\tint N, V, XL, XR;\\n\\tcin >> N >> V >> XL >> XR;\\n\\tvector<enemy> E(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> E[i].x >> E[i].t >> E[i].p;\\n\\t}\\n\\tsort(E.begin(), E.end(), [&](const enemy& e1, const enemy& e2) {\\n\\t\\treturn e1.t < e2.t;\\n\\t});\\n\\tvector<int> ps(N + 1);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tps[i + 1] = ps[i] + E[i].p;\\n\\t}\\n\\tauto psum = [&](int l, int r) -> int {\\n\\t\\treturn ps[r] - ps[l];\\n\\t};\\n\\tauto reachable = [&](int xa, int ta, int xb, int tb) -> bool {\\n\\t\\treturn (ta < tb && abs(xa - xb) <= V * (tb - ta));\\n\\t};\\n\\tvector<vector<char> > cap(N * 2 + 4, vector<char>(N * 2 + 4));\\n\\tvector<vector<int> > cost(N * 2 + 4, vector<int>(N * 2 + 4));\\n\\tauto add_edge = [&](int va, int vb, int cap_, int cost_) -> void {\\n\\t\\tcap[va][vb] = cap_;\\n\\t\\tcap[vb][va] = 0;\\n\\t\\tcost[va][vb] = cost_;\\n\\t\\tcost[vb][va] = -cost_;\\n\\t};\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tadd_edge(i, N + i, 1, 0);\\n\\t}\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = i + 1; j < N; j++) {\\n\\t\\t\\tif (reachable(E[i].x, E[i].t, E[j].x, E[j].t)) {\\n\\t\\t\\t\\tadd_edge(N + i, j, 1, psum(i + 1, j));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (reachable(XL, 0, E[i].x, E[i].t)) {\\n\\t\\t\\tadd_edge(2 * N + 0, i, 1, psum(0, i));\\n\\t\\t}\\n\\t\\tif (reachable(XR, 0, E[i].x, E[i].t)) {\\n\\t\\t\\tadd_edge(2 * N + 1, i, 1, psum(0, i));\\n\\t\\t}\\n\\t\\tadd_edge(N + i, 2 * N + 3, 1, psum(i + 1, N));\\n\\t}\\n\\tadd_edge(2 * N + 2, 2 * N + 0, 1, 0);\\n\\tadd_edge(2 * N + 2, 2 * N + 1, 1, 0);\\n\\tadd_edge(2 * N + 0, 2 * N + 3, 1, psum(0, N));\\n\\tadd_edge(2 * N + 1, 2 * N + 3, 1, psum(0, N));\\n\\tint ans = mincostflow(2 * N + 4, 2 * N + 2, 2 * N + 3, 2, cap, cost);\\n\\tcout << psum(0, N) * 2 - ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 179712,\n \"score_of_the_acc\": -0.6371,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2290_6027738\",\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 = 998244353;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 2;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\ntemplate<typename T>\\nstruct mcf {\\nprivate:\\n\\tstruct edge {\\n\\t\\tint to, cap; T cost; int rev;\\n\\t};\\n\\tvector<vector<edge>> G;\\n\\tvector<P> par;\\n\\tvector<T> dist;\\n\\tT inf = mod;\\npublic:\\n\\tmcf(int n) {\\n\\t\\tG.resize(n);\\n\\t\\tpar.resize(n);\\n\\t\\tdist.resize(n);\\n\\t}\\n\\tvoid add_edge(int from, int to, int cap, T cost) {\\n\\t\\tG[from].push_back({ to,cap,cost,(int)G[to].size() });\\n\\t\\tG[to].push_back({ from,0,-cost,(int)G[from].size() - 1 });\\n\\t}\\n\\tpair<T, int> minimum_road(int s, int t) {\\n\\t\\tfill(all(par), P{ -1,-1 });\\n\\t\\tfill(all(dist), inf);\\n\\t\\tdist[s] = 0;\\n\\t\\tpriority_queue<pair<T, int>, vector<pair<T, int>>, greater<pair<T, int>>> q;\\n\\t\\tq.push({ 0,s });\\n\\t\\twhile (!q.empty()) {\\n\\t\\t\\tpair<T, int> p = q.top(); q.pop();\\n\\t\\t\\tint id = p.second;\\n\\t\\t\\tif (id == t)continue;\\n\\t\\t\\tif (p.first > dist[id])continue;\\n\\t\\t\\trep(j, G[id].size()) {\\n\\t\\t\\t\\tif (G[id][j].cap > 0) {\\n\\t\\t\\t\\t\\tint to = G[id][j].to;\\n\\t\\t\\t\\t\\tT nd = p.first + G[id][j].cost;\\n\\t\\t\\t\\t\\tif (nd < dist[to]) {\\n\\t\\t\\t\\t\\t\\tdist[to] = nd;\\n\\t\\t\\t\\t\\t\\tpar[to] = { id,j };\\n\\t\\t\\t\\t\\t\\tq.push({ dist[to],to });\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint cur = t;\\n\\t\\tint f = mod;\\n\\t\\twhile (cur != s) {\\n\\t\\t\\tint p = par[cur].first, j = par[cur].second;\\n\\t\\t\\tif (p < 0)return { -1,-1 };\\n\\t\\t\\tf = min(f, G[p][j].cap);\\n\\t\\t\\tcur = p;\\n\\t\\t}\\n\\t\\tcur = t;\\n\\t\\twhile (cur != s) {\\n\\t\\t\\tint p = par[cur].first, j = par[cur].second;\\n\\t\\t\\tif (p < 0)return { -1,-1 };\\n\\t\\t\\tG[p][j].cap -= f;\\n\\t\\t\\tif (G[p][j].rev >= 0) {\\n\\t\\t\\t\\tG[cur][G[p][j].rev].cap += f;\\n\\t\\t\\t}\\n\\t\\t\\tcur = p;\\n\\t\\t}\\n\\t\\treturn { dist[t],f };\\n\\t}\\n\\tT minimum_cost_flow(int s, int t, int k) {\\n\\t\\tT ret = 0;\\n\\t\\trep(i, k) {\\n\\t\\t\\tpair<T, int> z = minimum_road(s, t);\\n\\t\\t\\tif (z.first < 0)return -1;\\n\\t\\t\\tif (k - i <= z.second) {\\n\\t\\t\\t\\tret += z.first * (k - i); break;\\n\\t\\t\\t}\\n\\t\\t\\ti += z.second - 1;\\n\\t\\t\\tret += z.first * z.second;\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n};\\n\\nvoid solve() {\\n\\tint n, v, xl, xr; cin >> n >> v >> xl >> xr;\\n\\tvector<int> x(n), t(n), p(n);\\n\\trep(i, n) {\\n\\t\\tcin >> x[i] >> t[i] >> p[i];\\n\\t}\\n\\n\\tx.push_back(xl);\\n\\tt.push_back(0);\\n\\tp.push_back(0);\\n\\tx.push_back(xr);\\n\\tt.push_back(0);\\n\\tp.push_back(0);\\n\\n\\tn += 2;\\n\\tvector<P> vp;\\n\\trep(i, n)vp.push_back({ t[i],i });\\n\\tsort(all(vp));\\n\\tvector<int> nx(n), nt(n), np(n);\\n\\trep(i, n) {\\n\\t\\tint id = vp[i].second;\\n\\t\\tnx[i] = x[id];\\n\\t\\tnt[i] = t[id];\\n\\t\\tnp[i] = p[id];\\n\\t}\\n\\tswap(x, nx);\\n\\tswap(t, nt);\\n\\tswap(p, np);\\n\\tvector<int> rp(n + 1);\\n\\trep(i, n)rp[i + 1] = rp[i] + p[i];\\n\\n\\n\\tmcf<int> mc(2*n + 1);\\n\\trep(i, n) {\\n\\t\\tmc.add_edge(i, i + n, 1, 0);\\n\\t\\tmc.add_edge(i, i + n, 2, p[i]);\\n\\n\\t\\tmc.add_edge(i + n, 2 * n, 2, rp[n] - rp[i + 1]);\\n\\t}\\n\\trep(i, n)Rep(j, i+1, n) {\\n\\t\\tint idl = i;\\n\\t\\tint idr = j;\\n\\t\\tint dx = abs(x[idl] - x[idr]);\\n\\t\\tint dt = t[idr] - t[idl];\\n\\t\\tif (v * dt >= dx) {\\n\\t\\t\\tmc.add_edge(idl + n, idr, 2, rp[idr] - rp[idl + 1]);\\n\\t\\t}\\n\\t}\\n\\n\\tint ans = 0;\\n\\tans += mc.minimum_cost_flow(0, 2*n, 1);\\n\\t//cout << rp[n] - ans << \\\"\\\\n\\\";\\n\\tans += mc.minimum_cost_flow(1, 2 * n, 1);\\n\\n\\tans = 2 * rp[n] - ans;\\n\\tcout << ans << \\\"\\\\n\\\";\\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//int t; cin >> t; rep(i, t)\\n\\t//while (cin>>s,s!=\\\".\\\")\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 243348,\n \"score_of_the_acc\": -1.0571,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2290_5801620\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=6005,INF=1<<29;\\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];\\nvector<int> id;\\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 for(int v:id){\\n for(auto e:G[v]){\\n if(e.cap>0) chmin(h[e.to],h[v]+e.cost);\\n }\\n }\\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 ll N,VV,xl,xr;cin>>N>>VV>>xl>>xr;\\n vector<ll> X(N),T(N),P(N);\\n for(int i=0;i<N;i++) cin>>X[i]>>T[i]>>P[i];\\n V=2*N+4;\\n int s=2*N,t=s+1,sl=s+2,sr=s+3;\\n \\n for(int i=0;i<N;i++){\\n add_edge(i,N+i,1,-P[i]);\\n add_edge(i,N+i,1,0);\\n add_edge(N+i,t,2,0);\\n \\n if(abs(X[i]-xl)<=VV*T[i]) add_edge(sl,i,1,0);\\n if(abs(X[i]-xr)<=VV*T[i]) add_edge(sr,i,1,0);\\n \\n for(int j=0;j<N;j++){\\n if(T[i]>=T[j]) continue;\\n if(abs(X[i]-X[j])<=VV*(T[j]-T[i])) add_edge(N+i,j,2,0);\\n }\\n }\\n add_edge(s,sl,1,0);\\n add_edge(s,sr,1,0);\\n add_edge(s,t,2,0);\\n \\n vector<pair<ll,int>> S(N);\\n for(int i=0;i<N;i++) S[i]=mp(T[i],i);\\n sort(all(S));\\n id.push_back(s);\\n id.push_back(sl);\\n id.push_back(sr);\\n for(auto a:S){\\n id.push_back(a.se);\\n id.push_back(N+a.se);\\n }\\n id.push_back(t);\\n \\n cout<<-min_cost_flow(s,t,2)<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 244012,\n \"score_of_the_acc\": -1.0793,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2290_5801611\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=6005;\\nconst ll INF=1LL<<57;\\n\\ntypedef pair<ll,int> P;\\n\\nstruct edge{int to,cap;ll cost;int rev;};\\n\\nint V;\\nvector<edge> G[MAX];\\nll h[MAX];\\nll dist[MAX];\\nint prevv[MAX],preve[MAX];\\nvector<int> id;\\n\\nvoid add_edge(int from,int to,int cap,ll 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\\nll min_cost_flow(int s,int t,int f){\\n ll res=0;\\n fill(h,h+V,0);\\n for(int v:id){\\n for(auto e:G[v]){\\n if(e.cap>0) chmin(h[e.to],h[v]+e.cost);\\n }\\n }\\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 ll N,VV,xl,xr;cin>>N>>VV>>xl>>xr;\\n vector<ll> X(N),T(N),P(N);\\n for(int i=0;i<N;i++) cin>>X[i]>>T[i]>>P[i];\\n V=2*N+2;\\n int s=2*N,t=s+1;\\n \\n for(int i=0;i<N;i++){\\n add_edge(i,N+i,1,-P[i]);\\n add_edge(i,N+i,1,0);\\n add_edge(N+i,t,2,0);\\n \\n if(abs(X[i]-xl)<=VV*T[i]) add_edge(s,i,1,0);\\n if(abs(X[i]-xr)<=VV*T[i]) add_edge(s,i,1,0);\\n \\n for(int j=0;j<N;j++){\\n if(T[i]>=T[j]) continue;\\n if(abs(X[i]-X[j])<=VV*(T[j]-T[i])) add_edge(N+i,j,2,0);\\n }\\n }\\n add_edge(s,t,2,0);\\n \\n vector<pair<ll,int>> S(N);\\n for(int i=0;i<N;i++) S[i]=mp(T[i],i);\\n sort(all(S));\\n id.push_back(s);\\n for(auto a:S){\\n id.push_back(a.se);\\n id.push_back(N+a.se);\\n }\\n id.push_back(t);\\n \\n cout<<-min_cost_flow(s,t,2)<<endl;\\n}\",\n \"accuracy\": 0.2653061224489796,\n \"time_ms\": 150,\n \"memory_kb\": 133056,\n \"score_of_the_acc\": -0.3664,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2290_4869085\",\n \"code_snippet\": \"#define PROBLEM \\\"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2290\\\"\\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\\n// O(F E log V)\\ntemplate<typename Flow, typename Cost>\\nstruct PrimalDual{\\n struct Edge{\\n int dst;\\n Flow cap;\\n Cost cost;\\n int rev;\\n Edge(int dst,Flow cap,Cost cost,int rev):\\n dst(dst),cap(cap),cost(cost),rev(rev){}\\n };\\n\\n vector<vector<Edge>> G;\\n vector<Cost> h,dist;\\n vector<int> prevv,preve;\\n\\n PrimalDual(int n):G(n),h(n),dist(n),prevv(n),preve(n){}\\n\\n void add_edge(int u,int v,Flow cap,Cost cost){\\n int e=G[u].size();\\n int r=(u==v?e+1:G[v].size());\\n G[u].emplace_back(v,cap,cost,r);\\n G[v].emplace_back(u,0,-cost,e);\\n }\\n\\n Cost residual_cost(int src,Edge &e){\\n return e.cost+h[src]-h[e.dst];\\n }\\n\\n void dijkstra(int s){\\n struct P{\\n Cost first;\\n int second;\\n P(Cost first,int second):first(first),second(second){}\\n bool operator<(const P&a) const{return first>a.first;}\\n };\\n priority_queue<P> pq;\\n\\n dist[s]=0;\\n pq.emplace(dist[s],s);\\n while(!pq.empty()){\\n P p=pq.top();pq.pop();\\n int v=p.second;\\n if(dist[v]<p.first) continue;\\n for(int i=0;i<(int)G[v].size();i++){\\n Edge &e=G[v][i];\\n if(e.cap==0) continue;\\n if(dist[v]+residual_cost(v,e)<dist[e.dst]){\\n dist[e.dst]=dist[v]+e.cost+h[v]-h[e.dst];\\n prevv[e.dst]=v;\\n preve[e.dst]=i;\\n pq.emplace(dist[e.dst],e.dst);\\n }\\n }\\n }\\n }\\n\\n Cost res;\\n\\n bool build(int s,int t,Flow f,\\n function<void(decltype(h)&)> init=[](decltype(h) &p){\\n fill(p.begin(),p.end(),0);\\n }){\\n res=0;\\n init(h);\\n const Cost INF = numeric_limits<Cost>::max();\\n while(f>0){\\n fill(dist.begin(),dist.end(),INF);\\n dijkstra(s);\\n if(dist[t]==INF) return false;\\n\\n for(int v=0;v<(int)h.size();v++)\\n if(dist[v]<INF) h[v]=h[v]+dist[v];\\n\\n Flow d=f;\\n for(int v=t;v!=s;v=prevv[v])\\n d=min(d,G[prevv[v]][preve[v]].cap);\\n\\n f-=d;\\n res=res+h[t]*d;\\n for(int v=t;v!=s;v=prevv[v]){\\n Edge &e=G[prevv[v]][preve[v]];\\n e.cap-=d;\\n G[v][e.rev].cap+=d;\\n }\\n }\\n return true;\\n }\\n\\n Cost get_cost(){return res;}\\n};\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned geocon2013_B(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n using D = double;\\n\\n int n;\\n cin>>n;\\n vector<D> xs(n),ys(n);\\n for(int i=0;i<n;i++) cin>>xs[i]>>ys[i];\\n\\n vector<int> pos,neg;\\n for(int i=0;i<n;i++){\\n if(xs[i]>0) pos.emplace_back(i);\\n if(xs[i]<0) neg.emplace_back(i);\\n }\\n\\n int f=max(pos.size(),neg.size());\\n if(f==0){\\n cout<<0<<endl;\\n return 0;\\n }\\n\\n PrimalDual<int, D> G(n+3);\\n int S=n,T=n+1,U=n+2;\\n for(int z:pos) G.add_edge(S,z,1,0);\\n for(int z:neg) G.add_edge(z,T,1,0);\\n\\n int dif=pos.size()-neg.size();\\n if(dif>0){\\n G.add_edge(U,T,dif,0);\\n for(int p:pos)\\n G.add_edge(p,U,1,abs(xs[p]));\\n }\\n if(dif<0){\\n G.add_edge(S,U,-dif,0);\\n for(int q:neg)\\n G.add_edge(U,q,1,abs(xs[q]));\\n }\\n\\n for(int p:pos)\\n for(int q:neg)\\n G.add_edge(p,q,1,\\n min(hypot(xs[p]+xs[q],ys[p]-ys[q]),abs(xs[p])+abs(xs[q])));\\n\\n assert(G.build(S,T,f));\\n cout<<fixed<<setprecision(12)<<G.get_cost()<<endl;\\n return 0;\\n}\\n/*\\n verified on 2020/09/25\\n https://atcoder.jp/contests/geocon2013/tasks/geocon2013_b\\n*/\\n\\nsigned main(){\\n geocon2013_B();\\n return 0;\\n}\\n#endif\\n\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n\\n//BEGIN CUT HERE\\nvector<int> identity(int n){\\n vector<int> ord(n);\\n iota(ord.begin(),ord.end(),0);\\n return ord;\\n}\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int n,v,xleft,xright;\\n cin>>n>>v>>xleft>>xright;\\n\\n int S=n+n,T=n+n+1,L=n+n+2,R=n+n+3;\\n PrimalDual<int, int> G(n+n+4);\\n\\n G.add_edge(S,L,1,0);\\n G.add_edge(L,T,1,0);\\n\\n G.add_edge(S,R,1,0);\\n G.add_edge(R,T,1,0);\\n\\n vector<int> xs(n),ts(n),ps(n);\\n for(int i=0;i<n;i++){\\n cin>>xs[i]>>ts[i]>>ps[i];\\n\\n if(abs(xs[i]-xleft)<=ts[i]*v)\\n G.add_edge(L,i,1,0);\\n\\n if(abs(xs[i]-xright)<=ts[i]*v)\\n G.add_edge(R,i,1,0);\\n }\\n\\n auto init=[&](auto &h)->void{\\n fill(h.begin(),h.end(),0);\\n\\n auto ord=identity(n);\\n sort(ord.begin(),ord.end(),\\n [&](int i,int j){return ts[i]<ts[j];});\\n\\n auto add_edge=[&](int u,int v,int f,int c){\\n G.add_edge(u,v,f,c);\\n chmin(h[v],h[u]+c);\\n };\\n\\n for(int i=0;i<n;i++){\\n int x=ord[i];\\n add_edge(x,n+x,1,-ps[x]);\\n for(int j=i+1;j<n;j++){\\n int y=ord[j];\\n if(abs(xs[x]-xs[y])<=(ts[y]-ts[x])*v)\\n add_edge(n+x,y,1,0);\\n }\\n add_edge(n+x,T,1,0);\\n }\\n };\\n assert(G.build(S,T,2,init));\\n cout<<-G.get_cost()<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 245160,\n \"score_of_the_acc\": -1.065,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2290_4869075\",\n \"code_snippet\": \"#define PROBLEM \\\"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=2290\\\"\\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\\n// O(F E log V)\\ntemplate<typename Flow, typename Cost>\\nstruct PrimalDual{\\n struct Edge{\\n int dst;\\n Flow cap;\\n Cost cost;\\n int rev;\\n Edge(int dst,Flow cap,Cost cost,int rev):\\n dst(dst),cap(cap),cost(cost),rev(rev){}\\n };\\n\\n vector<vector<Edge>> G;\\n vector<Cost> h,dist;\\n vector<int> prevv,preve;\\n\\n PrimalDual(int n):G(n),h(n),dist(n),prevv(n),preve(n){}\\n\\n void add_edge(int u,int v,Flow cap,Cost cost){\\n int e=G[u].size();\\n int r=(u==v?e+1:G[v].size());\\n G[u].emplace_back(v,cap,cost,r);\\n G[v].emplace_back(u,0,-cost,e);\\n }\\n\\n Cost residual_cost(int src,Edge &e){\\n return e.cost+h[src]-h[e.dst];\\n }\\n\\n void dijkstra(int s){\\n struct P{\\n Cost first;\\n int second;\\n P(Cost first,int second):first(first),second(second){}\\n bool operator<(const P&a) const{return first>a.first;}\\n };\\n priority_queue<P> pq;\\n\\n dist[s]=0;\\n pq.emplace(dist[s],s);\\n while(!pq.empty()){\\n P p=pq.top();pq.pop();\\n int v=p.second;\\n if(dist[v]<p.first) continue;\\n for(int i=0;i<(int)G[v].size();i++){\\n Edge &e=G[v][i];\\n if(e.cap==0) continue;\\n if(dist[v]+residual_cost(v,e)<dist[e.dst]){\\n dist[e.dst]=dist[v]+e.cost+h[v]-h[e.dst];\\n prevv[e.dst]=v;\\n preve[e.dst]=i;\\n pq.emplace(dist[e.dst],e.dst);\\n }\\n }\\n }\\n }\\n\\n Cost res;\\n\\n bool build(int s,int t,Flow f,\\n function<void(decltype(h)&)> init=[](decltype(h) &p){\\n fill(p.begin(),p.end(),0);\\n }){\\n res=0;\\n init(h);\\n const Cost INF = numeric_limits<Cost>::max();\\n while(f>0){\\n fill(dist.begin(),dist.end(),INF);\\n dijkstra(s);\\n if(dist[t]==INF) return false;\\n\\n for(int v=0;v<(int)h.size();v++)\\n if(dist[v]<INF) h[v]=h[v]+dist[v];\\n\\n Flow d=f;\\n for(int v=t;v!=s;v=prevv[v])\\n d=min(d,G[prevv[v]][preve[v]].cap);\\n\\n f-=d;\\n res=res+h[t]*d;\\n for(int v=t;v!=s;v=prevv[v]){\\n Edge &e=G[prevv[v]][preve[v]];\\n e.cap-=d;\\n G[v][e.rev].cap+=d;\\n }\\n }\\n return true;\\n }\\n\\n Cost get_cost(){return res;}\\n};\\n//END CUT HERE\\n#ifndef call_from_test\\n//INSERT ABOVE HERE\\nsigned geocon2013_B(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n using D = double;\\n\\n int n;\\n cin>>n;\\n vector<D> xs(n),ys(n);\\n for(int i=0;i<n;i++) cin>>xs[i]>>ys[i];\\n\\n vector<int> pos,neg;\\n for(int i=0;i<n;i++){\\n if(xs[i]>0) pos.emplace_back(i);\\n if(xs[i]<0) neg.emplace_back(i);\\n }\\n\\n int f=max(pos.size(),neg.size());\\n if(f==0){\\n cout<<0<<endl;\\n return 0;\\n }\\n\\n PrimalDual<int, D> G(n+3);\\n int S=n,T=n+1,U=n+2;\\n for(int z:pos) G.add_edge(S,z,1,0);\\n for(int z:neg) G.add_edge(z,T,1,0);\\n\\n int dif=pos.size()-neg.size();\\n if(dif>0){\\n G.add_edge(U,T,dif,0);\\n for(int p:pos)\\n G.add_edge(p,U,1,abs(xs[p]));\\n }\\n if(dif<0){\\n G.add_edge(S,U,-dif,0);\\n for(int q:neg)\\n G.add_edge(U,q,1,abs(xs[q]));\\n }\\n\\n for(int p:pos)\\n for(int q:neg)\\n G.add_edge(p,q,1,\\n min(hypot(xs[p]+xs[q],ys[p]-ys[q]),abs(xs[p])+abs(xs[q])));\\n\\n assert(G.build(S,T,f));\\n cout<<fixed<<setprecision(12)<<G.get_cost()<<endl;\\n return 0;\\n}\\n/*\\n verified on 2020/09/25\\n https://atcoder.jp/contests/geocon2013/tasks/geocon2013_b\\n*/\\n\\nsigned main(){\\n geocon2013_B();\\n return 0;\\n}\\n#endif\\n\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n//BEGIN CUT HERE\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n\\n#ifndef call_from_test\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#endif\\n\\n//BEGIN CUT HERE\\nvector<int> identity(int n){\\n vector<int> ord(n);\\n iota(ord.begin(),ord.end(),0);\\n return ord;\\n}\\n//END CUT HERE\\n#ifndef call_from_test\\nsigned main(){\\n return 0;\\n}\\n#endif\\n\\n#undef call_from_test\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int n,v,xleft,xright;\\n cin>>n>>v>>xleft>>xright;\\n\\n int S=n+n,T=n+n+1,L=n+n+2,R=n+n+3;\\n PrimalDual<int, int> G(n+n+4);\\n\\n G.add_edge(S,L,1,0);\\n G.add_edge(L,T,1,0);\\n\\n G.add_edge(S,R,1,0);\\n G.add_edge(R,T,1,0);\\n\\n vector<int> xs(n),ts(n),ps(n);\\n for(int i=0;i<n;i++){\\n cin>>xs[i]>>ts[i]>>ps[i];\\n\\n if(abs(xs[i]-xleft)<=ts[i]*v)\\n G.add_edge(L,i,1,0);\\n\\n if(abs(xs[i]-xright)<=ts[i]*v)\\n G.add_edge(R,i,1,0);\\n\\n G.add_edge(i,n+i,1,-ps[i]);\\n G.add_edge(n+i,T,1,0);\\n }\\n\\n for(int i=0;i<n;i++)\\n for(int j=0;j<n;j++)\\n if(ts[i]<ts[j] and abs(xs[i]-xs[j])<=(ts[j]-ts[i])*v)\\n G.add_edge(n+i,j,1,0);\\n\\n auto init=[&](auto &h)->void{\\n auto ord=identity(n);\\n sort(ord.begin(),ord.end(),\\n [&](int i,int j){return ts[i]<ts[j];});\\n fill(h.begin(),h.end(),0);\\n\\n for(int i=0;i<n;i++){\\n int x=ord[i];\\n chmin(h[n+x],h[x]-ps[x]);\\n for(int j=i+1;j<n;j++){\\n int y=ord[j];\\n if(abs(xs[x]-xs[y])<=(ts[y]-ts[x])*v)\\n chmin(h[y],h[n+x]);\\n }\\n chmin(h[T],h[n+x]);\\n }\\n };\\n assert(G.build(S,T,2,init));\\n cout<<-G.get_cost()<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1050,\n \"memory_kb\": 243112,\n \"score_of_the_acc\": -1.1017,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2290_4869066\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Int = long long;\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\\ntemplate<typename T> void drop(const T &x){cout<<x<<endl;exit(0);}\\ntemplate<typename T=int>\\nvector<T> read(size_t n){\\n vector<T> ts(n);\\n for(size_t i=0;i<n;i++) cin>>ts[i];\\n return ts;\\n}\\n\\n\\n// O(F E log V)\\ntemplate<typename Flow, typename Cost>\\nstruct PrimalDual{\\n struct Edge{\\n int to;\\n Flow cap;\\n Cost cost;\\n int rev;\\n Edge(int to,Flow cap,Cost cost,int rev):\\n to(to),cap(cap),cost(cost),rev(rev){}\\n };\\n\\n vector<vector<Edge>> G;\\n vector<Cost> h,dist;\\n vector<int> prevv,preve;\\n\\n PrimalDual(int n):G(n),h(n),dist(n),prevv(n),preve(n){}\\n\\n void add_edge(int u,int v,Flow cap,Cost cost){\\n int e=G[u].size();\\n int r=(u==v?e+1:G[v].size());\\n G[u].emplace_back(v,cap,cost,r);\\n G[v].emplace_back(u,0,-cost,e);\\n }\\n\\n void dijkstra(int s){\\n // cout<<\\\"dijkstra\\\"<<endl;\\n struct P{\\n Cost first;\\n int second;\\n P(Cost first,int second):first(first),second(second){}\\n bool operator<(const P&a) const{return first>a.first;}\\n };\\n priority_queue<P> pq;\\n\\n dist[s]=0;\\n pq.emplace(dist[s],s);\\n while(!pq.empty()){\\n P p=pq.top();pq.pop();\\n int v=p.second;\\n if(dist[v]<p.first) continue;\\n for(int i=0;i<(int)G[v].size();i++){\\n Edge &e=G[v][i];\\n if(e.cap==0) continue;\\n // if(e.cost+h[v]-h[e.to]<0) cout<<e.cost+h[v]-h[e.to]<<endl;\\n assert(e.cost+h[v]-h[e.to]>=0);\\n if(dist[v]+e.cost+h[v]-h[e.to]<dist[e.to]){\\n dist[e.to]=dist[v]+e.cost+h[v]-h[e.to];\\n prevv[e.to]=v;\\n preve[e.to]=i;\\n pq.emplace(dist[e.to],e.to);\\n }\\n }\\n }\\n }\\n\\n Cost res;\\n\\n bool build(int s,int t,Flow f,\\n function<void(decltype(h)&)> init=[](decltype(h) &p){\\n fill(p.begin(),p.end(),0);\\n }){\\n res=0;\\n init(h);\\n const Cost INF = numeric_limits<Cost>::max();\\n while(f>0){\\n fill(dist.begin(),dist.end(),INF);\\n dijkstra(s);\\n if(dist[t]==INF) return false;\\n\\n for(int v=0;v<(int)h.size();v++)\\n if(dist[v]<INF) h[v]=h[v]+dist[v];\\n\\n Flow d=f;\\n for(int v=t;v!=s;v=prevv[v])\\n d=min(d,G[prevv[v]][preve[v]].cap);\\n\\n f-=d;\\n res=res+h[t]*d;\\n for(int v=t;v!=s;v=prevv[v]){\\n Edge &e=G[prevv[v]][preve[v]];\\n e.cap-=d;\\n G[v][e.rev].cap+=d;\\n }\\n }\\n return true;\\n }\\n\\n Cost get_cost(){return res;}\\n};\\n\\n\\nvector<int> identity(int n){\\n vector<int> ord(n);\\n iota(ord.begin(),ord.end(),0);\\n return ord;\\n}\\n\\n//INSERT ABOVE HERE\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n\\n int n,v,xleft,xright;\\n cin>>n>>v>>xleft>>xright;\\n\\n int S=n+n,T=n+n+1,L=n+n+2,R=n+n+3;\\n PrimalDual<int, int> G(n+n+4);\\n\\n G.add_edge(S,L,1,0);\\n G.add_edge(L,T,1,0);\\n\\n G.add_edge(S,R,1,0);\\n G.add_edge(R,T,1,0);\\n\\n vector<int> xs(n),ts(n),ps(n);\\n for(int i=0;i<n;i++){\\n cin>>xs[i]>>ts[i]>>ps[i];\\n\\n if(abs(xs[i]-xleft)<=ts[i]*v)\\n G.add_edge(L,i,1,0);\\n\\n if(abs(xs[i]-xright)<=ts[i]*v)\\n G.add_edge(R,i,1,0);\\n\\n G.add_edge(i,n+i,1,-ps[i]);\\n G.add_edge(n+i,T,1,0);\\n }\\n\\n for(int i=0;i<n;i++)\\n for(int j=0;j<n;j++)\\n if(ts[i]<ts[j] and abs(xs[i]-xs[j])<=(ts[j]-ts[i])*v)\\n G.add_edge(n+i,j,1,0);\\n\\n auto init=[&](auto &h)->void{\\n auto ord=identity(n);\\n sort(ord.begin(),ord.end(),\\n [&](int i,int j){return ts[i]<ts[j];});\\n fill(h.begin(),h.end(),0);\\n\\n for(int i=0;i<n;i++){\\n int x=ord[i];\\n chmin(h[n+x],h[x]-ps[x]);\\n for(int j=i+1;j<n;j++){\\n int y=ord[j];\\n if(abs(xs[x]-xs[y])<=(ts[y]-ts[x])*v)\\n chmin(h[y],h[n+x]);\\n }\\n chmin(h[T],h[n+x]);\\n }\\n };\\n assert(G.build(S,T,2,init));\\n cout<<-G.get_cost()<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1020,\n \"memory_kb\": 243100,\n \"score_of_the_acc\": -1.0966,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2290_4108846\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing int64 = long long;\\nconst int mod = 1e9 + 7;\\n// const int mod = 998244353;\\n\\nconst int64 infll = (1LL << 62) - 1;\\nconst int inf = (1 << 30) - 1;\\n\\nstruct IoSetup {\\n IoSetup() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n cerr << fixed << setprecision(10);\\n }\\n} iosetup;\\n\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate< typename T = int64 >\\nvector< T > make_v(size_t a) {\\n return vector< T >(a);\\n}\\n\\ntemplate< typename T, typename... Ts >\\nauto make_v(size_t a, Ts... ts) {\\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\\n t = v;\\n}\\n\\ntemplate< typename T, typename V >\\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\\n for(auto &e : t) fill_v(e, v);\\n}\\n\\ntemplate< typename F >\\nstruct FixPoint : F {\\n FixPoint(F &&f) : F(forward< F >(f)) {}\\n\\n template< typename... Args >\\n decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, forward< Args >(args)...);\\n }\\n};\\n\\ntemplate< typename F >\\ninline decltype(auto) MFP(F &&f) {\\n return FixPoint< F >{forward< F >(f)};\\n}\\n\\ntemplate< typename CapType, typename CostType >\\nclass MinCostFlowDAG {\\npublic:\\n using Cat = CapType;\\n using Cot = CostType;\\n using pti = pair< Cot, int >;\\n struct edge {\\n int to, rev;\\n Cat cap;\\n Cot cost;\\n };\\n const int V;\\n const Cot inf;\\n vector< vector< edge > > G;\\n vector< Cot > h, dist;\\n vector< int > deg, ord, prevv, preve;\\n\\n MinCostFlowDAG(const int node_size) : V(node_size), inf(numeric_limits< Cot >::max() / 4),\\n G(V), h(V, inf), dist(V), deg(V, 0), prevv(V), preve(V) {}\\n\\n void add_edge(const int from, const int to, const Cat cap, const Cot cost) {\\n G[from].push_back((edge) {to, (int) G[to].size(), cap, cost});\\n G[to].push_back((edge) {from, (int) G[from].size() - 1, 0, -cost});\\n ++deg[to];\\n }\\n\\n bool tsort() {\\n queue< int > que;\\n for(int i = 0; i < V; ++i) {\\n if(deg[i] == 0) que.push(i);\\n }\\n while(!que.empty()) {\\n const int p = que.front();\\n que.pop();\\n ord.push_back(p);\\n for(auto &e : G[p]) {\\n if(e.cap > 0 && --deg[e.to] == 0) que.push(e.to);\\n }\\n }\\n return (*max_element(deg.begin(), deg.end()) == 0);\\n }\\n\\n void calc_potential(const int s) {\\n h[s] = 0;\\n for(const int v : ord) {\\n if(h[v] == inf) continue;\\n for(edge &e : G[v]) {\\n if(e.cap > 0) h[e.to] = min(h[e.to], h[v] + e.cost);\\n }\\n }\\n }\\n\\n void Dijkstra(const int s) {\\n priority_queue< pti, vector< pti >, greater< pti > > que;\\n fill(dist.begin(), dist.end(), inf);\\n dist[s] = 0;\\n que.push(pti(0, s));\\n while(!que.empty()) {\\n pti p = que.top();\\n que.pop();\\n const int v = p.second;\\n if(dist[v] < p.first) continue;\\n for(int i = 0; i < (int) G[v].size(); ++i) {\\n edge &e = G[v][i];\\n if(e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to]) {\\n dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];\\n prevv[e.to] = v, preve[e.to] = i;\\n que.push(pti(dist[e.to], e.to));\\n }\\n }\\n }\\n }\\n\\n void update(const int s, const int t, Cat &f, Cot &res) {\\n for(int i = 0; i < V; i++) {\\n h[i] += dist[i];\\n }\\n Cat 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 += h[t] * d;\\n for(int v = t; v != s; v = prevv[v]) {\\n edge &e = G[prevv[v]][preve[v]];\\n e.cap -= d;\\n G[v][e.rev].cap += d;\\n }\\n }\\n\\n Cot solve(const int s, const int t, Cat f) {\\n if(!tsort()) assert(false); // not DAG\\n calc_potential(s);\\n Cot res = 0;\\n while(f > 0) {\\n Dijkstra(s);\\n if(dist[t] == inf) return -inf;\\n update(s, t, f, res);\\n }\\n return res;\\n }\\n};\\n\\nint main() {\\n int N, V, X[2];\\n cin >> N >> V >> X[0] >> X[1];\\n vector< int > P(N), T(N), S(N);\\n for(int i = 0; i < N; i++) {\\n cin >> P[i] >> T[i] >> S[i];\\n }\\n int src = 2 * N;\\n int snk = src + 1;\\n int latte = snk + 1;\\n int malta = latte + 1;\\n MinCostFlowDAG< int, int > flow(2 * N + 4);\\n for(int i = 0; i < N; i++) {\\n flow.add_edge(2 * i, 2 * i + 1, 1, -S[i]);\\n flow.add_edge(2 * i + 1, snk, 1, 0);\\n if(abs(X[0] - P[i]) <= 1LL * T[i] * V) flow.add_edge(latte, 2 * i, 1, 0);\\n if(abs(X[1] - P[i]) <= 1LL * T[i] * V) flow.add_edge(malta, 2 * i, 1, 0);\\n for(int j = 0; j < N; j++) {\\n if(i == j) continue;\\n if(abs(P[i] - P[j]) <= 1LL * V * (T[j] - T[i])) {\\n flow.add_edge(2 * i + 1, 2 * j, 1, 0);\\n }\\n }\\n }\\n flow.add_edge(src, snk, 2, 0);\\n flow.add_edge(src, latte, 1, 0);\\n flow.add_edge(src, malta, 1, 0);\\n cout << -flow.solve(src, snk, 2) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1200,\n \"memory_kb\": 242392,\n \"score_of_the_acc\": -1.1234,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2290_4108810\",\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 ...Ts>\\ndecltype(auto) zip(vector<Ts>... args){\\n vector<decltype(make_tuple(args[0]...))> res;\\n int n=min({args.size()...});\\n res.reserve(n);\\n for(int i=0;i<n;i++) res.emplace_back(args[i]...);\\n return res;\\n}\\n\\ntemplate<typename V>\\nV compress(V v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n return v;\\n}\\ntemplate<typename T>\\nmap<T, int> dict(const vector<T> &v){\\n map<T, int> res;\\n for(int i=0;i<(int)v.size();i++)\\n res[v[i]]=i;\\n return res;\\n}\\nmap<char, int> dict(const string &v){\\n return dict(vector<char>(v.begin(),v.end()));\\n}\\n\\n\\ntemplate<typename F>\\nstruct FixPoint : F{\\n FixPoint(F&& f):F(forward<F>(f)){}\\n template<typename... Args>\\n decltype(auto) operator()(Args&&... args) const{\\n return F::operator()(*this,forward<Args>(args)...);\\n }\\n};\\ntemplate<typename F>\\ninline decltype(auto) MFP(F&& f){\\n return FixPoint<F>{forward<F>(f)};\\n}\\n\\n//INSERT ABOVE HERE\\nconst int MAX = 3030;\\nint dp[MAX][MAX]={};\\nint rs[MAX][MAX]={};\\n\\nconst int INF = 1e9;\\ntemplate<typename T>\\nstruct BIT{\\n int n;\\n vector<T> bit;\\n //1-indexed\\n BIT(int n_):n(n_+2),bit(n,-INF){}\\n\\n T sum(int i){\\n i++;\\n\\n T s(-INF);\\n for(int x=i;x>0;x-=(x&-x))\\n chmax(s,bit[x]);\\n return s;\\n }\\n\\n void add(int i,T a){\\n i++;\\n\\n for(int x=i;x<n;x+=(x&-x))\\n chmax(bit[x],a);\\n }\\n};\\n\\nsigned main(){\\n int n,v,xl,xr;\\n cin>>n>>v>>xl>>xr;\\n\\n vector<int> xs(n),ts(n),ps(n);\\n for(int i=0;i<n;i++) cin>>xs[i]>>ts[i]>>ps[i];\\n xs.emplace_back(xl);\\n ts.emplace_back(0);\\n ps.emplace_back(0);\\n xs.emplace_back(xr);\\n ts.emplace_back(0);\\n ps.emplace_back(0);\\n\\n xs.emplace_back(0);\\n ts.emplace_back(INF);\\n ps.emplace_back(0);\\n\\n n=xs.size();\\n auto zs=zip(ts,xs,ps);\\n sort(zs.begin(),zs.end());\\n for(int i=0;i<n;i++)\\n tie(ts[i],xs[i],ps[i])=zs[i];\\n\\n using ll = long long;\\n for(int i=0;i<n;i++)\\n for(int j=i+1;j<n;j++)\\n rs[i][j]=abs(xs[j]-xs[i])<=(ll)v*(ts[j]-ts[i]);\\n\\n for(int i=0;i<MAX;i++)\\n for(int j=0;j<MAX;j++)\\n dp[i][j]=-INF;\\n dp[0][1]=0;\\n\\n vector<ll> as(n),bs(n);\\n for(int i=0;i<n;i++){\\n as[i]=-xs[i]+(ll)v*ts[i];\\n bs[i]=+xs[i]+(ll)v*ts[i];\\n }\\n\\n auto da=dict(compress(as));\\n auto db=dict(compress(bs));\\n vector<int> va(n),vb(n);\\n for(int i=0;i<n;i++){\\n va[i]=da[as[i]];\\n vb[i]=db[bs[i]];\\n }\\n\\n using P = pair<ll, ll>;\\n vector<P> vp,vq;\\n for(int l=0;l<n;l++){\\n vp.emplace_back(+xs[l],l);\\n vq.emplace_back(-xs[l],l);\\n }\\n sort(vp.begin(),vp.end());\\n sort(vq.begin(),vq.end());\\n\\n for(int c=1;c<n;c++){\\n {\\n MFP([&](auto dfs,int l,int r)->void{\\n if(l+1==r) return;\\n int m=(l+r)>>1;\\n\\n dfs(l,m);\\n\\n if(r-l<=100){\\n for(int a=l;a<m;a++)\\n for(int b=m;b<r;b++)\\n if(rs[a][b])\\n chmax(dp[b][c],dp[a][c]+ps[b]);\\n\\n }else{\\n for(int k=0;k<2;k++){\\n vector<P> vp;\\n for(int a=l;a<m;a++)\\n vp.emplace_back(k?+xs[a]:-xs[a],a+0);\\n for(int b=m;b<r;b++)\\n vp.emplace_back(k?+xs[b]:-xs[b],b+n);\\n sort(vp.begin(),vp.end());\\n\\n vector<ll> vs;\\n for(int i=l;i<r;i++)\\n vs.emplace_back(k?as[i]:bs[i]);\\n auto cs=compress(vs);\\n vector<ll> ws(r-l);\\n for(int i=0;i<r-l;i++)\\n ws[i]=lower_bound(cs.begin(),cs.end(),vs[i])-cs.begin();\\n\\n BIT<int> bit(cs.size());\\n for(auto p:vp){\\n if(p.second<n){\\n int a=p.second;\\n bit.add(ws[a-l],dp[a][c]);\\n }else{\\n int b=p.second-n;\\n chmax(dp[b][c],bit.sum(ws[b-l])+ps[b]);\\n }\\n }\\n }\\n }\\n\\n dfs(m,r);\\n })(0,c);\\n }\\n\\n\\n for(int k=0;k<2;k++){\\n auto &vv=k?vp:vq;\\n auto &vw=k?va:vb;\\n BIT<int> bit(n+10);\\n for(auto p:vv){\\n if(p.second<c){\\n int l=p.second;\\n bit.add(vw[l],dp[l][c]);\\n }\\n if(p.second>c){\\n int r=p.second;\\n chmax(dp[c][r],bit.sum(vw[r])+ps[r]);\\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 chmax(ans,dp[i][j]);\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5920,\n \"memory_kb\": 67332,\n \"score_of_the_acc\": -1,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2290_4107478\",\n \"code_snippet\": \"//#define NDEBUG\\n#include <algorithm>\\n#include <cstddef>\\n#include <cstdint>\\n#include <iostream>\\n#include <utility>\\n#include <vector>\\n\\nnamespace n91 {\\n\\nusing i8 = std::int_fast8_t;\\nusing i32 = std::int_fast32_t;\\nusing i64 = std::int_fast64_t;\\nusing u8 = std::uint_fast8_t;\\nusing u32 = std::uint_fast32_t;\\nusing u64 = std::uint_fast64_t;\\nusing isize = std::ptrdiff_t;\\nusing usize = std::size_t;\\n\\nstruct rep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept : i(i) {}\\n void operator++() noexcept { ++i; }\\n constexpr usize operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\\n };\\n const itr f, l;\\n constexpr rep(const usize f, const usize l) noexcept\\n : f(std::min(f, l)), l(l) {}\\n constexpr auto begin() const noexcept { return f; }\\n constexpr auto end() const noexcept { return l; }\\n};\\nstruct revrep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept : i(i) {}\\n void operator++() noexcept { --i; }\\n constexpr usize operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\\n };\\n const itr f, l;\\n constexpr revrep(const usize f, const usize l) noexcept\\n : f(l - 1), l(std::min(f, l) - 1) {}\\n constexpr auto begin() const noexcept { return f; }\\n constexpr auto end() const noexcept { return l; }\\n};\\ntemplate <class T> auto md_vec(const usize n, const T &value) {\\n return std::vector<T>(n, value);\\n}\\ntemplate <class... Args> auto md_vec(const usize n, Args... args) {\\n return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));\\n}\\ntemplate <class T> constexpr T difference(const T &a, const T &b) noexcept {\\n if (a < b) {\\n return b - a;\\n } else {\\n return a - b;\\n }\\n}\\ntemplate <class T> void chmin(T &a, const T &b) noexcept {\\n if (b < a) {\\n a = b;\\n }\\n}\\ntemplate <class T> void chmax(T &a, const T &b) noexcept {\\n if (a < b) {\\n a = b;\\n }\\n}\\ntemplate <class F> class fix_point : private F {\\npublic:\\n explicit constexpr fix_point(F &&f) : F(std::forward<F>(f)) {}\\n\\n template <class... Args>\\n constexpr decltype(auto) operator()(Args &&... args) const {\\n return F::operator()(*this, std::forward<Args>(args)...);\\n }\\n};\\ntemplate <class F> constexpr decltype(auto) make_fix(F &&f) {\\n return fix_point<F>(std::forward<F>(f));\\n}\\ntemplate <class T> T scan() {\\n T ret;\\n std::cin >> ret;\\n return ret;\\n}\\n\\n} // namespace n91\\n#include <cassert>\\n#include <cstddef>\\n#include <vector>\\n\\ntemplate <class Monoid> class segment_tree {\\npublic:\\n using T = typename Monoid::value_type;\\n using size_t = std::size_t;\\n\\nprivate:\\n std::vector<T> tree;\\n\\n template <class F>\\n size_t search_subtree(size_t index, const F f, T fold_l) const {\\n while (index < size()) {\\n const T temp = Monoid::operation(fold_l, tree[index * 2]);\\n if (!f(temp)) {\\n index = index * 2;\\n } else {\\n fold_l = temp;\\n index = index * 2 + 1;\\n }\\n }\\n return index - size();\\n }\\n\\npublic:\\n segment_tree() = default;\\n explicit segment_tree(const size_t n) : tree(n * 2, Monoid::identity) {}\\n\\n size_t size() const noexcept { return tree.size() / 2; }\\n\\n T fold(size_t first, size_t last) const {\\n assert(first <= last);\\n assert(last <= size());\\n first += size();\\n last += size();\\n T fold_l = Monoid::identity;\\n T fold_r = Monoid::identity;\\n while (first != last) {\\n if (first % 2 != 0) {\\n fold_l = Monoid::operation(fold_l, tree[first]);\\n first += 1;\\n }\\n first /= 2;\\n if (last % 2 != 0) {\\n last -= 1;\\n fold_r = Monoid::operation(tree[last], fold_r);\\n }\\n last /= 2;\\n }\\n return Monoid::operation(fold_l, fold_r);\\n }\\n template <class F> size_t search(size_t first, size_t last, const F f) const {\\n assert(first <= last);\\n assert(last <= size());\\n first += size();\\n last += size();\\n const size_t last_cp = last;\\n size_t shift = 0;\\n T fold_l = Monoid::identity;\\n while (first != last) {\\n if (first % 2 != 0) {\\n const T temp = Monoid::operation(fold_l, tree[first]);\\n if (!f(temp))\\n return search_subtree(first, f, fold_l);\\n fold_l = temp;\\n first += 1;\\n }\\n first /= 2;\\n last /= 2;\\n shift += 1;\\n }\\n while (shift != 0) {\\n shift -= 1;\\n last = last_cp >> shift;\\n if (last % 2 != 0) {\\n last -= 1;\\n const T temp = Monoid::operation(fold_l, tree[last]);\\n if (!f(temp))\\n return search_subtree(last, f, fold_l);\\n fold_l = temp;\\n }\\n }\\n return last_cp - size();\\n }\\n\\n void update(size_t index, const T x) {\\n assert(index < size());\\n index += size();\\n tree[index] = x;\\n while (index != 1) {\\n index /= 2;\\n tree[index] = Monoid::operation(tree[index * 2], tree[index * 2 + 1]);\\n }\\n }\\n};\\n#include <algorithm>\\n#include <limits>\\n\\ntemplate <class T> class max_monoid {\\npublic:\\n using value_type = T;\\n static constexpr T operation(const T &x, const T &y) noexcept {\\n return std::max(x, y);\\n }\\n static constexpr T identity = std::numeric_limits<T>::lowest();\\n};\\ntemplate <class T> constexpr T max_monoid<T>::identity;\\n#include <algorithm>\\n#include <iostream>\\n#include <map>\\n#include <tuple>\\n#include <utility>\\n#include <vector>\\n\\nnamespace n91 {\\n\\nvoid main_() {\\n /*\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n //*/\\n const usize n = scan<usize>();\\n const i32 v = scan<i32>();\\n const i32 xl = scan<i32>();\\n const i32 xr = scan<i32>();\\n struct mogu_t {\\n i32 x;\\n i32 y;\\n u32 p;\\n bool f;\\n };\\n std::vector<mogu_t> ms(n);\\n std::map<i32, usize> mp;\\n for (auto &e : ms) {\\n e.f = false;\\n const i32 x = scan<i32>();\\n const i32 t = scan<i32>();\\n const u32 p = scan<u32>();\\n e.x = -t * v + x;\\n e.y = -t * v - x;\\n e.p = p;\\n mp[e.y];\\n }\\n ms.push_back({xl, -xl, 0, true});\\n ms.push_back({xr, -xr, 0, true});\\n mp[-xl];\\n mp[-xr];\\n {\\n usize c = 0;\\n for (auto &e : mp)\\n e.second = c++;\\n }\\n std::sort(ms.begin(), ms.end(), [](auto l, auto r) {\\n return std::tie(l.x, l.y) < std::tie(r.x, r.y);\\n });\\n using seg_t = segment_tree<max_monoid<u32>>;\\n const usize m = mp.size();\\n std::vector<seg_t> dp(m, seg_t(m));\\n usize ph = 0;\\n for (const auto &e : ms) {\\n if (e.f) {\\n ph += 1;\\n continue;\\n }\\n const usize k = mp[e.y];\\n if (ph <= 1)\\n dp[k].update(k, dp[k].fold(0, k + 1) + e.p);\\n for (const usize i : rep(0, m)) {\\n if (i == k)\\n continue;\\n const u32 v = dp[i].fold(0, k + 1) + e.p;\\n if (ph <= 1)\\n dp[i].update(k, v);\\n if (ph <= 0)\\n dp[k].update(i, v);\\n }\\n /*\\n std::cout << \\\"\\\\n\\\";\\n for (const auto i : rep(0, m)) {\\n for (const auto j : rep(0, m)) {\\n std::cout << dp[i].fold(j, j + 1) << \\\" \\\";\\n }\\n std::cout << \\\"\\\\n\\\";\\n }\\n */\\n }\\n u32 ans = 0;\\n for (const auto i : rep(0, mp[-xl] + 1)) {\\n chmax(ans, dp[i].fold(0, mp[-xr] + 1));\\n }\\n std::cout << ans << std::endl;\\n}\\n\\n} // namespace n91\\n\\nint main() {\\n n91::main_();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1580,\n \"memory_kb\": 144140,\n \"score_of_the_acc\": -0.6683,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2290_3546450\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <vector>\\n#include <queue>\\n#include <functional>\\n#include <climits>\\nstruct Mole {\\n\\tint position, time, score;\\n\\tMole(const int x, const int t, const int p) : position{ x }, time{ t }, score{ p }{};\\n\\tMole() :Mole(0, 0, 0) {};\\n};\\nstruct Edge {\\n\\tint to, pair, cost;\\n\\tbool flow;\\n\\tEdge(int t, int p, int c, bool f) : to{ t }, pair{ p }, cost{ c }, flow{ f }{};\\n\\tEdge() : Edge(0, 0, 0, false) {}\\n};\\nvoid setEdge(const int from, const int to, const int cost, std::vector<std::vector<Edge>>& nodes) {\\n\\tnodes[from].push_back(Edge(to, nodes[to].size(), cost, true));\\n\\tnodes[to].push_back(Edge(from, nodes[from].size() - 1, -cost, false));\\n}\\nint solve(const long velocity, const int left, const int right, const std::vector<Mole>& mole) {\\n\\tstd::vector<std::vector<Edge>> nodes(mole.size() * 2 + 4);\\n\\tconst int start_left = nodes.size() - 4;\\n\\tconst int start_right = nodes.size() - 3;\\n\\tconst int start = nodes.size() - 2;\\n\\tconst int goal = nodes.size() - 1;\\n\\tsetEdge(start, start_left, 0, nodes);\\n\\tsetEdge(start, start_right, 0, nodes);\\n\\tstd::vector<int> sum_cost(mole.size() + 1, 0);\\n\\tfor (auto i = 1; i < sum_cost.size(); ++i) sum_cost[i] = sum_cost[i - 1] + mole[i - 1].score;\\n\\tsetEdge(start_left, goal, sum_cost.back(), nodes);\\n\\tsetEdge(start_right, goal, sum_cost.back(), nodes);\\n\\tfor (auto i = 0; i < mole.size(); ++i) {\\n\\t\\tauto m = mole[i];\\n\\t\\tif (std::abs(left - m.position) <= m.time * velocity) {\\n\\t\\t\\tsetEdge(start_left, i * 2, sum_cost[i], nodes);\\n\\t\\t}\\n\\t\\tif (std::abs(right - m.position) <= m.time * velocity) {\\n\\t\\t\\tsetEdge(start_right, i * 2, sum_cost[i], nodes);\\n\\t\\t}\\n\\t\\tsetEdge(i * 2, i * 2 + 1, 0, nodes);\\n\\t\\tsetEdge(i * 2 + 1, goal, sum_cost.back() - sum_cost[i + 1], nodes);\\n\\t}\\n\\tfor (auto i = 0; i < mole.size(); ++i) {\\n\\t\\tfor (auto j = i + 1; j < mole.size(); ++j) {\\n\\t\\t\\tif (std::abs(mole[i].position - mole[j].position) <= (mole[j].time - mole[i].time) * velocity) {\\n\\t\\t\\t\\tsetEdge(i * 2 + 1, j * 2, sum_cost[j] - sum_cost[i + 1], nodes);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tstd::vector<int> potential(nodes.size(), 0);\\n\\tstd::vector<int> min_cost(nodes.size(), 0);\\n\\tstd::priority_queue<std::tuple<int, int>, std::vector<std::tuple<int, int>>, std::function<bool(const std::tuple<int, int>&, const std::tuple<int, int>&)>> empty_queue([](const std::tuple<int, int> & a, const std::tuple<int, int> & b) {return std::get<1>(a) > std::get<1>(b); });\\n\\tstd::vector<Edge> prev_edge(nodes.size());\\n\\tint result = 0;\\n\\tfor (auto repeat = 0; repeat < 2; ++repeat) {\\n\\t\\tfor (auto i = 0; i < min_cost.size(); ++i) min_cost[i] = INT_MAX;\\n\\t\\tauto queue = empty_queue;\\n\\t\\tmin_cost[start] = 0;\\n\\t\\tqueue.push(std::make_tuple(start, 0));\\n\\t\\twhile (std::get<0>(queue.top()) != goal) {\\n\\t\\t\\tauto current = std::get<0>(queue.top());\\n\\t\\t\\tauto cost = std::get<1>(queue.top());\\n\\t\\t\\tqueue.pop();\\n\\t\\t\\tif (min_cost[current] == cost) {\\n\\t\\t\\t\\tfor (const auto next : nodes[current]) if (next.flow) {\\n\\t\\t\\t\\t\\tif (min_cost[next.to] > cost + potential[current] - potential[next.to] + next.cost) {\\n\\t\\t\\t\\t\\t\\tmin_cost[next.to] = cost + potential[current] - potential[next.to] + next.cost;\\n\\t\\t\\t\\t\\t\\tprev_edge[next.to] = next;\\n\\t\\t\\t\\t\\t\\tqueue.push(std::make_tuple(next.to, min_cost[next.to]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tresult += sum_cost.back() - min_cost[goal];\\n\\t\\tauto last = goal;\\n\\t\\twhile (last != start) {\\n\\t\\t\\tauto edge = prev_edge[last];\\n\\t\\t\\tauto& rev = nodes[edge.to][edge.pair];\\n\\t\\t\\trev.flow = true;\\n\\t\\t\\tnodes[rev.to][rev.pair].flow = false;\\n\\t\\t\\tlast = rev.to;\\n\\t\\t}\\n\\t\\tfor (auto i = 0; i < start; ++i) potential[i] += min_cost[i];\\n\\t}\\n\\treturn result;\\n}\\nint main() {\\n\\tint n, v, left, right; std::cin >> n >> v >> left >> right;\\n\\tstd::vector<Mole> mole(n);\\n\\tfor (auto& m : mole) std::cin >> m.position >> m.time >> m.score;\\n\\tstd::sort(mole.begin(), mole.end(), [](const Mole a, const Mole b) {return a.time < b.time; });\\n\\tstd::cout << solve(v, left, right, mole) << std::endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1150,\n \"memory_kb\": 240728,\n \"score_of_the_acc\": -1.1061,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2290_3375794\",\n \"code_snippet\": \"// https://onlinejudge.u-aizu.ac.jp/challenges/search/categories/2290\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <limits>\\ntemplate <typename T>\\nconstexpr T INF() { return std::numeric_limits<T>::max() / 16; }\\n#include <vector>\\ntemplate <typename Cap, typename Cost, typename Ind = std::size_t>\\nstruct CostFlow\\n{\\n CostFlow(const Ind v) : V(v), edge(v) { edge.shrink_to_fit(); }\\n void addEdge(const Ind from, const Ind to, const Cap cap, const Cost cost) { edge[from].push_back(Edge{to, (Ind)edge[to].size(), cap, cost, false}), edge[to].push_back(Edge{from, (Ind)(edge[from].size() - 1), 0, -cost, true}); }\\n struct Edge\\n {\\n Ind to, rev;\\n Cap cap;\\n Cost cost;\\n const bool isrev;\\n };\\n const Ind V;\\n std::vector<std::vector<Edge>> edge;\\n};\\ntemplate <typename T, template <typename, typename, typename, typename> class PotFunc, typename Cap, typename Cost, typename Ind>\\nstd::pair<bool, T> PrimalDual(CostFlow<Cap, Cost, Ind>& cflow, const Ind s, const Ind t, Cap f)\\n{\\n const Ind V = cflow.V;\\n T ans = 0;\\n std::vector<T> potential = PotFunc<T, Cap, Cost, Ind>()(cflow, s);\\n std::vector<T> dist(V, INF<T>());\\n using P = std::pair<T, Ind>;\\n std::priority_queue<P, std::vector<P>, std::greater<P>> Q;\\n std::vector<Ind> prev_v(V), prev_e(V);\\n dist.shrink_to_fit(), prev_v.shrink_to_fit(), prev_e.shrink_to_fit();\\n while (f > 0) {\\n std::fill(dist.begin(), dist.end(), INF<T>());\\n dist[s] = 0, Q.push({0, s});\\n while (not Q.empty()) {\\n const T cost = Q.top().first;\\n const Ind v = Q.top().second;\\n Q.pop();\\n if (dist[v] < cost) { continue; }\\n for (Ind i = 0; i < (Ind)cflow.edge[v].size(); i++) {\\n const auto& e = cflow.edge[v][i];\\n const T pd = potential[v] - potential[e.to];\\n if (e.cap == 0 or dist[e.to] <= dist[v] + (T)e.cost + pd) { continue; }\\n dist[e.to] = dist[v] + (T)e.cost + pd, prev_v[e.to] = v, prev_e[e.to] = i;\\n Q.push({dist[e.to], e.to});\\n }\\n }\\n if (dist[t] == INF<T>()) { return {false, ans}; }\\n for (Ind v = 0; v < V; v++) { potential[v] += dist[v]; }\\n Cap d = f;\\n for (Ind v = t; v != s; v = prev_v[v]) {\\n const auto& e = cflow.edge[prev_v[v]][prev_e[v]];\\n d = std::min(d, e.cap);\\n }\\n f = (Cap)(f - d), ans += (T)d * potential[t];\\n for (Ind v = t; v != s; v = prev_v[v]) {\\n auto& e = cflow.edge[prev_v[v]][prev_e[v]];\\n e.cap = (Cap)(e.cap - d), cflow.edge[v][e.rev].cap = (Cap)(cflow.edge[v][e.rev].cap + d);\\n }\\n }\\n return {true, ans};\\n}\\n#include <algorithm>\\n#include <algorithm>\\n#include <vector>\\nstruct Graph\\n{\\n Graph(const std::size_t v) : V{v}, edge(v), rev_edge(v) {}\\n void addEdge(const std::size_t from, const std::size_t to) { edge[from].push_back(to), rev_edge[to].push_back(from); }\\n const std::size_t V;\\n std::vector<std::vector<std::size_t>> edge, rev_edge;\\n};\\nstd::pair<bool, std::vector<std::size_t>> TopSort(const Graph& g)\\n{\\n std::vector<std::size_t> srt, used(g.V, 0);\\n auto dfs = [&](auto&& self, const std::size_t s) -> bool {\\n if (used[s] == 1) {\\n return false;\\n } else if (used[s] == 0) {\\n used[s] = 1;\\n for (const std::size_t to : g.edge[s]) {\\n if (not self(self, to)) { return false; }\\n }\\n used[s] = 2, srt.push_back(s);\\n }\\n return true;\\n };\\n for (std::size_t i = 0; i < g.V; i++) {\\n if (not dfs(dfs, i)) { return {false, srt}; }\\n }\\n std::reverse(srt.begin(), srt.end());\\n return {true, srt};\\n}\\ntemplate <typename T, typename Cap, typename Cost, typename Ind>\\nstruct PotDAG\\n{\\n std::vector<T> operator()(const CostFlow<Cap, Cost, Ind>& cflow, const Ind s) const\\n {\\n const Ind V = cflow.V;\\n std::vector<Ind> ord;\\n std::vector<bool> used(V, 0);\\n auto dfs = [&](auto&& self, const Ind s) -> void {\\n if (not used[s]) {\\n used[s] = true;\\n for (const auto& e : cflow.edge[s]) {\\n if (e.cap == 0) { continue; }\\n self(self, e.to);\\n }\\n ord.push_back(s);\\n }\\n };\\n for (Ind i = 0; i < V; i++) { dfs(dfs, i); }\\n std::reverse(ord.begin(), ord.end());\\n std::vector<T> ans(V, INF<T>());\\n ans.shrink_to_fit();\\n for (Ind i = 0; i < V; i++) {\\n if (ord[i] == s) { ans[s] = (T)0; }\\n for (const auto& e : cflow.edge[ord[i]]) {\\n if (e.cap == 0) { continue; }\\n ans[e.to] = std::min(ans[e.to], ans[ord[i]] + (T)e.cost);\\n }\\n }\\n return ans;\\n }\\n};\\nstruct Point\\n{\\n int X, T, P;\\n bool operator<(const Point& p) const\\n {\\n return T < p.T;\\n }\\n};\\n\\nint main()\\n{\\n short N;\\n std::cin >> N;\\n std::size_t V, L, R;\\n std::cin >> V >> L >> R;\\n std::vector<Point> point(N);\\n point.shrink_to_fit();\\n for (short i = 0; i < N; i++) { std::cin >> point[i].X >> point[i].T >> point[i].P; }\\n std::sort(point.begin(), point.end());\\n CostFlow<char, int, short> cflow((short)(2 * N + 4));\\n const short s = 0, t = (short)(2 * N + 3), l = 1, r = 2;\\n cflow.addEdge(s, l, 1, 0), cflow.addEdge(s, r, 1, 0);\\n for (short i = 0; i < N; i++) {\\n cflow.addEdge((short)(2 * i + 3), (short)(2 * i + 4), 1, 0), cflow.addEdge((short)(2 * i + 4), t, 1, -point[i].P);\\n if (std::abs(point[i].X - (int)L) <= V * point[i].T) { cflow.addEdge(l, (short)(2 * i + 3), 1, 0); }\\n if (std::abs(point[i].X - (int)R) <= V * point[i].T) { cflow.addEdge(r, (short)(2 * i + 3), 1, 0); }\\n }\\n for (short i = 0; i < N; i++) {\\n for (short j = (short)(i + 1); j < N; j++) {\\n if (std::abs(point[i].X - point[j].X) <= V * (point[j].T - point[i].T)) { cflow.addEdge((short)(2 * i + 4), (short)(2 * j + 3), 1, -point[i].P); }\\n }\\n }\\n point.clear(), point.shrink_to_fit();\\n std::cout << -PrimalDual<int, PotDAG>(cflow, s, t, (char)2).second << std::endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1010,\n \"memory_kb\": 241836,\n \"score_of_the_acc\": -1.0882,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2290_3375076\",\n \"code_snippet\": \"// https://onlinejudge.u-aizu.ac.jp/challenges/search/categories/2290\\n// MLEです (頂点型をshortにして、容量型をcharにすると多分通ります)\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <limits>\\ntemplate <typename T>\\nconstexpr T INF() { return std::numeric_limits<T>::max() / 16; }\\n#include <vector>\\ntemplate <typename Cap, typename Cost, typename Ind = std::size_t>\\nstruct CostFlow\\n{\\n CostFlow(const Ind v) : V(v), edge(v) { edge.shrink_to_fit(); }\\n void addEdge(const Ind from, const Ind to, const Cap cap, const Cost cost) { edge[from].push_back(Edge{to, (Ind)edge[to].size(), cap, cost, false}), edge[to].push_back(Edge{from, (Ind)(edge[from].size() - 1), 0, -cost, true}); }\\n struct Edge\\n {\\n Ind to, rev;\\n Cap cap;\\n Cost cost;\\n const bool isrev;\\n };\\n const Ind V;\\n std::vector<std::vector<Edge>> edge;\\n};\\ntemplate <typename T, template <typename, typename, typename, typename> class PotFunc, typename Cap, typename Cost, typename Ind>\\nstd::pair<bool, T> PrimalDual(CostFlow<Cap, Cost, Ind>& cflow, const Ind s, const Ind t, Cap f)\\n{\\n const Ind V = cflow.V;\\n T ans = 0;\\n std::vector<T> potential = PotFunc<T, Cap, Cost, Ind>()(cflow, s);\\n std::vector<T> dist(V, INF<T>());\\n using P = std::pair<T, Ind>;\\n std::priority_queue<P, std::vector<P>, std::greater<P>> Q;\\n std::vector<Ind> prev_v(V), prev_e(V);\\n dist.shrink_to_fit(), prev_v.shrink_to_fit(), prev_e.shrink_to_fit();\\n while (f > 0) {\\n std::fill(dist.begin(), dist.end(), INF<T>());\\n dist[s] = 0, Q.push({0, s});\\n while (not Q.empty()) {\\n const T cost = Q.top().first;\\n const Ind v = Q.top().second;\\n Q.pop();\\n if (dist[v] < cost) { continue; }\\n for (Ind i = 0; i < cflow.edge[v].size(); i++) {\\n const auto& e = cflow.edge[v][i];\\n const T pd = potential[v] - potential[e.to];\\n if (e.cap == 0 or dist[e.to] <= dist[v] + e.cost + pd) { continue; }\\n dist[e.to] = dist[v] + e.cost + pd, prev_v[e.to] = v, prev_e[e.to] = i;\\n Q.push({dist[e.to], e.to});\\n }\\n }\\n if (dist[t] == INF<T>()) { return {false, ans}; }\\n for (Ind v = 0; v < V; v++) { potential[v] += dist[v]; }\\n Cap d = f;\\n for (Ind v = t; v != s; v = prev_v[v]) {\\n const auto& e = cflow.edge[prev_v[v]][prev_e[v]];\\n d = std::min(d, e.cap);\\n }\\n f -= d, ans += (T)d * potential[t];\\n for (Ind v = t; v != s; v = prev_v[v]) {\\n auto& e = cflow.edge[prev_v[v]][prev_e[v]];\\n e.cap -= d, cflow.edge[v][e.rev].cap += d;\\n }\\n }\\n return {true, ans};\\n}\\n#include <algorithm>\\n#include <algorithm>\\n#include <vector>\\nstruct Graph\\n{\\n Graph(const std::size_t v) : V{v}, edge(v), rev_edge(v) {}\\n void addEdge(const std::size_t from, const std::size_t to) { edge[from].push_back(to), rev_edge[to].push_back(from); }\\n const std::size_t V;\\n std::vector<std::vector<std::size_t>> edge, rev_edge;\\n};\\nstd::pair<bool, std::vector<std::size_t>> TopSort(const Graph& g)\\n{\\n std::vector<std::size_t> srt, used(g.V, 0);\\n auto dfs = [&](auto&& self, const std::size_t s) -> bool {\\n if (used[s] == 1) {\\n return false;\\n } else if (used[s] == 0) {\\n used[s] = 1;\\n for (const std::size_t to : g.edge[s]) {\\n if (not self(self, to)) { return false; }\\n }\\n used[s] = 2, srt.push_back(s);\\n }\\n return true;\\n };\\n for (std::size_t i = 0; i < g.V; i++) {\\n if (not dfs(dfs, i)) { return {false, srt}; }\\n }\\n std::reverse(srt.begin(), srt.end());\\n return {true, srt};\\n}\\ntemplate <typename T, typename Cap, typename Cost, typename Ind>\\nstruct PotDAG\\n{\\n std::vector<T> operator()(const CostFlow<Cap, Cost, Ind>& cflow, const Ind s) const\\n {\\n const Ind V = cflow.V;\\n std::vector<Ind> ord;\\n std::vector<bool> used(V, 0);\\n auto dfs = [&](auto&& self, const Ind s) -> void {\\n if (not used[s]) {\\n used[s] = true;\\n for (const auto& e : cflow.edge[s]) {\\n if (e.cap == 0) { continue; }\\n self(self, e.to);\\n }\\n ord.push_back(s);\\n }\\n };\\n for (Ind i = 0; i < V; i++) { dfs(dfs, i); }\\n std::reverse(ord.begin(), ord.end());\\n std::vector<T> ans(V, INF<T>());\\n ans.shrink_to_fit();\\n for (Ind i = 0; i < V; i++) {\\n if (ord[i] == s) { ans[s] = 0; }\\n for (const auto& e : cflow.edge[ord[i]]) {\\n if (e.cap == 0) { continue; }\\n ans[e.to] = std::min(ans[e.to], ans[ord[i]] + e.cost);\\n }\\n }\\n return ans;\\n }\\n};\\nstruct Point\\n{\\n int X, T, P;\\n bool operator<(const Point& p) const\\n {\\n return T < p.T;\\n }\\n};\\n\\nint main()\\n{\\n short N;\\n std::cin >> N;\\n std::size_t V, L, R;\\n std::cin >> V >> L >> R;\\n std::vector<Point> point(N);\\n point.shrink_to_fit();\\n for (short i = 0; i < N; i++) { std::cin >> point[i].X >> point[i].T >> point[i].P; }\\n std::sort(point.begin(), point.end());\\n CostFlow<char, int, short> cflow(2 * N + 4);\\n const short s = 0, t = 2 * N + 3, l = 1, r = 2;\\n cflow.addEdge(s, l, 1, 0), cflow.addEdge(s, r, 1, 0);\\n for (short i = 0; i < N; i++) {\\n cflow.addEdge(2 * i + 3, 2 * i + 4, 1, 0), cflow.addEdge(2 * i + 4, t, 1, -point[i].P);\\n if (std::abs(point[i].X - (int)L) <= V * point[i].T) { cflow.addEdge(l, 2 * i + 3, 1, 0); }\\n if (std::abs(point[i].X - (int)R) <= V * point[i].T) { cflow.addEdge(r, 2 * i + 3, 1, 0); }\\n }\\n for (short i = 0; i < N; i++) {\\n for (short j = i + 1; j < N; j++) {\\n if (std::abs(point[i].X - point[j].X) <= V * (point[j].T - point[i].T)) { cflow.addEdge(2 * i + 4, 2 * j + 3, 1, -point[i].P); }\\n }\\n }\\n point.clear(), point.shrink_to_fit();\\n std::cout << -PrimalDual<int, PotDAG>(cflow, s, t, (char)2).second << std::endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1010,\n \"memory_kb\": 241908,\n \"score_of_the_acc\": -1.0886,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2290_3375072\",\n \"code_snippet\": \"// https://onlinejudge.u-aizu.ac.jp/challenges/search/categories/2290\\n// MLEです (頂点型をshortにして、容量型をcharにすると多分通ります)\\n#include <iostream>\\n#include <algorithm>\\n#include <cmath>\\n#include <queue>\\n#include <limits>\\ntemplate <typename T>\\nconstexpr T INF() { return std::numeric_limits<T>::max() / 16; }\\n#include <vector>\\ntemplate <typename Cap, typename Cost, typename Ind = std::size_t>\\nstruct CostFlow\\n{\\n CostFlow(const Ind v) : V(v), edge(v) { edge.shrink_to_fit(); }\\n void addEdge(const Ind from, const Ind to, const Cap cap, const Cost cost) { edge[from].push_back(Edge{to, (Ind)edge[to].size(), cap, cost, false}), edge[to].push_back(Edge{from, (Ind)(edge[from].size() - 1), 0, -cost, true}); }\\n struct Edge\\n {\\n Ind to, rev;\\n Cap cap;\\n Cost cost;\\n const bool isrev;\\n };\\n const Ind V;\\n std::vector<std::vector<Edge>> edge;\\n};\\ntemplate <typename T, template <typename, typename, typename, typename> class PotFunc, typename Cap, typename Cost, typename Ind>\\nstd::pair<bool, T> PrimalDual(CostFlow<Cap, Cost, Ind>& cflow, const Ind s, const Ind t, Cap f)\\n{\\n const Ind V = cflow.V;\\n T ans = 0;\\n std::vector<T> potential = PotFunc<T, Cap, Cost, Ind>()(cflow, s);\\n std::vector<T> dist(V, INF<T>());\\n using P = std::pair<T, Ind>;\\n std::priority_queue<P, std::vector<P>, std::greater<P>> Q;\\n std::vector<Ind> prev_v(V), prev_e(V);\\n dist.shrink_to_fit(), prev_v.shrink_to_fit(), prev_e.shrink_to_fit();\\n while (f > 0) {\\n std::fill(dist.begin(), dist.end(), INF<T>());\\n dist[s] = 0, Q.push({0, s});\\n while (not Q.empty()) {\\n const T cost = Q.top().first;\\n const Ind v = Q.top().second;\\n Q.pop();\\n if (dist[v] < cost) { continue; }\\n for (Ind i = 0; i < cflow.edge[v].size(); i++) {\\n const auto& e = cflow.edge[v][i];\\n const T pd = potential[v] - potential[e.to];\\n if (e.cap == 0 or dist[e.to] <= dist[v] + e.cost + pd) { continue; }\\n dist[e.to] = dist[v] + e.cost + pd, prev_v[e.to] = v, prev_e[e.to] = i;\\n Q.push({dist[e.to], e.to});\\n }\\n }\\n if (dist[t] == INF<T>()) { return {false, ans}; }\\n for (Ind v = 0; v < V; v++) { potential[v] += dist[v]; }\\n Cap d = f;\\n for (Ind v = t; v != s; v = prev_v[v]) {\\n const auto& e = cflow.edge[prev_v[v]][prev_e[v]];\\n d = std::min(d, e.cap);\\n }\\n f -= d, ans += (T)d * potential[t];\\n for (Ind v = t; v != s; v = prev_v[v]) {\\n auto& e = cflow.edge[prev_v[v]][prev_e[v]];\\n e.cap -= d, cflow.edge[v][e.rev].cap += d;\\n }\\n }\\n return {true, ans};\\n}\\n#include <algorithm>\\n#include <vector>\\nstruct Graph\\n{\\n Graph(const std::size_t v) : V{v}, edge(v), rev_edge(v) {}\\n void addEdge(const std::size_t from, const std::size_t to) { edge[from].push_back(to), rev_edge[to].push_back(from); }\\n const std::size_t V;\\n std::vector<std::vector<std::size_t>> edge, rev_edge;\\n};\\nstd::pair<bool, std::vector<std::size_t>> TopSort(const Graph& g)\\n{\\n std::vector<std::size_t> srt, used(g.V, 0);\\n auto dfs = [&](auto&& self, const std::size_t s) -> bool {\\n if (used[s] == 1) {\\n return false;\\n } else if (used[s] == 0) {\\n used[s] = 1;\\n for (const std::size_t to : g.edge[s]) {\\n if (not self(self, to)) { return false; }\\n }\\n used[s] = 2, srt.push_back(s);\\n }\\n return true;\\n };\\n for (std::size_t i = 0; i < g.V; i++) {\\n if (not dfs(dfs, i)) { return {false, srt}; }\\n }\\n std::reverse(srt.begin(), srt.end());\\n return {true, srt};\\n}\\ntemplate <typename T, typename Cap, typename Cost, typename Ind>\\nstruct PotDAG\\n{\\n std::vector<T> operator()(const CostFlow<Cap, Cost, Ind>& cflow, const Ind s) const\\n {\\n const Ind V = cflow.V;\\n std::vector<Ind> ord(V);\\n for (Ind i = 0; i < V; i++) { ord[i] = i; }\\n std::vector<T> ans(V, INF<T>());\\n ans.shrink_to_fit();\\n for (Ind i = 0; i < V; i++) {\\n if (ord[i] == s) { ans[s] = 0; }\\n for (const auto& e : cflow.edge[ord[i]]) {\\n if (e.cap == 0) { continue; }\\n ans[e.to] = std::min(ans[e.to], ans[ord[i]] + e.cost);\\n }\\n }\\n return ans;\\n }\\n};\\nstruct Point\\n{\\n int X, T, P;\\n bool operator<(const Point& p) const\\n {\\n return T < p.T;\\n }\\n};\\n\\nint main()\\n{\\n short N;\\n std::cin >> N;\\n std::size_t V, L, R;\\n std::cin >> V >> L >> R;\\n std::vector<Point> point(N);\\n point.shrink_to_fit();\\n for (short i = 0; i < N; i++) { std::cin >> point[i].X >> point[i].T >> point[i].P; }\\n std::sort(point.begin(), point.end());\\n CostFlow<char, int, short> cflow(2 * N + 4);\\n const short s = 0, t = 2 * N + 3, l = 1, r = 2;\\n cflow.addEdge(s, l, 1, 0), cflow.addEdge(s, r, 1, 0);\\n for (short i = 0; i < N; i++) {\\n cflow.addEdge(2 * i + 3, 2 * i + 4, 1, 0), cflow.addEdge(2 * i + 4, t, 1, -point[i].P);\\n if (std::abs(point[i].X - (int)L) <= V * point[i].T) { cflow.addEdge(l, 2 * i + 3, 1, 0); }\\n if (std::abs(point[i].X - (int)R) <= V * point[i].T) { cflow.addEdge(r, 2 * i + 3, 1, 0); }\\n }\\n for (short i = 0; i < N; i++) {\\n for (short j = i + 1; j < N; j++) {\\n if (std::abs(point[i].X - point[j].X) <= V * (point[j].T - point[i].T)) { cflow.addEdge(2 * i + 4, 2 * j + 3, 1, -point[i].P); }\\n }\\n }\\n point.clear(), point.shrink_to_fit();\\n std::cout << -PrimalDual<int, PotDAG>(cflow, s, t, (char)2).second << std::endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1000,\n \"memory_kb\": 241684,\n \"score_of_the_acc\": -1.0857,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2290_3268397\",\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 HUGE_NUM 10000000000\\n#define NUM 6050\\n\\ntypedef pair<ll,ll> P;\\n\\nstruct Edge{\\n Edge(int arg_to,ll arg_capacity,ll arg_cost,int arg_rev_index){\\n to = arg_to;\\n capacity = arg_capacity;\\n cost = arg_cost;\\n rev_index = arg_rev_index;\\n }\\n\\n int to,rev_index;\\n ll capacity,cost;\\n};\\n\\nstruct Info{\\n void set(int arg_x,int arg_appear_time,ll arg_value){\\n x = arg_x;\\n appear_time = arg_appear_time;\\n value = arg_value;\\n }\\n bool operator<(const struct Info & arg) const{\\n return appear_time < arg.appear_time;\\n }\\n int x,appear_time;\\n ll value;\\n};\\n\\nint N,speed;\\nint V;\\nvector<Edge> G[NUM];\\nll h[NUM];\\nll dist[NUM];\\nint pre_node[NUM],pre_edge[NUM];\\nint index_IN[NUM],index_OUT[NUM];\\nint in_num[NUM];\\nbool visited[NUM];\\nInfo LEFT,RIGHT,info[NUM];\\n\\n\\nvoid add_edge(int from,int to,ll capacity,ll cost){\\n G[from].push_back(Edge(to,capacity,cost,G[to].size()));\\n G[to].push_back(Edge(from,0,-cost,G[from].size()-1));\\n}\\n\\n\\nll min_cost_flow(int source,int sink,ll flow){\\n ll ret = 0;\\n for(int i = 0; i < V; i++){\\n h[i] = HUGE_NUM;\\n in_num[i] = 0;\\n }\\n\\n h[source] = 0;\\n\\n for(int i = 0; i < V; i++){\\n for(ll k = 0; k < G[i].size(); k++){\\n if(G[i][k].capacity == 0)continue;\\n\\n in_num[G[i][k].to]++;\\n }\\n }\\n\\n queue<int> TOPO;\\n for(int i = 0; i < V; i++){\\n\\n if(in_num[i] == 0){\\n TOPO.push(i);\\n }\\n }\\n\\n int tmp_node;\\n\\n while(!TOPO.empty()){\\n tmp_node = TOPO.front();\\n TOPO.pop();\\n\\n for(int i = 0; i < G[tmp_node].size(); i++){\\n if(G[tmp_node][i].capacity <= 0)continue;\\n\\n h[G[tmp_node][i].to] = min(h[G[tmp_node][i].to],h[tmp_node]+G[tmp_node][i].cost);\\n\\n in_num[G[tmp_node][i].to]--;\\n if(in_num[G[tmp_node][i].to] == 0){\\n TOPO.push(G[tmp_node][i].to);\\n }\\n }\\n }\\n\\n while(flow > 0){\\n\\n for(int i = 0; i < V; i++)dist[i] = HUGE_NUM;\\n dist[source] = 0;\\n\\n for(int i = 0; i < V; i++)visited[i] = false;\\n\\n while(true){\\n\\n tmp_node = -1;\\n\\n for(ll i = 0; i < V; i++){\\n if(visited[i] == false && (tmp_node == -1 || dist[tmp_node] > dist[i])){\\n tmp_node = i;\\n }\\n }\\n\\n if(tmp_node == -1)break;\\n\\n visited[tmp_node] = true;\\n\\n for(int i = 0; i < G[tmp_node].size(); i++){\\n Edge &e = G[tmp_node][i];\\n if(e.capacity == 0 || dist[e.to] <= dist[tmp_node]+e.cost+h[tmp_node]-h[e.to])continue;\\n dist[e.to] = dist[tmp_node]+e.cost+h[tmp_node]-h[e.to];\\n pre_node[e.to] = tmp_node;\\n pre_edge[e.to] = i;\\n\\n }\\n }\\n\\n if(dist[sink] == HUGE_NUM){\\n return -1;\\n }\\n\\n for(int node_id = 0; node_id < V; node_id++)h[node_id] += dist[node_id];\\n\\n ll tmp_flow = flow;\\n\\n for(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\\n\\n tmp_flow = min(tmp_flow,G[pre_node[node_id]][pre_edge[node_id]].capacity);\\n }\\n flow -= tmp_flow;\\n ret += tmp_flow*h[sink];\\n\\n for(int node_id = sink; node_id != source; node_id = pre_node[node_id]){\\n Edge &e = G[pre_node[node_id]][pre_edge[node_id]];\\n e.capacity -= tmp_flow;\\n G[node_id][e.rev_index].capacity += tmp_flow;\\n }\\n }\\n return ret;\\n}\\n\\n\\nint main(){\\n\\n scanf(\\\"%d %d %d %d\\\",&N,&speed,&LEFT.x,&RIGHT.x);\\n\\n for(int i = 0; i < N; i++){\\n\\n scanf(\\\"%d %d %d\\\",&info[i].x,&info[i].appear_time,&info[i].value);\\n }\\n sort(info,info+N);\\n\\n int source = 0,sink = 1,first_left = 2,first_right = 3,index = 4;\\n\\n for(int i = 0; i < N; i++){\\n\\n index_IN[i] = index++;\\n }\\n for(int i = 0; i < N; i++){\\n\\n index_OUT[i] = index++;\\n add_edge(index_OUT[i],sink,1,0);\\n }\\n for(ll i = 0; i < N; i++){\\n\\n add_edge(index_IN[i],index_OUT[i],1,-info[i].value);\\n }\\n\\n add_edge(source,first_left,1,0);\\n add_edge(first_left,sink,1,0);\\n\\n for(int i = 0; i < N; i++){\\n\\n if(abs(info[i].x-LEFT.x) <= speed*info[i].appear_time){\\n\\n add_edge(first_left,index_IN[i],1,0);\\n }\\n }\\n\\n add_edge(source,first_right,1,0);\\n add_edge(first_right,sink,1,0);\\n\\n for(int i = 0; i < N; i++){\\n\\n if(abs(info[i].x-RIGHT.x) <= speed*info[i].appear_time){\\n\\n add_edge(first_right,index_IN[i],1,0);\\n }\\n }\\n\\n for(int i = 0; i < N-1; i++){\\n for(int k = i+1; k < N; k++){\\n if(abs(info[k].x-info[i].x) <= speed*(info[k].appear_time-info[i].appear_time)){\\n\\n add_edge(index_OUT[i],index_IN[k],1,0);\\n }\\n }\\n }\\n\\n add_edge(source,sink,2,0);\\n\\n V = index;\\n\\n ll ans = min_cost_flow(source,sink,2);\\n\\n printf(\\\"%lld\\\\n\\\",-ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 256348,\n \"score_of_the_acc\": -1.051,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1274,"cells":{"group_id":{"kind":"string","value":"aoj_2295_cpp"},"problem_description":{"kind":"string","value":"F: Power of Power\nICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．\n今日の修行は，非常に大きな数の計算を行って，計算力をつけて意識を高めようというものである．大きい数が簡単に出てくる演算として，累乗が挙げられる．\nN\n個の非負整数\nA\n1\n,\nA\n2\n, ...,\nA\nN\nがある．これらの並べ替え\nB\n1\n,\nB\n2\n, ...,\nB\nN\nであって，\nB\n1\nB\n2\n...\nB\nN\n- 1\nB\nN\nが最大になるものを求めたい．うさぎたちにとってはもちろん常識であるが，この計算は右上から順に行う．また，0\n0\n= 1 であると約束することにする．\n最大条件を満たす\nB\n1\n,\nB\n2\n, ...,\nB\nN\nは複数通りあるかもしれない．そのような場合は，そのうちで辞書順最小の列を選ぶことにしよう．\nInput\nN\nA\n1\n...\nA\nN\n1 ≤\nN\n≤ 100，0 ≤\nA\ni\n≤ 1,000,000,000 を満たす．\nOutput\n出力は\nN\n行からなる．\ni\n行目には\nB\ni\nを出力せよ．\nSample Input 1\n4\n7\n5\n10\n6\nSample Output 1\n5\n6\n7\n10\nSample Input 2\n3\n0\n0\n1000000000\nSample Output 2\n1000000000\n0\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2295_2389243","code_snippet":"#include <bits/stdc++.h>\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 ALL(x) begin(x),end(x)\n\nusing namespace std;\nusing ld = long double;\n\nvector<int> solve2(const vector<int>& v) {\n int n = v.size();\n int mi = 0, mj = 0;\n ld mx = -INFINITY;\n REP(i,n)REP(j,n) {\n if (i == j) continue;\n ld val;\n if (v[i] == 0 && v[j] == 0) {\n val = 0;\n } else {\n val = v[i] * log(v[j]);\n }\n if (val > mx) {\n mx = val;\n mi = i;\n mj = j;\n }\n }\n vector<int> res = {v[mj], v[mi]};\n return res;\n}\n\nvector<int> solve(const vector<int>& v) {\n int n = v.size();\n if (n <= 1) return v;\n if (n == 2) {\n return solve2(v);\n }\n int mi = 0, mj = 0, mk = 0;\n ld mx = -INFINITY;\n REP(i,n)REP(j,n)REP(k,n) {\n if (i == j) continue;\n if (i == k) continue;\n if (j == k) continue;\n ld val;\n if (v[j] == 0 && v[k] == 0) {\n val = 0;\n } else {\n val = v[j] * log(4.0 * v[k]);\n }\n if (v[i] == 0 && val == 0) {\n val = 0;\n } else {\n val = v[i] * log(val);\n }\n if (val > mx) {\n mx = val;\n mi = i;\n mj = j;\n mk = k;\n }\n }\n vector<int> er = {mi, mj, mk};\n sort(ALL(er), greater<int>());\n auto nv = v;\n REP(i,3) nv.erase(begin(nv)+er[i]);\n sort(ALL(nv));\n nv.push_back(v[mk]);\n nv.push_back(v[mj]);\n nv.push_back(v[mi]);\n return nv;\n}\n\nint main() {\n int n;\n cin>>n;\n vector<int> v;\n REP(i,n) {\n int m;\n cin>>m;\n v.emplace_back(m);\n }\n auto res = solve(v);\n for (int i:res) {\n cout << i << endl;\n }\n return 0;\n}","accuracy":0.041666666666666664,"time_ms":40,"memory_kb":3572,"score_of_the_acc":-0.7723,"final_rank":2},{"submission_id":"aoj_2295_2389240","code_snippet":"#include <bits/stdc++.h>\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 ALL(x) begin(x),end(x)\n\nusing namespace std;\nusing ld = long double;\n\nvector<int> solve2(const vector<int>& v) {\n int n = v.size();\n int mi = 0, mj = 0;\n ld mx = -INFINITY;\n REP(i,n)REP(j,n) {\n if (i == j) continue;\n ld val;\n if (v[i] == 0 && v[j] == 0) {\n val = 0;\n } else {\n val = v[i] * log(v[j]);\n }\n if (val > mx) {\n mx = val;\n mi = i;\n mj = j;\n }\n }\n vector<int> res = {mj, mi};\n return res;\n}\n\nvector<int> solve(const vector<int>& v) {\n int n = v.size();\n if (n <= 1) return v;\n if (n == 2) {\n return solve2(v);\n }\n int mi = 0, mj = 0, mk = 0;\n ld mx = -INFINITY;\n REP(i,n)REP(j,n)REP(k,n) {\n if (i == j) continue;\n if (i == k) continue;\n if (j == k) continue;\n ld val;\n if (v[j] == 0 && v[k] == 0) {\n val = 0;\n } else {\n val = v[j] * log(4.0 * v[k]);\n }\n if (v[i] == 0 && val == 0) {\n val = 0;\n } else {\n val = v[i] * log(val);\n }\n if (val > mx) {\n mx = val;\n mi = i;\n mj = j;\n mk = k;\n }\n }\n vector<int> er = {mi, mj, mk};\n sort(ALL(er), greater<int>());\n auto nv = v;\n REP(i,3) nv.erase(begin(nv)+er[i]);\n sort(ALL(nv));\n nv.push_back(v[mk]);\n nv.push_back(v[mj]);\n nv.push_back(v[mi]);\n return nv;\n}\n\nint main() {\n int n;\n cin>>n;\n vector<int> v;\n REP(i,n) {\n int m;\n cin>>m;\n v.emplace_back(m);\n }\n auto res = solve(v);\n for (int i:res) {\n cout << i << endl;\n }\n return 0;\n}","accuracy":0.025,"time_ms":40,"memory_kb":3528,"score_of_the_acc":-0.7548,"final_rank":3},{"submission_id":"aoj_2295_2389237","code_snippet":"#include <bits/stdc++.h>\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 ALL(x) begin(x),end(x)\n\nusing namespace std;\nusing ld = long double;\n\nvector<int> solve(const vector<int>& v) {\n int n = v.size();\n if (n <= 1) return v;\n int mi = 0, mj = 0, mk = 0;\n ld mx = -INFINITY;\n REP(i,n)REP(j,n)REP(k,n) {\n if (i == j) continue;\n if (i == k) continue;\n if (j == k) continue;\n ld val;\n if (v[j] == 0 && v[k] == 0) {\n val = 0;\n } else {\n val = v[j] * log(4.0 * v[k]);\n }\n if (v[i] == 0 && val == 0) {\n val = 0;\n } else {\n val = v[i] * log(val);\n }\n if (val > mx) {\n mx = val;\n mi = i;\n mj = j;\n mk = k;\n }\n }\n vector<int> er = {mi, mj, mk};\n sort(ALL(er), greater<int>());\n auto nv = v;\n REP(i,3) nv.erase(begin(nv)+er[i]);\n sort(ALL(nv));\n nv.push_back(v[mk]);\n nv.push_back(v[mj]);\n nv.push_back(v[mi]);\n return nv;\n}\n\nint main() {\n int n;\n cin>>n;\n vector<int> v;\n REP(i,n) {\n int m;\n cin>>m;\n v.emplace_back(m);\n }\n auto res = solve(v);\n for (int i:res) {\n cout << i << endl;\n }\n return 0;\n}","accuracy":0.025,"time_ms":50,"memory_kb":3516,"score_of_the_acc":-1,"final_rank":4},{"submission_id":"aoj_2295_2163234","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstring dp[101][101][2];//zero, one, 0or1\n\nint main(){\n for(int y=1;y<=100;y++) dp[0][y][1]=string(y,'1');\n for(int x=1;x<=100;x++){\n if(x%2){\n dp[x][0][0]=string(x,'0');\n }else{\n dp[x][0][1]=string(x,'0');\n }\n }\n for(int x=1;x<=100;x++){\n for(int y=1;y<=100;y++){\n if(dp[x-1][y][1]!=\"\"){\n dp[x][y][0]=\"0\"+dp[x-1][y][1];\n }else{\n dp[x][y][0]=\"\";\n }\n dp[x][y][1]=\"1\"+dp[x][y-1][0];\n if(dp[x-1][y][0]!=\"\") dp[x][y][1]=min(dp[x][y][1], \"0\"+dp[x-1][y][0]);\n if(dp[x][y-1][1]!=\"\") dp[x][y][1]=min(dp[x][y][1], \"1\"+dp[x][y-1][1]);\n }\n }\n\n int N;\n cin>>N;\n vector<int> V;\n int zero=0, one=0;\n for(int i=0;i<N;i++){\n int a;\n cin>>a;\n if(a==0){\n zero++;\n }else if(a==1){\n one++;\n }else{\n V.push_back(a);\n }\n }\n sort(V.begin(),V.end());\n string s;\n if(zero%2==1&&!one){\n if(V.size()>=2) swap(V.front(),V.back());\n if(V.size()>0){\n s='0'+V.back();\n V.pop_back();\n }\n }\n int n = V.size();\n if(n>=2&&V[n-2]==2&&V[n-1]==3) swap(V[n-2],V[n-1]);\n for(auto v:V){\n cout<<v<<endl;\n }\n if(zero%2&&!one){\n s+=dp[zero][one][0];\n }else{\n s+=dp[zero][one][1];\n }\n for(auto c:s)cout<<c<<endl;\n\n return 0;\n}","accuracy":0.4,"time_ms":10,"memory_kb":6032,"score_of_the_acc":-1,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2295_2389243\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\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 ALL(x) begin(x),end(x)\\n\\nusing namespace std;\\nusing ld = long double;\\n\\nvector<int> solve2(const vector<int>& v) {\\n int n = v.size();\\n int mi = 0, mj = 0;\\n ld mx = -INFINITY;\\n REP(i,n)REP(j,n) {\\n if (i == j) continue;\\n ld val;\\n if (v[i] == 0 && v[j] == 0) {\\n val = 0;\\n } else {\\n val = v[i] * log(v[j]);\\n }\\n if (val > mx) {\\n mx = val;\\n mi = i;\\n mj = j;\\n }\\n }\\n vector<int> res = {v[mj], v[mi]};\\n return res;\\n}\\n\\nvector<int> solve(const vector<int>& v) {\\n int n = v.size();\\n if (n <= 1) return v;\\n if (n == 2) {\\n return solve2(v);\\n }\\n int mi = 0, mj = 0, mk = 0;\\n ld mx = -INFINITY;\\n REP(i,n)REP(j,n)REP(k,n) {\\n if (i == j) continue;\\n if (i == k) continue;\\n if (j == k) continue;\\n ld val;\\n if (v[j] == 0 && v[k] == 0) {\\n val = 0;\\n } else {\\n val = v[j] * log(4.0 * v[k]);\\n }\\n if (v[i] == 0 && val == 0) {\\n val = 0;\\n } else {\\n val = v[i] * log(val);\\n }\\n if (val > mx) {\\n mx = val;\\n mi = i;\\n mj = j;\\n mk = k;\\n }\\n }\\n vector<int> er = {mi, mj, mk};\\n sort(ALL(er), greater<int>());\\n auto nv = v;\\n REP(i,3) nv.erase(begin(nv)+er[i]);\\n sort(ALL(nv));\\n nv.push_back(v[mk]);\\n nv.push_back(v[mj]);\\n nv.push_back(v[mi]);\\n return nv;\\n}\\n\\nint main() {\\n int n;\\n cin>>n;\\n vector<int> v;\\n REP(i,n) {\\n int m;\\n cin>>m;\\n v.emplace_back(m);\\n }\\n auto res = solve(v);\\n for (int i:res) {\\n cout << i << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.041666666666666664,\n \"time_ms\": 40,\n \"memory_kb\": 3572,\n \"score_of_the_acc\": -0.7723,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2295_2389240\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\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 ALL(x) begin(x),end(x)\\n\\nusing namespace std;\\nusing ld = long double;\\n\\nvector<int> solve2(const vector<int>& v) {\\n int n = v.size();\\n int mi = 0, mj = 0;\\n ld mx = -INFINITY;\\n REP(i,n)REP(j,n) {\\n if (i == j) continue;\\n ld val;\\n if (v[i] == 0 && v[j] == 0) {\\n val = 0;\\n } else {\\n val = v[i] * log(v[j]);\\n }\\n if (val > mx) {\\n mx = val;\\n mi = i;\\n mj = j;\\n }\\n }\\n vector<int> res = {mj, mi};\\n return res;\\n}\\n\\nvector<int> solve(const vector<int>& v) {\\n int n = v.size();\\n if (n <= 1) return v;\\n if (n == 2) {\\n return solve2(v);\\n }\\n int mi = 0, mj = 0, mk = 0;\\n ld mx = -INFINITY;\\n REP(i,n)REP(j,n)REP(k,n) {\\n if (i == j) continue;\\n if (i == k) continue;\\n if (j == k) continue;\\n ld val;\\n if (v[j] == 0 && v[k] == 0) {\\n val = 0;\\n } else {\\n val = v[j] * log(4.0 * v[k]);\\n }\\n if (v[i] == 0 && val == 0) {\\n val = 0;\\n } else {\\n val = v[i] * log(val);\\n }\\n if (val > mx) {\\n mx = val;\\n mi = i;\\n mj = j;\\n mk = k;\\n }\\n }\\n vector<int> er = {mi, mj, mk};\\n sort(ALL(er), greater<int>());\\n auto nv = v;\\n REP(i,3) nv.erase(begin(nv)+er[i]);\\n sort(ALL(nv));\\n nv.push_back(v[mk]);\\n nv.push_back(v[mj]);\\n nv.push_back(v[mi]);\\n return nv;\\n}\\n\\nint main() {\\n int n;\\n cin>>n;\\n vector<int> v;\\n REP(i,n) {\\n int m;\\n cin>>m;\\n v.emplace_back(m);\\n }\\n auto res = solve(v);\\n for (int i:res) {\\n cout << i << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.025,\n \"time_ms\": 40,\n \"memory_kb\": 3528,\n \"score_of_the_acc\": -0.7548,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2295_2389237\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\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 ALL(x) begin(x),end(x)\\n\\nusing namespace std;\\nusing ld = long double;\\n\\nvector<int> solve(const vector<int>& v) {\\n int n = v.size();\\n if (n <= 1) return v;\\n int mi = 0, mj = 0, mk = 0;\\n ld mx = -INFINITY;\\n REP(i,n)REP(j,n)REP(k,n) {\\n if (i == j) continue;\\n if (i == k) continue;\\n if (j == k) continue;\\n ld val;\\n if (v[j] == 0 && v[k] == 0) {\\n val = 0;\\n } else {\\n val = v[j] * log(4.0 * v[k]);\\n }\\n if (v[i] == 0 && val == 0) {\\n val = 0;\\n } else {\\n val = v[i] * log(val);\\n }\\n if (val > mx) {\\n mx = val;\\n mi = i;\\n mj = j;\\n mk = k;\\n }\\n }\\n vector<int> er = {mi, mj, mk};\\n sort(ALL(er), greater<int>());\\n auto nv = v;\\n REP(i,3) nv.erase(begin(nv)+er[i]);\\n sort(ALL(nv));\\n nv.push_back(v[mk]);\\n nv.push_back(v[mj]);\\n nv.push_back(v[mi]);\\n return nv;\\n}\\n\\nint main() {\\n int n;\\n cin>>n;\\n vector<int> v;\\n REP(i,n) {\\n int m;\\n cin>>m;\\n v.emplace_back(m);\\n }\\n auto res = solve(v);\\n for (int i:res) {\\n cout << i << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 0.025,\n \"time_ms\": 50,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -1,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2295_2163234\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nstring dp[101][101][2];//zero, one, 0or1\\n\\nint main(){\\n for(int y=1;y<=100;y++) dp[0][y][1]=string(y,'1');\\n for(int x=1;x<=100;x++){\\n if(x%2){\\n dp[x][0][0]=string(x,'0');\\n }else{\\n dp[x][0][1]=string(x,'0');\\n }\\n }\\n for(int x=1;x<=100;x++){\\n for(int y=1;y<=100;y++){\\n if(dp[x-1][y][1]!=\\\"\\\"){\\n dp[x][y][0]=\\\"0\\\"+dp[x-1][y][1];\\n }else{\\n dp[x][y][0]=\\\"\\\";\\n }\\n dp[x][y][1]=\\\"1\\\"+dp[x][y-1][0];\\n if(dp[x-1][y][0]!=\\\"\\\") dp[x][y][1]=min(dp[x][y][1], \\\"0\\\"+dp[x-1][y][0]);\\n if(dp[x][y-1][1]!=\\\"\\\") dp[x][y][1]=min(dp[x][y][1], \\\"1\\\"+dp[x][y-1][1]);\\n }\\n }\\n\\n int N;\\n cin>>N;\\n vector<int> V;\\n int zero=0, one=0;\\n for(int i=0;i<N;i++){\\n int a;\\n cin>>a;\\n if(a==0){\\n zero++;\\n }else if(a==1){\\n one++;\\n }else{\\n V.push_back(a);\\n }\\n }\\n sort(V.begin(),V.end());\\n string s;\\n if(zero%2==1&&!one){\\n if(V.size()>=2) swap(V.front(),V.back());\\n if(V.size()>0){\\n s='0'+V.back();\\n V.pop_back();\\n }\\n }\\n int n = V.size();\\n if(n>=2&&V[n-2]==2&&V[n-1]==3) swap(V[n-2],V[n-1]);\\n for(auto v:V){\\n cout<<v<<endl;\\n }\\n if(zero%2&&!one){\\n s+=dp[zero][one][0];\\n }else{\\n s+=dp[zero][one][1];\\n }\\n for(auto c:s)cout<<c<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.4,\n \"time_ms\": 10,\n \"memory_kb\": 6032,\n \"score_of_the_acc\": -1,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1275,"cells":{"group_id":{"kind":"string","value":"aoj_2292_cpp"},"problem_description":{"kind":"string","value":"C: Common Palindromes\nICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．\n今日の修行は，文字列中にある回文を探すことによって，文章から隠れたメッセージを読解する能力を高めようというものである．回文はたくさんあるかもしれないので，探すついでに個数も数えてしまいたい．\n2 つの文字列\nS\n,\nT\nが与えられるので，以下を満たす整数の組 (\ni\n,\nj\n,\nk\n,\nl\n) の個数を求めたい．\n1 ≤\ni\n≤\nj\n≤ (\nS\nの長さ)．\n1 ≤\nk\n≤\nl\n≤ (\nT\nの長さ)．\nS\nの\ni\n文字目から\nj\n文字目までを取り出した部分文字列は，\nT\nの\nk\n文字目から\nl\n文字目までを取り出した部分文字列と同一であり，さらにこれらは回文 (左から読んでも右から読んでも同じになる文字列) となっている．\nInput\nS\nT\n文字列\nS\n,\nT\nはともに長さが 1 以上 50,000 以下であり，アルファベット大文字からなる．\nOutput\n条件を満たす整数の組 (\ni\n,\nj\n,\nk\n,\nl\n) の個数を 1 行に出力せよ．\nSample Input 1\nICPC\nCPCPC\nSample Output 1\n10\nSample Input 2\nBABBAB\nABBA\nSample Output 2\n14\nSample Input 3\nMYON\nUSAGI\nSample Output 3\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2292_9777583","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst long long MOD = 10000000000000099;\nconst long long BASE = 1333;\nconst int MAXN = 5 * 100000;\n\nlong long POWER[MAXN + 1];\n\nlong long mul(long long a, long long b) {\n return ((__int128_t)a * b) % MOD;\n}\n\nclass RollingHash {\npublic:\n RollingHash(const string& s) : size(s.size()), str(s) {\n hashed.resize(size + 1);\n for (int i = 0; i < size; ++i) {\n hashed[i + 1] = mul(hashed[i], BASE) + (s[i]);\n hashed[i + 1] %= MOD;\n }\n }\n\n long long query(int l, int r) {\n assert(0 <= l && l <= r && r <= size);\n return (hashed[r] - mul(hashed[l], POWER[r - l]) + MOD) % MOD;\n }\n\nprivate:\n string str;\n vector<long long> hashed;\n int size;\n};\n\nclass Eertree {\npublic:\n Eertree(const string& s) : str(s), size(s.size()), r1(s), r2(string(s.rbegin(), s.rend())) {}\n\n void build() {\n const int BEGIN = 'A'; // or 'a'\n const int PALINDROME_SIZE = 2 * size;\n vector<vector<int>> G(PALINDROME_SIZE);\n H.resize(PALINDROME_SIZE);\n W.resize(PALINDROME_SIZE, 0);\n vector<unordered_map<long long, int>> ptr(27);\n \n ptr[26][0] = 0;\n H[0] = {26, 0};\n int free = 1;\n\n for (int i = 0; i < size; ++i) {\n int ID = str[i] - BEGIN;\n int ok = -1, ng = min(i, size - i - 1) + 1;\n\n while (ng - ok > 1) {\n int x = (ng + ok) >> 1;\n long long h1 = r1.query(i + 1, i + 1 + x);\n long long h2 = r2.query(size - i, size - i + x);\n if (ptr[ID].count(h1) && ptr[ID][h1] >= 0 && h1 == h2) ok = x;\n else ng = x;\n }\n\n if (ok == -1) {\n ptr[ID][0] = free;\n H[free] = {ID, 0};\n free++;\n ok = 0;\n }\n\n int par = ptr[ID][r1.query(i + 1, i + 1 + ok)];\n for (int j = ok + 1; j < min(i + 1, size - i); ++j) {\n if (str[i + j] == str[i - j]) {\n long long h1 = r1.query(i + 1, i + j + 1);\n ptr[ID][h1] = free;\n G[par].push_back(free);\n H[free] = {ID, h1};\n par = free;\n free++;\n } else {\n break;\n }\n }\n W[par] += 1;\n\n // Centroid = ''\n ok = 0;\n ng = min(i, size - i - 1) + 1;\n ID = 26;\n\n while (ng - ok > 1) {\n int x = (ng + ok) >> 1;\n long long h1 = r1.query(i, i + x);\n long long h2 = r2.query(size - i, size - i + x);\n if (ptr[ID].count(h1) && ptr[ID][h1] >= 0 && h1 == h2) ok = x;\n else ng = x;\n }\n\n par = ptr[ID][r1.query(i, i + ok)];\n for (int j = ok + 1; j < min(i + 1, size - i + 1); ++j) {\n if (str[i + j - 1] == str[i - j]) {\n long long h1 = r1.query(i, i + j);\n ptr[ID][h1] = free;\n G[par].push_back(free);\n H[free] = {ID, h1};\n par = free;\n free++;\n } else {\n break;\n }\n }\n W[par] += 1;\n }\n\n function<long long(int)> dfs = [&](int v) {\n for (int nxt : G[v]) {\n W[v] += dfs(nxt);\n }\n return W[v];\n };\n\n for (int ID = 0; ID < 27; ++ID) {\n if (ptr[ID].count(0) && ptr[ID][0] >= 0) dfs(ptr[ID][0]);\n }\n W[0] = 0;\n }\n\n vector<long long> getW() const { return W; }\n vector<pair<int, long long>> getH() const { return H; }\n\nprivate:\n string str;\n int size;\n RollingHash r1, r2;\n vector<long long> W;\n vector<pair<int, long long>> H;\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n for (int i = 0; i <= MAXN; ++i) {\n POWER[i] = (i == 0) ? 1 : mul(POWER[i - 1], BASE);\n }\n\n string s, t;\n cin >> s >> t;\n\n Eertree palS(s);\n Eertree palT(t);\n palS.build();\n palT.build();\n\n vector<long long> SW = palS.getW();\n vector<long long> TW = palT.getW();\n vector<pair<int, long long>> SH = palS.getH();\n vector<pair<int, long long>> TH = palT.getH();\n\n unordered_map<long long, array<long long, 2>> pair;\n \n for (size_t i = 0; i < SW.size(); ++i) {\n pair[SH[i].first*MOD+SH[i].second][0] += SW[i];\n }\n for (size_t i = 0; i < TW.size(); ++i) {\n pair[TH[i].first*MOD+TH[i].second][1] += TW[i];\n }\n\n long long ans = 0;\n for (const auto& p : pair) {\n ans += p.second[0] * p.second[1];\n }\n\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":290,"memory_kb":25348,"score_of_the_acc":-1.4784,"final_rank":16},{"submission_id":"aoj_2292_9777531","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst long long MOD = (1LL << 61) - 1;\nconst long long BASE = 1333;\nconst int MAXN = 5 * 100000;\n\nlong long POWER[MAXN + 1];\n\nlong long mul(long long a, long long b) {\n return ((__int128_t)a * b) % MOD;\n}\n\nclass RollingHash {\npublic:\n RollingHash(const string& s) : size(s.size()), str(s) {\n hashed.resize(size + 1);\n for (int i = 0; i < size; ++i) {\n hashed[i + 1] = mul(hashed[i], BASE) + (s[i]);\n hashed[i + 1] %= MOD;\n }\n }\n\n long long query(int l, int r) {\n assert(0 <= l && l <= r && r <= size);\n return (hashed[r] - mul(hashed[l], POWER[r - l]) + MOD) % MOD;\n }\n\nprivate:\n string str;\n vector<long long> hashed;\n int size;\n};\n\nclass Eertree {\npublic:\n Eertree(const string& s) : str(s), size(s.size()), r1(s), r2(string(s.rbegin(), s.rend())) {}\n\n void build() {\n const int BEGIN = 'A'; // or 'a'\n const int PALINDROME_SIZE = 2 * size;\n vector<vector<int>> G(PALINDROME_SIZE);\n H.resize(PALINDROME_SIZE);\n W.resize(PALINDROME_SIZE, 0);\n vector<unordered_map<long long, int>> ptr(27);\n \n ptr[26][0] = 0;\n H[0] = {26, 0};\n int free = 1;\n\n for (int i = 0; i < size; ++i) {\n int ID = str[i] - BEGIN;\n int ok = -1, ng = min(i, size - i - 1) + 1;\n\n while (ng - ok > 1) {\n int x = (ng + ok) >> 1;\n long long h1 = r1.query(i + 1, i + 1 + x);\n long long h2 = r2.query(size - i, size - i + x);\n if (ptr[ID].count(h1) && ptr[ID][h1] >= 0 && h1 == h2) ok = x;\n else ng = x;\n }\n\n if (ok == -1) {\n ptr[ID][0] = free;\n H[free] = {ID, 0};\n free++;\n ok = 0;\n }\n\n int par = ptr[ID][r1.query(i + 1, i + 1 + ok)];\n for (int j = ok + 1; j < min(i + 1, size - i); ++j) {\n if (str[i + j] == str[i - j]) {\n long long h1 = r1.query(i + 1, i + j + 1);\n ptr[ID][h1] = free;\n G[par].push_back(free);\n H[free] = {ID, h1};\n par = free;\n free++;\n } else {\n break;\n }\n }\n W[par] += 1;\n\n // Centroid = ''\n ok = 0;\n ng = min(i, size - i - 1) + 1;\n ID = 26;\n\n while (ng - ok > 1) {\n int x = (ng + ok) >> 1;\n long long h1 = r1.query(i, i + x);\n long long h2 = r2.query(size - i, size - i + x);\n if (ptr[ID].count(h1) && ptr[ID][h1] >= 0 && h1 == h2) ok = x;\n else ng = x;\n }\n\n par = ptr[ID][r1.query(i, i + ok)];\n for (int j = ok + 1; j < min(i + 1, size - i + 1); ++j) {\n if (str[i + j - 1] == str[i - j]) {\n long long h1 = r1.query(i, i + j);\n ptr[ID][h1] = free;\n G[par].push_back(free);\n H[free] = {ID, h1};\n par = free;\n free++;\n } else {\n break;\n }\n }\n W[par] += 1;\n }\n\n function<long long(int)> dfs = [&](int v) {\n for (int nxt : G[v]) {\n W[v] += dfs(nxt);\n }\n return W[v];\n };\n\n for (int ID = 0; ID < 27; ++ID) {\n if (ptr[ID].count(0) && ptr[ID][0] >= 0) dfs(ptr[ID][0]);\n }\n W[0] = 0;\n }\n\n vector<long long> getW() const { return W; }\n vector<pair<int, long long>> getH() const { return H; }\n\nprivate:\n string str;\n int size;\n RollingHash r1, r2;\n vector<long long> W;\n vector<pair<int, long long>> H;\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n for (int i = 0; i <= MAXN; ++i) {\n POWER[i] = (i == 0) ? 1 : mul(POWER[i - 1], BASE);\n }\n\n string s, t;\n cin >> s >> t;\n\n Eertree palS(s);\n Eertree palT(t);\n palS.build();\n palT.build();\n\n vector<long long> SW = palS.getW();\n vector<long long> TW = palT.getW();\n vector<pair<int, long long>> SH = palS.getH();\n vector<pair<int, long long>> TH = palT.getH();\n\n unordered_map<long long, array<long long, 2>> pair;\n \n for (size_t i = 0; i < SW.size(); ++i) {\n pair[SH[i].first*MOD+SH[i].second][0] += SW[i];\n }\n for (size_t i = 0; i < TW.size(); ++i) {\n pair[TH[i].first*MOD+TH[i].second][1] += TW[i];\n }\n\n long long ans = 0;\n for (const auto& p : pair) {\n ans += p.second[0] * p.second[1];\n }\n\n cout << ans << '\\n';\n return 0;\n}","accuracy":0.11666666666666667,"time_ms":300,"memory_kb":22600,"score_of_the_acc":-1.4275,"final_rank":18},{"submission_id":"aoj_2292_9753483","code_snippet":"#include <algorithm>\n#include <limits>\n#include <map>\n#include <numeric>\n#include <ranges>\n#include <type_traits>\n#include <vector>\nnamespace nono {\ntemplate <class T = char>\nclass Eertree {\n struct Node {\n Node(int len, int parent = 0, int link = 0): len(len), parent(parent), link(link) {}\n int len;\n int parent;\n int link;\n std::map<T, int> to;\n };\n public:\n Eertree(): pos_(0) {\n nodes_.emplace_back(Node(-1));\n nodes_.emplace_back(Node(0));\n seq_.push_back(std::numeric_limits<T>::max());\n }\n int size() { return nodes_.size() - 2; }\n void add(T c) {\n const int i = seq_.size();\n seq_.push_back(c);\n pos_ = go(pos_, i);\n if (!nodes_[pos_].to.contains(c)) {\n nodes_[pos_].to[c] = nodes_.size();\n int link = pos_ == 0 ? 1 : nodes_[go(nodes_[pos_].link, i)].to[c];\n nodes_.emplace_back(nodes_[pos_].len + 2, pos_, link);\n }\n pos_ = nodes_[pos_].to[c];\n node_id_.push_back(pos_);\n }\n template <std::ranges::random_access_range R>\n void add(const R& seq) {\n static_assert(std::is_same_v<typename R::value_type, T>);\n for (auto c: seq) add(c);\n }\n std::vector<int> node_id() { return node_id_; }\n std::vector<Node> nodes() { return nodes_; }\n std::vector<int> freq() {\n std::vector<int> ids(nodes_.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(),\n [&](int lhs, int rhs) { return nodes_[lhs].len > nodes_[rhs].len; });\n std::vector<int> result(nodes_.size());\n for (auto id: node_id_) result[id]++;\n for (auto id: ids) { result[nodes_[id].link] += result[id]; }\n return result;\n }\n private:\n bool fail(int pos, int i) { return seq_[i] != seq_[i - nodes_[pos].len - 1]; }\n int go(int pos, int i) {\n while (fail(pos, i)) pos = nodes_[pos].link;\n return pos;\n }\n int pos_;\n std::vector<T> seq_;\n std::vector<int> node_id_;\n std::vector<Node> nodes_;\n};\n} // namespace nono\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\ntemplate <class T>\nusing max_heap = priority_queue<T>;\ntemplate <class T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, l, r) for (ll i = (l); i < (r); i++)\n#define rrep(i, r, l) for (ll i = (r); i-- > (l);)\n#define all(x) begin(x), end(x)\ntemplate <class T>\nbool chmin(T& lhs, T rhs) {\n return lhs > rhs ? (lhs = rhs, true) : false;\n}\ntemplate <class T>\nbool chmax(T& lhs, T rhs) {\n return lhs < rhs ? (lhs = rhs, true) : false;\n}\nstruct IOIO {\n IOIO() { cin.tie(0)->sync_with_stdio(0); }\n} ioio;\ntemplate <class S, class T>\nostream& operator<<(ostream& os, const pair<S, T>& p) {\n os << '(' << p.first << \", \" << p.second << ')';\n return os;\n}\ntemplate <class T>\nostream& operator<<(ostream& os, const vector<T>& vs) {\n os << '{';\n rep(i, 0, (int)vs.size()) os << vs[i] << (i + 1 == (int)vs.size() ? \"\" : \", \");\n os << '}';\n return os;\n}\ntemplate <class T>\nostream& operator<<(ostream& os, const set<T>& vs) {\n os << '{';\n for (auto it = vs.begin(); it != vs.end(); it++) {\n if (it != vs.begin()) { os << \", \"; }\n os << *it;\n }\n os << '}';\n return os;\n}\ntemplate <class T, class U>\nostream& operator<<(ostream& os, const map<T, U>& vs) {\n os << '{';\n for (auto it = vs.begin(); it != vs.end(); it++) {\n if (it != vs.begin()) { os << \", \"; }\n os << *it;\n }\n os << '}';\n return os;\n}\n#ifdef DEBUG\nvoid dump_func() { cerr << endl; }\ntemplate <class Head, class... Tail>\nvoid dump_func(Head&& head, Tail&&... tail) {\n cerr << head;\n if (sizeof...(Tail) > 0) { cerr << \", \"; }\n dump_func(std::move(tail)...);\n}\n#define dump(...) cerr << \"[\" + string(#__VA_ARGS__) + \"] \", dump_func(__VA_ARGS__)\n#else\n#define dump(...) static_cast<int>(0)\n#endif\nint main() {\n string s, t;\n cin >> s >> t;\n nono::Eertree Stree, Ttree;\n Stree.add(s);\n Ttree.add(t);\n auto Sfreq = Stree.freq();\n auto Tfreq = Ttree.freq();\n auto Snodes = Stree.nodes();\n auto Tnodes = Ttree.nodes();\n ll ans = 0;\n auto dfs = [&](auto&& self, int si, int ti) -> void {\n if (Snodes[si].len > 0) { ans += (ll)Sfreq[si] * Tfreq[ti]; }\n for (auto [c, to]: Snodes[si].to) {\n if (Tnodes[ti].to.contains(c)) { self(self, to, Tnodes[ti].to[c]); }\n }\n };\n dfs(dfs, 0, 0);\n dfs(dfs, 1, 1);\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":10,"memory_kb":28336,"score_of_the_acc":-0.6057,"final_rank":9},{"submission_id":"aoj_2292_8990340","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\ntemplate < class char_type > struct eertree {\n using size_type = int;\n struct node_type {\n map<char_type, size_type> nxt;\n size_type link, len, count;\n\n node_type(size_type link, size_type len, size_type count) : link(link), len(len), count(count) {}\n };\n\n size_type lsp;\n vector<char_type> s;\n vector<node_type> g;\n\n eertree() : lsp(0) {\n g.emplace_back(0, -1, 0); // odd\n g.emplace_back(0, 0, 0); // even\n }\n\n // return node(c + str(?) + c)\n size_type find(size_type v) const {\n const size_type n = s.size() - 1;\n while(true) {\n const size_type i = n - g[v].len - 1;\n if(0 <= i and s[i] == s[n]) return v;\n v = g[v].link;\n }\n }\n\n void push_back(const char_type c) {\n s.push_back(c);\n const size_type v = find(lsp);\n\n if(g[v].nxt.count(c)) {\n lsp = g[v].nxt[c];\n g[lsp].count++;\n } else {\n lsp = g[v].nxt[c] = g.size();\n g.emplace_back(v == 0 ? 1 : g[find(g[v].link)].nxt[c], 1 + g[v].len + 1, 1);\n }\n }\n\n vector<size_type> freq() const {\n vector<size_type> freq(g.size(), 0);\n for(size_type i = size_type(g.size()) - 1; i > 0; i--) {\n freq[i] += g[i].count;\n freq[g[i].link] += freq[i];\n }\n return freq;\n }\n\n string str(size_type v) const {\n if(v == 0) return \"odd(-1)\";\n if(v == 1) return \"even(0)\";\n string res = \"\";\n function<bool(size_type)> dfs = [&](size_type x) -> bool {\n if(x == v) return true;\n for(auto [c, nx] : g[x].nxt) {\n if(dfs(nx)) {\n res.push_back(c);\n return true;\n }\n }\n return false;\n }; dfs(0); dfs(1);\n string rr = res; reverse(rr.begin(), rr.end());\n if(g[v].len % 2 == 1) rr.pop_back();\n return res + rr;\n }\n};\n\nint main() {\n string S = in(), T = in();\n\n auto f = [&](const string& x) {\n eertree<char> tree;\n for(char c : x) tree.push_back(c);\n vector<int> freq = tree.freq();\n const int n = freq.size();\n i64 ans = 0;\n for(int i : rep(2, n))\n ans += i64(freq[i]) * (freq[i] - 1) / 2;\n return ans;\n };\n\n print(f(S + \"!?\" + T) - f(S) - f(T));\n}","accuracy":1,"time_ms":10,"memory_kb":16656,"score_of_the_acc":-0.2427,"final_rank":2},{"submission_id":"aoj_2292_8762299","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 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\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);\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nconst vi DY = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;\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 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 >= 0; 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 smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\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 pow(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 get(T set, int i) { return (set >> i) & T(1); }\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 = 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>;\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) : -1; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\n#define dump(...)\n#define dumpel(v)\n#define dump_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)) while (1) cout << \"OLE\"; }\n#endif\n\n\n//【ローリングハッシュ（列）】\n/*\n* Rolling_hash<STR>(STR s, bool reversible = false) : O(n)\n*\t列 s[0..n) で初期化する．reversible = true にすると逆順のハッシュも計算可能になる．\n*\t制約：STR は string，vector<T> など．ll 範囲の負数は扱えない．\n*\n* ull get(int l, int r) : O(1)\n*\t部分文字列 s[l..r) のハッシュ値を返す（空なら 0）\n*\n* ull get_rev(int l, int r) : O(1)\n*\t部分文字列 s[l..r) を反転した文字列のハッシュ値を返す（空なら 0）\n*\n* ull join(ull hs, ull ht, int len) : O(1)\n*\tハッシュ値 hs をもつ s とハッシュ値 ht をもつ t[0..len) を連結した s+t のハッシュ値を返す．\n*/\ntemplate <class STR>\nclass Rolling_hash {\n\t// 参考 : https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\n\n\t//【方法】\n\t// 2^61 - 1 は十分大きい素数であるからローリングハッシュの法として適切である．\n\t// a, b < 2^61 - 1 とし，積 a b mod (2^61 - 1) を高速に計算できればよい．\n\t// \n\t// まず a, b を上位と下位に分解し\n\t//\t\ta = 2^31 ah + al, b = 2^31 bh + bl (ah, bh < 2^30, al, bl < 2^31)\n\t// とする．これらの積をとると，\n\t//\t\ta b\n\t//\t\t= (2^31 ah + al)(2^31 bh + bl)\n\t//\t\t= 2^62 ah bh + 2^31 (ah bl + bh al) + al bl\n\t// となる．2^61 ≡ 1 (mod 2^61 - 1) に注意してそれぞれの項を mod 2^61 - 1 で整理する．\n\t//\n\t// 第 1 項については，\n\t//\t\t2^62 ah bh\n\t//\t\t= 2 ah bh\n\t//\t\t≦ 2 (2^30-1) (2^30-1)\n\t// となる．\n\t//\n\t// 第 2 項については，c := ah bl + bh al < 2^62 を上位と下位に分解し\n\t//\t\tc = 2^30 ch + cl (ch < 2^32, cl < 2^30)\n\t// とすると，\n\t//\t\t2^31 c\n\t//\t\t= 2^31 (2^30 ch + cl)\n\t//\t\t= ch + 2^31 cl\n\t//\t\t≦ (2^32-1) + 2^31 (2^30-1)\n\t// となる．\n\t//\n\t// 第 3 項については，\n\t//\t\tal bl\n\t//\t\t≦ (2^31-1) (2^31-1)\n\t// となる．\n\t// \n\t// これらの和は\n\t//\t\t2 ah bh + ch + 2^31 cl + al bl\n\t//\t\t≦ 2 (2^30-1) (2^30-1) + (2^32-1) + 2^31 (2^30-1) + (2^31-1) (2^31-1)\n\t//\t\t= 9223372030412324866 < 9223372036854775808 = 2^63 << 2^64\n\t// となるのでオーバーフローの心配はない．\n\n\tstatic constexpr ull MASK30 = (1ULL << 30) - 1;\n\tstatic constexpr ull MASK31 = (1ULL << 31) - 1;\n\tstatic constexpr ull MOD = (1ULL << 61) - 1; // 法（素数）\n\n\t// a mod (2^61 - 1) を返す．\n\tinline ull get_mod(ull a) const {\n\t\tull ah = a >> 61, al = a & MOD;\n\t\tull res = ah + al;\n\t\tif (res >= MOD) res -= MOD;\n\t\treturn res;\n\t}\n\n\t// x ≡ a b mod (2^61 - 1) なる x < 2^63 を返す（ただし a, b < 2^61）\n\tinline ull mul(ull a, ull b) const {\n\t\tull ah = a >> 31, al = a & MASK31;\n\t\tull bh = b >> 31, bl = b & MASK31;\n\n\t\tull c = ah * bl + bh * al;\n\t\tull ch = c >> 30, cl = c & MASK30;\n\n\t\tull term1 = 2 * ah * bh;\n\t\tull term2 = ch + (cl << 31);\n\t\tull term3 = al * bl;\n\n\t\treturn term1 + term2 + term3; // < 2^63\n\t}\n\n\tstatic constexpr ull BASE = 1234567891011; // 適当な基数\n\tstatic constexpr ull SHIFT = 4295090752; // 適当なシフト\n\n\t// 列の長さ\n\tint n;\n\n\t// powB[i] : BASE^i\n\tvector<ull> powB;\n\n\t// v[i] : s[0..i) のハッシュ値 Σj∈[0..i) (s[j]+SHIFT) BASE^(i-1-j)\n\t// v_rev[i] : s[n-i..n) を反転した文字列のハッシュ値\n\tvector<ull> v, v_rev;\n\npublic:\n\t// 列 s[0..n) で初期化する．\n\tRolling_hash(const STR& s, bool reversible = false) : n(sz(s)), powB(n + 1), v(n + 1) {\n\t\t// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ec\n\n\t\tpowB[0] = 1;\n\t\trep(i, n) powB[i + 1] = get_mod(mul(powB[i], BASE));\n\n\t\trep(i, n) v[i + 1] = get_mod(mul(v[i], BASE) + (ull)s[i] + SHIFT);\n\n\t\tif (reversible) {\n\t\t\tv_rev.resize(n + 1);\n\t\t\trep(i, n) v_rev[i + 1] = get_mod(mul(v_rev[i], BASE) + (ull)s[n - 1 - i] + SHIFT);\n\t\t}\n\t}\n\tRolling_hash() : n(0) {}\n\n\t// s[l..r) のハッシュ値の取得\n\tull get(int l, int r) const {\n\t\t// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ec\n\n\t\tchmax(l, 0); chmin(r, n);\n\t\tif (l >= r) return 0;\n\n\t\treturn get_mod(v[r] + 4 * MOD - mul(v[l], powB[r - l]));\n\t}\n\n\t// s[l..r) を反転した文字列のハッシュ値の取得\n\tull get_rev(int l, int r) {\n\t\t// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ec\n\n\t\tchmax(l, 0); chmin(r, n);\n\t\tif (l >= r) return 0;\n\t\tAssert(!v_rev.empty());\n\n\t\t// s[l, r) を反転した文字列は s_rev[n-r, n-l) に等しい．\n\t\treturn get_mod(v_rev[n - l] + 4 * MOD - mul(v_rev[n - r], powB[r - l]));\n\t}\n\n\t// ハッシュ値 hs をもつ s とハッシュ値 ht をもつ t[0..len) を連結した s+t のハッシュ値を返す．\n\tull join(ull hs, ull ht, int len) const {\n\t\t// verify : https://atcoder.jp/contests/abc284/tasks/abc284_f\n\n\t\tAssert(len <= n);\n\t\treturn get_mod(ht + mul(hs, powB[len]));\n\t}\n};\n\n\n//【最長回文長（文字中心）】O(n)\n/*\n* s[0..n) の s[i] を中心とする最長回文の半径（(文字数 + 1) / 2）を r[i] に格納し r を返す．\n* ここで回文の半径とは，(文字数 + 1) / 2 を意味する．\n*/\ntemplate <class STR>\nvi manacher(const STR& s) {\n\t// 参考 : https://snuke.hatenablog.com/entry/2014/12/02/235837\n\t// verify : https://judge.yosupo.jp/problem/enumerate_palindromes\n\n\t//【方法】\n\t// s[i] を中心とする最長回文の半径 j = r[i] が愚直に求まったとする．\n\t// すなわち s(i-j..i+j) が s[i] を中心とする最長回文である．\n\t// \n\t// 各 k = [1..j) について，s[i-k] を中心とする最長回文 s(i-k-r[i-k]..i-k+r[i-k]) が\n\t// s(i-j+1..i+j-1) の部分文字列であれば，s[i±j] の影響を受けず\n\t// s[i] についての左右対称性より r[i+k] = r[i-k] と定まる．\n\t// その条件は，左端を比較して\n\t//\t\ti - k - r[i-k] >= i - j + 1\n\t//\t\t⇔ k + r[i-k] < j\n\t// である．このような結果の使い回しができる限り k を進め，次の i を i + k にする．\n\t// \n\t// 使い回しができなくなったということは，s[i+k] を中心とする最長回文\n\t// s(i+k-r[i+k]..i+k+r[i+k]) が s(i-j+1..i+j-1) の部分文字列でないので，\n\t// 右端を比較することで\n\t//\t\ti + k + r[i+k] > i + j - 1\n\t//\t\t⇔ r[i+k] >= j - k\n\t// である．よって次の j は j - k にすればよい．\n\n\tint n = sz(s);\n\tvi r(n);\n\n\tint i = 0, j = 0;\n\twhile (i < n) {\n\t\twhile (i - j >= 0 && i + j < n && s[i - j] == s[i + j]) j++;\n\t\tr[i] = j;\n\n\t\tint k = 1;\n\t\twhile (i - k >= 0 && k + r[i - k] < j) {\n\t\t\tr[i + k] = r[i - k];\n\t\t\tk++;\n\t\t}\n\t\ti += k;\n\t\tj -= k;\n\t}\n\n\treturn r;\n}\n\n\n//【最長回文長】O(n)\n/*\n* s[0..n) の s[i] を中心とする最長回文の長さを lo[i] に格納し，\n* s[i..i+1] を中心とする最長回文の長さを le[i] に格納する．\n*\n* 利用：【最長回文長（文字中心）】\n*/\ntemplate <class STR>\nvoid manacher(const STR& s, vi& lo, vi& le) {\n\t// 参考 : https://snuke.hatenablog.com/entry/2014/12/02/235837\n\t// verify : https://judge.yosupo.jp/problem/enumerate_palindromes\n\n\tint n = sz(s);\n\tlo.resize(n);\n\tle.resize(n - 1);\n\n\tSTR s_riffled;\n\ts_riffled.resize(2 * n + 1);\n\trep(i, n) s_riffled[2 * i + 1] = s[i];\n\trep(i, n + 1) s_riffled[2 * i] = '$'; // '$' は s に含まれない文字\n\n\tvi r = manacher(s_riffled);\n\n\trep(i, n) lo[i] = r[2 * i + 1] - 1;\n\trep(i, n - 1) le[i] = r[2 * (i + 1)] - 1;\n}\n\n\nvector<unordered_map<ull, ll>> count_palindromes(const string& s) {\n\tint n = sz(s);\n\n\tRolling_hash S(s, true);\n\n\tvi lo, le;\n\tmanacher(s, lo, le);\n\n\tunordered_set<ull> hs;\n\ths.insert(0);\n\n\tunordered_map<ull, pii> h_to_lr;\n\tvector<unordered_map<ull, ll>> cnt(n + 1);\n\n\trep(i, n) {\n\t\tint r = lo[i] / 2;\n\t\tauto h = S.get(i - r, i + r + 1);\n\t\tdump(s.substr(i - r, 2 * r + 1));\n\t\th_to_lr[h] = { i - r, i + r + 1 };\n\t\tcnt[2 * r + 1][h]++;\n\t}\n\n\trep(i, n - 1) {\n\t\tint r = le[i] / 2;\n\t\tauto h = S.get(i - r + 1, i + r + 1);\n\t\tdump(s.substr(i - r + 1, 2 * r));\n\t\th_to_lr[h] = { i - r + 1, i + r + 1 };\n\t\tcnt[2 * r][h]++;\n\t}\n\n\trepir(len, n, 1) {\n\t\tfor (auto [h, c] : cnt[len]) {\n\t\t\tauto [l, r] = h_to_lr[h];\n\n\t\t\tif (len >= 2) {\n\t\t\t\tauto nh = S.get(l + 1, r - 1);\n\t\t\t\th_to_lr[nh] = { l + 1, r - 1 };\n\t\t\t\tcnt[len - 2][nh] += c;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn cnt;\n}\n\n\nint main() {\n//\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\n\tstring s, t;\n\tcin >> s >> t;\n\n\tint n = sz(s), m = sz(t);\n\n\tauto cs = count_palindromes(s);\n\tauto ct = count_palindromes(t);\n\tdumpel(cs); dumpel(ct);\n\n\tll res = 0;\n\n\trepi(len, 1, min(n, m)) {\n\t\tfor (auto [h, c] : cs[len]) {\n\t\t\tres += c * ct[len][h];\n\t\t}\n\t}\n\n\tcout << res << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":18292,"score_of_the_acc":-0.3625,"final_rank":5},{"submission_id":"aoj_2292_8760492","code_snippet":"// #line 1 \"library/Template/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define 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 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){if(a<b){a=b;return 1;}return 0;}\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\ntemplate<typename T,typename U>T ceil(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?(x+y-1)/y:x/y);}\ntemplate<typename T,typename U>T floor(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?x/y:(x-y+1)/y);}\ntemplate<typename T>int popcnt(T x){return __builtin_popcountll(x);}\ntemplate<typename T>int topbit(T x){return (x==0?-1:63-__builtin_clzll(x));}\ntemplate<typename T>int lowbit(T x){return (x==0?-1:__builtin_ctzll(x));}\n// #line 2 \"library/Utility/fastio.hpp\"\n#include <unistd.h>\n\nclass FastIO{\n static constexpr int L=1<<16;\n char rdbuf[L];\n int rdLeft=0,rdRight=0;\n inline void reload(){\n int len=rdRight-rdLeft;\n memmove(rdbuf,rdbuf+rdLeft,len);\n rdLeft=0,rdRight=len;\n rdRight+=fread(rdbuf+len,1,L-len,stdin);\n }\n inline bool skip(){\n for(;;){\n while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++;\n if(rdLeft==rdRight){\n reload();\n if(rdLeft==rdRight)return false;\n }\n else break;\n }\n return true;\n }\n template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline bool _read(T& x){\n if(!skip())return false;\n if(rdLeft+20>=rdRight)reload();\n bool neg=false;\n if(rdbuf[rdLeft]=='-'){\n neg=true;\n rdLeft++;\n }\n x=0;\n while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){\n x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));\n }\n return true;\n }\n template<typename T,enable_if_t<is_floating_point<T>::value,int> =0>inline bool _read(T& x){\n if(!skip())return false;\n if(rdLeft+20>=rdRight)reload();\n bool neg=false;\n if(rdbuf[rdLeft]=='-'){\n neg=true;\n rdLeft++;\n }\n x=0;\n while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){\n x=x*10+(rdbuf[rdLeft++]^48);\n }\n if(rdbuf[rdLeft]!='.')return true;\n rdLeft++;\n T base=.1;\n while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){\n x+=base*(rdbuf[rdLeft++]^48);\n base*=.1;\n }\n if(neg)x=-x;\n return true;\n }\n inline bool _read(char& x){\n if(!skip())return false;\n if(rdLeft+1>=rdRight)reload();\n x=rdbuf[rdLeft++];\n return true;\n }\n inline bool _read(string& x){\n if(!skip())return false;\n for(;;){\n int pos=rdLeft;\n while(pos<rdRight and rdbuf[pos]>' ')pos++;\n x.append(rdbuf+rdLeft,pos-rdLeft);\n if(rdLeft==pos)break;\n rdLeft=pos;\n if(rdLeft==rdRight)reload();\n else break;\n }\n return true;\n }\n template<typename T>inline bool _read(vector<T>& v){\n for(auto& x:v){\n if(!_read(x))return false;\n }\n return true;\n }\n\n char wtbuf[L],tmp[50];\n int wtRight=0;\n inline void flush(){\n fwrite(wtbuf,1,wtRight,stdout);\n wtRight=0;\n }\n inline void _write(const char& x){\n if(wtRight>L-32)flush();\n wtbuf[wtRight++]=x;\n }\n inline void _write(const string& x){\n for(auto& c:x)_write(c);\n }\n template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline void _write(T x){\n if(wtRight>L-32)flush();\n if(x==0){\n _write('0');\n return;\n }\n else if(x<0){\n _write('-');\n if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {\n switch (sizeof(x)) {\n case 2: _write(\"32768\"); return;\n case 4: _write(\"2147483648\"); return;\n case 8: _write(\"9223372036854775808\"); return;\n }\n }\n x=-x;\n }\n int pos=0;\n while(x!=0){\n tmp[pos++]=char((x%10)|48);\n x/=10;\n }\n rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];\n wtRight+=pos;\n }\n template<typename T>inline void _write(const vector<T>& v){\n rep(i,0,v.size()){\n if(i)_write(' ');\n _write(v[i]);\n }\n }\npublic:\n FastIO(){}\n ~FastIO(){flush();}\n inline void read(){}\n template <typename Head, typename... Tail>inline void read(Head& head,Tail&... tail){\n assert(_read(head));\n read(tail...);\n }\n template<bool ln=true,bool space=false>inline void write(){if(ln)_write('\\n');}\n template <bool ln=true,bool space=false,typename Head, typename... Tail>inline void write(const Head& head,const Tail&... tail){\n if(space)_write(' ');\n _write(head);\n write<ln,true>(tail...);\n }\n};\n\n/**\n * @brief Fast IO\n */\n// #line 3 \"sol.cpp\"\n\n\nnamespace Random{\n mt19937_64 randgen(chrono::steady_clock::now().time_since_epoch().count());\n using u64=unsigned long long;\n static u64 get(){\n return randgen();\n }\n template<typename T>static T get(T L){\n return get()%(L+1);\n }\n template<typename T>static T get(T L,T R){\n return get(R-L)+L;\n }\n double uniform(){\n return double(get(1000000000))/1000000000;\n }\n string str(int n){\n string ret;\n rep(i,0,n)ret+=get('a','z');\n return ret;\n }\n template<typename Iter>void shuffle(Iter first,Iter last){\n if(first==last)return;\n int len=1;\n for(auto it=first+1;it!=last;it++){\n len++;\n int j=get(0,len-1);\n if(j!=len-1)iter_swap(it,first+j);\n }\n }\n template<typename T>vector<T> select(int n,T L,T R){\n set<T> ret;\n while(ret.size()<n)ret.insert(get(L,R));\n return {ALL(ret)};\n }\n};\n\nstruct RollingHash {\n using ull = unsigned long long;\n const ull MOD = 0x1fffffffffffffff;\n const ull base;\n vector<ull> hashed, power;\n\n static constexpr ull mask(ll a){ return (1ULL << a) - 1; }\n\n inline ull mul(ull a, ull b) const {\n __uint128_t ans = __uint128_t(a) * b;\n ans = (ans >> 61) + (ans & MOD);\n if(ans >= MOD) ans -= MOD;\n return ans;\n }\n\n static inline ull genbase(){return Random::get(ull(0x1fffffffffffffff));}\n RollingHash()=default;\n\n RollingHash(const string &s,ull base):base(base){\n ll n = s.size();\n hashed.assign(n + 1, 0);\n power.assign(n + 1, 0);\n power[0] = 1;\n for(ll i = 0; i < n; i++) {\n power[i + 1] = mul(power[i], base);\n hashed[i + 1] = mul(hashed[i], base) + s[i];\n if(hashed[i + 1] >= MOD) hashed[i + 1] -= MOD;\n }\n }\n\n ull get(ll l, ll r) const {\n ull ret = hashed[r] + MOD - mul(hashed[l], power[r - l]);\n if(ret >= MOD) ret -= MOD;\n return ret;\n }\n\n ull connect(ull h1, ull h2, ll h2len) const {\n ull ret = mul(h1, power[h2len]) + h2;\n if(ret >= MOD) ret -= MOD;\n return ret;\n }\n\n void connect(const string &s){\n ll n = hashed.size() - 1, m = s.size();\n hashed.resize(n + m + 1);\n power.resize(n + m + 1);\n for(ll i = n; i < n + m; i++) {\n power[i + 1] = mul(power[i], base);\n hashed[i + 1] = mul(hashed[i], base) + s[i - n];\n if(hashed[i + 1] >= MOD) hashed[i + 1] -= MOD;\n }\n }\n\n ll LCP(const RollingHash &b, ll l1, ll r1, ll l2, ll r2) {\n ll len = min(r1 - l1, r2 - l2);\n ll low = -1, high = len + 1;\n while(high - low > 1) {\n ll mid = (low + high) / 2;\n if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;\n else high = mid;\n }\n return low;\n }\n};\n\ntemplate<typename T>struct PalindromicTree{\n struct Node{\n map<char,int> nxt;\n int link,len,id,cnt;\n Node(){}\n Node(int link,int len,int id,int cnt):link(link),len(len),id(id),cnt(cnt){}\n };\n T S;\n vector<Node> nodes;\n PalindromicTree(){}\n PalindromicTree(const T& S):S(S){\n nodes.push_back(Node(0,-1,-1,0));\n nodes.push_back(Node(0,0,-1,0));\n int cur=0;\n\n rep(i,0,SZ(S)){\n int k=find(i,cur);\n char c=S[i];\n if(nodes[k].nxt.count(c)){\n cur=nodes[k].nxt[c];\n nodes[cur].cnt++;\n continue;\n }\n nodes[k].nxt[c]=SZ(nodes);\n cur=SZ(nodes);\n nodes.push_back(Node(-1,nodes[k].len+2,i-nodes[k].len-1,1));\n if(nodes.back().len==1)nodes.back().link=1;\n else{\n int n=find(i,nodes[k].link);\n nodes.back().link=nodes[n].nxt[c];\n }\n }\n }\n vector<array<int,3>> get_freq(){\n vector<array<int,3>> ret;\n for(int i=SZ(nodes)-1;i>=2;i--){\n ret.push_back({nodes[i].len,nodes[i].id,nodes[i].cnt});\n nodes[nodes[i].link].cnt+=nodes[i].cnt;\n }\n return ret;\n }\nprivate:\n int find(int last,int k)const{\n for(;;){\n int i=last-1-nodes[k].len;\n if(i>=0 and S[i]==S[last])break;\n k=nodes[k].link;\n }\n return k;\n }\n};\n\nFastIO io;\nint main(){\n string S,T;\n io.read(S,T);\n\n using ull = unsigned long long;\n PalindromicTree<string> t1(S),t2(T);\n auto base=RollingHash::genbase();\n RollingHash rh1(S,base),rh2(T,base);\n auto f1=t1.get_freq();\n auto f2=t2.get_freq();\n\n map<ull,ll> mp;\n for(auto& [len,id,cnt]:f1){\n // cerr<<len<<' '<<id<<' '<<cnt<<'\\n';\n mp[rh1.get(id,id+len)]+=cnt;\n }\n ll ret=0;\n for(auto& [len,id,cnt]:f2)ret+=mp[rh2.get(id,id+len)]*cnt;\n io.write(ret);\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":24968,"score_of_the_acc":-0.57,"final_rank":7},{"submission_id":"aoj_2292_8479596","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\nusing ull = unsigned long long;\nconst ull mod = (1LL << 61) - 1;\n\nnamespace Hash {\null getmod(ull x) {\n ull ret = (x >> 61) + (x & mod);\n if (ret >= mod) ret -= mod;\n return ret;\n}\n\null mul(ull x, ull y) {\n x = getmod(x), y = getmod(y);\n ull x1 = x >> 31;\n ull x2 = x & ((1LL << 31) - 1);\n ull y1 = y >> 31;\n ull y2 = y & ((1LL << 31) - 1);\n ull z = x1 * y2 + x2 * y1;\n ull z1 = z >> 30;\n ull z2 = z & ((1LL << 30) - 1);\n return getmod(x1 * y1 * 2 + x2 * y2 + z1 + (z2 << 31));\n}\n} // namespace Hash\n\ntemplate <typename T>\nstruct RollingHash {\n const int n;\n const ull b;\n vector<ull> h, p;\n\n RollingHash(const T &s, ull b = 887446835055281585) : n(sz(s)), b(b) {\n h.assign(n + 1, 0);\n p.assign(n + 1, 1);\n rep(i, n) {\n p[i + 1] = Hash::mul(p[i], b);\n h[i + 1] = Hash::mul(h[i], b) + s[i];\n if (h[i + 1] >= mod) h[i + 1] -= mod;\n }\n }\n\n ull gethash(int l, int r) {\n ull ret = h[r] + mod - Hash::mul(h[l], p[r - l]);\n if (ret >= mod) ret -= mod;\n return ret;\n }\n\n ull getallhash() { return h[n]; }\n};\n\ntemplate <typename T>\nvector<int> manachar(const T &s) {\n int n = sz(s);\n vector<int> ret(n);\n int i = 0, j = 0;\n while (i < n) {\n while (i - j >= 0 && i + j < n && s[i + j] == s[i - j]) j++;\n ret[i] = j;\n int k = 1;\n while (i - k >= 0 && k + ret[i - k] < j) ret[i + k] = ret[i - k], k++;\n i += k, j -= k;\n }\n return ret;\n}\n\nint main() {\n string S, T;\n cin >> S >> T;\n\n int N = sz(S), M = sz(T);\n\n RollingHash hashS(S), hashT(T);\n\n auto getPalindromeLen = [](string S) {\n int n = sz(S);\n string X = \".\";\n rep(i, n) X += S[i], X += \".\";\n auto a = manachar(X);\n // print(a);\n\n vector<vector<int>> ret(2, vector<int>(n));\n rep(i, n) {\n ret[0][i] = a[2 * i + 1] / 2;\n ret[1][i] = a[2 * i] / 2;\n }\n\n // rep(i, 2) print(ret[i]);\n\n return ret;\n };\n\n vector<vector<int>> ms = getPalindromeLen(S), mt = getPalindromeLen(T);\n\n auto solve = [&](vector<int> a, vector<int> b) {\n map<ull, int> mp;\n int K = 0;\n mp[0] = K++;\n vector<vector<int>> es;\n es.eb();\n\n vector<ll> cnt;\n cnt.eb(0);\n\n // print(a);\n\n rep(i, N) {\n int ok = 0, ng = a[i] + 1;\n while (abs(ok - ng) > 1) {\n int mid = (ok + ng) / 2;\n // cout << i MM i + mid << endl;\n ull x = hashS.gethash(i, i + mid);\n (mp.count(x) ? ok : ng) = mid;\n }\n\n // cout << i MM ok << endl;\n\n int p = mp[hashS.gethash(i, i + ok)];\n rep2(j, ok + 1, a[i] + 1) {\n ull x = hashS.gethash(i, i + j);\n es[p].eb(K);\n p = K;\n mp[x] = K++;\n es.eb();\n cnt.eb(0);\n }\n\n {\n ull x = hashS.gethash(i, i + a[i]);\n cnt[mp[x]]++;\n }\n }\n\n auto dfs1 = [&](auto &&dfs1, int now) -> ll {\n each(e, es[now]) {\n cnt[now] += dfs1(dfs1, e); //\n }\n return cnt[now];\n };\n\n dfs1(dfs1, 0);\n\n cnt[0] = 0;\n\n auto dfs2 = [&](auto &&dfs2, int now) -> void {\n each(e, es[now]) {\n cnt[e] += cnt[now];\n dfs2(dfs2, e);\n }\n };\n\n dfs2(dfs2, 0);\n\n ll ret = 0;\n\n rep(i, M) {\n int ok = 0, ng = b[i] + 1;\n while (abs(ok - ng) > 1) {\n int mid = (ok + ng) / 2;\n ull x = hashT.gethash(i, i + mid);\n (mp.count(x) ? ok : ng) = mid;\n }\n\n // cout << K MM i MM i + ok << endl;\n\n ret += cnt[mp[hashT.gethash(i, i + ok)]];\n }\n\n return ret;\n };\n\n ll ans = 0;\n rep(i, 2) ans += solve(ms[i], mt[i]);\n\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":280,"memory_kb":13768,"score_of_the_acc":-1.084,"final_rank":13},{"submission_id":"aoj_2292_8458496","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\n#define inf 1000000007\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define fi first\n#define se second\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\n#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)\n#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)\n#define all(x) (x).begin(),(x).end()\n#define SUM(v) accumulate(all(v), 0LL)\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\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 UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\n#define SZ(c) (int)(c).size()\ntemplate<typename T>\nostream& operator << (ostream& os, vector<T>& vec) {\n os << \"{\";\n for (int i = 0; i<(int)vec.size(); i++) {\n os << vec[i] << (i + 1 == (int)vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\n// pair出力\ntemplate<typename T, typename U>\nostream& operator << (ostream& os, pair<T, U> pair_var) {\n os << \"(\" << pair_var.first << \", \" << pair_var.second << \")\";\n return os;\n}\n// map出力\ntemplate<typename T, typename U>\nostream& operator << (ostream& os, 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()) os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n// set 出力\ntemplate<typename T>\nostream& operator << (ostream& os, 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()) os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n// tuple 出力\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#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 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}\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 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); }\n#ifdef LOCAL\nvoid debug_out() { cerr << endl; }\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cerr << \" \" << H;\n debug_out(T...);\n}\n#define dbg(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define dbg(...) (void(0))\n#define dump(x) (void(0))\n#endif\ntemplate<typename A, typename T>\nstd::enable_if_t<std::is_convertible<T, A>::value> fill(A& array, const T& val)\n{\n array = val;\n}\ntemplate<typename A, typename T>\nstd::enable_if_t<!std::is_convertible<T, A>::value> fill(A& array, const T& val)\n{\n for (auto& a : array) {\n fill(a, val);\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}\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}\nvector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}\ntemplate <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}\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; }\nll allbit(ll n) { return (1LL << n) - 1; }\nint popcount(signed t) { return __builtin_popcount(t); }\nint popcount(ll t) { return __builtin_popcountll(t); }\nbool ispow2(int i) { return i && (i & -i) == i; }\n\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> void 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}\ntemplate<class T> inline bool chmax(T &a, T b){\n if(a<b){\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmin(T &a, T b){\n if(a>b){\n a = b;\n return true;\n }\n return false;\n}\n\n\nstd::vector<int> sa_naive(const std::vector<int>& s) {\n int n = int(s.size());\n std::vector<int> sa(n);\n std::iota(sa.begin(), sa.end(), 0);\n std::sort(sa.begin(), sa.end(), [&](int l, int r) {\n if (l == r) return false;\n while (l < n && r < n) {\n if (s[l] != s[r]) return s[l] < s[r];\n l++;\n r++;\n }\n return l == n;\n });\n return sa;\n}\n\nstd::vector<int> sa_doubling(const std::vector<int>& s) {\n int n = int(s.size());\n std::vector<int> sa(n), rnk = s, tmp(n);\n std::iota(sa.begin(), sa.end(), 0);\n for (int k = 1; k < n; k *= 2) {\n auto cmp = [&](int x, int y) {\n if (rnk[x] != rnk[y]) return rnk[x] < rnk[y];\n int rx = x + k < n ? rnk[x + k] : -1;\n int ry = y + k < n ? rnk[y + k] : -1;\n return rx < ry;\n };\n std::sort(sa.begin(), sa.end(), cmp);\n tmp[sa[0]] = 0;\n for (int i = 1; i < n; i++) {\n tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);\n }\n std::swap(tmp, rnk);\n }\n return sa;\n}\n\n// SA-IS, linear-time suffix array construction\n// Reference:\n// G. Nong, S. Zhang, and W. H. Chan,\n// Two Efficient Algorithms for Linear Time Suffix Array Construction\ntemplate <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>\nstd::vector<int> sa_is(const std::vector<int>& s, int upper) {\n int n = int(s.size());\n if (n == 0) return {};\n if (n == 1) return {0};\n if (n == 2) {\n if (s[0] < s[1]) {\n return {0, 1};\n } else {\n return {1, 0};\n }\n }\n if (n < THRESHOLD_NAIVE) {\n return sa_naive(s);\n }\n if (n < THRESHOLD_DOUBLING) {\n return sa_doubling(s);\n }\n\n std::vector<int> sa(n);\n std::vector<bool> ls(n);\n for (int i = n - 2; i >= 0; i--) {\n ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);\n }\n std::vector<int> sum_l(upper + 1), sum_s(upper + 1);\n for (int i = 0; i < n; i++) {\n if (!ls[i]) {\n sum_s[s[i]]++;\n } else {\n sum_l[s[i] + 1]++;\n }\n }\n for (int i = 0; i <= upper; i++) {\n sum_s[i] += sum_l[i];\n if (i < upper) sum_l[i + 1] += sum_s[i];\n }\n\n auto induce = [&](const std::vector<int>& lms) {\n std::fill(sa.begin(), sa.end(), -1);\n std::vector<int> buf(upper + 1);\n std::copy(sum_s.begin(), sum_s.end(), buf.begin());\n for (auto d : lms) {\n if (d == n) continue;\n sa[buf[s[d]]++] = d;\n }\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\n sa[buf[s[n - 1]]++] = n - 1;\n for (int i = 0; i < n; i++) {\n int v = sa[i];\n if (v >= 1 && !ls[v - 1]) {\n sa[buf[s[v - 1]]++] = v - 1;\n }\n }\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\n for (int i = n - 1; i >= 0; i--) {\n int v = sa[i];\n if (v >= 1 && ls[v - 1]) {\n sa[--buf[s[v - 1] + 1]] = v - 1;\n }\n }\n };\n\n std::vector<int> lms_map(n + 1, -1);\n int m = 0;\n for (int i = 1; i < n; i++) {\n if (!ls[i - 1] && ls[i]) {\n lms_map[i] = m++;\n }\n }\n std::vector<int> lms;\n lms.reserve(m);\n for (int i = 1; i < n; i++) {\n if (!ls[i - 1] && ls[i]) {\n lms.push_back(i);\n }\n }\n\n induce(lms);\n\n if (m) {\n std::vector<int> sorted_lms;\n sorted_lms.reserve(m);\n for (int v : sa) {\n if (lms_map[v] != -1) sorted_lms.push_back(v);\n }\n std::vector<int> rec_s(m);\n int rec_upper = 0;\n rec_s[lms_map[sorted_lms[0]]] = 0;\n for (int i = 1; i < m; i++) {\n int l = sorted_lms[i - 1], r = sorted_lms[i];\n int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;\n int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;\n bool same = true;\n if (end_l - l != end_r - r) {\n same = false;\n } else {\n while (l < end_l) {\n if (s[l] != s[r]) {\n break;\n }\n l++;\n r++;\n }\n if (l == n || s[l] != s[r]) same = false;\n }\n if (!same) rec_upper++;\n rec_s[lms_map[sorted_lms[i]]] = rec_upper;\n }\n\n auto rec_sa =\n sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);\n\n for (int i = 0; i < m; i++) {\n sorted_lms[i] = lms[rec_sa[i]];\n }\n induce(sorted_lms);\n }\n return sa;\n}\n\nstd::vector<int> suffix_array(const std::string& s) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) {\n s2[i] = s[i];\n }\n return sa_is(s2, 255);\n}\n\ntemplate <class T>\nstd::vector<int> lcp_array(const std::vector<T>& s,\n const std::vector<int>& sa) {\n int n = int(s.size());\n assert(n >= 1);\n std::vector<int> rnk(n);\n for (int i = 0; i < n; i++) {\n rnk[sa[i]] = i;\n }\n std::vector<int> lcp(n - 1);\n int h = 0;\n for (int i = 0; i < n; i++) {\n if (h > 0) h--;\n if (rnk[i] == 0) continue;\n int j = sa[rnk[i] - 1];\n for (; j + h < n && i + h < n; h++) {\n if (s[j + h] != s[i + h]) break;\n }\n lcp[rnk[i] - 1] = h;\n }\n return lcp;\n}\n\nstd::vector<int> lcp_array(const std::string& s, const std::vector<int>& sa) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) {\n s2[i] = s[i];\n }\n return lcp_array(s2, sa);\n}\n\ntemplate<typename T> class segtree {\nprivate:\n int n,sz,h; vector<T> node, lazy_update, lazy_add; vector<bool> lazyFlag;\npublic:\n segtree(vector<T> v) : n(1), sz((int)v.size()), h(0){\n while(n < sz) n *= 2, h++;\n node.resize(2*n, 0);\n lazy_update.resize(2*n, 0); lazyFlag.resize(2*n, false);\n lazy_add.resize(2*n, 0);\n for(int i = 0; i < sz; i++) node[i+n] = v[i];\n for(int i=n-1; i>=1; i--) node[i] = node[2*i] + node[2*i+1];\n }\n void eval(int k) {\n if(lazyFlag[k]){\n lazy_update[k] += lazy_add[k];\n node[k] = lazy_update[k];\n if(k < n) {\n lazy_add[2*k] = lazy_add[2*k+1] = 0;\n lazy_update[2*k] = lazy_update[2*k+1] = lazy_update[k] / 2;\n lazyFlag[2*k] = lazyFlag[2*k+1] = true;\n }\n lazy_add[k] = 0, lazyFlag[k] = false;\n }else if(lazy_add[k] != 0){\n node[k] += lazy_add[k];\n if(k < n){\n lazy_add[2*k] += lazy_add[k] / 2; lazy_add[2*k+1] += lazy_add[k] / 2;\n }\n lazy_add[k] = 0;\n }\n }\n void update(int a, int b, T x, int k=1, int l=0, int r=-1) {\n if(r < 0) r = n;\n eval(k);\n if(b <= l || r <= a) return;\n if(a <= l && r <= b){\n lazy_update[k] = x*(r-l); lazyFlag[k] = true; eval(k);\n }else{\n update(a, b, x, 2*k, l, (l+r)/2); update(a, b, x, 2*k+1, (l+r)/2, r);\n node[k] = node[2*k] + node[2*k+1];\n }\n }\n void add(int a, int b, T x, int k=1, int l=0, int r=-1){\n if(r < 0) r = n;\n eval(k);\n if(b <= l || r <= a) return;\n if(a <= l && r <= b){\n lazy_add[k] += x*(r-l); eval(k);\n }else{\n add(a, b, x, 2*k, l, (l+r)/2); add(a, b, x, 2*k+1, (l+r)/2, r);\n node[k] = node[2*k] + node[2*k+1];\n }\n }\n T query(int a, int b) {\n a += n, b += n - 1;\n for(int i = h; i > 0; i--) eval(a >> i), eval(b >> i);\n b++;\n T res1 = 0, res2 = 0;\n while(a < b) {\n if(a & 1) eval(a), res1 += node[a++];\n if(b & 1) eval(--b), res2 += node[b];\n a >>= 1, b >>= 1;\n }\n return res1 + res2;\n }\n void print(){for(int i = 0; i < sz; i++)cout<<query(i,i+1)<< \" \";cout<<endl;}\n};\n\n\n\n\n//iを中心とする最長の回文の半径をR[i]に格納(O(n))\n// abaab を $a$b$a$a$b$ みたいにすると偶数長のもの求めることが可能\nvoid manacher(const string& S,vector<int>& res)\n{\n int sz = (int)S.size(), i = 0, j = 0, k;\n res.resize(sz);\n while(i < sz){\n while(i-j >= 0 && i+j < sz && S[i-j] == S[i+j]) j++;\n res[i] = j, k = 1;\n while(i-k >= 0 && i+k < sz && k+res[i-k] < j){\n res[i+k] = res[i-k], k++;\n }\n i += k; j -= k;\n }\n}\n\n\nint main(){\n STR(s,t);\n string Q;\n rep(i,s.size()){\n Q.push_back('$');\n Q.push_back(s[i]);\n }\n Q.push_back('$');\n Q.push_back('|');\n int T = Q.size();\n rep(i,t.size()){\n Q.push_back('$');\n Q.push_back(t[i]);\n }\n Q.push_back('$');\n vector<int> mana;\n manacher(Q,mana);\n // cerr << mana << endl;\n int n = Q.size();\n \n auto sa = suffix_array(Q);\n auto lcp = lcp_array(Q,sa);\n ll res = 0;\n vector<ll> ppp(30000);\n segtree<ll> segS(ppp);\n segtree<ll> segT(ppp);\n // cerr << Q << endl;\n for(int i=0;i<sa.size();i++){\n int id = sa[i];\n int LCP = inf;\n if(i!=0)chmin(LCP,lcp[i-1]);\n if(Q[id]=='$'){\n int len = LCP/2; \n segS.update(len+1,30000,0);\n segT.update(len+1,30000,0);\n }else{\n int len = (LCP+1)/2;\n segS.update(len+1,30000,0);\n segT.update(len+1,30000,0);\n }\n if(Q[id]=='|')continue;\n if(id<T){\n int len = mana[id]/2;\n res += segT.query(1,len+1);\n segS.add(0,len+1,1);\n }else{\n int len = mana[id]/2;\n res += segS.query(1,len+1);\n segT.add(0,len+1,1);\n }\n // cerr << id << endl;\n // cerr << Q.substr(id) << endl;\n // dbg(res);\n }\n cout << res << endl;\n\n \n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":9928,"score_of_the_acc":-0.6543,"final_rank":10},{"submission_id":"aoj_2292_8458485","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\n#define inf 1000000007\n#define MP make_pair\n#define MT make_tuple\n#define PB push_back\n#define fi first\n#define se second\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\n#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)\n#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)\n#define all(x) (x).begin(),(x).end()\n#define SUM(v) accumulate(all(v), 0LL)\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\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 UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\n#define SZ(c) (int)(c).size()\ntemplate<typename T>\nostream& operator << (ostream& os, vector<T>& vec) {\n os << \"{\";\n for (int i = 0; i<(int)vec.size(); i++) {\n os << vec[i] << (i + 1 == (int)vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\n// pair出力\ntemplate<typename T, typename U>\nostream& operator << (ostream& os, pair<T, U> pair_var) {\n os << \"(\" << pair_var.first << \", \" << pair_var.second << \")\";\n return os;\n}\n// map出力\ntemplate<typename T, typename U>\nostream& operator << (ostream& os, 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()) os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n// set 出力\ntemplate<typename T>\nostream& operator << (ostream& os, 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()) os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n// tuple 出力\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#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 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}\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 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); }\n#ifdef LOCAL\nvoid debug_out() { cerr << endl; }\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n cerr << \" \" << H;\n debug_out(T...);\n}\n#define dbg(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define dbg(...) (void(0))\n#define dump(x) (void(0))\n#endif\ntemplate<typename A, typename T>\nstd::enable_if_t<std::is_convertible<T, A>::value> fill(A& array, const T& val)\n{\n array = val;\n}\ntemplate<typename A, typename T>\nstd::enable_if_t<!std::is_convertible<T, A>::value> fill(A& array, const T& val)\n{\n for (auto& a : array) {\n fill(a, val);\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}\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}\nvector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}\ntemplate <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}\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; }\nll allbit(ll n) { return (1LL << n) - 1; }\nint popcount(signed t) { return __builtin_popcount(t); }\nint popcount(ll t) { return __builtin_popcountll(t); }\nbool ispow2(int i) { return i && (i & -i) == i; }\n\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> void 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}\ntemplate<class T> inline bool chmax(T &a, T b){\n if(a<b){\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmin(T &a, T b){\n if(a>b){\n a = b;\n return true;\n }\n return false;\n}\n\n\nstd::vector<int> sa_naive(const std::vector<int>& s) {\n int n = int(s.size());\n std::vector<int> sa(n);\n std::iota(sa.begin(), sa.end(), 0);\n std::sort(sa.begin(), sa.end(), [&](int l, int r) {\n if (l == r) return false;\n while (l < n && r < n) {\n if (s[l] != s[r]) return s[l] < s[r];\n l++;\n r++;\n }\n return l == n;\n });\n return sa;\n}\n\nstd::vector<int> sa_doubling(const std::vector<int>& s) {\n int n = int(s.size());\n std::vector<int> sa(n), rnk = s, tmp(n);\n std::iota(sa.begin(), sa.end(), 0);\n for (int k = 1; k < n; k *= 2) {\n auto cmp = [&](int x, int y) {\n if (rnk[x] != rnk[y]) return rnk[x] < rnk[y];\n int rx = x + k < n ? rnk[x + k] : -1;\n int ry = y + k < n ? rnk[y + k] : -1;\n return rx < ry;\n };\n std::sort(sa.begin(), sa.end(), cmp);\n tmp[sa[0]] = 0;\n for (int i = 1; i < n; i++) {\n tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);\n }\n std::swap(tmp, rnk);\n }\n return sa;\n}\n\n// SA-IS, linear-time suffix array construction\n// Reference:\n// G. Nong, S. Zhang, and W. H. Chan,\n// Two Efficient Algorithms for Linear Time Suffix Array Construction\ntemplate <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>\nstd::vector<int> sa_is(const std::vector<int>& s, int upper) {\n int n = int(s.size());\n if (n == 0) return {};\n if (n == 1) return {0};\n if (n == 2) {\n if (s[0] < s[1]) {\n return {0, 1};\n } else {\n return {1, 0};\n }\n }\n if (n < THRESHOLD_NAIVE) {\n return sa_naive(s);\n }\n if (n < THRESHOLD_DOUBLING) {\n return sa_doubling(s);\n }\n\n std::vector<int> sa(n);\n std::vector<bool> ls(n);\n for (int i = n - 2; i >= 0; i--) {\n ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);\n }\n std::vector<int> sum_l(upper + 1), sum_s(upper + 1);\n for (int i = 0; i < n; i++) {\n if (!ls[i]) {\n sum_s[s[i]]++;\n } else {\n sum_l[s[i] + 1]++;\n }\n }\n for (int i = 0; i <= upper; i++) {\n sum_s[i] += sum_l[i];\n if (i < upper) sum_l[i + 1] += sum_s[i];\n }\n\n auto induce = [&](const std::vector<int>& lms) {\n std::fill(sa.begin(), sa.end(), -1);\n std::vector<int> buf(upper + 1);\n std::copy(sum_s.begin(), sum_s.end(), buf.begin());\n for (auto d : lms) {\n if (d == n) continue;\n sa[buf[s[d]]++] = d;\n }\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\n sa[buf[s[n - 1]]++] = n - 1;\n for (int i = 0; i < n; i++) {\n int v = sa[i];\n if (v >= 1 && !ls[v - 1]) {\n sa[buf[s[v - 1]]++] = v - 1;\n }\n }\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\n for (int i = n - 1; i >= 0; i--) {\n int v = sa[i];\n if (v >= 1 && ls[v - 1]) {\n sa[--buf[s[v - 1] + 1]] = v - 1;\n }\n }\n };\n\n std::vector<int> lms_map(n + 1, -1);\n int m = 0;\n for (int i = 1; i < n; i++) {\n if (!ls[i - 1] && ls[i]) {\n lms_map[i] = m++;\n }\n }\n std::vector<int> lms;\n lms.reserve(m);\n for (int i = 1; i < n; i++) {\n if (!ls[i - 1] && ls[i]) {\n lms.push_back(i);\n }\n }\n\n induce(lms);\n\n if (m) {\n std::vector<int> sorted_lms;\n sorted_lms.reserve(m);\n for (int v : sa) {\n if (lms_map[v] != -1) sorted_lms.push_back(v);\n }\n std::vector<int> rec_s(m);\n int rec_upper = 0;\n rec_s[lms_map[sorted_lms[0]]] = 0;\n for (int i = 1; i < m; i++) {\n int l = sorted_lms[i - 1], r = sorted_lms[i];\n int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;\n int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;\n bool same = true;\n if (end_l - l != end_r - r) {\n same = false;\n } else {\n while (l < end_l) {\n if (s[l] != s[r]) {\n break;\n }\n l++;\n r++;\n }\n if (l == n || s[l] != s[r]) same = false;\n }\n if (!same) rec_upper++;\n rec_s[lms_map[sorted_lms[i]]] = rec_upper;\n }\n\n auto rec_sa =\n sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);\n\n for (int i = 0; i < m; i++) {\n sorted_lms[i] = lms[rec_sa[i]];\n }\n induce(sorted_lms);\n }\n return sa;\n}\n\nstd::vector<int> suffix_array(const std::string& s) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) {\n s2[i] = s[i];\n }\n return sa_is(s2, 255);\n}\n\ntemplate <class T>\nstd::vector<int> lcp_array(const std::vector<T>& s,\n const std::vector<int>& sa) {\n int n = int(s.size());\n assert(n >= 1);\n std::vector<int> rnk(n);\n for (int i = 0; i < n; i++) {\n rnk[sa[i]] = i;\n }\n std::vector<int> lcp(n - 1);\n int h = 0;\n for (int i = 0; i < n; i++) {\n if (h > 0) h--;\n if (rnk[i] == 0) continue;\n int j = sa[rnk[i] - 1];\n for (; j + h < n && i + h < n; h++) {\n if (s[j + h] != s[i + h]) break;\n }\n lcp[rnk[i] - 1] = h;\n }\n return lcp;\n}\n\nstd::vector<int> lcp_array(const std::string& s, const std::vector<int>& sa) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) {\n s2[i] = s[i];\n }\n return lcp_array(s2, sa);\n}\n\ntemplate<typename T> class segtree {\nprivate:\n int n,sz,h; vector<T> node, lazy_update, lazy_add; vector<bool> lazyFlag;\npublic:\n segtree(vector<T> v) : n(1), sz((int)v.size()), h(0){\n while(n < sz) n *= 2, h++;\n node.resize(2*n, 0);\n lazy_update.resize(2*n, 0); lazyFlag.resize(2*n, false);\n lazy_add.resize(2*n, 0);\n for(int i = 0; i < sz; i++) node[i+n] = v[i];\n for(int i=n-1; i>=1; i--) node[i] = node[2*i] + node[2*i+1];\n }\n void eval(int k) {\n if(lazyFlag[k]){\n lazy_update[k] += lazy_add[k];\n node[k] = lazy_update[k];\n if(k < n) {\n lazy_add[2*k] = lazy_add[2*k+1] = 0;\n lazy_update[2*k] = lazy_update[2*k+1] = lazy_update[k] / 2;\n lazyFlag[2*k] = lazyFlag[2*k+1] = true;\n }\n lazy_add[k] = 0, lazyFlag[k] = false;\n }else if(lazy_add[k] != 0){\n node[k] += lazy_add[k];\n if(k < n){\n lazy_add[2*k] += lazy_add[k] / 2; lazy_add[2*k+1] += lazy_add[k] / 2;\n }\n lazy_add[k] = 0;\n }\n }\n void update(int a, int b, T x, int k=1, int l=0, int r=-1) {\n if(r < 0) r = n;\n eval(k);\n if(b <= l || r <= a) return;\n if(a <= l && r <= b){\n lazy_update[k] = x*(r-l); lazyFlag[k] = true; eval(k);\n }else{\n update(a, b, x, 2*k, l, (l+r)/2); update(a, b, x, 2*k+1, (l+r)/2, r);\n node[k] = node[2*k] + node[2*k+1];\n }\n }\n void add(int a, int b, T x, int k=1, int l=0, int r=-1){\n if(r < 0) r = n;\n eval(k);\n if(b <= l || r <= a) return;\n if(a <= l && r <= b){\n lazy_add[k] += x*(r-l); eval(k);\n }else{\n add(a, b, x, 2*k, l, (l+r)/2); add(a, b, x, 2*k+1, (l+r)/2, r);\n node[k] = node[2*k] + node[2*k+1];\n }\n }\n T query(int a, int b) {\n a += n, b += n - 1;\n for(int i = h; i > 0; i--) eval(a >> i), eval(b >> i);\n b++;\n T res1 = 0, res2 = 0;\n while(a < b) {\n if(a & 1) eval(a), res1 += node[a++];\n if(b & 1) eval(--b), res2 += node[b];\n a >>= 1, b >>= 1;\n }\n return res1 + res2;\n }\n void print(){for(int i = 0; i < sz; i++)cout<<query(i,i+1)<< \" \";cout<<endl;}\n};\n\n\n\n\n//iを中心とする最長の回文の半径をR[i]に格納(O(n))\n// abaab を $a$b$a$a$b$ みたいにすると偶数長のもの求めることが可能\nvoid manacher(const string& S,vector<int>& res)\n{\n int sz = (int)S.size(), i = 0, j = 0, k;\n res.resize(sz);\n while(i < sz){\n while(i-j >= 0 && i+j < sz && S[i-j] == S[i+j]) j++;\n res[i] = j, k = 1;\n while(i-k >= 0 && i+k < sz && k+res[i-k] < j){\n res[i+k] = res[i-k], k++;\n }\n i += k; j -= k;\n }\n}\n\n\nint main(){\n STR(s,t);\n string Q;\n rep(i,s.size()){\n Q.push_back('$');\n Q.push_back(s[i]);\n }\n Q.push_back('$');\n Q.push_back('|');\n int T = Q.size();\n rep(i,t.size()){\n Q.push_back('$');\n Q.push_back(t[i]);\n }\n Q.push_back('$');\n vector<int> mana;\n manacher(Q,mana);\n // cerr << mana << endl;\n int n = Q.size();\n \n auto sa = suffix_array(Q);\n auto lcp = lcp_array(Q,sa);\n ll res = 0;\n vector<ll> ppp(30000);\n segtree<ll> segS(ppp);\n segtree<ll> segT(ppp);\n // cerr << Q << endl;\n for(int i=0;i<sa.size();i++){\n int id = sa[i];\n int LCP = inf;\n if(i!=0)chmin(LCP,lcp[i-1]);\n if(Q[id]=='$'){\n int len = LCP/2; \n segS.update(len+1,30000,0);\n segT.update(len+1,30000,0);\n }else{\n int len = (LCP+1)/2;\n segS.update(len+1,30000,0);\n segT.update(len+1,30000,0);\n }\n if(id<T){\n int len = mana[id]/2;\n res += segT.query(1,len+1);\n segS.add(0,len+1,1);\n }else{\n int len = mana[id]/2;\n res += segS.query(1,len+1);\n segT.add(0,len+1,1);\n }\n // cerr << id << endl;\n // cerr << Q.substr(id) << endl;\n // dbg(res);\n }\n cout << res << endl;\n\n \n return 0;\n}","accuracy":0.08333333333333333,"time_ms":160,"memory_kb":9680,"score_of_the_acc":-0.5431,"final_rank":19},{"submission_id":"aoj_2292_7743077","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 <cstring>\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\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\nnamespace ebi {\n\nstruct random_number_generator_64 {\nprivate:\n using u64 = std::uint64_t;\n std::random_device rnd;\n std::mt19937_64 mt;\npublic:\n random_number_generator_64() : mt(rnd()) { }\n\n u64 get(u64 a, u64 b) {\n std::uniform_int_distribution<u64> dist(a, b-1);\n return dist(mt);\n }\n};\n\n}\n\nnamespace ebi {\n\nusing u64 = std::uint64_t;\nconst u64 mod = (1ull << 61) - 1;\nconst u64 MASK31 = (1ull << 31) - 1;\nconst u64 MASK30 = (1ull << 30) - 1;\n\nu64 safe_mul(const u64 &a, const u64 &b) {\n u64 au = a >> 31, ad = a & MASK31;\n u64 bu = b >> 31, bd = b & MASK31;\n u64 mid = ad * bu + au * bd;\n u64 midu = mid >> 30;\n u64 midd = mid & MASK30;\n return (au * bu * 2 + midu + (midd << 31) + ad * bd);\n}\n\nu64 safe_mod(const u64 &a) {\n u64 au = a >> 61;\n u64 ad = a & mod;\n u64 res = au + ad;\n if (res >= mod) res -= mod;\n return res;\n}\n\n} // namespace ebi\n\n/*\n reference: https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\n*/\n\nnamespace ebi {\n\ntemplate <int n>\nstruct rolling_hash {\n private:\n using u64 = std::uint64_t;\n const u64 h = 100;\n const u64 buffer = mod * 4;\n\n public:\n rolling_hash(const std::string &s) : sz(s.size()) {\n assert(int(base.size()) == n && n > 0);\n base_pow.resize(n);\n hash.resize(n);\n for (int i = 0; i < n; ++i) {\n base_pow[i].reserve(sz + 1);\n base_pow[i].emplace_back(1);\n hash[i].reserve(sz + 1);\n hash[i].emplace_back(0);\n for (const auto &c : s) {\n hash[i].emplace_back(\n safe_mod(safe_mul(hash[i].back(), base[i]) + c + h));\n base_pow[i].emplace_back(\n safe_mod(safe_mul(base_pow[i].back(), base[i])));\n }\n }\n }\n\n // [l, r)\n\n std::vector<u64> get_hash(int l, int r) const {\n std::vector<u64> ret(n);\n for (int i = 0; i < n; ++i) {\n ret[i] = safe_mod(hash[i][r] + buffer -\n safe_mul(hash[i][l], base_pow[i][r - l]));\n }\n return ret;\n }\n\n std::vector<u64> get_hash(const std::string &str, int l = 0,\n int r = -1) const {\n if (r < 0) r = int(str.size());\n std::vector<u64> res(n, 0);\n for (int i = 0; i < n; ++i) {\n for (int j = l; j < r; ++j) {\n res[i] = safe_mod(safe_mul(res[i], base[i]) + str[i] + h);\n }\n }\n return res;\n }\n\n static void set_base() {\n random_number_generator_64 rnd;\n base.resize(n);\n for (int i = 0; i < n; ++i) {\n base[i] = rnd.get(0, (1UL << 61) - 1);\n }\n }\n\n private:\n size_t sz;\n std::vector<std::vector<u64>> base_pow;\n std::vector<std::vector<u64>> hash;\n\n public:\n static std::vector<u64> base;\n};\n\ntemplate <int n>\nstd::vector<std::uint64_t> rolling_hash<n>::base{12345, 10000000};\n\n} // namespace ebi\n\nnamespace ebi {\n\nstruct palindromic_tree {\nprivate:\n using i64 = std::int64_t;\n struct Node {\n std::map<char, int> edges;\n int len; // 回文の長さ\n int num = 0;\n int suffix_link = 0;\n std::vector<u64> hash;\n };\npublic:\n palindromic_tree(const std::string &str) : rh(str) {\n tree.resize(2);\n tree[0].len = -1;\n tree[1].len = 0;\n for(auto c: str) {\n add_char(c);\n }\n }\n\n // 末尾に x を追加し、末尾を使った最大の長さを返す。\n int add_char(char x) {\n s.push_back(x);\n int pos = s.size() - 1;\n int now = last_idx;\n while(true) {\n int len = tree[now].len;\n if(0 <= pos - len - 1 && s[pos - len - 1] == x) {\n break;\n }\n now = tree[now].suffix_link;\n }\n if(tree[now].edges.find(x) != tree[now].edges.end()) {\n last_idx = tree[now].edges[x];\n tree[last_idx].num++;\n return tree[last_idx].len;\n }\n last_idx = tree.size();\n tree[now].edges[x] = last_idx;\n Node node;\n node.len = tree[now].len + 2;\n node.num = 1;\n node.hash = rh.get_hash(pos+1-node.len, pos+1);\n if(node.len == 1) {\n node.suffix_link = 1;\n tree.emplace_back(node);\n return node.len;\n }\n while(true) {\n now = tree[now].suffix_link;\n int len = tree[now].len;\n if(0 <= pos - 1 - len && s[pos - 1 - len] == x) break;\n }\n node.suffix_link = tree[now].edges[x];\n tree.emplace_back(node);\n return node.len;\n }\n\n int count_types() {\n return (int)tree.size() - 2;\n }\n\n i64 count_num() {\n if(sum != -1) return sum;\n sum = 0;\n for(int i = tree.size() - 1; i >= 2; i--) {\n int suffix_link = tree[i].suffix_link;\n sum += tree[i].num;\n tree[suffix_link].num += tree[i].num;\n }\n return sum;\n }\n\n std::map<std::vector<u64>, i64> get_map() {\n std::map<std::vector<u64>, i64> map;\n for(int i = tree.size() - 1; i >= 2; i--) {\n int suffix_link = tree[i].suffix_link;\n map[tree[i].hash] = tree[i].num;\n tree[suffix_link].num += tree[i].num;\n }\n return map;\n }\nprivate:\n std::string s;\n std::vector<Node> tree;\n int last_idx = 1;\n i64 sum = -1;\n rolling_hash<2> rh;\n};\n\n}\n\nnamespace ebi {\n\nvoid main_() {\n rolling_hash<2>::set_base();\n std::string s,t;\n std::cin >> s >> t;\n palindromic_tree ptree_s(s), ptree_t(t);\n auto map_s = ptree_s.get_map();\n auto map_t = ptree_t.get_map();\n i64 ans = 0;\n for(auto [hash, cnt] : map_s) {\n ans += map_t[hash] * cnt;\n }\n std::cout << ans << '\\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":60,"memory_kb":41020,"score_of_the_acc":-1.1724,"final_rank":14},{"submission_id":"aoj_2292_7552876","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<typename T = char>\nstruct MultiPalindromicTree{\nprivate:\n struct Node{\n map<T, int> link;\n int link_rev = -1;\n int suffix_link; // same suffix maximum pal\n int len; // palindrome length\n vector<int> cnt; // freq of this\n pair<int, int> idx; // one of the start pos\n\n Node() = default;\n Node(int n, int len): len(len), cnt(n, 0), idx(-1, -1) {}\n\n int succ(const T &c) const {\n auto it = link.find(c);\n if(it == link.end()) return -1;\n return it->second;\n }\n };\n\n // find longest P s.t. c + P + c is pal\n int find_next_pal(int p, int k) const {\n int pos = int(seq[p].size()) - 1;\n while(true){\n int i = pos - 1 - nodes[k].len;\n if(i >= 0 && seq[p][i] == seq[p][pos]) return k;\n k = nodes[k].suffix_link;\n }\n }\n\npublic:\n\n int n;\n vector<Node> nodes;\n vector<vector<T>> seq;\n vector<vector<int>> ston;\n vector<int> suffix_max;\n\n\n MultiPalindromicTree(int n): n(n), seq(n), ston(n), suffix_max(n){\n nodes.emplace_back(n, -1); // odd node\n nodes.emplace_back(n, 0); // even node\n nodes[1].suffix_link = 0;\n }\n\n void add(int i, const T &c){\n seq[i].push_back(c);\n int k = find_next_pal(i, suffix_max[i]);\n\n // c + P + c is already exists\n if(int p = nodes[k].succ(c); p != -1){\n ++nodes[p].cnt[i];\n suffix_max[i] = p;\n ston[i].push_back(p);\n return;\n }\n\n // unique\n nodes[k].link[c] = suffix_max[i] = int(nodes.size());\n ston[i].push_back(suffix_max[i]);\n int len = nodes[k].len + 2;\n nodes.emplace_back(n, len);\n \n nodes.back().cnt[i] = 1;\n nodes.back().idx = {i, int(seq[i].size()) - len};\n nodes.back().link_rev = k;\n\n if(len == 1) nodes.back().suffix_link = 1;\n else nodes.back().suffix_link = \n nodes[find_next_pal(i, nodes[k].suffix_link)].link[c];\n }\n\n template<class Iiter>\n void add(int i, Iiter first, Iiter last){\n for(; first != last; ++first) add(i, *first);\n }\n \n template<class Container>\n void add(int i, const Container &c){\n add(i, begin(c), end(c));\n }\n\n // idx of suffix palindromes of node k\n vector<int> suffix_palindromes(int k) const {\n vector<int> ret;\n for(; nodes[k].len > 0; k = nodes[k].suffix_link){\n ret.push_back(k);\n }\n return ret;\n }\n\n // idx of substring palindromes of node k\n vector<int> substr_palindroms(int k) const {\n vector<int> ret, seen(nodes.size());\n queue<int> qu;\n qu.push(k); seen[k] = 1;\n for(; !qu.empty(); qu.pop()){\n int v = qu.front();\n ret.push_back(v);\n for(int u : {nodes[v].suffix_link, nodes[v].link_rev}){\n if(!seen[u]) qu.push(u), seen[u] = 1;\n }\n }\n return ret;\n }\n\n // not count \"\"\n int count() const { return int(nodes.size()) - 2; }\n\n vector<vector<int>> palindromes_frequency() const {\n int m = int(nodes.size());\n vector<vector<int>> freq(m, vector<int>(n));\n for(int i = m - 1; i >= 1; --i){\n for(int j = 0; j < n; ++j){\n freq[i][j] += nodes[i].cnt[j];\n freq[nodes[i].suffix_link][j] += freq[i][j];\n }\n }\n return freq;\n }\n\n const Node &operator[](int k) const { return nodes[k]; }\n};\n\n\nint main() {\n MultiPalindromicTree mpt(2);\n string s, t; cin >> s >> t;\n mpt.add(0, s);\n mpt.add(1, t);\n\n auto freq = mpt.palindromes_frequency();\n int64_t ans = 0;\n\n for(int i = 0; i < mpt.count(); ++i){\n ans += freq[i + 2][0] * 1ll * freq[i + 2][1];\n }\n\n cout << ans << \"\\n\";\n}","accuracy":1,"time_ms":10,"memory_kb":27892,"score_of_the_acc":-0.5919,"final_rank":8},{"submission_id":"aoj_2292_7539010","code_snippet":"#line 1 \"zzz\\\\a.cpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#line 2 \"string\\\\RollingHash.cpp\"\n\nstruct RollingHash{\n static constexpr uint64_t mod = (1ull << 61) - 1;\n static constexpr uint64_t mask(int k){ return (1ull << k) - 1; }\n static constexpr uint64_t add(uint64_t a, uint64_t b){\n return ((a+=b) >= mod) ? (a - mod) : a;\n }\n static constexpr uint64_t mul(uint64_t a, uint64_t b){\n uint64_t au = a >> 31, ad = a & mask(31);\n uint64_t bu = b >> 31, bd = b & mask(31);\n int64_t mid = ad*bu + au*bd;\n uint64_t mu = mid >> 30, md = mid & mask(30);\n return au*bu*2 + mu + (md << 31) + ad*bd;\n }\n static constexpr uint64_t cal_mod(uint64_t x){\n uint64_t res = (x >> 61) + (x & mask(61));\n return (res>=mod) ? (res-mod) : res;\n }\n\n static inline uint64_t generate_base(){\n mt19937_64 mt(random_device{}());\n uniform_int_distribution<uint64_t> rand(1, mod-1);\n return rand(mt);\n }\n\n inline void expand(size_t n){\n if(size_t pn = pow_table.size(); pn < n+1){\n pow_table.resize(n + 1);\n for(size_t i = pn-1; i < n; ++i){\n pow_table[i+1] = cal_mod(mul(pow_table[i], base));\n }\n }\n }\n\n const uint64_t base;\n vector<uint64_t> pow_table;\n\n RollingHash(uint64_t base = generate_base()): base(base), pow_table(1,1) {}\n\n vector<uint64_t> build(const string &s) const {\n int n = int(s.size());\n vector<uint64_t> res(n + 1);\n for(int i = 0; i < n; ++i) res[i+1] = cal_mod(mul(res[i], base) + s[i]);\n return res;\n }\n\n template<typename T>\n vector<uint64_t> build(const vector<T> &s) const {\n int n = int(s.size());\n vector<uint64_t> res(n + 1);\n for(int i = 0; i < n; ++i) res[i+1] = cal_mod(mul(res[i], base) + s[i]);\n return res;\n }\n\n uint64_t query(const vector<uint64_t> &s, int l = 0, size_t n = string::npos){\n n = min(n, s.size()-1 - l);\n expand(n);\n return cal_mod(s[l+n] + mod*4 - mul(s[l], pow_table[n]));\n }\n\n uint64_t cat(uint64_t hl, uint64_t hr, size_t hr_len){\n expand(hr_len);\n return cal_mod(mul(hl, pow_table[hr_len]) + hr);\n }\n\n int lcp(const vector<uint64_t> &a, int la, int ra, const vector<uint64_t> &b, int lb, int rb){\n int n = min(ra - la, rb - lb);\n int l = 0, r = n+1;\n while(r-l > 1){\n int m = (l+r) >> 1;\n if(query(a, la, m) == query(b, lb, m)) l = m;\n else r = m;\n }\n return l;\n }\n};\n#line 5 \"zzz\\\\a.cpp\"\n\ntemplate<typename T = char>\nstruct PalindromicTree{\nprivate:\n struct Node{\n map<T, int> link;\n int suffix_link; // same suffix maximum pal\n int len; // palindrome length\n int cnt; // number of this\n int idx; // one of the start pos\n\n Node() = default;\n Node(int len, int cnt, int idx = -1): len(len), cnt(cnt), idx(idx) {}\n\n int succ(const T &c) const {\n auto it = link.find(c);\n if(it == link.end()) return -1;\n return it->second;\n }\n };\n\n // find longest P s.t. c + P + c is pal\n int find_next_pal(int k) const {\n int pos = int(seq.size()) - 1;\n while(true){\n int i = pos - 1 - nodes[k].len;\n if(i >= 0 && seq[i] == seq[pos]) return k;\n k = nodes[k].suffix_link;\n }\n }\n\npublic:\n\n vector<Node> nodes;\n vector<T> seq;\n vector<int> ston;\n int suffix_max;\n\n\n PalindromicTree(){\n nodes.emplace_back(-1, 0); // odd node\n nodes.emplace_back(0, 0); // even node\n nodes[1].suffix_link = 0;\n suffix_max = 0;\n }\n template<class Iiter>\n PalindromicTree(Iiter first, Iiter last): PalindromicTree() {\n add(first, last);\n }\n template<class Container>\n PalindromicTree(const Container &c): PalindromicTree() {\n add(c);\n }\n\n void add(const T &c){\n seq.push_back(c);\n int k = find_next_pal(suffix_max);\n\n // c + P + c is already exists\n if(int p = nodes[k].succ(c); p != -1){\n ++nodes[p].cnt;\n suffix_max = p;\n ston.push_back(p);\n return;\n }\n\n // unique\n nodes[k].link[c] = suffix_max = int(nodes.size());\n ston.push_back(suffix_max);\n int len = nodes[k].len + 2;\n nodes.emplace_back(len, 1, int(seq.size()) - len);\n\n if(len == 1) nodes.back().suffix_link = 1;\n else nodes.back().suffix_link = \n nodes[find_next_pal(nodes[k].suffix_link)].link[c];\n }\n\n template<class Iiter>\n void add(Iiter first, Iiter last){\n for(; first != last; ++first) add(*first);\n }\n \n template<class Container>\n void add(const Container &c){\n add(begin(c), end(c));\n }\n\n // seq[i] = node[k].last\n int get_node_idx(int i) const { return ston[i]; }\n\n // length of suffix palindromes of node k\n vector<int> suffix_palindromes(int k) const {\n vector<int> ret;\n for(; nodes[k].len > 0; k = nodes[k].suffix_link){\n ret.push_back(nodes[k].len);\n }\n return ret;\n }\n\n // length of suffix palindromes of seq\n vector<int> suffix_palindromes() const {\n return suffix_palindromes(suffix_max);\n }\n\n // not count \"\"\n int count() const { return int(nodes.size()) - 2; }\n\n vector<int> palindromes_frequency() const {\n int n = int(nodes.size());\n vector<int> freq(n);\n for(int i = n - 1; i >= 1; --i){\n freq[i] += nodes[i].cnt;\n freq[nodes[i].suffix_link] += freq[i];\n }\n return freq;\n }\n};\n\nint main() {\n string s, t; cin >> s >> t;\n PalindromicTree ps(s), pt(t);\n map<uint64_t, int> mp;\n RollingHash rh;\n auto hs = rh.build(s);\n auto ht = rh.build(t);\n auto fs = ps.palindromes_frequency();\n auto ft = pt.palindromes_frequency();\n\n for(int i = 0; i < ps.count(); ++i){\n int p = ps.nodes[i + 2].idx;\n int l = ps.nodes[i + 2].len;\n int c = fs[i + 2];\n mp[rh.query(hs, p, l)] += c;\n }\n int64_t ans = 0;\n\n for(int i = 0; i < pt.count(); ++i){\n int p = pt.nodes[i + 2].idx;\n int l = pt.nodes[i + 2].len;\n int64_t c = ft[i + 2];\n ans += mp[rh.query(ht, p, l)] * c;\n }\n\n cout << ans << \"\\n\";\n}","accuracy":1,"time_ms":30,"memory_kb":24020,"score_of_the_acc":-0.5406,"final_rank":6},{"submission_id":"aoj_2292_7135211","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, x) for(int i = 0; i < (x); i++)\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\nusing vi = vector<int>;\n#define sz(x) (int)(x).size()\n\narray<vi, 2> manacher(string &s) {\n\tint n = sz(s);\n\tarray<vi, 2> p = {vi(n + 1), vi(n)};\n\trep(z, 2) for(int i = 0, l = 0, r = 0; i < n; i++) {\n\t\tint t = r - i + !z;\n\t\tif(i < r) p[z][i] = min(t, p[z][l + t]);\n\t\tint L = i - p[z][i], R = i + p[z][i] - !z;\n\t\twhile(L >= 1 and R + 1 < n and s[L - 1] == s[R + 1])\n\t\t\tp[z][i]++, L--, R++;\n\t\tif(R > r) l = L, r = R;\n\t}\n\treturn p;\n}\n\n\ntypedef uint64_t ull;\nstruct H {\n\tull x;\n\tH(ull x = 0) : x(x) {}\n\tH operator+(H o) { return x + o.x + (x + o.x < x); }\n\tH operator-(H o) { return *this + ~o.x; }\n\tH operator*(H o) {\n\t\tauto m = (__uint128_t)x * o.x;\n\t\treturn H((ull)m) + (ull)(m >> 64);\n\t}\n\tull get() const { return x + !~x; }\n\tbool operator==(H o) const { return get() == o.get(); }\n\tbool operator<(H o) const { return get() < o.get(); }\n};\n\nstatic const H C = (ll)1e11 + 3;\n\nstruct hash_interval {\n\tvector<H> ha, pw;\n\thash_interval(string &str) : ha(sz(str) + 1), pw(ha) {\n\t\tpw[0] = 1;\n\t\trep(i, sz(str))\n\t\t ha[i + 1] = ha[i] * C + str[i],\n\t\t pw[i + 1] = pw[i] * C;\n\t}\n\tH get(int a, int b) { return ha[b] - ha[a] * pw[b - a]; }\n};\n\nmap<ull, ll> palindromes_freq(string &s) {\n\tauto sm = manacher(s);\n\thash_interval sh(s);\n\tset<ull> st;\n\tmap<ull, ull> es;\n\tvector<set<ull>> nodes(sz(s) + 1);\n\tmap<ull, ll> cum;\n\trep(i, sz(s) + 1) {\n\t\tif(sm[0][i]) {\n\t\t\tint len = sm[0][i];\n\t\t\tauto ha = sh.get(i - len, i + len);\n\t\t\tcum[ha.get()]++;\n\t\t\tnodes[len * 2].insert(ha.get());\n\t\t\twhile(len > 1) {\n\t\t\t\tlen--;\n\t\t\t\tauto nx = sh.get(i - len, i + len);\n\t\t\t\tif(es.count({ha.get()})) break;\n\t\t\t\tes[ha.get()] = nx.get();\n\t\t\t\tha = nx;\n\t\t\t\tnodes[len * 2].insert(ha.get());\n\t\t\t}\n\t\t}\n\t}\n\n\trep(i, sz(s)) {\n\t\tsm[1][i]++;\n\t\tint len = sm[1][i];\n\t\tauto ha = sh.get(i - len + 1, i + len);\n\t\tcum[ha.get()]++;\n\t\tnodes[len * 2 - 1].insert(ha.get());\n\t\twhile(len > 1) {\n\t\t\tlen--;\n\t\t\tauto nx = sh.get(i - len + 1, i + len);\n\t\t\tif(es.count({ha.get()})) break;\n\t\t\tes[ha.get()] = nx.get();\n\t\t\tha = nx;\n\t\t\tnodes[len * 2 - 1].insert(ha.get());\n\t\t}\n\t}\n\n\tfor(int i = sz(s); i >= 0; --i) {\n\t\tfor(auto &v : nodes[i]) {\n\t\t\tif(es.count(v)) {\n\t\t\t\tcum[es[v]] += cum[v];\n\t\t\t}\n\t\t}\n\t}\n\treturn cum;\n}\n\nint main() {\n\tstring s, t;\n\tcin >> s >> t;\n\tauto s_freq = palindromes_freq(s);\n\tauto t_freq = palindromes_freq(t);\n\tll res = 0;\n\tfor(auto [key, cnt] : s_freq) res += cnt * t_freq[key];\n\tcout << res << endl;\n}","accuracy":1,"time_ms":160,"memory_kb":18904,"score_of_the_acc":-0.8298,"final_rank":11},{"submission_id":"aoj_2292_7135210","code_snippet":"#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, x) for(int i = 0; i < (x); i++)\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\nusing vi = vector<int>;\n#define sz(x) (int)(x).size()\n\narray<vi, 2> manacher(string &s) {\n\tint n = sz(s);\n\tarray<vi, 2> p = {vi(n + 1), vi(n)};\n\trep(z, 2) for(int i = 0, l = 0, r = 0; i < n; i++) {\n\t\tint t = r - i + !z;\n\t\tif(i < r) p[z][i] = min(t, p[z][l + t]);\n\t\tint L = i - p[z][i], R = i + p[z][i] - !z;\n\t\twhile(L >= 1 and R + 1 < n and s[L - 1] == s[R + 1])\n\t\t\tp[z][i]++, L--, R++;\n\t\tif(R > r) l = L, r = R;\n\t}\n\treturn p;\n}\n\n\ntypedef uint64_t ull;\nstruct H {\n\tull x;\n\tH(ull x = 0) : x(x) {}\n\tH operator+(H o) { return x + o.x + (x + o.x < x); }\n\tH operator-(H o) { return *this + ~o.x; }\n\tH operator*(H o) {\n\t\tauto m = (__uint128_t)x * o.x;\n\t\treturn H((ull)m) + (ull)(m >> 64);\n\t}\n\tull get() const { return x + !~x; }\n\tbool operator==(H o) const { return get() == o.get(); }\n\tbool operator<(H o) const { return get() < o.get(); }\n};\n\nstatic const H C = (ll)1e11 + 3;\n\nstruct hash_interval {\n\tvector<H> ha, pw;\n\thash_interval(string &str) : ha(sz(str) + 1), pw(ha) {\n\t\tpw[0] = 1;\n\t\trep(i, sz(str))\n\t\t ha[i + 1] = ha[i] * C + str[i],\n\t\t pw[i + 1] = pw[i] * C;\n\t}\n\tH get(int a, int b) { return ha[b] - ha[a] * pw[b - a]; }\n};\n\nmap<ull, ll> palindromes_freq(string &s) {\n\tauto sm = manacher(s);\n\thash_interval sh(s);\n\tset<ull> st;\n\tmap<ull, ull> es;\n\tvector<set<ull>> nodes(sz(s) + 1);\n\tmap<ull, ll> cum;\n\trep(i, sz(s) + 1) {\n\t\tif(sm[0][i]) {\n\t\t\tint len = sm[0][i];\n\t\t\tauto ha = sh.get(i - len, i + len);\n\t\t\tcum[ha.get()]++;\n\t\t\tnodes[len * 2].insert(ha.get());\n\t\t\twhile(len > 1) {\n\t\t\t\tlen--;\n\t\t\t\tauto nx = sh.get(i - len, i + len);\n\t\t\t\tif(es.count({ha.get()})) break;\n\t\t\t\tes[ha.get()] = nx.get();\n\t\t\t\tha = nx;\n\t\t\t\tnodes[len * 2].insert(ha.get());\n\t\t\t}\n\t\t}\n\t}\n\n\trep(i, sz(s)) {\n\t\tsm[1][i]++;\n\t\tint len = sm[1][i];\n\t\tauto ha = sh.get(i - len + 1, i + len);\n\t\tcum[ha.get()]++;\n\t\tnodes[len * 2 - 1].insert(ha.get());\n\t\twhile(len > 1) {\n\t\t\tlen--;\n\t\t\tauto nx = sh.get(i - len + 1, i + len);\n\t\t\tif(es.count({ha.get()})) break;\n\t\t\tes[ha.get()] = nx.get();\n\t\t\tha = nx;\n\t\t\tnodes[len * 2 - 1].insert(ha.get());\n\t\t}\n\t}\n\n\tfor(int i = sz(s); i >= 0; --i) {\n\t\tfor(auto &v : nodes[i]) {\n\t\t\tif(es.count(v)) {\n\t\t\t\tcum[es[v]] += cum[v];\n\t\t\t}\n\t\t}\n\t}\n\treturn cum;\n}\n\nint main() {\n\tstring s, t;\n\tcin >> s >> t;\n\tauto s_freq = palindromes_freq(s);\n\tauto t_freq = palindromes_freq(t);\n\tll res = 0;\n\tfor(auto [key, cnt] : s_freq) res += cnt * t_freq[key];\n\tcout << res << endl;\n}","accuracy":1,"time_ms":180,"memory_kb":20084,"score_of_the_acc":-0.9355,"final_rank":12},{"submission_id":"aoj_2292_7124559","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 mod1=998244353,mod2=1000000007,MAX=300005,INF=1<<30;\n\n// Manacher https://snuke.hatenablog.com/entry/2014/12/02/235837\n\nvector<int> Manacher(string S){\n vector<int> R(si(S));\n int i = 0, j = 0;\n while (i < S.size()) {\n while (i-j >= 0 && i+j < S.size() && S[i-j] == S[i+j]) ++j;\n R[i] = j;\n int k = 1;\n while (i-k >= 0 && k+R[i-k] < j) R[i+k] = R[i-k], ++k;\n i += k; j -= k;\n }\n return R;\n}\n// 偶数長のも求めるために$を入れる必要がある\n\n//ロリハ\n\nstruct Rollinghash{\n string S;\n int n;\n int base1;\n int base2;\n vector<ll> h1,h2,ru1,ru2;\n \n void make(string &T,int ba1,int ba2){\n S=T;\n n=S.size();\n h1.assign(n+1,0);\n h2.assign(n+1,0);\n ru1.assign(n+1,0);\n ru2.assign(n+1,0);\n base1=ba1;\n base2=ba2;\n \n ru1[0]=1;\n ru2[0]=1;\n \n for(int i=1;i<=n;i++){\n h1[i]=h1[i-1]*base1+ll(S[i-1]-'$'+1);\n h1[i]%=mod1;\n \n h2[i]=h2[i-1]*base2+ll(S[i-1]-'$'+1);\n h2[i]%=mod2;\n \n ru1[i]=ru1[i-1]*base1%mod1;\n ru2[i]=ru2[i-1]*base2%mod2;\n }\n }\n \n pair<ll,ll> ha(int l,int r){\n pair<ll,ll> res;\n res.fi=(h1[r]-h1[l]*ru1[r-l]%mod1+mod1)%mod1;\n res.se=(h2[r]-h2[l]*ru2[r-l]%mod2+mod2)%mod2;\n \n return res;\n }//開区間\n};\n\n//強連結成分分解\n\nint V,cmp[MAX];\nvector<int> G[MAX],rG[MAX],vs;//vsがトポソの逆順になってる\nbool used[MAX];\n\nint get_id(int i,bool f){\n return 2*i+f;\n}\n\nvoid add_edge(int from,int to){\n G[from].push_back(to);\n rG[to].push_back(from);\n}\n\nvoid either(int i,bool f,int j,bool g){\n add_edge(get_id(i,!f),get_id(j,g));\n add_edge(get_id(j,!g),get_id(i,f));\n //add_edge(2*i+(!f),2*j+g);\n //add_edge(2*j+(!g),2*i+f);\n}\n\nvoid imply(int i,bool f,int j,bool g){\n either(i,!f,j,g);\n}\n//iがfならばjがg\n\nvoid must(int i,bool f){\n either(i,f,i,f);\n}\n\nvoid DFS(int v){\n used[v]=1;\n for(int i=0;i<G[v].size();i++){\n if(used[G[v][i]]==0) DFS(G[v][i]);\n }\n vs.push_back(v);\n}\n\nvoid rDFS(int v,int k){\n used[v]=1;\n cmp[v]=k;\n for(int i=0;i<rG[v].size();i++){\n if(used[rG[v][i]]==0) rDFS(rG[v][i],k);\n }\n}\n\nint scc(){\n memset(used,0,sizeof(used));\n vs.clear();\n for(int v=0;v<V;v++){\n if(used[v]==0) DFS(v);\n }\n \n memset(used,0,sizeof(used));\n int k=0;\n for(int i=vs.size()-1;i>=0;i--){\n if(used[vs[i]]==0) rDFS(vs[i],k++);\n }\n return k;\n}\n\nll dp[MAX];\n\nvoid init(int sz){\n V=sz;\n for(int i=0;i<V;i++){\n dp[i]=0;\n cmp[i]=0;\n G[i].clear();\n rG[i].clear();\n used[i]=false;\n }\n vs.clear();\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 string S,T;cin>>S>>T;\n string SS,TT;\n SS+='$';TT+='$';\n for(char c:S){\n SS+=c;\n SS+='$';\n }\n for(char c:T){\n TT+=c;\n TT+='$';\n }\n S=SS;\n T=TT;\n \n ll ha1=103,ha2=109;\n \n map<pair<ll,ll>,ll> MA1,MA2;\n \n for(int q=0;q<2;q++){\n map<pair<ll,ll>,ll> dic;\n Rollinghash ro;\n ro.make(S,ha1,ha2);\n init(MAX);\n \n auto mana=Manacher(S);\n \n for(int i=0;i<si(S);i++){\n int s=(i-mana[i]+1);\n if(s%2==0) s++;\n pair<ll,ll> la=mp(-1,-1);\n for(int l=s;l<=i;l+=2){\n int r=i+(i-l)+1;\n auto re=ro.ha(l,r);\n if(dic.count(re)){\n if(l==s) dp[dic[re]]++;\n else{\n add_edge(dic[la],dic[re]);\n }\n break;\n }else{\n int sz=si(dic);\n dic[re]=sz;\n if(l==s) dp[sz]++;\n else{\n add_edge(dic[la],dic[re]);\n }\n la=re;\n }\n }\n }\n \n V=si(dic);\n \n scc();\n \n reverse(all(vs));\n \n for(int a:vs){\n for(int to:G[a]){\n dp[to]+=dp[a];\n }\n }\n \n for(auto a:dic){\n MA1[a.fi]+=dp[a.se];\n }\n \n swap(S,T);\n swap(MA1,MA2);\n }\n \n ll ans=0;\n \n for(auto a:MA1){\n if(MA2.count(a.fi)) ans+=a.se*MA2[a.fi];\n }\n \n cout<<ans<<endl;\n}","accuracy":1,"time_ms":110,"memory_kb":38324,"score_of_the_acc":-1.261,"final_rank":15},{"submission_id":"aoj_2292_6934508","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\n#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int, int>;\nusing PL = pair<long long, long long>;\nusing pdd = pair<long double, long double>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\nusing ppi = pair<P,int>;\nusing pip = pair<int,P>;\nconst int INF = 1001001007;\nconst long long mod1 = 1000000007LL;\nconst long long mod2 = 998244353LL;\nconst ll inf = 2e18;\nconst ld pi = 3.14159265358979323;\nconst ld eps = 1e-7;\ntemplate<typename T>void o(T a);\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\ntemplate<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\ntemplate<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}\nvoid revs(string &s) {reverse(s.begin(),s.end());}\ntemplate<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\ntemplate<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}\ntemplate<typename T>T cel(T a,T b){return (a+b-1)/b;}\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\ntemplate<typename T>void print(vector<T> v);\ntemplate<typename T>void print(vector<vector<T>> v);\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", 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(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) 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; }\nvoid o(){cout<<\"!?\"<<endl;}\ntemplate<typename T>void o(T a){cout<<a<<endl;}\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\nvoid yes(){out(\"Yes\");}\nvoid no (){out(\"No\");}\nvoid yn (bool t){if(t)yes();else no();}\ntemplate<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\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;}\nll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}\n\n\nvector<int> manacher(string &s){\n int n = s.size();\n vector<int> ans(n,0);\n int i = 0, len = 0;\n while (i < n){\n while (i - len >= 0 && i + len < n && s[i-len] == s[i+len]) len++;\n ans[i] = len;\n int k = 1;\n while (i - k >= 0 && k + ans[i-k] < len) ans[i+k] = ans[i-k], k++;\n i += k, len -= k;\n }\n return ans;\n}\n\nvector<int> palindrome_length(string s){\n string t = \"$\";\n for (char c : s) t += c, t += '$';\n vector<int> a = manacher(t);\n vector<int> ans(a.size()-2);\n rep(i,a.size()-2) ans[i] = a[i+1]-1;\n return ans;\n}\n\n#include<random>\nstruct RollingHash {\n using ull = unsigned long long;\n RollingHash(const string &s = \"\"){ build(s);}\n ull get(int l, int r){ return cal_mod(inner_hush[r] + POSITIVISER - mul_mod(inner_hush[l], pow_base[r-l]));}\n private:\n static constexpr ull MASK30 = (1UL << 30) - 1;\n static constexpr ull MASK31 = (1UL << 31) - 1;\n static constexpr ull MASK61 = (1UL << 61) - 1;\n static constexpr ull MOD = (1UL << 61) - 1;\n static constexpr ull POSITIVISER = MOD * 4;\n string str;\n int n;\n static ull BASE;\n static vector<ull> pow_base;\n static ull mul_mod(ull a, ull b){\n ull au = a >> 31, ad = a & MASK31;\n ull bu = b >> 31, bd = b & MASK31;\n ull mid = ad * bu + au * bd;\n ull midu = mid >> 30, midd = mid & MASK30;\n return (au * bu * 2 + midu + (midd << 31) + ad * bd);\n }\n static ull cal_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 vector<ull> inner_hush;\n void build(const string &s){\n if (BASE == 0) BASE = (1UL<<31) + (random_device()() & MASK31);\n str = s;\n n = s.size();\n int nlen = pow_base.size();\n if (nlen < n+1){\n pow_base.resize(n+1);\n for (int i = nlen; i <= n; i++){\n pow_base[i] = cal_mod(mul_mod(pow_base[i-1],BASE));\n }\n }\n inner_hush.resize(n+1);\n inner_hush[0] = 0;\n for (int i = 0; i < n; i++) inner_hush[i+1] = cal_mod(mul_mod(inner_hush[i],BASE) + s[i]);\n }\n};\nusing ull = unsigned long long;\null RollingHash::BASE = 0;\nvector<ull> RollingHash::pow_base = vector<ull>(1,1);\nusing roriha = RollingHash;\n\nvoid solve(){\n string s, t; cin >> s >> t;\n int n = s.size(), m = t.size();\n auto nma = palindrome_length(s);\n auto mma = palindrome_length(t);\n roriha a(s), b(t);\n map<ull,ll> nmp, mmp;\n priority_queue<pip> pque;\n rep(i,nma.size()){\n if (i % 2 == 0){\n int ce = i / 2;\n int le = ce - (nma[i]-1)/2;\n int ri = ce + (nma[i]-1)/2; \n ull hs = a.get(le,ri+1);\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = 1;\n pque.push(pip(nma[i],P(le,ri)));\n }\n else nmp[hs]++;\n }\n else {\n if (nma[i] == 0) continue;\n int le = (i - 1 - (nma[i] / 2 - 1) * 2) / 2;\n int ri = (i + 1 + (nma[i] / 2 - 1) * 2) / 2;\n ull hs = a.get(le,ri+1);\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = 1;\n pque.push(pip(nma[i],P(le,ri)));\n }\n else nmp[hs]++;\n }\n }\n while (!pque.empty()){\n auto p = pque.top(); pque.pop();\n if (p.first <= 2) continue;\n int le = p.second.first, ri = p.second.second;\n ull ihs = a.get(le,ri+1);\n le++, ri--;\n ull hs = a.get(le,ri+1);\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = nmp[ihs];\n pque.push(pip(p.first-2,P(le,ri)));\n }\n else nmp[hs] += nmp[ihs];\n }\n rep(i,mma.size()){\n if (i % 2 == 0){\n int ce = i / 2;\n int le = ce - (mma[i]-1)/2;\n int ri = ce + (mma[i]-1)/2;\n ull hs = b.get(le,ri+1);\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = 1;\n pque.push(pip(mma[i],P(le,ri)));\n }\n else mmp[hs]++;\n }\n else {\n if (mma[i] == 0) continue;\n int le = (i - 1 - (mma[i] / 2 - 1) * 2) / 2;\n int ri = (i + 1 + (mma[i] / 2 - 1) * 2) / 2;\n ull hs = b.get(le,ri+1);\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = 1;\n pque.push(pip(mma[i],P(le,ri)));\n }\n else mmp[hs]++;\n }\n }\n while (!pque.empty()){\n auto p = pque.top(); pque.pop();\n if (p.first <= 2) continue;\n int le = p.second.first, ri = p.second.second;\n ull ihs = b.get(le,ri+1);\n le++, ri--;\n ull hs = b.get(le,ri+1);\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = mmp[ihs];\n pque.push(pip(p.first-2,P(le,ri)));\n }\n else mmp[hs] += mmp[ihs];\n }\n ll ans = 0;\n for (auto p : nmp){\n if (mmp.find(p.first) == mmp.end()) continue;\n ans += p.second * mmp[p.first];\n }\n out(ans);\n}\n\nint main(){\n int t = 1; //cin >> t;\n while (t--) solve();\n}","accuracy":1,"time_ms":80,"memory_kb":12176,"score_of_the_acc":-0.3448,"final_rank":3},{"submission_id":"aoj_2292_6933363","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\n#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int, int>;\nusing PL = pair<long long, long long>;\nusing pdd = pair<long double, long double>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\nusing ppi = pair<P,int>;\nusing pip = pair<int,P>;\nconst int INF = 1001001007;\nconst long long mod1 = 1000000007LL;\nconst long long mod2 = 998244353LL;\nconst ll inf = 2e18;\nconst ld pi = 3.14159265358979323;\nconst ld eps = 1e-7;\ntemplate<typename T>void o(T a);\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\ntemplate<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\ntemplate<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}\nvoid revs(string &s) {reverse(s.begin(),s.end());}\ntemplate<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\ntemplate<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}\ntemplate<typename T>T cel(T a,T b){return (a+b-1)/b;}\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\ntemplate<typename T>void print(vector<T> v);\ntemplate<typename T>void print(vector<vector<T>> v);\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", 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(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) 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; }\nvoid o(){cout<<\"!?\"<<endl;}\ntemplate<typename T>void o(T a){cout<<a<<endl;}\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\nvoid yes(){out(\"Yes\");}\nvoid no (){out(\"No\");}\nvoid yn (bool t){if(t)yes();else no();}\ntemplate<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\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;}\nll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}\n\n\nvector<int> manacher(string &s){\n int n = s.size();\n vector<int> ans(n,0);\n int i = 0, len = 0;\n while (i < n){\n while (i - len >= 0 && i + len < n && s[i-len] == s[i+len]) len++;\n ans[i] = len;\n int k = 1;\n while (i - k >= 0 && k + ans[i-k] < len) ans[i+k] = ans[i-k], k++;\n i += k, len -= k;\n }\n return ans;\n}\n\nvector<int> palindrome_length(string s){\n string t = \"$\";\n for (char c : s) t += c, t += '$';\n vector<int> a = manacher(t);\n vector<int> ans(a.size()-2);\n rep(i,a.size()-2) ans[i] = a[i+1]-1;\n return ans;\n}\n//using ulong = unsigned long long;\nconst ulong MASK30 = (1UL << 30) - 1;\nconst ulong MASK31 = (1UL << 31) - 1;\nconst ulong MOD = (1UL << 61) - 1;\nconst ulong MASK61 = MOD;\nulong CalcMod(ulong x);\n\n//a*b mod 2^61-1を返す関数(最後にModを取る)\nulong Mul(ulong a, ulong b)\n{\n ulong au = a >> 31;\n ulong ad = a & MASK31;\n ulong bu = b >> 31;\n ulong bd = b & MASK31;\n ulong mid = ad * bu + au * bd;\n ulong midu = mid >> 30;\n ulong midd = mid & MASK30;\n return (au * bu * 2 + midu + (midd << 31) + ad * bd);\n}\n\n//mod 2^61-1を計算する関数\nulong CalcMod(ulong x)\n{\n ulong xu = x >> 61;\n ulong xd = x & MASK61;\n ulong res = xu + xd;\n if (res >= MOD) res -= MOD;\n return res;\n}\n\nconst ulong Base = 294576;\nvector<ulong> bs;\n\nvoid solve(){\n string s, t; cin >> s >> t;\n int n = s.size(), m = t.size();\n //bs.resize(100000,1);\n //rep(i,100000-1) bs[i+1] = Mul(bs[i],base);\n //vector<ulong> nrui(n+1,0), mrui(m+1,0);\n vector<ulong> powMemo(100000,1);\n rep(i,100000-1) powMemo[i+1] = CalcMod(Mul(powMemo[i],Base));\n vector<ulong> hash1(n+1,0); //要素数n+1の配列を初期化\n for (int i = 0; i < n; i++) hash1[i + 1] = CalcMod(Mul(hash1[i], Base) + s[i]);\n vector<ulong> hash2(m+1,0); //要素数n+1の配列を初期化\n for (int i = 0; i < m; i++) hash2[i + 1] = CalcMod(Mul(hash2[i], Base) + t[i]);\n //rep(i,n) nrui[i+1] = CalcMod(nrui[i] + Mul(ulong(s[i] - 'a' + 1), bs[i]));\n //rep(i,m) mrui[i+1] = CalcMod(mrui[i] + Mul(ulong(t[i] - 'a' + 1), bs[i]));\n const ulong POSITIVIZER = MOD * 4;\n auto nget = [&](int l, int r){\n //return Mul(CalcMod(nrui[r] - nrui[l] + MOD),bs[100000-1-r]);\n return CalcMod(hash1[r] + POSITIVIZER - Mul(hash1[l], powMemo[r - l]));\n };\n auto mget = [&](int l, int r){\n //return Mul(CalcMod(nrui[r] - nrui[l] + MOD),bs[100000-1-r]);\n return CalcMod(hash2[r] + POSITIVIZER - Mul(hash2[l], powMemo[r - l]));\n };\n auto nma = palindrome_length(s);\n auto mma = palindrome_length(t);\n map<ulong,ll> nmp, mmp;\n priority_queue<pip> pque;\n rep(i,nma.size()){\n if (i % 2 == 0){\n int ce = i / 2;\n int le = ce - (nma[i]-1)/2;\n int ri = ce + (nma[i]-1)/2; \n ulong hs = nget(le,ri+1);\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = 1; //out(le,ri,hs);\n pque.push(pip(nma[i],P(le,ri)));\n }\n else nmp[hs]++;\n }\n else {\n if (nma[i] == 0) continue;\n int le = (i - 1 - (nma[i] / 2 - 1) * 2) / 2;\n int ri = (i + 1 + (nma[i] / 2 - 1) * 2) / 2;\n ulong hs = nget(le,ri+1);\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = 1;\n pque.push(pip(nma[i],P(le,ri)));\n }\n else nmp[hs]++;\n }\n }\n while (!pque.empty()){\n auto p = pque.top(); pque.pop();\n if (p.first <= 2) continue;\n int le = p.second.first, ri = p.second.second;\n ulong ihs = nget(le,ri+1);\n le++, ri--;\n ulong hs = nget(le,ri+1);\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = nmp[ihs]; //out(le,ri,hs);\n pque.push(pip(p.first-2,P(le,ri)));\n }\n else nmp[hs] += nmp[ihs];\n }\n rep(i,mma.size()){\n if (i % 2 == 0){\n int ce = i / 2;\n int le = ce - (mma[i]-1)/2;\n int ri = ce + (mma[i]-1)/2;\n ulong hs = mget(le,ri+1);\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = 1; //out(le,ri,hs);\n pque.push(pip(mma[i],P(le,ri)));\n }\n else mmp[hs]++;\n }\n else {\n if (mma[i] == 0) continue;\n int le = (i - 1 - (mma[i] / 2 - 1) * 2) / 2;\n int ri = (i + 1 + (mma[i] / 2 - 1) * 2) / 2;\n ulong hs = mget(le,ri+1);\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = 1;\n pque.push(pip(mma[i],P(le,ri)));\n }\n else mmp[hs]++;\n }\n }\n while (!pque.empty()){\n auto p = pque.top(); pque.pop();\n if (p.first <= 2) continue;\n int le = p.second.first, ri = p.second.second;\n ulong ihs = mget(le,ri+1);\n le++, ri--;\n ulong hs = mget(le,ri+1);\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = mmp[ihs];//out(le,ri,hs);\n pque.push(pip(p.first-2,P(le,ri)));\n }\n else mmp[hs] += mmp[ihs];\n }\n ll ans = 0;\n for (auto p : nmp){ //out(p.first,p.second);\n if (mmp.find(p.first) == mmp.end()) continue;\n ans += p.second * mmp[p.first]; //out(p.second,mmp[p.first]);\n }\n for (auto q : mmp){\n //out(q.first, q.second);\n }\n out(ans);\n}\n\nint main(){\n int t = 1; //cin >> t;\n while (t--) solve();\n}","accuracy":1,"time_ms":80,"memory_kb":12320,"score_of_the_acc":-0.3493,"final_rank":4},{"submission_id":"aoj_2292_6933350","code_snippet":"#line 1 \"aoj.cpp\"\n#include<bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\n#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int, int>;\nusing PL = pair<long long, long long>;\nusing pdd = pair<long double, long double>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\nusing ppi = pair<P,int>;\nusing pip = pair<int,P>;\nconst int INF = 1001001007;\nconst long long mod1 = 1000000007LL;\nconst long long mod2 = 998244353LL;\nconst ll inf = 2e18;\nconst ld pi = 3.14159265358979323;\nconst ld eps = 1e-7;\ntemplate<typename T>void o(T a);\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\ntemplate<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\ntemplate<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}\nvoid revs(string &s) {reverse(s.begin(),s.end());}\ntemplate<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\ntemplate<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}\ntemplate<typename T>T cel(T a,T b){return (a+b-1)/b;}\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\ntemplate<typename T>void print(vector<T> v);\ntemplate<typename T>void print(vector<vector<T>> v);\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", 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(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) 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; }\nvoid o(){cout<<\"!?\"<<endl;}\ntemplate<typename T>void o(T a){cout<<a<<endl;}\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\nvoid yes(){out(\"Yes\");}\nvoid no (){out(\"No\");}\nvoid yn (bool t){if(t)yes();else no();}\ntemplate<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\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;}\nll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}\n\n\nvector<int> manacher(string &s){\n int n = s.size();\n vector<int> ans(n,0);\n int i = 0, len = 0;\n while (i < n){\n while (i - len >= 0 && i + len < n && s[i-len] == s[i+len]) len++;\n ans[i] = len;\n int k = 1;\n while (i - k >= 0 && k + ans[i-k] < len) ans[i+k] = ans[i-k], k++;\n i += k, len -= k;\n }\n return ans;\n}\n\nvector<int> palindrome_length(string s){\n string t = \"$\";\n for (char c : s) t += c, t += '$';\n vector<int> a = manacher(t);\n vector<int> ans(a.size()-2);\n rep(i,a.size()-2) ans[i] = a[i+1]-1;\n return ans;\n}\n\n#line 2 \"modint.hpp\"\n// for prime m\ntemplate <long long m>\nstruct static_modint {\n using mint = static_modint;\n \n public:\n static constexpr int mod() { return m; }\n static_modint() : _v(0) {}\n template <class T>\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 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 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 assert(_v);\n return pow(umod() - 2);\n }\n\n mint inverse() const {return inv();}\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 friend std::ostream &operator<<(std::ostream &os,const mint&p) {\n return os<<p.val();\n }\n friend std::istream &operator>>(std::istream &is, mint &a) {\n long long t;\n is>>t;\n a=mint(t);\n return (is);\n }\n \n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n};\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\n#line 95 \"aoj.cpp\"\nusing mint = modint998244353;\nconst mint base = 249134723;\nvector<mint> bs;\nvector<mint> ibs;\n\nvoid solve(){\n string s, t; cin >> s >> t;\n int n = s.size(), m = t.size();\n bs.resize(100000,1), ibs.resize(100000,1);\n rep(i,100000-1) bs[i+1] = bs[i] * base;\n ibs[100000-1] = bs[100000-1].inv();\n repb(i,100000-1) ibs[i] = ibs[i+1] * base;\n vector<mint> nrui(n+1,0), mrui(m+1,0);\n rep(i,n) nrui[i+1] = nrui[i] + mint(ll(s[i] - 'a' + 1)) * bs[i];\n rep(i,m) mrui[i+1] = mrui[i] + mint(ll(t[i] - 'a' + 1)) * bs[i];\n auto nget = [&](int l, int r){\n return (nrui[r] - nrui[l]) * ibs[l];\n };\n auto mget = [&](int l, int r){\n return (mrui[r] - mrui[l]) * ibs[l];\n };\n auto nma = palindrome_length(s);\n auto mma = palindrome_length(t);\n map<ll,ll> nmp, mmp;\n priority_queue<pip> pque;\n rep(i,nma.size()){\n if (i % 2 == 0){\n int ce = i / 2;\n int le = ce - (nma[i]-1)/2;\n int ri = ce + (nma[i]-1)/2; \n mint mhs = nget(le,ri+1);\n ll hs = mhs.val();\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = 1; //out(le,ri,hs);\n pque.push(pip(nma[i],P(le,ri)));\n }\n else nmp[hs]++;\n }\n else {\n if (nma[i] == 0) continue;\n int le = (i - 1 - (nma[i] / 2 - 1) * 2) / 2;\n int ri = (i + 1 + (nma[i] / 2 - 1) * 2) / 2;\n mint mhs = nget(le,ri+1);\n ll hs = mhs.val();\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = 1;\n pque.push(pip(nma[i],P(le,ri)));\n }\n else nmp[hs]++;\n }\n }\n while (!pque.empty()){\n auto p = pque.top(); pque.pop();\n if (p.first <= 2) continue;\n int le = p.second.first, ri = p.second.second;\n mint imhs = nget(le,ri+1);\n ll ihs = imhs.val();\n le++, ri--;\n mint mhs = nget(le,ri+1);\n ll hs = mhs.val();\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = nmp[ihs]; //out(le,ri,hs);\n pque.push(pip(p.first-2,P(le,ri)));\n }\n else nmp[hs] += nmp[ihs];\n }\n rep(i,mma.size()){\n if (i % 2 == 0){\n int ce = i / 2;\n int le = ce - (mma[i]-1)/2;\n int ri = ce + (mma[i]-1)/2;\n mint mhs = mget(le,ri+1);\n ll hs = mhs.val();\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = 1; //out(le,ri,hs);\n pque.push(pip(mma[i],P(le,ri)));\n }\n else mmp[hs]++;\n }\n else {\n if (mma[i] == 0) continue;\n int le = (i - 1 - (mma[i] / 2 - 1) * 2) / 2;\n int ri = (i + 1 + (mma[i] / 2 - 1) * 2) / 2;\n mint mhs = mget(le,ri+1);\n ll hs = mhs.val();\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = 1;\n pque.push(pip(mma[i],P(le,ri)));\n }\n else mmp[hs]++;\n }\n }\n while (!pque.empty()){\n auto p = pque.top(); pque.pop();\n if (p.first <= 2) continue;\n int le = p.second.first, ri = p.second.second;\n mint imhs = mget(le,ri+1);\n ll ihs = imhs.val();\n le++, ri--;\n mint mhs = mget(le,ri+1);\n ll hs = mhs.val();\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = mmp[ihs];//out(le,ri,hs);\n pque.push(pip(p.first-2,P(le,ri)));\n }\n else mmp[hs] += mmp[ihs];\n }\n ll ans = 0;\n for (auto p : nmp){ //out(p.first,p.second);\n if (mmp.find(p.first) == mmp.end()) continue;\n ans += p.second * mmp[p.first]; //out(p.second,mmp[p.first]);\n }\n for (auto q : mmp){\n //out(q.first, q.second);\n }\n out(ans);\n}\n\nint main(){\n int t = 1; //cin >> t;\n while (t--) solve();\n}","accuracy":0.15,"time_ms":80,"memory_kb":11872,"score_of_the_acc":-0.3354,"final_rank":17},{"submission_id":"aoj_2292_6933347","code_snippet":"#line 1 \"aoj.cpp\"\n#include<bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\n#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)\n#define all(v) v.begin(),v.end()\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int, int>;\nusing PL = pair<long long, long long>;\nusing pdd = pair<long double, long double>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\nusing ppi = pair<P,int>;\nusing pip = pair<int,P>;\nconst int INF = 1001001007;\nconst long long mod1 = 1000000007LL;\nconst long long mod2 = 998244353LL;\nconst ll inf = 2e18;\nconst ld pi = 3.14159265358979323;\nconst ld eps = 1e-7;\ntemplate<typename T>void o(T a);\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\ntemplate<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\ntemplate<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}\nvoid revs(string &s) {reverse(s.begin(),s.end());}\ntemplate<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\ntemplate<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}\ntemplate<typename T>T cel(T a,T b){return (a+b-1)/b;}\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\ntemplate<typename T>void print(vector<T> v);\ntemplate<typename T>void print(vector<vector<T>> v);\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", 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(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) 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; }\nvoid o(){cout<<\"!?\"<<endl;}\ntemplate<typename T>void o(T a){cout<<a<<endl;}\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\nvoid yes(){out(\"Yes\");}\nvoid no (){out(\"No\");}\nvoid yn (bool t){if(t)yes();else no();}\ntemplate<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\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;}\nll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}\n\n\nvector<int> manacher(string &s){\n int n = s.size();\n vector<int> ans(n,0);\n int i = 0, len = 0;\n while (i < n){\n while (i - len >= 0 && i + len < n && s[i-len] == s[i+len]) len++;\n ans[i] = len;\n int k = 1;\n while (i - k >= 0 && k + ans[i-k] < len) ans[i+k] = ans[i-k], k++;\n i += k, len -= k;\n }\n return ans;\n}\n\nvector<int> palindrome_length(string s){\n string t = \"$\";\n for (char c : s) t += c, t += '$';\n vector<int> a = manacher(t);\n vector<int> ans(a.size()-2);\n rep(i,a.size()-2) ans[i] = a[i+1]-1;\n return ans;\n}\n\n#line 2 \"modint.hpp\"\n// for prime m\ntemplate <long long m>\nstruct static_modint {\n using mint = static_modint;\n \n public:\n static constexpr int mod() { return m; }\n static_modint() : _v(0) {}\n template <class T>\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 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 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 assert(_v);\n return pow(umod() - 2);\n }\n\n mint inverse() const {return inv();}\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 friend std::ostream &operator<<(std::ostream &os,const mint&p) {\n return os<<p.val();\n }\n friend std::istream &operator>>(std::istream &is, mint &a) {\n long long t;\n is>>t;\n a=mint(t);\n return (is);\n }\n \n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n};\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\n#line 95 \"aoj.cpp\"\nusing mint = modint998244353;\nconst mint base = 249134723;\nvector<mint> bs;\nvector<mint> ibs;\n\nvoid solve(){\n string s, t; cin >> s >> t;\n int n = s.size(), m = t.size();\n bs.resize(100000,1), ibs.resize(100000,1);\n rep(i,100000-1) bs[i+1] = bs[i] * base;\n ibs[100000-1] = bs[100000-1].inv();\n repb(i,100000-1) ibs[i] = ibs[i+1] * base;\n vector<mint> nrui(n+1,0), mrui(m+1,0);\n rep(i,n) nrui[i+1] = nrui[i] + mint(ll(s[i] - 'a' + 1)) * bs[i];\n rep(i,m) mrui[i+1] = mrui[i] + mint(ll(t[i] - 'a' + 1)) * bs[i];\n auto nget = [&](int l, int r){\n return (nrui[r] - nrui[l]) * ibs[l];\n };\n auto mget = [&](int l, int r){\n return (mrui[r] - mrui[l]) * ibs[l];\n };\n auto nma = palindrome_length(s);\n auto mma = palindrome_length(t);\n map<ll,ll> nmp, mmp;\n priority_queue<pip> pque;\n rep(i,nma.size()){\n if (i % 2 == 0){\n int ce = i / 2;\n int le = ce - (nma[i]-1)/2;\n int ri = ce + (nma[i]-1)/2; \n mint mhs = nget(le,ri+1);\n ll hs = mhs.val();\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = 1; //out(le,ri,hs);\n pque.push(pip(nma[i],P(le,ri)));\n }\n else nmp[hs]++;\n }\n else {\n int le = (i - (nma[i])) / 2;\n int ri = (i + (nma[i])) / 2;\n if (le == ri) continue;\n mint mhs = nget(le,ri+1);\n ll hs = mhs.val();\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = 1;\n pque.push(pip(nma[i],P(le,ri)));\n }\n else nmp[hs]++;\n }\n }\n while (!pque.empty()){\n auto p = pque.top(); pque.pop();\n if (p.first <= 2) continue;\n int le = p.second.first, ri = p.second.second;\n mint imhs = nget(le,ri+1);\n ll ihs = imhs.val();\n le++, ri--;\n mint mhs = nget(le,ri+1);\n ll hs = mhs.val();\n if (nmp.find(hs) == nmp.end()){\n nmp[hs] = nmp[ihs]; //out(le,ri,hs);\n pque.push(pip(p.first-2,P(le,ri)));\n }\n else nmp[hs] += nmp[ihs];\n }\n rep(i,mma.size()){\n if (i % 2 == 0){\n int ce = i / 2;\n int le = ce - (mma[i]-1)/2;\n int ri = ce + (mma[i]-1)/2;\n mint mhs = mget(le,ri+1);\n ll hs = mhs.val();\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = 1; //out(le,ri,hs);\n pque.push(pip(mma[i],P(le,ri)));\n }\n else mmp[hs]++;\n }\n else {\n int le = (i - (mma[i])) / 2;\n int ri = (i + (mma[i])) / 2;\n if (le == ri) continue;\n mint mhs = mget(le,ri+1);\n ll hs = mhs.val();\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = 1;\n pque.push(pip(mma[i],P(le,ri)));\n }\n else mmp[hs]++;\n }\n }\n while (!pque.empty()){\n auto p = pque.top(); pque.pop();\n if (p.first <= 2) continue;\n int le = p.second.first, ri = p.second.second;\n mint imhs = mget(le,ri+1);\n ll ihs = imhs.val();\n le++, ri--;\n mint mhs = mget(le,ri+1);\n ll hs = mhs.val();\n if (mmp.find(hs) == mmp.end()){\n mmp[hs] = mmp[ihs];//out(le,ri,hs);\n pque.push(pip(p.first-2,P(le,ri)));\n }\n else mmp[hs] += mmp[ihs];\n }\n ll ans = 0;\n for (auto p : nmp){ //out(p.first,p.second);\n if (mmp.find(p.first) == mmp.end()) continue;\n ans += p.second * mmp[p.first]; //out(p.second,mmp[p.first]);\n }\n for (auto q : mmp){\n //out(q.first, q.second);\n }\n out(ans);\n}\n\nint main(){\n int t = 1; //cin >> t;\n while (t--) solve();\n}","accuracy":0.06666666666666667,"time_ms":60,"memory_kb":11852,"score_of_the_acc":-0.2658,"final_rank":20},{"submission_id":"aoj_2292_6933321","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst long long BASE = 123456789;\nconst long long M30 = ((long long) 1 << 30) - 1;\nconst long long M31 = ((long long) 1 << 31) - 1;\nconst long long MOD = ((long long) 1 << 61) - 1;\nunsigned long long modulo(unsigned long long x){\n unsigned long long xu = x >> 61;\n unsigned long long xd = x & MOD;\n unsigned long long res = xu + xd;\n if (res >= MOD){\n res -= MOD;\n }\n return res;\n}\nunsigned long long mul(unsigned long long a, unsigned long long b){\n unsigned long long au = a >> 31;\n unsigned long long ad = a & M31;\n unsigned long long bu = b >> 31;\n unsigned long long bd = b & M31;\n unsigned long long mid = au * bd + ad * bu;\n unsigned long long midu = mid >> 30;\n unsigned long long midd = mid & M30;\n return modulo(au * bu * 2 + midu + (midd << 31) + ad * bd);\n}\nstruct rolling_hash{\n vector<long long> POW, S;\n rolling_hash(string s){\n int N = s.size();\n POW.resize(N + 1);\n POW[0] = 1;\n for (int i = 0; i < N; i++){\n POW[i + 1] = mul(POW[i], BASE);\n }\n S.resize(N + 1);\n S[N] = 0;\n for (int i = N - 1; i >= 0; i--){\n S[i] = modulo(mul(S[i + 1], BASE) + s[i]);\n }\n }\n long long get(int L, int R){\n return modulo(S[L] + MOD - mul(S[R], POW[R - L]));\n }\n};\nvector<int> manacher(string &S){\n int N = S.size();\n vector<int> ans(N, 0);\n int i = 0, j = 0;\n while (i < N){\n while (i >= j && i + j < N && S[i - j] == S[i + j]){\n j++;\n }\n ans[i] = j;\n int k = 1;\n while (i >= k && i + k < N && k + ans[i - k] < j){\n ans[i + k] = ans[i - k];\n k++;\n }\n i += k;\n j -= k;\n }\n return ans;\n}\nunordered_map<unsigned long long, int> solve(string S){\n int N = S.size();\n string T = \"$\";\n for (int i = 0; i < N; i++){\n T += S[i];\n T += '$';\n }\n vector<int> A = manacher(T);\n rolling_hash RH(S);\n unordered_map<unsigned long long, int> mp;\n priority_queue<pair<int, int>> pq;\n for (int i = 1; i < N * 2; i++){\n int l = (i - A[i] + 2) / 2, r = (i + A[i] - 1) / 2;\n if (l < r){\n unsigned long long hash = RH.get(l, r);\n if (mp.count(hash) == 0){\n pq.push(make_pair(r - l, l));\n }\n mp[hash]++;\n }\n }\n while (!pq.empty()){\n int L = pq.top().second;\n int R = L + pq.top().first;\n pq.pop();\n unsigned long long hash = RH.get(L, R);\n L++;\n R--;\n if (L < R){\n unsigned long long hash2 = RH.get(L, R);\n if (mp.count(hash2) == 0){\n pq.push(make_pair(R - L, L));\n }\n mp[hash2] += mp[hash];\n }\n }\n return mp;\n}\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n string S;\n cin >> S;\n string T;\n cin >> T;\n unordered_map<unsigned long long, int> A = solve(S);\n unordered_map<unsigned long long, int> B = solve(T);\n long long ans = 0;\n for (auto P : A){\n if (B.count(P.first) == 1){\n ans += (long long) P.second * B[P.first];\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":8848,"score_of_the_acc":-0.069,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2292_9777583\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst long long MOD = 10000000000000099;\\nconst long long BASE = 1333;\\nconst int MAXN = 5 * 100000;\\n\\nlong long POWER[MAXN + 1];\\n\\nlong long mul(long long a, long long b) {\\n return ((__int128_t)a * b) % MOD;\\n}\\n\\nclass RollingHash {\\npublic:\\n RollingHash(const string& s) : size(s.size()), str(s) {\\n hashed.resize(size + 1);\\n for (int i = 0; i < size; ++i) {\\n hashed[i + 1] = mul(hashed[i], BASE) + (s[i]);\\n hashed[i + 1] %= MOD;\\n }\\n }\\n\\n long long query(int l, int r) {\\n assert(0 <= l && l <= r && r <= size);\\n return (hashed[r] - mul(hashed[l], POWER[r - l]) + MOD) % MOD;\\n }\\n\\nprivate:\\n string str;\\n vector<long long> hashed;\\n int size;\\n};\\n\\nclass Eertree {\\npublic:\\n Eertree(const string& s) : str(s), size(s.size()), r1(s), r2(string(s.rbegin(), s.rend())) {}\\n\\n void build() {\\n const int BEGIN = 'A'; // or 'a'\\n const int PALINDROME_SIZE = 2 * size;\\n vector<vector<int>> G(PALINDROME_SIZE);\\n H.resize(PALINDROME_SIZE);\\n W.resize(PALINDROME_SIZE, 0);\\n vector<unordered_map<long long, int>> ptr(27);\\n \\n ptr[26][0] = 0;\\n H[0] = {26, 0};\\n int free = 1;\\n\\n for (int i = 0; i < size; ++i) {\\n int ID = str[i] - BEGIN;\\n int ok = -1, ng = min(i, size - i - 1) + 1;\\n\\n while (ng - ok > 1) {\\n int x = (ng + ok) >> 1;\\n long long h1 = r1.query(i + 1, i + 1 + x);\\n long long h2 = r2.query(size - i, size - i + x);\\n if (ptr[ID].count(h1) && ptr[ID][h1] >= 0 && h1 == h2) ok = x;\\n else ng = x;\\n }\\n\\n if (ok == -1) {\\n ptr[ID][0] = free;\\n H[free] = {ID, 0};\\n free++;\\n ok = 0;\\n }\\n\\n int par = ptr[ID][r1.query(i + 1, i + 1 + ok)];\\n for (int j = ok + 1; j < min(i + 1, size - i); ++j) {\\n if (str[i + j] == str[i - j]) {\\n long long h1 = r1.query(i + 1, i + j + 1);\\n ptr[ID][h1] = free;\\n G[par].push_back(free);\\n H[free] = {ID, h1};\\n par = free;\\n free++;\\n } else {\\n break;\\n }\\n }\\n W[par] += 1;\\n\\n // Centroid = ''\\n ok = 0;\\n ng = min(i, size - i - 1) + 1;\\n ID = 26;\\n\\n while (ng - ok > 1) {\\n int x = (ng + ok) >> 1;\\n long long h1 = r1.query(i, i + x);\\n long long h2 = r2.query(size - i, size - i + x);\\n if (ptr[ID].count(h1) && ptr[ID][h1] >= 0 && h1 == h2) ok = x;\\n else ng = x;\\n }\\n\\n par = ptr[ID][r1.query(i, i + ok)];\\n for (int j = ok + 1; j < min(i + 1, size - i + 1); ++j) {\\n if (str[i + j - 1] == str[i - j]) {\\n long long h1 = r1.query(i, i + j);\\n ptr[ID][h1] = free;\\n G[par].push_back(free);\\n H[free] = {ID, h1};\\n par = free;\\n free++;\\n } else {\\n break;\\n }\\n }\\n W[par] += 1;\\n }\\n\\n function<long long(int)> dfs = [&](int v) {\\n for (int nxt : G[v]) {\\n W[v] += dfs(nxt);\\n }\\n return W[v];\\n };\\n\\n for (int ID = 0; ID < 27; ++ID) {\\n if (ptr[ID].count(0) && ptr[ID][0] >= 0) dfs(ptr[ID][0]);\\n }\\n W[0] = 0;\\n }\\n\\n vector<long long> getW() const { return W; }\\n vector<pair<int, long long>> getH() const { return H; }\\n\\nprivate:\\n string str;\\n int size;\\n RollingHash r1, r2;\\n vector<long long> W;\\n vector<pair<int, long long>> H;\\n};\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n for (int i = 0; i <= MAXN; ++i) {\\n POWER[i] = (i == 0) ? 1 : mul(POWER[i - 1], BASE);\\n }\\n\\n string s, t;\\n cin >> s >> t;\\n\\n Eertree palS(s);\\n Eertree palT(t);\\n palS.build();\\n palT.build();\\n\\n vector<long long> SW = palS.getW();\\n vector<long long> TW = palT.getW();\\n vector<pair<int, long long>> SH = palS.getH();\\n vector<pair<int, long long>> TH = palT.getH();\\n\\n unordered_map<long long, array<long long, 2>> pair;\\n \\n for (size_t i = 0; i < SW.size(); ++i) {\\n pair[SH[i].first*MOD+SH[i].second][0] += SW[i];\\n }\\n for (size_t i = 0; i < TW.size(); ++i) {\\n pair[TH[i].first*MOD+TH[i].second][1] += TW[i];\\n }\\n\\n long long ans = 0;\\n for (const auto& p : pair) {\\n ans += p.second[0] * p.second[1];\\n }\\n\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 290,\n \"memory_kb\": 25348,\n \"score_of_the_acc\": -1.4784,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2292_9777531\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst long long MOD = (1LL << 61) - 1;\\nconst long long BASE = 1333;\\nconst int MAXN = 5 * 100000;\\n\\nlong long POWER[MAXN + 1];\\n\\nlong long mul(long long a, long long b) {\\n return ((__int128_t)a * b) % MOD;\\n}\\n\\nclass RollingHash {\\npublic:\\n RollingHash(const string& s) : size(s.size()), str(s) {\\n hashed.resize(size + 1);\\n for (int i = 0; i < size; ++i) {\\n hashed[i + 1] = mul(hashed[i], BASE) + (s[i]);\\n hashed[i + 1] %= MOD;\\n }\\n }\\n\\n long long query(int l, int r) {\\n assert(0 <= l && l <= r && r <= size);\\n return (hashed[r] - mul(hashed[l], POWER[r - l]) + MOD) % MOD;\\n }\\n\\nprivate:\\n string str;\\n vector<long long> hashed;\\n int size;\\n};\\n\\nclass Eertree {\\npublic:\\n Eertree(const string& s) : str(s), size(s.size()), r1(s), r2(string(s.rbegin(), s.rend())) {}\\n\\n void build() {\\n const int BEGIN = 'A'; // or 'a'\\n const int PALINDROME_SIZE = 2 * size;\\n vector<vector<int>> G(PALINDROME_SIZE);\\n H.resize(PALINDROME_SIZE);\\n W.resize(PALINDROME_SIZE, 0);\\n vector<unordered_map<long long, int>> ptr(27);\\n \\n ptr[26][0] = 0;\\n H[0] = {26, 0};\\n int free = 1;\\n\\n for (int i = 0; i < size; ++i) {\\n int ID = str[i] - BEGIN;\\n int ok = -1, ng = min(i, size - i - 1) + 1;\\n\\n while (ng - ok > 1) {\\n int x = (ng + ok) >> 1;\\n long long h1 = r1.query(i + 1, i + 1 + x);\\n long long h2 = r2.query(size - i, size - i + x);\\n if (ptr[ID].count(h1) && ptr[ID][h1] >= 0 && h1 == h2) ok = x;\\n else ng = x;\\n }\\n\\n if (ok == -1) {\\n ptr[ID][0] = free;\\n H[free] = {ID, 0};\\n free++;\\n ok = 0;\\n }\\n\\n int par = ptr[ID][r1.query(i + 1, i + 1 + ok)];\\n for (int j = ok + 1; j < min(i + 1, size - i); ++j) {\\n if (str[i + j] == str[i - j]) {\\n long long h1 = r1.query(i + 1, i + j + 1);\\n ptr[ID][h1] = free;\\n G[par].push_back(free);\\n H[free] = {ID, h1};\\n par = free;\\n free++;\\n } else {\\n break;\\n }\\n }\\n W[par] += 1;\\n\\n // Centroid = ''\\n ok = 0;\\n ng = min(i, size - i - 1) + 1;\\n ID = 26;\\n\\n while (ng - ok > 1) {\\n int x = (ng + ok) >> 1;\\n long long h1 = r1.query(i, i + x);\\n long long h2 = r2.query(size - i, size - i + x);\\n if (ptr[ID].count(h1) && ptr[ID][h1] >= 0 && h1 == h2) ok = x;\\n else ng = x;\\n }\\n\\n par = ptr[ID][r1.query(i, i + ok)];\\n for (int j = ok + 1; j < min(i + 1, size - i + 1); ++j) {\\n if (str[i + j - 1] == str[i - j]) {\\n long long h1 = r1.query(i, i + j);\\n ptr[ID][h1] = free;\\n G[par].push_back(free);\\n H[free] = {ID, h1};\\n par = free;\\n free++;\\n } else {\\n break;\\n }\\n }\\n W[par] += 1;\\n }\\n\\n function<long long(int)> dfs = [&](int v) {\\n for (int nxt : G[v]) {\\n W[v] += dfs(nxt);\\n }\\n return W[v];\\n };\\n\\n for (int ID = 0; ID < 27; ++ID) {\\n if (ptr[ID].count(0) && ptr[ID][0] >= 0) dfs(ptr[ID][0]);\\n }\\n W[0] = 0;\\n }\\n\\n vector<long long> getW() const { return W; }\\n vector<pair<int, long long>> getH() const { return H; }\\n\\nprivate:\\n string str;\\n int size;\\n RollingHash r1, r2;\\n vector<long long> W;\\n vector<pair<int, long long>> H;\\n};\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n for (int i = 0; i <= MAXN; ++i) {\\n POWER[i] = (i == 0) ? 1 : mul(POWER[i - 1], BASE);\\n }\\n\\n string s, t;\\n cin >> s >> t;\\n\\n Eertree palS(s);\\n Eertree palT(t);\\n palS.build();\\n palT.build();\\n\\n vector<long long> SW = palS.getW();\\n vector<long long> TW = palT.getW();\\n vector<pair<int, long long>> SH = palS.getH();\\n vector<pair<int, long long>> TH = palT.getH();\\n\\n unordered_map<long long, array<long long, 2>> pair;\\n \\n for (size_t i = 0; i < SW.size(); ++i) {\\n pair[SH[i].first*MOD+SH[i].second][0] += SW[i];\\n }\\n for (size_t i = 0; i < TW.size(); ++i) {\\n pair[TH[i].first*MOD+TH[i].second][1] += TW[i];\\n }\\n\\n long long ans = 0;\\n for (const auto& p : pair) {\\n ans += p.second[0] * p.second[1];\\n }\\n\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.11666666666666667,\n \"time_ms\": 300,\n \"memory_kb\": 22600,\n \"score_of_the_acc\": -1.4275,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2292_9753483\",\n \"code_snippet\": \"#include <algorithm>\\n#include <limits>\\n#include <map>\\n#include <numeric>\\n#include <ranges>\\n#include <type_traits>\\n#include <vector>\\nnamespace nono {\\ntemplate <class T = char>\\nclass Eertree {\\n struct Node {\\n Node(int len, int parent = 0, int link = 0): len(len), parent(parent), link(link) {}\\n int len;\\n int parent;\\n int link;\\n std::map<T, int> to;\\n };\\n public:\\n Eertree(): pos_(0) {\\n nodes_.emplace_back(Node(-1));\\n nodes_.emplace_back(Node(0));\\n seq_.push_back(std::numeric_limits<T>::max());\\n }\\n int size() { return nodes_.size() - 2; }\\n void add(T c) {\\n const int i = seq_.size();\\n seq_.push_back(c);\\n pos_ = go(pos_, i);\\n if (!nodes_[pos_].to.contains(c)) {\\n nodes_[pos_].to[c] = nodes_.size();\\n int link = pos_ == 0 ? 1 : nodes_[go(nodes_[pos_].link, i)].to[c];\\n nodes_.emplace_back(nodes_[pos_].len + 2, pos_, link);\\n }\\n pos_ = nodes_[pos_].to[c];\\n node_id_.push_back(pos_);\\n }\\n template <std::ranges::random_access_range R>\\n void add(const R& seq) {\\n static_assert(std::is_same_v<typename R::value_type, T>);\\n for (auto c: seq) add(c);\\n }\\n std::vector<int> node_id() { return node_id_; }\\n std::vector<Node> nodes() { return nodes_; }\\n std::vector<int> freq() {\\n std::vector<int> ids(nodes_.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(),\\n [&](int lhs, int rhs) { return nodes_[lhs].len > nodes_[rhs].len; });\\n std::vector<int> result(nodes_.size());\\n for (auto id: node_id_) result[id]++;\\n for (auto id: ids) { result[nodes_[id].link] += result[id]; }\\n return result;\\n }\\n private:\\n bool fail(int pos, int i) { return seq_[i] != seq_[i - nodes_[pos].len - 1]; }\\n int go(int pos, int i) {\\n while (fail(pos, i)) pos = nodes_[pos].link;\\n return pos;\\n }\\n int pos_;\\n std::vector<T> seq_;\\n std::vector<int> node_id_;\\n std::vector<Node> nodes_;\\n};\\n} // namespace nono\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\ntemplate <class T>\\nusing max_heap = priority_queue<T>;\\ntemplate <class T>\\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\\n#define rep(i, l, r) for (ll i = (l); i < (r); i++)\\n#define rrep(i, r, l) for (ll i = (r); i-- > (l);)\\n#define all(x) begin(x), end(x)\\ntemplate <class T>\\nbool chmin(T& lhs, T rhs) {\\n return lhs > rhs ? (lhs = rhs, true) : false;\\n}\\ntemplate <class T>\\nbool chmax(T& lhs, T rhs) {\\n return lhs < rhs ? (lhs = rhs, true) : false;\\n}\\nstruct IOIO {\\n IOIO() { cin.tie(0)->sync_with_stdio(0); }\\n} ioio;\\ntemplate <class S, class T>\\nostream& operator<<(ostream& os, const pair<S, T>& p) {\\n os << '(' << p.first << \\\", \\\" << p.second << ')';\\n return os;\\n}\\ntemplate <class T>\\nostream& operator<<(ostream& os, const vector<T>& vs) {\\n os << '{';\\n rep(i, 0, (int)vs.size()) os << vs[i] << (i + 1 == (int)vs.size() ? \\\"\\\" : \\\", \\\");\\n os << '}';\\n return os;\\n}\\ntemplate <class T>\\nostream& operator<<(ostream& os, const set<T>& vs) {\\n os << '{';\\n for (auto it = vs.begin(); it != vs.end(); it++) {\\n if (it != vs.begin()) { os << \\\", \\\"; }\\n os << *it;\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <class T, class U>\\nostream& operator<<(ostream& os, const map<T, U>& vs) {\\n os << '{';\\n for (auto it = vs.begin(); it != vs.end(); it++) {\\n if (it != vs.begin()) { os << \\\", \\\"; }\\n os << *it;\\n }\\n os << '}';\\n return os;\\n}\\n#ifdef DEBUG\\nvoid dump_func() { cerr << endl; }\\ntemplate <class Head, class... Tail>\\nvoid dump_func(Head&& head, Tail&&... tail) {\\n cerr << head;\\n if (sizeof...(Tail) > 0) { cerr << \\\", \\\"; }\\n dump_func(std::move(tail)...);\\n}\\n#define dump(...) cerr << \\\"[\\\" + string(#__VA_ARGS__) + \\\"] \\\", dump_func(__VA_ARGS__)\\n#else\\n#define dump(...) static_cast<int>(0)\\n#endif\\nint main() {\\n string s, t;\\n cin >> s >> t;\\n nono::Eertree Stree, Ttree;\\n Stree.add(s);\\n Ttree.add(t);\\n auto Sfreq = Stree.freq();\\n auto Tfreq = Ttree.freq();\\n auto Snodes = Stree.nodes();\\n auto Tnodes = Ttree.nodes();\\n ll ans = 0;\\n auto dfs = [&](auto&& self, int si, int ti) -> void {\\n if (Snodes[si].len > 0) { ans += (ll)Sfreq[si] * Tfreq[ti]; }\\n for (auto [c, to]: Snodes[si].to) {\\n if (Tnodes[ti].to.contains(c)) { self(self, to, Tnodes[ti].to[c]); }\\n }\\n };\\n dfs(dfs, 0, 0);\\n dfs(dfs, 1, 1);\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 28336,\n \"score_of_the_acc\": -0.6057,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2292_8990340\",\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\\ntemplate < class char_type > struct eertree {\\n using size_type = int;\\n struct node_type {\\n map<char_type, size_type> nxt;\\n size_type link, len, count;\\n\\n node_type(size_type link, size_type len, size_type count) : link(link), len(len), count(count) {}\\n };\\n\\n size_type lsp;\\n vector<char_type> s;\\n vector<node_type> g;\\n\\n eertree() : lsp(0) {\\n g.emplace_back(0, -1, 0); // odd\\n g.emplace_back(0, 0, 0); // even\\n }\\n\\n // return node(c + str(?) + c)\\n size_type find(size_type v) const {\\n const size_type n = s.size() - 1;\\n while(true) {\\n const size_type i = n - g[v].len - 1;\\n if(0 <= i and s[i] == s[n]) return v;\\n v = g[v].link;\\n }\\n }\\n\\n void push_back(const char_type c) {\\n s.push_back(c);\\n const size_type v = find(lsp);\\n\\n if(g[v].nxt.count(c)) {\\n lsp = g[v].nxt[c];\\n g[lsp].count++;\\n } else {\\n lsp = g[v].nxt[c] = g.size();\\n g.emplace_back(v == 0 ? 1 : g[find(g[v].link)].nxt[c], 1 + g[v].len + 1, 1);\\n }\\n }\\n\\n vector<size_type> freq() const {\\n vector<size_type> freq(g.size(), 0);\\n for(size_type i = size_type(g.size()) - 1; i > 0; i--) {\\n freq[i] += g[i].count;\\n freq[g[i].link] += freq[i];\\n }\\n return freq;\\n }\\n\\n string str(size_type v) const {\\n if(v == 0) return \\\"odd(-1)\\\";\\n if(v == 1) return \\\"even(0)\\\";\\n string res = \\\"\\\";\\n function<bool(size_type)> dfs = [&](size_type x) -> bool {\\n if(x == v) return true;\\n for(auto [c, nx] : g[x].nxt) {\\n if(dfs(nx)) {\\n res.push_back(c);\\n return true;\\n }\\n }\\n return false;\\n }; dfs(0); dfs(1);\\n string rr = res; reverse(rr.begin(), rr.end());\\n if(g[v].len % 2 == 1) rr.pop_back();\\n return res + rr;\\n }\\n};\\n\\nint main() {\\n string S = in(), T = in();\\n\\n auto f = [&](const string& x) {\\n eertree<char> tree;\\n for(char c : x) tree.push_back(c);\\n vector<int> freq = tree.freq();\\n const int n = freq.size();\\n i64 ans = 0;\\n for(int i : rep(2, n))\\n ans += i64(freq[i]) * (freq[i] - 1) / 2;\\n return ans;\\n };\\n\\n print(f(S + \\\"!?\\\" + T) - f(S) - f(T));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 16656,\n \"score_of_the_acc\": -0.2427,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2292_8762299\",\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 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\\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);\\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\\nconst vi DY = { 0, 1, 0, -1 };\\nint INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620;\\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 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 >= 0; 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 smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\\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 pow(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 get(T set, int i) { return (set >> i) & T(1); }\\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 = 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>;\\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) : -1; }\\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\\ninline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }\\ninline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }\\n#define dump(...)\\n#define dumpel(v)\\n#define dump_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)) while (1) cout << \\\"OLE\\\"; }\\n#endif\\n\\n\\n//【ローリングハッシュ（列）】\\n/*\\n* Rolling_hash<STR>(STR s, bool reversible = false) : O(n)\\n*\\t列 s[0..n) で初期化する．reversible = true にすると逆順のハッシュも計算可能になる．\\n*\\t制約：STR は string，vector<T> など．ll 範囲の負数は扱えない．\\n*\\n* ull get(int l, int r) : O(1)\\n*\\t部分文字列 s[l..r) のハッシュ値を返す（空なら 0）\\n*\\n* ull get_rev(int l, int r) : O(1)\\n*\\t部分文字列 s[l..r) を反転した文字列のハッシュ値を返す（空なら 0）\\n*\\n* ull join(ull hs, ull ht, int len) : O(1)\\n*\\tハッシュ値 hs をもつ s とハッシュ値 ht をもつ t[0..len) を連結した s+t のハッシュ値を返す．\\n*/\\ntemplate <class STR>\\nclass Rolling_hash {\\n\\t// 参考 : https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\\n\\n\\t//【方法】\\n\\t// 2^61 - 1 は十分大きい素数であるからローリングハッシュの法として適切である．\\n\\t// a, b < 2^61 - 1 とし，積 a b mod (2^61 - 1) を高速に計算できればよい．\\n\\t// \\n\\t// まず a, b を上位と下位に分解し\\n\\t//\\t\\ta = 2^31 ah + al, b = 2^31 bh + bl (ah, bh < 2^30, al, bl < 2^31)\\n\\t// とする．これらの積をとると，\\n\\t//\\t\\ta b\\n\\t//\\t\\t= (2^31 ah + al)(2^31 bh + bl)\\n\\t//\\t\\t= 2^62 ah bh + 2^31 (ah bl + bh al) + al bl\\n\\t// となる．2^61 ≡ 1 (mod 2^61 - 1) に注意してそれぞれの項を mod 2^61 - 1 で整理する．\\n\\t//\\n\\t// 第 1 項については，\\n\\t//\\t\\t2^62 ah bh\\n\\t//\\t\\t= 2 ah bh\\n\\t//\\t\\t≦ 2 (2^30-1) (2^30-1)\\n\\t// となる．\\n\\t//\\n\\t// 第 2 項については，c := ah bl + bh al < 2^62 を上位と下位に分解し\\n\\t//\\t\\tc = 2^30 ch + cl (ch < 2^32, cl < 2^30)\\n\\t// とすると，\\n\\t//\\t\\t2^31 c\\n\\t//\\t\\t= 2^31 (2^30 ch + cl)\\n\\t//\\t\\t= ch + 2^31 cl\\n\\t//\\t\\t≦ (2^32-1) + 2^31 (2^30-1)\\n\\t// となる．\\n\\t//\\n\\t// 第 3 項については，\\n\\t//\\t\\tal bl\\n\\t//\\t\\t≦ (2^31-1) (2^31-1)\\n\\t// となる．\\n\\t// \\n\\t// これらの和は\\n\\t//\\t\\t2 ah bh + ch + 2^31 cl + al bl\\n\\t//\\t\\t≦ 2 (2^30-1) (2^30-1) + (2^32-1) + 2^31 (2^30-1) + (2^31-1) (2^31-1)\\n\\t//\\t\\t= 9223372030412324866 < 9223372036854775808 = 2^63 << 2^64\\n\\t// となるのでオーバーフローの心配はない．\\n\\n\\tstatic constexpr ull MASK30 = (1ULL << 30) - 1;\\n\\tstatic constexpr ull MASK31 = (1ULL << 31) - 1;\\n\\tstatic constexpr ull MOD = (1ULL << 61) - 1; // 法（素数）\\n\\n\\t// a mod (2^61 - 1) を返す．\\n\\tinline ull get_mod(ull a) const {\\n\\t\\tull ah = a >> 61, al = a & MOD;\\n\\t\\tull res = ah + al;\\n\\t\\tif (res >= MOD) res -= MOD;\\n\\t\\treturn res;\\n\\t}\\n\\n\\t// x ≡ a b mod (2^61 - 1) なる x < 2^63 を返す（ただし a, b < 2^61）\\n\\tinline ull mul(ull a, ull b) const {\\n\\t\\tull ah = a >> 31, al = a & MASK31;\\n\\t\\tull bh = b >> 31, bl = b & MASK31;\\n\\n\\t\\tull c = ah * bl + bh * al;\\n\\t\\tull ch = c >> 30, cl = c & MASK30;\\n\\n\\t\\tull term1 = 2 * ah * bh;\\n\\t\\tull term2 = ch + (cl << 31);\\n\\t\\tull term3 = al * bl;\\n\\n\\t\\treturn term1 + term2 + term3; // < 2^63\\n\\t}\\n\\n\\tstatic constexpr ull BASE = 1234567891011; // 適当な基数\\n\\tstatic constexpr ull SHIFT = 4295090752; // 適当なシフト\\n\\n\\t// 列の長さ\\n\\tint n;\\n\\n\\t// powB[i] : BASE^i\\n\\tvector<ull> powB;\\n\\n\\t// v[i] : s[0..i) のハッシュ値 Σj∈[0..i) (s[j]+SHIFT) BASE^(i-1-j)\\n\\t// v_rev[i] : s[n-i..n) を反転した文字列のハッシュ値\\n\\tvector<ull> v, v_rev;\\n\\npublic:\\n\\t// 列 s[0..n) で初期化する．\\n\\tRolling_hash(const STR& s, bool reversible = false) : n(sz(s)), powB(n + 1), v(n + 1) {\\n\\t\\t// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ec\\n\\n\\t\\tpowB[0] = 1;\\n\\t\\trep(i, n) powB[i + 1] = get_mod(mul(powB[i], BASE));\\n\\n\\t\\trep(i, n) v[i + 1] = get_mod(mul(v[i], BASE) + (ull)s[i] + SHIFT);\\n\\n\\t\\tif (reversible) {\\n\\t\\t\\tv_rev.resize(n + 1);\\n\\t\\t\\trep(i, n) v_rev[i + 1] = get_mod(mul(v_rev[i], BASE) + (ull)s[n - 1 - i] + SHIFT);\\n\\t\\t}\\n\\t}\\n\\tRolling_hash() : n(0) {}\\n\\n\\t// s[l..r) のハッシュ値の取得\\n\\tull get(int l, int r) const {\\n\\t\\t// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ec\\n\\n\\t\\tchmax(l, 0); chmin(r, n);\\n\\t\\tif (l >= r) return 0;\\n\\n\\t\\treturn get_mod(v[r] + 4 * MOD - mul(v[l], powB[r - l]));\\n\\t}\\n\\n\\t// s[l..r) を反転した文字列のハッシュ値の取得\\n\\tull get_rev(int l, int r) {\\n\\t\\t// verify : https://atcoder.jp/contests/tessoku-book/tasks/tessoku_book_ec\\n\\n\\t\\tchmax(l, 0); chmin(r, n);\\n\\t\\tif (l >= r) return 0;\\n\\t\\tAssert(!v_rev.empty());\\n\\n\\t\\t// s[l, r) を反転した文字列は s_rev[n-r, n-l) に等しい．\\n\\t\\treturn get_mod(v_rev[n - l] + 4 * MOD - mul(v_rev[n - r], powB[r - l]));\\n\\t}\\n\\n\\t// ハッシュ値 hs をもつ s とハッシュ値 ht をもつ t[0..len) を連結した s+t のハッシュ値を返す．\\n\\tull join(ull hs, ull ht, int len) const {\\n\\t\\t// verify : https://atcoder.jp/contests/abc284/tasks/abc284_f\\n\\n\\t\\tAssert(len <= n);\\n\\t\\treturn get_mod(ht + mul(hs, powB[len]));\\n\\t}\\n};\\n\\n\\n//【最長回文長（文字中心）】O(n)\\n/*\\n* s[0..n) の s[i] を中心とする最長回文の半径（(文字数 + 1) / 2）を r[i] に格納し r を返す．\\n* ここで回文の半径とは，(文字数 + 1) / 2 を意味する．\\n*/\\ntemplate <class STR>\\nvi manacher(const STR& s) {\\n\\t// 参考 : https://snuke.hatenablog.com/entry/2014/12/02/235837\\n\\t// verify : https://judge.yosupo.jp/problem/enumerate_palindromes\\n\\n\\t//【方法】\\n\\t// s[i] を中心とする最長回文の半径 j = r[i] が愚直に求まったとする．\\n\\t// すなわち s(i-j..i+j) が s[i] を中心とする最長回文である．\\n\\t// \\n\\t// 各 k = [1..j) について，s[i-k] を中心とする最長回文 s(i-k-r[i-k]..i-k+r[i-k]) が\\n\\t// s(i-j+1..i+j-1) の部分文字列であれば，s[i±j] の影響を受けず\\n\\t// s[i] についての左右対称性より r[i+k] = r[i-k] と定まる．\\n\\t// その条件は，左端を比較して\\n\\t//\\t\\ti - k - r[i-k] >= i - j + 1\\n\\t//\\t\\t⇔ k + r[i-k] < j\\n\\t// である．このような結果の使い回しができる限り k を進め，次の i を i + k にする．\\n\\t// \\n\\t// 使い回しができなくなったということは，s[i+k] を中心とする最長回文\\n\\t// s(i+k-r[i+k]..i+k+r[i+k]) が s(i-j+1..i+j-1) の部分文字列でないので，\\n\\t// 右端を比較することで\\n\\t//\\t\\ti + k + r[i+k] > i + j - 1\\n\\t//\\t\\t⇔ r[i+k] >= j - k\\n\\t// である．よって次の j は j - k にすればよい．\\n\\n\\tint n = sz(s);\\n\\tvi r(n);\\n\\n\\tint i = 0, j = 0;\\n\\twhile (i < n) {\\n\\t\\twhile (i - j >= 0 && i + j < n && s[i - j] == s[i + j]) j++;\\n\\t\\tr[i] = j;\\n\\n\\t\\tint k = 1;\\n\\t\\twhile (i - k >= 0 && k + r[i - k] < j) {\\n\\t\\t\\tr[i + k] = r[i - k];\\n\\t\\t\\tk++;\\n\\t\\t}\\n\\t\\ti += k;\\n\\t\\tj -= k;\\n\\t}\\n\\n\\treturn r;\\n}\\n\\n\\n//【最長回文長】O(n)\\n/*\\n* s[0..n) の s[i] を中心とする最長回文の長さを lo[i] に格納し，\\n* s[i..i+1] を中心とする最長回文の長さを le[i] に格納する．\\n*\\n* 利用：【最長回文長（文字中心）】\\n*/\\ntemplate <class STR>\\nvoid manacher(const STR& s, vi& lo, vi& le) {\\n\\t// 参考 : https://snuke.hatenablog.com/entry/2014/12/02/235837\\n\\t// verify : https://judge.yosupo.jp/problem/enumerate_palindromes\\n\\n\\tint n = sz(s);\\n\\tlo.resize(n);\\n\\tle.resize(n - 1);\\n\\n\\tSTR s_riffled;\\n\\ts_riffled.resize(2 * n + 1);\\n\\trep(i, n) s_riffled[2 * i + 1] = s[i];\\n\\trep(i, n + 1) s_riffled[2 * i] = '$'; // '$' は s に含まれない文字\\n\\n\\tvi r = manacher(s_riffled);\\n\\n\\trep(i, n) lo[i] = r[2 * i + 1] - 1;\\n\\trep(i, n - 1) le[i] = r[2 * (i + 1)] - 1;\\n}\\n\\n\\nvector<unordered_map<ull, ll>> count_palindromes(const string& s) {\\n\\tint n = sz(s);\\n\\n\\tRolling_hash S(s, true);\\n\\n\\tvi lo, le;\\n\\tmanacher(s, lo, le);\\n\\n\\tunordered_set<ull> hs;\\n\\ths.insert(0);\\n\\n\\tunordered_map<ull, pii> h_to_lr;\\n\\tvector<unordered_map<ull, ll>> cnt(n + 1);\\n\\n\\trep(i, n) {\\n\\t\\tint r = lo[i] / 2;\\n\\t\\tauto h = S.get(i - r, i + r + 1);\\n\\t\\tdump(s.substr(i - r, 2 * r + 1));\\n\\t\\th_to_lr[h] = { i - r, i + r + 1 };\\n\\t\\tcnt[2 * r + 1][h]++;\\n\\t}\\n\\n\\trep(i, n - 1) {\\n\\t\\tint r = le[i] / 2;\\n\\t\\tauto h = S.get(i - r + 1, i + r + 1);\\n\\t\\tdump(s.substr(i - r + 1, 2 * r));\\n\\t\\th_to_lr[h] = { i - r + 1, i + r + 1 };\\n\\t\\tcnt[2 * r][h]++;\\n\\t}\\n\\n\\trepir(len, n, 1) {\\n\\t\\tfor (auto [h, c] : cnt[len]) {\\n\\t\\t\\tauto [l, r] = h_to_lr[h];\\n\\n\\t\\t\\tif (len >= 2) {\\n\\t\\t\\t\\tauto nh = S.get(l + 1, r - 1);\\n\\t\\t\\t\\th_to_lr[nh] = { l + 1, r - 1 };\\n\\t\\t\\t\\tcnt[len - 2][nh] += c;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\treturn cnt;\\n}\\n\\n\\nint main() {\\n//\\tinput_from_file(\\\"input.txt\\\");\\n//\\toutput_to_file(\\\"output.txt\\\");\\n\\n\\tstring s, t;\\n\\tcin >> s >> t;\\n\\n\\tint n = sz(s), m = sz(t);\\n\\n\\tauto cs = count_palindromes(s);\\n\\tauto ct = count_palindromes(t);\\n\\tdumpel(cs); dumpel(ct);\\n\\n\\tll res = 0;\\n\\n\\trepi(len, 1, min(n, m)) {\\n\\t\\tfor (auto [h, c] : cs[len]) {\\n\\t\\t\\tres += c * ct[len][h];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 18292,\n \"score_of_the_acc\": -0.3625,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2292_8760492\",\n \"code_snippet\": \"// #line 1 \\\"library/Template/template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define 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 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){if(a<b){a=b;return 1;}return 0;}\\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\\ntemplate<typename T,typename U>T ceil(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?(x+y-1)/y:x/y);}\\ntemplate<typename T,typename U>T floor(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?x/y:(x-y+1)/y);}\\ntemplate<typename T>int popcnt(T x){return __builtin_popcountll(x);}\\ntemplate<typename T>int topbit(T x){return (x==0?-1:63-__builtin_clzll(x));}\\ntemplate<typename T>int lowbit(T x){return (x==0?-1:__builtin_ctzll(x));}\\n// #line 2 \\\"library/Utility/fastio.hpp\\\"\\n#include <unistd.h>\\n\\nclass FastIO{\\n static constexpr int L=1<<16;\\n char rdbuf[L];\\n int rdLeft=0,rdRight=0;\\n inline void reload(){\\n int len=rdRight-rdLeft;\\n memmove(rdbuf,rdbuf+rdLeft,len);\\n rdLeft=0,rdRight=len;\\n rdRight+=fread(rdbuf+len,1,L-len,stdin);\\n }\\n inline bool skip(){\\n for(;;){\\n while(rdLeft!=rdRight and rdbuf[rdLeft]<=' ')rdLeft++;\\n if(rdLeft==rdRight){\\n reload();\\n if(rdLeft==rdRight)return false;\\n }\\n else break;\\n }\\n return true;\\n }\\n template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline bool _read(T& x){\\n if(!skip())return false;\\n if(rdLeft+20>=rdRight)reload();\\n bool neg=false;\\n if(rdbuf[rdLeft]=='-'){\\n neg=true;\\n rdLeft++;\\n }\\n x=0;\\n while(rdbuf[rdLeft]>='0' and rdLeft<rdRight){\\n x=x*10+(neg?-(rdbuf[rdLeft++]^48):(rdbuf[rdLeft++]^48));\\n }\\n return true;\\n }\\n template<typename T,enable_if_t<is_floating_point<T>::value,int> =0>inline bool _read(T& x){\\n if(!skip())return false;\\n if(rdLeft+20>=rdRight)reload();\\n bool neg=false;\\n if(rdbuf[rdLeft]=='-'){\\n neg=true;\\n rdLeft++;\\n }\\n x=0;\\n while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){\\n x=x*10+(rdbuf[rdLeft++]^48);\\n }\\n if(rdbuf[rdLeft]!='.')return true;\\n rdLeft++;\\n T base=.1;\\n while(rdbuf[rdLeft]>='0' and rdbuf[rdLeft]<='9' and rdLeft<rdRight){\\n x+=base*(rdbuf[rdLeft++]^48);\\n base*=.1;\\n }\\n if(neg)x=-x;\\n return true;\\n }\\n inline bool _read(char& x){\\n if(!skip())return false;\\n if(rdLeft+1>=rdRight)reload();\\n x=rdbuf[rdLeft++];\\n return true;\\n }\\n inline bool _read(string& x){\\n if(!skip())return false;\\n for(;;){\\n int pos=rdLeft;\\n while(pos<rdRight and rdbuf[pos]>' ')pos++;\\n x.append(rdbuf+rdLeft,pos-rdLeft);\\n if(rdLeft==pos)break;\\n rdLeft=pos;\\n if(rdLeft==rdRight)reload();\\n else break;\\n }\\n return true;\\n }\\n template<typename T>inline bool _read(vector<T>& v){\\n for(auto& x:v){\\n if(!_read(x))return false;\\n }\\n return true;\\n }\\n\\n char wtbuf[L],tmp[50];\\n int wtRight=0;\\n inline void flush(){\\n fwrite(wtbuf,1,wtRight,stdout);\\n wtRight=0;\\n }\\n inline void _write(const char& x){\\n if(wtRight>L-32)flush();\\n wtbuf[wtRight++]=x;\\n }\\n inline void _write(const string& x){\\n for(auto& c:x)_write(c);\\n }\\n template<typename T,enable_if_t<is_integral<T>::value,int> =0>inline void _write(T x){\\n if(wtRight>L-32)flush();\\n if(x==0){\\n _write('0');\\n return;\\n }\\n else if(x<0){\\n _write('-');\\n if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {\\n switch (sizeof(x)) {\\n case 2: _write(\\\"32768\\\"); return;\\n case 4: _write(\\\"2147483648\\\"); return;\\n case 8: _write(\\\"9223372036854775808\\\"); return;\\n }\\n }\\n x=-x;\\n }\\n int pos=0;\\n while(x!=0){\\n tmp[pos++]=char((x%10)|48);\\n x/=10;\\n }\\n rep(i,0,pos)wtbuf[wtRight+i]=tmp[pos-1-i];\\n wtRight+=pos;\\n }\\n template<typename T>inline void _write(const vector<T>& v){\\n rep(i,0,v.size()){\\n if(i)_write(' ');\\n _write(v[i]);\\n }\\n }\\npublic:\\n FastIO(){}\\n ~FastIO(){flush();}\\n inline void read(){}\\n template <typename Head, typename... Tail>inline void read(Head& head,Tail&... tail){\\n assert(_read(head));\\n read(tail...);\\n }\\n template<bool ln=true,bool space=false>inline void write(){if(ln)_write('\\\\n');}\\n template <bool ln=true,bool space=false,typename Head, typename... Tail>inline void write(const Head& head,const Tail&... tail){\\n if(space)_write(' ');\\n _write(head);\\n write<ln,true>(tail...);\\n }\\n};\\n\\n/**\\n * @brief Fast IO\\n */\\n// #line 3 \\\"sol.cpp\\\"\\n\\n\\nnamespace Random{\\n mt19937_64 randgen(chrono::steady_clock::now().time_since_epoch().count());\\n using u64=unsigned long long;\\n static u64 get(){\\n return randgen();\\n }\\n template<typename T>static T get(T L){\\n return get()%(L+1);\\n }\\n template<typename T>static T get(T L,T R){\\n return get(R-L)+L;\\n }\\n double uniform(){\\n return double(get(1000000000))/1000000000;\\n }\\n string str(int n){\\n string ret;\\n rep(i,0,n)ret+=get('a','z');\\n return ret;\\n }\\n template<typename Iter>void shuffle(Iter first,Iter last){\\n if(first==last)return;\\n int len=1;\\n for(auto it=first+1;it!=last;it++){\\n len++;\\n int j=get(0,len-1);\\n if(j!=len-1)iter_swap(it,first+j);\\n }\\n }\\n template<typename T>vector<T> select(int n,T L,T R){\\n set<T> ret;\\n while(ret.size()<n)ret.insert(get(L,R));\\n return {ALL(ret)};\\n }\\n};\\n\\nstruct RollingHash {\\n using ull = unsigned long long;\\n const ull MOD = 0x1fffffffffffffff;\\n const ull base;\\n vector<ull> hashed, power;\\n\\n static constexpr ull mask(ll a){ return (1ULL << a) - 1; }\\n\\n inline ull mul(ull a, ull b) const {\\n __uint128_t ans = __uint128_t(a) * b;\\n ans = (ans >> 61) + (ans & MOD);\\n if(ans >= MOD) ans -= MOD;\\n return ans;\\n }\\n\\n static inline ull genbase(){return Random::get(ull(0x1fffffffffffffff));}\\n RollingHash()=default;\\n\\n RollingHash(const string &s,ull base):base(base){\\n ll n = s.size();\\n hashed.assign(n + 1, 0);\\n power.assign(n + 1, 0);\\n power[0] = 1;\\n for(ll i = 0; i < n; i++) {\\n power[i + 1] = mul(power[i], base);\\n hashed[i + 1] = mul(hashed[i], base) + s[i];\\n if(hashed[i + 1] >= MOD) hashed[i + 1] -= MOD;\\n }\\n }\\n\\n ull get(ll l, ll r) const {\\n ull ret = hashed[r] + MOD - mul(hashed[l], power[r - l]);\\n if(ret >= MOD) ret -= MOD;\\n return ret;\\n }\\n\\n ull connect(ull h1, ull h2, ll h2len) const {\\n ull ret = mul(h1, power[h2len]) + h2;\\n if(ret >= MOD) ret -= MOD;\\n return ret;\\n }\\n\\n void connect(const string &s){\\n ll n = hashed.size() - 1, m = s.size();\\n hashed.resize(n + m + 1);\\n power.resize(n + m + 1);\\n for(ll i = n; i < n + m; i++) {\\n power[i + 1] = mul(power[i], base);\\n hashed[i + 1] = mul(hashed[i], base) + s[i - n];\\n if(hashed[i + 1] >= MOD) hashed[i + 1] -= MOD;\\n }\\n }\\n\\n ll LCP(const RollingHash &b, ll l1, ll r1, ll l2, ll r2) {\\n ll len = min(r1 - l1, r2 - l2);\\n ll low = -1, high = len + 1;\\n while(high - low > 1) {\\n ll mid = (low + high) / 2;\\n if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;\\n else high = mid;\\n }\\n return low;\\n }\\n};\\n\\ntemplate<typename T>struct PalindromicTree{\\n struct Node{\\n map<char,int> nxt;\\n int link,len,id,cnt;\\n Node(){}\\n Node(int link,int len,int id,int cnt):link(link),len(len),id(id),cnt(cnt){}\\n };\\n T S;\\n vector<Node> nodes;\\n PalindromicTree(){}\\n PalindromicTree(const T& S):S(S){\\n nodes.push_back(Node(0,-1,-1,0));\\n nodes.push_back(Node(0,0,-1,0));\\n int cur=0;\\n\\n rep(i,0,SZ(S)){\\n int k=find(i,cur);\\n char c=S[i];\\n if(nodes[k].nxt.count(c)){\\n cur=nodes[k].nxt[c];\\n nodes[cur].cnt++;\\n continue;\\n }\\n nodes[k].nxt[c]=SZ(nodes);\\n cur=SZ(nodes);\\n nodes.push_back(Node(-1,nodes[k].len+2,i-nodes[k].len-1,1));\\n if(nodes.back().len==1)nodes.back().link=1;\\n else{\\n int n=find(i,nodes[k].link);\\n nodes.back().link=nodes[n].nxt[c];\\n }\\n }\\n }\\n vector<array<int,3>> get_freq(){\\n vector<array<int,3>> ret;\\n for(int i=SZ(nodes)-1;i>=2;i--){\\n ret.push_back({nodes[i].len,nodes[i].id,nodes[i].cnt});\\n nodes[nodes[i].link].cnt+=nodes[i].cnt;\\n }\\n return ret;\\n }\\nprivate:\\n int find(int last,int k)const{\\n for(;;){\\n int i=last-1-nodes[k].len;\\n if(i>=0 and S[i]==S[last])break;\\n k=nodes[k].link;\\n }\\n return k;\\n }\\n};\\n\\nFastIO io;\\nint main(){\\n string S,T;\\n io.read(S,T);\\n\\n using ull = unsigned long long;\\n PalindromicTree<string> t1(S),t2(T);\\n auto base=RollingHash::genbase();\\n RollingHash rh1(S,base),rh2(T,base);\\n auto f1=t1.get_freq();\\n auto f2=t2.get_freq();\\n\\n map<ull,ll> mp;\\n for(auto& [len,id,cnt]:f1){\\n // cerr<<len<<' '<<id<<' '<<cnt<<'\\\\n';\\n mp[rh1.get(id,id+len)]+=cnt;\\n }\\n ll ret=0;\\n for(auto& [len,id,cnt]:f2)ret+=mp[rh2.get(id,id+len)]*cnt;\\n io.write(ret);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 24968,\n \"score_of_the_acc\": -0.57,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2292_8479596\",\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\\nusing ull = unsigned long long;\\nconst ull mod = (1LL << 61) - 1;\\n\\nnamespace Hash {\\null getmod(ull x) {\\n ull ret = (x >> 61) + (x & mod);\\n if (ret >= mod) ret -= mod;\\n return ret;\\n}\\n\\null mul(ull x, ull y) {\\n x = getmod(x), y = getmod(y);\\n ull x1 = x >> 31;\\n ull x2 = x & ((1LL << 31) - 1);\\n ull y1 = y >> 31;\\n ull y2 = y & ((1LL << 31) - 1);\\n ull z = x1 * y2 + x2 * y1;\\n ull z1 = z >> 30;\\n ull z2 = z & ((1LL << 30) - 1);\\n return getmod(x1 * y1 * 2 + x2 * y2 + z1 + (z2 << 31));\\n}\\n} // namespace Hash\\n\\ntemplate <typename T>\\nstruct RollingHash {\\n const int n;\\n const ull b;\\n vector<ull> h, p;\\n\\n RollingHash(const T &s, ull b = 887446835055281585) : n(sz(s)), b(b) {\\n h.assign(n + 1, 0);\\n p.assign(n + 1, 1);\\n rep(i, n) {\\n p[i + 1] = Hash::mul(p[i], b);\\n h[i + 1] = Hash::mul(h[i], b) + s[i];\\n if (h[i + 1] >= mod) h[i + 1] -= mod;\\n }\\n }\\n\\n ull gethash(int l, int r) {\\n ull ret = h[r] + mod - Hash::mul(h[l], p[r - l]);\\n if (ret >= mod) ret -= mod;\\n return ret;\\n }\\n\\n ull getallhash() { return h[n]; }\\n};\\n\\ntemplate <typename T>\\nvector<int> manachar(const T &s) {\\n int n = sz(s);\\n vector<int> ret(n);\\n int i = 0, j = 0;\\n while (i < n) {\\n while (i - j >= 0 && i + j < n && s[i + j] == s[i - j]) j++;\\n ret[i] = j;\\n int k = 1;\\n while (i - k >= 0 && k + ret[i - k] < j) ret[i + k] = ret[i - k], k++;\\n i += k, j -= k;\\n }\\n return ret;\\n}\\n\\nint main() {\\n string S, T;\\n cin >> S >> T;\\n\\n int N = sz(S), M = sz(T);\\n\\n RollingHash hashS(S), hashT(T);\\n\\n auto getPalindromeLen = [](string S) {\\n int n = sz(S);\\n string X = \\\".\\\";\\n rep(i, n) X += S[i], X += \\\".\\\";\\n auto a = manachar(X);\\n // print(a);\\n\\n vector<vector<int>> ret(2, vector<int>(n));\\n rep(i, n) {\\n ret[0][i] = a[2 * i + 1] / 2;\\n ret[1][i] = a[2 * i] / 2;\\n }\\n\\n // rep(i, 2) print(ret[i]);\\n\\n return ret;\\n };\\n\\n vector<vector<int>> ms = getPalindromeLen(S), mt = getPalindromeLen(T);\\n\\n auto solve = [&](vector<int> a, vector<int> b) {\\n map<ull, int> mp;\\n int K = 0;\\n mp[0] = K++;\\n vector<vector<int>> es;\\n es.eb();\\n\\n vector<ll> cnt;\\n cnt.eb(0);\\n\\n // print(a);\\n\\n rep(i, N) {\\n int ok = 0, ng = a[i] + 1;\\n while (abs(ok - ng) > 1) {\\n int mid = (ok + ng) / 2;\\n // cout << i MM i + mid << endl;\\n ull x = hashS.gethash(i, i + mid);\\n (mp.count(x) ? ok : ng) = mid;\\n }\\n\\n // cout << i MM ok << endl;\\n\\n int p = mp[hashS.gethash(i, i + ok)];\\n rep2(j, ok + 1, a[i] + 1) {\\n ull x = hashS.gethash(i, i + j);\\n es[p].eb(K);\\n p = K;\\n mp[x] = K++;\\n es.eb();\\n cnt.eb(0);\\n }\\n\\n {\\n ull x = hashS.gethash(i, i + a[i]);\\n cnt[mp[x]]++;\\n }\\n }\\n\\n auto dfs1 = [&](auto &&dfs1, int now) -> ll {\\n each(e, es[now]) {\\n cnt[now] += dfs1(dfs1, e); //\\n }\\n return cnt[now];\\n };\\n\\n dfs1(dfs1, 0);\\n\\n cnt[0] = 0;\\n\\n auto dfs2 = [&](auto &&dfs2, int now) -> void {\\n each(e, es[now]) {\\n cnt[e] += cnt[now];\\n dfs2(dfs2, e);\\n }\\n };\\n\\n dfs2(dfs2, 0);\\n\\n ll ret = 0;\\n\\n rep(i, M) {\\n int ok = 0, ng = b[i] + 1;\\n while (abs(ok - ng) > 1) {\\n int mid = (ok + ng) / 2;\\n ull x = hashT.gethash(i, i + mid);\\n (mp.count(x) ? ok : ng) = mid;\\n }\\n\\n // cout << K MM i MM i + ok << endl;\\n\\n ret += cnt[mp[hashT.gethash(i, i + ok)]];\\n }\\n\\n return ret;\\n };\\n\\n ll ans = 0;\\n rep(i, 2) ans += solve(ms[i], mt[i]);\\n\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 13768,\n \"score_of_the_acc\": -1.084,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2292_8458496\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\n#define inf 1000000007\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define fi first\\n#define se second\\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\\n#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)\\n#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)\\n#define all(x) (x).begin(),(x).end()\\n#define SUM(v) accumulate(all(v), 0LL)\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\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 UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\n#define SZ(c) (int)(c).size()\\ntemplate<typename T>\\nostream& operator << (ostream& os, vector<T>& vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i<(int)vec.size(); i++) {\\n os << vec[i] << (i + 1 == (int)vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n// pair出力\\ntemplate<typename T, typename U>\\nostream& operator << (ostream& os, pair<T, U> pair_var) {\\n os << \\\"(\\\" << pair_var.first << \\\", \\\" << pair_var.second << \\\")\\\";\\n return os;\\n}\\n// map出力\\ntemplate<typename T, typename U>\\nostream& operator << (ostream& os, 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()) os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n// set 出力\\ntemplate<typename T>\\nostream& operator << (ostream& os, 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()) os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n// tuple 出力\\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#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 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}\\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 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); }\\n#ifdef LOCAL\\nvoid debug_out() { cerr << endl; }\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n cerr << \\\" \\\" << H;\\n debug_out(T...);\\n}\\n#define dbg(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", debug_out(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define dbg(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\ntemplate<typename A, typename T>\\nstd::enable_if_t<std::is_convertible<T, A>::value> fill(A& array, const T& val)\\n{\\n array = val;\\n}\\ntemplate<typename A, typename T>\\nstd::enable_if_t<!std::is_convertible<T, A>::value> fill(A& array, const T& val)\\n{\\n for (auto& a : array) {\\n fill(a, val);\\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}\\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}\\nvector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}\\ntemplate <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}\\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; }\\nll allbit(ll n) { return (1LL << n) - 1; }\\nint popcount(signed t) { return __builtin_popcount(t); }\\nint popcount(ll t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\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> void 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}\\ntemplate<class T> inline bool chmax(T &a, T b){\\n if(a<b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<class T> inline bool chmin(T &a, T b){\\n if(a>b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n\\nstd::vector<int> sa_naive(const std::vector<int>& s) {\\n int n = int(s.size());\\n std::vector<int> sa(n);\\n std::iota(sa.begin(), sa.end(), 0);\\n std::sort(sa.begin(), sa.end(), [&](int l, int r) {\\n if (l == r) return false;\\n while (l < n && r < n) {\\n if (s[l] != s[r]) return s[l] < s[r];\\n l++;\\n r++;\\n }\\n return l == n;\\n });\\n return sa;\\n}\\n\\nstd::vector<int> sa_doubling(const std::vector<int>& s) {\\n int n = int(s.size());\\n std::vector<int> sa(n), rnk = s, tmp(n);\\n std::iota(sa.begin(), sa.end(), 0);\\n for (int k = 1; k < n; k *= 2) {\\n auto cmp = [&](int x, int y) {\\n if (rnk[x] != rnk[y]) return rnk[x] < rnk[y];\\n int rx = x + k < n ? rnk[x + k] : -1;\\n int ry = y + k < n ? rnk[y + k] : -1;\\n return rx < ry;\\n };\\n std::sort(sa.begin(), sa.end(), cmp);\\n tmp[sa[0]] = 0;\\n for (int i = 1; i < n; i++) {\\n tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);\\n }\\n std::swap(tmp, rnk);\\n }\\n return sa;\\n}\\n\\n// SA-IS, linear-time suffix array construction\\n// Reference:\\n// G. Nong, S. Zhang, and W. H. Chan,\\n// Two Efficient Algorithms for Linear Time Suffix Array Construction\\ntemplate <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>\\nstd::vector<int> sa_is(const std::vector<int>& s, int upper) {\\n int n = int(s.size());\\n if (n == 0) return {};\\n if (n == 1) return {0};\\n if (n == 2) {\\n if (s[0] < s[1]) {\\n return {0, 1};\\n } else {\\n return {1, 0};\\n }\\n }\\n if (n < THRESHOLD_NAIVE) {\\n return sa_naive(s);\\n }\\n if (n < THRESHOLD_DOUBLING) {\\n return sa_doubling(s);\\n }\\n\\n std::vector<int> sa(n);\\n std::vector<bool> ls(n);\\n for (int i = n - 2; i >= 0; i--) {\\n ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);\\n }\\n std::vector<int> sum_l(upper + 1), sum_s(upper + 1);\\n for (int i = 0; i < n; i++) {\\n if (!ls[i]) {\\n sum_s[s[i]]++;\\n } else {\\n sum_l[s[i] + 1]++;\\n }\\n }\\n for (int i = 0; i <= upper; i++) {\\n sum_s[i] += sum_l[i];\\n if (i < upper) sum_l[i + 1] += sum_s[i];\\n }\\n\\n auto induce = [&](const std::vector<int>& lms) {\\n std::fill(sa.begin(), sa.end(), -1);\\n std::vector<int> buf(upper + 1);\\n std::copy(sum_s.begin(), sum_s.end(), buf.begin());\\n for (auto d : lms) {\\n if (d == n) continue;\\n sa[buf[s[d]]++] = d;\\n }\\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\\n sa[buf[s[n - 1]]++] = n - 1;\\n for (int i = 0; i < n; i++) {\\n int v = sa[i];\\n if (v >= 1 && !ls[v - 1]) {\\n sa[buf[s[v - 1]]++] = v - 1;\\n }\\n }\\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\\n for (int i = n - 1; i >= 0; i--) {\\n int v = sa[i];\\n if (v >= 1 && ls[v - 1]) {\\n sa[--buf[s[v - 1] + 1]] = v - 1;\\n }\\n }\\n };\\n\\n std::vector<int> lms_map(n + 1, -1);\\n int m = 0;\\n for (int i = 1; i < n; i++) {\\n if (!ls[i - 1] && ls[i]) {\\n lms_map[i] = m++;\\n }\\n }\\n std::vector<int> lms;\\n lms.reserve(m);\\n for (int i = 1; i < n; i++) {\\n if (!ls[i - 1] && ls[i]) {\\n lms.push_back(i);\\n }\\n }\\n\\n induce(lms);\\n\\n if (m) {\\n std::vector<int> sorted_lms;\\n sorted_lms.reserve(m);\\n for (int v : sa) {\\n if (lms_map[v] != -1) sorted_lms.push_back(v);\\n }\\n std::vector<int> rec_s(m);\\n int rec_upper = 0;\\n rec_s[lms_map[sorted_lms[0]]] = 0;\\n for (int i = 1; i < m; i++) {\\n int l = sorted_lms[i - 1], r = sorted_lms[i];\\n int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;\\n int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;\\n bool same = true;\\n if (end_l - l != end_r - r) {\\n same = false;\\n } else {\\n while (l < end_l) {\\n if (s[l] != s[r]) {\\n break;\\n }\\n l++;\\n r++;\\n }\\n if (l == n || s[l] != s[r]) same = false;\\n }\\n if (!same) rec_upper++;\\n rec_s[lms_map[sorted_lms[i]]] = rec_upper;\\n }\\n\\n auto rec_sa =\\n sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);\\n\\n for (int i = 0; i < m; i++) {\\n sorted_lms[i] = lms[rec_sa[i]];\\n }\\n induce(sorted_lms);\\n }\\n return sa;\\n}\\n\\nstd::vector<int> suffix_array(const std::string& s) {\\n int n = int(s.size());\\n std::vector<int> s2(n);\\n for (int i = 0; i < n; i++) {\\n s2[i] = s[i];\\n }\\n return sa_is(s2, 255);\\n}\\n\\ntemplate <class T>\\nstd::vector<int> lcp_array(const std::vector<T>& s,\\n const std::vector<int>& sa) {\\n int n = int(s.size());\\n assert(n >= 1);\\n std::vector<int> rnk(n);\\n for (int i = 0; i < n; i++) {\\n rnk[sa[i]] = i;\\n }\\n std::vector<int> lcp(n - 1);\\n int h = 0;\\n for (int i = 0; i < n; i++) {\\n if (h > 0) h--;\\n if (rnk[i] == 0) continue;\\n int j = sa[rnk[i] - 1];\\n for (; j + h < n && i + h < n; h++) {\\n if (s[j + h] != s[i + h]) break;\\n }\\n lcp[rnk[i] - 1] = h;\\n }\\n return lcp;\\n}\\n\\nstd::vector<int> lcp_array(const std::string& s, const std::vector<int>& sa) {\\n int n = int(s.size());\\n std::vector<int> s2(n);\\n for (int i = 0; i < n; i++) {\\n s2[i] = s[i];\\n }\\n return lcp_array(s2, sa);\\n}\\n\\ntemplate<typename T> class segtree {\\nprivate:\\n int n,sz,h; vector<T> node, lazy_update, lazy_add; vector<bool> lazyFlag;\\npublic:\\n segtree(vector<T> v) : n(1), sz((int)v.size()), h(0){\\n while(n < sz) n *= 2, h++;\\n node.resize(2*n, 0);\\n lazy_update.resize(2*n, 0); lazyFlag.resize(2*n, false);\\n lazy_add.resize(2*n, 0);\\n for(int i = 0; i < sz; i++) node[i+n] = v[i];\\n for(int i=n-1; i>=1; i--) node[i] = node[2*i] + node[2*i+1];\\n }\\n void eval(int k) {\\n if(lazyFlag[k]){\\n lazy_update[k] += lazy_add[k];\\n node[k] = lazy_update[k];\\n if(k < n) {\\n lazy_add[2*k] = lazy_add[2*k+1] = 0;\\n lazy_update[2*k] = lazy_update[2*k+1] = lazy_update[k] / 2;\\n lazyFlag[2*k] = lazyFlag[2*k+1] = true;\\n }\\n lazy_add[k] = 0, lazyFlag[k] = false;\\n }else if(lazy_add[k] != 0){\\n node[k] += lazy_add[k];\\n if(k < n){\\n lazy_add[2*k] += lazy_add[k] / 2; lazy_add[2*k+1] += lazy_add[k] / 2;\\n }\\n lazy_add[k] = 0;\\n }\\n }\\n void update(int a, int b, T x, int k=1, int l=0, int r=-1) {\\n if(r < 0) r = n;\\n eval(k);\\n if(b <= l || r <= a) return;\\n if(a <= l && r <= b){\\n lazy_update[k] = x*(r-l); lazyFlag[k] = true; eval(k);\\n }else{\\n update(a, b, x, 2*k, l, (l+r)/2); update(a, b, x, 2*k+1, (l+r)/2, r);\\n node[k] = node[2*k] + node[2*k+1];\\n }\\n }\\n void add(int a, int b, T x, int k=1, int l=0, int r=-1){\\n if(r < 0) r = n;\\n eval(k);\\n if(b <= l || r <= a) return;\\n if(a <= l && r <= b){\\n lazy_add[k] += x*(r-l); eval(k);\\n }else{\\n add(a, b, x, 2*k, l, (l+r)/2); add(a, b, x, 2*k+1, (l+r)/2, r);\\n node[k] = node[2*k] + node[2*k+1];\\n }\\n }\\n T query(int a, int b) {\\n a += n, b += n - 1;\\n for(int i = h; i > 0; i--) eval(a >> i), eval(b >> i);\\n b++;\\n T res1 = 0, res2 = 0;\\n while(a < b) {\\n if(a & 1) eval(a), res1 += node[a++];\\n if(b & 1) eval(--b), res2 += node[b];\\n a >>= 1, b >>= 1;\\n }\\n return res1 + res2;\\n }\\n void print(){for(int i = 0; i < sz; i++)cout<<query(i,i+1)<< \\\" \\\";cout<<endl;}\\n};\\n\\n\\n\\n\\n//iを中心とする最長の回文の半径をR[i]に格納(O(n))\\n// abaab を $a$b$a$a$b$ みたいにすると偶数長のもの求めることが可能\\nvoid manacher(const string& S,vector<int>& res)\\n{\\n int sz = (int)S.size(), i = 0, j = 0, k;\\n res.resize(sz);\\n while(i < sz){\\n while(i-j >= 0 && i+j < sz && S[i-j] == S[i+j]) j++;\\n res[i] = j, k = 1;\\n while(i-k >= 0 && i+k < sz && k+res[i-k] < j){\\n res[i+k] = res[i-k], k++;\\n }\\n i += k; j -= k;\\n }\\n}\\n\\n\\nint main(){\\n STR(s,t);\\n string Q;\\n rep(i,s.size()){\\n Q.push_back('$');\\n Q.push_back(s[i]);\\n }\\n Q.push_back('$');\\n Q.push_back('|');\\n int T = Q.size();\\n rep(i,t.size()){\\n Q.push_back('$');\\n Q.push_back(t[i]);\\n }\\n Q.push_back('$');\\n vector<int> mana;\\n manacher(Q,mana);\\n // cerr << mana << endl;\\n int n = Q.size();\\n \\n auto sa = suffix_array(Q);\\n auto lcp = lcp_array(Q,sa);\\n ll res = 0;\\n vector<ll> ppp(30000);\\n segtree<ll> segS(ppp);\\n segtree<ll> segT(ppp);\\n // cerr << Q << endl;\\n for(int i=0;i<sa.size();i++){\\n int id = sa[i];\\n int LCP = inf;\\n if(i!=0)chmin(LCP,lcp[i-1]);\\n if(Q[id]=='$'){\\n int len = LCP/2; \\n segS.update(len+1,30000,0);\\n segT.update(len+1,30000,0);\\n }else{\\n int len = (LCP+1)/2;\\n segS.update(len+1,30000,0);\\n segT.update(len+1,30000,0);\\n }\\n if(Q[id]=='|')continue;\\n if(id<T){\\n int len = mana[id]/2;\\n res += segT.query(1,len+1);\\n segS.add(0,len+1,1);\\n }else{\\n int len = mana[id]/2;\\n res += segS.query(1,len+1);\\n segT.add(0,len+1,1);\\n }\\n // cerr << id << endl;\\n // cerr << Q.substr(id) << endl;\\n // dbg(res);\\n }\\n cout << res << endl;\\n\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 9928,\n \"score_of_the_acc\": -0.6543,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2292_8458485\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\n#define inf 1000000007\\n#define MP make_pair\\n#define MT make_tuple\\n#define PB push_back\\n#define fi first\\n#define se second\\n#define rep(i,n) for(int i = 0; i < (int)(n); ++i)\\n#define rrep(i,n) for(int i = (int)n-1; i >= 0; --i)\\n#define srep(i,a,b) for(int i = (int)a; i < (int)(b); ++i)\\n#define all(x) (x).begin(),(x).end()\\n#define SUM(v) accumulate(all(v), 0LL)\\n#define MIN(v) *min_element(all(v))\\n#define MAX(v) *max_element(all(v))\\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 UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\\n#define SZ(c) (int)(c).size()\\ntemplate<typename T>\\nostream& operator << (ostream& os, vector<T>& vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i<(int)vec.size(); i++) {\\n os << vec[i] << (i + 1 == (int)vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n// pair出力\\ntemplate<typename T, typename U>\\nostream& operator << (ostream& os, pair<T, U> pair_var) {\\n os << \\\"(\\\" << pair_var.first << \\\", \\\" << pair_var.second << \\\")\\\";\\n return os;\\n}\\n// map出力\\ntemplate<typename T, typename U>\\nostream& operator << (ostream& os, 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()) os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n// set 出力\\ntemplate<typename T>\\nostream& operator << (ostream& os, 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()) os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n// tuple 出力\\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#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 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}\\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 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); }\\n#ifdef LOCAL\\nvoid debug_out() { cerr << endl; }\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head H, Tail... T) {\\n cerr << \\\" \\\" << H;\\n debug_out(T...);\\n}\\n#define dbg(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", debug_out(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define dbg(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\ntemplate<typename A, typename T>\\nstd::enable_if_t<std::is_convertible<T, A>::value> fill(A& array, const T& val)\\n{\\n array = val;\\n}\\ntemplate<typename A, typename T>\\nstd::enable_if_t<!std::is_convertible<T, A>::value> fill(A& array, const T& val)\\n{\\n for (auto& a : array) {\\n fill(a, val);\\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}\\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}\\nvector<int> iota(int n) {vector<int> a(n);iota(all(a), 0);return a;}\\ntemplate <class T> T POW(T x, int n) {T res = 1;for(; n; n >>= 1, x *= x){if(n & 1) res *= x;}return res;}\\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; }\\nll allbit(ll n) { return (1LL << n) - 1; }\\nint popcount(signed t) { return __builtin_popcount(t); }\\nint popcount(ll t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\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> void 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}\\ntemplate<class T> inline bool chmax(T &a, T b){\\n if(a<b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<class T> inline bool chmin(T &a, T b){\\n if(a>b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n\\nstd::vector<int> sa_naive(const std::vector<int>& s) {\\n int n = int(s.size());\\n std::vector<int> sa(n);\\n std::iota(sa.begin(), sa.end(), 0);\\n std::sort(sa.begin(), sa.end(), [&](int l, int r) {\\n if (l == r) return false;\\n while (l < n && r < n) {\\n if (s[l] != s[r]) return s[l] < s[r];\\n l++;\\n r++;\\n }\\n return l == n;\\n });\\n return sa;\\n}\\n\\nstd::vector<int> sa_doubling(const std::vector<int>& s) {\\n int n = int(s.size());\\n std::vector<int> sa(n), rnk = s, tmp(n);\\n std::iota(sa.begin(), sa.end(), 0);\\n for (int k = 1; k < n; k *= 2) {\\n auto cmp = [&](int x, int y) {\\n if (rnk[x] != rnk[y]) return rnk[x] < rnk[y];\\n int rx = x + k < n ? rnk[x + k] : -1;\\n int ry = y + k < n ? rnk[y + k] : -1;\\n return rx < ry;\\n };\\n std::sort(sa.begin(), sa.end(), cmp);\\n tmp[sa[0]] = 0;\\n for (int i = 1; i < n; i++) {\\n tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);\\n }\\n std::swap(tmp, rnk);\\n }\\n return sa;\\n}\\n\\n// SA-IS, linear-time suffix array construction\\n// Reference:\\n// G. Nong, S. Zhang, and W. H. Chan,\\n// Two Efficient Algorithms for Linear Time Suffix Array Construction\\ntemplate <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>\\nstd::vector<int> sa_is(const std::vector<int>& s, int upper) {\\n int n = int(s.size());\\n if (n == 0) return {};\\n if (n == 1) return {0};\\n if (n == 2) {\\n if (s[0] < s[1]) {\\n return {0, 1};\\n } else {\\n return {1, 0};\\n }\\n }\\n if (n < THRESHOLD_NAIVE) {\\n return sa_naive(s);\\n }\\n if (n < THRESHOLD_DOUBLING) {\\n return sa_doubling(s);\\n }\\n\\n std::vector<int> sa(n);\\n std::vector<bool> ls(n);\\n for (int i = n - 2; i >= 0; i--) {\\n ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);\\n }\\n std::vector<int> sum_l(upper + 1), sum_s(upper + 1);\\n for (int i = 0; i < n; i++) {\\n if (!ls[i]) {\\n sum_s[s[i]]++;\\n } else {\\n sum_l[s[i] + 1]++;\\n }\\n }\\n for (int i = 0; i <= upper; i++) {\\n sum_s[i] += sum_l[i];\\n if (i < upper) sum_l[i + 1] += sum_s[i];\\n }\\n\\n auto induce = [&](const std::vector<int>& lms) {\\n std::fill(sa.begin(), sa.end(), -1);\\n std::vector<int> buf(upper + 1);\\n std::copy(sum_s.begin(), sum_s.end(), buf.begin());\\n for (auto d : lms) {\\n if (d == n) continue;\\n sa[buf[s[d]]++] = d;\\n }\\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\\n sa[buf[s[n - 1]]++] = n - 1;\\n for (int i = 0; i < n; i++) {\\n int v = sa[i];\\n if (v >= 1 && !ls[v - 1]) {\\n sa[buf[s[v - 1]]++] = v - 1;\\n }\\n }\\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\\n for (int i = n - 1; i >= 0; i--) {\\n int v = sa[i];\\n if (v >= 1 && ls[v - 1]) {\\n sa[--buf[s[v - 1] + 1]] = v - 1;\\n }\\n }\\n };\\n\\n std::vector<int> lms_map(n + 1, -1);\\n int m = 0;\\n for (int i = 1; i < n; i++) {\\n if (!ls[i - 1] && ls[i]) {\\n lms_map[i] = m++;\\n }\\n }\\n std::vector<int> lms;\\n lms.reserve(m);\\n for (int i = 1; i < n; i++) {\\n if (!ls[i - 1] && ls[i]) {\\n lms.push_back(i);\\n }\\n }\\n\\n induce(lms);\\n\\n if (m) {\\n std::vector<int> sorted_lms;\\n sorted_lms.reserve(m);\\n for (int v : sa) {\\n if (lms_map[v] != -1) sorted_lms.push_back(v);\\n }\\n std::vector<int> rec_s(m);\\n int rec_upper = 0;\\n rec_s[lms_map[sorted_lms[0]]] = 0;\\n for (int i = 1; i < m; i++) {\\n int l = sorted_lms[i - 1], r = sorted_lms[i];\\n int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;\\n int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;\\n bool same = true;\\n if (end_l - l != end_r - r) {\\n same = false;\\n } else {\\n while (l < end_l) {\\n if (s[l] != s[r]) {\\n break;\\n }\\n l++;\\n r++;\\n }\\n if (l == n || s[l] != s[r]) same = false;\\n }\\n if (!same) rec_upper++;\\n rec_s[lms_map[sorted_lms[i]]] = rec_upper;\\n }\\n\\n auto rec_sa =\\n sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);\\n\\n for (int i = 0; i < m; i++) {\\n sorted_lms[i] = lms[rec_sa[i]];\\n }\\n induce(sorted_lms);\\n }\\n return sa;\\n}\\n\\nstd::vector<int> suffix_array(const std::string& s) {\\n int n = int(s.size());\\n std::vector<int> s2(n);\\n for (int i = 0; i < n; i++) {\\n s2[i] = s[i];\\n }\\n return sa_is(s2, 255);\\n}\\n\\ntemplate <class T>\\nstd::vector<int> lcp_array(const std::vector<T>& s,\\n const std::vector<int>& sa) {\\n int n = int(s.size());\\n assert(n >= 1);\\n std::vector<int> rnk(n);\\n for (int i = 0; i < n; i++) {\\n rnk[sa[i]] = i;\\n }\\n std::vector<int> lcp(n - 1);\\n int h = 0;\\n for (int i = 0; i < n; i++) {\\n if (h > 0) h--;\\n if (rnk[i] == 0) continue;\\n int j = sa[rnk[i] - 1];\\n for (; j + h < n && i + h < n; h++) {\\n if (s[j + h] != s[i + h]) break;\\n }\\n lcp[rnk[i] - 1] = h;\\n }\\n return lcp;\\n}\\n\\nstd::vector<int> lcp_array(const std::string& s, const std::vector<int>& sa) {\\n int n = int(s.size());\\n std::vector<int> s2(n);\\n for (int i = 0; i < n; i++) {\\n s2[i] = s[i];\\n }\\n return lcp_array(s2, sa);\\n}\\n\\ntemplate<typename T> class segtree {\\nprivate:\\n int n,sz,h; vector<T> node, lazy_update, lazy_add; vector<bool> lazyFlag;\\npublic:\\n segtree(vector<T> v) : n(1), sz((int)v.size()), h(0){\\n while(n < sz) n *= 2, h++;\\n node.resize(2*n, 0);\\n lazy_update.resize(2*n, 0); lazyFlag.resize(2*n, false);\\n lazy_add.resize(2*n, 0);\\n for(int i = 0; i < sz; i++) node[i+n] = v[i];\\n for(int i=n-1; i>=1; i--) node[i] = node[2*i] + node[2*i+1];\\n }\\n void eval(int k) {\\n if(lazyFlag[k]){\\n lazy_update[k] += lazy_add[k];\\n node[k] = lazy_update[k];\\n if(k < n) {\\n lazy_add[2*k] = lazy_add[2*k+1] = 0;\\n lazy_update[2*k] = lazy_update[2*k+1] = lazy_update[k] / 2;\\n lazyFlag[2*k] = lazyFlag[2*k+1] = true;\\n }\\n lazy_add[k] = 0, lazyFlag[k] = false;\\n }else if(lazy_add[k] != 0){\\n node[k] += lazy_add[k];\\n if(k < n){\\n lazy_add[2*k] += lazy_add[k] / 2; lazy_add[2*k+1] += lazy_add[k] / 2;\\n }\\n lazy_add[k] = 0;\\n }\\n }\\n void update(int a, int b, T x, int k=1, int l=0, int r=-1) {\\n if(r < 0) r = n;\\n eval(k);\\n if(b <= l || r <= a) return;\\n if(a <= l && r <= b){\\n lazy_update[k] = x*(r-l); lazyFlag[k] = true; eval(k);\\n }else{\\n update(a, b, x, 2*k, l, (l+r)/2); update(a, b, x, 2*k+1, (l+r)/2, r);\\n node[k] = node[2*k] + node[2*k+1];\\n }\\n }\\n void add(int a, int b, T x, int k=1, int l=0, int r=-1){\\n if(r < 0) r = n;\\n eval(k);\\n if(b <= l || r <= a) return;\\n if(a <= l && r <= b){\\n lazy_add[k] += x*(r-l); eval(k);\\n }else{\\n add(a, b, x, 2*k, l, (l+r)/2); add(a, b, x, 2*k+1, (l+r)/2, r);\\n node[k] = node[2*k] + node[2*k+1];\\n }\\n }\\n T query(int a, int b) {\\n a += n, b += n - 1;\\n for(int i = h; i > 0; i--) eval(a >> i), eval(b >> i);\\n b++;\\n T res1 = 0, res2 = 0;\\n while(a < b) {\\n if(a & 1) eval(a), res1 += node[a++];\\n if(b & 1) eval(--b), res2 += node[b];\\n a >>= 1, b >>= 1;\\n }\\n return res1 + res2;\\n }\\n void print(){for(int i = 0; i < sz; i++)cout<<query(i,i+1)<< \\\" \\\";cout<<endl;}\\n};\\n\\n\\n\\n\\n//iを中心とする最長の回文の半径をR[i]に格納(O(n))\\n// abaab を $a$b$a$a$b$ みたいにすると偶数長のもの求めることが可能\\nvoid manacher(const string& S,vector<int>& res)\\n{\\n int sz = (int)S.size(), i = 0, j = 0, k;\\n res.resize(sz);\\n while(i < sz){\\n while(i-j >= 0 && i+j < sz && S[i-j] == S[i+j]) j++;\\n res[i] = j, k = 1;\\n while(i-k >= 0 && i+k < sz && k+res[i-k] < j){\\n res[i+k] = res[i-k], k++;\\n }\\n i += k; j -= k;\\n }\\n}\\n\\n\\nint main(){\\n STR(s,t);\\n string Q;\\n rep(i,s.size()){\\n Q.push_back('$');\\n Q.push_back(s[i]);\\n }\\n Q.push_back('$');\\n Q.push_back('|');\\n int T = Q.size();\\n rep(i,t.size()){\\n Q.push_back('$');\\n Q.push_back(t[i]);\\n }\\n Q.push_back('$');\\n vector<int> mana;\\n manacher(Q,mana);\\n // cerr << mana << endl;\\n int n = Q.size();\\n \\n auto sa = suffix_array(Q);\\n auto lcp = lcp_array(Q,sa);\\n ll res = 0;\\n vector<ll> ppp(30000);\\n segtree<ll> segS(ppp);\\n segtree<ll> segT(ppp);\\n // cerr << Q << endl;\\n for(int i=0;i<sa.size();i++){\\n int id = sa[i];\\n int LCP = inf;\\n if(i!=0)chmin(LCP,lcp[i-1]);\\n if(Q[id]=='$'){\\n int len = LCP/2; \\n segS.update(len+1,30000,0);\\n segT.update(len+1,30000,0);\\n }else{\\n int len = (LCP+1)/2;\\n segS.update(len+1,30000,0);\\n segT.update(len+1,30000,0);\\n }\\n if(id<T){\\n int len = mana[id]/2;\\n res += segT.query(1,len+1);\\n segS.add(0,len+1,1);\\n }else{\\n int len = mana[id]/2;\\n res += segS.query(1,len+1);\\n segT.add(0,len+1,1);\\n }\\n // cerr << id << endl;\\n // cerr << Q.substr(id) << endl;\\n // dbg(res);\\n }\\n cout << res << endl;\\n\\n \\n return 0;\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 160,\n \"memory_kb\": 9680,\n \"score_of_the_acc\": -0.5431,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2292_7743077\",\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 <cstring>\\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\\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\\nnamespace ebi {\\n\\nstruct random_number_generator_64 {\\nprivate:\\n using u64 = std::uint64_t;\\n std::random_device rnd;\\n std::mt19937_64 mt;\\npublic:\\n random_number_generator_64() : mt(rnd()) { }\\n\\n u64 get(u64 a, u64 b) {\\n std::uniform_int_distribution<u64> dist(a, b-1);\\n return dist(mt);\\n }\\n};\\n\\n}\\n\\nnamespace ebi {\\n\\nusing u64 = std::uint64_t;\\nconst u64 mod = (1ull << 61) - 1;\\nconst u64 MASK31 = (1ull << 31) - 1;\\nconst u64 MASK30 = (1ull << 30) - 1;\\n\\nu64 safe_mul(const u64 &a, const u64 &b) {\\n u64 au = a >> 31, ad = a & MASK31;\\n u64 bu = b >> 31, bd = b & MASK31;\\n u64 mid = ad * bu + au * bd;\\n u64 midu = mid >> 30;\\n u64 midd = mid & MASK30;\\n return (au * bu * 2 + midu + (midd << 31) + ad * bd);\\n}\\n\\nu64 safe_mod(const u64 &a) {\\n u64 au = a >> 61;\\n u64 ad = a & mod;\\n u64 res = au + ad;\\n if (res >= mod) res -= mod;\\n return res;\\n}\\n\\n} // namespace ebi\\n\\n/*\\n reference: https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\\n*/\\n\\nnamespace ebi {\\n\\ntemplate <int n>\\nstruct rolling_hash {\\n private:\\n using u64 = std::uint64_t;\\n const u64 h = 100;\\n const u64 buffer = mod * 4;\\n\\n public:\\n rolling_hash(const std::string &s) : sz(s.size()) {\\n assert(int(base.size()) == n && n > 0);\\n base_pow.resize(n);\\n hash.resize(n);\\n for (int i = 0; i < n; ++i) {\\n base_pow[i].reserve(sz + 1);\\n base_pow[i].emplace_back(1);\\n hash[i].reserve(sz + 1);\\n hash[i].emplace_back(0);\\n for (const auto &c : s) {\\n hash[i].emplace_back(\\n safe_mod(safe_mul(hash[i].back(), base[i]) + c + h));\\n base_pow[i].emplace_back(\\n safe_mod(safe_mul(base_pow[i].back(), base[i])));\\n }\\n }\\n }\\n\\n // [l, r)\\n\\n std::vector<u64> get_hash(int l, int r) const {\\n std::vector<u64> ret(n);\\n for (int i = 0; i < n; ++i) {\\n ret[i] = safe_mod(hash[i][r] + buffer -\\n safe_mul(hash[i][l], base_pow[i][r - l]));\\n }\\n return ret;\\n }\\n\\n std::vector<u64> get_hash(const std::string &str, int l = 0,\\n int r = -1) const {\\n if (r < 0) r = int(str.size());\\n std::vector<u64> res(n, 0);\\n for (int i = 0; i < n; ++i) {\\n for (int j = l; j < r; ++j) {\\n res[i] = safe_mod(safe_mul(res[i], base[i]) + str[i] + h);\\n }\\n }\\n return res;\\n }\\n\\n static void set_base() {\\n random_number_generator_64 rnd;\\n base.resize(n);\\n for (int i = 0; i < n; ++i) {\\n base[i] = rnd.get(0, (1UL << 61) - 1);\\n }\\n }\\n\\n private:\\n size_t sz;\\n std::vector<std::vector<u64>> base_pow;\\n std::vector<std::vector<u64>> hash;\\n\\n public:\\n static std::vector<u64> base;\\n};\\n\\ntemplate <int n>\\nstd::vector<std::uint64_t> rolling_hash<n>::base{12345, 10000000};\\n\\n} // namespace ebi\\n\\nnamespace ebi {\\n\\nstruct palindromic_tree {\\nprivate:\\n using i64 = std::int64_t;\\n struct Node {\\n std::map<char, int> edges;\\n int len; // 回文の長さ\\n int num = 0;\\n int suffix_link = 0;\\n std::vector<u64> hash;\\n };\\npublic:\\n palindromic_tree(const std::string &str) : rh(str) {\\n tree.resize(2);\\n tree[0].len = -1;\\n tree[1].len = 0;\\n for(auto c: str) {\\n add_char(c);\\n }\\n }\\n\\n // 末尾に x を追加し、末尾を使った最大の長さを返す。\\n int add_char(char x) {\\n s.push_back(x);\\n int pos = s.size() - 1;\\n int now = last_idx;\\n while(true) {\\n int len = tree[now].len;\\n if(0 <= pos - len - 1 && s[pos - len - 1] == x) {\\n break;\\n }\\n now = tree[now].suffix_link;\\n }\\n if(tree[now].edges.find(x) != tree[now].edges.end()) {\\n last_idx = tree[now].edges[x];\\n tree[last_idx].num++;\\n return tree[last_idx].len;\\n }\\n last_idx = tree.size();\\n tree[now].edges[x] = last_idx;\\n Node node;\\n node.len = tree[now].len + 2;\\n node.num = 1;\\n node.hash = rh.get_hash(pos+1-node.len, pos+1);\\n if(node.len == 1) {\\n node.suffix_link = 1;\\n tree.emplace_back(node);\\n return node.len;\\n }\\n while(true) {\\n now = tree[now].suffix_link;\\n int len = tree[now].len;\\n if(0 <= pos - 1 - len && s[pos - 1 - len] == x) break;\\n }\\n node.suffix_link = tree[now].edges[x];\\n tree.emplace_back(node);\\n return node.len;\\n }\\n\\n int count_types() {\\n return (int)tree.size() - 2;\\n }\\n\\n i64 count_num() {\\n if(sum != -1) return sum;\\n sum = 0;\\n for(int i = tree.size() - 1; i >= 2; i--) {\\n int suffix_link = tree[i].suffix_link;\\n sum += tree[i].num;\\n tree[suffix_link].num += tree[i].num;\\n }\\n return sum;\\n }\\n\\n std::map<std::vector<u64>, i64> get_map() {\\n std::map<std::vector<u64>, i64> map;\\n for(int i = tree.size() - 1; i >= 2; i--) {\\n int suffix_link = tree[i].suffix_link;\\n map[tree[i].hash] = tree[i].num;\\n tree[suffix_link].num += tree[i].num;\\n }\\n return map;\\n }\\nprivate:\\n std::string s;\\n std::vector<Node> tree;\\n int last_idx = 1;\\n i64 sum = -1;\\n rolling_hash<2> rh;\\n};\\n\\n}\\n\\nnamespace ebi {\\n\\nvoid main_() {\\n rolling_hash<2>::set_base();\\n std::string s,t;\\n std::cin >> s >> t;\\n palindromic_tree ptree_s(s), ptree_t(t);\\n auto map_s = ptree_s.get_map();\\n auto map_t = ptree_t.get_map();\\n i64 ans = 0;\\n for(auto [hash, cnt] : map_s) {\\n ans += map_t[hash] * cnt;\\n }\\n std::cout << ans << '\\\\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\": 60,\n \"memory_kb\": 41020,\n \"score_of_the_acc\": -1.1724,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2292_7552876\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<typename T = char>\\nstruct MultiPalindromicTree{\\nprivate:\\n struct Node{\\n map<T, int> link;\\n int link_rev = -1;\\n int suffix_link; // same suffix maximum pal\\n int len; // palindrome length\\n vector<int> cnt; // freq of this\\n pair<int, int> idx; // one of the start pos\\n\\n Node() = default;\\n Node(int n, int len): len(len), cnt(n, 0), idx(-1, -1) {}\\n\\n int succ(const T &c) const {\\n auto it = link.find(c);\\n if(it == link.end()) return -1;\\n return it->second;\\n }\\n };\\n\\n // find longest P s.t. c + P + c is pal\\n int find_next_pal(int p, int k) const {\\n int pos = int(seq[p].size()) - 1;\\n while(true){\\n int i = pos - 1 - nodes[k].len;\\n if(i >= 0 && seq[p][i] == seq[p][pos]) return k;\\n k = nodes[k].suffix_link;\\n }\\n }\\n\\npublic:\\n\\n int n;\\n vector<Node> nodes;\\n vector<vector<T>> seq;\\n vector<vector<int>> ston;\\n vector<int> suffix_max;\\n\\n\\n MultiPalindromicTree(int n): n(n), seq(n), ston(n), suffix_max(n){\\n nodes.emplace_back(n, -1); // odd node\\n nodes.emplace_back(n, 0); // even node\\n nodes[1].suffix_link = 0;\\n }\\n\\n void add(int i, const T &c){\\n seq[i].push_back(c);\\n int k = find_next_pal(i, suffix_max[i]);\\n\\n // c + P + c is already exists\\n if(int p = nodes[k].succ(c); p != -1){\\n ++nodes[p].cnt[i];\\n suffix_max[i] = p;\\n ston[i].push_back(p);\\n return;\\n }\\n\\n // unique\\n nodes[k].link[c] = suffix_max[i] = int(nodes.size());\\n ston[i].push_back(suffix_max[i]);\\n int len = nodes[k].len + 2;\\n nodes.emplace_back(n, len);\\n \\n nodes.back().cnt[i] = 1;\\n nodes.back().idx = {i, int(seq[i].size()) - len};\\n nodes.back().link_rev = k;\\n\\n if(len == 1) nodes.back().suffix_link = 1;\\n else nodes.back().suffix_link = \\n nodes[find_next_pal(i, nodes[k].suffix_link)].link[c];\\n }\\n\\n template<class Iiter>\\n void add(int i, Iiter first, Iiter last){\\n for(; first != last; ++first) add(i, *first);\\n }\\n \\n template<class Container>\\n void add(int i, const Container &c){\\n add(i, begin(c), end(c));\\n }\\n\\n // idx of suffix palindromes of node k\\n vector<int> suffix_palindromes(int k) const {\\n vector<int> ret;\\n for(; nodes[k].len > 0; k = nodes[k].suffix_link){\\n ret.push_back(k);\\n }\\n return ret;\\n }\\n\\n // idx of substring palindromes of node k\\n vector<int> substr_palindroms(int k) const {\\n vector<int> ret, seen(nodes.size());\\n queue<int> qu;\\n qu.push(k); seen[k] = 1;\\n for(; !qu.empty(); qu.pop()){\\n int v = qu.front();\\n ret.push_back(v);\\n for(int u : {nodes[v].suffix_link, nodes[v].link_rev}){\\n if(!seen[u]) qu.push(u), seen[u] = 1;\\n }\\n }\\n return ret;\\n }\\n\\n // not count \\\"\\\"\\n int count() const { return int(nodes.size()) - 2; }\\n\\n vector<vector<int>> palindromes_frequency() const {\\n int m = int(nodes.size());\\n vector<vector<int>> freq(m, vector<int>(n));\\n for(int i = m - 1; i >= 1; --i){\\n for(int j = 0; j < n; ++j){\\n freq[i][j] += nodes[i].cnt[j];\\n freq[nodes[i].suffix_link][j] += freq[i][j];\\n }\\n }\\n return freq;\\n }\\n\\n const Node &operator[](int k) const { return nodes[k]; }\\n};\\n\\n\\nint main() {\\n MultiPalindromicTree mpt(2);\\n string s, t; cin >> s >> t;\\n mpt.add(0, s);\\n mpt.add(1, t);\\n\\n auto freq = mpt.palindromes_frequency();\\n int64_t ans = 0;\\n\\n for(int i = 0; i < mpt.count(); ++i){\\n ans += freq[i + 2][0] * 1ll * freq[i + 2][1];\\n }\\n\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 27892,\n \"score_of_the_acc\": -0.5919,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2292_7539010\",\n \"code_snippet\": \"#line 1 \\\"zzz\\\\\\\\a.cpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#line 2 \\\"string\\\\\\\\RollingHash.cpp\\\"\\n\\nstruct RollingHash{\\n static constexpr uint64_t mod = (1ull << 61) - 1;\\n static constexpr uint64_t mask(int k){ return (1ull << k) - 1; }\\n static constexpr uint64_t add(uint64_t a, uint64_t b){\\n return ((a+=b) >= mod) ? (a - mod) : a;\\n }\\n static constexpr uint64_t mul(uint64_t a, uint64_t b){\\n uint64_t au = a >> 31, ad = a & mask(31);\\n uint64_t bu = b >> 31, bd = b & mask(31);\\n int64_t mid = ad*bu + au*bd;\\n uint64_t mu = mid >> 30, md = mid & mask(30);\\n return au*bu*2 + mu + (md << 31) + ad*bd;\\n }\\n static constexpr uint64_t cal_mod(uint64_t x){\\n uint64_t res = (x >> 61) + (x & mask(61));\\n return (res>=mod) ? (res-mod) : res;\\n }\\n\\n static inline uint64_t generate_base(){\\n mt19937_64 mt(random_device{}());\\n uniform_int_distribution<uint64_t> rand(1, mod-1);\\n return rand(mt);\\n }\\n\\n inline void expand(size_t n){\\n if(size_t pn = pow_table.size(); pn < n+1){\\n pow_table.resize(n + 1);\\n for(size_t i = pn-1; i < n; ++i){\\n pow_table[i+1] = cal_mod(mul(pow_table[i], base));\\n }\\n }\\n }\\n\\n const uint64_t base;\\n vector<uint64_t> pow_table;\\n\\n RollingHash(uint64_t base = generate_base()): base(base), pow_table(1,1) {}\\n\\n vector<uint64_t> build(const string &s) const {\\n int n = int(s.size());\\n vector<uint64_t> res(n + 1);\\n for(int i = 0; i < n; ++i) res[i+1] = cal_mod(mul(res[i], base) + s[i]);\\n return res;\\n }\\n\\n template<typename T>\\n vector<uint64_t> build(const vector<T> &s) const {\\n int n = int(s.size());\\n vector<uint64_t> res(n + 1);\\n for(int i = 0; i < n; ++i) res[i+1] = cal_mod(mul(res[i], base) + s[i]);\\n return res;\\n }\\n\\n uint64_t query(const vector<uint64_t> &s, int l = 0, size_t n = string::npos){\\n n = min(n, s.size()-1 - l);\\n expand(n);\\n return cal_mod(s[l+n] + mod*4 - mul(s[l], pow_table[n]));\\n }\\n\\n uint64_t cat(uint64_t hl, uint64_t hr, size_t hr_len){\\n expand(hr_len);\\n return cal_mod(mul(hl, pow_table[hr_len]) + hr);\\n }\\n\\n int lcp(const vector<uint64_t> &a, int la, int ra, const vector<uint64_t> &b, int lb, int rb){\\n int n = min(ra - la, rb - lb);\\n int l = 0, r = n+1;\\n while(r-l > 1){\\n int m = (l+r) >> 1;\\n if(query(a, la, m) == query(b, lb, m)) l = m;\\n else r = m;\\n }\\n return l;\\n }\\n};\\n#line 5 \\\"zzz\\\\\\\\a.cpp\\\"\\n\\ntemplate<typename T = char>\\nstruct PalindromicTree{\\nprivate:\\n struct Node{\\n map<T, int> link;\\n int suffix_link; // same suffix maximum pal\\n int len; // palindrome length\\n int cnt; // number of this\\n int idx; // one of the start pos\\n\\n Node() = default;\\n Node(int len, int cnt, int idx = -1): len(len), cnt(cnt), idx(idx) {}\\n\\n int succ(const T &c) const {\\n auto it = link.find(c);\\n if(it == link.end()) return -1;\\n return it->second;\\n }\\n };\\n\\n // find longest P s.t. c + P + c is pal\\n int find_next_pal(int k) const {\\n int pos = int(seq.size()) - 1;\\n while(true){\\n int i = pos - 1 - nodes[k].len;\\n if(i >= 0 && seq[i] == seq[pos]) return k;\\n k = nodes[k].suffix_link;\\n }\\n }\\n\\npublic:\\n\\n vector<Node> nodes;\\n vector<T> seq;\\n vector<int> ston;\\n int suffix_max;\\n\\n\\n PalindromicTree(){\\n nodes.emplace_back(-1, 0); // odd node\\n nodes.emplace_back(0, 0); // even node\\n nodes[1].suffix_link = 0;\\n suffix_max = 0;\\n }\\n template<class Iiter>\\n PalindromicTree(Iiter first, Iiter last): PalindromicTree() {\\n add(first, last);\\n }\\n template<class Container>\\n PalindromicTree(const Container &c): PalindromicTree() {\\n add(c);\\n }\\n\\n void add(const T &c){\\n seq.push_back(c);\\n int k = find_next_pal(suffix_max);\\n\\n // c + P + c is already exists\\n if(int p = nodes[k].succ(c); p != -1){\\n ++nodes[p].cnt;\\n suffix_max = p;\\n ston.push_back(p);\\n return;\\n }\\n\\n // unique\\n nodes[k].link[c] = suffix_max = int(nodes.size());\\n ston.push_back(suffix_max);\\n int len = nodes[k].len + 2;\\n nodes.emplace_back(len, 1, int(seq.size()) - len);\\n\\n if(len == 1) nodes.back().suffix_link = 1;\\n else nodes.back().suffix_link = \\n nodes[find_next_pal(nodes[k].suffix_link)].link[c];\\n }\\n\\n template<class Iiter>\\n void add(Iiter first, Iiter last){\\n for(; first != last; ++first) add(*first);\\n }\\n \\n template<class Container>\\n void add(const Container &c){\\n add(begin(c), end(c));\\n }\\n\\n // seq[i] = node[k].last\\n int get_node_idx(int i) const { return ston[i]; }\\n\\n // length of suffix palindromes of node k\\n vector<int> suffix_palindromes(int k) const {\\n vector<int> ret;\\n for(; nodes[k].len > 0; k = nodes[k].suffix_link){\\n ret.push_back(nodes[k].len);\\n }\\n return ret;\\n }\\n\\n // length of suffix palindromes of seq\\n vector<int> suffix_palindromes() const {\\n return suffix_palindromes(suffix_max);\\n }\\n\\n // not count \\\"\\\"\\n int count() const { return int(nodes.size()) - 2; }\\n\\n vector<int> palindromes_frequency() const {\\n int n = int(nodes.size());\\n vector<int> freq(n);\\n for(int i = n - 1; i >= 1; --i){\\n freq[i] += nodes[i].cnt;\\n freq[nodes[i].suffix_link] += freq[i];\\n }\\n return freq;\\n }\\n};\\n\\nint main() {\\n string s, t; cin >> s >> t;\\n PalindromicTree ps(s), pt(t);\\n map<uint64_t, int> mp;\\n RollingHash rh;\\n auto hs = rh.build(s);\\n auto ht = rh.build(t);\\n auto fs = ps.palindromes_frequency();\\n auto ft = pt.palindromes_frequency();\\n\\n for(int i = 0; i < ps.count(); ++i){\\n int p = ps.nodes[i + 2].idx;\\n int l = ps.nodes[i + 2].len;\\n int c = fs[i + 2];\\n mp[rh.query(hs, p, l)] += c;\\n }\\n int64_t ans = 0;\\n\\n for(int i = 0; i < pt.count(); ++i){\\n int p = pt.nodes[i + 2].idx;\\n int l = pt.nodes[i + 2].len;\\n int64_t c = ft[i + 2];\\n ans += mp[rh.query(ht, p, l)] * c;\\n }\\n\\n cout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 24020,\n \"score_of_the_acc\": -0.5406,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2292_7135211\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, x) for(int i = 0; i < (x); i++)\\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\\nusing vi = vector<int>;\\n#define sz(x) (int)(x).size()\\n\\narray<vi, 2> manacher(string &s) {\\n\\tint n = sz(s);\\n\\tarray<vi, 2> p = {vi(n + 1), vi(n)};\\n\\trep(z, 2) for(int i = 0, l = 0, r = 0; i < n; i++) {\\n\\t\\tint t = r - i + !z;\\n\\t\\tif(i < r) p[z][i] = min(t, p[z][l + t]);\\n\\t\\tint L = i - p[z][i], R = i + p[z][i] - !z;\\n\\t\\twhile(L >= 1 and R + 1 < n and s[L - 1] == s[R + 1])\\n\\t\\t\\tp[z][i]++, L--, R++;\\n\\t\\tif(R > r) l = L, r = R;\\n\\t}\\n\\treturn p;\\n}\\n\\n\\ntypedef uint64_t ull;\\nstruct H {\\n\\tull x;\\n\\tH(ull x = 0) : x(x) {}\\n\\tH operator+(H o) { return x + o.x + (x + o.x < x); }\\n\\tH operator-(H o) { return *this + ~o.x; }\\n\\tH operator*(H o) {\\n\\t\\tauto m = (__uint128_t)x * o.x;\\n\\t\\treturn H((ull)m) + (ull)(m >> 64);\\n\\t}\\n\\tull get() const { return x + !~x; }\\n\\tbool operator==(H o) const { return get() == o.get(); }\\n\\tbool operator<(H o) const { return get() < o.get(); }\\n};\\n\\nstatic const H C = (ll)1e11 + 3;\\n\\nstruct hash_interval {\\n\\tvector<H> ha, pw;\\n\\thash_interval(string &str) : ha(sz(str) + 1), pw(ha) {\\n\\t\\tpw[0] = 1;\\n\\t\\trep(i, sz(str))\\n\\t\\t ha[i + 1] = ha[i] * C + str[i],\\n\\t\\t pw[i + 1] = pw[i] * C;\\n\\t}\\n\\tH get(int a, int b) { return ha[b] - ha[a] * pw[b - a]; }\\n};\\n\\nmap<ull, ll> palindromes_freq(string &s) {\\n\\tauto sm = manacher(s);\\n\\thash_interval sh(s);\\n\\tset<ull> st;\\n\\tmap<ull, ull> es;\\n\\tvector<set<ull>> nodes(sz(s) + 1);\\n\\tmap<ull, ll> cum;\\n\\trep(i, sz(s) + 1) {\\n\\t\\tif(sm[0][i]) {\\n\\t\\t\\tint len = sm[0][i];\\n\\t\\t\\tauto ha = sh.get(i - len, i + len);\\n\\t\\t\\tcum[ha.get()]++;\\n\\t\\t\\tnodes[len * 2].insert(ha.get());\\n\\t\\t\\twhile(len > 1) {\\n\\t\\t\\t\\tlen--;\\n\\t\\t\\t\\tauto nx = sh.get(i - len, i + len);\\n\\t\\t\\t\\tif(es.count({ha.get()})) break;\\n\\t\\t\\t\\tes[ha.get()] = nx.get();\\n\\t\\t\\t\\tha = nx;\\n\\t\\t\\t\\tnodes[len * 2].insert(ha.get());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\trep(i, sz(s)) {\\n\\t\\tsm[1][i]++;\\n\\t\\tint len = sm[1][i];\\n\\t\\tauto ha = sh.get(i - len + 1, i + len);\\n\\t\\tcum[ha.get()]++;\\n\\t\\tnodes[len * 2 - 1].insert(ha.get());\\n\\t\\twhile(len > 1) {\\n\\t\\t\\tlen--;\\n\\t\\t\\tauto nx = sh.get(i - len + 1, i + len);\\n\\t\\t\\tif(es.count({ha.get()})) break;\\n\\t\\t\\tes[ha.get()] = nx.get();\\n\\t\\t\\tha = nx;\\n\\t\\t\\tnodes[len * 2 - 1].insert(ha.get());\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = sz(s); i >= 0; --i) {\\n\\t\\tfor(auto &v : nodes[i]) {\\n\\t\\t\\tif(es.count(v)) {\\n\\t\\t\\t\\tcum[es[v]] += cum[v];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn cum;\\n}\\n\\nint main() {\\n\\tstring s, t;\\n\\tcin >> s >> t;\\n\\tauto s_freq = palindromes_freq(s);\\n\\tauto t_freq = palindromes_freq(t);\\n\\tll res = 0;\\n\\tfor(auto [key, cnt] : s_freq) res += cnt * t_freq[key];\\n\\tcout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 18904,\n \"score_of_the_acc\": -0.8298,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2292_7135210\",\n \"code_snippet\": \"#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, x) for(int i = 0; i < (x); i++)\\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\\nusing vi = vector<int>;\\n#define sz(x) (int)(x).size()\\n\\narray<vi, 2> manacher(string &s) {\\n\\tint n = sz(s);\\n\\tarray<vi, 2> p = {vi(n + 1), vi(n)};\\n\\trep(z, 2) for(int i = 0, l = 0, r = 0; i < n; i++) {\\n\\t\\tint t = r - i + !z;\\n\\t\\tif(i < r) p[z][i] = min(t, p[z][l + t]);\\n\\t\\tint L = i - p[z][i], R = i + p[z][i] - !z;\\n\\t\\twhile(L >= 1 and R + 1 < n and s[L - 1] == s[R + 1])\\n\\t\\t\\tp[z][i]++, L--, R++;\\n\\t\\tif(R > r) l = L, r = R;\\n\\t}\\n\\treturn p;\\n}\\n\\n\\ntypedef uint64_t ull;\\nstruct H {\\n\\tull x;\\n\\tH(ull x = 0) : x(x) {}\\n\\tH operator+(H o) { return x + o.x + (x + o.x < x); }\\n\\tH operator-(H o) { return *this + ~o.x; }\\n\\tH operator*(H o) {\\n\\t\\tauto m = (__uint128_t)x * o.x;\\n\\t\\treturn H((ull)m) + (ull)(m >> 64);\\n\\t}\\n\\tull get() const { return x + !~x; }\\n\\tbool operator==(H o) const { return get() == o.get(); }\\n\\tbool operator<(H o) const { return get() < o.get(); }\\n};\\n\\nstatic const H C = (ll)1e11 + 3;\\n\\nstruct hash_interval {\\n\\tvector<H> ha, pw;\\n\\thash_interval(string &str) : ha(sz(str) + 1), pw(ha) {\\n\\t\\tpw[0] = 1;\\n\\t\\trep(i, sz(str))\\n\\t\\t ha[i + 1] = ha[i] * C + str[i],\\n\\t\\t pw[i + 1] = pw[i] * C;\\n\\t}\\n\\tH get(int a, int b) { return ha[b] - ha[a] * pw[b - a]; }\\n};\\n\\nmap<ull, ll> palindromes_freq(string &s) {\\n\\tauto sm = manacher(s);\\n\\thash_interval sh(s);\\n\\tset<ull> st;\\n\\tmap<ull, ull> es;\\n\\tvector<set<ull>> nodes(sz(s) + 1);\\n\\tmap<ull, ll> cum;\\n\\trep(i, sz(s) + 1) {\\n\\t\\tif(sm[0][i]) {\\n\\t\\t\\tint len = sm[0][i];\\n\\t\\t\\tauto ha = sh.get(i - len, i + len);\\n\\t\\t\\tcum[ha.get()]++;\\n\\t\\t\\tnodes[len * 2].insert(ha.get());\\n\\t\\t\\twhile(len > 1) {\\n\\t\\t\\t\\tlen--;\\n\\t\\t\\t\\tauto nx = sh.get(i - len, i + len);\\n\\t\\t\\t\\tif(es.count({ha.get()})) break;\\n\\t\\t\\t\\tes[ha.get()] = nx.get();\\n\\t\\t\\t\\tha = nx;\\n\\t\\t\\t\\tnodes[len * 2].insert(ha.get());\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\trep(i, sz(s)) {\\n\\t\\tsm[1][i]++;\\n\\t\\tint len = sm[1][i];\\n\\t\\tauto ha = sh.get(i - len + 1, i + len);\\n\\t\\tcum[ha.get()]++;\\n\\t\\tnodes[len * 2 - 1].insert(ha.get());\\n\\t\\twhile(len > 1) {\\n\\t\\t\\tlen--;\\n\\t\\t\\tauto nx = sh.get(i - len + 1, i + len);\\n\\t\\t\\tif(es.count({ha.get()})) break;\\n\\t\\t\\tes[ha.get()] = nx.get();\\n\\t\\t\\tha = nx;\\n\\t\\t\\tnodes[len * 2 - 1].insert(ha.get());\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = sz(s); i >= 0; --i) {\\n\\t\\tfor(auto &v : nodes[i]) {\\n\\t\\t\\tif(es.count(v)) {\\n\\t\\t\\t\\tcum[es[v]] += cum[v];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn cum;\\n}\\n\\nint main() {\\n\\tstring s, t;\\n\\tcin >> s >> t;\\n\\tauto s_freq = palindromes_freq(s);\\n\\tauto t_freq = palindromes_freq(t);\\n\\tll res = 0;\\n\\tfor(auto [key, cnt] : s_freq) res += cnt * t_freq[key];\\n\\tcout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 20084,\n \"score_of_the_acc\": -0.9355,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2292_7124559\",\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 mod1=998244353,mod2=1000000007,MAX=300005,INF=1<<30;\\n\\n// Manacher https://snuke.hatenablog.com/entry/2014/12/02/235837\\n\\nvector<int> Manacher(string S){\\n vector<int> R(si(S));\\n int i = 0, j = 0;\\n while (i < S.size()) {\\n while (i-j >= 0 && i+j < S.size() && S[i-j] == S[i+j]) ++j;\\n R[i] = j;\\n int k = 1;\\n while (i-k >= 0 && k+R[i-k] < j) R[i+k] = R[i-k], ++k;\\n i += k; j -= k;\\n }\\n return R;\\n}\\n// 偶数長のも求めるために$を入れる必要がある\\n\\n//ロリハ\\n\\nstruct Rollinghash{\\n string S;\\n int n;\\n int base1;\\n int base2;\\n vector<ll> h1,h2,ru1,ru2;\\n \\n void make(string &T,int ba1,int ba2){\\n S=T;\\n n=S.size();\\n h1.assign(n+1,0);\\n h2.assign(n+1,0);\\n ru1.assign(n+1,0);\\n ru2.assign(n+1,0);\\n base1=ba1;\\n base2=ba2;\\n \\n ru1[0]=1;\\n ru2[0]=1;\\n \\n for(int i=1;i<=n;i++){\\n h1[i]=h1[i-1]*base1+ll(S[i-1]-'$'+1);\\n h1[i]%=mod1;\\n \\n h2[i]=h2[i-1]*base2+ll(S[i-1]-'$'+1);\\n h2[i]%=mod2;\\n \\n ru1[i]=ru1[i-1]*base1%mod1;\\n ru2[i]=ru2[i-1]*base2%mod2;\\n }\\n }\\n \\n pair<ll,ll> ha(int l,int r){\\n pair<ll,ll> res;\\n res.fi=(h1[r]-h1[l]*ru1[r-l]%mod1+mod1)%mod1;\\n res.se=(h2[r]-h2[l]*ru2[r-l]%mod2+mod2)%mod2;\\n \\n return res;\\n }//開区間\\n};\\n\\n//強連結成分分解\\n\\nint V,cmp[MAX];\\nvector<int> G[MAX],rG[MAX],vs;//vsがトポソの逆順になってる\\nbool used[MAX];\\n\\nint get_id(int i,bool f){\\n return 2*i+f;\\n}\\n\\nvoid add_edge(int from,int to){\\n G[from].push_back(to);\\n rG[to].push_back(from);\\n}\\n\\nvoid either(int i,bool f,int j,bool g){\\n add_edge(get_id(i,!f),get_id(j,g));\\n add_edge(get_id(j,!g),get_id(i,f));\\n //add_edge(2*i+(!f),2*j+g);\\n //add_edge(2*j+(!g),2*i+f);\\n}\\n\\nvoid imply(int i,bool f,int j,bool g){\\n either(i,!f,j,g);\\n}\\n//iがfならばjがg\\n\\nvoid must(int i,bool f){\\n either(i,f,i,f);\\n}\\n\\nvoid DFS(int v){\\n used[v]=1;\\n for(int i=0;i<G[v].size();i++){\\n if(used[G[v][i]]==0) DFS(G[v][i]);\\n }\\n vs.push_back(v);\\n}\\n\\nvoid rDFS(int v,int k){\\n used[v]=1;\\n cmp[v]=k;\\n for(int i=0;i<rG[v].size();i++){\\n if(used[rG[v][i]]==0) rDFS(rG[v][i],k);\\n }\\n}\\n\\nint scc(){\\n memset(used,0,sizeof(used));\\n vs.clear();\\n for(int v=0;v<V;v++){\\n if(used[v]==0) DFS(v);\\n }\\n \\n memset(used,0,sizeof(used));\\n int k=0;\\n for(int i=vs.size()-1;i>=0;i--){\\n if(used[vs[i]]==0) rDFS(vs[i],k++);\\n }\\n return k;\\n}\\n\\nll dp[MAX];\\n\\nvoid init(int sz){\\n V=sz;\\n for(int i=0;i<V;i++){\\n dp[i]=0;\\n cmp[i]=0;\\n G[i].clear();\\n rG[i].clear();\\n used[i]=false;\\n }\\n vs.clear();\\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 string S,T;cin>>S>>T;\\n string SS,TT;\\n SS+='$';TT+='$';\\n for(char c:S){\\n SS+=c;\\n SS+='$';\\n }\\n for(char c:T){\\n TT+=c;\\n TT+='$';\\n }\\n S=SS;\\n T=TT;\\n \\n ll ha1=103,ha2=109;\\n \\n map<pair<ll,ll>,ll> MA1,MA2;\\n \\n for(int q=0;q<2;q++){\\n map<pair<ll,ll>,ll> dic;\\n Rollinghash ro;\\n ro.make(S,ha1,ha2);\\n init(MAX);\\n \\n auto mana=Manacher(S);\\n \\n for(int i=0;i<si(S);i++){\\n int s=(i-mana[i]+1);\\n if(s%2==0) s++;\\n pair<ll,ll> la=mp(-1,-1);\\n for(int l=s;l<=i;l+=2){\\n int r=i+(i-l)+1;\\n auto re=ro.ha(l,r);\\n if(dic.count(re)){\\n if(l==s) dp[dic[re]]++;\\n else{\\n add_edge(dic[la],dic[re]);\\n }\\n break;\\n }else{\\n int sz=si(dic);\\n dic[re]=sz;\\n if(l==s) dp[sz]++;\\n else{\\n add_edge(dic[la],dic[re]);\\n }\\n la=re;\\n }\\n }\\n }\\n \\n V=si(dic);\\n \\n scc();\\n \\n reverse(all(vs));\\n \\n for(int a:vs){\\n for(int to:G[a]){\\n dp[to]+=dp[a];\\n }\\n }\\n \\n for(auto a:dic){\\n MA1[a.fi]+=dp[a.se];\\n }\\n \\n swap(S,T);\\n swap(MA1,MA2);\\n }\\n \\n ll ans=0;\\n \\n for(auto a:MA1){\\n if(MA2.count(a.fi)) ans+=a.se*MA2[a.fi];\\n }\\n \\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 38324,\n \"score_of_the_acc\": -1.261,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2292_6934508\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\\n#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing PL = pair<long long, long long>;\\nusing pdd = pair<long double, long double>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\nusing ppi = pair<P,int>;\\nusing pip = pair<int,P>;\\nconst int INF = 1001001007;\\nconst long long mod1 = 1000000007LL;\\nconst long long mod2 = 998244353LL;\\nconst ll inf = 2e18;\\nconst ld pi = 3.14159265358979323;\\nconst ld eps = 1e-7;\\ntemplate<typename T>void o(T a);\\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\\ntemplate<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}\\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\\ntemplate<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}\\nvoid revs(string &s) {reverse(s.begin(),s.end());}\\ntemplate<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}\\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\ntemplate<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}\\ntemplate<typename T>T cel(T a,T b){return (a+b-1)/b;}\\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\\ntemplate<typename T>void print(vector<T> v);\\ntemplate<typename T>void print(vector<vector<T>> v);\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(long a){ printf(\\\"%ld\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", 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(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) 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; }\\nvoid o(){cout<<\\\"!?\\\"<<endl;}\\ntemplate<typename T>void o(T a){cout<<a<<endl;}\\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\\nvoid yes(){out(\\\"Yes\\\");}\\nvoid no (){out(\\\"No\\\");}\\nvoid yn (bool t){if(t)yes();else no();}\\ntemplate<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}\\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\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;}\\nll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}\\n\\n\\nvector<int> manacher(string &s){\\n int n = s.size();\\n vector<int> ans(n,0);\\n int i = 0, len = 0;\\n while (i < n){\\n while (i - len >= 0 && i + len < n && s[i-len] == s[i+len]) len++;\\n ans[i] = len;\\n int k = 1;\\n while (i - k >= 0 && k + ans[i-k] < len) ans[i+k] = ans[i-k], k++;\\n i += k, len -= k;\\n }\\n return ans;\\n}\\n\\nvector<int> palindrome_length(string s){\\n string t = \\\"$\\\";\\n for (char c : s) t += c, t += '$';\\n vector<int> a = manacher(t);\\n vector<int> ans(a.size()-2);\\n rep(i,a.size()-2) ans[i] = a[i+1]-1;\\n return ans;\\n}\\n\\n#include<random>\\nstruct RollingHash {\\n using ull = unsigned long long;\\n RollingHash(const string &s = \\\"\\\"){ build(s);}\\n ull get(int l, int r){ return cal_mod(inner_hush[r] + POSITIVISER - mul_mod(inner_hush[l], pow_base[r-l]));}\\n private:\\n static constexpr ull MASK30 = (1UL << 30) - 1;\\n static constexpr ull MASK31 = (1UL << 31) - 1;\\n static constexpr ull MASK61 = (1UL << 61) - 1;\\n static constexpr ull MOD = (1UL << 61) - 1;\\n static constexpr ull POSITIVISER = MOD * 4;\\n string str;\\n int n;\\n static ull BASE;\\n static vector<ull> pow_base;\\n static ull mul_mod(ull a, ull b){\\n ull au = a >> 31, ad = a & MASK31;\\n ull bu = b >> 31, bd = b & MASK31;\\n ull mid = ad * bu + au * bd;\\n ull midu = mid >> 30, midd = mid & MASK30;\\n return (au * bu * 2 + midu + (midd << 31) + ad * bd);\\n }\\n static ull cal_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 vector<ull> inner_hush;\\n void build(const string &s){\\n if (BASE == 0) BASE = (1UL<<31) + (random_device()() & MASK31);\\n str = s;\\n n = s.size();\\n int nlen = pow_base.size();\\n if (nlen < n+1){\\n pow_base.resize(n+1);\\n for (int i = nlen; i <= n; i++){\\n pow_base[i] = cal_mod(mul_mod(pow_base[i-1],BASE));\\n }\\n }\\n inner_hush.resize(n+1);\\n inner_hush[0] = 0;\\n for (int i = 0; i < n; i++) inner_hush[i+1] = cal_mod(mul_mod(inner_hush[i],BASE) + s[i]);\\n }\\n};\\nusing ull = unsigned long long;\\null RollingHash::BASE = 0;\\nvector<ull> RollingHash::pow_base = vector<ull>(1,1);\\nusing roriha = RollingHash;\\n\\nvoid solve(){\\n string s, t; cin >> s >> t;\\n int n = s.size(), m = t.size();\\n auto nma = palindrome_length(s);\\n auto mma = palindrome_length(t);\\n roriha a(s), b(t);\\n map<ull,ll> nmp, mmp;\\n priority_queue<pip> pque;\\n rep(i,nma.size()){\\n if (i % 2 == 0){\\n int ce = i / 2;\\n int le = ce - (nma[i]-1)/2;\\n int ri = ce + (nma[i]-1)/2; \\n ull hs = a.get(le,ri+1);\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = 1;\\n pque.push(pip(nma[i],P(le,ri)));\\n }\\n else nmp[hs]++;\\n }\\n else {\\n if (nma[i] == 0) continue;\\n int le = (i - 1 - (nma[i] / 2 - 1) * 2) / 2;\\n int ri = (i + 1 + (nma[i] / 2 - 1) * 2) / 2;\\n ull hs = a.get(le,ri+1);\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = 1;\\n pque.push(pip(nma[i],P(le,ri)));\\n }\\n else nmp[hs]++;\\n }\\n }\\n while (!pque.empty()){\\n auto p = pque.top(); pque.pop();\\n if (p.first <= 2) continue;\\n int le = p.second.first, ri = p.second.second;\\n ull ihs = a.get(le,ri+1);\\n le++, ri--;\\n ull hs = a.get(le,ri+1);\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = nmp[ihs];\\n pque.push(pip(p.first-2,P(le,ri)));\\n }\\n else nmp[hs] += nmp[ihs];\\n }\\n rep(i,mma.size()){\\n if (i % 2 == 0){\\n int ce = i / 2;\\n int le = ce - (mma[i]-1)/2;\\n int ri = ce + (mma[i]-1)/2;\\n ull hs = b.get(le,ri+1);\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = 1;\\n pque.push(pip(mma[i],P(le,ri)));\\n }\\n else mmp[hs]++;\\n }\\n else {\\n if (mma[i] == 0) continue;\\n int le = (i - 1 - (mma[i] / 2 - 1) * 2) / 2;\\n int ri = (i + 1 + (mma[i] / 2 - 1) * 2) / 2;\\n ull hs = b.get(le,ri+1);\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = 1;\\n pque.push(pip(mma[i],P(le,ri)));\\n }\\n else mmp[hs]++;\\n }\\n }\\n while (!pque.empty()){\\n auto p = pque.top(); pque.pop();\\n if (p.first <= 2) continue;\\n int le = p.second.first, ri = p.second.second;\\n ull ihs = b.get(le,ri+1);\\n le++, ri--;\\n ull hs = b.get(le,ri+1);\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = mmp[ihs];\\n pque.push(pip(p.first-2,P(le,ri)));\\n }\\n else mmp[hs] += mmp[ihs];\\n }\\n ll ans = 0;\\n for (auto p : nmp){\\n if (mmp.find(p.first) == mmp.end()) continue;\\n ans += p.second * mmp[p.first];\\n }\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //cin >> t;\\n while (t--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 12176,\n \"score_of_the_acc\": -0.3448,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2292_6933363\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\\n#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing PL = pair<long long, long long>;\\nusing pdd = pair<long double, long double>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\nusing ppi = pair<P,int>;\\nusing pip = pair<int,P>;\\nconst int INF = 1001001007;\\nconst long long mod1 = 1000000007LL;\\nconst long long mod2 = 998244353LL;\\nconst ll inf = 2e18;\\nconst ld pi = 3.14159265358979323;\\nconst ld eps = 1e-7;\\ntemplate<typename T>void o(T a);\\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\\ntemplate<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}\\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\\ntemplate<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}\\nvoid revs(string &s) {reverse(s.begin(),s.end());}\\ntemplate<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}\\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\ntemplate<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}\\ntemplate<typename T>T cel(T a,T b){return (a+b-1)/b;}\\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\\ntemplate<typename T>void print(vector<T> v);\\ntemplate<typename T>void print(vector<vector<T>> v);\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(long a){ printf(\\\"%ld\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", 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(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) 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; }\\nvoid o(){cout<<\\\"!?\\\"<<endl;}\\ntemplate<typename T>void o(T a){cout<<a<<endl;}\\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\\nvoid yes(){out(\\\"Yes\\\");}\\nvoid no (){out(\\\"No\\\");}\\nvoid yn (bool t){if(t)yes();else no();}\\ntemplate<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}\\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\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;}\\nll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}\\n\\n\\nvector<int> manacher(string &s){\\n int n = s.size();\\n vector<int> ans(n,0);\\n int i = 0, len = 0;\\n while (i < n){\\n while (i - len >= 0 && i + len < n && s[i-len] == s[i+len]) len++;\\n ans[i] = len;\\n int k = 1;\\n while (i - k >= 0 && k + ans[i-k] < len) ans[i+k] = ans[i-k], k++;\\n i += k, len -= k;\\n }\\n return ans;\\n}\\n\\nvector<int> palindrome_length(string s){\\n string t = \\\"$\\\";\\n for (char c : s) t += c, t += '$';\\n vector<int> a = manacher(t);\\n vector<int> ans(a.size()-2);\\n rep(i,a.size()-2) ans[i] = a[i+1]-1;\\n return ans;\\n}\\n//using ulong = unsigned long long;\\nconst ulong MASK30 = (1UL << 30) - 1;\\nconst ulong MASK31 = (1UL << 31) - 1;\\nconst ulong MOD = (1UL << 61) - 1;\\nconst ulong MASK61 = MOD;\\nulong CalcMod(ulong x);\\n\\n//a*b mod 2^61-1を返す関数(最後にModを取る)\\nulong Mul(ulong a, ulong b)\\n{\\n ulong au = a >> 31;\\n ulong ad = a & MASK31;\\n ulong bu = b >> 31;\\n ulong bd = b & MASK31;\\n ulong mid = ad * bu + au * bd;\\n ulong midu = mid >> 30;\\n ulong midd = mid & MASK30;\\n return (au * bu * 2 + midu + (midd << 31) + ad * bd);\\n}\\n\\n//mod 2^61-1を計算する関数\\nulong CalcMod(ulong x)\\n{\\n ulong xu = x >> 61;\\n ulong xd = x & MASK61;\\n ulong res = xu + xd;\\n if (res >= MOD) res -= MOD;\\n return res;\\n}\\n\\nconst ulong Base = 294576;\\nvector<ulong> bs;\\n\\nvoid solve(){\\n string s, t; cin >> s >> t;\\n int n = s.size(), m = t.size();\\n //bs.resize(100000,1);\\n //rep(i,100000-1) bs[i+1] = Mul(bs[i],base);\\n //vector<ulong> nrui(n+1,0), mrui(m+1,0);\\n vector<ulong> powMemo(100000,1);\\n rep(i,100000-1) powMemo[i+1] = CalcMod(Mul(powMemo[i],Base));\\n vector<ulong> hash1(n+1,0); //要素数n+1の配列を初期化\\n for (int i = 0; i < n; i++) hash1[i + 1] = CalcMod(Mul(hash1[i], Base) + s[i]);\\n vector<ulong> hash2(m+1,0); //要素数n+1の配列を初期化\\n for (int i = 0; i < m; i++) hash2[i + 1] = CalcMod(Mul(hash2[i], Base) + t[i]);\\n //rep(i,n) nrui[i+1] = CalcMod(nrui[i] + Mul(ulong(s[i] - 'a' + 1), bs[i]));\\n //rep(i,m) mrui[i+1] = CalcMod(mrui[i] + Mul(ulong(t[i] - 'a' + 1), bs[i]));\\n const ulong POSITIVIZER = MOD * 4;\\n auto nget = [&](int l, int r){\\n //return Mul(CalcMod(nrui[r] - nrui[l] + MOD),bs[100000-1-r]);\\n return CalcMod(hash1[r] + POSITIVIZER - Mul(hash1[l], powMemo[r - l]));\\n };\\n auto mget = [&](int l, int r){\\n //return Mul(CalcMod(nrui[r] - nrui[l] + MOD),bs[100000-1-r]);\\n return CalcMod(hash2[r] + POSITIVIZER - Mul(hash2[l], powMemo[r - l]));\\n };\\n auto nma = palindrome_length(s);\\n auto mma = palindrome_length(t);\\n map<ulong,ll> nmp, mmp;\\n priority_queue<pip> pque;\\n rep(i,nma.size()){\\n if (i % 2 == 0){\\n int ce = i / 2;\\n int le = ce - (nma[i]-1)/2;\\n int ri = ce + (nma[i]-1)/2; \\n ulong hs = nget(le,ri+1);\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = 1; //out(le,ri,hs);\\n pque.push(pip(nma[i],P(le,ri)));\\n }\\n else nmp[hs]++;\\n }\\n else {\\n if (nma[i] == 0) continue;\\n int le = (i - 1 - (nma[i] / 2 - 1) * 2) / 2;\\n int ri = (i + 1 + (nma[i] / 2 - 1) * 2) / 2;\\n ulong hs = nget(le,ri+1);\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = 1;\\n pque.push(pip(nma[i],P(le,ri)));\\n }\\n else nmp[hs]++;\\n }\\n }\\n while (!pque.empty()){\\n auto p = pque.top(); pque.pop();\\n if (p.first <= 2) continue;\\n int le = p.second.first, ri = p.second.second;\\n ulong ihs = nget(le,ri+1);\\n le++, ri--;\\n ulong hs = nget(le,ri+1);\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = nmp[ihs]; //out(le,ri,hs);\\n pque.push(pip(p.first-2,P(le,ri)));\\n }\\n else nmp[hs] += nmp[ihs];\\n }\\n rep(i,mma.size()){\\n if (i % 2 == 0){\\n int ce = i / 2;\\n int le = ce - (mma[i]-1)/2;\\n int ri = ce + (mma[i]-1)/2;\\n ulong hs = mget(le,ri+1);\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = 1; //out(le,ri,hs);\\n pque.push(pip(mma[i],P(le,ri)));\\n }\\n else mmp[hs]++;\\n }\\n else {\\n if (mma[i] == 0) continue;\\n int le = (i - 1 - (mma[i] / 2 - 1) * 2) / 2;\\n int ri = (i + 1 + (mma[i] / 2 - 1) * 2) / 2;\\n ulong hs = mget(le,ri+1);\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = 1;\\n pque.push(pip(mma[i],P(le,ri)));\\n }\\n else mmp[hs]++;\\n }\\n }\\n while (!pque.empty()){\\n auto p = pque.top(); pque.pop();\\n if (p.first <= 2) continue;\\n int le = p.second.first, ri = p.second.second;\\n ulong ihs = mget(le,ri+1);\\n le++, ri--;\\n ulong hs = mget(le,ri+1);\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = mmp[ihs];//out(le,ri,hs);\\n pque.push(pip(p.first-2,P(le,ri)));\\n }\\n else mmp[hs] += mmp[ihs];\\n }\\n ll ans = 0;\\n for (auto p : nmp){ //out(p.first,p.second);\\n if (mmp.find(p.first) == mmp.end()) continue;\\n ans += p.second * mmp[p.first]; //out(p.second,mmp[p.first]);\\n }\\n for (auto q : mmp){\\n //out(q.first, q.second);\\n }\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //cin >> t;\\n while (t--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 12320,\n \"score_of_the_acc\": -0.3493,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2292_6933350\",\n \"code_snippet\": \"#line 1 \\\"aoj.cpp\\\"\\n#include<bits/stdc++.h>\\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\\n#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing PL = pair<long long, long long>;\\nusing pdd = pair<long double, long double>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\nusing ppi = pair<P,int>;\\nusing pip = pair<int,P>;\\nconst int INF = 1001001007;\\nconst long long mod1 = 1000000007LL;\\nconst long long mod2 = 998244353LL;\\nconst ll inf = 2e18;\\nconst ld pi = 3.14159265358979323;\\nconst ld eps = 1e-7;\\ntemplate<typename T>void o(T a);\\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\\ntemplate<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}\\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\\ntemplate<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}\\nvoid revs(string &s) {reverse(s.begin(),s.end());}\\ntemplate<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}\\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\ntemplate<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}\\ntemplate<typename T>T cel(T a,T b){return (a+b-1)/b;}\\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\\ntemplate<typename T>void print(vector<T> v);\\ntemplate<typename T>void print(vector<vector<T>> v);\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(long a){ printf(\\\"%ld\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", 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(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) 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; }\\nvoid o(){cout<<\\\"!?\\\"<<endl;}\\ntemplate<typename T>void o(T a){cout<<a<<endl;}\\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\\nvoid yes(){out(\\\"Yes\\\");}\\nvoid no (){out(\\\"No\\\");}\\nvoid yn (bool t){if(t)yes();else no();}\\ntemplate<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}\\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\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;}\\nll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}\\n\\n\\nvector<int> manacher(string &s){\\n int n = s.size();\\n vector<int> ans(n,0);\\n int i = 0, len = 0;\\n while (i < n){\\n while (i - len >= 0 && i + len < n && s[i-len] == s[i+len]) len++;\\n ans[i] = len;\\n int k = 1;\\n while (i - k >= 0 && k + ans[i-k] < len) ans[i+k] = ans[i-k], k++;\\n i += k, len -= k;\\n }\\n return ans;\\n}\\n\\nvector<int> palindrome_length(string s){\\n string t = \\\"$\\\";\\n for (char c : s) t += c, t += '$';\\n vector<int> a = manacher(t);\\n vector<int> ans(a.size()-2);\\n rep(i,a.size()-2) ans[i] = a[i+1]-1;\\n return ans;\\n}\\n\\n#line 2 \\\"modint.hpp\\\"\\n// for prime m\\ntemplate <long long m>\\nstruct static_modint {\\n using mint = static_modint;\\n \\n public:\\n static constexpr int mod() { return m; }\\n static_modint() : _v(0) {}\\n template <class T>\\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 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 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 assert(_v);\\n return pow(umod() - 2);\\n }\\n\\n mint inverse() const {return inv();}\\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 friend std::ostream &operator<<(std::ostream &os,const mint&p) {\\n return os<<p.val();\\n }\\n friend std::istream &operator>>(std::istream &is, mint &a) {\\n long long t;\\n is>>t;\\n a=mint(t);\\n return (is);\\n }\\n \\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n};\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\n#line 95 \\\"aoj.cpp\\\"\\nusing mint = modint998244353;\\nconst mint base = 249134723;\\nvector<mint> bs;\\nvector<mint> ibs;\\n\\nvoid solve(){\\n string s, t; cin >> s >> t;\\n int n = s.size(), m = t.size();\\n bs.resize(100000,1), ibs.resize(100000,1);\\n rep(i,100000-1) bs[i+1] = bs[i] * base;\\n ibs[100000-1] = bs[100000-1].inv();\\n repb(i,100000-1) ibs[i] = ibs[i+1] * base;\\n vector<mint> nrui(n+1,0), mrui(m+1,0);\\n rep(i,n) nrui[i+1] = nrui[i] + mint(ll(s[i] - 'a' + 1)) * bs[i];\\n rep(i,m) mrui[i+1] = mrui[i] + mint(ll(t[i] - 'a' + 1)) * bs[i];\\n auto nget = [&](int l, int r){\\n return (nrui[r] - nrui[l]) * ibs[l];\\n };\\n auto mget = [&](int l, int r){\\n return (mrui[r] - mrui[l]) * ibs[l];\\n };\\n auto nma = palindrome_length(s);\\n auto mma = palindrome_length(t);\\n map<ll,ll> nmp, mmp;\\n priority_queue<pip> pque;\\n rep(i,nma.size()){\\n if (i % 2 == 0){\\n int ce = i / 2;\\n int le = ce - (nma[i]-1)/2;\\n int ri = ce + (nma[i]-1)/2; \\n mint mhs = nget(le,ri+1);\\n ll hs = mhs.val();\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = 1; //out(le,ri,hs);\\n pque.push(pip(nma[i],P(le,ri)));\\n }\\n else nmp[hs]++;\\n }\\n else {\\n if (nma[i] == 0) continue;\\n int le = (i - 1 - (nma[i] / 2 - 1) * 2) / 2;\\n int ri = (i + 1 + (nma[i] / 2 - 1) * 2) / 2;\\n mint mhs = nget(le,ri+1);\\n ll hs = mhs.val();\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = 1;\\n pque.push(pip(nma[i],P(le,ri)));\\n }\\n else nmp[hs]++;\\n }\\n }\\n while (!pque.empty()){\\n auto p = pque.top(); pque.pop();\\n if (p.first <= 2) continue;\\n int le = p.second.first, ri = p.second.second;\\n mint imhs = nget(le,ri+1);\\n ll ihs = imhs.val();\\n le++, ri--;\\n mint mhs = nget(le,ri+1);\\n ll hs = mhs.val();\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = nmp[ihs]; //out(le,ri,hs);\\n pque.push(pip(p.first-2,P(le,ri)));\\n }\\n else nmp[hs] += nmp[ihs];\\n }\\n rep(i,mma.size()){\\n if (i % 2 == 0){\\n int ce = i / 2;\\n int le = ce - (mma[i]-1)/2;\\n int ri = ce + (mma[i]-1)/2;\\n mint mhs = mget(le,ri+1);\\n ll hs = mhs.val();\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = 1; //out(le,ri,hs);\\n pque.push(pip(mma[i],P(le,ri)));\\n }\\n else mmp[hs]++;\\n }\\n else {\\n if (mma[i] == 0) continue;\\n int le = (i - 1 - (mma[i] / 2 - 1) * 2) / 2;\\n int ri = (i + 1 + (mma[i] / 2 - 1) * 2) / 2;\\n mint mhs = mget(le,ri+1);\\n ll hs = mhs.val();\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = 1;\\n pque.push(pip(mma[i],P(le,ri)));\\n }\\n else mmp[hs]++;\\n }\\n }\\n while (!pque.empty()){\\n auto p = pque.top(); pque.pop();\\n if (p.first <= 2) continue;\\n int le = p.second.first, ri = p.second.second;\\n mint imhs = mget(le,ri+1);\\n ll ihs = imhs.val();\\n le++, ri--;\\n mint mhs = mget(le,ri+1);\\n ll hs = mhs.val();\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = mmp[ihs];//out(le,ri,hs);\\n pque.push(pip(p.first-2,P(le,ri)));\\n }\\n else mmp[hs] += mmp[ihs];\\n }\\n ll ans = 0;\\n for (auto p : nmp){ //out(p.first,p.second);\\n if (mmp.find(p.first) == mmp.end()) continue;\\n ans += p.second * mmp[p.first]; //out(p.second,mmp[p.first]);\\n }\\n for (auto q : mmp){\\n //out(q.first, q.second);\\n }\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //cin >> t;\\n while (t--) solve();\\n}\",\n \"accuracy\": 0.15,\n \"time_ms\": 80,\n \"memory_kb\": 11872,\n \"score_of_the_acc\": -0.3354,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2292_6933347\",\n \"code_snippet\": \"#line 1 \\\"aoj.cpp\\\"\\n#include<bits/stdc++.h>\\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\\n#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)\\n#define all(v) v.begin(),v.end()\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing PL = pair<long long, long long>;\\nusing pdd = pair<long double, long double>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\nusing ppi = pair<P,int>;\\nusing pip = pair<int,P>;\\nconst int INF = 1001001007;\\nconst long long mod1 = 1000000007LL;\\nconst long long mod2 = 998244353LL;\\nconst ll inf = 2e18;\\nconst ld pi = 3.14159265358979323;\\nconst ld eps = 1e-7;\\ntemplate<typename T>void o(T a);\\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\\ntemplate<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}\\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\\ntemplate<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}\\nvoid revs(string &s) {reverse(s.begin(),s.end());}\\ntemplate<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}\\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\ntemplate<typename T>void uniq(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}\\ntemplate<typename T>T cel(T a,T b){return (a+b-1)/b;}\\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\\ntemplate<typename T>void print(vector<T> v);\\ntemplate<typename T>void print(vector<vector<T>> v);\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(long a){ printf(\\\"%ld\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", 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(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) 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; }\\nvoid o(){cout<<\\\"!?\\\"<<endl;}\\ntemplate<typename T>void o(T a){cout<<a<<endl;}\\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\\nvoid yes(){out(\\\"Yes\\\");}\\nvoid no (){out(\\\"No\\\");}\\nvoid yn (bool t){if(t)yes();else no();}\\ntemplate<typename T>void dame(bool t, T s){if(!t){out(s);exit(0);}}\\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\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;}\\nll mpow(ll x,ll n,ll m){if(n==0)return 1LL;x%=m;ll a=mpow(x,n/2,m);a=a*a%m;return (n&1)?a*x%m:a;}\\n\\n\\nvector<int> manacher(string &s){\\n int n = s.size();\\n vector<int> ans(n,0);\\n int i = 0, len = 0;\\n while (i < n){\\n while (i - len >= 0 && i + len < n && s[i-len] == s[i+len]) len++;\\n ans[i] = len;\\n int k = 1;\\n while (i - k >= 0 && k + ans[i-k] < len) ans[i+k] = ans[i-k], k++;\\n i += k, len -= k;\\n }\\n return ans;\\n}\\n\\nvector<int> palindrome_length(string s){\\n string t = \\\"$\\\";\\n for (char c : s) t += c, t += '$';\\n vector<int> a = manacher(t);\\n vector<int> ans(a.size()-2);\\n rep(i,a.size()-2) ans[i] = a[i+1]-1;\\n return ans;\\n}\\n\\n#line 2 \\\"modint.hpp\\\"\\n// for prime m\\ntemplate <long long m>\\nstruct static_modint {\\n using mint = static_modint;\\n \\n public:\\n static constexpr int mod() { return m; }\\n static_modint() : _v(0) {}\\n template <class T>\\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 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 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 assert(_v);\\n return pow(umod() - 2);\\n }\\n\\n mint inverse() const {return inv();}\\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 friend std::ostream &operator<<(std::ostream &os,const mint&p) {\\n return os<<p.val();\\n }\\n friend std::istream &operator>>(std::istream &is, mint &a) {\\n long long t;\\n is>>t;\\n a=mint(t);\\n return (is);\\n }\\n \\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n};\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\n#line 95 \\\"aoj.cpp\\\"\\nusing mint = modint998244353;\\nconst mint base = 249134723;\\nvector<mint> bs;\\nvector<mint> ibs;\\n\\nvoid solve(){\\n string s, t; cin >> s >> t;\\n int n = s.size(), m = t.size();\\n bs.resize(100000,1), ibs.resize(100000,1);\\n rep(i,100000-1) bs[i+1] = bs[i] * base;\\n ibs[100000-1] = bs[100000-1].inv();\\n repb(i,100000-1) ibs[i] = ibs[i+1] * base;\\n vector<mint> nrui(n+1,0), mrui(m+1,0);\\n rep(i,n) nrui[i+1] = nrui[i] + mint(ll(s[i] - 'a' + 1)) * bs[i];\\n rep(i,m) mrui[i+1] = mrui[i] + mint(ll(t[i] - 'a' + 1)) * bs[i];\\n auto nget = [&](int l, int r){\\n return (nrui[r] - nrui[l]) * ibs[l];\\n };\\n auto mget = [&](int l, int r){\\n return (mrui[r] - mrui[l]) * ibs[l];\\n };\\n auto nma = palindrome_length(s);\\n auto mma = palindrome_length(t);\\n map<ll,ll> nmp, mmp;\\n priority_queue<pip> pque;\\n rep(i,nma.size()){\\n if (i % 2 == 0){\\n int ce = i / 2;\\n int le = ce - (nma[i]-1)/2;\\n int ri = ce + (nma[i]-1)/2; \\n mint mhs = nget(le,ri+1);\\n ll hs = mhs.val();\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = 1; //out(le,ri,hs);\\n pque.push(pip(nma[i],P(le,ri)));\\n }\\n else nmp[hs]++;\\n }\\n else {\\n int le = (i - (nma[i])) / 2;\\n int ri = (i + (nma[i])) / 2;\\n if (le == ri) continue;\\n mint mhs = nget(le,ri+1);\\n ll hs = mhs.val();\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = 1;\\n pque.push(pip(nma[i],P(le,ri)));\\n }\\n else nmp[hs]++;\\n }\\n }\\n while (!pque.empty()){\\n auto p = pque.top(); pque.pop();\\n if (p.first <= 2) continue;\\n int le = p.second.first, ri = p.second.second;\\n mint imhs = nget(le,ri+1);\\n ll ihs = imhs.val();\\n le++, ri--;\\n mint mhs = nget(le,ri+1);\\n ll hs = mhs.val();\\n if (nmp.find(hs) == nmp.end()){\\n nmp[hs] = nmp[ihs]; //out(le,ri,hs);\\n pque.push(pip(p.first-2,P(le,ri)));\\n }\\n else nmp[hs] += nmp[ihs];\\n }\\n rep(i,mma.size()){\\n if (i % 2 == 0){\\n int ce = i / 2;\\n int le = ce - (mma[i]-1)/2;\\n int ri = ce + (mma[i]-1)/2;\\n mint mhs = mget(le,ri+1);\\n ll hs = mhs.val();\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = 1; //out(le,ri,hs);\\n pque.push(pip(mma[i],P(le,ri)));\\n }\\n else mmp[hs]++;\\n }\\n else {\\n int le = (i - (mma[i])) / 2;\\n int ri = (i + (mma[i])) / 2;\\n if (le == ri) continue;\\n mint mhs = mget(le,ri+1);\\n ll hs = mhs.val();\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = 1;\\n pque.push(pip(mma[i],P(le,ri)));\\n }\\n else mmp[hs]++;\\n }\\n }\\n while (!pque.empty()){\\n auto p = pque.top(); pque.pop();\\n if (p.first <= 2) continue;\\n int le = p.second.first, ri = p.second.second;\\n mint imhs = mget(le,ri+1);\\n ll ihs = imhs.val();\\n le++, ri--;\\n mint mhs = mget(le,ri+1);\\n ll hs = mhs.val();\\n if (mmp.find(hs) == mmp.end()){\\n mmp[hs] = mmp[ihs];//out(le,ri,hs);\\n pque.push(pip(p.first-2,P(le,ri)));\\n }\\n else mmp[hs] += mmp[ihs];\\n }\\n ll ans = 0;\\n for (auto p : nmp){ //out(p.first,p.second);\\n if (mmp.find(p.first) == mmp.end()) continue;\\n ans += p.second * mmp[p.first]; //out(p.second,mmp[p.first]);\\n }\\n for (auto q : mmp){\\n //out(q.first, q.second);\\n }\\n out(ans);\\n}\\n\\nint main(){\\n int t = 1; //cin >> t;\\n while (t--) solve();\\n}\",\n \"accuracy\": 0.06666666666666667,\n \"time_ms\": 60,\n \"memory_kb\": 11852,\n \"score_of_the_acc\": -0.2658,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2292_6933321\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst long long BASE = 123456789;\\nconst long long M30 = ((long long) 1 << 30) - 1;\\nconst long long M31 = ((long long) 1 << 31) - 1;\\nconst long long MOD = ((long long) 1 << 61) - 1;\\nunsigned long long modulo(unsigned long long x){\\n unsigned long long xu = x >> 61;\\n unsigned long long xd = x & MOD;\\n unsigned long long res = xu + xd;\\n if (res >= MOD){\\n res -= MOD;\\n }\\n return res;\\n}\\nunsigned long long mul(unsigned long long a, unsigned long long b){\\n unsigned long long au = a >> 31;\\n unsigned long long ad = a & M31;\\n unsigned long long bu = b >> 31;\\n unsigned long long bd = b & M31;\\n unsigned long long mid = au * bd + ad * bu;\\n unsigned long long midu = mid >> 30;\\n unsigned long long midd = mid & M30;\\n return modulo(au * bu * 2 + midu + (midd << 31) + ad * bd);\\n}\\nstruct rolling_hash{\\n vector<long long> POW, S;\\n rolling_hash(string s){\\n int N = s.size();\\n POW.resize(N + 1);\\n POW[0] = 1;\\n for (int i = 0; i < N; i++){\\n POW[i + 1] = mul(POW[i], BASE);\\n }\\n S.resize(N + 1);\\n S[N] = 0;\\n for (int i = N - 1; i >= 0; i--){\\n S[i] = modulo(mul(S[i + 1], BASE) + s[i]);\\n }\\n }\\n long long get(int L, int R){\\n return modulo(S[L] + MOD - mul(S[R], POW[R - L]));\\n }\\n};\\nvector<int> manacher(string &S){\\n int N = S.size();\\n vector<int> ans(N, 0);\\n int i = 0, j = 0;\\n while (i < N){\\n while (i >= j && i + j < N && S[i - j] == S[i + j]){\\n j++;\\n }\\n ans[i] = j;\\n int k = 1;\\n while (i >= k && i + k < N && k + ans[i - k] < j){\\n ans[i + k] = ans[i - k];\\n k++;\\n }\\n i += k;\\n j -= k;\\n }\\n return ans;\\n}\\nunordered_map<unsigned long long, int> solve(string S){\\n int N = S.size();\\n string T = \\\"$\\\";\\n for (int i = 0; i < N; i++){\\n T += S[i];\\n T += '$';\\n }\\n vector<int> A = manacher(T);\\n rolling_hash RH(S);\\n unordered_map<unsigned long long, int> mp;\\n priority_queue<pair<int, int>> pq;\\n for (int i = 1; i < N * 2; i++){\\n int l = (i - A[i] + 2) / 2, r = (i + A[i] - 1) / 2;\\n if (l < r){\\n unsigned long long hash = RH.get(l, r);\\n if (mp.count(hash) == 0){\\n pq.push(make_pair(r - l, l));\\n }\\n mp[hash]++;\\n }\\n }\\n while (!pq.empty()){\\n int L = pq.top().second;\\n int R = L + pq.top().first;\\n pq.pop();\\n unsigned long long hash = RH.get(L, R);\\n L++;\\n R--;\\n if (L < R){\\n unsigned long long hash2 = RH.get(L, R);\\n if (mp.count(hash2) == 0){\\n pq.push(make_pair(R - L, L));\\n }\\n mp[hash2] += mp[hash];\\n }\\n }\\n return mp;\\n}\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n string S;\\n cin >> S;\\n string T;\\n cin >> T;\\n unordered_map<unsigned long long, int> A = solve(S);\\n unordered_map<unsigned long long, int> B = solve(T);\\n long long ans = 0;\\n for (auto P : A){\\n if (B.count(P.first) == 1){\\n ans += (long long) P.second * B[P.first];\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 8848,\n \"score_of_the_acc\": -0.069,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1276,"cells":{"group_id":{"kind":"string","value":"aoj_2294_cpp"},"problem_description":{"kind":"string","value":"E: Entangled with Lottery\nICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．\n今日の修行は，あみだくじを利用して，未来を読む力をつけて運気を高めようというものである．もちろん直感に頼るだけでなく，綿密な確率計算も欠かせない．\n今回考えるあみだくじは，長さ\nH\n+ 1 センチメートルの縦棒\nN\n本からなる．うさぎは棒の上部を見て，\nN\n本のうち 1 本を選ぶことになる．棒の下部には，左から\nP\n本目の棒の場所にのみ「当たり」と書かれている．あみだくじにはいくつかの横棒が含まれる．横棒の配置に関して，以下の条件を考えよう．\n各横棒は，\na\nを 1 以上\nH\n以下の整数として，縦棒の上端から\na\nセンチメートルの高さにある．\n各横棒は，隣り合った 2 本の縦棒のみを結ぶ．\n同じ高さには複数の横棒は存在しない．\nうさぎはこれらの条件を満たすように\nM\n本の横棒を引いた．あいにくうさぎは記憶力が良いので，当たりの位置や横棒の位置をすべて覚えてしまっており，あみだくじを楽しめない．そこで友達のねこにさらに横棒を追加してもらうことにした．\nまず，うさぎは当たりを狙って\nN\n本の棒のうち 1 本を選ぶ．その後，ねこは以下の操作をちょうど\nK\n回行う．\n横棒を追加しても上で指定された条件を満たすような場所のうち 1 箇所を無作為に選ぶ．ここで，どの場所も等確率で選ばれるものとする．選んだ場所に横棒を追加する．\nそして，うさぎが選んだ棒が当たりであったかを判定する．棒の辿り方は通常のあみだくじと同様である (横棒に出会うたびに隣の縦棒に移る)．うさぎは，可能な限り当たりとなる確率を高くしたい．\nInput\nH\nN\nP\nM\nK\nA\n1\nB\n1\n...\nA\nM\nB\nM\nA\ni\n,\nB\ni\n(1 ≤\ni\n≤\nM\n) はうさぎが引いた横棒のうち\ni\n番目のものが，縦棒の上端から\nA\ni\nセンチメートルの高さにあり，左から\nB\ni\n本目の縦棒と左から\nB\ni\n+ 1 本目の縦棒を結ぶことを表す整数である．\n2 ≤\nH\n≤ 500，2 ≤\nN\n≤ 100，1 ≤\nP\n≤\nN\n，1 ≤\nM\n≤ 100，1 ≤\nK\n≤ 100，\nM\n+\nK\n≤\nH\n，1 ≤\nA\n1\n<\nA\n2\n< ... <\nA\nM\n≤\nH\n，1 ≤\nB\ni\n≤\nN\n- 1 を満たす．\nOutput\n当たりとなる確率が最大となるようにうさぎが棒を選んだときの，当たりとなる確率を 1 行に出力せよ．10\n-6\n以下の絶対誤差が許容される．\nSample Input 1\n9 4 3 2 1\n2 1\n7 3\nSample Output 1\n0.571428571\nSample Input 2\n9 4 3 2 3\n2 1\n7 3\nSample Output 2\n0.375661376"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2294_10189840","code_snippet":"// AOJ #2294\n// Entangled with Lottery 2025.2.4\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst double EPS = 1e-14;\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int H, N, P, M, K;\n cin >> H >> N >> P >> M >> K;\n\n vector<int> used(H+1, -1);\n for(int i=0; i<M; i++){\n int A, B;\n cin >> A >> B;\n used[A] = B;\n }\n\n vector<int> freeCount(H+2, 0);\n for(int r = H; r >= 1; r--){\n freeCount[r] = freeCount[r+1] + (used[r] == -1 ? 1 : 0);\n }\n\n vector<vector<double>> dpBelow(N+1, vector<double>(K+1, 0.0)),\n dpCurrent(N+1, vector<double>(K+1, 0.0));\n\n for(int i=1; i<=N; i++){\n for(int k2=0; k2<=K; k2++){\n dpBelow[i][k2] = ( (i == P) ? 1.0 : 0.0 );\n }\n }\n\n for(int r=H; r>=1; r--){\n // 1. 既存横棒ありの場合\n if(used[r] != -1){\n int b = used[r]; \n for(int i=1; i<=N; i++){\n for(int k2=0; k2<=K; k2++){\n int nxt = i;\n if(i == b) nxt = b+1;\n else if(i == b+1) nxt = b;\n dpCurrent[i][k2] = dpBelow[nxt][k2];\n }\n }\n }\n else {\n for(int i=1; i<=N; i++){\n for(int k2=0; k2<=K; k2++){\n dpCurrent[i][k2] = 0.0;\n }\n }\n if(freeCount[r] == 0){\n for(int i=1; i<=N; i++){\n dpCurrent[i][0] = dpBelow[i][0];\n }\n }\n else {\n for(int i=1; i<=N; i++){\n for(int k2=0; k2<=K; k2++){\n double p_not = 1.0;\n double val_not = dpBelow[i][k2];\n\n double val_choose = 0.0;\n if(k2 > 0 && freeCount[r] >= k2){\n double p_choose = (double)k2 / (double)freeCount[r];\n p_not = 1.0 - p_choose;\n\n double sumSwap = 0.0;\n auto &A = dpBelow;\n\n if(i == 1){\n double a1 = A[1][k2-1];\n double a2 = A[2][k2-1];\n sumSwap = a2 + (N-2) * a1;\n }\n else if(i == N){\n double aN = A[N][k2-1];\n double aN_1 = A[N-1][k2-1];\n sumSwap = aN_1 + (N-2) * aN;\n }\n else {\n double ai = A[i][k2-1];\n double ai_1 = A[i-1][k2-1];\n double ai_p1 = A[i+1][k2-1];\n sumSwap = ai_1 + ai_p1 + (N-3)*ai;\n }\n val_choose = p_choose * (1.0/(N-1)) * sumSwap;\n }\n dpCurrent[i][k2] = p_not * val_not + val_choose;\n }\n }\n }\n }\n dpBelow.swap(dpCurrent);\n }\n double ans = 0.0;\n for(int i=1; i<=N; i++){\n ans = max(ans, dpBelow[i][K]);\n }\n cout << fixed << setprecision(9) << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3680,"score_of_the_acc":-0.0037,"final_rank":4},{"submission_id":"aoj_2294_9776894","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\nint main() {\n int H, N, P, M, K;\n cin >> H >> N >> P >> M >> K;\n P--;\n vector<int> X(H,-1);\n rep(i,0,M) {\n int A, B;\n cin >> A >> B;\n A--, B--;\n X[A] = B;\n }\n auto next = [&](int i, int j) -> int {\n if (i == j) return i+1;\n if (i == j+1) return i-1;\n return i;\n };\n vector DP(2, vector(N, vector<double>(H-M+1,0.0)));\n DP[H&1][P][0] = 1.0;\n rrep(i,0,H) {\n rep(j,0,N) {\n rep(k,0,H-M+1) {\n DP[i&1][j][k] = 0.0;\n }\n }\n if (X[i] != -1) {\n rep(j,0,N) {\n rep(k,0,H-M+1) {\n DP[i&1][next(j,X[i])][k] += DP[(i+1)&1][j][k];\n }\n }\n }\n else {\n rep(j,0,N) {\n rep(k,0,H-M+1) {\n if (DP[(i+1)&1][j][k] == 0.0) continue;\n DP[i&1][j][k] += DP[(i+1)&1][j][k];\n double Kiyo = (DP[(i+1)&1][j][k] * (double)(k+1) / (double)(H-M-k)) / (double(N-1));\n if (j == 0) {\n DP[i&1][j][k+1] += Kiyo * (double)(N-2);\n DP[i&1][j+1][k+1] += Kiyo;\n }\n else if (j == N-1) {\n DP[i&1][j][k+1] += Kiyo * (double)(N-2);\n DP[i&1][j-1][k+1] += Kiyo;\n }\n else {\n DP[i&1][j][k+1] += Kiyo * (double)(N-3);\n DP[i&1][j-1][k+1] += Kiyo;\n DP[i&1][j+1][k+1] += Kiyo;\n }\n }\n }\n }\n }\n double ANS = 0, SUM = 0.0;\n rep(i,0,N) {\n chmax(ANS, DP[0][i][K]);\n SUM += DP[0][i][K];\n }\n printf(\"%.12f\\n\", ANS / SUM);\n}","accuracy":1,"time_ms":40,"memory_kb":4476,"score_of_the_acc":-0.0375,"final_rank":10},{"submission_id":"aoj_2294_8332325","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ndouble solve(int H, int N, int P, int M, int K, const vector<int>& A, const vector<int>& B) {\n\tvector<int> place(H, -1);\n\tfor (int i = 0; i < M; i++) {\n\t\tplace[A[i]] = B[i];\n\t}\n\tconst double inv = 1.0 / (N - 1);\n\tvector<vector<double> > dp(N, vector<double>(K + 1, 0.0)); // dp[position][# of drawn lines]\n\tdp[P][0] = 1.0;\n\tfor (int i = H - 1; i >= 0; i--) {\n\t\tvector<vector<double> > ndp(N, vector<double>(K + 1, 0.0));\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tfor (int k = 0; k <= K; k++) {\n\t\t\t\tif (place[i] != -1) {\n\t\t\t\t\tint last = (j == place[i] ? place[i] + 1 : j == place[i] + 1 ? place[i] : j);\n\t\t\t\t\tndp[j][k] += dp[last][k];\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\t// case that doesn't draw\n\t\t\t\t\tndp[j][k] += dp[j][k];\n\t\t\t\t\t// case that draws\n\t\t\t\t\tif (k >= 1) {\n\t\t\t\t\t\tdouble prob = ((N - 1) - (j == 0 || j == N - 1 ? 1 : 2)) * inv;\n\t\t\t\t\t\tndp[j][k] += dp[j][k - 1] * prob;\n\t\t\t\t\t\tif (j != 0) {\n\t\t\t\t\t\t\tndp[j][k] += dp[j - 1][k - 1] * inv;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (j != N - 1) {\n\t\t\t\t\t\t\tndp[j][k] += dp[j + 1][k - 1] * inv;\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\tdp = ndp;\n\t}\n\tdouble ans = 0.0, sum = 0.0;\n\tfor (int i = 0; i < N; i++) {\n\t\tsum += dp[i][K];\n\t\tans = max(ans, dp[i][K]);\n\t}\n\treturn ans / sum;\n}\n\nint main() {\n\tint H, N, P, M, K;\n\tcin >> H >> N >> P >> M >> K;\n\tP -= 1;\n\tvector<int> A(M), B(M);\n\tfor (int i = 0; i < M; i++) {\n\t\tcin >> A[i] >> B[i];\n\t\tA[i] -= 1;\n\t\tB[i] -= 1;\n\t}\n\tdouble ans = solve(H, N, P, M, K, A, B);\n\tcout.precision(15);\n\tcout << fixed << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3744,"score_of_the_acc":-0.0045,"final_rank":6},{"submission_id":"aoj_2294_7166647","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n int H, N, P, M, K;\n cin >> H >> N >> P >> M >> K;\n vector<int> line(H, -1);\n for (int i = 0; i < M; i++) {\n int A, B;\n cin >> A >> B;\n line[--A] = --B;\n }\n vector<vector<double>> dp(N, vector<double>(K + 1, 0)), ndp(N, vector<double>(K + 1, 0));\n dp[--P][0] = 1;\n for (int k = H - 1; k >= 0; k--) {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j <= K; j++) {\n double& val = dp[i][j];\n if (val == 0) continue;\n if (line[k] != -1) {\n if (i == line[k])\n ndp[i + 1][j] += val;\n else if (i == line[k] + 1)\n ndp[i - 1][j] += val;\n else\n ndp[i][j] += val;\n } else {\n double p = 1.0 * (K - j) / (k + 1 - M);\n ndp[i][j] += val * (1 - p);\n if (j < K) {\n double add = val * p / (N - 1);\n ndp[i][j + 1] += add * (N - 3);\n if (i + 1 < N)\n ndp[i + 1][j + 1] += add;\n else\n ndp[i][j + 1] += add;\n if (i - 1 >= 0)\n ndp[i - 1][j + 1] += add;\n else\n ndp[i][j + 1] += add;\n }\n }\n val = 0;\n }\n }\n if (line[k] != -1) M--;\n swap(dp, ndp);\n }\n\n double ans = 0;\n for (int i = 0; i < N; i++) ans = max(ans, dp[i][K]);\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":10,"memory_kb":3676,"score_of_the_acc":-0.0036,"final_rank":3},{"submission_id":"aoj_2294_6698102","code_snippet":"#include <bits/stdc++.h>\n\n#ifdef _MSC_VER\n# include <intrin.h>\n#else\n# include <x86intrin.h>\n#endif\n\n#include <limits>\n#include <type_traits>\n\nnamespace suisen {\n// ! utility\ntemplate <typename ...Types>\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\ntemplate <bool cond_v, typename Then, typename OrElse>\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\n if constexpr (cond_v) {\n return std::forward<Then>(then);\n } else {\n return std::forward<OrElse>(or_else);\n }\n}\n\n// ! function\ntemplate <typename ReturnType, typename Callable, typename ...Args>\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\ntemplate <typename F, typename T>\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\ntemplate <typename F, typename T>\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\n\ntemplate <typename Comparator, typename T>\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\n\n// ! integral\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\ntemplate <typename T, unsigned int n>\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\ntemplate <typename T, unsigned int n>\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\n\n// ?\ntemplate <typename T>\nstruct safely_multipliable {};\ntemplate <>\nstruct safely_multipliable<int> { using type = long long; };\ntemplate <>\nstruct safely_multipliable<long long> { using type = __int128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\ntemplate <>\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\ntemplate <>\nstruct safely_multipliable<float> { using type = float; };\ntemplate <>\nstruct safely_multipliable<double> { using type = double; };\ntemplate <>\nstruct safely_multipliable<long double> { using type = long double; };\ntemplate <typename T>\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\n\ntemplate <typename T, typename = void>\nstruct rec_value_type {\n using type = T;\n};\ntemplate <typename T>\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\n using type = typename rec_value_type<typename T::value_type>::type;\n};\ntemplate <typename T>\nusing rec_value_type_t = typename rec_value_type<T>::type;\n\n} // namespace suisen\n\n// ! type aliases\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n\ntemplate <typename T>\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\ntemplate <typename T, typename U>\nusing umap = std::unordered_map<T, U>;\n\n// ! macros (capital: internal macro)\n#define OVERLOAD2(_1,_2,name,...) name\n#define OVERLOAD3(_1,_2,_3,name,...) name\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\n\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\n#define REP3(i,l,r) REP4(i,l,r,1)\n#define REP2(i,n) REP3(i,0,n)\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\n#define REPINF2(i,l) REPINF3(i,l,1)\n#define REPINF1(i) REPINF2(i,0)\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\n#define RREP3(i,l,r) RREP4(i,l,r,1)\n#define RREP2(i,n) RREP3(i,0,n)\n\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\n\n#define CAT_I(a, b) a##b\n#define CAT(a, b) CAT_I(a, b)\n#define UNIQVAR(tag) CAT(tag, __LINE__)\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\n\n#define all(iterable) std::begin(iterable), std::end(iterable)\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\n\n#ifdef LOCAL\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\n\ntemplate <class T, class... Args>\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\n constexpr const char* prefix = \"[\\033[32mDEBUG\\033[m] \";\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \"\" : \"(\";\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \"\" : \")\";\n std::cerr << prefix << open_brakets << s << close_brakets << \": \" << open_brakets << std::forward<T>(first);\n ((std::cerr << \", \" << std::forward<Args>(args)), ...);\n std::cerr << close_brakets << \"\\n\";\n}\n\n#else\n# define debug(...) void(0)\n#endif\n\n// ! I/O utilities\n\n// __int128_t\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n __uint128_t tmp = value < 0 ? -value : value;\n char buffer[128];\n char* d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n if (value < 0) {\n --d;\n *d = '-';\n }\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n// __uint128_t\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\n std::ostream::sentry s(dest);\n if (s) {\n char buffer[128];\n char* d = std::end(buffer);\n do {\n --d;\n *d = \"0123456789\"[value % 10];\n value /= 10;\n } while (value != 0);\n int len = std::end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(std::ios_base::badbit);\n }\n }\n return dest;\n}\n\n// pair\ntemplate <typename T, typename U>\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\n return out << a.first << ' ' << a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return out;\n } else {\n out << std::get<N>(a);\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\n out << ' ';\n }\n return operator<<<N + 1>(out, a);\n }\n}\n// vector\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\n// array\ntemplate <typename T, size_t N>\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\n for (auto it = a.begin(); it != a.end();) {\n out << *it;\n if (++it != a.end()) out << ' ';\n }\n return out;\n}\ninline void print() { std::cout << '\\n'; }\ntemplate <typename Head, typename... Tail>\ninline void print(const Head& head, const Tail &...tails) {\n std::cout << head;\n if (sizeof...(tails)) std::cout << ' ';\n print(tails...);\n}\ntemplate <typename Iterable>\nauto print_all(const Iterable& v, std::string sep = \" \", std::string end = \"\\n\") -> decltype(std::cout << *v.begin(), void()) {\n for (auto it = v.begin(); it != v.end();) {\n std::cout << *it;\n if (++it != v.end()) std::cout << sep;\n }\n std::cout << end;\n}\n\n__int128_t parse_i128(std::string& s) {\n __int128_t ret = 0;\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n if (s[0] == '-') ret = -ret;\n return ret;\n}\n__uint128_t parse_u128(std::string& s) {\n __uint128_t ret = 0;\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\n return ret;\n}\n// __int128_t\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\n std::string s;\n in >> s;\n v = parse_i128(s);\n return in;\n}\n// __uint128_t\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\n std::string s;\n in >> s;\n v = parse_u128(s);\n return in;\n}\n// pair\ntemplate <typename T, typename U>\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\n return in >> a.first >> a.second;\n}\n// tuple\ntemplate <unsigned int N = 0, typename ...Args>\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\n return in;\n } else {\n return operator>><N + 1>(in >> std::get<N>(a), a);\n }\n}\n// vector\ntemplate <typename T>\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\n// array\ntemplate <typename T, size_t N>\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\n return in;\n}\ntemplate <typename ...Args>\nvoid read(Args &...args) {\n (std::cin >> ... >> args);\n}\n\n// ! integral utilities\n\n// Returns pow(-1, n)\ntemplate <typename T>\nconstexpr inline int pow_m1(T n) {\n return -(n & 1) | 1;\n}\n// Returns pow(-1, n)\ntemplate <>\nconstexpr inline int pow_m1<bool>(bool n) {\n return -int(n) | 1;\n}\n\n// Returns floor(x / y)\ntemplate <typename T>\nconstexpr inline T fld(const T x, const T y) {\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\n}\ntemplate <typename T>\nconstexpr inline T cld(const T x, const T y) {\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\n}\n\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\n__attribute__((target(\"popcnt\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\ntemplate <typename T>\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\ntemplate <typename T>\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\ntemplate <typename T>\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\ntemplate <typename T>\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\n\n// ! container\n\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\nauto priqueue_comp(const Comparator comparator) {\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\n}\n\ntemplate <typename Iterable>\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\n return iterable.size();\n}\n\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\nauto generate_vector(int n, Gen generator) {\n std::vector<T> v(n);\n for (int i = 0; i < n; ++i) v[i] = generator(i);\n return v;\n}\ntemplate <typename T>\nauto generate_range_vector(T l, T r) {\n return generate_vector(r - l, [l](int i) { return l + i; });\n}\ntemplate <typename T>\nauto generate_range_vector(T n) {\n return generate_range_vector(0, n);\n}\n\ntemplate <typename T>\nvoid sort_unique_erase(std::vector<T>& a) {\n std::sort(a.begin(), a.end());\n a.erase(std::unique(a.begin(), a.end()), a.end());\n}\n\ntemplate <typename InputIterator, typename BiConsumer>\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\n}\ntemplate <typename Container, typename BiConsumer>\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\n foreach_adjacent_values(c.begin(), c.end(), f);\n}\n\n// ! other utilities\n\n// x <- min(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmin(T& x, const T& y) {\n if (y >= x) return false;\n x = y;\n return true;\n}\n// x <- max(x, y). returns true iff `x` has chenged.\ntemplate <typename T>\ninline bool chmax(T& x, const T& y) {\n if (y <= x) return false;\n x = y;\n return true;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::string bin(T val, int bit_num = -1) {\n std::string res;\n if (bit_num >= 0) {\n for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\n } else {\n for (; val; val >>= 1) res += '0' + (val & 1);\n std::reverse(res.begin(), res.end());\n }\n return res;\n}\n\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\n std::vector<T> res;\n for (; val; val /= base) res.push_back(val % base);\n if (res.empty()) res.push_back(T{ 0 });\n return res;\n}\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\n auto res = digits_low_to_high(val, base);\n std::reverse(res.begin(), res.end());\n return res;\n}\n\ntemplate <typename T>\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\n std::ostringstream ss;\n for (auto it = v.begin(); it != v.end();) {\n ss << *it;\n if (++it != v.end()) ss << sep;\n }\n ss << end;\n return ss.str();\n}\n\nnamespace suisen {}\nusing namespace suisen;\nusing namespace std;\n\nstruct io_setup {\n io_setup(int precision = 20) {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(precision);\n }\n} io_setup_ {};\n\n// ! code from here\n\nint main() {\n input(int, h, n, p, m, k);\n --p;\n\n vector<int> bar(h, -1);\n rep(i, m) {\n input(int, a, b);\n --a, --b;\n bar[a] = b;\n }\n\n vector dp(h + 1, vector(n, vector<double>(k + 2, 0)));\n dp[h][p][0] = 1;\n rrep(i, h) rep(pos, n) rep(use, k + 1) {\n if (bar[i] < 0) {\n dp[i][pos][use] += dp[i + 1][pos][use];\n int lc = pos > 0, rc = pos < n - 1, mc = (n - 1) - lc - rc;\n if (lc) {\n dp[i][pos - 1][use + 1] += dp[i + 1][pos][use] * (use + 1) / (n - 1) / (h - m - use);\n }\n if (rc) {\n dp[i][pos + 1][use + 1] += dp[i + 1][pos][use] * (use + 1) / (n - 1) / (h - m - use);\n }\n if (mc) {\n dp[i][pos][use + 1] += mc * dp[i + 1][pos][use] * (use + 1) / (n - 1) / (h - m - use);\n }\n } else {\n int npos;\n if (bar[i] == pos) {\n npos = pos + 1;\n } else if (bar[i] == pos - 1) {\n npos = pos - 1;\n } else {\n npos = pos;\n }\n dp[i][npos][use] += dp[i + 1][pos][use];\n }\n }\n\n vector<double> ans(n);\n rep(i, n) {\n ans[i] = dp[0][i][k];\n }\n debug(ans);\n\n double sum = accumulate(all(ans), 0);\n double val = *max_element(all(ans));\n debug(sum, val);\n print(val);\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":45452,"score_of_the_acc":-0.5345,"final_rank":13},{"submission_id":"aoj_2294_5943187","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>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\n\nint ami[502];\ndouble dp[2][102][502];\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int h,n,p,m,K; cin >> h >> n >> p >> m >> K;\n p--;\n for(int i=0;i<m;i++){\n int a,b; cin >> a >> b;\n ami[a] = b;\n }\n int cr = 0;\n dp[cr][0][p] = 1.0;\n // 高さを選ぶ確率は最後にまとめて\n for(int i=h;i>0;i--){\n int nx = (1^cr);\n for(int j=0;j<=K;j++){\n for(int k=0;k<n;k++){\n dp[nx][j][k] = 0;\n }\n }\n for(int j=0;j<=K;j++){\n for(int k=0;k<n;k++){\n if(ami[i]){\n if(ami[i] == k){\n dp[nx][j][k-1] += dp[cr][j][k];\n }\n else if(ami[i] == k+1){\n dp[nx][j][k+1] += dp[cr][j][k];\n }\n else{\n dp[nx][j][k] += dp[cr][j][k];\n }\n }\n else{\n dp[nx][j][k] += dp[cr][j][k];\n if(j == K)continue;\n if(k == 0){\n dp[nx][j+1][1] += dp[cr][j][k]/(double)(n-1);\n dp[nx][j+1][0] += dp[cr][j][k]*(n-2)/(double)(n-1);\n }\n else if(k+1 == n){\n dp[nx][j+1][n-2] += dp[cr][j][k]/(double)(n-1);\n dp[nx][j+1][n-1] += dp[cr][j][k]*(n-2)/(double)(n-1);\n }\n else{\n dp[nx][j+1][k] += dp[cr][j][k]*(n-3)/(double)(n-1);\n dp[nx][j+1][k+1] += dp[cr][j][k]/(double)(n-1);\n dp[nx][j+1][k-1] += dp[cr][j][k]/(double)(n-1);\n }\n }\n }\n }\n cr = nx;\n }\n double res = 0;\n for(int i=0;i<n;i++){\n res = max(res, dp[cr][K][i]);\n }\n for(int j=1;j<=K;j++){\n res *= (K+1-j)/(double)(h-m-j+1);\n }\n printf(\"%.9f\\n\",res);\n}","accuracy":1,"time_ms":10,"memory_kb":4360,"score_of_the_acc":-0.0121,"final_rank":7},{"submission_id":"aoj_2294_5921393","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\ndouble dp[2][101][101];\n\nint main(){\n int h,n,p,m,k; cin >> h >> n >> p >> m >> k; p--;\n vector<int> x(h,-1);\n rep(i,m){\n int a,b; cin >> a >> b; a--; b--;\n x[a] = b;\n }\n reverse(all(x));\n dp[0][0][p] = 1;\n int K = h-m;\n rep(i,h){\n rep(j,k+1) rep(l,n) dp[1][j][l] = 0;\n if(x[i] == -1){\n rep(j,k+1) rep(l,n){\n dp[1][j][l] += dp[0][j][l] * (K-(k-j)) / K;\n dp[1][j+1][l] += dp[0][j][l] * (k-j) / K * (n-3+(l==0||l==n-1)) / (n-1); \n if(l>0) dp[1][j+1][l-1] += dp[0][j][l] * (k-j) / K / (n-1);\n if(l<n-1) dp[1][j+1][l+1] += dp[0][j][l] * (k-j) / K / (n-1);\n }\n K--;\n }else{\n rep(j,k+1) rep(l,n){\n if(x[i] == l) dp[1][j][l+1] += dp[0][j][l];\n else if(x[i] == l-1) dp[1][j][l-1] += dp[0][j][l];\n else dp[1][j][l] += dp[0][j][l];\n }\n }\n swap(dp[0],dp[1]);\n }\n double ans = 0;\n rep(i,n) chmax(ans, dp[0][k][i]);\n printf(\"%.10f\\n\",ans);\n}","accuracy":1,"time_ms":10,"memory_kb":3712,"score_of_the_acc":-0.0041,"final_rank":5},{"submission_id":"aoj_2294_5347422","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n cout << fixed << setprecision(10);\n int H, N, P, M, K;\n cin >> H >> N >> P >> M >> K;\n P--;\n vector<int> A(M), B(M);\n for (int i = 0; i < M; i++){\n cin >> A[i] >> B[i];\n A[i]--;\n B[i]--;\n }\n vector<int> x(H, -1);\n for (int i = 0; i < M; i++){\n x[A[i]] = B[i];\n }\n vector<vector<double>> dp(K + 1, vector<double>(N, 0));\n dp[0][P] = 1;\n int cnt = H - M;\n for (int i = H - 1; i >= 0; i--){\n if (x[i] != -1){\n for (int j = 0; j <= K; j++){\n swap(dp[j][x[i]], dp[j][x[i] + 1]);\n }\n } else {\n vector<vector<double>> dp2(K + 1, vector<double>(N, 0));\n for (int j = 0; j <= K; j++){\n double p = (double) (K - j) / cnt;\n for (int k = 0; k < N; k++){\n dp2[j][k] += dp[j][k] * (1 - p);\n if (j < K){\n double q = p;\n if (k > 0){\n dp2[j + 1][k - 1] += dp[j][k] * p / (N - 1);\n q -= p / (N - 1);\n }\n if (k < N - 1){\n dp2[j + 1][k + 1] += dp[j][k] * p / (N - 1);\n q -= p / (N - 1);\n }\n dp2[j + 1][k] += dp[j][k] * q;\n }\n }\n }\n swap(dp, dp2);\n cnt--;\n }\n }\n double ans = 0;\n for (int i = 0; i < N; i++){\n ans = max(ans, dp[K][i]);\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":3380,"score_of_the_acc":-0.04,"final_rank":11},{"submission_id":"aoj_2294_5255025","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <algorithm>\n#include <vector>\n\nusing namespace std;\nusing ldouble = long double;\n\nvoid solve() {\n int h, n, s, m, k;\n cin >> h >> n >> s >> m >> k;\n\n vector<int> ls(h, -1);\n while (m--) {\n int x, y;\n cin >> x >> y;\n ls[--x] = --y;\n }\n\n auto dp = vector(k + 1, vector(n, 0.L));\n dp[0][--s] = 1;\n // 引いた横線の数、当たりの位置\n\n int x = 0; // 横線を引ける段の数\n\n reverse(ls.begin(), ls.end());\n for (auto py : ls) {\n // 下にある段数\n if (py != -1) {\n for (int i = 0; i <= k; ++i) {\n swap(dp[i][py], dp[i][py + 1]);\n }\n\n } else {\n ++x;\n auto ndp = vector(k + 1, vector(n, 0.L));\n\n for (int i = 0; i <= k; ++i) {\n // 線を引く確率\n auto prob = ldouble(i) / x;\n\n // 線を引かない場合\n for (int y = 0; y < n; ++y) {\n ndp[i][y] += dp[i][y] * (1 - prob);\n }\n\n if (i > 0) {\n // 線を引く場合\n for (int y = 0; y < n; ++y) {\n int stay = n - 1;\n\n if (y + 1 < n) {\n // (y,y+1)\n ndp[i][y] += dp[i - 1][y + 1] * prob / (n - 1);\n --stay;\n }\n if (y - 1 >= 0) {\n // (y-1,y)\n ndp[i][y] += dp[i - 1][y - 1] * prob / (n - 1);\n --stay;\n }\n\n ndp[i][y] += dp[i - 1][y] * prob * stay / (n - 1);\n }\n }\n }\n\n swap(dp, ndp);\n }\n }\n\n cout << *max_element(dp[k].begin(), dp[k].end()) << \"\\n\";\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n solve();\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3720,"score_of_the_acc":-0.0202,"final_rank":8},{"submission_id":"aoj_2294_5249508","code_snippet":"#include<iostream>\n#include<iomanip>\nusing namespace std;\nint H,N,P,M,K;\nint id[505];\ndouble dp[2][102][505];\nmain()\n{\n\tcin>>H>>N>>P>>M>>K;\n\tP--;\n\tfor(int i=0;i<M;i++)\n\t{\n\t\tint a,b;cin>>a>>b;\n\t\tid[a-1]=b;\n\t}\n\tint now=0;\n\tdp[now][0][P]=1;\n\tfor(int i=H;i--;)\n\t{\n\t\tint nxt=1-now;\n\t\tfor(int j=0;j<=K;j++)for(int k=0;k<N;k++)dp[nxt][j][k]=0;\n\t\tfor(int j=0;j<=K;j++)for(int k=0;k<N;k++)\n\t\t{\n\t\t\tif(id[i])\n\t\t\t{\n\t\t\t\tif(k==id[i]-1)dp[nxt][j][k+1]+=dp[now][j][k];\n\t\t\t\telse if(k==id[i])dp[nxt][j][k-1]+=dp[now][j][k];\n\t\t\t\telse dp[nxt][j][k]+=dp[now][j][k];\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tdp[nxt][j][k]+=dp[now][j][k];\n\t\t\t\tif(k==0)\n\t\t\t\t{\n\t\t\t\t\tdp[nxt][j+1][k]+=dp[now][j][k]*(N-2)/(N-1);\n\t\t\t\t\tdp[nxt][j+1][k+1]+=dp[now][j][k]/(N-1);\n\t\t\t\t}\n\t\t\t\telse if(k+1==N)\n\t\t\t\t{\n\t\t\t\t\tdp[nxt][j+1][k]+=dp[now][j][k]*(N-2)/(N-1);\n\t\t\t\t\tdp[nxt][j+1][k-1]+=dp[now][j][k]/(N-1);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tdp[nxt][j+1][k]+=dp[now][j][k]*(N-3)/(N-1);\n\t\t\t\t\tdp[nxt][j+1][k-1]+=dp[now][j][k]/(N-1);\n\t\t\t\t\tdp[nxt][j+1][k+1]+=dp[now][j][k]/(N-1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tnow=nxt;\n\t}\n\tdouble ans=0;\n\tfor(int i=0;i<N;i++)if(ans<dp[now][K][i])ans=dp[now][K][i];\n\tfor(int i=1;i<=K;i++)ans=ans*i/(H-M-i+1);\n\tcout<<fixed<<setprecision(16)<<ans<<endl;\n}","accuracy":1,"time_ms":40,"memory_kb":4084,"score_of_the_acc":-0.0327,"final_rank":9},{"submission_id":"aoj_2294_4973196","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#include \"complex\"\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-12;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\n\n\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tcin >> H >> N >> T >> M >> K;\n\tT--;\n\tvector<vector<vector<long double>>>dp(H + 1, vector<vector<long double>>(K+1,vector<long double>(N)));\n\tdp[H][K][T] = 1;\n\tvector<int>v(H, -1);\n\tvector<int>sum(H, 1);\n\twhile (M--) {\n\t\tcin >> L >> R;\n\t\tL--, R--;\n\t\tv[L] = R;\n\t\tsum[L]--;\n\t}\n\tfor (int i = 1; i < H; i++) {\n\t\tsum[i] += sum[i - 1];\n\t}\n\tif (N <= 2) {\n\t\tcout << 1 << endl;\n\t\treturn 0;\n\t}\n\n\tfor (int i = H - 1; i >= 0; i--) {\n\t\tif (v[i] == -1) {\n\t\t\tfor (int j = 0; j <= min(K, sum[i] + 0LL); j++) {\n\t\t\t\tlong double p = j;\n\t\t\t\tp /= sum[i];\n\t\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\t\tif (j) {\n\t\t\t\t\t\tif (k == 0) {\n\t\t\t\t\t\t\tdp[i][j - 1][k + 1] += dp[i + 1][j][k] * p / (N - 1);\n\t\t\t\t\t\t\tdp[i][j - 1][k] += dp[i + 1][j][k] * p *(N - 2) / (N - 1);\n\t\t\t\t\t\t\tdp[i][j][k] += dp[i + 1][j][k] * (1 - p);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if (k + 1 == N) {\n\t\t\t\t\t\t\tdp[i][j - 1][k - 1] += dp[i + 1][j][k] * p / (N - 1);\n\t\t\t\t\t\t\tdp[i][j - 1][k] += dp[i + 1][j][k] * p *(N - 2) / (N - 1);\n\t\t\t\t\t\t\tdp[i][j][k] += dp[i + 1][j][k] * (1 - p);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tdp[i][j - 1][k - 1] += dp[i + 1][j][k] * p / (N - 1);\n\t\t\t\t\t\t\tdp[i][j - 1][k + 1] += dp[i + 1][j][k] * p / (N - 1);\n\t\t\t\t\t\t\tdp[i][j - 1][k] += dp[i + 1][j][k] * p *(N - 3) / (N - 1);\n\t\t\t\t\t\t\tdp[i][j][k] += dp[i + 1][j][k] * (1 - p);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tdp[i][j][k] = dp[i + 1][j][k];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int j = 0; j <= K; j++) {\n\t\t\t\tdp[i][j] = dp[i + 1][j];\n\t\t\t\tswap(dp[i][j][v[i]], dp[i][j][v[i] + 1]);\n\t\t\t}\n\t\t}\n\t}\n\tcout <<setprecision(20)<< *max_element(dp.front().front().begin(), dp.front().front().end()) << endl;\n}","accuracy":1,"time_ms":60,"memory_kb":84516,"score_of_the_acc":-1.04,"final_rank":18},{"submission_id":"aoj_2294_4972751","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 H, N, P, M, K;\nmap<ll, ll> mp;\nlong double Prev[505][505];\nlong double Next[505][505];\nlong double combination[505][505];\nll emp = 0;\nint main() {\n for(int i = 0; i <= 500; i++) {\n combination[i][0] = 1;\n for(int j = 1; j <= i; j++) {\n combination[i][j] = combination[i-1][j] + combination[i-1][j-1];\n //cerr << combination[i][j] << endl;\n }\n }\n cin >> H >> N >> P >> M >> K;\n P--;\n for(int i = 0; i < M; i++) {\n ll a, b;\n cin >> a >> b;\n a--;\n b--;\n mp[a] = b;\n }\n Prev[0][P] = 1;\n for(int h = H - 1; h >= 0; h--) {\n //cerr << \"---\" << h << \"---\" << endl;\n for(int i = 0; i <= 500; i++) {\n for(int j = 0; j <= 500; j++) {\n Next[i][j] = 0;\n }\n }\n if(mp.count(h)) {\n for(int i = 0; i <= K; i++) {\n for(int j = 0; j < N; j++) {\n Next[i][j] = Prev[i][j];\n }\n ll idx = mp[h];\n swap(Next[i][idx], Next[i][idx+1]);\n }\n } else {\n emp++;\n for(int i = 0; i <= K; i++) {\n for(int j = 0; j < N; j++) {\n Next[i][j] += Prev[i][j];\n }\n }\n for(int i = 0; i <= K; i++) {\n for(ll j = 0; j < N; j++) {\n Next[i+1][j] += Prev[i][j] * (N - 3) / (N - 1);\n Next[i+1][max(j-1, 0LL)] += Prev[i][j] / (N - 1);\n Next[i+1][min(j+1, N-1)] += Prev[i][j] / (N - 1);\n }\n }\n }\n swap(Prev, Next);\n /*\n for(int k = 0; k <= K; k++) {\n cerr << \"-\" << k << \"-\" << endl;\n for(int i = 0; i < N; i++) cerr << Prev[k][i] << \" \";\n cerr << endl;\n }\n */\n }\n long double ans = 0;\n for(int i = 0; i < N; i++) {\n chmax(ans, Prev[K][i]);\n }\n ans /= combination[emp][K];\n cout << fixed << setprecision(30) << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":540,"memory_kb":15052,"score_of_the_acc":-0.5679,"final_rank":14},{"submission_id":"aoj_2294_4972276","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint PREP = (cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12), 0);\n//int SEGV = getenv(\"D\") || (exit(system(\"D= SEGFAULT_SIGNALS=all catchsegv ./prog.exe\") >> 8), 0);\ndouble dp[2][110][110][110]; // dp[i][j][k][l] = (curr=i, cnt=j, k -> l)\nint main() {\n int H, N, P, M, K; cin >> H >> N >> P >> M >> K; P--;\n vector<int> A(H + 1, -1);\n for (int i = 0; i < M; i++) {\n int a, b; cin >> a >> b; b--;\n A[a] = b; // connect b and b+1\n }\n for (int k = 0; k < N; k++) {\n dp[0][0][k][k] = 1.0;\n }\n for (int i = 1; i <= H; i++) {\n for (int j = 0; j <= K; j++) {\n for (int k = 0; k < N; k++) {\n for (int l = 0; l < N; l++) {\n dp[i%2][j][k][l] = 0;\n }\n }\n }\n if (A[i] >= 0) {\n for (int j = 0; j <= K; j++) {\n for (int k = 0; k < N; k++) {\n for (int l = 0; l < N; l++) {\n int from = 0;\n if (A[i] == l) from = A[i] + 1;\n else if (A[i] + 1 == l) from = A[i];\n else from = l;\n dp[i%2][j][k][l] = dp[(i-1)%2][j][k][from];\n }\n }\n }\n } else {\n for (int j = 0; j <= K; j++) {\n double line = clamp((K - j) / (H - M - i + 1.0), 0.0, 1.0);\n double noline = 1.0 - line;\n for (int k = 0; k < N; k++) {\n for (int l = 0; l < N; l++) {\n double line_P = line / (N - 1);\n double line_L = l == 0 ? 0.0 : line_P;\n double line_R = l == N-1 ? 0.0 : line_P;\n double line_N = line - line_L - line_R;\n if (j == K) {\n dp[i%2][j][k][l] += dp[(i-1)%2][j][k][l];\n } else {\n dp[i%2][j][k][l] += noline * dp[(i-1)%2][j][k][l];\n if (l+1<N) dp[i%2][j+1][k][l+1] += line_R * dp[(i-1)%2][j][k][l];\n if (l-1>=0) dp[i%2][j+1][k][l-1] += line_L * dp[(i-1)%2][j][k][l];\n dp[i%2][j+1][k][l] += line_N * dp[(i-1)%2][j][k][l];\n }\n }\n }\n }\n }\n if (A[i] != -1) M--;\n }\n double ans = 0.0;\n for (int k = 0; k < N; k++) {\n ans = max(ans, dp[H%2][K][k][P]);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":1260,"memory_kb":23968,"score_of_the_acc":-1.2537,"final_rank":20},{"submission_id":"aoj_2294_4972007","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <list>\n#include <string>\n#include <iomanip>\n#include <queue>\n\nusing namespace std;\n\nconstexpr int inf = 1e9 + 7;\n\nint main(){\n\n int h, n, p, m, k;\n cin >> h >> n >> p >> m >> k;\n --p;\n\n // amida[i][j] := 左からi番目の棒とi+1番目の棒の間に高さjの位置に横棒があるか\n vector<vector<bool>> amida (n - 1, vector<bool>(h, false));\n\n for(int i = 0; i < m; ++i){\n int a, b;\n cin >> a >> b;\n --a, --b;\n amida[b][a] = true;\n }\n\n // k本の横棒をランダムに引く\n\n // 下からやる\n // dp[i][j][k] := 高さiにいるときに横からj番目の棒へ追加の棒をk回使用したときの確率\n vector<vector<vector<double>>> prob(h + 1, vector<vector<double>>(n, vector<double>(k + 1, 0.0)));\n prob[h][p][0] = 1.0;\n\n vector<bool> used_y(h, false);\n\n // 置くことができる総数\n int can_set_num = 0;\n for(int y = 0; y < h; ++y){\n bool used = false;\n for(int i = 0; i < n - 1; ++i){\n used = used || amida[i][y];\n }\n used_y[y] = used;\n if(used) continue;\n can_set_num++;\n }\n double not_used = can_set_num;\n\n for(int y = h; y > 0; --y){\n for(int t = 0; t <= k; ++t){\n for(int i = 0; i < n; ++i){\n\n // そもそも横軸があった\n if(used_y[y - 1]){\n // 確定で移動\n if (i < n-1 && amida[i][y-1]) {\n prob[y-1][i+1][t] += prob[y][i][t];\n }\n else if (i > 0 && amida[i-1][y-1]) {\n prob[y-1][i-1][t] += prob[y][i][t];\n }\n else {\n prob[y-1][i][t] += prob[y][i][t];\n }\n }\n else{\n double use = (k-t)/not_used;\n double nuse = 1-use;\n double nm1 = 1.0;\n nm1 /= n-1;\n //int can_set = can_set_num - t * (n - 1);\n // 横軸を入れる場合\n if (t < k) {\n if (i == 0) {\n prob[y-1][i+1][t+1] += prob[y][i][t]*use*nm1;\n prob[y-1][i][t+1] += prob[y][i][t]*use*(1.0-nm1);\n }\n else if (i == n-1) {\n prob[y-1][i-1][t+1] += prob[y][i][t]*use*nm1;\n prob[y-1][i][t+1] += prob[y][i][t]*use*(1.0-nm1);\n }\n else {\n prob[y-1][i-1][t+1] += prob[y][i][t]*use*nm1;\n prob[y-1][i+1][t+1] += prob[y][i][t]*use*nm1;\n prob[y-1][i][t+1] += prob[y][i][t]*use*(1.0-2.0*nm1);\n }\n // 入れない場合\n prob[y-1][i][t] += prob[y][i][t]*nuse;\n }\n else {\n // 入れない場合\n prob[y-1][i][t] += prob[y][i][t];\n }\n }\n \n }\n }\n if(!used_y[y - 1]) {\n not_used -= 1.0;\n }\n }\n\n //double ans = *max_element(prob[0].begin(), prob[0].end());\n\n double ans = 0.0;\n for(int i = 0; i < n; ++i) ans = max(ans, prob[0][i][k]);\n\n cout << fixed << setprecision(15) << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":44340,"score_of_the_acc":-0.5288,"final_rank":12},{"submission_id":"aoj_2294_4938305","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=200005;\n//const int INF=1<<30;\nconst ll INF=1LL<<60;\n\ndouble dp[505][105][105];//高さi,j回使った、kにいる\nint hen[505];\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int H,N,P,M,K;cin>>H>>N>>P>>M>>K;\n \n memset(hen,-1,sizeof(hen));\n for(int i=0;i<M;i++){\n int a,b;cin>>a>>b;\n a--;b--;\n hen[H-a]=b;\n }\n \n P--;\n \n dp[0][0][P]=1;\n \n int rem=H-M;\n \n for(int i=0;i<H;i++){\n for(int j=0;j<=K;j++){\n for(int k=0;k<N;k++){\n //if(dp[i][j][k]==0) continue;\n \n if(hen[i+1]==-1){\n double p=double(K-j)/rem;\n \n dp[i+1][j][k]+=dp[i][j][k]*(1.0-p);\n \n for(int l=0;l<N-1;l++){\n if(k==l){\n dp[i+1][j+1][k]+=dp[i][j][k+1]*p/(N-1);\n }else if(k==l+1){\n dp[i+1][j+1][k]+=dp[i][j][k-1]*p/(N-1);\n }else{\n dp[i+1][j+1][k]+=dp[i][j][k]*p/(N-1);\n }\n }\n }else{\n if(k==hen[i+1]){\n dp[i+1][j][k]+=dp[i][j][k+1];\n }else if(k==hen[i+1]+1){\n dp[i+1][j][k]+=dp[i][j][k-1];\n }else{\n dp[i+1][j][k]+=dp[i][j][k];\n }\n }\n }\n }\n if(hen[i+1]==-1) rem--;\n }\n \n double ans=0;\n \n for(int i=0;i<N;i++){\n chmax(ans,dp[H][K][i]);\n }\n \n cout<<setprecision(25)<<ans<<endl;\n}","accuracy":1,"time_ms":840,"memory_kb":46656,"score_of_the_acc":-1.1974,"final_rank":19},{"submission_id":"aoj_2294_4925690","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define foreach(i,n) for(auto &i:(n))\n#define lambda(RES,...) (function<RES(__VA_ARGS__)>) [&](__VA_ARGS__) -> RES\n#define method(NAME,RES,...) function<RES(__VA_ARGS__)>NAME = [&](__VA_ARGS__) -> RES\n#define all(x) (x).begin(),(x).end()\n#define bit(x) (1ll<<(x))\n\ntemplate<class t>\nusing priority_queuer = priority_queue<t,vector<t>,greater<t>>;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\nusing pii = pair<int,int>;\nusing ll = long long;\ntemplate<class t,class u>\nbool chmin(t&a,u b){\n if(a>b){\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class t,class u>\nbool chmax(t&a,u b){\n if(a<b){\n a = b;\n return true;\n }\n return false;\n}\n\nll in(){\n ll res;\n cin >> res;\n return res;\n}\n\n\ntemplate<class t>\nt in(){\n t res;\n cin >> res;\n return res;\n}\n\n\nconst ll INF = 1e9;\n\ndouble func(){\n int h = in();\n int n = in();\n int p = in()-1;\n int m = in();\n int k = in();\n vector<int> left(h,-1);\n rep(i,m){\n int a = in();\n int b = in();\n left[a-1] = b-1;\n }\n method(toint,int,int y,int x,int rem){\n return rem + (k+1) * (x + n * y);\n };\n\n vector<double> dp(toint(h+1,n,k),-1);\n method(func,double,int y,int x,int rem,int space){\n if(rem>space)return 0;\n if(y==h){\n return x == p and !rem;\n }\n double &it = dp[toint(y,x,rem)];\n if(it>=0)return it;\n it = 0;\n if(left[y]>=0){\n if(left[y]==x){\n ++x;\n }else if(left[y]+1==x){\n --x;\n }\n it += func(y+1,x,rem,space);\n }else{ \n if(rem){\n int cnt = 0;\n if(x){\n it += func(y+1,x-1,rem-1,space-1) * ((double)rem/space) * ((double)1/(n-1));\n ++cnt;\n }\n if(x+1<n){\n it += func(y+1,x+1,rem-1,space-1) * ((double)rem/space) * ((double)1/(n-1));\n ++cnt;\n }\n it += func(y+1,x,rem-1,space-1) * ((double)rem/space) * ((double)(n-cnt-1)/(n-1));\n }\n it += func(y+1,x,rem,space-1) * (1-((double)rem/space)) ;\n }\n return it;\n };\n double res = 0;\n rep(i,n){\n chmax(res,func(0,i,k,h-m));\n }\n return res;\n}\n\nint main(){\n printf(\"%.20lf\\n\",func());\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":42640,"score_of_the_acc":-0.5799,"final_rank":15},{"submission_id":"aoj_2294_4925155","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\n#include<algorithm>\n#include<iomanip>\n#include<cassert>\n\nusing namespace std;\n\nvoid solve(){\n vector<vector<bool>> bo;\n vector<int> bo2;\n int H, N, P, M, K;\n\n double ans = 0;\n\n cin>>H>>N>>P>>M>>K;\n\n bo.resize(H+2, vector<bool>(N+2));\n bo2.resize(H+2);\n\n for(int i = 0; i < M; i++){\n int A, B;\n\n cin>>A>>B;\n\n bo[H - A + 1][B] = true;\n bo2[H - A + 1] = B;\n }\n\n \n int m = 0;\n vector<vector<double>> dp(K+2, vector<double>(N+2));\n dp[0][P] = 1;\n \n for(int j = 1; j <= H; j++){\n vector<vector<double>> nex(K+2, vector<double>(N+2));\n for(int l = min(K, m); l >= 0; l--) {\n if(bo2[j]) {\n for(int k = 1; k <= N; k++){\n if(bo[j][k]) {\n nex[l][k+1] += dp[l][k];\n } else if(bo[j][k-1]) {\n nex[l][k-1] += dp[l][k];\n } else {\n nex[l][k] += dp[l][k];\n }\n }\n } else {\n double A = (K - l);\n double B = (H - M - m);\n double C = H - M - m - (K - l);\n\n double pro = A / (B * (N - 1));\n double pro11 = C / B;\n double pro12 = pro * (N - 2);\n double pro22 = pro * (N - 3);\n \n for(int k = 1; k <= N; k++){\n nex[l+1][k+1] += dp[l][k] * pro;\n nex[l][k] += dp[l][k] * pro11;\n nex[l+1][k-1] += dp[l][k] * pro;\n \n if(k == 1 || k == N)nex[l+1][k] += dp[l][k] * pro12;\n else nex[l+1][k] += dp[l][k] * pro22;\n }\n \n }\n }\n swap(dp, nex);\n if(bo2[j] == false) m++;\n }\n \n for(int i = 1; i <= N; i++) ans = max(ans, dp[K][i]);\n\n cout<<ans<<endl;\n}\n\nsigned main(){\n cout<<fixed<<setprecision(10);\n\n solve();\n\n}","accuracy":1,"time_ms":10,"memory_kb":3440,"score_of_the_acc":-0.0007,"final_rank":1},{"submission_id":"aoj_2294_4925145","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\n#include<algorithm>\n#include<iomanip>\n#include<cassert>\n\nusing namespace std;\n\nvoid solve(){\n vector<vector<bool>> bo;\n vector<int> bo2;\n int H, N, P, M, K;\n\n double ans = 0;\n\n cin>>H>>N>>P>>M>>K;\n\n bo.resize(H+2, vector<bool>(N+2));\n bo2.resize(H+2);\n\n for(int i = 0; i < M; i++){\n int A, B;\n\n cin>>A>>B;\n\n bo[H - A + 1][B] = true;\n bo2[H - A + 1] = B;\n }\n\n \n int m = 0;\n vector<vector<double>> dp(K+2, vector<double>(N+2));\n dp[0][P] = 1;\n \n for(int j = 1; j <= H; j++){\n vector<vector<double>> nex(K+2, vector<double>(N+2));\n for(int l = min(K, m); l >= 0; l--) {\n if(bo2[j]) {\n for(int k = 1; k <= N; k++){\n if(bo[j][k]) {\n nex[l][k+1] += dp[l][k];\n } else if(bo[j][k-1]) {\n nex[l][k-1] += dp[l][k];\n } else {\n nex[l][k] += dp[l][k];\n }\n }\n } else {\n double A = (K - l);\n double B = (H - M - m);\n double C = H - M - m - (K - l);\n\n double pro = A / (B * (N - 1));\n double pro11 = C / B;\n double pro12 = pro * (N - 2);\n double pro22 = pro * (N - 3);\n \n for(int k = 1; k <= N; k++){\n nex[l+1][k+1] += dp[l][k] * pro;\n nex[l][k] += dp[l][k] * pro11;\n nex[l+1][k-1] += dp[l][k] * pro;\n \n if(k == 1 || k == N)nex[l+1][k] += dp[l][k] * pro12;\n else nex[l+1][k] += dp[l][k] * pro22;\n }\n \n }\n }\n dp = nex;\n if(bo2[j] == false) m++;\n }\n \n for(int i = 1; i <= N; i++) ans = max(ans, dp[K][i]);\n\n cout<<ans<<endl;\n}\n\nsigned main(){\n cout<<fixed<<setprecision(10);\n\n solve();\n\n}","accuracy":1,"time_ms":10,"memory_kb":3444,"score_of_the_acc":-0.0008,"final_rank":2},{"submission_id":"aoj_2294_4925137","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\n#include<algorithm>\n#include<iomanip>\n#include<cassert>\n\nusing namespace std;\n\nvoid solve(){\n vector<vector<bool>> bo;\n vector<int> bo2;\n int H, N, P, M, K;\n\n double ans = 0;\n\n cin>>H>>N>>P>>M>>K;\n\n bo.resize(H+2, vector<bool>(N+2));\n bo2.resize(H+2);\n\n for(int i = 0; i < M; i++){\n int A, B;\n\n cin>>A>>B;\n\n bo[A][B] = true;\n bo2[A] = B;\n }\n\n \n for(int i = 1; i <= N; i++){\n int m = 0;\n vector<vector<double>> dp(K+2, vector<double>(N+2));\n dp[0][i] = 1;\n \n for(int j = 1; j <= H; j++){\n vector<vector<double>> nex(K+2, vector<double>(N+2));\n for(int l = min(K, m); l >= 0; l--) {\n if(bo2[j]) {\n for(int k = 1; k <= N; k++){\n if(bo[j][k]) {\n nex[l][k+1] += dp[l][k];\n } else if(bo[j][k-1]) {\n nex[l][k-1] += dp[l][k];\n } else {\n nex[l][k] += dp[l][k];\n }\n }\n } else {\n double A = (K - l);\n double B = (H - M - m);\n double C = H - M - m - (K - l);\n\n double pro = A / (B * (N - 1));\n double pro11 = C / B;\n double pro12 = pro * (N - 2);\n double pro22 = pro * (N - 3);\n \n for(int k = 1; k <= N; k++){\n nex[l+1][k+1] += dp[l][k] * pro;\n nex[l][k] += dp[l][k] * pro11;\n nex[l+1][k-1] += dp[l][k] * pro;\n \n if(k == 1 || k == N)nex[l+1][k] += dp[l][k] * pro12;\n else nex[l+1][k] += dp[l][k] * pro22;\n }\n \n }\n }\n dp = nex;\n if(bo2[j] == false) m++;\n }\n ans = max(ans, dp[K][P]);\n }\n\n cout<<ans<<endl;\n}\n\nsigned main(){\n cout<<fixed<<setprecision(10);\n\n solve();\n\n}","accuracy":1,"time_ms":1180,"memory_kb":3448,"score_of_the_acc":-0.9368,"final_rank":17},{"submission_id":"aoj_2294_4924570","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define foreach(i,n) for(auto &i:(n))\n#define lambda(RES,...) (function<RES(__VA_ARGS__)>) [&](__VA_ARGS__) -> RES\n#define method(NAME,RES,...) function<RES(__VA_ARGS__)>NAME = [&](__VA_ARGS__) -> RES\n#define all(x) (x).begin(),(x).end()\n#define bit(x) (1ll<<(x))\n\ntemplate<class t>\nusing priority_queuer = priority_queue<t,vector<t>,greater<t>>;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\nusing pii = pair<int,int>;\nusing ll = long long;\ntemplate<class t,class u>\nbool chmin(t&a,u b){\n if(a>b){\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class t,class u>\nbool chmax(t&a,u b){\n if(a<b){\n a = b;\n return true;\n }\n return false;\n}\n\nll in(){\n ll res;\n cin >> res;\n return res;\n}\n\n\ntemplate<class t>\nt in(){\n t res;\n cin >> res;\n return res;\n}\n\n\nconst ll INF = 1e9;\n\ndouble func(){\n int h = in();\n int n = in();\n int p = in()-1;\n int m = in();\n int k = in();\n vector<int> left(h,-1);\n rep(i,m){\n int a = in();\n int b = in();\n left[a-1] = b-1;\n }\n method(toint,int,int y,int x,int rem){\n return rem + (k+1) * (x + n * y);\n };\n\n vector<double> dp(toint(h+1,n,k),-1);\n method(func,double,int y,int x,int rem,int space){\n if(rem>space)return 0;\n if(y==h){\n return x == p and !rem;\n }\n double &it = dp[toint(y,x,rem)];\n if(it>=0)return it;\n it = 0;\n if(left[y]>=0){\n if(left[y]==x){\n ++x;\n }else if(left[y]+1==x){\n --x;\n }\n it += func(y+1,x,rem,space);\n }else{ \n if(rem){\n int cnt = 0;\n if(x){\n it += func(y+1,x-1,rem-1,space-1) * ((double)rem/space) * ((double)1/(n-1));\n ++cnt;\n }\n if(x+1<n){\n it += func(y+1,x+1,rem-1,space-1) * ((double)rem/space) * ((double)1/(n-1));\n ++cnt;\n }\n it += func(y+1,x,rem-1,space-1) * ((double)rem/space) * ((double)(n-cnt-1)/(n-1));\n }\n it += func(y+1,x,rem,space-1) * (1-((double)rem/space)) ;\n }\n return it;\n };\n double res = 0;\n rep(i,n){\n chmax(res,func(0,i,k,h-m));\n }\n return res;\n}\n\nint main(){\n printf(\"%.20lf\\n\",func());\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":42640,"score_of_the_acc":-0.5799,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_2294_10189840\",\n \"code_snippet\": \"// AOJ #2294\\n// Entangled with Lottery 2025.2.4\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nconst double EPS = 1e-14;\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n int H, N, P, M, K;\\n cin >> H >> N >> P >> M >> K;\\n\\n vector<int> used(H+1, -1);\\n for(int i=0; i<M; i++){\\n int A, B;\\n cin >> A >> B;\\n used[A] = B;\\n }\\n\\n vector<int> freeCount(H+2, 0);\\n for(int r = H; r >= 1; r--){\\n freeCount[r] = freeCount[r+1] + (used[r] == -1 ? 1 : 0);\\n }\\n\\n vector<vector<double>> dpBelow(N+1, vector<double>(K+1, 0.0)),\\n dpCurrent(N+1, vector<double>(K+1, 0.0));\\n\\n for(int i=1; i<=N; i++){\\n for(int k2=0; k2<=K; k2++){\\n dpBelow[i][k2] = ( (i == P) ? 1.0 : 0.0 );\\n }\\n }\\n\\n for(int r=H; r>=1; r--){\\n // 1. 既存横棒ありの場合\\n if(used[r] != -1){\\n int b = used[r]; \\n for(int i=1; i<=N; i++){\\n for(int k2=0; k2<=K; k2++){\\n int nxt = i;\\n if(i == b) nxt = b+1;\\n else if(i == b+1) nxt = b;\\n dpCurrent[i][k2] = dpBelow[nxt][k2];\\n }\\n }\\n }\\n else {\\n for(int i=1; i<=N; i++){\\n for(int k2=0; k2<=K; k2++){\\n dpCurrent[i][k2] = 0.0;\\n }\\n }\\n if(freeCount[r] == 0){\\n for(int i=1; i<=N; i++){\\n dpCurrent[i][0] = dpBelow[i][0];\\n }\\n }\\n else {\\n for(int i=1; i<=N; i++){\\n for(int k2=0; k2<=K; k2++){\\n double p_not = 1.0;\\n double val_not = dpBelow[i][k2];\\n\\n double val_choose = 0.0;\\n if(k2 > 0 && freeCount[r] >= k2){\\n double p_choose = (double)k2 / (double)freeCount[r];\\n p_not = 1.0 - p_choose;\\n\\n double sumSwap = 0.0;\\n auto &A = dpBelow;\\n\\n if(i == 1){\\n double a1 = A[1][k2-1];\\n double a2 = A[2][k2-1];\\n sumSwap = a2 + (N-2) * a1;\\n }\\n else if(i == N){\\n double aN = A[N][k2-1];\\n double aN_1 = A[N-1][k2-1];\\n sumSwap = aN_1 + (N-2) * aN;\\n }\\n else {\\n double ai = A[i][k2-1];\\n double ai_1 = A[i-1][k2-1];\\n double ai_p1 = A[i+1][k2-1];\\n sumSwap = ai_1 + ai_p1 + (N-3)*ai;\\n }\\n val_choose = p_choose * (1.0/(N-1)) * sumSwap;\\n }\\n dpCurrent[i][k2] = p_not * val_not + val_choose;\\n }\\n }\\n }\\n }\\n dpBelow.swap(dpCurrent);\\n }\\n double ans = 0.0;\\n for(int i=1; i<=N; i++){\\n ans = max(ans, dpBelow[i][K]);\\n }\\n cout << fixed << setprecision(9) << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3680,\n \"score_of_the_acc\": -0.0037,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2294_9776894\",\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\\nint main() {\\n int H, N, P, M, K;\\n cin >> H >> N >> P >> M >> K;\\n P--;\\n vector<int> X(H,-1);\\n rep(i,0,M) {\\n int A, B;\\n cin >> A >> B;\\n A--, B--;\\n X[A] = B;\\n }\\n auto next = [&](int i, int j) -> int {\\n if (i == j) return i+1;\\n if (i == j+1) return i-1;\\n return i;\\n };\\n vector DP(2, vector(N, vector<double>(H-M+1,0.0)));\\n DP[H&1][P][0] = 1.0;\\n rrep(i,0,H) {\\n rep(j,0,N) {\\n rep(k,0,H-M+1) {\\n DP[i&1][j][k] = 0.0;\\n }\\n }\\n if (X[i] != -1) {\\n rep(j,0,N) {\\n rep(k,0,H-M+1) {\\n DP[i&1][next(j,X[i])][k] += DP[(i+1)&1][j][k];\\n }\\n }\\n }\\n else {\\n rep(j,0,N) {\\n rep(k,0,H-M+1) {\\n if (DP[(i+1)&1][j][k] == 0.0) continue;\\n DP[i&1][j][k] += DP[(i+1)&1][j][k];\\n double Kiyo = (DP[(i+1)&1][j][k] * (double)(k+1) / (double)(H-M-k)) / (double(N-1));\\n if (j == 0) {\\n DP[i&1][j][k+1] += Kiyo * (double)(N-2);\\n DP[i&1][j+1][k+1] += Kiyo;\\n }\\n else if (j == N-1) {\\n DP[i&1][j][k+1] += Kiyo * (double)(N-2);\\n DP[i&1][j-1][k+1] += Kiyo;\\n }\\n else {\\n DP[i&1][j][k+1] += Kiyo * (double)(N-3);\\n DP[i&1][j-1][k+1] += Kiyo;\\n DP[i&1][j+1][k+1] += Kiyo;\\n }\\n }\\n }\\n }\\n }\\n double ANS = 0, SUM = 0.0;\\n rep(i,0,N) {\\n chmax(ANS, DP[0][i][K]);\\n SUM += DP[0][i][K];\\n }\\n printf(\\\"%.12f\\\\n\\\", ANS / SUM);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4476,\n \"score_of_the_acc\": -0.0375,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2294_8332325\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ndouble solve(int H, int N, int P, int M, int K, const vector<int>& A, const vector<int>& B) {\\n\\tvector<int> place(H, -1);\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tplace[A[i]] = B[i];\\n\\t}\\n\\tconst double inv = 1.0 / (N - 1);\\n\\tvector<vector<double> > dp(N, vector<double>(K + 1, 0.0)); // dp[position][# of drawn lines]\\n\\tdp[P][0] = 1.0;\\n\\tfor (int i = H - 1; i >= 0; i--) {\\n\\t\\tvector<vector<double> > ndp(N, vector<double>(K + 1, 0.0));\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tfor (int k = 0; k <= K; k++) {\\n\\t\\t\\t\\tif (place[i] != -1) {\\n\\t\\t\\t\\t\\tint last = (j == place[i] ? place[i] + 1 : j == place[i] + 1 ? place[i] : j);\\n\\t\\t\\t\\t\\tndp[j][k] += dp[last][k];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t// case that doesn't draw\\n\\t\\t\\t\\t\\tndp[j][k] += dp[j][k];\\n\\t\\t\\t\\t\\t// case that draws\\n\\t\\t\\t\\t\\tif (k >= 1) {\\n\\t\\t\\t\\t\\t\\tdouble prob = ((N - 1) - (j == 0 || j == N - 1 ? 1 : 2)) * inv;\\n\\t\\t\\t\\t\\t\\tndp[j][k] += dp[j][k - 1] * prob;\\n\\t\\t\\t\\t\\t\\tif (j != 0) {\\n\\t\\t\\t\\t\\t\\t\\tndp[j][k] += dp[j - 1][k - 1] * inv;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (j != N - 1) {\\n\\t\\t\\t\\t\\t\\t\\tndp[j][k] += dp[j + 1][k - 1] * inv;\\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\\tdp = ndp;\\n\\t}\\n\\tdouble ans = 0.0, sum = 0.0;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tsum += dp[i][K];\\n\\t\\tans = max(ans, dp[i][K]);\\n\\t}\\n\\treturn ans / sum;\\n}\\n\\nint main() {\\n\\tint H, N, P, M, K;\\n\\tcin >> H >> N >> P >> M >> K;\\n\\tP -= 1;\\n\\tvector<int> A(M), B(M);\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tcin >> A[i] >> B[i];\\n\\t\\tA[i] -= 1;\\n\\t\\tB[i] -= 1;\\n\\t}\\n\\tdouble ans = solve(H, N, P, M, K, A, B);\\n\\tcout.precision(15);\\n\\tcout << fixed << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3744,\n \"score_of_the_acc\": -0.0045,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2294_7166647\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n int H, N, P, M, K;\\n cin >> H >> N >> P >> M >> K;\\n vector<int> line(H, -1);\\n for (int i = 0; i < M; i++) {\\n int A, B;\\n cin >> A >> B;\\n line[--A] = --B;\\n }\\n vector<vector<double>> dp(N, vector<double>(K + 1, 0)), ndp(N, vector<double>(K + 1, 0));\\n dp[--P][0] = 1;\\n for (int k = H - 1; k >= 0; k--) {\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j <= K; j++) {\\n double& val = dp[i][j];\\n if (val == 0) continue;\\n if (line[k] != -1) {\\n if (i == line[k])\\n ndp[i + 1][j] += val;\\n else if (i == line[k] + 1)\\n ndp[i - 1][j] += val;\\n else\\n ndp[i][j] += val;\\n } else {\\n double p = 1.0 * (K - j) / (k + 1 - M);\\n ndp[i][j] += val * (1 - p);\\n if (j < K) {\\n double add = val * p / (N - 1);\\n ndp[i][j + 1] += add * (N - 3);\\n if (i + 1 < N)\\n ndp[i + 1][j + 1] += add;\\n else\\n ndp[i][j + 1] += add;\\n if (i - 1 >= 0)\\n ndp[i - 1][j + 1] += add;\\n else\\n ndp[i][j + 1] += add;\\n }\\n }\\n val = 0;\\n }\\n }\\n if (line[k] != -1) M--;\\n swap(dp, ndp);\\n }\\n\\n double ans = 0;\\n for (int i = 0; i < N; i++) ans = max(ans, dp[i][K]);\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3676,\n \"score_of_the_acc\": -0.0036,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2294_6698102\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#ifdef _MSC_VER\\n# include <intrin.h>\\n#else\\n# include <x86intrin.h>\\n#endif\\n\\n#include <limits>\\n#include <type_traits>\\n\\nnamespace suisen {\\n// ! utility\\ntemplate <typename ...Types>\\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\\ntemplate <bool cond_v, typename Then, typename OrElse>\\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\\n if constexpr (cond_v) {\\n return std::forward<Then>(then);\\n } else {\\n return std::forward<OrElse>(or_else);\\n }\\n}\\n\\n// ! function\\ntemplate <typename ReturnType, typename Callable, typename ...Args>\\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\\ntemplate <typename F, typename T>\\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\\ntemplate <typename F, typename T>\\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\\n\\ntemplate <typename Comparator, typename T>\\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\\n\\n// ! integral\\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\\ntemplate <typename T, unsigned int n>\\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\\ntemplate <typename T, unsigned int n>\\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\\n\\n// ?\\ntemplate <typename T>\\nstruct safely_multipliable {};\\ntemplate <>\\nstruct safely_multipliable<int> { using type = long long; };\\ntemplate <>\\nstruct safely_multipliable<long long> { using type = __int128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned int> { using type = unsigned long long; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long int> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<unsigned long long> { using type = __uint128_t; };\\ntemplate <>\\nstruct safely_multipliable<float> { using type = float; };\\ntemplate <>\\nstruct safely_multipliable<double> { using type = double; };\\ntemplate <>\\nstruct safely_multipliable<long double> { using type = long double; };\\ntemplate <typename T>\\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\\n\\ntemplate <typename T, typename = void>\\nstruct rec_value_type {\\n using type = T;\\n};\\ntemplate <typename T>\\nstruct rec_value_type<T, std::void_t<typename T::value_type>> {\\n using type = typename rec_value_type<typename T::value_type>::type;\\n};\\ntemplate <typename T>\\nusing rec_value_type_t = typename rec_value_type<T>::type;\\n\\n} // namespace suisen\\n\\n// ! type aliases\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\n\\ntemplate <typename T>\\nusing pq_greater = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\ntemplate <typename T, typename U>\\nusing umap = std::unordered_map<T, U>;\\n\\n// ! macros (capital: internal macro)\\n#define OVERLOAD2(_1,_2,name,...) name\\n#define OVERLOAD3(_1,_2,_3,name,...) name\\n#define OVERLOAD4(_1,_2,_3,_4,name,...) name\\n\\n#define REP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l);i<(r);i+=(s))\\n#define REP3(i,l,r) REP4(i,l,r,1)\\n#define REP2(i,n) REP3(i,0,n)\\n#define REPINF3(i,l,s) for(std::remove_reference_t<std::remove_const_t<decltype(l)>>i=(l);;i+=(s))\\n#define REPINF2(i,l) REPINF3(i,l,1)\\n#define REPINF1(i) REPINF2(i,0)\\n#define RREP4(i,l,r,s) for(std::remove_reference_t<std::remove_const_t<decltype(r)>>i=(l)+fld((r)-(l)-1,s)*(s);i>=(l);i-=(s))\\n#define RREP3(i,l,r) RREP4(i,l,r,1)\\n#define RREP2(i,n) RREP3(i,0,n)\\n\\n#define rep(...) OVERLOAD4(__VA_ARGS__, REP4 , REP3 , REP2 )(__VA_ARGS__)\\n#define rrep(...) OVERLOAD4(__VA_ARGS__, RREP4 , RREP3 , RREP2 )(__VA_ARGS__)\\n#define repinf(...) OVERLOAD3(__VA_ARGS__, REPINF3, REPINF2, REPINF1)(__VA_ARGS__)\\n\\n#define CAT_I(a, b) a##b\\n#define CAT(a, b) CAT_I(a, b)\\n#define UNIQVAR(tag) CAT(tag, __LINE__)\\n#define loop(n) for (std::remove_reference_t<std::remove_const_t<decltype(n)>> UNIQVAR(loop_variable) = n; UNIQVAR(loop_variable) --> 0;)\\n\\n#define all(iterable) std::begin(iterable), std::end(iterable)\\n#define input(type, ...) type __VA_ARGS__; read(__VA_ARGS__)\\n\\n#ifdef LOCAL\\n# define debug(...) debug_internal(#__VA_ARGS__, __VA_ARGS__)\\n\\ntemplate <class T, class... Args>\\nvoid debug_internal(const char* s, T&& first, Args&&... args) {\\n constexpr const char* prefix = \\\"[\\\\033[32mDEBUG\\\\033[m] \\\";\\n constexpr const char* open_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\"(\\\";\\n constexpr const char* close_brakets = sizeof...(args) == 0 ? \\\"\\\" : \\\")\\\";\\n std::cerr << prefix << open_brakets << s << close_brakets << \\\": \\\" << open_brakets << std::forward<T>(first);\\n ((std::cerr << \\\", \\\" << std::forward<Args>(args)), ...);\\n std::cerr << close_brakets << \\\"\\\\n\\\";\\n}\\n\\n#else\\n# define debug(...) void(0)\\n#endif\\n\\n// ! I/O utilities\\n\\n// __int128_t\\nstd::ostream& operator<<(std::ostream& dest, __int128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n __uint128_t tmp = value < 0 ? -value : value;\\n char buffer[128];\\n char* d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n if (value < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n// __uint128_t\\nstd::ostream& operator<<(std::ostream& dest, __uint128_t value) {\\n std::ostream::sentry s(dest);\\n if (s) {\\n char buffer[128];\\n char* d = std::end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[value % 10];\\n value /= 10;\\n } while (value != 0);\\n int len = std::end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(std::ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n\\n// pair\\ntemplate <typename T, typename U>\\nstd::ostream& operator<<(std::ostream& out, const std::pair<T, U>& a) {\\n return out << a.first << ' ' << a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::ostream& operator<<(std::ostream& out, const std::tuple<Args...>& a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return out;\\n } else {\\n out << std::get<N>(a);\\n if constexpr (N + 1 < std::tuple_size_v<std::tuple<Args...>>) {\\n out << ' ';\\n }\\n return operator<<<N + 1>(out, a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& out, const std::vector<T>& a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::ostream& operator<<(std::ostream& out, const std::array<T, N>& a) {\\n for (auto it = a.begin(); it != a.end();) {\\n out << *it;\\n if (++it != a.end()) out << ' ';\\n }\\n return out;\\n}\\ninline void print() { std::cout << '\\\\n'; }\\ntemplate <typename Head, typename... Tail>\\ninline void print(const Head& head, const Tail &...tails) {\\n std::cout << head;\\n if (sizeof...(tails)) std::cout << ' ';\\n print(tails...);\\n}\\ntemplate <typename Iterable>\\nauto print_all(const Iterable& v, std::string sep = \\\" \\\", std::string end = \\\"\\\\n\\\") -> decltype(std::cout << *v.begin(), void()) {\\n for (auto it = v.begin(); it != v.end();) {\\n std::cout << *it;\\n if (++it != v.end()) std::cout << sep;\\n }\\n std::cout << end;\\n}\\n\\n__int128_t parse_i128(std::string& s) {\\n __int128_t ret = 0;\\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n if (s[0] == '-') ret = -ret;\\n return ret;\\n}\\n__uint128_t parse_u128(std::string& s) {\\n __uint128_t ret = 0;\\n for (int i = 0; i < int(s.size()); i++) if ('0' <= s[i] and s[i] <= '9') ret = 10 * ret + s[i] - '0';\\n return ret;\\n}\\n// __int128_t\\nstd::istream& operator>>(std::istream& in, __int128_t& v) {\\n std::string s;\\n in >> s;\\n v = parse_i128(s);\\n return in;\\n}\\n// __uint128_t\\nstd::istream& operator>>(std::istream& in, __uint128_t& v) {\\n std::string s;\\n in >> s;\\n v = parse_u128(s);\\n return in;\\n}\\n// pair\\ntemplate <typename T, typename U>\\nstd::istream& operator>>(std::istream& in, std::pair<T, U>& a) {\\n return in >> a.first >> a.second;\\n}\\n// tuple\\ntemplate <unsigned int N = 0, typename ...Args>\\nstd::istream& operator>>(std::istream& in, std::tuple<Args...>& a) {\\n if constexpr (N >= std::tuple_size_v<std::tuple<Args...>>) {\\n return in;\\n } else {\\n return operator>><N + 1>(in >> std::get<N>(a), a);\\n }\\n}\\n// vector\\ntemplate <typename T>\\nstd::istream& operator>>(std::istream& in, std::vector<T>& a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\n// array\\ntemplate <typename T, size_t N>\\nstd::istream& operator>>(std::istream& in, std::array<T, N>& a) {\\n for (auto it = a.begin(); it != a.end(); ++it) in >> *it;\\n return in;\\n}\\ntemplate <typename ...Args>\\nvoid read(Args &...args) {\\n (std::cin >> ... >> args);\\n}\\n\\n// ! integral utilities\\n\\n// Returns pow(-1, n)\\ntemplate <typename T>\\nconstexpr inline int pow_m1(T n) {\\n return -(n & 1) | 1;\\n}\\n// Returns pow(-1, n)\\ntemplate <>\\nconstexpr inline int pow_m1<bool>(bool n) {\\n return -int(n) | 1;\\n}\\n\\n// Returns floor(x / y)\\ntemplate <typename T>\\nconstexpr inline T fld(const T x, const T y) {\\n return (x ^ y) >= 0 ? x / y : (x - (y + pow_m1(y >= 0))) / y;\\n}\\ntemplate <typename T>\\nconstexpr inline T cld(const T x, const T y) {\\n return (x ^ y) <= 0 ? x / y : (x + (y + pow_m1(y >= 0))) / y;\\n}\\n\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u32(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\n__attribute__((target(\\\"popcnt\\\"))) constexpr inline int popcount(const T x) { return _mm_popcnt_u64(x); }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_lz(const T x) { return x ? __builtin_clzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 16>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 32>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctz(x) : suisen::bit_num<T>; }\\ntemplate <typename T, suisen::constraints_t<suisen::is_nbit<T, 64>> = nullptr>\\nconstexpr inline int count_tz(const T x) { return x ? __builtin_ctzll(x) : suisen::bit_num<T>; }\\ntemplate <typename T>\\nconstexpr inline int floor_log2(const T x) { return suisen::bit_num<T> -1 - count_lz(x); }\\ntemplate <typename T>\\nconstexpr inline int ceil_log2(const T x) { return floor_log2(x) + ((x & -x) != x); }\\ntemplate <typename T>\\nconstexpr inline int kth_bit(const T x, const unsigned int k) { return (x >> k) & 1; }\\ntemplate <typename T>\\nconstexpr inline int parity(const T x) { return popcount(x) & 1; }\\n\\n// ! container\\n\\ntemplate <typename T, typename Comparator, suisen::constraints_t<suisen::is_comparator<Comparator, T>> = nullptr>\\nauto priqueue_comp(const Comparator comparator) {\\n return std::priority_queue<T, std::vector<T>, Comparator>(comparator);\\n}\\n\\ntemplate <typename Iterable>\\nauto isize(const Iterable& iterable) -> decltype(int(iterable.size())) {\\n return iterable.size();\\n}\\n\\ntemplate <typename T, typename Gen, suisen::constraints_t<suisen::is_same_as_invoke_result<T, Gen, int>> = nullptr>\\nauto generate_vector(int n, Gen generator) {\\n std::vector<T> v(n);\\n for (int i = 0; i < n; ++i) v[i] = generator(i);\\n return v;\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T l, T r) {\\n return generate_vector(r - l, [l](int i) { return l + i; });\\n}\\ntemplate <typename T>\\nauto generate_range_vector(T n) {\\n return generate_range_vector(0, n);\\n}\\n\\ntemplate <typename T>\\nvoid sort_unique_erase(std::vector<T>& a) {\\n std::sort(a.begin(), a.end());\\n a.erase(std::unique(a.begin(), a.end()), a.end());\\n}\\n\\ntemplate <typename InputIterator, typename BiConsumer>\\nauto foreach_adjacent_values(InputIterator first, InputIterator last, BiConsumer f) -> decltype(f(*first++, *last), void()) {\\n if (first != last) for (auto itr = first, itl = itr++; itr != last; itl = itr++) f(*itl, *itr);\\n}\\ntemplate <typename Container, typename BiConsumer>\\nauto foreach_adjacent_values(Container c, BiConsumer f) -> decltype(c.begin(), c.end(), void()) {\\n foreach_adjacent_values(c.begin(), c.end(), f);\\n}\\n\\n// ! other utilities\\n\\n// x <- min(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmin(T& x, const T& y) {\\n if (y >= x) return false;\\n x = y;\\n return true;\\n}\\n// x <- max(x, y). returns true iff `x` has chenged.\\ntemplate <typename T>\\ninline bool chmax(T& x, const T& y) {\\n if (y <= x) return false;\\n x = y;\\n return true;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::string bin(T val, int bit_num = -1) {\\n std::string res;\\n if (bit_num >= 0) {\\n for (int bit = bit_num; bit-- > 0;) res += '0' + ((val >> bit) & 1);\\n } else {\\n for (; val; val >>= 1) res += '0' + (val & 1);\\n std::reverse(res.begin(), res.end());\\n }\\n return res;\\n}\\n\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_low_to_high(T val, T base = 10) {\\n std::vector<T> res;\\n for (; val; val /= base) res.push_back(val % base);\\n if (res.empty()) res.push_back(T{ 0 });\\n return res;\\n}\\ntemplate <typename T, std::enable_if_t<std::is_integral_v<T>, std::nullptr_t> = nullptr>\\nstd::vector<T> digits_high_to_low(T val, T base = 10) {\\n auto res = digits_low_to_high(val, base);\\n std::reverse(res.begin(), res.end());\\n return res;\\n}\\n\\ntemplate <typename T>\\nstd::string join(const std::vector<T>& v, const std::string& sep, const std::string& end) {\\n std::ostringstream ss;\\n for (auto it = v.begin(); it != v.end();) {\\n ss << *it;\\n if (++it != v.end()) ss << sep;\\n }\\n ss << end;\\n return ss.str();\\n}\\n\\nnamespace suisen {}\\nusing namespace suisen;\\nusing namespace std;\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(precision);\\n }\\n} io_setup_ {};\\n\\n// ! code from here\\n\\nint main() {\\n input(int, h, n, p, m, k);\\n --p;\\n\\n vector<int> bar(h, -1);\\n rep(i, m) {\\n input(int, a, b);\\n --a, --b;\\n bar[a] = b;\\n }\\n\\n vector dp(h + 1, vector(n, vector<double>(k + 2, 0)));\\n dp[h][p][0] = 1;\\n rrep(i, h) rep(pos, n) rep(use, k + 1) {\\n if (bar[i] < 0) {\\n dp[i][pos][use] += dp[i + 1][pos][use];\\n int lc = pos > 0, rc = pos < n - 1, mc = (n - 1) - lc - rc;\\n if (lc) {\\n dp[i][pos - 1][use + 1] += dp[i + 1][pos][use] * (use + 1) / (n - 1) / (h - m - use);\\n }\\n if (rc) {\\n dp[i][pos + 1][use + 1] += dp[i + 1][pos][use] * (use + 1) / (n - 1) / (h - m - use);\\n }\\n if (mc) {\\n dp[i][pos][use + 1] += mc * dp[i + 1][pos][use] * (use + 1) / (n - 1) / (h - m - use);\\n }\\n } else {\\n int npos;\\n if (bar[i] == pos) {\\n npos = pos + 1;\\n } else if (bar[i] == pos - 1) {\\n npos = pos - 1;\\n } else {\\n npos = pos;\\n }\\n dp[i][npos][use] += dp[i + 1][pos][use];\\n }\\n }\\n\\n vector<double> ans(n);\\n rep(i, n) {\\n ans[i] = dp[0][i][k];\\n }\\n debug(ans);\\n\\n double sum = accumulate(all(ans), 0);\\n double val = *max_element(all(ans));\\n debug(sum, val);\\n print(val);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 45452,\n \"score_of_the_acc\": -0.5345,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2294_5943187\",\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>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\n\\nint ami[502];\\ndouble dp[2][102][502];\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int h,n,p,m,K; cin >> h >> n >> p >> m >> K;\\n p--;\\n for(int i=0;i<m;i++){\\n int a,b; cin >> a >> b;\\n ami[a] = b;\\n }\\n int cr = 0;\\n dp[cr][0][p] = 1.0;\\n // 高さを選ぶ確率は最後にまとめて\\n for(int i=h;i>0;i--){\\n int nx = (1^cr);\\n for(int j=0;j<=K;j++){\\n for(int k=0;k<n;k++){\\n dp[nx][j][k] = 0;\\n }\\n }\\n for(int j=0;j<=K;j++){\\n for(int k=0;k<n;k++){\\n if(ami[i]){\\n if(ami[i] == k){\\n dp[nx][j][k-1] += dp[cr][j][k];\\n }\\n else if(ami[i] == k+1){\\n dp[nx][j][k+1] += dp[cr][j][k];\\n }\\n else{\\n dp[nx][j][k] += dp[cr][j][k];\\n }\\n }\\n else{\\n dp[nx][j][k] += dp[cr][j][k];\\n if(j == K)continue;\\n if(k == 0){\\n dp[nx][j+1][1] += dp[cr][j][k]/(double)(n-1);\\n dp[nx][j+1][0] += dp[cr][j][k]*(n-2)/(double)(n-1);\\n }\\n else if(k+1 == n){\\n dp[nx][j+1][n-2] += dp[cr][j][k]/(double)(n-1);\\n dp[nx][j+1][n-1] += dp[cr][j][k]*(n-2)/(double)(n-1);\\n }\\n else{\\n dp[nx][j+1][k] += dp[cr][j][k]*(n-3)/(double)(n-1);\\n dp[nx][j+1][k+1] += dp[cr][j][k]/(double)(n-1);\\n dp[nx][j+1][k-1] += dp[cr][j][k]/(double)(n-1);\\n }\\n }\\n }\\n }\\n cr = nx;\\n }\\n double res = 0;\\n for(int i=0;i<n;i++){\\n res = max(res, dp[cr][K][i]);\\n }\\n for(int j=1;j<=K;j++){\\n res *= (K+1-j)/(double)(h-m-j+1);\\n }\\n printf(\\\"%.9f\\\\n\\\",res);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4360,\n \"score_of_the_acc\": -0.0121,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2294_5921393\",\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\\ndouble dp[2][101][101];\\n\\nint main(){\\n int h,n,p,m,k; cin >> h >> n >> p >> m >> k; p--;\\n vector<int> x(h,-1);\\n rep(i,m){\\n int a,b; cin >> a >> b; a--; b--;\\n x[a] = b;\\n }\\n reverse(all(x));\\n dp[0][0][p] = 1;\\n int K = h-m;\\n rep(i,h){\\n rep(j,k+1) rep(l,n) dp[1][j][l] = 0;\\n if(x[i] == -1){\\n rep(j,k+1) rep(l,n){\\n dp[1][j][l] += dp[0][j][l] * (K-(k-j)) / K;\\n dp[1][j+1][l] += dp[0][j][l] * (k-j) / K * (n-3+(l==0||l==n-1)) / (n-1); \\n if(l>0) dp[1][j+1][l-1] += dp[0][j][l] * (k-j) / K / (n-1);\\n if(l<n-1) dp[1][j+1][l+1] += dp[0][j][l] * (k-j) / K / (n-1);\\n }\\n K--;\\n }else{\\n rep(j,k+1) rep(l,n){\\n if(x[i] == l) dp[1][j][l+1] += dp[0][j][l];\\n else if(x[i] == l-1) dp[1][j][l-1] += dp[0][j][l];\\n else dp[1][j][l] += dp[0][j][l];\\n }\\n }\\n swap(dp[0],dp[1]);\\n }\\n double ans = 0;\\n rep(i,n) chmax(ans, dp[0][k][i]);\\n printf(\\\"%.10f\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.0041,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2294_5347422\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n cout << fixed << setprecision(10);\\n int H, N, P, M, K;\\n cin >> H >> N >> P >> M >> K;\\n P--;\\n vector<int> A(M), B(M);\\n for (int i = 0; i < M; i++){\\n cin >> A[i] >> B[i];\\n A[i]--;\\n B[i]--;\\n }\\n vector<int> x(H, -1);\\n for (int i = 0; i < M; i++){\\n x[A[i]] = B[i];\\n }\\n vector<vector<double>> dp(K + 1, vector<double>(N, 0));\\n dp[0][P] = 1;\\n int cnt = H - M;\\n for (int i = H - 1; i >= 0; i--){\\n if (x[i] != -1){\\n for (int j = 0; j <= K; j++){\\n swap(dp[j][x[i]], dp[j][x[i] + 1]);\\n }\\n } else {\\n vector<vector<double>> dp2(K + 1, vector<double>(N, 0));\\n for (int j = 0; j <= K; j++){\\n double p = (double) (K - j) / cnt;\\n for (int k = 0; k < N; k++){\\n dp2[j][k] += dp[j][k] * (1 - p);\\n if (j < K){\\n double q = p;\\n if (k > 0){\\n dp2[j + 1][k - 1] += dp[j][k] * p / (N - 1);\\n q -= p / (N - 1);\\n }\\n if (k < N - 1){\\n dp2[j + 1][k + 1] += dp[j][k] * p / (N - 1);\\n q -= p / (N - 1);\\n }\\n dp2[j + 1][k] += dp[j][k] * q;\\n }\\n }\\n }\\n swap(dp, dp2);\\n cnt--;\\n }\\n }\\n double ans = 0;\\n for (int i = 0; i < N; i++){\\n ans = max(ans, dp[K][i]);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.04,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2294_5255025\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <algorithm>\\n#include <vector>\\n\\nusing namespace std;\\nusing ldouble = long double;\\n\\nvoid solve() {\\n int h, n, s, m, k;\\n cin >> h >> n >> s >> m >> k;\\n\\n vector<int> ls(h, -1);\\n while (m--) {\\n int x, y;\\n cin >> x >> y;\\n ls[--x] = --y;\\n }\\n\\n auto dp = vector(k + 1, vector(n, 0.L));\\n dp[0][--s] = 1;\\n // 引いた横線の数、当たりの位置\\n\\n int x = 0; // 横線を引ける段の数\\n\\n reverse(ls.begin(), ls.end());\\n for (auto py : ls) {\\n // 下にある段数\\n if (py != -1) {\\n for (int i = 0; i <= k; ++i) {\\n swap(dp[i][py], dp[i][py + 1]);\\n }\\n\\n } else {\\n ++x;\\n auto ndp = vector(k + 1, vector(n, 0.L));\\n\\n for (int i = 0; i <= k; ++i) {\\n // 線を引く確率\\n auto prob = ldouble(i) / x;\\n\\n // 線を引かない場合\\n for (int y = 0; y < n; ++y) {\\n ndp[i][y] += dp[i][y] * (1 - prob);\\n }\\n\\n if (i > 0) {\\n // 線を引く場合\\n for (int y = 0; y < n; ++y) {\\n int stay = n - 1;\\n\\n if (y + 1 < n) {\\n // (y,y+1)\\n ndp[i][y] += dp[i - 1][y + 1] * prob / (n - 1);\\n --stay;\\n }\\n if (y - 1 >= 0) {\\n // (y-1,y)\\n ndp[i][y] += dp[i - 1][y - 1] * prob / (n - 1);\\n --stay;\\n }\\n\\n ndp[i][y] += dp[i - 1][y] * prob * stay / (n - 1);\\n }\\n }\\n }\\n\\n swap(dp, ndp);\\n }\\n }\\n\\n cout << *max_element(dp[k].begin(), dp[k].end()) << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n\\n solve();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.0202,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2294_5249508\",\n \"code_snippet\": \"#include<iostream>\\n#include<iomanip>\\nusing namespace std;\\nint H,N,P,M,K;\\nint id[505];\\ndouble dp[2][102][505];\\nmain()\\n{\\n\\tcin>>H>>N>>P>>M>>K;\\n\\tP--;\\n\\tfor(int i=0;i<M;i++)\\n\\t{\\n\\t\\tint a,b;cin>>a>>b;\\n\\t\\tid[a-1]=b;\\n\\t}\\n\\tint now=0;\\n\\tdp[now][0][P]=1;\\n\\tfor(int i=H;i--;)\\n\\t{\\n\\t\\tint nxt=1-now;\\n\\t\\tfor(int j=0;j<=K;j++)for(int k=0;k<N;k++)dp[nxt][j][k]=0;\\n\\t\\tfor(int j=0;j<=K;j++)for(int k=0;k<N;k++)\\n\\t\\t{\\n\\t\\t\\tif(id[i])\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(k==id[i]-1)dp[nxt][j][k+1]+=dp[now][j][k];\\n\\t\\t\\t\\telse if(k==id[i])dp[nxt][j][k-1]+=dp[now][j][k];\\n\\t\\t\\t\\telse dp[nxt][j][k]+=dp[now][j][k];\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tdp[nxt][j][k]+=dp[now][j][k];\\n\\t\\t\\t\\tif(k==0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdp[nxt][j+1][k]+=dp[now][j][k]*(N-2)/(N-1);\\n\\t\\t\\t\\t\\tdp[nxt][j+1][k+1]+=dp[now][j][k]/(N-1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if(k+1==N)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdp[nxt][j+1][k]+=dp[now][j][k]*(N-2)/(N-1);\\n\\t\\t\\t\\t\\tdp[nxt][j+1][k-1]+=dp[now][j][k]/(N-1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdp[nxt][j+1][k]+=dp[now][j][k]*(N-3)/(N-1);\\n\\t\\t\\t\\t\\tdp[nxt][j+1][k-1]+=dp[now][j][k]/(N-1);\\n\\t\\t\\t\\t\\tdp[nxt][j+1][k+1]+=dp[now][j][k]/(N-1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tnow=nxt;\\n\\t}\\n\\tdouble ans=0;\\n\\tfor(int i=0;i<N;i++)if(ans<dp[now][K][i])ans=dp[now][K][i];\\n\\tfor(int i=1;i<=K;i++)ans=ans*i/(H-M-i+1);\\n\\tcout<<fixed<<setprecision(16)<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4084,\n \"score_of_the_acc\": -0.0327,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2294_4973196\",\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#include \\\"complex\\\"\\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-12;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\n\\n\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tcin >> H >> N >> T >> M >> K;\\n\\tT--;\\n\\tvector<vector<vector<long double>>>dp(H + 1, vector<vector<long double>>(K+1,vector<long double>(N)));\\n\\tdp[H][K][T] = 1;\\n\\tvector<int>v(H, -1);\\n\\tvector<int>sum(H, 1);\\n\\twhile (M--) {\\n\\t\\tcin >> L >> R;\\n\\t\\tL--, R--;\\n\\t\\tv[L] = R;\\n\\t\\tsum[L]--;\\n\\t}\\n\\tfor (int i = 1; i < H; i++) {\\n\\t\\tsum[i] += sum[i - 1];\\n\\t}\\n\\tif (N <= 2) {\\n\\t\\tcout << 1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tfor (int i = H - 1; i >= 0; i--) {\\n\\t\\tif (v[i] == -1) {\\n\\t\\t\\tfor (int j = 0; j <= min(K, sum[i] + 0LL); j++) {\\n\\t\\t\\t\\tlong double p = j;\\n\\t\\t\\t\\tp /= sum[i];\\n\\t\\t\\t\\tfor (int k = 0; k < N; k++) {\\n\\t\\t\\t\\t\\tif (j) {\\n\\t\\t\\t\\t\\t\\tif (k == 0) {\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j - 1][k + 1] += dp[i + 1][j][k] * p / (N - 1);\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j - 1][k] += dp[i + 1][j][k] * p *(N - 2) / (N - 1);\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j][k] += dp[i + 1][j][k] * (1 - p);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse if (k + 1 == N) {\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j - 1][k - 1] += dp[i + 1][j][k] * p / (N - 1);\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j - 1][k] += dp[i + 1][j][k] * p *(N - 2) / (N - 1);\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j][k] += dp[i + 1][j][k] * (1 - p);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j - 1][k - 1] += dp[i + 1][j][k] * p / (N - 1);\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j - 1][k + 1] += dp[i + 1][j][k] * p / (N - 1);\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j - 1][k] += dp[i + 1][j][k] * p *(N - 3) / (N - 1);\\n\\t\\t\\t\\t\\t\\t\\tdp[i][j][k] += dp[i + 1][j][k] * (1 - p);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tdp[i][j][k] = dp[i + 1][j][k];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tfor (int j = 0; j <= K; j++) {\\n\\t\\t\\t\\tdp[i][j] = dp[i + 1][j];\\n\\t\\t\\t\\tswap(dp[i][j][v[i]], dp[i][j][v[i] + 1]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout <<setprecision(20)<< *max_element(dp.front().front().begin(), dp.front().front().end()) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 84516,\n \"score_of_the_acc\": -1.04,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2294_4972751\",\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 H, N, P, M, K;\\nmap<ll, ll> mp;\\nlong double Prev[505][505];\\nlong double Next[505][505];\\nlong double combination[505][505];\\nll emp = 0;\\nint main() {\\n for(int i = 0; i <= 500; i++) {\\n combination[i][0] = 1;\\n for(int j = 1; j <= i; j++) {\\n combination[i][j] = combination[i-1][j] + combination[i-1][j-1];\\n //cerr << combination[i][j] << endl;\\n }\\n }\\n cin >> H >> N >> P >> M >> K;\\n P--;\\n for(int i = 0; i < M; i++) {\\n ll a, b;\\n cin >> a >> b;\\n a--;\\n b--;\\n mp[a] = b;\\n }\\n Prev[0][P] = 1;\\n for(int h = H - 1; h >= 0; h--) {\\n //cerr << \\\"---\\\" << h << \\\"---\\\" << endl;\\n for(int i = 0; i <= 500; i++) {\\n for(int j = 0; j <= 500; j++) {\\n Next[i][j] = 0;\\n }\\n }\\n if(mp.count(h)) {\\n for(int i = 0; i <= K; i++) {\\n for(int j = 0; j < N; j++) {\\n Next[i][j] = Prev[i][j];\\n }\\n ll idx = mp[h];\\n swap(Next[i][idx], Next[i][idx+1]);\\n }\\n } else {\\n emp++;\\n for(int i = 0; i <= K; i++) {\\n for(int j = 0; j < N; j++) {\\n Next[i][j] += Prev[i][j];\\n }\\n }\\n for(int i = 0; i <= K; i++) {\\n for(ll j = 0; j < N; j++) {\\n Next[i+1][j] += Prev[i][j] * (N - 3) / (N - 1);\\n Next[i+1][max(j-1, 0LL)] += Prev[i][j] / (N - 1);\\n Next[i+1][min(j+1, N-1)] += Prev[i][j] / (N - 1);\\n }\\n }\\n }\\n swap(Prev, Next);\\n /*\\n for(int k = 0; k <= K; k++) {\\n cerr << \\\"-\\\" << k << \\\"-\\\" << endl;\\n for(int i = 0; i < N; i++) cerr << Prev[k][i] << \\\" \\\";\\n cerr << endl;\\n }\\n */\\n }\\n long double ans = 0;\\n for(int i = 0; i < N; i++) {\\n chmax(ans, Prev[K][i]);\\n }\\n ans /= combination[emp][K];\\n cout << fixed << setprecision(30) << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 15052,\n \"score_of_the_acc\": -0.5679,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2294_4972276\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint PREP = (cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(12), 0);\\n//int SEGV = getenv(\\\"D\\\") || (exit(system(\\\"D= SEGFAULT_SIGNALS=all catchsegv ./prog.exe\\\") >> 8), 0);\\ndouble dp[2][110][110][110]; // dp[i][j][k][l] = (curr=i, cnt=j, k -> l)\\nint main() {\\n int H, N, P, M, K; cin >> H >> N >> P >> M >> K; P--;\\n vector<int> A(H + 1, -1);\\n for (int i = 0; i < M; i++) {\\n int a, b; cin >> a >> b; b--;\\n A[a] = b; // connect b and b+1\\n }\\n for (int k = 0; k < N; k++) {\\n dp[0][0][k][k] = 1.0;\\n }\\n for (int i = 1; i <= H; i++) {\\n for (int j = 0; j <= K; j++) {\\n for (int k = 0; k < N; k++) {\\n for (int l = 0; l < N; l++) {\\n dp[i%2][j][k][l] = 0;\\n }\\n }\\n }\\n if (A[i] >= 0) {\\n for (int j = 0; j <= K; j++) {\\n for (int k = 0; k < N; k++) {\\n for (int l = 0; l < N; l++) {\\n int from = 0;\\n if (A[i] == l) from = A[i] + 1;\\n else if (A[i] + 1 == l) from = A[i];\\n else from = l;\\n dp[i%2][j][k][l] = dp[(i-1)%2][j][k][from];\\n }\\n }\\n }\\n } else {\\n for (int j = 0; j <= K; j++) {\\n double line = clamp((K - j) / (H - M - i + 1.0), 0.0, 1.0);\\n double noline = 1.0 - line;\\n for (int k = 0; k < N; k++) {\\n for (int l = 0; l < N; l++) {\\n double line_P = line / (N - 1);\\n double line_L = l == 0 ? 0.0 : line_P;\\n double line_R = l == N-1 ? 0.0 : line_P;\\n double line_N = line - line_L - line_R;\\n if (j == K) {\\n dp[i%2][j][k][l] += dp[(i-1)%2][j][k][l];\\n } else {\\n dp[i%2][j][k][l] += noline * dp[(i-1)%2][j][k][l];\\n if (l+1<N) dp[i%2][j+1][k][l+1] += line_R * dp[(i-1)%2][j][k][l];\\n if (l-1>=0) dp[i%2][j+1][k][l-1] += line_L * dp[(i-1)%2][j][k][l];\\n dp[i%2][j+1][k][l] += line_N * dp[(i-1)%2][j][k][l];\\n }\\n }\\n }\\n }\\n }\\n if (A[i] != -1) M--;\\n }\\n double ans = 0.0;\\n for (int k = 0; k < N; k++) {\\n ans = max(ans, dp[H%2][K][k][P]);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1260,\n \"memory_kb\": 23968,\n \"score_of_the_acc\": -1.2537,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2294_4972007\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <list>\\n#include <string>\\n#include <iomanip>\\n#include <queue>\\n\\nusing namespace std;\\n\\nconstexpr int inf = 1e9 + 7;\\n\\nint main(){\\n\\n int h, n, p, m, k;\\n cin >> h >> n >> p >> m >> k;\\n --p;\\n\\n // amida[i][j] := 左からi番目の棒とi+1番目の棒の間に高さjの位置に横棒があるか\\n vector<vector<bool>> amida (n - 1, vector<bool>(h, false));\\n\\n for(int i = 0; i < m; ++i){\\n int a, b;\\n cin >> a >> b;\\n --a, --b;\\n amida[b][a] = true;\\n }\\n\\n // k本の横棒をランダムに引く\\n\\n // 下からやる\\n // dp[i][j][k] := 高さiにいるときに横からj番目の棒へ追加の棒をk回使用したときの確率\\n vector<vector<vector<double>>> prob(h + 1, vector<vector<double>>(n, vector<double>(k + 1, 0.0)));\\n prob[h][p][0] = 1.0;\\n\\n vector<bool> used_y(h, false);\\n\\n // 置くことができる総数\\n int can_set_num = 0;\\n for(int y = 0; y < h; ++y){\\n bool used = false;\\n for(int i = 0; i < n - 1; ++i){\\n used = used || amida[i][y];\\n }\\n used_y[y] = used;\\n if(used) continue;\\n can_set_num++;\\n }\\n double not_used = can_set_num;\\n\\n for(int y = h; y > 0; --y){\\n for(int t = 0; t <= k; ++t){\\n for(int i = 0; i < n; ++i){\\n\\n // そもそも横軸があった\\n if(used_y[y - 1]){\\n // 確定で移動\\n if (i < n-1 && amida[i][y-1]) {\\n prob[y-1][i+1][t] += prob[y][i][t];\\n }\\n else if (i > 0 && amida[i-1][y-1]) {\\n prob[y-1][i-1][t] += prob[y][i][t];\\n }\\n else {\\n prob[y-1][i][t] += prob[y][i][t];\\n }\\n }\\n else{\\n double use = (k-t)/not_used;\\n double nuse = 1-use;\\n double nm1 = 1.0;\\n nm1 /= n-1;\\n //int can_set = can_set_num - t * (n - 1);\\n // 横軸を入れる場合\\n if (t < k) {\\n if (i == 0) {\\n prob[y-1][i+1][t+1] += prob[y][i][t]*use*nm1;\\n prob[y-1][i][t+1] += prob[y][i][t]*use*(1.0-nm1);\\n }\\n else if (i == n-1) {\\n prob[y-1][i-1][t+1] += prob[y][i][t]*use*nm1;\\n prob[y-1][i][t+1] += prob[y][i][t]*use*(1.0-nm1);\\n }\\n else {\\n prob[y-1][i-1][t+1] += prob[y][i][t]*use*nm1;\\n prob[y-1][i+1][t+1] += prob[y][i][t]*use*nm1;\\n prob[y-1][i][t+1] += prob[y][i][t]*use*(1.0-2.0*nm1);\\n }\\n // 入れない場合\\n prob[y-1][i][t] += prob[y][i][t]*nuse;\\n }\\n else {\\n // 入れない場合\\n prob[y-1][i][t] += prob[y][i][t];\\n }\\n }\\n \\n }\\n }\\n if(!used_y[y - 1]) {\\n not_used -= 1.0;\\n }\\n }\\n\\n //double ans = *max_element(prob[0].begin(), prob[0].end());\\n\\n double ans = 0.0;\\n for(int i = 0; i < n; ++i) ans = max(ans, prob[0][i][k]);\\n\\n cout << fixed << setprecision(15) << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 44340,\n \"score_of_the_acc\": -0.5288,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2294_4938305\",\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=200005;\\n//const int INF=1<<30;\\nconst ll INF=1LL<<60;\\n\\ndouble dp[505][105][105];//高さi,j回使った、kにいる\\nint hen[505];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n int H,N,P,M,K;cin>>H>>N>>P>>M>>K;\\n \\n memset(hen,-1,sizeof(hen));\\n for(int i=0;i<M;i++){\\n int a,b;cin>>a>>b;\\n a--;b--;\\n hen[H-a]=b;\\n }\\n \\n P--;\\n \\n dp[0][0][P]=1;\\n \\n int rem=H-M;\\n \\n for(int i=0;i<H;i++){\\n for(int j=0;j<=K;j++){\\n for(int k=0;k<N;k++){\\n //if(dp[i][j][k]==0) continue;\\n \\n if(hen[i+1]==-1){\\n double p=double(K-j)/rem;\\n \\n dp[i+1][j][k]+=dp[i][j][k]*(1.0-p);\\n \\n for(int l=0;l<N-1;l++){\\n if(k==l){\\n dp[i+1][j+1][k]+=dp[i][j][k+1]*p/(N-1);\\n }else if(k==l+1){\\n dp[i+1][j+1][k]+=dp[i][j][k-1]*p/(N-1);\\n }else{\\n dp[i+1][j+1][k]+=dp[i][j][k]*p/(N-1);\\n }\\n }\\n }else{\\n if(k==hen[i+1]){\\n dp[i+1][j][k]+=dp[i][j][k+1];\\n }else if(k==hen[i+1]+1){\\n dp[i+1][j][k]+=dp[i][j][k-1];\\n }else{\\n dp[i+1][j][k]+=dp[i][j][k];\\n }\\n }\\n }\\n }\\n if(hen[i+1]==-1) rem--;\\n }\\n \\n double ans=0;\\n \\n for(int i=0;i<N;i++){\\n chmax(ans,dp[H][K][i]);\\n }\\n \\n cout<<setprecision(25)<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 840,\n \"memory_kb\": 46656,\n \"score_of_the_acc\": -1.1974,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2294_4925690\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define foreach(i,n) for(auto &i:(n))\\n#define lambda(RES,...) (function<RES(__VA_ARGS__)>) [&](__VA_ARGS__) -> RES\\n#define method(NAME,RES,...) function<RES(__VA_ARGS__)>NAME = [&](__VA_ARGS__) -> RES\\n#define all(x) (x).begin(),(x).end()\\n#define bit(x) (1ll<<(x))\\n\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t,vector<t>,greater<t>>;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\nusing pii = pair<int,int>;\\nusing ll = long long;\\ntemplate<class t,class u>\\nbool chmin(t&a,u b){\\n if(a>b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<class t,class u>\\nbool chmax(t&a,u b){\\n if(a<b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nll in(){\\n ll res;\\n cin >> res;\\n return res;\\n}\\n\\n\\ntemplate<class t>\\nt in(){\\n t res;\\n cin >> res;\\n return res;\\n}\\n\\n\\nconst ll INF = 1e9;\\n\\ndouble func(){\\n int h = in();\\n int n = in();\\n int p = in()-1;\\n int m = in();\\n int k = in();\\n vector<int> left(h,-1);\\n rep(i,m){\\n int a = in();\\n int b = in();\\n left[a-1] = b-1;\\n }\\n method(toint,int,int y,int x,int rem){\\n return rem + (k+1) * (x + n * y);\\n };\\n\\n vector<double> dp(toint(h+1,n,k),-1);\\n method(func,double,int y,int x,int rem,int space){\\n if(rem>space)return 0;\\n if(y==h){\\n return x == p and !rem;\\n }\\n double &it = dp[toint(y,x,rem)];\\n if(it>=0)return it;\\n it = 0;\\n if(left[y]>=0){\\n if(left[y]==x){\\n ++x;\\n }else if(left[y]+1==x){\\n --x;\\n }\\n it += func(y+1,x,rem,space);\\n }else{ \\n if(rem){\\n int cnt = 0;\\n if(x){\\n it += func(y+1,x-1,rem-1,space-1) * ((double)rem/space) * ((double)1/(n-1));\\n ++cnt;\\n }\\n if(x+1<n){\\n it += func(y+1,x+1,rem-1,space-1) * ((double)rem/space) * ((double)1/(n-1));\\n ++cnt;\\n }\\n it += func(y+1,x,rem-1,space-1) * ((double)rem/space) * ((double)(n-cnt-1)/(n-1));\\n }\\n it += func(y+1,x,rem,space-1) * (1-((double)rem/space)) ;\\n }\\n return it;\\n };\\n double res = 0;\\n rep(i,n){\\n chmax(res,func(0,i,k,h-m));\\n }\\n return res;\\n}\\n\\nint main(){\\n printf(\\\"%.20lf\\\\n\\\",func());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 42640,\n \"score_of_the_acc\": -0.5799,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2294_4925155\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\n#include<algorithm>\\n#include<iomanip>\\n#include<cassert>\\n\\nusing namespace std;\\n\\nvoid solve(){\\n vector<vector<bool>> bo;\\n vector<int> bo2;\\n int H, N, P, M, K;\\n\\n double ans = 0;\\n\\n cin>>H>>N>>P>>M>>K;\\n\\n bo.resize(H+2, vector<bool>(N+2));\\n bo2.resize(H+2);\\n\\n for(int i = 0; i < M; i++){\\n int A, B;\\n\\n cin>>A>>B;\\n\\n bo[H - A + 1][B] = true;\\n bo2[H - A + 1] = B;\\n }\\n\\n \\n int m = 0;\\n vector<vector<double>> dp(K+2, vector<double>(N+2));\\n dp[0][P] = 1;\\n \\n for(int j = 1; j <= H; j++){\\n vector<vector<double>> nex(K+2, vector<double>(N+2));\\n for(int l = min(K, m); l >= 0; l--) {\\n if(bo2[j]) {\\n for(int k = 1; k <= N; k++){\\n if(bo[j][k]) {\\n nex[l][k+1] += dp[l][k];\\n } else if(bo[j][k-1]) {\\n nex[l][k-1] += dp[l][k];\\n } else {\\n nex[l][k] += dp[l][k];\\n }\\n }\\n } else {\\n double A = (K - l);\\n double B = (H - M - m);\\n double C = H - M - m - (K - l);\\n\\n double pro = A / (B * (N - 1));\\n double pro11 = C / B;\\n double pro12 = pro * (N - 2);\\n double pro22 = pro * (N - 3);\\n \\n for(int k = 1; k <= N; k++){\\n nex[l+1][k+1] += dp[l][k] * pro;\\n nex[l][k] += dp[l][k] * pro11;\\n nex[l+1][k-1] += dp[l][k] * pro;\\n \\n if(k == 1 || k == N)nex[l+1][k] += dp[l][k] * pro12;\\n else nex[l+1][k] += dp[l][k] * pro22;\\n }\\n \\n }\\n }\\n swap(dp, nex);\\n if(bo2[j] == false) m++;\\n }\\n \\n for(int i = 1; i <= N; i++) ans = max(ans, dp[K][i]);\\n\\n cout<<ans<<endl;\\n}\\n\\nsigned main(){\\n cout<<fixed<<setprecision(10);\\n\\n solve();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.0007,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2294_4925145\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\n#include<algorithm>\\n#include<iomanip>\\n#include<cassert>\\n\\nusing namespace std;\\n\\nvoid solve(){\\n vector<vector<bool>> bo;\\n vector<int> bo2;\\n int H, N, P, M, K;\\n\\n double ans = 0;\\n\\n cin>>H>>N>>P>>M>>K;\\n\\n bo.resize(H+2, vector<bool>(N+2));\\n bo2.resize(H+2);\\n\\n for(int i = 0; i < M; i++){\\n int A, B;\\n\\n cin>>A>>B;\\n\\n bo[H - A + 1][B] = true;\\n bo2[H - A + 1] = B;\\n }\\n\\n \\n int m = 0;\\n vector<vector<double>> dp(K+2, vector<double>(N+2));\\n dp[0][P] = 1;\\n \\n for(int j = 1; j <= H; j++){\\n vector<vector<double>> nex(K+2, vector<double>(N+2));\\n for(int l = min(K, m); l >= 0; l--) {\\n if(bo2[j]) {\\n for(int k = 1; k <= N; k++){\\n if(bo[j][k]) {\\n nex[l][k+1] += dp[l][k];\\n } else if(bo[j][k-1]) {\\n nex[l][k-1] += dp[l][k];\\n } else {\\n nex[l][k] += dp[l][k];\\n }\\n }\\n } else {\\n double A = (K - l);\\n double B = (H - M - m);\\n double C = H - M - m - (K - l);\\n\\n double pro = A / (B * (N - 1));\\n double pro11 = C / B;\\n double pro12 = pro * (N - 2);\\n double pro22 = pro * (N - 3);\\n \\n for(int k = 1; k <= N; k++){\\n nex[l+1][k+1] += dp[l][k] * pro;\\n nex[l][k] += dp[l][k] * pro11;\\n nex[l+1][k-1] += dp[l][k] * pro;\\n \\n if(k == 1 || k == N)nex[l+1][k] += dp[l][k] * pro12;\\n else nex[l+1][k] += dp[l][k] * pro22;\\n }\\n \\n }\\n }\\n dp = nex;\\n if(bo2[j] == false) m++;\\n }\\n \\n for(int i = 1; i <= N; i++) ans = max(ans, dp[K][i]);\\n\\n cout<<ans<<endl;\\n}\\n\\nsigned main(){\\n cout<<fixed<<setprecision(10);\\n\\n solve();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.0008,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2294_4925137\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\n#include<algorithm>\\n#include<iomanip>\\n#include<cassert>\\n\\nusing namespace std;\\n\\nvoid solve(){\\n vector<vector<bool>> bo;\\n vector<int> bo2;\\n int H, N, P, M, K;\\n\\n double ans = 0;\\n\\n cin>>H>>N>>P>>M>>K;\\n\\n bo.resize(H+2, vector<bool>(N+2));\\n bo2.resize(H+2);\\n\\n for(int i = 0; i < M; i++){\\n int A, B;\\n\\n cin>>A>>B;\\n\\n bo[A][B] = true;\\n bo2[A] = B;\\n }\\n\\n \\n for(int i = 1; i <= N; i++){\\n int m = 0;\\n vector<vector<double>> dp(K+2, vector<double>(N+2));\\n dp[0][i] = 1;\\n \\n for(int j = 1; j <= H; j++){\\n vector<vector<double>> nex(K+2, vector<double>(N+2));\\n for(int l = min(K, m); l >= 0; l--) {\\n if(bo2[j]) {\\n for(int k = 1; k <= N; k++){\\n if(bo[j][k]) {\\n nex[l][k+1] += dp[l][k];\\n } else if(bo[j][k-1]) {\\n nex[l][k-1] += dp[l][k];\\n } else {\\n nex[l][k] += dp[l][k];\\n }\\n }\\n } else {\\n double A = (K - l);\\n double B = (H - M - m);\\n double C = H - M - m - (K - l);\\n\\n double pro = A / (B * (N - 1));\\n double pro11 = C / B;\\n double pro12 = pro * (N - 2);\\n double pro22 = pro * (N - 3);\\n \\n for(int k = 1; k <= N; k++){\\n nex[l+1][k+1] += dp[l][k] * pro;\\n nex[l][k] += dp[l][k] * pro11;\\n nex[l+1][k-1] += dp[l][k] * pro;\\n \\n if(k == 1 || k == N)nex[l+1][k] += dp[l][k] * pro12;\\n else nex[l+1][k] += dp[l][k] * pro22;\\n }\\n \\n }\\n }\\n dp = nex;\\n if(bo2[j] == false) m++;\\n }\\n ans = max(ans, dp[K][P]);\\n }\\n\\n cout<<ans<<endl;\\n}\\n\\nsigned main(){\\n cout<<fixed<<setprecision(10);\\n\\n solve();\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1180,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.9368,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2294_4924570\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define foreach(i,n) for(auto &i:(n))\\n#define lambda(RES,...) (function<RES(__VA_ARGS__)>) [&](__VA_ARGS__) -> RES\\n#define method(NAME,RES,...) function<RES(__VA_ARGS__)>NAME = [&](__VA_ARGS__) -> RES\\n#define all(x) (x).begin(),(x).end()\\n#define bit(x) (1ll<<(x))\\n\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t,vector<t>,greater<t>>;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\nusing pii = pair<int,int>;\\nusing ll = long long;\\ntemplate<class t,class u>\\nbool chmin(t&a,u b){\\n if(a>b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<class t,class u>\\nbool chmax(t&a,u b){\\n if(a<b){\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nll in(){\\n ll res;\\n cin >> res;\\n return res;\\n}\\n\\n\\ntemplate<class t>\\nt in(){\\n t res;\\n cin >> res;\\n return res;\\n}\\n\\n\\nconst ll INF = 1e9;\\n\\ndouble func(){\\n int h = in();\\n int n = in();\\n int p = in()-1;\\n int m = in();\\n int k = in();\\n vector<int> left(h,-1);\\n rep(i,m){\\n int a = in();\\n int b = in();\\n left[a-1] = b-1;\\n }\\n method(toint,int,int y,int x,int rem){\\n return rem + (k+1) * (x + n * y);\\n };\\n\\n vector<double> dp(toint(h+1,n,k),-1);\\n method(func,double,int y,int x,int rem,int space){\\n if(rem>space)return 0;\\n if(y==h){\\n return x == p and !rem;\\n }\\n double &it = dp[toint(y,x,rem)];\\n if(it>=0)return it;\\n it = 0;\\n if(left[y]>=0){\\n if(left[y]==x){\\n ++x;\\n }else if(left[y]+1==x){\\n --x;\\n }\\n it += func(y+1,x,rem,space);\\n }else{ \\n if(rem){\\n int cnt = 0;\\n if(x){\\n it += func(y+1,x-1,rem-1,space-1) * ((double)rem/space) * ((double)1/(n-1));\\n ++cnt;\\n }\\n if(x+1<n){\\n it += func(y+1,x+1,rem-1,space-1) * ((double)rem/space) * ((double)1/(n-1));\\n ++cnt;\\n }\\n it += func(y+1,x,rem-1,space-1) * ((double)rem/space) * ((double)(n-cnt-1)/(n-1));\\n }\\n it += func(y+1,x,rem,space-1) * (1-((double)rem/space)) ;\\n }\\n return it;\\n };\\n double res = 0;\\n rep(i,n){\\n chmax(res,func(0,i,k,h-m));\\n }\\n return res;\\n}\\n\\nint main(){\\n printf(\\\"%.20lf\\\\n\\\",func());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 42640,\n \"score_of_the_acc\": -0.5799,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":1277,"cells":{"group_id":{"kind":"string","value":"aoj_2298_cpp"},"problem_description":{"kind":"string","value":"I: Starting Line\nICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．\n今日の修行は，一直線上の道を走って，体力と判断力を養おうというものである．うさぎは今，スタートラインに立って長い長い道を見渡している．\n道の途中にはいくつかニンジンが置かれており，うさぎはニンジンを食べると加速することができる．加速していないときのうさぎの走る速さは毎秒\nU\nメートルであるが，ニンジンを食べることで，最後のニンジンを食べてから\nT\n秒後までは速さが毎秒\nV\nメートルとなる．また，うさぎはニンジンを\nK\n個まで食べずに持っておくことができる．ニンジンを持っていても走る速さは変わらない．\nニンジンを持ったり食べたりするのに時間はかからないとして，ゴールまでの最短所要時間を求めたい．\nInput\nN\nK\nT\nU\nV\nL\nD\n1\n...\nD\nN\nN\nはニンジンの個数，\nL\nはスタートからゴールまでの距離 (メートル)，\nD\ni\n(1 ≤\ni\n≤\nN\n) は\ni\n番目のニンジンが置かれている場所のスタートからの距離 (メートル) である．\n1 ≤\nN\n≤ 200，1 ≤\nK\n≤\nN\n，1 ≤\nT\n≤ 10,000，1 ≤\nU\n<\nV\n≤ 10,000，2 ≤\nL\n≤ 10,000，0 <\nD\n1\n<\nD\n2\n< ... <\nD\nN\n<\nL\nを満たす．入力の値はすべて整数である．\nOutput\n最短所要時間 (秒) を 1 行に出力せよ．10\n-6\n以下の絶対誤差が許容される．\nSample Input 1\n1 1 1 2 3 100\n50\nSample Output 1\n49.500000000\nSample Input 2\n3 1 1 2 3 100\n49\n50\n51\nSample Output 2\n48.666666667"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2298_7149956","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N, K, T, U, V, L;\n cin >> N >> K >> T >> U >> V >> L;\n vector<int> D(N), G(L + 1, -1), S(L + 1);\n for(int i = 0; i < N; i++){\n cin >> D[i];\n G[D[i]] = i;\n S[D[i]]++;\n }\n for(int i = 0; i < L; i++)S[i + 1] += S[i];\n double INF = 1 << 29;\n K++;\n vector<vector<double>> dp(L + 1, vector<double>(K + 1, 1 << 30));\n auto f = [&](int from, int fromj, int to){\n to = min(L, to);\n int add = S[to] - S[from], nj = min(K, fromj - 1 + add);\n dp[to][nj] = min(dp[to][nj], dp[from][fromj] + (double)(to - from) / V);\n };\n dp[0][0] = 0;\n for(int i = 0; i < L; i++){\n for(int j = 0; j <= K; j++){\n if(dp[i][j] >= INF)continue;\n if(G[i] == -1 && j == K)continue;\n int nj = min(K, j + S[i + 1] - S[i]);\n if(j < K)dp[i + 1][nj] = min(dp[i + 1][nj], dp[i][j] + double(1) / U);\n if(j){\n f(i, j, i + V * T);\n for(int l = 0; l < N && D[l] <= i + V * T; l++){\n if(D[l] <= i)continue;\n f(i, j, D[l]);\n }\n }\n }\n }\n double ans = 1 << 30;\n for(int i = 0; i <= K; i++) ans = min(ans, dp[L][i]);\n cout << fixed << setprecision(15) << ans << '\\n';\n}","accuracy":1,"time_ms":210,"memory_kb":19500,"score_of_the_acc":-2,"final_rank":4},{"submission_id":"aoj_2298_1845788","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint N,K,U,L,V,T;\ndouble cnt;\nbool mp[10010];\n\nint main(){\n cin>>N>>K>>T>>U>>V>>L;\n for(int i=0,a,A;i<N;i++){\n cin>>a;A=a;\n while(mp[a]&&(1.0*a-A)/V/T<K)a++;\n for(int j=a;j<L&&j<a+T*V;j++)cnt+=!mp[j],mp[j]=1;\n }\n\n printf(\"%.8f\\n\",cnt/V+(L-cnt)/U);\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":1200,"score_of_the_acc":-0.0526,"final_rank":3},{"submission_id":"aoj_2298_1845783","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint N,K,U,L;\ndouble cnt,V,T;\nbool mp[10010];\n\nint main(){\n cin>>N>>K>>T>>U>>V>>L;\n for(int i=0,a,A;i<N;i++){\n cin>>a;A=a;\n while(mp[a]&&(a-A)/V/T<K)a++;\n for(int j=a;j<L&&j<a+T*V;j++)cnt+=!mp[j],mp[j]=1;\n }\n\n printf(\"%.8f\\n\",cnt/V+(L-cnt)/U);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1256,"score_of_the_acc":-0.0031,"final_rank":1},{"submission_id":"aoj_2298_1845774","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint N,K,U,L;\ndouble cnt,V,T;\nbool mp[10010];\n\nint main(){\n cin>>N>>K>>T>>U>>V>>L;\n for(int i=0,a,A;i<N;i++){\n cin>>a;\n A=a;\n while(mp[a]&&(a-A)/V/T<K)a++;\n for(int j=a;j<L&&j<a+T*V;j++)cnt+=!mp[j],mp[j]=1;\n }\n\n printf(\"%.8f\\n\",cnt/V+(L-cnt)/U);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1256,"score_of_the_acc":-0.0031,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2298_7149956\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n int N, K, T, U, V, L;\\n cin >> N >> K >> T >> U >> V >> L;\\n vector<int> D(N), G(L + 1, -1), S(L + 1);\\n for(int i = 0; i < N; i++){\\n cin >> D[i];\\n G[D[i]] = i;\\n S[D[i]]++;\\n }\\n for(int i = 0; i < L; i++)S[i + 1] += S[i];\\n double INF = 1 << 29;\\n K++;\\n vector<vector<double>> dp(L + 1, vector<double>(K + 1, 1 << 30));\\n auto f = [&](int from, int fromj, int to){\\n to = min(L, to);\\n int add = S[to] - S[from], nj = min(K, fromj - 1 + add);\\n dp[to][nj] = min(dp[to][nj], dp[from][fromj] + (double)(to - from) / V);\\n };\\n dp[0][0] = 0;\\n for(int i = 0; i < L; i++){\\n for(int j = 0; j <= K; j++){\\n if(dp[i][j] >= INF)continue;\\n if(G[i] == -1 && j == K)continue;\\n int nj = min(K, j + S[i + 1] - S[i]);\\n if(j < K)dp[i + 1][nj] = min(dp[i + 1][nj], dp[i][j] + double(1) / U);\\n if(j){\\n f(i, j, i + V * T);\\n for(int l = 0; l < N && D[l] <= i + V * T; l++){\\n if(D[l] <= i)continue;\\n f(i, j, D[l]);\\n }\\n }\\n }\\n }\\n double ans = 1 << 30;\\n for(int i = 0; i <= K; i++) ans = min(ans, dp[L][i]);\\n cout << fixed << setprecision(15) << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 19500,\n \"score_of_the_acc\": -2,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2298_1845788\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint N,K,U,L,V,T;\\ndouble cnt;\\nbool mp[10010];\\n\\nint main(){\\n cin>>N>>K>>T>>U>>V>>L;\\n for(int i=0,a,A;i<N;i++){\\n cin>>a;A=a;\\n while(mp[a]&&(1.0*a-A)/V/T<K)a++;\\n for(int j=a;j<L&&j<a+T*V;j++)cnt+=!mp[j],mp[j]=1;\\n }\\n\\n printf(\\\"%.8f\\\\n\\\",cnt/V+(L-cnt)/U);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 1200,\n \"score_of_the_acc\": -0.0526,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2298_1845783\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint N,K,U,L;\\ndouble cnt,V,T;\\nbool mp[10010];\\n\\nint main(){\\n cin>>N>>K>>T>>U>>V>>L;\\n for(int i=0,a,A;i<N;i++){\\n cin>>a;A=a;\\n while(mp[a]&&(a-A)/V/T<K)a++;\\n for(int j=a;j<L&&j<a+T*V;j++)cnt+=!mp[j],mp[j]=1;\\n }\\n\\n printf(\\\"%.8f\\\\n\\\",cnt/V+(L-cnt)/U);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -0.0031,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2298_1845774\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint N,K,U,L;\\ndouble cnt,V,T;\\nbool mp[10010];\\n\\nint main(){\\n cin>>N>>K>>T>>U>>V>>L;\\n for(int i=0,a,A;i<N;i++){\\n cin>>a;\\n A=a;\\n while(mp[a]&&(a-A)/V/T<K)a++;\\n for(int j=a;j<L&&j<a+T*V;j++)cnt+=!mp[j],mp[j]=1;\\n }\\n\\n printf(\\\"%.8f\\\\n\\\",cnt/V+(L-cnt)/U);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1256,\n \"score_of_the_acc\": -0.0031,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1278,"cells":{"group_id":{"kind":"string","value":"aoj_2293_cpp"},"problem_description":{"kind":"string","value":"D: Dangerous Tower\nICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．\n今日の修行は，積み木を丁寧に積み上げることによって，決してミスタイピングをしないほどの手先の器用さを手に入れようというものである．せっかく積み木がたくさんあるので，高い塔を作ろう．\n積み木は\nN\n個あり，\ni\n番目 (1 ≤\ni\n≤\nN\n) の積み木は 1 ×\nA\ni\n×\nB\ni\nの直方体の形をしている．長さ 1 の辺は奥行き方向に用いて，長さ\nA\ni\n,\nB\ni\nの辺を横方向と高さ方向に 1 つずつ割り当てることにした．積み木を積み上げるとき，上の段の積み木は下の段の積み木より横の長さが厳密に短くなければならない．積み木は好きな順番に使うことができ，また，使わない積み木があってもよい．このような制約下で，作ることが可能な最も高い塔を作りたい．\nInput\nN\nA\n1\nB\n1\n...\nA\nN\nB\nN\n1 ≤\nN\n≤ 1,000，1 ≤\nA\ni\n，\nB\ni\n≤ 1,000,000 を満たす．入力の値はすべて整数である．\nOutput\n塔の高さの最大値を 1 行に出力せよ．\nSample Input 1\n3\n10 40\n10 40\n20 30\nSample Output 1\n80\nSample Input 2\n4\n1 2\n2 3\n3 4\n4 1\nSample Output 2\n11"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2293_10946082","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int INF = 1e9;\n\nusing pii = pair<int, int>;\n\nstruct edge {\n int to, cap, cost, rev;\n};\n\nusing edges = vector<edge>;\nusing graph = vector<edges>;\n\nvoid add_edge(graph& g, 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(graph& g, int s, int t, int f) {\n int res = 0;\n const int N = g.size();\n vector<int> h(N), dist(N), prevv(N), preve(N);\n while(f > 0) {\n priority_queue<pii, vector<pii>, greater<pii>> que;\n fill(dist.begin(), dist.end(), INF);\n dist[s] = 0;\n que.push(make_pair(0, s));\n while(!que.empty()) {\n pii p = que.top();\n int v = p.second;\n que.pop();\n if(dist[v] < p.first) {\n continue;\n }\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(make_pair(dist[e.to], e.to));\n }\n }\n }\n if(dist[t] == INF) {\n return -1;\n }\n for(int v=0; v<N; ++v) {\n h[v] += dist[v];\n }\n int d = f;\n for(int v=t; v!=s; v=prevv[v]) {\n d = min(d, g[prevv[v]][preve[v]].cap);\n }\n f -= d;\n res += d * h[t];\n for(int v=t; v!=s; v=prevv[v]) {\n edge& e = g[prevv[v]][preve[v]];\n e.cap -= d;\n g[v][e.rev].cap += d;\n }\n }\n return res;\n}\n\nint main() {\n int N;\n cin >> N;\n vector<int> A(N), B(N);\n vector<int> v;\n for(int i=0; i<N; ++i) {\n cin >> A[i] >> B[i];\n v.push_back(A[i]);\n v.push_back(B[i]);\n }\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n graph g(N+v.size()+3);\n int source = N + v.size();\n int unuse = N + v.size() + 1;\n int sink = N + v.size() + 2;\n for(int i=0; i<N; ++i) {\n add_edge(g, source, i, 1, 0);\n }\n for(int i=0; i<N; ++i) {\n int a = lower_bound(v.begin(), v.end(), A[i]) - v.begin();\n add_edge(g, i, N+a, 1, -B[i]);\n int b = lower_bound(v.begin(), v.end(), B[i]) - v.begin();\n add_edge(g, i, N+b, 1, -A[i]);\n add_edge(g, i, unuse, 1, 0);\n }\n for(int i=0; i<v.size(); ++i) {\n add_edge(g, N+i, sink, 1, 0);\n }\n add_edge(g, unuse, sink, INF, 0);\n cout << -min_cost_flow(g, source, sink, N) << endl;\n}","accuracy":1,"time_ms":200,"memory_kb":3792,"score_of_the_acc":-0.1508,"final_rank":12},{"submission_id":"aoj_2293_9805229","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n// https://ei1333.github.io/library/graph/flow/primal-dual.hpp.html\ntemplate<typename flow_t,typename cost_t>\nstruct MinCostFlow{\n struct edge{\n int to;\n flow_t cap;cost_t cost;\n int rev;\n bool is_e;// 本当の辺かどうか\n };\n vector<vector<edge>> v;\n vector<cost_t> potential,mn_cost;\n vector<int> pre_v,pre_e;\n const cost_t inf;\n MinCostFlow(int n):v(n),inf(numeric_limits<cost_t>::max()){}\n void add_edge(int fr,int to,flow_t cap,cost_t cost){\n v[fr].emplace_back((edge){to,cap,cost,(int)v[to].size(),true});\n v[to].emplace_back((edge){fr,0,-cost,(int)v[fr].size()-1,false});\n }\n // s->tの流量fの最小コスト O(FElog(V))\n cost_t min_cost_flow(int s,int t,flow_t f){\n int n = (int)v.size();\n cost_t res = 0;\n using pi = pair<cost_t,int>;//{cost,頂点番号}\n priority_queue<pi,vector<pi>,greater<pi>> que;\n potential.assign(n,0);\n pre_v.assign(n,-1);pre_e.assign(n,-1);\n while(f > 0){\n mn_cost.assign(n,inf);\n que.emplace(0,s);\n mn_cost[s] = 0;\n while(!que.empty()){\n auto [o_cost,ov] = que.top();que.pop();\n if(mn_cost[ov] < o_cost)continue;\n for(int i = 0;i < (int)v[ov].size();i++){\n edge &e = v[ov][i];\n cost_t n_cost = mn_cost[ov] + e.cost + potential[ov]-potential[e.to];\n if(e.cap > 0 && n_cost < mn_cost[e.to]){\n mn_cost[e.to] = n_cost;\n pre_v[e.to] = ov,pre_e[e.to] = i;\n que.emplace(mn_cost[e.to],e.to);\n }\n }\n }\n if(mn_cost[t] == inf)return -1;\n for(int i = 0;i < n;i++)potential[i] += mn_cost[i];\n flow_t add_flow = f;\n for(int ov = t;ov != s;ov = pre_v[ov]){\n add_flow = min(add_flow,v[pre_v[ov]][pre_e[ov]].cap);\n }\n f -= add_flow;\n res += add_flow*potential[t];\n for(int ov = t;ov != s;ov = pre_v[ov]){\n edge &e = v[pre_v[ov]][pre_e[ov]];\n e.cap -= add_flow;\n v[ov][e.rev].cap += add_flow;\n }\n }\n return res;\n }\n // 復元の方法 下の実装で(ov->nv,辺の今の流量/辺の流量の最大値)\n void output(){\n for(int i = 0;i < v.size();i++){\n for(auto &e : v[i]){\n if(!e.is_e)continue;\n auto &rev_e = v[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow:\" << rev_e.cap << \"/\" << rev_e.cap +e.cap << \")\\n\";\n }\n }\n }\n};\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n int n;cin >> n;\n vi a(n),b(n);\n rep(i,n)cin >> a[i] >> b[i];\n vi cor;\n rep(i,n)cor.emplace_back(a[i]),cor.emplace_back(b[i]);\n sort(ALL(cor));\n cor.erase(unique(ALL(cor)),cor.end());\n MinCostFlow<ll,ll> mc(n+sz(cor)+2);\n int S = n + sz(cor),T = S+1;\n rep(i,n){\n int aid = n+LB(cor,a[i]),bid = n+LB(cor,b[i]);\n mc.add_edge(i,bid,1,-a[i]);\n mc.add_edge(i,aid,1,-b[i]);\n }\n rep(i,n)mc.add_edge(S,i,1,0);\n rep(i,sz(cor))mc.add_edge(n+i,T,1,0);\n mc.add_edge(S,T,n,0);\n cout << -mc.min_cost_flow(S,T,n) << \"\\n\";\n \n\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":4068,"score_of_the_acc":-0.1652,"final_rank":15},{"submission_id":"aoj_2293_9805048","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nstruct MaxFlow {\n struct Edge {\n int to, rev;\n ll cap;\n };\n int V;\n vector<vector<Edge>> G;\n vector<int> itr, level;\n using P = pair<int, int>;\n vector<P> es;\n\n public:\n MaxFlow() {}\n MaxFlow(int V) : V(V) {\n G.assign(V, vector<Edge>());\n }\n int add_vertex() {\n G.push_back(vector<Edge>());\n return V++;\n }\n void add_edge(int from, int to, ll cap) {\n int fid = SZ(G[from]), tid = SZ(G[to]);\n if (from == to)\n tid++;\n es.push_back({from, fid});\n G[from].push_back({to, tid, cap});\n G[to].push_back({from, fid, 0});\n }\n struct Type {\n int from, to;\n ll cap, recap;\n };\n Type get_edge(int i) {\n auto [from, pos] = es[i];\n auto e = G[from][pos];\n auto re = G[e.to][e.rev];\n return Type{from, e.to, e.cap, re.cap};\n }\n void bfs(int s) {\n level.assign(V, -1);\n queue<int> q;\n level[s] = 0;\n q.push(s);\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto &e : G[v]) {\n if (e.cap > 0 && level[e.to] < 0) {\n level[e.to] = level[v] + 1;\n q.push(e.to);\n }\n }\n }\n }\n ll dfs(int v, int t, ll f) {\n if (v == t)\n return f;\n for (int &i = itr[v]; i < (int)G[v].size(); i++) {\n Edge &e = G[v][i];\n if (e.cap > 0 && level[v] < level[e.to]) {\n ll d = dfs(e.to, t, min(f, e.cap));\n if (d > 0) {\n e.cap -= d, G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n ll run(int s, int t) {\n ll ret = 0, f;\n while (bfs(s), level[t] >= 0) {\n itr.assign(V, 0);\n while ((f = dfs(s, t, INF)) > 0)\n ret += f;\n }\n return ret;\n }\n vector<int> cut() {\n vector<int> ret(V);\n rep(v, 0, V) if (level[v] < 0) ret[v] = 1;\n return ret;\n }\n};\n\n/**\n * @brief Maximum Flow\n */\n\ntemplate <class Cap, class Cost> struct MinCostFlow {\n struct X {\n int from, to;\n Cap lb, ub, flow;\n Cost cost;\n };\n struct Edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n using P = pair<int, int>;\n int n, m;\n vector<X> es;\n vector<Cap> exc;\n vector<Cost> dual;\n vector<vector<Edge>> g;\n Cost MX;\n MinCostFlow(int _n) : n(_n), m(0), exc(n), dual(n), g(n), MX(0) {}\n void add_edge(int from, int to, Cap lb, Cap ub, Cost cost) {\n m++;\n chmax(MX, cost);\n chmax(MX, -cost);\n es.push_back({from, to, lb, ub, 0, cost});\n }\n void add_excess(int v, Cap c) { exc[v] += c; }\n pair<bool, Cost> run() {\n MaxFlow mf(n + 2);\n int S = n, T = n + 1;\n Cap psum = 0, nsum = 0;\n for (auto &e : es) {\n exc[e.to] += e.lb;\n exc[e.from] -= e.lb;\n mf.add_edge(e.from, e.to, e.ub - e.lb);\n }\n rep(i, 0, n) {\n if (exc[i] > 0) {\n psum += exc[i];\n mf.add_edge(S, i, exc[i]);\n }\n if (exc[i] < 0) {\n nsum += -exc[i];\n mf.add_edge(i, T, -exc[i]);\n }\n }\n\n if (psum != nsum or mf.run(S, T) != psum)\n return {false, 0};\n\n using P = pair<int, int>;\n vector<P> pos;\n rep(i, 0, m) {\n auto e = mf.get_edge(i);\n Cost cost = es[i].cost * n;\n int fid = SZ(g[e.from]), tid = SZ(g[e.to]);\n if (e.from == e.to)\n tid++;\n pos.push_back({e.from, fid});\n g[e.from].push_back({e.to, tid, e.cap, cost});\n g[e.to].push_back({e.from, fid, e.recap, -cost});\n }\n\n // solve\n\n Cost eps = MX * n + 1;\n while (eps > 1) {\n eps = max<Cost>(eps >> 2, 1);\n refine(eps);\n }\n\n Cost ret = 0;\n rep(i, 0, m) {\n auto [from, fid] = pos[i];\n es[i].flow = es[i].ub - g[from][fid].cap;\n ret += es[i].flow * es[i].cost;\n }\n dual.assign(n, 0);\n for (;;) {\n bool upd = 0;\n rep(i, 0, n) {\n for (auto &e : g[i])\n if (e.cap) {\n auto cost = dual[i] + e.cost / n;\n if (chmin(dual[e.to], cost)) {\n upd = 1;\n }\n }\n }\n if (!upd)\n break;\n }\n return {true, ret};\n }\n Cap get_flow(int i) const { return es[i].flow; }\n\n private:\n void refine(Cost &eps) {\n exc.assign(n, 0);\n vector<int> used(n);\n queue<int> que;\n vector<int> iter(n);\n\n auto cost = [&](int from, const Edge &e) {\n return e.cost + dual[from] - dual[e.to];\n };\n auto push = [&](int from, Edge &e, Cap cap) {\n exc[from] -= cap;\n exc[e.to] += cap;\n g[e.to][e.rev].cap += cap;\n e.cap -= cap;\n };\n auto relabel = [&](int v) {\n iter[v] = 0;\n Cost down = MX * (n + 1);\n for (auto &e : g[v])\n if (e.cap) {\n chmin(down, eps + cost(v, e));\n }\n dual[v] -= down;\n que.push(v);\n used[v] = 1;\n };\n\n rep(i, 0, n) {\n for (auto &e : g[i])\n if (e.cap and cost(i, e) < 0) {\n push(i, e, e.cap);\n }\n }\n rep(i, 0, n) if (exc[i] > 0) {\n used[i] = 1;\n que.push(i);\n }\n while (!que.empty()) {\n auto v = que.front();\n que.pop();\n used[v] = 0;\n for (int &i = iter[v]; i < SZ(g[v]); i++) {\n auto &e = g[v][i];\n if (e.cap and cost(v, e) < 0) {\n push(v, e, min(exc[v], e.cap));\n if (!used[e.to] and exc[e.to] > 0) {\n used[e.to] = 1;\n que.push(e.to);\n }\n if (exc[v] == 0)\n break;\n }\n }\n if (exc[v] > 0) {\n relabel(v);\n }\n }\n eps = 0;\n rep(i, 0, n) {\n for (auto &e : g[i])\n if (e.cap) {\n chmax(eps, -cost(i, e));\n }\n }\n }\n};\n\n/**\n * @brief Minimum Cost b-flow\n */\n\nint main() {\n int N;\n cin >> N;\n vector<ll> A(N), B(N), X;\n rep(i,0,N) cin >> A[i] >> B[i], X.push_back(A[i]), X.push_back(B[i]);\n UNIQUE(X);\n int L = X.size();\n MinCostFlow<ll,ll> G(N+L+2);\n G.add_edge(N+L+1,N+L,0,N,0);\n rep(i,0,N) G.add_edge(N+L,i,0,1,0);\n rep(i,0,L) G.add_edge(N+i,N+L+1,0,1,0);\n rep(i,0,N) {\n int AX = LB(X,A[i]), BX = LB(X,B[i]);\n G.add_edge(i,N+AX,0,1,-B[i]);\n G.add_edge(i,N+BX,0,1,-A[i]);\n }\n auto [b,ans] = G.run();\n cout << -ans << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4312,"score_of_the_acc":-0.0121,"final_rank":1},{"submission_id":"aoj_2293_9556864","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optmize(\"Ofast\")\n\ntemplate <class ft = long long, class ct = long long>\nstruct PrimalDual {\n const ct INF;\n \n struct edge {\n int to;\n int rev;\n ft cap;\n ct cost;\n };\n \n int siz;\n vector<vector<edge>> graph;\n vector<ct> pot, minc;\n vector<int> prev_v, prev_id;\n \n PrimalDual(int n) : siz(n), INF(1e18), graph(n) {}\n \n void add_edge(int from, int to, ft cap, ct cost) {\n assert(from < siz && to < siz);\n graph[from].emplace_back((edge){to, (int)graph[to].size(), cap, cost});\n graph[to].emplace_back((edge){from, (int)graph[from].size() - 1, 0, -cost});\n }\n \n ct min_cost_flow(int s, int t, ft f) {\n ct ret = 0;\n using Pi = pair<ct, int>;\n priority_queue<Pi, vector<Pi>, greater<Pi> > pq;\n pot.assign(siz, 0);\n prev_v.assign(siz, -1);\n prev_id.assign(siz, -1);\n \n while (f > 0) {\n minc.assign(siz, INF);\n pq.emplace(0, s);\n minc[s] = 0;\n \n while (pq.size()) {\n auto [cost, v] = pq.top();\n pq.pop();\n \n if (minc[v] < cost) {\n continue;\n }\n for (int i = 0; i < graph[v].size(); ++i) {\n auto &e = graph[v][i];\n ct nc = minc[v] + e.cost + pot[v] - pot[e.to];\n if (e.cap > 0 && minc[e.to] > nc) {\n minc[e.to] = nc;\n prev_v[e.to] = v;\n prev_id[e.to] = i;\n pq.emplace(minc[e.to], e.to);\n }\n }\n }\n \n if (minc[t] == INF) {\n return -1;\n }\n \n for (int v = 0; v < siz; ++v) {\n pot[v] += minc[v];\n }\n ft addflow = f;\n for (int v = t; v != s; v = prev_v[v]) {\n addflow = min(addflow, graph[prev_v[v]][prev_id[v]].cap);\n }\n f -= addflow;\n ret += addflow * pot[t];\n for (int v = t; v != s; v = prev_v[v]) {\n auto &e = graph[prev_v[v]][prev_id[v]];\n e.cap -= addflow;\n graph[e.to][e.rev].cap += addflow;\n }\n }\n return ret;\n }\n \n};\n\nconst ll ABMAX = int(1e6) + 1;\n\nint main() {\n ll N; cin >> N;\n vector<ll> A(N), B(N);\n set<ll> zt;\n zt.insert(0);\n for (int i = 0; i < N; ++i) {\n cin >> A[i] >> B[i];\n zt.insert(A[i]);\n zt.insert(B[i]);\n }\n \n map< int, int > num_to_id;\n {\n int cnt = 0;\n for (auto v : zt) {\n num_to_id[v] = cnt;\n cnt++;\n }\n }\n int siz = zt.size();\n \n int S = siz + N, T = S + 1;\n PrimalDual mcf(T + 1);\n ll base = 0;\n ll n0 = num_to_id[0];\n for (int i = 0; i < N; ++i) {\n ll a = A[i], b = B[i];\n ll na = num_to_id[a], nb = num_to_id[b];\n ll v = siz + i;\n base += (a + b);\n mcf.add_edge(S, v, 1, 0);\n mcf.add_edge(v, n0, 1, a + b);\n mcf.add_edge(v, na, 1, a);\n mcf.add_edge(v, nb, 1, b);\n }\n for (auto [key, value] : num_to_id) {\n ll f = 1;\n if (key == 0) f = N;\n mcf.add_edge(value, T, f, 0);\n }\n \n ll cost = mcf.min_cost_flow(S, T, N);\n ll res = base - cost;\n cout << res << endl;\n \n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":4224,"score_of_the_acc":-0.0974,"final_rank":7},{"submission_id":"aoj_2293_9443876","code_snippet":"#include<bits/stdc++.h>\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\nnamespace atcoder {\n\ntemplate <class Cap, class Cost> struct mcf_graph {\n public:\n mcf_graph() {}\n mcf_graph(int n) : _n(n), g(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 int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap, cost});\n g[to].push_back(_edge{from, from_id, 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(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{\n pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,\n };\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result(m);\n for (int i = 0; i < m; i++) {\n result[i] = get_edge(i);\n }\n return result;\n }\n\n std::pair<Cap, Cost> flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\n return slope(s, t, flow_limit).back();\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\n return slope(s, t, std::numeric_limits<Cap>::max());\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n // variants (C = maxcost):\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\n std::vector<Cost> dual(_n, 0), dist(_n);\n std::vector<int> pv(_n), pe(_n);\n std::vector<bool> vis(_n);\n auto dual_ref = [&]() {\n std::fill(dist.begin(), dist.end(),\n std::numeric_limits<Cost>::max());\n std::fill(pv.begin(), pv.end(), -1);\n std::fill(pe.begin(), pe.end(), -1);\n std::fill(vis.begin(), vis.end(), false);\n struct Q {\n Cost key;\n int to;\n bool operator<(Q r) const { return key > r.key; }\n };\n std::priority_queue<Q> que;\n dist[s] = 0;\n que.push(Q{0, s});\n while (!que.empty()) {\n int v = que.top().to;\n que.pop();\n if (vis[v]) continue;\n vis[v] = true;\n if (v == t) break;\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\n // dist[v] >= 0 (all reduced cost are positive)\n // dist[v] <= (n-1)C\n for (int i = 0; i < int(g[v].size()); i++) {\n auto e = g[v][i];\n if (vis[e.to] || !e.cap) continue;\n // |-dual[e.to] + dual[v]| <= (n-1)C\n // cost <= C - -(n-1)C + 0 = nC\n Cost cost = e.cost - dual[e.to] + dual[v];\n if (dist[e.to] - dist[v] > cost) {\n dist[e.to] = dist[v] + cost;\n pv[e.to] = v;\n pe[e.to] = i;\n que.push(Q{dist[e.to], e.to});\n }\n }\n }\n if (!vis[t]) {\n return false;\n }\n\n for (int v = 0; v < _n; v++) {\n if (!vis[v]) continue;\n // dual[v] = dual[v] - dist[t] + dist[v]\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) + (shortest(s, v) + dual[s] - dual[v])\n // = - shortest(s, t) + dual[t] + shortest(s, v)\n // = shortest(s, v) - shortest(s, t) >= 0 - (n-1)C\n dual[v] -= dist[t] - dist[v];\n }\n return true;\n };\n Cap flow = 0;\n Cost cost = 0, prev_cost_per_flow = -1;\n std::vector<std::pair<Cap, Cost>> result;\n result.push_back({flow, cost});\n while (flow < flow_limit) {\n if (!dual_ref()) break;\n Cap c = flow_limit - flow;\n for (int v = t; v != s; v = pv[v]) {\n c = std::min(c, g[pv[v]][pe[v]].cap);\n }\n for (int v = t; v != s; v = pv[v]) {\n auto& e = g[pv[v]][pe[v]];\n e.cap -= c;\n g[v][e.rev].cap += c;\n }\n Cost d = -dual[s];\n flow += c;\n cost += c * d;\n if (prev_cost_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 private:\n int _n;\n\n struct _edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\nusing namespace std;\nusing ll=long long;\nusing vll=vector<ll>;\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\n\nint main(){\n ll N;\n cin>>N;\n map<ll,ll> M;\n vll A(N),B(N);\n rep(i,N){\n cin>>A[i]>>B[i];\n M[A[i]]=M[B[i]]=1;\n }\n ll cnt=N;\n for(auto m:M)M[m.first]=cnt,cnt++;\n ll S=cnt;\n ll T=cnt+1;\n mcf_graph<ll,ll> G(cnt+2);\n rep(i,N)G.add_edge(S,i,1,0);\n ll d=1e9;\n rep(i,N){\n G.add_edge(i,M[A[i]],1,d-B[i]);\n G.add_edge(i,M[B[i]],1,d-A[i]);\n }\n \n for(auto m:M){\n G.add_edge(m.second,T,1,0);\n }\n\n auto V=G.slope(S,T);\n ll VN=V.size();\n ll an=0;\n rep(i,VN-1){\n ll rang=(V[i+1].second-V[i].second)/(V[i+1].first-V[i].first);\n for(ll j=V[i].first;j<=V[i+1].first;j++){\n ll res=V[i].second+rang*(j-V[i].first);\n an=max(an,d*j-res);\n }\n }\n cout<<an<<endl;\n\n \n}","accuracy":1,"time_ms":40,"memory_kb":4128,"score_of_the_acc":-0.0316,"final_rank":4},{"submission_id":"aoj_2293_9373890","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\ntemplate<class T = ll>\nstruct MCF {\nprivate:\n const T inf = 1e18;\n vector<T> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; long long cap; T cost;\n edge(int t = 0, int r = 0, long long ca = 0, T co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n T d; int v; //最短距離(費用)、頂点番号\n pii(T d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<T> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, long long cap, T cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n //s->tへ流量fの最小費用流、流せないときは-1\n T mincostflow(int s, int t, long long f) {\n T res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return res; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n if (nf * (pot[t] - pot[s]) > 0) return res;\n\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return res;\n }\n\n //s->tへ流量fの最小費用流、流せないときは費用と流せなかった流量のペア\n pair<T, long long> mincostflow_pair(int s, int t, long long f) {\n T res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return { res, f }; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf; \n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return { res, f };\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n vi<int> a(n), b(n);\n rep(i, n) cin >> a[i] >> b[i];\n\n map<int, int> mp;\n rep(i, n) mp[a[i]];\n rep(i, n) mp[b[i]];\n int idx = 0;\n for (auto& elem : mp) elem.second = idx++;\n\n int sz = (int)mp.size();\n\n MCF mcf(n + sz + 2);\n int S = n + sz, T = S + 1;\n\n rep(i, n) mcf.addedge(S, i, 1, 0);\n rep(j, sz) mcf.addedge(j + n, T, 1, 0);\n\n rep(i, n) {\n mcf.addedge(i, mp[a[i]] + n, 1, -b[i]);\n mcf.addedge(i, mp[b[i]] + n, 1, -a[i]);\n }\n\n auto ans = mcf.mincostflow(S, T, n);\n cout << -ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":4028,"score_of_the_acc":-0.1325,"final_rank":8},{"submission_id":"aoj_2293_9373855","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\ntemplate<class T = ll>\nstruct MCF {\nprivate:\n const T inf = 1e18;\n vector<T> dist; //最短距離(費用)\n vector<int> pv, pe; //直前の頂点、辺 \n\npublic:\n struct edge {\n int to, rev; long long cap; T cost;\n edge(int t = 0, int r = 0, long long ca = 0, T co = 0)\n : to(t), rev(r), cap(ca), cost(co) {}\n };\n\n struct pii {\n T d; int v; //最短距離(費用)、頂点番号\n pii(T d_ = 0, int v_ = 0) : d(d_), v(v_) {}\n\n bool operator<(const pii& other) const {\n if (d != other.d) return d < other.d;\n return v < other.v;\n }\n\n bool operator>(const pii& other) const {\n if (d != other.d) return d > other.d;\n return v > other.v;\n }\n };\n\n int n;\n vector<vector<edge>> to;\n vector<T> pot; //ポテンシャル\n\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\n\n void addedge(int u, int v, long long cap, T cost) {\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap, cost });\n to[v].push_back({ u, su, 0, -cost });\n }\n\n //s->tへ流量fの最小費用流、流せないときは-1\n T mincostflow(int s, int t, long long f) {\n T res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf;\n if (nf * (pot[t] - pot[s]) > 0) return res;\n\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return res;\n }\n\n //s->tへ流量fの最小費用流、流せないときは費用と流せなかった流量のペア\n pair<T, long long> mincostflow_pair(int s, int t, long long f) {\n T res = 0;\n pot.assign(n, 0);\n while (f) {\n priority_queue<pii, vector<pii>, greater<pii>> pq;\n dist.assign(n, inf);\n dist[s] = 0;\n pq.push({ 0, s });\n while (!pq.empty()) {\n pii elem = pq.top();\n pq.pop();\n if (dist[elem.v] < elem.d) continue;\n int sv = (int)to[elem.v].size();\n for (int i = 0; i < sv; i++) {\n edge& nv = to[elem.v][i];\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\n pv[nv.to] = elem.v;\n pe[nv.to] = i;\n pq.push({ dist[nv.to], nv.to });\n }\n }\n\n if (dist[t] == inf) return { res, f }; //流せる最小費用流が存在しない\n\n for (int v = 0; v < n; v++) pot[v] += dist[v];\n\n long long nf = f;\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\n f -= nf; \n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\n for (int v = t; v != s; v = pv[v]) {\n edge& nv = to[pv[v]][pe[v]];\n nv.cap -= nf;\n to[v][nv.rev].cap += nf;\n }\n }\n return { res, f };\n }\n};\n\nint main()\n{\n int n;\n cin >> n;\n vi<int> a(n), b(n);\n rep(i, n) cin >> a[i] >> b[i];\n\n map<int, int> mp;\n rep(i, n) mp[a[i]];\n rep(i, n) mp[b[i]];\n int idx = 0;\n for (auto& elem : mp) elem.second = idx++;\n\n int sz = (int)mp.size();\n\n MCF mcf(n + sz + 2);\n int S = n + sz, T = S + 1;\n\n const ll inf = 1e18;\n rep(i, n) mcf.addedge(S, i, 1, 0);\n rep(j, sz) mcf.addedge(j + n, T, 1, 0);\n\n rep(i, n) {\n mcf.addedge(i, mp[a[i]] + n, 1, -b[i]);\n mcf.addedge(i, mp[b[i]] + n, 1, -a[i]);\n }\n\n auto ans = mcf.mincostflow(S, T, n);\n cout << -ans << endl;\n\n return 0;\n}","accuracy":0.16666666666666666,"time_ms":170,"memory_kb":3888,"score_of_the_acc":-0.1292,"final_rank":19},{"submission_id":"aoj_2293_8721943","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\n\n\n\n\nnamespace zawa {\n\nclass U32Pair {\nprivate:\n static constexpr u32 SHIFT{32};\n static constexpr u32 MASK{static_cast<u32>((1LL << SHIFT) - 1)};\n u64 value_{};\npublic:\n constexpr U32Pair() {}\n constexpr U32Pair(u32 first, u32 second) {\n value_ = (static_cast<u64>(first) << SHIFT) | second;\n }\n constexpr u32 first() const noexcept {\n return static_cast<u32>(value_ >> SHIFT);\n }\n constexpr u32 second() const noexcept {\n return static_cast<u32>(value_ & MASK);\n }\n constexpr u64 combined() const noexcept {\n return value_;\n }\n constexpr U32Pair& operator=(const U32Pair& rhs) {\n value_ = rhs.value_;\n return *this;\n }\n friend constexpr bool operator==(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ == rhs.value_;\n }\n friend constexpr bool operator!=(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ != rhs.value_;\n }\n friend constexpr bool operator<(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ < rhs.value_;\n }\n friend constexpr bool operator<=(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ <= rhs.value_;\n }\n friend constexpr bool operator>(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ > rhs.value_;\n }\n friend constexpr bool operator>=(const U32Pair& lhs, const U32Pair& rhs) {\n return lhs.value_ >= rhs.value_;\n }\n friend std::ostream& operator<<(std::ostream& os, const U32Pair& pair) {\n os << '(' << pair.first() << ',' << pair.second() << ')';\n return os;\n }\n};\n\nstruct U32PairHash {\n usize operator()(const U32Pair& pair) const noexcept {\n return std::hash<u64>{}(pair.combined());\n }\n};\n\n} // namespace zawa\n\n#include <type_traits>\n\nnamespace zawa {\n\ntemplate <class Cap, class Cost>\nclass SuccessiveShortestPath {\npublic:\n static_assert(std::is_signed_v<Cost>, U\"Cost must be signed\");\n static constexpr Cost invalid{(std::numeric_limits<Cost>::max() >> 1) - 1};\n static constexpr u32 reverseId(u32 i) noexcept {\n return i ^ 1;\n }\n\n struct Edge {\n u32 from{}, to{};\n Cap residual{};\n Cost cost{};\n Edge() = default;\n Edge(u32 from, u32 to, const Cap& cap, const Cost& cost)\n : from{from}, to{to}, residual{cap}, cost{cost} {}\n };\n\n usize n_{}, m_{};\n std::vector<Edge> edges_;\n std::vector<std::vector<u32>> g_;\n std::vector<Cost> dist_, potential_;\n std::vector<U32Pair> prev_;\n Cost mcf{};\n\n constexpr usize size() const noexcept {\n return n_;\n }\n constexpr usize edgeSize() const noexcept {\n return m_;\n }\n \n SuccessiveShortestPath() = default;\n SuccessiveShortestPath(usize n, usize m = usize{}) \n : n_{n}, m_{}, edges_{}, g_(n), dist_(n), potential_(n), prev_(n), mcf{} {\n g_.shrink_to_fit();\n dist_.shrink_to_fit();\n potential_.shrink_to_fit();\n prev_.shrink_to_fit();\n edges_.reserve(2 * m);\n }\n\n void emplace(u32 from, u32 to, const Cap& cap, const Cost& cost) {\n g_[from].emplace_back(m_);\n edges_.emplace_back(from, to, cap, cost);\n m_++;\n }\n\n u32 addEdge(u32 from, u32 to, const Cap& cap, const Cost& cost) {\n assert(from < size());\n assert(to < size());\n u32 res{static_cast<u32>(m_)};\n emplace(from, to, cap, cost);\n emplace(to, from, Cap{}, -cost);\n return res;\n }\n\n inline u32 from(u32 i) const noexcept {\n return edges_[i].from;\n }\n inline u32 to(u32 i) const noexcept {\n return edges_[i].to;\n }\n inline const Cap& residual(u32 i) const noexcept {\n return edges_[i].residual;\n }\n inline const Cost& cost(u32 i) const noexcept {\n return edges_[i].cost;\n }\n inline const Cap& flowed(u32 i) const noexcept {\n assert(i < edgeSize());\n return residual(i ^ 1);\n }\n inline const Cap& capcacity(u32 i) const noexcept {\n assert(i < edgeSize());\n return residual(i) + flowed(i);\n }\n\n inline Cost edgeCost(u32 i) const noexcept {\n return potential_[from(i)] + cost(i) - potential_[to(i)];\n }\n bool relax(u32 i) {\n if (residual(i) > 0 and dist_[to(i)] > dist_[from(i)] + edgeCost(i)) {\n dist_[to(i)] = dist_[from(i)] + edgeCost(i);\n prev_[to(i)] = U32Pair{from(i), i};\n return true;\n }\n return false;\n }\n\n bool dijkstra(u32 s, u32 t) {\n assert(s < size());\n assert(t < size());\n std::fill(dist_.begin(), dist_.end(), invalid);\n dist_[s] = Cost{};\n using qt = std::pair<Cost, u32>;\n std::priority_queue<qt, std::vector<qt>, std::greater<qt>> que;\n que.emplace(dist_[s], s);\n while (que.size()) {\n auto [d, v]{que.top()};\n que.pop();\n if (dist_[v] < d) continue;\n for (u32 i : g_[v]) {\n if (relax(i)) {\n que.emplace(dist_[to(i)], to(i));\n }\n }\n }\n return dist_[t] < invalid;\n }\n\n bool dagdp(u32 s, u32 t) {\n assert(s < size());\n assert(t < size());\n std::fill(dist_.begin(), dist_.end(), invalid);\n dist_[s] = Cost{};\n std::vector<u32> ord;\n ord.reserve(size());\n std::vector<bool> vis(size());\n vis[s] = true;\n ord.push_back(s);\n for (u32 i{} ; i < ord.size() ; i++) {\n u32 v{ord[i]};\n for (auto e : g_[v]) {\n if (!vis[to(e)]) {\n ord.push_back(to(e));\n vis[to(e)] = true;\n }\n relax(e);\n }\n }\n return dist_[t] < invalid;\n }\n\n bool bellmanford(u32 s, u32 t) {\n assert(s < size());\n assert(t < size());\n std::fill(dist_.begin(), dist_.end(), invalid);\n dist_[s] = Cost{};\n for (u32 i{} ; i + 1 < size() ; i++) {\n for (u32 j{} ; j < edgeSize() ; j++) {\n relax(j);\n }\n }\n return dist_[t] < invalid;\n }\n\n\n Cap flush(u32 s, u32 t, Cap up = std::numeric_limits<Cap>::max()) {\n for (u32 v{t} ; v != s ; v = prev_[v].first()) {\n up = std::min(up, residual(prev_[v].second()));\n }\n for (u32 v{t} ; v != s ; v = prev_[v].first()) {\n edges_[prev_[v].second()].residual -= up;\n edges_[prev_[v].second() ^ 1].residual += up;\n }\n return up;\n }\n\n bool flow(u32 s, u32 t, Cap flow) {\n assert(s < size());\n assert(t < size());\n while (flow > 0 and dijkstra(s, t)) {\n for (u32 i{} ; i < size() ; i++) {\n potential_[i] = potential_[i] + (dist_[i] == invalid ? Cost{} : dist_[i]);\n }\n Cap water{flush(s, t, flow)};\n mcf += potential_[t] * water;\n flow -= water;\n }\n return flow == 0;\n }\n\n Cap maxflow(u32 s, u32 t) {\n assert(s < size());\n assert(t < size());\n Cap flow{};\n while (dijkstra(s, t)) {\n for (u32 i{} ; i < size() ; i++) {\n potential_[i] = potential_[i] + (dist_[i] == invalid ? Cost{} : dist_[i]);\n }\n Cap water{flush(s, t)};\n mcf += potential_[t] * water;\n flow += water;\n }\n return flow;\n }\n\n struct Line {\n Cap dn{}, up{};\n Cost slope{};\n Line() = default;\n Line(Cap dn, Cap up, Cost slope) : dn{dn}, up{up}, slope{slope} {}\n };\n std::vector<Line> slope(u32 s, u32 t) {\n assert(s < size());\n assert(t < size()); \n Cap flow{};\n std::vector<Line> res;\n while (dijkstra(s, t)) {\n for (u32 i{} ; i < size() ; i++) {\n potential_[i] = potential_[i] + (dist_[i] == invalid ? Cost{} : dist_[i]);\n }\n Cap water{flush(s, t)};\n mcf += potential_[t] * water;\n res.emplace_back(flow, flow + water, potential_[t]);\n flow += water;\n }\n return res;\n }\n\n Cost minCost() const noexcept {\n return mcf;\n }\n};\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\ntemplate <class T>\nclass CompressedSequence {\nprivate:\n std::vector<T> comped_;\n std::vector<u32> f_;\n \npublic:\n CompressedSequence() = default;\n CompressedSequence(const std::vector<T>& A) : comped_(A), f_(A.size()) {\n std::sort(comped_.begin(), comped_.end());\n comped_.erase(std::unique(comped_.begin(), comped_.end()), comped_.end());\n comped_.shrink_to_fit();\n f_.shrink_to_fit();\n for (u32 i{} ; i < A.size() ; i++) {\n f_[i] = std::lower_bound(comped_.begin(), comped_.end(), A[i]) - comped_.begin();\n }\n } \n\n inline usize size() const noexcept {\n return comped_.size();\n }\n\n u32 operator[](const T& v) const {\n return std::lower_bound(comped_.begin(), comped_.end(), v) - comped_.begin();\n }\n\n inline u32 map(u32 i) const noexcept {\n assert(i < f_.size());\n return f_[i];\n }\n\n inline T inverse(u32 i) const noexcept {\n assert(i < size());\n return comped_[i];\n }\n};\n\n} // namespace zawa\nusing namespace zawa;\n\nint main() {\n SetFastIO();\n \n int n; std::cin >> n;\n std::vector<int> a(n), b(n);\n std::vector<int> app(2 * n);\n for (int i{} ; i < n ; i++) {\n std::cin >> a[i] >> b[i];\n app[2 * i] = a[i];\n app[2 * i + 1] = b[i];\n }\n CompressedSequence<int> comp(app);\n int m{(int)comp.size()};\n SuccessiveShortestPath<int, long long> mcf(n + m + 2);\n int source{n + m}, sink{source + 1};\n for (int i{} ; i < n ; i++) {\n mcf.addEdge(source, i, 1, 0);\n }\n for (int i{} ; i < m ; i++) {\n mcf.addEdge(n + i, sink, 1, comp.inverse(i));\n }\n for (int i{} ; i < n ; i++) {\n mcf.addEdge(i, n + comp[a[i]], 1, 0);\n mcf.addEdge(i, n + comp[b[i]], 1, 0);\n mcf.addEdge(i, sink, 1, a[i] + b[i]);\n }\n assert(mcf.flow(source, sink, n));\n long long ans{-mcf.minCost()};\n for (int i{} ; i < n ; i++) {\n ans += a[i] + b[i];\n }\n std::cout << ans << '\\n';\n}","accuracy":1,"time_ms":200,"memory_kb":3976,"score_of_the_acc":-0.1551,"final_rank":13},{"submission_id":"aoj_2293_8521489","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define repd(i,a,b) for (ll i=(a);i<(b);i++)\n#define rep(i,n) repd(i,0,n)\n#define all(x) (x).begin(),(x).end()\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef vector<ll> vec;\nusing Graph = vector<vector<ll>>;\nconst long long INF = 1LL<<60;\nconst long long MOD = 1000000007;\n\n//https://github.com/atcoder/ac-library\n#ifndef ATCODER_INTERNAL_CSR_HPP\n#define ATCODER_INTERNAL_CSR_HPP 1\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#endif // ATCODER_INTERNAL_CSR_HPP\n\n#ifndef ATCODER_INTERNAL_QUEUE_HPP\n#define ATCODER_INTERNAL_QUEUE_HPP 1\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_QUEUE_HPP\n\n#ifndef ATCODER_MINCOSTFLOW_HPP\n#define ATCODER_MINCOSTFLOW_HPP 1\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\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 // inside edge\n struct _edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\n int s,\n int t,\n Cap flow_limit) {\n // variants (C = maxcost):\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\n\n // dual_dist[i] = (dual[i], dist[i])\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\n std::vector<int> prev_e(_n);\n std::vector<bool> vis(_n);\n struct Q {\n Cost key;\n int to;\n bool operator<(Q r) const { return key > r.key; }\n };\n std::vector<int> que_min;\n std::vector<Q> que;\n auto dual_ref = [&]() {\n for (int i = 0; i < _n; i++) {\n dual_dist[i].second = std::numeric_limits<Cost>::max();\n }\n std::fill(vis.begin(), vis.end(), false);\n que_min.clear();\n que.clear();\n\n // que[0..heap_r) was heapified\n size_t heap_r = 0;\n\n dual_dist[s].second = 0;\n que_min.push_back(s);\n while (!que_min.empty() || !que.empty()) {\n int v;\n if (!que_min.empty()) {\n v = que_min.back();\n que_min.pop_back();\n } else {\n while (heap_r < que.size()) {\n heap_r++;\n std::push_heap(que.begin(), que.begin() + heap_r);\n }\n v = que.front().to;\n std::pop_heap(que.begin(), que.end());\n que.pop_back();\n heap_r--;\n }\n if (vis[v]) continue;\n vis[v] = true;\n if (v == t) break;\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\n // dist[v] >= 0 (all reduced cost are positive)\n // dist[v] <= (n-1)C\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto e = g.elist[i];\n if (!e.cap) continue;\n // |-dual[e.to] + dual[v]| <= (n-1)C\n // cost <= C - -(n-1)C + 0 = nC\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\n if (dual_dist[e.to].second - dist_v > cost) {\n Cost dist_to = dist_v + cost;\n dual_dist[e.to].second = dist_to;\n prev_e[e.to] = e.rev;\n if (dist_to == dist_v) {\n que_min.push_back(e.to);\n } else {\n que.push_back(Q{dist_to, e.to});\n }\n }\n }\n }\n if (!vis[t]) {\n return false;\n }\n\n for (int v = 0; v < _n; v++) {\n if (!vis[v]) continue;\n // dual[v] = dual[v] - dist[t] + dist[v]\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +\n // (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,\n // t) + dual[t] + shortest(s, v) = shortest(s, v) -\n // shortest(s, t) >= 0 - (n-1)C\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\n }\n return true;\n };\n Cap flow = 0;\n Cost cost = 0, prev_cost_per_flow = -1;\n std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};\n while (flow < flow_limit) {\n if (!dual_ref()) break;\n Cap c = flow_limit - flow;\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\n }\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n auto& e = g.elist[prev_e[v]];\n e.cap += c;\n g.elist[e.rev].cap -= c;\n }\n Cost d = -dual_dist[s].first;\n flow += c;\n cost += c * d;\n if (prev_cost_per_flow == d) {\n result.pop_back();\n }\n result.push_back({flow, cost});\n prev_cost_per_flow = d;\n }\n return result;\n }\n};\n\n} // namespace atcoder\n\n#endif // ATCODER_MINCOSTFLOW_HPP\n\nusing namespace atcoder;\n\ntemplate <typename T>\nvector<T> compress(vector<T> &X) {\n // ソートした結果を vals に\n vector<T> vals = X;\n sort(vals.begin(), vals.end());\n // 隣り合う重複を削除(unique), 末端のゴミを削除(erase)\n vals.erase(unique(vals.begin(), vals.end()), vals.end());\n // 各要素ごとに二分探索で位置を求める\n for (int i = 0; i < (int)X.size(); i++) {\n X[i] = lower_bound(vals.begin(), vals.end(), X[i]) - vals.begin();\n }\n return vals;\n}\n\nint main()\n{ \n ios::sync_with_stdio(false);\n cin.tie(0);\n ll n;cin>>n;\n vec a(n),b(n);\n rep(i,n)cin>>a[i]>>b[i];\n vec memo;\n rep(i,n){\n memo.push_back(a[i]);\n memo.push_back(b[i]);\n }\n compress(memo);\n mcf_graph<ll,ll> g(n*3+2);\n ll x=1e12;\n rep(i,n){\n g.add_edge(2+i,2+n+memo[2*i],1,x-b[i]);\n g.add_edge(2+i,2+n+memo[2*i+1],1,x-a[i]);\n g.add_edge(0,2+i,1,0);\n g.add_edge(2+n+2*i,1,1,0);\n g.add_edge(2+n+2*i+1,1,1,0);\n }\n g.add_edge(0,1,n,x);\n ll ans=g.flow(0,1,n).second;\n ans%=x;\n ans=x-ans;\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4084,"score_of_the_acc":-0.0147,"final_rank":2},{"submission_id":"aoj_2293_7746496","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing pint = pair<int, int>;\nusing pll = pair<long long, long long>;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n#define REP(i, n) for (long long i = 0; i < (long long)(n); ++i)\n#define REP2(i, a, b) for (long long i = a; i < (long long)(b); ++i)\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, deque<T> P)\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \" \"; } s << P[i]; } return s; }\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\n{ for(auto it : P) { s << \"<\" << it << \"> \"; } return s; }\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\n{ for(auto it : P) { s << \"<\" << it.first << \"->\" << it.second << \"> \"; } return s; }\n\n\n// edge class (for network-flow)\ntemplate<class FLOWTYPE, class COSTTYPE> struct Edge {\n int rev, from, to, id;\n FLOWTYPE cap, icap;\n COSTTYPE cost;\n Edge(int r, int f, int t, FLOWTYPE ca, COSTTYPE co, int id = -1) :\n rev(r), from(f), to(t), cap(ca), icap(ca), cost(co), id(id) {}\n friend ostream& operator << (ostream& s, const Edge& E) {\n if (E.cap > 0)\n return s << E.from << \"->\" << E.to <<\n '(' << E.cap << ',' << E.cost << ')';\n else return s;\n }\n};\n\n// graph class (for network-flow)\ntemplate<class FLOWTYPE, class COSTTYPE> struct Graph {\n vector<vector<Edge<FLOWTYPE, COSTTYPE> > > list;\n \n Graph(int n = 0) : list(n) { }\n void init(int n = 0) { list.clear(); list.resize(n); }\n void reset() { for (int i = 0; i < (int)list.size(); ++i) for (int j = 0; j < list[i].size(); ++j) list[i][j].cap = list[i][j].icap; }\n inline vector<Edge<FLOWTYPE, COSTTYPE> >& operator [] (int i) { return list[i]; }\n inline const size_t size() const { return list.size(); }\n \n inline Edge<FLOWTYPE, COSTTYPE> &redge(const Edge<FLOWTYPE, COSTTYPE> &e) {\n if (e.from != e.to) return list[e.to][e.rev];\n else return list[e.to][e.rev + 1];\n }\n \n void addedge(int from, int to, FLOWTYPE cap, COSTTYPE cost, int id = -1) {\n list[from].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[to].size(), from, to, cap, cost, id));\n list[to].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[from].size() - 1, to, from, 0, -cost));\n }\n \n void add_undirected_edge(int from, int to, FLOWTYPE cap, COSTTYPE cost, int id = -1) {\n list[from].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[to].size(), from, to, cap, cost, id));\n list[to].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[from].size() - 1, to, from, cap, cost, id));\n }\n\n friend ostream& operator << (ostream& s, const Graph& G) {\n s << endl;\n for (int i = 0; i < G.size(); ++i) {\n s << i << \":\";\n for (auto e : G.list[i]) s << \" \" << e;\n s << endl;\n }\n return s;\n }\n};\n\n// min-cost flow (by primal-dual)\ntemplate<class FLOWTYPE, class COSTTYPE> COSTTYPE MinCostFlow(Graph<FLOWTYPE, COSTTYPE> &G, int s, int t, FLOWTYPE f) {\n int n = (int)G.size();\n vector<COSTTYPE> dist(n, -1);\n vector<int> prevv(n), preve(n), seen(n, 0);\n COSTTYPE res = 0;\n while (f > 0) {\n seen.assign(n, 0);\n dist[s] = 0;\n seen[s] = true;\n while (true) {\n bool update = false;\n for (int v = 0; v < n; ++v) {\n if (!seen[v]) continue;\n for (int i = 0; i < G[v].size(); ++i) {\n Edge<FLOWTYPE, COSTTYPE> &e = G[v][i];\n if (e.cap > 0 && (!seen[e.to] || 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 seen[e.to] = true;\n update = true;\n }\n }\n }\n if (!update) break;\n }\n if (!seen[t]) return -1;\n FLOWTYPE 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 += dist[t] * d;\n for (int v = t; v != s; v = prevv[v]) {\n Edge<FLOWTYPE, COSTTYPE> &e = G[prevv[v]][preve[v]];\n Edge<FLOWTYPE, COSTTYPE> &re = G.redge(e);\n e.cap -= d;\n re.cap += d;\n }\n }\n return res;\n}\n\nint main() {\n int N;\n cin >> N;\n vector<int> A(N), B(N), lens;\n for (int i = 0; i < N; ++i) {\n cin >> A[i] >> B[i];\n lens.push_back(A[i]);\n lens.push_back(B[i]);\n }\n sort(lens.begin(), lens.end());\n lens.erase(unique(lens.begin(), lens.end()), lens.end());\n \n // グラフ\n int source = N + lens.size(), sink = N + lens.size() + 1;\n Graph<int,int> G(N + lens.size() + 2);\n \n // ソース → 直方体\n for (int i = 0; i < N; ++i) {\n G.addedge(source, i, 1, 0);\n }\n // 長さ → シンク\n for (int i = 0; i < lens.size(); ++i) {\n G.addedge(i+N, sink, 1, 0);\n }\n // ソース → シンク\n G.addedge(source, sink, N, 0);\n // 直方体 → シンク\n for (int i = 0; i < N; ++i) {\n int aid = lower_bound(lens.begin(), lens.end(), A[i]) - lens.begin();\n int bid = lower_bound(lens.begin(), lens.end(), B[i]) - lens.begin();\n G.addedge(i, aid+N, 1, -B[i]);\n G.addedge(i, bid+N, 1, -A[i]);\n }\n \n int res = -MinCostFlow(G, source, sink, N);\n cout << res << endl;\n}","accuracy":1,"time_ms":180,"memory_kb":3928,"score_of_the_acc":-0.1381,"final_rank":9},{"submission_id":"aoj_2293_7220354","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n\nstruct Edge {\n\tlong long to, cap, cost, rev;\n};\n\nclass MincostFlow {\n\tpublic:\n\tint size_ = 0;\n\tvector<vector<Edge>> G;\n\tvector<long long> Potential;\n\tvector<long long> Dist;\n\tvector<long long> Prev_Verts;\n\tvector<long long> Prev_ID;\n\tvector<bool> Used;\n\t\n\tvoid Initialize(int sz) {\n\t\tsize_ = sz + 2;\n\t\tG.resize(size_, vector<Edge>{});\n\t\tPotential.resize(size_, 0);\n\t\tDist.resize(size_, 0);\n\t\tPrev_Verts.resize(size_, 0);\n\t\tPrev_ID.resize(size_, 0);\n\t\tUsed.resize(size_, false);\n\t}\n\t\n\tvoid add_edge(long long u, long long v, long long f, long long c) {\n\t\t//cout << \"(u, v) = (\" << u << \", \" << v << \"), cap = \" << f << \", cost = \" << c << endl;\n\t\tG[u].push_back(Edge{ v, f, c, (int)G[v].size() });\n\t\tG[v].push_back(Edge{ u, 0LL, -c, (int)G[u].size() - 1 });\n\t}\n\t\n\tlong long mincost_flow(int s, int t, int f, int Mode) {\n\t\tlong long current_ans = 0;\n\t\tif (Mode == 1) {\n\t\t\tfor (int i = 0; i < size_; i++) Potential[i] = 0;\n\t\t}\n\t\t\n\t\t// Loop Phase\n\t\twhile (f > 0) {\n\t\t\tpriority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> Q;\n\t\t\tfor (int i = 0; i < size_; i++) Dist[i] = (1LL << 60);\n\t\t\tfor (int i = 0; i < size_; i++) Prev_Verts[i] = -1;\n\t\t\tfor (int i = 0; i < size_; i++) Prev_ID[i] = -1;\n\t\t\tfor (int i = 0; i < size_; i++) Used[i] = false;\n\t\t\tDist[s] = 0;\n\t\t\tQ.push(make_pair(0, s));\n\t\t\t\n\t\t\t// Dijkstra\n\t\t\twhile (!Q.empty()) {\n\t\t\t\tlong long pos = Q.top().second; Q.pop();\n\t\t\t\tif (Used[pos] == true) continue;\n\t\t\t\tUsed[pos] = true;\n\t\t\t\tfor (int i = 0; i < (int)G[pos].size(); i++) {\n\t\t\t\t\tif (G[pos][i].cap == 0) continue;\n\t\t\t\t\tlong long nex = G[pos][i].to;\n\t\t\t\t\tlong long dst = G[pos][i].cost + Potential[pos] - Potential[nex];\n\t\t\t\t\tif (Dist[nex] > Dist[pos] + dst) {\n\t\t\t\t\t\tDist[nex] = Dist[pos] + dst;\n\t\t\t\t\t\tPrev_Verts[nex] = pos;\n\t\t\t\t\t\tPrev_ID[nex] = i;\n\t\t\t\t\t\tQ.push(make_pair(Dist[nex], nex));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (Dist[t] == (1LL << 60)) break;\n\t\t\t\n\t\t\t// Refresh Edges [Part 1]\n\t\t\tlong long current_pos = t;\n\t\t\tlong long current_min = f;\n\t\t\twhile (current_pos != s) {\n\t\t\t\tint nex = Prev_Verts[current_pos];\n\t\t\t\tint idx = Prev_ID[current_pos];\n\t\t\t\tcurrent_min = min(current_min, G[nex][idx].cap);\n\t\t\t\tcurrent_pos = nex;\n\t\t\t}\n\t\t\tcurrent_ans += 1LL * current_min * (Dist[t] + Potential[t] - Potential[s]);\n\t\t\tf -= current_min;\n\t\t\t\n\t\t\t// Refresh Edges [Part 2]\n\t\t\tcurrent_pos = t;\n\t\t\twhile (current_pos != s) {\n\t\t\t\tint nex = Prev_Verts[current_pos];\n\t\t\t\tint idx = Prev_ID[current_pos];\n\t\t\t\tG[nex][idx].cap -= current_min;\n\t\t\t\tG[G[nex][idx].to][G[nex][idx].rev].cap += current_min;\n\t\t\t\tcurrent_pos = nex;\n\t\t\t}\n\t\t\t\n\t\t\t// Refresh Potential\n\t\t\tfor (int i = 0; i < size_; i++) {\n\t\t\t\tif (Dist[i] != (1LL << 60)) Potential[i] += Dist[i];\n\t\t\t}\n\t\t}\n\t\t\n\t\t// Return\n\t\treturn current_ans;\n\t}\n};\n\nlong long N;\nlong long A[1009], B[1009];\nlong long X[2009], Y[2009];\nvector<long long> Height[1000009];\nMincostFlow Z;\n\nint main() {\n\t// Input\n\tcin >> N;\n\tfor (int i = 1; i <= N; i++) {\n\t\tcin >> A[i] >> B[i];\n\t\tX[i + 0] = A[i]; Y[i + 0] = B[i];\n\t\tX[i + N] = B[i]; Y[i + N] = A[i];\n\t}\n\tfor (int i = 1; i <= 2 * N; i++) Height[X[i]].push_back(i);\n\t\n\t// Build a Graph [Part 1]\n\tZ.Initialize(6 * N + 10);\n\tint Count = 0;\n\tfor (int i = 1; i <= 1000000; i++) {\n\t\tif (Height[i].size() == 0) continue;\n\t\tCount += 1;\n\t\tfor (int j : Height[i]) {\n\t\t\tZ.add_edge(2 * N + Count, j, 1, 0);\n\t\t} \n\t}\n\tfor (int i = 1; i <= N; i++) {\n\t\tZ.add_edge(i + 0, 2 * N + Count + i, 1, 1200000000LL - Y[i + 0]);\n\t\tZ.add_edge(i + N, 2 * N + Count + i, 1, 1200000000LL - Y[i + N]);\n\t}\n\t\n\t// Build a Graph [Part 2]\n\tfor (int i = 1; i <= Count; i++) Z.add_edge(3 * N + Count + 1, 2 * N + i , 1, 0);\n\tfor (int i = 1; i <= N; i++) Z.add_edge(2 * N + Count + i, 3 * N + Count + 2, 1, 0);\n\t\n\t// Get Answer\n\tlong long FinalAns = 0, current_cost = 0;\n\tfor (int i = 1; i <= N; i++) {\n\t\tlong long val = Z.mincost_flow(3 * N + Count + 1, 3 * N + Count + 2, 1, 2);\n\t\tif (val == 0) break;\n\t\tcurrent_cost += val;\n\t\tFinalAns = max(FinalAns, 1200000000LL * i - current_cost);\n\t}\n\t\n\t// Output\n\tcout << FinalAns << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":390,"memory_kb":27780,"score_of_the_acc":-0.8598,"final_rank":17},{"submission_id":"aoj_2293_7220330","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <algorithm>\nusing namespace std;\n\nstruct Edge {\n\tlong long to, cap, cost, rev;\n};\n\nclass MincostFlow {\n\tpublic:\n\tint size_ = 0;\n\tvector<vector<Edge>> G;\n\tvector<long long> Potential;\n\tvector<long long> Dist;\n\tvector<long long> Prev_Verts;\n\tvector<long long> Prev_ID;\n\tvector<bool> Used;\n\t\n\tvoid Initialize(int sz) {\n\t\tsize_ = sz + 2;\n\t\tG.resize(size_, vector<Edge>{});\n\t\tPotential.resize(size_, 0);\n\t\tDist.resize(size_, 0);\n\t\tPrev_Verts.resize(size_, 0);\n\t\tPrev_ID.resize(size_, 0);\n\t\tUsed.resize(size_, false);\n\t}\n\t\n\tvoid add_edge(long long u, long long v, long long f, long long c) {\n\t\t//cout << \"(u, v) = (\" << u << \", \" << v << \"), cap = \" << f << \", cost = \" << c << endl;\n\t\tG[u].push_back(Edge{ v, f, c, (int)G[v].size() });\n\t\tG[v].push_back(Edge{ u, 0LL, -c, (int)G[u].size() - 1 });\n\t}\n\t\n\tlong long mincost_flow(int s, int t, int f, int Mode) {\n\t\tlong long current_ans = 0;\n\t\tif (Mode == 1) {\n\t\t\tfor (int i = 0; i < size_; i++) Potential[i] = 0;\n\t\t}\n\t\t\n\t\t// Loop Phase\n\t\twhile (f > 0) {\n\t\t\tpriority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> Q;\n\t\t\tfor (int i = 0; i < size_; i++) Dist[i] = (1LL << 60);\n\t\t\tfor (int i = 0; i < size_; i++) Prev_Verts[i] = -1;\n\t\t\tfor (int i = 0; i < size_; i++) Prev_ID[i] = -1;\n\t\t\tfor (int i = 0; i < size_; i++) Used[i] = false;\n\t\t\tDist[s] = 0;\n\t\t\tQ.push(make_pair(0, s));\n\t\t\t\n\t\t\t// Dijkstra\n\t\t\twhile (!Q.empty()) {\n\t\t\t\tlong long pos = Q.top().second; Q.pop();\n\t\t\t\tif (Used[pos] == true) continue;\n\t\t\t\tUsed[pos] = true;\n\t\t\t\tfor (int i = 0; i < (int)G[pos].size(); i++) {\n\t\t\t\t\tif (G[pos][i].cap == 0) continue;\n\t\t\t\t\tlong long nex = G[pos][i].to;\n\t\t\t\t\tlong long dst = G[pos][i].cost + Potential[pos] - Potential[nex];\n\t\t\t\t\tif (Dist[nex] > Dist[pos] + dst) {\n\t\t\t\t\t\tDist[nex] = Dist[pos] + dst;\n\t\t\t\t\t\tPrev_Verts[nex] = pos;\n\t\t\t\t\t\tPrev_ID[nex] = i;\n\t\t\t\t\t\tQ.push(make_pair(Dist[nex], nex));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\t// Refresh Edges [Part 1]\n\t\t\tlong long current_pos = t;\n\t\t\tlong long current_min = f;\n\t\t\twhile (current_pos != s) {\n\t\t\t\tint nex = Prev_Verts[current_pos];\n\t\t\t\tint idx = Prev_ID[current_pos];\n\t\t\t\tcurrent_min = min(current_min, G[nex][idx].cap);\n\t\t\t\tcurrent_pos = nex;\n\t\t\t}\n\t\t\tcurrent_ans += 1LL * current_min * (Dist[t] + Potential[t] - Potential[s]);\n\t\t\tf -= current_min;\n\t\t\t\n\t\t\t// Refresh Edges [Part 2]\n\t\t\tcurrent_pos = t;\n\t\t\twhile (current_pos != s) {\n\t\t\t\tint nex = Prev_Verts[current_pos];\n\t\t\t\tint idx = Prev_ID[current_pos];\n\t\t\t\tG[nex][idx].cap -= current_min;\n\t\t\t\tG[G[nex][idx].to][G[nex][idx].rev].cap += current_min;\n\t\t\t\tcurrent_pos = nex;\n\t\t\t}\n\t\t\t\n\t\t\t// Refresh Potential\n\t\t\tif (Dist[t] == (1LL << 60)) break;\n\t\t\tfor (int i = 0; i < size_; i++) {\n\t\t\t\tif (Dist[i] != (1LL << 60)) Potential[i] += Dist[i];\n\t\t\t}\n\t\t}\n\t\t\n\t\t// Return\n\t\treturn current_ans;\n\t}\n};\n\nlong long N;\nlong long A[1009], B[1009];\nlong long X[2009], Y[2009];\nvector<long long> Height[1000009];\nMincostFlow Z;\n\nint main() {\n\t// Input\n\tcin >> N;\n\tfor (int i = 1; i <= N; i++) {\n\t\tcin >> A[i] >> B[i];\n\t\tX[i + 0] = A[i]; Y[i + 0] = B[i];\n\t\tX[i + N] = B[i]; Y[i + N] = A[i];\n\t}\n\tfor (int i = 1; i <= 2 * N; i++) Height[X[i]].push_back(i);\n\t\n\t// Build a Graph [Part 1]\n\tZ.Initialize(6 * N + 10);\n\tint Count = 0;\n\tfor (int i = 1; i <= 1000000; i++) {\n\t\tif (Height[i].size() == 0) continue;\n\t\tCount += 1;\n\t\tfor (int j : Height[i]) {\n\t\t\tZ.add_edge(2 * N + Count, j, 1, 0);\n\t\t} \n\t}\n\tfor (int i = 1; i <= N; i++) {\n\t\tZ.add_edge(i + 0, 2 * N + Count + i, 1, 1200000000LL - Y[i + 0]);\n\t\tZ.add_edge(i + N, 2 * N + Count + i, 1, 1200000000LL - Y[i + N]);\n\t}\n\t\n\t// Build a Graph [Part 2]\n\tfor (int i = 1; i <= Count; i++) Z.add_edge(3 * N + Count + 1, 2 * N + i , 1, 0);\n\tfor (int i = 1; i <= N; i++) Z.add_edge(2 * N + Count + i, 3 * N + Count + 2, 1, 0);\n\t\n\t// Get Answer\n\tlong long FinalAns = 0, current_cost = 0;\n\tfor (int i = 1; i <= N; i++) {\n\t\tlong long val = Z.mincost_flow(3 * N + Count + 1, 3 * N + Count + 2, 1, 2);\n\t\tif (val == 0) break;\n\t\tcurrent_cost += val;\n\t\tFinalAns = max(FinalAns, 1200000000LL * i - current_cost);\n\t}\n\t\n\t// Output\n\tcout << FinalAns << endl;\n\treturn 0;\n}","accuracy":0.16666666666666666,"time_ms":360,"memory_kb":27688,"score_of_the_acc":-0.8339,"final_rank":20},{"submission_id":"aoj_2293_7151828","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <class F, class C> struct primal_dual {\n struct edge {\n int to;\n F cap;\n C cost;\n int rev;\n bool is_rev;\n };\n\n int n;\n vector<vector<edge>> g;\n vector<C> pot, d;\n vector<int> pv, pe;\n const C inf = numeric_limits<C>::max();\n\n primal_dual(int nn) : n(nn), g(nn) {}\n\n void add_edge(int from, int to, F cap, C cost) {\n g[from].push_back({to, cap, cost, (int)g[to].size(), false});\n g[to].push_back({from, 0, -cost, (int)g[from].size() - 1, true});\n }\n\n vector<pair<F, C>> min_cost_flow(int s, int t, F f_lim = numeric_limits<F>::max()) {\n F f = 0;\n C c = 0, cf = -1;\n vector<pair<F, C>> res = {{0, 0}};\n priority_queue<pair<C, int>, vector<pair<C, int>>, greater<pair<C, int>>> pq;\n pot.assign(n, 0);\n pe.assign(n, -1);\n pv.assign(n, -1);\n while (f < f_lim) {\n d.assign(n, inf);\n pq.emplace(0, s);\n d[s] = 0;\n while (!pq.empty()) {\n auto p = pq.top();\n C dv = p.first;\n int v = p.second;\n pq.pop();\n if (d[v] != dv) continue;\n for (int i = 0; i < (int)g[v].size(); i++) {\n auto& e = g[v][i];\n C nd = d[v] + e.cost + pot[v] - pot[e.to];\n if (e.cap > 0 and d[e.to] > nd) {\n d[e.to] = nd;\n pv[e.to] = v;\n pe[e.to] = i;\n pq.emplace(d[e.to], e.to);\n }\n }\n }\n if (d[t] == inf) break;\n for (int i = 0; i < n; i++) pot[i] += d[i];\n F add = f_lim - f;\n for (int v = t; v != s; v = pv[v]) {\n add = min(add, g[pv[v]][pe[v]].cap);\n }\n for (int v = t; v != s; v = pv[v]) {\n auto& e = g[pv[v]][pe[v]];\n e.cap -= add;\n g[v][e.rev].cap += add;\n }\n f += add;\n c += add * pot[t];\n if (cf == pot[t]) {\n res.pop_back();\n }\n cf = pot[t];\n res.emplace_back(f, c);\n }\n return res;\n }\n};\n\nconstexpr int MAX = 1000010;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int N;\n cin >> N;\n vector<int> A(N), B(N), C;\n for (int i = 0; i < N; i++) {\n cin >> A[i] >> B[i];\n C.emplace_back(A[i]);\n C.emplace_back(B[i]);\n }\n\n sort(C.begin(), C.end());\n C.erase(unique(C.begin(), C.end()), C.end());\n vector<int> idx(MAX, -1);\n int M = C.size();\n for (int i = 0; i < M; i++) idx[C[i]] = i;\n int s = N + M, t = s + 1;\n primal_dual<int, int> mcf(t + 1);\n for (int i = 0; i < N; i++) {\n mcf.add_edge(s, i, 1, 0);\n mcf.add_edge(i, N + idx[A[i]], 1, MAX - B[i]);\n mcf.add_edge(i, N + idx[B[i]], 1, MAX - A[i]);\n mcf.add_edge(i, t, 1, MAX);\n }\n for (int i = 0; i < M; i++) mcf.add_edge(N + i, t, 1, 0);\n int ans = MAX * N - mcf.min_cost_flow(s, t).back().second;\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":190,"memory_kb":7584,"score_of_the_acc":-0.2311,"final_rank":16},{"submission_id":"aoj_2293_7100339","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\nnamespace atcoder {\n\ntemplate <class Cap, class Cost> struct mcf_graph {\n public:\n mcf_graph() {}\n mcf_graph(int n) : _n(n), g(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 int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n g[from].push_back(_edge{to, int(g[to].size()), cap, cost});\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0, -cost});\n return m;\n }\n\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(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{\n pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,\n };\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result(m);\n for (int i = 0; i < m; i++) {\n result[i] = get_edge(i);\n }\n return result;\n }\n\n std::pair<Cap, Cost> flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\n return slope(s, t, flow_limit).back();\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\n return slope(s, t, std::numeric_limits<Cap>::max());\n }\n std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n // variants (C = maxcost):\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\n std::vector<Cost> dual(_n, 0), dist(_n);\n std::vector<int> pv(_n), pe(_n);\n std::vector<bool> vis(_n);\n auto dual_ref = [&]() {\n std::fill(dist.begin(), dist.end(),\n std::numeric_limits<Cost>::max());\n std::fill(pv.begin(), pv.end(), -1);\n std::fill(pe.begin(), pe.end(), -1);\n std::fill(vis.begin(), vis.end(), false);\n struct Q {\n Cost key;\n int to;\n bool operator<(Q r) const { return key > r.key; }\n };\n std::priority_queue<Q> que;\n dist[s] = 0;\n que.push(Q{0, s});\n while (!que.empty()) {\n int v = que.top().to;\n que.pop();\n if (vis[v]) continue;\n vis[v] = true;\n if (v == t) break;\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\n // dist[v] >= 0 (all reduced cost are positive)\n // dist[v] <= (n-1)C\n for (int i = 0; i < int(g[v].size()); i++) {\n auto e = g[v][i];\n if (vis[e.to] || !e.cap) continue;\n // |-dual[e.to] + dual[v]| <= (n-1)C\n // cost <= C - -(n-1)C + 0 = nC\n Cost cost = e.cost - dual[e.to] + dual[v];\n if (dist[e.to] - dist[v] > cost) {\n dist[e.to] = dist[v] + cost;\n pv[e.to] = v;\n pe[e.to] = i;\n que.push(Q{dist[e.to], e.to});\n }\n }\n }\n if (!vis[t]) {\n return false;\n }\n\n for (int v = 0; v < _n; v++) {\n if (!vis[v]) continue;\n // dual[v] = dual[v] - dist[t] + dist[v]\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) + (shortest(s, v) + dual[s] - dual[v])\n // = - shortest(s, t) + dual[t] + shortest(s, v)\n // = shortest(s, v) - shortest(s, t) >= 0 - (n-1)C\n dual[v] -= dist[t] - dist[v];\n }\n return true;\n };\n Cap flow = 0;\n Cost cost = 0, prev_cost = -1;\n std::vector<std::pair<Cap, Cost>> result;\n result.push_back({flow, cost});\n while (flow < flow_limit) {\n if (!dual_ref()) break;\n Cap c = flow_limit - flow;\n for (int v = t; v != s; v = pv[v]) {\n c = std::min(c, g[pv[v]][pe[v]].cap);\n }\n for (int v = t; v != s; v = pv[v]) {\n auto& e = g[pv[v]][pe[v]];\n e.cap -= c;\n g[v][e.rev].cap += c;\n }\n Cost d = -dual[s];\n flow += c;\n cost += c * d;\n if (prev_cost == d) {\n result.pop_back();\n }\n result.push_back({flow, cost});\n prev_cost = cost;\n }\n return result;\n }\n\n private:\n int _n;\n\n struct _edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\nusing namespace std;\nusing namespace atcoder;\nconst long long inf = 1LL << 40;\n\n\n\nvoid solve(){\n\tint n;\n\tcin >> n;\n\tvector<long long> A(n), B(n);\n\tset<long long> se;\n\tfor(int i = 0; i < n; i++){\n\t\tcin >> A[i] >> B[i];\n\t\tse.insert(A[i]);\n\t\tse.insert(B[i]);\n\t}\n\tmap<long long, int> mp;\n\tint ind = 0;\n\tfor(auto s:se){\n\t\tmp[s] = ind++;\n\t}\n\n\tint m = ind;\n\tmcf_graph<int, long long> G(n + m + 2);\n\tint s = n + m;\n\tint t = s + 1;\n\tfor(int i = 0; i < n; i++){\n\t\tG.add_edge(s, i, 1, 0);\n\t\tG.add_edge(i, t, 1, inf);\n\t}\n\tfor(int j = 0; j < m; j++) G.add_edge(n + j, t, 1, 0);\n\tfor(int i = 0; i < n; i++){\n\t\tG.add_edge(i, n + mp[A[i]], 1, inf - B[i]);\n\t\tG.add_edge(i, n + mp[B[i]], 1, inf - A[i]);\n\t}\n\tauto tmp = G.flow(s, t);\n\tlong long ans = inf * tmp.first - tmp.second;\n\tcout << ans << \"\\n\";\n}\n\nint main(){\n\tcin.tie(0)->sync_with_stdio(0);\n\tint t;\n\tt = 1;\n\t// cin >> t;\n\twhile(t--) solve();\n}","accuracy":1,"time_ms":40,"memory_kb":4216,"score_of_the_acc":-0.0337,"final_rank":5},{"submission_id":"aoj_2293_7070454","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; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\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>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\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);\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nconst vi DY = { 0, 1, 0, -1 };\nint INF = 1001001001; ll INFL = 4004004004004004004LL;\ndouble EPS = 1e-12;\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 < (1 << int(d)); ++set) // d ビット全探索（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\n\n// 汎用関数の定義\ntemplate <class T> inline ll pow(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 を返す）\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// 手元環境（Visual Studio）\n#ifdef _MSC_VER\n#include \"local.hpp\"\n// 提出用（gcc）\n#else\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) : -1; }\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\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 gcd __gcd\n#define dump(...)\n#define dumpel(v)\n#define dump_list(v)\n#define input_from_file(f)\n#define output_to_file(f)\n#define Assert(b) { if (!(b)) while (1) cout << \"OLE\"; }\n#endif\n\n#endif // 折りたたみ用\n\n\n////--------------AtCoder 専用--------------\n//#include <atcoder/all>\n//using namespace atcoder;\n//\n////using mint = modint1000000007;\n//using mint = modint998244353;\n////using mint = modint; // mint::set_mod(m);\n//\n//istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n//ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\n//using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\n////----------------------------------------\n\n\n#ifndef ATCODER_INTERNAL_CSR_HPP\n#define ATCODER_INTERNAL_CSR_HPP 1\n\n#include <algorithm>\n#include <utility>\n#include <vector>\n\nnamespace atcoder {\n namespace internal {\n\n template <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#endif // ATCODER_INTERNAL_CSR_HPP\n\n\n#ifndef ATCODER_INTERNAL_QUEUE_HPP\n#define ATCODER_INTERNAL_QUEUE_HPP 1\n\n#include <vector>\n\nnamespace atcoder {\n\n namespace internal {\n\n template <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n };\n\n } // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_QUEUE_HPP\n\n\n#ifndef ATCODER_MINCOSTFLOW_HPP\n#define ATCODER_MINCOSTFLOW_HPP 1\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\nnamespace atcoder {\n\n template <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 // inside edge\n struct _edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\n int s,\n int t,\n Cap flow_limit) {\n // variants (C = maxcost):\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\n\n // dual_dist[i] = (dual[i], dist[i])\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\n std::vector<int> prev_e(_n);\n std::vector<bool> vis(_n);\n struct Q {\n Cost key;\n int to;\n bool operator<(Q r) const { return key > r.key; }\n };\n std::vector<int> que_min;\n std::vector<Q> que;\n auto dual_ref = [&]() {\n for (int i = 0; i < _n; i++) {\n dual_dist[i].second = std::numeric_limits<Cost>::max();\n }\n std::fill(vis.begin(), vis.end(), false);\n que_min.clear();\n que.clear();\n\n // que[0..heap_r) was heapified\n size_t heap_r = 0;\n\n dual_dist[s].second = 0;\n que_min.push_back(s);\n while (!que_min.empty() || !que.empty()) {\n int v;\n if (!que_min.empty()) {\n v = que_min.back();\n que_min.pop_back();\n }\n else {\n while (heap_r < que.size()) {\n heap_r++;\n std::push_heap(que.begin(), que.begin() + heap_r);\n }\n v = que.front().to;\n std::pop_heap(que.begin(), que.end());\n que.pop_back();\n heap_r--;\n }\n if (vis[v]) continue;\n vis[v] = true;\n if (v == t) break;\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\n // dist[v] >= 0 (all reduced cost are positive)\n // dist[v] <= (n-1)C\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto e = g.elist[i];\n if (!e.cap) continue;\n // |-dual[e.to] + dual[v]| <= (n-1)C\n // cost <= C - -(n-1)C + 0 = nC\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\n if (dual_dist[e.to].second - dist_v > cost) {\n Cost dist_to = dist_v + cost;\n dual_dist[e.to].second = dist_to;\n prev_e[e.to] = e.rev;\n if (dist_to == dist_v) {\n que_min.push_back(e.to);\n }\n else {\n que.push_back(Q{ dist_to, e.to });\n }\n }\n }\n }\n if (!vis[t]) {\n return false;\n }\n\n for (int v = 0; v < _n; v++) {\n if (!vis[v]) continue;\n // dual[v] = dual[v] - dist[t] + dist[v]\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +\n // (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,\n // t) + dual[t] + shortest(s, v) = shortest(s, v) -\n // shortest(s, t) >= 0 - (n-1)C\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\n }\n return true;\n };\n Cap flow = 0;\n Cost cost = 0, prev_cost_per_flow = -1;\n std::vector<std::pair<Cap, Cost>> result = { {Cap(0), Cost(0)} };\n while (flow < flow_limit) {\n if (!dual_ref()) break;\n Cap c = flow_limit - flow;\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\n }\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n auto& e = g.elist[prev_e[v]];\n e.cap += c;\n g.elist[e.rev].cap -= c;\n }\n Cost d = -dual_dist[s].first;\n flow += c;\n cost += c * d;\n if (prev_cost_per_flow == d) {\n result.pop_back();\n }\n result.push_back({ flow, cost });\n prev_cost_per_flow = d;\n }\n return result;\n }\n };\n\n} // namespace atcoder\n\n#endif // ATCODER_MINCOSTFLOW_HPP\n\n\nusing namespace atcoder;\n\n\n//【最小費用流（負コスト可，負コスト閉路なし）】\n/*\n* Negative_mcf_graph(int n) : O(1)\n*\tn 頂点で初期化する．\n* \n* add_edge(int s, int t, ll cap, ll cost) : O(1)\n*\ts から t へ容量 cap，コスト cost の辺を追加する．\n* \n* pll flow(int ST, int GL, ll f_lim = INFL) : O(F (n + m) log n)（F:流量，m:辺の数）\n*\tST から GL まで flow_limit まで流せるだけ流したときの {流量, 最小コスト} を返す．\n*\t制約：負コストの閉路は存在しない\n*/\nstruct Negative_mcf_graph {\n\t// 参考 : https://ikatakos.com/pot/programming_algorithm/graph_theory/minimum_cost_flow\n\n\t// n : 頂点数\n\tint n;\n\n\t// 辺\n\tstruct Edge {\n\t\tint to;\n\t\tll cap, cost;\n\n\t\tEdge(int to_, ll cap_, ll cost_) : to(to_), cap(cap_), cost(cost_) {}\n\t};\n\n\t// 元のグラフ（負辺あり）\n\tvector<vector<Edge>> g;\n\n\t// pot[s] : 頂点 s のポテンシャル\n\tvl pot;\n\n\t// n 頂点で初期化する．\n\tNegative_mcf_graph(int n_) : n(n_), g(n), pot(n, INFL) {}\n\n\t// s から t へ容量 cap，コスト cost の辺を追加する．\n\tvoid add_edge(int s, int t, ll cap, ll cost) {\n\t\t// verify : https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_h\n\t\t\n\t\tg[s].emplace_back(t, cap, cost);\n\t}\n\n\t// ベルマンフォード法で ST からの距離を求め，それをポテンシャルとする．\n\tbool bellman_ford(int ST) {\n\t\tpot[ST] = 0;\n\n\t\trep(i, n) {\n\t\t\tbool updated = false;\n\n\t\t\t// 全ての辺についての操作\n\t\t\trep(s, n) repe(e, g[s]) {\n\t\t\t\t// もし (始点への距離) + (辺のコスト) < (終点への距離) なら (終点への距離) を更新する．\n\t\t\t\t// INFL からは何を引いても INFL になるようにしているので，ST から到達可能な負閉路しか検出しない．\n\t\t\t\tif (pot[s] != INFL && pot[s] + e.cost < pot[e.to]) {\n\t\t\t\t\tpot[e.to] = pot[s] + e.cost;\n\t\t\t\t\tupdated = true;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// もし距離の更新が起こらなければ最短距離確定\n\t\t\tif (!updated) return true;\n\t\t}\n\n\t\t// もし全ての辺についての操作を n 回繰り返しても距離の更新があったなら，\n\t\t// ST から到達可能な負の閉路を持っているので false を返す．\n\t\treturn false;\n\t}\n\n\t// ST から GL まで flow_limit まで流せるだけ流したときの {流量, 最小コスト} を返す．\n\tpll flow(int ST, int GL, ll f_lim = INFL) {\n\t\t// verify : https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_h\n\n\t\t// ベルマンフォード法で ST から v までの距離を求め，それをポテンシャル pot[v] とする．\n\t\tbool non_neg_cyc = bellman_ford(ST);\n\t\tAssert(non_neg_cyc);\n\n\t\t// g_pos : 辺 s→t のコストが (元の辺のコスト) - (pot[t] - pot[s]) >= 0 であるようなグラフ\n\t\tmcf_graph<ll, ll> g_pos(n);\n\t\trep(s, n) repe(e, g[s]) {\n\t\t\tg_pos.add_edge(s, e.to, e.cap, e.cost - (pot[e.to] - pot[s]));\n\t\t}\n\n\t\t// g_pos の最小費用流を求める．\n\t\tll cap, cost;\n\t\ttie(cap, cost) = g_pos.flow(ST, GL, f_lim);\n\n\t\t// 実際のコストは (流量) * pot[GL] を加えたものになる．\n\t\tcost += cap * pot[GL];\n\n\t\treturn make_pair(cap, cost);\n\t}\n};\n\n\nint main() {\n//\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\t\n\tint n;\n\tcin >> n;\n\n\tvl a(n), b(n);\n\trep(i, n) cin >> a[i] >> b[i];\n\n\tvector<tuple<ll, ll, int>> whi(2 * n);\n\tunordered_map<ll, int> w_to_id; int id = 0;\n\n\trep(i, n) {\n\t\twhi[2 * i] = { a[i], b[i], i };\n\t\tif (!w_to_id.count(a[i])) w_to_id[a[i]] = id++;\n\n\t\twhi[2 * i + 1] = { b[i], a[i], i };\n\t\tif (!w_to_id.count(b[i])) w_to_id[b[i]] = id++;\n\t}\n\n\tsort(all(whi));\n\n\tint ST = n + (2 * n) + id, GL = ST + 1;\n\tNegative_mcf_graph g(GL + 1);\n\n\trep(i, n) g.add_edge(ST, i, 1, 0);\n\trep(t, 2 * n) {\n\t\tll w, h; int i;\n\t\ttie(w, h, i) = whi[t];\n\n\t\tg.add_edge(i, n + t, 1, 0);\n\t\tg.add_edge(n + t, n + 2 * n + w_to_id[w], 1, -h);\n\t}\n\trep(j, id) g.add_edge(n + 2 * n + j, GL, 1, 0);\n\n\t// グラフ内にフローを流さなくてもいいように側溝を用意する．\n\tg.add_edge(ST, GL, INFL, 0);\n\n\tll cap, cost;\n\ttie(cap, cost) = g.flow(ST, GL, n);\n\tdump(cap, cost);\n\n\tcout << -cost << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":4728,"score_of_the_acc":-0.0456,"final_rank":6},{"submission_id":"aoj_2293_6900014","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate< typename flow_t, typename cost_t >\nstruct PrimalDual {\n const cost_t INF;\n \n struct edge {\n int to;\n flow_t cap;\n cost_t cost;\n int rev;\n bool isrev;\n };\n vector< vector< edge > > graph;\n vector< cost_t > potential, min_cost;\n vector< int > prevv, preve;\n \n PrimalDual(int V) : graph(V), INF(numeric_limits< cost_t >::max()) {}\n \n void add_edge(int from, int to, flow_t cap, cost_t cost) {\n graph[from].emplace_back((edge) {to, cap, cost, (int) graph[to].size(), false});\n graph[to].emplace_back((edge) {from, 0, -cost, (int) graph[from].size() - 1, true});\n }\n \n cost_t min_cost_flow(int s, int t, flow_t f) {\n int V = (int) graph.size();\n cost_t ret = 0;\n using Pi = pair< cost_t, int >;\n priority_queue< Pi, vector< Pi >, greater< Pi > > que;\n potential.assign(V, 0);\n preve.assign(V, -1);\n prevv.assign(V, -1);\n \n while(f > 0) {\n min_cost.assign(V, INF);\n que.emplace(0, s);\n min_cost[s] = 0;\n while(!que.empty()) {\n Pi p = que.top();\n que.pop();\n if(min_cost[p.second] < p.first) continue;\n for(int i = 0; i < graph[p.second].size(); i++) {\n edge &e = graph[p.second][i];\n cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];\n if(e.cap > 0 && min_cost[e.to] > nextCost) {\n min_cost[e.to] = nextCost;\n prevv[e.to] = p.second, preve[e.to] = i;\n que.emplace(min_cost[e.to], e.to);\n }\n }\n }\n if(min_cost[t] == INF) return -1;\n for(int v = 0; v < V; v++) potential[v] += min_cost[v];\n flow_t addflow = f;\n for(int v = t; v != s; v = prevv[v]) {\n addflow = min(addflow, graph[prevv[v]][preve[v]].cap);\n }\n f -= addflow;\n ret += addflow * potential[t];\n for(int v = t; v != s; v = prevv[v]) {\n edge &e = graph[prevv[v]][preve[v]];\n e.cap -= addflow;\n graph[v][e.rev].cap += addflow;\n }\n }\n return ret;\n }\n};\n\nint main() {\n int N;\n cin >> N;\n vector<int>A(N),B(N),C(1000001);\n PrimalDual<int,int>flow(N*4+1000000+2);\n int S = N*4+1000000,T = S+1;\n int ans = 0;\n for(int i = 0; i < N; i++) {\n cin >> A[i] >> B[i];\n C[A[i]] = C[B[i]] = 1;\n ans += max(A[i],B[i]);\n flow.add_edge(S,i,1,0);\n flow.add_edge(i,N+i,1,max(A[i],B[i]));\n flow.add_edge(i,2*N+i,1,max(A[i],B[i])-min(A[i],B[i]));\n flow.add_edge(i,3*N+i,1,0);\n flow.add_edge(N+i,T,1,0);\n flow.add_edge(2*N+i,4*N+max(A[i],B[i])-1,1,0);\n flow.add_edge(3*N+i,4*N+min(A[i],B[i])-1,1,0);\n }\n for(int i = 1; i <= 1000000; i++) {\n if(C[i]) {\n flow.add_edge(4*N+i-1,T,1,0);\n }\n }\n cout << ans-flow.min_cost_flow(S,T,N) << endl;\n}","accuracy":1,"time_ms":1270,"memory_kb":46764,"score_of_the_acc":-2,"final_rank":18},{"submission_id":"aoj_2293_6459083","code_snippet":"#line 1 \"a.cpp\"\n/**\n *\tauthor: nok0\n *\tcreated: 2022.04.06 21:05:07\n**/\n#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) / 2;\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 7 \"/Users/nok0/Documents/Programming/nok0/graph/mincost_b_flow.hpp\"\n\nenum Objective {\n\tMINIMIZE = 1,\n\tMAXIMIZE = -1,\n};\nenum class Status {\n\tOPTIMAL,\n\tINFEASIBLE,\n};\n\ntemplate <class Flow, class Cost, Objective objective = Objective::MINIMIZE, Flow SCALING_FACTOR = 2>\nstruct MinCostFlow {\nprivate:\n\tusing V_id = uint32_t;\n\tusing E_id = uint32_t;\n\n\tstruct Edge {\n\t\tfriend struct MinCostFlow;\n\n\tprivate:\n\t\tV_id src, dst;\n\t\tFlow flow, cap;\n\t\tCost cost;\n\t\tE_id rev;\n\n\tpublic:\n\t\tEdge() = default;\n\n\t\tEdge(const V_id src, const V_id dst, const Flow cap, const Cost cost,\n\t\t const E_id rev)\n\t\t : src(src), dst(dst), flow(0), cap(cap), cost(cost), rev(rev) {}\n\n\t\t[[nodiscard]] Flow residual_cap() const { return cap - flow; }\n\t};\n\npublic:\n\tstruct EdgePtr {\n\t\tfriend struct MinCostFlow;\n\n\tprivate:\n\t\tconst MinCostFlow *instance;\n\t\tconst V_id v;\n\t\tconst E_id e;\n\n\t\tEdgePtr(const MinCostFlow *instance, const V_id v, const E_id e)\n\t\t : instance(instance), v(v), e(e) {}\n\n\t\t[[nodiscard]] const Edge &edge() const { return instance->g[v][e]; }\n\n\t\t[[nodiscard]] const Edge &rev() const {\n\t\t\tconst Edge &e = edge();\n\t\t\treturn instance->g[e.dst][e.rev];\n\t\t}\n\n\tpublic:\n\t\t[[nodiscard]] V_id src() const { return rev().dst; }\n\n\t\t[[nodiscard]] V_id dst() const { return edge().dst; }\n\n\t\t[[nodiscard]] Flow flow() const { return edge().flow; }\n\n\t\t[[nodiscard]] Flow lower() const { return -rev().cap; }\n\n\t\t[[nodiscard]] Flow upper() const { return edge().cap; }\n\n\t\t[[nodiscard]] Cost cost() const { return edge().cost; }\n\n\t\t[[nodiscard]] Cost gain() const { return -edge().cost; }\n\t};\n\nprivate:\n\tV_id n;\n\tstd::vector<std::vector<Edge>> g;\n\tstd::vector<Flow> b;\n\npublic:\n\tMinCostFlow() : n(0) {}\n\n\tV_id add_vertex() {\n\t\t++n;\n\t\tg.resize(n);\n\t\tb.resize(n);\n\t\treturn n - 1;\n\t}\n\n\tstd::vector<V_id> add_vertices(const size_t size) {\n\t\tstd::vector<V_id> ret;\n\t\tfor(V_id i = 0; i < size; ++i) ret.emplace_back(n + i);\n\t\tn += size;\n\t\tg.resize(n);\n\t\tb.resize(n);\n\t\treturn ret;\n\t}\n\n\tEdgePtr add_edge(const V_id src, const V_id dst, const Flow lower, const Flow upper, const Cost cost) {\n\t\tconst E_id e = g[src].size(), re = src == dst ? e + 1 : g[dst].size();\n\t\tassert(lower <= upper);\n\t\tg[src].emplace_back(Edge{src, dst, upper, cost * objective, re});\n\t\tg[dst].emplace_back(Edge{dst, src, -lower, -cost * objective, e});\n\t\treturn EdgePtr{this, src, e};\n\t}\n\n\tvoid add_supply(const V_id v, const Flow amount) { b[v] += amount; }\n\n\tvoid add_demand(const V_id v, const Flow amount) { b[v] -= amount; }\n\nprivate:\n\tstatic Cost constexpr unreachable = std::numeric_limits<Cost>::max();\n\tCost farthest;\n\tstd::vector<Cost> potential;\n\tstd::vector<Cost> dist;\n\tstd::vector<Edge *> parent;\n\tstd::priority_queue<std::pair<Cost, int>, std::vector<std::pair<Cost, int>>, std::greater<>> pq;\n\tstd::vector<V_id> excess_vs, deficit_vs;\n\n\tEdge &rev(const Edge &e) { return g[e.dst][e.rev]; }\n\n\tvoid push(Edge &e, const Flow amount) {\n\t\te.flow += amount;\n\t\tg[e.dst][e.rev].flow -= amount;\n\t}\n\n\tCost residual_cost(const V_id src, const V_id dst, const Edge &e) {\n\t\treturn e.cost + potential[src] - potential[dst];\n\t}\n\n\tbool dual(const Flow delta) {\n\t\tdist.assign(n, unreachable);\n\t\tparent.assign(n, nullptr);\n\t\texcess_vs.erase(std::remove_if(std::begin(excess_vs), std::end(excess_vs), [&](const V_id v) { return b[v] < delta; }), std::end(excess_vs));\n\t\tdeficit_vs.erase(std::remove_if(std::begin(deficit_vs), std::end(deficit_vs), [&](const V_id v) { return b[v] > -delta; }), std::end(deficit_vs));\n\t\tfor(const auto v : excess_vs) pq.emplace(dist[v] = 0, v);\n\t\tfarthest = 0;\n\t\tstd::size_t deficit_count = 0;\n\t\twhile(!pq.empty()) {\n\t\t\tconst auto [d, u] = pq.top();\n\t\t\tpq.pop();\n\t\t\tif(dist[u] < d) continue;\n\t\t\tfarthest = d;\n\t\t\tif(b[u] <= -delta) ++deficit_count;\n\t\t\tif(deficit_count >= deficit_vs.size()) break;\n\t\t\tfor(auto &e : g[u]) {\n\t\t\t\tif(e.residual_cap() < delta) continue;\n\t\t\t\tconst auto v = e.dst;\n\t\t\t\tconst auto new_dist = d + residual_cost(u, v, e);\n\t\t\t\tif(new_dist >= dist[v]) continue;\n\t\t\t\tpq.emplace(dist[v] = new_dist, v);\n\t\t\t\tparent[v] = &e;\n\t\t\t}\n\t\t}\n\t\tpq = decltype(pq)();\n\t\tfor(V_id v = 0; v < n; ++v) {\n\t\t\tpotential[v] += std::min(dist[v], farthest);\n\t\t}\n\t\treturn deficit_count > 0;\n\t}\n\n\tvoid primal(const Flow delta) {\n\t\tfor(const auto t : deficit_vs) {\n\t\t\tif(dist[t] > farthest) continue;\n\t\t\tFlow f = -b[t];\n\t\t\tV_id v;\n\t\t\tfor(v = t; parent[v] != nullptr && f >= delta; v = parent[v]->src) {\n\t\t\t\tf = std::min(f, parent[v]->residual_cap());\n\t\t\t}\n\t\t\tf = std::min(f, b[v]);\n\t\t\tif(f < delta) continue;\n\t\t\tfor(v = t; parent[v] != nullptr;) {\n\t\t\t\tauto &e = *parent[v];\n\t\t\t\tpush(e, f);\n\t\t\t\tconst size_t u = parent[v]->src;\n\t\t\t\tparent[v] = nullptr;\n\t\t\t\tv = u;\n\t\t\t}\n\t\t\tb[t] += f;\n\t\t\tb[v] -= f;\n\t\t}\n\t}\n\n\tvoid saturate_negative(const Flow delta) {\n\t\texcess_vs.clear();\n\t\tdeficit_vs.clear();\n\t\tfor(auto &es : g)\n\t\t\tfor(auto &e : es) {\n\t\t\t\tconst Flow rcap = e.residual_cap();\n\t\t\t\tconst Cost rcost = residual_cost(e.src, e.dst, e);\n\t\t\t\tif(rcost < 0 && rcap >= delta) {\n\t\t\t\t\tpush(e, rcap);\n\t\t\t\t\tb[e.src] -= rcap;\n\t\t\t\t\tb[e.dst] += rcap;\n\t\t\t\t}\n\t\t\t}\n\t\tfor(V_id v = 0; v < n; ++v)\n\t\t\tif(b[v] != 0) {\n\t\t\t\t(b[v] > 0 ? excess_vs : deficit_vs).emplace_back(v);\n\t\t\t}\n\t}\n\npublic:\n\tstd::pair<Status, Cost> solve() {\n\t\tpotential.resize(n);\n\t\tfor(auto &es : g)\n\t\t\tfor(auto &e : es) {\n\t\t\t\tconst Flow rcap = e.residual_cap();\n\t\t\t\tif(rcap < 0) {\n\t\t\t\t\tpush(e, rcap);\n\t\t\t\t\tb[e.src] -= rcap;\n\t\t\t\t\tb[e.dst] += rcap;\n\t\t\t\t}\n\t\t\t}\n\n\t\tFlow inf_flow = 1;\n\t\tfor(const auto &es : g)\n\t\t\tfor(const auto &e : es) inf_flow = std::max(inf_flow, e.residual_cap());\n\t\tFlow delta = 1;\n\t\twhile(delta <= inf_flow) delta *= SCALING_FACTOR;\n\n\t\tfor(delta /= SCALING_FACTOR; delta; delta /= SCALING_FACTOR) {\n\t\t\tsaturate_negative(delta);\n\t\t\twhile(dual(delta)) primal(delta);\n\t\t}\n\n\t\tCost value = 0;\n\t\tfor(const auto &es : g)\n\t\t\tfor(const auto &e : es) {\n\t\t\t\tvalue += e.flow * e.cost;\n\t\t\t}\n\t\tvalue /= 2;\n\n\t\tif(excess_vs.empty() && deficit_vs.empty()) {\n\t\t\treturn {Status::OPTIMAL, value / objective};\n\t\t} else {\n\t\t\treturn {Status::INFEASIBLE, value / objective};\n\t\t}\n\t}\n};\n\ntemplate <class Flow, class Cost>\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\n#line 7 \"a.cpp\"\n\nvoid main_() {\n\tINT(n);\n\tVEC(pii, ab, n);\n\tV<> x;\n\tfoa(p, ab) x.pb(p.first), x.pb(p.second);\n\tauto re = press(x);\n\tint m = SZ(re);\n\tMaxGainFlow<int, int> mf;\n\tauto s = mf.add_vertex();\n\tauto t = mf.add_vertex();\n\tmf.add_supply(s, n);\n\tmf.add_demand(t, n);\n\tmf.add_edge(s, t, 0, n, 0);\n\tauto lef = mf.add_vertices(n);\n\tauto rig = mf.add_vertices(m);\n\tREP(i, n) {\n\t\tmf.add_edge(s, lef[i], 0, 1, 0);\n\t\tauto [ai, bi] = ab[i];\n\t\tmf.add_edge(lef[i], rig[lb(re, ai)], 0, 1, bi);\n\t\tmf.add_edge(lef[i], rig[lb(re, bi)], 0, 1, ai);\n\t}\n\tREP(j, m) {\n\t\tmf.add_edge(rig[j], t, 0, 1, 0);\n\t}\n\tprint(mf.solve().second);\n}","accuracy":1,"time_ms":210,"memory_kb":3912,"score_of_the_acc":-0.1615,"final_rank":14},{"submission_id":"aoj_2293_6295499","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/mincostflow.hpp\"\n\n\n\n#line 5 \"library/atcoder/mincostflow.hpp\"\n#include <cassert>\n#line 9 \"library/atcoder/mincostflow.hpp\"\n\n#line 1 \"library/atcoder/internal_csr.hpp\"\n\n\n\n#line 7 \"library/atcoder/internal_csr.hpp\"\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#line 1 \"library/atcoder/internal_queue.hpp\"\n\n\n\n#line 5 \"library/atcoder/internal_queue.hpp\"\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\n#line 12 \"library/atcoder/mincostflow.hpp\"\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 // inside edge\n struct _edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\n int s,\n int t,\n Cap flow_limit) {\n // variants (C = maxcost):\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\n\n // dual_dist[i] = (dual[i], dist[i])\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\n std::vector<int> prev_e(_n);\n std::vector<bool> vis(_n);\n struct Q {\n Cost key;\n int to;\n bool operator<(Q r) const { return key > r.key; }\n };\n std::vector<int> que_min;\n std::vector<Q> que;\n auto dual_ref = [&]() {\n for (int i = 0; i < _n; i++) {\n dual_dist[i].second = std::numeric_limits<Cost>::max();\n }\n std::fill(vis.begin(), vis.end(), false);\n que_min.clear();\n que.clear();\n\n // que[0..heap_r) was heapified\n size_t heap_r = 0;\n\n dual_dist[s].second = 0;\n que_min.push_back(s);\n while (!que_min.empty() || !que.empty()) {\n int v;\n if (!que_min.empty()) {\n v = que_min.back();\n que_min.pop_back();\n } else {\n while (heap_r < que.size()) {\n heap_r++;\n std::push_heap(que.begin(), que.begin() + heap_r);\n }\n v = que.front().to;\n std::pop_heap(que.begin(), que.end());\n que.pop_back();\n heap_r--;\n }\n if (vis[v]) continue;\n vis[v] = true;\n if (v == t) break;\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\n // dist[v] >= 0 (all reduced cost are positive)\n // dist[v] <= (n-1)C\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\n auto e = g.elist[i];\n if (!e.cap) continue;\n // |-dual[e.to] + dual[v]| <= (n-1)C\n // cost <= C - -(n-1)C + 0 = nC\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\n if (dual_dist[e.to].second - dist_v > cost) {\n Cost dist_to = dist_v + cost;\n dual_dist[e.to].second = dist_to;\n prev_e[e.to] = e.rev;\n if (dist_to == dist_v) {\n que_min.push_back(e.to);\n } else {\n que.push_back(Q{dist_to, e.to});\n }\n }\n }\n }\n if (!vis[t]) {\n return false;\n }\n\n for (int v = 0; v < _n; v++) {\n if (!vis[v]) continue;\n // dual[v] = dual[v] - dist[t] + dist[v]\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +\n // (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,\n // t) + dual[t] + shortest(s, v) = shortest(s, v) -\n // shortest(s, t) >= 0 - (n-1)C\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\n }\n return true;\n };\n Cap flow = 0;\n Cost cost = 0, prev_cost_per_flow = -1;\n std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};\n while (flow < flow_limit) {\n if (!dual_ref()) break;\n Cap c = flow_limit - flow;\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\n }\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\n auto& e = g.elist[prev_e[v]];\n e.cap += c;\n g.elist[e.rev].cap -= c;\n }\n Cost d = -dual_dist[s].first;\n flow += c;\n cost += c * d;\n if (prev_cost_per_flow == d) {\n result.pop_back();\n }\n result.push_back({flow, cost});\n prev_cost_per_flow = d;\n }\n return result;\n }\n};\n\n} // namespace atcoder\n\n\n#line 17 \"Source.cpp\"\nusing namespace atcoder;\n\n#define int long long\nvoid solve()\n{\n int n;\n cin >> n;\n vector<pair<int, int>> inputs;\n map<int, int> cnter;\n REP(i, n)\n {\n int a, b;\n cin >> a >> b;\n cnter[a];\n cnter[b];\n inputs.push_back({a, b});\n }\n\n {\n int cnt = 0;\n for (auto &x : cnter)\n {\n x.second = cnt;\n cnt++;\n }\n }\n int ans = 0;\n mcf_graph<int, int> graph(3 + inputs.size() + cnter.size());\n for (int i = 0; i < inputs.size(); ++i)\n {\n graph.add_edge(0, i + 1, 1, 0);\n graph.add_edge(i + 1, inputs.size() + 1 + cnter[inputs[i].first], 1, inputs[i].first);\n graph.add_edge(i + 1, inputs.size() + 1 + cnter[inputs[i].second], 1, inputs[i].second);\n graph.add_edge(i + 1, inputs.size() + cnter.size() + 1, 1, inputs[i].first + inputs[i].second);\n ans += inputs[i].first + inputs[i].second;\n }\n for (int i = 0; i < cnter.size(); ++i)\n {\n graph.add_edge(inputs.size() + 1 + i, inputs.size() + cnter.size() + 2, 1, 0);\n }\n\n graph.add_edge(inputs.size() + 1 + cnter.size(), inputs.size() + cnter.size() + 2, 10000, 0);\n\n ans -= graph.flow(0, inputs.size() + cnter.size() + 2).second;\n cout << ans << endl;\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":4176,"score_of_the_acc":-0.0169,"final_rank":3},{"submission_id":"aoj_2293_6026701","code_snippet":"#include <iostream>\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\n#include <limits>\n#include <type_traits>\n\nnamespace suisen {\n// ! utility\ntemplate <typename ...Types>\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\ntemplate <bool cond_v, typename Then, typename OrElse>\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\n if constexpr (cond_v) {\n return std::forward<Then>(then);\n } else {\n return std::forward<OrElse>(or_else);\n }\n}\n\n// ! function\ntemplate <typename ReturnType, typename Callable, typename ...Args>\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\ntemplate <typename F, typename T>\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\ntemplate <typename F, typename T>\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\n\ntemplate <typename Comparator, typename T>\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\n\n// ! integral\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\ntemplate <typename T, unsigned int n>\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\ntemplate <typename T, unsigned int n>\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\n\n// ?\ntemplate <typename T>\nstruct safely_multipliable {};\ntemplate <>\nstruct safely_multipliable<int> { using type = long long; };\ntemplate <>\nstruct safely_multipliable<long long> { using type = __int128_t; };\ntemplate <>\nstruct safely_multipliable<float> { using type = float; };\ntemplate <>\nstruct safely_multipliable<double> { using type = double; };\ntemplate <>\nstruct safely_multipliable<long double> { using type = long double; };\ntemplate <typename T>\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\n\n} // namespace suisen\n\nnamespace suisen {\ntemplate <typename T>\nclass CoordinateCompressorBuilder {\n public:\n struct Compressor {\n public:\n static constexpr int absent = -1;\n\n // default constructor\n Compressor() : _xs(std::vector<T>{}) {}\n // Construct from strictly sorted vector\n Compressor(const std::vector<T> &xs) : _xs(xs) {\n assert(is_strictly_sorted(xs));\n }\n\n // Return the number of distinct keys.\n int size() const {\n return _xs.size();\n }\n // Check if the element is registered.\n bool has_key(const T &e) const {\n return std::binary_search(_xs.begin(), _xs.end(), e);\n }\n // Compress the element. if not registered, returns `default_value`. (default: Compressor::absent)\n int comp(const T &e, int default_value = absent) const {\n const int res = min_geq_index(e);\n return res != size() and _xs[res] == e ? res : default_value;\n }\n // Restore the element from the index.\n T decomp(const int compressed_index) const {\n return _xs[compressed_index];\n }\n // Compress the element. Equivalent to call `comp(e)`\n int operator[](const T &e) const {\n return comp(e);\n }\n // Return the minimum registered value greater than `e`. if not exists, return `default_value`.\n T min_gt(const T &e, const T &default_value) const {\n auto it = std::upper_bound(_xs.begin(), _xs.end(), e);\n return it == _xs.end() ? default_value : *it;\n }\n // Return the minimum registered value greater than or equal to `e`. if not exists, return `default_value`.\n T min_geq(const T &e, const T &default_value) const {\n auto it = std::lower_bound(_xs.begin(), _xs.end(), e);\n return it == _xs.end() ? default_value : *it;\n }\n // Return the maximum registered value less than `e`. if not exists, return `default_value`\n T max_lt(const T &e, const T &default_value) const {\n auto it = std::upper_bound(_xs.rbegin(), _xs.rend(), e);\n return it == _xs.rend() ? default_value : *it;\n }\n // Return the maximum registered value less than or equal to `e`. if not exists, return `default_value`\n T max_leq(const T &e, const T &default_value) const {\n auto it = std::lower_bound(_xs.rbegin(), _xs.rend(), e);\n return it == _xs.rend() ? default_value : *it;\n }\n // Return the compressed index of the minimum registered value greater than `e`. if not exists, return `compressor.size()`.\n int min_gt_index(const T &e) const {\n return std::upper_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\n }\n // Return the compressed index of the minimum registered value greater than or equal to `e`. if not exists, return `compressor.size()`.\n int min_geq_index(const T &e) const {\n return std::lower_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\n }\n // Return the compressed index of the maximum registered value less than `e`. if not exists, return -1.\n int max_lt_index(const T &e) const {\n return int(_xs.rend() - std::upper_bound(_xs.rbegin(), _xs.rend(), e)) - 1;\n }\n // Return the compressed index of the maximum registered value less than or equal to `e`. if not exists, return -1.\n int max_leq_index(const T &e) const {\n return int(_xs.rend() - std::lower_bound(_xs.rbegin(), _xs.rend(), e)) - 1;\n }\n private:\n std::vector<T> _xs;\n static bool is_strictly_sorted(const std::vector<T> &v) {\n return std::adjacent_find(v.begin(), v.end(), std::greater_equal<T>()) == v.end();\n }\n };\n CoordinateCompressorBuilder() : _xs(std::vector<T>{}) {}\n explicit CoordinateCompressorBuilder(const std::vector<T> &xs) : _xs(xs) {}\n explicit CoordinateCompressorBuilder(std::vector<T> &&xs) : _xs(std::move(xs)) {}\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\n CoordinateCompressorBuilder(const int n, Gen generator) {\n reserve(n);\n for (int i = 0; i < n; ++i) push(generator(i));\n }\n // Attempt to preallocate enough memory for specified number of elements.\n void reserve(int n) {\n _xs.reserve(n);\n }\n // Add data.\n void push(const T &first) {\n _xs.push_back(first);\n }\n // Add data.\n void push(T &&first) {\n _xs.push_back(std::move(first));\n }\n // Add data in the range of [first, last). \n template <typename Iterator>\n auto push(const Iterator &first, const Iterator &last) -> decltype(std::vector<T>{}.push_back(*first), void()) {\n for (auto it = first; it != last; ++it) _xs.push_back(*it);\n }\n // Add all data in the container. Equivalent to `push(iterable.begin(), iterable.end())`.\n template <typename Iterable>\n auto push(const Iterable &iterable) -> decltype(std::vector<T>{}.push_back(*iterable.begin()), void()) {\n push(iterable.begin(), iterable.end());\n }\n // Add data.\n template <typename ...Args>\n void emplace(Args &&...args) {\n _xs.emplace_back(std::forward<Args>(args)...);\n }\n // Build compressor.\n auto build() {\n std::sort(_xs.begin(), _xs.end()), _xs.erase(std::unique(_xs.begin(), _xs.end()), _xs.end());\n return Compressor {_xs};\n }\n // Build compressor from vector.\n static auto build(const std::vector<T> &xs) {\n return CoordinateCompressorBuilder(xs).build();\n }\n // Build compressor from vector.\n static auto build(std::vector<T> &&xs) {\n return CoordinateCompressorBuilder(std::move(xs)).build();\n }\n // Build compressor from generator.\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\n static auto build(const int n, Gen generator) {\n return CoordinateCompressorBuilder<T>(n, generator).build();\n }\n private:\n std::vector<T> _xs;\n};\n\n} // namespace suisen\n\n#include <queue>\n\nnamespace suisen {\n\nenum MCFPotentialInitializer {\n DAG, BELLMAN_FORD, DIJKSTRA\n};\n\ntemplate <typename Cap, typename Cost, MCFPotentialInitializer init_method = MCFPotentialInitializer::BELLMAN_FORD>\nclass MinCostFlow {\n struct InternalEdge { int to; Cap cap; Cost cost; int rev; };\n public:\n MinCostFlow() : MinCostFlow(0) {}\n MinCostFlow(int n) : n(n), g(n), potential(n, 0), dist(n), prev_vid(n), prev_eid(n) {}\n\n // Returns the id of created edge.\n int add_edge(int u, int v, Cap cap, Cost cost) {\n int edge_id = edges.size();\n edges.emplace_back(u, g[u].size());\n g[u].push_back({ v, cap, cost, int(g[v].size()) });\n g[v].push_back({ u, 0, -cost, int(g[u].size()) - 1 });\n return edge_id;\n }\n\n /**\n * Returns { flow, cost } (flow = min(max_flow, f))\n */\n auto min_cost_max_flow(const int s, const int t, const Cap f) {\n return min_cost_max_flow_slope(s, t, f).back();\n }\n /**\n * Returns { flow, cost } (flow = max_flow)\n */\n auto min_cost_max_flow(const int s, const int t) {\n return min_cost_max_flow_slope(s, t).back();\n }\n /**\n * Returns { flow, cost }\n * amount of flow is arbitrary.\n */\n auto min_cost_arbitrary_flow(const int s, const int t) {\n return min_cost_arbitrary_flow_slope(s, t).back();\n }\n\n auto min_cost_max_flow_slope(const int s, const int t, const Cap f) {\n return min_cost_flow_slope(s, t, f, [](Cap, Cost){ return true; });\n }\n auto min_cost_max_flow_slope(const int s, const int t) {\n return min_cost_max_flow_slope(s, t, INF_FLOW);\n }\n auto min_cost_arbitrary_flow_slope(const int s, const int t) {\n return min_cost_flow_slope(s, t, INF_FLOW, [this, t](Cap, Cost){ return potential[t] < 0; });\n }\n\n struct Edge {\n int from, to;\n Cap cap, flow;\n Cost cost;\n };\n\n Edge get_edge(int edge_id) const {\n const auto &e = g[edges[edge_id].first][edges[edge_id].second];\n const auto &re = g[e.to][e.rev];\n return Edge { re.to, e.to, e.cap + re.cap, re.cap, e.cost };\n }\n std::vector<Edge> get_edges() const {\n std::vector<Edge> res(edges.size());\n for (std::size_t i = 0; i < edges.size(); ++i) res[i] = get_edge(i);\n return res;\n }\n\n private:\n static constexpr Cost INF_COST = std::numeric_limits<Cost>::max() / 2;\n static constexpr Cost INF_FLOW = std::numeric_limits<Cap>::max() / 2;\n \n int n;\n std::vector<std::vector<InternalEdge>> g;\n std::vector<Cost> potential;\n std::vector<Cost> dist;\n std::vector<int> prev_vid, prev_eid;\n\n std::vector<std::pair<int, int>> edges;\n\n template <typename Predicate>\n std::pair<Cap, Cost> min_cost_flow(const int s, const int t, const Cap upper_flow, Predicate pred) {\n return min_cost_flow_slope(s, t, upper_flow, pred).back();\n }\n\n template <typename Predicate>\n std::vector<std::pair<Cap, Cost>> min_cost_flow_slope(const int s, const int t, const Cap upper_flow, Predicate pred) {\n if constexpr (init_method == BELLMAN_FORD) {\n bellman_ford(s);\n } else if constexpr (init_method == DIJKSTRA) {\n dijkstra(s);\n } else {\n dag_dp(s);\n }\n update_potential();\n std::vector<std::pair<Cap, Cost>> slope;\n Cap flow = 0;\n Cost cost = 0;\n slope.emplace_back(flow, cost);\n while (dist[t] != INF_COST and flow < upper_flow and pred(flow, cost)) {\n Cap df = upper_flow - flow;\n for (int v = t; v != s; v = prev_vid[v]) {\n df = std::min(df, g[prev_vid[v]][prev_eid[v]].cap);\n }\n assert(df != 0);\n flow += df;\n cost += df * potential[t];\n if (slope.size() >= 2) {\n auto [f0, c0] = *std::next(slope.rbegin());\n auto [f1, c1] = *slope.rbegin();\n if ((f1 - f0) * (cost - c1) == (flow - f1) * (c1 - c0)) slope.pop_back();\n }\n slope.emplace_back(flow, cost);\n for (int v = t; v != s; v = prev_vid[v]) {\n auto &e = g[prev_vid[v]][prev_eid[v]];\n e.cap -= df;\n g[v][e.rev].cap += df;\n }\n dijkstra(s);\n update_potential();\n }\n return slope;\n }\n\n void update_potential() {\n for (int u = 0; u < n; ++u) {\n if (potential[u] != INF_COST) potential[u] += dist[u];\n }\n }\n\n bool update_dist(int u, int eid) {\n if (dist[u] == INF_COST) return false;\n const auto &e = g[u][eid];\n if (e.cap == 0) return false;\n const int v = e.to;\n Cost cost = e.cost + potential[u] - potential[v];\n if constexpr (init_method == DIJKSTRA) {\n assert(cost >= 0);\n }\n if (dist[u] + cost < dist[v]) {\n dist[v] = dist[u] + cost;\n prev_vid[v] = u;\n prev_eid[v] = eid;\n return true;\n }\n return false;\n }\n\n void dijkstra(int s) {\n using State = std::pair<Cost, int>;\n std::priority_queue<State, std::vector<State>, std::greater<State>> pq;\n dist.assign(n, INF_COST);\n pq.emplace(dist[s] = 0, s);\n while (pq.size()) {\n auto [du, u] = pq.top();\n pq.pop();\n if (du != dist[u]) continue;\n for (int i = 0; i < int(g[u].size()); ++i) {\n int v = g[u][i].to;\n if (update_dist(u, i)) {\n pq.emplace(dist[v], v);\n }\n }\n }\n }\n\n void dag_dp(int s) {\n std::vector<int> in(n, 0);\n for (int u = 0; u < n; ++u) {\n for (const auto &e : g[u]) {\n if (e.cap == 0) continue;\n ++in[e.to];\n }\n }\n std::deque<int> dq;\n for (int u = 0; u < n; ++u) {\n if (in[u] == 0) dq.push_back(u);\n }\n dist.assign(n, INF_COST);\n dist[s] = 0;\n while (dq.size()) {\n int u = dq.front();\n dq.pop_front();\n for (int i = 0; i < int(g[u].size()); ++i) {\n const auto &e = g[u][i];\n if (e.cap == 0) continue;\n update_dist(u, i);\n if (--in[e.to] == 0) {\n dq.push_back(e.to);\n }\n }\n }\n assert(std::all_of(in.begin(), in.end(), [](int in_deg) { return in_deg == 0; }));\n }\n\n void bellman_ford(int s) {\n dist.assign(n, INF_COST);\n dist[s] = 0;\n for (bool has_update = true; has_update;) {\n has_update = false;\n for (int u = 0; u < n; ++u) {\n if (dist[u] == INF_COST) continue;\n for (int i = 0; i < int(g[u].size()); ++i) {\n has_update |= update_dist(u, i);\n }\n }\n }\n }\n};\n} // namespace suisen\n\nint main() {\n int n;\n std::cin >> n;\n suisen::CoordinateCompressorBuilder<int> comp_builder;\n std::vector<std::pair<int, int>> ps(n);\n for (auto &[x, y] : ps) {\n std::cin >> x >> y;\n comp_builder.push(x);\n comp_builder.push(y);\n }\n auto comp = comp_builder.build();\n int m = comp.size();\n int s = n + m, t = s + 1;\n\n suisen::MinCostFlow<int, int, suisen::DAG> mcf(n + m + 2);\n for (int i = 0; i < n; ++i) {\n mcf.add_edge(s, i, 1, 0);\n auto [a, b] = ps[i];\n mcf.add_edge(i, n + comp[a], 1, -b);\n mcf.add_edge(i, n + comp[b], 1, -a);\n }\n for (int i = 0; i < m; ++i) {\n mcf.add_edge(n + i, t, 1, 0);\n }\n std::cout << -mcf.min_cost_arbitrary_flow(s, t).second << std::endl;\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":3832,"score_of_the_acc":-0.1438,"final_rank":10},{"submission_id":"aoj_2293_6026685","code_snippet":"#include <iostream>\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\n#include <limits>\n#include <type_traits>\n\nnamespace suisen {\n// ! utility\ntemplate <typename ...Types>\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\ntemplate <bool cond_v, typename Then, typename OrElse>\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\n if constexpr (cond_v) {\n return std::forward<Then>(then);\n } else {\n return std::forward<OrElse>(or_else);\n }\n}\n\n// ! function\ntemplate <typename ReturnType, typename Callable, typename ...Args>\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\ntemplate <typename F, typename T>\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\ntemplate <typename F, typename T>\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\n\ntemplate <typename Comparator, typename T>\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\n\n// ! integral\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\ntemplate <typename T, unsigned int n>\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\ntemplate <typename T, unsigned int n>\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\n\n// ?\ntemplate <typename T>\nstruct safely_multipliable {};\ntemplate <>\nstruct safely_multipliable<int> { using type = long long; };\ntemplate <>\nstruct safely_multipliable<long long> { using type = __int128_t; };\ntemplate <>\nstruct safely_multipliable<float> { using type = float; };\ntemplate <>\nstruct safely_multipliable<double> { using type = double; };\ntemplate <>\nstruct safely_multipliable<long double> { using type = long double; };\ntemplate <typename T>\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\n\n} // namespace suisen\n\nnamespace suisen {\ntemplate <typename T>\nclass CoordinateCompressorBuilder {\n public:\n struct Compressor {\n public:\n static constexpr int absent = -1;\n\n // default constructor\n Compressor() : _xs(std::vector<T>{}) {}\n // Construct from strictly sorted vector\n Compressor(const std::vector<T> &xs) : _xs(xs) {\n assert(is_strictly_sorted(xs));\n }\n\n // Return the number of distinct keys.\n int size() const {\n return _xs.size();\n }\n // Check if the element is registered.\n bool has_key(const T &e) const {\n return std::binary_search(_xs.begin(), _xs.end(), e);\n }\n // Compress the element. if not registered, returns `default_value`. (default: Compressor::absent)\n int comp(const T &e, int default_value = absent) const {\n const int res = min_geq_index(e);\n return res != size() and _xs[res] == e ? res : default_value;\n }\n // Restore the element from the index.\n T decomp(const int compressed_index) const {\n return _xs[compressed_index];\n }\n // Compress the element. Equivalent to call `comp(e)`\n int operator[](const T &e) const {\n return comp(e);\n }\n // Return the minimum registered value greater than `e`. if not exists, return `default_value`.\n T min_gt(const T &e, const T &default_value) const {\n auto it = std::upper_bound(_xs.begin(), _xs.end(), e);\n return it == _xs.end() ? default_value : *it;\n }\n // Return the minimum registered value greater than or equal to `e`. if not exists, return `default_value`.\n T min_geq(const T &e, const T &default_value) const {\n auto it = std::lower_bound(_xs.begin(), _xs.end(), e);\n return it == _xs.end() ? default_value : *it;\n }\n // Return the maximum registered value less than `e`. if not exists, return `default_value`\n T max_lt(const T &e, const T &default_value) const {\n auto it = std::upper_bound(_xs.rbegin(), _xs.rend(), e);\n return it == _xs.rend() ? default_value : *it;\n }\n // Return the maximum registered value less than or equal to `e`. if not exists, return `default_value`\n T max_leq(const T &e, const T &default_value) const {\n auto it = std::lower_bound(_xs.rbegin(), _xs.rend(), e);\n return it == _xs.rend() ? default_value : *it;\n }\n // Return the compressed index of the minimum registered value greater than `e`. if not exists, return `compressor.size()`.\n int min_gt_index(const T &e) const {\n return std::upper_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\n }\n // Return the compressed index of the minimum registered value greater than or equal to `e`. if not exists, return `compressor.size()`.\n int min_geq_index(const T &e) const {\n return std::lower_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\n }\n // Return the compressed index of the maximum registered value less than `e`. if not exists, return -1.\n int max_lt_index(const T &e) const {\n return int(_xs.rend() - std::upper_bound(_xs.rbegin(), _xs.rend(), e)) - 1;\n }\n // Return the compressed index of the maximum registered value less than or equal to `e`. if not exists, return -1.\n int max_leq_index(const T &e) const {\n return int(_xs.rend() - std::lower_bound(_xs.rbegin(), _xs.rend(), e)) - 1;\n }\n private:\n std::vector<T> _xs;\n static bool is_strictly_sorted(const std::vector<T> &v) {\n return std::adjacent_find(v.begin(), v.end(), std::greater_equal<T>()) == v.end();\n }\n };\n CoordinateCompressorBuilder() : _xs(std::vector<T>{}) {}\n explicit CoordinateCompressorBuilder(const std::vector<T> &xs) : _xs(xs) {}\n explicit CoordinateCompressorBuilder(std::vector<T> &&xs) : _xs(std::move(xs)) {}\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\n CoordinateCompressorBuilder(const int n, Gen generator) {\n reserve(n);\n for (int i = 0; i < n; ++i) push(generator(i));\n }\n // Attempt to preallocate enough memory for specified number of elements.\n void reserve(int n) {\n _xs.reserve(n);\n }\n // Add data.\n void push(const T &first) {\n _xs.push_back(first);\n }\n // Add data.\n void push(T &&first) {\n _xs.push_back(std::move(first));\n }\n // Add data in the range of [first, last). \n template <typename Iterator>\n auto push(const Iterator &first, const Iterator &last) -> decltype(std::vector<T>{}.push_back(*first), void()) {\n for (auto it = first; it != last; ++it) _xs.push_back(*it);\n }\n // Add all data in the container. Equivalent to `push(iterable.begin(), iterable.end())`.\n template <typename Iterable>\n auto push(const Iterable &iterable) -> decltype(std::vector<T>{}.push_back(*iterable.begin()), void()) {\n push(iterable.begin(), iterable.end());\n }\n // Add data.\n template <typename ...Args>\n void emplace(Args &&...args) {\n _xs.emplace_back(std::forward<Args>(args)...);\n }\n // Build compressor.\n auto build() {\n std::sort(_xs.begin(), _xs.end()), _xs.erase(std::unique(_xs.begin(), _xs.end()), _xs.end());\n return Compressor {_xs};\n }\n // Build compressor from vector.\n static auto build(const std::vector<T> &xs) {\n return CoordinateCompressorBuilder(xs).build();\n }\n // Build compressor from vector.\n static auto build(std::vector<T> &&xs) {\n return CoordinateCompressorBuilder(std::move(xs)).build();\n }\n // Build compressor from generator.\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\n static auto build(const int n, Gen generator) {\n return CoordinateCompressorBuilder<T>(n, generator).build();\n }\n private:\n std::vector<T> _xs;\n};\n\n} // namespace suisen\n\n#include <queue>\n\nnamespace suisen {\n\nenum MCFPotentialInitializer {\n DAG, BELLMAN_FORD, DIJKSTRA\n};\n\ntemplate <typename Cap, typename Cost, MCFPotentialInitializer init_method = MCFPotentialInitializer::BELLMAN_FORD>\nclass MinCostFlow {\n struct InternalEdge { int to; Cap cap; Cost cost; int rev; };\n public:\n MinCostFlow() : MinCostFlow(0) {}\n MinCostFlow(int n) : n(n), g(n), potential(n, 0), dist(n), prev_vid(n), prev_eid(n) {}\n\n // Returns the id of created edge.\n int add_edge(int u, int v, Cap cap, Cost cost) {\n int edge_id = edges.size();\n edges.emplace_back(u, g[u].size());\n g[u].push_back({ v, cap, cost, int(g[v].size()) });\n g[v].push_back({ u, 0, -cost, int(g[u].size()) - 1 });\n return edge_id;\n }\n\n /**\n * Returns { flow, cost } (flow = min(max_flow, f))\n */\n auto min_cost_max_flow(const int s, const int t, const Cap f) {\n return min_cost_max_flow_slope(s, t, f).back();\n }\n /**\n * Returns { flow, cost } (flow = max_flow)\n */\n auto min_cost_max_flow(const int s, const int t) {\n return min_cost_max_flow_slope(s, t).back();\n }\n /**\n * Returns { flow, cost }\n * amount of flow is arbitrary.\n */\n auto min_cost_arbitrary_flow(const int s, const int t) {\n return min_cost_arbitrary_flow_slope(s, t).back();\n }\n\n auto min_cost_max_flow_slope(const int s, const int t, const Cap f) {\n return min_cost_flow_slope(s, t, f, [](Cap, Cost){ return true; });\n }\n auto min_cost_max_flow_slope(const int s, const int t) {\n return min_cost_max_flow_slope(s, t, INF_FLOW);\n }\n auto min_cost_arbitrary_flow_slope(const int s, const int t) {\n return min_cost_flow_slope(s, t, INF_FLOW, [this, t](Cap, Cost){ return potential[t] < 0; });\n }\n\n struct Edge {\n int from, to;\n Cap cap, flow;\n Cost cost;\n };\n\n Edge get_edge(int edge_id) const {\n const auto &e = g[edges[edge_id].first][edges[edge_id].second];\n const auto &re = g[e.to][e.rev];\n return Edge { re.to, e.to, e.cap + re.cap, re.cap, e.cost };\n }\n std::vector<Edge> get_edges() const {\n std::vector<Edge> res(edges.size());\n for (std::size_t i = 0; i < edges.size(); ++i) res[i] = get_edge(i);\n return res;\n }\n\n private:\n static constexpr Cost INF_COST = std::numeric_limits<Cost>::max() / 2;\n static constexpr Cost INF_FLOW = std::numeric_limits<Cap>::max() / 2;\n \n int n;\n std::vector<std::vector<InternalEdge>> g;\n std::vector<Cost> potential;\n std::vector<Cost> dist;\n std::vector<int> prev_vid, prev_eid;\n\n std::vector<std::pair<int, int>> edges;\n\n template <typename Predicate>\n std::pair<Cap, Cost> min_cost_flow(const int s, const int t, const Cap upper_flow, Predicate pred) {\n return min_cost_flow_slope(s, t, upper_flow, pred).back();\n }\n\n template <typename Predicate>\n std::vector<std::pair<Cap, Cost>> min_cost_flow_slope(const int s, const int t, const Cap upper_flow, Predicate pred) {\n switch (init_method) {\n case BELLMAN_FORD: bellman_ford(s); break;\n case DIJKSTRA: dijkstra(s); break;\n case DAG: dag_dp(s); break;\n }\n update_potential();\n std::vector<std::pair<Cap, Cost>> slope;\n Cap flow = 0;\n Cost cost = 0;\n slope.emplace_back(flow, cost);\n while (dist[t] != INF_COST and flow < upper_flow and pred(flow, cost)) {\n Cap df = upper_flow - flow;\n for (int v = t; v != s; v = prev_vid[v]) {\n df = std::min(df, g[prev_vid[v]][prev_eid[v]].cap);\n }\n assert(df != 0);\n flow += df;\n cost += df * potential[t];\n if (slope.size() >= 2) {\n auto [f0, c0] = *std::next(slope.rbegin());\n auto [f1, c1] = *slope.rbegin();\n if ((f1 - f0) * (cost - c1) == (flow - f1) * (c1 - c0)) slope.pop_back();\n }\n slope.emplace_back(flow, cost);\n for (int v = t; v != s; v = prev_vid[v]) {\n auto &e = g[prev_vid[v]][prev_eid[v]];\n e.cap -= df;\n g[v][e.rev].cap += df;\n }\n dijkstra(s);\n update_potential();\n }\n return slope;\n }\n\n void update_potential() {\n for (int u = 0; u < n; ++u) {\n if (potential[u] != INF_COST) potential[u] += dist[u];\n }\n }\n\n bool update_dist(int u, int eid) {\n if (dist[u] == INF_COST) return false;\n const auto &e = g[u][eid];\n if (e.cap == 0) return false;\n const int v = e.to;\n Cost cost = e.cost + potential[u] - potential[v];\n if constexpr (init_method == DIJKSTRA) {\n assert(cost >= 0);\n }\n if (dist[u] + cost < dist[v]) {\n dist[v] = dist[u] + cost;\n prev_vid[v] = u;\n prev_eid[v] = eid;\n return true;\n }\n return false;\n }\n\n void dijkstra(int s) {\n using State = std::pair<Cost, int>;\n std::priority_queue<State, std::vector<State>, std::greater<State>> pq;\n dist.assign(n, INF_COST);\n pq.emplace(dist[s] = 0, s);\n while (pq.size()) {\n auto [du, u] = pq.top();\n pq.pop();\n if (du != dist[u]) continue;\n for (int i = 0; i < int(g[u].size()); ++i) {\n int v = g[u][i].to;\n if (update_dist(u, i)) {\n pq.emplace(dist[v], v);\n }\n }\n }\n }\n\n void dag_dp(int s) {\n std::vector<int> in(n, 0);\n for (int u = 0; u < n; ++u) {\n for (const auto &e : g[u]) {\n if (e.cap == 0) continue;\n ++in[e.to];\n }\n }\n std::deque<int> dq;\n for (int u = 0; u < n; ++u) {\n if (in[u] == 0) dq.push_back(u);\n }\n dist.assign(n, INF_COST);\n dist[s] = 0;\n while (dq.size()) {\n int u = dq.front();\n dq.pop_front();\n for (int i = 0; i < int(g[u].size()); ++i) {\n const auto &e = g[u][i];\n if (e.cap == 0) continue;\n update_dist(u, i);\n if (--in[e.to] == 0) {\n dq.push_back(e.to);\n }\n }\n }\n assert(std::all_of(in.begin(), in.end(), [](int in_deg) { return in_deg == 0; }));\n }\n\n void bellman_ford(int s) {\n dist.assign(n, INF_COST);\n dist[s] = 0;\n for (bool has_update = true; has_update;) {\n has_update = false;\n for (int u = 0; u < n; ++u) {\n if (dist[u] == INF_COST) continue;\n for (int i = 0; i < int(g[u].size()); ++i) {\n has_update |= update_dist(u, i);\n }\n }\n }\n }\n};\n} // namespace suisen\n\nint main() {\n int n;\n std::cin >> n;\n suisen::CoordinateCompressorBuilder<int> comp_builder;\n std::vector<std::pair<int, int>> ps(n);\n for (auto &[x, y] : ps) {\n std::cin >> x >> y;\n comp_builder.push(x);\n comp_builder.push(y);\n }\n auto comp = comp_builder.build();\n int m = comp.size();\n int s = n + m, t = s + 1;\n\n suisen::MinCostFlow<int, int, suisen::DAG> mcf(n + m + 2);\n for (int i = 0; i < n; ++i) {\n mcf.add_edge(s, i, 1, 0);\n auto [a, b] = ps[i];\n mcf.add_edge(i, n + comp[a], 1, -b);\n mcf.add_edge(i, n + comp[b], 1, -a);\n }\n for (int i = 0; i < m; ++i) {\n mcf.add_edge(n + i, t, 1, 0);\n }\n std::cout << -mcf.min_cost_arbitrary_flow(s, t).second << std::endl;\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":3864,"score_of_the_acc":-0.1445,"final_rank":11}],"string":"[\n {\n \"submission_id\": \"aoj_2293_10946082\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconstexpr int INF = 1e9;\\n\\nusing pii = pair<int, int>;\\n\\nstruct edge {\\n int to, cap, cost, rev;\\n};\\n\\nusing edges = vector<edge>;\\nusing graph = vector<edges>;\\n\\nvoid add_edge(graph& g, 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(graph& g, int s, int t, int f) {\\n int res = 0;\\n const int N = g.size();\\n vector<int> h(N), dist(N), prevv(N), preve(N);\\n while(f > 0) {\\n priority_queue<pii, vector<pii>, greater<pii>> que;\\n fill(dist.begin(), dist.end(), INF);\\n dist[s] = 0;\\n que.push(make_pair(0, s));\\n while(!que.empty()) {\\n pii p = que.top();\\n int v = p.second;\\n que.pop();\\n if(dist[v] < p.first) {\\n continue;\\n }\\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(make_pair(dist[e.to], e.to));\\n }\\n }\\n }\\n if(dist[t] == INF) {\\n return -1;\\n }\\n for(int v=0; v<N; ++v) {\\n h[v] += dist[v];\\n }\\n int d = f;\\n for(int v=t; v!=s; v=prevv[v]) {\\n d = min(d, g[prevv[v]][preve[v]].cap);\\n }\\n f -= d;\\n res += d * h[t];\\n for(int v=t; v!=s; v=prevv[v]) {\\n edge& e = g[prevv[v]][preve[v]];\\n e.cap -= d;\\n g[v][e.rev].cap += d;\\n }\\n }\\n return res;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<int> A(N), B(N);\\n vector<int> v;\\n for(int i=0; i<N; ++i) {\\n cin >> A[i] >> B[i];\\n v.push_back(A[i]);\\n v.push_back(B[i]);\\n }\\n sort(v.begin(), v.end());\\n v.erase(unique(v.begin(), v.end()), v.end());\\n graph g(N+v.size()+3);\\n int source = N + v.size();\\n int unuse = N + v.size() + 1;\\n int sink = N + v.size() + 2;\\n for(int i=0; i<N; ++i) {\\n add_edge(g, source, i, 1, 0);\\n }\\n for(int i=0; i<N; ++i) {\\n int a = lower_bound(v.begin(), v.end(), A[i]) - v.begin();\\n add_edge(g, i, N+a, 1, -B[i]);\\n int b = lower_bound(v.begin(), v.end(), B[i]) - v.begin();\\n add_edge(g, i, N+b, 1, -A[i]);\\n add_edge(g, i, unuse, 1, 0);\\n }\\n for(int i=0; i<v.size(); ++i) {\\n add_edge(g, N+i, sink, 1, 0);\\n }\\n add_edge(g, unuse, sink, INF, 0);\\n cout << -min_cost_flow(g, source, sink, N) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3792,\n \"score_of_the_acc\": -0.1508,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2293_9805229\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\\\" \\\"<<p.second;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\n// https://ei1333.github.io/library/graph/flow/primal-dual.hpp.html\\ntemplate<typename flow_t,typename cost_t>\\nstruct MinCostFlow{\\n struct edge{\\n int to;\\n flow_t cap;cost_t cost;\\n int rev;\\n bool is_e;// 本当の辺かどうか\\n };\\n vector<vector<edge>> v;\\n vector<cost_t> potential,mn_cost;\\n vector<int> pre_v,pre_e;\\n const cost_t inf;\\n MinCostFlow(int n):v(n),inf(numeric_limits<cost_t>::max()){}\\n void add_edge(int fr,int to,flow_t cap,cost_t cost){\\n v[fr].emplace_back((edge){to,cap,cost,(int)v[to].size(),true});\\n v[to].emplace_back((edge){fr,0,-cost,(int)v[fr].size()-1,false});\\n }\\n // s->tの流量fの最小コスト O(FElog(V))\\n cost_t min_cost_flow(int s,int t,flow_t f){\\n int n = (int)v.size();\\n cost_t res = 0;\\n using pi = pair<cost_t,int>;//{cost,頂点番号}\\n priority_queue<pi,vector<pi>,greater<pi>> que;\\n potential.assign(n,0);\\n pre_v.assign(n,-1);pre_e.assign(n,-1);\\n while(f > 0){\\n mn_cost.assign(n,inf);\\n que.emplace(0,s);\\n mn_cost[s] = 0;\\n while(!que.empty()){\\n auto [o_cost,ov] = que.top();que.pop();\\n if(mn_cost[ov] < o_cost)continue;\\n for(int i = 0;i < (int)v[ov].size();i++){\\n edge &e = v[ov][i];\\n cost_t n_cost = mn_cost[ov] + e.cost + potential[ov]-potential[e.to];\\n if(e.cap > 0 && n_cost < mn_cost[e.to]){\\n mn_cost[e.to] = n_cost;\\n pre_v[e.to] = ov,pre_e[e.to] = i;\\n que.emplace(mn_cost[e.to],e.to);\\n }\\n }\\n }\\n if(mn_cost[t] == inf)return -1;\\n for(int i = 0;i < n;i++)potential[i] += mn_cost[i];\\n flow_t add_flow = f;\\n for(int ov = t;ov != s;ov = pre_v[ov]){\\n add_flow = min(add_flow,v[pre_v[ov]][pre_e[ov]].cap);\\n }\\n f -= add_flow;\\n res += add_flow*potential[t];\\n for(int ov = t;ov != s;ov = pre_v[ov]){\\n edge &e = v[pre_v[ov]][pre_e[ov]];\\n e.cap -= add_flow;\\n v[ov][e.rev].cap += add_flow;\\n }\\n }\\n return res;\\n }\\n // 復元の方法 下の実装で(ov->nv,辺の今の流量/辺の流量の最大値)\\n void output(){\\n for(int i = 0;i < v.size();i++){\\n for(auto &e : v[i]){\\n if(!e.is_e)continue;\\n auto &rev_e = v[e.to][e.rev];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow:\\\" << rev_e.cap << \\\"/\\\" << rev_e.cap +e.cap << \\\")\\\\n\\\";\\n }\\n }\\n }\\n};\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n int n;cin >> n;\\n vi a(n),b(n);\\n rep(i,n)cin >> a[i] >> b[i];\\n vi cor;\\n rep(i,n)cor.emplace_back(a[i]),cor.emplace_back(b[i]);\\n sort(ALL(cor));\\n cor.erase(unique(ALL(cor)),cor.end());\\n MinCostFlow<ll,ll> mc(n+sz(cor)+2);\\n int S = n + sz(cor),T = S+1;\\n rep(i,n){\\n int aid = n+LB(cor,a[i]),bid = n+LB(cor,b[i]);\\n mc.add_edge(i,bid,1,-a[i]);\\n mc.add_edge(i,aid,1,-b[i]);\\n }\\n rep(i,n)mc.add_edge(S,i,1,0);\\n rep(i,sz(cor))mc.add_edge(n+i,T,1,0);\\n mc.add_edge(S,T,n,0);\\n cout << -mc.min_cost_flow(S,T,n) << \\\"\\\\n\\\";\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 4068,\n \"score_of_the_acc\": -0.1652,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2293_9805048\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nstruct MaxFlow {\\n struct Edge {\\n int to, rev;\\n ll cap;\\n };\\n int V;\\n vector<vector<Edge>> G;\\n vector<int> itr, level;\\n using P = pair<int, int>;\\n vector<P> es;\\n\\n public:\\n MaxFlow() {}\\n MaxFlow(int V) : V(V) {\\n G.assign(V, vector<Edge>());\\n }\\n int add_vertex() {\\n G.push_back(vector<Edge>());\\n return V++;\\n }\\n void add_edge(int from, int to, ll cap) {\\n int fid = SZ(G[from]), tid = SZ(G[to]);\\n if (from == to)\\n tid++;\\n es.push_back({from, fid});\\n G[from].push_back({to, tid, cap});\\n G[to].push_back({from, fid, 0});\\n }\\n struct Type {\\n int from, to;\\n ll cap, recap;\\n };\\n Type get_edge(int i) {\\n auto [from, pos] = es[i];\\n auto e = G[from][pos];\\n auto re = G[e.to][e.rev];\\n return Type{from, e.to, e.cap, re.cap};\\n }\\n void bfs(int s) {\\n level.assign(V, -1);\\n queue<int> q;\\n level[s] = 0;\\n q.push(s);\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto &e : G[v]) {\\n if (e.cap > 0 && level[e.to] < 0) {\\n level[e.to] = level[v] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n ll dfs(int v, int t, ll f) {\\n if (v == t)\\n return f;\\n for (int &i = itr[v]; i < (int)G[v].size(); i++) {\\n Edge &e = G[v][i];\\n if (e.cap > 0 && level[v] < level[e.to]) {\\n ll d = dfs(e.to, t, min(f, e.cap));\\n if (d > 0) {\\n e.cap -= d, G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n ll run(int s, int t) {\\n ll ret = 0, f;\\n while (bfs(s), level[t] >= 0) {\\n itr.assign(V, 0);\\n while ((f = dfs(s, t, INF)) > 0)\\n ret += f;\\n }\\n return ret;\\n }\\n vector<int> cut() {\\n vector<int> ret(V);\\n rep(v, 0, V) if (level[v] < 0) ret[v] = 1;\\n return ret;\\n }\\n};\\n\\n/**\\n * @brief Maximum Flow\\n */\\n\\ntemplate <class Cap, class Cost> struct MinCostFlow {\\n struct X {\\n int from, to;\\n Cap lb, ub, flow;\\n Cost cost;\\n };\\n struct Edge {\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n };\\n using P = pair<int, int>;\\n int n, m;\\n vector<X> es;\\n vector<Cap> exc;\\n vector<Cost> dual;\\n vector<vector<Edge>> g;\\n Cost MX;\\n MinCostFlow(int _n) : n(_n), m(0), exc(n), dual(n), g(n), MX(0) {}\\n void add_edge(int from, int to, Cap lb, Cap ub, Cost cost) {\\n m++;\\n chmax(MX, cost);\\n chmax(MX, -cost);\\n es.push_back({from, to, lb, ub, 0, cost});\\n }\\n void add_excess(int v, Cap c) { exc[v] += c; }\\n pair<bool, Cost> run() {\\n MaxFlow mf(n + 2);\\n int S = n, T = n + 1;\\n Cap psum = 0, nsum = 0;\\n for (auto &e : es) {\\n exc[e.to] += e.lb;\\n exc[e.from] -= e.lb;\\n mf.add_edge(e.from, e.to, e.ub - e.lb);\\n }\\n rep(i, 0, n) {\\n if (exc[i] > 0) {\\n psum += exc[i];\\n mf.add_edge(S, i, exc[i]);\\n }\\n if (exc[i] < 0) {\\n nsum += -exc[i];\\n mf.add_edge(i, T, -exc[i]);\\n }\\n }\\n\\n if (psum != nsum or mf.run(S, T) != psum)\\n return {false, 0};\\n\\n using P = pair<int, int>;\\n vector<P> pos;\\n rep(i, 0, m) {\\n auto e = mf.get_edge(i);\\n Cost cost = es[i].cost * n;\\n int fid = SZ(g[e.from]), tid = SZ(g[e.to]);\\n if (e.from == e.to)\\n tid++;\\n pos.push_back({e.from, fid});\\n g[e.from].push_back({e.to, tid, e.cap, cost});\\n g[e.to].push_back({e.from, fid, e.recap, -cost});\\n }\\n\\n // solve\\n\\n Cost eps = MX * n + 1;\\n while (eps > 1) {\\n eps = max<Cost>(eps >> 2, 1);\\n refine(eps);\\n }\\n\\n Cost ret = 0;\\n rep(i, 0, m) {\\n auto [from, fid] = pos[i];\\n es[i].flow = es[i].ub - g[from][fid].cap;\\n ret += es[i].flow * es[i].cost;\\n }\\n dual.assign(n, 0);\\n for (;;) {\\n bool upd = 0;\\n rep(i, 0, n) {\\n for (auto &e : g[i])\\n if (e.cap) {\\n auto cost = dual[i] + e.cost / n;\\n if (chmin(dual[e.to], cost)) {\\n upd = 1;\\n }\\n }\\n }\\n if (!upd)\\n break;\\n }\\n return {true, ret};\\n }\\n Cap get_flow(int i) const { return es[i].flow; }\\n\\n private:\\n void refine(Cost &eps) {\\n exc.assign(n, 0);\\n vector<int> used(n);\\n queue<int> que;\\n vector<int> iter(n);\\n\\n auto cost = [&](int from, const Edge &e) {\\n return e.cost + dual[from] - dual[e.to];\\n };\\n auto push = [&](int from, Edge &e, Cap cap) {\\n exc[from] -= cap;\\n exc[e.to] += cap;\\n g[e.to][e.rev].cap += cap;\\n e.cap -= cap;\\n };\\n auto relabel = [&](int v) {\\n iter[v] = 0;\\n Cost down = MX * (n + 1);\\n for (auto &e : g[v])\\n if (e.cap) {\\n chmin(down, eps + cost(v, e));\\n }\\n dual[v] -= down;\\n que.push(v);\\n used[v] = 1;\\n };\\n\\n rep(i, 0, n) {\\n for (auto &e : g[i])\\n if (e.cap and cost(i, e) < 0) {\\n push(i, e, e.cap);\\n }\\n }\\n rep(i, 0, n) if (exc[i] > 0) {\\n used[i] = 1;\\n que.push(i);\\n }\\n while (!que.empty()) {\\n auto v = que.front();\\n que.pop();\\n used[v] = 0;\\n for (int &i = iter[v]; i < SZ(g[v]); i++) {\\n auto &e = g[v][i];\\n if (e.cap and cost(v, e) < 0) {\\n push(v, e, min(exc[v], e.cap));\\n if (!used[e.to] and exc[e.to] > 0) {\\n used[e.to] = 1;\\n que.push(e.to);\\n }\\n if (exc[v] == 0)\\n break;\\n }\\n }\\n if (exc[v] > 0) {\\n relabel(v);\\n }\\n }\\n eps = 0;\\n rep(i, 0, n) {\\n for (auto &e : g[i])\\n if (e.cap) {\\n chmax(eps, -cost(i, e));\\n }\\n }\\n }\\n};\\n\\n/**\\n * @brief Minimum Cost b-flow\\n */\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<ll> A(N), B(N), X;\\n rep(i,0,N) cin >> A[i] >> B[i], X.push_back(A[i]), X.push_back(B[i]);\\n UNIQUE(X);\\n int L = X.size();\\n MinCostFlow<ll,ll> G(N+L+2);\\n G.add_edge(N+L+1,N+L,0,N,0);\\n rep(i,0,N) G.add_edge(N+L,i,0,1,0);\\n rep(i,0,L) G.add_edge(N+i,N+L+1,0,1,0);\\n rep(i,0,N) {\\n int AX = LB(X,A[i]), BX = LB(X,B[i]);\\n G.add_edge(i,N+AX,0,1,-B[i]);\\n G.add_edge(i,N+BX,0,1,-A[i]);\\n }\\n auto [b,ans] = G.run();\\n cout << -ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4312,\n \"score_of_the_acc\": -0.0121,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2293_9556864\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optmize(\\\"Ofast\\\")\\n\\ntemplate <class ft = long long, class ct = long long>\\nstruct PrimalDual {\\n const ct INF;\\n \\n struct edge {\\n int to;\\n int rev;\\n ft cap;\\n ct cost;\\n };\\n \\n int siz;\\n vector<vector<edge>> graph;\\n vector<ct> pot, minc;\\n vector<int> prev_v, prev_id;\\n \\n PrimalDual(int n) : siz(n), INF(1e18), graph(n) {}\\n \\n void add_edge(int from, int to, ft cap, ct cost) {\\n assert(from < siz && to < siz);\\n graph[from].emplace_back((edge){to, (int)graph[to].size(), cap, cost});\\n graph[to].emplace_back((edge){from, (int)graph[from].size() - 1, 0, -cost});\\n }\\n \\n ct min_cost_flow(int s, int t, ft f) {\\n ct ret = 0;\\n using Pi = pair<ct, int>;\\n priority_queue<Pi, vector<Pi>, greater<Pi> > pq;\\n pot.assign(siz, 0);\\n prev_v.assign(siz, -1);\\n prev_id.assign(siz, -1);\\n \\n while (f > 0) {\\n minc.assign(siz, INF);\\n pq.emplace(0, s);\\n minc[s] = 0;\\n \\n while (pq.size()) {\\n auto [cost, v] = pq.top();\\n pq.pop();\\n \\n if (minc[v] < cost) {\\n continue;\\n }\\n for (int i = 0; i < graph[v].size(); ++i) {\\n auto &e = graph[v][i];\\n ct nc = minc[v] + e.cost + pot[v] - pot[e.to];\\n if (e.cap > 0 && minc[e.to] > nc) {\\n minc[e.to] = nc;\\n prev_v[e.to] = v;\\n prev_id[e.to] = i;\\n pq.emplace(minc[e.to], e.to);\\n }\\n }\\n }\\n \\n if (minc[t] == INF) {\\n return -1;\\n }\\n \\n for (int v = 0; v < siz; ++v) {\\n pot[v] += minc[v];\\n }\\n ft addflow = f;\\n for (int v = t; v != s; v = prev_v[v]) {\\n addflow = min(addflow, graph[prev_v[v]][prev_id[v]].cap);\\n }\\n f -= addflow;\\n ret += addflow * pot[t];\\n for (int v = t; v != s; v = prev_v[v]) {\\n auto &e = graph[prev_v[v]][prev_id[v]];\\n e.cap -= addflow;\\n graph[e.to][e.rev].cap += addflow;\\n }\\n }\\n return ret;\\n }\\n \\n};\\n\\nconst ll ABMAX = int(1e6) + 1;\\n\\nint main() {\\n ll N; cin >> N;\\n vector<ll> A(N), B(N);\\n set<ll> zt;\\n zt.insert(0);\\n for (int i = 0; i < N; ++i) {\\n cin >> A[i] >> B[i];\\n zt.insert(A[i]);\\n zt.insert(B[i]);\\n }\\n \\n map< int, int > num_to_id;\\n {\\n int cnt = 0;\\n for (auto v : zt) {\\n num_to_id[v] = cnt;\\n cnt++;\\n }\\n }\\n int siz = zt.size();\\n \\n int S = siz + N, T = S + 1;\\n PrimalDual mcf(T + 1);\\n ll base = 0;\\n ll n0 = num_to_id[0];\\n for (int i = 0; i < N; ++i) {\\n ll a = A[i], b = B[i];\\n ll na = num_to_id[a], nb = num_to_id[b];\\n ll v = siz + i;\\n base += (a + b);\\n mcf.add_edge(S, v, 1, 0);\\n mcf.add_edge(v, n0, 1, a + b);\\n mcf.add_edge(v, na, 1, a);\\n mcf.add_edge(v, nb, 1, b);\\n }\\n for (auto [key, value] : num_to_id) {\\n ll f = 1;\\n if (key == 0) f = N;\\n mcf.add_edge(value, T, f, 0);\\n }\\n \\n ll cost = mcf.min_cost_flow(S, T, N);\\n ll res = base - cost;\\n cout << res << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 4224,\n \"score_of_the_acc\": -0.0974,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2293_9443876\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\ntemplate <class Cap, class Cost> struct mcf_graph {\\n public:\\n mcf_graph() {}\\n mcf_graph(int n) : _n(n), g(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 int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap, cost});\\n g[to].push_back(_edge{from, from_id, 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(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{\\n pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,\\n };\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result(m);\\n for (int i = 0; i < m; i++) {\\n result[i] = get_edge(i);\\n }\\n return result;\\n }\\n\\n std::pair<Cap, Cost> flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\\n return slope(s, t, flow_limit).back();\\n }\\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\\n return slope(s, t, std::numeric_limits<Cap>::max());\\n }\\n std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n // variants (C = maxcost):\\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\\n std::vector<Cost> dual(_n, 0), dist(_n);\\n std::vector<int> pv(_n), pe(_n);\\n std::vector<bool> vis(_n);\\n auto dual_ref = [&]() {\\n std::fill(dist.begin(), dist.end(),\\n std::numeric_limits<Cost>::max());\\n std::fill(pv.begin(), pv.end(), -1);\\n std::fill(pe.begin(), pe.end(), -1);\\n std::fill(vis.begin(), vis.end(), false);\\n struct Q {\\n Cost key;\\n int to;\\n bool operator<(Q r) const { return key > r.key; }\\n };\\n std::priority_queue<Q> que;\\n dist[s] = 0;\\n que.push(Q{0, s});\\n while (!que.empty()) {\\n int v = que.top().to;\\n que.pop();\\n if (vis[v]) continue;\\n vis[v] = true;\\n if (v == t) break;\\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\\n // dist[v] >= 0 (all reduced cost are positive)\\n // dist[v] <= (n-1)C\\n for (int i = 0; i < int(g[v].size()); i++) {\\n auto e = g[v][i];\\n if (vis[e.to] || !e.cap) continue;\\n // |-dual[e.to] + dual[v]| <= (n-1)C\\n // cost <= C - -(n-1)C + 0 = nC\\n Cost cost = e.cost - dual[e.to] + dual[v];\\n if (dist[e.to] - dist[v] > cost) {\\n dist[e.to] = dist[v] + cost;\\n pv[e.to] = v;\\n pe[e.to] = i;\\n que.push(Q{dist[e.to], e.to});\\n }\\n }\\n }\\n if (!vis[t]) {\\n return false;\\n }\\n\\n for (int v = 0; v < _n; v++) {\\n if (!vis[v]) continue;\\n // dual[v] = dual[v] - dist[t] + dist[v]\\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) + (shortest(s, v) + dual[s] - dual[v])\\n // = - shortest(s, t) + dual[t] + shortest(s, v)\\n // = shortest(s, v) - shortest(s, t) >= 0 - (n-1)C\\n dual[v] -= dist[t] - dist[v];\\n }\\n return true;\\n };\\n Cap flow = 0;\\n Cost cost = 0, prev_cost_per_flow = -1;\\n std::vector<std::pair<Cap, Cost>> result;\\n result.push_back({flow, cost});\\n while (flow < flow_limit) {\\n if (!dual_ref()) break;\\n Cap c = flow_limit - flow;\\n for (int v = t; v != s; v = pv[v]) {\\n c = std::min(c, g[pv[v]][pe[v]].cap);\\n }\\n for (int v = t; v != s; v = pv[v]) {\\n auto& e = g[pv[v]][pe[v]];\\n e.cap -= c;\\n g[v][e.rev].cap += c;\\n }\\n Cost d = -dual[s];\\n flow += c;\\n cost += c * d;\\n if (prev_cost_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 private:\\n int _n;\\n\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n };\\n\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\n} // namespace atcoder\\n\\nusing namespace atcoder;\\nusing namespace std;\\nusing ll=long long;\\nusing vll=vector<ll>;\\n#define rep(i,n) for(ll i=0;i<ll(n);i++)\\n\\nint main(){\\n ll N;\\n cin>>N;\\n map<ll,ll> M;\\n vll A(N),B(N);\\n rep(i,N){\\n cin>>A[i]>>B[i];\\n M[A[i]]=M[B[i]]=1;\\n }\\n ll cnt=N;\\n for(auto m:M)M[m.first]=cnt,cnt++;\\n ll S=cnt;\\n ll T=cnt+1;\\n mcf_graph<ll,ll> G(cnt+2);\\n rep(i,N)G.add_edge(S,i,1,0);\\n ll d=1e9;\\n rep(i,N){\\n G.add_edge(i,M[A[i]],1,d-B[i]);\\n G.add_edge(i,M[B[i]],1,d-A[i]);\\n }\\n \\n for(auto m:M){\\n G.add_edge(m.second,T,1,0);\\n }\\n\\n auto V=G.slope(S,T);\\n ll VN=V.size();\\n ll an=0;\\n rep(i,VN-1){\\n ll rang=(V[i+1].second-V[i].second)/(V[i+1].first-V[i].first);\\n for(ll j=V[i].first;j<=V[i+1].first;j++){\\n ll res=V[i].second+rang*(j-V[i].first);\\n an=max(an,d*j-res);\\n }\\n }\\n cout<<an<<endl;\\n\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4128,\n \"score_of_the_acc\": -0.0316,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2293_9373890\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\n\\ntemplate<class T = ll>\\nstruct MCF {\\nprivate:\\n const T inf = 1e18;\\n vector<T> dist; //最短距離(費用)\\n vector<int> pv, pe; //直前の頂点、辺 \\n\\npublic:\\n struct edge {\\n int to, rev; long long cap; T cost;\\n edge(int t = 0, int r = 0, long long ca = 0, T co = 0)\\n : to(t), rev(r), cap(ca), cost(co) {}\\n };\\n\\n struct pii {\\n T d; int v; //最短距離(費用)、頂点番号\\n pii(T d_ = 0, int v_ = 0) : d(d_), v(v_) {}\\n\\n bool operator<(const pii& other) const {\\n if (d != other.d) return d < other.d;\\n return v < other.v;\\n }\\n\\n bool operator>(const pii& other) const {\\n if (d != other.d) return d > other.d;\\n return v > other.v;\\n }\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n vector<T> pot; //ポテンシャル\\n\\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\\n\\n void addedge(int u, int v, long long cap, T cost) {\\n int su = (int)to[u].size();\\n int sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap, cost });\\n to[v].push_back({ u, su, 0, -cost });\\n }\\n\\n //s->tへ流量fの最小費用流、流せないときは-1\\n T mincostflow(int s, int t, long long f) {\\n T res = 0;\\n pot.assign(n, 0);\\n while (f) {\\n priority_queue<pii, vector<pii>, greater<pii>> pq;\\n dist.assign(n, inf);\\n dist[s] = 0;\\n pq.push({ 0, s });\\n while (!pq.empty()) {\\n pii elem = pq.top();\\n pq.pop();\\n if (dist[elem.v] < elem.d) continue;\\n int sv = (int)to[elem.v].size();\\n for (int i = 0; i < sv; i++) {\\n edge& nv = to[elem.v][i];\\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\\n pv[nv.to] = elem.v;\\n pe[nv.to] = i;\\n pq.push({ dist[nv.to], nv.to });\\n }\\n }\\n\\n if (dist[t] == inf) return res; //流せる最小費用流が存在しない\\n\\n for (int v = 0; v < n; v++) pot[v] += dist[v];\\n\\n long long nf = f;\\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\\n f -= nf;\\n if (nf * (pot[t] - pot[s]) > 0) return res;\\n\\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\\n for (int v = t; v != s; v = pv[v]) {\\n edge& nv = to[pv[v]][pe[v]];\\n nv.cap -= nf;\\n to[v][nv.rev].cap += nf;\\n }\\n }\\n return res;\\n }\\n\\n //s->tへ流量fの最小費用流、流せないときは費用と流せなかった流量のペア\\n pair<T, long long> mincostflow_pair(int s, int t, long long f) {\\n T res = 0;\\n pot.assign(n, 0);\\n while (f) {\\n priority_queue<pii, vector<pii>, greater<pii>> pq;\\n dist.assign(n, inf);\\n dist[s] = 0;\\n pq.push({ 0, s });\\n while (!pq.empty()) {\\n pii elem = pq.top();\\n pq.pop();\\n if (dist[elem.v] < elem.d) continue;\\n int sv = (int)to[elem.v].size();\\n for (int i = 0; i < sv; i++) {\\n edge& nv = to[elem.v][i];\\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\\n pv[nv.to] = elem.v;\\n pe[nv.to] = i;\\n pq.push({ dist[nv.to], nv.to });\\n }\\n }\\n\\n if (dist[t] == inf) return { res, f }; //流せる最小費用流が存在しない\\n\\n for (int v = 0; v < n; v++) pot[v] += dist[v];\\n\\n long long nf = f;\\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\\n f -= nf; \\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\\n for (int v = t; v != s; v = pv[v]) {\\n edge& nv = to[pv[v]][pe[v]];\\n nv.cap -= nf;\\n to[v][nv.rev].cap += nf;\\n }\\n }\\n return { res, f };\\n }\\n};\\n\\nint main()\\n{\\n int n;\\n cin >> n;\\n vi<int> a(n), b(n);\\n rep(i, n) cin >> a[i] >> b[i];\\n\\n map<int, int> mp;\\n rep(i, n) mp[a[i]];\\n rep(i, n) mp[b[i]];\\n int idx = 0;\\n for (auto& elem : mp) elem.second = idx++;\\n\\n int sz = (int)mp.size();\\n\\n MCF mcf(n + sz + 2);\\n int S = n + sz, T = S + 1;\\n\\n rep(i, n) mcf.addedge(S, i, 1, 0);\\n rep(j, sz) mcf.addedge(j + n, T, 1, 0);\\n\\n rep(i, n) {\\n mcf.addedge(i, mp[a[i]] + n, 1, -b[i]);\\n mcf.addedge(i, mp[b[i]] + n, 1, -a[i]);\\n }\\n\\n auto ans = mcf.mincostflow(S, T, n);\\n cout << -ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 4028,\n \"score_of_the_acc\": -0.1325,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2293_9373855\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\n\\ntemplate<class T = ll>\\nstruct MCF {\\nprivate:\\n const T inf = 1e18;\\n vector<T> dist; //最短距離(費用)\\n vector<int> pv, pe; //直前の頂点、辺 \\n\\npublic:\\n struct edge {\\n int to, rev; long long cap; T cost;\\n edge(int t = 0, int r = 0, long long ca = 0, T co = 0)\\n : to(t), rev(r), cap(ca), cost(co) {}\\n };\\n\\n struct pii {\\n T d; int v; //最短距離(費用)、頂点番号\\n pii(T d_ = 0, int v_ = 0) : d(d_), v(v_) {}\\n\\n bool operator<(const pii& other) const {\\n if (d != other.d) return d < other.d;\\n return v < other.v;\\n }\\n\\n bool operator>(const pii& other) const {\\n if (d != other.d) return d > other.d;\\n return v > other.v;\\n }\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n vector<T> pot; //ポテンシャル\\n\\n MCF(int n_ = 1) : n(n_), to(n_), pot(n_), dist(n_), pv(n_), pe(n_) {}\\n\\n void addedge(int u, int v, long long cap, T cost) {\\n int su = (int)to[u].size();\\n int sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap, cost });\\n to[v].push_back({ u, su, 0, -cost });\\n }\\n\\n //s->tへ流量fの最小費用流、流せないときは-1\\n T mincostflow(int s, int t, long long f) {\\n T res = 0;\\n pot.assign(n, 0);\\n while (f) {\\n priority_queue<pii, vector<pii>, greater<pii>> pq;\\n dist.assign(n, inf);\\n dist[s] = 0;\\n pq.push({ 0, s });\\n while (!pq.empty()) {\\n pii elem = pq.top();\\n pq.pop();\\n if (dist[elem.v] < elem.d) continue;\\n int sv = (int)to[elem.v].size();\\n for (int i = 0; i < sv; i++) {\\n edge& nv = to[elem.v][i];\\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\\n pv[nv.to] = elem.v;\\n pe[nv.to] = i;\\n pq.push({ dist[nv.to], nv.to });\\n }\\n }\\n\\n if (dist[t] == inf) return -1; //流せる最小費用流が存在しない\\n\\n for (int v = 0; v < n; v++) pot[v] += dist[v];\\n\\n long long nf = f;\\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\\n f -= nf;\\n if (nf * (pot[t] - pot[s]) > 0) return res;\\n\\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\\n for (int v = t; v != s; v = pv[v]) {\\n edge& nv = to[pv[v]][pe[v]];\\n nv.cap -= nf;\\n to[v][nv.rev].cap += nf;\\n }\\n }\\n return res;\\n }\\n\\n //s->tへ流量fの最小費用流、流せないときは費用と流せなかった流量のペア\\n pair<T, long long> mincostflow_pair(int s, int t, long long f) {\\n T res = 0;\\n pot.assign(n, 0);\\n while (f) {\\n priority_queue<pii, vector<pii>, greater<pii>> pq;\\n dist.assign(n, inf);\\n dist[s] = 0;\\n pq.push({ 0, s });\\n while (!pq.empty()) {\\n pii elem = pq.top();\\n pq.pop();\\n if (dist[elem.v] < elem.d) continue;\\n int sv = (int)to[elem.v].size();\\n for (int i = 0; i < sv; i++) {\\n edge& nv = to[elem.v][i];\\n if (nv.cap == 0 || dist[nv.to] + pot[nv.to] <= dist[elem.v] + pot[elem.v] + nv.cost) continue;\\n dist[nv.to] = dist[elem.v] + pot[elem.v] - pot[nv.to] + nv.cost;\\n pv[nv.to] = elem.v;\\n pe[nv.to] = i;\\n pq.push({ dist[nv.to], nv.to });\\n }\\n }\\n\\n if (dist[t] == inf) return { res, f }; //流せる最小費用流が存在しない\\n\\n for (int v = 0; v < n; v++) pot[v] += dist[v];\\n\\n long long nf = f;\\n for (int v = t; v != s; v = pv[v]) nf = min(nf, to[pv[v]][pe[v]].cap);\\n f -= nf; \\n res += nf * (pot[t] - pot[s]); //pot[s] = 0で不要だがポテンシャルを明確化する\\n for (int v = t; v != s; v = pv[v]) {\\n edge& nv = to[pv[v]][pe[v]];\\n nv.cap -= nf;\\n to[v][nv.rev].cap += nf;\\n }\\n }\\n return { res, f };\\n }\\n};\\n\\nint main()\\n{\\n int n;\\n cin >> n;\\n vi<int> a(n), b(n);\\n rep(i, n) cin >> a[i] >> b[i];\\n\\n map<int, int> mp;\\n rep(i, n) mp[a[i]];\\n rep(i, n) mp[b[i]];\\n int idx = 0;\\n for (auto& elem : mp) elem.second = idx++;\\n\\n int sz = (int)mp.size();\\n\\n MCF mcf(n + sz + 2);\\n int S = n + sz, T = S + 1;\\n\\n const ll inf = 1e18;\\n rep(i, n) mcf.addedge(S, i, 1, 0);\\n rep(j, sz) mcf.addedge(j + n, T, 1, 0);\\n\\n rep(i, n) {\\n mcf.addedge(i, mp[a[i]] + n, 1, -b[i]);\\n mcf.addedge(i, mp[b[i]] + n, 1, -a[i]);\\n }\\n\\n auto ans = mcf.mincostflow(S, T, n);\\n cout << -ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 170,\n \"memory_kb\": 3888,\n \"score_of_the_acc\": -0.1292,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2293_8721943\",\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\\n\\n\\n\\n\\nnamespace zawa {\\n\\nclass U32Pair {\\nprivate:\\n static constexpr u32 SHIFT{32};\\n static constexpr u32 MASK{static_cast<u32>((1LL << SHIFT) - 1)};\\n u64 value_{};\\npublic:\\n constexpr U32Pair() {}\\n constexpr U32Pair(u32 first, u32 second) {\\n value_ = (static_cast<u64>(first) << SHIFT) | second;\\n }\\n constexpr u32 first() const noexcept {\\n return static_cast<u32>(value_ >> SHIFT);\\n }\\n constexpr u32 second() const noexcept {\\n return static_cast<u32>(value_ & MASK);\\n }\\n constexpr u64 combined() const noexcept {\\n return value_;\\n }\\n constexpr U32Pair& operator=(const U32Pair& rhs) {\\n value_ = rhs.value_;\\n return *this;\\n }\\n friend constexpr bool operator==(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ == rhs.value_;\\n }\\n friend constexpr bool operator!=(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ != rhs.value_;\\n }\\n friend constexpr bool operator<(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ < rhs.value_;\\n }\\n friend constexpr bool operator<=(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ <= rhs.value_;\\n }\\n friend constexpr bool operator>(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ > rhs.value_;\\n }\\n friend constexpr bool operator>=(const U32Pair& lhs, const U32Pair& rhs) {\\n return lhs.value_ >= rhs.value_;\\n }\\n friend std::ostream& operator<<(std::ostream& os, const U32Pair& pair) {\\n os << '(' << pair.first() << ',' << pair.second() << ')';\\n return os;\\n }\\n};\\n\\nstruct U32PairHash {\\n usize operator()(const U32Pair& pair) const noexcept {\\n return std::hash<u64>{}(pair.combined());\\n }\\n};\\n\\n} // namespace zawa\\n\\n#include <type_traits>\\n\\nnamespace zawa {\\n\\ntemplate <class Cap, class Cost>\\nclass SuccessiveShortestPath {\\npublic:\\n static_assert(std::is_signed_v<Cost>, U\\\"Cost must be signed\\\");\\n static constexpr Cost invalid{(std::numeric_limits<Cost>::max() >> 1) - 1};\\n static constexpr u32 reverseId(u32 i) noexcept {\\n return i ^ 1;\\n }\\n\\n struct Edge {\\n u32 from{}, to{};\\n Cap residual{};\\n Cost cost{};\\n Edge() = default;\\n Edge(u32 from, u32 to, const Cap& cap, const Cost& cost)\\n : from{from}, to{to}, residual{cap}, cost{cost} {}\\n };\\n\\n usize n_{}, m_{};\\n std::vector<Edge> edges_;\\n std::vector<std::vector<u32>> g_;\\n std::vector<Cost> dist_, potential_;\\n std::vector<U32Pair> prev_;\\n Cost mcf{};\\n\\n constexpr usize size() const noexcept {\\n return n_;\\n }\\n constexpr usize edgeSize() const noexcept {\\n return m_;\\n }\\n \\n SuccessiveShortestPath() = default;\\n SuccessiveShortestPath(usize n, usize m = usize{}) \\n : n_{n}, m_{}, edges_{}, g_(n), dist_(n), potential_(n), prev_(n), mcf{} {\\n g_.shrink_to_fit();\\n dist_.shrink_to_fit();\\n potential_.shrink_to_fit();\\n prev_.shrink_to_fit();\\n edges_.reserve(2 * m);\\n }\\n\\n void emplace(u32 from, u32 to, const Cap& cap, const Cost& cost) {\\n g_[from].emplace_back(m_);\\n edges_.emplace_back(from, to, cap, cost);\\n m_++;\\n }\\n\\n u32 addEdge(u32 from, u32 to, const Cap& cap, const Cost& cost) {\\n assert(from < size());\\n assert(to < size());\\n u32 res{static_cast<u32>(m_)};\\n emplace(from, to, cap, cost);\\n emplace(to, from, Cap{}, -cost);\\n return res;\\n }\\n\\n inline u32 from(u32 i) const noexcept {\\n return edges_[i].from;\\n }\\n inline u32 to(u32 i) const noexcept {\\n return edges_[i].to;\\n }\\n inline const Cap& residual(u32 i) const noexcept {\\n return edges_[i].residual;\\n }\\n inline const Cost& cost(u32 i) const noexcept {\\n return edges_[i].cost;\\n }\\n inline const Cap& flowed(u32 i) const noexcept {\\n assert(i < edgeSize());\\n return residual(i ^ 1);\\n }\\n inline const Cap& capcacity(u32 i) const noexcept {\\n assert(i < edgeSize());\\n return residual(i) + flowed(i);\\n }\\n\\n inline Cost edgeCost(u32 i) const noexcept {\\n return potential_[from(i)] + cost(i) - potential_[to(i)];\\n }\\n bool relax(u32 i) {\\n if (residual(i) > 0 and dist_[to(i)] > dist_[from(i)] + edgeCost(i)) {\\n dist_[to(i)] = dist_[from(i)] + edgeCost(i);\\n prev_[to(i)] = U32Pair{from(i), i};\\n return true;\\n }\\n return false;\\n }\\n\\n bool dijkstra(u32 s, u32 t) {\\n assert(s < size());\\n assert(t < size());\\n std::fill(dist_.begin(), dist_.end(), invalid);\\n dist_[s] = Cost{};\\n using qt = std::pair<Cost, u32>;\\n std::priority_queue<qt, std::vector<qt>, std::greater<qt>> que;\\n que.emplace(dist_[s], s);\\n while (que.size()) {\\n auto [d, v]{que.top()};\\n que.pop();\\n if (dist_[v] < d) continue;\\n for (u32 i : g_[v]) {\\n if (relax(i)) {\\n que.emplace(dist_[to(i)], to(i));\\n }\\n }\\n }\\n return dist_[t] < invalid;\\n }\\n\\n bool dagdp(u32 s, u32 t) {\\n assert(s < size());\\n assert(t < size());\\n std::fill(dist_.begin(), dist_.end(), invalid);\\n dist_[s] = Cost{};\\n std::vector<u32> ord;\\n ord.reserve(size());\\n std::vector<bool> vis(size());\\n vis[s] = true;\\n ord.push_back(s);\\n for (u32 i{} ; i < ord.size() ; i++) {\\n u32 v{ord[i]};\\n for (auto e : g_[v]) {\\n if (!vis[to(e)]) {\\n ord.push_back(to(e));\\n vis[to(e)] = true;\\n }\\n relax(e);\\n }\\n }\\n return dist_[t] < invalid;\\n }\\n\\n bool bellmanford(u32 s, u32 t) {\\n assert(s < size());\\n assert(t < size());\\n std::fill(dist_.begin(), dist_.end(), invalid);\\n dist_[s] = Cost{};\\n for (u32 i{} ; i + 1 < size() ; i++) {\\n for (u32 j{} ; j < edgeSize() ; j++) {\\n relax(j);\\n }\\n }\\n return dist_[t] < invalid;\\n }\\n\\n\\n Cap flush(u32 s, u32 t, Cap up = std::numeric_limits<Cap>::max()) {\\n for (u32 v{t} ; v != s ; v = prev_[v].first()) {\\n up = std::min(up, residual(prev_[v].second()));\\n }\\n for (u32 v{t} ; v != s ; v = prev_[v].first()) {\\n edges_[prev_[v].second()].residual -= up;\\n edges_[prev_[v].second() ^ 1].residual += up;\\n }\\n return up;\\n }\\n\\n bool flow(u32 s, u32 t, Cap flow) {\\n assert(s < size());\\n assert(t < size());\\n while (flow > 0 and dijkstra(s, t)) {\\n for (u32 i{} ; i < size() ; i++) {\\n potential_[i] = potential_[i] + (dist_[i] == invalid ? Cost{} : dist_[i]);\\n }\\n Cap water{flush(s, t, flow)};\\n mcf += potential_[t] * water;\\n flow -= water;\\n }\\n return flow == 0;\\n }\\n\\n Cap maxflow(u32 s, u32 t) {\\n assert(s < size());\\n assert(t < size());\\n Cap flow{};\\n while (dijkstra(s, t)) {\\n for (u32 i{} ; i < size() ; i++) {\\n potential_[i] = potential_[i] + (dist_[i] == invalid ? Cost{} : dist_[i]);\\n }\\n Cap water{flush(s, t)};\\n mcf += potential_[t] * water;\\n flow += water;\\n }\\n return flow;\\n }\\n\\n struct Line {\\n Cap dn{}, up{};\\n Cost slope{};\\n Line() = default;\\n Line(Cap dn, Cap up, Cost slope) : dn{dn}, up{up}, slope{slope} {}\\n };\\n std::vector<Line> slope(u32 s, u32 t) {\\n assert(s < size());\\n assert(t < size()); \\n Cap flow{};\\n std::vector<Line> res;\\n while (dijkstra(s, t)) {\\n for (u32 i{} ; i < size() ; i++) {\\n potential_[i] = potential_[i] + (dist_[i] == invalid ? Cost{} : dist_[i]);\\n }\\n Cap water{flush(s, t)};\\n mcf += potential_[t] * water;\\n res.emplace_back(flow, flow + water, potential_[t]);\\n flow += water;\\n }\\n return res;\\n }\\n\\n Cost minCost() const noexcept {\\n return mcf;\\n }\\n};\\n\\n} // namespace zawa\\n\\n\\n\\nnamespace zawa {\\n\\ntemplate <class T>\\nclass CompressedSequence {\\nprivate:\\n std::vector<T> comped_;\\n std::vector<u32> f_;\\n \\npublic:\\n CompressedSequence() = default;\\n CompressedSequence(const std::vector<T>& A) : comped_(A), f_(A.size()) {\\n std::sort(comped_.begin(), comped_.end());\\n comped_.erase(std::unique(comped_.begin(), comped_.end()), comped_.end());\\n comped_.shrink_to_fit();\\n f_.shrink_to_fit();\\n for (u32 i{} ; i < A.size() ; i++) {\\n f_[i] = std::lower_bound(comped_.begin(), comped_.end(), A[i]) - comped_.begin();\\n }\\n } \\n\\n inline usize size() const noexcept {\\n return comped_.size();\\n }\\n\\n u32 operator[](const T& v) const {\\n return std::lower_bound(comped_.begin(), comped_.end(), v) - comped_.begin();\\n }\\n\\n inline u32 map(u32 i) const noexcept {\\n assert(i < f_.size());\\n return f_[i];\\n }\\n\\n inline T inverse(u32 i) const noexcept {\\n assert(i < size());\\n return comped_[i];\\n }\\n};\\n\\n} // namespace zawa\\nusing namespace zawa;\\n\\nint main() {\\n SetFastIO();\\n \\n int n; std::cin >> n;\\n std::vector<int> a(n), b(n);\\n std::vector<int> app(2 * n);\\n for (int i{} ; i < n ; i++) {\\n std::cin >> a[i] >> b[i];\\n app[2 * i] = a[i];\\n app[2 * i + 1] = b[i];\\n }\\n CompressedSequence<int> comp(app);\\n int m{(int)comp.size()};\\n SuccessiveShortestPath<int, long long> mcf(n + m + 2);\\n int source{n + m}, sink{source + 1};\\n for (int i{} ; i < n ; i++) {\\n mcf.addEdge(source, i, 1, 0);\\n }\\n for (int i{} ; i < m ; i++) {\\n mcf.addEdge(n + i, sink, 1, comp.inverse(i));\\n }\\n for (int i{} ; i < n ; i++) {\\n mcf.addEdge(i, n + comp[a[i]], 1, 0);\\n mcf.addEdge(i, n + comp[b[i]], 1, 0);\\n mcf.addEdge(i, sink, 1, a[i] + b[i]);\\n }\\n assert(mcf.flow(source, sink, n));\\n long long ans{-mcf.minCost()};\\n for (int i{} ; i < n ; i++) {\\n ans += a[i] + b[i];\\n }\\n std::cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3976,\n \"score_of_the_acc\": -0.1551,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2293_8521489\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define repd(i,a,b) for (ll i=(a);i<(b);i++)\\n#define rep(i,n) repd(i,0,n)\\n#define all(x) (x).begin(),(x).end()\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntypedef long long ll;\\ntypedef pair<ll,ll> P;\\ntypedef vector<ll> vec;\\nusing Graph = vector<vector<ll>>;\\nconst long long INF = 1LL<<60;\\nconst long long MOD = 1000000007;\\n\\n//https://github.com/atcoder/ac-library\\n#ifndef ATCODER_INTERNAL_CSR_HPP\\n#define ATCODER_INTERNAL_CSR_HPP 1\\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#endif // ATCODER_INTERNAL_CSR_HPP\\n\\n#ifndef ATCODER_INTERNAL_QUEUE_HPP\\n#define ATCODER_INTERNAL_QUEUE_HPP 1\\n\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#endif // ATCODER_INTERNAL_QUEUE_HPP\\n\\n#ifndef ATCODER_MINCOSTFLOW_HPP\\n#define ATCODER_MINCOSTFLOW_HPP 1\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\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 // inside edge\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n };\\n\\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\\n int s,\\n int t,\\n Cap flow_limit) {\\n // variants (C = maxcost):\\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\\n\\n // dual_dist[i] = (dual[i], dist[i])\\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\\n std::vector<int> prev_e(_n);\\n std::vector<bool> vis(_n);\\n struct Q {\\n Cost key;\\n int to;\\n bool operator<(Q r) const { return key > r.key; }\\n };\\n std::vector<int> que_min;\\n std::vector<Q> que;\\n auto dual_ref = [&]() {\\n for (int i = 0; i < _n; i++) {\\n dual_dist[i].second = std::numeric_limits<Cost>::max();\\n }\\n std::fill(vis.begin(), vis.end(), false);\\n que_min.clear();\\n que.clear();\\n\\n // que[0..heap_r) was heapified\\n size_t heap_r = 0;\\n\\n dual_dist[s].second = 0;\\n que_min.push_back(s);\\n while (!que_min.empty() || !que.empty()) {\\n int v;\\n if (!que_min.empty()) {\\n v = que_min.back();\\n que_min.pop_back();\\n } else {\\n while (heap_r < que.size()) {\\n heap_r++;\\n std::push_heap(que.begin(), que.begin() + heap_r);\\n }\\n v = que.front().to;\\n std::pop_heap(que.begin(), que.end());\\n que.pop_back();\\n heap_r--;\\n }\\n if (vis[v]) continue;\\n vis[v] = true;\\n if (v == t) break;\\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\\n // dist[v] >= 0 (all reduced cost are positive)\\n // dist[v] <= (n-1)C\\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\\n auto e = g.elist[i];\\n if (!e.cap) continue;\\n // |-dual[e.to] + dual[v]| <= (n-1)C\\n // cost <= C - -(n-1)C + 0 = nC\\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\\n if (dual_dist[e.to].second - dist_v > cost) {\\n Cost dist_to = dist_v + cost;\\n dual_dist[e.to].second = dist_to;\\n prev_e[e.to] = e.rev;\\n if (dist_to == dist_v) {\\n que_min.push_back(e.to);\\n } else {\\n que.push_back(Q{dist_to, e.to});\\n }\\n }\\n }\\n }\\n if (!vis[t]) {\\n return false;\\n }\\n\\n for (int v = 0; v < _n; v++) {\\n if (!vis[v]) continue;\\n // dual[v] = dual[v] - dist[t] + dist[v]\\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +\\n // (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,\\n // t) + dual[t] + shortest(s, v) = shortest(s, v) -\\n // shortest(s, t) >= 0 - (n-1)C\\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\\n }\\n return true;\\n };\\n Cap flow = 0;\\n Cost cost = 0, prev_cost_per_flow = -1;\\n std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};\\n while (flow < flow_limit) {\\n if (!dual_ref()) break;\\n Cap c = flow_limit - flow;\\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\\n }\\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\\n auto& e = g.elist[prev_e[v]];\\n e.cap += c;\\n g.elist[e.rev].cap -= c;\\n }\\n Cost d = -dual_dist[s].first;\\n flow += c;\\n cost += c * d;\\n if (prev_cost_per_flow == d) {\\n result.pop_back();\\n }\\n result.push_back({flow, cost});\\n prev_cost_per_flow = d;\\n }\\n return result;\\n }\\n};\\n\\n} // namespace atcoder\\n\\n#endif // ATCODER_MINCOSTFLOW_HPP\\n\\nusing namespace atcoder;\\n\\ntemplate <typename T>\\nvector<T> compress(vector<T> &X) {\\n // ソートした結果を vals に\\n vector<T> vals = X;\\n sort(vals.begin(), vals.end());\\n // 隣り合う重複を削除(unique), 末端のゴミを削除(erase)\\n vals.erase(unique(vals.begin(), vals.end()), vals.end());\\n // 各要素ごとに二分探索で位置を求める\\n for (int i = 0; i < (int)X.size(); i++) {\\n X[i] = lower_bound(vals.begin(), vals.end(), X[i]) - vals.begin();\\n }\\n return vals;\\n}\\n\\nint main()\\n{ \\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n ll n;cin>>n;\\n vec a(n),b(n);\\n rep(i,n)cin>>a[i]>>b[i];\\n vec memo;\\n rep(i,n){\\n memo.push_back(a[i]);\\n memo.push_back(b[i]);\\n }\\n compress(memo);\\n mcf_graph<ll,ll> g(n*3+2);\\n ll x=1e12;\\n rep(i,n){\\n g.add_edge(2+i,2+n+memo[2*i],1,x-b[i]);\\n g.add_edge(2+i,2+n+memo[2*i+1],1,x-a[i]);\\n g.add_edge(0,2+i,1,0);\\n g.add_edge(2+n+2*i,1,1,0);\\n g.add_edge(2+n+2*i+1,1,1,0);\\n }\\n g.add_edge(0,1,n,x);\\n ll ans=g.flow(0,1,n).second;\\n ans%=x;\\n ans=x-ans;\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4084,\n \"score_of_the_acc\": -0.0147,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2293_7746496\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing pint = pair<int, int>;\\nusing pll = pair<long long, long long>;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\n#define REP(i, n) for (long long i = 0; i < (long long)(n); ++i)\\n#define REP2(i, a, b) for (long long i = a; i < (long long)(b); ++i)\\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, deque<T> P)\\n{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << \\\" \\\"; } s << P[i]; } return s; }\\ntemplate<class T> ostream& operator << (ostream &s, vector<vector<T> > P)\\n{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }\\ntemplate<class T> ostream& operator << (ostream &s, set<T> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it << \\\"> \\\"; } return s; }\\ntemplate<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)\\n{ for(auto it : P) { s << \\\"<\\\" << it.first << \\\"->\\\" << it.second << \\\"> \\\"; } return s; }\\n\\n\\n// edge class (for network-flow)\\ntemplate<class FLOWTYPE, class COSTTYPE> struct Edge {\\n int rev, from, to, id;\\n FLOWTYPE cap, icap;\\n COSTTYPE cost;\\n Edge(int r, int f, int t, FLOWTYPE ca, COSTTYPE co, int id = -1) :\\n rev(r), from(f), to(t), cap(ca), icap(ca), cost(co), id(id) {}\\n friend ostream& operator << (ostream& s, const Edge& E) {\\n if (E.cap > 0)\\n return s << E.from << \\\"->\\\" << E.to <<\\n '(' << E.cap << ',' << E.cost << ')';\\n else return s;\\n }\\n};\\n\\n// graph class (for network-flow)\\ntemplate<class FLOWTYPE, class COSTTYPE> struct Graph {\\n vector<vector<Edge<FLOWTYPE, COSTTYPE> > > list;\\n \\n Graph(int n = 0) : list(n) { }\\n void init(int n = 0) { list.clear(); list.resize(n); }\\n void reset() { for (int i = 0; i < (int)list.size(); ++i) for (int j = 0; j < list[i].size(); ++j) list[i][j].cap = list[i][j].icap; }\\n inline vector<Edge<FLOWTYPE, COSTTYPE> >& operator [] (int i) { return list[i]; }\\n inline const size_t size() const { return list.size(); }\\n \\n inline Edge<FLOWTYPE, COSTTYPE> &redge(const Edge<FLOWTYPE, COSTTYPE> &e) {\\n if (e.from != e.to) return list[e.to][e.rev];\\n else return list[e.to][e.rev + 1];\\n }\\n \\n void addedge(int from, int to, FLOWTYPE cap, COSTTYPE cost, int id = -1) {\\n list[from].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[to].size(), from, to, cap, cost, id));\\n list[to].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[from].size() - 1, to, from, 0, -cost));\\n }\\n \\n void add_undirected_edge(int from, int to, FLOWTYPE cap, COSTTYPE cost, int id = -1) {\\n list[from].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[to].size(), from, to, cap, cost, id));\\n list[to].push_back(Edge<FLOWTYPE, COSTTYPE>((int)list[from].size() - 1, to, from, cap, cost, id));\\n }\\n\\n friend ostream& operator << (ostream& s, const Graph& G) {\\n s << endl;\\n for (int i = 0; i < G.size(); ++i) {\\n s << i << \\\":\\\";\\n for (auto e : G.list[i]) s << \\\" \\\" << e;\\n s << endl;\\n }\\n return s;\\n }\\n};\\n\\n// min-cost flow (by primal-dual)\\ntemplate<class FLOWTYPE, class COSTTYPE> COSTTYPE MinCostFlow(Graph<FLOWTYPE, COSTTYPE> &G, int s, int t, FLOWTYPE f) {\\n int n = (int)G.size();\\n vector<COSTTYPE> dist(n, -1);\\n vector<int> prevv(n), preve(n), seen(n, 0);\\n COSTTYPE res = 0;\\n while (f > 0) {\\n seen.assign(n, 0);\\n dist[s] = 0;\\n seen[s] = true;\\n while (true) {\\n bool update = false;\\n for (int v = 0; v < n; ++v) {\\n if (!seen[v]) continue;\\n for (int i = 0; i < G[v].size(); ++i) {\\n Edge<FLOWTYPE, COSTTYPE> &e = G[v][i];\\n if (e.cap > 0 && (!seen[e.to] || 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 seen[e.to] = true;\\n update = true;\\n }\\n }\\n }\\n if (!update) break;\\n }\\n if (!seen[t]) return -1;\\n FLOWTYPE 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 += dist[t] * d;\\n for (int v = t; v != s; v = prevv[v]) {\\n Edge<FLOWTYPE, COSTTYPE> &e = G[prevv[v]][preve[v]];\\n Edge<FLOWTYPE, COSTTYPE> &re = G.redge(e);\\n e.cap -= d;\\n re.cap += d;\\n }\\n }\\n return res;\\n}\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<int> A(N), B(N), lens;\\n for (int i = 0; i < N; ++i) {\\n cin >> A[i] >> B[i];\\n lens.push_back(A[i]);\\n lens.push_back(B[i]);\\n }\\n sort(lens.begin(), lens.end());\\n lens.erase(unique(lens.begin(), lens.end()), lens.end());\\n \\n // グラフ\\n int source = N + lens.size(), sink = N + lens.size() + 1;\\n Graph<int,int> G(N + lens.size() + 2);\\n \\n // ソース → 直方体\\n for (int i = 0; i < N; ++i) {\\n G.addedge(source, i, 1, 0);\\n }\\n // 長さ → シンク\\n for (int i = 0; i < lens.size(); ++i) {\\n G.addedge(i+N, sink, 1, 0);\\n }\\n // ソース → シンク\\n G.addedge(source, sink, N, 0);\\n // 直方体 → シンク\\n for (int i = 0; i < N; ++i) {\\n int aid = lower_bound(lens.begin(), lens.end(), A[i]) - lens.begin();\\n int bid = lower_bound(lens.begin(), lens.end(), B[i]) - lens.begin();\\n G.addedge(i, aid+N, 1, -B[i]);\\n G.addedge(i, bid+N, 1, -A[i]);\\n }\\n \\n int res = -MinCostFlow(G, source, sink, N);\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3928,\n \"score_of_the_acc\": -0.1381,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2293_7220354\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct Edge {\\n\\tlong long to, cap, cost, rev;\\n};\\n\\nclass MincostFlow {\\n\\tpublic:\\n\\tint size_ = 0;\\n\\tvector<vector<Edge>> G;\\n\\tvector<long long> Potential;\\n\\tvector<long long> Dist;\\n\\tvector<long long> Prev_Verts;\\n\\tvector<long long> Prev_ID;\\n\\tvector<bool> Used;\\n\\t\\n\\tvoid Initialize(int sz) {\\n\\t\\tsize_ = sz + 2;\\n\\t\\tG.resize(size_, vector<Edge>{});\\n\\t\\tPotential.resize(size_, 0);\\n\\t\\tDist.resize(size_, 0);\\n\\t\\tPrev_Verts.resize(size_, 0);\\n\\t\\tPrev_ID.resize(size_, 0);\\n\\t\\tUsed.resize(size_, false);\\n\\t}\\n\\t\\n\\tvoid add_edge(long long u, long long v, long long f, long long c) {\\n\\t\\t//cout << \\\"(u, v) = (\\\" << u << \\\", \\\" << v << \\\"), cap = \\\" << f << \\\", cost = \\\" << c << endl;\\n\\t\\tG[u].push_back(Edge{ v, f, c, (int)G[v].size() });\\n\\t\\tG[v].push_back(Edge{ u, 0LL, -c, (int)G[u].size() - 1 });\\n\\t}\\n\\t\\n\\tlong long mincost_flow(int s, int t, int f, int Mode) {\\n\\t\\tlong long current_ans = 0;\\n\\t\\tif (Mode == 1) {\\n\\t\\t\\tfor (int i = 0; i < size_; i++) Potential[i] = 0;\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Loop Phase\\n\\t\\twhile (f > 0) {\\n\\t\\t\\tpriority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> Q;\\n\\t\\t\\tfor (int i = 0; i < size_; i++) Dist[i] = (1LL << 60);\\n\\t\\t\\tfor (int i = 0; i < size_; i++) Prev_Verts[i] = -1;\\n\\t\\t\\tfor (int i = 0; i < size_; i++) Prev_ID[i] = -1;\\n\\t\\t\\tfor (int i = 0; i < size_; i++) Used[i] = false;\\n\\t\\t\\tDist[s] = 0;\\n\\t\\t\\tQ.push(make_pair(0, s));\\n\\t\\t\\t\\n\\t\\t\\t// Dijkstra\\n\\t\\t\\twhile (!Q.empty()) {\\n\\t\\t\\t\\tlong long pos = Q.top().second; Q.pop();\\n\\t\\t\\t\\tif (Used[pos] == true) continue;\\n\\t\\t\\t\\tUsed[pos] = true;\\n\\t\\t\\t\\tfor (int i = 0; i < (int)G[pos].size(); i++) {\\n\\t\\t\\t\\t\\tif (G[pos][i].cap == 0) continue;\\n\\t\\t\\t\\t\\tlong long nex = G[pos][i].to;\\n\\t\\t\\t\\t\\tlong long dst = G[pos][i].cost + Potential[pos] - Potential[nex];\\n\\t\\t\\t\\t\\tif (Dist[nex] > Dist[pos] + dst) {\\n\\t\\t\\t\\t\\t\\tDist[nex] = Dist[pos] + dst;\\n\\t\\t\\t\\t\\t\\tPrev_Verts[nex] = pos;\\n\\t\\t\\t\\t\\t\\tPrev_ID[nex] = i;\\n\\t\\t\\t\\t\\t\\tQ.push(make_pair(Dist[nex], nex));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (Dist[t] == (1LL << 60)) break;\\n\\t\\t\\t\\n\\t\\t\\t// Refresh Edges [Part 1]\\n\\t\\t\\tlong long current_pos = t;\\n\\t\\t\\tlong long current_min = f;\\n\\t\\t\\twhile (current_pos != s) {\\n\\t\\t\\t\\tint nex = Prev_Verts[current_pos];\\n\\t\\t\\t\\tint idx = Prev_ID[current_pos];\\n\\t\\t\\t\\tcurrent_min = min(current_min, G[nex][idx].cap);\\n\\t\\t\\t\\tcurrent_pos = nex;\\n\\t\\t\\t}\\n\\t\\t\\tcurrent_ans += 1LL * current_min * (Dist[t] + Potential[t] - Potential[s]);\\n\\t\\t\\tf -= current_min;\\n\\t\\t\\t\\n\\t\\t\\t// Refresh Edges [Part 2]\\n\\t\\t\\tcurrent_pos = t;\\n\\t\\t\\twhile (current_pos != s) {\\n\\t\\t\\t\\tint nex = Prev_Verts[current_pos];\\n\\t\\t\\t\\tint idx = Prev_ID[current_pos];\\n\\t\\t\\t\\tG[nex][idx].cap -= current_min;\\n\\t\\t\\t\\tG[G[nex][idx].to][G[nex][idx].rev].cap += current_min;\\n\\t\\t\\t\\tcurrent_pos = nex;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Refresh Potential\\n\\t\\t\\tfor (int i = 0; i < size_; i++) {\\n\\t\\t\\t\\tif (Dist[i] != (1LL << 60)) Potential[i] += Dist[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Return\\n\\t\\treturn current_ans;\\n\\t}\\n};\\n\\nlong long N;\\nlong long A[1009], B[1009];\\nlong long X[2009], Y[2009];\\nvector<long long> Height[1000009];\\nMincostFlow Z;\\n\\nint main() {\\n\\t// Input\\n\\tcin >> N;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tcin >> A[i] >> B[i];\\n\\t\\tX[i + 0] = A[i]; Y[i + 0] = B[i];\\n\\t\\tX[i + N] = B[i]; Y[i + N] = A[i];\\n\\t}\\n\\tfor (int i = 1; i <= 2 * N; i++) Height[X[i]].push_back(i);\\n\\t\\n\\t// Build a Graph [Part 1]\\n\\tZ.Initialize(6 * N + 10);\\n\\tint Count = 0;\\n\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\tif (Height[i].size() == 0) continue;\\n\\t\\tCount += 1;\\n\\t\\tfor (int j : Height[i]) {\\n\\t\\t\\tZ.add_edge(2 * N + Count, j, 1, 0);\\n\\t\\t} \\n\\t}\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tZ.add_edge(i + 0, 2 * N + Count + i, 1, 1200000000LL - Y[i + 0]);\\n\\t\\tZ.add_edge(i + N, 2 * N + Count + i, 1, 1200000000LL - Y[i + N]);\\n\\t}\\n\\t\\n\\t// Build a Graph [Part 2]\\n\\tfor (int i = 1; i <= Count; i++) Z.add_edge(3 * N + Count + 1, 2 * N + i , 1, 0);\\n\\tfor (int i = 1; i <= N; i++) Z.add_edge(2 * N + Count + i, 3 * N + Count + 2, 1, 0);\\n\\t\\n\\t// Get Answer\\n\\tlong long FinalAns = 0, current_cost = 0;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tlong long val = Z.mincost_flow(3 * N + Count + 1, 3 * N + Count + 2, 1, 2);\\n\\t\\tif (val == 0) break;\\n\\t\\tcurrent_cost += val;\\n\\t\\tFinalAns = max(FinalAns, 1200000000LL * i - current_cost);\\n\\t}\\n\\t\\n\\t// Output\\n\\tcout << FinalAns << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 27780,\n \"score_of_the_acc\": -0.8598,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2293_7220330\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct Edge {\\n\\tlong long to, cap, cost, rev;\\n};\\n\\nclass MincostFlow {\\n\\tpublic:\\n\\tint size_ = 0;\\n\\tvector<vector<Edge>> G;\\n\\tvector<long long> Potential;\\n\\tvector<long long> Dist;\\n\\tvector<long long> Prev_Verts;\\n\\tvector<long long> Prev_ID;\\n\\tvector<bool> Used;\\n\\t\\n\\tvoid Initialize(int sz) {\\n\\t\\tsize_ = sz + 2;\\n\\t\\tG.resize(size_, vector<Edge>{});\\n\\t\\tPotential.resize(size_, 0);\\n\\t\\tDist.resize(size_, 0);\\n\\t\\tPrev_Verts.resize(size_, 0);\\n\\t\\tPrev_ID.resize(size_, 0);\\n\\t\\tUsed.resize(size_, false);\\n\\t}\\n\\t\\n\\tvoid add_edge(long long u, long long v, long long f, long long c) {\\n\\t\\t//cout << \\\"(u, v) = (\\\" << u << \\\", \\\" << v << \\\"), cap = \\\" << f << \\\", cost = \\\" << c << endl;\\n\\t\\tG[u].push_back(Edge{ v, f, c, (int)G[v].size() });\\n\\t\\tG[v].push_back(Edge{ u, 0LL, -c, (int)G[u].size() - 1 });\\n\\t}\\n\\t\\n\\tlong long mincost_flow(int s, int t, int f, int Mode) {\\n\\t\\tlong long current_ans = 0;\\n\\t\\tif (Mode == 1) {\\n\\t\\t\\tfor (int i = 0; i < size_; i++) Potential[i] = 0;\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Loop Phase\\n\\t\\twhile (f > 0) {\\n\\t\\t\\tpriority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>> Q;\\n\\t\\t\\tfor (int i = 0; i < size_; i++) Dist[i] = (1LL << 60);\\n\\t\\t\\tfor (int i = 0; i < size_; i++) Prev_Verts[i] = -1;\\n\\t\\t\\tfor (int i = 0; i < size_; i++) Prev_ID[i] = -1;\\n\\t\\t\\tfor (int i = 0; i < size_; i++) Used[i] = false;\\n\\t\\t\\tDist[s] = 0;\\n\\t\\t\\tQ.push(make_pair(0, s));\\n\\t\\t\\t\\n\\t\\t\\t// Dijkstra\\n\\t\\t\\twhile (!Q.empty()) {\\n\\t\\t\\t\\tlong long pos = Q.top().second; Q.pop();\\n\\t\\t\\t\\tif (Used[pos] == true) continue;\\n\\t\\t\\t\\tUsed[pos] = true;\\n\\t\\t\\t\\tfor (int i = 0; i < (int)G[pos].size(); i++) {\\n\\t\\t\\t\\t\\tif (G[pos][i].cap == 0) continue;\\n\\t\\t\\t\\t\\tlong long nex = G[pos][i].to;\\n\\t\\t\\t\\t\\tlong long dst = G[pos][i].cost + Potential[pos] - Potential[nex];\\n\\t\\t\\t\\t\\tif (Dist[nex] > Dist[pos] + dst) {\\n\\t\\t\\t\\t\\t\\tDist[nex] = Dist[pos] + dst;\\n\\t\\t\\t\\t\\t\\tPrev_Verts[nex] = pos;\\n\\t\\t\\t\\t\\t\\tPrev_ID[nex] = i;\\n\\t\\t\\t\\t\\t\\tQ.push(make_pair(Dist[nex], nex));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Refresh Edges [Part 1]\\n\\t\\t\\tlong long current_pos = t;\\n\\t\\t\\tlong long current_min = f;\\n\\t\\t\\twhile (current_pos != s) {\\n\\t\\t\\t\\tint nex = Prev_Verts[current_pos];\\n\\t\\t\\t\\tint idx = Prev_ID[current_pos];\\n\\t\\t\\t\\tcurrent_min = min(current_min, G[nex][idx].cap);\\n\\t\\t\\t\\tcurrent_pos = nex;\\n\\t\\t\\t}\\n\\t\\t\\tcurrent_ans += 1LL * current_min * (Dist[t] + Potential[t] - Potential[s]);\\n\\t\\t\\tf -= current_min;\\n\\t\\t\\t\\n\\t\\t\\t// Refresh Edges [Part 2]\\n\\t\\t\\tcurrent_pos = t;\\n\\t\\t\\twhile (current_pos != s) {\\n\\t\\t\\t\\tint nex = Prev_Verts[current_pos];\\n\\t\\t\\t\\tint idx = Prev_ID[current_pos];\\n\\t\\t\\t\\tG[nex][idx].cap -= current_min;\\n\\t\\t\\t\\tG[G[nex][idx].to][G[nex][idx].rev].cap += current_min;\\n\\t\\t\\t\\tcurrent_pos = nex;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\t// Refresh Potential\\n\\t\\t\\tif (Dist[t] == (1LL << 60)) break;\\n\\t\\t\\tfor (int i = 0; i < size_; i++) {\\n\\t\\t\\t\\tif (Dist[i] != (1LL << 60)) Potential[i] += Dist[i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\t// Return\\n\\t\\treturn current_ans;\\n\\t}\\n};\\n\\nlong long N;\\nlong long A[1009], B[1009];\\nlong long X[2009], Y[2009];\\nvector<long long> Height[1000009];\\nMincostFlow Z;\\n\\nint main() {\\n\\t// Input\\n\\tcin >> N;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tcin >> A[i] >> B[i];\\n\\t\\tX[i + 0] = A[i]; Y[i + 0] = B[i];\\n\\t\\tX[i + N] = B[i]; Y[i + N] = A[i];\\n\\t}\\n\\tfor (int i = 1; i <= 2 * N; i++) Height[X[i]].push_back(i);\\n\\t\\n\\t// Build a Graph [Part 1]\\n\\tZ.Initialize(6 * N + 10);\\n\\tint Count = 0;\\n\\tfor (int i = 1; i <= 1000000; i++) {\\n\\t\\tif (Height[i].size() == 0) continue;\\n\\t\\tCount += 1;\\n\\t\\tfor (int j : Height[i]) {\\n\\t\\t\\tZ.add_edge(2 * N + Count, j, 1, 0);\\n\\t\\t} \\n\\t}\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tZ.add_edge(i + 0, 2 * N + Count + i, 1, 1200000000LL - Y[i + 0]);\\n\\t\\tZ.add_edge(i + N, 2 * N + Count + i, 1, 1200000000LL - Y[i + N]);\\n\\t}\\n\\t\\n\\t// Build a Graph [Part 2]\\n\\tfor (int i = 1; i <= Count; i++) Z.add_edge(3 * N + Count + 1, 2 * N + i , 1, 0);\\n\\tfor (int i = 1; i <= N; i++) Z.add_edge(2 * N + Count + i, 3 * N + Count + 2, 1, 0);\\n\\t\\n\\t// Get Answer\\n\\tlong long FinalAns = 0, current_cost = 0;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tlong long val = Z.mincost_flow(3 * N + Count + 1, 3 * N + Count + 2, 1, 2);\\n\\t\\tif (val == 0) break;\\n\\t\\tcurrent_cost += val;\\n\\t\\tFinalAns = max(FinalAns, 1200000000LL * i - current_cost);\\n\\t}\\n\\t\\n\\t// Output\\n\\tcout << FinalAns << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 360,\n \"memory_kb\": 27688,\n \"score_of_the_acc\": -0.8339,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2293_7151828\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <class F, class C> struct primal_dual {\\n struct edge {\\n int to;\\n F cap;\\n C cost;\\n int rev;\\n bool is_rev;\\n };\\n\\n int n;\\n vector<vector<edge>> g;\\n vector<C> pot, d;\\n vector<int> pv, pe;\\n const C inf = numeric_limits<C>::max();\\n\\n primal_dual(int nn) : n(nn), g(nn) {}\\n\\n void add_edge(int from, int to, F cap, C cost) {\\n g[from].push_back({to, cap, cost, (int)g[to].size(), false});\\n g[to].push_back({from, 0, -cost, (int)g[from].size() - 1, true});\\n }\\n\\n vector<pair<F, C>> min_cost_flow(int s, int t, F f_lim = numeric_limits<F>::max()) {\\n F f = 0;\\n C c = 0, cf = -1;\\n vector<pair<F, C>> res = {{0, 0}};\\n priority_queue<pair<C, int>, vector<pair<C, int>>, greater<pair<C, int>>> pq;\\n pot.assign(n, 0);\\n pe.assign(n, -1);\\n pv.assign(n, -1);\\n while (f < f_lim) {\\n d.assign(n, inf);\\n pq.emplace(0, s);\\n d[s] = 0;\\n while (!pq.empty()) {\\n auto p = pq.top();\\n C dv = p.first;\\n int v = p.second;\\n pq.pop();\\n if (d[v] != dv) continue;\\n for (int i = 0; i < (int)g[v].size(); i++) {\\n auto& e = g[v][i];\\n C nd = d[v] + e.cost + pot[v] - pot[e.to];\\n if (e.cap > 0 and d[e.to] > nd) {\\n d[e.to] = nd;\\n pv[e.to] = v;\\n pe[e.to] = i;\\n pq.emplace(d[e.to], e.to);\\n }\\n }\\n }\\n if (d[t] == inf) break;\\n for (int i = 0; i < n; i++) pot[i] += d[i];\\n F add = f_lim - f;\\n for (int v = t; v != s; v = pv[v]) {\\n add = min(add, g[pv[v]][pe[v]].cap);\\n }\\n for (int v = t; v != s; v = pv[v]) {\\n auto& e = g[pv[v]][pe[v]];\\n e.cap -= add;\\n g[v][e.rev].cap += add;\\n }\\n f += add;\\n c += add * pot[t];\\n if (cf == pot[t]) {\\n res.pop_back();\\n }\\n cf = pot[t];\\n res.emplace_back(f, c);\\n }\\n return res;\\n }\\n};\\n\\nconstexpr int MAX = 1000010;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int N;\\n cin >> N;\\n vector<int> A(N), B(N), C;\\n for (int i = 0; i < N; i++) {\\n cin >> A[i] >> B[i];\\n C.emplace_back(A[i]);\\n C.emplace_back(B[i]);\\n }\\n\\n sort(C.begin(), C.end());\\n C.erase(unique(C.begin(), C.end()), C.end());\\n vector<int> idx(MAX, -1);\\n int M = C.size();\\n for (int i = 0; i < M; i++) idx[C[i]] = i;\\n int s = N + M, t = s + 1;\\n primal_dual<int, int> mcf(t + 1);\\n for (int i = 0; i < N; i++) {\\n mcf.add_edge(s, i, 1, 0);\\n mcf.add_edge(i, N + idx[A[i]], 1, MAX - B[i]);\\n mcf.add_edge(i, N + idx[B[i]], 1, MAX - A[i]);\\n mcf.add_edge(i, t, 1, MAX);\\n }\\n for (int i = 0; i < M; i++) mcf.add_edge(N + i, t, 1, 0);\\n int ans = MAX * N - mcf.min_cost_flow(s, t).back().second;\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 7584,\n \"score_of_the_acc\": -0.2311,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2293_7100339\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<bits/stdc++.h>\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\ntemplate <class Cap, class Cost> struct mcf_graph {\\n public:\\n mcf_graph() {}\\n mcf_graph(int n) : _n(n), g(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 int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n g[from].push_back(_edge{to, int(g[to].size()), cap, cost});\\n g[to].push_back(_edge{from, int(g[from].size()) - 1, 0, -cost});\\n return m;\\n }\\n\\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(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{\\n pos[i].first, _e.to, _e.cap + _re.cap, _re.cap, _e.cost,\\n };\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result(m);\\n for (int i = 0; i < m; i++) {\\n result[i] = get_edge(i);\\n }\\n return result;\\n }\\n\\n std::pair<Cap, Cost> flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n std::pair<Cap, Cost> flow(int s, int t, Cap flow_limit) {\\n return slope(s, t, flow_limit).back();\\n }\\n std::vector<std::pair<Cap, Cost>> slope(int s, int t) {\\n return slope(s, t, std::numeric_limits<Cap>::max());\\n }\\n std::vector<std::pair<Cap, Cost>> slope(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n // variants (C = maxcost):\\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\\n std::vector<Cost> dual(_n, 0), dist(_n);\\n std::vector<int> pv(_n), pe(_n);\\n std::vector<bool> vis(_n);\\n auto dual_ref = [&]() {\\n std::fill(dist.begin(), dist.end(),\\n std::numeric_limits<Cost>::max());\\n std::fill(pv.begin(), pv.end(), -1);\\n std::fill(pe.begin(), pe.end(), -1);\\n std::fill(vis.begin(), vis.end(), false);\\n struct Q {\\n Cost key;\\n int to;\\n bool operator<(Q r) const { return key > r.key; }\\n };\\n std::priority_queue<Q> que;\\n dist[s] = 0;\\n que.push(Q{0, s});\\n while (!que.empty()) {\\n int v = que.top().to;\\n que.pop();\\n if (vis[v]) continue;\\n vis[v] = true;\\n if (v == t) break;\\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\\n // dist[v] >= 0 (all reduced cost are positive)\\n // dist[v] <= (n-1)C\\n for (int i = 0; i < int(g[v].size()); i++) {\\n auto e = g[v][i];\\n if (vis[e.to] || !e.cap) continue;\\n // |-dual[e.to] + dual[v]| <= (n-1)C\\n // cost <= C - -(n-1)C + 0 = nC\\n Cost cost = e.cost - dual[e.to] + dual[v];\\n if (dist[e.to] - dist[v] > cost) {\\n dist[e.to] = dist[v] + cost;\\n pv[e.to] = v;\\n pe[e.to] = i;\\n que.push(Q{dist[e.to], e.to});\\n }\\n }\\n }\\n if (!vis[t]) {\\n return false;\\n }\\n\\n for (int v = 0; v < _n; v++) {\\n if (!vis[v]) continue;\\n // dual[v] = dual[v] - dist[t] + dist[v]\\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) + (shortest(s, v) + dual[s] - dual[v])\\n // = - shortest(s, t) + dual[t] + shortest(s, v)\\n // = shortest(s, v) - shortest(s, t) >= 0 - (n-1)C\\n dual[v] -= dist[t] - dist[v];\\n }\\n return true;\\n };\\n Cap flow = 0;\\n Cost cost = 0, prev_cost = -1;\\n std::vector<std::pair<Cap, Cost>> result;\\n result.push_back({flow, cost});\\n while (flow < flow_limit) {\\n if (!dual_ref()) break;\\n Cap c = flow_limit - flow;\\n for (int v = t; v != s; v = pv[v]) {\\n c = std::min(c, g[pv[v]][pe[v]].cap);\\n }\\n for (int v = t; v != s; v = pv[v]) {\\n auto& e = g[pv[v]][pe[v]];\\n e.cap -= c;\\n g[v][e.rev].cap += c;\\n }\\n Cost d = -dual[s];\\n flow += c;\\n cost += c * d;\\n if (prev_cost == d) {\\n result.pop_back();\\n }\\n result.push_back({flow, cost});\\n prev_cost = cost;\\n }\\n return result;\\n }\\n\\n private:\\n int _n;\\n\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n };\\n\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\n} // namespace atcoder\\n\\nusing namespace std;\\nusing namespace atcoder;\\nconst long long inf = 1LL << 40;\\n\\n\\n\\nvoid solve(){\\n\\tint n;\\n\\tcin >> n;\\n\\tvector<long long> A(n), B(n);\\n\\tset<long long> se;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tcin >> A[i] >> B[i];\\n\\t\\tse.insert(A[i]);\\n\\t\\tse.insert(B[i]);\\n\\t}\\n\\tmap<long long, int> mp;\\n\\tint ind = 0;\\n\\tfor(auto s:se){\\n\\t\\tmp[s] = ind++;\\n\\t}\\n\\n\\tint m = ind;\\n\\tmcf_graph<int, long long> G(n + m + 2);\\n\\tint s = n + m;\\n\\tint t = s + 1;\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tG.add_edge(s, i, 1, 0);\\n\\t\\tG.add_edge(i, t, 1, inf);\\n\\t}\\n\\tfor(int j = 0; j < m; j++) G.add_edge(n + j, t, 1, 0);\\n\\tfor(int i = 0; i < n; i++){\\n\\t\\tG.add_edge(i, n + mp[A[i]], 1, inf - B[i]);\\n\\t\\tG.add_edge(i, n + mp[B[i]], 1, inf - A[i]);\\n\\t}\\n\\tauto tmp = G.flow(s, t);\\n\\tlong long ans = inf * tmp.first - tmp.second;\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main(){\\n\\tcin.tie(0)->sync_with_stdio(0);\\n\\tint t;\\n\\tt = 1;\\n\\t// cin >> t;\\n\\twhile(t--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4216,\n \"score_of_the_acc\": -0.0337,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2293_7070454\",\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; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\\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>;\\nusing vl = vector<ll>;\\t\\tusing vvl = vector<vl>;\\t\\tusing vvvl = vector<vvl>;\\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);\\nconst vi DX = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\\nconst vi DY = { 0, 1, 0, -1 };\\nint INF = 1001001001; ll INFL = 4004004004004004004LL;\\ndouble EPS = 1e-12;\\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 < (1 << int(d)); ++set) // d ビット全探索（昇順）\\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\\n#define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了\\n\\n// 汎用関数の定義\\ntemplate <class T> inline ll pow(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 を返す）\\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// 手元環境（Visual Studio）\\n#ifdef _MSC_VER\\n#include \\\"local.hpp\\\"\\n// 提出用（gcc）\\n#else\\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) : -1; }\\ninline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }\\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 gcd __gcd\\n#define dump(...)\\n#define dumpel(v)\\n#define dump_list(v)\\n#define input_from_file(f)\\n#define output_to_file(f)\\n#define Assert(b) { if (!(b)) while (1) cout << \\\"OLE\\\"; }\\n#endif\\n\\n#endif // 折りたたみ用\\n\\n\\n////--------------AtCoder 専用--------------\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n//\\n////using mint = modint1000000007;\\n//using mint = modint998244353;\\n////using mint = modint; // mint::set_mod(m);\\n//\\n//istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\\n//ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }\\n//using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;\\n////----------------------------------------\\n\\n\\n#ifndef ATCODER_INTERNAL_CSR_HPP\\n#define ATCODER_INTERNAL_CSR_HPP 1\\n\\n#include <algorithm>\\n#include <utility>\\n#include <vector>\\n\\nnamespace atcoder {\\n namespace internal {\\n\\n template <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#endif // ATCODER_INTERNAL_CSR_HPP\\n\\n\\n#ifndef ATCODER_INTERNAL_QUEUE_HPP\\n#define ATCODER_INTERNAL_QUEUE_HPP 1\\n\\n#include <vector>\\n\\nnamespace atcoder {\\n\\n namespace internal {\\n\\n template <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n };\\n\\n } // namespace internal\\n\\n} // namespace atcoder\\n\\n#endif // ATCODER_INTERNAL_QUEUE_HPP\\n\\n\\n#ifndef ATCODER_MINCOSTFLOW_HPP\\n#define ATCODER_MINCOSTFLOW_HPP 1\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\n template <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 // inside edge\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n };\\n\\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\\n int s,\\n int t,\\n Cap flow_limit) {\\n // variants (C = maxcost):\\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\\n\\n // dual_dist[i] = (dual[i], dist[i])\\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\\n std::vector<int> prev_e(_n);\\n std::vector<bool> vis(_n);\\n struct Q {\\n Cost key;\\n int to;\\n bool operator<(Q r) const { return key > r.key; }\\n };\\n std::vector<int> que_min;\\n std::vector<Q> que;\\n auto dual_ref = [&]() {\\n for (int i = 0; i < _n; i++) {\\n dual_dist[i].second = std::numeric_limits<Cost>::max();\\n }\\n std::fill(vis.begin(), vis.end(), false);\\n que_min.clear();\\n que.clear();\\n\\n // que[0..heap_r) was heapified\\n size_t heap_r = 0;\\n\\n dual_dist[s].second = 0;\\n que_min.push_back(s);\\n while (!que_min.empty() || !que.empty()) {\\n int v;\\n if (!que_min.empty()) {\\n v = que_min.back();\\n que_min.pop_back();\\n }\\n else {\\n while (heap_r < que.size()) {\\n heap_r++;\\n std::push_heap(que.begin(), que.begin() + heap_r);\\n }\\n v = que.front().to;\\n std::pop_heap(que.begin(), que.end());\\n que.pop_back();\\n heap_r--;\\n }\\n if (vis[v]) continue;\\n vis[v] = true;\\n if (v == t) break;\\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\\n // dist[v] >= 0 (all reduced cost are positive)\\n // dist[v] <= (n-1)C\\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\\n auto e = g.elist[i];\\n if (!e.cap) continue;\\n // |-dual[e.to] + dual[v]| <= (n-1)C\\n // cost <= C - -(n-1)C + 0 = nC\\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\\n if (dual_dist[e.to].second - dist_v > cost) {\\n Cost dist_to = dist_v + cost;\\n dual_dist[e.to].second = dist_to;\\n prev_e[e.to] = e.rev;\\n if (dist_to == dist_v) {\\n que_min.push_back(e.to);\\n }\\n else {\\n que.push_back(Q{ dist_to, e.to });\\n }\\n }\\n }\\n }\\n if (!vis[t]) {\\n return false;\\n }\\n\\n for (int v = 0; v < _n; v++) {\\n if (!vis[v]) continue;\\n // dual[v] = dual[v] - dist[t] + dist[v]\\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +\\n // (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,\\n // t) + dual[t] + shortest(s, v) = shortest(s, v) -\\n // shortest(s, t) >= 0 - (n-1)C\\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\\n }\\n return true;\\n };\\n Cap flow = 0;\\n Cost cost = 0, prev_cost_per_flow = -1;\\n std::vector<std::pair<Cap, Cost>> result = { {Cap(0), Cost(0)} };\\n while (flow < flow_limit) {\\n if (!dual_ref()) break;\\n Cap c = flow_limit - flow;\\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\\n }\\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\\n auto& e = g.elist[prev_e[v]];\\n e.cap += c;\\n g.elist[e.rev].cap -= c;\\n }\\n Cost d = -dual_dist[s].first;\\n flow += c;\\n cost += c * d;\\n if (prev_cost_per_flow == d) {\\n result.pop_back();\\n }\\n result.push_back({ flow, cost });\\n prev_cost_per_flow = d;\\n }\\n return result;\\n }\\n };\\n\\n} // namespace atcoder\\n\\n#endif // ATCODER_MINCOSTFLOW_HPP\\n\\n\\nusing namespace atcoder;\\n\\n\\n//【最小費用流（負コスト可，負コスト閉路なし）】\\n/*\\n* Negative_mcf_graph(int n) : O(1)\\n*\\tn 頂点で初期化する．\\n* \\n* add_edge(int s, int t, ll cap, ll cost) : O(1)\\n*\\ts から t へ容量 cap，コスト cost の辺を追加する．\\n* \\n* pll flow(int ST, int GL, ll f_lim = INFL) : O(F (n + m) log n)（F:流量，m:辺の数）\\n*\\tST から GL まで flow_limit まで流せるだけ流したときの {流量, 最小コスト} を返す．\\n*\\t制約：負コストの閉路は存在しない\\n*/\\nstruct Negative_mcf_graph {\\n\\t// 参考 : https://ikatakos.com/pot/programming_algorithm/graph_theory/minimum_cost_flow\\n\\n\\t// n : 頂点数\\n\\tint n;\\n\\n\\t// 辺\\n\\tstruct Edge {\\n\\t\\tint to;\\n\\t\\tll cap, cost;\\n\\n\\t\\tEdge(int to_, ll cap_, ll cost_) : to(to_), cap(cap_), cost(cost_) {}\\n\\t};\\n\\n\\t// 元のグラフ（負辺あり）\\n\\tvector<vector<Edge>> g;\\n\\n\\t// pot[s] : 頂点 s のポテンシャル\\n\\tvl pot;\\n\\n\\t// n 頂点で初期化する．\\n\\tNegative_mcf_graph(int n_) : n(n_), g(n), pot(n, INFL) {}\\n\\n\\t// s から t へ容量 cap，コスト cost の辺を追加する．\\n\\tvoid add_edge(int s, int t, ll cap, ll cost) {\\n\\t\\t// verify : https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_h\\n\\t\\t\\n\\t\\tg[s].emplace_back(t, cap, cost);\\n\\t}\\n\\n\\t// ベルマンフォード法で ST からの距離を求め，それをポテンシャルとする．\\n\\tbool bellman_ford(int ST) {\\n\\t\\tpot[ST] = 0;\\n\\n\\t\\trep(i, n) {\\n\\t\\t\\tbool updated = false;\\n\\n\\t\\t\\t// 全ての辺についての操作\\n\\t\\t\\trep(s, n) repe(e, g[s]) {\\n\\t\\t\\t\\t// もし (始点への距離) + (辺のコスト) < (終点への距離) なら (終点への距離) を更新する．\\n\\t\\t\\t\\t// INFL からは何を引いても INFL になるようにしているので，ST から到達可能な負閉路しか検出しない．\\n\\t\\t\\t\\tif (pot[s] != INFL && pot[s] + e.cost < pot[e.to]) {\\n\\t\\t\\t\\t\\tpot[e.to] = pot[s] + e.cost;\\n\\t\\t\\t\\t\\tupdated = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t// もし距離の更新が起こらなければ最短距離確定\\n\\t\\t\\tif (!updated) return true;\\n\\t\\t}\\n\\n\\t\\t// もし全ての辺についての操作を n 回繰り返しても距離の更新があったなら，\\n\\t\\t// ST から到達可能な負の閉路を持っているので false を返す．\\n\\t\\treturn false;\\n\\t}\\n\\n\\t// ST から GL まで flow_limit まで流せるだけ流したときの {流量, 最小コスト} を返す．\\n\\tpll flow(int ST, int GL, ll f_lim = INFL) {\\n\\t\\t// verify : https://atcoder.jp/contests/code-festival-2014-china-open/tasks/code_festival_china_h\\n\\n\\t\\t// ベルマンフォード法で ST から v までの距離を求め，それをポテンシャル pot[v] とする．\\n\\t\\tbool non_neg_cyc = bellman_ford(ST);\\n\\t\\tAssert(non_neg_cyc);\\n\\n\\t\\t// g_pos : 辺 s→t のコストが (元の辺のコスト) - (pot[t] - pot[s]) >= 0 であるようなグラフ\\n\\t\\tmcf_graph<ll, ll> g_pos(n);\\n\\t\\trep(s, n) repe(e, g[s]) {\\n\\t\\t\\tg_pos.add_edge(s, e.to, e.cap, e.cost - (pot[e.to] - pot[s]));\\n\\t\\t}\\n\\n\\t\\t// g_pos の最小費用流を求める．\\n\\t\\tll cap, cost;\\n\\t\\ttie(cap, cost) = g_pos.flow(ST, GL, f_lim);\\n\\n\\t\\t// 実際のコストは (流量) * pot[GL] を加えたものになる．\\n\\t\\tcost += cap * pot[GL];\\n\\n\\t\\treturn make_pair(cap, cost);\\n\\t}\\n};\\n\\n\\nint main() {\\n//\\tinput_from_file(\\\"input.txt\\\");\\n//\\toutput_to_file(\\\"output.txt\\\");\\n\\t\\n\\tint n;\\n\\tcin >> n;\\n\\n\\tvl a(n), b(n);\\n\\trep(i, n) cin >> a[i] >> b[i];\\n\\n\\tvector<tuple<ll, ll, int>> whi(2 * n);\\n\\tunordered_map<ll, int> w_to_id; int id = 0;\\n\\n\\trep(i, n) {\\n\\t\\twhi[2 * i] = { a[i], b[i], i };\\n\\t\\tif (!w_to_id.count(a[i])) w_to_id[a[i]] = id++;\\n\\n\\t\\twhi[2 * i + 1] = { b[i], a[i], i };\\n\\t\\tif (!w_to_id.count(b[i])) w_to_id[b[i]] = id++;\\n\\t}\\n\\n\\tsort(all(whi));\\n\\n\\tint ST = n + (2 * n) + id, GL = ST + 1;\\n\\tNegative_mcf_graph g(GL + 1);\\n\\n\\trep(i, n) g.add_edge(ST, i, 1, 0);\\n\\trep(t, 2 * n) {\\n\\t\\tll w, h; int i;\\n\\t\\ttie(w, h, i) = whi[t];\\n\\n\\t\\tg.add_edge(i, n + t, 1, 0);\\n\\t\\tg.add_edge(n + t, n + 2 * n + w_to_id[w], 1, -h);\\n\\t}\\n\\trep(j, id) g.add_edge(n + 2 * n + j, GL, 1, 0);\\n\\n\\t// グラフ内にフローを流さなくてもいいように側溝を用意する．\\n\\tg.add_edge(ST, GL, INFL, 0);\\n\\n\\tll cap, cost;\\n\\ttie(cap, cost) = g.flow(ST, GL, n);\\n\\tdump(cap, cost);\\n\\n\\tcout << -cost << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4728,\n \"score_of_the_acc\": -0.0456,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2293_6900014\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate< typename flow_t, typename cost_t >\\nstruct PrimalDual {\\n const cost_t INF;\\n \\n struct edge {\\n int to;\\n flow_t cap;\\n cost_t cost;\\n int rev;\\n bool isrev;\\n };\\n vector< vector< edge > > graph;\\n vector< cost_t > potential, min_cost;\\n vector< int > prevv, preve;\\n \\n PrimalDual(int V) : graph(V), INF(numeric_limits< cost_t >::max()) {}\\n \\n void add_edge(int from, int to, flow_t cap, cost_t cost) {\\n graph[from].emplace_back((edge) {to, cap, cost, (int) graph[to].size(), false});\\n graph[to].emplace_back((edge) {from, 0, -cost, (int) graph[from].size() - 1, true});\\n }\\n \\n cost_t min_cost_flow(int s, int t, flow_t f) {\\n int V = (int) graph.size();\\n cost_t ret = 0;\\n using Pi = pair< cost_t, int >;\\n priority_queue< Pi, vector< Pi >, greater< Pi > > que;\\n potential.assign(V, 0);\\n preve.assign(V, -1);\\n prevv.assign(V, -1);\\n \\n while(f > 0) {\\n min_cost.assign(V, INF);\\n que.emplace(0, s);\\n min_cost[s] = 0;\\n while(!que.empty()) {\\n Pi p = que.top();\\n que.pop();\\n if(min_cost[p.second] < p.first) continue;\\n for(int i = 0; i < graph[p.second].size(); i++) {\\n edge &e = graph[p.second][i];\\n cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];\\n if(e.cap > 0 && min_cost[e.to] > nextCost) {\\n min_cost[e.to] = nextCost;\\n prevv[e.to] = p.second, preve[e.to] = i;\\n que.emplace(min_cost[e.to], e.to);\\n }\\n }\\n }\\n if(min_cost[t] == INF) return -1;\\n for(int v = 0; v < V; v++) potential[v] += min_cost[v];\\n flow_t addflow = f;\\n for(int v = t; v != s; v = prevv[v]) {\\n addflow = min(addflow, graph[prevv[v]][preve[v]].cap);\\n }\\n f -= addflow;\\n ret += addflow * potential[t];\\n for(int v = t; v != s; v = prevv[v]) {\\n edge &e = graph[prevv[v]][preve[v]];\\n e.cap -= addflow;\\n graph[v][e.rev].cap += addflow;\\n }\\n }\\n return ret;\\n }\\n};\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<int>A(N),B(N),C(1000001);\\n PrimalDual<int,int>flow(N*4+1000000+2);\\n int S = N*4+1000000,T = S+1;\\n int ans = 0;\\n for(int i = 0; i < N; i++) {\\n cin >> A[i] >> B[i];\\n C[A[i]] = C[B[i]] = 1;\\n ans += max(A[i],B[i]);\\n flow.add_edge(S,i,1,0);\\n flow.add_edge(i,N+i,1,max(A[i],B[i]));\\n flow.add_edge(i,2*N+i,1,max(A[i],B[i])-min(A[i],B[i]));\\n flow.add_edge(i,3*N+i,1,0);\\n flow.add_edge(N+i,T,1,0);\\n flow.add_edge(2*N+i,4*N+max(A[i],B[i])-1,1,0);\\n flow.add_edge(3*N+i,4*N+min(A[i],B[i])-1,1,0);\\n }\\n for(int i = 1; i <= 1000000; i++) {\\n if(C[i]) {\\n flow.add_edge(4*N+i-1,T,1,0);\\n }\\n }\\n cout << ans-flow.min_cost_flow(S,T,N) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1270,\n \"memory_kb\": 46764,\n \"score_of_the_acc\": -2,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2293_6459083\",\n \"code_snippet\": \"#line 1 \\\"a.cpp\\\"\\n/**\\n *\\tauthor: nok0\\n *\\tcreated: 2022.04.06 21:05:07\\n**/\\n#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) / 2;\\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 7 \\\"/Users/nok0/Documents/Programming/nok0/graph/mincost_b_flow.hpp\\\"\\n\\nenum Objective {\\n\\tMINIMIZE = 1,\\n\\tMAXIMIZE = -1,\\n};\\nenum class Status {\\n\\tOPTIMAL,\\n\\tINFEASIBLE,\\n};\\n\\ntemplate <class Flow, class Cost, Objective objective = Objective::MINIMIZE, Flow SCALING_FACTOR = 2>\\nstruct MinCostFlow {\\nprivate:\\n\\tusing V_id = uint32_t;\\n\\tusing E_id = uint32_t;\\n\\n\\tstruct Edge {\\n\\t\\tfriend struct MinCostFlow;\\n\\n\\tprivate:\\n\\t\\tV_id src, dst;\\n\\t\\tFlow flow, cap;\\n\\t\\tCost cost;\\n\\t\\tE_id rev;\\n\\n\\tpublic:\\n\\t\\tEdge() = default;\\n\\n\\t\\tEdge(const V_id src, const V_id dst, const Flow cap, const Cost cost,\\n\\t\\t const E_id rev)\\n\\t\\t : src(src), dst(dst), flow(0), cap(cap), cost(cost), rev(rev) {}\\n\\n\\t\\t[[nodiscard]] Flow residual_cap() const { return cap - flow; }\\n\\t};\\n\\npublic:\\n\\tstruct EdgePtr {\\n\\t\\tfriend struct MinCostFlow;\\n\\n\\tprivate:\\n\\t\\tconst MinCostFlow *instance;\\n\\t\\tconst V_id v;\\n\\t\\tconst E_id e;\\n\\n\\t\\tEdgePtr(const MinCostFlow *instance, const V_id v, const E_id e)\\n\\t\\t : instance(instance), v(v), e(e) {}\\n\\n\\t\\t[[nodiscard]] const Edge &edge() const { return instance->g[v][e]; }\\n\\n\\t\\t[[nodiscard]] const Edge &rev() const {\\n\\t\\t\\tconst Edge &e = edge();\\n\\t\\t\\treturn instance->g[e.dst][e.rev];\\n\\t\\t}\\n\\n\\tpublic:\\n\\t\\t[[nodiscard]] V_id src() const { return rev().dst; }\\n\\n\\t\\t[[nodiscard]] V_id dst() const { return edge().dst; }\\n\\n\\t\\t[[nodiscard]] Flow flow() const { return edge().flow; }\\n\\n\\t\\t[[nodiscard]] Flow lower() const { return -rev().cap; }\\n\\n\\t\\t[[nodiscard]] Flow upper() const { return edge().cap; }\\n\\n\\t\\t[[nodiscard]] Cost cost() const { return edge().cost; }\\n\\n\\t\\t[[nodiscard]] Cost gain() const { return -edge().cost; }\\n\\t};\\n\\nprivate:\\n\\tV_id n;\\n\\tstd::vector<std::vector<Edge>> g;\\n\\tstd::vector<Flow> b;\\n\\npublic:\\n\\tMinCostFlow() : n(0) {}\\n\\n\\tV_id add_vertex() {\\n\\t\\t++n;\\n\\t\\tg.resize(n);\\n\\t\\tb.resize(n);\\n\\t\\treturn n - 1;\\n\\t}\\n\\n\\tstd::vector<V_id> add_vertices(const size_t size) {\\n\\t\\tstd::vector<V_id> ret;\\n\\t\\tfor(V_id i = 0; i < size; ++i) ret.emplace_back(n + i);\\n\\t\\tn += size;\\n\\t\\tg.resize(n);\\n\\t\\tb.resize(n);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\tEdgePtr add_edge(const V_id src, const V_id dst, const Flow lower, const Flow upper, const Cost cost) {\\n\\t\\tconst E_id e = g[src].size(), re = src == dst ? e + 1 : g[dst].size();\\n\\t\\tassert(lower <= upper);\\n\\t\\tg[src].emplace_back(Edge{src, dst, upper, cost * objective, re});\\n\\t\\tg[dst].emplace_back(Edge{dst, src, -lower, -cost * objective, e});\\n\\t\\treturn EdgePtr{this, src, e};\\n\\t}\\n\\n\\tvoid add_supply(const V_id v, const Flow amount) { b[v] += amount; }\\n\\n\\tvoid add_demand(const V_id v, const Flow amount) { b[v] -= amount; }\\n\\nprivate:\\n\\tstatic Cost constexpr unreachable = std::numeric_limits<Cost>::max();\\n\\tCost farthest;\\n\\tstd::vector<Cost> potential;\\n\\tstd::vector<Cost> dist;\\n\\tstd::vector<Edge *> parent;\\n\\tstd::priority_queue<std::pair<Cost, int>, std::vector<std::pair<Cost, int>>, std::greater<>> pq;\\n\\tstd::vector<V_id> excess_vs, deficit_vs;\\n\\n\\tEdge &rev(const Edge &e) { return g[e.dst][e.rev]; }\\n\\n\\tvoid push(Edge &e, const Flow amount) {\\n\\t\\te.flow += amount;\\n\\t\\tg[e.dst][e.rev].flow -= amount;\\n\\t}\\n\\n\\tCost residual_cost(const V_id src, const V_id dst, const Edge &e) {\\n\\t\\treturn e.cost + potential[src] - potential[dst];\\n\\t}\\n\\n\\tbool dual(const Flow delta) {\\n\\t\\tdist.assign(n, unreachable);\\n\\t\\tparent.assign(n, nullptr);\\n\\t\\texcess_vs.erase(std::remove_if(std::begin(excess_vs), std::end(excess_vs), [&](const V_id v) { return b[v] < delta; }), std::end(excess_vs));\\n\\t\\tdeficit_vs.erase(std::remove_if(std::begin(deficit_vs), std::end(deficit_vs), [&](const V_id v) { return b[v] > -delta; }), std::end(deficit_vs));\\n\\t\\tfor(const auto v : excess_vs) pq.emplace(dist[v] = 0, v);\\n\\t\\tfarthest = 0;\\n\\t\\tstd::size_t deficit_count = 0;\\n\\t\\twhile(!pq.empty()) {\\n\\t\\t\\tconst auto [d, u] = pq.top();\\n\\t\\t\\tpq.pop();\\n\\t\\t\\tif(dist[u] < d) continue;\\n\\t\\t\\tfarthest = d;\\n\\t\\t\\tif(b[u] <= -delta) ++deficit_count;\\n\\t\\t\\tif(deficit_count >= deficit_vs.size()) break;\\n\\t\\t\\tfor(auto &e : g[u]) {\\n\\t\\t\\t\\tif(e.residual_cap() < delta) continue;\\n\\t\\t\\t\\tconst auto v = e.dst;\\n\\t\\t\\t\\tconst auto new_dist = d + residual_cost(u, v, e);\\n\\t\\t\\t\\tif(new_dist >= dist[v]) continue;\\n\\t\\t\\t\\tpq.emplace(dist[v] = new_dist, v);\\n\\t\\t\\t\\tparent[v] = &e;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tpq = decltype(pq)();\\n\\t\\tfor(V_id v = 0; v < n; ++v) {\\n\\t\\t\\tpotential[v] += std::min(dist[v], farthest);\\n\\t\\t}\\n\\t\\treturn deficit_count > 0;\\n\\t}\\n\\n\\tvoid primal(const Flow delta) {\\n\\t\\tfor(const auto t : deficit_vs) {\\n\\t\\t\\tif(dist[t] > farthest) continue;\\n\\t\\t\\tFlow f = -b[t];\\n\\t\\t\\tV_id v;\\n\\t\\t\\tfor(v = t; parent[v] != nullptr && f >= delta; v = parent[v]->src) {\\n\\t\\t\\t\\tf = std::min(f, parent[v]->residual_cap());\\n\\t\\t\\t}\\n\\t\\t\\tf = std::min(f, b[v]);\\n\\t\\t\\tif(f < delta) continue;\\n\\t\\t\\tfor(v = t; parent[v] != nullptr;) {\\n\\t\\t\\t\\tauto &e = *parent[v];\\n\\t\\t\\t\\tpush(e, f);\\n\\t\\t\\t\\tconst size_t u = parent[v]->src;\\n\\t\\t\\t\\tparent[v] = nullptr;\\n\\t\\t\\t\\tv = u;\\n\\t\\t\\t}\\n\\t\\t\\tb[t] += f;\\n\\t\\t\\tb[v] -= f;\\n\\t\\t}\\n\\t}\\n\\n\\tvoid saturate_negative(const Flow delta) {\\n\\t\\texcess_vs.clear();\\n\\t\\tdeficit_vs.clear();\\n\\t\\tfor(auto &es : g)\\n\\t\\t\\tfor(auto &e : es) {\\n\\t\\t\\t\\tconst Flow rcap = e.residual_cap();\\n\\t\\t\\t\\tconst Cost rcost = residual_cost(e.src, e.dst, e);\\n\\t\\t\\t\\tif(rcost < 0 && rcap >= delta) {\\n\\t\\t\\t\\t\\tpush(e, rcap);\\n\\t\\t\\t\\t\\tb[e.src] -= rcap;\\n\\t\\t\\t\\t\\tb[e.dst] += rcap;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\tfor(V_id v = 0; v < n; ++v)\\n\\t\\t\\tif(b[v] != 0) {\\n\\t\\t\\t\\t(b[v] > 0 ? excess_vs : deficit_vs).emplace_back(v);\\n\\t\\t\\t}\\n\\t}\\n\\npublic:\\n\\tstd::pair<Status, Cost> solve() {\\n\\t\\tpotential.resize(n);\\n\\t\\tfor(auto &es : g)\\n\\t\\t\\tfor(auto &e : es) {\\n\\t\\t\\t\\tconst Flow rcap = e.residual_cap();\\n\\t\\t\\t\\tif(rcap < 0) {\\n\\t\\t\\t\\t\\tpush(e, rcap);\\n\\t\\t\\t\\t\\tb[e.src] -= rcap;\\n\\t\\t\\t\\t\\tb[e.dst] += rcap;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\tFlow inf_flow = 1;\\n\\t\\tfor(const auto &es : g)\\n\\t\\t\\tfor(const auto &e : es) inf_flow = std::max(inf_flow, e.residual_cap());\\n\\t\\tFlow delta = 1;\\n\\t\\twhile(delta <= inf_flow) delta *= SCALING_FACTOR;\\n\\n\\t\\tfor(delta /= SCALING_FACTOR; delta; delta /= SCALING_FACTOR) {\\n\\t\\t\\tsaturate_negative(delta);\\n\\t\\t\\twhile(dual(delta)) primal(delta);\\n\\t\\t}\\n\\n\\t\\tCost value = 0;\\n\\t\\tfor(const auto &es : g)\\n\\t\\t\\tfor(const auto &e : es) {\\n\\t\\t\\t\\tvalue += e.flow * e.cost;\\n\\t\\t\\t}\\n\\t\\tvalue /= 2;\\n\\n\\t\\tif(excess_vs.empty() && deficit_vs.empty()) {\\n\\t\\t\\treturn {Status::OPTIMAL, value / objective};\\n\\t\\t} else {\\n\\t\\t\\treturn {Status::INFEASIBLE, value / objective};\\n\\t\\t}\\n\\t}\\n};\\n\\ntemplate <class Flow, class Cost>\\nusing MaxGainFlow = MinCostFlow<Flow, Cost, Objective::MAXIMIZE>;\\n#line 7 \\\"a.cpp\\\"\\n\\nvoid main_() {\\n\\tINT(n);\\n\\tVEC(pii, ab, n);\\n\\tV<> x;\\n\\tfoa(p, ab) x.pb(p.first), x.pb(p.second);\\n\\tauto re = press(x);\\n\\tint m = SZ(re);\\n\\tMaxGainFlow<int, int> mf;\\n\\tauto s = mf.add_vertex();\\n\\tauto t = mf.add_vertex();\\n\\tmf.add_supply(s, n);\\n\\tmf.add_demand(t, n);\\n\\tmf.add_edge(s, t, 0, n, 0);\\n\\tauto lef = mf.add_vertices(n);\\n\\tauto rig = mf.add_vertices(m);\\n\\tREP(i, n) {\\n\\t\\tmf.add_edge(s, lef[i], 0, 1, 0);\\n\\t\\tauto [ai, bi] = ab[i];\\n\\t\\tmf.add_edge(lef[i], rig[lb(re, ai)], 0, 1, bi);\\n\\t\\tmf.add_edge(lef[i], rig[lb(re, bi)], 0, 1, ai);\\n\\t}\\n\\tREP(j, m) {\\n\\t\\tmf.add_edge(rig[j], t, 0, 1, 0);\\n\\t}\\n\\tprint(mf.solve().second);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3912,\n \"score_of_the_acc\": -0.1615,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2293_6295499\",\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/mincostflow.hpp\\\"\\n\\n\\n\\n#line 5 \\\"library/atcoder/mincostflow.hpp\\\"\\n#include <cassert>\\n#line 9 \\\"library/atcoder/mincostflow.hpp\\\"\\n\\n#line 1 \\\"library/atcoder/internal_csr.hpp\\\"\\n\\n\\n\\n#line 7 \\\"library/atcoder/internal_csr.hpp\\\"\\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#line 1 \\\"library/atcoder/internal_queue.hpp\\\"\\n\\n\\n\\n#line 5 \\\"library/atcoder/internal_queue.hpp\\\"\\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\\n#line 12 \\\"library/atcoder/mincostflow.hpp\\\"\\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 // inside edge\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n };\\n\\n std::vector<std::pair<Cap, Cost>> slope(internal::csr<_edge>& g,\\n int s,\\n int t,\\n Cap flow_limit) {\\n // variants (C = maxcost):\\n // -(n-1)C <= dual[s] <= dual[i] <= dual[t] = 0\\n // reduced cost (= e.cost + dual[e.from] - dual[e.to]) >= 0 for all edge\\n\\n // dual_dist[i] = (dual[i], dist[i])\\n std::vector<std::pair<Cost, Cost>> dual_dist(_n);\\n std::vector<int> prev_e(_n);\\n std::vector<bool> vis(_n);\\n struct Q {\\n Cost key;\\n int to;\\n bool operator<(Q r) const { return key > r.key; }\\n };\\n std::vector<int> que_min;\\n std::vector<Q> que;\\n auto dual_ref = [&]() {\\n for (int i = 0; i < _n; i++) {\\n dual_dist[i].second = std::numeric_limits<Cost>::max();\\n }\\n std::fill(vis.begin(), vis.end(), false);\\n que_min.clear();\\n que.clear();\\n\\n // que[0..heap_r) was heapified\\n size_t heap_r = 0;\\n\\n dual_dist[s].second = 0;\\n que_min.push_back(s);\\n while (!que_min.empty() || !que.empty()) {\\n int v;\\n if (!que_min.empty()) {\\n v = que_min.back();\\n que_min.pop_back();\\n } else {\\n while (heap_r < que.size()) {\\n heap_r++;\\n std::push_heap(que.begin(), que.begin() + heap_r);\\n }\\n v = que.front().to;\\n std::pop_heap(que.begin(), que.end());\\n que.pop_back();\\n heap_r--;\\n }\\n if (vis[v]) continue;\\n vis[v] = true;\\n if (v == t) break;\\n // dist[v] = shortest(s, v) + dual[s] - dual[v]\\n // dist[v] >= 0 (all reduced cost are positive)\\n // dist[v] <= (n-1)C\\n Cost dual_v = dual_dist[v].first, dist_v = dual_dist[v].second;\\n for (int i = g.start[v]; i < g.start[v + 1]; i++) {\\n auto e = g.elist[i];\\n if (!e.cap) continue;\\n // |-dual[e.to] + dual[v]| <= (n-1)C\\n // cost <= C - -(n-1)C + 0 = nC\\n Cost cost = e.cost - dual_dist[e.to].first + dual_v;\\n if (dual_dist[e.to].second - dist_v > cost) {\\n Cost dist_to = dist_v + cost;\\n dual_dist[e.to].second = dist_to;\\n prev_e[e.to] = e.rev;\\n if (dist_to == dist_v) {\\n que_min.push_back(e.to);\\n } else {\\n que.push_back(Q{dist_to, e.to});\\n }\\n }\\n }\\n }\\n if (!vis[t]) {\\n return false;\\n }\\n\\n for (int v = 0; v < _n; v++) {\\n if (!vis[v]) continue;\\n // dual[v] = dual[v] - dist[t] + dist[v]\\n // = dual[v] - (shortest(s, t) + dual[s] - dual[t]) +\\n // (shortest(s, v) + dual[s] - dual[v]) = - shortest(s,\\n // t) + dual[t] + shortest(s, v) = shortest(s, v) -\\n // shortest(s, t) >= 0 - (n-1)C\\n dual_dist[v].first -= dual_dist[t].second - dual_dist[v].second;\\n }\\n return true;\\n };\\n Cap flow = 0;\\n Cost cost = 0, prev_cost_per_flow = -1;\\n std::vector<std::pair<Cap, Cost>> result = {{Cap(0), Cost(0)}};\\n while (flow < flow_limit) {\\n if (!dual_ref()) break;\\n Cap c = flow_limit - flow;\\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\\n c = std::min(c, g.elist[g.elist[prev_e[v]].rev].cap);\\n }\\n for (int v = t; v != s; v = g.elist[prev_e[v]].to) {\\n auto& e = g.elist[prev_e[v]];\\n e.cap += c;\\n g.elist[e.rev].cap -= c;\\n }\\n Cost d = -dual_dist[s].first;\\n flow += c;\\n cost += c * d;\\n if (prev_cost_per_flow == d) {\\n result.pop_back();\\n }\\n result.push_back({flow, cost});\\n prev_cost_per_flow = d;\\n }\\n return result;\\n }\\n};\\n\\n} // namespace atcoder\\n\\n\\n#line 17 \\\"Source.cpp\\\"\\nusing namespace atcoder;\\n\\n#define int long long\\nvoid solve()\\n{\\n int n;\\n cin >> n;\\n vector<pair<int, int>> inputs;\\n map<int, int> cnter;\\n REP(i, n)\\n {\\n int a, b;\\n cin >> a >> b;\\n cnter[a];\\n cnter[b];\\n inputs.push_back({a, b});\\n }\\n\\n {\\n int cnt = 0;\\n for (auto &x : cnter)\\n {\\n x.second = cnt;\\n cnt++;\\n }\\n }\\n int ans = 0;\\n mcf_graph<int, int> graph(3 + inputs.size() + cnter.size());\\n for (int i = 0; i < inputs.size(); ++i)\\n {\\n graph.add_edge(0, i + 1, 1, 0);\\n graph.add_edge(i + 1, inputs.size() + 1 + cnter[inputs[i].first], 1, inputs[i].first);\\n graph.add_edge(i + 1, inputs.size() + 1 + cnter[inputs[i].second], 1, inputs[i].second);\\n graph.add_edge(i + 1, inputs.size() + cnter.size() + 1, 1, inputs[i].first + inputs[i].second);\\n ans += inputs[i].first + inputs[i].second;\\n }\\n for (int i = 0; i < cnter.size(); ++i)\\n {\\n graph.add_edge(inputs.size() + 1 + i, inputs.size() + cnter.size() + 2, 1, 0);\\n }\\n\\n graph.add_edge(inputs.size() + 1 + cnter.size(), inputs.size() + cnter.size() + 2, 10000, 0);\\n\\n ans -= graph.flow(0, inputs.size() + cnter.size() + 2).second;\\n cout << ans << endl;\\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\": 4176,\n \"score_of_the_acc\": -0.0169,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2293_6026701\",\n \"code_snippet\": \"#include <iostream>\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\n#include <limits>\\n#include <type_traits>\\n\\nnamespace suisen {\\n// ! utility\\ntemplate <typename ...Types>\\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\\ntemplate <bool cond_v, typename Then, typename OrElse>\\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\\n if constexpr (cond_v) {\\n return std::forward<Then>(then);\\n } else {\\n return std::forward<OrElse>(or_else);\\n }\\n}\\n\\n// ! function\\ntemplate <typename ReturnType, typename Callable, typename ...Args>\\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\\ntemplate <typename F, typename T>\\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\\ntemplate <typename F, typename T>\\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\\n\\ntemplate <typename Comparator, typename T>\\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\\n\\n// ! integral\\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\\ntemplate <typename T, unsigned int n>\\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\\ntemplate <typename T, unsigned int n>\\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\\n\\n// ?\\ntemplate <typename T>\\nstruct safely_multipliable {};\\ntemplate <>\\nstruct safely_multipliable<int> { using type = long long; };\\ntemplate <>\\nstruct safely_multipliable<long long> { using type = __int128_t; };\\ntemplate <>\\nstruct safely_multipliable<float> { using type = float; };\\ntemplate <>\\nstruct safely_multipliable<double> { using type = double; };\\ntemplate <>\\nstruct safely_multipliable<long double> { using type = long double; };\\ntemplate <typename T>\\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\\n\\n} // namespace suisen\\n\\nnamespace suisen {\\ntemplate <typename T>\\nclass CoordinateCompressorBuilder {\\n public:\\n struct Compressor {\\n public:\\n static constexpr int absent = -1;\\n\\n // default constructor\\n Compressor() : _xs(std::vector<T>{}) {}\\n // Construct from strictly sorted vector\\n Compressor(const std::vector<T> &xs) : _xs(xs) {\\n assert(is_strictly_sorted(xs));\\n }\\n\\n // Return the number of distinct keys.\\n int size() const {\\n return _xs.size();\\n }\\n // Check if the element is registered.\\n bool has_key(const T &e) const {\\n return std::binary_search(_xs.begin(), _xs.end(), e);\\n }\\n // Compress the element. if not registered, returns `default_value`. (default: Compressor::absent)\\n int comp(const T &e, int default_value = absent) const {\\n const int res = min_geq_index(e);\\n return res != size() and _xs[res] == e ? res : default_value;\\n }\\n // Restore the element from the index.\\n T decomp(const int compressed_index) const {\\n return _xs[compressed_index];\\n }\\n // Compress the element. Equivalent to call `comp(e)`\\n int operator[](const T &e) const {\\n return comp(e);\\n }\\n // Return the minimum registered value greater than `e`. if not exists, return `default_value`.\\n T min_gt(const T &e, const T &default_value) const {\\n auto it = std::upper_bound(_xs.begin(), _xs.end(), e);\\n return it == _xs.end() ? default_value : *it;\\n }\\n // Return the minimum registered value greater than or equal to `e`. if not exists, return `default_value`.\\n T min_geq(const T &e, const T &default_value) const {\\n auto it = std::lower_bound(_xs.begin(), _xs.end(), e);\\n return it == _xs.end() ? default_value : *it;\\n }\\n // Return the maximum registered value less than `e`. if not exists, return `default_value`\\n T max_lt(const T &e, const T &default_value) const {\\n auto it = std::upper_bound(_xs.rbegin(), _xs.rend(), e);\\n return it == _xs.rend() ? default_value : *it;\\n }\\n // Return the maximum registered value less than or equal to `e`. if not exists, return `default_value`\\n T max_leq(const T &e, const T &default_value) const {\\n auto it = std::lower_bound(_xs.rbegin(), _xs.rend(), e);\\n return it == _xs.rend() ? default_value : *it;\\n }\\n // Return the compressed index of the minimum registered value greater than `e`. if not exists, return `compressor.size()`.\\n int min_gt_index(const T &e) const {\\n return std::upper_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\\n }\\n // Return the compressed index of the minimum registered value greater than or equal to `e`. if not exists, return `compressor.size()`.\\n int min_geq_index(const T &e) const {\\n return std::lower_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\\n }\\n // Return the compressed index of the maximum registered value less than `e`. if not exists, return -1.\\n int max_lt_index(const T &e) const {\\n return int(_xs.rend() - std::upper_bound(_xs.rbegin(), _xs.rend(), e)) - 1;\\n }\\n // Return the compressed index of the maximum registered value less than or equal to `e`. if not exists, return -1.\\n int max_leq_index(const T &e) const {\\n return int(_xs.rend() - std::lower_bound(_xs.rbegin(), _xs.rend(), e)) - 1;\\n }\\n private:\\n std::vector<T> _xs;\\n static bool is_strictly_sorted(const std::vector<T> &v) {\\n return std::adjacent_find(v.begin(), v.end(), std::greater_equal<T>()) == v.end();\\n }\\n };\\n CoordinateCompressorBuilder() : _xs(std::vector<T>{}) {}\\n explicit CoordinateCompressorBuilder(const std::vector<T> &xs) : _xs(xs) {}\\n explicit CoordinateCompressorBuilder(std::vector<T> &&xs) : _xs(std::move(xs)) {}\\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\\n CoordinateCompressorBuilder(const int n, Gen generator) {\\n reserve(n);\\n for (int i = 0; i < n; ++i) push(generator(i));\\n }\\n // Attempt to preallocate enough memory for specified number of elements.\\n void reserve(int n) {\\n _xs.reserve(n);\\n }\\n // Add data.\\n void push(const T &first) {\\n _xs.push_back(first);\\n }\\n // Add data.\\n void push(T &&first) {\\n _xs.push_back(std::move(first));\\n }\\n // Add data in the range of [first, last). \\n template <typename Iterator>\\n auto push(const Iterator &first, const Iterator &last) -> decltype(std::vector<T>{}.push_back(*first), void()) {\\n for (auto it = first; it != last; ++it) _xs.push_back(*it);\\n }\\n // Add all data in the container. Equivalent to `push(iterable.begin(), iterable.end())`.\\n template <typename Iterable>\\n auto push(const Iterable &iterable) -> decltype(std::vector<T>{}.push_back(*iterable.begin()), void()) {\\n push(iterable.begin(), iterable.end());\\n }\\n // Add data.\\n template <typename ...Args>\\n void emplace(Args &&...args) {\\n _xs.emplace_back(std::forward<Args>(args)...);\\n }\\n // Build compressor.\\n auto build() {\\n std::sort(_xs.begin(), _xs.end()), _xs.erase(std::unique(_xs.begin(), _xs.end()), _xs.end());\\n return Compressor {_xs};\\n }\\n // Build compressor from vector.\\n static auto build(const std::vector<T> &xs) {\\n return CoordinateCompressorBuilder(xs).build();\\n }\\n // Build compressor from vector.\\n static auto build(std::vector<T> &&xs) {\\n return CoordinateCompressorBuilder(std::move(xs)).build();\\n }\\n // Build compressor from generator.\\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\\n static auto build(const int n, Gen generator) {\\n return CoordinateCompressorBuilder<T>(n, generator).build();\\n }\\n private:\\n std::vector<T> _xs;\\n};\\n\\n} // namespace suisen\\n\\n#include <queue>\\n\\nnamespace suisen {\\n\\nenum MCFPotentialInitializer {\\n DAG, BELLMAN_FORD, DIJKSTRA\\n};\\n\\ntemplate <typename Cap, typename Cost, MCFPotentialInitializer init_method = MCFPotentialInitializer::BELLMAN_FORD>\\nclass MinCostFlow {\\n struct InternalEdge { int to; Cap cap; Cost cost; int rev; };\\n public:\\n MinCostFlow() : MinCostFlow(0) {}\\n MinCostFlow(int n) : n(n), g(n), potential(n, 0), dist(n), prev_vid(n), prev_eid(n) {}\\n\\n // Returns the id of created edge.\\n int add_edge(int u, int v, Cap cap, Cost cost) {\\n int edge_id = edges.size();\\n edges.emplace_back(u, g[u].size());\\n g[u].push_back({ v, cap, cost, int(g[v].size()) });\\n g[v].push_back({ u, 0, -cost, int(g[u].size()) - 1 });\\n return edge_id;\\n }\\n\\n /**\\n * Returns { flow, cost } (flow = min(max_flow, f))\\n */\\n auto min_cost_max_flow(const int s, const int t, const Cap f) {\\n return min_cost_max_flow_slope(s, t, f).back();\\n }\\n /**\\n * Returns { flow, cost } (flow = max_flow)\\n */\\n auto min_cost_max_flow(const int s, const int t) {\\n return min_cost_max_flow_slope(s, t).back();\\n }\\n /**\\n * Returns { flow, cost }\\n * amount of flow is arbitrary.\\n */\\n auto min_cost_arbitrary_flow(const int s, const int t) {\\n return min_cost_arbitrary_flow_slope(s, t).back();\\n }\\n\\n auto min_cost_max_flow_slope(const int s, const int t, const Cap f) {\\n return min_cost_flow_slope(s, t, f, [](Cap, Cost){ return true; });\\n }\\n auto min_cost_max_flow_slope(const int s, const int t) {\\n return min_cost_max_flow_slope(s, t, INF_FLOW);\\n }\\n auto min_cost_arbitrary_flow_slope(const int s, const int t) {\\n return min_cost_flow_slope(s, t, INF_FLOW, [this, t](Cap, Cost){ return potential[t] < 0; });\\n }\\n\\n struct Edge {\\n int from, to;\\n Cap cap, flow;\\n Cost cost;\\n };\\n\\n Edge get_edge(int edge_id) const {\\n const auto &e = g[edges[edge_id].first][edges[edge_id].second];\\n const auto &re = g[e.to][e.rev];\\n return Edge { re.to, e.to, e.cap + re.cap, re.cap, e.cost };\\n }\\n std::vector<Edge> get_edges() const {\\n std::vector<Edge> res(edges.size());\\n for (std::size_t i = 0; i < edges.size(); ++i) res[i] = get_edge(i);\\n return res;\\n }\\n\\n private:\\n static constexpr Cost INF_COST = std::numeric_limits<Cost>::max() / 2;\\n static constexpr Cost INF_FLOW = std::numeric_limits<Cap>::max() / 2;\\n \\n int n;\\n std::vector<std::vector<InternalEdge>> g;\\n std::vector<Cost> potential;\\n std::vector<Cost> dist;\\n std::vector<int> prev_vid, prev_eid;\\n\\n std::vector<std::pair<int, int>> edges;\\n\\n template <typename Predicate>\\n std::pair<Cap, Cost> min_cost_flow(const int s, const int t, const Cap upper_flow, Predicate pred) {\\n return min_cost_flow_slope(s, t, upper_flow, pred).back();\\n }\\n\\n template <typename Predicate>\\n std::vector<std::pair<Cap, Cost>> min_cost_flow_slope(const int s, const int t, const Cap upper_flow, Predicate pred) {\\n if constexpr (init_method == BELLMAN_FORD) {\\n bellman_ford(s);\\n } else if constexpr (init_method == DIJKSTRA) {\\n dijkstra(s);\\n } else {\\n dag_dp(s);\\n }\\n update_potential();\\n std::vector<std::pair<Cap, Cost>> slope;\\n Cap flow = 0;\\n Cost cost = 0;\\n slope.emplace_back(flow, cost);\\n while (dist[t] != INF_COST and flow < upper_flow and pred(flow, cost)) {\\n Cap df = upper_flow - flow;\\n for (int v = t; v != s; v = prev_vid[v]) {\\n df = std::min(df, g[prev_vid[v]][prev_eid[v]].cap);\\n }\\n assert(df != 0);\\n flow += df;\\n cost += df * potential[t];\\n if (slope.size() >= 2) {\\n auto [f0, c0] = *std::next(slope.rbegin());\\n auto [f1, c1] = *slope.rbegin();\\n if ((f1 - f0) * (cost - c1) == (flow - f1) * (c1 - c0)) slope.pop_back();\\n }\\n slope.emplace_back(flow, cost);\\n for (int v = t; v != s; v = prev_vid[v]) {\\n auto &e = g[prev_vid[v]][prev_eid[v]];\\n e.cap -= df;\\n g[v][e.rev].cap += df;\\n }\\n dijkstra(s);\\n update_potential();\\n }\\n return slope;\\n }\\n\\n void update_potential() {\\n for (int u = 0; u < n; ++u) {\\n if (potential[u] != INF_COST) potential[u] += dist[u];\\n }\\n }\\n\\n bool update_dist(int u, int eid) {\\n if (dist[u] == INF_COST) return false;\\n const auto &e = g[u][eid];\\n if (e.cap == 0) return false;\\n const int v = e.to;\\n Cost cost = e.cost + potential[u] - potential[v];\\n if constexpr (init_method == DIJKSTRA) {\\n assert(cost >= 0);\\n }\\n if (dist[u] + cost < dist[v]) {\\n dist[v] = dist[u] + cost;\\n prev_vid[v] = u;\\n prev_eid[v] = eid;\\n return true;\\n }\\n return false;\\n }\\n\\n void dijkstra(int s) {\\n using State = std::pair<Cost, int>;\\n std::priority_queue<State, std::vector<State>, std::greater<State>> pq;\\n dist.assign(n, INF_COST);\\n pq.emplace(dist[s] = 0, s);\\n while (pq.size()) {\\n auto [du, u] = pq.top();\\n pq.pop();\\n if (du != dist[u]) continue;\\n for (int i = 0; i < int(g[u].size()); ++i) {\\n int v = g[u][i].to;\\n if (update_dist(u, i)) {\\n pq.emplace(dist[v], v);\\n }\\n }\\n }\\n }\\n\\n void dag_dp(int s) {\\n std::vector<int> in(n, 0);\\n for (int u = 0; u < n; ++u) {\\n for (const auto &e : g[u]) {\\n if (e.cap == 0) continue;\\n ++in[e.to];\\n }\\n }\\n std::deque<int> dq;\\n for (int u = 0; u < n; ++u) {\\n if (in[u] == 0) dq.push_back(u);\\n }\\n dist.assign(n, INF_COST);\\n dist[s] = 0;\\n while (dq.size()) {\\n int u = dq.front();\\n dq.pop_front();\\n for (int i = 0; i < int(g[u].size()); ++i) {\\n const auto &e = g[u][i];\\n if (e.cap == 0) continue;\\n update_dist(u, i);\\n if (--in[e.to] == 0) {\\n dq.push_back(e.to);\\n }\\n }\\n }\\n assert(std::all_of(in.begin(), in.end(), [](int in_deg) { return in_deg == 0; }));\\n }\\n\\n void bellman_ford(int s) {\\n dist.assign(n, INF_COST);\\n dist[s] = 0;\\n for (bool has_update = true; has_update;) {\\n has_update = false;\\n for (int u = 0; u < n; ++u) {\\n if (dist[u] == INF_COST) continue;\\n for (int i = 0; i < int(g[u].size()); ++i) {\\n has_update |= update_dist(u, i);\\n }\\n }\\n }\\n }\\n};\\n} // namespace suisen\\n\\nint main() {\\n int n;\\n std::cin >> n;\\n suisen::CoordinateCompressorBuilder<int> comp_builder;\\n std::vector<std::pair<int, int>> ps(n);\\n for (auto &[x, y] : ps) {\\n std::cin >> x >> y;\\n comp_builder.push(x);\\n comp_builder.push(y);\\n }\\n auto comp = comp_builder.build();\\n int m = comp.size();\\n int s = n + m, t = s + 1;\\n\\n suisen::MinCostFlow<int, int, suisen::DAG> mcf(n + m + 2);\\n for (int i = 0; i < n; ++i) {\\n mcf.add_edge(s, i, 1, 0);\\n auto [a, b] = ps[i];\\n mcf.add_edge(i, n + comp[a], 1, -b);\\n mcf.add_edge(i, n + comp[b], 1, -a);\\n }\\n for (int i = 0; i < m; ++i) {\\n mcf.add_edge(n + i, t, 1, 0);\\n }\\n std::cout << -mcf.min_cost_arbitrary_flow(s, t).second << std::endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3832,\n \"score_of_the_acc\": -0.1438,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2293_6026685\",\n \"code_snippet\": \"#include <iostream>\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\n#include <limits>\\n#include <type_traits>\\n\\nnamespace suisen {\\n// ! utility\\ntemplate <typename ...Types>\\nusing constraints_t = std::enable_if_t<std::conjunction_v<Types...>, std::nullptr_t>;\\ntemplate <bool cond_v, typename Then, typename OrElse>\\nconstexpr decltype(auto) constexpr_if(Then&& then, OrElse&& or_else) {\\n if constexpr (cond_v) {\\n return std::forward<Then>(then);\\n } else {\\n return std::forward<OrElse>(or_else);\\n }\\n}\\n\\n// ! function\\ntemplate <typename ReturnType, typename Callable, typename ...Args>\\nusing is_same_as_invoke_result = std::is_same<std::invoke_result_t<Callable, Args...>, ReturnType>;\\ntemplate <typename F, typename T>\\nusing is_uni_op = is_same_as_invoke_result<T, F, T>;\\ntemplate <typename F, typename T>\\nusing is_bin_op = is_same_as_invoke_result<T, F, T, T>;\\n\\ntemplate <typename Comparator, typename T>\\nusing is_comparator = std::is_same<std::invoke_result_t<Comparator, T, T>, bool>;\\n\\n// ! integral\\ntemplate <typename T, typename = constraints_t<std::is_integral<T>>>\\nconstexpr int bit_num = std::numeric_limits<std::make_unsigned_t<T>>::digits;\\ntemplate <typename T, unsigned int n>\\nstruct is_nbit { static constexpr bool value = bit_num<T> == n; };\\ntemplate <typename T, unsigned int n>\\nstatic constexpr bool is_nbit_v = is_nbit<T, n>::value;\\n\\n// ?\\ntemplate <typename T>\\nstruct safely_multipliable {};\\ntemplate <>\\nstruct safely_multipliable<int> { using type = long long; };\\ntemplate <>\\nstruct safely_multipliable<long long> { using type = __int128_t; };\\ntemplate <>\\nstruct safely_multipliable<float> { using type = float; };\\ntemplate <>\\nstruct safely_multipliable<double> { using type = double; };\\ntemplate <>\\nstruct safely_multipliable<long double> { using type = long double; };\\ntemplate <typename T>\\nusing safely_multipliable_t = typename safely_multipliable<T>::type;\\n\\n} // namespace suisen\\n\\nnamespace suisen {\\ntemplate <typename T>\\nclass CoordinateCompressorBuilder {\\n public:\\n struct Compressor {\\n public:\\n static constexpr int absent = -1;\\n\\n // default constructor\\n Compressor() : _xs(std::vector<T>{}) {}\\n // Construct from strictly sorted vector\\n Compressor(const std::vector<T> &xs) : _xs(xs) {\\n assert(is_strictly_sorted(xs));\\n }\\n\\n // Return the number of distinct keys.\\n int size() const {\\n return _xs.size();\\n }\\n // Check if the element is registered.\\n bool has_key(const T &e) const {\\n return std::binary_search(_xs.begin(), _xs.end(), e);\\n }\\n // Compress the element. if not registered, returns `default_value`. (default: Compressor::absent)\\n int comp(const T &e, int default_value = absent) const {\\n const int res = min_geq_index(e);\\n return res != size() and _xs[res] == e ? res : default_value;\\n }\\n // Restore the element from the index.\\n T decomp(const int compressed_index) const {\\n return _xs[compressed_index];\\n }\\n // Compress the element. Equivalent to call `comp(e)`\\n int operator[](const T &e) const {\\n return comp(e);\\n }\\n // Return the minimum registered value greater than `e`. if not exists, return `default_value`.\\n T min_gt(const T &e, const T &default_value) const {\\n auto it = std::upper_bound(_xs.begin(), _xs.end(), e);\\n return it == _xs.end() ? default_value : *it;\\n }\\n // Return the minimum registered value greater than or equal to `e`. if not exists, return `default_value`.\\n T min_geq(const T &e, const T &default_value) const {\\n auto it = std::lower_bound(_xs.begin(), _xs.end(), e);\\n return it == _xs.end() ? default_value : *it;\\n }\\n // Return the maximum registered value less than `e`. if not exists, return `default_value`\\n T max_lt(const T &e, const T &default_value) const {\\n auto it = std::upper_bound(_xs.rbegin(), _xs.rend(), e);\\n return it == _xs.rend() ? default_value : *it;\\n }\\n // Return the maximum registered value less than or equal to `e`. if not exists, return `default_value`\\n T max_leq(const T &e, const T &default_value) const {\\n auto it = std::lower_bound(_xs.rbegin(), _xs.rend(), e);\\n return it == _xs.rend() ? default_value : *it;\\n }\\n // Return the compressed index of the minimum registered value greater than `e`. if not exists, return `compressor.size()`.\\n int min_gt_index(const T &e) const {\\n return std::upper_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\\n }\\n // Return the compressed index of the minimum registered value greater than or equal to `e`. if not exists, return `compressor.size()`.\\n int min_geq_index(const T &e) const {\\n return std::lower_bound(_xs.begin(), _xs.end(), e) - _xs.begin();\\n }\\n // Return the compressed index of the maximum registered value less than `e`. if not exists, return -1.\\n int max_lt_index(const T &e) const {\\n return int(_xs.rend() - std::upper_bound(_xs.rbegin(), _xs.rend(), e)) - 1;\\n }\\n // Return the compressed index of the maximum registered value less than or equal to `e`. if not exists, return -1.\\n int max_leq_index(const T &e) const {\\n return int(_xs.rend() - std::lower_bound(_xs.rbegin(), _xs.rend(), e)) - 1;\\n }\\n private:\\n std::vector<T> _xs;\\n static bool is_strictly_sorted(const std::vector<T> &v) {\\n return std::adjacent_find(v.begin(), v.end(), std::greater_equal<T>()) == v.end();\\n }\\n };\\n CoordinateCompressorBuilder() : _xs(std::vector<T>{}) {}\\n explicit CoordinateCompressorBuilder(const std::vector<T> &xs) : _xs(xs) {}\\n explicit CoordinateCompressorBuilder(std::vector<T> &&xs) : _xs(std::move(xs)) {}\\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\\n CoordinateCompressorBuilder(const int n, Gen generator) {\\n reserve(n);\\n for (int i = 0; i < n; ++i) push(generator(i));\\n }\\n // Attempt to preallocate enough memory for specified number of elements.\\n void reserve(int n) {\\n _xs.reserve(n);\\n }\\n // Add data.\\n void push(const T &first) {\\n _xs.push_back(first);\\n }\\n // Add data.\\n void push(T &&first) {\\n _xs.push_back(std::move(first));\\n }\\n // Add data in the range of [first, last). \\n template <typename Iterator>\\n auto push(const Iterator &first, const Iterator &last) -> decltype(std::vector<T>{}.push_back(*first), void()) {\\n for (auto it = first; it != last; ++it) _xs.push_back(*it);\\n }\\n // Add all data in the container. Equivalent to `push(iterable.begin(), iterable.end())`.\\n template <typename Iterable>\\n auto push(const Iterable &iterable) -> decltype(std::vector<T>{}.push_back(*iterable.begin()), void()) {\\n push(iterable.begin(), iterable.end());\\n }\\n // Add data.\\n template <typename ...Args>\\n void emplace(Args &&...args) {\\n _xs.emplace_back(std::forward<Args>(args)...);\\n }\\n // Build compressor.\\n auto build() {\\n std::sort(_xs.begin(), _xs.end()), _xs.erase(std::unique(_xs.begin(), _xs.end()), _xs.end());\\n return Compressor {_xs};\\n }\\n // Build compressor from vector.\\n static auto build(const std::vector<T> &xs) {\\n return CoordinateCompressorBuilder(xs).build();\\n }\\n // Build compressor from vector.\\n static auto build(std::vector<T> &&xs) {\\n return CoordinateCompressorBuilder(std::move(xs)).build();\\n }\\n // Build compressor from generator.\\n template <typename Gen, constraints_t<is_same_as_invoke_result<T, Gen, int>> = nullptr>\\n static auto build(const int n, Gen generator) {\\n return CoordinateCompressorBuilder<T>(n, generator).build();\\n }\\n private:\\n std::vector<T> _xs;\\n};\\n\\n} // namespace suisen\\n\\n#include <queue>\\n\\nnamespace suisen {\\n\\nenum MCFPotentialInitializer {\\n DAG, BELLMAN_FORD, DIJKSTRA\\n};\\n\\ntemplate <typename Cap, typename Cost, MCFPotentialInitializer init_method = MCFPotentialInitializer::BELLMAN_FORD>\\nclass MinCostFlow {\\n struct InternalEdge { int to; Cap cap; Cost cost; int rev; };\\n public:\\n MinCostFlow() : MinCostFlow(0) {}\\n MinCostFlow(int n) : n(n), g(n), potential(n, 0), dist(n), prev_vid(n), prev_eid(n) {}\\n\\n // Returns the id of created edge.\\n int add_edge(int u, int v, Cap cap, Cost cost) {\\n int edge_id = edges.size();\\n edges.emplace_back(u, g[u].size());\\n g[u].push_back({ v, cap, cost, int(g[v].size()) });\\n g[v].push_back({ u, 0, -cost, int(g[u].size()) - 1 });\\n return edge_id;\\n }\\n\\n /**\\n * Returns { flow, cost } (flow = min(max_flow, f))\\n */\\n auto min_cost_max_flow(const int s, const int t, const Cap f) {\\n return min_cost_max_flow_slope(s, t, f).back();\\n }\\n /**\\n * Returns { flow, cost } (flow = max_flow)\\n */\\n auto min_cost_max_flow(const int s, const int t) {\\n return min_cost_max_flow_slope(s, t).back();\\n }\\n /**\\n * Returns { flow, cost }\\n * amount of flow is arbitrary.\\n */\\n auto min_cost_arbitrary_flow(const int s, const int t) {\\n return min_cost_arbitrary_flow_slope(s, t).back();\\n }\\n\\n auto min_cost_max_flow_slope(const int s, const int t, const Cap f) {\\n return min_cost_flow_slope(s, t, f, [](Cap, Cost){ return true; });\\n }\\n auto min_cost_max_flow_slope(const int s, const int t) {\\n return min_cost_max_flow_slope(s, t, INF_FLOW);\\n }\\n auto min_cost_arbitrary_flow_slope(const int s, const int t) {\\n return min_cost_flow_slope(s, t, INF_FLOW, [this, t](Cap, Cost){ return potential[t] < 0; });\\n }\\n\\n struct Edge {\\n int from, to;\\n Cap cap, flow;\\n Cost cost;\\n };\\n\\n Edge get_edge(int edge_id) const {\\n const auto &e = g[edges[edge_id].first][edges[edge_id].second];\\n const auto &re = g[e.to][e.rev];\\n return Edge { re.to, e.to, e.cap + re.cap, re.cap, e.cost };\\n }\\n std::vector<Edge> get_edges() const {\\n std::vector<Edge> res(edges.size());\\n for (std::size_t i = 0; i < edges.size(); ++i) res[i] = get_edge(i);\\n return res;\\n }\\n\\n private:\\n static constexpr Cost INF_COST = std::numeric_limits<Cost>::max() / 2;\\n static constexpr Cost INF_FLOW = std::numeric_limits<Cap>::max() / 2;\\n \\n int n;\\n std::vector<std::vector<InternalEdge>> g;\\n std::vector<Cost> potential;\\n std::vector<Cost> dist;\\n std::vector<int> prev_vid, prev_eid;\\n\\n std::vector<std::pair<int, int>> edges;\\n\\n template <typename Predicate>\\n std::pair<Cap, Cost> min_cost_flow(const int s, const int t, const Cap upper_flow, Predicate pred) {\\n return min_cost_flow_slope(s, t, upper_flow, pred).back();\\n }\\n\\n template <typename Predicate>\\n std::vector<std::pair<Cap, Cost>> min_cost_flow_slope(const int s, const int t, const Cap upper_flow, Predicate pred) {\\n switch (init_method) {\\n case BELLMAN_FORD: bellman_ford(s); break;\\n case DIJKSTRA: dijkstra(s); break;\\n case DAG: dag_dp(s); break;\\n }\\n update_potential();\\n std::vector<std::pair<Cap, Cost>> slope;\\n Cap flow = 0;\\n Cost cost = 0;\\n slope.emplace_back(flow, cost);\\n while (dist[t] != INF_COST and flow < upper_flow and pred(flow, cost)) {\\n Cap df = upper_flow - flow;\\n for (int v = t; v != s; v = prev_vid[v]) {\\n df = std::min(df, g[prev_vid[v]][prev_eid[v]].cap);\\n }\\n assert(df != 0);\\n flow += df;\\n cost += df * potential[t];\\n if (slope.size() >= 2) {\\n auto [f0, c0] = *std::next(slope.rbegin());\\n auto [f1, c1] = *slope.rbegin();\\n if ((f1 - f0) * (cost - c1) == (flow - f1) * (c1 - c0)) slope.pop_back();\\n }\\n slope.emplace_back(flow, cost);\\n for (int v = t; v != s; v = prev_vid[v]) {\\n auto &e = g[prev_vid[v]][prev_eid[v]];\\n e.cap -= df;\\n g[v][e.rev].cap += df;\\n }\\n dijkstra(s);\\n update_potential();\\n }\\n return slope;\\n }\\n\\n void update_potential() {\\n for (int u = 0; u < n; ++u) {\\n if (potential[u] != INF_COST) potential[u] += dist[u];\\n }\\n }\\n\\n bool update_dist(int u, int eid) {\\n if (dist[u] == INF_COST) return false;\\n const auto &e = g[u][eid];\\n if (e.cap == 0) return false;\\n const int v = e.to;\\n Cost cost = e.cost + potential[u] - potential[v];\\n if constexpr (init_method == DIJKSTRA) {\\n assert(cost >= 0);\\n }\\n if (dist[u] + cost < dist[v]) {\\n dist[v] = dist[u] + cost;\\n prev_vid[v] = u;\\n prev_eid[v] = eid;\\n return true;\\n }\\n return false;\\n }\\n\\n void dijkstra(int s) {\\n using State = std::pair<Cost, int>;\\n std::priority_queue<State, std::vector<State>, std::greater<State>> pq;\\n dist.assign(n, INF_COST);\\n pq.emplace(dist[s] = 0, s);\\n while (pq.size()) {\\n auto [du, u] = pq.top();\\n pq.pop();\\n if (du != dist[u]) continue;\\n for (int i = 0; i < int(g[u].size()); ++i) {\\n int v = g[u][i].to;\\n if (update_dist(u, i)) {\\n pq.emplace(dist[v], v);\\n }\\n }\\n }\\n }\\n\\n void dag_dp(int s) {\\n std::vector<int> in(n, 0);\\n for (int u = 0; u < n; ++u) {\\n for (const auto &e : g[u]) {\\n if (e.cap == 0) continue;\\n ++in[e.to];\\n }\\n }\\n std::deque<int> dq;\\n for (int u = 0; u < n; ++u) {\\n if (in[u] == 0) dq.push_back(u);\\n }\\n dist.assign(n, INF_COST);\\n dist[s] = 0;\\n while (dq.size()) {\\n int u = dq.front();\\n dq.pop_front();\\n for (int i = 0; i < int(g[u].size()); ++i) {\\n const auto &e = g[u][i];\\n if (e.cap == 0) continue;\\n update_dist(u, i);\\n if (--in[e.to] == 0) {\\n dq.push_back(e.to);\\n }\\n }\\n }\\n assert(std::all_of(in.begin(), in.end(), [](int in_deg) { return in_deg == 0; }));\\n }\\n\\n void bellman_ford(int s) {\\n dist.assign(n, INF_COST);\\n dist[s] = 0;\\n for (bool has_update = true; has_update;) {\\n has_update = false;\\n for (int u = 0; u < n; ++u) {\\n if (dist[u] == INF_COST) continue;\\n for (int i = 0; i < int(g[u].size()); ++i) {\\n has_update |= update_dist(u, i);\\n }\\n }\\n }\\n }\\n};\\n} // namespace suisen\\n\\nint main() {\\n int n;\\n std::cin >> n;\\n suisen::CoordinateCompressorBuilder<int> comp_builder;\\n std::vector<std::pair<int, int>> ps(n);\\n for (auto &[x, y] : ps) {\\n std::cin >> x >> y;\\n comp_builder.push(x);\\n comp_builder.push(y);\\n }\\n auto comp = comp_builder.build();\\n int m = comp.size();\\n int s = n + m, t = s + 1;\\n\\n suisen::MinCostFlow<int, int, suisen::DAG> mcf(n + m + 2);\\n for (int i = 0; i < n; ++i) {\\n mcf.add_edge(s, i, 1, 0);\\n auto [a, b] = ps[i];\\n mcf.add_edge(i, n + comp[a], 1, -b);\\n mcf.add_edge(i, n + comp[b], 1, -a);\\n }\\n for (int i = 0; i < m; ++i) {\\n mcf.add_edge(n + i, t, 1, 0);\\n }\\n std::cout << -mcf.min_cost_arbitrary_flow(s, t).second << std::endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3864,\n \"score_of_the_acc\": -0.1445,\n \"final_rank\": 11\n }\n]","isConversational":false}}},{"rowIdx":1279,"cells":{"group_id":{"kind":"string","value":"aoj_2291_cpp"},"problem_description":{"kind":"string","value":"B: Brilliant Stars\nICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．\n今日の修行は，夜空に輝くたくさんの星たちを観測して，視力と集中力を鍛えようというものである．うさぎは独自のセンスで星の特徴を記録していくことができる．\nうさぎは「星の観測日記」として記録した星の特徴をノートにつけていくことにした．ここで，「似ている」 2 つの星をともに記録することは避けたい．2 つの星が「似ている」かどうかは，すべてうさぎの判断で決まっている．「似ている」かどうかの関係はあまり複雑ではなく，以下の条件を満たす．\n条件： 異なる 4 つの星 A, B, C, D があり，A と B，B と C，C と D がそれぞれ「似ている」とする．このとき，A と C が「似ている」か，B と D が「似ている」か，あるいはその両方が成り立つ．\nうさぎは「似ている」 2 つの星を記録しないようになるべくたくさんの星を記録したい．また，そのようにする方法が何通りあるかも知りたい．\nInput\nN\nM\nX\n1\nY\n1\n...\nX\nM\nY\nM\nN\nは星の個数，\nM\nは「似ている」 2 つの星の組の個数である．星は 1 以上\nN\n以下の整数の番号により表され，\nX\ni\n,\nY\ni\n(1 ≤\ni\n≤\nM\n) は星\nX\ni\nと星\nY\ni\nが「似ている」ことを表す．\n1 ≤\nN\n≤ 100,000，0 ≤\nM\n≤ 200,000，1 ≤\nX\ni\n<\nY\ni\n≤\nN\nを満たす．(\nX\ni\n,\nY\ni\n) として同一の組は複数回現れない．「似ている」かどうかの関係は，問題文で指定された条件を満たす．\nOutput\n1 行目に，「似ている」 2 つの星を記録しないように記録できる星の個数の最大値を，2 行目に，その最大値を実現できる星の組み合わせの個数 (記録する順番のみを変えたものは同じと考える) を 1,000,000,009 で割った余りを出力せよ．\nSample Input 1\n4 3\n1 2\n1 3\n1 4\nSample Output 1\n3\n1\nSample Input 2\n11 5\n1 2\n3 4\n5 6\n7 8\n9 10\nSample Output 2\n6\n32\nSample Input 3\n9 14\n1 2\n1 3\n2 3\n3 4\n3 5\n3 6\n3 7\n3 8\n3 9\n4 5\n4 6\n5 6\n7 8\n8 9\nSample Output 3\n4\n6"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2291_10866253","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for(ll i=0; i <ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate <class A, class B>\nbool chmax(A &a, B b) { return a < b && (a=b, true); }\ntemplate <class A, class B>\nbool chmin(A &a, B b) { return b < a && (a=b, true); }\n\n\nvoid testcase(){\n int N, M; cin >> N >> M;\n V<V<int>> adj(N);\n REP(i,M){\n int u,v; cin >> u >> v; u--; v--;\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n V<int> deg(N);\n REP(i,N) deg[i] = adj[i].size();\n V<V<int>> que(N);\n REP(i,N) REP(j,deg[i]+1) que[j].push_back(i);\n V<int> peo;\n for(int d=N-1; d>=0; d--) for(int v : que[d]) if(deg[v] == d){\n deg[v] = -1;\n peo.push_back(v);\n for(int w : adj[v]) deg[w]--;\n }\n reverse(peo.begin(), peo.end());\n V<int> hit(N), used(N), ord(N);\n REP(i,N) ord[peo[i]] = i;\n for(int v : peo) if(!hit[v]){\n hit[v] = used[v] = 1;\n for(int w : adj[v]) hit[w]++;\n }\n int val = 0;\n for(int x : used) val += x;\n ll cnt = 1;\n for(int v : peo) if(used[v]){\n ll t = 1;\n for(int w : adj[v]) if(ord[v] < ord[w] && hit[w] == 1) t++;\n cnt = cnt * t % 1000000009;\n }\n cout << val << \"\\n\" << cnt << \"\\n\";\n}\n\nint main() {\n cin.tie(nullptr)->sync_with_stdio(false);\n testcase();\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":15540,"score_of_the_acc":-0.2854,"final_rank":4},{"submission_id":"aoj_2291_10207074","code_snippet":"// AOJ #2291\n// Brilliant Stars 2025.2.9\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\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\nconst ll MOD = 1000000009;\n \nint N, M;\nvector<vector<int>> adj;\n \ninline bool isAdjacent(int u, int v) {\n return binary_search(adj[u].begin(), adj[u].end(), v);\n}\n \npair<ll, ll> solveSubset(const vector<int>& V) {\n if (V.empty()) return {0, 1};\n if (V.size() == 1) return {1, 1};\n \n vector<bool> inLocal(N + 1, false);\n for (int v : V) inLocal[v] = true;\n \n vector<bool> visited(N + 1, false);\n vector<vector<int>> compList;\n for (int v : V) {\n if (!visited[v]) {\n vector<int> comp;\n queue<int> q;\n q.push(v);\n visited[v] = true;\n while (!q.empty()) {\n int cur = q.front();\n q.pop();\n comp.push_back(cur);\n for (int nb : adj[cur]) {\n if (inLocal[nb] && !visited[nb]) {\n visited[nb] = true;\n q.push(nb);\n }\n }\n }\n compList.push_back(comp);\n }\n }\n \n if (compList.size() > 1) {\n ll totalSize = 0, totalWays = 1;\n for (auto &comp : compList) {\n auto subRes = solveSubset(comp);\n totalSize += subRes.first;\n totalWays = (totalWays * subRes.second) % MOD;\n }\n return {totalSize, totalWays};\n }\n \n set<int> rem;\n for (int v : V) rem.insert(v);\n\n vector<vector<int>> compComp;\n while (!rem.empty()) {\n int start = *rem.begin();\n rem.erase(rem.begin());\n vector<int> comp;\n queue<int> q;\n q.push(start);\n comp.push_back(start);\n while (!q.empty()) {\n int cur = q.front();\n q.pop();\n for (auto it = rem.begin(); it != rem.end(); ) {\n int candidate = *it;\n if (!isAdjacent(cur, candidate)) {\n q.push(candidate);\n comp.push_back(candidate);\n it = rem.erase(it);\n } else ++it;\n }\n }\n compComp.push_back(comp);\n }\n \n ll bestSize = 0, waysCount = 0;\n for (auto &comp : compComp) {\n auto subRes = solveSubset(comp);\n if (subRes.first > bestSize) {\n bestSize = subRes.first;\n waysCount = subRes.second;\n } else if (subRes.first == bestSize) {\n waysCount = (waysCount + subRes.second) % MOD;\n }\n }\n return {bestSize, waysCount};\n}\n \nint main() {\n N = Cin(), M = Cin();\n adj.resize(N + 1);\n for (int i = 0; i < M; i++){\n int u = Cin(), v = Cin();\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n for (int i = 1; i <= N; i++){\n sort(adj[i].begin(), adj[i].end());\n }\n \n vector<int> allVerts;\n allVerts.reserve(N);\n for (int i = 1; i <= N; i++){\n allVerts.push_back(i);\n }\n \n auto ans = solveSubset(allVerts);\n Cout(ans.first), Cout(ans.second % MOD);\n return 0;\n}","accuracy":1,"time_ms":150,"memory_kb":26488,"score_of_the_acc":-0.631,"final_rank":8},{"submission_id":"aoj_2291_9518633","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nconst ll MOD = 1e9 + 9;\n\nusing G = vector<vector<int>>;\nstruct SCC {\n int n;\n const G &g;\n G edge, redge;\n vector<int> comp, order, used;\n \n SCC(int n, G &g) : n(n), g(g), edge(n), redge(n), comp(n, -1), used(n) {\n for (int i = 0; i < n; ++i) {\n for (auto e : g[i]) {\n edge[i].emplace_back(e);\n redge[e].emplace_back(i);\n }\n }\n }\n \n void dfs(int idx) {\n if (used[idx]) return;\n used[idx] = true;\n for (int to : edge[idx]) dfs(to);\n order.emplace_back(idx);\n }\n \n void rdfs(int idx, int cnt) {\n if (comp[idx] != -1) return;\n comp[idx] = cnt;\n for (int to : redge[idx]) rdfs(to, cnt);\n }\n \n G build() {\n G t;\n for (int i = 0; i < n; ++i) dfs(i);\n reverse(order.begin(), order.end());\n int ptr = 0;\n for (int i : order) {\n if (comp[i] == -1) {\n rdfs(i, ptr), ptr++;\n }\n }\n \n t.resize(ptr);\n for (int i = 0; i < n; ++i) {\n t[comp[i]].emplace_back(i);\n }\n return t;\n }\n \n};\n\n\nint main() {\n ll N, M; cin >> N >> M;\n vector<int> deg(N, 0);\n vector< array<int, 2> > edge(M);\n for (int i = 0; i < M; ++i) {\n int x, y; cin >> x >> y;\n x--, y--;\n edge[i] = {x, y};\n deg[x]++;\n deg[y]++;\n }\n \n G graph(N);\n for (auto [x, y] : edge) {\n if (deg[x] <= deg[y]) graph[x].emplace_back(y);\n if (deg[y] <= deg[x]) graph[y].emplace_back(x);\n }\n vector<int> in(N, 0), out(N, 0);\n for (int u = 0; u < N; ++u) {\n for (auto v : graph[u]) {\n in[v]++;\n out[u]++;\n }\n }\n \n SCC hoge(N, graph);\n G scc = hoge.build();\n \n ll mx = 0, mult = 1;\n for (auto vec : scc) {\n int n = vec.size();\n int v = vec[0];\n \n if (in[v] == n-1) {\n mx++;\n mult *= n;\n mult %= MOD;\n }\n }\n cout << mx << endl;\n cout << mult << endl;\n \n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":27472,"score_of_the_acc":-0.6003,"final_rank":7},{"submission_id":"aoj_2291_8305039","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <tuple>\nusing namespace std;\n\nint N;\nint M, X[200009], Y[200009];\nint Deg[200009];\nint Col[200009], NumCol;\nint Sta[200009], NumSta;\nint Height[200009];\nvector<int> G[200009];\nvector<int> H[200009];\nvector<int> I[200009];\nqueue<tuple<vector<int>, vector<pair<int, int>>, int>> Q;\n\nvoid dfs(int pos) {\n\tCol[pos] = NumCol;\n\tfor (int to : G[pos]) {\n\t\tif (Col[to] != -1) continue;\n\t\tdfs(to);\n\t}\n}\n\nvoid dfs2(int pos) {\n\tSta[pos] = NumSta;\n\tfor (int to : I[pos]) {\n\t\tif (Sta[to] != -1) continue;\n\t\tdfs2(to);\n\t}\n}\n\nvoid dfs3(int pos, int dep) {\n\tHeight[pos] = dep;\n\tfor (int to : H[pos]) {\n\t\tint nex_dep = dep + 1; if (H[to].size() >= 2) nex_dep = 0;\n\t\tdfs3(to, nex_dep);\n\t}\n}\n\nint MakeTree(vector<int> V1, vector<pair<int, int>> E1) {\n\tQ.push(make_tuple(V1, E1, -1));\n\tint Root = -1;\n\n\twhile (!Q.empty()) {\n\t\tvector<int> V = get<0>(Q.front());\n\t\tvector<pair<int, int>> E = get<1>(Q.front());\n\t\tint Parent = get<2>(Q.front());\n\t\tQ.pop();\n\n\t\t// Step A. Find Degree\n\t\tfor (int i : V) Deg[i] = 0;\n\t\tfor (int i = 0; i < E.size(); i++) Deg[E[i].first] += 1;\n\t\tfor (int i = 0; i < E.size(); i++) Deg[E[i].second] += 1;\n\n\t\t// Step B. Get Maximum\n\t\tint MaxID = -1;\n\t\tfor (int i = 0; i < V.size(); i++) {\n\t\t\tif (Deg[V[i]] == V.size() - 1) { MaxID = V[i]; break; }\n\t\t}\n\t\tif (Parent == -1) Root = MaxID;\n\t\tif (Parent != -1) H[Parent].push_back(MaxID);\n\t\tif (V.size() == 1) continue;\n\n\t\t// Step C. Make Graph\n\t\tfor (int i : V) G[i].clear();\n\t\tfor (int i : V) Col[i] = -1;\n\t\tfor (pair<int, int> i : E) {\n\t\t\tif (i.first != MaxID && i.second != MaxID) {\n\t\t\t\tG[i.first].push_back(i.second);\n\t\t\t\tG[i.second].push_back(i.first);\n\t\t\t}\n\t\t}\n\n\t\t// Step D. DFS\n\t\tNumCol = 0;\n\t\tfor (int i : V) {\n\t\t\tif (Col[i] != -1 || i == MaxID) continue;\n\t\t\tdfs(i);\n\t\t\tNumCol += 1;\n\t\t}\n\n\t\t// Step E. Recursion\n\t\tvector<vector<int>> V2(NumCol);\n\t\tvector<vector<pair<int, int>>> E2(NumCol);\n\t\tfor (int i : V) {\n\t\t\tif (i != MaxID) V2[Col[i]].push_back(i);\n\t\t}\n\t\tfor (pair<int, int> i : E) {\n\t\t\tif (i.first == MaxID || i.second == MaxID) continue;\n\t\t\tE2[Col[i.first]].push_back(i);\n\t\t}\n\t\tfor (int i = 0; i < V2.size(); i++) Q.push(make_tuple(V2[i], E2[i], MaxID));\n\t}\n\n\t// Return\n\treturn Root;\n}\n\nint main() {\n\t// Step 1. Input\n\tcin >> N >> M;\n\tfor (int i = 1; i <= M; i++) cin >> X[i] >> Y[i];\n\tfor (int i = 1; i <= M; i++) I[X[i]].push_back(Y[i]);\n\tfor (int i = 1; i <= M; i++) I[Y[i]].push_back(X[i]);\n\n\t// Step 2. Connected Components\n\tfor (int i = 1; i <= N; i++) Sta[i] = -1;\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (Sta[i] != -1) continue;\n\t\tdfs2(i);\n\t\tNumSta += 1;\n\t}\n\n\t// Step 3. Make Tree\n\tvector<vector<int>> V(NumSta);\n\tvector<vector<pair<int, int>>> E(NumSta);\n\tvector<int> Root;\n\tfor (int i = 1; i <= N; i++) V[Sta[i]].push_back(i);\n\tfor (int i = 1; i <= M; i++) E[Sta[X[i]]].push_back(make_pair(X[i], Y[i]));\n\tfor (int i = 0; i < NumSta; i++) {\n\t\tint ret = MakeTree(V[i], E[i]);\n\t\tRoot.push_back(ret);\n\t}\n\n\t// Step 4. Calculate Answer\n\tlong long mod = 1000000009;\n\tlong long Answer1 = 0;\n\tlong long Answer2 = 1;\n\tfor (int i : Root) dfs3(i, (H[i].size() >= 2 ? 0 : 1));\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (H[i].size() >= 1) continue;\n\t\tAnswer1 += 1;\n\t\tAnswer2 *= (long long)Height[i];\n\t\tAnswer2 %= mod;\n\t}\n\tcout << Answer1 << endl;\n\tcout << Answer2 << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":680,"memory_kb":44116,"score_of_the_acc":-1.3646,"final_rank":14},{"submission_id":"aoj_2291_6039541","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 = 1000000009;\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 << 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\nusing mp = pair<int, modint>;\nvoid merge(mp& a, mp b) {\n\tif (a.first < b.first)a = b;\n\telse if (a.first == b.first)a.second += b.second;\n}\nvoid solve() {\n\tint n, m; cin >> n >> m;\n\tvector<vector<int>> G(n);\n\trep(i, m) {\n\t\tint a, b; cin >> a >> b; a--; b--;\n\t\tG[a].push_back(b);\n\t\tG[b].push_back(a);\n\t}\n\tauto comp = [&](int i, int j) {\n\t\treturn G[i].size() < G[j].size();\n\t};\n\tvector<int> ori(n); rep(i, n)ori[i] = i;\n\tsort(all(ori), comp);\n\tvector<int> rev(n); rep(i, n)rev[ori[i]] = i;\n\tvector<bool> ban(n);\n\tvector<mp> dp(n);\n\trep(i, n) {\n\t\tint id = ori[i];\n\t\tmp s2 = { 0,1 };\n\t\tfor (int to : G[id]) {\n\t\t\tint j = rev[to];\n\t\t\tif (j < i && !ban[j]) {\n\t\t\t\ts2.first += dp[j].first;\n\t\t\t\ts2.second *= dp[j].second;\n\t\t\t\tban[j] = true;\n\t\t\t}\n\t\t}\n\t\tmp s1 = { 1,1 };\n\t\tmerge(s1, s2);\n\t\tdp[i] = s1;\n\t}\n\tint ans1 = 0;\n\tmodint ans2 = 1;\n\trep(i, n)if (!ban[i]) {\n\t\tans1 += dp[i].first;\n\t\tans2 *= dp[i].second;\n\t}\n\tcout << ans1 << \"\\n\";\n\tcout << ans2 << \"\\n\";\n}\n\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(8);\n\t//init_f();\n\t//init();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":11008,"score_of_the_acc":-0.1776,"final_rank":2},{"submission_id":"aoj_2291_6039505","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 = 1000000009;\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 << 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\nusing mp = pair<int, modint>;\nvoid merge(mp& a, mp b) {\n\tif (a.first < b.first)a = b;\n\telse if (a.first == b.first)a.second += b.second;\n}\nvoid solve() {\n\tint n, m; cin >> n >> m;\n\tvector<set<int>> G(n);\n\trep(i, m) {\n\t\tint a, b; cin >> a >> b; a--; b--;\n\t\tG[a].insert(b);\n\t\tG[b].insert(a);\n\t}\n\tvector<int> trans(n);\n\tvector<bool> ban(n);\n\tfunction<mp(vector<int>)> calc = [&](vector<int> ids)->mp {\n\t\trep(j, ids.size()) {\n\t\t\ttrans[ids[j]] = j;\n\t\t}\n\t\tvector<bool> used(ids.size());\n\t\tpair<int, modint> res = { 0,1 };\n\t\trep(i, ids.size()) {\n\t\t\tif (used[i])continue;\n\t\t\tqueue<int> q; q.push(ids[i]); used[i] = true;\n\t\t\tvector<int> nids;\n\t\t\twhile (!q.empty()) {\n\t\t\t\tint id = q.front(); q.pop();\n\t\t\t\tnids.push_back(id);\n\t\t\t\tfor (int to : G[id])if (!used[trans[to]]) {\n\t\t\t\t\tused[trans[to]] = true;\n\t\t\t\t\tq.push(to);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (nids.size() == 1) {\n\t\t\t\tres.first++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t//cout << nids.size() << \"\\n\";\n\t\t\tvector<int> ones;\n\t\t\trep(j, nids.size())if (G[nids[j]].size() == nids.size() - 1) {\n\t\t\t\tones.push_back(nids[j]);\n\t\t\t\tban[nids[j]] = true;\n\t\t\t}\n\t\t\tassert(ones.size());\n\t\t\tmp s1 = { 1,ones.size() };\n\t\t\tvector<int> nv;\n\t\t\trep(j, nids.size())if (G[nids[j]].size() < nids.size() - 1)nv.push_back(nids[j]);\n\t\t\tfor (int id : ones)for (int to : G[id])if (!ban[to])G[to].erase(id);\n\t\t\tmp s2 = calc(nv);\n\t\t\tmerge(s1, s2);\n\t\t\tres.first += s1.first;\n\t\t\tres.second *= s1.second;\n\t\t}\n\t\treturn res;\n\t};\n\tvector<int> ori(n); rep(i, n)ori[i] = i;\n\tmp p = calc(ori);\n\tint ans1 = p.first;\n\tmodint ans2 = p.second;\n\tcout << ans1 << \"\\n\";\n\tcout << ans2 << \"\\n\";\n}\n\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(8);\n\t//init_f();\n\t//init();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":1660,"memory_kb":29688,"score_of_the_acc":-1.5453,"final_rank":15},{"submission_id":"aoj_2291_5006400","code_snippet":"#include <bits/stdc++.h>\n#define FOR(i, n, m) for(ll i = (n); i < (ll)(m); i++)\n#define REP(i, n) FOR(i, 0, n)\n#define ALL(v) v.begin(), v.end()\n#define pb push_back\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll, ll>;\nconstexpr ll inf = 1000000000;\nconstexpr ll mod = 1000000009;\nconstexpr long double eps = 1e-6;\n \ntemplate<typename T1, typename T2>\nostream& operator<<(ostream& os, pair<T1, T2> p) {\n os << to_string(p.first) << \" \" << to_string(p.second);\n return os;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, vector<T>& v) {\n REP(i, v.size()) {\n if(i) os << \" \";\n os << v[i];\n }\n return os;\n}\n \nstruct modint {\n ll n;\npublic:\n modint(const ll n = 0) : n((n % mod + mod) % mod) {}\n static modint pow(modint a, int m) {\n modint r = 1;\n while(m > 0) {\n if(m & 1) { r *= a; }\n a = (a * a); m /= 2;\n }\n return r;\n }\n modint &operator++() { *this += 1; return *this; }\n modint &operator--() { *this -= 1; return *this; }\n modint operator++(int) { modint ret = *this; *this += 1; return ret; }\n modint operator--(int) { modint ret = *this; *this -= 1; return ret; }\n modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse\n friend bool operator==(const modint& lhs, const modint& rhs) {\n return lhs.n == rhs.n;\n }\n friend bool operator<(const modint& lhs, const modint& rhs) {\n return lhs.n < rhs.n;\n }\n friend bool operator>(const modint& lhs, const modint& rhs) {\n return lhs.n > rhs.n;\n }\n friend modint &operator+=(modint& lhs, const modint& rhs) {\n lhs.n += rhs.n;\n if (lhs.n >= mod) lhs.n -= mod;\n return lhs;\n }\n friend modint &operator-=(modint& lhs, const modint& rhs) {\n lhs.n -= rhs.n;\n if (lhs.n < 0) lhs.n += mod;\n return lhs;\n }\n friend modint &operator*=(modint& lhs, const modint& rhs) {\n lhs.n = (lhs.n * rhs.n) % mod;\n return lhs;\n }\n friend modint &operator/=(modint& lhs, const modint& rhs) {\n lhs.n = (lhs.n * (~rhs).n) % mod;\n return lhs;\n }\n friend modint operator+(const modint& lhs, const modint& rhs) {\n return modint(lhs.n + rhs.n);\n }\n friend modint operator-(const modint& lhs, const modint& rhs) {\n return modint(lhs.n - rhs.n);\n }\n friend modint operator*(const modint& lhs, const modint& rhs) {\n return modint(lhs.n * rhs.n);\n }\n friend modint operator/(const modint& lhs, const modint& rhs) {\n return modint(lhs.n * (~rhs).n);\n }\n};\nistream& operator>>(istream& is, modint m) { is >> m.n; return is; }\nostream& operator<<(ostream& os, modint m) { os << m.n; return os; }\n \n#define MAX_N 1010101\nlong long extgcd(long long a, long long b, long long& x, long long& y) {\n long long d = a;\n if (b != 0) {\n d = extgcd(b, a % b, y, x);\n y -= (a / b) * x;\n } else {\n x = 1; y = 0;\n }\n return d;\n}\nlong long mod_inverse(long long a, long long m) {\n long long x, y;\n if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;\n else return -1;\n}\nvector<long long> fact(MAX_N+1, inf);\nlong long mod_fact(long long n, long long& e) {\n if(fact[0] == inf) {\n fact[0]=1;\n if(MAX_N != 0) fact[1]=1;\n for(ll i = 2; i <= MAX_N; ++i) {\n fact[i] = (fact[i-1] * i) % mod;\n }\n }\n e = 0;\n if(n == 0) return 1;\n long long res = mod_fact(n / mod, e);\n e += n / mod;\n if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;\n return (res * fact[n % mod]) % mod;\n}\n// return nCk\nlong long mod_comb(long long n, long long k) {\n if(n < 0 || k < 0 || n < k) return 0;\n long long e1, e2, e3;\n long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);\n if(e1 > e2 + e3) return 0;\n return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;\n}\n \nusing mi = modint;\n \nmi mod_pow(mi a, ll n) {\n mi ret = 1;\n mi tmp = a;\n while(n > 0) {\n if(n % 2) ret *= tmp;\n tmp = tmp * tmp;\n n /= 2;\n }\n return ret;\n}\n \nll gcd(ll a, ll b) {\n if (b == 0) return a;\n return gcd(b, a % b);\n}\n\nll ans1 = 0;\nmi ans2 = 1;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, m;\n cin >> n >> m;\n vector<set<int>> g(n);\n REP(i, m) {\n int x, y;\n cin >> x >> y;\n x--; y--;\n g[x].insert(y);\n g[y].insert(x);\n }\n vector<int> deg(n, 0);\n REP(i, n) deg[i] = (int)g[i].size();\n vector<pair<int, int>> v(n);\n REP(i, n) v[i] = make_pair(deg[i], i);\n sort(ALL(v)); reverse(ALL(v));\n vector<bool> used(n, false);\n for(auto elm: v) {\n if(used[elm.second]) continue;\n bool k = true;\n for(auto adj: g[elm.second]) {\n if(deg[adj] != deg[elm.second]) k = false;\n }\n if(k) {\n ans1++;\n ans2 *= deg[elm.second] + 1;\n used[elm.second] = true;\n for(auto adj: g[elm.second]) used[adj] = true;\n } else {\n for(auto adj: g[elm.second]) {\n deg[adj]--;\n g[adj].erase(elm.second);\n }\n }\n }\n cout << ans1 << endl;\n cout << ans2 << endl;\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":35608,"score_of_the_acc":-0.8977,"final_rank":11},{"submission_id":"aoj_2291_4556216","code_snippet":"#include <bits/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000009\n#define EPS 1e-10\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)\n#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)\n#define each(a,b) for(const auto& (a): (b))\n#define all(v) (v).begin(),(v).end()\n#define len(v) (int)(v).size()\n#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())\n#define cmx(x,y) x=max(x,y)\n#define cmn(x,y) x=min(x,y)\n#define fi first\n#define se second\n#define pb push_back\n#define show(x) cout<<#x<<\" = \"<<(x)<<endl\n#define sar(a,n) {cout<<#a<<\":\";rep(pachico,n)cout<<\" \"<<a[pachico];cout<<endl;}\n\nusing namespace std;\n\ntemplate<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<\"{\"<<p.fi<<\",\"<<p.se<<\"}\";}\ntemplate<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<\" \";return o;}\ntemplate<typename S,typename T,typename U>\nauto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<\" \",q.pop();return o;}\ntemplate<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<\" \";return o;}\ntemplate<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<\" \";return o;}\nvoid ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<\" \";ashow(a...);}\ntemplate<typename S,typename T,typename U>\nstruct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}\nbool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};\ntemplate<typename S,typename T,typename U>\nauto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<\"{\"<<t.fi<<\",\"<<t.se<<\",\"<<t.th<<\"}\";}\n\ntypedef pair<int, int> P;\ntypedef pair<ll,ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<double> vd;\ntypedef vector<P> vp;\ntypedef vector<string> vs;\n\nconst int MAX_N = 100005;\n\nint visit[MAX_N];\n\nvoid dfs(int u, int& deg, int& ver, int& cnt, vector<int>& vers, const int id, const vector<unordered_set<int> >& G){\n if(deg < (int)G[u].size()){\n deg = (int)G[u].size(), ver = u, cnt = 1;\n }else if(deg == (int)G[u].size()){\n ++cnt;\n }\n visit[u] = id, vers.push_back(u);\n for(const int v : G[u]){\n if(visit[v] != id) dfs(v, deg, ver, cnt, vers, id, G);\n }\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, m;\n cin >> n >> m;\n vector<unordered_set<int> > G(n);\n unordered_set<int> st;\n rep(i,n) st.insert(i);\n int x, y;\n rep(i,m){\n cin >> x >> y;\n --x, --y;\n G[x].insert(y), G[y].insert(x);\n }\n int id = 1, hoge = 0, ans = 1;\n while(!st.empty()){\n const int v = *st.begin();\n // show(v);\n vector<int> vers;\n int deg = -1, ver = -1, cnt = 0;\n dfs(v, deg, ver, cnt, vers, id++, G);\n // show(vers), show(cnt);\n if(cnt == (int)vers.size()){\n ++hoge;\n ans = (ll)ans * cnt % MOD;\n if(vers.size() == st.size()) break;\n for(const int u : vers) st.erase(u);\n }else{\n for(const int u : G[ver]) G[u].erase(ver);\n st.erase(ver);\n }\n }\n cout << hoge << \"\\n\";\n cout << ans << \"\\n\";\n return 0;\n}","accuracy":1,"time_ms":1830,"memory_kb":30132,"score_of_the_acc":-1.6503,"final_rank":16},{"submission_id":"aoj_2291_3842896","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 MOD 1000000009\n#define SIZE 100005\n\nstruct Edge{\n\tvoid set(int arg_from,int arg_to){\n\t\tfrom = arg_from;\n\t\tto = arg_to;\n\t}\n\tint from,to;\n};\n\nint N,M;\nll degree[SIZE],size[SIZE];\nbool DELETE[SIZE];\nEdge edge[200005];\n\nint main(){\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdegree[i] = 0;\n\t\tsize[i] = 1;\n\t\tDELETE[i] = false;\n\t}\n\n\tint from,to;\n\n\tfor(int loop = 0; loop < M; loop++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\n\t\tedge[loop].set(from,to);\n\n\t\tdegree[from]++;\n\t\tdegree[to]++;\n\t}\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tfrom = edge[i].from;\n\t\tto = edge[i].to;\n\n\t\tif((degree[from] < degree[to]) || (degree[from] == degree[to] && from < to)){\n\n\t\t\tDELETE[to] = true;\n\t\t}else{\n\n\t\t\tDELETE[from] = true;\n\t\t}\n\n\t\tif(degree[from] == degree[to]){\n\n\t\t\tsize[from]++;\n\t\t\tsize[to]++;\n\t\t}\n\t}\n\n\tll ans_sum = 0,ans_num = 1;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(DELETE[i])continue;\n\n\t\tans_sum++;\n\t\tans_num *= size[i];\n\t\tans_num %= MOD;\n\t}\n\n\tprintf(\"%lld\\n\",ans_sum);\n\tprintf(\"%lld\\n\",ans_num);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":6440,"score_of_the_acc":-0.0578,"final_rank":1},{"submission_id":"aoj_2291_3137224","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nclass UnionFind {\nprivate:\n\tvector< int > data;\n\t\npublic:\n\tUnionFind(int n) : data(n, -1) {}\n\t\n\tvoid unionSet(int x, int y) {\n\t\tx = root(x); y = root(y);\n\t\tif (data[y] < data[x]) swap(x, y);\n\t\tif (x != y) { data[x] += data[y]; data[y] = x; }\n\t}\n\t\n\tbool sameSet(int x, int y) { return root(x) == root(y); }\n\tint root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\n\tint size(int x) { return -data[root(x)]; }\n};\n\nint N, M;\nvector< vector< int > > aList;\n\nvector< int > getDegOrder() {\n\tvector< int > deg(N, 0);\n\tfor (int v=0; v<N; ++v) deg[v] = (int)aList[v].size();\n\t\n\tusing pii = pair< int, int >;\n\tset< pii > que;\n\tfor (int v=0; v<N; ++v) que.insert(pii(-deg[v], v));\n\t\n\tvector< int > ret;\n\twhile (!que.empty()) {\n\t\tint v = que.begin()->second; que.erase(que.begin());\t\n\t\tif (deg[v] < 0) continue;\n\t\tret.push_back(v); deg[v] = -1;\n\t\tfor (int u : aList[v]) {\n\t\t\tif (deg[u] < 0) continue;\n\t\t\tque.erase(pii(-deg[u], u));\t--deg[u];\n\t\t\tque.insert(pii(-deg[u], u));\n\t\t}\n\t}\n\treturn ret;\n}\n\nvector< int > constructCliques(const vector< int >& vertex_order) {\n\tvector< int > mark(N, 0);\n\t\n\tUnionFind uf(N);\n\tfor (int v : vertex_order) {\n\t\tmark[v] = 1;\n\t\tint g = -1;\n\t\tfor (int u : aList[v]) {\n\t\t\tif (mark[u] == 0) continue;\n\t\t\tint r = uf.root(u);\n\t\t\tif (g != r) g = (g == -1 ? r : -2);\n\t\t}\n\t\tif (g >= 0) uf.unionSet(g, v);\n\t\tif (g == -2) mark[v] = -1;\n\t}\n\t\n\tvector< int > ret;\n\tfor (int v=0; v<N; ++v) {\n\t\tif (mark[uf.root(v)] == -1) continue;\n\t\tmark[uf.root(v)] = -1;\n\t\tret.push_back(uf.size(v));\n\t}\n\treturn ret;\n}\n\nint main() {\n\tcin >> N >> M;\n\taList.assign(N, vector< int >());\n\tfor (int i=0; i<M; ++i) {\n\t\tint u, v; cin >> u >> v; --u; --v;\n\t\taList[u].push_back(v);\n\t\taList[v].push_back(u);\n\t}\n\t\n\tvector< int > deg_order = getDegOrder();\n\treverse(deg_order.begin(), deg_order.end());\n\tvector< int > cliqueSize = constructCliques(deg_order);\n\t\n\tusing lint = long long int;\n\tlint ans = 1, MOD = (lint)1e9 + 9;\n\tfor (int x : cliqueSize) ans = (ans * x) % MOD;\n\tcout << cliqueSize.size() << endl << ans << endl;\n}","accuracy":1,"time_ms":140,"memory_kb":14084,"score_of_the_acc":-0.3153,"final_rank":5},{"submission_id":"aoj_2291_2362969","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n#define int ll\n#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)\n#define REP(i,b) FOR(i,0,b)\nint read(){\n\tint i;\n\tscanf(\"%lld\",&i);\n\treturn i;\n}\nusing vi=vector<int>;\n#define PB push_back\n#define ALL(x) x.begin(),x.end()\nusing pi=pair<int,int>;\n\nstruct UnionFind{\n\tvi rank,par;\n\tvoid Init(int n){\n\t\trank.assign(n,0);\n\t\tpar.assign(n,-1);\n\t}\n\tint Find(int a){\n\t\treturn par[a]==-1?a:(par[a]=Find(par[a]));\n\t}\n\tbool Same(int a,int b){\n\t\treturn Find(a)==Find(b);\n\t}\n\tvoid Unite(int a,int b){\n\t\ta=Find(a),b=Find(b);\n\t\tif(a==b)return;\n\t\tif(rank[a]<rank[b])swap(a,b);\n\t\tpar[b]=a;\n\t\tif(rank[a]==rank[b])rank[a]++;\n\t}\n};\n\nconst int mod=1000000009;\n\npi Merge(pi a,pi b){\n\treturn pi(a.first+b.first,a.second*b.second%mod);\n}\n\nsigned main(){\n\tint n=read(),m=read();\n\tvector<vi> g(n);\n\tvi deg(n,0);\n\tREP(_,m){\n\t\tint a=read()-1,b=read()-1;\n\t\tg[a].PB(b);\n\t\tg[b].PB(a);\n\t\tdeg[a]++;\n\t\tdeg[b]++;\n\t}\n\tpriority_queue<pi> pq;\n\tREP(i,n)pq.push(pi(deg[i],i));\n\tvi used(n,0),ord;\n\twhile(!pq.empty()){\n\t\tint v=pq.top().first,i=pq.top().second;\n\t\tpq.pop();\n\t\tif(deg[i]!=v)continue;\n\t\tord.PB(i);\n\t\tfor(auto j:g[i])if(!used[j])\n\t\t\tpq.push(pi(--deg[j],j));\n\t\tused[i]=1;\n\t}\n\treverse(ALL(ord));\n\tvector<pi> ans(n);\n\tUnionFind uf;uf.Init(n);\n\tused.assign(n,0);\n\tfor(auto i:ord){\n\t\tpi w(0,1);\n\t\tfor(auto j:g[i])if(used[j])\n\t\t\tif(!uf.Same(i,j)){\n\t\t\t\tw=Merge(w,ans[uf.Find(j)]);\n\t\t\t\tuf.Unite(i,j);\n\t\t\t}\n\t\tif(w.first==0)\n\t\t\tw.first=1;\n\t\telse if(w.first==1)\n\t\t\tw.second=(w.second+1)%mod;\n\t\tans[uf.Find(i)]=w;\n\t\tused[i]=1;\n\t}\n\tpi w=ans[uf.Find(0)];\n\tREP(i,n)if(!uf.Same(0,i)){\n\t\tw=Merge(w,ans[uf.Find(i)]);\n\t\tuf.Unite(0,i);\n\t}\n\tcout<<w.first<<endl<<w.second<<endl;\n}","accuracy":1,"time_ms":80,"memory_kb":19440,"score_of_the_acc":-0.4161,"final_rank":6},{"submission_id":"aoj_2291_2039842","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define all(v) (v).begin(),(v).end()\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\nconst int mod=1000000009;\ntypedef pair<vint,vpint>graph;\npint op(const pint &a,const pint &b){\n return {a.fi+b.fi,a.se*b.se%mod};\n}\n\nvint G[100000];\nint deg[100000];\nint mark[100000];\nint sizev[100000];\nint sizee[200000];\npint ans;\nint que[100000],tail;\n\nint vs_[100000];pint es_[200000];\n\nvoid solve2(int N,int *vs,int M,pint *es);\n\nvoid solve(int N,int *vs,int M,pint *es){\n rep(i,N)deg[vs[i]]=0,mark[vs[i]]=-1;\n\n for(int i=0;i<M;i++){\n G[es[i].fi][deg[es[i].fi]++]=es[i].se;\n G[es[i].se][deg[es[i].se]++]=es[i].fi;\n }\n\n vector<int>sizev,sizee;\n\n int cnt=0;\n for(int i=0;i<N;i++){\n if(mark[vs[i]]!=-1)continue;\n sizev.pb(0);sizee.pb(0);\n int c=cnt++;\n sizev[c]++;\n mark[vs[i]]=c;\n tail=1;\n que[0]=vs[i];\n for(int j=0;j<tail;j++){\n int v=que[j];\n for(int k=0;k<deg[v];k++){\n int u=G[v][k];\n if(mark[u]!=-1)continue;\n mark[u]=c;\n sizev[c]++;\n que[tail++]=u;\n }\n }\n }\n\n for(int i=0;i<M;i++)sizee[mark[es[i].fi]]++;\n rep(i,N)vs_[i]=vs[i];\n rep(i,M)es_[i]=es[i];\n\n int c=0;\n for(int i=0;i<cnt;i++){\n int nc=sizev[i]+c;\n sizev[i]=c;\n c=nc;\n }\n\n c=0;\n for(int i=0;i<cnt;i++){\n int nc=sizee[i]+c;\n sizee[i]=c;\n c=nc;\n }\n\n rep(i,N){\n int tmp=sizev[mark[vs_[i]]]++;\n vs[tmp]=vs_[i];\n }\n\n rep(i,M){\n int tmp=sizee[mark[es_[i].fi]]++;\n es[tmp]=es_[i];\n }\n\n rep(i,cnt){\n int t=i?sizev[i-1]:0;\n int s=i?sizee[i-1]:0;\n solve2(sizev[i]-t,vs+t,sizee[i]-s,es+s);\n }\n}\n\nvoid solve2(int N,int *vs,int M,pint *es){\n if(N*(N-1)/2==M){\n ans=op(ans,{1,N});\n return;\n }\n\n rep(i,N)deg[vs[i]]=0;\n\n for(int i=0;i<M;i++)deg[es[i].fi]++,deg[es[i].se]++;\n int cent=-1;\n rep(i,N){\n if(deg[vs[i]]==N-1)cent=vs[i];\n deg[vs[i]]=0;\n }\n assert(cent!=-1);\n\n int t=0;\n rep(i,N){\n if(vs[i]==cent)continue;\n vs[t++]=vs[i];\n }\n\n int s=0;\n rep(i,M){\n if(es[i].fi==cent||es[i].se==cent)continue;\n es[s++]=es[i];\n }\n solve(t,vs,s,es);\n}\n\nsigned main(){\n int N,M;\n scanf(\"%lld%lld\",&N,&M);\n\n\n static int vs[100000];\n static pint es[200000];\n rep(i,N)vs[i]=i;\n rep(i,M){\n int a,b;\n scanf(\"%lld%lld\",&a,&b);\n a--;b--;\n es[i]={a,b};\n G[a].pb(b);G[b].pb(a);\n }\n\n memset(mark,-1,sizeof(mark));\n ans={0,1};\n solve(N,vs,M,es);\n printf(\"%lld\\n%lld\\n\",ans.fi,ans.se);\n return 0;\n}","accuracy":1,"time_ms":490,"memory_kb":21960,"score_of_the_acc":-0.7056,"final_rank":9},{"submission_id":"aoj_2291_2039805","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define all(v) (v).begin(),(v).end()\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\nconst int mod=1000000009;\n\npint op(const pint &a,const pint &b){\n return {a.fi+b.fi,a.se*b.se%mod};\n}\n\nvint G[100000];\nint deg[100000];\nint mark[100000];\nint sizev[100000];\nint sizee[200000];\npint ans;\nint que[100000],tail;\n\nint vs_[100000];pint es_[200000];\n\nvoid solve2(int N,int *vs,int M,pint *es);\n\nvoid solve(int N,int *vs,int M,pint *es){\n rep(i,N)deg[vs[i]]=0,mark[vs[i]]=-1;\n\n for(int i=0;i<M;i++){\n G[es[i].fi][deg[es[i].fi]++]=es[i].se;\n G[es[i].se][deg[es[i].se]++]=es[i].fi;\n }\n\n int cnt=0;\n for(int i=0;i<N;i++){\n if(mark[vs[i]]!=-1)continue;\n sizev[cnt]=sizee[cnt]=0;\n int c=cnt++;\n sizev[c]++;\n mark[vs[i]]=c;\n tail=1;\n que[0]=vs[i];\n for(int j=0;j<tail;j++){\n int v=que[j];\n for(int k=0;k<deg[v];k++){\n int u=G[v][k];\n if(mark[u]!=-1)continue;\n mark[u]=c;\n sizev[c]++;\n que[tail++]=u;\n }\n }\n }\n\n for(int i=0;i<M;i++)sizee[mark[es[i].fi]]++;\n rep(i,N)vs_[i]=vs[i];\n rep(i,M)es_[i]=es[i];\n\n int c=0;\n for(int i=0;i<cnt;i++){\n int nc=sizev[i]+c;\n sizev[i]=c;\n c=nc;\n }\n\n c=0;\n for(int i=0;i<cnt;i++){\n int nc=sizee[i]+c;\n sizee[i]=c;\n c=nc;\n }\n\n rep(i,N){\n int tmp=sizev[mark[vs_[i]]]++;\n vs[tmp]=vs_[i];\n }\n\n rep(i,M){\n int tmp=sizee[mark[es_[i].fi]]++;\n es[tmp]=es_[i];\n }\n\n rep(i,cnt){\n int t=i?sizev[i-1]:0;\n int s=i?sizee[i-1]:0;\n solve2(sizev[i]-t,vs+t,sizee[i]-s,es+s);\n }\n}\n\nvoid solve2(int N,int *vs,int M,pint *es){\n if(N*(N-1)/2==M){\n ans=op(ans,{1,N});\n return;\n }\n\n rep(i,N)deg[vs[i]]=0;\n\n for(int i=0;i<M;i++)deg[es[i].fi]++,deg[es[i].se]++;\n int cent=-1;\n rep(i,N){\n if(deg[vs[i]]==N-1)cent=vs[i];\n }\n\n int t=0;\n rep(i,N){\n if(vs[i]==cent)continue;\n vs[t++]=vs[i];\n }\n\n int s=0;\n rep(i,M){\n if(es[i].fi==cent||es[i].se==cent)continue;\n es[s++]=es[i];\n }\n solve(t,vs,s,es);\n}\n\nsigned main(){\n int N,M;\n scanf(\"%lld%lld\",&N,&M);\n\n\n static int vs[100000];\n static pint es[200000];\n rep(i,N)vs[i]=i;\n rep(i,M){\n int a,b;\n scanf(\"%lld%lld\",&a,&b);\n a--;b--;\n es[i]={a,b};\n G[a].pb(b);G[b].pb(a);\n }\n ans={0,1};\n solve(N,vs,M,es);\n printf(\"%lld\\n%lld\\n\",ans.fi,ans.se);\n return 0;\n}","accuracy":0.175,"time_ms":260,"memory_kb":23380,"score_of_the_acc":-0.614,"final_rank":20},{"submission_id":"aoj_2291_1474416","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\ntypedef long long ll;\nll _MOD = 1000000009;\n\nstruct union_find {\n\tvector<int> v;\n\tunion_find(int n) : v(n, -1) {}\n\tint find(int x) { return (v[x] < 0) ? x : (v[x] = find(v[x])); }\n\tvoid unite(int x, int y) {\n\t\tx = find(x); y = find(y);\n\t\tif (x != y) {\n\t\t\tif (-v[x] < -v[y]) swap(x, y);\n\t\t\tv[x] += v[y]; v[y] = x;\n\t\t}\n\t}\n\tbool same(int x, int y) { return find(x) == find(y); }\n\tint size(int x) { return -v[find(x)]; }\n};\n\nint main() {\n\tint n, m; cin >> n >> m;\n\tvector<int> a(m), b(m);\n\tfor (int i = 0; i < m; i++) {\n\t\tscanf(\"%d%d\", &a[i], &b[i]);\n\t\ta[i]--;\n\t\tb[i]--;\n\t}\n\tvector<bool> rm(n);\n\tfor (;;) {\n\t\tvector<int> d(n);\n\t\tunion_find uf(n);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\td[a[i]]++;\n\t\t\td[b[i]]++;\n\t\t\tuf.unite(a[i], b[i]);\n\t\t}\n\t\tvector<vector<int> > v(n);\n\t\tfor (int u = 0; u < n; u++) {\n\t\t\tif (rm[u]) continue;\n\t\t\tint p = uf.find(u);\n\t\t\tif (d[u] == uf.size(p) - 1)\n\t\t\t\tv[p].push_back(u);\n\t\t}\n\t\tbool updated = false;\n\t\tfor (int p = 0; p < n; p++) {\n\t\t\tif (rm[p]) continue;\n\t\t\tif (uf.find(p) != p) continue;\n\t\t\tif (v[p].size() == uf.size(p)) continue;\n\t\t\tupdated = true;\n\t\t\tfor (int j = 0; j < v[p].size(); j++)\n\t\t\t\trm[v[p][j]] = true;\n\t\t}\n\t\tif (!updated) {\n\t\t\tint x = 0, y = 1;\n\t\t\tfor (int p = 0; p < n; p++) {\n\t\t\t\tif (rm[p]) continue;\n\t\t\t\tif (uf.find(p) != p) continue;\n\t\t\t\tx++;\n\t\t\t\ty = (ll)y * uf.size(p) % _MOD;\n\t\t\t}\n\t\t\tcout << x << endl << y << endl;\n\t\t\treturn 0;\n\t\t}\n\t\tvector<int> _a, _b;\n\t\tfor (int i = 0; i < m; i++)\n\t\t\tif (!rm[a[i]] && !rm[b[i]]) {\n\t\t\t\t_a.push_back(a[i]);\n\t\t\t\t_b.push_back(b[i]);\n\t\t\t}\n\t\tm = _a.size();\n\t\ta = _a;\n\t\tb = _b;\n\t}\n}","accuracy":1,"time_ms":1580,"memory_kb":11892,"score_of_the_acc":-1.056,"final_rank":12},{"submission_id":"aoj_2291_1474414","code_snippet":"#define _USE_MATH_DEFINES\n#include <algorithm>\n#include <cstdio>\n#include <fstream>\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, w; };\n\nll MOD = 1000000007;\nll _MOD = 1000000009;\ndouble EPS = 1e-10;\n\nstruct union_find {\n\tvector<int> v;\n\tunion_find(int n) : v(n, -1) {}\n\tint find(int x) { return (v[x] < 0) ? x : (v[x] = find(v[x])); }\n\tvoid unite(int x, int y) {\n\t\tx = find(x); y = find(y);\n\t\tif (x != y) {\n\t\t\tif (-v[x] < -v[y]) swap(x, y);\n\t\t\tv[x] += v[y]; v[y] = x;\n\t\t}\n\t}\n\tbool same(int x, int y) { return find(x) == find(y); }\n\tint size(int x) { return -v[find(x)]; }\n};\n\nint main() {\n\tint n, m; cin >> n >> m;\n\tvector<int> a(m), b(m);\n\tfor (int i = 0; i < m; i++) {\n\t\tscanf(\"%d%d\", &a[i], &b[i]);\n\t\ta[i]--;\n\t\tb[i]--;\n\t}\n\tvector<bool> rm(n);\n\tfor (;;) {\n\t\tvector<int> d(n);\n\t\tunion_find uf(n);\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\td[a[i]]++;\n\t\t\td[b[i]]++;\n\t\t\tuf.unite(a[i], b[i]);\n\t\t}\n\t\tvector<vector<int> > v(n);\n\t\tfor (int u = 0; u < n; u++) {\n\t\t\tif (rm[u]) continue;\n\t\t\tint p = uf.find(u);\n\t\t\tif (d[u] == uf.size(p) - 1)\n\t\t\t\tv[p].push_back(u);\n\t\t}\n\t\tbool updated = false;\n\t\tfor (int p = 0; p < n; p++) {\n\t\t\tif (rm[p]) continue;\n\t\t\tif (uf.find(p) != p) continue;\n\t\t\tif (v[p].size() == uf.size(p)) continue;\n\t\t\tupdated = true;\n\t\t\tfor (int j = 0; j < v[p].size(); j++)\n\t\t\t\trm[v[p][j]] = true;\n\t\t}\n\t\tif (!updated) {\n\t\t\tint x = 0, y = 1;\n\t\t\tfor (int p = 0; p < n; p++) {\n\t\t\t\tif (rm[p]) continue;\n\t\t\t\tif (uf.find(p) != p) continue;\n\t\t\t\tx++;\n\t\t\t\ty = (ll)y * uf.size(p) % _MOD;\n\t\t\t}\n\t\t\tcout << x << endl << y << endl;\n\t\t\treturn 0;\n\t\t}\n\t\tvector<int> _a, _b;\n\t\tfor (int i = 0; i < m; i++)\n\t\t\tif (!rm[a[i]] && !rm[b[i]]) {\n\t\t\t\t_a.push_back(a[i]);\n\t\t\t\t_b.push_back(b[i]);\n\t\t\t}\n\t\tm = _a.size();\n\t\ta = _a;\n\t\tb = _b;\n\t}\n}","accuracy":1,"time_ms":1590,"memory_kb":11892,"score_of_the_acc":-1.0616,"final_rank":13},{"submission_id":"aoj_2291_1474357","code_snippet":"#define _USE_MATH_DEFINES\n#include <algorithm>\n#include <cstdio>\n#include <fstream>\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, w; };\n\nll MOD = 1000000007;\nll _MOD = 1000000009;\ndouble EPS = 1e-10;\n\nstruct union_find {\n\tvector<int> v;\n\tunion_find(int n) : v(n, -1) {}\n\tint find(int x) { return (v[x] < 0) ? x : (v[x] = find(v[x])); }\n\tvoid unite(int x, int y) {\n\t\tx = find(x); y = find(y);\n\t\tif (x != y) {\n\t\t\tif (-v[x] < -v[y]) swap(x, y);\n\t\t\tv[x] += v[y]; v[y] = x;\n\t\t}\n\t}\n\tbool same(int x, int y) { return find(x) == find(y); }\n\tint size(int x) { return -v[find(x)]; }\n};\n\ni_i g(vector<int> a, vector<int> b);\n\ni_i f(int n, vector<int> a, vector<int> b) {\n\tint m = a.size();\n\tunion_find uf(n);\n\tfor (int i = 0; i < m; i++)\n\t\tuf.unite(a[i], b[i]);\n\tvector<vector<int> > as(n), bs(n);\n\tfor (int i = 0; i < m; i++) {\n\t\tint u = uf.find(a[i]);\n\t\tas[u].push_back(a[i]);\n\t\tbs[u].push_back(b[i]);\n\t}\n\ti_i ans(0, 1);\n\tfor (int u = 0; u < n; u++) {\n\t\tif (uf.find(u) != u) continue;\n\t\ti_i p = g(as[u], bs[u]);\n\t\tans.first += p.first;\n\t\tans.second = (ll)ans.second * p.second % MOD;\n\t}\n\treturn ans;\n}\n\ni_i g(vector<int> a, vector<int> b) {\n\tint m = a.size();\n\tvector<int> v;\n\tfor (int i = 0; i < m; i++) {\n\t\tv.push_back(a[i]);\n\t\tv.push_back(b[i]);\n\t}\n\tsort(v.begin(), v.end());\n\tv.erase(unique(v.begin(), v.end()), v.end());\n\tint n = v.size();\n\tif (!n) n = 1;\n\tfor (int i = 0; i < m; i++) {\n\t\ta[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin();\n\t\tb[i] = lower_bound(v.begin(), v.end(), b[i]) - v.begin();\n\t}\n\tif (m == (ll)n * (n - 1) / 2)\n\t\treturn i_i(1, n);\n\tvector<int> d(n);\n\tfor (int i = 0; i < m; i++) {\n\t\td[a[i]]++;\n\t\td[b[i]]++;\n\t}\n\tint _u;\n\tfor (int u = 0; u < n; u++)\n\t\tif (d[u] == n - 1)\n\t\t\t_u = u;\n\tvector<int> _a, _b;\n\tfor (int i = 0; i < m; i++)\n\t\tif (a[i] != _u && b[i] != _u) {\n\t\t\t_a.push_back(a[i] < _u ? a[i] : a[i] - 1);\n\t\t\t_b.push_back(b[i] < _u ? b[i] : b[i] - 1);\n\t\t}\n\treturn f(n - 1, _a, _b);\n}\n\nint main() {\n\tint n, m; cin >> n >> m;\n\tvector<int> a(m), b(m);\n\tfor (int i = 0; i < m; i++) {\n\t\tscanf(\"%d%d\", &a[i], &b[i]);\n\t\ta[i]--;\n\t\tb[i]--;\n\t}\n\ti_i p = f(n, a, b);\n\tcout << p.first << endl;\n\tcout << p.second << endl;\n}","accuracy":0.175,"time_ms":80,"memory_kb":21792,"score_of_the_acc":-0.4749,"final_rank":19},{"submission_id":"aoj_2291_1445952","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 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 = 1000000009;\n\n\nint T, n, m;\n\nint main(int argc, char *argv[]){\n\tios::sync_with_stdio(false);\n\tcin >> n >> m;\n\tvector<set<int>> g(n);\n\tvi deg(n);\n\tREP(i, m){\n\t\tint u, v;\n\t\tcin >> u >> v; u--; v--;\n\t\tg[u].insert(v); g[v].insert(u);\n\t}\n\tset<pii> s;\n\tREP(i, n) s.insert(pii(g[i].size(), i));\n\tint c = 0;\n\tll ans = 1;\n\twhile(!s.empty()){\n\t\tint u = s.rbegin()->second;\n\t\tint deg = g[u].size();\n\t\ts.erase(pii(deg, u));\n\t\tif([&](){\n\t\t\tfor(int v : g[u]) if(g[v].size() != deg) return 0;\n\t\t\treturn 1;\n\t\t}()){\n\t\t\tans = ans * (deg + 1) % MOD;\n\t\t\tfor(int v : g[u]) s.erase(pii(deg, v));\n\t\t\tc ++;\n\t\t}else{\n\t\t\tfor(int v : g[u]){\n\t\t\t\ts.erase(pii(g[v].size(), v));\n\t\t\t\tg[v].erase(u);\n\t\t\t\ts.insert(pii(g[v].size(), v));\n\t\t\t}\n\t\t}\n\t}\n\tcout << c << endl;\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":320,"memory_kb":29704,"score_of_the_acc":-0.8053,"final_rank":10},{"submission_id":"aoj_2291_1445951","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 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\n\nint T, n, m;\n\nint main(int argc, char *argv[]){\n\tios::sync_with_stdio(false);\n\tcin >> n >> m;\n\tvector<set<int>> g(n);\n\tvi deg(n);\n\tREP(i, m){\n\t\tint u, v;\n\t\tcin >> u >> v; u--; v--;\n\t\tg[u].insert(v); g[v].insert(u);\n\t}\n\tset<pii> s;\n\tREP(i, n) s.insert(pii(g[i].size(), i));\n\tint c = 0;\n\tll ans = 1;\n\twhile(!s.empty()){\n\t\tint u = s.rbegin()->second;\n\t\tint deg = g[u].size();\n\t\ts.erase(pii(deg, u));\n\t\tif([&](){\n\t\t\tfor(int v : g[u]) if(g[v].size() != deg) return 0;\n\t\t\treturn 1;\n\t\t}()){\n\t\t\tans = ans * (deg + 1) % MOD;\n\t\t\tfor(int v : g[u]) s.erase(pii(deg, v));\n\t\t\tc ++;\n\t\t}else{\n\t\t\tfor(int v : g[u]){\n\t\t\t\ts.erase(pii(g[v].size(), v));\n\t\t\t\tg[v].erase(u);\n\t\t\t\ts.insert(pii(g[v].size(), v));\n\t\t\t}\n\t\t}\n\t}\n\tcout << c << endl;\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.175,"time_ms":20,"memory_kb":4128,"score_of_the_acc":0,"final_rank":17},{"submission_id":"aoj_2291_1185232","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <set>\n#include <map>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <cstring>\n#include <functional>\n#include <cmath>\n#include <complex>\n#include <cassert>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define rep1(i,n) for(int i=1;i<=(n);++i)\n#define all(c) (c).begin(),(c).end()\n#define fs first\n#define sc second\n#define pb push_back\n#define show(x) cout << #x << \" \" << x << endl\ntypedef long long ll;\ntypedef pair<int,int> P;\nll mod=1e9+9;\nint N,M,deg[100001];\nint ans=0;\nll num=1;\nvector<int> G[100001];\t//id,to\nbool done[100001]={};\nbool comp(const int& x,const int& y){return deg[x]>deg[y];}\nvoid add_edge(int x,int y){\n\tG[x].pb(y);\n\tG[y].pb(x);\n\tdeg[x]++,deg[y]++;\n}\nint main(){\n\tcin>>N>>M;\n\tif((ll)N*(N-1)/2==M){\n\t\tcout<<1<<endl<<N<<endl;\n\t\treturn 0;\n\t}\n\trep(i,M){\n\t\tint x,y;\n\t\tcin>>x>>y;\n\t\tadd_edge(x,y);\n\t}\n\trep1(i,N) add_edge(0,i);\n\tvector<int> vc;\n\trep(i,N+1) vc.pb(i);\n\tsort(all(vc),comp);\n\tfor(int a:vc){\n\t\tif(done[a]) continue;\n\t\tdone[a]=true;\n\t\tbool cl=true;\n\t\tfor(int v:G[a]){\n\t\t\tif(done[v]) continue;\n\t\t\tif(deg[v]!=deg[a]) cl=false;\n\t\t\tdeg[v]--;\n\t\t}\n\t\tif(cl){\n\t\t\tint cnt=1;\n\t\t\tdone[a]=true;\n\t\t\tfor(int v:G[a]){\n\t\t\t\tif(done[v]) continue;\n\t\t\t\tdone[v]=true;\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t\tans++;\n\t\t\tnum=num*cnt%mod;\n\t\t}\n\t}\n\tcout<<ans<<endl<<num<<endl;\n}","accuracy":1,"time_ms":120,"memory_kb":10624,"score_of_the_acc":-0.2177,"final_rank":3},{"submission_id":"aoj_2291_1184330","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <set>\n#include <map>\n#include <queue>\n#include <deque>\n#include <stack>\n#include <algorithm>\n#include <cstring>\n#include <functional>\n#include <cmath>\n#include <complex>\n#include <cassert>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define rep1(i,n) for(int i=1;i<=(n);++i)\n#define all(c) (c).begin(),(c).end()\n#define fs first\n#define sc second\n#define pb push_back\n#define show(x) cout << #x << \" \" << x << endl\nint par[100001];\nvoid init(int n) { rep(i,n) par[i]=i; }\nint find(int x){\n\tif(x==par[x]) return x;\n\treturn par[x]=find(par[x]);\n}\nvoid unite(int x,int y){\n\tx=find(x);\n\ty=find(y);\n\tif(x==y) return;\n\tpar[x]=y;\n}\nbool same(int x,int y) { return find(x)==find(y); }\n\ntypedef long long ll;\nll mod=1e9+7;\nint N,M;\nint ans=0;\nll cnt=1;\nset<int> G[100001];\nvoid dfs(set<int> vc){\n\tll s=vc.size();\n\tint u=-1;\n\tbool cl=true;\n\tfor(int v:vc){\n\t\tif(G[v].size()==s-1&&u==-1) u=v;\n\t\tif(G[v].size()<s-1) cl=false;\n\t}\n\tif(cl){\n\t\tans++;\n\t\tcnt*=s;\n\t\tcnt%=mod;\n\t\treturn;\n\t}\n\tassert(u!=-1);\n\tfor(int v:G[u]) G[v].erase(u);\n\tG[u].clear();\n\tvc.erase(u);\n\tinit(N+1);\n\tfor(int v:vc){\n\t\tfor(int u:G[v]) unite(u,v);\n\t}\n\tmap< int,set<int> > sets;\n\tfor(int v:vc){\n\t\tsets[find(v)].insert(v);\n\t}\n\tfor(auto it:sets){\n\t\tdfs(it.sc);\n\t}\n}\nint main(){\n\tcin>>N>>M;\n\tif((ll)N*(N-1)/2==M){\n\t\tcout<<1<<endl<<N<<endl;\n\t\treturn 0;\n\t}\n\trep(i,M){\n\t\tint x,y;\n\t\tcin>>x>>y;\n\t\tG[x].insert(y);\n\t\tG[y].insert(x);\n\t}\n\trep1(i,N){\n\t\tG[0].insert(i);\n\t\tG[i].insert(0);\n\t}\n\tset<int> be;\n\trep(i,N+1) be.insert(i);\n\tdfs(be);\n\tcout<<ans<<endl<<cnt<<endl;\n}","accuracy":0.175,"time_ms":50,"memory_kb":9648,"score_of_the_acc":-0.1546,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_2291_10866253\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst ll INF = 1ll << 60;\\n#define REP(i, n) for(ll i=0; i <ll(n); i++)\\ntemplate <class T> using V = vector<T>;\\ntemplate <class A, class B>\\nbool chmax(A &a, B b) { return a < b && (a=b, true); }\\ntemplate <class A, class B>\\nbool chmin(A &a, B b) { return b < a && (a=b, true); }\\n\\n\\nvoid testcase(){\\n int N, M; cin >> N >> M;\\n V<V<int>> adj(N);\\n REP(i,M){\\n int u,v; cin >> u >> v; u--; v--;\\n adj[u].push_back(v);\\n adj[v].push_back(u);\\n }\\n V<int> deg(N);\\n REP(i,N) deg[i] = adj[i].size();\\n V<V<int>> que(N);\\n REP(i,N) REP(j,deg[i]+1) que[j].push_back(i);\\n V<int> peo;\\n for(int d=N-1; d>=0; d--) for(int v : que[d]) if(deg[v] == d){\\n deg[v] = -1;\\n peo.push_back(v);\\n for(int w : adj[v]) deg[w]--;\\n }\\n reverse(peo.begin(), peo.end());\\n V<int> hit(N), used(N), ord(N);\\n REP(i,N) ord[peo[i]] = i;\\n for(int v : peo) if(!hit[v]){\\n hit[v] = used[v] = 1;\\n for(int w : adj[v]) hit[w]++;\\n }\\n int val = 0;\\n for(int x : used) val += x;\\n ll cnt = 1;\\n for(int v : peo) if(used[v]){\\n ll t = 1;\\n for(int w : adj[v]) if(ord[v] < ord[w] && hit[w] == 1) t++;\\n cnt = cnt * t % 1000000009;\\n }\\n cout << val << \\\"\\\\n\\\" << cnt << \\\"\\\\n\\\";\\n}\\n\\nint main() {\\n cin.tie(nullptr)->sync_with_stdio(false);\\n testcase();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 15540,\n \"score_of_the_acc\": -0.2854,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2291_10207074\",\n \"code_snippet\": \"// AOJ #2291\\n// Brilliant Stars 2025.2.9\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n#define gc() getchar_unlocked()\\n#define pc(c) putchar_unlocked(c)\\n\\nint Cin() {\\n\\tint n = 0, c = gc();\\n\\tif (c == '-') {\\tc = gc();\\n\\t\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\t\\treturn -n;\\n\\t}\\n\\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\\n\\treturn n;\\n}\\n\\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\\nconst ll MOD = 1000000009;\\n \\nint N, M;\\nvector<vector<int>> adj;\\n \\ninline bool isAdjacent(int u, int v) {\\n return binary_search(adj[u].begin(), adj[u].end(), v);\\n}\\n \\npair<ll, ll> solveSubset(const vector<int>& V) {\\n if (V.empty()) return {0, 1};\\n if (V.size() == 1) return {1, 1};\\n \\n vector<bool> inLocal(N + 1, false);\\n for (int v : V) inLocal[v] = true;\\n \\n vector<bool> visited(N + 1, false);\\n vector<vector<int>> compList;\\n for (int v : V) {\\n if (!visited[v]) {\\n vector<int> comp;\\n queue<int> q;\\n q.push(v);\\n visited[v] = true;\\n while (!q.empty()) {\\n int cur = q.front();\\n q.pop();\\n comp.push_back(cur);\\n for (int nb : adj[cur]) {\\n if (inLocal[nb] && !visited[nb]) {\\n visited[nb] = true;\\n q.push(nb);\\n }\\n }\\n }\\n compList.push_back(comp);\\n }\\n }\\n \\n if (compList.size() > 1) {\\n ll totalSize = 0, totalWays = 1;\\n for (auto &comp : compList) {\\n auto subRes = solveSubset(comp);\\n totalSize += subRes.first;\\n totalWays = (totalWays * subRes.second) % MOD;\\n }\\n return {totalSize, totalWays};\\n }\\n \\n set<int> rem;\\n for (int v : V) rem.insert(v);\\n\\n vector<vector<int>> compComp;\\n while (!rem.empty()) {\\n int start = *rem.begin();\\n rem.erase(rem.begin());\\n vector<int> comp;\\n queue<int> q;\\n q.push(start);\\n comp.push_back(start);\\n while (!q.empty()) {\\n int cur = q.front();\\n q.pop();\\n for (auto it = rem.begin(); it != rem.end(); ) {\\n int candidate = *it;\\n if (!isAdjacent(cur, candidate)) {\\n q.push(candidate);\\n comp.push_back(candidate);\\n it = rem.erase(it);\\n } else ++it;\\n }\\n }\\n compComp.push_back(comp);\\n }\\n \\n ll bestSize = 0, waysCount = 0;\\n for (auto &comp : compComp) {\\n auto subRes = solveSubset(comp);\\n if (subRes.first > bestSize) {\\n bestSize = subRes.first;\\n waysCount = subRes.second;\\n } else if (subRes.first == bestSize) {\\n waysCount = (waysCount + subRes.second) % MOD;\\n }\\n }\\n return {bestSize, waysCount};\\n}\\n \\nint main() {\\n N = Cin(), M = Cin();\\n adj.resize(N + 1);\\n for (int i = 0; i < M; i++){\\n int u = Cin(), v = Cin();\\n adj[u].push_back(v);\\n adj[v].push_back(u);\\n }\\n for (int i = 1; i <= N; i++){\\n sort(adj[i].begin(), adj[i].end());\\n }\\n \\n vector<int> allVerts;\\n allVerts.reserve(N);\\n for (int i = 1; i <= N; i++){\\n allVerts.push_back(i);\\n }\\n \\n auto ans = solveSubset(allVerts);\\n Cout(ans.first), Cout(ans.second % MOD);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 26488,\n \"score_of_the_acc\": -0.631,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2291_9518633\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nconst ll MOD = 1e9 + 9;\\n\\nusing G = vector<vector<int>>;\\nstruct SCC {\\n int n;\\n const G &g;\\n G edge, redge;\\n vector<int> comp, order, used;\\n \\n SCC(int n, G &g) : n(n), g(g), edge(n), redge(n), comp(n, -1), used(n) {\\n for (int i = 0; i < n; ++i) {\\n for (auto e : g[i]) {\\n edge[i].emplace_back(e);\\n redge[e].emplace_back(i);\\n }\\n }\\n }\\n \\n void dfs(int idx) {\\n if (used[idx]) return;\\n used[idx] = true;\\n for (int to : edge[idx]) dfs(to);\\n order.emplace_back(idx);\\n }\\n \\n void rdfs(int idx, int cnt) {\\n if (comp[idx] != -1) return;\\n comp[idx] = cnt;\\n for (int to : redge[idx]) rdfs(to, cnt);\\n }\\n \\n G build() {\\n G t;\\n for (int i = 0; i < n; ++i) dfs(i);\\n reverse(order.begin(), order.end());\\n int ptr = 0;\\n for (int i : order) {\\n if (comp[i] == -1) {\\n rdfs(i, ptr), ptr++;\\n }\\n }\\n \\n t.resize(ptr);\\n for (int i = 0; i < n; ++i) {\\n t[comp[i]].emplace_back(i);\\n }\\n return t;\\n }\\n \\n};\\n\\n\\nint main() {\\n ll N, M; cin >> N >> M;\\n vector<int> deg(N, 0);\\n vector< array<int, 2> > edge(M);\\n for (int i = 0; i < M; ++i) {\\n int x, y; cin >> x >> y;\\n x--, y--;\\n edge[i] = {x, y};\\n deg[x]++;\\n deg[y]++;\\n }\\n \\n G graph(N);\\n for (auto [x, y] : edge) {\\n if (deg[x] <= deg[y]) graph[x].emplace_back(y);\\n if (deg[y] <= deg[x]) graph[y].emplace_back(x);\\n }\\n vector<int> in(N, 0), out(N, 0);\\n for (int u = 0; u < N; ++u) {\\n for (auto v : graph[u]) {\\n in[v]++;\\n out[u]++;\\n }\\n }\\n \\n SCC hoge(N, graph);\\n G scc = hoge.build();\\n \\n ll mx = 0, mult = 1;\\n for (auto vec : scc) {\\n int n = vec.size();\\n int v = vec[0];\\n \\n if (in[v] == n-1) {\\n mx++;\\n mult *= n;\\n mult %= MOD;\\n }\\n }\\n cout << mx << endl;\\n cout << mult << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 27472,\n \"score_of_the_acc\": -0.6003,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2291_8305039\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <tuple>\\nusing namespace std;\\n\\nint N;\\nint M, X[200009], Y[200009];\\nint Deg[200009];\\nint Col[200009], NumCol;\\nint Sta[200009], NumSta;\\nint Height[200009];\\nvector<int> G[200009];\\nvector<int> H[200009];\\nvector<int> I[200009];\\nqueue<tuple<vector<int>, vector<pair<int, int>>, int>> Q;\\n\\nvoid dfs(int pos) {\\n\\tCol[pos] = NumCol;\\n\\tfor (int to : G[pos]) {\\n\\t\\tif (Col[to] != -1) continue;\\n\\t\\tdfs(to);\\n\\t}\\n}\\n\\nvoid dfs2(int pos) {\\n\\tSta[pos] = NumSta;\\n\\tfor (int to : I[pos]) {\\n\\t\\tif (Sta[to] != -1) continue;\\n\\t\\tdfs2(to);\\n\\t}\\n}\\n\\nvoid dfs3(int pos, int dep) {\\n\\tHeight[pos] = dep;\\n\\tfor (int to : H[pos]) {\\n\\t\\tint nex_dep = dep + 1; if (H[to].size() >= 2) nex_dep = 0;\\n\\t\\tdfs3(to, nex_dep);\\n\\t}\\n}\\n\\nint MakeTree(vector<int> V1, vector<pair<int, int>> E1) {\\n\\tQ.push(make_tuple(V1, E1, -1));\\n\\tint Root = -1;\\n\\n\\twhile (!Q.empty()) {\\n\\t\\tvector<int> V = get<0>(Q.front());\\n\\t\\tvector<pair<int, int>> E = get<1>(Q.front());\\n\\t\\tint Parent = get<2>(Q.front());\\n\\t\\tQ.pop();\\n\\n\\t\\t// Step A. Find Degree\\n\\t\\tfor (int i : V) Deg[i] = 0;\\n\\t\\tfor (int i = 0; i < E.size(); i++) Deg[E[i].first] += 1;\\n\\t\\tfor (int i = 0; i < E.size(); i++) Deg[E[i].second] += 1;\\n\\n\\t\\t// Step B. Get Maximum\\n\\t\\tint MaxID = -1;\\n\\t\\tfor (int i = 0; i < V.size(); i++) {\\n\\t\\t\\tif (Deg[V[i]] == V.size() - 1) { MaxID = V[i]; break; }\\n\\t\\t}\\n\\t\\tif (Parent == -1) Root = MaxID;\\n\\t\\tif (Parent != -1) H[Parent].push_back(MaxID);\\n\\t\\tif (V.size() == 1) continue;\\n\\n\\t\\t// Step C. Make Graph\\n\\t\\tfor (int i : V) G[i].clear();\\n\\t\\tfor (int i : V) Col[i] = -1;\\n\\t\\tfor (pair<int, int> i : E) {\\n\\t\\t\\tif (i.first != MaxID && i.second != MaxID) {\\n\\t\\t\\t\\tG[i.first].push_back(i.second);\\n\\t\\t\\t\\tG[i.second].push_back(i.first);\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t// Step D. DFS\\n\\t\\tNumCol = 0;\\n\\t\\tfor (int i : V) {\\n\\t\\t\\tif (Col[i] != -1 || i == MaxID) continue;\\n\\t\\t\\tdfs(i);\\n\\t\\t\\tNumCol += 1;\\n\\t\\t}\\n\\n\\t\\t// Step E. Recursion\\n\\t\\tvector<vector<int>> V2(NumCol);\\n\\t\\tvector<vector<pair<int, int>>> E2(NumCol);\\n\\t\\tfor (int i : V) {\\n\\t\\t\\tif (i != MaxID) V2[Col[i]].push_back(i);\\n\\t\\t}\\n\\t\\tfor (pair<int, int> i : E) {\\n\\t\\t\\tif (i.first == MaxID || i.second == MaxID) continue;\\n\\t\\t\\tE2[Col[i.first]].push_back(i);\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < V2.size(); i++) Q.push(make_tuple(V2[i], E2[i], MaxID));\\n\\t}\\n\\n\\t// Return\\n\\treturn Root;\\n}\\n\\nint main() {\\n\\t// Step 1. Input\\n\\tcin >> N >> M;\\n\\tfor (int i = 1; i <= M; i++) cin >> X[i] >> Y[i];\\n\\tfor (int i = 1; i <= M; i++) I[X[i]].push_back(Y[i]);\\n\\tfor (int i = 1; i <= M; i++) I[Y[i]].push_back(X[i]);\\n\\n\\t// Step 2. Connected Components\\n\\tfor (int i = 1; i <= N; i++) Sta[i] = -1;\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tif (Sta[i] != -1) continue;\\n\\t\\tdfs2(i);\\n\\t\\tNumSta += 1;\\n\\t}\\n\\n\\t// Step 3. Make Tree\\n\\tvector<vector<int>> V(NumSta);\\n\\tvector<vector<pair<int, int>>> E(NumSta);\\n\\tvector<int> Root;\\n\\tfor (int i = 1; i <= N; i++) V[Sta[i]].push_back(i);\\n\\tfor (int i = 1; i <= M; i++) E[Sta[X[i]]].push_back(make_pair(X[i], Y[i]));\\n\\tfor (int i = 0; i < NumSta; i++) {\\n\\t\\tint ret = MakeTree(V[i], E[i]);\\n\\t\\tRoot.push_back(ret);\\n\\t}\\n\\n\\t// Step 4. Calculate Answer\\n\\tlong long mod = 1000000009;\\n\\tlong long Answer1 = 0;\\n\\tlong long Answer2 = 1;\\n\\tfor (int i : Root) dfs3(i, (H[i].size() >= 2 ? 0 : 1));\\n\\tfor (int i = 1; i <= N; i++) {\\n\\t\\tif (H[i].size() >= 1) continue;\\n\\t\\tAnswer1 += 1;\\n\\t\\tAnswer2 *= (long long)Height[i];\\n\\t\\tAnswer2 %= mod;\\n\\t}\\n\\tcout << Answer1 << endl;\\n\\tcout << Answer2 << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 680,\n \"memory_kb\": 44116,\n \"score_of_the_acc\": -1.3646,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2291_6039541\",\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 = 1000000009;\\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 << 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\\nusing mp = pair<int, modint>;\\nvoid merge(mp& a, mp b) {\\n\\tif (a.first < b.first)a = b;\\n\\telse if (a.first == b.first)a.second += b.second;\\n}\\nvoid solve() {\\n\\tint n, m; cin >> n >> m;\\n\\tvector<vector<int>> G(n);\\n\\trep(i, m) {\\n\\t\\tint a, b; cin >> a >> b; a--; b--;\\n\\t\\tG[a].push_back(b);\\n\\t\\tG[b].push_back(a);\\n\\t}\\n\\tauto comp = [&](int i, int j) {\\n\\t\\treturn G[i].size() < G[j].size();\\n\\t};\\n\\tvector<int> ori(n); rep(i, n)ori[i] = i;\\n\\tsort(all(ori), comp);\\n\\tvector<int> rev(n); rep(i, n)rev[ori[i]] = i;\\n\\tvector<bool> ban(n);\\n\\tvector<mp> dp(n);\\n\\trep(i, n) {\\n\\t\\tint id = ori[i];\\n\\t\\tmp s2 = { 0,1 };\\n\\t\\tfor (int to : G[id]) {\\n\\t\\t\\tint j = rev[to];\\n\\t\\t\\tif (j < i && !ban[j]) {\\n\\t\\t\\t\\ts2.first += dp[j].first;\\n\\t\\t\\t\\ts2.second *= dp[j].second;\\n\\t\\t\\t\\tban[j] = true;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmp s1 = { 1,1 };\\n\\t\\tmerge(s1, s2);\\n\\t\\tdp[i] = s1;\\n\\t}\\n\\tint ans1 = 0;\\n\\tmodint ans2 = 1;\\n\\trep(i, n)if (!ban[i]) {\\n\\t\\tans1 += dp[i].first;\\n\\t\\tans2 *= dp[i].second;\\n\\t}\\n\\tcout << ans1 << \\\"\\\\n\\\";\\n\\tcout << ans2 << \\\"\\\\n\\\";\\n}\\n\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(8);\\n\\t//init_f();\\n\\t//init();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 11008,\n \"score_of_the_acc\": -0.1776,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2291_6039505\",\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 = 1000000009;\\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 << 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\\nusing mp = pair<int, modint>;\\nvoid merge(mp& a, mp b) {\\n\\tif (a.first < b.first)a = b;\\n\\telse if (a.first == b.first)a.second += b.second;\\n}\\nvoid solve() {\\n\\tint n, m; cin >> n >> m;\\n\\tvector<set<int>> G(n);\\n\\trep(i, m) {\\n\\t\\tint a, b; cin >> a >> b; a--; b--;\\n\\t\\tG[a].insert(b);\\n\\t\\tG[b].insert(a);\\n\\t}\\n\\tvector<int> trans(n);\\n\\tvector<bool> ban(n);\\n\\tfunction<mp(vector<int>)> calc = [&](vector<int> ids)->mp {\\n\\t\\trep(j, ids.size()) {\\n\\t\\t\\ttrans[ids[j]] = j;\\n\\t\\t}\\n\\t\\tvector<bool> used(ids.size());\\n\\t\\tpair<int, modint> res = { 0,1 };\\n\\t\\trep(i, ids.size()) {\\n\\t\\t\\tif (used[i])continue;\\n\\t\\t\\tqueue<int> q; q.push(ids[i]); used[i] = true;\\n\\t\\t\\tvector<int> nids;\\n\\t\\t\\twhile (!q.empty()) {\\n\\t\\t\\t\\tint id = q.front(); q.pop();\\n\\t\\t\\t\\tnids.push_back(id);\\n\\t\\t\\t\\tfor (int to : G[id])if (!used[trans[to]]) {\\n\\t\\t\\t\\t\\tused[trans[to]] = true;\\n\\t\\t\\t\\t\\tq.push(to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (nids.size() == 1) {\\n\\t\\t\\t\\tres.first++;\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t//cout << nids.size() << \\\"\\\\n\\\";\\n\\t\\t\\tvector<int> ones;\\n\\t\\t\\trep(j, nids.size())if (G[nids[j]].size() == nids.size() - 1) {\\n\\t\\t\\t\\tones.push_back(nids[j]);\\n\\t\\t\\t\\tban[nids[j]] = true;\\n\\t\\t\\t}\\n\\t\\t\\tassert(ones.size());\\n\\t\\t\\tmp s1 = { 1,ones.size() };\\n\\t\\t\\tvector<int> nv;\\n\\t\\t\\trep(j, nids.size())if (G[nids[j]].size() < nids.size() - 1)nv.push_back(nids[j]);\\n\\t\\t\\tfor (int id : ones)for (int to : G[id])if (!ban[to])G[to].erase(id);\\n\\t\\t\\tmp s2 = calc(nv);\\n\\t\\t\\tmerge(s1, s2);\\n\\t\\t\\tres.first += s1.first;\\n\\t\\t\\tres.second *= s1.second;\\n\\t\\t}\\n\\t\\treturn res;\\n\\t};\\n\\tvector<int> ori(n); rep(i, n)ori[i] = i;\\n\\tmp p = calc(ori);\\n\\tint ans1 = p.first;\\n\\tmodint ans2 = p.second;\\n\\tcout << ans1 << \\\"\\\\n\\\";\\n\\tcout << ans2 << \\\"\\\\n\\\";\\n}\\n\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(8);\\n\\t//init_f();\\n\\t//init();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1660,\n \"memory_kb\": 29688,\n \"score_of_the_acc\": -1.5453,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2291_5006400\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define FOR(i, n, m) for(ll i = (n); i < (ll)(m); i++)\\n#define REP(i, n) FOR(i, 0, n)\\n#define ALL(v) v.begin(), v.end()\\n#define pb push_back\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<ll, ll>;\\nconstexpr ll inf = 1000000000;\\nconstexpr ll mod = 1000000009;\\nconstexpr long double eps = 1e-6;\\n \\ntemplate<typename T1, typename T2>\\nostream& operator<<(ostream& os, pair<T1, T2> p) {\\n os << to_string(p.first) << \\\" \\\" << to_string(p.second);\\n return os;\\n}\\ntemplate<typename T>\\nostream& operator<<(ostream& os, vector<T>& v) {\\n REP(i, v.size()) {\\n if(i) os << \\\" \\\";\\n os << v[i];\\n }\\n return os;\\n}\\n \\nstruct modint {\\n ll n;\\npublic:\\n modint(const ll n = 0) : n((n % mod + mod) % mod) {}\\n static modint pow(modint a, int m) {\\n modint r = 1;\\n while(m > 0) {\\n if(m & 1) { r *= a; }\\n a = (a * a); m /= 2;\\n }\\n return r;\\n }\\n modint &operator++() { *this += 1; return *this; }\\n modint &operator--() { *this -= 1; return *this; }\\n modint operator++(int) { modint ret = *this; *this += 1; return ret; }\\n modint operator--(int) { modint ret = *this; *this -= 1; return ret; }\\n modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse\\n friend bool operator==(const modint& lhs, const modint& rhs) {\\n return lhs.n == rhs.n;\\n }\\n friend bool operator<(const modint& lhs, const modint& rhs) {\\n return lhs.n < rhs.n;\\n }\\n friend bool operator>(const modint& lhs, const modint& rhs) {\\n return lhs.n > rhs.n;\\n }\\n friend modint &operator+=(modint& lhs, const modint& rhs) {\\n lhs.n += rhs.n;\\n if (lhs.n >= mod) lhs.n -= mod;\\n return lhs;\\n }\\n friend modint &operator-=(modint& lhs, const modint& rhs) {\\n lhs.n -= rhs.n;\\n if (lhs.n < 0) lhs.n += mod;\\n return lhs;\\n }\\n friend modint &operator*=(modint& lhs, const modint& rhs) {\\n lhs.n = (lhs.n * rhs.n) % mod;\\n return lhs;\\n }\\n friend modint &operator/=(modint& lhs, const modint& rhs) {\\n lhs.n = (lhs.n * (~rhs).n) % mod;\\n return lhs;\\n }\\n friend modint operator+(const modint& lhs, const modint& rhs) {\\n return modint(lhs.n + rhs.n);\\n }\\n friend modint operator-(const modint& lhs, const modint& rhs) {\\n return modint(lhs.n - rhs.n);\\n }\\n friend modint operator*(const modint& lhs, const modint& rhs) {\\n return modint(lhs.n * rhs.n);\\n }\\n friend modint operator/(const modint& lhs, const modint& rhs) {\\n return modint(lhs.n * (~rhs).n);\\n }\\n};\\nistream& operator>>(istream& is, modint m) { is >> m.n; return is; }\\nostream& operator<<(ostream& os, modint m) { os << m.n; return os; }\\n \\n#define MAX_N 1010101\\nlong long extgcd(long long a, long long b, long long& x, long long& y) {\\n long long d = a;\\n if (b != 0) {\\n d = extgcd(b, a % b, y, x);\\n y -= (a / b) * x;\\n } else {\\n x = 1; y = 0;\\n }\\n return d;\\n}\\nlong long mod_inverse(long long a, long long m) {\\n long long x, y;\\n if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;\\n else return -1;\\n}\\nvector<long long> fact(MAX_N+1, inf);\\nlong long mod_fact(long long n, long long& e) {\\n if(fact[0] == inf) {\\n fact[0]=1;\\n if(MAX_N != 0) fact[1]=1;\\n for(ll i = 2; i <= MAX_N; ++i) {\\n fact[i] = (fact[i-1] * i) % mod;\\n }\\n }\\n e = 0;\\n if(n == 0) return 1;\\n long long res = mod_fact(n / mod, e);\\n e += n / mod;\\n if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;\\n return (res * fact[n % mod]) % mod;\\n}\\n// return nCk\\nlong long mod_comb(long long n, long long k) {\\n if(n < 0 || k < 0 || n < k) return 0;\\n long long e1, e2, e3;\\n long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);\\n if(e1 > e2 + e3) return 0;\\n return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;\\n}\\n \\nusing mi = modint;\\n \\nmi mod_pow(mi a, ll n) {\\n mi ret = 1;\\n mi tmp = a;\\n while(n > 0) {\\n if(n % 2) ret *= tmp;\\n tmp = tmp * tmp;\\n n /= 2;\\n }\\n return ret;\\n}\\n \\nll gcd(ll a, ll b) {\\n if (b == 0) return a;\\n return gcd(b, a % b);\\n}\\n\\nll ans1 = 0;\\nmi ans2 = 1;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, m;\\n cin >> n >> m;\\n vector<set<int>> g(n);\\n REP(i, m) {\\n int x, y;\\n cin >> x >> y;\\n x--; y--;\\n g[x].insert(y);\\n g[y].insert(x);\\n }\\n vector<int> deg(n, 0);\\n REP(i, n) deg[i] = (int)g[i].size();\\n vector<pair<int, int>> v(n);\\n REP(i, n) v[i] = make_pair(deg[i], i);\\n sort(ALL(v)); reverse(ALL(v));\\n vector<bool> used(n, false);\\n for(auto elm: v) {\\n if(used[elm.second]) continue;\\n bool k = true;\\n for(auto adj: g[elm.second]) {\\n if(deg[adj] != deg[elm.second]) k = false;\\n }\\n if(k) {\\n ans1++;\\n ans2 *= deg[elm.second] + 1;\\n used[elm.second] = true;\\n for(auto adj: g[elm.second]) used[adj] = true;\\n } else {\\n for(auto adj: g[elm.second]) {\\n deg[adj]--;\\n g[adj].erase(elm.second);\\n }\\n }\\n }\\n cout << ans1 << endl;\\n cout << ans2 << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 35608,\n \"score_of_the_acc\": -0.8977,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2291_4556216\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define ll long long\\n#define INF 1000000005\\n#define MOD 1000000009\\n#define EPS 1e-10\\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)\\n#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)\\n#define each(a,b) for(const auto& (a): (b))\\n#define all(v) (v).begin(),(v).end()\\n#define len(v) (int)(v).size()\\n#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())\\n#define cmx(x,y) x=max(x,y)\\n#define cmn(x,y) x=min(x,y)\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define show(x) cout<<#x<<\\\" = \\\"<<(x)<<endl\\n#define sar(a,n) {cout<<#a<<\\\":\\\";rep(pachico,n)cout<<\\\" \\\"<<a[pachico];cout<<endl;}\\n\\nusing namespace std;\\n\\ntemplate<typename S,typename T>auto&operator<<(ostream&o,pair<S,T>p){return o<<\\\"{\\\"<<p.fi<<\\\",\\\"<<p.se<<\\\"}\\\";}\\ntemplate<typename T>auto&operator<<(ostream&o,set<T>s){for(auto&e:s)o<<e<<\\\" \\\";return o;}\\ntemplate<typename S,typename T,typename U>\\nauto&operator<<(ostream&o,priority_queue<S,T,U>q){while(!q.empty())o<<q.top()<<\\\" \\\",q.pop();return o;}\\ntemplate<typename K,typename T>auto&operator<<(ostream&o,map<K,T>&m){for(auto&e:m)o<<e<<\\\" \\\";return o;}\\ntemplate<typename T>auto&operator<<(ostream&o,vector<T>v){for(auto&e:v)o<<e<<\\\" \\\";return o;}\\nvoid ashow(){cout<<endl;}template<typename T,typename...A>void ashow(T t,A...a){cout<<t<<\\\" \\\";ashow(a...);}\\ntemplate<typename S,typename T,typename U>\\nstruct TRI{S fi;T se;U th;TRI(){}TRI(S f,T s,U t):fi(f),se(s),th(t){}\\nbool operator<(const TRI&_)const{return(fi==_.fi)?((se==_.se)?(th<_.th):(se<_.se)):(fi<_.fi);}};\\ntemplate<typename S,typename T,typename U>\\nauto&operator<<(ostream&o,TRI<S,T,U>&t){return o<<\\\"{\\\"<<t.fi<<\\\",\\\"<<t.se<<\\\",\\\"<<t.th<<\\\"}\\\";}\\n\\ntypedef pair<int, int> P;\\ntypedef pair<ll,ll> pll;\\ntypedef vector<int> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<double> vd;\\ntypedef vector<P> vp;\\ntypedef vector<string> vs;\\n\\nconst int MAX_N = 100005;\\n\\nint visit[MAX_N];\\n\\nvoid dfs(int u, int& deg, int& ver, int& cnt, vector<int>& vers, const int id, const vector<unordered_set<int> >& G){\\n if(deg < (int)G[u].size()){\\n deg = (int)G[u].size(), ver = u, cnt = 1;\\n }else if(deg == (int)G[u].size()){\\n ++cnt;\\n }\\n visit[u] = id, vers.push_back(u);\\n for(const int v : G[u]){\\n if(visit[v] != id) dfs(v, deg, ver, cnt, vers, id, G);\\n }\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n, m;\\n cin >> n >> m;\\n vector<unordered_set<int> > G(n);\\n unordered_set<int> st;\\n rep(i,n) st.insert(i);\\n int x, y;\\n rep(i,m){\\n cin >> x >> y;\\n --x, --y;\\n G[x].insert(y), G[y].insert(x);\\n }\\n int id = 1, hoge = 0, ans = 1;\\n while(!st.empty()){\\n const int v = *st.begin();\\n // show(v);\\n vector<int> vers;\\n int deg = -1, ver = -1, cnt = 0;\\n dfs(v, deg, ver, cnt, vers, id++, G);\\n // show(vers), show(cnt);\\n if(cnt == (int)vers.size()){\\n ++hoge;\\n ans = (ll)ans * cnt % MOD;\\n if(vers.size() == st.size()) break;\\n for(const int u : vers) st.erase(u);\\n }else{\\n for(const int u : G[ver]) G[u].erase(ver);\\n st.erase(ver);\\n }\\n }\\n cout << hoge << \\\"\\\\n\\\";\\n cout << ans << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1830,\n \"memory_kb\": 30132,\n \"score_of_the_acc\": -1.6503,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2291_3842896\",\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 MOD 1000000009\\n#define SIZE 100005\\n\\nstruct Edge{\\n\\tvoid set(int arg_from,int arg_to){\\n\\t\\tfrom = arg_from;\\n\\t\\tto = arg_to;\\n\\t}\\n\\tint from,to;\\n};\\n\\nint N,M;\\nll degree[SIZE],size[SIZE];\\nbool DELETE[SIZE];\\nEdge edge[200005];\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tdegree[i] = 0;\\n\\t\\tsize[i] = 1;\\n\\t\\tDELETE[i] = false;\\n\\t}\\n\\n\\tint from,to;\\n\\n\\tfor(int loop = 0; loop < M; loop++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\t\\tfrom--;\\n\\t\\tto--;\\n\\n\\t\\tedge[loop].set(from,to);\\n\\n\\t\\tdegree[from]++;\\n\\t\\tdegree[to]++;\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tfrom = edge[i].from;\\n\\t\\tto = edge[i].to;\\n\\n\\t\\tif((degree[from] < degree[to]) || (degree[from] == degree[to] && from < to)){\\n\\n\\t\\t\\tDELETE[to] = true;\\n\\t\\t}else{\\n\\n\\t\\t\\tDELETE[from] = true;\\n\\t\\t}\\n\\n\\t\\tif(degree[from] == degree[to]){\\n\\n\\t\\t\\tsize[from]++;\\n\\t\\t\\tsize[to]++;\\n\\t\\t}\\n\\t}\\n\\n\\tll ans_sum = 0,ans_num = 1;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tif(DELETE[i])continue;\\n\\n\\t\\tans_sum++;\\n\\t\\tans_num *= size[i];\\n\\t\\tans_num %= MOD;\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans_sum);\\n\\tprintf(\\\"%lld\\\\n\\\",ans_num);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6440,\n \"score_of_the_acc\": -0.0578,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2291_3137224\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nclass UnionFind {\\nprivate:\\n\\tvector< int > data;\\n\\t\\npublic:\\n\\tUnionFind(int n) : data(n, -1) {}\\n\\t\\n\\tvoid unionSet(int x, int y) {\\n\\t\\tx = root(x); y = root(y);\\n\\t\\tif (data[y] < data[x]) swap(x, y);\\n\\t\\tif (x != y) { data[x] += data[y]; data[y] = x; }\\n\\t}\\n\\t\\n\\tbool sameSet(int x, int y) { return root(x) == root(y); }\\n\\tint root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }\\n\\tint size(int x) { return -data[root(x)]; }\\n};\\n\\nint N, M;\\nvector< vector< int > > aList;\\n\\nvector< int > getDegOrder() {\\n\\tvector< int > deg(N, 0);\\n\\tfor (int v=0; v<N; ++v) deg[v] = (int)aList[v].size();\\n\\t\\n\\tusing pii = pair< int, int >;\\n\\tset< pii > que;\\n\\tfor (int v=0; v<N; ++v) que.insert(pii(-deg[v], v));\\n\\t\\n\\tvector< int > ret;\\n\\twhile (!que.empty()) {\\n\\t\\tint v = que.begin()->second; que.erase(que.begin());\\t\\n\\t\\tif (deg[v] < 0) continue;\\n\\t\\tret.push_back(v); deg[v] = -1;\\n\\t\\tfor (int u : aList[v]) {\\n\\t\\t\\tif (deg[u] < 0) continue;\\n\\t\\t\\tque.erase(pii(-deg[u], u));\\t--deg[u];\\n\\t\\t\\tque.insert(pii(-deg[u], u));\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nvector< int > constructCliques(const vector< int >& vertex_order) {\\n\\tvector< int > mark(N, 0);\\n\\t\\n\\tUnionFind uf(N);\\n\\tfor (int v : vertex_order) {\\n\\t\\tmark[v] = 1;\\n\\t\\tint g = -1;\\n\\t\\tfor (int u : aList[v]) {\\n\\t\\t\\tif (mark[u] == 0) continue;\\n\\t\\t\\tint r = uf.root(u);\\n\\t\\t\\tif (g != r) g = (g == -1 ? r : -2);\\n\\t\\t}\\n\\t\\tif (g >= 0) uf.unionSet(g, v);\\n\\t\\tif (g == -2) mark[v] = -1;\\n\\t}\\n\\t\\n\\tvector< int > ret;\\n\\tfor (int v=0; v<N; ++v) {\\n\\t\\tif (mark[uf.root(v)] == -1) continue;\\n\\t\\tmark[uf.root(v)] = -1;\\n\\t\\tret.push_back(uf.size(v));\\n\\t}\\n\\treturn ret;\\n}\\n\\nint main() {\\n\\tcin >> N >> M;\\n\\taList.assign(N, vector< int >());\\n\\tfor (int i=0; i<M; ++i) {\\n\\t\\tint u, v; cin >> u >> v; --u; --v;\\n\\t\\taList[u].push_back(v);\\n\\t\\taList[v].push_back(u);\\n\\t}\\n\\t\\n\\tvector< int > deg_order = getDegOrder();\\n\\treverse(deg_order.begin(), deg_order.end());\\n\\tvector< int > cliqueSize = constructCliques(deg_order);\\n\\t\\n\\tusing lint = long long int;\\n\\tlint ans = 1, MOD = (lint)1e9 + 9;\\n\\tfor (int x : cliqueSize) ans = (ans * x) % MOD;\\n\\tcout << cliqueSize.size() << endl << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 14084,\n \"score_of_the_acc\": -0.3153,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2291_2362969\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\n#define int ll\\n#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)\\n#define REP(i,b) FOR(i,0,b)\\nint read(){\\n\\tint i;\\n\\tscanf(\\\"%lld\\\",&i);\\n\\treturn i;\\n}\\nusing vi=vector<int>;\\n#define PB push_back\\n#define ALL(x) x.begin(),x.end()\\nusing pi=pair<int,int>;\\n\\nstruct UnionFind{\\n\\tvi rank,par;\\n\\tvoid Init(int n){\\n\\t\\trank.assign(n,0);\\n\\t\\tpar.assign(n,-1);\\n\\t}\\n\\tint Find(int a){\\n\\t\\treturn par[a]==-1?a:(par[a]=Find(par[a]));\\n\\t}\\n\\tbool Same(int a,int b){\\n\\t\\treturn Find(a)==Find(b);\\n\\t}\\n\\tvoid Unite(int a,int b){\\n\\t\\ta=Find(a),b=Find(b);\\n\\t\\tif(a==b)return;\\n\\t\\tif(rank[a]<rank[b])swap(a,b);\\n\\t\\tpar[b]=a;\\n\\t\\tif(rank[a]==rank[b])rank[a]++;\\n\\t}\\n};\\n\\nconst int mod=1000000009;\\n\\npi Merge(pi a,pi b){\\n\\treturn pi(a.first+b.first,a.second*b.second%mod);\\n}\\n\\nsigned main(){\\n\\tint n=read(),m=read();\\n\\tvector<vi> g(n);\\n\\tvi deg(n,0);\\n\\tREP(_,m){\\n\\t\\tint a=read()-1,b=read()-1;\\n\\t\\tg[a].PB(b);\\n\\t\\tg[b].PB(a);\\n\\t\\tdeg[a]++;\\n\\t\\tdeg[b]++;\\n\\t}\\n\\tpriority_queue<pi> pq;\\n\\tREP(i,n)pq.push(pi(deg[i],i));\\n\\tvi used(n,0),ord;\\n\\twhile(!pq.empty()){\\n\\t\\tint v=pq.top().first,i=pq.top().second;\\n\\t\\tpq.pop();\\n\\t\\tif(deg[i]!=v)continue;\\n\\t\\tord.PB(i);\\n\\t\\tfor(auto j:g[i])if(!used[j])\\n\\t\\t\\tpq.push(pi(--deg[j],j));\\n\\t\\tused[i]=1;\\n\\t}\\n\\treverse(ALL(ord));\\n\\tvector<pi> ans(n);\\n\\tUnionFind uf;uf.Init(n);\\n\\tused.assign(n,0);\\n\\tfor(auto i:ord){\\n\\t\\tpi w(0,1);\\n\\t\\tfor(auto j:g[i])if(used[j])\\n\\t\\t\\tif(!uf.Same(i,j)){\\n\\t\\t\\t\\tw=Merge(w,ans[uf.Find(j)]);\\n\\t\\t\\t\\tuf.Unite(i,j);\\n\\t\\t\\t}\\n\\t\\tif(w.first==0)\\n\\t\\t\\tw.first=1;\\n\\t\\telse if(w.first==1)\\n\\t\\t\\tw.second=(w.second+1)%mod;\\n\\t\\tans[uf.Find(i)]=w;\\n\\t\\tused[i]=1;\\n\\t}\\n\\tpi w=ans[uf.Find(0)];\\n\\tREP(i,n)if(!uf.Same(0,i)){\\n\\t\\tw=Merge(w,ans[uf.Find(i)]);\\n\\t\\tuf.Unite(0,i);\\n\\t}\\n\\tcout<<w.first<<endl<<w.second<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 19440,\n \"score_of_the_acc\": -0.4161,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2291_2039842\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define all(v) (v).begin(),(v).end()\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\n#define pb push_back\\n#define fi first\\n#define se second\\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\\n\\nconst int mod=1000000009;\\ntypedef pair<vint,vpint>graph;\\npint op(const pint &a,const pint &b){\\n return {a.fi+b.fi,a.se*b.se%mod};\\n}\\n\\nvint G[100000];\\nint deg[100000];\\nint mark[100000];\\nint sizev[100000];\\nint sizee[200000];\\npint ans;\\nint que[100000],tail;\\n\\nint vs_[100000];pint es_[200000];\\n\\nvoid solve2(int N,int *vs,int M,pint *es);\\n\\nvoid solve(int N,int *vs,int M,pint *es){\\n rep(i,N)deg[vs[i]]=0,mark[vs[i]]=-1;\\n\\n for(int i=0;i<M;i++){\\n G[es[i].fi][deg[es[i].fi]++]=es[i].se;\\n G[es[i].se][deg[es[i].se]++]=es[i].fi;\\n }\\n\\n vector<int>sizev,sizee;\\n\\n int cnt=0;\\n for(int i=0;i<N;i++){\\n if(mark[vs[i]]!=-1)continue;\\n sizev.pb(0);sizee.pb(0);\\n int c=cnt++;\\n sizev[c]++;\\n mark[vs[i]]=c;\\n tail=1;\\n que[0]=vs[i];\\n for(int j=0;j<tail;j++){\\n int v=que[j];\\n for(int k=0;k<deg[v];k++){\\n int u=G[v][k];\\n if(mark[u]!=-1)continue;\\n mark[u]=c;\\n sizev[c]++;\\n que[tail++]=u;\\n }\\n }\\n }\\n\\n for(int i=0;i<M;i++)sizee[mark[es[i].fi]]++;\\n rep(i,N)vs_[i]=vs[i];\\n rep(i,M)es_[i]=es[i];\\n\\n int c=0;\\n for(int i=0;i<cnt;i++){\\n int nc=sizev[i]+c;\\n sizev[i]=c;\\n c=nc;\\n }\\n\\n c=0;\\n for(int i=0;i<cnt;i++){\\n int nc=sizee[i]+c;\\n sizee[i]=c;\\n c=nc;\\n }\\n\\n rep(i,N){\\n int tmp=sizev[mark[vs_[i]]]++;\\n vs[tmp]=vs_[i];\\n }\\n\\n rep(i,M){\\n int tmp=sizee[mark[es_[i].fi]]++;\\n es[tmp]=es_[i];\\n }\\n\\n rep(i,cnt){\\n int t=i?sizev[i-1]:0;\\n int s=i?sizee[i-1]:0;\\n solve2(sizev[i]-t,vs+t,sizee[i]-s,es+s);\\n }\\n}\\n\\nvoid solve2(int N,int *vs,int M,pint *es){\\n if(N*(N-1)/2==M){\\n ans=op(ans,{1,N});\\n return;\\n }\\n\\n rep(i,N)deg[vs[i]]=0;\\n\\n for(int i=0;i<M;i++)deg[es[i].fi]++,deg[es[i].se]++;\\n int cent=-1;\\n rep(i,N){\\n if(deg[vs[i]]==N-1)cent=vs[i];\\n deg[vs[i]]=0;\\n }\\n assert(cent!=-1);\\n\\n int t=0;\\n rep(i,N){\\n if(vs[i]==cent)continue;\\n vs[t++]=vs[i];\\n }\\n\\n int s=0;\\n rep(i,M){\\n if(es[i].fi==cent||es[i].se==cent)continue;\\n es[s++]=es[i];\\n }\\n solve(t,vs,s,es);\\n}\\n\\nsigned main(){\\n int N,M;\\n scanf(\\\"%lld%lld\\\",&N,&M);\\n\\n\\n static int vs[100000];\\n static pint es[200000];\\n rep(i,N)vs[i]=i;\\n rep(i,M){\\n int a,b;\\n scanf(\\\"%lld%lld\\\",&a,&b);\\n a--;b--;\\n es[i]={a,b};\\n G[a].pb(b);G[b].pb(a);\\n }\\n\\n memset(mark,-1,sizeof(mark));\\n ans={0,1};\\n solve(N,vs,M,es);\\n printf(\\\"%lld\\\\n%lld\\\\n\\\",ans.fi,ans.se);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 490,\n \"memory_kb\": 21960,\n \"score_of_the_acc\": -0.7056,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2291_2039805\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define all(v) (v).begin(),(v).end()\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\n#define pb push_back\\n#define fi first\\n#define se second\\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\\n\\nconst int mod=1000000009;\\n\\npint op(const pint &a,const pint &b){\\n return {a.fi+b.fi,a.se*b.se%mod};\\n}\\n\\nvint G[100000];\\nint deg[100000];\\nint mark[100000];\\nint sizev[100000];\\nint sizee[200000];\\npint ans;\\nint que[100000],tail;\\n\\nint vs_[100000];pint es_[200000];\\n\\nvoid solve2(int N,int *vs,int M,pint *es);\\n\\nvoid solve(int N,int *vs,int M,pint *es){\\n rep(i,N)deg[vs[i]]=0,mark[vs[i]]=-1;\\n\\n for(int i=0;i<M;i++){\\n G[es[i].fi][deg[es[i].fi]++]=es[i].se;\\n G[es[i].se][deg[es[i].se]++]=es[i].fi;\\n }\\n\\n int cnt=0;\\n for(int i=0;i<N;i++){\\n if(mark[vs[i]]!=-1)continue;\\n sizev[cnt]=sizee[cnt]=0;\\n int c=cnt++;\\n sizev[c]++;\\n mark[vs[i]]=c;\\n tail=1;\\n que[0]=vs[i];\\n for(int j=0;j<tail;j++){\\n int v=que[j];\\n for(int k=0;k<deg[v];k++){\\n int u=G[v][k];\\n if(mark[u]!=-1)continue;\\n mark[u]=c;\\n sizev[c]++;\\n que[tail++]=u;\\n }\\n }\\n }\\n\\n for(int i=0;i<M;i++)sizee[mark[es[i].fi]]++;\\n rep(i,N)vs_[i]=vs[i];\\n rep(i,M)es_[i]=es[i];\\n\\n int c=0;\\n for(int i=0;i<cnt;i++){\\n int nc=sizev[i]+c;\\n sizev[i]=c;\\n c=nc;\\n }\\n\\n c=0;\\n for(int i=0;i<cnt;i++){\\n int nc=sizee[i]+c;\\n sizee[i]=c;\\n c=nc;\\n }\\n\\n rep(i,N){\\n int tmp=sizev[mark[vs_[i]]]++;\\n vs[tmp]=vs_[i];\\n }\\n\\n rep(i,M){\\n int tmp=sizee[mark[es_[i].fi]]++;\\n es[tmp]=es_[i];\\n }\\n\\n rep(i,cnt){\\n int t=i?sizev[i-1]:0;\\n int s=i?sizee[i-1]:0;\\n solve2(sizev[i]-t,vs+t,sizee[i]-s,es+s);\\n }\\n}\\n\\nvoid solve2(int N,int *vs,int M,pint *es){\\n if(N*(N-1)/2==M){\\n ans=op(ans,{1,N});\\n return;\\n }\\n\\n rep(i,N)deg[vs[i]]=0;\\n\\n for(int i=0;i<M;i++)deg[es[i].fi]++,deg[es[i].se]++;\\n int cent=-1;\\n rep(i,N){\\n if(deg[vs[i]]==N-1)cent=vs[i];\\n }\\n\\n int t=0;\\n rep(i,N){\\n if(vs[i]==cent)continue;\\n vs[t++]=vs[i];\\n }\\n\\n int s=0;\\n rep(i,M){\\n if(es[i].fi==cent||es[i].se==cent)continue;\\n es[s++]=es[i];\\n }\\n solve(t,vs,s,es);\\n}\\n\\nsigned main(){\\n int N,M;\\n scanf(\\\"%lld%lld\\\",&N,&M);\\n\\n\\n static int vs[100000];\\n static pint es[200000];\\n rep(i,N)vs[i]=i;\\n rep(i,M){\\n int a,b;\\n scanf(\\\"%lld%lld\\\",&a,&b);\\n a--;b--;\\n es[i]={a,b};\\n G[a].pb(b);G[b].pb(a);\\n }\\n ans={0,1};\\n solve(N,vs,M,es);\\n printf(\\\"%lld\\\\n%lld\\\\n\\\",ans.fi,ans.se);\\n return 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 260,\n \"memory_kb\": 23380,\n \"score_of_the_acc\": -0.614,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2291_1474416\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\ntypedef long long ll;\\nll _MOD = 1000000009;\\n\\nstruct union_find {\\n\\tvector<int> v;\\n\\tunion_find(int n) : v(n, -1) {}\\n\\tint find(int x) { return (v[x] < 0) ? x : (v[x] = find(v[x])); }\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x); y = find(y);\\n\\t\\tif (x != y) {\\n\\t\\t\\tif (-v[x] < -v[y]) swap(x, y);\\n\\t\\t\\tv[x] += v[y]; v[y] = x;\\n\\t\\t}\\n\\t}\\n\\tbool same(int x, int y) { return find(x) == find(y); }\\n\\tint size(int x) { return -v[find(x)]; }\\n};\\n\\nint main() {\\n\\tint n, m; cin >> n >> m;\\n\\tvector<int> a(m), b(m);\\n\\tfor (int i = 0; i < m; i++) {\\n\\t\\tscanf(\\\"%d%d\\\", &a[i], &b[i]);\\n\\t\\ta[i]--;\\n\\t\\tb[i]--;\\n\\t}\\n\\tvector<bool> rm(n);\\n\\tfor (;;) {\\n\\t\\tvector<int> d(n);\\n\\t\\tunion_find uf(n);\\n\\t\\tfor (int i = 0; i < m; i++) {\\n\\t\\t\\td[a[i]]++;\\n\\t\\t\\td[b[i]]++;\\n\\t\\t\\tuf.unite(a[i], b[i]);\\n\\t\\t}\\n\\t\\tvector<vector<int> > v(n);\\n\\t\\tfor (int u = 0; u < n; u++) {\\n\\t\\t\\tif (rm[u]) continue;\\n\\t\\t\\tint p = uf.find(u);\\n\\t\\t\\tif (d[u] == uf.size(p) - 1)\\n\\t\\t\\t\\tv[p].push_back(u);\\n\\t\\t}\\n\\t\\tbool updated = false;\\n\\t\\tfor (int p = 0; p < n; p++) {\\n\\t\\t\\tif (rm[p]) continue;\\n\\t\\t\\tif (uf.find(p) != p) continue;\\n\\t\\t\\tif (v[p].size() == uf.size(p)) continue;\\n\\t\\t\\tupdated = true;\\n\\t\\t\\tfor (int j = 0; j < v[p].size(); j++)\\n\\t\\t\\t\\trm[v[p][j]] = true;\\n\\t\\t}\\n\\t\\tif (!updated) {\\n\\t\\t\\tint x = 0, y = 1;\\n\\t\\t\\tfor (int p = 0; p < n; p++) {\\n\\t\\t\\t\\tif (rm[p]) continue;\\n\\t\\t\\t\\tif (uf.find(p) != p) continue;\\n\\t\\t\\t\\tx++;\\n\\t\\t\\t\\ty = (ll)y * uf.size(p) % _MOD;\\n\\t\\t\\t}\\n\\t\\t\\tcout << x << endl << y << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tvector<int> _a, _b;\\n\\t\\tfor (int i = 0; i < m; i++)\\n\\t\\t\\tif (!rm[a[i]] && !rm[b[i]]) {\\n\\t\\t\\t\\t_a.push_back(a[i]);\\n\\t\\t\\t\\t_b.push_back(b[i]);\\n\\t\\t\\t}\\n\\t\\tm = _a.size();\\n\\t\\ta = _a;\\n\\t\\tb = _b;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1580,\n \"memory_kb\": 11892,\n \"score_of_the_acc\": -1.056,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2291_1474414\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <algorithm>\\n#include <cstdio>\\n#include <fstream>\\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, w; };\\n\\nll MOD = 1000000007;\\nll _MOD = 1000000009;\\ndouble EPS = 1e-10;\\n\\nstruct union_find {\\n\\tvector<int> v;\\n\\tunion_find(int n) : v(n, -1) {}\\n\\tint find(int x) { return (v[x] < 0) ? x : (v[x] = find(v[x])); }\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x); y = find(y);\\n\\t\\tif (x != y) {\\n\\t\\t\\tif (-v[x] < -v[y]) swap(x, y);\\n\\t\\t\\tv[x] += v[y]; v[y] = x;\\n\\t\\t}\\n\\t}\\n\\tbool same(int x, int y) { return find(x) == find(y); }\\n\\tint size(int x) { return -v[find(x)]; }\\n};\\n\\nint main() {\\n\\tint n, m; cin >> n >> m;\\n\\tvector<int> a(m), b(m);\\n\\tfor (int i = 0; i < m; i++) {\\n\\t\\tscanf(\\\"%d%d\\\", &a[i], &b[i]);\\n\\t\\ta[i]--;\\n\\t\\tb[i]--;\\n\\t}\\n\\tvector<bool> rm(n);\\n\\tfor (;;) {\\n\\t\\tvector<int> d(n);\\n\\t\\tunion_find uf(n);\\n\\t\\tfor (int i = 0; i < m; i++) {\\n\\t\\t\\td[a[i]]++;\\n\\t\\t\\td[b[i]]++;\\n\\t\\t\\tuf.unite(a[i], b[i]);\\n\\t\\t}\\n\\t\\tvector<vector<int> > v(n);\\n\\t\\tfor (int u = 0; u < n; u++) {\\n\\t\\t\\tif (rm[u]) continue;\\n\\t\\t\\tint p = uf.find(u);\\n\\t\\t\\tif (d[u] == uf.size(p) - 1)\\n\\t\\t\\t\\tv[p].push_back(u);\\n\\t\\t}\\n\\t\\tbool updated = false;\\n\\t\\tfor (int p = 0; p < n; p++) {\\n\\t\\t\\tif (rm[p]) continue;\\n\\t\\t\\tif (uf.find(p) != p) continue;\\n\\t\\t\\tif (v[p].size() == uf.size(p)) continue;\\n\\t\\t\\tupdated = true;\\n\\t\\t\\tfor (int j = 0; j < v[p].size(); j++)\\n\\t\\t\\t\\trm[v[p][j]] = true;\\n\\t\\t}\\n\\t\\tif (!updated) {\\n\\t\\t\\tint x = 0, y = 1;\\n\\t\\t\\tfor (int p = 0; p < n; p++) {\\n\\t\\t\\t\\tif (rm[p]) continue;\\n\\t\\t\\t\\tif (uf.find(p) != p) continue;\\n\\t\\t\\t\\tx++;\\n\\t\\t\\t\\ty = (ll)y * uf.size(p) % _MOD;\\n\\t\\t\\t}\\n\\t\\t\\tcout << x << endl << y << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tvector<int> _a, _b;\\n\\t\\tfor (int i = 0; i < m; i++)\\n\\t\\t\\tif (!rm[a[i]] && !rm[b[i]]) {\\n\\t\\t\\t\\t_a.push_back(a[i]);\\n\\t\\t\\t\\t_b.push_back(b[i]);\\n\\t\\t\\t}\\n\\t\\tm = _a.size();\\n\\t\\ta = _a;\\n\\t\\tb = _b;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1590,\n \"memory_kb\": 11892,\n \"score_of_the_acc\": -1.0616,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2291_1474357\",\n \"code_snippet\": \"#define _USE_MATH_DEFINES\\n#include <algorithm>\\n#include <cstdio>\\n#include <fstream>\\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, w; };\\n\\nll MOD = 1000000007;\\nll _MOD = 1000000009;\\ndouble EPS = 1e-10;\\n\\nstruct union_find {\\n\\tvector<int> v;\\n\\tunion_find(int n) : v(n, -1) {}\\n\\tint find(int x) { return (v[x] < 0) ? x : (v[x] = find(v[x])); }\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x); y = find(y);\\n\\t\\tif (x != y) {\\n\\t\\t\\tif (-v[x] < -v[y]) swap(x, y);\\n\\t\\t\\tv[x] += v[y]; v[y] = x;\\n\\t\\t}\\n\\t}\\n\\tbool same(int x, int y) { return find(x) == find(y); }\\n\\tint size(int x) { return -v[find(x)]; }\\n};\\n\\ni_i g(vector<int> a, vector<int> b);\\n\\ni_i f(int n, vector<int> a, vector<int> b) {\\n\\tint m = a.size();\\n\\tunion_find uf(n);\\n\\tfor (int i = 0; i < m; i++)\\n\\t\\tuf.unite(a[i], b[i]);\\n\\tvector<vector<int> > as(n), bs(n);\\n\\tfor (int i = 0; i < m; i++) {\\n\\t\\tint u = uf.find(a[i]);\\n\\t\\tas[u].push_back(a[i]);\\n\\t\\tbs[u].push_back(b[i]);\\n\\t}\\n\\ti_i ans(0, 1);\\n\\tfor (int u = 0; u < n; u++) {\\n\\t\\tif (uf.find(u) != u) continue;\\n\\t\\ti_i p = g(as[u], bs[u]);\\n\\t\\tans.first += p.first;\\n\\t\\tans.second = (ll)ans.second * p.second % MOD;\\n\\t}\\n\\treturn ans;\\n}\\n\\ni_i g(vector<int> a, vector<int> b) {\\n\\tint m = a.size();\\n\\tvector<int> v;\\n\\tfor (int i = 0; i < m; i++) {\\n\\t\\tv.push_back(a[i]);\\n\\t\\tv.push_back(b[i]);\\n\\t}\\n\\tsort(v.begin(), v.end());\\n\\tv.erase(unique(v.begin(), v.end()), v.end());\\n\\tint n = v.size();\\n\\tif (!n) n = 1;\\n\\tfor (int i = 0; i < m; i++) {\\n\\t\\ta[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin();\\n\\t\\tb[i] = lower_bound(v.begin(), v.end(), b[i]) - v.begin();\\n\\t}\\n\\tif (m == (ll)n * (n - 1) / 2)\\n\\t\\treturn i_i(1, n);\\n\\tvector<int> d(n);\\n\\tfor (int i = 0; i < m; i++) {\\n\\t\\td[a[i]]++;\\n\\t\\td[b[i]]++;\\n\\t}\\n\\tint _u;\\n\\tfor (int u = 0; u < n; u++)\\n\\t\\tif (d[u] == n - 1)\\n\\t\\t\\t_u = u;\\n\\tvector<int> _a, _b;\\n\\tfor (int i = 0; i < m; i++)\\n\\t\\tif (a[i] != _u && b[i] != _u) {\\n\\t\\t\\t_a.push_back(a[i] < _u ? a[i] : a[i] - 1);\\n\\t\\t\\t_b.push_back(b[i] < _u ? b[i] : b[i] - 1);\\n\\t\\t}\\n\\treturn f(n - 1, _a, _b);\\n}\\n\\nint main() {\\n\\tint n, m; cin >> n >> m;\\n\\tvector<int> a(m), b(m);\\n\\tfor (int i = 0; i < m; i++) {\\n\\t\\tscanf(\\\"%d%d\\\", &a[i], &b[i]);\\n\\t\\ta[i]--;\\n\\t\\tb[i]--;\\n\\t}\\n\\ti_i p = f(n, a, b);\\n\\tcout << p.first << endl;\\n\\tcout << p.second << endl;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 80,\n \"memory_kb\": 21792,\n \"score_of_the_acc\": -0.4749,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2291_1445952\",\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 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 = 1000000009;\\n\\n\\nint T, n, m;\\n\\nint main(int argc, char *argv[]){\\n\\tios::sync_with_stdio(false);\\n\\tcin >> n >> m;\\n\\tvector<set<int>> g(n);\\n\\tvi deg(n);\\n\\tREP(i, m){\\n\\t\\tint u, v;\\n\\t\\tcin >> u >> v; u--; v--;\\n\\t\\tg[u].insert(v); g[v].insert(u);\\n\\t}\\n\\tset<pii> s;\\n\\tREP(i, n) s.insert(pii(g[i].size(), i));\\n\\tint c = 0;\\n\\tll ans = 1;\\n\\twhile(!s.empty()){\\n\\t\\tint u = s.rbegin()->second;\\n\\t\\tint deg = g[u].size();\\n\\t\\ts.erase(pii(deg, u));\\n\\t\\tif([&](){\\n\\t\\t\\tfor(int v : g[u]) if(g[v].size() != deg) return 0;\\n\\t\\t\\treturn 1;\\n\\t\\t}()){\\n\\t\\t\\tans = ans * (deg + 1) % MOD;\\n\\t\\t\\tfor(int v : g[u]) s.erase(pii(deg, v));\\n\\t\\t\\tc ++;\\n\\t\\t}else{\\n\\t\\t\\tfor(int v : g[u]){\\n\\t\\t\\t\\ts.erase(pii(g[v].size(), v));\\n\\t\\t\\t\\tg[v].erase(u);\\n\\t\\t\\t\\ts.insert(pii(g[v].size(), v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << c << endl;\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 29704,\n \"score_of_the_acc\": -0.8053,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2291_1445951\",\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 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\\n\\nint T, n, m;\\n\\nint main(int argc, char *argv[]){\\n\\tios::sync_with_stdio(false);\\n\\tcin >> n >> m;\\n\\tvector<set<int>> g(n);\\n\\tvi deg(n);\\n\\tREP(i, m){\\n\\t\\tint u, v;\\n\\t\\tcin >> u >> v; u--; v--;\\n\\t\\tg[u].insert(v); g[v].insert(u);\\n\\t}\\n\\tset<pii> s;\\n\\tREP(i, n) s.insert(pii(g[i].size(), i));\\n\\tint c = 0;\\n\\tll ans = 1;\\n\\twhile(!s.empty()){\\n\\t\\tint u = s.rbegin()->second;\\n\\t\\tint deg = g[u].size();\\n\\t\\ts.erase(pii(deg, u));\\n\\t\\tif([&](){\\n\\t\\t\\tfor(int v : g[u]) if(g[v].size() != deg) return 0;\\n\\t\\t\\treturn 1;\\n\\t\\t}()){\\n\\t\\t\\tans = ans * (deg + 1) % MOD;\\n\\t\\t\\tfor(int v : g[u]) s.erase(pii(deg, v));\\n\\t\\t\\tc ++;\\n\\t\\t}else{\\n\\t\\t\\tfor(int v : g[u]){\\n\\t\\t\\t\\ts.erase(pii(g[v].size(), v));\\n\\t\\t\\t\\tg[v].erase(u);\\n\\t\\t\\t\\ts.insert(pii(g[v].size(), v));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << c << endl;\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 20,\n \"memory_kb\": 4128,\n \"score_of_the_acc\": 0,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2291_1185232\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <algorithm>\\n#include <cstring>\\n#include <functional>\\n#include <cmath>\\n#include <complex>\\n#include <cassert>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define rep1(i,n) for(int i=1;i<=(n);++i)\\n#define all(c) (c).begin(),(c).end()\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define show(x) cout << #x << \\\" \\\" << x << endl\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\nll mod=1e9+9;\\nint N,M,deg[100001];\\nint ans=0;\\nll num=1;\\nvector<int> G[100001];\\t//id,to\\nbool done[100001]={};\\nbool comp(const int& x,const int& y){return deg[x]>deg[y];}\\nvoid add_edge(int x,int y){\\n\\tG[x].pb(y);\\n\\tG[y].pb(x);\\n\\tdeg[x]++,deg[y]++;\\n}\\nint main(){\\n\\tcin>>N>>M;\\n\\tif((ll)N*(N-1)/2==M){\\n\\t\\tcout<<1<<endl<<N<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\trep(i,M){\\n\\t\\tint x,y;\\n\\t\\tcin>>x>>y;\\n\\t\\tadd_edge(x,y);\\n\\t}\\n\\trep1(i,N) add_edge(0,i);\\n\\tvector<int> vc;\\n\\trep(i,N+1) vc.pb(i);\\n\\tsort(all(vc),comp);\\n\\tfor(int a:vc){\\n\\t\\tif(done[a]) continue;\\n\\t\\tdone[a]=true;\\n\\t\\tbool cl=true;\\n\\t\\tfor(int v:G[a]){\\n\\t\\t\\tif(done[v]) continue;\\n\\t\\t\\tif(deg[v]!=deg[a]) cl=false;\\n\\t\\t\\tdeg[v]--;\\n\\t\\t}\\n\\t\\tif(cl){\\n\\t\\t\\tint cnt=1;\\n\\t\\t\\tdone[a]=true;\\n\\t\\t\\tfor(int v:G[a]){\\n\\t\\t\\t\\tif(done[v]) continue;\\n\\t\\t\\t\\tdone[v]=true;\\n\\t\\t\\t\\tcnt++;\\n\\t\\t\\t}\\n\\t\\t\\tans++;\\n\\t\\t\\tnum=num*cnt%mod;\\n\\t\\t}\\n\\t}\\n\\tcout<<ans<<endl<<num<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 10624,\n \"score_of_the_acc\": -0.2177,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2291_1184330\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <queue>\\n#include <deque>\\n#include <stack>\\n#include <algorithm>\\n#include <cstring>\\n#include <functional>\\n#include <cmath>\\n#include <complex>\\n#include <cassert>\\nusing namespace std;\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define rep1(i,n) for(int i=1;i<=(n);++i)\\n#define all(c) (c).begin(),(c).end()\\n#define fs first\\n#define sc second\\n#define pb push_back\\n#define show(x) cout << #x << \\\" \\\" << x << endl\\nint par[100001];\\nvoid init(int n) { rep(i,n) par[i]=i; }\\nint find(int x){\\n\\tif(x==par[x]) return x;\\n\\treturn par[x]=find(par[x]);\\n}\\nvoid unite(int x,int y){\\n\\tx=find(x);\\n\\ty=find(y);\\n\\tif(x==y) return;\\n\\tpar[x]=y;\\n}\\nbool same(int x,int y) { return find(x)==find(y); }\\n\\ntypedef long long ll;\\nll mod=1e9+7;\\nint N,M;\\nint ans=0;\\nll cnt=1;\\nset<int> G[100001];\\nvoid dfs(set<int> vc){\\n\\tll s=vc.size();\\n\\tint u=-1;\\n\\tbool cl=true;\\n\\tfor(int v:vc){\\n\\t\\tif(G[v].size()==s-1&&u==-1) u=v;\\n\\t\\tif(G[v].size()<s-1) cl=false;\\n\\t}\\n\\tif(cl){\\n\\t\\tans++;\\n\\t\\tcnt*=s;\\n\\t\\tcnt%=mod;\\n\\t\\treturn;\\n\\t}\\n\\tassert(u!=-1);\\n\\tfor(int v:G[u]) G[v].erase(u);\\n\\tG[u].clear();\\n\\tvc.erase(u);\\n\\tinit(N+1);\\n\\tfor(int v:vc){\\n\\t\\tfor(int u:G[v]) unite(u,v);\\n\\t}\\n\\tmap< int,set<int> > sets;\\n\\tfor(int v:vc){\\n\\t\\tsets[find(v)].insert(v);\\n\\t}\\n\\tfor(auto it:sets){\\n\\t\\tdfs(it.sc);\\n\\t}\\n}\\nint main(){\\n\\tcin>>N>>M;\\n\\tif((ll)N*(N-1)/2==M){\\n\\t\\tcout<<1<<endl<<N<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\trep(i,M){\\n\\t\\tint x,y;\\n\\t\\tcin>>x>>y;\\n\\t\\tG[x].insert(y);\\n\\t\\tG[y].insert(x);\\n\\t}\\n\\trep1(i,N){\\n\\t\\tG[0].insert(i);\\n\\t\\tG[i].insert(0);\\n\\t}\\n\\tset<int> be;\\n\\trep(i,N+1) be.insert(i);\\n\\tdfs(be);\\n\\tcout<<ans<<endl<<cnt<<endl;\\n}\",\n \"accuracy\": 0.175,\n \"time_ms\": 50,\n \"memory_kb\": 9648,\n \"score_of_the_acc\": -0.1546,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1280,"cells":{"group_id":{"kind":"string","value":"aoj_2296_cpp"},"problem_description":{"kind":"string","value":"G: Quest of Merchant\nICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．\n今日の修行は，街を駆け回り交易を行うことで，商売の力を手にしようというものである．\n今後の修行のためにも，できるだけ多くの資金を稼ぎたい．\nこの世界は，東西南北方向の道路が等間隔に並んでいて，碁盤状になっている．唯一存在する市場の位置を (0, 0)，街には\nx\n座標，\ny\n座標が定まっている (座標が整数値の点が交差点に対応する)．うさぎは道路に沿ってのみ移動することができ，隣接する交差点間を移動するのに 1 分を要する．いくつかの交差点には街がある．交易では，街で商品を買い，市場にて販売することによって価格の差の分の利益を得る．\nうさぎの初期資金は十分にあり，お金が足りないから商品が購入できない，といったことはない．だが，それぞれの商品には重さがあり，うさぎは重さの合計が\nW\nまでの商品しか同時に持ち運ぶことができない．よって，街に商品を仕入れに行ったり市場に戻ったりを繰り返すことになる．場合によっては，複数の街で商品を購入してから市場に戻ることになるかもしれない．\n街での商品の購入や，市場での商品の販売は一瞬で行えるものとする．また，街にある商品が品切れになってしまうことは有り得ず，無限に購入することが可能である．\nうさぎは，今回売買を行おうとしている各商品の名前，1 個あたりの重さおよび販売価格と，各街の\nx\n座標，\ny\n座標および販売商品の名前と価格を，データにまとめた．うさぎは今，市場がある (0, 0) の位置にいる．プログラムを使って，制限時間\nT\n分の間にどれだけ稼ぐことが可能か調べたい．\nInput\nN\nM\nW\nT\nS\n1\nV\n1\nP\n1\n...\nS\nM\nV\nM\nP\nM\nL\n1\nX\n1\nY\n1\nR\n1,1\nQ\n1,1\n...\nR\n1,\nL\n1\nQ\n1,\nL\n1\n...\nL\nN\nX\nN\nY\nN\nR\nN\n,1\nQ\nN\n,1\n...\nR\nN\n,\nL\nN\nQ\nN\n,\nL\nN\nN\nは街の数，\nM\nは商品の種類数である．\nS\ni\n,\nV\ni\n,\nP\ni\n(1 ≤\ni\n≤\nM\n) はそれぞれ，\ni\n番目の商品の名前，1 個あたりの重さ，1 個あたりの販売価格である．\n街は 1 以上\nN\n以下の整数で表される．\nL\nj\n,\nX\nj\n,\nY\nj\n(1 ≤\nj\n≤\nN\n) はそれぞれ，街\nj\nで売られている商品の種類数，街\nj\nの\nx\n座標，\ny\n座標である．\nR\nj\n,\nk\n,\nQ\nj\n,\nk\n(1 ≤\nj\n≤\nN\n，1 ≤\nk\n≤\nL\nj\n) はそれぞれ，街\nj\nで売られている\nk\n番目の商品の名前，価格である．\n1 ≤\nN\n≤ 7，1 ≤\nM\n≤ 7，1 ≤\nW\n≤ 10,000，1 ≤\nT\n≤ 10,000，1 ≤\nV\ni\n≤\nW\n，1 ≤\nP\ni\n≤ 10,000，1 ≤\nL\nj\n≤\nM\n，-10,000 ≤\nX\nj\n≤ 10,000，-10,000 ≤\nY\nj\n≤ 10,000，1 ≤\nQ\nj\n,\nk\n≤ 10,000 を満たす．商品の名前はアルファベット小文字からなる長さが 1 以上 7 以下の文字列である．その他の値はすべて整数である．\nS\ni\nはすべて異なる．(\nX\nj\n,\nY\nj\n) として同一の組は複数回現れず，(\nX\nj\n,\nY\nj\n) = (0, 0) となることはない．\n各\nj\nに対して\nR\nj\n,\nk\nはすべて異なり，各\nR\nj\n，\nk\nはいずれかの\nS\ni\nに一致する．\nOutput\nうさぎが得られる最大の利益を 1 行に出力せよ．\nSample Input 1\n2 2 100 20\nalfalfa 10 10\ncarrot 5 10\n1 1 6\ncarrot 4\n1 -3 0\nalfalfa 5\nSample Output 1\n170\nSample Input 2\n2 3 100 20\nvim 10 10\nemacs 5 10\nvstudio 65 100\n2 1 6\nemacs 4\nvstudio 13\n3 -3 0\nvim 5\nemacs 9\nvstudio 62\nSample Output 2\n183"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2296_10366916","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n// #include \"Src/Utility/BinarySearch.hpp\"\n// #include \"Src/Sequence/CompressedSequence.hpp\"\n// #include \"Src/Sequence/RunLengthEncoding.hpp\"\n// using namespace zawa;\n// #include \"atcoder/modint\"\n// using mint = atcoder::modint998244353;\nint N, M, W, T, V[7], P[7], L[7], X[7], Y[7], R[7][7], Q[7][7];\nstd::string S[7];\nint posX(int i) {\n assert(0 <= i and i <= N);\n return i < N ? X[i] : 0;\n}\nint posY(int i) {\n assert(0 <= i and i <= N);\n return i < N ? Y[i] : 0;\n}\nint main() {\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n std::cin >> N >> M >> W >> T;\n for (int i = 0 ; i < M ; i++) std::cin >> S[i] >> V[i] >> P[i];\n for (int i = 0 ; i < N ; i++) {\n std::cin >> L[i] >> X[i] >> Y[i];\n for (int j = 0 ; j < L[i] ; j++) {\n std::string name;\n std::cin >> name >> Q[i][j];\n R[i][j] = -1;\n for (int k = 0 ; k < M ; k++) if (name == S[k]) {\n assert(R[i][j] == -1);\n R[i][j] = k;\n }\n assert(R[i][j] != -1);\n }\n }\n // 街の集合に対して、最短で巡回するのにかかる時間\n std::vector<int> time = [&]() -> std::vector<int> {\n const int INF = (int)2e9;\n std::vector dp(N + 1, std::vector<int>(1 << (N + 1), INF));\n dp[N][1 << N] = 0;\n for (int b = (1 << N) ; b < (1 << (N + 1)) ; b++) {\n for (int u = 0 ; u < N + 1 ; u++) if ((b & (1 << u)) and dp[u][b] != INF) {\n for (int v = 0 ; v < N ; v++) if (!(b & (1 << v))) {\n int w = std::abs(posX(u) - posX(v)) + std::abs(posY(u) - posY(v));\n assert(w > 0);\n dp[v][b | (1 << v)] = std::min(dp[v][b | (1 << v)], dp[u][b] + w);\n }\n }\n }\n std::vector<int> res(1 << N, INF);\n for (int b = (1 << N) ; b < (1 << (N + 1)) ; b++) {\n assert(b & (1 << N));\n int nb = b ^ (1 << N);\n for (int i = 0 ; i < N ; i++) if (b & (1 << i)) {\n assert(dp[i][b] != INF);\n int w = std::abs(posX(i)) + std::abs(posY(i));\n assert(w > 0);\n res[nb] = std::min(res[nb], dp[i][b] + w);\n }\n }\n return res;\n }();\n // 集合を巡回したときの得られる利得\n std::vector<long long> kiyo = [&]() -> std::vector<long long> {\n std::vector<long long> res(1 << N);\n for (int b = 0 ; b < (1 << N) ; b++) {\n std::vector<int> val(M, -1);\n for (int i = 0 ; i < N ; i++) if (b & (1 << i)) {\n for (int j = 0 ; j < L[i] ; j++) {\n int id = R[i][j];\n val[id] = std::max(val[id], P[id] - Q[i][j]);\n }\n }\n std::vector<long long> dp(W + 1, -1);\n dp[0] = 0;\n for (int i = 0 ; i < M ; i++) if (val[i] >= 1) {\n std::vector<long long> next = dp;\n for (int j = V[i] ; j <= W ; j++) if (next[j - V[i]] >= 0) {\n next[j] = std::max(next[j], next[j - V[i]] + val[i]);\n }\n dp = std::move(next);\n }\n res[b] = *std::max_element(dp.begin(), dp.end());\n assert(res[b] >= 0);\n }\n return res;\n }();\n // for (int i = 0 ; i < (1 << N) ; i++) std::cout << '(' << time[i] << ',' << kiyo[i] << ')';\n // std::cout << std::endl;\n std::vector<long long> dp(T + 1, -1LL);\n dp[0] = 0;\n for (int b = 0 ; b < (1 << N) ; b++) if (kiyo[b] >= 1) {\n std::vector<long long> next = dp;\n for (int i = time[b] ; i <= T ; i++) if (next[i - time[b]] >= 0) {\n next[i] = std::max(next[i], next[i - time[b]] + kiyo[b]);\n }\n dp = std::move(next);\n }\n std::cout << *std::max_element(dp.begin(), dp.end()) << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":3840,"score_of_the_acc":-0.1412,"final_rank":7},{"submission_id":"aoj_2296_10209781","code_snippet":"// AOJ #2296\n// Quest of Merchant 2025.2.10\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nconst int INF_INT = 1e9;\nconst ll NEG_INF_LL = -1e18;\n \nint manhattan(int x1, int y1, int x2, int y2){\n return abs(x1-x2) + abs(y1-y2);\n}\n \nstruct Product {\n string name;\n int weight;\n int marketPrice;\n};\n \nstruct TownOffer {\n int prodIndex;\n int price;\n};\n \nstruct Town {\n int x, y;\n vector<TownOffer> offers;\n};\n \nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N, M, W, T;\n cin >> N >> M >> W >> T;\n vector<Product> products(M);\n unordered_map<string,int> prodIndexMap;\n for (int i = 0; i < M; i++){\n cin >> products[i].name >> products[i].weight >> products[i].marketPrice;\n prodIndexMap[products[i].name] = i;\n }\n \n vector<Town> towns(N);\n for (int j = 0; j < N; j++){\n int L, X, Y;\n cin >> L >> X >> Y;\n towns[j].x = X;\n towns[j].y = Y;\n towns[j].offers.resize(L);\n for (int k = 0; k < L; k++){\n string prodName;\n int price;\n cin >> prodName >> price;\n int pindex = prodIndexMap[prodName];\n towns[j].offers[k] = {pindex, price};\n }\n }\n \n vector<int> distMarket(N);\n for (int i = 0; i < N; i++){\n distMarket[i] = manhattan(0, 0, towns[i].x, towns[i].y);\n }\n vector<vector<int>> distTown(N, vector<int>(N, 0));\n for (int i = 0; i < N; i++){\n for (int j = 0; j < N; j++){\n distTown[i][j] = manhattan(towns[i].x, towns[i].y, towns[j].x, towns[j].y);\n }\n }\n \n int totSub = 1 << N;\n vector<vector<int>> dp(totSub, vector<int>(N, INF_INT));\n for (int j = 0; j < N; j++){\n int mask = 1 << j;\n dp[mask][j] = distMarket[j];\n }\n for (int mask = 0; mask < totSub; mask++){\n for (int j = 0; j < N; j++){\n if(!(mask & (1 << j))) continue;\n for (int k = 0; k < N; k++){\n if(mask & (1 << k)) continue;\n int nextMask = mask | (1 << k);\n dp[nextMask][k] = min(dp[nextMask][k], dp[mask][j] + distTown[j][k]);\n }\n }\n }\n vector<int> cycleTime(totSub, INF_INT); \n for (int mask = 1; mask < totSub; mask++){\n int best = INF_INT;\n for (int j = 0; j < N; j++){\n if(mask & (1 << j))\n best = min(best, dp[mask][j] + distMarket[j]);\n }\n cycleTime[mask] = best;\n }\n \n vector<pair<int, ll>> cycles;\n for (int mask = 1; mask < totSub; mask++){\n const int INF_PRICE = 1000000000;\n vector<int> bestPrice(M, INF_PRICE);\n for (int j = 0; j < N; j++){\n if(mask & (1 << j)){\n for(auto &offer : towns[j].offers){\n int pidx = offer.prodIndex;\n bestPrice[pidx] = min(bestPrice[pidx], offer.price);\n }\n }\n }\n vector<pair<int,int>> items;\n for (int i = 0; i < M; i++){\n if(bestPrice[i] < INF_PRICE){\n int prodProfit = products[i].marketPrice - bestPrice[i];\n if(prodProfit > 0)\n items.push_back({products[i].weight, prodProfit});\n }\n }\n if(items.size() == 0) continue;\n \n vector<ll> knap(W+1, NEG_INF_LL);\n knap[0] = 0;\n for (int w = 0; w <= W; w++){\n if(knap[w] == NEG_INF_LL) continue;\n for(auto &it : items){\n int wt = it.first, prof = it.second;\n if(w + wt <= W) knap[w+wt] = max(knap[w+wt], knap[w] + prof);\n }\n }\n ll bestCycleProfit = 0;\n for (int w = 0; w <= W; w++)\n bestCycleProfit = max(bestCycleProfit, knap[w]);\n if(bestCycleProfit > 0){\n int tCycle = cycleTime[mask];\n cycles.push_back({tCycle, bestCycleProfit});\n }\n }\n \n vector<ll> dpTime(T+1, NEG_INF_LL);\n dpTime[0] = 0;\n for (int t = 0; t <= T; t++){\n if(dpTime[t] == NEG_INF_LL) continue;\n for(auto &cycle : cycles){\n int ct = cycle.first;\n ll cp = cycle.second;\n if(t + ct <= T) dpTime[t+ct] = max(dpTime[t+ct], dpTime[t] + cp);\n }\n }\n ll ans = 0;\n for (int t = 0; t <= T; t++) ans = max(ans, dpTime[t]);\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3640,"score_of_the_acc":-0.027,"final_rank":4},{"submission_id":"aoj_2296_9759438","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\n ll N, M, W, T;\n cin >> N >> M >> W >> T;\n map<string,int> mps;\n vector<ll> V(M), P(M);\n rep(i,0,M) {\n string _;\n cin >> _;\n mps[_] = i;\n cin >> V[i] >> P[i];\n }\n vector<ll> X(N), Y(N);\n vector<vector<ll>> R(N), Q(N);\n rep(i,0,N) {\n int L;\n cin >> L;\n cin >> X[i] >> Y[i];\n R[i].resize(L);\n Q[i].resize(L);\n rep(j,0,L) {\n string s;\n cin >> s;\n R[i][j] = mps[s];\n cin >> Q[i][j];\n }\n }\n auto dist = [&](int i, int j) -> ll {return abs(X[i]-X[j])+abs(Y[i]-Y[j]);};\n vector<ll> Len(1<<N,INF);\n {\n vector<vector<ll>> DP(1<<N,vector<ll>(N,INF));\n rep(i,0,N) DP[1<<i][i] = abs(X[i]) + abs(Y[i]);\n rep(i,1,1<<N) {\n rep(j,0,N) {\n if (DP[i][j] == INF) continue;\n rep(k,0,N) {\n if (i & (1<<k)) continue;\n chmin(DP[i|(1<<k)][k], DP[i][j]+dist(j,k));\n }\n }\n }\n rep(i,1,1<<N) {\n rep(j,0,N) {\n if (i&(1<<j)) {\n chmin(Len[i], DP[i][j]+abs(X[j])+abs(Y[j]));\n }\n }\n }\n }\n vector<ll> Price(1<<N,INF);\n rep(i,1,1<<N) {\n vector<ll> Cost(M,0);\n rep(j,0,N) {\n if (i&(1<<j)) {\n rep(k,0,R[j].size()) {\n chmax(Cost[R[j][k]], P[R[j][k]]-Q[j][k]);\n }\n }\n }\n vector<ll> DP(W+1,0);\n rep(j,0,M) {\n rep(k,0,W+1) {\n if (k+V[j] <= W) chmax(DP[k+V[j]], DP[k]+Cost[j]);\n }\n }\n Price[i] = DP[W];\n }\n {\n vector<ll> DP(T+1,0);\n rep(i,1,1<<N) {\n rep(j,0,T+1) {\n if (j+(int)Len[i]<=T) chmax(DP[j+Len[i]], DP[j]+Price[i]);\n }\n }\n cout << DP[T] << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3532,"score_of_the_acc":-0.0193,"final_rank":1},{"submission_id":"aoj_2296_9026285","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\ni64 knapsack(const vector<pair<int,int>>& wv, int W) {\n const int n = wv.size();\n vector dp(n + 1, vector(W + 1, i64(0)));\n for(int i : rep(n)) {\n auto [w, v] = wv[i];\n for(int s = 0; s <= W; s++) {\n chmax(dp[i + 1][s], dp[i][s]);\n if(0 <= s - w) chmax(dp[i + 1][s], dp[i + 1][s - w] + v);\n }\n }\n return dp[n][W];\n}\n\nint main() {\n int N = in(), M = in(), W = in(), T = in();\n map<string, pair<int,int>> item;\n for(int i : rep(M)) {\n string s = in(); int w = in(), v = in();\n item[s] = {w, v};\n }\n\n vector<pair<int,int>> pos(N);\n vector<vector<pair<int,int>>> city(N);\n for(int i : rep(N)) {\n int L = in(), x = in(), y = in();\n pos[i] = {x, y};\n for(int j : rep(L)) {\n string s = in(); int p = in();\n auto [w, v] = item[s];\n city[i].push_back({w, v - p});\n }\n }\n\n vector<pair<int,int>> b;\n for(int S : rep(1 << N)) if(S != 0) {\n vector<int> I;\n for(int i : rep(N)) if(S & (1 << i)) I.push_back(i);\n const int len = I.size();\n int TS = 1e9;\n do {\n int cur = 0;\n cur += abs(pos[I[0]].first - 0) + abs(pos[I[0]].second - 0);\n for(int i : rep(len - 1)) \n cur += abs(pos[I[i]].first - pos[I[i + 1]].first) + abs(pos[I[i]].second - pos[I[i + 1]].second);\n cur += abs(pos[I[len - 1]].first - 0) + abs(pos[I[len - 1]].second - 0);\n chmin(TS, cur);\n } while(next_permutation(I.begin(), I.end()));\n\n vector<pair<int,int>> a;\n for(int i : I) a.insert(a.end(), city[i].begin(), city[i].end());\n int VS = knapsack(a, W);\n b.push_back({TS, VS});\n }\n\n print(knapsack(b, T));\n}","accuracy":1,"time_ms":110,"memory_kb":13244,"score_of_the_acc":-1.7089,"final_rank":13},{"submission_id":"aoj_2296_9026283","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 knapsack(const vector<pair<int,int>>& wv, int W) {\n const int n = wv.size();\n vector dp(n + 1, vector(W + 1, 0));\n for(int i : rep(n)) {\n auto [w, v] = wv[i];\n for(int s = 0; s <= W; s++) {\n chmax(dp[i + 1][s], dp[i][s]);\n if(0 <= s - w) chmax(dp[i + 1][s], dp[i + 1][s - w] + v);\n }\n }\n return dp[n][W];\n}\n\nint main() {\n int N = in(), M = in(), W = in(), T = in();\n map<string, pair<int,int>> item;\n for(int i : rep(M)) {\n string s = in(); int w = in(), v = in();\n item[s] = {w, v};\n }\n\n vector<pair<int,int>> pos(N);\n vector<vector<pair<int,int>>> city(N);\n for(int i : rep(N)) {\n int L = in(), x = in(), y = in();\n pos[i] = {x, y};\n for(int j : rep(L)) {\n string s = in(); int p = in();\n auto [w, v] = item[s];\n city[i].push_back({w, v - p});\n }\n }\n\n vector<pair<int,int>> b;\n for(int S : rep(1 << N)) if(S != 0) {\n vector<int> I;\n for(int i : rep(N)) if(S & (1 << i)) I.push_back(i);\n const int len = I.size();\n int TS = 1e9;\n do {\n int cur = 0;\n cur += abs(pos[I[0]].first - 0) + abs(pos[I[0]].second - 0);\n for(int i : rep(len - 1)) \n cur += abs(pos[I[i]].first - pos[I[i + 1]].first) + abs(pos[I[i]].second - pos[I[i + 1]].second);\n cur += abs(pos[I[len - 1]].first - 0) + abs(pos[I[len - 1]].second - 0);\n chmin(TS, cur);\n } while(next_permutation(I.begin(), I.end()));\n\n vector<pair<int,int>> a;\n for(int i : I) a.insert(a.end(), city[i].begin(), city[i].end());\n int VS = knapsack(a, W);\n b.push_back({TS, VS});\n }\n\n print(knapsack(b, T));\n}","accuracy":0.08333333333333333,"time_ms":60,"memory_kb":8076,"score_of_the_acc":-0.8419,"final_rank":19},{"submission_id":"aoj_2296_6823338","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=2167167167167167167;\nconst int INF=2100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tsolve();\n}\n\nvoid solve(){\n\tint N,M,W,T;\n\tcin>>N>>M>>W>>T;\n\tmap<string,pair<int,int>> m;\n\tauto dp=[](int lim,vector<pair<int,ll>> p)->ll{\n\t\tvector<ll> ans(lim+1);\n\t\tfor(auto x:p){\n\t\t\tint ind=0;\n\t\t\twhile(ind+x.first<=lim){\n\t\t\t\tchmax(ans[ind+x.first],ans[ind]+x.second);\n\t\t\t\tind++;\n\t\t\t}\n\t\t}\n\t\treturn ans[lim];\n\t};\n\tvector<int> X(N+1),Y(N+1);\n\tvector<vector<int>> dist(N+1,vector<int>(N+1));\n\trep(i,M){\n\t\tstring S;\n\t\tint v,p;\n\t\tcin>>S>>v>>p;\n\t\tm[S]={v,p};\n\t}\n\tvector<vector<pair<int,int>>> buy(N);\n\trep(i,N){\n\t\tint L;\n\t\tcin>>L>>X[i]>>Y[i];\n\t\trep(j,L){\n\t\t\tstring S;int p;\n\t\t\tcin>>S>>p;\n\t\t\tbuy[i].push_back({m[S].first,m[S].second-p});\n\t\t}\n\t}\n\tvector<pair<int,ll>> runner;\n\trep(i,N+1) rep(j,N+1) dist[i][j]=(abs(X[i]-X[j])+abs(Y[i]-Y[j]));\n\trep(i,(1<<N)){\n\t\tif(i==0) continue;\n\t\tvector<pair<int,ll>> cost;\n\t\tvector<int> ind;\n\t\tint K=0;\n\t\trep(j,N){\n\t\t\tif(i&(1<<j)){\n\t\t\t\tfor(auto x:buy[j]) cost.push_back(x);\n\t\t\t\tind.push_back(j);K++;\n\t\t\t}\n\t\t}\n\t\tvector<vector<int>> sale(K,vector<int>(1<<K,INF));\n\t\trep(j,K) sale[j][(1<<j)]=dist[ind[j]][N];\n\t\trep(k,(1<<K)) rep(j,K){\n\t\t\tif(sale[j][k]==INF) continue;\n\t\t\trep(l,K){\n\t\t\t\tif(((1<<l)&k)==0){\n\t\t\t\t\tchmin(sale[l][k+(1<<l)],sale[j][k]+dist[ind[j]][ind[l]]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint t=INF;\n\t\trep(j,K) chmin(t,sale[j][(1<<K)-1]+dist[ind[j]][N]);\n\t\trunner.push_back({t,dp(W,cost)});\n\t}\n\t//for(auto x:runner) cout<<x.first<<\" \"<<x.second<<\"\\n\";\n\tcout<<dp(T,runner)<<\"\\n\";\n}","accuracy":1,"time_ms":20,"memory_kb":3552,"score_of_the_acc":-0.1207,"final_rank":5},{"submission_id":"aoj_2296_6823297","code_snippet":"#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=2167167167167167167;\nconst int INF=2100000000;\nconst ll mod=998244353;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\n\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tsolve();\n}\n\nvoid solve(){\n\tint N,M,W,T;\n\tcin>>N>>M>>W>>T;\n\tmap<string,pair<int,int>> m;\n\tauto dp=[](int lim,vector<pair<int,int>> p)->int{\n\t\tvector<int> ans(lim+1);\n\t\tfor(auto x:p){\n\t\t\tint ind=0;\n\t\t\twhile(ind+x.first<=lim){\n\t\t\t\tchmax(ans[ind+x.first],ans[ind]+x.second);\n\t\t\t\tind++;\n\t\t\t}\n\t\t}\n\t\treturn ans[lim];\n\t};\n\tvector<int> X(N+1),Y(N+1);\n\tvector<vector<int>> dist(N+1,vector<int>(N+1));\n\trep(i,M){\n\t\tstring S;\n\t\tint v,p;\n\t\tcin>>S>>v>>p;\n\t\tm[S]={v,p};\n\t}\n\tvector<vector<pair<int,int>>> buy(N);\n\trep(i,N){\n\t\tint L;\n\t\tcin>>L>>X[i]>>Y[i];\n\t\trep(j,L){\n\t\t\tstring S;int p;\n\t\t\tcin>>S>>p;\n\t\t\tbuy[i].push_back({m[S].first,m[S].second-p});\n\t\t}\n\t}\n\tvector<pair<int,int>> runner;\n\trep(i,N+1) rep(j,N+1) dist[i][j]=(abs(X[i]-X[j])+abs(Y[i]-Y[j]));\n\trep(i,(1<<N)){\n\t\tif(i==0) continue;\n\t\tvector<pair<int,int>> cost;\n\t\tvector<int> ind;\n\t\tint K=0;\n\t\trep(j,N){\n\t\t\tif(i&(1<<j)){\n\t\t\t\tfor(auto x:buy[j]) cost.push_back(x);\n\t\t\t\tind.push_back(j);K++;\n\t\t\t}\n\t\t}\n\t\tvector<vector<int>> sale(K,vector<int>(1<<K,INF));\n\t\trep(j,K) sale[j][(1<<j)]=dist[ind[j]][N];\n\t\trep(k,(1<<K)) rep(j,K){\n\t\t\tif(sale[j][k]==INF) continue;\n\t\t\trep(l,K){\n\t\t\t\tif(((1<<l)&k)==0){\n\t\t\t\t\tchmin(sale[l][k+(1<<l)],sale[j][k]+dist[ind[j]][ind[l]]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint t=INF;\n\t\trep(j,K) chmin(t,sale[j][(1<<K)-1]+dist[ind[j]][N]);\n\t\trunner.push_back({t,dp(W,cost)});\n\t}\n\t//for(auto x:runner) cout<<x.first<<\" \"<<x.second<<\"\\n\";\n\tcout<<dp(T,runner)<<\"\\n\";\n}","accuracy":0.08333333333333333,"time_ms":20,"memory_kb":3400,"score_of_the_acc":-0.1099,"final_rank":16},{"submission_id":"aoj_2296_6439222","code_snippet":"#line 1 \"a.cpp\"\n#define PROBLEM \"\"\n#line 2 \"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\"\n#pragma GCC target(\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#line 2 \"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T, class U>\nbool chmax(T &a, const U &b) {\n return a < b ? a = b, true : false;\n}\ntemplate <class T, class U>\nbool chmin(T &a, const U &b) {\n return b < a ? a = b, true : false;\n}\nconstexpr int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr int MOD = 1000000007;\nconstexpr int MOD_N = 998244353;\nconstexpr double EPS = 1e-7;\nconst double PI = acos(-1.0);\n#line 6 \"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\"\nusing ll = int64_t;\nusing ld = long double;\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()\ntemplate<class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) { is >> p.first >> p.second; return is; }\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &i : v) is>>i; return is; }\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; } return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head&& head, Tail&&... tail) {\n if constexpr(sizeof...(tail)==0) std::cout<<head<<'\\n'; else std::cout<<head<<' ',co(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'; else std::cerr<<head<<' ',ce(forward<Tail>(tail)...);\n}\ntemplate<typename T, typename... Args>\nauto make_vector(T x, int arg, Args ...args) {\n if constexpr(sizeof...(args)==0) return std::vector<T>(arg,x); else return std::vector(arg,make_vector<T>(x,args...));\n}\nvoid sonic() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); }\nvoid setp(const int n) { std::cout<<std::fixed<<std::setprecision(n); }\nvoid Yes(bool is_correct) { std::cout<<(is_correct?\"Yes\":\"No\")<<std::endl; }\nvoid YES(bool is_correct) { std::cout<<(is_correct?\"YES\":\"NO\")<<std::endl; }\n#line 3 \"a.cpp\"\n\nint main(void) {\n#define int ll\n sonic();\n int n, m, w, t;\n cin >> n >> m >> w >> t;\n unordered_map<string, pair<int, int>> mp;\n rep(i, m) {\n string s;\n int v, p;\n cin >> s >> v >> p;\n mp[s] = {v, p};\n }\n vector<int> l(n), x(n), y(n);\n vector<vector<int>> v(n), q(n);\n rep(i, n) {\n cin >> l[i] >> x[i] >> y[i];\n v[i].resize(l[i]);\n q[i].resize(l[i]);\n rep(j, l[i]) {\n string s;\n cin >> s >> q[i][j];\n v[i][j] = mp[s].first;\n q[i][j] = mp[s].second - q[i][j];\n }\n }\n\n vector<int> idx(n);\n iota(all(idx), 0);\n\n vector<int> tm(1 << n, Inf);\n do {\n int s = 0;\n int xx = 0, yy = 0;\n int b = 0;\n for (auto i : idx) {\n b |= 1 << i;\n s += abs(xx - x[i]) + abs(yy - y[i]);\n xx = x[i], yy = y[i];\n chmin(tm[b], s + abs(xx) + abs(yy));\n }\n } while (next_permutation(all(idx)));\n\n vector<int> ans(t + 1);\n rep(bit, 1 << n) {\n vector<int> dp(w + 1);\n rep(i, n) {\n if (!(bit >> i & 1))\n continue;\n rep(j, l[i]) {\n rep(k, w - v[i][j] + 1) {\n chmax(dp[k + v[i][j]], dp[k] + q[i][j]);\n }\n }\n }\n if (tm[bit] <= t)\n chmax(ans[tm[bit]], *max_element(all(dp)));\n }\n\n repn(i, t) {\n rep(j, t + 1 - i) chmax(ans[j + i], ans[j] + ans[i]);\n }\n co(*max_element(all(ans)));\n\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3600,"score_of_the_acc":-0.5241,"final_rank":10},{"submission_id":"aoj_2296_6439220","code_snippet":"#line 1 \"a.cpp\"\n#define PROBLEM \"\"\n#line 2 \"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\"\n#pragma GCC target(\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#line 2 \"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T, class U>\nbool chmax(T &a, const U &b) {\n return a < b ? a = b, true : false;\n}\ntemplate <class T, class U>\nbool chmin(T &a, const U &b) {\n return b < a ? a = b, true : false;\n}\nconstexpr int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr int MOD = 1000000007;\nconstexpr int MOD_N = 998244353;\nconstexpr double EPS = 1e-7;\nconst double PI = acos(-1.0);\n#line 6 \"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\"\nusing ll = int64_t;\nusing ld = long double;\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()\ntemplate<class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) { is >> p.first >> p.second; return is; }\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &i : v) is>>i; return is; }\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; } return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head&& head, Tail&&... tail) {\n if constexpr(sizeof...(tail)==0) std::cout<<head<<'\\n'; else std::cout<<head<<' ',co(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'; else std::cerr<<head<<' ',ce(forward<Tail>(tail)...);\n}\ntemplate<typename T, typename... Args>\nauto make_vector(T x, int arg, Args ...args) {\n if constexpr(sizeof...(args)==0) return std::vector<T>(arg,x); else return std::vector(arg,make_vector<T>(x,args...));\n}\nvoid sonic() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); }\nvoid setp(const int n) { std::cout<<std::fixed<<std::setprecision(n); }\nvoid Yes(bool is_correct) { std::cout<<(is_correct?\"Yes\":\"No\")<<std::endl; }\nvoid YES(bool is_correct) { std::cout<<(is_correct?\"YES\":\"NO\")<<std::endl; }\n#line 3 \"a.cpp\"\n\nint main(void) {\n sonic();\n int n, m, w, t;\n cin >> n >> m >> w >> t;\n unordered_map<string, pair<int, int>> mp;\n rep(i, m) {\n string s;\n int v, p;\n cin >> s >> v >> p;\n mp[s] = {v, p};\n }\n vector<int> l(n), x(n), y(n);\n vector<vector<int>> v(n), q(n);\n rep(i, n) {\n cin >> l[i] >> x[i] >> y[i];\n v[i].resize(l[i]);\n q[i].resize(l[i]);\n rep(j, l[i]) {\n string s;\n cin >> s >> q[i][j];\n v[i][j] = mp[s].first;\n q[i][j] = mp[s].second - q[i][j];\n }\n }\n\n vector<int> idx(n);\n iota(all(idx), 0);\n\n vector<int> tm(1 << n, Inf);\n do {\n int s = 0;\n int xx = 0, yy = 0;\n int b = 0;\n for (auto i : idx) {\n b |= 1 << i;\n s += abs(xx - x[i]) + abs(yy - y[i]);\n xx = x[i], yy = y[i];\n chmin(tm[b], s + abs(xx) + abs(yy));\n }\n } while (next_permutation(all(idx)));\n\n vector<int> ans(t + 1);\n rep(bit, 1 << n) {\n vector<int> dp(w + 1);\n rep(i, n) {\n if (!(bit >> i & 1))\n continue;\n rep(j, l[i]) {\n rep(k, w - v[i][j] + 1) {\n chmax(dp[k + v[i][j]], dp[k] + q[i][j]);\n }\n }\n }\n if (tm[bit] <= t)\n chmax(ans[tm[bit]], *max_element(all(dp)));\n }\n\n repn(i, t) {\n rep(j, t + 1 - i) chmax(ans[j + i], ans[j] + ans[i]);\n }\n co(*max_element(all(ans)));\n\n return 0;\n}","accuracy":0.08333333333333333,"time_ms":50,"memory_kb":3444,"score_of_the_acc":-0.4131,"final_rank":18},{"submission_id":"aoj_2296_6022860","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\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int n, m, w, t;\n cin >> n >> m >> w >> t;\n map<string, pair<ll, ll>> products;\n rep(i,0,m) {\n string s;\n int v, p;\n cin >> s >> v >> p;\n products[s] = {v, p};\n }\n vector<ll> x(n), y(n);\n vector<map<string, ll>> sell(n);\n rep(i,0,n) {\n int l;\n cin >> l >> x[i] >> y[i];\n rep(j,0,l) {\n string r;\n int q;\n cin >> r >> q;\n sell[i][r] =q;\n }\n }\n\n vector<ll> cost(1<<n, 1e9), prof(1<<n);\n\n rep(S,1,1<<n) {\n vector<int> visit;\n rep(i,0,n) {\n if (S>>i&1) visit.push_back(i);\n }\n int k = __builtin_popcount(S);\n do {\n ll d = 0;\n d += abs(x[visit[0]]) + abs(y[visit[0]]);\n rep(i,0,k-1) {\n d += abs(x[visit[i+1]]-x[visit[i]]) + abs(y[visit[i+1]]-y[visit[i]]);\n }\n d += abs(x[visit[k-1]]) + abs(y[visit[k-1]]);\n cost[S] = min(cost[S], d);\n } while (next_permutation(visit.begin(), visit.end()));\n\n map<string, ll> min_price;\n rep(i,0,n) {\n if (!(S>>i&1)) continue;\n for (auto [r, q] : sell[i]) {\n if (!min_price.count(r)) min_price[r] = q;\n else min_price[r] = min(min_price[r], q);\n }\n }\n\n vector<ll> dp(w+1);\n for (auto [s, p] : min_price) {\n auto [weight, gain] = products[s];\n gain -= p;\n if (gain <= 0) continue;\n rep(j,0,w-weight+1) {\n dp[j+weight] = max(dp[j+weight], dp[j]+gain);\n }\n }\n\n prof[S] = dp[w];\n }\n\n vector<ll> dp(t+1);\n rep(i,0,1<<n) {\n rep(j,0,t-cost[i]+1) {\n dp[j+cost[i]] = max(dp[j+cost[i]], dp[j]+prof[i]);\n }\n }\n cout << dp[t] << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3564,"score_of_the_acc":-0.0216,"final_rank":3},{"submission_id":"aoj_2296_6022853","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\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int n, m, w, t;\n cin >> n >> m >> w >> t;\n map<string, pair<int, int>> products;\n rep(i,0,m) {\n string s;\n int v, p;\n cin >> s >> v >> p;\n products[s] = {v, p};\n }\n vector<int> x(n), y(n);\n vector<map<string, int>> sell(n);\n rep(i,0,n) {\n int l;\n cin >> l >> x[i] >> y[i];\n rep(j,0,l) {\n string r;\n int q;\n cin >> r >> q;\n sell[i][r] =q;\n }\n }\n\n vector<int> cost(1<<n, 1e9), prof(1<<n);\n\n rep(S,1,1<<n) {\n vector<int> visit;\n rep(i,0,n) {\n if (S>>i&1) visit.push_back(i);\n }\n int k = __builtin_popcount(S);\n do {\n int d = 0;\n d += abs(x[visit[0]]) + abs(y[visit[0]]);\n rep(i,0,k-1) {\n d += abs(x[visit[i+1]]-x[visit[i]]) + abs(y[visit[i+1]]-y[visit[i]]);\n }\n d += abs(x[visit[k-1]]) + abs(y[visit[k-1]]);\n cost[S] = min(cost[S], d);\n } while (next_permutation(visit.begin(), visit.end()));\n\n map<string, int> min_price;\n rep(i,0,n) {\n if (!(S>>i&1)) continue;\n for (auto [r, q] : sell[i]) {\n if (!min_price.count(r)) min_price[r] = q;\n else min_price[r] = min(min_price[r], q);\n }\n }\n\n vector<int> dp(w+1);\n for (auto [s, p] : min_price) {\n auto [weight, gain] = products[s];\n gain -= p;\n if (gain <= 0) continue;\n rep(j,0,w-weight+1) {\n dp[j+weight] = max(dp[j+weight], dp[j]+gain);\n }\n }\n\n prof[S] = dp[w];\n }\n\n vector<int> dp(t+1);\n rep(i,0,1<<n) {\n rep(j,0,t-cost[i]+1) {\n dp[j+cost[i]] = max(dp[j+cost[i]], dp[j]+prof[i]);\n }\n }\n cout << dp[t] << endl;\n}","accuracy":0.08333333333333333,"time_ms":10,"memory_kb":3500,"score_of_the_acc":-0.017,"final_rank":15},{"submission_id":"aoj_2296_5998004","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;\n\nstruct FastIO {\n FastIO() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n} fastiofastio;\n\nconst ll 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\nstring S[7];\nint V[7], P[7], L[7], X[7], Y[7], R[7][7], Q[7][7];\nll ma[1 << 7], tim[1 << 7];\nll dp[50][10001];\nll dp2[1 << 7][10001];\n\nint main() {\n int N, M, W, T;\n cin >> N >> M >> W >> T;\n map<string, int> idx;\n for (int i = 0; i < M; i++) {\n cin >> S[i] >> V[i] >> P[i];\n idx[S[i]] = i;\n }\n for (int i = 0; i < N; i++) {\n cin >> L[i] >> X[i] >> Y[i];\n for (int j = 0; j < L[i]; j++) {\n string s;\n cin >> s >> Q[i][j];\n R[i][j] = idx[s];\n }\n }\n for (int bit = 0; bit < (1 << N); bit++) {\n vector<pair<int, int>> prod;\n for (int i = 0; i < N; i++) {\n if ((bit & (1 << i)) == 0)\n continue;\n for (int j = 0; j < L[i]; j++) {\n prod.emplace_back(V[R[i][j]], P[R[i][j]] - Q[i][j]);\n }\n }\n memset(dp, 0, sizeof(dp));\n for (int i = 0; i < prod.size(); i++) {\n auto [v, p] = prod[i];\n for (int j = 0; j <= W; j++) {\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);\n if (j >= v)\n dp[i + 1][j] = max(dp[i + 1][j], dp[i + 1][j - v] + p);\n }\n }\n for (int i = 0; i <= W; i++)\n ma[bit] = max(ma[bit], dp[prod.size()][i]);\n }\n for (int bit = 0; bit < (1 << N); bit++) {\n vector<int> perm;\n for (int i = 0; i < N; i++) {\n if (bit & (1 << i))\n perm.push_back(i);\n }\n int mi = 1 << 30;\n do {\n int prevX = 0, prevY = 0;\n int sum = 0;\n for (int p : perm) {\n sum += abs(X[p] - prevX) + abs(Y[p] - prevY);\n prevX = X[p];\n prevY = Y[p];\n }\n sum += abs(prevX) + abs(prevY);\n mi = min(mi, sum);\n } while (next_permutation(ALL(perm)));\n tim[bit] = mi;\n }\n for (int i = 1; i < (1 << N); i++) {\n for (int j = 0; j <= T; j++) {\n dp2[i][j] = max(dp2[i][j], dp2[i - 1][j]);\n if (j >= tim[i])\n dp2[i][j] = max(dp2[i][j], dp2[i][j - tim[i]] + ma[i]);\n }\n }\n ll ans = 0;\n for (int i = 0; i <= T; i++)\n ans = max(ans, dp2[(1 << N) - 1][i]);\n cout << ans << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":17344,"score_of_the_acc":-1.4,"final_rank":12},{"submission_id":"aoj_2296_5998001","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;\n\nstruct FastIO {\n FastIO() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n} fastiofastio;\n\nconst ll 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\nstring S[7];\nint V[7], P[7], L[7], X[7], Y[7], R[7][7], Q[7][7];\nint ma[1 << 7], tim[1 << 7];\nint dp[50][10001];\nint dp2[1 << 7][10001];\n\nint main() {\n int N, M, W, T;\n cin >> N >> M >> W >> T;\n map<string, int> idx;\n for (int i = 0; i < M; i++) {\n cin >> S[i] >> V[i] >> P[i];\n idx[S[i]] = i;\n }\n for (int i = 0; i < N; i++) {\n cin >> L[i] >> X[i] >> Y[i];\n for (int j = 0; j < L[i]; j++) {\n string s;\n cin >> s >> Q[i][j];\n R[i][j] = idx[s];\n }\n }\n for (int bit = 0; bit < (1 << N); bit++) {\n vector<pair<int, int>> prod;\n for (int i = 0; i < N; i++) {\n if ((bit & (1 << i)) == 0)\n continue;\n for (int j = 0; j < L[i]; j++) {\n prod.emplace_back(V[R[i][j]], P[R[i][j]] - Q[i][j]);\n }\n }\n memset(dp, 0, sizeof(dp));\n for (int i = 0; i < prod.size(); i++) {\n auto [v, p] = prod[i];\n for (int j = 0; j <= W; j++) {\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);\n if (j >= v)\n dp[i + 1][j] = max(dp[i + 1][j], dp[i + 1][j - v] + p);\n }\n }\n for (int i = 0; i <= W; i++)\n ma[bit] = max(ma[bit], dp[prod.size()][i]);\n }\n for (int bit = 0; bit < (1 << N); bit++) {\n vector<int> perm;\n for (int i = 0; i < N; i++) {\n if (bit & (1 << i))\n perm.push_back(i);\n }\n int mi = 1 << 30;\n do {\n int prevX = 0, prevY = 0;\n int sum = 0;\n for (int p : perm) {\n sum += abs(X[p] - prevX) + abs(Y[p] - prevY);\n prevX = X[p];\n prevY = Y[p];\n }\n sum += abs(prevX) + abs(prevY);\n mi = min(mi, sum);\n } while (next_permutation(ALL(perm)));\n tim[bit] = mi;\n }\n for (int i = 1; i < (1 << N); i++) {\n for (int j = 0; j <= T; j++) {\n dp2[i][j] = max(dp2[i][j], dp2[i - 1][j]);\n if (j >= tim[i])\n dp2[i][j] = max(dp2[i][j], dp2[i][j - tim[i]] + ma[i]);\n }\n }\n int ans = 0;\n for (int i = 0; i <= T; i++)\n ans = max(ans, dp2[(1 << N) - 1][i]);\n cout << ans << endl;\n}","accuracy":0.08333333333333333,"time_ms":50,"memory_kb":10320,"score_of_the_acc":-0.9013,"final_rank":20},{"submission_id":"aoj_2296_5943056","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>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\n\nint n;\nint x[8],y[8];\nint dp[1<<8][8];\nint min_time[1<<7];\n\nvoid TSP(){\n n++;\n for(int i=0;i<(1<<n);i++){\n for(int j=0;j<n;j++){\n dp[i][j] = (1<<30);\n }\n }\n n--;\n dp[0][n] = 0;\n n++;\n for(int i=0;i<(1<<n);i++){\n for(int j=0;j<n;j++){\n if(dp[i][j] == (1<<30)) continue;\n for(int k=0;k<n;k++){\n if((1<<k)&i)continue;\n int nx = (1<<k)|i;\n int cost = dp[i][j] + abs(x[j]-x[k]) + abs(y[j]-y[k]);\n dp[nx][k] = min(dp[nx][k], cost);\n }\n }\n } \n n--;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int m,W,T; cin >> n >> m >> W >> T;\n map<string,int> to_id;\n vector<int> v(m),p(m);\n for(int i=0;i<m;i++){\n string s; cin >> s;\n to_id[s] = i;\n cin >> v[i] >> p[i];\n }\n vector<vector<pair<int,int>>> pro(n);\n for(int i=0;i<n;i++){\n int L; cin >> L;\n cin >> x[i] >> y[i];\n for(int j=0;j<L;j++){\n string r; cin >> r;\n int q; cin >> q;\n pro[i].push_back({to_id[r],q});\n }\n }\n x[n] = y[n] = 0;\n TSP();\n for(int i=1;i<(1<<n);i++){\n min_time[i] = dp[i+(1<<n)][n];\n }\n vector<int> opt(1<<n);\n for(int i=1;i<(1<<n);i++){\n if(min_time[i]>T)continue;\n int bit = 0;\n vector<int> cost(m,1<<30);\n for(int j=0;j<n;j++){\n if((1<<j)&i){\n for(auto &p:pro[j]){\n bit |= (1<<p.first);\n cost[p.first] = min(cost[p.first],p.second);\n }\n }\n }\n vector<ll> dp2(W+1);\n for(int j=1;j<=W;j++){\n dp2[j] = max(dp2[j], dp2[j-1]);\n for(int k=0;k<m;k++){\n if((1<<k)&bit){\n if(j>=v[k]){\n dp2[j] = max(dp2[j], dp2[j-v[k]]+p[k]-cost[k]);\n }\n }\n }\n }\n opt[i] = dp2.back();\n }\n vector<ll> dp3(T+1);\n for(int i=1;i<=T;i++){\n dp3[i] = max(dp3[i],dp3[i-1]);\n for(int j=1;j<(1<<n);j++){\n if(i-min_time[j]>=0){\n dp3[i] = max(dp3[i], dp3[i-min_time[j]]+opt[j]);\n }\n }\n }\n cout << dp3.back() << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3536,"score_of_the_acc":-0.0196,"final_rank":2},{"submission_id":"aoj_2296_5943051","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>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\n\nint n;\nint x[8],y[8];\nint dp[1<<8][8];\nint min_time[1<<7];\n\nvoid TSP(){\n n++;\n for(int i=0;i<(1<<n);i++){\n for(int j=0;j<n;j++){\n dp[i][j] = (1<<30);\n }\n }\n n--;\n dp[0][n] = 0;\n n++;\n for(int i=0;i<(1<<n);i++){\n for(int j=0;j<n;j++){\n if(dp[i][j] == (1<<30)) continue;\n for(int k=0;k<n;k++){\n if((1<<k)&i)continue;\n int nx = (1<<k)|i;\n int cost = dp[i][j] + abs(x[j]-x[k]) + abs(y[j]-y[k]);\n dp[nx][k] = min(dp[nx][k], cost);\n }\n }\n } \n n--;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int m,W,T; cin >> n >> m >> W >> T;\n map<string,int> to_id;\n vector<int> v(m),p(m);\n for(int i=0;i<m;i++){\n string s; cin >> s;\n to_id[s] = i;\n cin >> v[i] >> p[i];\n }\n vector<vector<pair<int,int>>> pro(n);\n for(int i=0;i<n;i++){\n int L; cin >> L;\n cin >> x[i] >> y[i];\n for(int j=0;j<L;j++){\n string r; cin >> r;\n int q; cin >> q;\n pro[i].push_back({to_id[r],q});\n }\n }\n x[n] = y[n] = 0;\n TSP();\n for(int i=1;i<(1<<n);i++){\n min_time[i] = dp[i+(1<<n)][n];\n }\n vector<int> opt(1<<n);\n for(int i=1;i<(1<<n);i++){\n if(min_time[i]>T)continue;\n int bit = 0;\n vector<int> cost(m,1<<30);\n for(int j=0;j<n;j++){\n if((1<<j)&i){\n for(auto &p:pro[j]){\n bit |= (1<<p.first);\n cost[p.first] = min(cost[p.first],p.second);\n }\n }\n }\n vector<int> dp2(W+1);\n for(int j=1;j<=W;j++){\n dp2[j] = max(dp2[j], dp2[j-1]);\n for(int k=0;k<m;k++){\n if((1<<k)&bit){\n if(j>=v[k]){\n dp2[j] = max(dp2[j], dp2[j-v[k]]+p[k]-cost[k]);\n }\n }\n }\n }\n opt[i] = dp2.back();\n }\n vector<int> dp3(T+1);\n for(int i=1;i<=T;i++){\n dp3[i] = max(dp3[i],dp3[i-1]);\n for(int j=1;j<(1<<n);j++){\n if(i-min_time[j]>=0){\n dp3[i] = max(dp3[i], dp3[i-min_time[j]]+opt[j]);\n }\n }\n }\n cout << dp3.back() << endl;\n}","accuracy":0.08333333333333333,"time_ms":10,"memory_kb":3444,"score_of_the_acc":-0.0131,"final_rank":14},{"submission_id":"aoj_2296_5870687","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;\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nint main(){\n int n,m,w,t; cin >> n >> m >> w >> t;\n map<string,int> mp;\n vl v(m),p(m);\n rep(i,m){\n string s;\n cin >> s >> v[i] >> p[i];\n mp[s] = i;\n }\n vector<vpl> z(n);\n vl x(n),y(n);\n rep(i,n){\n int l; cin >> l;\n cin >> x[i] >> y[i];\n z[i].resize(l);\n rep(j,l){\n string r; cin >> r;\n int q; cin >> q;\n z[i][j] = {mp[r],q};\n }\n }\n vl dp(t+1,-linf);\n dp[0] = 0;\n REP(bit,1,1<<n){\n vl a;\n rep(i,n) if(bit>>i & 1) a.push_back(i);\n ll d = inf;\n int m = a.size();\n do{\n ll cd = abs(x[a[0]]) + abs(y[a[0]]);\n rep(i,m-1){\n cd += abs(x[a[i]]-x[a[i+1]]) + abs(y[a[i]]-y[a[i+1]]);\n }\n cd += abs(x[a[m-1]]) + abs(y[a[m-1]]);\n chmin(d,cd);\n }while(next_permutation(all(a)));\n vl ep(w+1,-linf);\n ep[0] = 0;\n rep(i,n){\n if(bit>>i & 1 ^ 1) continue;\n for(auto b : z[i]){\n rep(j,w){\n if(j+v[b.first] > w) break;\n chmax(ep[j+v[b.first]], ep[j] + p[b.first] - b.second);\n }\n }\n }\n ll mx = *max_element(all(ep));\n rep(i,t){\n if(i+d > t) break;\n chmax(dp[i+d], dp[i]+mx);\n }\n }\n cout << *max_element(all(dp)) << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3596,"score_of_the_acc":-0.1239,"final_rank":6},{"submission_id":"aoj_2296_5252814","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <map>\n\nusing namespace std;\nusing lint = long long;\n\nconstexpr int INF = 1 << 30;\n\nvoid solve() {\n int n, m, wmax, t;\n cin >> n >> m >> wmax >> t;\n\n map<string, int> id;\n vector<int> ws(m);\n vector<lint> vs(m);\n for (int i = 0; i < m; ++i) {\n string s;\n cin >> s >> ws[i] >> vs[i];\n id[s] = i;\n }\n\n vector<pair<int, int>> pos(n);\n vector<vector<pair<int, lint>>> pss(n); // weight, value\n for (int i = 0; i < n; ++i) {\n int k;\n {\n auto& [x, y] = pos[i];\n cin >> k >> x >> y;\n }\n\n while (k--) {\n string s;\n lint v;\n cin >> s >> v;\n int j = id[s];\n\n v = vs[j] - v;\n if (v > 0) pss[i].emplace_back(ws[j], v);\n }\n }\n\n vector<pair<int, lint>> ps; // dist, value\n for (int b = 1; b < (1 << n); ++b) {\n vector<int> is;\n for (int i = 0; i < n; ++i) {\n if ((b >> i) & 1) is.push_back(i);\n }\n\n int dmin = INF;\n do {\n int px = 0, py = 0;\n\n int d = 0;\n for (auto i : is) {\n auto [x, y] = pos[i];\n d += abs(x - px) + abs(y - py);\n px = x, py = y;\n }\n\n d += abs(px) + abs(py);\n dmin = min(dmin, d);\n } while (next_permutation(is.begin(), is.end()));\n\n vector<lint> dp(wmax + 1, 0);\n for (auto i : is) {\n for (auto [w, v] : pss[i]) {\n for (int x = w; x <= wmax; ++x) {\n dp[x] = max(dp[x], dp[x - w] + v);\n }\n }\n }\n\n ps.emplace_back(dmin, dp.back());\n }\n\n vector<lint> dp(t + 1, 0);\n for (auto [d, v] : ps) {\n for (int x = d; x <= t; ++x) {\n dp[x] = max(dp[x], dp[x - d] + v);\n }\n }\n cout << dp.back() << \"\\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":50,"memory_kb":3624,"score_of_the_acc":-0.4258,"final_rank":8},{"submission_id":"aoj_2296_5130422","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define ALL(v) v.begin(),v.end()\n\n#define int long long\nstruct G{int w,v;};\ntemplate<typename T>\nvoid chmax(T &a,T b){\n if(a<b)a=b;\n}\ntemplate<typename T>\nvoid chmin(T &a,T b){\n if(a>b)a=b;\n}\n\nsigned main(){\n int n,m,W,T;cin>>n>>m>>W>>T;\n map<string,int> mp;\n vector<int> v(m),p(m);\n REP(i,m){\n string s;cin>>s>>v[i]>>p[i];\n mp[s]=i;\n }\n vector<int> x(n),y(n);\n vector<G> s[n];\n REP(i,n){\n int l;cin>>l>>x[i]>>y[i];\n REP(j,l){\n string tmp;int tmpv;\n cin>>tmp>>tmpv;\n if(p[mp[tmp]]>tmpv)\n s[i].push_back({v[mp[tmp]],p[mp[tmp]]-tmpv});\n }\n }\n vector<int> tme(1<<n,T+1),idx(n);\n tme[0]=0;\n REP(i,n)idx[i]=i;\n do{\n int visit=0,nowtime=0,nowy=0,nowx=0;\n REP(i,n){\n visit+=1<<idx[i];\n nowtime+=abs(nowy-y[idx[i]])+abs(nowx-x[idx[i]]);\n nowy=y[idx[i]],nowx=x[idx[i]];\n chmin(tme[visit],nowtime+abs(nowy)+abs(nowx));\n }\n }while(next_permutation(ALL(idx)));\n vector<int> va(T+1,0);\n REP(bit,1<<n){\n if(tme[bit]>T)continue;\n vector<int> a(W+1,0);\n REP(i,n)\n if((bit>>i)&1)\n for(auto g:s[i])\n REP(j,W-g.w+1)chmax(a[j+g.w],a[j]+g.v);\n chmax(va[tme[bit]],a[W]);\n }\n vector<int> ans(T+1,0);\n REP(i,T+1)\n REP(j,T+1-i)\n chmax(ans[i+j],ans[j]+va[i]);\n cout<<ans[T]<<endl;\n}","accuracy":1,"time_ms":60,"memory_kb":3344,"score_of_the_acc":-0.506,"final_rank":9},{"submission_id":"aoj_2296_5130418","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<(n);i++)\n#define ALL(v) v.begin(),v.end()\n\nstruct G{int w,v;};\ntemplate<typename T>\nvoid chmax(T &a,T b){\n if(a<b)a=b;\n}\ntemplate<typename T>\nvoid chmin(T &a,T b){\n if(a>b)a=b;\n}\n\nsigned main(){\n int n,m,W,T;cin>>n>>m>>W>>T;\n map<string,int> mp;\n vector<int> v(m),p(m);\n REP(i,m){\n string s;cin>>s>>v[i]>>p[i];\n mp[s]=i;\n }\n vector<int> x(n),y(n);\n vector<G> s[n];\n REP(i,n){\n int l;cin>>l>>x[i]>>y[i];\n REP(j,l){\n string tmp;int tmpv;\n cin>>tmp>>tmpv;\n if(p[mp[tmp]]>tmpv)\n s[i].push_back({v[mp[tmp]],p[mp[tmp]]-tmpv});\n }\n }\n vector<int> tme(1<<n,T+1),idx(n);\n tme[0]=0;\n REP(i,n)idx[i]=i;\n do{\n int visit=0,nowtime=0,nowy=0,nowx=0;\n REP(i,n){\n visit+=1<<idx[i];\n nowtime+=abs(nowy-y[idx[i]])+abs(nowx-x[idx[i]]);\n nowy=y[idx[i]],nowx=x[idx[i]];\n chmin(tme[visit],nowtime+abs(nowy)+abs(nowx));\n }\n }while(next_permutation(ALL(idx)));\n vector<int> va(T+1,0);\n REP(bit,1<<n){\n if(tme[bit]>T)continue;\n vector<int> a(W+1,0);\n REP(i,n)\n if((bit>>i)&1)\n for(auto g:s[i])\n REP(j,W-g.w+1)chmax(a[j+g.w],a[j]+g.v);\n chmax(va[tme[bit]],a[W]);\n }\n vector<int> ans(T+1,0);\n REP(i,T+1)\n REP(j,T+1-i)\n chmax(ans[i+j],ans[j]+va[i]);\n cout<<ans[T]<<endl;\n}","accuracy":0.08333333333333333,"time_ms":50,"memory_kb":3260,"score_of_the_acc":-0.4,"final_rank":17},{"submission_id":"aoj_2296_4970167","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<map>\n#include<vector>\nusing namespace std;\nint N,M,W,T;\nmap<string,int>sell,we;\nint X[7],Y[7];\nvector<pair<string,int> >buy[7];\nint dist[1<<7][7];\nlong ge[10101];\nlong w[1<<7][10101];\nmain()\n{\n\tcin>>N>>M>>W>>T;\n\tfor(int i=0;i<M;i++)\n\t{\n\t\tstring s;cin>>s;\n\t\tcin>>we[s]>>sell[s];\n\t}\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tint L;cin>>L>>X[i]>>Y[i];\n\t\tfor(int j=0;j<L;j++)\n\t\t{\n\t\t\tstring t;int p;\n\t\t\tcin>>t>>p;\n\t\t\tbuy[i].push_back(make_pair(t,p));\n\t\t}\n\t}\n\tfor(int i=0;i<1<<N;i++)for(int j=0;j<N;j++)dist[i][j]=1e9;\n\tfor(int i=0;i<N;i++)dist[1<<i][i]=abs(X[i])+abs(Y[i]);\n\tfor(int i=1;i<1<<N;i++)for(int j=0;j<N;j++)if(i>>j&1)\n\t{\n\t\tfor(int k=0;k<N;k++)\n\t\t{\n\t\t\tdist[i|1<<k][k]=min(dist[i|1<<k][k],dist[i][j]+abs(X[j]-X[k])+abs(Y[j]-Y[k]));\n\t\t}\n\t}\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tfor(int j=0;j<1<<i;j++)\n\t\t{\n\t\t\tint nj=j|1<<i;\n\t\t\tfor(int k=0;k<=W;k++)w[nj][k]=w[j][k];\n\t\t\tfor(pair<string,int>p:buy[i])\n\t\t\t{\n\t\t\t\tint wgh=we[p.first];\n\t\t\t\tint gt=sell[p.first]-p.second;\n\t\t\t\tfor(int k=0;k<=W-wgh;k++)w[nj][k+wgh]=max(w[nj][k+wgh],w[nj][k]+gt);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=1;i<1<<N;i++)\n\t{\n\t\tint tm=1e9;\n\t\tfor(int j=0;j<N;j++)tm=min(tm,dist[i][j]+abs(X[j])+abs(Y[j]));\n\t\tlong B=w[i][W];\n\t\tfor(int j=0;j<=T-tm;j++)ge[j+tm]=max(ge[j+tm],ge[j]+B);\n\t}\n\tcout<<ge[T]<<endl;\n}","accuracy":1,"time_ms":20,"memory_kb":13292,"score_of_the_acc":-0.8123,"final_rank":11}],"string":"[\n {\n \"submission_id\": \"aoj_2296_10366916\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cassert>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <numeric>\\n// #include \\\"Src/Utility/BinarySearch.hpp\\\"\\n// #include \\\"Src/Sequence/CompressedSequence.hpp\\\"\\n// #include \\\"Src/Sequence/RunLengthEncoding.hpp\\\"\\n// using namespace zawa;\\n// #include \\\"atcoder/modint\\\"\\n// using mint = atcoder::modint998244353;\\nint N, M, W, T, V[7], P[7], L[7], X[7], Y[7], R[7][7], Q[7][7];\\nstd::string S[7];\\nint posX(int i) {\\n assert(0 <= i and i <= N);\\n return i < N ? X[i] : 0;\\n}\\nint posY(int i) {\\n assert(0 <= i and i <= N);\\n return i < N ? Y[i] : 0;\\n}\\nint main() {\\n std::cin.tie(nullptr);\\n std::cout.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n std::cin >> N >> M >> W >> T;\\n for (int i = 0 ; i < M ; i++) std::cin >> S[i] >> V[i] >> P[i];\\n for (int i = 0 ; i < N ; i++) {\\n std::cin >> L[i] >> X[i] >> Y[i];\\n for (int j = 0 ; j < L[i] ; j++) {\\n std::string name;\\n std::cin >> name >> Q[i][j];\\n R[i][j] = -1;\\n for (int k = 0 ; k < M ; k++) if (name == S[k]) {\\n assert(R[i][j] == -1);\\n R[i][j] = k;\\n }\\n assert(R[i][j] != -1);\\n }\\n }\\n // 街の集合に対して、最短で巡回するのにかかる時間\\n std::vector<int> time = [&]() -> std::vector<int> {\\n const int INF = (int)2e9;\\n std::vector dp(N + 1, std::vector<int>(1 << (N + 1), INF));\\n dp[N][1 << N] = 0;\\n for (int b = (1 << N) ; b < (1 << (N + 1)) ; b++) {\\n for (int u = 0 ; u < N + 1 ; u++) if ((b & (1 << u)) and dp[u][b] != INF) {\\n for (int v = 0 ; v < N ; v++) if (!(b & (1 << v))) {\\n int w = std::abs(posX(u) - posX(v)) + std::abs(posY(u) - posY(v));\\n assert(w > 0);\\n dp[v][b | (1 << v)] = std::min(dp[v][b | (1 << v)], dp[u][b] + w);\\n }\\n }\\n }\\n std::vector<int> res(1 << N, INF);\\n for (int b = (1 << N) ; b < (1 << (N + 1)) ; b++) {\\n assert(b & (1 << N));\\n int nb = b ^ (1 << N);\\n for (int i = 0 ; i < N ; i++) if (b & (1 << i)) {\\n assert(dp[i][b] != INF);\\n int w = std::abs(posX(i)) + std::abs(posY(i));\\n assert(w > 0);\\n res[nb] = std::min(res[nb], dp[i][b] + w);\\n }\\n }\\n return res;\\n }();\\n // 集合を巡回したときの得られる利得\\n std::vector<long long> kiyo = [&]() -> std::vector<long long> {\\n std::vector<long long> res(1 << N);\\n for (int b = 0 ; b < (1 << N) ; b++) {\\n std::vector<int> val(M, -1);\\n for (int i = 0 ; i < N ; i++) if (b & (1 << i)) {\\n for (int j = 0 ; j < L[i] ; j++) {\\n int id = R[i][j];\\n val[id] = std::max(val[id], P[id] - Q[i][j]);\\n }\\n }\\n std::vector<long long> dp(W + 1, -1);\\n dp[0] = 0;\\n for (int i = 0 ; i < M ; i++) if (val[i] >= 1) {\\n std::vector<long long> next = dp;\\n for (int j = V[i] ; j <= W ; j++) if (next[j - V[i]] >= 0) {\\n next[j] = std::max(next[j], next[j - V[i]] + val[i]);\\n }\\n dp = std::move(next);\\n }\\n res[b] = *std::max_element(dp.begin(), dp.end());\\n assert(res[b] >= 0);\\n }\\n return res;\\n }();\\n // for (int i = 0 ; i < (1 << N) ; i++) std::cout << '(' << time[i] << ',' << kiyo[i] << ')';\\n // std::cout << std::endl;\\n std::vector<long long> dp(T + 1, -1LL);\\n dp[0] = 0;\\n for (int b = 0 ; b < (1 << N) ; b++) if (kiyo[b] >= 1) {\\n std::vector<long long> next = dp;\\n for (int i = time[b] ; i <= T ; i++) if (next[i - time[b]] >= 0) {\\n next[i] = std::max(next[i], next[i - time[b]] + kiyo[b]);\\n }\\n dp = std::move(next);\\n }\\n std::cout << *std::max_element(dp.begin(), dp.end()) << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.1412,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2296_10209781\",\n \"code_snippet\": \"// AOJ #2296\\n// Quest of Merchant 2025.2.10\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nconst int INF_INT = 1e9;\\nconst ll NEG_INF_LL = -1e18;\\n \\nint manhattan(int x1, int y1, int x2, int y2){\\n return abs(x1-x2) + abs(y1-y2);\\n}\\n \\nstruct Product {\\n string name;\\n int weight;\\n int marketPrice;\\n};\\n \\nstruct TownOffer {\\n int prodIndex;\\n int price;\\n};\\n \\nstruct Town {\\n int x, y;\\n vector<TownOffer> offers;\\n};\\n \\nint main() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n \\n int N, M, W, T;\\n cin >> N >> M >> W >> T;\\n vector<Product> products(M);\\n unordered_map<string,int> prodIndexMap;\\n for (int i = 0; i < M; i++){\\n cin >> products[i].name >> products[i].weight >> products[i].marketPrice;\\n prodIndexMap[products[i].name] = i;\\n }\\n \\n vector<Town> towns(N);\\n for (int j = 0; j < N; j++){\\n int L, X, Y;\\n cin >> L >> X >> Y;\\n towns[j].x = X;\\n towns[j].y = Y;\\n towns[j].offers.resize(L);\\n for (int k = 0; k < L; k++){\\n string prodName;\\n int price;\\n cin >> prodName >> price;\\n int pindex = prodIndexMap[prodName];\\n towns[j].offers[k] = {pindex, price};\\n }\\n }\\n \\n vector<int> distMarket(N);\\n for (int i = 0; i < N; i++){\\n distMarket[i] = manhattan(0, 0, towns[i].x, towns[i].y);\\n }\\n vector<vector<int>> distTown(N, vector<int>(N, 0));\\n for (int i = 0; i < N; i++){\\n for (int j = 0; j < N; j++){\\n distTown[i][j] = manhattan(towns[i].x, towns[i].y, towns[j].x, towns[j].y);\\n }\\n }\\n \\n int totSub = 1 << N;\\n vector<vector<int>> dp(totSub, vector<int>(N, INF_INT));\\n for (int j = 0; j < N; j++){\\n int mask = 1 << j;\\n dp[mask][j] = distMarket[j];\\n }\\n for (int mask = 0; mask < totSub; mask++){\\n for (int j = 0; j < N; j++){\\n if(!(mask & (1 << j))) continue;\\n for (int k = 0; k < N; k++){\\n if(mask & (1 << k)) continue;\\n int nextMask = mask | (1 << k);\\n dp[nextMask][k] = min(dp[nextMask][k], dp[mask][j] + distTown[j][k]);\\n }\\n }\\n }\\n vector<int> cycleTime(totSub, INF_INT); \\n for (int mask = 1; mask < totSub; mask++){\\n int best = INF_INT;\\n for (int j = 0; j < N; j++){\\n if(mask & (1 << j))\\n best = min(best, dp[mask][j] + distMarket[j]);\\n }\\n cycleTime[mask] = best;\\n }\\n \\n vector<pair<int, ll>> cycles;\\n for (int mask = 1; mask < totSub; mask++){\\n const int INF_PRICE = 1000000000;\\n vector<int> bestPrice(M, INF_PRICE);\\n for (int j = 0; j < N; j++){\\n if(mask & (1 << j)){\\n for(auto &offer : towns[j].offers){\\n int pidx = offer.prodIndex;\\n bestPrice[pidx] = min(bestPrice[pidx], offer.price);\\n }\\n }\\n }\\n vector<pair<int,int>> items;\\n for (int i = 0; i < M; i++){\\n if(bestPrice[i] < INF_PRICE){\\n int prodProfit = products[i].marketPrice - bestPrice[i];\\n if(prodProfit > 0)\\n items.push_back({products[i].weight, prodProfit});\\n }\\n }\\n if(items.size() == 0) continue;\\n \\n vector<ll> knap(W+1, NEG_INF_LL);\\n knap[0] = 0;\\n for (int w = 0; w <= W; w++){\\n if(knap[w] == NEG_INF_LL) continue;\\n for(auto &it : items){\\n int wt = it.first, prof = it.second;\\n if(w + wt <= W) knap[w+wt] = max(knap[w+wt], knap[w] + prof);\\n }\\n }\\n ll bestCycleProfit = 0;\\n for (int w = 0; w <= W; w++)\\n bestCycleProfit = max(bestCycleProfit, knap[w]);\\n if(bestCycleProfit > 0){\\n int tCycle = cycleTime[mask];\\n cycles.push_back({tCycle, bestCycleProfit});\\n }\\n }\\n \\n vector<ll> dpTime(T+1, NEG_INF_LL);\\n dpTime[0] = 0;\\n for (int t = 0; t <= T; t++){\\n if(dpTime[t] == NEG_INF_LL) continue;\\n for(auto &cycle : cycles){\\n int ct = cycle.first;\\n ll cp = cycle.second;\\n if(t + ct <= T) dpTime[t+ct] = max(dpTime[t+ct], dpTime[t] + cp);\\n }\\n }\\n ll ans = 0;\\n for (int t = 0; t <= T; t++) ans = max(ans, dpTime[t]);\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.027,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2296_9759438\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\n ll N, M, W, T;\\n cin >> N >> M >> W >> T;\\n map<string,int> mps;\\n vector<ll> V(M), P(M);\\n rep(i,0,M) {\\n string _;\\n cin >> _;\\n mps[_] = i;\\n cin >> V[i] >> P[i];\\n }\\n vector<ll> X(N), Y(N);\\n vector<vector<ll>> R(N), Q(N);\\n rep(i,0,N) {\\n int L;\\n cin >> L;\\n cin >> X[i] >> Y[i];\\n R[i].resize(L);\\n Q[i].resize(L);\\n rep(j,0,L) {\\n string s;\\n cin >> s;\\n R[i][j] = mps[s];\\n cin >> Q[i][j];\\n }\\n }\\n auto dist = [&](int i, int j) -> ll {return abs(X[i]-X[j])+abs(Y[i]-Y[j]);};\\n vector<ll> Len(1<<N,INF);\\n {\\n vector<vector<ll>> DP(1<<N,vector<ll>(N,INF));\\n rep(i,0,N) DP[1<<i][i] = abs(X[i]) + abs(Y[i]);\\n rep(i,1,1<<N) {\\n rep(j,0,N) {\\n if (DP[i][j] == INF) continue;\\n rep(k,0,N) {\\n if (i & (1<<k)) continue;\\n chmin(DP[i|(1<<k)][k], DP[i][j]+dist(j,k));\\n }\\n }\\n }\\n rep(i,1,1<<N) {\\n rep(j,0,N) {\\n if (i&(1<<j)) {\\n chmin(Len[i], DP[i][j]+abs(X[j])+abs(Y[j]));\\n }\\n }\\n }\\n }\\n vector<ll> Price(1<<N,INF);\\n rep(i,1,1<<N) {\\n vector<ll> Cost(M,0);\\n rep(j,0,N) {\\n if (i&(1<<j)) {\\n rep(k,0,R[j].size()) {\\n chmax(Cost[R[j][k]], P[R[j][k]]-Q[j][k]);\\n }\\n }\\n }\\n vector<ll> DP(W+1,0);\\n rep(j,0,M) {\\n rep(k,0,W+1) {\\n if (k+V[j] <= W) chmax(DP[k+V[j]], DP[k]+Cost[j]);\\n }\\n }\\n Price[i] = DP[W];\\n }\\n {\\n vector<ll> DP(T+1,0);\\n rep(i,1,1<<N) {\\n rep(j,0,T+1) {\\n if (j+(int)Len[i]<=T) chmax(DP[j+Len[i]], DP[j]+Price[i]);\\n }\\n }\\n cout << DP[T] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.0193,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2296_9026285\",\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\\ni64 knapsack(const vector<pair<int,int>>& wv, int W) {\\n const int n = wv.size();\\n vector dp(n + 1, vector(W + 1, i64(0)));\\n for(int i : rep(n)) {\\n auto [w, v] = wv[i];\\n for(int s = 0; s <= W; s++) {\\n chmax(dp[i + 1][s], dp[i][s]);\\n if(0 <= s - w) chmax(dp[i + 1][s], dp[i + 1][s - w] + v);\\n }\\n }\\n return dp[n][W];\\n}\\n\\nint main() {\\n int N = in(), M = in(), W = in(), T = in();\\n map<string, pair<int,int>> item;\\n for(int i : rep(M)) {\\n string s = in(); int w = in(), v = in();\\n item[s] = {w, v};\\n }\\n\\n vector<pair<int,int>> pos(N);\\n vector<vector<pair<int,int>>> city(N);\\n for(int i : rep(N)) {\\n int L = in(), x = in(), y = in();\\n pos[i] = {x, y};\\n for(int j : rep(L)) {\\n string s = in(); int p = in();\\n auto [w, v] = item[s];\\n city[i].push_back({w, v - p});\\n }\\n }\\n\\n vector<pair<int,int>> b;\\n for(int S : rep(1 << N)) if(S != 0) {\\n vector<int> I;\\n for(int i : rep(N)) if(S & (1 << i)) I.push_back(i);\\n const int len = I.size();\\n int TS = 1e9;\\n do {\\n int cur = 0;\\n cur += abs(pos[I[0]].first - 0) + abs(pos[I[0]].second - 0);\\n for(int i : rep(len - 1)) \\n cur += abs(pos[I[i]].first - pos[I[i + 1]].first) + abs(pos[I[i]].second - pos[I[i + 1]].second);\\n cur += abs(pos[I[len - 1]].first - 0) + abs(pos[I[len - 1]].second - 0);\\n chmin(TS, cur);\\n } while(next_permutation(I.begin(), I.end()));\\n\\n vector<pair<int,int>> a;\\n for(int i : I) a.insert(a.end(), city[i].begin(), city[i].end());\\n int VS = knapsack(a, W);\\n b.push_back({TS, VS});\\n }\\n\\n print(knapsack(b, T));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 13244,\n \"score_of_the_acc\": -1.7089,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2296_9026283\",\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 knapsack(const vector<pair<int,int>>& wv, int W) {\\n const int n = wv.size();\\n vector dp(n + 1, vector(W + 1, 0));\\n for(int i : rep(n)) {\\n auto [w, v] = wv[i];\\n for(int s = 0; s <= W; s++) {\\n chmax(dp[i + 1][s], dp[i][s]);\\n if(0 <= s - w) chmax(dp[i + 1][s], dp[i + 1][s - w] + v);\\n }\\n }\\n return dp[n][W];\\n}\\n\\nint main() {\\n int N = in(), M = in(), W = in(), T = in();\\n map<string, pair<int,int>> item;\\n for(int i : rep(M)) {\\n string s = in(); int w = in(), v = in();\\n item[s] = {w, v};\\n }\\n\\n vector<pair<int,int>> pos(N);\\n vector<vector<pair<int,int>>> city(N);\\n for(int i : rep(N)) {\\n int L = in(), x = in(), y = in();\\n pos[i] = {x, y};\\n for(int j : rep(L)) {\\n string s = in(); int p = in();\\n auto [w, v] = item[s];\\n city[i].push_back({w, v - p});\\n }\\n }\\n\\n vector<pair<int,int>> b;\\n for(int S : rep(1 << N)) if(S != 0) {\\n vector<int> I;\\n for(int i : rep(N)) if(S & (1 << i)) I.push_back(i);\\n const int len = I.size();\\n int TS = 1e9;\\n do {\\n int cur = 0;\\n cur += abs(pos[I[0]].first - 0) + abs(pos[I[0]].second - 0);\\n for(int i : rep(len - 1)) \\n cur += abs(pos[I[i]].first - pos[I[i + 1]].first) + abs(pos[I[i]].second - pos[I[i + 1]].second);\\n cur += abs(pos[I[len - 1]].first - 0) + abs(pos[I[len - 1]].second - 0);\\n chmin(TS, cur);\\n } while(next_permutation(I.begin(), I.end()));\\n\\n vector<pair<int,int>> a;\\n for(int i : I) a.insert(a.end(), city[i].begin(), city[i].end());\\n int VS = knapsack(a, W);\\n b.push_back({TS, VS});\\n }\\n\\n print(knapsack(b, T));\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 60,\n \"memory_kb\": 8076,\n \"score_of_the_acc\": -0.8419,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2296_6823338\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=2167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (ll i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tsolve();\\n}\\n\\nvoid solve(){\\n\\tint N,M,W,T;\\n\\tcin>>N>>M>>W>>T;\\n\\tmap<string,pair<int,int>> m;\\n\\tauto dp=[](int lim,vector<pair<int,ll>> p)->ll{\\n\\t\\tvector<ll> ans(lim+1);\\n\\t\\tfor(auto x:p){\\n\\t\\t\\tint ind=0;\\n\\t\\t\\twhile(ind+x.first<=lim){\\n\\t\\t\\t\\tchmax(ans[ind+x.first],ans[ind]+x.second);\\n\\t\\t\\t\\tind++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ans[lim];\\n\\t};\\n\\tvector<int> X(N+1),Y(N+1);\\n\\tvector<vector<int>> dist(N+1,vector<int>(N+1));\\n\\trep(i,M){\\n\\t\\tstring S;\\n\\t\\tint v,p;\\n\\t\\tcin>>S>>v>>p;\\n\\t\\tm[S]={v,p};\\n\\t}\\n\\tvector<vector<pair<int,int>>> buy(N);\\n\\trep(i,N){\\n\\t\\tint L;\\n\\t\\tcin>>L>>X[i]>>Y[i];\\n\\t\\trep(j,L){\\n\\t\\t\\tstring S;int p;\\n\\t\\t\\tcin>>S>>p;\\n\\t\\t\\tbuy[i].push_back({m[S].first,m[S].second-p});\\n\\t\\t}\\n\\t}\\n\\tvector<pair<int,ll>> runner;\\n\\trep(i,N+1) rep(j,N+1) dist[i][j]=(abs(X[i]-X[j])+abs(Y[i]-Y[j]));\\n\\trep(i,(1<<N)){\\n\\t\\tif(i==0) continue;\\n\\t\\tvector<pair<int,ll>> cost;\\n\\t\\tvector<int> ind;\\n\\t\\tint K=0;\\n\\t\\trep(j,N){\\n\\t\\t\\tif(i&(1<<j)){\\n\\t\\t\\t\\tfor(auto x:buy[j]) cost.push_back(x);\\n\\t\\t\\t\\tind.push_back(j);K++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<int>> sale(K,vector<int>(1<<K,INF));\\n\\t\\trep(j,K) sale[j][(1<<j)]=dist[ind[j]][N];\\n\\t\\trep(k,(1<<K)) rep(j,K){\\n\\t\\t\\tif(sale[j][k]==INF) continue;\\n\\t\\t\\trep(l,K){\\n\\t\\t\\t\\tif(((1<<l)&k)==0){\\n\\t\\t\\t\\t\\tchmin(sale[l][k+(1<<l)],sale[j][k]+dist[ind[j]][ind[l]]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint t=INF;\\n\\t\\trep(j,K) chmin(t,sale[j][(1<<K)-1]+dist[ind[j]][N]);\\n\\t\\trunner.push_back({t,dp(W,cost)});\\n\\t}\\n\\t//for(auto x:runner) cout<<x.first<<\\\" \\\"<<x.second<<\\\"\\\\n\\\";\\n\\tcout<<dp(T,runner)<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.1207,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2296_6823297\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#define _GLIBCXX_DEBUG\\nusing namespace std;\\nusing std::cout;\\nusing std::cin;\\nusing std::endl;\\nusing ll=long long;\\nusing ld=long double;\\nll ILL=2167167167167167167;\\nconst int INF=2100000000;\\nconst ll mod=998244353;\\n#define rep(i,a) for (ll i=0;i<a;i++)\\n#define all(p) p.begin(),p.end()\\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\\nvoid yneos(bool a){if(a) cout<<\\\"Yes\\\\n\\\"; else cout<<\\\"No\\\\n\\\";}\\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\\\" \\\";cout<<p[i];}cout<<\\\"\\\\n\\\";}\\n\\n\\n\\nvoid solve();\\n// oddloop\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\t\\n\\tsolve();\\n}\\n\\nvoid solve(){\\n\\tint N,M,W,T;\\n\\tcin>>N>>M>>W>>T;\\n\\tmap<string,pair<int,int>> m;\\n\\tauto dp=[](int lim,vector<pair<int,int>> p)->int{\\n\\t\\tvector<int> ans(lim+1);\\n\\t\\tfor(auto x:p){\\n\\t\\t\\tint ind=0;\\n\\t\\t\\twhile(ind+x.first<=lim){\\n\\t\\t\\t\\tchmax(ans[ind+x.first],ans[ind]+x.second);\\n\\t\\t\\t\\tind++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ans[lim];\\n\\t};\\n\\tvector<int> X(N+1),Y(N+1);\\n\\tvector<vector<int>> dist(N+1,vector<int>(N+1));\\n\\trep(i,M){\\n\\t\\tstring S;\\n\\t\\tint v,p;\\n\\t\\tcin>>S>>v>>p;\\n\\t\\tm[S]={v,p};\\n\\t}\\n\\tvector<vector<pair<int,int>>> buy(N);\\n\\trep(i,N){\\n\\t\\tint L;\\n\\t\\tcin>>L>>X[i]>>Y[i];\\n\\t\\trep(j,L){\\n\\t\\t\\tstring S;int p;\\n\\t\\t\\tcin>>S>>p;\\n\\t\\t\\tbuy[i].push_back({m[S].first,m[S].second-p});\\n\\t\\t}\\n\\t}\\n\\tvector<pair<int,int>> runner;\\n\\trep(i,N+1) rep(j,N+1) dist[i][j]=(abs(X[i]-X[j])+abs(Y[i]-Y[j]));\\n\\trep(i,(1<<N)){\\n\\t\\tif(i==0) continue;\\n\\t\\tvector<pair<int,int>> cost;\\n\\t\\tvector<int> ind;\\n\\t\\tint K=0;\\n\\t\\trep(j,N){\\n\\t\\t\\tif(i&(1<<j)){\\n\\t\\t\\t\\tfor(auto x:buy[j]) cost.push_back(x);\\n\\t\\t\\t\\tind.push_back(j);K++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<vector<int>> sale(K,vector<int>(1<<K,INF));\\n\\t\\trep(j,K) sale[j][(1<<j)]=dist[ind[j]][N];\\n\\t\\trep(k,(1<<K)) rep(j,K){\\n\\t\\t\\tif(sale[j][k]==INF) continue;\\n\\t\\t\\trep(l,K){\\n\\t\\t\\t\\tif(((1<<l)&k)==0){\\n\\t\\t\\t\\t\\tchmin(sale[l][k+(1<<l)],sale[j][k]+dist[ind[j]][ind[l]]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint t=INF;\\n\\t\\trep(j,K) chmin(t,sale[j][(1<<K)-1]+dist[ind[j]][N]);\\n\\t\\trunner.push_back({t,dp(W,cost)});\\n\\t}\\n\\t//for(auto x:runner) cout<<x.first<<\\\" \\\"<<x.second<<\\\"\\\\n\\\";\\n\\tcout<<dp(T,runner)<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 20,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.1099,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2296_6439222\",\n \"code_snippet\": \"#line 1 \\\"a.cpp\\\"\\n#define PROBLEM \\\"\\\"\\n#line 2 \\\"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\\\"\\n#pragma GCC target(\\\"avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#line 2 \\\"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T, class U>\\nbool chmax(T &a, const U &b) {\\n return a < b ? a = b, true : false;\\n}\\ntemplate <class T, class U>\\nbool chmin(T &a, const U &b) {\\n return b < a ? a = b, true : false;\\n}\\nconstexpr int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr int MOD = 1000000007;\\nconstexpr int MOD_N = 998244353;\\nconstexpr double EPS = 1e-7;\\nconst double PI = acos(-1.0);\\n#line 6 \\\"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\\\"\\nusing ll = int64_t;\\nusing ld = long double;\\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()\\ntemplate<class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) { is >> p.first >> p.second; return is; }\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &i : v) is>>i; return is; }\\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; } return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head&& head, Tail&&... tail) {\\n if constexpr(sizeof...(tail)==0) std::cout<<head<<'\\\\n'; else std::cout<<head<<' ',co(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'; else std::cerr<<head<<' ',ce(forward<Tail>(tail)...);\\n}\\ntemplate<typename T, typename... Args>\\nauto make_vector(T x, int arg, Args ...args) {\\n if constexpr(sizeof...(args)==0) return std::vector<T>(arg,x); else return std::vector(arg,make_vector<T>(x,args...));\\n}\\nvoid sonic() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); }\\nvoid setp(const int n) { std::cout<<std::fixed<<std::setprecision(n); }\\nvoid Yes(bool is_correct) { std::cout<<(is_correct?\\\"Yes\\\":\\\"No\\\")<<std::endl; }\\nvoid YES(bool is_correct) { std::cout<<(is_correct?\\\"YES\\\":\\\"NO\\\")<<std::endl; }\\n#line 3 \\\"a.cpp\\\"\\n\\nint main(void) {\\n#define int ll\\n sonic();\\n int n, m, w, t;\\n cin >> n >> m >> w >> t;\\n unordered_map<string, pair<int, int>> mp;\\n rep(i, m) {\\n string s;\\n int v, p;\\n cin >> s >> v >> p;\\n mp[s] = {v, p};\\n }\\n vector<int> l(n), x(n), y(n);\\n vector<vector<int>> v(n), q(n);\\n rep(i, n) {\\n cin >> l[i] >> x[i] >> y[i];\\n v[i].resize(l[i]);\\n q[i].resize(l[i]);\\n rep(j, l[i]) {\\n string s;\\n cin >> s >> q[i][j];\\n v[i][j] = mp[s].first;\\n q[i][j] = mp[s].second - q[i][j];\\n }\\n }\\n\\n vector<int> idx(n);\\n iota(all(idx), 0);\\n\\n vector<int> tm(1 << n, Inf);\\n do {\\n int s = 0;\\n int xx = 0, yy = 0;\\n int b = 0;\\n for (auto i : idx) {\\n b |= 1 << i;\\n s += abs(xx - x[i]) + abs(yy - y[i]);\\n xx = x[i], yy = y[i];\\n chmin(tm[b], s + abs(xx) + abs(yy));\\n }\\n } while (next_permutation(all(idx)));\\n\\n vector<int> ans(t + 1);\\n rep(bit, 1 << n) {\\n vector<int> dp(w + 1);\\n rep(i, n) {\\n if (!(bit >> i & 1))\\n continue;\\n rep(j, l[i]) {\\n rep(k, w - v[i][j] + 1) {\\n chmax(dp[k + v[i][j]], dp[k] + q[i][j]);\\n }\\n }\\n }\\n if (tm[bit] <= t)\\n chmax(ans[tm[bit]], *max_element(all(dp)));\\n }\\n\\n repn(i, t) {\\n rep(j, t + 1 - i) chmax(ans[j + i], ans[j] + ans[i]);\\n }\\n co(*max_element(all(ans)));\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -0.5241,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2296_6439220\",\n \"code_snippet\": \"#line 1 \\\"a.cpp\\\"\\n#define PROBLEM \\\"\\\"\\n#line 2 \\\"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\\\"\\n#pragma GCC target(\\\"avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#line 2 \\\"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T, class U>\\nbool chmax(T &a, const U &b) {\\n return a < b ? a = b, true : false;\\n}\\ntemplate <class T, class U>\\nbool chmin(T &a, const U &b) {\\n return b < a ? a = b, true : false;\\n}\\nconstexpr int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr int MOD = 1000000007;\\nconstexpr int MOD_N = 998244353;\\nconstexpr double EPS = 1e-7;\\nconst double PI = acos(-1.0);\\n#line 6 \\\"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\\\"\\nusing ll = int64_t;\\nusing ld = long double;\\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()\\ntemplate<class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) { is >> p.first >> p.second; return is; }\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &i : v) is>>i; return is; }\\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; } return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head&& head, Tail&&... tail) {\\n if constexpr(sizeof...(tail)==0) std::cout<<head<<'\\\\n'; else std::cout<<head<<' ',co(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'; else std::cerr<<head<<' ',ce(forward<Tail>(tail)...);\\n}\\ntemplate<typename T, typename... Args>\\nauto make_vector(T x, int arg, Args ...args) {\\n if constexpr(sizeof...(args)==0) return std::vector<T>(arg,x); else return std::vector(arg,make_vector<T>(x,args...));\\n}\\nvoid sonic() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); }\\nvoid setp(const int n) { std::cout<<std::fixed<<std::setprecision(n); }\\nvoid Yes(bool is_correct) { std::cout<<(is_correct?\\\"Yes\\\":\\\"No\\\")<<std::endl; }\\nvoid YES(bool is_correct) { std::cout<<(is_correct?\\\"YES\\\":\\\"NO\\\")<<std::endl; }\\n#line 3 \\\"a.cpp\\\"\\n\\nint main(void) {\\n sonic();\\n int n, m, w, t;\\n cin >> n >> m >> w >> t;\\n unordered_map<string, pair<int, int>> mp;\\n rep(i, m) {\\n string s;\\n int v, p;\\n cin >> s >> v >> p;\\n mp[s] = {v, p};\\n }\\n vector<int> l(n), x(n), y(n);\\n vector<vector<int>> v(n), q(n);\\n rep(i, n) {\\n cin >> l[i] >> x[i] >> y[i];\\n v[i].resize(l[i]);\\n q[i].resize(l[i]);\\n rep(j, l[i]) {\\n string s;\\n cin >> s >> q[i][j];\\n v[i][j] = mp[s].first;\\n q[i][j] = mp[s].second - q[i][j];\\n }\\n }\\n\\n vector<int> idx(n);\\n iota(all(idx), 0);\\n\\n vector<int> tm(1 << n, Inf);\\n do {\\n int s = 0;\\n int xx = 0, yy = 0;\\n int b = 0;\\n for (auto i : idx) {\\n b |= 1 << i;\\n s += abs(xx - x[i]) + abs(yy - y[i]);\\n xx = x[i], yy = y[i];\\n chmin(tm[b], s + abs(xx) + abs(yy));\\n }\\n } while (next_permutation(all(idx)));\\n\\n vector<int> ans(t + 1);\\n rep(bit, 1 << n) {\\n vector<int> dp(w + 1);\\n rep(i, n) {\\n if (!(bit >> i & 1))\\n continue;\\n rep(j, l[i]) {\\n rep(k, w - v[i][j] + 1) {\\n chmax(dp[k + v[i][j]], dp[k] + q[i][j]);\\n }\\n }\\n }\\n if (tm[bit] <= t)\\n chmax(ans[tm[bit]], *max_element(all(dp)));\\n }\\n\\n repn(i, t) {\\n rep(j, t + 1 - i) chmax(ans[j + i], ans[j] + ans[i]);\\n }\\n co(*max_element(all(ans)));\\n\\n return 0;\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 50,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.4131,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2296_6022860\",\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\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int n, m, w, t;\\n cin >> n >> m >> w >> t;\\n map<string, pair<ll, ll>> products;\\n rep(i,0,m) {\\n string s;\\n int v, p;\\n cin >> s >> v >> p;\\n products[s] = {v, p};\\n }\\n vector<ll> x(n), y(n);\\n vector<map<string, ll>> sell(n);\\n rep(i,0,n) {\\n int l;\\n cin >> l >> x[i] >> y[i];\\n rep(j,0,l) {\\n string r;\\n int q;\\n cin >> r >> q;\\n sell[i][r] =q;\\n }\\n }\\n\\n vector<ll> cost(1<<n, 1e9), prof(1<<n);\\n\\n rep(S,1,1<<n) {\\n vector<int> visit;\\n rep(i,0,n) {\\n if (S>>i&1) visit.push_back(i);\\n }\\n int k = __builtin_popcount(S);\\n do {\\n ll d = 0;\\n d += abs(x[visit[0]]) + abs(y[visit[0]]);\\n rep(i,0,k-1) {\\n d += abs(x[visit[i+1]]-x[visit[i]]) + abs(y[visit[i+1]]-y[visit[i]]);\\n }\\n d += abs(x[visit[k-1]]) + abs(y[visit[k-1]]);\\n cost[S] = min(cost[S], d);\\n } while (next_permutation(visit.begin(), visit.end()));\\n\\n map<string, ll> min_price;\\n rep(i,0,n) {\\n if (!(S>>i&1)) continue;\\n for (auto [r, q] : sell[i]) {\\n if (!min_price.count(r)) min_price[r] = q;\\n else min_price[r] = min(min_price[r], q);\\n }\\n }\\n\\n vector<ll> dp(w+1);\\n for (auto [s, p] : min_price) {\\n auto [weight, gain] = products[s];\\n gain -= p;\\n if (gain <= 0) continue;\\n rep(j,0,w-weight+1) {\\n dp[j+weight] = max(dp[j+weight], dp[j]+gain);\\n }\\n }\\n\\n prof[S] = dp[w];\\n }\\n\\n vector<ll> dp(t+1);\\n rep(i,0,1<<n) {\\n rep(j,0,t-cost[i]+1) {\\n dp[j+cost[i]] = max(dp[j+cost[i]], dp[j]+prof[i]);\\n }\\n }\\n cout << dp[t] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": -0.0216,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2296_6022853\",\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\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int n, m, w, t;\\n cin >> n >> m >> w >> t;\\n map<string, pair<int, int>> products;\\n rep(i,0,m) {\\n string s;\\n int v, p;\\n cin >> s >> v >> p;\\n products[s] = {v, p};\\n }\\n vector<int> x(n), y(n);\\n vector<map<string, int>> sell(n);\\n rep(i,0,n) {\\n int l;\\n cin >> l >> x[i] >> y[i];\\n rep(j,0,l) {\\n string r;\\n int q;\\n cin >> r >> q;\\n sell[i][r] =q;\\n }\\n }\\n\\n vector<int> cost(1<<n, 1e9), prof(1<<n);\\n\\n rep(S,1,1<<n) {\\n vector<int> visit;\\n rep(i,0,n) {\\n if (S>>i&1) visit.push_back(i);\\n }\\n int k = __builtin_popcount(S);\\n do {\\n int d = 0;\\n d += abs(x[visit[0]]) + abs(y[visit[0]]);\\n rep(i,0,k-1) {\\n d += abs(x[visit[i+1]]-x[visit[i]]) + abs(y[visit[i+1]]-y[visit[i]]);\\n }\\n d += abs(x[visit[k-1]]) + abs(y[visit[k-1]]);\\n cost[S] = min(cost[S], d);\\n } while (next_permutation(visit.begin(), visit.end()));\\n\\n map<string, int> min_price;\\n rep(i,0,n) {\\n if (!(S>>i&1)) continue;\\n for (auto [r, q] : sell[i]) {\\n if (!min_price.count(r)) min_price[r] = q;\\n else min_price[r] = min(min_price[r], q);\\n }\\n }\\n\\n vector<int> dp(w+1);\\n for (auto [s, p] : min_price) {\\n auto [weight, gain] = products[s];\\n gain -= p;\\n if (gain <= 0) continue;\\n rep(j,0,w-weight+1) {\\n dp[j+weight] = max(dp[j+weight], dp[j]+gain);\\n }\\n }\\n\\n prof[S] = dp[w];\\n }\\n\\n vector<int> dp(t+1);\\n rep(i,0,1<<n) {\\n rep(j,0,t-cost[i]+1) {\\n dp[j+cost[i]] = max(dp[j+cost[i]], dp[j]+prof[i]);\\n }\\n }\\n cout << dp[t] << endl;\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 10,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.017,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2296_5998004\",\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;\\n\\nstruct FastIO {\\n FastIO() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n} fastiofastio;\\n\\nconst ll 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\\nstring S[7];\\nint V[7], P[7], L[7], X[7], Y[7], R[7][7], Q[7][7];\\nll ma[1 << 7], tim[1 << 7];\\nll dp[50][10001];\\nll dp2[1 << 7][10001];\\n\\nint main() {\\n int N, M, W, T;\\n cin >> N >> M >> W >> T;\\n map<string, int> idx;\\n for (int i = 0; i < M; i++) {\\n cin >> S[i] >> V[i] >> P[i];\\n idx[S[i]] = i;\\n }\\n for (int i = 0; i < N; i++) {\\n cin >> L[i] >> X[i] >> Y[i];\\n for (int j = 0; j < L[i]; j++) {\\n string s;\\n cin >> s >> Q[i][j];\\n R[i][j] = idx[s];\\n }\\n }\\n for (int bit = 0; bit < (1 << N); bit++) {\\n vector<pair<int, int>> prod;\\n for (int i = 0; i < N; i++) {\\n if ((bit & (1 << i)) == 0)\\n continue;\\n for (int j = 0; j < L[i]; j++) {\\n prod.emplace_back(V[R[i][j]], P[R[i][j]] - Q[i][j]);\\n }\\n }\\n memset(dp, 0, sizeof(dp));\\n for (int i = 0; i < prod.size(); i++) {\\n auto [v, p] = prod[i];\\n for (int j = 0; j <= W; j++) {\\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);\\n if (j >= v)\\n dp[i + 1][j] = max(dp[i + 1][j], dp[i + 1][j - v] + p);\\n }\\n }\\n for (int i = 0; i <= W; i++)\\n ma[bit] = max(ma[bit], dp[prod.size()][i]);\\n }\\n for (int bit = 0; bit < (1 << N); bit++) {\\n vector<int> perm;\\n for (int i = 0; i < N; i++) {\\n if (bit & (1 << i))\\n perm.push_back(i);\\n }\\n int mi = 1 << 30;\\n do {\\n int prevX = 0, prevY = 0;\\n int sum = 0;\\n for (int p : perm) {\\n sum += abs(X[p] - prevX) + abs(Y[p] - prevY);\\n prevX = X[p];\\n prevY = Y[p];\\n }\\n sum += abs(prevX) + abs(prevY);\\n mi = min(mi, sum);\\n } while (next_permutation(ALL(perm)));\\n tim[bit] = mi;\\n }\\n for (int i = 1; i < (1 << N); i++) {\\n for (int j = 0; j <= T; j++) {\\n dp2[i][j] = max(dp2[i][j], dp2[i - 1][j]);\\n if (j >= tim[i])\\n dp2[i][j] = max(dp2[i][j], dp2[i][j - tim[i]] + ma[i]);\\n }\\n }\\n ll ans = 0;\\n for (int i = 0; i <= T; i++)\\n ans = max(ans, dp2[(1 << N) - 1][i]);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 17344,\n \"score_of_the_acc\": -1.4,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2296_5998001\",\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;\\n\\nstruct FastIO {\\n FastIO() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n} fastiofastio;\\n\\nconst ll 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\\nstring S[7];\\nint V[7], P[7], L[7], X[7], Y[7], R[7][7], Q[7][7];\\nint ma[1 << 7], tim[1 << 7];\\nint dp[50][10001];\\nint dp2[1 << 7][10001];\\n\\nint main() {\\n int N, M, W, T;\\n cin >> N >> M >> W >> T;\\n map<string, int> idx;\\n for (int i = 0; i < M; i++) {\\n cin >> S[i] >> V[i] >> P[i];\\n idx[S[i]] = i;\\n }\\n for (int i = 0; i < N; i++) {\\n cin >> L[i] >> X[i] >> Y[i];\\n for (int j = 0; j < L[i]; j++) {\\n string s;\\n cin >> s >> Q[i][j];\\n R[i][j] = idx[s];\\n }\\n }\\n for (int bit = 0; bit < (1 << N); bit++) {\\n vector<pair<int, int>> prod;\\n for (int i = 0; i < N; i++) {\\n if ((bit & (1 << i)) == 0)\\n continue;\\n for (int j = 0; j < L[i]; j++) {\\n prod.emplace_back(V[R[i][j]], P[R[i][j]] - Q[i][j]);\\n }\\n }\\n memset(dp, 0, sizeof(dp));\\n for (int i = 0; i < prod.size(); i++) {\\n auto [v, p] = prod[i];\\n for (int j = 0; j <= W; j++) {\\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);\\n if (j >= v)\\n dp[i + 1][j] = max(dp[i + 1][j], dp[i + 1][j - v] + p);\\n }\\n }\\n for (int i = 0; i <= W; i++)\\n ma[bit] = max(ma[bit], dp[prod.size()][i]);\\n }\\n for (int bit = 0; bit < (1 << N); bit++) {\\n vector<int> perm;\\n for (int i = 0; i < N; i++) {\\n if (bit & (1 << i))\\n perm.push_back(i);\\n }\\n int mi = 1 << 30;\\n do {\\n int prevX = 0, prevY = 0;\\n int sum = 0;\\n for (int p : perm) {\\n sum += abs(X[p] - prevX) + abs(Y[p] - prevY);\\n prevX = X[p];\\n prevY = Y[p];\\n }\\n sum += abs(prevX) + abs(prevY);\\n mi = min(mi, sum);\\n } while (next_permutation(ALL(perm)));\\n tim[bit] = mi;\\n }\\n for (int i = 1; i < (1 << N); i++) {\\n for (int j = 0; j <= T; j++) {\\n dp2[i][j] = max(dp2[i][j], dp2[i - 1][j]);\\n if (j >= tim[i])\\n dp2[i][j] = max(dp2[i][j], dp2[i][j - tim[i]] + ma[i]);\\n }\\n }\\n int ans = 0;\\n for (int i = 0; i <= T; i++)\\n ans = max(ans, dp2[(1 << N) - 1][i]);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 50,\n \"memory_kb\": 10320,\n \"score_of_the_acc\": -0.9013,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2296_5943056\",\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>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\n\\nint n;\\nint x[8],y[8];\\nint dp[1<<8][8];\\nint min_time[1<<7];\\n\\nvoid TSP(){\\n n++;\\n for(int i=0;i<(1<<n);i++){\\n for(int j=0;j<n;j++){\\n dp[i][j] = (1<<30);\\n }\\n }\\n n--;\\n dp[0][n] = 0;\\n n++;\\n for(int i=0;i<(1<<n);i++){\\n for(int j=0;j<n;j++){\\n if(dp[i][j] == (1<<30)) continue;\\n for(int k=0;k<n;k++){\\n if((1<<k)&i)continue;\\n int nx = (1<<k)|i;\\n int cost = dp[i][j] + abs(x[j]-x[k]) + abs(y[j]-y[k]);\\n dp[nx][k] = min(dp[nx][k], cost);\\n }\\n }\\n } \\n n--;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int m,W,T; cin >> n >> m >> W >> T;\\n map<string,int> to_id;\\n vector<int> v(m),p(m);\\n for(int i=0;i<m;i++){\\n string s; cin >> s;\\n to_id[s] = i;\\n cin >> v[i] >> p[i];\\n }\\n vector<vector<pair<int,int>>> pro(n);\\n for(int i=0;i<n;i++){\\n int L; cin >> L;\\n cin >> x[i] >> y[i];\\n for(int j=0;j<L;j++){\\n string r; cin >> r;\\n int q; cin >> q;\\n pro[i].push_back({to_id[r],q});\\n }\\n }\\n x[n] = y[n] = 0;\\n TSP();\\n for(int i=1;i<(1<<n);i++){\\n min_time[i] = dp[i+(1<<n)][n];\\n }\\n vector<int> opt(1<<n);\\n for(int i=1;i<(1<<n);i++){\\n if(min_time[i]>T)continue;\\n int bit = 0;\\n vector<int> cost(m,1<<30);\\n for(int j=0;j<n;j++){\\n if((1<<j)&i){\\n for(auto &p:pro[j]){\\n bit |= (1<<p.first);\\n cost[p.first] = min(cost[p.first],p.second);\\n }\\n }\\n }\\n vector<ll> dp2(W+1);\\n for(int j=1;j<=W;j++){\\n dp2[j] = max(dp2[j], dp2[j-1]);\\n for(int k=0;k<m;k++){\\n if((1<<k)&bit){\\n if(j>=v[k]){\\n dp2[j] = max(dp2[j], dp2[j-v[k]]+p[k]-cost[k]);\\n }\\n }\\n }\\n }\\n opt[i] = dp2.back();\\n }\\n vector<ll> dp3(T+1);\\n for(int i=1;i<=T;i++){\\n dp3[i] = max(dp3[i],dp3[i-1]);\\n for(int j=1;j<(1<<n);j++){\\n if(i-min_time[j]>=0){\\n dp3[i] = max(dp3[i], dp3[i-min_time[j]]+opt[j]);\\n }\\n }\\n }\\n cout << dp3.back() << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.0196,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2296_5943051\",\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>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\n\\nint n;\\nint x[8],y[8];\\nint dp[1<<8][8];\\nint min_time[1<<7];\\n\\nvoid TSP(){\\n n++;\\n for(int i=0;i<(1<<n);i++){\\n for(int j=0;j<n;j++){\\n dp[i][j] = (1<<30);\\n }\\n }\\n n--;\\n dp[0][n] = 0;\\n n++;\\n for(int i=0;i<(1<<n);i++){\\n for(int j=0;j<n;j++){\\n if(dp[i][j] == (1<<30)) continue;\\n for(int k=0;k<n;k++){\\n if((1<<k)&i)continue;\\n int nx = (1<<k)|i;\\n int cost = dp[i][j] + abs(x[j]-x[k]) + abs(y[j]-y[k]);\\n dp[nx][k] = min(dp[nx][k], cost);\\n }\\n }\\n } \\n n--;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int m,W,T; cin >> n >> m >> W >> T;\\n map<string,int> to_id;\\n vector<int> v(m),p(m);\\n for(int i=0;i<m;i++){\\n string s; cin >> s;\\n to_id[s] = i;\\n cin >> v[i] >> p[i];\\n }\\n vector<vector<pair<int,int>>> pro(n);\\n for(int i=0;i<n;i++){\\n int L; cin >> L;\\n cin >> x[i] >> y[i];\\n for(int j=0;j<L;j++){\\n string r; cin >> r;\\n int q; cin >> q;\\n pro[i].push_back({to_id[r],q});\\n }\\n }\\n x[n] = y[n] = 0;\\n TSP();\\n for(int i=1;i<(1<<n);i++){\\n min_time[i] = dp[i+(1<<n)][n];\\n }\\n vector<int> opt(1<<n);\\n for(int i=1;i<(1<<n);i++){\\n if(min_time[i]>T)continue;\\n int bit = 0;\\n vector<int> cost(m,1<<30);\\n for(int j=0;j<n;j++){\\n if((1<<j)&i){\\n for(auto &p:pro[j]){\\n bit |= (1<<p.first);\\n cost[p.first] = min(cost[p.first],p.second);\\n }\\n }\\n }\\n vector<int> dp2(W+1);\\n for(int j=1;j<=W;j++){\\n dp2[j] = max(dp2[j], dp2[j-1]);\\n for(int k=0;k<m;k++){\\n if((1<<k)&bit){\\n if(j>=v[k]){\\n dp2[j] = max(dp2[j], dp2[j-v[k]]+p[k]-cost[k]);\\n }\\n }\\n }\\n }\\n opt[i] = dp2.back();\\n }\\n vector<int> dp3(T+1);\\n for(int i=1;i<=T;i++){\\n dp3[i] = max(dp3[i],dp3[i-1]);\\n for(int j=1;j<(1<<n);j++){\\n if(i-min_time[j]>=0){\\n dp3[i] = max(dp3[i], dp3[i-min_time[j]]+opt[j]);\\n }\\n }\\n }\\n cout << dp3.back() << endl;\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 10,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.0131,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2296_5870687\",\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;\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nint main(){\\n int n,m,w,t; cin >> n >> m >> w >> t;\\n map<string,int> mp;\\n vl v(m),p(m);\\n rep(i,m){\\n string s;\\n cin >> s >> v[i] >> p[i];\\n mp[s] = i;\\n }\\n vector<vpl> z(n);\\n vl x(n),y(n);\\n rep(i,n){\\n int l; cin >> l;\\n cin >> x[i] >> y[i];\\n z[i].resize(l);\\n rep(j,l){\\n string r; cin >> r;\\n int q; cin >> q;\\n z[i][j] = {mp[r],q};\\n }\\n }\\n vl dp(t+1,-linf);\\n dp[0] = 0;\\n REP(bit,1,1<<n){\\n vl a;\\n rep(i,n) if(bit>>i & 1) a.push_back(i);\\n ll d = inf;\\n int m = a.size();\\n do{\\n ll cd = abs(x[a[0]]) + abs(y[a[0]]);\\n rep(i,m-1){\\n cd += abs(x[a[i]]-x[a[i+1]]) + abs(y[a[i]]-y[a[i+1]]);\\n }\\n cd += abs(x[a[m-1]]) + abs(y[a[m-1]]);\\n chmin(d,cd);\\n }while(next_permutation(all(a)));\\n vl ep(w+1,-linf);\\n ep[0] = 0;\\n rep(i,n){\\n if(bit>>i & 1 ^ 1) continue;\\n for(auto b : z[i]){\\n rep(j,w){\\n if(j+v[b.first] > w) break;\\n chmax(ep[j+v[b.first]], ep[j] + p[b.first] - b.second);\\n }\\n }\\n }\\n ll mx = *max_element(all(ep));\\n rep(i,t){\\n if(i+d > t) break;\\n chmax(dp[i+d], dp[i]+mx);\\n }\\n }\\n cout << *max_element(all(dp)) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.1239,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2296_5252814\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <string>\\n#include <map>\\n\\nusing namespace std;\\nusing lint = long long;\\n\\nconstexpr int INF = 1 << 30;\\n\\nvoid solve() {\\n int n, m, wmax, t;\\n cin >> n >> m >> wmax >> t;\\n\\n map<string, int> id;\\n vector<int> ws(m);\\n vector<lint> vs(m);\\n for (int i = 0; i < m; ++i) {\\n string s;\\n cin >> s >> ws[i] >> vs[i];\\n id[s] = i;\\n }\\n\\n vector<pair<int, int>> pos(n);\\n vector<vector<pair<int, lint>>> pss(n); // weight, value\\n for (int i = 0; i < n; ++i) {\\n int k;\\n {\\n auto& [x, y] = pos[i];\\n cin >> k >> x >> y;\\n }\\n\\n while (k--) {\\n string s;\\n lint v;\\n cin >> s >> v;\\n int j = id[s];\\n\\n v = vs[j] - v;\\n if (v > 0) pss[i].emplace_back(ws[j], v);\\n }\\n }\\n\\n vector<pair<int, lint>> ps; // dist, value\\n for (int b = 1; b < (1 << n); ++b) {\\n vector<int> is;\\n for (int i = 0; i < n; ++i) {\\n if ((b >> i) & 1) is.push_back(i);\\n }\\n\\n int dmin = INF;\\n do {\\n int px = 0, py = 0;\\n\\n int d = 0;\\n for (auto i : is) {\\n auto [x, y] = pos[i];\\n d += abs(x - px) + abs(y - py);\\n px = x, py = y;\\n }\\n\\n d += abs(px) + abs(py);\\n dmin = min(dmin, d);\\n } while (next_permutation(is.begin(), is.end()));\\n\\n vector<lint> dp(wmax + 1, 0);\\n for (auto i : is) {\\n for (auto [w, v] : pss[i]) {\\n for (int x = w; x <= wmax; ++x) {\\n dp[x] = max(dp[x], dp[x - w] + v);\\n }\\n }\\n }\\n\\n ps.emplace_back(dmin, dp.back());\\n }\\n\\n vector<lint> dp(t + 1, 0);\\n for (auto [d, v] : ps) {\\n for (int x = d; x <= t; ++x) {\\n dp[x] = max(dp[x], dp[x - d] + v);\\n }\\n }\\n cout << dp.back() << \\\"\\\\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\": 50,\n \"memory_kb\": 3624,\n \"score_of_the_acc\": -0.4258,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2296_5130422\",\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 ALL(v) v.begin(),v.end()\\n\\n#define int long long\\nstruct G{int w,v;};\\ntemplate<typename T>\\nvoid chmax(T &a,T b){\\n if(a<b)a=b;\\n}\\ntemplate<typename T>\\nvoid chmin(T &a,T b){\\n if(a>b)a=b;\\n}\\n\\nsigned main(){\\n int n,m,W,T;cin>>n>>m>>W>>T;\\n map<string,int> mp;\\n vector<int> v(m),p(m);\\n REP(i,m){\\n string s;cin>>s>>v[i]>>p[i];\\n mp[s]=i;\\n }\\n vector<int> x(n),y(n);\\n vector<G> s[n];\\n REP(i,n){\\n int l;cin>>l>>x[i]>>y[i];\\n REP(j,l){\\n string tmp;int tmpv;\\n cin>>tmp>>tmpv;\\n if(p[mp[tmp]]>tmpv)\\n s[i].push_back({v[mp[tmp]],p[mp[tmp]]-tmpv});\\n }\\n }\\n vector<int> tme(1<<n,T+1),idx(n);\\n tme[0]=0;\\n REP(i,n)idx[i]=i;\\n do{\\n int visit=0,nowtime=0,nowy=0,nowx=0;\\n REP(i,n){\\n visit+=1<<idx[i];\\n nowtime+=abs(nowy-y[idx[i]])+abs(nowx-x[idx[i]]);\\n nowy=y[idx[i]],nowx=x[idx[i]];\\n chmin(tme[visit],nowtime+abs(nowy)+abs(nowx));\\n }\\n }while(next_permutation(ALL(idx)));\\n vector<int> va(T+1,0);\\n REP(bit,1<<n){\\n if(tme[bit]>T)continue;\\n vector<int> a(W+1,0);\\n REP(i,n)\\n if((bit>>i)&1)\\n for(auto g:s[i])\\n REP(j,W-g.w+1)chmax(a[j+g.w],a[j]+g.v);\\n chmax(va[tme[bit]],a[W]);\\n }\\n vector<int> ans(T+1,0);\\n REP(i,T+1)\\n REP(j,T+1-i)\\n chmax(ans[i+j],ans[j]+va[i]);\\n cout<<ans[T]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.506,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2296_5130418\",\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 ALL(v) v.begin(),v.end()\\n\\nstruct G{int w,v;};\\ntemplate<typename T>\\nvoid chmax(T &a,T b){\\n if(a<b)a=b;\\n}\\ntemplate<typename T>\\nvoid chmin(T &a,T b){\\n if(a>b)a=b;\\n}\\n\\nsigned main(){\\n int n,m,W,T;cin>>n>>m>>W>>T;\\n map<string,int> mp;\\n vector<int> v(m),p(m);\\n REP(i,m){\\n string s;cin>>s>>v[i]>>p[i];\\n mp[s]=i;\\n }\\n vector<int> x(n),y(n);\\n vector<G> s[n];\\n REP(i,n){\\n int l;cin>>l>>x[i]>>y[i];\\n REP(j,l){\\n string tmp;int tmpv;\\n cin>>tmp>>tmpv;\\n if(p[mp[tmp]]>tmpv)\\n s[i].push_back({v[mp[tmp]],p[mp[tmp]]-tmpv});\\n }\\n }\\n vector<int> tme(1<<n,T+1),idx(n);\\n tme[0]=0;\\n REP(i,n)idx[i]=i;\\n do{\\n int visit=0,nowtime=0,nowy=0,nowx=0;\\n REP(i,n){\\n visit+=1<<idx[i];\\n nowtime+=abs(nowy-y[idx[i]])+abs(nowx-x[idx[i]]);\\n nowy=y[idx[i]],nowx=x[idx[i]];\\n chmin(tme[visit],nowtime+abs(nowy)+abs(nowx));\\n }\\n }while(next_permutation(ALL(idx)));\\n vector<int> va(T+1,0);\\n REP(bit,1<<n){\\n if(tme[bit]>T)continue;\\n vector<int> a(W+1,0);\\n REP(i,n)\\n if((bit>>i)&1)\\n for(auto g:s[i])\\n REP(j,W-g.w+1)chmax(a[j+g.w],a[j]+g.v);\\n chmax(va[tme[bit]],a[W]);\\n }\\n vector<int> ans(T+1,0);\\n REP(i,T+1)\\n REP(j,T+1-i)\\n chmax(ans[i+j],ans[j]+va[i]);\\n cout<<ans[T]<<endl;\\n}\",\n \"accuracy\": 0.08333333333333333,\n \"time_ms\": 50,\n \"memory_kb\": 3260,\n \"score_of_the_acc\": -0.4,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2296_4970167\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<map>\\n#include<vector>\\nusing namespace std;\\nint N,M,W,T;\\nmap<string,int>sell,we;\\nint X[7],Y[7];\\nvector<pair<string,int> >buy[7];\\nint dist[1<<7][7];\\nlong ge[10101];\\nlong w[1<<7][10101];\\nmain()\\n{\\n\\tcin>>N>>M>>W>>T;\\n\\tfor(int i=0;i<M;i++)\\n\\t{\\n\\t\\tstring s;cin>>s;\\n\\t\\tcin>>we[s]>>sell[s];\\n\\t}\\n\\tfor(int i=0;i<N;i++)\\n\\t{\\n\\t\\tint L;cin>>L>>X[i]>>Y[i];\\n\\t\\tfor(int j=0;j<L;j++)\\n\\t\\t{\\n\\t\\t\\tstring t;int p;\\n\\t\\t\\tcin>>t>>p;\\n\\t\\t\\tbuy[i].push_back(make_pair(t,p));\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<1<<N;i++)for(int j=0;j<N;j++)dist[i][j]=1e9;\\n\\tfor(int i=0;i<N;i++)dist[1<<i][i]=abs(X[i])+abs(Y[i]);\\n\\tfor(int i=1;i<1<<N;i++)for(int j=0;j<N;j++)if(i>>j&1)\\n\\t{\\n\\t\\tfor(int k=0;k<N;k++)\\n\\t\\t{\\n\\t\\t\\tdist[i|1<<k][k]=min(dist[i|1<<k][k],dist[i][j]+abs(X[j]-X[k])+abs(Y[j]-Y[k]));\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<N;i++)\\n\\t{\\n\\t\\tfor(int j=0;j<1<<i;j++)\\n\\t\\t{\\n\\t\\t\\tint nj=j|1<<i;\\n\\t\\t\\tfor(int k=0;k<=W;k++)w[nj][k]=w[j][k];\\n\\t\\t\\tfor(pair<string,int>p:buy[i])\\n\\t\\t\\t{\\n\\t\\t\\t\\tint wgh=we[p.first];\\n\\t\\t\\t\\tint gt=sell[p.first]-p.second;\\n\\t\\t\\t\\tfor(int k=0;k<=W-wgh;k++)w[nj][k+wgh]=max(w[nj][k+wgh],w[nj][k]+gt);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int i=1;i<1<<N;i++)\\n\\t{\\n\\t\\tint tm=1e9;\\n\\t\\tfor(int j=0;j<N;j++)tm=min(tm,dist[i][j]+abs(X[j])+abs(Y[j]));\\n\\t\\tlong B=w[i][W];\\n\\t\\tfor(int j=0;j<=T-tm;j++)ge[j+tm]=max(ge[j+tm],ge[j]+B);\\n\\t}\\n\\tcout<<ge[T]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 13292,\n \"score_of_the_acc\": -0.8123,\n \"final_rank\": 11\n }\n]","isConversational":false}}},{"rowIdx":1281,"cells":{"group_id":{"kind":"string","value":"aoj_2297_cpp"},"problem_description":{"kind":"string","value":"H: Rectangular Stamps\nICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．\n今日の修行は，絵を描くことによって，創造力を高めようというものである．四角いスタンプを用いて，上手く模様を描こう．\n大小さまざまなスタンプを使い，4 × 4 のマス目の紙に指定された赤・緑・青の通りの絵を完成させたい．スタンプは長方形であり，マス目にぴったり合わせて使う．スタンプの縦と横を入れ替えることはできない．\n紙は最初色が塗られていない状態にある．紙にスタンプを押すと，押された部分がスタンプの色に変わり，下に隠れた色は全く見えなくなる．スタンプの色は付けるインクにより決定されるので，どのスタンプでも，好きな色を選ぶことが可能である．スタンプは紙から一部がはみ出た状態で押すことも可能であり，はみ出た部分は無視される．\n1 つのスタンプを複数回使うことは可能である．同じスタンプを別の色に対して使ってもよい．スタンプを押すのはやや神経を使う作業なので，出来るだけスタンプを押す回数を少なくしたい．\nInput\nN\nH\n1\nW\n1\n...\nH\nN\nW\nN\nC\n1,1\nC\n1,2\nC\n1,3\nC\n1,4\nC\n2,1\nC\n2,2\nC\n2,3\nC\n2,4\nC\n3,1\nC\n3,2\nC\n3,3\nC\n3,4\nC\n4,1\nC\n4,2\nC\n4,3\nC\n4,4\nN\nはスタンプの個数，\nH\ni\n,\nW\ni\n(1 ≤\ni\n≤\nN\n) はそれぞれ，\ni\n番目のスタンプの縦の長さ，横の長さを表す整数である．\nC\ni\n,\nj\n(1 ≤\ni\n≤ 4，1 ≤\nj\n≤ 4) は，上から\ni\n行目，左から\nj\n列目のマスについて指定された絵の色を表す文字である．赤は\nR\n，緑は\nG\n，青は\nB\nで表される．\n1 ≤\nN\n≤ 16，1 ≤\nH\ni\n≤ 4，1 ≤\nW\ni\n≤ 4 を満たす．(\nH\ni\n,\nW\ni\n) として同一の組は複数回現れない．\nOutput\n絵を完成させるためにスタンプを押さなければならない最小の回数を 1 行に出力せよ．\nSample Input 1\n2\n4 4\n1 1\nRRRR\nRRGR\nRBRR\nRRRR\nSample Output 1\n3\nSample Input 2\n1\n2 3\nRRGG\nBRGG\nBRRR\nBRRR\nSample Output 2\n5"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2297_9995285","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\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n vector<int> h(n), w(n);\n rep(i, n) cin >> h[i] >> w[i];\n vector<string> s(4);\n rep(i, 4) cin >> s[i];\n vector<vector<int>> col(4, vector(4, -1));\n map<char, int> mp;\n mp['R'] = 0;\n mp['B'] = 1;\n mp['G'] = 2;\n rep(i, 4) rep(j, 4) col[i][j] = mp[s[i][j]];\n int inf = 1 << 30;\n vector<int> dp(1 << 16, inf);\n dp[0] = 0;\n queue<int> que;\n que.push(0);\n while(!que.empty()) {\n int now = que.front();\n que.pop();\n rep(id, n) {\n for(int i = -h[id] + 1; i <= 3; i ++) {\n for(int j = -w[id] + 1; j <= 3; j ++) {\n rep(c, 3) {\n int nx = now;\n int Mini = max(i, 0);\n int Minj = max(j, 0);\n int Maxi = min(i + h[id] - 1, 3);\n int Maxj = min(j + w[id] - 1, 3);\n for(int ii = Mini; ii <= Maxi; ii ++) {\n for(int jj = Minj; jj <= Maxj; jj ++) {\n int idx = (ii * 4 + jj);\n if(col[ii][jj] == c) {\n if(nx >> idx & 1) {\n ;\n } else {\n nx ^= (1 << idx);\n }\n } else {\n if(nx >> idx & 1) {\n nx ^= (1 << idx);\n } else {\n ;\n }\n }\n }\n }\n if(dp[nx] > dp[now] + 1) {\n dp[nx] = dp[now] + 1;\n que.push(nx);\n }\n }\n }\n }\n }\n }\n cout << dp[(1 << 16) - 1] << endl;\n return 0;\n}","accuracy":1,"time_ms":660,"memory_kb":3648,"score_of_the_acc":-0.3293,"final_rank":8},{"submission_id":"aoj_2297_9995284","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\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n vector<int> h(n), w(n);\n rep(i, n) cin >> h[i] >> w[i];\n vector<string> s(4);\n rep(i, 4) cin >> s[i];\n vector<vector<int>> col(4, vector(4, -1));\n map<char, int> mp;\n mp['R'] = 0;\n mp['B'] = 1;\n mp['G'] = 2;\n rep(i, 4) rep(j, 4) col[i][j] = mp[s[i][j]];\n int inf = 1 << 30;\n vector<int> dp(1 << 16, inf);\n dp[0] = 0;\n queue<int> que;\n que.push(0);\n while(!que.empty()) {\n int now = que.front();\n que.pop();\n rep(id, n) {\n for(int i = -h[id] + 1; i <= 3; i ++) {\n for(int j = -w[id] + 1; j <= 3; j ++) {\n rep(c, 3) {\n int nx = now;\n int Mini = max(i, 0);\n int Minj = max(j, 0);\n int Maxi = min(i + h[id] - 1, 3);\n int Maxj = min(j + w[id] - 1, 3);\n for(int ii = Mini; ii <= Maxi; ii ++) {\n for(int jj = Minj; jj <= Maxj; jj ++) {\n int idx = (ii * 4 + jj);\n if(col[ii][jj] == c) {\n if(nx >> idx & 1) {\n ;\n } else {\n nx |= (1 << idx);\n }\n } else {\n if(nx >> idx & 1) {\n nx |= (1 << idx);\n } else {\n ;\n }\n }\n }\n }\n if(dp[nx] > dp[now] + 1) {\n dp[nx] = dp[now] + 1;\n que.push(nx);\n }\n }\n }\n }\n }\n }\n cout << dp[(1 << 16) - 1] << endl;\n return 0;\n}","accuracy":0.03278688524590164,"time_ms":100,"memory_kb":3316,"score_of_the_acc":-0.0266,"final_rank":16},{"submission_id":"aoj_2297_9579170","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\nstruct EnumCliques{\n const int n;\n int m;\n vector<vector<int>> g;\n vector<int> deg;\n EnumCliques(int _n):n(_n),m(0),g(n,vector<int>(n)),deg(n){}\n void add_edge(int u,int v){\n g[u][v]=g[v][u]=1;\n deg[u]++; deg[v]++;\n m++;\n }\n vector<vector<int>> run(){\n int L=sqrt(m);\n vector<vector<int>> res;\n auto process=[&](vector<int>& vs,bool fix=true)->void{\n vector<int> nbhd(vs.size());\n rep(i,0,vs.size())rep(j,0,vs.size())if(i!=j){\n nbhd[i]|=(!g[vs[i]][vs[j]])<<j;\n }\n rep(mask,1,1<<vs.size()){\n if(fix and (mask&1)==0)continue;;\n bool check=1;\n rep(i,0,vs.size())if(mask>>i&1){\n if(mask&nbhd[i]){\n check=0;\n break;\n }\n }\n if(check){\n vector<int> add;\n rep(i,0,vs.size())if(mask>>i&1){\n add.push_back(vs[i]);\n }\n res.push_back(add);\n }\n }\n };\n\n vector<int> used(n);\n queue<int> que;\n rep(v,0,n)if(deg[v]<L){\n que.push(v);\n used[v]=1;\n }\n while(!que.empty()){\n int v=que.front();\n que.pop();\n vector<int> vs;\n vs.push_back(v);\n rep(u,0,n)if(g[v][u])vs.push_back(u);\n process(vs);\n rep(u,0,n)if(g[v][u]){\n g[v][u]=g[u][v]=0;\n deg[u]--;\n if(!used[u] and deg[u]<L){\n que.push(u);\n used[u]=1;\n }\n }\n }\n vector<int> vs;\n rep(v,0,n)if(!used[v])vs.push_back(v);\n process(vs,false);\n return res;\n }\n};\n\n/**\n * @brief Enumerate Cliques\n */\n\nint main() {\n int N;\n cin >> N;\n vector<int> A(N), B(N);\n rep(i,0,N) cin >> A[i] >> B[i];\n char C[4][4];\n rep(i,0,4) rep(j,0,4) cin >> C[i][j];\n string S = \"RGB\";\n vector D(N, vector(3, vector(7, vector<int>(7,0))));\n vector X(N, vector(3, vector(7, vector<int>(7,0))));\n rep(i,0,N) {\n rep(j,0,3) {\n char T = S[j];\n rep(k,-3,4) {\n rep(l,-3,4) {\n rep(a,0,A[i]) {\n rep(b,0,B[i]) {\n int x = a+k, y = b+l;\n if (0<=x&&x<4&&0<=y&&y<4) {\n if (C[x][y] != T) D[i][j][k+3][l+3] |= (1<<(x*4+y));\n X[i][j][k+3][l+3] |= (1<<(x*4+y));\n }\n }\n }\n }\n }\n }\n }\n vector<int> DP(1<<16,inf);\n DP[0] = 0;\n rep(i,0,1<<16) {\n if (DP[i] == inf) continue;\n bool BB[4][4] = {};\n rep(j,0,16) {\n if (i & (1<<j)) BB[j/4][j%4] = true;\n }\n rep(j,0,N) {\n rep(a,0,3) {\n char T = S[a];\n rep(b,0,7) {\n rep(c,0,7) {\n if ((i & D[j][a][b][c]) == D[j][a][b][c]) chmin(DP[i|X[j][a][b][c]],DP[i]+1);\n }\n }\n }\n }\n }\n cout << DP[(1<<16)-1] << endl;\n}","accuracy":1,"time_ms":210,"memory_kb":3548,"score_of_the_acc":-0.0885,"final_rank":2},{"submission_id":"aoj_2297_9361542","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\ntemplate<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}\nistream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}\n#endif\n#ifdef LOCAL\n#include \"debug.h\"\n#else\n#define debug(...) static_cast<void>(0)\n#define debugg(...) static_cast<void>(0)\n#define esper(...) static_cast<void>(0)\ntemplate<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}\n#endif\nusing ll=long long;\nusing ull=unsigned long long;\nusing P=pair<ll,ll>;\ntemplate<typename T>using minque=priority_queue<T,vector<T>,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 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 reps(i,a,n) for(int i=(a);i<int(n);i++)\n#define rep(i,n) reps(i,0,n)\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)\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}\nvoid SOLVE();\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout<<fixed<<setprecision(16);\n #ifdef LOCAL\n clock_t start=clock();\n #endif\n int testcase=1;\n //cin>>testcase;\n for(int i=0;i<testcase;i++){\n SOLVE();\n }\n #ifdef LOCAL\n cerr<<\"time:\";\n cerr<<(clock()-start)/1000;\n cerr<<\"ms\\n\";\n #endif\n}\nvoid SOLVE(){\n int n;\n cin>>n;\n vector<pair<int,int>>a(n);\n cin>>a;\n vector<vector<int>>b(4,vector<int>(4));\n rep(i,4)rep(j,4){\n char c;\n cin>>c;\n if(c=='R')b[i][j]=0;\n else if(c=='G')b[i][j]=1;\n else b[i][j]=2;\n }\n vector<int>dp(1<<16,0);\n for(int i=(1<<16)-1;i--;){\n dp[i]=1e9;\n rep(j,n){\n reps(dx,-a[j].first+1,4)reps(dy,-a[j].second+1,4){\n int nx=i;\n int st=-1;\n rep(x,a[j].first)rep(y,a[j].second){\n if(x+dx>=0&&y+dy>=0&&x+dx<4&&y+dy<4){\n if(i>>((x+dx)*4+y+dy)&1)continue;\n if(st==-1)st=b[x+dx][y+dy];\n else if(st!=b[x+dx][y+dy])st=-2;\n nx|=1<<((x+dx)*4+y+dy);\n }\n }\n if(st!=-2)chmin(dp[i],dp[nx]+1);\n }\n }\n }\n cout<<dp[0]<<endl;\n}","accuracy":1,"time_ms":780,"memory_kb":3476,"score_of_the_acc":-0.3906,"final_rank":9},{"submission_id":"aoj_2297_9346755","code_snippet":"#include <bits/stdc++.h>\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n\n int N;\n std::cin >> N;\n std::vector<int> H(N), W(N);\n for (int i{} ; i < N ; i++) {\n std::cin >> H[i] >> W[i];\n }\n char input[4][4];\n int C[4][4];\n for (int i{} ; i < 4 ; i++) {\n for (int j{} ; j < 4 ; j++) {\n std::cin >> input[i][j];\n if (input[i][j] == 'R') C[i][j] = 0;\n else if (input[i][j] == 'G') C[i][j] = 1;\n else if (input[i][j] == 'B') C[i][j] = 2;\n else assert(false);\n }\n }\n std::vector<int> dp((1 << 16), -1);\n auto in{[&](int x, int y) -> bool {\n return 0 <= x and x < 4 and 0 <= y and y < 4;\n }};\n auto f{[&](int x, int y) -> int {\n return x * 4 + y;\n }};\n const int INF{(int)1e9};\n auto rec{[&](auto rec, int bit) -> int {\n if (dp[bit] != -1) return dp[bit];\n if (bit == (1 << 16) - 1) return dp[bit] = 0;\n dp[bit] = INF;\n for (int i{} ; i < N ; i++) {\n for (int u{-H[i] + 1} ; u < 4 ; u++) {\n for (int l{-W[i] + 1} ; l < 4 ; l++) {\n int app{};\n int mask{bit};\n for (int x{std::max(u, 0)} ; x < std::min(4, u + H[i]) ; x++) {\n for (int y{std::max(l, 0)} ; y < std::min(4, l + W[i]) ; y++) {\n int val{f(x, y)};\n if (bit & (1 << val)) continue;\n app |= (1 << C[x][y]);\n mask |= (1 << val);\n }\n }\n if (__builtin_popcount(app) == 1) {\n dp[bit] = std::min(dp[bit], rec(rec, mask) + 1);\n }\n }\n }\n }\n return dp[bit];\n }};\n std::cout << rec(rec, 0) << '\\n';\n}","accuracy":1,"time_ms":460,"memory_kb":3464,"score_of_the_acc":-0.2203,"final_rank":3},{"submission_id":"aoj_2297_9004351","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint main() {\n int N = in();\n vector<int> H(N), W(N);\n for(int i : rep(N)) H[i] = in(), W[i] = in();\n vector<string> C = in(4);\n vector<int> dist(1 << 16, -1);\n dist[0] = 0;\n queue<int> q;\n q.push(0);\n while(not q.empty()) {\n int u = q.front(); q.pop();\n for(int i = 0; i < N; i++) {\n for(int dx = 1 - H[i]; dx <= +3; dx++) {\n for(int dy = 1 - W[i]; dy <= +3; dy++) {\n for(char c : {'R', 'G', 'B'}) {\n int v = u;\n for(int x = max(0, dx); x < min(4, H[i] + dx); x++) {\n for(int y = max(0, dy); y < min(4, W[i] + dy); y++) {\n int p = 1 << (x * 4 + y);\n if(C[x][y] == c) {\n v |= p;\n } else {\n v &= ~p;\n }\n }\n }\n if(dist[v] == -1) {\n dist[v] = dist[u] + 1;\n q.push(v);\n }\n }\n }\n }\n }\n }\n print(dist[(1 << 16) - 1]);\n}","accuracy":1,"time_ms":1210,"memory_kb":3628,"score_of_the_acc":-0.6216,"final_rank":11},{"submission_id":"aoj_2297_9004350","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint main() {\n int N = in();\n vector<int> H(N), W(N);\n for(int i : rep(N)) H[i] = in(), W[i] = in();\n vector<string> C = in(4);\n vector<int> dist(1 << 16, -1);\n dist[0] = 0;\n queue<int> q;\n q.push(0);\n while(not q.empty()) {\n int u = q.front(); q.pop();\n if(u == (1 << 16) - 1) break;\n for(int i = 0; i < N; i++) {\n for(int dx = 1 - H[i]; dx <= +3; dx++) {\n for(int dy = 1 - W[i]; dy <= +3; dy++) {\n for(char c : {'R', 'G', 'B'}) {\n int v = u;\n for(int x = max(0, dx); x < min(4, H[i] + dx); x++) {\n for(int y = max(0, dy); y < min(4, W[i] + dy); y++) {\n int p = 1 << (x * 4 + y);\n if(C[x][y] == c) {\n v |= p;\n } else {\n v &= ~p;\n }\n }\n }\n if(dist[v] == -1) {\n dist[v] = dist[u] + 1;\n q.push(v);\n }\n }\n }\n }\n }\n }\n print(dist[(1 << 16) - 1]);\n}","accuracy":1,"time_ms":550,"memory_kb":3632,"score_of_the_acc":-0.2706,"final_rank":7},{"submission_id":"aoj_2297_8305259","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\n\ntemplate<class T>\nbool chmin(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\nint dp[1<<16];\n\nvoid init()\n{\n\tfor (int i = 0; i < (1<<16); ++i)\n\t{\n\t\tdp[i] = 1e9;\n\t}\n\treturn;\n}\n\nvoid calc()\n{\n\tint N; cin >> N;\n\tvector<int> H(N), W(N);\n\tfor (int i = 0; i < N; ++i) {cin >> H[i] >> W[i];}\n\t\n\tint C[4][4];\n\tfor (int i = 0; i < 4; ++i)\n\t{\n\t\tfor (int j = 0; j < 4; ++j)\n\t\t{\n\t\t\tchar c; cin >> c;\n\t\t\tif (c == 'R') C[i][j] = 0;\n\t\t\tif (c == 'G') C[i][j] = 1;\n\t\t\tif (c == 'B') C[i][j] = 2;\n\t\t}\n\t}\n\t\n\tvector<int> cbit(3, 0);\n\tfor (int i = 0; i < 4; ++i)\n\t{\n\t\tfor (int j = 0; j < 4; ++j)\n\t\t{\n\t\t\tint c = C[i][j];\n\t\t\tcbit[c] ^= (1<<(i*4+j));\n\t\t}\n\t}\n\t\n\tinit();\n\t\n\tdp[0] = 0;\n\tfor (int i = 1; i <= 16; ++i)\n\t{\n\t\tfor (int n = 0; n < N; ++n)\n\t\t{\n\t\t\tfor (int x1 = 0; x1 < 3 + H[n]; ++x1)\n\t\t\t{\n\t\t\t\tfor (int y1 = 0; y1 < 3 + W[n]; ++y1)\n\t\t\t\t{\n\t\t\t\t\tint x0 = max(x1 - H[n] + 1, 0);\n\t\t\t\t\tint y0 = max(y1 - W[n] + 1, 0);\n\t\t\t\t\tint mask = 0;\n\t\t\t\t\tfor (int x = x0; x <= min(x1, 3); ++x)\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (int y = y0; y <= min(y1, 3); ++y)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tmask ^= (1<<(4*x+y));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t\t\tfor (int c = 0; c < 3; ++c)\n\t\t\t\t\t{\n\t\t\t\t\t\tfor (int bit = 0; bit < (1<<16); ++bit)\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tif (dp[bit] > 100) {continue;}\n\t\t\t\t\t\t\t\n\t\t\t\t\t\t\tint nbit = bit & (~mask);\n\t\t\t\t\t\t\tnbit |= (mask & cbit[c]);\n\t\t\t\t\t\t\tchmin(dp[nbit], dp[bit] + 1);\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\tcout << dp[(1<<16)-1] << endl;\n\t\t\n\treturn;\n}\n\nint main()\n{\n\tcalc();\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":1930,"memory_kb":3720,"score_of_the_acc":-1.0059,"final_rank":15},{"submission_id":"aoj_2297_8024090","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 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, r) for (int i = 0; i < (r); 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, r) for (int i = (r)-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(x, a) for (auto &x : 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 IN(x, a, b) ((a) <= (x) && (x) < (b))\n#define int ll\n\ntemplate <class T>\nvoid DEBUG_(string_view name, const T &a) {\n cerr << name << \": \" << a << endl;\n}\n\ntemplate <class T>\nvoid DEBUG_(string_view name, const vector<T> &a) {\n cerr << name << \": \";\n REP(i, sz(a)) cerr << a[i] << \" \";\n cerr << endl;\n}\n\ntemplate <class T, class U>\nbool chmax(T &x, const U &y) {\n return x < y ? x = y, 1 : 0;\n}\ntemplate <class T, class U>\nbool chmin(T &x, const U &y) {\n return x > y ? x = y, 1 : 0;\n}\n\n//-----------------------------------------------------------------------\n\nint N;\nvp HWs;\nvvl grid;\n\nmap<int, int> memo;\nint dp(const int bit = 0) {\n // DEBUG(bit);\n if (bit == (1 << 16) - 1) {\n return 0;\n }\n if (memo.count(bit)) {\n return memo[bit];\n }\n\n int ans = INF;\n EACH(h, w, HWs) {\n REP(h1, 4) {\n REP2(h2, h1, 4) {\n if (h2 - h1 + 1 > h) continue;\n if (1 <= h1 && h2 <= 2 && h2 - h1 + 1 != h) continue;\n REP(w1, 4) {\n REP2(w2, w1, 4) {\n if (w2 - w1 + 1 > w) continue;\n if (1 <= w1 && w2 <= 2 && w2 - w1 + 1 != w) continue;\n int seen = -1;\n int nbit = bit;\n REP(hh, h1, h2 + 1) {\n REP(ww, w1, w2 + 1) {\n if (nbit & (1 << (4 * hh + ww))) continue;\n nbit |= (1 << (4 * hh + ww));\n if (seen == -1) {\n seen = grid[hh][ww];\n } else if (seen != grid[hh][ww]) {\n seen = -INFL;\n break;\n }\n }\n }\n if (seen == -INFL) continue;\n if (bit == nbit) continue;\n chmin(ans, dp(nbit) + 1);\n }\n }\n }\n }\n }\n\n // DEBUG(bit);\n // DEBUG(ans);\n\n return memo[bit] = ans;\n}\n\nvoid solve() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(15);\n\n int N;\n cin >> N;\n HWs.resize(N);\n REP(i, N) {\n int H, W;\n cin >> H >> W;\n HWs[i] = {H, W};\n }\n grid.resize(4, vl(4));\n REP(h, 4) {\n string S;\n cin >> S;\n REP(w, 4) {\n if (S[w] == 'R') grid[h][w] = 1;\n if (S[w] == 'G') grid[h][w] = 2;\n if (S[w] == 'B') grid[h][w] = 3;\n }\n }\n\n cout << dp() << endl;\n\n // EACH(key, val, memo) {\n // if (val != 0) {\n // DEBUG(key);\n // DEBUG(val);\n // }\n // }\n}\n\nsigned main() {\n int T = 1;\n // cin >> T;\n\n while (T--) solve();\n\n // random_test();\n\n return 0;\n}","accuracy":1,"time_ms":1680,"memory_kb":7564,"score_of_the_acc":-0.9295,"final_rank":14},{"submission_id":"aoj_2297_7140085","code_snippet":"#include<bits/stdc++.h>\n#define int ll\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 per(i, N) for(int i = (N)-1; i >= 0; --i)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bit(n, k) ((n) >> (k))\n#define pcnt(n) (__builtin_popcount(n))\n#define TakAo(ans) ans ? cout << \"Takahashi\\n\" : cout << \"Aoki\\n\"\n#define YesNo(ans) ans ? cout << \"Yes\\n\" : cout << \"No\\n\"\n#define endl '\\n'\n#define fi first\n#define se second\n#define mkpr make_pair\n#define mktpl make_tuple\n#define eb emplace_back\n\nusing namespace std;\nusing ll = int64_t;\nusing ull = uint64_t;\nusing ld = long double;\nusing point = struct{ ll x, y; };\nusing pointld = struct{ ld x, y; };\nusing State = string::const_iterator;\ntemplate<class T> using max_heap = priority_queue<T>;\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vec<vec<T>>;\ntemplate<class T> using vvvec = vec<vvec<T>>;\ntemplate<class T> using vvvvec = vvec<vvec<T>>;\n\nconstexpr ld EPS = 1e-10;\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr ll MOD = (0) ? 998244353 : 1e9+7;\nconstexpr int NIL = -1;\nconstexpr int pm[2] = {1, -1};\nconstexpr int dy[4] = {0, 1, 0, -1};\nconstexpr int dx[4] = {1, 0, -1, 0};\n\nll cel(ll a, ll b){ return (a + b - 1) / b;}\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : abs(a);}\ntemplate<class T> T powi(T x, ll exp){\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : x / x;\n}\nll modpow(ll x, ll exp, ll mod){\n x %= mod;\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\n}\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\n\nusing Pair = pair<ll, ll>;\nusing Tpl = tuple<int, int, int>;\n\nvoid Main(){\n int N; cin >> N;\n vec<int> H(N), W(N);\n rep(i, N) cin >> H[i] >> W[i];\n\n vvec<char> G(4, vec<char>(4));\n rep(i, 4)rep(j, 4) cin >> G[i][j];\n\n const int goal = (1 << 16) - 1;\n queue<Pair> que;\n vec<bool> used(1 << 16, 0);\n que.push(mkpr(0, 0));\n used[0] = 1;\n char col[3] = {'R', 'G', 'B'};\n\n while(!que.empty()){\n Pair p = que.front();\n que.pop();\n int num = p.fi, cst = p.se;\n \n rep(i, N){\n for(int j = -H[i] + 1; j < 4; j++){\n for(int k = -W[i] + 1; k < 4; k++){\n for(int l = 0; l < 3; l++){\n int tmp = num;\n\n for(int a = max(j, ll(0)); a < min(j + H[i], ll(4)); a++){\n for(int b = max(k, ll(0)); b < min(k + W[i], ll(4)); b++){\n if(col[l] == G[a][b]){\n tmp |= (1 << (4 * a + b));\n }\n else{\n //cout << bitset<16>(tmp) << endl;\n tmp &= ~(1 << (4 * a + b));\n //cout << bitset<16>(tmp) << endl;\n }\n }\n }\n\n if(tmp == goal){\n cout << cst + 1 << endl;\n return;\n }\n else{\n if(!used[tmp]){\n used[tmp] = 1;\n que.push(mkpr(tmp, cst + 1));\n }\n }\n }\n }\n }\n }\n }\n\n cout << -1 << endl;\n}\n \nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n Main();\n return 0;\n}","accuracy":1,"time_ms":540,"memory_kb":3964,"score_of_the_acc":-0.2702,"final_rank":6},{"submission_id":"aoj_2297_7136393","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\nusing pii = pair<int, int>;\n#define rep(i, x) for(int i = 0; i < (x); i++)\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\n#define sz(x) (int)(x).size()\n#define all(v) (v).begin(), (v).end()\n\nint ctoi(char c) { return c == 'R' ? 2 : c == 'G'; }\nconst int inf = 1 << 30;\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<pii> hw;\n\trep(i, n) {\n\t\tint u, v;\n\t\tcin >> u >> v;\n\t\thw.emplace_back(u, v);\n\t}\n\tvector<string> s(4);\n\tfor(auto &v : s) cin >> v;\n\tint N = 1 << 16;\n\tvector<vi> g(N);\n\trep(bit, N) {\n\t\tset<int> st;\n\t}\n\tvi dist(N, inf);\n\tdist[0] = 0;\n\tqueue<int> que;\n\tque.push(0);\n\twhile(!que.empty()) {\n\t\tauto bit = que.front();\n\t\tque.pop();\n\t\trep(i, n) {\n\t\t\tauto [h, w] = hw[i];\n\t\t\trng(x, -h, 4) {\n\t\t\t\trng(y, -w, 4) {\n\t\t\t\t\trep(c, 3) {\n\t\t\t\t\t\tint to = bit;\n\t\t\t\t\t\trng(nx, max(0, x), min(4, x + h)) {\n\t\t\t\t\t\t\trng(ny, max(0, y), min(4, y + w)) {\n\t\t\t\t\t\t\t\tif(nx >= 0 and nx < 4 and ny >= 0 and ny < 4) {\n\t\t\t\t\t\t\t\t\tint id = nx * 4 + ny;\n\t\t\t\t\t\t\t\t\tint col = ctoi(s[nx][ny]);\n\t\t\t\t\t\t\t\t\tif(c == col) {\n\t\t\t\t\t\t\t\t\t\tto |= 1 << id;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tif(to >> id & 1) to ^= 1 << id;\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\tif(dist[to] != inf) continue;\n\t\t\t\t\t\tdist[to] = dist[bit] + 1;\n\t\t\t\t\t\tque.push(to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << dist.back() << endl;\n}","accuracy":1,"time_ms":1220,"memory_kb":4972,"score_of_the_acc":-0.6467,"final_rank":12},{"submission_id":"aoj_2297_7136390","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\nusing pii = pair<int, int>;\n#define rep(i, x) for(int i = 0; i < (x); i++)\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\n#define sz(x) (int)(x).size()\n#define all(v) (v).begin(), (v).end()\n\nint ctoi(char c) { return c == 'R' ? 2 : c == 'G'; }\nconst int inf = 1 << 30;\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<pii> hw;\n\trep(i, n) {\n\t\tint u, v;\n\t\tcin >> u >> v;\n\t\thw.emplace_back(u, v);\n\t}\n\tvector<string> s(4);\n\tfor(auto &v : s) cin >> v;\n\tint N = 1 << 16;\n\tvector<vi> g(N);\n\trep(bit, N) {\n\t\tset<int> st;\n\t}\n\tvi dist(N, inf);\n\tdist[0] = 0;\n\tqueue<int> que;\n\tque.push(0);\n\twhile(!que.empty()) {\n\t\tauto bit = que.front();\n\t\tque.pop();\n\t\trep(i, n) {\n\t\t\tauto [h, w] = hw[i];\n\t\t\trng(x, -h, 4) {\n\t\t\t\trng(y, -w, 4) {\n\t\t\t\t\trep(c, 3) {\n\t\t\t\t\t\tint to = bit;\n\t\t\t\t\t\trep(dx, h) {\n\t\t\t\t\t\t\trep(dy, w) {\n\t\t\t\t\t\t\t\tint nx = x + dx, ny = y + dy;\n\t\t\t\t\t\t\t\tif(nx >= 0 and nx < 4 and ny >= 0 and ny < 4) {\n\t\t\t\t\t\t\t\t\tint id = nx * 4 + ny;\n\t\t\t\t\t\t\t\t\tint col = ctoi(s[nx][ny]);\n\t\t\t\t\t\t\t\t\tif(c == col) {\n\t\t\t\t\t\t\t\t\t\tto |= 1 << id;\n\t\t\t\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\t\t\t\tif(1 >> id & 1) to ^= 1 << id;\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\tif(dist[to] != inf) continue;\n\t\t\t\t\t\tdist[to] = dist[bit] + 1;\n\t\t\t\t\t\tque.push(to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << dist.back() << endl;\n}","accuracy":0.03278688524590164,"time_ms":250,"memory_kb":4924,"score_of_the_acc":-0.13,"final_rank":18},{"submission_id":"aoj_2297_7136353","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\nusing pii = pair<int, int>;\n#define rep(i, x) for(int i = 0; i < (x); i++)\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\n#define sz(x) (int)(x).size()\n#define all(v) (v).begin(), (v).end()\n\nint ctoi(char c) { return c == 'R' ? 2 : c == 'G'; }\nconst int inf = 1 << 30;\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<pii> hw;\n\tset<pii> st;\n\trep(i, n) {\n\t\tint u, v;\n\t\tcin >> u >> v;\n\t\trng(x, 1, u + 1) {\n\t\t\trng(y, 1, v + 1) {\n\t\t\t\tst.insert({x, y});\n\t\t\t}\n\t\t}\n\t}\n\tfor(auto &p : st) hw.push_back(p);\n\tn = sz(hw);\n\tvector<string> s(4);\n\tfor(auto &v : s) cin >> v;\n\tint N = 1 << 16;\n\tvector<vi> g(N);\n\trep(bit, 1 << 16) {\n\t\trep(i, n) {\n\t\t\tauto [h, w] = hw[i];\n\t\t\trep(x, 4) {\n\t\t\t\trep(y, 4) {\n\t\t\t\t\tif(x + h > 4 or y + w > 4) continue;\n\t\t\t\t\tvector<vi> ids(3), bads(3);\n\t\t\t\t\trep(dx, h) {\n\t\t\t\t\t\trep(dy, w) {\n\t\t\t\t\t\t\tint nx = x + dx, ny = y + dy;\n\t\t\t\t\t\t\tint id = nx * 4 + ny;\n\t\t\t\t\t\t\tint col = ctoi(s[nx][ny]);\n\t\t\t\t\t\t\trep(j, 3) {\n\t\t\t\t\t\t\t\tif(j == col)\n\t\t\t\t\t\t\t\t\tids[j].push_back(id);\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\tbads[j].push_back(id);\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\trep(j, 3) {\n\t\t\t\t\t\tif(ids[j].empty()) continue;\n\t\t\t\t\t\tint nb = bit;\n\t\t\t\t\t\tfor(auto v : ids[j]) {\n\t\t\t\t\t\t\tif(!(nb >> v & 1)) nb |= 1 << v;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor(auto v : bads[j]) {\n\t\t\t\t\t\t\tif(nb >> v & 1) nb ^= 1 << v;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tg[bit].push_back(nb);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvi dist(N, inf);\n\tdist[0] = 0;\n\tqueue<int> que;\n\tque.push(0);\n\twhile(!que.empty()) {\n\t\tauto v = que.front();\n\t\tque.pop();\n\t\tfor(auto to : g[v]) {\n\t\t\tif(dist[to] != inf) continue;\n\t\t\tdist[to] = dist[v] + 1;\n\t\t\tque.push(to);\n\t\t}\n\t}\n\tcout << dist.back() << endl;\n}","accuracy":0.03278688524590164,"time_ms":1540,"memory_kb":71352,"score_of_the_acc":-1.7926,"final_rank":19},{"submission_id":"aoj_2297_7136283","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\nusing pii = pair<int, int>;\n#define rep(i, x) for(int i = 0; i < (x); i++)\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\n#define sz(x) (int)(x).size()\n#define all(v) (v).begin(), (v).end()\n\nint ctoi(char c) { return c == 'R' ? 2 : c == 'G'; }\nconst int inf = 1 << 30;\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<pii> hw;\n\trep(i, n) {\n\t\tint u, v;\n\t\tcin >> u >> v;\n\t\thw.emplace_back(u, v);\n\t}\n\tvector<string> s(4);\n\tfor(auto &v : s) cin >> v;\n\tint N = 1 << 16;\n\tvector<vi> g(N);\n\trep(bit, 1 << 16) {\n\t\trep(i, n) {\n\t\t\tauto [h, w] = hw[i];\n\t\t\trep(x, 4) {\n\t\t\t\trep(y, 4) {\n\t\t\t\t\tif(x + h > 4 or y + w > 4) continue;\n\t\t\t\t\tset<char> st;\n\t\t\t\t\tvector<vi> ids(3), bads(3);\n\t\t\t\t\trep(dx, h) {\n\t\t\t\t\t\trep(dy, w) {\n\t\t\t\t\t\t\tint nx = x + dx, ny = y + dy;\n\t\t\t\t\t\t\tint id = nx * 4 + ny;\n\t\t\t\t\t\t\tint col = ctoi(s[nx][ny]);\n\t\t\t\t\t\t\trep(j, 3) {\n\t\t\t\t\t\t\t\tif(j == col)\n\t\t\t\t\t\t\t\t\tids[j].push_back(id);\n\t\t\t\t\t\t\t\telse\n\t\t\t\t\t\t\t\t\tbads[j].push_back(id);\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\trep(j, 3) {\n\t\t\t\t\t\tif(ids[j].empty()) continue;\n\t\t\t\t\t\tint nb = bit;\n\t\t\t\t\t\tfor(auto v : ids[j]) {\n\t\t\t\t\t\t\tif(!(nb >> v & 1)) nb |= 1 << v;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tfor(auto v : bads[j]) {\n\t\t\t\t\t\t\tif(nb >> v & 1) nb ^= 1 << v;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tg[bit].push_back(nb);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvi dist(N, inf);\n\tdist[0] = 0;\n\tqueue<int> que;\n\tque.push(0);\n\twhile(!que.empty()) {\n\t\tauto v = que.front();\n\t\tque.pop();\n\t\tfor(auto to : g[v]) {\n\t\t\tif(dist[to] != inf) continue;\n\t\t\tdist[to] = dist[v] + 1;\n\t\t\tque.push(to);\n\t\t}\n\t}\n\tcout << dist.back() << endl;\n}","accuracy":0.01639344262295082,"time_ms":130,"memory_kb":13892,"score_of_the_acc":-0.198,"final_rank":20},{"submission_id":"aoj_2297_7136264","code_snippet":"#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\nusing pii = pair<int, int>;\n#define rep(i, x) for(int i = 0; i < (x); i++)\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\n#define sz(x) (int)(x).size()\n#define all(v) (v).begin(), (v).end()\n\nint ctoi(char c) { return c == 'R' ? 2 : c == 'G'; }\n\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<pii> hw;\n\trep(i, n) {\n\t\tint u, v;\n\t\tcin >> u >> v;\n\t\thw.emplace_back(u, v);\n\t}\n\tvector<string> s(4);\n\tfor(auto &v : s) cin >> v;\n\tvector<int> res(1 << 16, 1 << 30);\n\tauto dfs = [&](auto dfs, int bit) -> int {\n\t\tif(bit == 0) return 0;\n\t\tif(res[bit] != (1 << 30)) return res[bit];\n\t\tint ans = 1 << 30;\n\t\trep(i, n) {\n\t\t\tauto [h, w] = hw[i];\n\t\t\trep(x, 4) {\n\t\t\t\trep(y, 4) {\n\t\t\t\t\tif(x + h > 4 or y + w > 4) continue;\n\t\t\t\t\tset<char> st;\n\t\t\t\t\tvector<vi> ids(3);\n\t\t\t\t\trep(dx, h) {\n\t\t\t\t\t\trep(dy, w) {\n\t\t\t\t\t\t\tint nx = x + dx, ny = y + dy;\n\t\t\t\t\t\t\tint id = nx * 4 + ny;\n\t\t\t\t\t\t\tif(!(bit >> id & 1)) continue;\n\t\t\t\t\t\t\tids[ctoi(s[nx][ny])].push_back(id);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\trep(j, 3) {\n\t\t\t\t\t\tif(ids[j].empty()) continue;\n\t\t\t\t\t\tint nb = bit;\n\t\t\t\t\t\tfor(auto v : ids[j]) nb ^= (1 << v);\n\t\t\t\t\t\tans = min(ans, dfs(dfs, nb) + 1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn res[bit] = ans;\n\t};\n\tdfs(dfs, (1 << 16) - 1);\n\tcout << res.back() << endl;\n}","accuracy":0.03278688524590164,"time_ms":120,"memory_kb":3372,"score_of_the_acc":-0.0381,"final_rank":17},{"submission_id":"aoj_2297_7000584","code_snippet":"#include <stdio.h>\n#include <queue>\nusing namespace std;\n\nchar targ[8][8], state[4][4], tstate[4][4], vis[65536];\nint stamp[16][2], dist[65536];\nqueue<int> q;\n\nint main(void) {\n int n, s, t;\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++) {\n scanf(\"%d %d\", &stamp[i][0], &stamp[i][1]);\n }\n for (int i = 0; i < 4; i++) {\n scanf(\"%s\", targ[i]);\n for (int j = 0; j < 4; j++) {\n if (targ[i][j] == 'R') targ[i][j] = 1;\n else if (targ[i][j] == 'G') targ[i][j] = 2;\n else targ[i][j] = 3;\n }\n }\n vis[0] = 1;\n q.push(0);\n while (q.size()) {\n s = q.front();\n q.pop();\n for (int i = 0; i < 4; i++) {\n for (int j = 0; j < 4; j++) state[i][j] = ((s >> (i * 4 + j)) & 1);\n }\n for (int i = 0; i < n; i++) {\n for (int j = 1; j <= 3; j++) {\n for (int x = -stamp[i][0] + 1; x <= 3; x++) {\n for (int y = -stamp[i][1] + 1; y <= 3; y++) {\n for (int xx = 0; xx < 4; xx++) {\n for (int yy = 0; yy < 4; yy++) tstate[xx][yy] = state[xx][yy];\n }\n for (int xx = x; xx < x + stamp[i][0]; xx++) {\n if (xx < 0 || xx >= 4) continue;\n for (int yy = y; yy < y + stamp[i][1]; yy++) {\n if (yy < 0 || yy >= 4) continue;\n if (targ[xx][yy] == j) tstate[xx][yy] = 1;\n else tstate[xx][yy] = 0;\n }\n }\n t = 0;\n for (int xx = 0; xx < 4; xx++) {\n for (int yy = 0; yy < 4; yy++) t += (1 << (xx * 4 + yy)) * tstate[xx][yy];\n }\n if (!vis[t]) {\n vis[t] = 1;\n q.push(t);\n dist[t] = dist[s] + 1;\n }\n }\n }\n }\n }\n }\n\n printf(\"%d\\n\", dist[65535]);\n return 0;\n}","accuracy":1,"time_ms":1790,"memory_kb":3420,"score_of_the_acc":-0.9271,"final_rank":13},{"submission_id":"aoj_2297_6757639","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nvector<pair<int,int>> X;\nvector<vector<char>> A(4,vector<char>(4));\nint memo[65536];\n\nint dfs(int n,int nw){\n //cout << n << \" \" << nw << endl;\n //if(nw == 65471 )cout << n << endl;\n if(nw == 0){\n return memo[nw] = 0;\n }else if(memo[nw]){\n return memo[nw];\n }\n int ret = -1;\n for(int i = 0; X.size() > i; i++){\n for(int j = -X[i].first+1; 4 > j; j++){\n for(int k = -X[i].second+1; 4 > k; k++){\n int nwc = -1;\n bool ok = true;\n int mns = 0;\n for(int l = 0; X[i].first > l && ok; l++){\n for(int m = 0; X[i].second > m && ok; m++){\n int nwy = j+l;\n int nwx = k+m;\n if(nwy < 0 || 3 < nwy || nwx < 0 || 3 < nwx)continue;\n \n if(!((1<<(nwy*4+nwx)) & nw))continue;\n //cout << \"!!\" << nwy << \" \" << nwx << endl;\n mns += (1<<(nwy*4+nwx));\n // if(n == 0 && i == 1 && nwy == 1 && nwx == 2)cout << nw-mns << endl;\n if(nwc == -1){\n nwc = A[nwy][nwx];\n }else if(nwc != A[nwy][nwx]){\n ok = false;\n break;\n }\n }\n }\n // if(n == 0 && i == 1 && j == 1 && k == 2){\n // cout << ok << \" \" << nwc << \" \" << mns << endl;\n // }\n //cout << i << \" \" << j << \" \" << k <<endl;\n if(mns == 0)continue;\n if(ok && nwc!=-1){\n if(ret == -1)ret = dfs(n+1,nw-mns)+1;\n else ret = min(ret,(dfs(n+1,nw-mns)+1));\n }\n\n }\n }\n }\n return memo[nw] = ret;\n}\n\nint main(){\n int n;cin>>n;\n for(int i = 0; n > i; i++){\n int x,y;cin>>x>>y;X.push_back({x,y});\n }\n \n int nw = 1;\n for(int i = 0; 4 > i; i++){\n for(int j = 0; 4 > j; j++){\n cin>>A[i][j];\n nw *= 2;\n }\n }\n cout << dfs(0,nw-1) << endl;\n //cout << memo[65535-3] << endl;\n\n}","accuracy":1,"time_ms":870,"memory_kb":3680,"score_of_the_acc":-0.4415,"final_rank":10},{"submission_id":"aoj_2297_6757129","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\nint func(){\n int n = in();\n vector<pii> stamps(n);\n foreach(i,stamps)i=in<pii>();\n vector<int> need(16);\n foreach(i,need){\n char c = in<char>();\n if(c=='R')i = 1;\n else if(c=='G')i = 2;\n else if(c=='B')i = 4;\n }\n vector<int> dp(bit(16),-1);\n method(rec,int,int p){\n if(p==bit(16)-1)return 0;\n int &it = dp[p];\n if(it >= 0)return it;\n it = INF;\n foreach(stamp,stamps){\n rep(i,-stamp.first+1,4+stamp.first-1){\n rep(j,-stamp.second+1,4+stamp.second-1){\n int ok = 0;\n int ps = 0;\n rep(y,max(0,i),min(4,i+stamp.first)){\n rep(x,max(0,j),min(4,j+stamp.second)){\n if(bit(4*y+x)&p)continue;\n ok |= need[y*4+x];\n ps |= bit(4*y+x);\n }\n }\n if(__builtin_popcount(ok)==1){\n chmin(it,rec(p|ps)+1);\n }\n }\n }\n }\n return it;\n };\n return rec(0);\n}\n\nint main(){\n println(func());\n return 0;\n}","accuracy":1,"time_ms":530,"memory_kb":3444,"score_of_the_acc":-0.2572,"final_rank":4},{"submission_id":"aoj_2297_6757127","code_snippet":"#include<bits/stdc++.h>\n#define int ll\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 per(i, N) for(int i = (N)-1; i >= 0; --i)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bit(n, k) ((n) >> (k))\n#define pcnt(n) (__builtin_popcount(n))\n#define TakAo(ans) ans ? cout << \"Takahashi\\n\" : cout << \"Aoki\\n\"\n#define YesNo(ans) ans ? cout << \"Yes\\n\" : cout << \"No\\n\"\n#define endl '\\n'\n#define fi first\n#define se second\n#define mkpr make_pair\n#define mktpl make_tuple\n#define eb emplace_back\n\nusing namespace std;\nusing ll = int64_t;\nusing ull = uint64_t;\nusing ld = long double;\nusing point = struct{ ll x, y; };\nusing pointld = struct{ ld x, y; };\nusing State = string::const_iterator;\ntemplate<class T> using max_heap = priority_queue<T>;\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vec<vec<T>>;\ntemplate<class T> using vvvec = vec<vvec<T>>;\ntemplate<class T> using vvvvec = vvec<vvec<T>>;\n\nconstexpr ld EPS = 1e-10;\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr ll MOD = (0) ? 998244353 : 1e9+7;\nconstexpr int NIL = -1;\nconstexpr int pm[2] = {1, -1};\nconstexpr int dy[4] = {0, 1, 0, -1};\nconstexpr int dx[4] = {1, 0, -1, 0};\n\nll cel(ll a, ll b){ return (a + b - 1) / b;}\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : abs(a);}\ntemplate<class T> T powi(T x, ll exp){\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : x / x;\n}\nll modpow(ll x, ll exp, ll mod){\n x %= mod;\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\n}\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\n\nusing Pair = pair<ll, ll>;\nusing Tpl = tuple<int, int, int>;\n\nvoid Main(){\n int N; cin >> N;\n vec<int> H(N), W(N);\n rep(i, N) cin >> H[i] >> W[i];\n\n vvec<char> G(4, vec<char>(4));\n rep(i, 4)rep(j, 4) cin >> G[i][j];\n\n const int goal = (1 << 16) - 1;\n queue<Pair> que;\n vec<bool> used(1 << 16, 0);\n que.push(mkpr(0, 0));\n used[0] = 1;\n char col[3] = {'R', 'G', 'B'};\n\n while(!que.empty()){\n Pair p = que.front();\n que.pop();\n int num = p.fi, cst = p.se;\n \n rep(i, N){\n for(int j = -H[i] + 1; j < 4; j++){\n for(int k = -W[i] + 1; k < 4; k++){\n for(int l = 0; l < 3; l++){\n int tmp = num;\n\n for(int a = max(j, ll(0)); a < min(j + H[i], ll(4)); a++){\n for(int b = max(k, ll(0)); b < min(k + W[i], ll(4)); b++){\n if(col[l] == G[a][b]){\n tmp |= (1 << (4 * a + b));\n }\n else{\n //cout << bitset<16>(tmp) << endl;\n tmp &= ~(1 << (4 * a + b));\n //cout << bitset<16>(tmp) << endl;\n }\n }\n }\n\n if(tmp == goal){\n cout << cst + 1 << endl;\n return;\n }\n else{\n if(!used[tmp]){\n used[tmp] = 1;\n que.push(mkpr(tmp, cst + 1));\n }\n }\n }\n }\n }\n }\n }\n\n cout << -1 << endl;\n}\n \nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n Main();\n return 0;\n}","accuracy":1,"time_ms":540,"memory_kb":3936,"score_of_the_acc":-0.2698,"final_rank":5},{"submission_id":"aoj_2297_6725868","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/modint>\nusing namespace std;\n// using namespace atcoder;\nchar G[4][4];\nint n;\nint dist[1 << 17];\nint bi[20];\nvoid solve(){\n\tcin >> n;\n\tvector<pair<int, int>> hw(n);\n\tfor(int i = 0; i < n; i++) cin >> hw[i].first >> hw[i].second;\n\tfor(int i = 0; i < (1 << 16); i++) dist[i] = -1;\n\tfor(int i = 0; i < 4; i++){\n\t\tfor(int j = 0; j < 4; j++){\n\t\t\tcin >> G[i][j];\n\t\t}\n\t}\n\tfor(int i = 0; i < 20; i++) bi[i] = 1 << i;\n\tstring rgb = \"RGB\";\n\tset<pair<int, int>> bits;\n\tfor(auto &[h, w]: hw){\n\t\tfor(auto c:rgb){\t\t\t\t\n\t\t\tfor(int i = -h + 1; i <= 3; i++){\n\t\t\t\tfor(int j = -w + 1; j <= 3; j++){\n\t\t\t\t\tint andbit = (1 << 16) - 1;\n\t\t\t\t\tint orbit = 0;\n\t\t\t\t\tfor(int ii = i; ii < i + h; ii++){\n\t\t\t\t\t\tfor(int jj = j; jj < j + w; jj++){\n\t\t\t\t\t\t\tif(0 <= ii && ii < 4 && 0 <= jj && jj < 4){\n\t\t\t\t\t\t\t\tint ij = ii * 4 + jj;\n\t\t\t\t\t\t\t\tandbit ^= bi[ij];\n\t\t\t\t\t\t\t\tif(G[ii][jj] == c) orbit |= bi[ij];\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\tbits.insert({orbit, andbit});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tdist[0] = 0;\n\tqueue<int> que;\n\tque.push(0);\n\twhile(!que.empty()){\n\t\tint bit = que.front();\n\t\tque.pop();\n\t\tfor(auto &[orbit, andbit]: bits){\n\t\t\tint nbit = bit;\n\t\t\tnbit &= andbit;\n\t\t\tnbit |= orbit;\n\t\t\tif(dist[nbit] == -1){\n\t\t\t\tdist[nbit] = dist[bit] + 1;\n\t\t\t\tque.push(nbit);\n\t\t\t}\n\t\t}\n\t}\n\tcout << dist[(1 << 16) - 1] << \"\\n\";\n\n\n}\n\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n int t;\n t = 1;\n // cin >> t;\n while(t--) solve();\n}","accuracy":1,"time_ms":50,"memory_kb":3844,"score_of_the_acc":-0.0078,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2297_9995285\",\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\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n;\\n cin >> n;\\n vector<int> h(n), w(n);\\n rep(i, n) cin >> h[i] >> w[i];\\n vector<string> s(4);\\n rep(i, 4) cin >> s[i];\\n vector<vector<int>> col(4, vector(4, -1));\\n map<char, int> mp;\\n mp['R'] = 0;\\n mp['B'] = 1;\\n mp['G'] = 2;\\n rep(i, 4) rep(j, 4) col[i][j] = mp[s[i][j]];\\n int inf = 1 << 30;\\n vector<int> dp(1 << 16, inf);\\n dp[0] = 0;\\n queue<int> que;\\n que.push(0);\\n while(!que.empty()) {\\n int now = que.front();\\n que.pop();\\n rep(id, n) {\\n for(int i = -h[id] + 1; i <= 3; i ++) {\\n for(int j = -w[id] + 1; j <= 3; j ++) {\\n rep(c, 3) {\\n int nx = now;\\n int Mini = max(i, 0);\\n int Minj = max(j, 0);\\n int Maxi = min(i + h[id] - 1, 3);\\n int Maxj = min(j + w[id] - 1, 3);\\n for(int ii = Mini; ii <= Maxi; ii ++) {\\n for(int jj = Minj; jj <= Maxj; jj ++) {\\n int idx = (ii * 4 + jj);\\n if(col[ii][jj] == c) {\\n if(nx >> idx & 1) {\\n ;\\n } else {\\n nx ^= (1 << idx);\\n }\\n } else {\\n if(nx >> idx & 1) {\\n nx ^= (1 << idx);\\n } else {\\n ;\\n }\\n }\\n }\\n }\\n if(dp[nx] > dp[now] + 1) {\\n dp[nx] = dp[now] + 1;\\n que.push(nx);\\n }\\n }\\n }\\n }\\n }\\n }\\n cout << dp[(1 << 16) - 1] << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 3648,\n \"score_of_the_acc\": -0.3293,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2297_9995284\",\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\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n;\\n cin >> n;\\n vector<int> h(n), w(n);\\n rep(i, n) cin >> h[i] >> w[i];\\n vector<string> s(4);\\n rep(i, 4) cin >> s[i];\\n vector<vector<int>> col(4, vector(4, -1));\\n map<char, int> mp;\\n mp['R'] = 0;\\n mp['B'] = 1;\\n mp['G'] = 2;\\n rep(i, 4) rep(j, 4) col[i][j] = mp[s[i][j]];\\n int inf = 1 << 30;\\n vector<int> dp(1 << 16, inf);\\n dp[0] = 0;\\n queue<int> que;\\n que.push(0);\\n while(!que.empty()) {\\n int now = que.front();\\n que.pop();\\n rep(id, n) {\\n for(int i = -h[id] + 1; i <= 3; i ++) {\\n for(int j = -w[id] + 1; j <= 3; j ++) {\\n rep(c, 3) {\\n int nx = now;\\n int Mini = max(i, 0);\\n int Minj = max(j, 0);\\n int Maxi = min(i + h[id] - 1, 3);\\n int Maxj = min(j + w[id] - 1, 3);\\n for(int ii = Mini; ii <= Maxi; ii ++) {\\n for(int jj = Minj; jj <= Maxj; jj ++) {\\n int idx = (ii * 4 + jj);\\n if(col[ii][jj] == c) {\\n if(nx >> idx & 1) {\\n ;\\n } else {\\n nx |= (1 << idx);\\n }\\n } else {\\n if(nx >> idx & 1) {\\n nx |= (1 << idx);\\n } else {\\n ;\\n }\\n }\\n }\\n }\\n if(dp[nx] > dp[now] + 1) {\\n dp[nx] = dp[now] + 1;\\n que.push(nx);\\n }\\n }\\n }\\n }\\n }\\n }\\n cout << dp[(1 << 16) - 1] << endl;\\n return 0;\\n}\",\n \"accuracy\": 0.03278688524590164,\n \"time_ms\": 100,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.0266,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2297_9579170\",\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\\nstruct EnumCliques{\\n const int n;\\n int m;\\n vector<vector<int>> g;\\n vector<int> deg;\\n EnumCliques(int _n):n(_n),m(0),g(n,vector<int>(n)),deg(n){}\\n void add_edge(int u,int v){\\n g[u][v]=g[v][u]=1;\\n deg[u]++; deg[v]++;\\n m++;\\n }\\n vector<vector<int>> run(){\\n int L=sqrt(m);\\n vector<vector<int>> res;\\n auto process=[&](vector<int>& vs,bool fix=true)->void{\\n vector<int> nbhd(vs.size());\\n rep(i,0,vs.size())rep(j,0,vs.size())if(i!=j){\\n nbhd[i]|=(!g[vs[i]][vs[j]])<<j;\\n }\\n rep(mask,1,1<<vs.size()){\\n if(fix and (mask&1)==0)continue;;\\n bool check=1;\\n rep(i,0,vs.size())if(mask>>i&1){\\n if(mask&nbhd[i]){\\n check=0;\\n break;\\n }\\n }\\n if(check){\\n vector<int> add;\\n rep(i,0,vs.size())if(mask>>i&1){\\n add.push_back(vs[i]);\\n }\\n res.push_back(add);\\n }\\n }\\n };\\n\\n vector<int> used(n);\\n queue<int> que;\\n rep(v,0,n)if(deg[v]<L){\\n que.push(v);\\n used[v]=1;\\n }\\n while(!que.empty()){\\n int v=que.front();\\n que.pop();\\n vector<int> vs;\\n vs.push_back(v);\\n rep(u,0,n)if(g[v][u])vs.push_back(u);\\n process(vs);\\n rep(u,0,n)if(g[v][u]){\\n g[v][u]=g[u][v]=0;\\n deg[u]--;\\n if(!used[u] and deg[u]<L){\\n que.push(u);\\n used[u]=1;\\n }\\n }\\n }\\n vector<int> vs;\\n rep(v,0,n)if(!used[v])vs.push_back(v);\\n process(vs,false);\\n return res;\\n }\\n};\\n\\n/**\\n * @brief Enumerate Cliques\\n */\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<int> A(N), B(N);\\n rep(i,0,N) cin >> A[i] >> B[i];\\n char C[4][4];\\n rep(i,0,4) rep(j,0,4) cin >> C[i][j];\\n string S = \\\"RGB\\\";\\n vector D(N, vector(3, vector(7, vector<int>(7,0))));\\n vector X(N, vector(3, vector(7, vector<int>(7,0))));\\n rep(i,0,N) {\\n rep(j,0,3) {\\n char T = S[j];\\n rep(k,-3,4) {\\n rep(l,-3,4) {\\n rep(a,0,A[i]) {\\n rep(b,0,B[i]) {\\n int x = a+k, y = b+l;\\n if (0<=x&&x<4&&0<=y&&y<4) {\\n if (C[x][y] != T) D[i][j][k+3][l+3] |= (1<<(x*4+y));\\n X[i][j][k+3][l+3] |= (1<<(x*4+y));\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n vector<int> DP(1<<16,inf);\\n DP[0] = 0;\\n rep(i,0,1<<16) {\\n if (DP[i] == inf) continue;\\n bool BB[4][4] = {};\\n rep(j,0,16) {\\n if (i & (1<<j)) BB[j/4][j%4] = true;\\n }\\n rep(j,0,N) {\\n rep(a,0,3) {\\n char T = S[a];\\n rep(b,0,7) {\\n rep(c,0,7) {\\n if ((i & D[j][a][b][c]) == D[j][a][b][c]) chmin(DP[i|X[j][a][b][c]],DP[i]+1);\\n }\\n }\\n }\\n }\\n }\\n cout << DP[(1<<16)-1] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.0885,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2297_9361542\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\ntemplate<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}\\nistream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}\\n#endif\\n#ifdef LOCAL\\n#include \\\"debug.h\\\"\\n#else\\n#define debug(...) static_cast<void>(0)\\n#define debugg(...) static_cast<void>(0)\\n#define esper(...) static_cast<void>(0)\\ntemplate<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}\\n#endif\\nusing ll=long long;\\nusing ull=unsigned long long;\\nusing P=pair<ll,ll>;\\ntemplate<typename T>using minque=priority_queue<T,vector<T>,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 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 reps(i,a,n) for(int i=(a);i<int(n);i++)\\n#define rep(i,n) reps(i,0,n)\\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)\\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}\\nvoid SOLVE();\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout<<fixed<<setprecision(16);\\n #ifdef LOCAL\\n clock_t start=clock();\\n #endif\\n int testcase=1;\\n //cin>>testcase;\\n for(int i=0;i<testcase;i++){\\n SOLVE();\\n }\\n #ifdef LOCAL\\n cerr<<\\\"time:\\\";\\n cerr<<(clock()-start)/1000;\\n cerr<<\\\"ms\\\\n\\\";\\n #endif\\n}\\nvoid SOLVE(){\\n int n;\\n cin>>n;\\n vector<pair<int,int>>a(n);\\n cin>>a;\\n vector<vector<int>>b(4,vector<int>(4));\\n rep(i,4)rep(j,4){\\n char c;\\n cin>>c;\\n if(c=='R')b[i][j]=0;\\n else if(c=='G')b[i][j]=1;\\n else b[i][j]=2;\\n }\\n vector<int>dp(1<<16,0);\\n for(int i=(1<<16)-1;i--;){\\n dp[i]=1e9;\\n rep(j,n){\\n reps(dx,-a[j].first+1,4)reps(dy,-a[j].second+1,4){\\n int nx=i;\\n int st=-1;\\n rep(x,a[j].first)rep(y,a[j].second){\\n if(x+dx>=0&&y+dy>=0&&x+dx<4&&y+dy<4){\\n if(i>>((x+dx)*4+y+dy)&1)continue;\\n if(st==-1)st=b[x+dx][y+dy];\\n else if(st!=b[x+dx][y+dy])st=-2;\\n nx|=1<<((x+dx)*4+y+dy);\\n }\\n }\\n if(st!=-2)chmin(dp[i],dp[nx]+1);\\n }\\n }\\n }\\n cout<<dp[0]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.3906,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2297_9346755\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint main() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n\\n int N;\\n std::cin >> N;\\n std::vector<int> H(N), W(N);\\n for (int i{} ; i < N ; i++) {\\n std::cin >> H[i] >> W[i];\\n }\\n char input[4][4];\\n int C[4][4];\\n for (int i{} ; i < 4 ; i++) {\\n for (int j{} ; j < 4 ; j++) {\\n std::cin >> input[i][j];\\n if (input[i][j] == 'R') C[i][j] = 0;\\n else if (input[i][j] == 'G') C[i][j] = 1;\\n else if (input[i][j] == 'B') C[i][j] = 2;\\n else assert(false);\\n }\\n }\\n std::vector<int> dp((1 << 16), -1);\\n auto in{[&](int x, int y) -> bool {\\n return 0 <= x and x < 4 and 0 <= y and y < 4;\\n }};\\n auto f{[&](int x, int y) -> int {\\n return x * 4 + y;\\n }};\\n const int INF{(int)1e9};\\n auto rec{[&](auto rec, int bit) -> int {\\n if (dp[bit] != -1) return dp[bit];\\n if (bit == (1 << 16) - 1) return dp[bit] = 0;\\n dp[bit] = INF;\\n for (int i{} ; i < N ; i++) {\\n for (int u{-H[i] + 1} ; u < 4 ; u++) {\\n for (int l{-W[i] + 1} ; l < 4 ; l++) {\\n int app{};\\n int mask{bit};\\n for (int x{std::max(u, 0)} ; x < std::min(4, u + H[i]) ; x++) {\\n for (int y{std::max(l, 0)} ; y < std::min(4, l + W[i]) ; y++) {\\n int val{f(x, y)};\\n if (bit & (1 << val)) continue;\\n app |= (1 << C[x][y]);\\n mask |= (1 << val);\\n }\\n }\\n if (__builtin_popcount(app) == 1) {\\n dp[bit] = std::min(dp[bit], rec(rec, mask) + 1);\\n }\\n }\\n }\\n }\\n return dp[bit];\\n }};\\n std::cout << rec(rec, 0) << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 3464,\n \"score_of_the_acc\": -0.2203,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2297_9004351\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint main() {\\n int N = in();\\n vector<int> H(N), W(N);\\n for(int i : rep(N)) H[i] = in(), W[i] = in();\\n vector<string> C = in(4);\\n vector<int> dist(1 << 16, -1);\\n dist[0] = 0;\\n queue<int> q;\\n q.push(0);\\n while(not q.empty()) {\\n int u = q.front(); q.pop();\\n for(int i = 0; i < N; i++) {\\n for(int dx = 1 - H[i]; dx <= +3; dx++) {\\n for(int dy = 1 - W[i]; dy <= +3; dy++) {\\n for(char c : {'R', 'G', 'B'}) {\\n int v = u;\\n for(int x = max(0, dx); x < min(4, H[i] + dx); x++) {\\n for(int y = max(0, dy); y < min(4, W[i] + dy); y++) {\\n int p = 1 << (x * 4 + y);\\n if(C[x][y] == c) {\\n v |= p;\\n } else {\\n v &= ~p;\\n }\\n }\\n }\\n if(dist[v] == -1) {\\n dist[v] = dist[u] + 1;\\n q.push(v);\\n }\\n }\\n }\\n }\\n }\\n }\\n print(dist[(1 << 16) - 1]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1210,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": -0.6216,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2297_9004350\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint main() {\\n int N = in();\\n vector<int> H(N), W(N);\\n for(int i : rep(N)) H[i] = in(), W[i] = in();\\n vector<string> C = in(4);\\n vector<int> dist(1 << 16, -1);\\n dist[0] = 0;\\n queue<int> q;\\n q.push(0);\\n while(not q.empty()) {\\n int u = q.front(); q.pop();\\n if(u == (1 << 16) - 1) break;\\n for(int i = 0; i < N; i++) {\\n for(int dx = 1 - H[i]; dx <= +3; dx++) {\\n for(int dy = 1 - W[i]; dy <= +3; dy++) {\\n for(char c : {'R', 'G', 'B'}) {\\n int v = u;\\n for(int x = max(0, dx); x < min(4, H[i] + dx); x++) {\\n for(int y = max(0, dy); y < min(4, W[i] + dy); y++) {\\n int p = 1 << (x * 4 + y);\\n if(C[x][y] == c) {\\n v |= p;\\n } else {\\n v &= ~p;\\n }\\n }\\n }\\n if(dist[v] == -1) {\\n dist[v] = dist[u] + 1;\\n q.push(v);\\n }\\n }\\n }\\n }\\n }\\n }\\n print(dist[(1 << 16) - 1]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.2706,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2297_8305259\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\\n\\ntemplate<class T>\\nbool chmin(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\\nint dp[1<<16];\\n\\nvoid init()\\n{\\n\\tfor (int i = 0; i < (1<<16); ++i)\\n\\t{\\n\\t\\tdp[i] = 1e9;\\n\\t}\\n\\treturn;\\n}\\n\\nvoid calc()\\n{\\n\\tint N; cin >> N;\\n\\tvector<int> H(N), W(N);\\n\\tfor (int i = 0; i < N; ++i) {cin >> H[i] >> W[i];}\\n\\t\\n\\tint C[4][4];\\n\\tfor (int i = 0; i < 4; ++i)\\n\\t{\\n\\t\\tfor (int j = 0; j < 4; ++j)\\n\\t\\t{\\n\\t\\t\\tchar c; cin >> c;\\n\\t\\t\\tif (c == 'R') C[i][j] = 0;\\n\\t\\t\\tif (c == 'G') C[i][j] = 1;\\n\\t\\t\\tif (c == 'B') C[i][j] = 2;\\n\\t\\t}\\n\\t}\\n\\t\\n\\tvector<int> cbit(3, 0);\\n\\tfor (int i = 0; i < 4; ++i)\\n\\t{\\n\\t\\tfor (int j = 0; j < 4; ++j)\\n\\t\\t{\\n\\t\\t\\tint c = C[i][j];\\n\\t\\t\\tcbit[c] ^= (1<<(i*4+j));\\n\\t\\t}\\n\\t}\\n\\t\\n\\tinit();\\n\\t\\n\\tdp[0] = 0;\\n\\tfor (int i = 1; i <= 16; ++i)\\n\\t{\\n\\t\\tfor (int n = 0; n < N; ++n)\\n\\t\\t{\\n\\t\\t\\tfor (int x1 = 0; x1 < 3 + H[n]; ++x1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (int y1 = 0; y1 < 3 + W[n]; ++y1)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tint x0 = max(x1 - H[n] + 1, 0);\\n\\t\\t\\t\\t\\tint y0 = max(y1 - W[n] + 1, 0);\\n\\t\\t\\t\\t\\tint mask = 0;\\n\\t\\t\\t\\t\\tfor (int x = x0; x <= min(x1, 3); ++x)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tfor (int y = y0; y <= min(y1, 3); ++y)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tmask ^= (1<<(4*x+y));\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\tfor (int c = 0; c < 3; ++c)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tfor (int bit = 0; bit < (1<<16); ++bit)\\n\\t\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\t\\tif (dp[bit] > 100) {continue;}\\n\\t\\t\\t\\t\\t\\t\\t\\n\\t\\t\\t\\t\\t\\t\\tint nbit = bit & (~mask);\\n\\t\\t\\t\\t\\t\\t\\tnbit |= (mask & cbit[c]);\\n\\t\\t\\t\\t\\t\\t\\tchmin(dp[nbit], dp[bit] + 1);\\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\\tcout << dp[(1<<16)-1] << endl;\\n\\t\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\tcalc();\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1930,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -1.0059,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2297_8024090\",\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 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, r) for (int i = 0; i < (r); 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, r) for (int i = (r)-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(x, a) for (auto &x : 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 IN(x, a, b) ((a) <= (x) && (x) < (b))\\n#define int ll\\n\\ntemplate <class T>\\nvoid DEBUG_(string_view name, const T &a) {\\n cerr << name << \\\": \\\" << a << endl;\\n}\\n\\ntemplate <class T>\\nvoid DEBUG_(string_view name, const vector<T> &a) {\\n cerr << name << \\\": \\\";\\n REP(i, sz(a)) cerr << a[i] << \\\" \\\";\\n cerr << endl;\\n}\\n\\ntemplate <class T, class U>\\nbool chmax(T &x, const U &y) {\\n return x < y ? x = y, 1 : 0;\\n}\\ntemplate <class T, class U>\\nbool chmin(T &x, const U &y) {\\n return x > y ? x = y, 1 : 0;\\n}\\n\\n//-----------------------------------------------------------------------\\n\\nint N;\\nvp HWs;\\nvvl grid;\\n\\nmap<int, int> memo;\\nint dp(const int bit = 0) {\\n // DEBUG(bit);\\n if (bit == (1 << 16) - 1) {\\n return 0;\\n }\\n if (memo.count(bit)) {\\n return memo[bit];\\n }\\n\\n int ans = INF;\\n EACH(h, w, HWs) {\\n REP(h1, 4) {\\n REP2(h2, h1, 4) {\\n if (h2 - h1 + 1 > h) continue;\\n if (1 <= h1 && h2 <= 2 && h2 - h1 + 1 != h) continue;\\n REP(w1, 4) {\\n REP2(w2, w1, 4) {\\n if (w2 - w1 + 1 > w) continue;\\n if (1 <= w1 && w2 <= 2 && w2 - w1 + 1 != w) continue;\\n int seen = -1;\\n int nbit = bit;\\n REP(hh, h1, h2 + 1) {\\n REP(ww, w1, w2 + 1) {\\n if (nbit & (1 << (4 * hh + ww))) continue;\\n nbit |= (1 << (4 * hh + ww));\\n if (seen == -1) {\\n seen = grid[hh][ww];\\n } else if (seen != grid[hh][ww]) {\\n seen = -INFL;\\n break;\\n }\\n }\\n }\\n if (seen == -INFL) continue;\\n if (bit == nbit) continue;\\n chmin(ans, dp(nbit) + 1);\\n }\\n }\\n }\\n }\\n }\\n\\n // DEBUG(bit);\\n // DEBUG(ans);\\n\\n return memo[bit] = ans;\\n}\\n\\nvoid solve() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(15);\\n\\n int N;\\n cin >> N;\\n HWs.resize(N);\\n REP(i, N) {\\n int H, W;\\n cin >> H >> W;\\n HWs[i] = {H, W};\\n }\\n grid.resize(4, vl(4));\\n REP(h, 4) {\\n string S;\\n cin >> S;\\n REP(w, 4) {\\n if (S[w] == 'R') grid[h][w] = 1;\\n if (S[w] == 'G') grid[h][w] = 2;\\n if (S[w] == 'B') grid[h][w] = 3;\\n }\\n }\\n\\n cout << dp() << endl;\\n\\n // EACH(key, val, memo) {\\n // if (val != 0) {\\n // DEBUG(key);\\n // DEBUG(val);\\n // }\\n // }\\n}\\n\\nsigned main() {\\n int T = 1;\\n // cin >> T;\\n\\n while (T--) solve();\\n\\n // random_test();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1680,\n \"memory_kb\": 7564,\n \"score_of_the_acc\": -0.9295,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2297_7140085\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define int ll\\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 per(i, N) for(int i = (N)-1; i >= 0; --i)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bit(n, k) ((n) >> (k))\\n#define pcnt(n) (__builtin_popcount(n))\\n#define TakAo(ans) ans ? cout << \\\"Takahashi\\\\n\\\" : cout << \\\"Aoki\\\\n\\\"\\n#define YesNo(ans) ans ? cout << \\\"Yes\\\\n\\\" : cout << \\\"No\\\\n\\\"\\n#define endl '\\\\n'\\n#define fi first\\n#define se second\\n#define mkpr make_pair\\n#define mktpl make_tuple\\n#define eb emplace_back\\n\\nusing namespace std;\\nusing ll = int64_t;\\nusing ull = uint64_t;\\nusing ld = long double;\\nusing point = struct{ ll x, y; };\\nusing pointld = struct{ ld x, y; };\\nusing State = string::const_iterator;\\ntemplate<class T> using max_heap = priority_queue<T>;\\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vec<vec<T>>;\\ntemplate<class T> using vvvec = vec<vvec<T>>;\\ntemplate<class T> using vvvvec = vvec<vvec<T>>;\\n\\nconstexpr ld EPS = 1e-10;\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr ll MOD = (0) ? 998244353 : 1e9+7;\\nconstexpr int NIL = -1;\\nconstexpr int pm[2] = {1, -1};\\nconstexpr int dy[4] = {0, 1, 0, -1};\\nconstexpr int dx[4] = {1, 0, -1, 0};\\n\\nll cel(ll a, ll b){ return (a + b - 1) / b;}\\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : abs(a);}\\ntemplate<class T> T powi(T x, ll exp){\\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : x / x;\\n}\\nll modpow(ll x, ll exp, ll mod){\\n x %= mod;\\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\\n}\\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\\n\\nusing Pair = pair<ll, ll>;\\nusing Tpl = tuple<int, int, int>;\\n\\nvoid Main(){\\n int N; cin >> N;\\n vec<int> H(N), W(N);\\n rep(i, N) cin >> H[i] >> W[i];\\n\\n vvec<char> G(4, vec<char>(4));\\n rep(i, 4)rep(j, 4) cin >> G[i][j];\\n\\n const int goal = (1 << 16) - 1;\\n queue<Pair> que;\\n vec<bool> used(1 << 16, 0);\\n que.push(mkpr(0, 0));\\n used[0] = 1;\\n char col[3] = {'R', 'G', 'B'};\\n\\n while(!que.empty()){\\n Pair p = que.front();\\n que.pop();\\n int num = p.fi, cst = p.se;\\n \\n rep(i, N){\\n for(int j = -H[i] + 1; j < 4; j++){\\n for(int k = -W[i] + 1; k < 4; k++){\\n for(int l = 0; l < 3; l++){\\n int tmp = num;\\n\\n for(int a = max(j, ll(0)); a < min(j + H[i], ll(4)); a++){\\n for(int b = max(k, ll(0)); b < min(k + W[i], ll(4)); b++){\\n if(col[l] == G[a][b]){\\n tmp |= (1 << (4 * a + b));\\n }\\n else{\\n //cout << bitset<16>(tmp) << endl;\\n tmp &= ~(1 << (4 * a + b));\\n //cout << bitset<16>(tmp) << endl;\\n }\\n }\\n }\\n\\n if(tmp == goal){\\n cout << cst + 1 << endl;\\n return;\\n }\\n else{\\n if(!used[tmp]){\\n used[tmp] = 1;\\n que.push(mkpr(tmp, cst + 1));\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n cout << -1 << endl;\\n}\\n \\nsigned main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 3964,\n \"score_of_the_acc\": -0.2702,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2297_7136393\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing pii = pair<int, int>;\\n#define rep(i, x) for(int i = 0; i < (x); i++)\\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\\n#define sz(x) (int)(x).size()\\n#define all(v) (v).begin(), (v).end()\\n\\nint ctoi(char c) { return c == 'R' ? 2 : c == 'G'; }\\nconst int inf = 1 << 30;\\nint main() {\\n\\tint n;\\n\\tcin >> n;\\n\\tvector<pii> hw;\\n\\trep(i, n) {\\n\\t\\tint u, v;\\n\\t\\tcin >> u >> v;\\n\\t\\thw.emplace_back(u, v);\\n\\t}\\n\\tvector<string> s(4);\\n\\tfor(auto &v : s) cin >> v;\\n\\tint N = 1 << 16;\\n\\tvector<vi> g(N);\\n\\trep(bit, N) {\\n\\t\\tset<int> st;\\n\\t}\\n\\tvi dist(N, inf);\\n\\tdist[0] = 0;\\n\\tqueue<int> que;\\n\\tque.push(0);\\n\\twhile(!que.empty()) {\\n\\t\\tauto bit = que.front();\\n\\t\\tque.pop();\\n\\t\\trep(i, n) {\\n\\t\\t\\tauto [h, w] = hw[i];\\n\\t\\t\\trng(x, -h, 4) {\\n\\t\\t\\t\\trng(y, -w, 4) {\\n\\t\\t\\t\\t\\trep(c, 3) {\\n\\t\\t\\t\\t\\t\\tint to = bit;\\n\\t\\t\\t\\t\\t\\trng(nx, max(0, x), min(4, x + h)) {\\n\\t\\t\\t\\t\\t\\t\\trng(ny, max(0, y), min(4, y + w)) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif(nx >= 0 and nx < 4 and ny >= 0 and ny < 4) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tint id = nx * 4 + ny;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tint col = ctoi(s[nx][ny]);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(c == col) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tto |= 1 << id;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(to >> id & 1) to ^= 1 << id;\\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\\tif(dist[to] != inf) continue;\\n\\t\\t\\t\\t\\t\\tdist[to] = dist[bit] + 1;\\n\\t\\t\\t\\t\\t\\tque.push(to);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << dist.back() << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1220,\n \"memory_kb\": 4972,\n \"score_of_the_acc\": -0.6467,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2297_7136390\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing pii = pair<int, int>;\\n#define rep(i, x) for(int i = 0; i < (x); i++)\\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\\n#define sz(x) (int)(x).size()\\n#define all(v) (v).begin(), (v).end()\\n\\nint ctoi(char c) { return c == 'R' ? 2 : c == 'G'; }\\nconst int inf = 1 << 30;\\nint main() {\\n\\tint n;\\n\\tcin >> n;\\n\\tvector<pii> hw;\\n\\trep(i, n) {\\n\\t\\tint u, v;\\n\\t\\tcin >> u >> v;\\n\\t\\thw.emplace_back(u, v);\\n\\t}\\n\\tvector<string> s(4);\\n\\tfor(auto &v : s) cin >> v;\\n\\tint N = 1 << 16;\\n\\tvector<vi> g(N);\\n\\trep(bit, N) {\\n\\t\\tset<int> st;\\n\\t}\\n\\tvi dist(N, inf);\\n\\tdist[0] = 0;\\n\\tqueue<int> que;\\n\\tque.push(0);\\n\\twhile(!que.empty()) {\\n\\t\\tauto bit = que.front();\\n\\t\\tque.pop();\\n\\t\\trep(i, n) {\\n\\t\\t\\tauto [h, w] = hw[i];\\n\\t\\t\\trng(x, -h, 4) {\\n\\t\\t\\t\\trng(y, -w, 4) {\\n\\t\\t\\t\\t\\trep(c, 3) {\\n\\t\\t\\t\\t\\t\\tint to = bit;\\n\\t\\t\\t\\t\\t\\trep(dx, h) {\\n\\t\\t\\t\\t\\t\\t\\trep(dy, w) {\\n\\t\\t\\t\\t\\t\\t\\t\\tint nx = x + dx, ny = y + dy;\\n\\t\\t\\t\\t\\t\\t\\t\\tif(nx >= 0 and nx < 4 and ny >= 0 and ny < 4) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tint id = nx * 4 + ny;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tint col = ctoi(s[nx][ny]);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif(c == col) {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tto |= 1 << id;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t} else {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\t\\tif(1 >> id & 1) to ^= 1 << id;\\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\\tif(dist[to] != inf) continue;\\n\\t\\t\\t\\t\\t\\tdist[to] = dist[bit] + 1;\\n\\t\\t\\t\\t\\t\\tque.push(to);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << dist.back() << endl;\\n}\",\n \"accuracy\": 0.03278688524590164,\n \"time_ms\": 250,\n \"memory_kb\": 4924,\n \"score_of_the_acc\": -0.13,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2297_7136353\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing pii = pair<int, int>;\\n#define rep(i, x) for(int i = 0; i < (x); i++)\\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\\n#define sz(x) (int)(x).size()\\n#define all(v) (v).begin(), (v).end()\\n\\nint ctoi(char c) { return c == 'R' ? 2 : c == 'G'; }\\nconst int inf = 1 << 30;\\nint main() {\\n\\tint n;\\n\\tcin >> n;\\n\\tvector<pii> hw;\\n\\tset<pii> st;\\n\\trep(i, n) {\\n\\t\\tint u, v;\\n\\t\\tcin >> u >> v;\\n\\t\\trng(x, 1, u + 1) {\\n\\t\\t\\trng(y, 1, v + 1) {\\n\\t\\t\\t\\tst.insert({x, y});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(auto &p : st) hw.push_back(p);\\n\\tn = sz(hw);\\n\\tvector<string> s(4);\\n\\tfor(auto &v : s) cin >> v;\\n\\tint N = 1 << 16;\\n\\tvector<vi> g(N);\\n\\trep(bit, 1 << 16) {\\n\\t\\trep(i, n) {\\n\\t\\t\\tauto [h, w] = hw[i];\\n\\t\\t\\trep(x, 4) {\\n\\t\\t\\t\\trep(y, 4) {\\n\\t\\t\\t\\t\\tif(x + h > 4 or y + w > 4) continue;\\n\\t\\t\\t\\t\\tvector<vi> ids(3), bads(3);\\n\\t\\t\\t\\t\\trep(dx, h) {\\n\\t\\t\\t\\t\\t\\trep(dy, w) {\\n\\t\\t\\t\\t\\t\\t\\tint nx = x + dx, ny = y + dy;\\n\\t\\t\\t\\t\\t\\t\\tint id = nx * 4 + ny;\\n\\t\\t\\t\\t\\t\\t\\tint col = ctoi(s[nx][ny]);\\n\\t\\t\\t\\t\\t\\t\\trep(j, 3) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif(j == col)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tids[j].push_back(id);\\n\\t\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbads[j].push_back(id);\\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\\trep(j, 3) {\\n\\t\\t\\t\\t\\t\\tif(ids[j].empty()) continue;\\n\\t\\t\\t\\t\\t\\tint nb = bit;\\n\\t\\t\\t\\t\\t\\tfor(auto v : ids[j]) {\\n\\t\\t\\t\\t\\t\\t\\tif(!(nb >> v & 1)) nb |= 1 << v;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tfor(auto v : bads[j]) {\\n\\t\\t\\t\\t\\t\\t\\tif(nb >> v & 1) nb ^= 1 << v;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tg[bit].push_back(nb);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvi dist(N, inf);\\n\\tdist[0] = 0;\\n\\tqueue<int> que;\\n\\tque.push(0);\\n\\twhile(!que.empty()) {\\n\\t\\tauto v = que.front();\\n\\t\\tque.pop();\\n\\t\\tfor(auto to : g[v]) {\\n\\t\\t\\tif(dist[to] != inf) continue;\\n\\t\\t\\tdist[to] = dist[v] + 1;\\n\\t\\t\\tque.push(to);\\n\\t\\t}\\n\\t}\\n\\tcout << dist.back() << endl;\\n}\",\n \"accuracy\": 0.03278688524590164,\n \"time_ms\": 1540,\n \"memory_kb\": 71352,\n \"score_of_the_acc\": -1.7926,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2297_7136283\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing pii = pair<int, int>;\\n#define rep(i, x) for(int i = 0; i < (x); i++)\\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\\n#define sz(x) (int)(x).size()\\n#define all(v) (v).begin(), (v).end()\\n\\nint ctoi(char c) { return c == 'R' ? 2 : c == 'G'; }\\nconst int inf = 1 << 30;\\nint main() {\\n\\tint n;\\n\\tcin >> n;\\n\\tvector<pii> hw;\\n\\trep(i, n) {\\n\\t\\tint u, v;\\n\\t\\tcin >> u >> v;\\n\\t\\thw.emplace_back(u, v);\\n\\t}\\n\\tvector<string> s(4);\\n\\tfor(auto &v : s) cin >> v;\\n\\tint N = 1 << 16;\\n\\tvector<vi> g(N);\\n\\trep(bit, 1 << 16) {\\n\\t\\trep(i, n) {\\n\\t\\t\\tauto [h, w] = hw[i];\\n\\t\\t\\trep(x, 4) {\\n\\t\\t\\t\\trep(y, 4) {\\n\\t\\t\\t\\t\\tif(x + h > 4 or y + w > 4) continue;\\n\\t\\t\\t\\t\\tset<char> st;\\n\\t\\t\\t\\t\\tvector<vi> ids(3), bads(3);\\n\\t\\t\\t\\t\\trep(dx, h) {\\n\\t\\t\\t\\t\\t\\trep(dy, w) {\\n\\t\\t\\t\\t\\t\\t\\tint nx = x + dx, ny = y + dy;\\n\\t\\t\\t\\t\\t\\t\\tint id = nx * 4 + ny;\\n\\t\\t\\t\\t\\t\\t\\tint col = ctoi(s[nx][ny]);\\n\\t\\t\\t\\t\\t\\t\\trep(j, 3) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif(j == col)\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tids[j].push_back(id);\\n\\t\\t\\t\\t\\t\\t\\t\\telse\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbads[j].push_back(id);\\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\\trep(j, 3) {\\n\\t\\t\\t\\t\\t\\tif(ids[j].empty()) continue;\\n\\t\\t\\t\\t\\t\\tint nb = bit;\\n\\t\\t\\t\\t\\t\\tfor(auto v : ids[j]) {\\n\\t\\t\\t\\t\\t\\t\\tif(!(nb >> v & 1)) nb |= 1 << v;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tfor(auto v : bads[j]) {\\n\\t\\t\\t\\t\\t\\t\\tif(nb >> v & 1) nb ^= 1 << v;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tg[bit].push_back(nb);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvi dist(N, inf);\\n\\tdist[0] = 0;\\n\\tqueue<int> que;\\n\\tque.push(0);\\n\\twhile(!que.empty()) {\\n\\t\\tauto v = que.front();\\n\\t\\tque.pop();\\n\\t\\tfor(auto to : g[v]) {\\n\\t\\t\\tif(dist[to] != inf) continue;\\n\\t\\t\\tdist[to] = dist[v] + 1;\\n\\t\\t\\tque.push(to);\\n\\t\\t}\\n\\t}\\n\\tcout << dist.back() << endl;\\n}\",\n \"accuracy\": 0.01639344262295082,\n \"time_ms\": 130,\n \"memory_kb\": 13892,\n \"score_of_the_acc\": -0.198,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2297_7136264\",\n \"code_snippet\": \"#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing pii = pair<int, int>;\\n#define rep(i, x) for(int i = 0; i < (x); i++)\\n#define rng(i, l, r) for(int i = (l); i < (r); i++)\\n#define sz(x) (int)(x).size()\\n#define all(v) (v).begin(), (v).end()\\n\\nint ctoi(char c) { return c == 'R' ? 2 : c == 'G'; }\\n\\nint main() {\\n\\tint n;\\n\\tcin >> n;\\n\\tvector<pii> hw;\\n\\trep(i, n) {\\n\\t\\tint u, v;\\n\\t\\tcin >> u >> v;\\n\\t\\thw.emplace_back(u, v);\\n\\t}\\n\\tvector<string> s(4);\\n\\tfor(auto &v : s) cin >> v;\\n\\tvector<int> res(1 << 16, 1 << 30);\\n\\tauto dfs = [&](auto dfs, int bit) -> int {\\n\\t\\tif(bit == 0) return 0;\\n\\t\\tif(res[bit] != (1 << 30)) return res[bit];\\n\\t\\tint ans = 1 << 30;\\n\\t\\trep(i, n) {\\n\\t\\t\\tauto [h, w] = hw[i];\\n\\t\\t\\trep(x, 4) {\\n\\t\\t\\t\\trep(y, 4) {\\n\\t\\t\\t\\t\\tif(x + h > 4 or y + w > 4) continue;\\n\\t\\t\\t\\t\\tset<char> st;\\n\\t\\t\\t\\t\\tvector<vi> ids(3);\\n\\t\\t\\t\\t\\trep(dx, h) {\\n\\t\\t\\t\\t\\t\\trep(dy, w) {\\n\\t\\t\\t\\t\\t\\t\\tint nx = x + dx, ny = y + dy;\\n\\t\\t\\t\\t\\t\\t\\tint id = nx * 4 + ny;\\n\\t\\t\\t\\t\\t\\t\\tif(!(bit >> id & 1)) continue;\\n\\t\\t\\t\\t\\t\\t\\tids[ctoi(s[nx][ny])].push_back(id);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\trep(j, 3) {\\n\\t\\t\\t\\t\\t\\tif(ids[j].empty()) continue;\\n\\t\\t\\t\\t\\t\\tint nb = bit;\\n\\t\\t\\t\\t\\t\\tfor(auto v : ids[j]) nb ^= (1 << v);\\n\\t\\t\\t\\t\\t\\tans = min(ans, dfs(dfs, nb) + 1);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res[bit] = ans;\\n\\t};\\n\\tdfs(dfs, (1 << 16) - 1);\\n\\tcout << res.back() << endl;\\n}\",\n \"accuracy\": 0.03278688524590164,\n \"time_ms\": 120,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.0381,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2297_7000584\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <queue>\\nusing namespace std;\\n\\nchar targ[8][8], state[4][4], tstate[4][4], vis[65536];\\nint stamp[16][2], dist[65536];\\nqueue<int> q;\\n\\nint main(void) {\\n int n, s, t;\\n scanf(\\\"%d\\\", &n);\\n for (int i = 0; i < n; i++) {\\n scanf(\\\"%d %d\\\", &stamp[i][0], &stamp[i][1]);\\n }\\n for (int i = 0; i < 4; i++) {\\n scanf(\\\"%s\\\", targ[i]);\\n for (int j = 0; j < 4; j++) {\\n if (targ[i][j] == 'R') targ[i][j] = 1;\\n else if (targ[i][j] == 'G') targ[i][j] = 2;\\n else targ[i][j] = 3;\\n }\\n }\\n vis[0] = 1;\\n q.push(0);\\n while (q.size()) {\\n s = q.front();\\n q.pop();\\n for (int i = 0; i < 4; i++) {\\n for (int j = 0; j < 4; j++) state[i][j] = ((s >> (i * 4 + j)) & 1);\\n }\\n for (int i = 0; i < n; i++) {\\n for (int j = 1; j <= 3; j++) {\\n for (int x = -stamp[i][0] + 1; x <= 3; x++) {\\n for (int y = -stamp[i][1] + 1; y <= 3; y++) {\\n for (int xx = 0; xx < 4; xx++) {\\n for (int yy = 0; yy < 4; yy++) tstate[xx][yy] = state[xx][yy];\\n }\\n for (int xx = x; xx < x + stamp[i][0]; xx++) {\\n if (xx < 0 || xx >= 4) continue;\\n for (int yy = y; yy < y + stamp[i][1]; yy++) {\\n if (yy < 0 || yy >= 4) continue;\\n if (targ[xx][yy] == j) tstate[xx][yy] = 1;\\n else tstate[xx][yy] = 0;\\n }\\n }\\n t = 0;\\n for (int xx = 0; xx < 4; xx++) {\\n for (int yy = 0; yy < 4; yy++) t += (1 << (xx * 4 + yy)) * tstate[xx][yy];\\n }\\n if (!vis[t]) {\\n vis[t] = 1;\\n q.push(t);\\n dist[t] = dist[s] + 1;\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n printf(\\\"%d\\\\n\\\", dist[65535]);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1790,\n \"memory_kb\": 3420,\n \"score_of_the_acc\": -0.9271,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2297_6757639\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n\\nvector<pair<int,int>> X;\\nvector<vector<char>> A(4,vector<char>(4));\\nint memo[65536];\\n\\nint dfs(int n,int nw){\\n //cout << n << \\\" \\\" << nw << endl;\\n //if(nw == 65471 )cout << n << endl;\\n if(nw == 0){\\n return memo[nw] = 0;\\n }else if(memo[nw]){\\n return memo[nw];\\n }\\n int ret = -1;\\n for(int i = 0; X.size() > i; i++){\\n for(int j = -X[i].first+1; 4 > j; j++){\\n for(int k = -X[i].second+1; 4 > k; k++){\\n int nwc = -1;\\n bool ok = true;\\n int mns = 0;\\n for(int l = 0; X[i].first > l && ok; l++){\\n for(int m = 0; X[i].second > m && ok; m++){\\n int nwy = j+l;\\n int nwx = k+m;\\n if(nwy < 0 || 3 < nwy || nwx < 0 || 3 < nwx)continue;\\n \\n if(!((1<<(nwy*4+nwx)) & nw))continue;\\n //cout << \\\"!!\\\" << nwy << \\\" \\\" << nwx << endl;\\n mns += (1<<(nwy*4+nwx));\\n // if(n == 0 && i == 1 && nwy == 1 && nwx == 2)cout << nw-mns << endl;\\n if(nwc == -1){\\n nwc = A[nwy][nwx];\\n }else if(nwc != A[nwy][nwx]){\\n ok = false;\\n break;\\n }\\n }\\n }\\n // if(n == 0 && i == 1 && j == 1 && k == 2){\\n // cout << ok << \\\" \\\" << nwc << \\\" \\\" << mns << endl;\\n // }\\n //cout << i << \\\" \\\" << j << \\\" \\\" << k <<endl;\\n if(mns == 0)continue;\\n if(ok && nwc!=-1){\\n if(ret == -1)ret = dfs(n+1,nw-mns)+1;\\n else ret = min(ret,(dfs(n+1,nw-mns)+1));\\n }\\n\\n }\\n }\\n }\\n return memo[nw] = ret;\\n}\\n\\nint main(){\\n int n;cin>>n;\\n for(int i = 0; n > i; i++){\\n int x,y;cin>>x>>y;X.push_back({x,y});\\n }\\n \\n int nw = 1;\\n for(int i = 0; 4 > i; i++){\\n for(int j = 0; 4 > j; j++){\\n cin>>A[i][j];\\n nw *= 2;\\n }\\n }\\n cout << dfs(0,nw-1) << endl;\\n //cout << memo[65535-3] << endl;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 3680,\n \"score_of_the_acc\": -0.4415,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2297_6757129\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\nint func(){\\n int n = in();\\n vector<pii> stamps(n);\\n foreach(i,stamps)i=in<pii>();\\n vector<int> need(16);\\n foreach(i,need){\\n char c = in<char>();\\n if(c=='R')i = 1;\\n else if(c=='G')i = 2;\\n else if(c=='B')i = 4;\\n }\\n vector<int> dp(bit(16),-1);\\n method(rec,int,int p){\\n if(p==bit(16)-1)return 0;\\n int &it = dp[p];\\n if(it >= 0)return it;\\n it = INF;\\n foreach(stamp,stamps){\\n rep(i,-stamp.first+1,4+stamp.first-1){\\n rep(j,-stamp.second+1,4+stamp.second-1){\\n int ok = 0;\\n int ps = 0;\\n rep(y,max(0,i),min(4,i+stamp.first)){\\n rep(x,max(0,j),min(4,j+stamp.second)){\\n if(bit(4*y+x)&p)continue;\\n ok |= need[y*4+x];\\n ps |= bit(4*y+x);\\n }\\n }\\n if(__builtin_popcount(ok)==1){\\n chmin(it,rec(p|ps)+1);\\n }\\n }\\n }\\n }\\n return it;\\n };\\n return rec(0);\\n}\\n\\nint main(){\\n println(func());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 530,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -0.2572,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2297_6757127\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define int ll\\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 per(i, N) for(int i = (N)-1; i >= 0; --i)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bit(n, k) ((n) >> (k))\\n#define pcnt(n) (__builtin_popcount(n))\\n#define TakAo(ans) ans ? cout << \\\"Takahashi\\\\n\\\" : cout << \\\"Aoki\\\\n\\\"\\n#define YesNo(ans) ans ? cout << \\\"Yes\\\\n\\\" : cout << \\\"No\\\\n\\\"\\n#define endl '\\\\n'\\n#define fi first\\n#define se second\\n#define mkpr make_pair\\n#define mktpl make_tuple\\n#define eb emplace_back\\n\\nusing namespace std;\\nusing ll = int64_t;\\nusing ull = uint64_t;\\nusing ld = long double;\\nusing point = struct{ ll x, y; };\\nusing pointld = struct{ ld x, y; };\\nusing State = string::const_iterator;\\ntemplate<class T> using max_heap = priority_queue<T>;\\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vec<vec<T>>;\\ntemplate<class T> using vvvec = vec<vvec<T>>;\\ntemplate<class T> using vvvvec = vvec<vvec<T>>;\\n\\nconstexpr ld EPS = 1e-10;\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr ll MOD = (0) ? 998244353 : 1e9+7;\\nconstexpr int NIL = -1;\\nconstexpr int pm[2] = {1, -1};\\nconstexpr int dy[4] = {0, 1, 0, -1};\\nconstexpr int dx[4] = {1, 0, -1, 0};\\n\\nll cel(ll a, ll b){ return (a + b - 1) / b;}\\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : abs(a);}\\ntemplate<class T> T powi(T x, ll exp){\\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : x / x;\\n}\\nll modpow(ll x, ll exp, ll mod){\\n x %= mod;\\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\\n}\\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\\n\\nusing Pair = pair<ll, ll>;\\nusing Tpl = tuple<int, int, int>;\\n\\nvoid Main(){\\n int N; cin >> N;\\n vec<int> H(N), W(N);\\n rep(i, N) cin >> H[i] >> W[i];\\n\\n vvec<char> G(4, vec<char>(4));\\n rep(i, 4)rep(j, 4) cin >> G[i][j];\\n\\n const int goal = (1 << 16) - 1;\\n queue<Pair> que;\\n vec<bool> used(1 << 16, 0);\\n que.push(mkpr(0, 0));\\n used[0] = 1;\\n char col[3] = {'R', 'G', 'B'};\\n\\n while(!que.empty()){\\n Pair p = que.front();\\n que.pop();\\n int num = p.fi, cst = p.se;\\n \\n rep(i, N){\\n for(int j = -H[i] + 1; j < 4; j++){\\n for(int k = -W[i] + 1; k < 4; k++){\\n for(int l = 0; l < 3; l++){\\n int tmp = num;\\n\\n for(int a = max(j, ll(0)); a < min(j + H[i], ll(4)); a++){\\n for(int b = max(k, ll(0)); b < min(k + W[i], ll(4)); b++){\\n if(col[l] == G[a][b]){\\n tmp |= (1 << (4 * a + b));\\n }\\n else{\\n //cout << bitset<16>(tmp) << endl;\\n tmp &= ~(1 << (4 * a + b));\\n //cout << bitset<16>(tmp) << endl;\\n }\\n }\\n }\\n\\n if(tmp == goal){\\n cout << cst + 1 << endl;\\n return;\\n }\\n else{\\n if(!used[tmp]){\\n used[tmp] = 1;\\n que.push(mkpr(tmp, cst + 1));\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n cout << -1 << endl;\\n}\\n \\nsigned main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 540,\n \"memory_kb\": 3936,\n \"score_of_the_acc\": -0.2698,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2297_6725868\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/modint>\\nusing namespace std;\\n// using namespace atcoder;\\nchar G[4][4];\\nint n;\\nint dist[1 << 17];\\nint bi[20];\\nvoid solve(){\\n\\tcin >> n;\\n\\tvector<pair<int, int>> hw(n);\\n\\tfor(int i = 0; i < n; i++) cin >> hw[i].first >> hw[i].second;\\n\\tfor(int i = 0; i < (1 << 16); i++) dist[i] = -1;\\n\\tfor(int i = 0; i < 4; i++){\\n\\t\\tfor(int j = 0; j < 4; j++){\\n\\t\\t\\tcin >> G[i][j];\\n\\t\\t}\\n\\t}\\n\\tfor(int i = 0; i < 20; i++) bi[i] = 1 << i;\\n\\tstring rgb = \\\"RGB\\\";\\n\\tset<pair<int, int>> bits;\\n\\tfor(auto &[h, w]: hw){\\n\\t\\tfor(auto c:rgb){\\t\\t\\t\\t\\n\\t\\t\\tfor(int i = -h + 1; i <= 3; i++){\\n\\t\\t\\t\\tfor(int j = -w + 1; j <= 3; j++){\\n\\t\\t\\t\\t\\tint andbit = (1 << 16) - 1;\\n\\t\\t\\t\\t\\tint orbit = 0;\\n\\t\\t\\t\\t\\tfor(int ii = i; ii < i + h; ii++){\\n\\t\\t\\t\\t\\t\\tfor(int jj = j; jj < j + w; jj++){\\n\\t\\t\\t\\t\\t\\t\\tif(0 <= ii && ii < 4 && 0 <= jj && jj < 4){\\n\\t\\t\\t\\t\\t\\t\\t\\tint ij = ii * 4 + jj;\\n\\t\\t\\t\\t\\t\\t\\t\\tandbit ^= bi[ij];\\n\\t\\t\\t\\t\\t\\t\\t\\tif(G[ii][jj] == c) orbit |= bi[ij];\\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\\tbits.insert({orbit, andbit});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tdist[0] = 0;\\n\\tqueue<int> que;\\n\\tque.push(0);\\n\\twhile(!que.empty()){\\n\\t\\tint bit = que.front();\\n\\t\\tque.pop();\\n\\t\\tfor(auto &[orbit, andbit]: bits){\\n\\t\\t\\tint nbit = bit;\\n\\t\\t\\tnbit &= andbit;\\n\\t\\t\\tnbit |= orbit;\\n\\t\\t\\tif(dist[nbit] == -1){\\n\\t\\t\\t\\tdist[nbit] = dist[bit] + 1;\\n\\t\\t\\t\\tque.push(nbit);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << dist[(1 << 16) - 1] << \\\"\\\\n\\\";\\n\\n\\n}\\n\\nint main(){\\n cin.tie(0)->sync_with_stdio(0);\\n int t;\\n t = 1;\\n // cin >> t;\\n while(t--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3844,\n \"score_of_the_acc\": -0.0078,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1282,"cells":{"group_id":{"kind":"string","value":"aoj_2299_cpp"},"problem_description":{"kind":"string","value":"J: Tiles are Colorful\nICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．\n今日の修行は，流行りのパズルをすばやく解いて，瞬発力を鍛えようというものである．今日挑戦するのは，色とりどりのタイルが並んでいてそれらを上手く消していくパズルだ\n初期状態では，グリッド上のいくつかのマスにタイルが置かれている．各タイルには色がついている．プレイヤーはゲーム開始後，以下の手順で示される操作を何回も行うことができる．\nタイルが置かれていないマスを 1 つ選択し，そのマスを叩く．\n叩いたマスから上に順に辿っていき，タイルが置かれているマスに至ったところでそのタイルに着目する．タイルが置かれているマスがないまま盤面の端に辿り着いたら何にも着目しない．\n同様の操作を叩いたマスから下・左・右方向に対して行う．最大 4 枚のタイルが着目されることになる．\n着目したタイルの中で同じ色のものがあれば，それらのタイルを盤面から取り除く．同じ色のタイルの組が 2 組あれば，それら両方を取り除く．\nタイルを取り除いた枚数と同じ値の得点が入る．\n着目をやめる．\nたとえば，以下のような状況を考えよう．タイルが置かれていないマスはピリオドで，タイルの色はアルファベット大文字で表されている．\n..A.......\n.......B..\n..........\n..B.......\n..A.CC....\nここで上から 2 行目，左から 3 列目のマスを叩く操作を考える．着目することになるタイルは\nA\n,\nB\n,\nB\nの 3 枚であるから，\nB\nの 2 枚が消えて盤面は以下のようになり，2 点を得る．\n..A.......\n..........\n..........\n..........\n..A.CC....\nこのパズルはゆっくりしていると時間切れになってしまい，盤面の一部が見えなくなりどのくらい修行が足りなかったのかがわからなくなってしまう．\n各色のタイルは 2 枚ずつ置かれているが，それらをすべて消せるとは限らないので，予めプログラムに得点の最大値を計算させておきたい．\nInput\nM\nN\nC\n1,1\nC\n1,2\n...\nC\n1,\nN\nC\n2,1\nC\n2,2\n...\nC\n2,\nN\n...\nC\nM\n,1\nC\nM\n,2\n...\nC\nM\n,\nN\n整数\nM\n,\nN\nは盤が 縦\nM\n× 横\nN\nのマス目であることを表す．\nC\ni\n,\nj\nはアルファベット大文字またはピリオド (\n.\n) であり，上から\ni\n行目，左から\nj\n列目のマスについて，アルファベット大文字の場合は置かれているタイルの色を表し，ピリオドの場合はこのマスにタイルが置かれていないことを表す．\n1 ≤\nM\n≤ 500，1 ≤\nN\n≤ 500 を満たす．各アルファベット大文字は入力中に 0 個または 2 個現れる．\nOutput\n得点の最大値を 1 行に出力せよ．\nSample Input 1\n5 10\n..A.......\n.......B..\n..........\n..B.......\n..A.CC....\nSample Output 1\n4\nSample Input 2\n3 3\nABC\nD.D\nCBA\nSample Output 2\n4\nSample Input 3\n5 7\nNUTUBOR\nQT.SZRQ\nSANAGIP\nLMDGZBM\nKLKIODP\nSample Output 3\n34"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2299_9394837","code_snippet":"#include <iostream>\n#include <vector>\n#include <stack>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <string>\n#include <cctype>\n#include <cmath>\nusing namespace std;\nusing ll = long long;\nconst long long INF = (1LL<<60);\nconst long long mod = 998244353;\n#define rep(i, n) for (int i = 0; i < n; i++)\nint m, n;\nvector<string> a;\nll score = 0;\nbool update(int i, int j) {\n bool flag = false;\n map<char, vector<pair<int, int>>> ma;\n int scale = 1;\n // sita\n while (i + scale < m) {\n if (a[i+scale][j] != '.') {\n ma[a[i+scale][j]].push_back(make_pair(i+scale, j));\n break;\n }\n scale++;\n }\n scale = 1;\n // down\n while (i - scale >= 0) {\n if (a[i-scale][j] != '.') {\n ma[a[i-scale][j]].push_back(make_pair(i-scale, j));\n break;\n }\n scale++;\n }\n scale = 1;\n while (j + scale < n) {\n if (a[i][j+scale] != '.') {\n ma[a[i][j+scale]].push_back(make_pair(i, j+scale));\n break;\n }\n scale++;\n }\n scale = 1;\n while (j - scale >= 0) {\n if (a[i][j-scale] != '.') {\n ma[a[i][j-scale]].push_back(make_pair(i, j-scale));\n break;\n }\n scale++;\n }\n for (pair<char, vector<pair<int, int>>> p : ma) {\n if (p.second.size() >= 2) {\n for (pair<int, int> px : p.second) {\n a[px.first][px.second] = '.';\n score++;\n flag = true;\n }\n }\n }\n return flag;\n}\nint main(){\n cin>>m>>n;\n a = vector<string>(m);\n rep(i, m) cin>>a[i];\n while (true) {\n bool flag = false;\n rep(i, m) {\n rep(j, n) {\n if (a[i][j] != '.') continue;\n if (update(i, j)) {\n flag = true;\n break;\n }\n }\n }\n if (!flag) break;\n }\n cout<<score<<endl;\n}","accuracy":1,"time_ms":360,"memory_kb":3936,"score_of_the_acc":-0.283,"final_rank":6},{"submission_id":"aoj_2299_9394696","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 int h, w;\n cin >> h >> w;\n vector<string> s(h);\n rep(i, h) cin >> s[i];\n\n vector<bool> used(26);\n vector<pair<int, int>> st;\n\n auto get = [&](int i, int j, int di, int dj) -> tuple<int, int, int> {\n assert(s[i][j] == '.');\n while (0 <= i && i < h && 0 <= j && j < w && s[i][j] == '.') {\n i += di;\n j += dj;\n }\n if (0 <= i && i < h && 0 <= j && j < w) return {i, j, s[i][j] - 'A'};\n return {-1, -1, -1};\n };\n\n const int DI[] = {1, 0, -1, 0};\n const int DJ[] = {0, 1, 0, -1};\n rep(i, h) rep(j, w) {\n if (s[i][j] != '.') continue;\n vector<int> count(26);\n rep(d, 4) {\n auto [ni, nj, v] = get(i, j, DI[d], DJ[d]);\n if (v != -1) count[v]++;\n }\n rep(k, 26) if (count[k] == 2 && !used[k]) {\n used[k] = true;\n st.emplace_back(i, j);\n break;\n }\n }\n int ans = 0;\n while (!st.empty()) {\n auto [ci, cj] = st.back();\n st.pop_back();\n vector<vector<pair<int, int>>> count(26);\n rep(d, 4) {\n auto [ni, nj, v] = get(ci, cj, DI[d], DJ[d]);\n if (v != -1) {\n count[v].emplace_back(ni, nj);\n }\n }\n rep(k, 26) if (count[k].size() == 2) {\n ans++;\n for (auto [i, j]: count[k]) {\n assert(s[i][j] == k + 'A');\n s[i][j] = '.';\n rep(a, h) if (s[a][j] == '.') st.emplace_back(a, j);\n rep(b, w) if (s[i][b] == '.') st.emplace_back(i, b);\n }\n }\n }\n cout << 2 * ans << '\\n';\n}","accuracy":1,"time_ms":270,"memory_kb":3972,"score_of_the_acc":-0.2412,"final_rank":4},{"submission_id":"aoj_2299_9394680","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 int h, w;\n cin >> h >> w;\n vector<string> s(h);\n rep(i, h) cin >> s[i];\n\n vector<bool> used(26);\n vector<pair<int, int>> st;\n\n auto get = [&](int i, int j, int di, int dj) -> tuple<int, int, int> {\n assert(s[i][j] == '.');\n while (0 <= i && i < h && 0 <= j && j < w && s[i][j] == '.') {\n i += di;\n j += dj;\n }\n if (0 <= i && i < h && 0 <= j && j < w) return {i, j, s[i][j] - 'A'};\n return {-1, -1, -1};\n };\n\n const int DI[] = {1, 0, -1, 0};\n const int DJ[] = {0, 1, 0, -1};\n rep(i, h) rep(j, w) {\n if (s[i][j] != '.') continue;\n vector<int> count(26);\n rep(d, 4) {\n auto [ni, nj, v] = get(i, j, DI[d], DJ[d]);\n if (v != -1) count[v]++;\n }\n rep(k, 26) if (count[k] == 2 && !used[k]) {\n used[k] = true;\n st.emplace_back(i, j);\n break;\n }\n }\n int ans = 0;\n while (!st.empty()) {\n auto [ci, cj] = st.back();\n st.pop_back();\n vector<vector<pair<int, int>>> count(26);\n rep(d, 4) {\n auto [ni, nj, v] = get(ci, cj, DI[d], DJ[d]);\n if (v != -1) {\n count[v].emplace_back(ni, nj);\n }\n }\n bool ok = false;\n rep(k, 26) if (count[k].size() == 2) {\n ans++;\n ok = true;\n for (auto [i, j]: count[k]) {\n assert(s[i][j] == k + 'A');\n s[i][j] = '.';\n st.emplace_back(i, j);\n }\n }\n if (ok) st.emplace_back(ci, cj);\n }\n cout << 2 * ans << '\\n';\n}","accuracy":0.14754098360655737,"time_ms":200,"memory_kb":3860,"score_of_the_acc":-0.1858,"final_rank":15},{"submission_id":"aoj_2299_5990598","code_snippet":"#include<bits/stdc++.h>\nusing ll = long long;\n#define var auto\nconst char newl = '\\n';\n\nusing namespace std;\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\nint main() {\n int h, w;\n cin >> h >> w;\n vector<string> grid(h);\n for (var&& s : grid) cin >> s;\n\n int res = 0;\n while (true) {\n\n\n bool changed = false;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n if (grid[i][j] != '.') continue;\n vector<char*> cs;\n for (int i2 = i; i2 < h; i2++) {\n if (grid[i2][j] != '.') {\n cs.emplace_back(&grid[i2][j]);\n break;\n }\n }\n for (int i2 = i; i2 >= 0; i2--) {\n if (grid[i2][j] != '.') {\n cs.emplace_back(&grid[i2][j]);\n break;\n }\n }\n\n for (int j2 = j; j2 < w; j2++) {\n if (grid[i][j2] != '.') {\n cs.emplace_back(&grid[i][j2]);\n break;\n }\n }\n for (int j2 = j; j2 >= 0; j2--) {\n if (grid[i][j2] != '.') {\n cs.emplace_back(&grid[i][j2]);\n break;\n }\n }\n for (int i = 0; i < cs.size(); i++) {\n for (int j = i + 1; j < cs.size(); j++) {\n if (*cs[i] == *cs[j] && *cs[i] != '.') {\n *cs[i] = '.';\n *cs[j] = '.';\n res += 2;\n changed = true;\n }\n }\n }\n }\n }\n if (not changed) break;\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":360,"memory_kb":3928,"score_of_the_acc":-0.2816,"final_rank":5},{"submission_id":"aoj_2299_5894793","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 ALL(v) (v).begin(), (v).end()\n#define RALL(v) (v).rbegin(), (v).rend()\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(i, n) FOR(i, 0, n)\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 60;\nconstexpr int MOD = 1000000007;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\nint popcount(int x) { return __builtin_popcount(x); }\nll popcount(ll x) { return __builtin_popcountll(x); }\n#pragma endregion Macros\n\nint main() {\n int H, W;\n cin >> H >> W;\n vector<string> G(H);\n REP(i, H) cin >> G[i];\n auto is_in = [&](int i, int j) -> bool {\n return (0 <= i and i < H and 0 <= j and j < W);\n };\n\n int ans = 0;\n while(1) {\n bool upd = false;\n map<char, vector<pair<int, int>>> mp;\n REP(i, H) REP(j, W) if(G[i][j] == '.') {\n mp.clear();\n REP(dir, 4) {\n int ni = i, nj = j;\n while(is_in(ni, nj)) {\n if(G[ni][nj] != '.') {\n mp[G[ni][nj]].emplace_back(ni, nj);\n break;\n }\n ni += dx[dir], nj += dy[dir];\n }\n }\n for(const auto& [key, v] : mp) {\n if(v.size() == 2) {\n for(auto [ni, nj] : v) G[ni][nj] = '.';\n ans += 2;\n upd = true;\n } else assert(v.size() <= 1);\n }\n }\n if(!upd) break;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":840,"memory_kb":3720,"score_of_the_acc":-0.5015,"final_rank":8},{"submission_id":"aoj_2299_5894788","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 ALL(v) (v).begin(), (v).end()\n#define RALL(v) (v).rbegin(), (v).rend()\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(i, n) FOR(i, 0, n)\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 60;\nconstexpr int MOD = 1000000007;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\nint popcount(int x) { return __builtin_popcount(x); }\nll popcount(ll x) { return __builtin_popcountll(x); }\n#pragma endregion Macros\n\nint main() {\n int H, W;\n cin >> H >> W;\n vector<string> G(H);\n REP(i, H) cin >> G[i];\n auto is_in = [&](int i, int j) -> bool {\n return (0 <= i and i < H and 0 <= j and j < W);\n };\n\n int ans = 0;\n while(1) {\n bool upd = false;\n auto loop1 = [&]() {\n map<char, vector<pair<int, int>>> mp;\n REP(i, H) REP(j, W) if(G[i][j] == '.') {\n mp.clear();\n REP(dir, 4) {\n int ni = i, nj = j;\n while(is_in(ni, nj)) {\n if(G[ni][nj] != '.') {\n mp[G[ni][nj]].emplace_back(ni, nj);\n break;\n }\n ni += dx[dir], nj += dy[dir];\n }\n }\n for(const auto& [key, v] : mp) {\n if(v.size() == 2) {\n for(auto [ni, nj] : v) G[ni][nj] = '.';\n ans += 2;\n upd = true;\n } else assert(v.size() <= 1);\n }\n }\n }; loop1();\n if(!upd) break;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":840,"memory_kb":3720,"score_of_the_acc":-0.5015,"final_rank":8},{"submission_id":"aoj_2299_5050108","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int M,N; cin >> M >> N;\n vector<string> C(M);\n for (int i=0;i<M;++i) cin >> C[i];\n\n vector<vector<pair<int,int>>> pos(26);\n for (int i=0;i<M;++i){\n for (int j=0;j<N;++j){\n if (C[i][j]=='.') continue;\n pos[C[i][j]-'A'].emplace_back(i,j);\n }\n }\n\n vector<pair<int,int>> cand;\n for (int i=0;i<26;++i){\n if (pos[i].empty()) continue;\n auto p=pos[i][0],q=pos[i][1];\n if (p.first==q.first){\n if (p.second>q.second) swap(p,q);\n for (int j=p.second+1;j<q.second;++j){\n cand.emplace_back(p.first,j);\n }\n } else if (p.second==q.second){\n if (p.first>q.first) swap(p,q);\n for (int j=p.first+1;j<q.first;++j){\n cand.emplace_back(j,p.second);\n }\n } else {\n cand.emplace_back(p.first,q.second);\n cand.emplace_back(q.first,p.second);\n }\n }\n\n int ans=0;\n auto search=[&](int x,int y,int i){\n while (1){\n x+=dx[i]; y+=dy[i];\n if (x<0||M<=x||y<0||N<=y) break;\n if (C[x][y]=='.') continue;\n return C[x][y];\n }\n return '.';\n };\n\n auto erase=[&](int i){\n C[pos[i][0].first][pos[i][0].second]='.';\n C[pos[i][1].first][pos[i][1].second]='.';\n ans+=2;\n };\n\n auto check=[&](pair<int,int> p){\n int x=p.first,y=p.second;\n if (C[x][y]!='.') return;\n vector<char> v;\n for (int i=0;i<4;++i){\n char c=search(x,y,i);\n if (c!='.') v.emplace_back(c);\n }\n for (int i=0;i<v.size();++i){\n for (int j=i+1;j<v.size();++j){\n if (v[i]==v[j]){\n erase(v[i]-'A');\n }\n }\n }\n };\n\n for (int _=0;_<26;++_){\n for (auto p:cand){\n check(p);\n }\n }\n\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":170,"memory_kb":3360,"score_of_the_acc":-0.0879,"final_rank":2},{"submission_id":"aoj_2299_5050107","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\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int M,N; cin >> M >> N;\n vector<string> C(M);\n for (int i=0;i<M;++i) cin >> C[i];\n\n vector<vector<pair<int,int>>> pos(26);\n for (int i=0;i<M;++i){\n for (int j=0;j<N;++j){\n if (C[i][j]=='.') continue;\n pos[C[i][j]-'A'].emplace_back(i,j);\n }\n }\n\n vector<pair<int,int>> cand;\n for (int i=0;i<26;++i){\n if (pos[i].empty()) continue;\n auto p=pos[i][0],q=pos[i][1];\n if (p.first==q.first){\n if (p.second>q.second) swap(p,q);\n for (int j=p.second+1;j<q.second;++j){\n cand.emplace_back(p.first,j);\n }\n } else if (p.second==q.second){\n if (p.first>q.first) swap(p,q);\n for (int j=p.first+1;j<q.first;++j){\n cand.emplace_back(j,p.second);\n }\n } else {\n cand.emplace_back(p.first,q.second);\n cand.emplace_back(q.first,p.second);\n }\n }\n\n int ans=0;\n auto search=[&](int x,int y,int i){\n while (1){\n x+=dx[i]; y+=dy[i];\n if (x<0||M<=x||y<0||N<=y) break;\n if (C[x][y]=='.') continue;\n return C[x][y];\n }\n return '.';\n };\n\n auto erase=[&](int i){\n C[pos[i][0].first][pos[i][0].second]='.';\n C[pos[i][1].first][pos[i][1].second]='.';\n ans+=2;\n };\n\n auto check=[&](pair<int,int> p){\n int x=p.first,y=p.second;\n if (C[x][y]!='.') return;\n vector<char> v;\n for (int i=0;i<4;++i){\n char c=search(x,y,i);\n if (c!='.') v.emplace_back(c);\n }\n for (int i=0;i<v.size();++i){\n for (int j=i+1;j<v.size();++j){\n if (v[i]==v[j]){\n erase(v[i]-'A');\n }\n }\n }\n };\n\n for (int _=0;_<26;++_){\n for (auto p:cand){\n check(p);\n }\n }\n\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":170,"memory_kb":3360,"score_of_the_acc":-0.0879,"final_rank":2},{"submission_id":"aoj_2299_4963464","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\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n int n, m; cin >> n >> m;\n vector<string> s(n);\n map<char, pair<P, P>> mp;\n REP(i, n) {\n cin >> s[i];\n REP(j, m) {\n if(s[i][j] != '.') {\n if(mp.find(s[i][j]) == mp.end()) {\n mp[s[i][j]] = {{i, j}, {-1, -1}};\n } else {\n mp[s[i][j]].second = {i, j};\n }\n }\n }\n }\n\n map<char, vector<P>> koho;\n for(auto &e: mp) {\n int i1, j1, i2, j2;\n tie(i1, j1) = e.second.first;\n tie(i2, j2) = e.second.second;\n\n vector<P> v;\n if(i1 == i2) {\n for(int j = min(j1, j2)+1; j < max(j1, j2);++j) {\n v.emplace_back(i1, j);\n }\n } else if(j1 == j2) {\n for(int i = min(i1, i2)+1; i < max(i1, i2);++i) {\n v.emplace_back(i, j1);\n }\n } else {\n v.emplace_back(i1, j2);\n v.emplace_back(i2, j1);\n }\n koho[e.first] = v;\n }\n\n int ans = 0;\n bool upd = true;\n while(upd) {\n upd = false;\n\n for(auto &e1: koho) {\n for(auto &e2: e1.second) {\n int i1, j1;\n tie(i1, j1) = e2;\n int i2, j2;\n tie(i2, j2) = mp[e1.first].first;\n\n bool ok = true;\n if(j1 == j2) {\n for (int i = min(i1, i2); i <= max(i1, i2); ++i) {\n ok &= s[i][j1] == '.' || s[i][j1] == e1.first;\n }\n } else {\n for(int j = min(j1, j2); j <= max(j1, j2); ++j) {\n ok &= s[i1][j] == '.' || s[i1][j] == e1.first;\n }\n }\n\n tie(i2, j2) = mp[e1.first].second;\n if(j1 == j2) {\n for (int i = min(i1, i2); i <= max(i1, i2); ++i) {\n ok &= s[i][j1] == '.' || s[i][j1] == e1.first;\n }\n } else {\n for(int j = min(j1, j2); j <= max(j1, j2); ++j) {\n ok &= s[i1][j] == '.' || s[i1][j] == e1.first;\n }\n }\n if(ok) {\n ans += 2;\n s[i2][j2] = '.';\n tie(i2, j2) = mp[e1.first].first;\n s[i2][j2] = '.';\n upd = true;\n break;\n }\n }\n\n if(upd) {\n koho.erase(e1.first);\n break;\n }\n }\n\n if(!upd) break;\n }\n\n cout << ans << endl;\n\n\n\n\n\n\n\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3672,"score_of_the_acc":-0.065,"final_rank":1},{"submission_id":"aoj_2299_4933753","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n clock_t start = clock();\n auto ord = [](char c) {\n if (c < 'a') {\n return int(c - 'A');\n }\n return int(26 + c - 'a');\n };\n\n int m, n;\n cin >> m >> n;\n vector<string> v(m);\n vector<bool> check(26);\n vector<int> ys(52), xs(52);\n for (int i = 0; i < m; i++) {\n cin >> v[i];\n for (int j = 0; j < n; j++) {\n char c = v[i][j];\n if (c == '.') continue;\n if (!check[ord(c)]) {\n check[ord(c)] = 1;\n c -= ('A' - 'a');\n }\n ys[ord(c)] = i, xs[ord(c)] = j;\n }\n }\n\n vector<set<int>> sty(n), stx(m);\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < n; j++) {\n if (v[i][j] != '.') stx[i].insert(j);\n }\n }\n for (int j = 0; j < n; j++) {\n for (int i = 0; i < m; i++) {\n if (v[i][j] != '.') sty[j].insert(i);\n }\n }\n\n auto ERASE = [&](char a, char b) {\n int ya = ys[ord(a)], xa = xs[ord(a)];\n int yb = ys[ord(b)], xb = xs[ord(b)];\n if (ya == yb) {\n if (xa > xb) swap(xa, xb);\n if (xb - xa == 1) return 0;\n if (*stx[ya].upper_bound(xa) == xb) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n return 0;\n }\n if (xa == xb) {\n if (ya > yb) swap(ya, yb);\n if (yb - ya == 1) return 0;\n if (*sty[xa].upper_bound(ya) == yb) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n return 0;\n }\n\n if (xa > xb) {\n swap(xa, xb);\n swap(ya, yb);\n }\n if (ya > yb) {\n {\n bool ok = 1;\n auto itra = sty[xa].find(ya);\n ok &= itra == sty[xa].begin() || *(--itra) < yb;\n auto itrb = stx[yb].find(xb);\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n {\n bool ok = 1;\n auto itra = stx[ya].find(xa);\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\n auto itrb = sty[xb].find(yb);\n ok &= itrb == (--sty[xb].end()) || *(++itrb) > ya;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n return 0;\n } else {\n {\n bool ok = 1;\n auto itra = sty[xa].find(ya);\n ok &= itra == (--sty[xa].end()) || *(++itra) > yb;\n auto itrb = stx[yb].find(xb);\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n {\n bool ok = 1;\n auto itra = stx[ya].find(xa);\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\n auto itrb = sty[xb].find(yb);\n ok &= itrb == sty[xb].begin() || *(--itrb) < ya;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n return 0;\n }\n };\n\n queue<pair<char, char>> q;\n for (int i = 0; i < 26; i++)\n if (check[i]) q.emplace('A' + i, 'a' + i);\n\n int ans = 0;\n while (!q.empty()) {\n auto [a, b] = q.front();\n q.pop();\n if (ERASE(a, b))\n ans += 2;\n else\n q.emplace(a, b);\n clock_t end = clock();\n const double time =\n static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\n if (time > 1900) break;\n }\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":1900,"memory_kb":3992,"score_of_the_acc":-1.107,"final_rank":12},{"submission_id":"aoj_2299_4933723","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n clock_t start = clock();\n auto ord = [](char c) {\n if (c < 'a') {\n return int(c - 'A');\n }\n return int(26 + c - 'a');\n };\n\n int m, n;\n cin >> m >> n;\n vector<string> v(m);\n vector<bool> check(26);\n vector<int> ys(52), xs(52);\n for (int i = 0; i < m; i++) {\n cin >> v[i];\n for (int j = 0; j < n; j++) {\n char c = v[i][j];\n if (c == '.') continue;\n if (!check[ord(c)]) {\n check[ord(c)] = 1;\n c -= ('A' - 'a');\n }\n ys[ord(c)] = i, xs[ord(c)] = j;\n }\n }\n\n vector<set<int>> sty(n), stx(m);\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < n; j++) {\n if (v[i][j] != '.') stx[i].insert(j);\n }\n }\n for (int j = 0; j < n; j++) {\n for (int i = 0; i < m; i++) {\n if (v[i][j] != '.') sty[j].insert(i);\n }\n }\n\n auto erase = [&](char a, char b) {\n int ya = ys[ord(a)], xa = xs[ord(a)];\n int yb = ys[ord(b)], xb = xs[ord(b)];\n if (ya == yb) {\n if (xa > xb) swap(xa, xb);\n if (xb - xa == 1) return 0;\n if (*stx[ya].upper_bound(xa) == xb) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n return 0;\n }\n if (xa == xb) {\n if (ya > yb) swap(ya, yb);\n if (yb - ya == 1) return 0;\n if (*sty[xa].upper_bound(ya) == yb) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n return 0;\n }\n\n if (xa > xb) {\n swap(xa, xb);\n swap(ya, yb);\n }\n if (ya < yb) {\n {\n bool ok = 1;\n auto itra = sty[xa].find(ya);\n ok &= itra == sty[xa].begin() || *(--itra) < yb;\n auto itrb = stx[yb].find(xb);\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n {\n bool ok = 1;\n auto itra = stx[ya].find(xa);\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\n auto itrb = sty[xb].find(yb);\n ok &= itrb == (--sty[xb].end()) || *(++itrb) > ya;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n return 0;\n } else {\n {\n bool ok = 1;\n auto itra = sty[xa].find(ya);\n ok &= itra == (--sty[xa].end()) || *(++itra) > yb;\n auto itrb = stx[yb].find(xb);\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n {\n bool ok = 1;\n auto itra = stx[ya].find(xa);\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\n auto itrb = sty[xb].find(yb);\n ok &= itrb == sty[xb].begin() || *(--itrb) < ya;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n return 0;\n }\n };\n\n queue<pair<char, char>> q;\n for (int i = 0; i < 26; i++)\n if (check[i]) q.emplace('A' + i, 'a' + i);\n\n int ans = 0;\n int cnt = 0;\n while (!q.empty()) {\n auto [a, b] = q.front();\n q.pop();\n if (erase(a, b))\n ans += 2;\n else\n q.emplace(a, b);\n clock_t end = clock();\n const double time =\n static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\n if (time > 1900) break;\n }\n cout << ans << '\\n';\n}","accuracy":0.14754098360655737,"time_ms":1900,"memory_kb":3752,"score_of_the_acc":-1.0676,"final_rank":18},{"submission_id":"aoj_2299_4933707","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n clock_t start = clock();\n auto ord = [](char c) {\n if (c < 'a') {\n return int(c - 'A');\n }\n return int(26 + c - 'a');\n };\n\n int m, n;\n cin >> m >> n;\n vector<string> v(m);\n vector<bool> check(26);\n vector<int> ys(52), xs(52);\n for (int i = 0; i < m; i++) {\n cin >> v[i];\n for (int j = 0; j < n; j++) {\n char c = v[i][j];\n if (c == '.') continue;\n if (!check[ord(c)]) {\n check[ord(c)] = 1;\n c -= ('A' - 'a');\n }\n ys[ord(c)] = i, xs[ord(c)] = j;\n }\n }\n\n vector<set<int>> sty(52), stx(52);\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < n; j++) {\n if (v[i][j] != '.') stx[i].insert(j);\n }\n }\n for (int j = 0; j < n; j++) {\n for (int i = 0; i < m; i++) {\n if (v[i][j] != '.') sty[j].insert(i);\n }\n }\n\n auto erase = [&](char a, char b) {\n int ya = ys[ord(a)], xa = xs[ord(a)];\n int yb = ys[ord(b)], xb = xs[ord(b)];\n if (ya == yb) {\n if (xa > xb) swap(xa, xb);\n if (xb - xa == 1) return 0;\n if (*stx[ya].upper_bound(xa) == xb) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n return 0;\n }\n if (xa == xb) {\n if (ya > yb) swap(ya, yb);\n if (yb - ya == 1) return 0;\n if (*sty[xa].upper_bound(ya) == yb) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n return 0;\n }\n\n if (xa > xb) {\n swap(xa, xb);\n swap(ya, yb);\n }\n if (ya < yb) {\n {\n bool ok = 1;\n auto itra = sty[xa].find(ya);\n ok &= itra == sty[xa].begin() || *(--itra) < yb;\n auto itrb = stx[yb].find(xb);\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n {\n bool ok = 1;\n auto itra = stx[ya].find(xa);\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\n auto itrb = sty[xb].find(yb);\n ok &= itrb == (--sty[xb].end()) || *(++itrb) > ya;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n return 0;\n } else {\n {\n bool ok = 1;\n auto itra = sty[xa].find(ya);\n ok &= itra == (--sty[xa].end()) || *(++itra) > yb;\n auto itrb = stx[yb].find(xb);\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n {\n bool ok = 1;\n auto itra = stx[ya].find(xa);\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\n auto itrb = sty[xb].find(yb);\n ok &= itrb == sty[xb].begin() || *(--itrb) < ya;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n return 0;\n }\n };\n\n queue<pair<char, char>> q;\n for (int i = 0; i < 26; i++)\n if (check[i]) q.emplace('A' + i, 'a' + i);\n\n int ans = 0;\n int cnt = 0;\n while (!q.empty()) {\n auto [a, b] = q.front();\n q.pop();\n if (erase(a, b))\n ans += 2;\n else\n q.emplace(a, b);\n clock_t end = clock();\n const double time =\n static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\n if (time > 1000) break;\n }\n cout << ans << '\\n';\n}","accuracy":0.08196721311475409,"time_ms":990,"memory_kb":3864,"score_of_the_acc":-0.6045,"final_rank":19},{"submission_id":"aoj_2299_4933703","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n clock_t start = clock();\n auto ord = [](char c) {\n if (c < 'a') {\n return int(c - 'A');\n }\n return int(26 + c - 'a');\n };\n\n int m, n;\n cin >> m >> n;\n vector<string> v(m);\n vector<bool> check(26);\n vector<int> ys(52), xs(52);\n for (int i = 0; i < m; i++) {\n cin >> v[i];\n for (int j = 0; j < n; j++) {\n char c = v[i][j];\n if (c == '.') continue;\n if (!check[ord(c)]) {\n check[ord(c)] = 1;\n c -= ('A' - 'a');\n }\n ys[ord(c)] = i, xs[ord(c)] = j;\n }\n }\n\n vector<set<int>> sty(52), stx(52);\n for (int i = 0; i < m; i++) {\n for (int j = 0; j < n; j++) {\n if (v[i][j] != '.') stx[i].insert(j);\n }\n }\n for (int j = 0; j < n; j++) {\n for (int i = 0; i < m; i++) {\n if (v[i][j] != '.') sty[j].insert(i);\n }\n }\n\n auto erase = [&](char a, char b) {\n int ya = ys[ord(a)], xa = xs[ord(a)];\n int yb = ys[ord(b)], xb = xs[ord(b)];\n if (ya == yb) {\n if (xa > xb) swap(xa, xb);\n if (xb - xa == 1) return 0;\n if (*stx[ya].upper_bound(xa) == xb) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n return 0;\n }\n if (xa == xb) {\n if (ya > yb) swap(ya, yb);\n if (yb - ya == 1) return 0;\n if (*sty[xa].upper_bound(ya) == yb) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n return 0;\n }\n\n if (xa > xb) {\n swap(xa, xb);\n swap(ya, yb);\n }\n if (ya < yb) {\n {\n bool ok = 1;\n auto itra = sty[xa].find(ya);\n ok &= itra == sty[xa].begin() || *(--itra) < yb;\n auto itrb = stx[yb].find(xb);\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n {\n bool ok = 1;\n auto itra = stx[ya].find(xa);\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\n auto itrb = sty[xb].find(yb);\n ok &= itrb == (--sty[xb].end()) || *(++itrb) > ya;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n return 0;\n } else {\n {\n bool ok = 1;\n auto itra = sty[xa].find(ya);\n ok &= itra == (--sty[xa].end()) || *(++itra) > yb;\n auto itrb = stx[yb].find(xb);\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n {\n bool ok = 1;\n auto itra = stx[ya].find(xa);\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\n auto itrb = sty[xb].find(yb);\n ok &= itrb == sty[xb].begin() || *(--itrb) < ya;\n if (ok) {\n stx[ya].erase(xa);\n stx[yb].erase(xb);\n sty[xa].erase(ya);\n sty[xb].erase(yb);\n return 1;\n }\n }\n return 0;\n }\n };\n\n queue<pair<char, char>> q;\n for (int i = 0; i < 26; i++)\n if (check[i]) q.emplace('A' + i, 'a' + i);\n\n int ans = 0;\n int cnt = 0;\n while (!q.empty()) {\n auto [a, b] = q.front();\n q.pop();\n if (erase(a, b))\n ans += 2;\n else\n q.emplace(a, b);\n clock_t end = clock();\n const double time =\n static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\n if (time > 1900) break;\n }\n cout << ans << '\\n';\n}","accuracy":0.08196721311475409,"time_ms":1890,"memory_kb":3848,"score_of_the_acc":-1.078,"final_rank":20},{"submission_id":"aoj_2299_4911849","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nint dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};\n\nint H, W;\nvector<string> grid;\nvector<int> erase_c[501][501];\nvector<Pii> c[26];\nint ans = 0;\nbool used[501][501];\n\nint main() {\n cin >> H >> W;\n grid.resize(H);\n\n for ( int i = 0; i < H; i++ ) {\n cin >> grid[i];\n for ( int j = 0; j < W; j++ ) {\n if ( grid[i][j] == '.' ) continue;\n c[grid[i][j]-'A'].push_back(Pii(i, j)); \n }\n } \n\n bool flag = true;\n while ( flag ) {\n flag = false;\n for ( int i = 0; i < H; i++ ) {\n for ( int j = 0; j < W; j++ ) {\n\tif ( grid[i][j] != '.' ) continue;\n\tvector<int> cnt(26, 0); \n\tfor ( int k = 0; k < 4; k++ ) {\n\t int nx = j+dx[k], ny = i+dy[k];\n\t while ( 1 ) {\n\t if ( nx < 0 || ny < 0 || nx >= W || ny >= H ) break;\n\t if ( grid[ny][nx] != '.' ) {\n\t cnt[grid[ny][nx]-'A']++;\n\t break;\n\t }\n\t nx += dx[k]; ny += dy[k];\n\t }\n\t}\n\n\tfor ( int k = 0; k < 26; k++ ) {\n\t if ( cnt[k] == 2 ) {\n\t ans += 2;\n\t for ( Pii p: c[k] ) grid[p.first][p.second] = '.';\n\t flag = true;\n\t break;\t \n\t }\n\t}\n }\n }\n }\n\n cout << ans << endl; \n \n return 0;\n}","accuracy":1,"time_ms":1140,"memory_kb":9252,"score_of_the_acc":-1.5677,"final_rank":14},{"submission_id":"aoj_2299_4908696","code_snippet":"#include <bits/stdc++.h> \nusing namespace std;\n#define FOR(i,l,r) for(int i=(l); i<(r); i++)\n#define REP(i,n) FOR(i,0,n)\n#define int long long \n#define endl \"\\n\"\n#define debug(x) cout<<x<<endl;\nstatic const int INF = 1e9+7;\n\nint N,M;\nchar C[550][550];\nvector<pair<int,int> > p;\n\nint search(int x, int y){\n map<char,int> mp;\n\n //左を見る\n for(int j=x-1; j>=0; j--){\n if(C[y][j] != '.'){\n mp[C[y][j]]++;\n break;\n }\n }\n\n //右を見る\n for(int j=x+1; j<N; j++){\n if(C[y][j] != '.'){\n mp[C[y][j]]++;\n break;\n }\n }\n\n //下を見る\n for(int i=y+1; i<M; i++){\n if(C[i][x] != '.'){\n mp[C[i][x]]++;\n break;\n }\n }\n\n for(int i=y-1; i>=0; i--){\n if(C[i][x] != '.'){\n mp[C[i][x]]++;\n break;\n }\n }\n\n int add = 0;\n\n for(auto a : mp){\n if(a.second == 2){\n for(int i=0; i<M; i++){\n for(int j=0; j<N; j++){\n if(C[i][j] == a.first){\n C[i][j] = '.';\n p.push_back({i,j});\n }\n }\n }\n add += 2;\n }\n }\n\n return add;\n}\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n cin>>M>>N;\n\n REP(i,M){\n REP(j,N){\n cin>>C[i][j];\n if(C[i][j] == '.') p.push_back({i,j});\n }\n }\n\n int ans = 0;\n\n while(1){\n bool flag = false;\n\n for(auto a : p){\n int y = a.first;\n int x = a.second;\n int add;\n\n if((add = search(x,y))){\n flag = true;\n ans += add;\n }\n }\n\n if(!flag) break;\n\n /*REP(i,M){\n REP(j,N) debug(C[i][j]);\n }*/\n }\n\n /*for(auto a : p){\n debug(a.first);\n debug(a.second);\n }*/\n\n cout<<ans<<endl;\n}","accuracy":1,"time_ms":310,"memory_kb":9436,"score_of_the_acc":-1.1587,"final_rank":13},{"submission_id":"aoj_2299_4907609","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nint H, W;\nvector<string> grid;\nvector<int> erase_c[501][501];\nvector<Pii> c[26];\nint ans = 0;\nbool used[501][501];\n\nvoid dfs(int h, int w) {\n if ( used[h][w] ) return;\n if ( grid[h][w] != '.' ) ans++;\n used[h][w] = true;\n // cout << h << \" \" << w << \" \" << grid[h][w] << endl; \n\n for ( int a: erase_c[h][w] ) {\n for ( Pii p: c[a] ) {\n int y = p.first, x = p.second;\n if ( used[y][x] ) continue;\n dfs(y, x); \n }\n }\n}\n\nint main() {\n cin >> H >> W;\n grid.resize(H);\n\n for ( int i = 0; i < H; i++ ) {\n cin >> grid[i];\n for ( int j = 0; j < W; j++ ) {\n if ( grid[i][j] == '.' ) continue;\n c[grid[i][j]-'A'].push_back(Pii(i, j)); \n }\n } \n\n for ( int a = 0; a < 26; a++ ) { \n if ( c[a].size() == 0 ) continue;\n\n for ( int i = 0; i < H; i++ ) {\n for ( int j = 0; j < W; j++ ) {\n\tif ( (i == c[a][0].first && j == c[a][1].second) || \n\t (i == c[a][1].first && j == c[a][0].second) ||\n\t (i == c[a][0].first && i == c[a][1].first) ||\n\t (j == c[a][0].second && j == c[a][1].second) ) {\n\t // cout << \" \" << a << endl;\t \n\t if ( c[a][0].first == c[a][1].first ) {\n\t if ( (c[a][0].second <= j && j <= c[a][1].second ) ||\n\t\t (c[a][1].second <= j && j <= c[a][0].second ) ) {\n\t // cout << i << \" \" << j << \" \" << a << endl;\t \n\t erase_c[i][j].push_back(a);\n\t }\n\t } else if ( c[a][0].first == c[a][1].first ) {\t \n\t if ( (c[a][0].first <= i && i <= c[a][1].first ) ||\n\t\t (c[a][1].first <= i && i <= c[a][0].first ) ) erase_c[i][j].push_back(a);\n\t }\n\t else erase_c[i][j].push_back(a);\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 if ( used[i][j] || grid[i][j] != '.' ) continue;\n dfs(i, j);\n }\n }\n\n cout << ans << endl; \n \n return 0;\n}","accuracy":0.14754098360655737,"time_ms":10,"memory_kb":9280,"score_of_the_acc":-0.9744,"final_rank":16},{"submission_id":"aoj_2299_4907604","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nint H, W;\nvector<string> grid;\nvector<int> erase_c[501][501];\nvector<Pii> c[26];\nint ans = 0;\nbool used[501][501];\n\nvoid dfs(int h, int w) {\n if ( used[h][w] ) return;\n if ( grid[h][w] != '.' ) ans++;\n used[h][w] = true;\n // cout << h << \" \" << w << \" \" << grid[h][w] << endl; \n\n for ( int a: erase_c[h][w] ) {\n for ( Pii p: c[a] ) {\n int y = p.first, x = p.second;\n if ( used[y][x] ) continue;\n dfs(y, x); \n }\n }\n}\n\nint main() {\n cin >> H >> W;\n grid.resize(H);\n\n for ( int i = 0; i < H; i++ ) {\n cin >> grid[i];\n for ( int j = 0; j < W; j++ ) {\n if ( grid[i][j] == '.' ) continue;\n c[grid[i][j]-'A'].push_back(Pii(i, j)); \n }\n } \n\n for ( int a = 0; a < 26; a++ ) { \n if ( c[a].size() == 0 ) continue;\n\n for ( int i = 0; i < H; i++ ) {\n for ( int j = 0; j < W; j++ ) {\n\tif ( (i == c[a][0].first && j == c[a][1].second) || \n\t (i == c[a][1].first && j == c[a][0].second) ||\n\t (i == c[a][0].first && i == c[a][1].first) ||\n\t (j == c[a][0].second && j == c[a][1].second) ) {\n\t // cout << \" \" << a << endl;\t \n\t if ( c[a][0].first == c[a][1].first ) {\n\t if ( (c[a][0].second <= j && j <= c[a][1].second ) ||\n\t\t (c[a][1].second <= j && j <= c[a][0].second ) ) {\n\t // cout << i << \" \" << j << \" \" << a << endl;\t \n\t erase_c[i][j].push_back(a);\n\t }\n\t } else if ( c[a][0].first == c[a][1].first ) {\t \n\t if ( (c[a][0].first <= j && j <= c[a][1].first ) ||\n\t\t (c[a][1].first <= j && j <= c[a][0].first ) ) erase_c[i][j].push_back(a);\n\t }\n\t else erase_c[i][j].push_back(a);\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 if ( used[i][j] || grid[i][j] != '.' ) continue;\n dfs(i, j);\n }\n }\n\n cout << ans << endl; \n \n return 0;\n}","accuracy":0.14754098360655737,"time_ms":10,"memory_kb":9420,"score_of_the_acc":-0.9974,"final_rank":17},{"submission_id":"aoj_2299_4907515","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define double long double\n#define lp(i,n) for(int i=0;i<(int)(n);i++)\n#define lps(i,j,n) for(int i=j;i<n;i++)\n\n#define fordebug int hoge;cin>>hoge;\n\n#define DEKAI 1000000007\n#define floot10 cout<<fixed<<setprecision(15)\n#define all(v) v.begin(),v.end()\ndouble PI = acos(-1);\n\nint h,w;\nint score=0;\nbool act(vector<string> &v,int x, int y){\n bool res = false;\n int dx[4]={0,0,1,-1};\n int dy[4]={1,-1,0,0};\n map<char,int> m;\n vector<char> check={};\n lp(i,4){\n int nx=x;\n int ny=y;\n while(1){\n nx+=dx[i];\n ny+=dy[i];\n if(nx<0||nx>=h)break;\n if(ny<0||ny>=w)break;\n if(v[nx][ny]!='.'){\n char c=v[nx][ny];\n if(m[c]==0)m[c]=1;\n else{\n check.push_back(c);\n }\n break;\n }\n }\n }\n lp(i,4){\n int nx=x;\n int ny=y;\n while(1){\n nx+=dx[i];\n ny+=dy[i];\n if(nx<0||nx>=h)break;\n if(ny<0||ny>=w)break;\n if(v[nx][ny]!='.'){\n char c=v[nx][ny];\n lp(j,check.size()){\n if(c==check[j]){\n v[nx][ny]='.';\n res=true;\n score++;\n }\n }\n break;\n }\n }\n }\n return res;\n}\n\nvoid priv(vector<string> &v){\n lp(i,h){\n cout<<v[i]<<endl;\n }\n}\n\nsigned main(){\n cin>>h>>w;\n vector<string> v(h);\n lp(i,h){\n cin>>v[i];\n }\n while(1){\n bool check = false;\n //priv(v);\n //cout<<score<<endl<<endl;\n lp(i,h){\n lp(j,w){\n if(v[i][j]!='.')continue;\n if(act(v,i,j))check=true;\n }\n }\n if(check==false)break;\n }\n cout<<score<<endl;\n return 0;\n}","accuracy":1,"time_ms":1120,"memory_kb":3920,"score_of_the_acc":-0.6824,"final_rank":11},{"submission_id":"aoj_2299_4890528","code_snippet":"#include <iostream>\n#include <string>\n#include <cstdlib>\n#include <cmath>\n#include <vector>\n#include <unordered_map>\n#include <map>\n#include <set>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <bitset>\n#include <assert.h>\n#include <unordered_map>\n#include <fstream>\n#include <ctime>\n#include <complex>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<30;\nconst ll linf = 1LL<<62;\nconst int MAX = 2020000;\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\nconst double pi = acos(-1);\nconst double eps = 1e-10;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << \"debug: \" << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << \"debug: \" << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nbool in(ll y, ll x, ll h, ll w){\n\treturn 0 <= y && y < h && 0 <= x && x < w;\n}\n\nint main(){\n\tint n,m; cin >> n >> m;\n\tvs s(n); rep(i,n) cin >> s[i];\n\tvector<vpl> pos(26,vpl(2,{-1,-1}));\n\trep(i,n){\n\t\trep(j,m){\n\t\t\tif(s[i][j] == '.') continue;\n\t\t\tif(pos[s[i][j]-'A'][0].first == -1){\n\t\t\t\tpos[s[i][j]-'A'][0] = {i,j};\n\t\t\t}else{\n\t\t\t\tpos[s[i][j]-'A'][1] = {i,j};\n\t\t\t}\n\t\t}\n\t}\n\tint ans = 0;\n\twhile(1){\n\t\tbool f = false;\n\t\trep(i,n){\n\t\t\trep(j,m){\n\t\t\t\tif(s[i][j] != '.') continue;\n\t\t\t\tvl cnt(26,0);\n\t\t\t\trep(k,4){\n\t\t\t\t\tfor(int t=0;; t++){\n\t\t\t\t\t\tint ny = i + dy[k] * t;\n\t\t\t\t\t\tint nx = j + dx[k] * t;\n\t\t\t\t\t\tif(!in(ny,nx,n,m)) break;\n\t\t\t\t\t\tif(s[ny][nx] != '.'){\n\t\t\t\t\t\t\tcnt[s[ny][nx]-'A']++;\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}\n\t\t\t\trep(k,26){\n\t\t\t\t\tif(cnt[k] == 2){\n\t\t\t\t\t\trep(l,2) s[pos[k][l].first][pos[k][l].second] = '.';\n\t\t\t\t\t\tans += 2;\n\t\t\t\t\t\tf = true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(!f) break;\n\t}\n\tcout << ans << \"\\n\";\n}","accuracy":1,"time_ms":1290,"memory_kb":3340,"score_of_the_acc":-0.6772,"final_rank":10},{"submission_id":"aoj_2299_4849452","code_snippet":"#include <stdio.h>\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define Inf 1000000000\nint ans = 0;\n\nvoid del(vector<string> &S,int y,int x){\n\tif(S[y][x]!='.')return;\n\tvector<int> dy = {0,-1,0,1},dx = {1,0,-1,0};\n\trep(i,4){\n\t\trep(j,4){\n\t\t\tif(i==j)continue;\n\t\t\t\n\t\t\tint y1 = y,x1 = x,y2 = y,x2 = x;\n\t\t\twhile(true){\n\t\t\t\ty1 += dy[i];\n\t\t\t\tx1 += dx[i];\n\t\t\t\tif(y1<0||x1<0||y1>=S.size()||x1>=S[0].size()){\n\t\t\t\t\ty1 -= dy[i];\n\t\t\t\t\tx1 -= dx[i];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(S[y1][x1]!='.')break;\n\t\t\t}\n\t\t\t\n\t\t\twhile(true){\n\t\t\t\ty2 += dy[j];\n\t\t\t\tx2 += dx[j];\n\t\t\t\tif(y2<0||x2<0||y2>=S.size()||x2>=S[0].size()){\n\t\t\t\t\ty2 -= dy[j];\n\t\t\t\t\tx2 -= dx[j];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif(S[y2][x2]!='.')break;\n\t\t\t}\n\t\t\t\n\t\t\tif(S[y1][x1] == S[y2][x2] && S[y1][x1]!='.'){\n\t\t\t\tans += 2;\n\t\t\t\tS[y1][x1] = '.';\n\t\t\t\tS[y2][x2] = '.';\n\t\t\t}\n\t\t\t\n\t\t}\n\t}\n}\n\nint main(){\n\t\n\tint M,N;\n\tcin>>M>>N;\n\t\n\tvector<string> S;\n\t{\n\t\tbool f = false;\n\t\trep(i,M){\n\t\t\tstring s;\n\t\t\tcin>>s;\n\t\t\tif(s==string(N,'.')){\n\t\t\t\tif(f){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\t\n\t\t\t\tf=true;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tf=false;\n\t\t\t}\n\t\t\tS.push_back(s);\n\t\t}\n\t}\n\n\t{\n\t\tbool F = false;\n\t\tvector<string> T(S.size(),\"\");\n\t\trep(i,N){\n\t\t\tbool f = false;\n\t\t\trep(j,S.size()){\n\t\t\t\tif(S[j][i]!='.')f=true;\n\t\t\t}\n\t\t\tif(!f){\n\t\t\t\tif(F){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tF=true;\n\t\t\t}\n\t\t\telse{\n\t\t\t\tF = false;\n\t\t\t}\n\t\t\trep(j,S.size()){\n\t\t\t\tT[j] += S[j][i];\n\t\t\t}\n\t\t}\n\t\tswap(S,T);\n\t}\n\t//cout<<S.size()<<','<<S[0].size()<<endl;\n\trep(_,27){\n\t\trep(i,S.size()){\n\t\t\trep(j,S[i].size()){\n\t\t\t\tdel(S,i,j);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tcout<<ans<<endl;\n\t\n return 0;\n}","accuracy":1,"time_ms":570,"memory_kb":3516,"score_of_the_acc":-0.3252,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_2299_9394837\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <stack>\\n#include <set>\\n#include <map>\\n#include <algorithm>\\n#include <string>\\n#include <cctype>\\n#include <cmath>\\nusing namespace std;\\nusing ll = long long;\\nconst long long INF = (1LL<<60);\\nconst long long mod = 998244353;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\nint m, n;\\nvector<string> a;\\nll score = 0;\\nbool update(int i, int j) {\\n bool flag = false;\\n map<char, vector<pair<int, int>>> ma;\\n int scale = 1;\\n // sita\\n while (i + scale < m) {\\n if (a[i+scale][j] != '.') {\\n ma[a[i+scale][j]].push_back(make_pair(i+scale, j));\\n break;\\n }\\n scale++;\\n }\\n scale = 1;\\n // down\\n while (i - scale >= 0) {\\n if (a[i-scale][j] != '.') {\\n ma[a[i-scale][j]].push_back(make_pair(i-scale, j));\\n break;\\n }\\n scale++;\\n }\\n scale = 1;\\n while (j + scale < n) {\\n if (a[i][j+scale] != '.') {\\n ma[a[i][j+scale]].push_back(make_pair(i, j+scale));\\n break;\\n }\\n scale++;\\n }\\n scale = 1;\\n while (j - scale >= 0) {\\n if (a[i][j-scale] != '.') {\\n ma[a[i][j-scale]].push_back(make_pair(i, j-scale));\\n break;\\n }\\n scale++;\\n }\\n for (pair<char, vector<pair<int, int>>> p : ma) {\\n if (p.second.size() >= 2) {\\n for (pair<int, int> px : p.second) {\\n a[px.first][px.second] = '.';\\n score++;\\n flag = true;\\n }\\n }\\n }\\n return flag;\\n}\\nint main(){\\n cin>>m>>n;\\n a = vector<string>(m);\\n rep(i, m) cin>>a[i];\\n while (true) {\\n bool flag = false;\\n rep(i, m) {\\n rep(j, n) {\\n if (a[i][j] != '.') continue;\\n if (update(i, j)) {\\n flag = true;\\n break;\\n }\\n }\\n }\\n if (!flag) break;\\n }\\n cout<<score<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 3936,\n \"score_of_the_acc\": -0.283,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2299_9394696\",\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 int h, w;\\n cin >> h >> w;\\n vector<string> s(h);\\n rep(i, h) cin >> s[i];\\n\\n vector<bool> used(26);\\n vector<pair<int, int>> st;\\n\\n auto get = [&](int i, int j, int di, int dj) -> tuple<int, int, int> {\\n assert(s[i][j] == '.');\\n while (0 <= i && i < h && 0 <= j && j < w && s[i][j] == '.') {\\n i += di;\\n j += dj;\\n }\\n if (0 <= i && i < h && 0 <= j && j < w) return {i, j, s[i][j] - 'A'};\\n return {-1, -1, -1};\\n };\\n\\n const int DI[] = {1, 0, -1, 0};\\n const int DJ[] = {0, 1, 0, -1};\\n rep(i, h) rep(j, w) {\\n if (s[i][j] != '.') continue;\\n vector<int> count(26);\\n rep(d, 4) {\\n auto [ni, nj, v] = get(i, j, DI[d], DJ[d]);\\n if (v != -1) count[v]++;\\n }\\n rep(k, 26) if (count[k] == 2 && !used[k]) {\\n used[k] = true;\\n st.emplace_back(i, j);\\n break;\\n }\\n }\\n int ans = 0;\\n while (!st.empty()) {\\n auto [ci, cj] = st.back();\\n st.pop_back();\\n vector<vector<pair<int, int>>> count(26);\\n rep(d, 4) {\\n auto [ni, nj, v] = get(ci, cj, DI[d], DJ[d]);\\n if (v != -1) {\\n count[v].emplace_back(ni, nj);\\n }\\n }\\n rep(k, 26) if (count[k].size() == 2) {\\n ans++;\\n for (auto [i, j]: count[k]) {\\n assert(s[i][j] == k + 'A');\\n s[i][j] = '.';\\n rep(a, h) if (s[a][j] == '.') st.emplace_back(a, j);\\n rep(b, w) if (s[i][b] == '.') st.emplace_back(i, b);\\n }\\n }\\n }\\n cout << 2 * ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 3972,\n \"score_of_the_acc\": -0.2412,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2299_9394680\",\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 int h, w;\\n cin >> h >> w;\\n vector<string> s(h);\\n rep(i, h) cin >> s[i];\\n\\n vector<bool> used(26);\\n vector<pair<int, int>> st;\\n\\n auto get = [&](int i, int j, int di, int dj) -> tuple<int, int, int> {\\n assert(s[i][j] == '.');\\n while (0 <= i && i < h && 0 <= j && j < w && s[i][j] == '.') {\\n i += di;\\n j += dj;\\n }\\n if (0 <= i && i < h && 0 <= j && j < w) return {i, j, s[i][j] - 'A'};\\n return {-1, -1, -1};\\n };\\n\\n const int DI[] = {1, 0, -1, 0};\\n const int DJ[] = {0, 1, 0, -1};\\n rep(i, h) rep(j, w) {\\n if (s[i][j] != '.') continue;\\n vector<int> count(26);\\n rep(d, 4) {\\n auto [ni, nj, v] = get(i, j, DI[d], DJ[d]);\\n if (v != -1) count[v]++;\\n }\\n rep(k, 26) if (count[k] == 2 && !used[k]) {\\n used[k] = true;\\n st.emplace_back(i, j);\\n break;\\n }\\n }\\n int ans = 0;\\n while (!st.empty()) {\\n auto [ci, cj] = st.back();\\n st.pop_back();\\n vector<vector<pair<int, int>>> count(26);\\n rep(d, 4) {\\n auto [ni, nj, v] = get(ci, cj, DI[d], DJ[d]);\\n if (v != -1) {\\n count[v].emplace_back(ni, nj);\\n }\\n }\\n bool ok = false;\\n rep(k, 26) if (count[k].size() == 2) {\\n ans++;\\n ok = true;\\n for (auto [i, j]: count[k]) {\\n assert(s[i][j] == k + 'A');\\n s[i][j] = '.';\\n st.emplace_back(i, j);\\n }\\n }\\n if (ok) st.emplace_back(ci, cj);\\n }\\n cout << 2 * ans << '\\\\n';\\n}\",\n \"accuracy\": 0.14754098360655737,\n \"time_ms\": 200,\n \"memory_kb\": 3860,\n \"score_of_the_acc\": -0.1858,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2299_5990598\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing ll = long long;\\n#define var auto\\nconst char newl = '\\\\n';\\n\\nusing namespace std;\\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\\nint main() {\\n int h, w;\\n cin >> h >> w;\\n vector<string> grid(h);\\n for (var&& s : grid) cin >> s;\\n\\n int res = 0;\\n while (true) {\\n\\n\\n bool changed = false;\\n for (int i = 0; i < h; i++) {\\n for (int j = 0; j < w; j++) {\\n if (grid[i][j] != '.') continue;\\n vector<char*> cs;\\n for (int i2 = i; i2 < h; i2++) {\\n if (grid[i2][j] != '.') {\\n cs.emplace_back(&grid[i2][j]);\\n break;\\n }\\n }\\n for (int i2 = i; i2 >= 0; i2--) {\\n if (grid[i2][j] != '.') {\\n cs.emplace_back(&grid[i2][j]);\\n break;\\n }\\n }\\n\\n for (int j2 = j; j2 < w; j2++) {\\n if (grid[i][j2] != '.') {\\n cs.emplace_back(&grid[i][j2]);\\n break;\\n }\\n }\\n for (int j2 = j; j2 >= 0; j2--) {\\n if (grid[i][j2] != '.') {\\n cs.emplace_back(&grid[i][j2]);\\n break;\\n }\\n }\\n for (int i = 0; i < cs.size(); i++) {\\n for (int j = i + 1; j < cs.size(); j++) {\\n if (*cs[i] == *cs[j] && *cs[i] != '.') {\\n *cs[i] = '.';\\n *cs[j] = '.';\\n res += 2;\\n changed = true;\\n }\\n }\\n }\\n }\\n }\\n if (not changed) break;\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 3928,\n \"score_of_the_acc\": -0.2816,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2299_5894793\",\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 ALL(v) (v).begin(), (v).end()\\n#define RALL(v) (v).rbegin(), (v).rend()\\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(i, n) FOR(i, 0, n)\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 60;\\nconstexpr int MOD = 1000000007;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\n\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\nint popcount(int x) { return __builtin_popcount(x); }\\nll popcount(ll x) { return __builtin_popcountll(x); }\\n#pragma endregion Macros\\n\\nint main() {\\n int H, W;\\n cin >> H >> W;\\n vector<string> G(H);\\n REP(i, H) cin >> G[i];\\n auto is_in = [&](int i, int j) -> bool {\\n return (0 <= i and i < H and 0 <= j and j < W);\\n };\\n\\n int ans = 0;\\n while(1) {\\n bool upd = false;\\n map<char, vector<pair<int, int>>> mp;\\n REP(i, H) REP(j, W) if(G[i][j] == '.') {\\n mp.clear();\\n REP(dir, 4) {\\n int ni = i, nj = j;\\n while(is_in(ni, nj)) {\\n if(G[ni][nj] != '.') {\\n mp[G[ni][nj]].emplace_back(ni, nj);\\n break;\\n }\\n ni += dx[dir], nj += dy[dir];\\n }\\n }\\n for(const auto& [key, v] : mp) {\\n if(v.size() == 2) {\\n for(auto [ni, nj] : v) G[ni][nj] = '.';\\n ans += 2;\\n upd = true;\\n } else assert(v.size() <= 1);\\n }\\n }\\n if(!upd) break;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 840,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.5015,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2299_5894788\",\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 ALL(v) (v).begin(), (v).end()\\n#define RALL(v) (v).rbegin(), (v).rend()\\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(i, n) FOR(i, 0, n)\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 60;\\nconstexpr int MOD = 1000000007;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\n\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\nint popcount(int x) { return __builtin_popcount(x); }\\nll popcount(ll x) { return __builtin_popcountll(x); }\\n#pragma endregion Macros\\n\\nint main() {\\n int H, W;\\n cin >> H >> W;\\n vector<string> G(H);\\n REP(i, H) cin >> G[i];\\n auto is_in = [&](int i, int j) -> bool {\\n return (0 <= i and i < H and 0 <= j and j < W);\\n };\\n\\n int ans = 0;\\n while(1) {\\n bool upd = false;\\n auto loop1 = [&]() {\\n map<char, vector<pair<int, int>>> mp;\\n REP(i, H) REP(j, W) if(G[i][j] == '.') {\\n mp.clear();\\n REP(dir, 4) {\\n int ni = i, nj = j;\\n while(is_in(ni, nj)) {\\n if(G[ni][nj] != '.') {\\n mp[G[ni][nj]].emplace_back(ni, nj);\\n break;\\n }\\n ni += dx[dir], nj += dy[dir];\\n }\\n }\\n for(const auto& [key, v] : mp) {\\n if(v.size() == 2) {\\n for(auto [ni, nj] : v) G[ni][nj] = '.';\\n ans += 2;\\n upd = true;\\n } else assert(v.size() <= 1);\\n }\\n }\\n }; loop1();\\n if(!upd) break;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 840,\n \"memory_kb\": 3720,\n \"score_of_the_acc\": -0.5015,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2299_5050108\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int M,N; cin >> M >> N;\\n vector<string> C(M);\\n for (int i=0;i<M;++i) cin >> C[i];\\n\\n vector<vector<pair<int,int>>> pos(26);\\n for (int i=0;i<M;++i){\\n for (int j=0;j<N;++j){\\n if (C[i][j]=='.') continue;\\n pos[C[i][j]-'A'].emplace_back(i,j);\\n }\\n }\\n\\n vector<pair<int,int>> cand;\\n for (int i=0;i<26;++i){\\n if (pos[i].empty()) continue;\\n auto p=pos[i][0],q=pos[i][1];\\n if (p.first==q.first){\\n if (p.second>q.second) swap(p,q);\\n for (int j=p.second+1;j<q.second;++j){\\n cand.emplace_back(p.first,j);\\n }\\n } else if (p.second==q.second){\\n if (p.first>q.first) swap(p,q);\\n for (int j=p.first+1;j<q.first;++j){\\n cand.emplace_back(j,p.second);\\n }\\n } else {\\n cand.emplace_back(p.first,q.second);\\n cand.emplace_back(q.first,p.second);\\n }\\n }\\n\\n int ans=0;\\n auto search=[&](int x,int y,int i){\\n while (1){\\n x+=dx[i]; y+=dy[i];\\n if (x<0||M<=x||y<0||N<=y) break;\\n if (C[x][y]=='.') continue;\\n return C[x][y];\\n }\\n return '.';\\n };\\n\\n auto erase=[&](int i){\\n C[pos[i][0].first][pos[i][0].second]='.';\\n C[pos[i][1].first][pos[i][1].second]='.';\\n ans+=2;\\n };\\n\\n auto check=[&](pair<int,int> p){\\n int x=p.first,y=p.second;\\n if (C[x][y]!='.') return;\\n vector<char> v;\\n for (int i=0;i<4;++i){\\n char c=search(x,y,i);\\n if (c!='.') v.emplace_back(c);\\n }\\n for (int i=0;i<v.size();++i){\\n for (int j=i+1;j<v.size();++j){\\n if (v[i]==v[j]){\\n erase(v[i]-'A');\\n }\\n }\\n }\\n };\\n\\n for (int _=0;_<26;++_){\\n for (auto p:cand){\\n check(p);\\n }\\n }\\n\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.0879,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2299_5050107\",\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\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int M,N; cin >> M >> N;\\n vector<string> C(M);\\n for (int i=0;i<M;++i) cin >> C[i];\\n\\n vector<vector<pair<int,int>>> pos(26);\\n for (int i=0;i<M;++i){\\n for (int j=0;j<N;++j){\\n if (C[i][j]=='.') continue;\\n pos[C[i][j]-'A'].emplace_back(i,j);\\n }\\n }\\n\\n vector<pair<int,int>> cand;\\n for (int i=0;i<26;++i){\\n if (pos[i].empty()) continue;\\n auto p=pos[i][0],q=pos[i][1];\\n if (p.first==q.first){\\n if (p.second>q.second) swap(p,q);\\n for (int j=p.second+1;j<q.second;++j){\\n cand.emplace_back(p.first,j);\\n }\\n } else if (p.second==q.second){\\n if (p.first>q.first) swap(p,q);\\n for (int j=p.first+1;j<q.first;++j){\\n cand.emplace_back(j,p.second);\\n }\\n } else {\\n cand.emplace_back(p.first,q.second);\\n cand.emplace_back(q.first,p.second);\\n }\\n }\\n\\n int ans=0;\\n auto search=[&](int x,int y,int i){\\n while (1){\\n x+=dx[i]; y+=dy[i];\\n if (x<0||M<=x||y<0||N<=y) break;\\n if (C[x][y]=='.') continue;\\n return C[x][y];\\n }\\n return '.';\\n };\\n\\n auto erase=[&](int i){\\n C[pos[i][0].first][pos[i][0].second]='.';\\n C[pos[i][1].first][pos[i][1].second]='.';\\n ans+=2;\\n };\\n\\n auto check=[&](pair<int,int> p){\\n int x=p.first,y=p.second;\\n if (C[x][y]!='.') return;\\n vector<char> v;\\n for (int i=0;i<4;++i){\\n char c=search(x,y,i);\\n if (c!='.') v.emplace_back(c);\\n }\\n for (int i=0;i<v.size();++i){\\n for (int j=i+1;j<v.size();++j){\\n if (v[i]==v[j]){\\n erase(v[i]-'A');\\n }\\n }\\n }\\n };\\n\\n for (int _=0;_<26;++_){\\n for (auto p:cand){\\n check(p);\\n }\\n }\\n\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -0.0879,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2299_4963464\",\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\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n\\n int n, m; cin >> n >> m;\\n vector<string> s(n);\\n map<char, pair<P, P>> mp;\\n REP(i, n) {\\n cin >> s[i];\\n REP(j, m) {\\n if(s[i][j] != '.') {\\n if(mp.find(s[i][j]) == mp.end()) {\\n mp[s[i][j]] = {{i, j}, {-1, -1}};\\n } else {\\n mp[s[i][j]].second = {i, j};\\n }\\n }\\n }\\n }\\n\\n map<char, vector<P>> koho;\\n for(auto &e: mp) {\\n int i1, j1, i2, j2;\\n tie(i1, j1) = e.second.first;\\n tie(i2, j2) = e.second.second;\\n\\n vector<P> v;\\n if(i1 == i2) {\\n for(int j = min(j1, j2)+1; j < max(j1, j2);++j) {\\n v.emplace_back(i1, j);\\n }\\n } else if(j1 == j2) {\\n for(int i = min(i1, i2)+1; i < max(i1, i2);++i) {\\n v.emplace_back(i, j1);\\n }\\n } else {\\n v.emplace_back(i1, j2);\\n v.emplace_back(i2, j1);\\n }\\n koho[e.first] = v;\\n }\\n\\n int ans = 0;\\n bool upd = true;\\n while(upd) {\\n upd = false;\\n\\n for(auto &e1: koho) {\\n for(auto &e2: e1.second) {\\n int i1, j1;\\n tie(i1, j1) = e2;\\n int i2, j2;\\n tie(i2, j2) = mp[e1.first].first;\\n\\n bool ok = true;\\n if(j1 == j2) {\\n for (int i = min(i1, i2); i <= max(i1, i2); ++i) {\\n ok &= s[i][j1] == '.' || s[i][j1] == e1.first;\\n }\\n } else {\\n for(int j = min(j1, j2); j <= max(j1, j2); ++j) {\\n ok &= s[i1][j] == '.' || s[i1][j] == e1.first;\\n }\\n }\\n\\n tie(i2, j2) = mp[e1.first].second;\\n if(j1 == j2) {\\n for (int i = min(i1, i2); i <= max(i1, i2); ++i) {\\n ok &= s[i][j1] == '.' || s[i][j1] == e1.first;\\n }\\n } else {\\n for(int j = min(j1, j2); j <= max(j1, j2); ++j) {\\n ok &= s[i1][j] == '.' || s[i1][j] == e1.first;\\n }\\n }\\n if(ok) {\\n ans += 2;\\n s[i2][j2] = '.';\\n tie(i2, j2) = mp[e1.first].first;\\n s[i2][j2] = '.';\\n upd = true;\\n break;\\n }\\n }\\n\\n if(upd) {\\n koho.erase(e1.first);\\n break;\\n }\\n }\\n\\n if(!upd) break;\\n }\\n\\n cout << ans << endl;\\n\\n\\n\\n\\n\\n\\n\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3672,\n \"score_of_the_acc\": -0.065,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2299_4933753\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n clock_t start = clock();\\n auto ord = [](char c) {\\n if (c < 'a') {\\n return int(c - 'A');\\n }\\n return int(26 + c - 'a');\\n };\\n\\n int m, n;\\n cin >> m >> n;\\n vector<string> v(m);\\n vector<bool> check(26);\\n vector<int> ys(52), xs(52);\\n for (int i = 0; i < m; i++) {\\n cin >> v[i];\\n for (int j = 0; j < n; j++) {\\n char c = v[i][j];\\n if (c == '.') continue;\\n if (!check[ord(c)]) {\\n check[ord(c)] = 1;\\n c -= ('A' - 'a');\\n }\\n ys[ord(c)] = i, xs[ord(c)] = j;\\n }\\n }\\n\\n vector<set<int>> sty(n), stx(m);\\n for (int i = 0; i < m; i++) {\\n for (int j = 0; j < n; j++) {\\n if (v[i][j] != '.') stx[i].insert(j);\\n }\\n }\\n for (int j = 0; j < n; j++) {\\n for (int i = 0; i < m; i++) {\\n if (v[i][j] != '.') sty[j].insert(i);\\n }\\n }\\n\\n auto ERASE = [&](char a, char b) {\\n int ya = ys[ord(a)], xa = xs[ord(a)];\\n int yb = ys[ord(b)], xb = xs[ord(b)];\\n if (ya == yb) {\\n if (xa > xb) swap(xa, xb);\\n if (xb - xa == 1) return 0;\\n if (*stx[ya].upper_bound(xa) == xb) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n return 0;\\n }\\n if (xa == xb) {\\n if (ya > yb) swap(ya, yb);\\n if (yb - ya == 1) return 0;\\n if (*sty[xa].upper_bound(ya) == yb) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n return 0;\\n }\\n\\n if (xa > xb) {\\n swap(xa, xb);\\n swap(ya, yb);\\n }\\n if (ya > yb) {\\n {\\n bool ok = 1;\\n auto itra = sty[xa].find(ya);\\n ok &= itra == sty[xa].begin() || *(--itra) < yb;\\n auto itrb = stx[yb].find(xb);\\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n {\\n bool ok = 1;\\n auto itra = stx[ya].find(xa);\\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\\n auto itrb = sty[xb].find(yb);\\n ok &= itrb == (--sty[xb].end()) || *(++itrb) > ya;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n return 0;\\n } else {\\n {\\n bool ok = 1;\\n auto itra = sty[xa].find(ya);\\n ok &= itra == (--sty[xa].end()) || *(++itra) > yb;\\n auto itrb = stx[yb].find(xb);\\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n {\\n bool ok = 1;\\n auto itra = stx[ya].find(xa);\\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\\n auto itrb = sty[xb].find(yb);\\n ok &= itrb == sty[xb].begin() || *(--itrb) < ya;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n return 0;\\n }\\n };\\n\\n queue<pair<char, char>> q;\\n for (int i = 0; i < 26; i++)\\n if (check[i]) q.emplace('A' + i, 'a' + i);\\n\\n int ans = 0;\\n while (!q.empty()) {\\n auto [a, b] = q.front();\\n q.pop();\\n if (ERASE(a, b))\\n ans += 2;\\n else\\n q.emplace(a, b);\\n clock_t end = clock();\\n const double time =\\n static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\\n if (time > 1900) break;\\n }\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1900,\n \"memory_kb\": 3992,\n \"score_of_the_acc\": -1.107,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2299_4933723\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n clock_t start = clock();\\n auto ord = [](char c) {\\n if (c < 'a') {\\n return int(c - 'A');\\n }\\n return int(26 + c - 'a');\\n };\\n\\n int m, n;\\n cin >> m >> n;\\n vector<string> v(m);\\n vector<bool> check(26);\\n vector<int> ys(52), xs(52);\\n for (int i = 0; i < m; i++) {\\n cin >> v[i];\\n for (int j = 0; j < n; j++) {\\n char c = v[i][j];\\n if (c == '.') continue;\\n if (!check[ord(c)]) {\\n check[ord(c)] = 1;\\n c -= ('A' - 'a');\\n }\\n ys[ord(c)] = i, xs[ord(c)] = j;\\n }\\n }\\n\\n vector<set<int>> sty(n), stx(m);\\n for (int i = 0; i < m; i++) {\\n for (int j = 0; j < n; j++) {\\n if (v[i][j] != '.') stx[i].insert(j);\\n }\\n }\\n for (int j = 0; j < n; j++) {\\n for (int i = 0; i < m; i++) {\\n if (v[i][j] != '.') sty[j].insert(i);\\n }\\n }\\n\\n auto erase = [&](char a, char b) {\\n int ya = ys[ord(a)], xa = xs[ord(a)];\\n int yb = ys[ord(b)], xb = xs[ord(b)];\\n if (ya == yb) {\\n if (xa > xb) swap(xa, xb);\\n if (xb - xa == 1) return 0;\\n if (*stx[ya].upper_bound(xa) == xb) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n return 0;\\n }\\n if (xa == xb) {\\n if (ya > yb) swap(ya, yb);\\n if (yb - ya == 1) return 0;\\n if (*sty[xa].upper_bound(ya) == yb) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n return 0;\\n }\\n\\n if (xa > xb) {\\n swap(xa, xb);\\n swap(ya, yb);\\n }\\n if (ya < yb) {\\n {\\n bool ok = 1;\\n auto itra = sty[xa].find(ya);\\n ok &= itra == sty[xa].begin() || *(--itra) < yb;\\n auto itrb = stx[yb].find(xb);\\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n {\\n bool ok = 1;\\n auto itra = stx[ya].find(xa);\\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\\n auto itrb = sty[xb].find(yb);\\n ok &= itrb == (--sty[xb].end()) || *(++itrb) > ya;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n return 0;\\n } else {\\n {\\n bool ok = 1;\\n auto itra = sty[xa].find(ya);\\n ok &= itra == (--sty[xa].end()) || *(++itra) > yb;\\n auto itrb = stx[yb].find(xb);\\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n {\\n bool ok = 1;\\n auto itra = stx[ya].find(xa);\\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\\n auto itrb = sty[xb].find(yb);\\n ok &= itrb == sty[xb].begin() || *(--itrb) < ya;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n return 0;\\n }\\n };\\n\\n queue<pair<char, char>> q;\\n for (int i = 0; i < 26; i++)\\n if (check[i]) q.emplace('A' + i, 'a' + i);\\n\\n int ans = 0;\\n int cnt = 0;\\n while (!q.empty()) {\\n auto [a, b] = q.front();\\n q.pop();\\n if (erase(a, b))\\n ans += 2;\\n else\\n q.emplace(a, b);\\n clock_t end = clock();\\n const double time =\\n static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\\n if (time > 1900) break;\\n }\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 0.14754098360655737,\n \"time_ms\": 1900,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -1.0676,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2299_4933707\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n clock_t start = clock();\\n auto ord = [](char c) {\\n if (c < 'a') {\\n return int(c - 'A');\\n }\\n return int(26 + c - 'a');\\n };\\n\\n int m, n;\\n cin >> m >> n;\\n vector<string> v(m);\\n vector<bool> check(26);\\n vector<int> ys(52), xs(52);\\n for (int i = 0; i < m; i++) {\\n cin >> v[i];\\n for (int j = 0; j < n; j++) {\\n char c = v[i][j];\\n if (c == '.') continue;\\n if (!check[ord(c)]) {\\n check[ord(c)] = 1;\\n c -= ('A' - 'a');\\n }\\n ys[ord(c)] = i, xs[ord(c)] = j;\\n }\\n }\\n\\n vector<set<int>> sty(52), stx(52);\\n for (int i = 0; i < m; i++) {\\n for (int j = 0; j < n; j++) {\\n if (v[i][j] != '.') stx[i].insert(j);\\n }\\n }\\n for (int j = 0; j < n; j++) {\\n for (int i = 0; i < m; i++) {\\n if (v[i][j] != '.') sty[j].insert(i);\\n }\\n }\\n\\n auto erase = [&](char a, char b) {\\n int ya = ys[ord(a)], xa = xs[ord(a)];\\n int yb = ys[ord(b)], xb = xs[ord(b)];\\n if (ya == yb) {\\n if (xa > xb) swap(xa, xb);\\n if (xb - xa == 1) return 0;\\n if (*stx[ya].upper_bound(xa) == xb) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n return 0;\\n }\\n if (xa == xb) {\\n if (ya > yb) swap(ya, yb);\\n if (yb - ya == 1) return 0;\\n if (*sty[xa].upper_bound(ya) == yb) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n return 0;\\n }\\n\\n if (xa > xb) {\\n swap(xa, xb);\\n swap(ya, yb);\\n }\\n if (ya < yb) {\\n {\\n bool ok = 1;\\n auto itra = sty[xa].find(ya);\\n ok &= itra == sty[xa].begin() || *(--itra) < yb;\\n auto itrb = stx[yb].find(xb);\\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n {\\n bool ok = 1;\\n auto itra = stx[ya].find(xa);\\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\\n auto itrb = sty[xb].find(yb);\\n ok &= itrb == (--sty[xb].end()) || *(++itrb) > ya;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n return 0;\\n } else {\\n {\\n bool ok = 1;\\n auto itra = sty[xa].find(ya);\\n ok &= itra == (--sty[xa].end()) || *(++itra) > yb;\\n auto itrb = stx[yb].find(xb);\\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n {\\n bool ok = 1;\\n auto itra = stx[ya].find(xa);\\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\\n auto itrb = sty[xb].find(yb);\\n ok &= itrb == sty[xb].begin() || *(--itrb) < ya;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n return 0;\\n }\\n };\\n\\n queue<pair<char, char>> q;\\n for (int i = 0; i < 26; i++)\\n if (check[i]) q.emplace('A' + i, 'a' + i);\\n\\n int ans = 0;\\n int cnt = 0;\\n while (!q.empty()) {\\n auto [a, b] = q.front();\\n q.pop();\\n if (erase(a, b))\\n ans += 2;\\n else\\n q.emplace(a, b);\\n clock_t end = clock();\\n const double time =\\n static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\\n if (time > 1000) break;\\n }\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 0.08196721311475409,\n \"time_ms\": 990,\n \"memory_kb\": 3864,\n \"score_of_the_acc\": -0.6045,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2299_4933703\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main() {\\n clock_t start = clock();\\n auto ord = [](char c) {\\n if (c < 'a') {\\n return int(c - 'A');\\n }\\n return int(26 + c - 'a');\\n };\\n\\n int m, n;\\n cin >> m >> n;\\n vector<string> v(m);\\n vector<bool> check(26);\\n vector<int> ys(52), xs(52);\\n for (int i = 0; i < m; i++) {\\n cin >> v[i];\\n for (int j = 0; j < n; j++) {\\n char c = v[i][j];\\n if (c == '.') continue;\\n if (!check[ord(c)]) {\\n check[ord(c)] = 1;\\n c -= ('A' - 'a');\\n }\\n ys[ord(c)] = i, xs[ord(c)] = j;\\n }\\n }\\n\\n vector<set<int>> sty(52), stx(52);\\n for (int i = 0; i < m; i++) {\\n for (int j = 0; j < n; j++) {\\n if (v[i][j] != '.') stx[i].insert(j);\\n }\\n }\\n for (int j = 0; j < n; j++) {\\n for (int i = 0; i < m; i++) {\\n if (v[i][j] != '.') sty[j].insert(i);\\n }\\n }\\n\\n auto erase = [&](char a, char b) {\\n int ya = ys[ord(a)], xa = xs[ord(a)];\\n int yb = ys[ord(b)], xb = xs[ord(b)];\\n if (ya == yb) {\\n if (xa > xb) swap(xa, xb);\\n if (xb - xa == 1) return 0;\\n if (*stx[ya].upper_bound(xa) == xb) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n return 0;\\n }\\n if (xa == xb) {\\n if (ya > yb) swap(ya, yb);\\n if (yb - ya == 1) return 0;\\n if (*sty[xa].upper_bound(ya) == yb) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n return 0;\\n }\\n\\n if (xa > xb) {\\n swap(xa, xb);\\n swap(ya, yb);\\n }\\n if (ya < yb) {\\n {\\n bool ok = 1;\\n auto itra = sty[xa].find(ya);\\n ok &= itra == sty[xa].begin() || *(--itra) < yb;\\n auto itrb = stx[yb].find(xb);\\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n {\\n bool ok = 1;\\n auto itra = stx[ya].find(xa);\\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\\n auto itrb = sty[xb].find(yb);\\n ok &= itrb == (--sty[xb].end()) || *(++itrb) > ya;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n return 0;\\n } else {\\n {\\n bool ok = 1;\\n auto itra = sty[xa].find(ya);\\n ok &= itra == (--sty[xa].end()) || *(++itra) > yb;\\n auto itrb = stx[yb].find(xb);\\n ok &= itrb == stx[yb].begin() || *(--itrb) < xa;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n {\\n bool ok = 1;\\n auto itra = stx[ya].find(xa);\\n ok &= itra == (--stx[ya].end()) || *(++itra) > xb;\\n auto itrb = sty[xb].find(yb);\\n ok &= itrb == sty[xb].begin() || *(--itrb) < ya;\\n if (ok) {\\n stx[ya].erase(xa);\\n stx[yb].erase(xb);\\n sty[xa].erase(ya);\\n sty[xb].erase(yb);\\n return 1;\\n }\\n }\\n return 0;\\n }\\n };\\n\\n queue<pair<char, char>> q;\\n for (int i = 0; i < 26; i++)\\n if (check[i]) q.emplace('A' + i, 'a' + i);\\n\\n int ans = 0;\\n int cnt = 0;\\n while (!q.empty()) {\\n auto [a, b] = q.front();\\n q.pop();\\n if (erase(a, b))\\n ans += 2;\\n else\\n q.emplace(a, b);\\n clock_t end = clock();\\n const double time =\\n static_cast<double>(end - start) / CLOCKS_PER_SEC * 1000.0;\\n if (time > 1900) break;\\n }\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 0.08196721311475409,\n \"time_ms\": 1890,\n \"memory_kb\": 3848,\n \"score_of_the_acc\": -1.078,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2299_4911849\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Pii = pair<int, int>;\\n\\nint dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};\\n\\nint H, W;\\nvector<string> grid;\\nvector<int> erase_c[501][501];\\nvector<Pii> c[26];\\nint ans = 0;\\nbool used[501][501];\\n\\nint main() {\\n cin >> H >> W;\\n grid.resize(H);\\n\\n for ( int i = 0; i < H; i++ ) {\\n cin >> grid[i];\\n for ( int j = 0; j < W; j++ ) {\\n if ( grid[i][j] == '.' ) continue;\\n c[grid[i][j]-'A'].push_back(Pii(i, j)); \\n }\\n } \\n\\n bool flag = true;\\n while ( flag ) {\\n flag = false;\\n for ( int i = 0; i < H; i++ ) {\\n for ( int j = 0; j < W; j++ ) {\\n\\tif ( grid[i][j] != '.' ) continue;\\n\\tvector<int> cnt(26, 0); \\n\\tfor ( int k = 0; k < 4; k++ ) {\\n\\t int nx = j+dx[k], ny = i+dy[k];\\n\\t while ( 1 ) {\\n\\t if ( nx < 0 || ny < 0 || nx >= W || ny >= H ) break;\\n\\t if ( grid[ny][nx] != '.' ) {\\n\\t cnt[grid[ny][nx]-'A']++;\\n\\t break;\\n\\t }\\n\\t nx += dx[k]; ny += dy[k];\\n\\t }\\n\\t}\\n\\n\\tfor ( int k = 0; k < 26; k++ ) {\\n\\t if ( cnt[k] == 2 ) {\\n\\t ans += 2;\\n\\t for ( Pii p: c[k] ) grid[p.first][p.second] = '.';\\n\\t flag = true;\\n\\t break;\\t \\n\\t }\\n\\t}\\n }\\n }\\n }\\n\\n cout << ans << endl; \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1140,\n \"memory_kb\": 9252,\n \"score_of_the_acc\": -1.5677,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2299_4908696\",\n \"code_snippet\": \"#include <bits/stdc++.h> \\nusing namespace std;\\n#define FOR(i,l,r) for(int i=(l); i<(r); i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define int long long \\n#define endl \\\"\\\\n\\\"\\n#define debug(x) cout<<x<<endl;\\nstatic const int INF = 1e9+7;\\n\\nint N,M;\\nchar C[550][550];\\nvector<pair<int,int> > p;\\n\\nint search(int x, int y){\\n map<char,int> mp;\\n\\n //左を見る\\n for(int j=x-1; j>=0; j--){\\n if(C[y][j] != '.'){\\n mp[C[y][j]]++;\\n break;\\n }\\n }\\n\\n //右を見る\\n for(int j=x+1; j<N; j++){\\n if(C[y][j] != '.'){\\n mp[C[y][j]]++;\\n break;\\n }\\n }\\n\\n //下を見る\\n for(int i=y+1; i<M; i++){\\n if(C[i][x] != '.'){\\n mp[C[i][x]]++;\\n break;\\n }\\n }\\n\\n for(int i=y-1; i>=0; i--){\\n if(C[i][x] != '.'){\\n mp[C[i][x]]++;\\n break;\\n }\\n }\\n\\n int add = 0;\\n\\n for(auto a : mp){\\n if(a.second == 2){\\n for(int i=0; i<M; i++){\\n for(int j=0; j<N; j++){\\n if(C[i][j] == a.first){\\n C[i][j] = '.';\\n p.push_back({i,j});\\n }\\n }\\n }\\n add += 2;\\n }\\n }\\n\\n return add;\\n}\\n\\nsigned main(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n cin>>M>>N;\\n\\n REP(i,M){\\n REP(j,N){\\n cin>>C[i][j];\\n if(C[i][j] == '.') p.push_back({i,j});\\n }\\n }\\n\\n int ans = 0;\\n\\n while(1){\\n bool flag = false;\\n\\n for(auto a : p){\\n int y = a.first;\\n int x = a.second;\\n int add;\\n\\n if((add = search(x,y))){\\n flag = true;\\n ans += add;\\n }\\n }\\n\\n if(!flag) break;\\n\\n /*REP(i,M){\\n REP(j,N) debug(C[i][j]);\\n }*/\\n }\\n\\n /*for(auto a : p){\\n debug(a.first);\\n debug(a.second);\\n }*/\\n\\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 9436,\n \"score_of_the_acc\": -1.1587,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2299_4907609\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Pii = pair<int, int>;\\n\\nint H, W;\\nvector<string> grid;\\nvector<int> erase_c[501][501];\\nvector<Pii> c[26];\\nint ans = 0;\\nbool used[501][501];\\n\\nvoid dfs(int h, int w) {\\n if ( used[h][w] ) return;\\n if ( grid[h][w] != '.' ) ans++;\\n used[h][w] = true;\\n // cout << h << \\\" \\\" << w << \\\" \\\" << grid[h][w] << endl; \\n\\n for ( int a: erase_c[h][w] ) {\\n for ( Pii p: c[a] ) {\\n int y = p.first, x = p.second;\\n if ( used[y][x] ) continue;\\n dfs(y, x); \\n }\\n }\\n}\\n\\nint main() {\\n cin >> H >> W;\\n grid.resize(H);\\n\\n for ( int i = 0; i < H; i++ ) {\\n cin >> grid[i];\\n for ( int j = 0; j < W; j++ ) {\\n if ( grid[i][j] == '.' ) continue;\\n c[grid[i][j]-'A'].push_back(Pii(i, j)); \\n }\\n } \\n\\n for ( int a = 0; a < 26; a++ ) { \\n if ( c[a].size() == 0 ) continue;\\n\\n for ( int i = 0; i < H; i++ ) {\\n for ( int j = 0; j < W; j++ ) {\\n\\tif ( (i == c[a][0].first && j == c[a][1].second) || \\n\\t (i == c[a][1].first && j == c[a][0].second) ||\\n\\t (i == c[a][0].first && i == c[a][1].first) ||\\n\\t (j == c[a][0].second && j == c[a][1].second) ) {\\n\\t // cout << \\\" \\\" << a << endl;\\t \\n\\t if ( c[a][0].first == c[a][1].first ) {\\n\\t if ( (c[a][0].second <= j && j <= c[a][1].second ) ||\\n\\t\\t (c[a][1].second <= j && j <= c[a][0].second ) ) {\\n\\t // cout << i << \\\" \\\" << j << \\\" \\\" << a << endl;\\t \\n\\t erase_c[i][j].push_back(a);\\n\\t }\\n\\t } else if ( c[a][0].first == c[a][1].first ) {\\t \\n\\t if ( (c[a][0].first <= i && i <= c[a][1].first ) ||\\n\\t\\t (c[a][1].first <= i && i <= c[a][0].first ) ) erase_c[i][j].push_back(a);\\n\\t }\\n\\t else erase_c[i][j].push_back(a);\\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 if ( used[i][j] || grid[i][j] != '.' ) continue;\\n dfs(i, j);\\n }\\n }\\n\\n cout << ans << endl; \\n \\n return 0;\\n}\",\n \"accuracy\": 0.14754098360655737,\n \"time_ms\": 10,\n \"memory_kb\": 9280,\n \"score_of_the_acc\": -0.9744,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2299_4907604\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing Pii = pair<int, int>;\\n\\nint H, W;\\nvector<string> grid;\\nvector<int> erase_c[501][501];\\nvector<Pii> c[26];\\nint ans = 0;\\nbool used[501][501];\\n\\nvoid dfs(int h, int w) {\\n if ( used[h][w] ) return;\\n if ( grid[h][w] != '.' ) ans++;\\n used[h][w] = true;\\n // cout << h << \\\" \\\" << w << \\\" \\\" << grid[h][w] << endl; \\n\\n for ( int a: erase_c[h][w] ) {\\n for ( Pii p: c[a] ) {\\n int y = p.first, x = p.second;\\n if ( used[y][x] ) continue;\\n dfs(y, x); \\n }\\n }\\n}\\n\\nint main() {\\n cin >> H >> W;\\n grid.resize(H);\\n\\n for ( int i = 0; i < H; i++ ) {\\n cin >> grid[i];\\n for ( int j = 0; j < W; j++ ) {\\n if ( grid[i][j] == '.' ) continue;\\n c[grid[i][j]-'A'].push_back(Pii(i, j)); \\n }\\n } \\n\\n for ( int a = 0; a < 26; a++ ) { \\n if ( c[a].size() == 0 ) continue;\\n\\n for ( int i = 0; i < H; i++ ) {\\n for ( int j = 0; j < W; j++ ) {\\n\\tif ( (i == c[a][0].first && j == c[a][1].second) || \\n\\t (i == c[a][1].first && j == c[a][0].second) ||\\n\\t (i == c[a][0].first && i == c[a][1].first) ||\\n\\t (j == c[a][0].second && j == c[a][1].second) ) {\\n\\t // cout << \\\" \\\" << a << endl;\\t \\n\\t if ( c[a][0].first == c[a][1].first ) {\\n\\t if ( (c[a][0].second <= j && j <= c[a][1].second ) ||\\n\\t\\t (c[a][1].second <= j && j <= c[a][0].second ) ) {\\n\\t // cout << i << \\\" \\\" << j << \\\" \\\" << a << endl;\\t \\n\\t erase_c[i][j].push_back(a);\\n\\t }\\n\\t } else if ( c[a][0].first == c[a][1].first ) {\\t \\n\\t if ( (c[a][0].first <= j && j <= c[a][1].first ) ||\\n\\t\\t (c[a][1].first <= j && j <= c[a][0].first ) ) erase_c[i][j].push_back(a);\\n\\t }\\n\\t else erase_c[i][j].push_back(a);\\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 if ( used[i][j] || grid[i][j] != '.' ) continue;\\n dfs(i, j);\\n }\\n }\\n\\n cout << ans << endl; \\n \\n return 0;\\n}\",\n \"accuracy\": 0.14754098360655737,\n \"time_ms\": 10,\n \"memory_kb\": 9420,\n \"score_of_the_acc\": -0.9974,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2299_4907515\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define int long long\\n#define double long double\\n#define lp(i,n) for(int i=0;i<(int)(n);i++)\\n#define lps(i,j,n) for(int i=j;i<n;i++)\\n\\n#define fordebug int hoge;cin>>hoge;\\n\\n#define DEKAI 1000000007\\n#define floot10 cout<<fixed<<setprecision(15)\\n#define all(v) v.begin(),v.end()\\ndouble PI = acos(-1);\\n\\nint h,w;\\nint score=0;\\nbool act(vector<string> &v,int x, int y){\\n bool res = false;\\n int dx[4]={0,0,1,-1};\\n int dy[4]={1,-1,0,0};\\n map<char,int> m;\\n vector<char> check={};\\n lp(i,4){\\n int nx=x;\\n int ny=y;\\n while(1){\\n nx+=dx[i];\\n ny+=dy[i];\\n if(nx<0||nx>=h)break;\\n if(ny<0||ny>=w)break;\\n if(v[nx][ny]!='.'){\\n char c=v[nx][ny];\\n if(m[c]==0)m[c]=1;\\n else{\\n check.push_back(c);\\n }\\n break;\\n }\\n }\\n }\\n lp(i,4){\\n int nx=x;\\n int ny=y;\\n while(1){\\n nx+=dx[i];\\n ny+=dy[i];\\n if(nx<0||nx>=h)break;\\n if(ny<0||ny>=w)break;\\n if(v[nx][ny]!='.'){\\n char c=v[nx][ny];\\n lp(j,check.size()){\\n if(c==check[j]){\\n v[nx][ny]='.';\\n res=true;\\n score++;\\n }\\n }\\n break;\\n }\\n }\\n }\\n return res;\\n}\\n\\nvoid priv(vector<string> &v){\\n lp(i,h){\\n cout<<v[i]<<endl;\\n }\\n}\\n\\nsigned main(){\\n cin>>h>>w;\\n vector<string> v(h);\\n lp(i,h){\\n cin>>v[i];\\n }\\n while(1){\\n bool check = false;\\n //priv(v);\\n //cout<<score<<endl<<endl;\\n lp(i,h){\\n lp(j,w){\\n if(v[i][j]!='.')continue;\\n if(act(v,i,j))check=true;\\n }\\n }\\n if(check==false)break;\\n }\\n cout<<score<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1120,\n \"memory_kb\": 3920,\n \"score_of_the_acc\": -0.6824,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2299_4890528\",\n \"code_snippet\": \"#include <iostream>\\n#include <string>\\n#include <cstdlib>\\n#include <cmath>\\n#include <vector>\\n#include <unordered_map>\\n#include <map>\\n#include <set>\\n#include <algorithm>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <bitset>\\n#include <assert.h>\\n#include <unordered_map>\\n#include <fstream>\\n#include <ctime>\\n#include <complex>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nconst int inf = 1<<30;\\nconst ll linf = 1LL<<62;\\nconst int MAX = 2020000;\\nll dy[8] = {1,-1,0,0,1,-1,1,-1};\\nll dx[8] = {0,0,1,-1,1,-1,-1,1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-10;\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << \\\"debug: \\\" << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nbool in(ll y, ll x, ll h, ll w){\\n\\treturn 0 <= y && y < h && 0 <= x && x < w;\\n}\\n\\nint main(){\\n\\tint n,m; cin >> n >> m;\\n\\tvs s(n); rep(i,n) cin >> s[i];\\n\\tvector<vpl> pos(26,vpl(2,{-1,-1}));\\n\\trep(i,n){\\n\\t\\trep(j,m){\\n\\t\\t\\tif(s[i][j] == '.') continue;\\n\\t\\t\\tif(pos[s[i][j]-'A'][0].first == -1){\\n\\t\\t\\t\\tpos[s[i][j]-'A'][0] = {i,j};\\n\\t\\t\\t}else{\\n\\t\\t\\t\\tpos[s[i][j]-'A'][1] = {i,j};\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint ans = 0;\\n\\twhile(1){\\n\\t\\tbool f = false;\\n\\t\\trep(i,n){\\n\\t\\t\\trep(j,m){\\n\\t\\t\\t\\tif(s[i][j] != '.') continue;\\n\\t\\t\\t\\tvl cnt(26,0);\\n\\t\\t\\t\\trep(k,4){\\n\\t\\t\\t\\t\\tfor(int t=0;; t++){\\n\\t\\t\\t\\t\\t\\tint ny = i + dy[k] * t;\\n\\t\\t\\t\\t\\t\\tint nx = j + dx[k] * t;\\n\\t\\t\\t\\t\\t\\tif(!in(ny,nx,n,m)) break;\\n\\t\\t\\t\\t\\t\\tif(s[ny][nx] != '.'){\\n\\t\\t\\t\\t\\t\\t\\tcnt[s[ny][nx]-'A']++;\\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}\\n\\t\\t\\t\\trep(k,26){\\n\\t\\t\\t\\t\\tif(cnt[k] == 2){\\n\\t\\t\\t\\t\\t\\trep(l,2) s[pos[k][l].first][pos[k][l].second] = '.';\\n\\t\\t\\t\\t\\t\\tans += 2;\\n\\t\\t\\t\\t\\t\\tf = true;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(!f) break;\\n\\t}\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1290,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.6772,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2299_4849452\",\n \"code_snippet\": \"#include <stdio.h>\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\n#define Inf 1000000000\\nint ans = 0;\\n\\nvoid del(vector<string> &S,int y,int x){\\n\\tif(S[y][x]!='.')return;\\n\\tvector<int> dy = {0,-1,0,1},dx = {1,0,-1,0};\\n\\trep(i,4){\\n\\t\\trep(j,4){\\n\\t\\t\\tif(i==j)continue;\\n\\t\\t\\t\\n\\t\\t\\tint y1 = y,x1 = x,y2 = y,x2 = x;\\n\\t\\t\\twhile(true){\\n\\t\\t\\t\\ty1 += dy[i];\\n\\t\\t\\t\\tx1 += dx[i];\\n\\t\\t\\t\\tif(y1<0||x1<0||y1>=S.size()||x1>=S[0].size()){\\n\\t\\t\\t\\t\\ty1 -= dy[i];\\n\\t\\t\\t\\t\\tx1 -= dx[i];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(S[y1][x1]!='.')break;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\twhile(true){\\n\\t\\t\\t\\ty2 += dy[j];\\n\\t\\t\\t\\tx2 += dx[j];\\n\\t\\t\\t\\tif(y2<0||x2<0||y2>=S.size()||x2>=S[0].size()){\\n\\t\\t\\t\\t\\ty2 -= dy[j];\\n\\t\\t\\t\\t\\tx2 -= dx[j];\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(S[y2][x2]!='.')break;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif(S[y1][x1] == S[y2][x2] && S[y1][x1]!='.'){\\n\\t\\t\\t\\tans += 2;\\n\\t\\t\\t\\tS[y1][x1] = '.';\\n\\t\\t\\t\\tS[y2][x2] = '.';\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(){\\n\\t\\n\\tint M,N;\\n\\tcin>>M>>N;\\n\\t\\n\\tvector<string> S;\\n\\t{\\n\\t\\tbool f = false;\\n\\t\\trep(i,M){\\n\\t\\t\\tstring s;\\n\\t\\t\\tcin>>s;\\n\\t\\t\\tif(s==string(N,'.')){\\n\\t\\t\\t\\tif(f){\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\t\\n\\t\\t\\t\\tf=true;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tf=false;\\n\\t\\t\\t}\\n\\t\\t\\tS.push_back(s);\\n\\t\\t}\\n\\t}\\n\\n\\t{\\n\\t\\tbool F = false;\\n\\t\\tvector<string> T(S.size(),\\\"\\\");\\n\\t\\trep(i,N){\\n\\t\\t\\tbool f = false;\\n\\t\\t\\trep(j,S.size()){\\n\\t\\t\\t\\tif(S[j][i]!='.')f=true;\\n\\t\\t\\t}\\n\\t\\t\\tif(!f){\\n\\t\\t\\t\\tif(F){\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tF=true;\\n\\t\\t\\t}\\n\\t\\t\\telse{\\n\\t\\t\\t\\tF = false;\\n\\t\\t\\t}\\n\\t\\t\\trep(j,S.size()){\\n\\t\\t\\t\\tT[j] += S[j][i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswap(S,T);\\n\\t}\\n\\t//cout<<S.size()<<','<<S[0].size()<<endl;\\n\\trep(_,27){\\n\\t\\trep(i,S.size()){\\n\\t\\t\\trep(j,S[i].size()){\\n\\t\\t\\t\\tdel(S,i,j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tcout<<ans<<endl;\\n\\t\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 570,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -0.3252,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":1283,"cells":{"group_id":{"kind":"string","value":"aoj_2300_cpp"},"problem_description":{"kind":"string","value":"Calender Colors\nTaro is a member of a programming contest circle.\nIn this circle, the members manage their schedules in the system called\nGreat Web Calender\n.\nTaro has just added some of his friends to his calendar so that he can browse their schedule on his calendar.\nThen he noticed that the system currently displays all the schedules in only one color, mixing the schedules for all his friends.\nThis is difficult to manage because it's hard to tell whose schedule each entry is.\nBut actually this calender system has the feature to change the color of schedule entries, based on the person who has the entries.\nSo Taro wants to use that feature to distinguish their plans by color.\nGiven the colors Taro can use and the number of members,\nyour task is to calculate the subset of colors to color all schedule entries.\nThe colors are given by \"Lab color space\".\nIn Lab color space,\nthe distance between two colors is defined by the square sum of the difference of each element.\nTaro has to pick up the subset of colors that maximizes the sum of distances of all color pairs in the set.\nInput\nThe input is like the following style.\nN\nM\nL_{0}\na_{0}\nb_{0}\nL_{1}\na_{1}\nb_{1}\n...\nL_{N-1}\na_{N-1}\nb_{N-1}\nThe first line contains two integers\nN\nand\nM\n(\n0 \\leq M \\leq N \\leq 20\n), where\nN\nis the number of colors in the input, and\nM\nis the number of friends Taro wants to select the colors for.\nEach of the following\nN\nlines contains three decimal integers\nL\n(\n0.0 \\leq L \\leq 100.0\n),\na\n(\n-134.0 \\leq a \\leq 220.0\n) and\nb\n(\n-140.0 \\leq b \\leq 122.0\n) which represents a single color in Lab color space.\nOutput\nOutput the maximal of the total distance.\nThe output should not contain an error greater than\n10^{-5}\n.\nSample Input 1\n3 2\n0 0 0\n10 10 10\n100 100 100\nOutput for the Sample Input 1\n30000.00000000000000000000\nSample Input 2\n5 3\n12.0 15.0 9.0\n10.0 -3.0 2.2\n3.5 6.8 9.0\n2.1 4.4 5.9\n1.2 4.0 -5.4\nOutput for the Sample Input 2\n1003.44000000000005456968\nSample Input 3\n2 1\n1.0 1.0 1.0\n0.0 0.0 0.0\nOutput for the Sample Input 3\n0.00000000000000000000"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2300_11047158","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\n using ld = long double;\n using d3 = array<ld, 3>;\n\n vector<d3> v(n);\n for(auto& x : v) cin >> x[0] >> x[1] >> x[2];\n\n ld ans = 0;\n for(unsigned i = 0; i < (1 << n); i++) {\n if(popcount(i) == m) {\n ld sum = 0;\n for(int j = 0; j < n; j++) {\n for(int k = j + 1; k < n; k++) {\n if(((1 << j) & i) && ((1 << k) & i)) {\n for(int l = 0; l < 3; l++)\n sum += pow(v[j][l] - v[k][l], 2);\n }\n }\n }\n chmax(ans, sum);\n }\n }\n\n cout << fixed << setprecision(15) << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3840,"score_of_the_acc":-0.1224,"final_rank":12},{"submission_id":"aoj_2300_10888351","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\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n int n,m;cin >> n >> m;\n using vd = vector<ld>;\n vector<vd> v(n,vd(3));\n cin >> v;\n ld res = 0;\n rep(bit,0,1 << n){\n if(__builtin_popcount(bit) != m)continue;\n ld C = 0;\n vi cand;\n rep(i,0,n)if(bit >> i & 1)cand.emplace_back(i);\n rep(i,0,sz(cand))rep(j,0,i)rep(k,0,3)C += (v[cand[i]][k]-v[cand[j]][k])*(v[cand[i]][k]-v[cand[j]][k]);\n chmax(res,C);\n }\n cout << fixed << setprecision(20);\n cout << res << endl;\n \n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3620,"score_of_the_acc":-0.1089,"final_rank":11},{"submission_id":"aoj_2300_10850467","code_snippet":"#include<bits/stdc++.h>\ntemplate <class T>\ninline bool rd(T &ret) {\n char c; int sgn;\n if(c=getchar(),c==EOF) return 0;\n while(c!='-'&&(c<'0'||c>'9')) c=getchar();\n sgn=(c=='-')?-1:1;\n ret=(c=='-')?0:(c-'0');\n while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');\n ret*=sgn;\n return 1;\n}\ntemplate <class T>\ninline void pt(T x) {\n if (x <0) {\n putchar('-');\n x = -x;\n }\n if(x>9) pt(x/10);\n putchar(x%10+'0');\n}\nusing namespace std;\nconst int N = 21;\nstruct node{\n double x, y, z;\n}a[N];\ndouble d[N][N];\ndouble dis(node u, node v){\n u.x -= v.x;\n u.y -= v.y;\n u.z -= v.z;\n return u.x*u.x+u.y*u.y+u.z*u.z;\n}\nint n, m;\ndouble ans;\nint st[N], top;\nvoid work(){\n ans = 0;\n for(int i = 1; i < (1<<n); i++)\n {\n top = 0;\n for(int j = 0; j < n; j++){\n if(i & (1<<j))\n st[top++] = j;\n }\n if(top!=m)continue;\n\n double tmp = 0;\n for(int j = 0; j < top; j++)\n for(int k = j +1; k < top; k++)\n tmp += d[st[j]][st[k]];\n // cout<<i;for(int j = 0; j < top; j++)printf(\" %d\", st[j]);cout<<\" :\"<<tmp;puts(\"\");\n ans = max(ans, tmp);\n }\n}\nvoid input(){\n for(int i = 0; i < n; i++)scanf(\"%lf %lf %lf\", &a[i].x, &a[i].y, &a[i].z);\n for(int i = 0; i < n; i++){\n for(int j = 0; j < n; j++){\n d[i][j] = dis(a[i], a[j]);\n // printf(\"%f \",d[i][j]);\n }\n // puts(\"\");\n }\n}\nint main(){\n while(~scanf(\"%d %d\", &n, &m)){\n input();\n work();\n printf(\"%.10f\\n\", ans);\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3608,"score_of_the_acc":-0.086,"final_rank":8},{"submission_id":"aoj_2300_10506476","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n#include <tuple>\n#include <ranges>\nnamespace ranges = std::ranges;\nnamespace views = std::views;\n// #include \"Src/Number/IntegerDivision.hpp\"\n// #include \"Src/Utility/BinarySearch.hpp\"\n// #include \"Src/Sequence/CompressedSequence.hpp\"\n// #include \"Src/Sequence/RunLengthEncoding.hpp\"\n// #include \"Src/Algebra/Group/AdditiveGroup.hpp\"\n// #include \"Src/DataStructure/FenwickTree/FenwickTree.hpp\"\n// #include \"Src/DataStructure/SegmentTree/SegmentTree.hpp\"\n// using namespace zawa;\n// #include \"atcoder/modint\"\n// using mint = atcoder::modint998244353;\nint N, M;\nlong double L[20], A[20], B[20];\nint main() {\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n std::cin >> N >> M;\n for (int i = 0 ; i < N ; i++) std::cin >> L[i] >> A[i] >> B[i];\n std::vector<int> a(N);\n for (int i = 0 ; i < M ; i++) a[N - i - 1] = 1;\n long double ans = 0;\n do {\n std::vector<int> use;\n use.reserve(M);\n for (int i = 0 ; i < N ; i++) if (a[i]) use.push_back(i);\n assert(std::ssize(use) == M);\n long double v = 0;\n for (int i = 0 ; i < M ; i++) for (int j = i + 1 ; j < M ; j++) {\n v += (L[use[i]] - L[use[j]]) * (L[use[i]] - L[use[j]]);\n v += (A[use[i]] - A[use[j]]) * (A[use[i]] - A[use[j]]);\n v += (B[use[i]] - B[use[j]]) * (B[use[i]] - B[use[j]]);\n }\n ans = std::max(ans, v);\n } while (std::next_permutation(a.begin(), a.end()));\n std::cout << std::fixed << std::setprecision(8) << ans << '\\n';\n}","accuracy":1,"time_ms":20,"memory_kb":3840,"score_of_the_acc":-0.0557,"final_rank":3},{"submission_id":"aoj_2300_10037567","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(a) a.begin(),a.end()\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\n#define rep(i, n) reps(i, 0, n)\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\nconst long long mod = 1000000007;\nconst long long INF = 1e18;\nll myceil(ll a, ll b) {return (a+b-1)/b;}\n\n\nvoid solve() {\n\n cout << setprecision(10) << fixed;\n\n int n,m;\n cin >> n >> m;\n vector<vector<double>> v(n,vector<double> (3));\n rep(i,n) {\n cin >> v[i][0] >> v[i][1] >> v[i][2];\n }\n\n double ans = 0;\n double temp;\n\n for (unsigned int msk = 0; msk < 1<<n; msk++) {\n if (popcount(msk) != m) continue;\n temp = 0;\n rep(i,n) {\n while (i<n && ((msk & 1<<i) == 0)) {\n i++;\n }\n if (i == n) break;\n reps(j,i+1,n) {\n while (j<n && ((msk & 1<<j) == 0)) {\n j++;\n }\n if (j == n) break;\n\n rep(k,3) {\n temp += (v[i][k]-v[j][k])*(v[i][k]-v[j][k]);\n }\n }\n }\n ans = max(ans,temp);\n }\n\n cout << ans << endl;\n return;\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n int t = 1;\n //cin >> t;\n rep(i,t) {\n solve();\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3840,"score_of_the_acc":-0.1002,"final_rank":10},{"submission_id":"aoj_2300_9956862","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n*/\n\n\n//-------------a-----------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 1000000000;\n\nconst int MAX_N = 20;\nstatic double a[MAX_N];\nstatic double b[MAX_N];\nstatic double c[MAX_N];\n\nstatic double D[MAX_N][MAX_N];\n\n//------------------------------------------------------------------------------\nvoid setup(int N)\n{\n for (int i=0; i<N; ++i) D[i][i] = 0;\n for (int i=0; i<N-1; ++i)\n for (int j=i+1; j<N; ++j)\n {\n D[i][j] = (a[i]-a[j])*(a[i]-a[j]) + (b[i]-b[j])*(b[i]-b[j]) + (c[i]-c[j])*(c[i]-c[j]);\n D[j][i] = D[i][j];\n }\n}\n\ndouble cost(int N, int mask)\n{\n vector<int> indices;\n for (int i=0; i<N; i++)\n if (mask & (1<<i))\n indices.push_back( i );\n if (DEBUG) {printf(\"indices: \"); for (int x: indices) printf(\"%d \",x); printf(\"\\n\");}\n\n double res = 0;\n for (int i: indices)\n for (int j: indices)\n if (j > i)\n res += D[i][j];\n return res;\n}\ndouble solve(int N, int K)\n{\n if (DEBUG) {for (int i=0; i<N; ++i) printf(\"%0.2lf %0.2lf %0.2lf\\n\", a[i], b[i], c[i]);}\n //--------------------------------------------------------------------------\n // base cases:\n //--------------------------------------------------------------------------\n // init:\n setup(N);\n //--------------------------------------------------------------------------\n // compute:\n double res = 0;\n for (int mask=0; mask<(1<<N); ++mask)\n if (__builtin_popcount(mask) == K)\n res = max(res, cost(N,mask));\n //--------------------------------------------------------------------------\n // report:\n //printf(\"%d\\n\", res);\n return res;\n}\n\n//------------------------------------------------------------------------------\nvoid test()\n{\n\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n //--------------------------------------------------------------------------\n int N, K, num;\n num = scanf(\"%d %d \", &N, &K);\n for (int i=0; i<N; ++i) num = scanf(\"%lf %lf %lf \", &a[i], &b[i], &c[i]);\n double res = solve(N, K);\n printf(\"%0.6lf\\n\", res);\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":30,"memory_kb":3576,"score_of_the_acc":-0.0618,"final_rank":4},{"submission_id":"aoj_2300_9584327","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, M;\n cin >> N >> M;\n vector<double> A(N), B(N), C(N);\n vector<vector<double>> D(N,vector<double>(N));\n rep(i,0,N) cin >> A[i] >> B[i] >> C[i];\n rep(i,0,N) rep(j,0,N) D[i][j] = (A[i]-A[j])*(A[i]-A[j])+(B[i]-B[j])*(B[i]-B[j])+(C[i]-C[j])*(C[i]-C[j]);\n vector<int> X(N,0);\n rep(i,N-M,N) X[i] = 1;\n double ANS = 0.0;\n do {\n double COUNT = 0.0;\n rep(i,0,N) {\n rep(j,i+1,N) {\n if (X[i] == 1 && X[j] == 1) COUNT += D[i][j];\n }\n }\n chmax(ANS,COUNT);\n } while(next_permutation(ALL(X)));\n print(ANS);\n}","accuracy":1,"time_ms":60,"memory_kb":3640,"score_of_the_acc":-0.1324,"final_rank":13},{"submission_id":"aoj_2300_8993801","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\nbool next_combination(int N, vi &P){\n int k = len(P);\n rep(i, k - 1) if (P[i] + 1 < P[i + 1]){\n P[i]++;\n rep(j, i) P[j] = j;\n return true;\n }\n if (P[k - 1] < N - 1){\n P[k - 1]++;\n rep(i, k - 1) P[i] = i;\n return true;\n }\n return false;\n}\n\n\nld solve(int N, int M){\n vv<ld> ele(N, vld(3)); rep(i, N) rep(j, 3) cin >> ele[i][j];\n auto dist = [&](int i, int j){\n return (ele[i][0] - ele[j][0]) * (ele[i][0] - ele[j][0]) + \n (ele[i][1] - ele[j][1]) * (ele[i][1] - ele[j][1]) + \n (ele[i][2] - ele[j][2]) * (ele[i][2] - ele[j][2]);\n };\n\n if (M == 0) return 0;\n vi P(M); rep(i, M) P[i] = i;\n ld ans = 0;\n do{\n ld cand = 0;\n rep(j, len(P)) rep(i, j) cand += dist(P[i], P[j]);\n ans = max(ans, cand);\n }while (next_combination(N, P));\n return ans;\n}\n\nint main(){\n vc<ld> ans;\n while (true){\n int N, M; cin >> N >> M;\n if (N == 0) break;\n ans.push_back(solve(N, M));\n break;\n }\n for (auto x : ans) cout << fixed << setprecision(16) << x << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3580,"score_of_the_acc":-0.0398,"final_rank":2},{"submission_id":"aoj_2300_8993792","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\nbool next_combination(int N, vi &P){\n int k = len(P);\n rep(i, k - 1) if (P[i] + 1 < P[i + 1]){\n P[i]++;\n rep(j, i) P[j] = j;\n return true;\n }\n if (P[k - 1] < N - 1){\n P[k - 1]++;\n rep(i, k - 1) P[i] = i;\n return true;\n }\n return false;\n}\n\n\nld solve(int N, int M){\n vv<ld> ele(N, vld(3)); rep(i, N) rep(j, 3) cin >> ele[i][j];\n auto dist = [&](int i, int j){\n return (ele[i][0] - ele[j][0]) * (ele[i][0] - ele[j][0]) + \n (ele[i][1] - ele[j][1]) * (ele[i][1] - ele[j][1]) + \n (ele[i][2] - ele[j][2]) * (ele[i][2] - ele[j][2]);\n };\n\n vi P(M); rep(i, M) P[i] = i;\n ld ans = 0;\n do{\n ld cand = 0;\n rep(j, len(P)) rep(i, j) cand += dist(P[i], P[j]);\n ans = max(ans, cand);\n }while (next_combination(N, P));\n return ans;\n}\n\nint main(){\n vc<ld> ans;\n while (true){\n int N, M; cin >> N >> M;\n if (N == 0) break;\n ans.push_back(solve(N, M));\n break;\n }\n for (auto x : ans) cout << fixed << setprecision(16) << x << endl;\n}","accuracy":0.06593406593406594,"time_ms":20,"memory_kb":3524,"score_of_the_acc":-0.0364,"final_rank":20},{"submission_id":"aoj_2300_8397198","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint n, m;\ndouble l[22], a[22], b[22];\ndouble memo[(1<<21)];\ndouble dfs(int bit, int num){\n if(num == 0) return 0;\n if(memo[bit]!=-1) return memo[bit];\n double res = 0;\n for(int i=0;i<n;i++){\n if((bit&1<<i)!=0) continue;\n double dis = 0;\n for(int j=0;j<n;j++){\n if((bit&1<<j)!=0) dis += pow(l[i]-l[j],2)+pow(a[i]-a[j],2)+pow(b[i]-b[j],2);\n }\n res = max(res, dfs((bit|1<<i), num-1)+dis);\n }\n return memo[bit] = res;\n}\nint main(){\n cin >> n >> m;\n for(int i=0;i<n;i++){\n cin >> l[i] >> a[i] >> b[i];\n }\n fill(memo, memo+(1<<(n+1)), -1);\n printf(\"%.9lf\\n\", dfs(0, m));\n return(0);\n}","accuracy":1,"time_ms":460,"memory_kb":19644,"score_of_the_acc":-2,"final_rank":19},{"submission_id":"aoj_2300_8397196","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint n, m;\ndouble l[22], a[22], b[22];\ndouble memo[(1<<21)];\ndouble dfs(int bit, int num){\n if(num == 0) return 0;\n if(memo[bit]!=-1) return memo[bit];\n double res = 0;\n for(int i=0;i<n;i++){\n if((bit&1<<i)!=0) continue;\n double dis = 0;\n for(int j=0;j<n;j++){\n if((bit&1<<j)!=0) dis += pow(l[i]-l[j],2)+pow(a[i]-a[j],2)+pow(b[i]-b[j],2);\n }\n res = max(res, dfs((bit|1<<i), num-1)+dis);\n }\n return memo[bit] = res;\n}\nint main(){\n cin >> n >> m;\n for(int i=0;i<n;i++){\n cin >> l[i] >> a[i] >> b[i];\n }\n fill(memo, memo+(1<<21), -1);\n printf(\"%.9lf\\n\", dfs(0, m));\n return(0);\n}","accuracy":1,"time_ms":450,"memory_kb":19644,"score_of_the_acc":-1.9778,"final_rank":18},{"submission_id":"aoj_2300_7025303","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\ndouble a[20][3],ans=0,p;\nll n,m,c[20];\nvoid DFS(ll x,ll d){\n if(d==m){\n p=0;\n for(ll i=0;i<m;i++){\n for(ll j=i+1;j<m;j++){\n p+=pow(a[c[i]][0]-a[c[j]][0],2)+pow(a[c[i]][1]-a[c[j]][1],2)+pow(a[c[i]][2]-a[c[j]][2],2);\n }\n }\n ans=max(ans,p);\n }else if(x==n){\n return;\n }else{\n c[d]=x;\n DFS(x+1,d+1);\n DFS(x+1,d);\n }\n}\nint main(void){\n cin>>n>>m;\n for(ll i=0;i<n;i++){\n cin>>a[i][0]>>a[i][1]>>a[i][2];\n }\n DFS(0,0);\n printf(\"%.6f\\n\",ans);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3588,"score_of_the_acc":-0.0181,"final_rank":1},{"submission_id":"aoj_2300_6277341","code_snippet":"#include <bits/stdc++.h>\n//#include<atcoder/all>\n//using namespace atcoder;\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\nusing v2ll = vector<vll>;\nusing v3ll = vector<v2ll>;\nusing v4ll = vector<v3ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\n\n\n\nint main() {\n ll N,M;\n cin>>N>>M;\n vector<vector<double>> A(N,vector<double>(3));\n rep(i,N)rep(a,3)cin>>A[i][a];\n double an=0.0;\n rep(bit,(1<<N)){\n vector<vector<double>> B;\n rep(n,N){\n if(bit&(1<<n))B.push_back(A[n]);\n }\n if(B.size()!=M)continue;\n double k=0.0;\n rep(i,M)rep(j,i){\n \n rep(a,3){\n k+=(B[i][a]-B[j][a])*(B[i][a]-B[j][a]);\n }\n an=max(an,k);\n }\n }\n cout<<fixed<<setprecision(16)<<an<<endl;\n}","accuracy":1,"time_ms":320,"memory_kb":3576,"score_of_the_acc":-0.7063,"final_rank":17},{"submission_id":"aoj_2300_6216622","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define inc(i, a, b) for (int i = (a); i <= (b); ++i)\n#define dec(i, a, b) for (int i = (a); i >= (b); --i)\n\nint main() {\n ll n, m;\n cin >> n >> m;\n using ld = long double;\n ld a[n], b[n], c[n];\n\n rep(i, n) cin >> a[i] >> b[i] >> c[i];\n\n ld res = 0;\n rep(i, 1 << n) {\n if (__builtin_popcount(i) != m) continue;\n ld sum = 0;\n rep(j, n) {\n if (!(i >> j & 1)) continue;\n inc(k, j + 1, n - 1) {\n if (!(i >> k & 1)) continue;\n\n sum += (a[j] - a[k]) * (a[j] - a[k])\n + (b[j] - b[k]) * (b[j] - b[k])\n + (c[j] - c[k]) * (c[j] - c[k]);\n }\n }\n res = max(res, sum);\n }\n\n cout << fixed << setprecision(10) << res << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":3568,"score_of_the_acc":-0.0835,"final_rank":5},{"submission_id":"aoj_2300_6216338","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define ALL(x) x.begin(), x.end()\n\nconst ll INF = 1ll << 60;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int N, M;\n cin >> N >> M;\n vector<ld> L(N), A(N), B(N);\n rep(i, N) cin >> L[i] >> A[i] >> B[i];\n int N2 = 1 << N;\n ld ans = 0;\n rep(b, N2) {\n if (__builtin_popcount(b) != M) continue;\n ld s = 0;\n vector<int> ind;\n rep(i, N) if (b >> i & 1) ind.push_back(i);\n rep(i, M) {\n rep(j, i) {\n s += (L[ind[i]] - L[ind[j]]) * (L[ind[i]] - L[ind[j]]);\n s += (A[ind[i]] - A[ind[j]]) * (A[ind[i]] - A[ind[j]]);\n s += (B[ind[i]] - B[ind[j]]) * (B[ind[i]] - B[ind[j]]);\n }\n }\n ans = max(ans, s);\n }\n printf(\"%.15Lf\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3608,"score_of_the_acc":-0.086,"final_rank":8},{"submission_id":"aoj_2300_6082815","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N,M;\n cin >> N >> M;\n vector<double>a(N),b(N),c(N);\n for(int i = 0; i < N; i++) {\n cin >> a[i] >> b[i] >> c[i];\n }\n double ans = 0;\n for(int i = 0; i < (1 << N); i++) {\n if(__builtin_popcount(i) == M) {\n vector<double>idx;\n for(int j = 0; j < N;j ++) {\n if(1 & (i >> j)) {\n idx.push_back(j);\n }\n }\n double sum = 0;\n for(int j = 0; j < M; j++) {\n for(int k = j+1; k < M; k++) {\n sum += pow(abs(a[idx[j]]-a[idx[k]]),2);\n sum += pow(abs(b[idx[j]]-b[idx[k]]),2);\n sum += pow(abs(c[idx[j]]-c[idx[k]]),2);\n }\n }\n ans = max(ans,sum);\n }\n }\n cout << fixed << setprecision(18) << ans << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":3580,"score_of_the_acc":-0.0843,"final_rank":7},{"submission_id":"aoj_2300_6036875","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int n, m;\n cin >> n >> m;\n double ans = 0;\n vector<double> L(n), A(n), B(n);\n for(int i = 0; i < n; i++) cin >> L[i] >> A[i] >> B[i];\n for(int bit = 0; bit < (1 << n); bit++){\n vector<int> lst;\n for(int j = 0; j < n; j++){\n if(bit >> j & 1) lst.push_back(j);\n }\n if(lst.size() != m) continue;\n double tot = 0;\n for(int i = 0; i < m; i++){\n for(int j = i + 1; j < m; j++){\n tot += (L[lst[i]] - L[lst[j]]) * (L[lst[i]] - L[lst[j]]);\n tot += (A[lst[i]] - A[lst[j]]) * (A[lst[i]] - A[lst[j]]);\n tot += (B[lst[i]] - B[lst[j]]) * (B[lst[i]] - B[lst[j]]);\n }\n }\n if(tot > ans) ans = tot;\n }\n \n cout << fixed << setprecision(12) << ans;\n\n}","accuracy":1,"time_ms":260,"memory_kb":3292,"score_of_the_acc":-0.5556,"final_rank":16},{"submission_id":"aoj_2300_6036416","code_snippet":"#pragma GCC ta g(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define DEBUG\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n int sz = a.size();\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr;\n sz--;\n if(sz) cout << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//#include <atcoder/maxflow>\n//using namespace atcoder;\nconst int inf = (1<<30)-1;\nconst ll linf = 1LL<<61;\nconst int MAX = 510000;\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\nconst double pi = acos(-1);\nconst double eps = 1e-9;\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nint main(){\n\tint n,m; cin >> n >> m;\n\tvd a(n),b(n),c(n);\n\trep(i,n) cin >> a[i] >> b[i] >> c[i];\n\tdouble ans = 0;\n\trep(bit,1<<n){\n\t\tif(pcount(bit) != m) continue;\n\t\tdouble res = 0;\n\t\trep(i,n) rep(j,i){\n\t\t\tif((bit>>i & 1) && (bit>>j & 1)){\n\t\t\t\tres += (a[i]-a[j])*(a[i]-a[j]) + (b[i]-b[j])*(b[i]-b[j]) + (c[i]-c[j])*(c[i]-c[j]);\n\t\t\t}\n\t\t}\n\t\tchmax(ans, res);\n\t}\n\tprintf(\"%.10f\\n\",ans);\n}","accuracy":1,"time_ms":70,"memory_kb":3572,"score_of_the_acc":-0.1505,"final_rank":15},{"submission_id":"aoj_2300_5962724","code_snippet":"#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcount(v)\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define umap unordered_map\n#define uset unordered_set\nusing namespace std;\nusing ll = long long;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=(ll)1<<60;\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\nint main(){\n INT(n,m);\n vector2d(double,a,n,3);\n in(a);\n vector<bool> b(m,1);\n while(b.size()<n)b.push_back(0);\n sort(all(b));\n double ans=0;\n do{\n double d=0;\n drep(i,j,n){\n if(b[i]&&b[j]){\n double d2=0;\n rep(k,3){\n d2+=(a[i][k]-a[j][k])*(a[i][k]-a[j][k]);\n }\n d+=d2;\n }\n }\n chmax(ans,d);\n }while(next_permutation(all(b)));\n out(ans);\n}","accuracy":1,"time_ms":70,"memory_kb":3552,"score_of_the_acc":-0.1492,"final_rank":14},{"submission_id":"aoj_2300_5949973","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n \n int N,M; cin >> N >> M;\n vector<double> L(N), a(N), b(N);\n rep(i,N) cin >> L[i] >> a[i] >> b[i];\n\n double ans = 0;\n rep(i,1<<N) {\n double cur = 0;\n if(__builtin_popcount(i) == M) {\n vector<int> v;\n rep(j,N) if(i & (1 << j)) v.push_back(j);\n for(int j : v) for(int k : v) if(j < k)\n cur += (L[k] - L[j]) * (L[k] - L[j]) + (a[k] - a[j]) * (a[k] - a[j]) + (b[k] - b[j]) * (b[k] - b[j]);\n }\n ans = max(ans, cur);\n }\n cout.precision(17);\n cout << ans << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":3568,"score_of_the_acc":-0.0835,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2300_11047158\",\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\\n using ld = long double;\\n using d3 = array<ld, 3>;\\n\\n vector<d3> v(n);\\n for(auto& x : v) cin >> x[0] >> x[1] >> x[2];\\n\\n ld ans = 0;\\n for(unsigned i = 0; i < (1 << n); i++) {\\n if(popcount(i) == m) {\\n ld sum = 0;\\n for(int j = 0; j < n; j++) {\\n for(int k = j + 1; k < n; k++) {\\n if(((1 << j) & i) && ((1 << k) & i)) {\\n for(int l = 0; l < 3; l++)\\n sum += pow(v[j][l] - v[k][l], 2);\\n }\\n }\\n }\\n chmax(ans, sum);\\n }\\n }\\n\\n cout << fixed << setprecision(15) << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.1224,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2300_10888351\",\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\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n int n,m;cin >> n >> m;\\n using vd = vector<ld>;\\n vector<vd> v(n,vd(3));\\n cin >> v;\\n ld res = 0;\\n rep(bit,0,1 << n){\\n if(__builtin_popcount(bit) != m)continue;\\n ld C = 0;\\n vi cand;\\n rep(i,0,n)if(bit >> i & 1)cand.emplace_back(i);\\n rep(i,0,sz(cand))rep(j,0,i)rep(k,0,3)C += (v[cand[i]][k]-v[cand[j]][k])*(v[cand[i]][k]-v[cand[j]][k]);\\n chmax(res,C);\\n }\\n cout << fixed << setprecision(20);\\n cout << res << endl;\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3620,\n \"score_of_the_acc\": -0.1089,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2300_10850467\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntemplate <class T>\\ninline bool rd(T &ret) {\\n char c; int sgn;\\n if(c=getchar(),c==EOF) return 0;\\n while(c!='-'&&(c<'0'||c>'9')) c=getchar();\\n sgn=(c=='-')?-1:1;\\n ret=(c=='-')?0:(c-'0');\\n while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');\\n ret*=sgn;\\n return 1;\\n}\\ntemplate <class T>\\ninline void pt(T x) {\\n if (x <0) {\\n putchar('-');\\n x = -x;\\n }\\n if(x>9) pt(x/10);\\n putchar(x%10+'0');\\n}\\nusing namespace std;\\nconst int N = 21;\\nstruct node{\\n double x, y, z;\\n}a[N];\\ndouble d[N][N];\\ndouble dis(node u, node v){\\n u.x -= v.x;\\n u.y -= v.y;\\n u.z -= v.z;\\n return u.x*u.x+u.y*u.y+u.z*u.z;\\n}\\nint n, m;\\ndouble ans;\\nint st[N], top;\\nvoid work(){\\n ans = 0;\\n for(int i = 1; i < (1<<n); i++)\\n {\\n top = 0;\\n for(int j = 0; j < n; j++){\\n if(i & (1<<j))\\n st[top++] = j;\\n }\\n if(top!=m)continue;\\n\\n double tmp = 0;\\n for(int j = 0; j < top; j++)\\n for(int k = j +1; k < top; k++)\\n tmp += d[st[j]][st[k]];\\n // cout<<i;for(int j = 0; j < top; j++)printf(\\\" %d\\\", st[j]);cout<<\\\" :\\\"<<tmp;puts(\\\"\\\");\\n ans = max(ans, tmp);\\n }\\n}\\nvoid input(){\\n for(int i = 0; i < n; i++)scanf(\\\"%lf %lf %lf\\\", &a[i].x, &a[i].y, &a[i].z);\\n for(int i = 0; i < n; i++){\\n for(int j = 0; j < n; j++){\\n d[i][j] = dis(a[i], a[j]);\\n // printf(\\\"%f \\\",d[i][j]);\\n }\\n // puts(\\\"\\\");\\n }\\n}\\nint main(){\\n while(~scanf(\\\"%d %d\\\", &n, &m)){\\n input();\\n work();\\n printf(\\\"%.10f\\\\n\\\", ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.086,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2300_10506476\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cassert>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <numeric>\\n#include <tuple>\\n#include <ranges>\\nnamespace ranges = std::ranges;\\nnamespace views = std::views;\\n// #include \\\"Src/Number/IntegerDivision.hpp\\\"\\n// #include \\\"Src/Utility/BinarySearch.hpp\\\"\\n// #include \\\"Src/Sequence/CompressedSequence.hpp\\\"\\n// #include \\\"Src/Sequence/RunLengthEncoding.hpp\\\"\\n// #include \\\"Src/Algebra/Group/AdditiveGroup.hpp\\\"\\n// #include \\\"Src/DataStructure/FenwickTree/FenwickTree.hpp\\\"\\n// #include \\\"Src/DataStructure/SegmentTree/SegmentTree.hpp\\\"\\n// using namespace zawa;\\n// #include \\\"atcoder/modint\\\"\\n// using mint = atcoder::modint998244353;\\nint N, M;\\nlong double L[20], A[20], B[20];\\nint main() {\\n std::cin.tie(nullptr);\\n std::cout.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n std::cin >> N >> M;\\n for (int i = 0 ; i < N ; i++) std::cin >> L[i] >> A[i] >> B[i];\\n std::vector<int> a(N);\\n for (int i = 0 ; i < M ; i++) a[N - i - 1] = 1;\\n long double ans = 0;\\n do {\\n std::vector<int> use;\\n use.reserve(M);\\n for (int i = 0 ; i < N ; i++) if (a[i]) use.push_back(i);\\n assert(std::ssize(use) == M);\\n long double v = 0;\\n for (int i = 0 ; i < M ; i++) for (int j = i + 1 ; j < M ; j++) {\\n v += (L[use[i]] - L[use[j]]) * (L[use[i]] - L[use[j]]);\\n v += (A[use[i]] - A[use[j]]) * (A[use[i]] - A[use[j]]);\\n v += (B[use[i]] - B[use[j]]) * (B[use[i]] - B[use[j]]);\\n }\\n ans = std::max(ans, v);\\n } while (std::next_permutation(a.begin(), a.end()));\\n std::cout << std::fixed << std::setprecision(8) << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.0557,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2300_10037567\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(a) a.begin(),a.end()\\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\\n#define rep(i, n) reps(i, 0, n)\\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\\nconst long long mod = 1000000007;\\nconst long long INF = 1e18;\\nll myceil(ll a, ll b) {return (a+b-1)/b;}\\n\\n\\nvoid solve() {\\n\\n cout << setprecision(10) << fixed;\\n\\n int n,m;\\n cin >> n >> m;\\n vector<vector<double>> v(n,vector<double> (3));\\n rep(i,n) {\\n cin >> v[i][0] >> v[i][1] >> v[i][2];\\n }\\n\\n double ans = 0;\\n double temp;\\n\\n for (unsigned int msk = 0; msk < 1<<n; msk++) {\\n if (popcount(msk) != m) continue;\\n temp = 0;\\n rep(i,n) {\\n while (i<n && ((msk & 1<<i) == 0)) {\\n i++;\\n }\\n if (i == n) break;\\n reps(j,i+1,n) {\\n while (j<n && ((msk & 1<<j) == 0)) {\\n j++;\\n }\\n if (j == n) break;\\n\\n rep(k,3) {\\n temp += (v[i][k]-v[j][k])*(v[i][k]-v[j][k]);\\n }\\n }\\n }\\n ans = max(ans,temp);\\n }\\n\\n cout << ans << endl;\\n return;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n int t = 1;\\n //cin >> t;\\n rep(i,t) {\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.1002,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2300_9956862\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\n*/\\n\\n\\n//-------------a-----------------------------------------------------------------\\nbool DEBUG = false;\\nconst int INF = 1000000000;\\n\\nconst int MAX_N = 20;\\nstatic double a[MAX_N];\\nstatic double b[MAX_N];\\nstatic double c[MAX_N];\\n\\nstatic double D[MAX_N][MAX_N];\\n\\n//------------------------------------------------------------------------------\\nvoid setup(int N)\\n{\\n for (int i=0; i<N; ++i) D[i][i] = 0;\\n for (int i=0; i<N-1; ++i)\\n for (int j=i+1; j<N; ++j)\\n {\\n D[i][j] = (a[i]-a[j])*(a[i]-a[j]) + (b[i]-b[j])*(b[i]-b[j]) + (c[i]-c[j])*(c[i]-c[j]);\\n D[j][i] = D[i][j];\\n }\\n}\\n\\ndouble cost(int N, int mask)\\n{\\n vector<int> indices;\\n for (int i=0; i<N; i++)\\n if (mask & (1<<i))\\n indices.push_back( i );\\n if (DEBUG) {printf(\\\"indices: \\\"); for (int x: indices) printf(\\\"%d \\\",x); printf(\\\"\\\\n\\\");}\\n\\n double res = 0;\\n for (int i: indices)\\n for (int j: indices)\\n if (j > i)\\n res += D[i][j];\\n return res;\\n}\\ndouble solve(int N, int K)\\n{\\n if (DEBUG) {for (int i=0; i<N; ++i) printf(\\\"%0.2lf %0.2lf %0.2lf\\\\n\\\", a[i], b[i], c[i]);}\\n //--------------------------------------------------------------------------\\n // base cases:\\n //--------------------------------------------------------------------------\\n // init:\\n setup(N);\\n //--------------------------------------------------------------------------\\n // compute:\\n double res = 0;\\n for (int mask=0; mask<(1<<N); ++mask)\\n if (__builtin_popcount(mask) == K)\\n res = max(res, cost(N,mask));\\n //--------------------------------------------------------------------------\\n // report:\\n //printf(\\\"%d\\\\n\\\", res);\\n return res;\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //test(); return 0;\\n //DEBUG = true;\\n //--------------------------------------------------------------------------\\n int N, K, num;\\n num = scanf(\\\"%d %d \\\", &N, &K);\\n for (int i=0; i<N; ++i) num = scanf(\\\"%lf %lf %lf \\\", &a[i], &b[i], &c[i]);\\n double res = solve(N, K);\\n printf(\\\"%0.6lf\\\\n\\\", res);\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -0.0618,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2300_9584327\",\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, M;\\n cin >> N >> M;\\n vector<double> A(N), B(N), C(N);\\n vector<vector<double>> D(N,vector<double>(N));\\n rep(i,0,N) cin >> A[i] >> B[i] >> C[i];\\n rep(i,0,N) rep(j,0,N) D[i][j] = (A[i]-A[j])*(A[i]-A[j])+(B[i]-B[j])*(B[i]-B[j])+(C[i]-C[j])*(C[i]-C[j]);\\n vector<int> X(N,0);\\n rep(i,N-M,N) X[i] = 1;\\n double ANS = 0.0;\\n do {\\n double COUNT = 0.0;\\n rep(i,0,N) {\\n rep(j,i+1,N) {\\n if (X[i] == 1 && X[j] == 1) COUNT += D[i][j];\\n }\\n }\\n chmax(ANS,COUNT);\\n } while(next_permutation(ALL(X)));\\n print(ANS);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3640,\n \"score_of_the_acc\": -0.1324,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2300_8993801\",\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\\nbool next_combination(int N, vi &P){\\n int k = len(P);\\n rep(i, k - 1) if (P[i] + 1 < P[i + 1]){\\n P[i]++;\\n rep(j, i) P[j] = j;\\n return true;\\n }\\n if (P[k - 1] < N - 1){\\n P[k - 1]++;\\n rep(i, k - 1) P[i] = i;\\n return true;\\n }\\n return false;\\n}\\n\\n\\nld solve(int N, int M){\\n vv<ld> ele(N, vld(3)); rep(i, N) rep(j, 3) cin >> ele[i][j];\\n auto dist = [&](int i, int j){\\n return (ele[i][0] - ele[j][0]) * (ele[i][0] - ele[j][0]) + \\n (ele[i][1] - ele[j][1]) * (ele[i][1] - ele[j][1]) + \\n (ele[i][2] - ele[j][2]) * (ele[i][2] - ele[j][2]);\\n };\\n\\n if (M == 0) return 0;\\n vi P(M); rep(i, M) P[i] = i;\\n ld ans = 0;\\n do{\\n ld cand = 0;\\n rep(j, len(P)) rep(i, j) cand += dist(P[i], P[j]);\\n ans = max(ans, cand);\\n }while (next_combination(N, P));\\n return ans;\\n}\\n\\nint main(){\\n vc<ld> ans;\\n while (true){\\n int N, M; cin >> N >> M;\\n if (N == 0) break;\\n ans.push_back(solve(N, M));\\n break;\\n }\\n for (auto x : ans) cout << fixed << setprecision(16) << x << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.0398,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2300_8993792\",\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\\nbool next_combination(int N, vi &P){\\n int k = len(P);\\n rep(i, k - 1) if (P[i] + 1 < P[i + 1]){\\n P[i]++;\\n rep(j, i) P[j] = j;\\n return true;\\n }\\n if (P[k - 1] < N - 1){\\n P[k - 1]++;\\n rep(i, k - 1) P[i] = i;\\n return true;\\n }\\n return false;\\n}\\n\\n\\nld solve(int N, int M){\\n vv<ld> ele(N, vld(3)); rep(i, N) rep(j, 3) cin >> ele[i][j];\\n auto dist = [&](int i, int j){\\n return (ele[i][0] - ele[j][0]) * (ele[i][0] - ele[j][0]) + \\n (ele[i][1] - ele[j][1]) * (ele[i][1] - ele[j][1]) + \\n (ele[i][2] - ele[j][2]) * (ele[i][2] - ele[j][2]);\\n };\\n\\n vi P(M); rep(i, M) P[i] = i;\\n ld ans = 0;\\n do{\\n ld cand = 0;\\n rep(j, len(P)) rep(i, j) cand += dist(P[i], P[j]);\\n ans = max(ans, cand);\\n }while (next_combination(N, P));\\n return ans;\\n}\\n\\nint main(){\\n vc<ld> ans;\\n while (true){\\n int N, M; cin >> N >> M;\\n if (N == 0) break;\\n ans.push_back(solve(N, M));\\n break;\\n }\\n for (auto x : ans) cout << fixed << setprecision(16) << x << endl;\\n}\",\n \"accuracy\": 0.06593406593406594,\n \"time_ms\": 20,\n \"memory_kb\": 3524,\n \"score_of_the_acc\": -0.0364,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2300_8397198\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint n, m;\\ndouble l[22], a[22], b[22];\\ndouble memo[(1<<21)];\\ndouble dfs(int bit, int num){\\n if(num == 0) return 0;\\n if(memo[bit]!=-1) return memo[bit];\\n double res = 0;\\n for(int i=0;i<n;i++){\\n if((bit&1<<i)!=0) continue;\\n double dis = 0;\\n for(int j=0;j<n;j++){\\n if((bit&1<<j)!=0) dis += pow(l[i]-l[j],2)+pow(a[i]-a[j],2)+pow(b[i]-b[j],2);\\n }\\n res = max(res, dfs((bit|1<<i), num-1)+dis);\\n }\\n return memo[bit] = res;\\n}\\nint main(){\\n cin >> n >> m;\\n for(int i=0;i<n;i++){\\n cin >> l[i] >> a[i] >> b[i];\\n }\\n fill(memo, memo+(1<<(n+1)), -1);\\n printf(\\\"%.9lf\\\\n\\\", dfs(0, m));\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 460,\n \"memory_kb\": 19644,\n \"score_of_the_acc\": -2,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2300_8397196\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint n, m;\\ndouble l[22], a[22], b[22];\\ndouble memo[(1<<21)];\\ndouble dfs(int bit, int num){\\n if(num == 0) return 0;\\n if(memo[bit]!=-1) return memo[bit];\\n double res = 0;\\n for(int i=0;i<n;i++){\\n if((bit&1<<i)!=0) continue;\\n double dis = 0;\\n for(int j=0;j<n;j++){\\n if((bit&1<<j)!=0) dis += pow(l[i]-l[j],2)+pow(a[i]-a[j],2)+pow(b[i]-b[j],2);\\n }\\n res = max(res, dfs((bit|1<<i), num-1)+dis);\\n }\\n return memo[bit] = res;\\n}\\nint main(){\\n cin >> n >> m;\\n for(int i=0;i<n;i++){\\n cin >> l[i] >> a[i] >> b[i];\\n }\\n fill(memo, memo+(1<<21), -1);\\n printf(\\\"%.9lf\\\\n\\\", dfs(0, m));\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 19644,\n \"score_of_the_acc\": -1.9778,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2300_7025303\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\ndouble a[20][3],ans=0,p;\\nll n,m,c[20];\\nvoid DFS(ll x,ll d){\\n if(d==m){\\n p=0;\\n for(ll i=0;i<m;i++){\\n for(ll j=i+1;j<m;j++){\\n p+=pow(a[c[i]][0]-a[c[j]][0],2)+pow(a[c[i]][1]-a[c[j]][1],2)+pow(a[c[i]][2]-a[c[j]][2],2);\\n }\\n }\\n ans=max(ans,p);\\n }else if(x==n){\\n return;\\n }else{\\n c[d]=x;\\n DFS(x+1,d+1);\\n DFS(x+1,d);\\n }\\n}\\nint main(void){\\n cin>>n>>m;\\n for(ll i=0;i<n;i++){\\n cin>>a[i][0]>>a[i][1]>>a[i][2];\\n }\\n DFS(0,0);\\n printf(\\\"%.6f\\\\n\\\",ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -0.0181,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2300_6277341\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include<atcoder/all>\\n//using namespace atcoder;\\nusing namespace std;\\nusing ll = long long;\\n#define all(A) A.begin(),A.end()\\nusing vll = vector<ll>;\\nusing v2ll = vector<vll>;\\nusing v3ll = vector<v2ll>;\\nusing v4ll = vector<v3ll>;\\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\\n\\n\\n\\nint main() {\\n ll N,M;\\n cin>>N>>M;\\n vector<vector<double>> A(N,vector<double>(3));\\n rep(i,N)rep(a,3)cin>>A[i][a];\\n double an=0.0;\\n rep(bit,(1<<N)){\\n vector<vector<double>> B;\\n rep(n,N){\\n if(bit&(1<<n))B.push_back(A[n]);\\n }\\n if(B.size()!=M)continue;\\n double k=0.0;\\n rep(i,M)rep(j,i){\\n \\n rep(a,3){\\n k+=(B[i][a]-B[j][a])*(B[i][a]-B[j][a]);\\n }\\n an=max(an,k);\\n }\\n }\\n cout<<fixed<<setprecision(16)<<an<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -0.7063,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2300_6216622\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define inc(i, a, b) for (int i = (a); i <= (b); ++i)\\n#define dec(i, a, b) for (int i = (a); i >= (b); --i)\\n\\nint main() {\\n ll n, m;\\n cin >> n >> m;\\n using ld = long double;\\n ld a[n], b[n], c[n];\\n\\n rep(i, n) cin >> a[i] >> b[i] >> c[i];\\n\\n ld res = 0;\\n rep(i, 1 << n) {\\n if (__builtin_popcount(i) != m) continue;\\n ld sum = 0;\\n rep(j, n) {\\n if (!(i >> j & 1)) continue;\\n inc(k, j + 1, n - 1) {\\n if (!(i >> k & 1)) continue;\\n\\n sum += (a[j] - a[k]) * (a[j] - a[k])\\n + (b[j] - b[k]) * (b[j] - b[k])\\n + (c[j] - c[k]) * (c[j] - c[k]);\\n }\\n }\\n res = max(res, sum);\\n }\\n\\n cout << fixed << setprecision(10) << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.0835,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2300_6216338\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ld = long double;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define ALL(x) x.begin(), x.end()\\n\\nconst ll INF = 1ll << 60;\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int N, M;\\n cin >> N >> M;\\n vector<ld> L(N), A(N), B(N);\\n rep(i, N) cin >> L[i] >> A[i] >> B[i];\\n int N2 = 1 << N;\\n ld ans = 0;\\n rep(b, N2) {\\n if (__builtin_popcount(b) != M) continue;\\n ld s = 0;\\n vector<int> ind;\\n rep(i, N) if (b >> i & 1) ind.push_back(i);\\n rep(i, M) {\\n rep(j, i) {\\n s += (L[ind[i]] - L[ind[j]]) * (L[ind[i]] - L[ind[j]]);\\n s += (A[ind[i]] - A[ind[j]]) * (A[ind[i]] - A[ind[j]]);\\n s += (B[ind[i]] - B[ind[j]]) * (B[ind[i]] - B[ind[j]]);\\n }\\n }\\n ans = max(ans, s);\\n }\\n printf(\\\"%.15Lf\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3608,\n \"score_of_the_acc\": -0.086,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2300_6082815\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int N,M;\\n cin >> N >> M;\\n vector<double>a(N),b(N),c(N);\\n for(int i = 0; i < N; i++) {\\n cin >> a[i] >> b[i] >> c[i];\\n }\\n double ans = 0;\\n for(int i = 0; i < (1 << N); i++) {\\n if(__builtin_popcount(i) == M) {\\n vector<double>idx;\\n for(int j = 0; j < N;j ++) {\\n if(1 & (i >> j)) {\\n idx.push_back(j);\\n }\\n }\\n double sum = 0;\\n for(int j = 0; j < M; j++) {\\n for(int k = j+1; k < M; k++) {\\n sum += pow(abs(a[idx[j]]-a[idx[k]]),2);\\n sum += pow(abs(b[idx[j]]-b[idx[k]]),2);\\n sum += pow(abs(c[idx[j]]-c[idx[k]]),2);\\n }\\n }\\n ans = max(ans,sum);\\n }\\n }\\n cout << fixed << setprecision(18) << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.0843,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2300_6036875\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main(void){\\n int n, m;\\n cin >> n >> m;\\n double ans = 0;\\n vector<double> L(n), A(n), B(n);\\n for(int i = 0; i < n; i++) cin >> L[i] >> A[i] >> B[i];\\n for(int bit = 0; bit < (1 << n); bit++){\\n vector<int> lst;\\n for(int j = 0; j < n; j++){\\n if(bit >> j & 1) lst.push_back(j);\\n }\\n if(lst.size() != m) continue;\\n double tot = 0;\\n for(int i = 0; i < m; i++){\\n for(int j = i + 1; j < m; j++){\\n tot += (L[lst[i]] - L[lst[j]]) * (L[lst[i]] - L[lst[j]]);\\n tot += (A[lst[i]] - A[lst[j]]) * (A[lst[i]] - A[lst[j]]);\\n tot += (B[lst[i]] - B[lst[j]]) * (B[lst[i]] - B[lst[j]]);\\n }\\n }\\n if(tot > ans) ans = tot;\\n }\\n \\n cout << fixed << setprecision(12) << ans;\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3292,\n \"score_of_the_acc\": -0.5556,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2300_6036416\",\n \"code_snippet\": \"#pragma GCC ta g(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define DEBUG\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n int sz = a.size();\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr;\\n sz--;\\n if(sz) cout << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//#include <atcoder/maxflow>\\n//using namespace atcoder;\\nconst int inf = (1<<30)-1;\\nconst ll linf = 1LL<<61;\\nconst int MAX = 510000;\\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-9;\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nint main(){\\n\\tint n,m; cin >> n >> m;\\n\\tvd a(n),b(n),c(n);\\n\\trep(i,n) cin >> a[i] >> b[i] >> c[i];\\n\\tdouble ans = 0;\\n\\trep(bit,1<<n){\\n\\t\\tif(pcount(bit) != m) continue;\\n\\t\\tdouble res = 0;\\n\\t\\trep(i,n) rep(j,i){\\n\\t\\t\\tif((bit>>i & 1) && (bit>>j & 1)){\\n\\t\\t\\t\\tres += (a[i]-a[j])*(a[i]-a[j]) + (b[i]-b[j])*(b[i]-b[j]) + (c[i]-c[j])*(c[i]-c[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tchmax(ans, res);\\n\\t}\\n\\tprintf(\\\"%.10f\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3572,\n \"score_of_the_acc\": -0.1505,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2300_5962724\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define all(v) v.begin(), v.end()\\n#define rall(v) v.rbegin(), v.rend()\\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\\n#define codefor int test;scanf(\\\"%d\\\",&test);while(test--)\\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define yes(ans) if(ans)printf(\\\"yes\\\\n\\\");else printf(\\\"no\\\\n\\\")\\n#define Yes(ans) if(ans)printf(\\\"Yes\\\\n\\\");else printf(\\\"No\\\\n\\\")\\n#define YES(ans) if(ans)printf(\\\"YES\\\\n\\\");else printf(\\\"NO\\\\n\\\")\\n#define popcount(v) __builtin_popcount(v)\\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\n#define umap unordered_map\\n#define uset unordered_set\\nusing namespace std;\\nusing ll = long long;\\nconst int MOD=1000000007;\\nconst int MOD2=998244353;\\nconst int INF=1<<30;\\nconst ll INF2=(ll)1<<60;\\nvoid scan(int& a){scanf(\\\"%d\\\",&a);}\\nvoid scan(long long& a){scanf(\\\"%lld\\\",&a);}\\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\\ntemplate<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\\ntemplate<class T> void scan(T& a){cin>>a;}\\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\\nvoid print(const int& a){printf(\\\"%d\\\",a);}\\nvoid print(const long long& a){printf(\\\"%lld\\\",a);}\\nvoid print(const double& a){printf(\\\"%.15lf\\\",a);}\\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\\ntemplate<class T> void print(const T& a){cout<<a;}\\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\\nvoid out(){putchar('\\\\n');}\\ntemplate<class T> void out(const T& t){print(t);putchar('\\\\n');}\\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\\ntemplate<class T> void dprint(const T& a){cerr<<a;}\\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\\\" \\\"<<*it;}}\\nvoid debug(){cerr<<endl;}\\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\\\" \\\";debug(tail...);}\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\\nll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}\\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\\n\\nint main(){\\n INT(n,m);\\n vector2d(double,a,n,3);\\n in(a);\\n vector<bool> b(m,1);\\n while(b.size()<n)b.push_back(0);\\n sort(all(b));\\n double ans=0;\\n do{\\n double d=0;\\n drep(i,j,n){\\n if(b[i]&&b[j]){\\n double d2=0;\\n rep(k,3){\\n d2+=(a[i][k]-a[j][k])*(a[i][k]-a[j][k]);\\n }\\n d+=d2;\\n }\\n }\\n chmax(ans,d);\\n }while(next_permutation(all(b)));\\n out(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3552,\n \"score_of_the_acc\": -0.1492,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2300_5949973\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i = 0; i < (n); i++)\\nusing namespace std;\\ntypedef long long ll;\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n \\n int N,M; cin >> N >> M;\\n vector<double> L(N), a(N), b(N);\\n rep(i,N) cin >> L[i] >> a[i] >> b[i];\\n\\n double ans = 0;\\n rep(i,1<<N) {\\n double cur = 0;\\n if(__builtin_popcount(i) == M) {\\n vector<int> v;\\n rep(j,N) if(i & (1 << j)) v.push_back(j);\\n for(int j : v) for(int k : v) if(j < k)\\n cur += (L[k] - L[j]) * (L[k] - L[j]) + (a[k] - a[j]) * (a[k] - a[j]) + (b[k] - b[j]) * (b[k] - b[j]);\\n }\\n ans = max(ans, cur);\\n }\\n cout.precision(17);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.0835,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1284,"cells":{"group_id":{"kind":"string","value":"aoj_2301_cpp"},"problem_description":{"kind":"string","value":"Sleeping Time\nMiki is a high school student.\nShe has a part time job, so she cannot take enough sleep on weekdays.\nShe wants to take good sleep on holidays, but she doesn't know the best length of sleeping time for her.\n\nShe is now trying to figure that out with the following algorithm:\nBegin with the numbers\nK\n,\nR\nand\nL\n.\nShe tries to sleep for\nH=(R+L)/2\nhours.\nIf she feels the time is longer than or equal to the optimal length, then update\nL\nwith\nH\n. Otherwise, update\nR\nwith\nH\n.\nAfter repeating step 2 and 3 for\nK\nnights, she decides her optimal sleeping time to be\nT' = (R+L)/2\n.\nIf her feeling is always correct, the steps described above should give her a very accurate optimal sleeping time.\nBut unfortunately, she makes mistake in step 3 with the probability\nP\n.\nAssume you know the optimal sleeping time\nT\nfor Miki.\nYou have to calculate the probability\nPP\nthat the absolute difference of\nT'\nand\nT\nis smaller or equal to\nE\n.\nIt is guaranteed that the answer remains unaffected by the change of\nE\nin\n10^{-10}\n.\nInput\nThe input follows the format shown below\nK\nR\nL\nP\nE\nT\nWhere the integers\n0 \\leq K \\leq 30\n,\n0 \\leq R \\leq L \\leq 12\nare the parameters for the algorithm described above.\n The decimal numbers on the following three lines of the input gives the parameters for the estimation. You can assume\n0 \\leq P \\leq 1\n,\n0 \\leq E \\leq 12\n,\n0 \\leq T \\leq 12\n.\nOutput\nOutput\nPP\nin one line.\n\nThe output should not contain an error greater than\n10^{-5}\n.\nSample Input 1\n3 0 2\n0.10000000000\n0.50000000000\n1.00000000000\nOutput for the Sample Input 1\n0.900000\nSample Input 2\n3 0 2\n0.10000000000\n0.37499999977\n1.00000000000\nOutput for the Sample Input 2\n0.810000\nSample Input 3\n3 0 2\n0.10000000000\n0.00000100000\n0.37500000000\nOutput for the Sample Input 3\n0.729000\nSample Input 4\n3 0 2\n0.20000000000\n0.00000100000\n0.37500000000\nOutput for the Sample Input 4\n0.512000"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2301_10958607","code_snippet":"#include<bits/stdc++.h>\ntemplate <class T>\ninline bool rd(T &ret) {\n char c; int sgn;\n if(c=getchar(),c==EOF) return 0;\n while(c!='-'&&(c<'0'||c>'9')) c=getchar();\n sgn=(c=='-')?-1:1;\n ret=(c=='-')?0:(c-'0');\n while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');\n ret*=sgn;\n return 1;\n}\ntemplate <class T>\ninline void pt(T x) {\n if (x <0) {\n putchar('-');\n x = -x;\n }\n if(x>9) pt(x/10);\n putchar(x%10+'0');\n}\nusing namespace std;\nconst double eps = 1e-7;\nint K;\ndouble L, R, P, E, T;\ndouble ans ;\nvoid dfs(double l, double r, double p, int dep){\n if(fabs(T-l) <= E && fabs(T-r) <= E) {ans += p; return ;}\n double mid = (l+r)/2.0;\n if(dep >= K)\n {\n if(fabs(T-mid) <= E) ans += p;\n return ;\n }\n if(p < eps) return ;\n if(mid < T)\n {\n dfs(mid, r, p*(1.0-P), dep+1);\n dfs(l, mid, p*P, dep+1);\n }\n else\n {\n dfs(mid, r, p*P, dep+1);\n dfs(l, mid, p*(1.0-P), dep+1);\n }\n}\nint main(){\n while(~scanf(\"%d %lf %lf\", &K, &L, &R)){\n scanf(\"%lf %lf %lf\", &P, &E, &T);\n ans = 0;\n dfs(L, R, 1.0, 0);\n printf(\"%.10f\\n\", ans);\n }\n return 0;\n}\n/*\n30 0 12\n0.5\n0\n13\n\n*/","accuracy":1,"time_ms":60,"memory_kb":3564,"score_of_the_acc":-1.0139,"final_rank":1},{"submission_id":"aoj_2301_8860915","code_snippet":"#include <iostream>\n#include <cstdio>\nusing namespace std;\n\nint K, R, L;\ndouble P, E, T;\n\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n\n if (r < T - E || T + E < l)\n return 0;\n\n double left_dfs = dfs(d - 1, l, mid);\n double right_dfs = dfs(d - 1, mid, r);\n\n if (mid >= T)\n return (1.0 - P) * left_dfs + P * right_dfs;\n\n return (1.0 - P) * right_dfs + P * left_dfs;\n}\n\nint main() {\n cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs(K, L, R));\n\n return 0;\n}","accuracy":1,"time_ms":3300,"memory_kb":3284,"score_of_the_acc":-1.1996,"final_rank":10},{"submission_id":"aoj_2301_8860913","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K, R, L;\ndouble P, E, T;\n\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n if (!d) {\n return ((mid > T - E) && (mid < T + E)) ? 1.0 : 0.0;\n }\n if (r < T - E || l > T + E) {\n return 0.0;\n }\n \n double res = dfs(d - 1, mid, r); // store result of dfs() call in a variable\n if (mid >= T) {\n return (1.0 - P) * dfs(d - 1, l, mid) + P * res; \n }\n return (1.0 - P) * res + P * dfs(d - 1, l, mid);\n}\n\nint main() {\n scanf(\"%d %d %d %lf %lf %lf\", &K, &L, &R, &P, &E, &T);\n printf(\"%.9f\\n\", dfs(K, L, R));\n return 0;\n}","accuracy":1,"time_ms":3260,"memory_kb":3248,"score_of_the_acc":-1.0967,"final_rank":2},{"submission_id":"aoj_2301_8835889","code_snippet":"#include <iostream>\n#include <cstdio>\n\ndouble dfs(int d, double l, double r, double T, double E, double P) {\n double mid = (l + r) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid, T, E, P) + P * dfs(d - 1, mid, r, T, E, P);\n return (1.0 - P) * dfs(d - 1, mid, r, T, E, P) + P * dfs(d - 1, l, mid, T, E, P);\n}\n\nint main() {\n int K, L, R;\n double P, E, T;\n std::cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs(K, L, R, T, E, P));\n return 0;\n}","accuracy":1,"time_ms":3610,"memory_kb":3284,"score_of_the_acc":-1.2857,"final_rank":13},{"submission_id":"aoj_2301_8822601","code_snippet":"#include <iostream>\n#include <cmath>\n\nint K, R, L;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(NULL);\n std::cin >> K >> L >> R >> P >> E >> T;\n std::cout.precision(9);\n std::cout << dfs(K, L, R) << \"\\n\";\n return 0;\n}","accuracy":0.28378378378378377,"time_ms":3220,"memory_kb":3292,"score_of_the_acc":-1.1978,"final_rank":18},{"submission_id":"aoj_2301_8216346","code_snippet":"#include <iostream>\n#include <cstdio>\nusing namespace std;\n\nstatic double K, R, L, P, E, T;\n\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) * .5;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1. : .0;\n if (r < T - E || T + E < l)\n return .0;\n if (mid >= T)\n return (1. - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1. - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\n\nint main() {\n std::ios::sync_with_stdio(false); // faster I/O\n cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs((int)K, L, R));\n return 0;\n}","accuracy":1,"time_ms":3210,"memory_kb":3292,"score_of_the_acc":-1.195,"final_rank":8},{"submission_id":"aoj_2301_8216345","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K, R, L;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n if (r < T - E || T + E < l)\n return 0;\n double mid = (l + r) * 0.5;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nint main() {\n cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs(K, L, R));\n return 0;\n}","accuracy":1,"time_ms":3400,"memory_kb":3272,"score_of_the_acc":-1.1968,"final_rank":9},{"submission_id":"aoj_2301_8216344","code_snippet":"#include <iostream>\n#include <cmath>\n\nint K, R, L;\ndouble P, E, T;\n\ndouble dfs(int d, double l, double r) {\n double mid = l + ((r - l) / 2);\n if (d == 0)\n return (std::abs(mid - T) <= E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n double p1 = P * dfs(d - 1, l, mid);\n double p2 = (1.0 - P) * dfs(d - 1, mid, r);\n if (mid >= T)\n return p2 + p1;\n return p1 + p2;\n}\n\nint main() {\n std::cin >> K >> L >> R >> P >> E >> T;\n std::cout.precision(9);\n std::cout << dfs(K, L, R) << std::endl;\n return 0;\n}","accuracy":0.13513513513513514,"time_ms":30,"memory_kb":3272,"score_of_the_acc":-0.2607,"final_rank":20},{"submission_id":"aoj_2301_8216341","code_snippet":"#include <iostream>\n#include <cstdio>\n\ndouble P, E, T;\nint K;\ndouble dfs(int d, double l, double r) {\n if (r < T - E || T + E < l)\n return 0;\n if (!d)\n return 1;\n double mid = l + (r - l) / 2;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\n\nint main() {\n double L, R;\n std::cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs(K, L, R));\n return 0;\n}","accuracy":0.5135135135135135,"time_ms":3410,"memory_kb":3272,"score_of_the_acc":-1.1995,"final_rank":15},{"submission_id":"aoj_2301_8216337","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) * 0.5;\n if (d == 0)\n return (fabs(mid - T) <= E) ? 1.0 : 0.0;\n if (r < T - E || T + E < l)\n return 0.0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nint main() {\n double L, R;\n cin >> K >> L >> R >> P >> E >> T;\n cout << fixed << setprecision(9) << dfs(K, L, R) << \"\\n\";\n return 0;\n}","accuracy":1,"time_ms":3270,"memory_kb":3272,"score_of_the_acc":-1.1607,"final_rank":7},{"submission_id":"aoj_2301_8216336","code_snippet":"#include <iostream>\n#include <cstdio>\n\nusing namespace std;\n\nint K;\ndouble L, R, P, E, T;\n\ndouble dfs(int d, double l, double r) {\n if (r < T - E || T + E < l) return 0;\n if (!d) return (T - E < r && l < T + E) ? 1 : 0;\n double mid = l + (r - l) / 2;\n if (mid >= T) return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n else return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\n\nint main() {\n cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs(K, L, R));\n return 0;\n}","accuracy":0.5135135135135135,"time_ms":3240,"memory_kb":3272,"score_of_the_acc":-1.1523,"final_rank":14},{"submission_id":"aoj_2301_8216333","code_snippet":"#include <iostream>\n#include <cstdio>\n\ndouble P, E, T;\nint K;\ndouble dfs(int d, double l, double r) {\n double mid = l + (r - l) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nint main() {\n int L, R;\n std::cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs(K, L, R));\n return 0;\n}","accuracy":1,"time_ms":3440,"memory_kb":3272,"score_of_the_acc":-1.2079,"final_rank":11},{"submission_id":"aoj_2301_8216327","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K, R, L;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nmain() {\n cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs(K, L, R));\n}","accuracy":1,"time_ms":3260,"memory_kb":3272,"score_of_the_acc":-1.1579,"final_rank":5},{"submission_id":"aoj_2301_8208796","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K, R, L;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nmain() {\n cin >> K >> L >> R >> P >> E >> T;\n cout << dfs(K, L, R);\n}","accuracy":0.28378378378378377,"time_ms":3290,"memory_kb":3272,"score_of_the_acc":-1.1662,"final_rank":17},{"submission_id":"aoj_2301_8208795","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K, R, L;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nint main() {\n cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs(K, L, R));\n}","accuracy":1,"time_ms":3260,"memory_kb":3272,"score_of_the_acc":-1.1579,"final_rank":5},{"submission_id":"aoj_2301_8208794","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K, R, L;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nmain() {\n cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.10f\\n\", dfs(K, L, R));\n}","accuracy":1,"time_ms":3250,"memory_kb":3272,"score_of_the_acc":-1.1551,"final_rank":3},{"submission_id":"aoj_2301_8208793","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K, R, L;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (mid < T - E || T + E < l)\n return 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nmain() {\n cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs(K, L, R));\n}","accuracy":0.13513513513513514,"time_ms":10,"memory_kb":3172,"score_of_the_acc":0,"final_rank":19},{"submission_id":"aoj_2301_8208791","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K, R, L;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nmain() {\n cin >> K >> L >> R >> P >> E >> T;\n cout << dfs(K, L, R) << endl;\n}","accuracy":0.28378378378378377,"time_ms":3190,"memory_kb":3272,"score_of_the_acc":-1.1384,"final_rank":16},{"submission_id":"aoj_2301_8208789","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K, R, L;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n if (mid >= T)\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nmain() {\n cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9lf\\n\", dfs(K, L, R));\n}","accuracy":1,"time_ms":3250,"memory_kb":3272,"score_of_the_acc":-1.1551,"final_rank":3},{"submission_id":"aoj_2301_8116471","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint K, R, L;\ndouble P, E, T;\ndouble dfs(int d, double l, double r) {\n double mid = (l + r) / 2;\n if (!d)\n return (T - E < mid && mid < T + E) ? 1 : 0;\n if (r < T - E || T + E < l)\n return 0;\n if (mid >= T) {\n double p = 1.0 - P;\n return p * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\n }\n double p = 1.0 - P;\n return p * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n cin >> K >> L >> R >> P >> E >> T;\n printf(\"%.9f\\n\", dfs(K, L, R));\n return 0;\n}","accuracy":1,"time_ms":3350,"memory_kb":3308,"score_of_the_acc":-1.2747,"final_rank":12}],"string":"[\n {\n \"submission_id\": \"aoj_2301_10958607\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntemplate <class T>\\ninline bool rd(T &ret) {\\n char c; int sgn;\\n if(c=getchar(),c==EOF) return 0;\\n while(c!='-'&&(c<'0'||c>'9')) c=getchar();\\n sgn=(c=='-')?-1:1;\\n ret=(c=='-')?0:(c-'0');\\n while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');\\n ret*=sgn;\\n return 1;\\n}\\ntemplate <class T>\\ninline void pt(T x) {\\n if (x <0) {\\n putchar('-');\\n x = -x;\\n }\\n if(x>9) pt(x/10);\\n putchar(x%10+'0');\\n}\\nusing namespace std;\\nconst double eps = 1e-7;\\nint K;\\ndouble L, R, P, E, T;\\ndouble ans ;\\nvoid dfs(double l, double r, double p, int dep){\\n if(fabs(T-l) <= E && fabs(T-r) <= E) {ans += p; return ;}\\n double mid = (l+r)/2.0;\\n if(dep >= K)\\n {\\n if(fabs(T-mid) <= E) ans += p;\\n return ;\\n }\\n if(p < eps) return ;\\n if(mid < T)\\n {\\n dfs(mid, r, p*(1.0-P), dep+1);\\n dfs(l, mid, p*P, dep+1);\\n }\\n else\\n {\\n dfs(mid, r, p*P, dep+1);\\n dfs(l, mid, p*(1.0-P), dep+1);\\n }\\n}\\nint main(){\\n while(~scanf(\\\"%d %lf %lf\\\", &K, &L, &R)){\\n scanf(\\\"%lf %lf %lf\\\", &P, &E, &T);\\n ans = 0;\\n dfs(L, R, 1.0, 0);\\n printf(\\\"%.10f\\\\n\\\", ans);\\n }\\n return 0;\\n}\\n/*\\n30 0 12\\n0.5\\n0\\n13\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": -1.0139,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2301_8860915\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\nusing namespace std;\\n\\nint K, R, L;\\ndouble P, E, T;\\n\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n\\n if (r < T - E || T + E < l)\\n return 0;\\n\\n double left_dfs = dfs(d - 1, l, mid);\\n double right_dfs = dfs(d - 1, mid, r);\\n\\n if (mid >= T)\\n return (1.0 - P) * left_dfs + P * right_dfs;\\n\\n return (1.0 - P) * right_dfs + P * left_dfs;\\n}\\n\\nint main() {\\n cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R));\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3300,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -1.1996,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2301_8860913\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K, R, L;\\ndouble P, E, T;\\n\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n if (!d) {\\n return ((mid > T - E) && (mid < T + E)) ? 1.0 : 0.0;\\n }\\n if (r < T - E || l > T + E) {\\n return 0.0;\\n }\\n \\n double res = dfs(d - 1, mid, r); // store result of dfs() call in a variable\\n if (mid >= T) {\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * res; \\n }\\n return (1.0 - P) * res + P * dfs(d - 1, l, mid);\\n}\\n\\nint main() {\\n scanf(\\\"%d %d %d %lf %lf %lf\\\", &K, &L, &R, &P, &E, &T);\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3260,\n \"memory_kb\": 3248,\n \"score_of_the_acc\": -1.0967,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2301_8835889\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n\\ndouble dfs(int d, double l, double r, double T, double E, double P) {\\n double mid = (l + r) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid, T, E, P) + P * dfs(d - 1, mid, r, T, E, P);\\n return (1.0 - P) * dfs(d - 1, mid, r, T, E, P) + P * dfs(d - 1, l, mid, T, E, P);\\n}\\n\\nint main() {\\n int K, L, R;\\n double P, E, T;\\n std::cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R, T, E, P));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3610,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -1.2857,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2301_8822601\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n\\nint K, R, L;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\n\\nint main() {\\n std::ios_base::sync_with_stdio(false);\\n std::cin.tie(NULL);\\n std::cin >> K >> L >> R >> P >> E >> T;\\n std::cout.precision(9);\\n std::cout << dfs(K, L, R) << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 0.28378378378378377,\n \"time_ms\": 3220,\n \"memory_kb\": 3292,\n \"score_of_the_acc\": -1.1978,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2301_8216346\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\nusing namespace std;\\n\\nstatic double K, R, L, P, E, T;\\n\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) * .5;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1. : .0;\\n if (r < T - E || T + E < l)\\n return .0;\\n if (mid >= T)\\n return (1. - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1. - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\n\\nint main() {\\n std::ios::sync_with_stdio(false); // faster I/O\\n cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs((int)K, L, R));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3210,\n \"memory_kb\": 3292,\n \"score_of_the_acc\": -1.195,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2301_8216345\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K, R, L;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n if (r < T - E || T + E < l)\\n return 0;\\n double mid = (l + r) * 0.5;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nint main() {\\n cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3400,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.1968,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2301_8216344\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n\\nint K, R, L;\\ndouble P, E, T;\\n\\ndouble dfs(int d, double l, double r) {\\n double mid = l + ((r - l) / 2);\\n if (d == 0)\\n return (std::abs(mid - T) <= E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n double p1 = P * dfs(d - 1, l, mid);\\n double p2 = (1.0 - P) * dfs(d - 1, mid, r);\\n if (mid >= T)\\n return p2 + p1;\\n return p1 + p2;\\n}\\n\\nint main() {\\n std::cin >> K >> L >> R >> P >> E >> T;\\n std::cout.precision(9);\\n std::cout << dfs(K, L, R) << std::endl;\\n return 0;\\n}\",\n \"accuracy\": 0.13513513513513514,\n \"time_ms\": 30,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -0.2607,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2301_8216341\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n\\ndouble P, E, T;\\nint K;\\ndouble dfs(int d, double l, double r) {\\n if (r < T - E || T + E < l)\\n return 0;\\n if (!d)\\n return 1;\\n double mid = l + (r - l) / 2;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\n\\nint main() {\\n double L, R;\\n std::cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R));\\n return 0;\\n}\",\n \"accuracy\": 0.5135135135135135,\n \"time_ms\": 3410,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.1995,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2301_8216337\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) * 0.5;\\n if (d == 0)\\n return (fabs(mid - T) <= E) ? 1.0 : 0.0;\\n if (r < T - E || T + E < l)\\n return 0.0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nint main() {\\n double L, R;\\n cin >> K >> L >> R >> P >> E >> T;\\n cout << fixed << setprecision(9) << dfs(K, L, R) << \\\"\\\\n\\\";\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3270,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.1607,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2301_8216336\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n\\nusing namespace std;\\n\\nint K;\\ndouble L, R, P, E, T;\\n\\ndouble dfs(int d, double l, double r) {\\n if (r < T - E || T + E < l) return 0;\\n if (!d) return (T - E < r && l < T + E) ? 1 : 0;\\n double mid = l + (r - l) / 2;\\n if (mid >= T) return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n else return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\n\\nint main() {\\n cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R));\\n return 0;\\n}\",\n \"accuracy\": 0.5135135135135135,\n \"time_ms\": 3240,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.1523,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2301_8216333\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n\\ndouble P, E, T;\\nint K;\\ndouble dfs(int d, double l, double r) {\\n double mid = l + (r - l) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nint main() {\\n int L, R;\\n std::cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3440,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.2079,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2301_8216327\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K, R, L;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nmain() {\\n cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3260,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.1579,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2301_8208796\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K, R, L;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nmain() {\\n cin >> K >> L >> R >> P >> E >> T;\\n cout << dfs(K, L, R);\\n}\",\n \"accuracy\": 0.28378378378378377,\n \"time_ms\": 3290,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.1662,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2301_8208795\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K, R, L;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nint main() {\\n cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3260,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.1579,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2301_8208794\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K, R, L;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nmain() {\\n cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.10f\\\\n\\\", dfs(K, L, R));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3250,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.1551,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2301_8208793\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K, R, L;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (mid < T - E || T + E < l)\\n return 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nmain() {\\n cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R));\\n}\",\n \"accuracy\": 0.13513513513513514,\n \"time_ms\": 10,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": 0,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2301_8208791\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K, R, L;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nmain() {\\n cin >> K >> L >> R >> P >> E >> T;\\n cout << dfs(K, L, R) << endl;\\n}\",\n \"accuracy\": 0.28378378378378377,\n \"time_ms\": 3190,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.1384,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2301_8208789\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K, R, L;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n if (mid >= T)\\n return (1.0 - P) * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n return (1.0 - P) * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nmain() {\\n cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9lf\\\\n\\\", dfs(K, L, R));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3250,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -1.1551,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2301_8116471\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint K, R, L;\\ndouble P, E, T;\\ndouble dfs(int d, double l, double r) {\\n double mid = (l + r) / 2;\\n if (!d)\\n return (T - E < mid && mid < T + E) ? 1 : 0;\\n if (r < T - E || T + E < l)\\n return 0;\\n if (mid >= T) {\\n double p = 1.0 - P;\\n return p * dfs(d - 1, l, mid) + P * dfs(d - 1, mid, r);\\n }\\n double p = 1.0 - P;\\n return p * dfs(d - 1, mid, r) + P * dfs(d - 1, l, mid);\\n}\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(NULL);\\n cout.tie(NULL);\\n cin >> K >> L >> R >> P >> E >> T;\\n printf(\\\"%.9f\\\\n\\\", dfs(K, L, R));\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3350,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -1.2747,\n \"final_rank\": 12\n }\n]","isConversational":false}}},{"rowIdx":1285,"cells":{"group_id":{"kind":"string","value":"aoj_2302_cpp"},"problem_description":{"kind":"string","value":"On or Off\nSaving electricity is very important!\nYou are in the office represented as\nR \\times C\ngrid that consists of walls and rooms.\nIt is guaranteed that, for any pair of rooms in the office, there exists exactly one route between the two rooms.\nIt takes 1 unit of time for you to move to the next room (that is, the grid adjacent to the current room).\nRooms are so dark that you need to switch on a light when you enter a room.\nWhen you leave the room, you can either leave the light on, or\nof course you can switch off the light. Each room keeps consuming electric power while the light is on.\nToday you have a lot of tasks across the office.\n Tasks are given as a list of coordinates, and they need to be done in the specified order. \nTo save electricity, you want to finish all the tasks with the minimal amount of electric power.\nThe problem is not so easy though, because you will consume electricity not only when light is on, but also when you switch on/off the light.\n\nLuckily, you know the cost of power consumption per unit time and also the cost to switch on/off the light for all the rooms in the office.\nBesides, you are so smart that you don't need any time to do the tasks themselves.\nSo please figure out the optimal strategy to minimize the amount of electric power consumed.\nAfter you finished all the tasks, please DO NOT leave the light on at any room.\nIt's obviously wasting!\nInput\nThe first line of the input contains three positive integers\nR\n(\n0 \\lt R \\leq 50\n),\nC\n(\n0 \\lt C \\leq 50\n) and\nM\n(\n2 \\leq M \\leq 1000\n).\nThe following\nR\nlines, which contain\nC\ncharacters each, describe the layout of the office.\n '.' describes a room and '#' describes a wall.\nThis is followed by three matrices with\nR\nrows,\nC\ncolumns each.\nEvery elements of the matrices are positive integers.\nThe\n(r, c)\nelement in the first matrix describes the power consumption per unit of time for the room at the coordinate\n(r, c)\n.\nThe\n(r, c)\nelement in the second matrix and the third matrix describe the cost to turn on the light and the cost to turn off the light, respectively, in the room at the coordinate\n(r, c)\n.\nEach of the last\nM\nlines contains two positive integers, which describe the coodinates of the room for you to do the task.\nNote that you cannot do the\ni\n-th task if any of the\nj\n-th task (\n0 \\leq j \\leq i\n) is left undone.\nOutput\nPrint one integer that describes the minimal amount of electric power consumed when you finished all the tasks.\nSample Input 1\n1 3 2\n...\n1 1 1\n1 2 1\n1 1 1\n0 0\n0 2\nOutput for the Sample Input 1\n7\nSample Input 2\n3 3 5\n...\n.##\n..#\n1 1 1\n1 0 0\n1 1 0\n3 3 3\n3 0 0\n3 3 0\n5 4 5\n4 0 0\n5 4 0\n1 0\n2 1\n0 2\n2 0\n0 0\nOutput for the Sample Input 2\n77\nSample Input 3\n5 5 10\n#.###\n#....\n###.#\n..#.#\n#....\n0 12 0 0 0\n0 4 3 2 10\n0 0 0 99 0\n11 13 0 2 0\n0 1 1 2 1\n0 4 0 0 0\n0 13 8 2 4\n0 0 0 16 0\n1 1 0 2 0\n0 2 3 1 99\n0 2 0 0 0\n0 12 2 12 2\n0 0 0 3 0\n4 14 0 16 0\n0 2 14 2 90\n0 1\n3 0\n4 4\n1 4\n1 1\n4 4\n1 1\n4 3\n3 0\n1 4\nOutput for the Sample Input 3\n777"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2302_10858089","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n\nconst int dx[]={1,0,0,-1};\nconst int dy[]={0,1,-1,0};\n\nconst int N = 55;\nqueue<int> q;\nvector<int> path;\nchar mp[N][N];\nint vis[N][N], pre[N][N], t[N*N];\nint val[N][N], op[N][N], cl[N][N];\nint n, m, K, X[N*N], Y[N*N];\nvoid BFS(int sx, int sy, int ex, int ey) {\n\twhile(!q.empty()) q.pop();\n\tmemset(vis, -1, sizeof vis);\n\tmemset(pre, -1, sizeof pre);\n\n\tvis[sx][sy] = 0;\n\tq.push(sx*N+sy);\n\twhile(!q.empty()) {\n\t\tint tmp = q.front(); q.pop();\n\t\tint x = tmp / N, y = tmp % N;\n\t\tif(x == ex && y == ey) break;//continue;\n\t\t\n\t\tfor(int di = 0; di < 4; di ++) {\n\t\t\tint nx = x + dx[di], ny = y + dy[di];\n\t\t\tif(nx < 0 || nx >= n || ny < 0 || ny >= m) continue;\n\t\t\tif(vis[nx][ny] != -1 || mp[nx][ny] == '#') continue;\n\t\t\t\n\t\t\tvis[nx][ny] = vis[x][y] + 1;\n\t\t\tpre[nx][ny] = x*N+y;\n\t\t\tq.push(nx*N+ny);\n\t\t}\n\t}\n\t\n\tint size = 0, x = ex, y = ey;\n\twhile(pre[x][y] != -1) {\n\t\tint tmp = pre[x][y];\n\t\tt[size++] = tmp;\n\t\tx = tmp / N;\n\t\ty = tmp % N;\n\t}\n\tfor(int i = size-1; i >= 0; i --) path.push_back(t[i]);\n\n}\nvoid input() {\n\tfor(int i = 0; i < n; i ++)\n\t\tscanf(\"%s\", mp[i]);\n\n\tfor(int i = 0; i < n; i ++) {\n\t\tfor(int j = 0; j < m; j ++) {\n\t\t\tscanf(\"%d\", &val[i][j]);\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\tscanf(\"%d\", &op[i][j]);\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\tscanf(\"%d\", &cl[i][j]);\n\t\t}\n\t}\n\tfor(int i = 0; i < K; i ++) {\n\t\tscanf(\"%d%d\", &X[i], &Y[i]);\n\t}\n}\nint main() {\n\twhile(~scanf(\"%d%d%d\", &n, &m, &K)) {\n\t\tinput();\n\t\t//\n\t\tpath.clear();\n\t\tfor(int i = 1; i < K; i ++) {\n\t\t\tBFS(X[i-1], Y[i-1], X[i], Y[i]);\n\t\t}\n\t\tpath.push_back(X[K-1]*N+Y[K-1]);\n\t\t\n\t\tmemset(pre, -1, sizeof pre);\n\t\tint ans = 0;\n\t\tfor(int i = 0; i < (int)path.size(); i ++) {\n\t\t\tint x = path[i]/N, y = path[i]%N;\n\t\t\tif(pre[x][y] == -1) {\n\t\t\t\tans += op[x][y] + cl[x][y];\n\t\t\t} else {\n\t\t\t\tint tmp = (i - pre[x][y]) * val[x][y];\n\t\t\t\ttmp = min(tmp, op[x][y] + cl[x][y]);\n\t\t\t\tans += tmp;\n\t\t\t}\n\t\t\tpre[x][y] = i;\n\t\t}\n\t\t\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":13464,"score_of_the_acc":-0.2581,"final_rank":3},{"submission_id":"aoj_2302_10730502","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int NMAX = 60, PMAX = 1010;\nconst int dl[] = {1, 0, -1, 0};\nconst int dc[] = {0, 1, 0, -1};\n\nint N, M, Q;\nchar A[NMAX][NMAX];\nint B[NMAX][NMAX];\nint C[NMAX][NMAX];\nint D[NMAX][NMAX];\nint Dist[NMAX][NMAX];\nlist<int> E[NMAX][NMAX];\npair<int, int> from[NMAX][NMAX];\nbool witness[NMAX][NMAX];\n\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\n\tqueue<pair<int, int>> Q;\n\n\tmemset(witness, 0, sizeof witness);\n\tQ.push({startX, startY});\n\twitness[startX][startY] = 1;\n\tDist[startX][startY] = 0;\n\tbool found = 0;\n\twhile (!Q.empty()) {\n\t\tint currX, currY;\n\t\ttie(currX, currY) = Q.front();\n\t\tQ.pop();\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tint newX = currX + dl[i];\n\t\t\tint newY = currY + dc[i];\n\t\t\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\n\t\t\t\tcontinue;\n\t\t\tif (A[newX][newY] != '.' || witness[newX][newY])\n\t\t\t\tcontinue;\n\t\t\tfrom[newX][newY] = {currX, currY};\n\t\t\tDist[newX][newY] = Dist[currX][currY] + 1;\n\t\t\twitness[newX][newY] = 1;\n\t\t\tQ.push({newX, newY});\n\t\t\tif (newX == finishX && newY == finishY) {\n\t\t\t\tfound = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tassert(found);\n\tint currX, currY;\n\ttie(currX, currY) = from[finishX][finishY];\n\tint newSize = dest.size() + Dist[currX][currY];\n\tassert(newSize < 2500000);\n\tdest.resize(newSize);\n\t--newSize;\n\twhile (currX != startX || currY != startY) {\n\t\tdest[newSize--] = {currX, currY};\n\t\ttie(currX, currY) = from[currX][currY];\n\t}\n}\n\nint main() {\n//\tassert(freopen(\"debug.in\", \"r\", stdin));\n//\tassert(freopen(\"debug.out\", \"w\", stdout));\n\n\tint i, j;\n\n\tscanf(\"%d %d %d\", &N, &M, &Q);\n\tfor (i = 0; i < N; ++i)\n\t\tscanf(\"%s\", A[i]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &B[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &C[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &D[i][j]);\n\n\tvector<pair<int, int>> path;\n\tint lastX, lastY, currX, currY;\n\tscanf(\"%d %d\", &lastX, &lastY);\n\twhile (Q-- > 1) {\n\t\tscanf(\"%d %d\", &currX, &currY);\n\t\tassert(lastX != currX || lastY != currY);\n\t\tpath.push_back({lastX, lastY});\n\t\tgetPath(lastX, lastY, currX, currY, path);\n\t\tlastX = currX, lastY = currY;\n\t}\n\tpath.push_back({lastX, lastY});\n\n\tassert(path.size() < 2500000);\n\n\tfor (size_t i = 0; i < path.size(); ++i)\n\t\tE[path[i].first][path[i].second].push_back(i);\n\n\tbool lightOn[NMAX][NMAX] = {};\n\tint answer = 0;\n\tint currAdd = 0;\n\tfor (size_t i = 0; i < path.size(); ++i) {\n\t\tanswer += currAdd;\n\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\tanswer += C[path[i].first][path[i].second];\n\t\tE[path[i].first][path[i].second].pop_front();\n\t\tint front = E[path[i].first][path[i].second].front();\n\t\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\n\t\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd += B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 1;\n\t\t} else {\n\t\t\tif (lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd -= B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 0;\n\t\t\tanswer += D[path[i].first][path[i].second];\n\t\t}\n\t}\n\n\tcout << answer << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":53052,"score_of_the_acc":-1.3604,"final_rank":11},{"submission_id":"aoj_2302_10730500","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int NMAX = 60, PMAX = 1010;\nconst int dl[] = {1, 0, -1, 0};\nconst int dc[] = {0, 1, 0, -1};\n\nint N, M, Q;\nchar A[NMAX][NMAX];\nint B[NMAX][NMAX];\nint C[NMAX][NMAX];\nint D[NMAX][NMAX];\nlist<int> E[NMAX][NMAX];\npair<int, int> from[NMAX][NMAX];\nbool witness[NMAX][NMAX];\n\nvector<pair<int, int>> getPath(int startX, int startY, int finishX, int finishY) {\n\tvector<pair<int, int>> answer;\n\tqueue<pair<int, int>> Q;\n\n\tmemset(witness, 0, sizeof witness);\n\tmemset(from, 0, sizeof from);\n\tQ.push({startX, startY});\n\twitness[startX][startY] = 1;\n\twhile (!Q.empty()) {\n\t\tint currX, currY;\n\t\ttie(currX, currY) = Q.front();\n\t\tQ.pop();\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tint newX = currX + dl[i];\n\t\t\tint newY = currY + dc[i];\n\t\t\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\n\t\t\t\tcontinue;\n\t\t\tif (A[newX][newY] != '.' || witness[newX][newY])\n\t\t\t\tcontinue;\n\t\t\tfrom[newX][newY] = {currX, currY};\n\t\t\twitness[newX][newY] = 1;\n\t\t\tQ.push({newX, newY});\n\t\t\tif (newX == finishX && newY == finishY)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tint currX, currY;\n\ttie(currX, currY) = from[finishX][finishY];\n\twhile (currX != startX || currY != startY) {\n\t\tanswer.push_back({currX, currY});\n\t\ttie(currX, currY) = from[currX][currY];\n\t}\n\treverse(answer.begin(), answer.end());\n\treturn answer;\n}\n\nint main() {\n//\tassert(freopen(\"debug.in\", \"r\", stdin));\n//\tassert(freopen(\"debug.out\", \"w\", stdout));\n\n\tint i, j;\n\n\tcin >> N >> M >> Q;\n\tfor (i = 0; i < N; ++i)\n\t\tcin >> A[i];\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tcin >> B[i][j];\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tcin >> C[i][j];\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tcin >> D[i][j];\n\n\tvector<pair<int, int>> path;\n\tint lastX, lastY, currX, currY;\n\tcin >> lastX >> lastY;\n\twhile (Q-- > 1) {\n\t\tcin >> currX >> currY;\n\t\tpath.push_back({lastX, lastY});\n\t\tvector<pair<int, int>> currPath = getPath(lastX, lastY, currX, currY);\n\t\tfor (auto it: currPath)\n\t\t\tpath.push_back(it);\n\t\tlastX = currX, lastY = currY;\n\t}\n\tpath.push_back({lastX, lastY});\n\n\tfor (size_t i = 0; i < path.size(); ++i)\n\t\tE[path[i].first][path[i].second].push_back(i);\n\n\tbool lightOn[NMAX][NMAX] = {};\n\tint answer = 0;\n\tint currAdd = 0;\n\tfor (size_t i = 0; i < path.size(); ++i) {\n\t\tanswer += currAdd;\n\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\tanswer += C[path[i].first][path[i].second];\n\t\tE[path[i].first][path[i].second].pop_front();\n\t\tint front = E[path[i].first][path[i].second].front();\n\t\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\n\t\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd += B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 1;\n\t\t} else {\n\t\t\tif (lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd -= B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 0;\n\t\t\tanswer += D[path[i].first][path[i].second];\n\t\t}\n\t}\n\n\tcout << answer << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":54572,"score_of_the_acc":-1.4566,"final_rank":17},{"submission_id":"aoj_2302_10730499","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <map>\n#include <string>\n#include <queue>\nusing namespace std;\n#define SZ(v) ((int)(v).size())\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define repf(i, a, b) for (int i = (a); i <= (b); ++i)\nconst int maxint = -1u>>1;\nconst int maxn = 50 + 2;\nconst int maxm = 1000 + 10;\nconst int dx[] = {-1, 0, 1, 0};\nconst int dy[] = {0, -1, 0, 1};\n\nint r, c, m;\nchar s[maxn][maxn];\nint open[maxn][maxn], inst[maxn][maxn], close[maxn][maxn];\npair<int, int> rec[maxm];\nvector<pair<int, int> > p;\nvector<int> tm[maxn][maxn];\nbool used[maxn][maxn];\n\nbool dfs(int x1, int y1, int x2, int y2) {\n if (x1 == x2 && y1 == y2) return true;\n if (used[x1][y1]) return false;\n used[x1][y1] = true;\n p.push_back(make_pair(x1, y1));\n for (int i = 0; i < 4; ++i) {\n int tx = x1 + dx[i], ty = y1 + dy[i];\n if (tx < 0 || ty < 0 || tx >= r || ty >= c || s[tx][ty] != '.') continue;\n if (dfs(tx, ty, x2, y2)) return true;\n }\n p.pop_back();\n return false;\n}\nint main() {\n while (scanf(\"%d%d%d\", &r, &c, &m) == 3) {\n for (int i = 0; i < r; ++i) {\n scanf(\"%s\", s[i]);\n }\n for (int i = 0; i < r; ++i) {\n for (int j = 0; j < c; ++j) {\n tm[i][j].clear();\n scanf(\"%d\", &inst[i][j]);\n }\n }\n for (int i = 0; i < r; ++i) {\n for (int j = 0; j < c; ++j) {\n scanf(\"%d\", &open[i][j]);\n }\n }\n for (int i = 0; i < r; ++i) {\n for (int j = 0; j < c; ++j) {\n scanf(\"%d\", &close[i][j]);\n }\n }\n for (int i = 0; i < m; ++i) {\n scanf(\"%d%d\", &rec[i].first, &rec[i].second);\n }\n int now = 0;\n for (int i = 1; i < m; ++i) {\n memset(used, 0, sizeof(used));\n p.clear();\n dfs(rec[i - 1].first, rec[i - 1].second, rec[i].first, rec[i].second);\n for (int j = 0; j < (int) p.size(); ++j) {\n tm[p[j].first][p[j].second].push_back(now);\n ++now;\n }\n }\n tm[rec[m - 1].first][rec[m - 1].second].push_back(now);\n int ans = 0;\n for (int i = 0; i < r; ++i) {\n for (int j = 0; j < c; ++j) {\n if (tm[i][j].size() == 0) continue;\n //printf(\"%d %d: \", i, j);for (int k = 0; k < (int)tm[i][j].size(); ++k) printf(\"%d \", tm[i][j][k]); printf(\"\\n\");\n ans += open[i][j] + close[i][j] + inst[i][j] * (tm[i][j].back() - tm[i][j].front());\n for (int k = 1; k < (int)tm[i][j].size(); ++k) {\n if ((tm[i][j][k] - tm[i][j][k - 1]) * inst[i][j] > open[i][j] + close[i][j]) {\n ans -= (tm[i][j][k] - tm[i][j][k - 1]) * inst[i][j] - open[i][j] - close[i][j];\n }\n }\n }\n }\n printf(\"%d\\n\", ans);\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":8628,"score_of_the_acc":-0.1641,"final_rank":1},{"submission_id":"aoj_2302_10726699","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int NMAX = 60, PMAX = 1010;\nconst int dl[] = {1, 0, -1, 0};\nconst int dc[] = {0, 1, 0, -1};\n\nint N, M, Q;\nchar A[NMAX][NMAX];\nint B[NMAX][NMAX];\nint C[NMAX][NMAX];\nint D[NMAX][NMAX];\nint Dist[NMAX][NMAX];\nlist<int> E[NMAX][NMAX];\npair<int, int> from[NMAX][NMAX];\nbool witness[NMAX][NMAX];\n\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\n\tqueue<pair<int, int>> Q;\n\n\tmemset(witness, 0, sizeof witness);\n\tQ.push({startX, startY});\n\twitness[startX][startY] = 1;\n\tDist[startX][startY] = 0;\n\tbool found = 0;\n\twhile (!Q.empty()) {\n\t\tint currX, currY;\n\t\ttie(currX, currY) = Q.front();\n\t\tQ.pop();\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tint newX = currX + dl[i];\n\t\t\tint newY = currY + dc[i];\n\t\t\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\n\t\t\t\tcontinue;\n\t\t\tif (A[newX][newY] != '.' || witness[newX][newY])\n\t\t\t\tcontinue;\n\t\t\tfrom[newX][newY] = {currX, currY};\n\t\t\tDist[newX][newY] = Dist[currX][currY] + 1;\n\t\t\twitness[newX][newY] = 1;\n\t\t\tQ.push({newX, newY});\n\t\t\tif (newX == finishX && newY == finishY) {\n\t\t\t\tfound = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tassert(found);\n\tint currX, currY;\n\ttie(currX, currY) = from[finishX][finishY];\n\tint newSize = dest.size() + Dist[currX][currY];\n\tdest.resize(newSize);\n\t--newSize;\n\twhile (currX != startX || currY != startY) {\n\t\tdest[newSize--] = {currX, currY};\n\t\ttie(currX, currY) = from[currX][currY];\n\t}\n}\n\nint main() {\n//\tassert(freopen(\"debug.in\", \"r\", stdin));\n//\tassert(freopen(\"debug.out\", \"w\", stdout));\n\n\tint i, j;\n\n\tscanf(\"%d %d %d\", &N, &M, &Q);\n\tfor (i = 0; i < N; ++i)\n\t\tscanf(\"%s\", A[i]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &B[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &C[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &D[i][j]);\n\n\tvector<pair<int, int>> path;\n\tint lastX, lastY, currX, currY;\n\tscanf(\"%d %d\", &lastX, &lastY);\n\twhile (Q-- > 1) {\n\t\tscanf(\"%d %d\", &currX, &currY);\n\t\tassert(lastX != currX || lastY != currY);\n\t\tpath.push_back({lastX, lastY});\n\t\tgetPath(lastX, lastY, currX, currY, path);\n\t\tlastX = currX, lastY = currY;\n\t}\n\tpath.push_back({lastX, lastY});\n\n\tassert(path.size() < 2500000);\n\n\tfor (size_t i = 0; i < path.size(); ++i)\n\t\tE[path[i].first][path[i].second].push_back(i);\n\n\tbool lightOn[NMAX][NMAX] = {};\n\tint answer = 0;\n\tint currAdd = 0;\n\tfor (size_t i = 0; i < path.size(); ++i) {\n\t\tanswer += currAdd;\n\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\tanswer += C[path[i].first][path[i].second];\n\t\tE[path[i].first][path[i].second].pop_front();\n\t\tint front = E[path[i].first][path[i].second].front();\n\t\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\n\t\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd += B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 1;\n\t\t} else {\n\t\t\tif (lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd -= B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 0;\n\t\t\tanswer += D[path[i].first][path[i].second];\n\t\t}\n\t}\n\n\tcout << answer << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":53104,"score_of_the_acc":-1.3615,"final_rank":12},{"submission_id":"aoj_2302_10726697","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int NMAX = 60, PMAX = 1010;\nconst int dl[] = {1, 0, -1, 0};\nconst int dc[] = {0, 1, 0, -1};\n\nint N, M, Q;\nchar A[NMAX][NMAX];\nint B[NMAX][NMAX];\nint C[NMAX][NMAX];\nint D[NMAX][NMAX];\nint Dist[NMAX][NMAX];\nlist<int> E[NMAX][NMAX];\npair<int, int> from[NMAX][NMAX];\nbool witness[NMAX][NMAX];\n\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\n\tqueue<pair<int, int>> Q;\n\n\tmemset(witness, 0, sizeof witness);\n\tQ.push({startX, startY});\n\twitness[startX][startY] = 1;\n\tDist[startX][startY] = 0;\n\tbool found = 0;\n\twhile (!Q.empty()) {\n\t\tint currX, currY;\n\t\ttie(currX, currY) = Q.front();\n\t\tQ.pop();\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tint newX = currX + dl[i];\n\t\t\tint newY = currY + dc[i];\n\t\t\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\n\t\t\t\tcontinue;\n\t\t\tif (A[newX][newY] != '.' || witness[newX][newY])\n\t\t\t\tcontinue;\n\t\t\tfrom[newX][newY] = {currX, currY};\n\t\t\tDist[newX][newY] = Dist[currX][currY] + 1;\n\t\t\twitness[newX][newY] = 1;\n\t\t\tQ.push({newX, newY});\n\t\t\tif (newX == finishX && newY == finishY) {\n\t\t\t\tfound = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tassert(found);\n\tint currX, currY;\n\ttie(currX, currY) = from[finishX][finishY];\n\tint newSize = dest.size() + Dist[currX][currY];\n\tdest.resize(newSize);\n\t--newSize;\n\twhile (currX != startX || currY != startY) {\n\t\tdest[newSize--] = {currX, currY};\n\t\ttie(currX, currY) = from[currX][currY];\n\t}\n}\n\nint main() {\n//\tassert(freopen(\"debug.in\", \"r\", stdin));\n//\tassert(freopen(\"debug.out\", \"w\", stdout));\n\n\tint i, j;\n\n\tscanf(\"%d %d %d\", &N, &M, &Q);\n\tfor (i = 0; i < N; ++i)\n\t\tscanf(\"%s\", A[i]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &B[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &C[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &D[i][j]);\n\n\tvector<pair<int, int>> path;\n\tint lastX, lastY, currX, currY;\n\tscanf(\"%d %d\", &lastX, &lastY);\n\twhile (Q-- > 1) {\n\t\tscanf(\"%d %d\", &currX, &currY);\n\t\tassert(lastX != currX || lastY != currY);\n\t\tpath.push_back({lastX, lastY});\n\t\tgetPath(lastX, lastY, currX, currY, path);\n\t\tlastX = currX, lastY = currY;\n\t}\n\tpath.push_back({lastX, lastY});\n\n\tfor (size_t i = 0; i < path.size(); ++i)\n\t\tE[path[i].first][path[i].second].push_back(i);\n\n\tbool lightOn[NMAX][NMAX] = {};\n\tint answer = 0;\n\tint currAdd = 0;\n\tfor (size_t i = 0; i < path.size(); ++i) {\n\t\tanswer += currAdd;\n\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\tanswer += C[path[i].first][path[i].second];\n\t\tE[path[i].first][path[i].second].pop_front();\n\t\tint front = E[path[i].first][path[i].second].front();\n\t\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\n\t\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd += B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 1;\n\t\t} else {\n\t\t\tif (lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd -= B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 0;\n\t\t\tanswer += D[path[i].first][path[i].second];\n\t\t}\n\t}\n\n\tcout << answer << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":53172,"score_of_the_acc":-1.3628,"final_rank":14},{"submission_id":"aoj_2302_10726695","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int NMAX = 60, PMAX = 1010;\nconst int dl[] = {1, 0, -1, 0};\nconst int dc[] = {0, 1, 0, -1};\n\nint N, M, Q;\nchar A[NMAX][NMAX];\nint B[NMAX][NMAX];\nint C[NMAX][NMAX];\nint D[NMAX][NMAX];\nint Dist[NMAX][NMAX];\nlist<int> E[NMAX][NMAX];\npair<int, int> from[NMAX][NMAX];\nbool witness[NMAX][NMAX];\n\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\n\tqueue<pair<int, int>> Q;\n\n\tmemset(witness, 0, sizeof witness);\n\tQ.push({startX, startY});\n\twitness[startX][startY] = 1;\n\tDist[startX][startY] = 0;\n\twhile (!Q.empty()) {\n\t\tint currX, currY;\n\t\ttie(currX, currY) = Q.front();\n\t\tQ.pop();\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tint newX = currX + dl[i];\n\t\t\tint newY = currY + dc[i];\n\t\t\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\n\t\t\t\tcontinue;\n\t\t\tif (A[newX][newY] != '.' || witness[newX][newY])\n\t\t\t\tcontinue;\n\t\t\tfrom[newX][newY] = {currX, currY};\n\t\t\tDist[newX][newY] = Dist[currX][currY] + 1;\n\t\t\twitness[newX][newY] = 1;\n\t\t\tQ.push({newX, newY});\n\t\t\tif (newX == finishX && newY == finishY)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tint currX, currY;\n\ttie(currX, currY) = from[finishX][finishY];\n\tint newSize = dest.size() + Dist[currX][currY];\n\tdest.resize(newSize);\n\t--newSize;\n\twhile (currX != startX || currY != startY) {\n\t\tdest[newSize--] = {currX, currY};\n\t\ttie(currX, currY) = from[currX][currY];\n\t}\n}\n\nint main() {\n//\tassert(freopen(\"debug.in\", \"r\", stdin));\n//\tassert(freopen(\"debug.out\", \"w\", stdout));\n\n\tint i, j;\n\n\tscanf(\"%d %d %d\", &N, &M, &Q);\n\tfor (i = 0; i < N; ++i)\n\t\tscanf(\"%s\", A[i]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &B[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &C[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &D[i][j]);\n\n\tvector<pair<int, int>> path;\n\tint lastX, lastY, currX, currY;\n\tscanf(\"%d %d\", &lastX, &lastY);\n\twhile (Q-- > 1) {\n\t\tscanf(\"%d %d\", &currX, &currY);\n\t\tassert(lastX != currX || lastY != currY);\n\t\tpath.push_back({lastX, lastY});\n\t\tgetPath(lastX, lastY, currX, currY, path);\n\t\tlastX = currX, lastY = currY;\n\t}\n\tpath.push_back({lastX, lastY});\n\n\tfor (size_t i = 0; i < path.size(); ++i)\n\t\tE[path[i].first][path[i].second].push_back(i);\n\n\tbool lightOn[NMAX][NMAX] = {};\n\tint answer = 0;\n\tint currAdd = 0;\n\tfor (size_t i = 0; i < path.size(); ++i) {\n\t\tanswer += currAdd;\n\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\tanswer += C[path[i].first][path[i].second];\n\t\tE[path[i].first][path[i].second].pop_front();\n\t\tint front = E[path[i].first][path[i].second].front();\n\t\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\n\t\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd += B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 1;\n\t\t} else {\n\t\t\tif (lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd -= B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 0;\n\t\t\tanswer += D[path[i].first][path[i].second];\n\t\t}\n\t}\n\n\tcout << answer << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":53132,"score_of_the_acc":-1.362,"final_rank":13},{"submission_id":"aoj_2302_10726693","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int NMAX = 60, PMAX = 1010;\nconst int dl[] = {1, 0, -1, 0};\nconst int dc[] = {0, 1, 0, -1};\n\nint N, M, Q;\nchar A[NMAX][NMAX];\nint B[NMAX][NMAX];\nint C[NMAX][NMAX];\nint D[NMAX][NMAX];\nint Dist[NMAX][NMAX];\nlist<int> E[NMAX][NMAX];\npair<int, int> from[NMAX][NMAX];\nbool witness[NMAX][NMAX];\n\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\n\tqueue<pair<int, int>> Q;\n\n\tmemset(witness, 0, sizeof witness);\n\tQ.push({startX, startY});\n\twitness[startX][startY] = 1;\n\tDist[startX][startY] = 0;\n\twhile (!Q.empty()) {\n\t\tint currX, currY;\n\t\ttie(currX, currY) = Q.front();\n\t\tQ.pop();\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tint newX = currX + dl[i];\n\t\t\tint newY = currY + dc[i];\n\t\t\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\n\t\t\t\tcontinue;\n\t\t\tif (A[newX][newY] != '.' || witness[newX][newY])\n\t\t\t\tcontinue;\n\t\t\tfrom[newX][newY] = {currX, currY};\n\t\t\tDist[newX][newY] = Dist[currX][currY] + 1;\n\t\t\twitness[newX][newY] = 1;\n\t\t\tQ.push({newX, newY});\n\t\t\tif (newX == finishX && newY == finishY)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tint currX, currY;\n\ttie(currX, currY) = from[finishX][finishY];\n\tint newSize = dest.size() + Dist[currX][currY];\n\tdest.resize(newSize);\n\t--newSize;\n\twhile (currX != startX || currY != startY) {\n\t\tdest[newSize--] = {currX, currY};\n\t\ttie(currX, currY) = from[currX][currY];\n\t}\n}\n\nint main() {\n//\tassert(freopen(\"debug.in\", \"r\", stdin));\n//\tassert(freopen(\"debug.out\", \"w\", stdout));\n\n\tint i, j;\n\n\tscanf(\"%d %d %d\", &N, &M, &Q);\n\tfor (i = 0; i < N; ++i)\n\t\tscanf(\"%s\", A[i]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &B[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &C[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &D[i][j]);\n\n\tvector<pair<int, int>> path;\n\tint lastX, lastY, currX, currY;\n\tscanf(\"%d %d\", &lastX, &lastY);\n\twhile (Q-- > 1) {\n\t\tscanf(\"%d %d\", &currX, &currY);\n\t\tpath.push_back({lastX, lastY});\n\t\tgetPath(lastX, lastY, currX, currY, path);\n\t\tlastX = currX, lastY = currY;\n\t}\n\tpath.push_back({lastX, lastY});\n\n\tfor (size_t i = 0; i < path.size(); ++i)\n\t\tE[path[i].first][path[i].second].push_back(i);\n\n\tbool lightOn[NMAX][NMAX] = {};\n\tint answer = 0;\n\tint currAdd = 0;\n\tfor (size_t i = 0; i < path.size(); ++i) {\n\t\tanswer += currAdd;\n\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\tanswer += C[path[i].first][path[i].second];\n\t\tE[path[i].first][path[i].second].pop_front();\n\t\tint front = E[path[i].first][path[i].second].front();\n\t\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\n\t\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd += B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 1;\n\t\t} else {\n\t\t\tif (lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd -= B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 0;\n\t\t\tanswer += D[path[i].first][path[i].second];\n\t\t}\n\t}\n\n\tcout << answer << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":53264,"score_of_the_acc":-1.3646,"final_rank":16},{"submission_id":"aoj_2302_10726692","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int NMAX = 60, PMAX = 1010;\nconst int dl[] = {1, 0, -1, 0};\nconst int dc[] = {0, 1, 0, -1};\n\nint N, M, Q;\nchar A[NMAX][NMAX];\nint B[NMAX][NMAX];\nint C[NMAX][NMAX];\nint D[NMAX][NMAX];\nlist<int> E[NMAX][NMAX];\npair<int, int> from[NMAX][NMAX];\nbool witness[NMAX][NMAX];\n\nvector<pair<int, int>> getPath(int startX, int startY, int finishX, int finishY) {\n\tvector<pair<int, int>> answer;\n\tqueue<pair<int, int>> Q;\n\n\tmemset(witness, 0, sizeof witness);\n\tQ.push({startX, startY});\n\twitness[startX][startY] = 1;\n\twhile (!Q.empty()) {\n\t\tint currX, currY;\n\t\ttie(currX, currY) = Q.front();\n\t\tQ.pop();\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tint newX = currX + dl[i];\n\t\t\tint newY = currY + dc[i];\n\t\t\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\n\t\t\t\tcontinue;\n\t\t\tif (A[newX][newY] != '.' || witness[newX][newY])\n\t\t\t\tcontinue;\n\t\t\tfrom[newX][newY] = {currX, currY};\n\t\t\twitness[newX][newY] = 1;\n\t\t\tQ.push({newX, newY});\n\t\t\tif (newX == finishX && newY == finishY)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tint currX, currY;\n\ttie(currX, currY) = from[finishX][finishY];\n\twhile (currX != startX || currY != startY) {\n\t\tanswer.push_back({currX, currY});\n\t\ttie(currX, currY) = from[currX][currY];\n\t}\n\treverse(answer.begin(), answer.end());\n\treturn answer;\n}\n\nint main() {\n//\tassert(freopen(\"debug.in\", \"r\", stdin));\n//\tassert(freopen(\"debug.out\", \"w\", stdout));\n\n\tint i, j;\n\n\tscanf(\"%d %d %d\", &N, &M, &Q);\n\tfor (i = 0; i < N; ++i)\n\t\tscanf(\"%s\", A[i]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &B[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &C[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &D[i][j]);\n\n\tvector<pair<int, int>> path;\n\tint lastX, lastY, currX, currY;\n\tscanf(\"%d %d\", &lastX, &lastY);\n\twhile (Q-- > 1) {\n\t\tscanf(\"%d %d\", &currX, &currY);\n\t\tpath.push_back({lastX, lastY});\n\t\tvector<pair<int, int>> currPath = getPath(lastX, lastY, currX, currY);\n\t\tfor (auto it: currPath)\n\t\t\tpath.push_back(it);\n\t\tlastX = currX, lastY = currY;\n\t}\n\tpath.push_back({lastX, lastY});\n\n\tfor (size_t i = 0; i < path.size(); ++i)\n\t\tE[path[i].first][path[i].second].push_back(i);\n\n\tbool lightOn[NMAX][NMAX] = {};\n\tint answer = 0;\n\tint currAdd = 0;\n\tfor (size_t i = 0; i < path.size(); ++i) {\n\t\tanswer += currAdd;\n\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\tanswer += C[path[i].first][path[i].second];\n\t\tE[path[i].first][path[i].second].pop_front();\n\t\tint front = E[path[i].first][path[i].second].front();\n\t\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\n\t\t\tif (!lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd += B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 1;\n\t\t} else {\n\t\t\tif (lightOn[path[i].first][path[i].second])\n\t\t\t\tcurrAdd -= B[path[i].first][path[i].second];\n\t\t\tlightOn[path[i].first][path[i].second] = 0;\n\t\t\tanswer += D[path[i].first][path[i].second];\n\t\t}\n\t}\n\n\tcout << answer << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":54868,"score_of_the_acc":-1.4624,"final_rank":18},{"submission_id":"aoj_2302_10726688","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int NMAX = 60, PMAX = 1010;\nconst int dl[] = {1, 0, -1, 0};\nconst int dc[] = {0, 1, 0, -1};\n\nint N, M, Q;\nchar A[NMAX][NMAX];\nint B[NMAX][NMAX];\nint C[NMAX][NMAX];\nint D[NMAX][NMAX];\nlist<int> E[NMAX][NMAX];\npair<int, int> from[NMAX][NMAX];\nbool witness[NMAX][NMAX];\n\nvector<pair<int, int>> getPath(int startX, int startY, int finishX, int finishY) {\n\tvector<pair<int, int>> answer;\n\tqueue<pair<int, int>> Q;\n\n\tmemset(witness, 0, sizeof witness);\n\tmemset(from, 0, sizeof from);\n\tQ.push({startX, startY});\n\twitness[startX][startY] = 1;\n\twhile (!Q.empty()) {\n\t\tint currX, currY;\n\t\ttie(currX, currY) = Q.front();\n\t\tQ.pop();\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tint newX = currX + dl[i];\n\t\t\tint newY = currY + dc[i];\n\t\t\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\n\t\t\t\tcontinue;\n\t\t\tif (A[newX][newY] != '.' || witness[newX][newY])\n\t\t\t\tcontinue;\n\t\t\tfrom[newX][newY] = {currX, currY};\n\t\t\twitness[newX][newY] = 1;\n\t\t\tQ.push({newX, newY});\n\t\t\tif (newX == finishX && newY == finishY)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tint currX, currY;\n\ttie(currX, currY) = from[finishX][finishY];\n\twhile (currX != startX || currY != startY) {\n\t\tanswer.push_back({currX, currY});\n\t\ttie(currX, currY) = from[currX][currY];\n\t}\n\treverse(answer.begin(), answer.end());\n\treturn answer;\n}\n\nint main() {\n//\tassert(freopen(\"debug.in\", \"r\", stdin));\n//\tassert(freopen(\"debug.out\", \"w\", stdout));\n\n\tint i, j;\n\n\tcin >> N >> M >> Q;\n\tfor (i = 0; i < N; ++i)\n\t\tcin >> A[i];\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tcin >> B[i][j];\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tcin >> C[i][j];\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tcin >> D[i][j];\n\n\tvector<pair<int, int>> path;\n\tint lastX, lastY, currX, currY;\n\tcin >> lastX >> lastY;\n\twhile (Q-- > 1) {\n\t\tcin >> currX >> currY;\n\t\tpath.push_back({lastX, lastY});\n\t\tvector<pair<int, int>> currPath = getPath(lastX, lastY, currX, currY);\n\t\tfor (auto it: currPath)\n\t\t\tpath.push_back(it);\n\t\tlastX = currX, lastY = currY;\n\t}\n\tpath.push_back({lastX, lastY});\n\n\tfor (size_t i = 0; i < path.size(); ++i)\n\t\tE[path[i].first][path[i].second].push_back(i);\n\n\tset<pair<int, int>> lightOn;\n\tint answer = 0;\n\tint currAdd = 0;\n\tfor (size_t i = 0; i < path.size(); ++i) {\n\t\tanswer += currAdd;\n\t\tif (!lightOn.count(path[i]))\n\t\t\tanswer += C[path[i].first][path[i].second];\n\t\tE[path[i].first][path[i].second].pop_front();\n\t\tint front = E[path[i].first][path[i].second].front();\n\t\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\n\t\t\tif (!lightOn.count(path[i]))\n\t\t\t\tcurrAdd += B[path[i].first][path[i].second];\n\t\t\tlightOn.insert(path[i]);\n\t\t} else {\n\t\t\tif (lightOn.count(path[i]))\n\t\t\t\tcurrAdd -= B[path[i].first][path[i].second];\n\t\t\tlightOn.erase(path[i]);\n\t\t\tanswer += D[path[i].first][path[i].second];\n\t\t}\n\t}\n\n\tcout << answer << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":55088,"score_of_the_acc":-1.5333,"final_rank":19},{"submission_id":"aoj_2302_10726686","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int NMAX = 60, PMAX = 1010;\nconst int dl[] = {1, 0, -1, 0};\nconst int dc[] = {0, 1, 0, -1};\n\nint N, M, Q;\nchar A[NMAX][NMAX];\nint B[NMAX][NMAX];\nint C[NMAX][NMAX];\nint D[NMAX][NMAX];\nlist<int> E[NMAX][NMAX];\npair<int, int> from[NMAX][NMAX];\nbool witness[NMAX][NMAX];\n\nvector<pair<int, int>> getPath(int startX, int startY, int finishX, int finishY) {\n\tvector<pair<int, int>> answer;\n\tqueue<pair<int, int>> Q;\n\n\tmemset(witness, 0, sizeof witness);\n\tmemset(from, 0, sizeof from);\n\tQ.push({startX, startY});\n\twitness[startX][startY] = 1;\n\twhile (!Q.empty()) {\n\t\tint currX, currY;\n\t\ttie(currX, currY) = Q.front();\n\t\tQ.pop();\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tint newX = currX + dl[i];\n\t\t\tint newY = currY + dc[i];\n\t\t\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\n\t\t\t\tcontinue;\n\t\t\tif (A[newX][newY] != '.' || witness[newX][newY])\n\t\t\t\tcontinue;\n\t\t\tfrom[newX][newY] = {currX, currY};\n\t\t\twitness[newX][newY] = 1;\n\t\t\tQ.push({newX, newY});\n\t\t\tif (newX == finishX && newY == finishY)\n\t\t\t\tbreak;\n\t\t}\n\t}\n\tint currX, currY;\n\ttie(currX, currY) = from[finishX][finishY];\n\twhile (currX != startX || currY != startY) {\n\t\tanswer.push_back({currX, currY});\n\t\ttie(currX, currY) = from[currX][currY];\n\t}\n\treverse(answer.begin(), answer.end());\n\treturn answer;\n}\n\nint main() {\n//\tassert(freopen(\"debug.in\", \"r\", stdin));\n//\tassert(freopen(\"debug.out\", \"w\", stdout));\n\n\tint i, j;\n\n\tcin >> N >> M >> Q;\n\tfor (i = 0; i < N; ++i)\n\t\tcin >> A[i];\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tcin >> B[i][j];\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tcin >> C[i][j];\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tcin >> D[i][j];\n\n\tvector<pair<int, int>> path;\n\tint lastX, lastY, currX, currY;\n\tcin >> lastX >> lastY;\n\twhile (Q-- > 1) {\n\t\tcin >> currX >> currY;\n\t\tpath.push_back({lastX, lastY});\n\t\tvector<pair<int, int>> currPath = getPath(lastX, lastY, currX, currY);\n\t\tfor (auto it: currPath)\n\t\t\tpath.push_back(it);\n\t\tlastX = currX, lastY = currY;\n\t}\n\tpath.push_back({lastX, lastY});\n\n\tfor (size_t i = 0; i < path.size(); ++i)\n\t\tE[path[i].first][path[i].second].push_back(i);\n\n\tset<pair<int, int>> lightOn;\n\tint answer = 0;\n\tfor (size_t i = 0; i < path.size(); ++i) {\n\t\tfor (auto it: lightOn)\n\t\t\tanswer += B[it.first][it.second];\n\t\tif (!lightOn.count(path[i]))\n\t\t\tanswer += C[path[i].first][path[i].second];\n\t\tE[path[i].first][path[i].second].pop_front();\n\t\tint front = E[path[i].first][path[i].second].front();\n\t\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\n\t\t\tlightOn.insert(path[i]);\n\t\t} else {\n\t\t\tlightOn.erase(path[i]);\n\t\t\tanswer += D[path[i].first][path[i].second];\n\t\t}\n\t}\n\n\tcout << answer << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":160,"memory_kb":54896,"score_of_the_acc":-1.9963,"final_rank":20},{"submission_id":"aoj_2302_10726682","code_snippet":"#include<stdio.h>\n#include<string.h>\nint room[60][60]={0},step[60][60]={0},appear[60][60][1010]={0};\nunsigned long long on[60][60],off[60][60],keep[60][60];\nint tasks[1000][2]={0};\nint n,m,ntask,total;\nconst int go[4][2]={{0,1},{0,-1},{1,0},{-1,0}};\n\nvoid indata()\n{\n int i,j,k;\n scanf(\"%d %d %d\\n\",&n,&m,&ntask);\n for (i=1;i<=n;i++)\n {\n for (j=1;j<=m;j++)\n {\n if (getchar()=='.')\n room[i][j]=1;\n }\n getchar();\n }\n for (i=1;i<=n;i++)\n for (j=1;j<=m;j++)\n scanf(\"%d\",&keep[i][j]);\n for (i=1;i<=n;i++)\n for (j=1;j<=m;j++)\n scanf(\"%d\",&on[i][j]);\n for (i=1;i<=n;i++)\n for (j=1;j<=m;j++)\n scanf(\"%d\",&off[i][j]);\n for (i=1;i<=ntask;i++)\n {\n scanf(\"%d%d\",&tasks[i][0],&tasks[i][1]);\n tasks[i][0]++;\n tasks[i][1]++;\n }\n}\n\nint bfs(int aimx,int aimy,int nowx,int nowy,int time)\n{\n int i,j,k;\n int x,y;\n for (i=0;i<4;i++)\n {\n x=nowx+go[i][0];\n y=nowy+go[i][1];\n if (room[x][y]&&(!step[x][y]))\n {\n step[x][y]=time;\n if ((aimx==x)&&(aimy==y))\n {\n appear[x][y][++appear[x][y][0]]=time;\n return time;\n }\n else\n {\n if (bfs(aimx,aimy,x,y,time+1))\n {\n appear[x][y][++appear[x][y][0]]=time;\n return time;\n }\n }\n }\n }\n return 0;\n}\n\nint main()\n{\n /* freopen(\"input.txt\",\"r\",stdin);\n freopen(\"output.txt\",\"w\",stdout);*/\n int i,j,k,now;\n unsigned long long ans=0;\n indata();\n appear[tasks[1][0]][tasks[1][1]][0]=1;\n appear[tasks[1][0]][tasks[1][1]][1]=1;\n now=1;\n /*for (i=1;i<=ntask;i++)\n printf(\"%d %d\\n\",tasks[i][0],tasks[i][1]);*/\n for (i=2;i<=ntask;i++)\n {\n memset(step,0,sizeof(step));\n step[tasks[i-1][0]][tasks[i-1][1]]=now;\n bfs(tasks[i][0],tasks[i][1],tasks[i-1][0],tasks[i-1][1],now+1);\n now=step[tasks[i][0]][tasks[i][1]];\n }\n /* for (i=1;i<=n;i++)\n for (j=1;j<=m;j++)\n {\n printf(\"%d %d:\",i,j);\n for (k=1;k<=appear[i][j][0];k++)\n printf(\" %d\",appear[i][j][k]);\n putchar('\\n');\n }*/\n for (i=1;i<=n;i++)\n for (j=1;j<=m;j++)\n {\n if (appear[i][j][0])\n ans+=on[i][j]+off[i][j];\n for (k=1;k<appear[i][j][0];k++)\n if ((appear[i][j][k+1]-appear[i][j][k])*keep[i][j]>on[i][j]+off[i][j])\n ans+=on[i][j]+off[i][j];\n else\n ans+=(appear[i][j][k+1]-appear[i][j][k])*keep[i][j];\n }\n printf(\"%llu\\n\",ans);\n /* fclose(stdin);\n fclose(stdout);*/\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":14240,"score_of_the_acc":-0.2065,"final_rank":2},{"submission_id":"aoj_2302_10726636","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int NMAX = 60, PMAX = 1010;\nconst int dl[] = {1, 0, -1, 0};\nconst int dc[] = {0, 1, 0, -1};\n\nint N, M, Q;\nchar A[NMAX][NMAX];\nint B[NMAX][NMAX];\nint C[NMAX][NMAX];\nint D[NMAX][NMAX];\nint Dist[NMAX][NMAX];\nlist<int> E[NMAX][NMAX];\npair<int, int> from[NMAX][NMAX];\n\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\n\tqueue<pair<int, int>> Q;\n\n\tbool witness[NMAX][NMAX] = {};\n\tQ.push({startX, startY});\n\twitness[startX][startY] = 1;\n\tDist[startX][startY] = 0;\n\tbool found = 0;\n\twhile (!Q.empty()) {\n\t\tint currX, currY;\n\t\ttie(currX, currY) = Q.front();\n\t\tQ.pop();\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tint newX = currX + dl[i];\n\t\t\tint newY = currY + dc[i];\n\t\t\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\n\t\t\t\tcontinue;\n\t\t\tif (A[newX][newY] != '.' || witness[newX][newY])\n\t\t\t\tcontinue;\n\t\t\tfrom[newX][newY] = {currX, currY};\n\t\t\tDist[newX][newY] = Dist[currX][currY] + 1;\n\t\t\twitness[newX][newY] = 1;\n\t\t\tQ.push({newX, newY});\n\t\t\tif (newX == finishX && newY == finishY) {\n\t\t\t\tfound = 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tassert(found);\n\tint currX, currY;\n\ttie(currX, currY) = from[finishX][finishY];\n\tint newSize = dest.size() + Dist[currX][currY];\n\tassert(newSize < 2500000);\n\tdest.resize(newSize);\n\t--newSize;\n\twhile (currX != startX || currY != startY) {\n\t\tdest[newSize--] = {currX, currY};\n\t\ttie(currX, currY) = from[currX][currY];\n\t}\n}\n\nint main() {\n//\tassert(freopen(\"debug.in\", \"r\", stdin));\n//\tassert(freopen(\"debug.out\", \"w\", stdout));\n\n\tint i, j;\n\n\tscanf(\"%d %d %d\", &N, &M, &Q);\n\tfor (i = 0; i < N; ++i)\n\t\tscanf(\"%s\", A[i]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &B[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &C[i][j]);\n\tfor (i = 0; i < N; ++i)\n\t\tfor (j = 0; j < M; ++j)\n\t\t\tscanf(\"%d\", &D[i][j]);\n\n\tvector<pair<int, int>> path;\n\tint lastX, lastY, currX, currY;\n\tscanf(\"%d %d\", &lastX, &lastY);\n\twhile (Q-- > 1) {\n\t\tscanf(\"%d %d\", &currX, &currY);\n\t\tassert(lastX != currX || lastY != currY);\n\t\tpath.push_back({lastX, lastY});\n\t\tgetPath(lastX, lastY, currX, currY, path);\n\t\tlastX = currX, lastY = currY;\n\t}\n\tpath.push_back({lastX, lastY});\n\n\tassert(path.size() < 2500000);\n\n\tfor (size_t i = 0; i < path.size(); ++i)\n\t\tE[path[i].first][path[i].second].push_back(i);\n\n\tbool lightOn[NMAX][NMAX] = {};\n\tint answer = 0;\n\tint currAdd = 0;\n\tfor (size_t i = 0; i < path.size(); ++i) {\n\t\tint x = path[i].first, y = path[i].second;\n\t\tanswer += currAdd;\n\t\tif (!lightOn[x][y])\n\t\t\tanswer += C[x][y];\n\t\tE[x][y].pop_front();\n\t\tint front = E[x][y].front();\n\t\tif (E[x][y].size() && (front - i) * B[x][y] < C[x][y] + D[x][y]) {\n\t\t\tif (!lightOn[x][y])\n\t\t\t\tcurrAdd += B[x][y];\n\t\t\tlightOn[x][y] = 1;\n\t\t} else {\n\t\t\tif (lightOn[x][y])\n\t\t\t\tcurrAdd -= B[x][y];\n\t\t\tlightOn[x][y] = 0;\n\t\t\tanswer += D[x][y];\n\t\t}\n\t}\n\n\tcout << answer << '\\n';\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":53252,"score_of_the_acc":-1.3643,"final_rank":15},{"submission_id":"aoj_2302_9696198","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\n int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};\n int N, M, K;\n cin >> N >> M >> K;\n vector G(N,vector<bool>(M));\n rep(i,0,N) {\n string S;\n cin >> S;\n rep(j,0,M) G[i][j] = (S[j] == '.' ? true : false);\n }\n vector A(N,vector<int>(M)), B(N,vector<int>(M)), C(N,vector<int>(M));\n rep(i,0,N) rep(j,0,M) cin >> A[i][j];\n rep(i,0,N) rep(j,0,M) cin >> B[i][j];\n rep(i,0,N) rep(j,0,M) cin >> C[i][j];\n vector<int> X(K), Y(K);\n rep(i,0,K) cin >> X[i] >> Y[i];\n vector D(N, vector(M, vector<int>()));\n D[X[0]][Y[0]].push_back(0);\n rep(i,0,K-1) {\n vector Dist(N,vector<int>(M,inf));\n Dist[X[i+1]][Y[i+1]] = 0;\n queue<pair<int,int>> Q;\n Q.push({X[i+1],Y[i+1]});\n while(!Q.empty()) {\n auto [CurX, CurY] = Q.front();\n Q.pop();\n rep(j,0,4) {\n int NX = CurX + dx[j], NY = CurY + dy[j];\n if (0 <= NX && NX < N && 0 <= NY && NY < M && G[NX][NY]) {\n if (chmin(Dist[NX][NY],Dist[CurX][CurY]+1)) Q.push({NX,NY});\n }\n }\n }\n int NowX = X[i], NowY = Y[i];\n while(1) {\n if (Dist[NowX][NowY] == 0) break;\n int NextX, NextY;\n rep(j,0,4) {\n int NX = NowX + dx[j], NY = NowY + dy[j];\n if (0 <= NX && NX < N && 0 <= NY && NY < M && G[NX][NY] && Dist[NX][NY] == Dist[NowX][NowY] - 1) {\n NextX = NX, NextY = NY;\n break;\n }\n }\n D[NextX][NextY].push_back(D[NowX][NowY].back()+1);\n NowX = NextX, NowY = NextY;\n }\n }\n int ANS = 0;\n rep(i,0,N) {\n rep(j,0,M) {\n if (D[i][j].empty()) continue;\n ANS += B[i][j] + C[i][j];\n rep(k,0,D[i][j].size()-1) {\n ANS += min(A[i][j]*(D[i][j][k+1]-D[i][j][k]),B[i][j]+C[i][j]);\n }\n }\n }\n cout << ANS << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":8728,"score_of_the_acc":-0.2994,"final_rank":4},{"submission_id":"aoj_2302_8994721","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 H = in(), W = in(), M = in();\n vector<string> S = in(H);\n vector<vector<int>> c = in(H, W), on = in(H, W), off = in(H, W);\n vector<pair<int,int>> task = in(M);\n\n vector<pair<int,int>> pos;\n pos.push_back(task[0]);\n for(int k : rep(M - 1)) {\n vector dist(H, vector(W, -1));\n {\n auto [si, sj] = task[k + 1];\n dist[si][sj] = 0;\n queue<pair<int,int>> q;\n q.push({si, sj});\n while(not q.empty()) {\n auto [i, j] = q.front(); q.pop();\n for(auto [di, dj] : dir4) {\n int ni = i + di, nj = j + dj;\n if(0 <= ni and ni < H and 0 <= nj and nj < W and S[ni][nj] == '.' and dist[ni][nj] == -1) {\n dist[ni][nj] = dist[i][j] + 1;\n q.push({ni, nj});\n }\n }\n }\n }\n\n auto [i, j] = task[k];\n do {\n for(auto [di, dj] : dir4) {\n int ni = i + di, nj = j + dj;\n if(0 <= ni and ni < H and 0 <= nj and nj < W and S[ni][nj] == '.' and dist[ni][nj] == dist[i][j] - 1) {\n pos.push_back({ni, nj});\n tie(i, j) = make_pair(ni, nj);\n break;\n }\n }\n } while(dist[i][j] != 0);\n }\n\n vector T(H, vector(W, vector<int>()));\n for(int t : rep(int(pos.size()))) {\n auto [i, j] = pos[t];\n T[i][j].push_back(t);\n }\n\n int ans = 0;\n for(int i : rep(H)) for(int j : rep(W)) {\n vector<int> & ts = T[i][j];\n const int n = ts.size();\n bool is_on = false;\n int cost = 0;\n for(int k : rep(n)) {\n if(not is_on) {\n cost += on[i][j];\n is_on = true;\n }\n if(k + 1 < n and (ts[k + 1] - ts[k]) * c[i][j] <= off[i][j] + on[i][j]) {\n cost += (ts[k + 1] - ts[k]) * c[i][j];\n } else {\n cost += off[i][j];\n is_on = false;\n }\n }\n ans += cost;\n }\n print(ans);\n}","accuracy":1,"time_ms":40,"memory_kb":21460,"score_of_the_acc":-0.5467,"final_rank":9},{"submission_id":"aoj_2302_6761315","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#ifdef _RUTHEN\n#include \"debug.hpp\"\n#else\n#define show(...) true\n#endif\n\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\ntemplate <class T> using V = vector<T>;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int H, W, M;\n cin >> H >> W >> M;\n V<string> S(H);\n rep(i, H) cin >> S[i];\n V<V<int>> A(H, V<int>(W)), B(H, V<int>(W)), C(H, V<int>(W));\n rep(i, H) rep(j, W) cin >> A[i][j];\n rep(i, H) rep(j, W) cin >> B[i][j];\n rep(i, H) rep(j, W) cin >> C[i][j];\n V<int> X(M), Y(M);\n rep(i, M) cin >> X[i] >> Y[i];\n V<int> P;\n const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}, INF = 1 << 30;\n rep(i, M - 1) {\n // calculate path\n V<V<int>> d(H, V<int>(W, INF)), pre(H, V<int>(W, -1));\n d[X[i]][Y[i]] = 0;\n queue<int> que;\n que.push(X[i] * W + Y[i]);\n while (!que.empty()) {\n int val = que.front();\n que.pop();\n int cx = val / W, cy = val % W;\n if (cx == X[i + 1] and cy == Y[i + 1]) break;\n rep(k, 4) {\n int nx = cx + dx[k], ny = cy + dy[k];\n if (!(0 <= nx and nx < H and 0 <= ny and ny < W)) continue;\n if (S[nx][ny] == '#') continue;\n if (d[nx][ny] != INF) continue;\n d[nx][ny] = d[cx][cy] + 1;\n pre[nx][ny] = cx * W + cy;\n que.push(nx * W + ny);\n }\n }\n V<int> PP;\n int cx = X[i + 1], cy = Y[i + 1];\n while (cx != X[i] or cy != Y[i]) {\n PP.push_back(pre[cx][cy]);\n int nx = pre[cx][cy] / W, ny = pre[cx][cy] % W;\n cx = nx, cy = ny;\n }\n reverse(PP.begin(), PP.end());\n for (auto p : PP) P.push_back(p);\n }\n P.push_back(X[M - 1] * W + Y[M - 1]);\n show(P);\n V<V<int>> lt(H, V<int>(W, -1));\n int N = P.size();\n ll ans = 0;\n for (int i = 0; i < N; i++) {\n int cx = P[i] / W, cy = P[i] % W;\n if (lt[cx][cy] != -1) {\n ans += min(A[cx][cy] * (i - lt[cx][cy]), B[cx][cy] + C[cx][cy]);\n } else {\n ans += B[cx][cy] + C[cx][cy];\n }\n lt[cx][cy] = i;\n }\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":13308,"score_of_the_acc":-0.3884,"final_rank":6},{"submission_id":"aoj_2302_6688386","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\nnamespace ebi {\n\nvoid main_() {\n int r, c, m;\n std::cin >> r >> c >> m;\n std::vector<std::string> office(r);\n std::cin >> office;\n std::vector cost(r, std::vector<int>(c)), on(r, std::vector<int>(c)),\n off(r, std::vector<int>(c));\n std::cin >> cost >> on >> off;\n std::vector<std::pair<int, int>> tasks(m);\n std::cin >> tasks;\n auto calc_path = [&](int sy, int sx, int gy, int gx) -> std::vector<std::pair<int,int>> {\n std::queue<std::pair<int, int>> que;\n std::vector dist(r, std::vector<int>(c, INF));\n std::vector prev(r, std::vector<int>(c, -1));\n dist[sy][sx] = 0;\n que.push({sy, sx});\n while (!que.empty()) {\n auto [y, x] = que.front();\n que.pop();\n rep(i, 0, 4) {\n int ny = dy[i] + y;\n int nx = dx[i] + x;\n if (0 <= ny && ny < r && 0 <= nx && nx < c &&\n office[ny][nx] == '.' && dist[ny][nx] == INF) {\n dist[ny][nx] = dist[y][x] + 1;\n prev[ny][nx] = i;\n que.push({ny, nx});\n }\n }\n }\n std::vector<std::pair<int,int>> path;\n int y = gy, x = gx;\n while(prev[y][x] >= 0) {\n path.emplace_back(y, x);\n int idx = prev[y][x];\n int ny = y - dy[idx];\n int nx = x - dx[idx];\n assert(0 <= ny && ny < r && 0 <= nx && nx < c && office[ny][nx] == '.');\n y = ny;\n x = nx;\n }\n std::reverse(all(path));\n return path;\n };\n std::map<std::pair<int, int>, int> map;\n int ans = 0;\n std::vector<std::pair<int,int>> path;\n path.emplace_back(tasks[0]);\n rep(i,1,m) {\n auto [sy, sx] = tasks[i-1];\n auto [gy, gx] = tasks[i];\n auto p = calc_path(sy, sx, gy, gx);\n path.insert(path.end(), p.begin(), p.end());\n }\n int n = path.size();\n rep(i,0,n) {\n auto [y, x] = path[i];\n if(map.find({y, x}) == map.end()) {\n ans += on[y][x] + off[y][x];\n }\n else {\n int d = i - map[{y, x}];\n ans += std::min(d * cost[y][x], off[y][x] + on[y][x]);\n }\n map[{y, x}] = i;\n }\n std::cout << ans << '\\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":160,"memory_kb":15244,"score_of_the_acc":-1.226,"final_rank":10},{"submission_id":"aoj_2302_6647067","code_snippet":"/**\n * author: otera\n**/\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing int128_t = __int128_t;\n#define repa(i, n) for(int i = 0; i < n; ++ i)\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define overload3(a, b, c, d, ...) d\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> LP;\n#define pb push_back\n#define pf push_front\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define rall(c) c.rbegin(), c.rend()\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define si(c) (int)(c).size()\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\n#define kth_bit(x, k) ((x>>k)&1)\n#define unless(A) if(!(A))\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate <class T> using vc = vector<T>;\ntemplate <class T> using vvc = vector<vc<T>>;\ntemplate <class T> using vvvc = vector<vvc<T>>;\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T, class U> using umap = unordered_map<T, U>;\ntemplate<class T> void scan(T& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ cout << ' '; }\ntemplate<class T> void print(const T& a){ cout << a; }\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\nint out(){ cout << '\\n'; return 0; }\ntemplate<class T> int out(const T& t){ print(t); cout << '\\n'; return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\n#define debug_1(x1) cout<<#x1<<\": \"<<x1<<endl\n#define debug_2(x1,x2) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<endl\n#define debug_3(x1,x2,x3) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<endl\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<endl\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<\", \"#x5<<\": \"<<x5<<endl\n#ifdef DEBUG\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\n#define dump(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...)\n#define dump(...)\n#endif\n\nstruct io_setup {\n io_setup(int precision = 20) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(precision);\n }\n} io_setup_ {};\n\nconst int inf = 1e9 + 7;\n\nconst int dx[4] = {0, 1, 0, -1};\nconst int dy[4] = {1, 0, -1, 0};\n\nvoid solve() {\n INT(r, c, m);\n VEC(string, f, r);\n VV(int, c0, r, c);\n VV(int, c1, r, c);\n VV(int, c2, r, c);\n vc<int> x(m), y(m);\n rep(i, m) {\n in(x[i], y[i]);\n }\n int cur = 0;\n vvvc<int> g(r, vvc<int>(c, vc<int>()));\n auto mv = [&](int x1, int y1, int x2, int y2) -> void {\n debug(x1, y1, x2, y2);\n queue<P> que;\n vvc<int> di(r, vc<int>(c, inf));\n vvc<P> pre(r, vc<P>(c, P{-1, -1}));\n di[x1][y1] = cur;\n que.push(P{x1, y1});\n while(que.size()) {\n auto [x, y] = que.front(); que.pop();\n rep(_, 4) {\n int nx = x + dx[_], ny = y + dy[_];\n if(0 <= nx && nx < r && 0 <= ny && ny < c && f[nx][ny] == '.') {\n if(chmin(di[nx][ny], di[x][y] + 1)) {\n que.push(P{nx, ny});\n pre[nx][ny] = P{x, y};\n }\n }\n }\n }\n int x = x2, y = y2;\n while(true) {\n debug(x, y);\n g[x][y].eb(di[x][y]);\n auto [nx, ny] = pre[x][y];\n debug(nx, ny);\n if(nx == -1) break;\n x = nx; y = ny;\n }\n cur = di[x2][y2];\n };\n rep(i, m - 1) {\n mv(x[i], y[i], x[i + 1], y[i + 1]);\n }\n int ans = 0;\n rep(x, r) {\n rep(y, c) {\n auto v = g[x][y];\n int sz = si(v);\n if(sz == 0) continue;\n debug(x, y);\n dump(v);\n vvc<int> dp(sz, vc<int>(2, inf));\n dp[0][0] = c1[x][y] + c2[x][y];\n dp[0][1] = c1[x][y];\n for(int i = 1; i < sz; ++ i) {\n int ti = v[i] - v[i - 1];\n int val = min(dp[i - 1][0] + c1[x][y], dp[i - 1][1] + c0[x][y] * ti);\n chmin(dp[i][0], val + c2[x][y]);\n chmin(dp[i][1], val);\n }\n ans += dp[sz - 1][0];\n }\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":60,"memory_kb":13720,"score_of_the_acc":-0.5297,"final_rank":8},{"submission_id":"aoj_2302_6365478","code_snippet":"#line 1 \"library/me/template.cpp\"\n// This is a dummy line\n#ifndef ONLINE_JUDGE\n#define _GLIBCXX_DEBUG\n#endif\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define REP(i, n) for(int i = 0; i < (int)(n); i++)\n#define FOR(i, a, b) for(ll i = a; i < (ll)(b); i++)\n#define ALL(a) (a).begin(),(a).end()\n#define END(...) { print(__VA_ARGS__); return; }\n\n#ifdef ONLINE_JUDGE\n#define DBG(...) {}\n#else\n#define DBG(a) { cerr << #a << \": \"; dbg(a); }\n#endif\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VVVI = vector<VVI>;\nusing ll = long long;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing VVVL = vector<VVL>;\nusing VD = vector<double>;\nusing VVD = vector<VD>;\nusing VVVD = vector<VVD>;\nusing VS = vector<string>;\nusing VVS = vector<VS>;\nusing VVVS = vector<VVS>;\nusing VC = vector<char>;\nusing VVC = vector<VC>;\nusing VVVC = vector<VVC>;\nusing P = pair<int, int>;\nusing VP = vector<P>;\nusing VVP = vector<VP>;\nusing VVVP = vector<VVP>;\nusing LP = pair<ll, ll>;\nusing VLP = vector<LP>;\nusing VVLP = vector<VLP>;\nusing VVVLP = vector<VVLP>;\n\ntemplate <typename T>\nusing PQ = priority_queue<T>;\ntemplate <typename T>\nusing GPQ = priority_queue<T, vector<T>, greater<T>>;\n\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr int DX[] = {1, 0, -1, 0};\nconstexpr int DY[] = {0, 1, 0, -1};\n\n#ifdef aclmodint\n\nusing MI7 = modint1000000007;\nusing V7 = vector<MI7>;\nusing VV7 = vector<V7>;\nusing VVV7 = vector<VV7>;\nusing MI3 = modint998244353;\nusing V3 = vector<MI3>;\nusing VV3 = vector<V3>;\nusing VVV3 = vector<VV3>;\n\nostream &operator<<(ostream &os, const modint &x) {\n os << x.val();\n return os;\n}\n\nostream &operator<<(ostream &os, const MI3 &x) {\n os << x.val();\n return os;\n}\n\nostream &operator<<(ostream &os, const MI7 &x) {\n os << x.val();\n return os;\n}\n\nistream &operator>>(istream &is, modint &x) {\n int y; is >> y;\n x = y;\n return is;\n}\n\nistream &operator>>(istream &is, MI3 &x) {\n int y; is >> y;\n x = y;\n return is;\n}\n\nistream &operator>>(istream &is, MI7 &x) {\n int y; is >> y;\n x = y;\n return is;\n}\n\n#endif\n\nvoid print() { cout << '\\n'; }\ntemplate<typename T>\nvoid print(const T &t) { cout << t << '\\n'; }\ntemplate<typename Head, typename... Tail>\nvoid print(const Head &head, const Tail &... tail) {\n cout << head << ' ';\n print(tail...);\n}\n\n#ifdef ONLINE_JUDGE\ntemplate<typename... Args>\nvoid dbg(const Args &... args) {}\n#else\nvoid dbg() { cerr << '\\n'; }\ntemplate<typename T>\nvoid dbg(const T &t) { cerr << t << '\\n'; }\ntemplate<typename Head, typename... Tail>\nvoid dbg(const Head &head, const Tail &... tail) {\n cerr << head << ' ';\n dbg(tail...);\n}\n#endif\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 >& p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != (int) v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate <typename T>\npair<VI, vector<T>> compress(const vector<T> &a) {\n int n = a.size();\n vector<T> x;\n REP(i, n) x.push_back(a[i]);\n sort(ALL(x)); x.erase(unique(ALL(x)), x.end());\n VI res(n);\n REP(i, n) res[i] = lower_bound(ALL(x), a[i]) - x.begin();\n return make_pair(res, x);\n}\n\ntemplate <typename T>\npair<vector<T>, vector<T>> factorial(int n) {\n vector<T> res(n+1), rev(n+1);\n res[0] = 1;\n REP(i, n) res[i+1] = res[i] * (i+1);\n rev[n] = 1 / res[n];\n for(int i = n; i > 0; i--) {\n rev[i-1] = rev[i] * i;\n }\n return make_pair(res, rev);\n}\n\n#ifdef aclsegtree\n\ntemplate<typename S>\nstruct value_size { S value; int size; };\n\ntemplate<typename S>\nS min_op(S l, S r) { return min(l, r); };\ntemplate<typename S>\nS max_op(S l, S r) { return max(l, r); };\ntemplate<typename S>\nS sum_op(S l, S r) { return l + r; };\ntemplate<typename S>\nvalue_size<S> sum_op_size(value_size<S> l, value_size<S> r) {\n return {l.value + r.value, l.size + r.size};\n};\n\ntemplate<typename S>\nS min_e() { return numeric_limits<S>::max(); };\ntemplate<typename S>\nS max_e() { return numeric_limits<S>::min(); };\ntemplate<typename S>\nS sum_e() { return 0; }\ntemplate<typename S>\nvalue_size<S> sum_e_size() { return {0, 0}; }\ntemplate<typename S>\nvalue_size<S> min_e_size() { return {numeric_limits<S>::max(), 0}; }\ntemplate<typename S>\nvalue_size<S> max_e_size() { return {numeric_limits<S>::min(), 0}; }\n\ntemplate<typename S, typename F>\nS chmin_mapping(F f, S x) { return min(x, f); }\ntemplate<typename S, typename F>\nS chmax_mapping(F f, S x) { return max(x, f); }\ntemplate<typename S, typename F>\nS add_mapping(F f, S x) { return x + f; }\ntemplate<typename S, typename F>\nvalue_size<S> add_mapping_size(F f, value_size<S> x) {\n return {x.value + x.size * f, x.size};\n}\ntemplate <typename S,typename F, F ID>\nS change_mapping(F f, S x) { return (f == ID? x : f); }\ntemplate <typename S,typename F, F ID>\nvalue_size<S> change_mapping_size(F f, value_size<S> x) { \n value_size<S> ret = {f * x.size, x.size};\n return (f == ID? x : ret); \n}\ntemplate <typename S, typename F1, typename F2>\nS linear_mapping(pair<F1, F2> f, S x) { return x * f.first + f.second; }\ntemplate <typename S, typename F1, typename F2>\nvalue_size<S> linear_mapping_size(pair<F1, F2> f, value_size<S> x) { return {x.value * f.first + x.size * f.second, x.size}; }\n\ntemplate<typename F>\nF chmin_composition(F f, F g) { return min(f, g); }\ntemplate<typename F>\nF chmax_composition(F f, F g) { return max(f, g); }\ntemplate<typename F>\nF add_composition(F f, F g) { return f + g; }\ntemplate <typename F, F ID>\nF change_composition(F f, F g) { return (f == ID? g : f); }\ntemplate<typename F1, typename F2>\npair<F1, F2> linear_composition(pair<F1, F2> f, pair<F1, F2> g) { return {f.first * g.first, f.first * g.second + f.second}; }\n\ntemplate<typename F>\nF chmin_id() { return numeric_limits<F>::max(); }\ntemplate<typename F>\nF chmax_id() { return numeric_limits<F>::min(); }\ntemplate<typename F>\nF add_id() { return 0; }\ntemplate<typename F, F ID>\nF change_id() { return ID; }\ntemplate<typename F1, typename F2>\npair<F1, F2> linear_id() { return {1, 0}; }\n\ntemplate<typename S>\nusing RSumQ = segtree<S, sum_op<S>, sum_e<S>>;\ntemplate<typename S>\nusing RMaxQ = segtree<S, max_op<S>, max_e<S>>;\ntemplate<typename S>\nusing RMinQ = segtree<S, min_op<S>, min_e<S>>;\n\ntemplate<typename S, typename F>\nusing RAddSumQ = lazy_segtree<value_size<S>, sum_op_size<S>, sum_e_size<S>,\n F, add_mapping_size<S, F>, add_composition<F>, add_id<F>>;\ntemplate<typename S, typename F>\nusing RAddMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\n F, add_mapping<S, F>, add_composition<F>, add_id<F>>;\ntemplate<typename S, typename F>\nusing RAddMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\n F, add_mapping<S, F>, add_composition<F>, add_id<F>>;\ntemplate<typename S, typename F>\nusing RMinMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\n F, chmin_mapping<S, F>, chmin_composition<F>, chmin_id<F>>;\ntemplate<typename S, typename F>\nusing RMaxMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\n F, chmax_mapping<S, F>, chmax_composition<F>, chmax_id<F>>;\ntemplate<typename S, typename F, F ID>\nusing RChangeMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\n F, change_mapping<S, F, ID>,\n change_composition<F, ID>,\n change_id<F, ID>>;\ntemplate<typename S, typename F, F ID>\nusing RChangeMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\n F, change_mapping<S, F, ID>,\n change_composition<F, ID>,\n change_id<F, ID>>;\ntemplate<typename S, typename F, F ID>\nusing RChangeSumQ = lazy_segtree<value_size<S>, sum_op_size<S>, sum_e_size<S>,\n F, change_mapping_size<S, F, ID>,\n change_composition<F, ID>,\n change_id<F, ID>>;\ntemplate<typename S, typename F1, typename F2>\nusing RLinearMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\n pair<F1, F2>, linear_mapping<S, F1, F2>,\n linear_composition<F1, F2>,\n linear_id<F1, F2>>;\ntemplate<typename S, typename F1, typename F2>\nusing RLinearMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\n pair<F1, F2>, linear_mapping<S, F1, F2>,\n linear_composition<F1, F2>,\n linear_id<F1, F2>>;\ntemplate<typename S, typename F1, typename F2>\nusing RLinearSumQ = lazy_segtree<value_size<S>, sum_op_size<S>, sum_e_size<S>,\n pair<F1, F2>, linear_mapping_size<S, F1, F2>,\n linear_composition<F1, F2>,\n linear_id<F1, F2>>;\n#endif\n#line 2 \"Contests/Dummy/main.cpp\"\n\nbool run() {\n int m, n; cin >> m >> n;\n if(m == 0) return false;\n VS s(n); cin >> s;\n VI three_pow(m+1, 1);\n REP(i, m) three_pow[i+1] = three_pow[i] * 3;\n VI num(n, INF);\n REP(i, three_pow[m]) {\n VI v;\n int cnt;\n REP(j, n) {\n bool ok = true;\n cnt = 0;\n REP(k, m) {\n if(!(i / three_pow[k] % 3)) continue;\n cnt++;\n if(i / three_pow[k] % 3 - 1 != s[j][k] - '0') ok = false;\n }\n if(ok) v.push_back(j);\n }\n if(v.size() == 1) chmin(num[v[0]], cnt);\n }\n int ans = 0;\n REP(i, n) chmax(ans, num[i]);\n print(ans);\n return true;\n}\n\nvoid solve(){\n int r, c, m; cin >> r >> c >> m;\n VS maze(r); cin >> maze;\n VVL power(r, VL(c)), turnon(r, VL(c)), turnoff(r, VL(c)); cin >> power >> turnon >> turnoff;\n int prex, prey; cin >> prex >> prey;\n ll ans = turnon[prex][prey] + turnoff[prex][prey];\n VVL previsit(r, VL(c, -INF));\n previsit[prex][prey] = 0;\n ll t = 0;\n REP(i, m - 1) {\n int nxtx, nxty; cin >> nxtx >> nxty;\n VVL dist(r, VL(c, INF));\n dist[prex][prey] = 0;\n queue<P> que;\n que.emplace(prex, prey);\n while(!que.empty()) {\n auto [x, y] = que.front(); que.pop();\n REP(j, 4) {\n int nx = x + DX[j], ny = y + DY[j];\n if(nx < 0 || nx >= r || ny < 0 || ny >= c) continue;\n if(maze[nx][ny] == '#') continue;\n if(dist[nx][ny] == INF) {\n dist[nx][ny] = dist[x][y] + 1;\n que.emplace(nx, ny);\n }\n }\n }\n int curx = nxtx, cury = nxty;\n while(curx != prex || cury != prey) {\n if(previsit[curx][cury] == -INF) ans += turnon[curx][cury]+turnoff[curx][cury];\n else ans += min(turnon[curx][cury]+turnoff[curx][cury], power[curx][cury]*(t+dist[curx][cury]-previsit[curx][cury]));\n previsit[curx][cury] = t + dist[curx][cury];\n REP(j, 4) {\n int nx = curx + DX[j], ny = cury + DY[j];\n if(nx < 0 || nx >= r || ny < 0 || ny >= c) continue;\n if(maze[nx][ny] == '#') continue;\n if(dist[nx][ny] + 1 == dist[curx][cury]) {\n curx = nx, cury = ny;\n break;\n }\n }\n }\n t += dist[nxtx][nxty];\n prex = nxtx, prey = nxty;\n }\n print(ans);\n}\n\n// generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)\nint main() {\n // Fasterize input/output script\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(100);\n // scanf/printf user should delete this fasterize input/output script\n\n int t = 1;\n //cin >> t; // comment out if solving multi testcase\n for(int testCase = 1;testCase <= t;++testCase){\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3612,"score_of_the_acc":-0.3333,"final_rank":5},{"submission_id":"aoj_2302_6336656","code_snippet":"#include \"bits/stdc++.h\"\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#define int long long\nint cost[3][100][100];\nvector<int> cost_cutter[100][100];\nvoid solve()\n{\n int r, c, m;\n cin >> r >> c >> m;\n vector<string> inputs;\n REP(i, r)\n {\n string s;\n cin >> s;\n inputs.push_back(s);\n }\n REP(t, 3)\n {\n REP(i, r)\n {\n REP(q, c)\n {\n cin >> cost[t][i][q];\n }\n }\n }\n pair<int, int> cur;\n cin >> cur.first >> cur.second;\n cost_cutter[cur.first][cur.second].push_back(0);\n int cur_time = 0;\n REP(i, m - 1)\n {\n pair<int, int> target;\n cin >> target.first >> target.second;\n\n vector<vector<int>> dist(r, vector<int>(c, 1e18));\n vector<vector<pair<int, int>>> backs(r, vector<pair<int, int>>(c));\n\n dist[cur.first][cur.second] = 0;\n queue<pair<int, int>> nexts;\n nexts.push(cur);\n while (!nexts.empty())\n {\n pair<int, int> now = nexts.front();\n nexts.pop();\n int dx[4] = {-1, 1, 0, 0};\n REP(i, 4)\n {\n int x = dx[i] + now.first;\n int y = dx[3 - i] + now.second;\n if (x >= 0 and x < r and y >= 0 and y < c)\n {\n if (inputs[x][y] == '#')\n continue;\n if (dist[x][y] == 1e18)\n {\n dist[x][y] = dist[now.first][now.second] + 1;\n nexts.push({x, y});\n backs[x][y] = now;\n }\n }\n }\n }\n cur_time += dist[target.first][target.second];\n\n pair<int, int> now = target;\n while (now != cur)\n {\n cost_cutter[now.first][now.second].push_back(cur_time);\n cur_time--;\n now = backs[now.first][now.second];\n }\n cur_time += dist[target.first][target.second];\n\n cur = target;\n }\n\n int ans = 0;\n REP(i, r)\n {\n REP(q, c)\n {\n cost_cutter[i][q].push_back(1e12);\n REP(j, cost_cutter[i][q].size() - 1)\n {\n ans += cost[1][i][q];\n int next_come = cost_cutter[i][q][j + 1] - cost_cutter[i][q][j];\n next_come *= cost[0][i][q];\n if (j == cost_cutter[i][q].size() - 2 or next_come > cost[1][i][q] + cost[2][i][q])\n {\n ans += cost[2][i][q];\n }\n else\n {\n ans += next_come;\n ans -= cost[1][i][q];\n }\n }\n }\n }\n cout << ans << 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":50,"memory_kb":13904,"score_of_the_acc":-0.4666,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_2302_10858089\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <iostream>\\n#include <algorithm>\\n#include <queue>\\n#include <vector>\\nusing namespace std;\\ntypedef long long ll;\\n\\nconst int dx[]={1,0,0,-1};\\nconst int dy[]={0,1,-1,0};\\n\\nconst int N = 55;\\nqueue<int> q;\\nvector<int> path;\\nchar mp[N][N];\\nint vis[N][N], pre[N][N], t[N*N];\\nint val[N][N], op[N][N], cl[N][N];\\nint n, m, K, X[N*N], Y[N*N];\\nvoid BFS(int sx, int sy, int ex, int ey) {\\n\\twhile(!q.empty()) q.pop();\\n\\tmemset(vis, -1, sizeof vis);\\n\\tmemset(pre, -1, sizeof pre);\\n\\n\\tvis[sx][sy] = 0;\\n\\tq.push(sx*N+sy);\\n\\twhile(!q.empty()) {\\n\\t\\tint tmp = q.front(); q.pop();\\n\\t\\tint x = tmp / N, y = tmp % N;\\n\\t\\tif(x == ex && y == ey) break;//continue;\\n\\t\\t\\n\\t\\tfor(int di = 0; di < 4; di ++) {\\n\\t\\t\\tint nx = x + dx[di], ny = y + dy[di];\\n\\t\\t\\tif(nx < 0 || nx >= n || ny < 0 || ny >= m) continue;\\n\\t\\t\\tif(vis[nx][ny] != -1 || mp[nx][ny] == '#') continue;\\n\\t\\t\\t\\n\\t\\t\\tvis[nx][ny] = vis[x][y] + 1;\\n\\t\\t\\tpre[nx][ny] = x*N+y;\\n\\t\\t\\tq.push(nx*N+ny);\\n\\t\\t}\\n\\t}\\n\\t\\n\\tint size = 0, x = ex, y = ey;\\n\\twhile(pre[x][y] != -1) {\\n\\t\\tint tmp = pre[x][y];\\n\\t\\tt[size++] = tmp;\\n\\t\\tx = tmp / N;\\n\\t\\ty = tmp % N;\\n\\t}\\n\\tfor(int i = size-1; i >= 0; i --) path.push_back(t[i]);\\n\\n}\\nvoid input() {\\n\\tfor(int i = 0; i < n; i ++)\\n\\t\\tscanf(\\\"%s\\\", mp[i]);\\n\\n\\tfor(int i = 0; i < n; i ++) {\\n\\t\\tfor(int j = 0; j < m; j ++) {\\n\\t\\t\\tscanf(\\\"%d\\\", &val[i][j]);\\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\\tscanf(\\\"%d\\\", &op[i][j]);\\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\\tscanf(\\\"%d\\\", &cl[i][j]);\\n\\t\\t}\\n\\t}\\n\\tfor(int i = 0; i < K; i ++) {\\n\\t\\tscanf(\\\"%d%d\\\", &X[i], &Y[i]);\\n\\t}\\n}\\nint main() {\\n\\twhile(~scanf(\\\"%d%d%d\\\", &n, &m, &K)) {\\n\\t\\tinput();\\n\\t\\t//\\n\\t\\tpath.clear();\\n\\t\\tfor(int i = 1; i < K; i ++) {\\n\\t\\t\\tBFS(X[i-1], Y[i-1], X[i], Y[i]);\\n\\t\\t}\\n\\t\\tpath.push_back(X[K-1]*N+Y[K-1]);\\n\\t\\t\\n\\t\\tmemset(pre, -1, sizeof pre);\\n\\t\\tint ans = 0;\\n\\t\\tfor(int i = 0; i < (int)path.size(); i ++) {\\n\\t\\t\\tint x = path[i]/N, y = path[i]%N;\\n\\t\\t\\tif(pre[x][y] == -1) {\\n\\t\\t\\t\\tans += op[x][y] + cl[x][y];\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tint tmp = (i - pre[x][y]) * val[x][y];\\n\\t\\t\\t\\ttmp = min(tmp, op[x][y] + cl[x][y]);\\n\\t\\t\\t\\tans += tmp;\\n\\t\\t\\t}\\n\\t\\t\\tpre[x][y] = i;\\n\\t\\t}\\n\\t\\t\\n\\t\\tprintf(\\\"%d\\\\n\\\", ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 13464,\n \"score_of_the_acc\": -0.2581,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2302_10730502\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int NMAX = 60, PMAX = 1010;\\nconst int dl[] = {1, 0, -1, 0};\\nconst int dc[] = {0, 1, 0, -1};\\n\\nint N, M, Q;\\nchar A[NMAX][NMAX];\\nint B[NMAX][NMAX];\\nint C[NMAX][NMAX];\\nint D[NMAX][NMAX];\\nint Dist[NMAX][NMAX];\\nlist<int> E[NMAX][NMAX];\\npair<int, int> from[NMAX][NMAX];\\nbool witness[NMAX][NMAX];\\n\\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\\n\\tqueue<pair<int, int>> Q;\\n\\n\\tmemset(witness, 0, sizeof witness);\\n\\tQ.push({startX, startY});\\n\\twitness[startX][startY] = 1;\\n\\tDist[startX][startY] = 0;\\n\\tbool found = 0;\\n\\twhile (!Q.empty()) {\\n\\t\\tint currX, currY;\\n\\t\\ttie(currX, currY) = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\tint newX = currX + dl[i];\\n\\t\\t\\tint newY = currY + dc[i];\\n\\t\\t\\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tif (A[newX][newY] != '.' || witness[newX][newY])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfrom[newX][newY] = {currX, currY};\\n\\t\\t\\tDist[newX][newY] = Dist[currX][currY] + 1;\\n\\t\\t\\twitness[newX][newY] = 1;\\n\\t\\t\\tQ.push({newX, newY});\\n\\t\\t\\tif (newX == finishX && newY == finishY) {\\n\\t\\t\\t\\tfound = 1;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tassert(found);\\n\\tint currX, currY;\\n\\ttie(currX, currY) = from[finishX][finishY];\\n\\tint newSize = dest.size() + Dist[currX][currY];\\n\\tassert(newSize < 2500000);\\n\\tdest.resize(newSize);\\n\\t--newSize;\\n\\twhile (currX != startX || currY != startY) {\\n\\t\\tdest[newSize--] = {currX, currY};\\n\\t\\ttie(currX, currY) = from[currX][currY];\\n\\t}\\n}\\n\\nint main() {\\n//\\tassert(freopen(\\\"debug.in\\\", \\\"r\\\", stdin));\\n//\\tassert(freopen(\\\"debug.out\\\", \\\"w\\\", stdout));\\n\\n\\tint i, j;\\n\\n\\tscanf(\\\"%d %d %d\\\", &N, &M, &Q);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tscanf(\\\"%s\\\", A[i]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &B[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &C[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &D[i][j]);\\n\\n\\tvector<pair<int, int>> path;\\n\\tint lastX, lastY, currX, currY;\\n\\tscanf(\\\"%d %d\\\", &lastX, &lastY);\\n\\twhile (Q-- > 1) {\\n\\t\\tscanf(\\\"%d %d\\\", &currX, &currY);\\n\\t\\tassert(lastX != currX || lastY != currY);\\n\\t\\tpath.push_back({lastX, lastY});\\n\\t\\tgetPath(lastX, lastY, currX, currY, path);\\n\\t\\tlastX = currX, lastY = currY;\\n\\t}\\n\\tpath.push_back({lastX, lastY});\\n\\n\\tassert(path.size() < 2500000);\\n\\n\\tfor (size_t i = 0; i < path.size(); ++i)\\n\\t\\tE[path[i].first][path[i].second].push_back(i);\\n\\n\\tbool lightOn[NMAX][NMAX] = {};\\n\\tint answer = 0;\\n\\tint currAdd = 0;\\n\\tfor (size_t i = 0; i < path.size(); ++i) {\\n\\t\\tanswer += currAdd;\\n\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\tanswer += C[path[i].first][path[i].second];\\n\\t\\tE[path[i].first][path[i].second].pop_front();\\n\\t\\tint front = E[path[i].first][path[i].second].front();\\n\\t\\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\\n\\t\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd += B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 1;\\n\\t\\t} else {\\n\\t\\t\\tif (lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd -= B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 0;\\n\\t\\t\\tanswer += D[path[i].first][path[i].second];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << answer << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 53052,\n \"score_of_the_acc\": -1.3604,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2302_10730500\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int NMAX = 60, PMAX = 1010;\\nconst int dl[] = {1, 0, -1, 0};\\nconst int dc[] = {0, 1, 0, -1};\\n\\nint N, M, Q;\\nchar A[NMAX][NMAX];\\nint B[NMAX][NMAX];\\nint C[NMAX][NMAX];\\nint D[NMAX][NMAX];\\nlist<int> E[NMAX][NMAX];\\npair<int, int> from[NMAX][NMAX];\\nbool witness[NMAX][NMAX];\\n\\nvector<pair<int, int>> getPath(int startX, int startY, int finishX, int finishY) {\\n\\tvector<pair<int, int>> answer;\\n\\tqueue<pair<int, int>> Q;\\n\\n\\tmemset(witness, 0, sizeof witness);\\n\\tmemset(from, 0, sizeof from);\\n\\tQ.push({startX, startY});\\n\\twitness[startX][startY] = 1;\\n\\twhile (!Q.empty()) {\\n\\t\\tint currX, currY;\\n\\t\\ttie(currX, currY) = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\tint newX = currX + dl[i];\\n\\t\\t\\tint newY = currY + dc[i];\\n\\t\\t\\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tif (A[newX][newY] != '.' || witness[newX][newY])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfrom[newX][newY] = {currX, currY};\\n\\t\\t\\twitness[newX][newY] = 1;\\n\\t\\t\\tQ.push({newX, newY});\\n\\t\\t\\tif (newX == finishX && newY == finishY)\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tint currX, currY;\\n\\ttie(currX, currY) = from[finishX][finishY];\\n\\twhile (currX != startX || currY != startY) {\\n\\t\\tanswer.push_back({currX, currY});\\n\\t\\ttie(currX, currY) = from[currX][currY];\\n\\t}\\n\\treverse(answer.begin(), answer.end());\\n\\treturn answer;\\n}\\n\\nint main() {\\n//\\tassert(freopen(\\\"debug.in\\\", \\\"r\\\", stdin));\\n//\\tassert(freopen(\\\"debug.out\\\", \\\"w\\\", stdout));\\n\\n\\tint i, j;\\n\\n\\tcin >> N >> M >> Q;\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tcin >> A[i];\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tcin >> B[i][j];\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tcin >> C[i][j];\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tcin >> D[i][j];\\n\\n\\tvector<pair<int, int>> path;\\n\\tint lastX, lastY, currX, currY;\\n\\tcin >> lastX >> lastY;\\n\\twhile (Q-- > 1) {\\n\\t\\tcin >> currX >> currY;\\n\\t\\tpath.push_back({lastX, lastY});\\n\\t\\tvector<pair<int, int>> currPath = getPath(lastX, lastY, currX, currY);\\n\\t\\tfor (auto it: currPath)\\n\\t\\t\\tpath.push_back(it);\\n\\t\\tlastX = currX, lastY = currY;\\n\\t}\\n\\tpath.push_back({lastX, lastY});\\n\\n\\tfor (size_t i = 0; i < path.size(); ++i)\\n\\t\\tE[path[i].first][path[i].second].push_back(i);\\n\\n\\tbool lightOn[NMAX][NMAX] = {};\\n\\tint answer = 0;\\n\\tint currAdd = 0;\\n\\tfor (size_t i = 0; i < path.size(); ++i) {\\n\\t\\tanswer += currAdd;\\n\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\tanswer += C[path[i].first][path[i].second];\\n\\t\\tE[path[i].first][path[i].second].pop_front();\\n\\t\\tint front = E[path[i].first][path[i].second].front();\\n\\t\\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\\n\\t\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd += B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 1;\\n\\t\\t} else {\\n\\t\\t\\tif (lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd -= B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 0;\\n\\t\\t\\tanswer += D[path[i].first][path[i].second];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << answer << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 54572,\n \"score_of_the_acc\": -1.4566,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2302_10730499\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <cmath>\\n#include <algorithm>\\n#include <vector>\\n#include <map>\\n#include <string>\\n#include <queue>\\nusing namespace std;\\n#define SZ(v) ((int)(v).size())\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n#define repf(i, a, b) for (int i = (a); i <= (b); ++i)\\nconst int maxint = -1u>>1;\\nconst int maxn = 50 + 2;\\nconst int maxm = 1000 + 10;\\nconst int dx[] = {-1, 0, 1, 0};\\nconst int dy[] = {0, -1, 0, 1};\\n\\nint r, c, m;\\nchar s[maxn][maxn];\\nint open[maxn][maxn], inst[maxn][maxn], close[maxn][maxn];\\npair<int, int> rec[maxm];\\nvector<pair<int, int> > p;\\nvector<int> tm[maxn][maxn];\\nbool used[maxn][maxn];\\n\\nbool dfs(int x1, int y1, int x2, int y2) {\\n if (x1 == x2 && y1 == y2) return true;\\n if (used[x1][y1]) return false;\\n used[x1][y1] = true;\\n p.push_back(make_pair(x1, y1));\\n for (int i = 0; i < 4; ++i) {\\n int tx = x1 + dx[i], ty = y1 + dy[i];\\n if (tx < 0 || ty < 0 || tx >= r || ty >= c || s[tx][ty] != '.') continue;\\n if (dfs(tx, ty, x2, y2)) return true;\\n }\\n p.pop_back();\\n return false;\\n}\\nint main() {\\n while (scanf(\\\"%d%d%d\\\", &r, &c, &m) == 3) {\\n for (int i = 0; i < r; ++i) {\\n scanf(\\\"%s\\\", s[i]);\\n }\\n for (int i = 0; i < r; ++i) {\\n for (int j = 0; j < c; ++j) {\\n tm[i][j].clear();\\n scanf(\\\"%d\\\", &inst[i][j]);\\n }\\n }\\n for (int i = 0; i < r; ++i) {\\n for (int j = 0; j < c; ++j) {\\n scanf(\\\"%d\\\", &open[i][j]);\\n }\\n }\\n for (int i = 0; i < r; ++i) {\\n for (int j = 0; j < c; ++j) {\\n scanf(\\\"%d\\\", &close[i][j]);\\n }\\n }\\n for (int i = 0; i < m; ++i) {\\n scanf(\\\"%d%d\\\", &rec[i].first, &rec[i].second);\\n }\\n int now = 0;\\n for (int i = 1; i < m; ++i) {\\n memset(used, 0, sizeof(used));\\n p.clear();\\n dfs(rec[i - 1].first, rec[i - 1].second, rec[i].first, rec[i].second);\\n for (int j = 0; j < (int) p.size(); ++j) {\\n tm[p[j].first][p[j].second].push_back(now);\\n ++now;\\n }\\n }\\n tm[rec[m - 1].first][rec[m - 1].second].push_back(now);\\n int ans = 0;\\n for (int i = 0; i < r; ++i) {\\n for (int j = 0; j < c; ++j) {\\n if (tm[i][j].size() == 0) continue;\\n //printf(\\\"%d %d: \\\", i, j);for (int k = 0; k < (int)tm[i][j].size(); ++k) printf(\\\"%d \\\", tm[i][j][k]); printf(\\\"\\\\n\\\");\\n ans += open[i][j] + close[i][j] + inst[i][j] * (tm[i][j].back() - tm[i][j].front());\\n for (int k = 1; k < (int)tm[i][j].size(); ++k) {\\n if ((tm[i][j][k] - tm[i][j][k - 1]) * inst[i][j] > open[i][j] + close[i][j]) {\\n ans -= (tm[i][j][k] - tm[i][j][k - 1]) * inst[i][j] - open[i][j] - close[i][j];\\n }\\n }\\n }\\n }\\n printf(\\\"%d\\\\n\\\", ans);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 8628,\n \"score_of_the_acc\": -0.1641,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2302_10726699\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int NMAX = 60, PMAX = 1010;\\nconst int dl[] = {1, 0, -1, 0};\\nconst int dc[] = {0, 1, 0, -1};\\n\\nint N, M, Q;\\nchar A[NMAX][NMAX];\\nint B[NMAX][NMAX];\\nint C[NMAX][NMAX];\\nint D[NMAX][NMAX];\\nint Dist[NMAX][NMAX];\\nlist<int> E[NMAX][NMAX];\\npair<int, int> from[NMAX][NMAX];\\nbool witness[NMAX][NMAX];\\n\\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\\n\\tqueue<pair<int, int>> Q;\\n\\n\\tmemset(witness, 0, sizeof witness);\\n\\tQ.push({startX, startY});\\n\\twitness[startX][startY] = 1;\\n\\tDist[startX][startY] = 0;\\n\\tbool found = 0;\\n\\twhile (!Q.empty()) {\\n\\t\\tint currX, currY;\\n\\t\\ttie(currX, currY) = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\tint newX = currX + dl[i];\\n\\t\\t\\tint newY = currY + dc[i];\\n\\t\\t\\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tif (A[newX][newY] != '.' || witness[newX][newY])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfrom[newX][newY] = {currX, currY};\\n\\t\\t\\tDist[newX][newY] = Dist[currX][currY] + 1;\\n\\t\\t\\twitness[newX][newY] = 1;\\n\\t\\t\\tQ.push({newX, newY});\\n\\t\\t\\tif (newX == finishX && newY == finishY) {\\n\\t\\t\\t\\tfound = 1;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tassert(found);\\n\\tint currX, currY;\\n\\ttie(currX, currY) = from[finishX][finishY];\\n\\tint newSize = dest.size() + Dist[currX][currY];\\n\\tdest.resize(newSize);\\n\\t--newSize;\\n\\twhile (currX != startX || currY != startY) {\\n\\t\\tdest[newSize--] = {currX, currY};\\n\\t\\ttie(currX, currY) = from[currX][currY];\\n\\t}\\n}\\n\\nint main() {\\n//\\tassert(freopen(\\\"debug.in\\\", \\\"r\\\", stdin));\\n//\\tassert(freopen(\\\"debug.out\\\", \\\"w\\\", stdout));\\n\\n\\tint i, j;\\n\\n\\tscanf(\\\"%d %d %d\\\", &N, &M, &Q);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tscanf(\\\"%s\\\", A[i]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &B[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &C[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &D[i][j]);\\n\\n\\tvector<pair<int, int>> path;\\n\\tint lastX, lastY, currX, currY;\\n\\tscanf(\\\"%d %d\\\", &lastX, &lastY);\\n\\twhile (Q-- > 1) {\\n\\t\\tscanf(\\\"%d %d\\\", &currX, &currY);\\n\\t\\tassert(lastX != currX || lastY != currY);\\n\\t\\tpath.push_back({lastX, lastY});\\n\\t\\tgetPath(lastX, lastY, currX, currY, path);\\n\\t\\tlastX = currX, lastY = currY;\\n\\t}\\n\\tpath.push_back({lastX, lastY});\\n\\n\\tassert(path.size() < 2500000);\\n\\n\\tfor (size_t i = 0; i < path.size(); ++i)\\n\\t\\tE[path[i].first][path[i].second].push_back(i);\\n\\n\\tbool lightOn[NMAX][NMAX] = {};\\n\\tint answer = 0;\\n\\tint currAdd = 0;\\n\\tfor (size_t i = 0; i < path.size(); ++i) {\\n\\t\\tanswer += currAdd;\\n\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\tanswer += C[path[i].first][path[i].second];\\n\\t\\tE[path[i].first][path[i].second].pop_front();\\n\\t\\tint front = E[path[i].first][path[i].second].front();\\n\\t\\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\\n\\t\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd += B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 1;\\n\\t\\t} else {\\n\\t\\t\\tif (lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd -= B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 0;\\n\\t\\t\\tanswer += D[path[i].first][path[i].second];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << answer << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 53104,\n \"score_of_the_acc\": -1.3615,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2302_10726697\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int NMAX = 60, PMAX = 1010;\\nconst int dl[] = {1, 0, -1, 0};\\nconst int dc[] = {0, 1, 0, -1};\\n\\nint N, M, Q;\\nchar A[NMAX][NMAX];\\nint B[NMAX][NMAX];\\nint C[NMAX][NMAX];\\nint D[NMAX][NMAX];\\nint Dist[NMAX][NMAX];\\nlist<int> E[NMAX][NMAX];\\npair<int, int> from[NMAX][NMAX];\\nbool witness[NMAX][NMAX];\\n\\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\\n\\tqueue<pair<int, int>> Q;\\n\\n\\tmemset(witness, 0, sizeof witness);\\n\\tQ.push({startX, startY});\\n\\twitness[startX][startY] = 1;\\n\\tDist[startX][startY] = 0;\\n\\tbool found = 0;\\n\\twhile (!Q.empty()) {\\n\\t\\tint currX, currY;\\n\\t\\ttie(currX, currY) = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\tint newX = currX + dl[i];\\n\\t\\t\\tint newY = currY + dc[i];\\n\\t\\t\\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tif (A[newX][newY] != '.' || witness[newX][newY])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfrom[newX][newY] = {currX, currY};\\n\\t\\t\\tDist[newX][newY] = Dist[currX][currY] + 1;\\n\\t\\t\\twitness[newX][newY] = 1;\\n\\t\\t\\tQ.push({newX, newY});\\n\\t\\t\\tif (newX == finishX && newY == finishY) {\\n\\t\\t\\t\\tfound = 1;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tassert(found);\\n\\tint currX, currY;\\n\\ttie(currX, currY) = from[finishX][finishY];\\n\\tint newSize = dest.size() + Dist[currX][currY];\\n\\tdest.resize(newSize);\\n\\t--newSize;\\n\\twhile (currX != startX || currY != startY) {\\n\\t\\tdest[newSize--] = {currX, currY};\\n\\t\\ttie(currX, currY) = from[currX][currY];\\n\\t}\\n}\\n\\nint main() {\\n//\\tassert(freopen(\\\"debug.in\\\", \\\"r\\\", stdin));\\n//\\tassert(freopen(\\\"debug.out\\\", \\\"w\\\", stdout));\\n\\n\\tint i, j;\\n\\n\\tscanf(\\\"%d %d %d\\\", &N, &M, &Q);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tscanf(\\\"%s\\\", A[i]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &B[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &C[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &D[i][j]);\\n\\n\\tvector<pair<int, int>> path;\\n\\tint lastX, lastY, currX, currY;\\n\\tscanf(\\\"%d %d\\\", &lastX, &lastY);\\n\\twhile (Q-- > 1) {\\n\\t\\tscanf(\\\"%d %d\\\", &currX, &currY);\\n\\t\\tassert(lastX != currX || lastY != currY);\\n\\t\\tpath.push_back({lastX, lastY});\\n\\t\\tgetPath(lastX, lastY, currX, currY, path);\\n\\t\\tlastX = currX, lastY = currY;\\n\\t}\\n\\tpath.push_back({lastX, lastY});\\n\\n\\tfor (size_t i = 0; i < path.size(); ++i)\\n\\t\\tE[path[i].first][path[i].second].push_back(i);\\n\\n\\tbool lightOn[NMAX][NMAX] = {};\\n\\tint answer = 0;\\n\\tint currAdd = 0;\\n\\tfor (size_t i = 0; i < path.size(); ++i) {\\n\\t\\tanswer += currAdd;\\n\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\tanswer += C[path[i].first][path[i].second];\\n\\t\\tE[path[i].first][path[i].second].pop_front();\\n\\t\\tint front = E[path[i].first][path[i].second].front();\\n\\t\\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\\n\\t\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd += B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 1;\\n\\t\\t} else {\\n\\t\\t\\tif (lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd -= B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 0;\\n\\t\\t\\tanswer += D[path[i].first][path[i].second];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << answer << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 53172,\n \"score_of_the_acc\": -1.3628,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2302_10726695\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int NMAX = 60, PMAX = 1010;\\nconst int dl[] = {1, 0, -1, 0};\\nconst int dc[] = {0, 1, 0, -1};\\n\\nint N, M, Q;\\nchar A[NMAX][NMAX];\\nint B[NMAX][NMAX];\\nint C[NMAX][NMAX];\\nint D[NMAX][NMAX];\\nint Dist[NMAX][NMAX];\\nlist<int> E[NMAX][NMAX];\\npair<int, int> from[NMAX][NMAX];\\nbool witness[NMAX][NMAX];\\n\\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\\n\\tqueue<pair<int, int>> Q;\\n\\n\\tmemset(witness, 0, sizeof witness);\\n\\tQ.push({startX, startY});\\n\\twitness[startX][startY] = 1;\\n\\tDist[startX][startY] = 0;\\n\\twhile (!Q.empty()) {\\n\\t\\tint currX, currY;\\n\\t\\ttie(currX, currY) = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\tint newX = currX + dl[i];\\n\\t\\t\\tint newY = currY + dc[i];\\n\\t\\t\\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tif (A[newX][newY] != '.' || witness[newX][newY])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfrom[newX][newY] = {currX, currY};\\n\\t\\t\\tDist[newX][newY] = Dist[currX][currY] + 1;\\n\\t\\t\\twitness[newX][newY] = 1;\\n\\t\\t\\tQ.push({newX, newY});\\n\\t\\t\\tif (newX == finishX && newY == finishY)\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tint currX, currY;\\n\\ttie(currX, currY) = from[finishX][finishY];\\n\\tint newSize = dest.size() + Dist[currX][currY];\\n\\tdest.resize(newSize);\\n\\t--newSize;\\n\\twhile (currX != startX || currY != startY) {\\n\\t\\tdest[newSize--] = {currX, currY};\\n\\t\\ttie(currX, currY) = from[currX][currY];\\n\\t}\\n}\\n\\nint main() {\\n//\\tassert(freopen(\\\"debug.in\\\", \\\"r\\\", stdin));\\n//\\tassert(freopen(\\\"debug.out\\\", \\\"w\\\", stdout));\\n\\n\\tint i, j;\\n\\n\\tscanf(\\\"%d %d %d\\\", &N, &M, &Q);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tscanf(\\\"%s\\\", A[i]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &B[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &C[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &D[i][j]);\\n\\n\\tvector<pair<int, int>> path;\\n\\tint lastX, lastY, currX, currY;\\n\\tscanf(\\\"%d %d\\\", &lastX, &lastY);\\n\\twhile (Q-- > 1) {\\n\\t\\tscanf(\\\"%d %d\\\", &currX, &currY);\\n\\t\\tassert(lastX != currX || lastY != currY);\\n\\t\\tpath.push_back({lastX, lastY});\\n\\t\\tgetPath(lastX, lastY, currX, currY, path);\\n\\t\\tlastX = currX, lastY = currY;\\n\\t}\\n\\tpath.push_back({lastX, lastY});\\n\\n\\tfor (size_t i = 0; i < path.size(); ++i)\\n\\t\\tE[path[i].first][path[i].second].push_back(i);\\n\\n\\tbool lightOn[NMAX][NMAX] = {};\\n\\tint answer = 0;\\n\\tint currAdd = 0;\\n\\tfor (size_t i = 0; i < path.size(); ++i) {\\n\\t\\tanswer += currAdd;\\n\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\tanswer += C[path[i].first][path[i].second];\\n\\t\\tE[path[i].first][path[i].second].pop_front();\\n\\t\\tint front = E[path[i].first][path[i].second].front();\\n\\t\\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\\n\\t\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd += B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 1;\\n\\t\\t} else {\\n\\t\\t\\tif (lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd -= B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 0;\\n\\t\\t\\tanswer += D[path[i].first][path[i].second];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << answer << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 53132,\n \"score_of_the_acc\": -1.362,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2302_10726693\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int NMAX = 60, PMAX = 1010;\\nconst int dl[] = {1, 0, -1, 0};\\nconst int dc[] = {0, 1, 0, -1};\\n\\nint N, M, Q;\\nchar A[NMAX][NMAX];\\nint B[NMAX][NMAX];\\nint C[NMAX][NMAX];\\nint D[NMAX][NMAX];\\nint Dist[NMAX][NMAX];\\nlist<int> E[NMAX][NMAX];\\npair<int, int> from[NMAX][NMAX];\\nbool witness[NMAX][NMAX];\\n\\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\\n\\tqueue<pair<int, int>> Q;\\n\\n\\tmemset(witness, 0, sizeof witness);\\n\\tQ.push({startX, startY});\\n\\twitness[startX][startY] = 1;\\n\\tDist[startX][startY] = 0;\\n\\twhile (!Q.empty()) {\\n\\t\\tint currX, currY;\\n\\t\\ttie(currX, currY) = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\tint newX = currX + dl[i];\\n\\t\\t\\tint newY = currY + dc[i];\\n\\t\\t\\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tif (A[newX][newY] != '.' || witness[newX][newY])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfrom[newX][newY] = {currX, currY};\\n\\t\\t\\tDist[newX][newY] = Dist[currX][currY] + 1;\\n\\t\\t\\twitness[newX][newY] = 1;\\n\\t\\t\\tQ.push({newX, newY});\\n\\t\\t\\tif (newX == finishX && newY == finishY)\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tint currX, currY;\\n\\ttie(currX, currY) = from[finishX][finishY];\\n\\tint newSize = dest.size() + Dist[currX][currY];\\n\\tdest.resize(newSize);\\n\\t--newSize;\\n\\twhile (currX != startX || currY != startY) {\\n\\t\\tdest[newSize--] = {currX, currY};\\n\\t\\ttie(currX, currY) = from[currX][currY];\\n\\t}\\n}\\n\\nint main() {\\n//\\tassert(freopen(\\\"debug.in\\\", \\\"r\\\", stdin));\\n//\\tassert(freopen(\\\"debug.out\\\", \\\"w\\\", stdout));\\n\\n\\tint i, j;\\n\\n\\tscanf(\\\"%d %d %d\\\", &N, &M, &Q);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tscanf(\\\"%s\\\", A[i]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &B[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &C[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &D[i][j]);\\n\\n\\tvector<pair<int, int>> path;\\n\\tint lastX, lastY, currX, currY;\\n\\tscanf(\\\"%d %d\\\", &lastX, &lastY);\\n\\twhile (Q-- > 1) {\\n\\t\\tscanf(\\\"%d %d\\\", &currX, &currY);\\n\\t\\tpath.push_back({lastX, lastY});\\n\\t\\tgetPath(lastX, lastY, currX, currY, path);\\n\\t\\tlastX = currX, lastY = currY;\\n\\t}\\n\\tpath.push_back({lastX, lastY});\\n\\n\\tfor (size_t i = 0; i < path.size(); ++i)\\n\\t\\tE[path[i].first][path[i].second].push_back(i);\\n\\n\\tbool lightOn[NMAX][NMAX] = {};\\n\\tint answer = 0;\\n\\tint currAdd = 0;\\n\\tfor (size_t i = 0; i < path.size(); ++i) {\\n\\t\\tanswer += currAdd;\\n\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\tanswer += C[path[i].first][path[i].second];\\n\\t\\tE[path[i].first][path[i].second].pop_front();\\n\\t\\tint front = E[path[i].first][path[i].second].front();\\n\\t\\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\\n\\t\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd += B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 1;\\n\\t\\t} else {\\n\\t\\t\\tif (lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd -= B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 0;\\n\\t\\t\\tanswer += D[path[i].first][path[i].second];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << answer << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 53264,\n \"score_of_the_acc\": -1.3646,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2302_10726692\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int NMAX = 60, PMAX = 1010;\\nconst int dl[] = {1, 0, -1, 0};\\nconst int dc[] = {0, 1, 0, -1};\\n\\nint N, M, Q;\\nchar A[NMAX][NMAX];\\nint B[NMAX][NMAX];\\nint C[NMAX][NMAX];\\nint D[NMAX][NMAX];\\nlist<int> E[NMAX][NMAX];\\npair<int, int> from[NMAX][NMAX];\\nbool witness[NMAX][NMAX];\\n\\nvector<pair<int, int>> getPath(int startX, int startY, int finishX, int finishY) {\\n\\tvector<pair<int, int>> answer;\\n\\tqueue<pair<int, int>> Q;\\n\\n\\tmemset(witness, 0, sizeof witness);\\n\\tQ.push({startX, startY});\\n\\twitness[startX][startY] = 1;\\n\\twhile (!Q.empty()) {\\n\\t\\tint currX, currY;\\n\\t\\ttie(currX, currY) = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\tint newX = currX + dl[i];\\n\\t\\t\\tint newY = currY + dc[i];\\n\\t\\t\\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tif (A[newX][newY] != '.' || witness[newX][newY])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfrom[newX][newY] = {currX, currY};\\n\\t\\t\\twitness[newX][newY] = 1;\\n\\t\\t\\tQ.push({newX, newY});\\n\\t\\t\\tif (newX == finishX && newY == finishY)\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tint currX, currY;\\n\\ttie(currX, currY) = from[finishX][finishY];\\n\\twhile (currX != startX || currY != startY) {\\n\\t\\tanswer.push_back({currX, currY});\\n\\t\\ttie(currX, currY) = from[currX][currY];\\n\\t}\\n\\treverse(answer.begin(), answer.end());\\n\\treturn answer;\\n}\\n\\nint main() {\\n//\\tassert(freopen(\\\"debug.in\\\", \\\"r\\\", stdin));\\n//\\tassert(freopen(\\\"debug.out\\\", \\\"w\\\", stdout));\\n\\n\\tint i, j;\\n\\n\\tscanf(\\\"%d %d %d\\\", &N, &M, &Q);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tscanf(\\\"%s\\\", A[i]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &B[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &C[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &D[i][j]);\\n\\n\\tvector<pair<int, int>> path;\\n\\tint lastX, lastY, currX, currY;\\n\\tscanf(\\\"%d %d\\\", &lastX, &lastY);\\n\\twhile (Q-- > 1) {\\n\\t\\tscanf(\\\"%d %d\\\", &currX, &currY);\\n\\t\\tpath.push_back({lastX, lastY});\\n\\t\\tvector<pair<int, int>> currPath = getPath(lastX, lastY, currX, currY);\\n\\t\\tfor (auto it: currPath)\\n\\t\\t\\tpath.push_back(it);\\n\\t\\tlastX = currX, lastY = currY;\\n\\t}\\n\\tpath.push_back({lastX, lastY});\\n\\n\\tfor (size_t i = 0; i < path.size(); ++i)\\n\\t\\tE[path[i].first][path[i].second].push_back(i);\\n\\n\\tbool lightOn[NMAX][NMAX] = {};\\n\\tint answer = 0;\\n\\tint currAdd = 0;\\n\\tfor (size_t i = 0; i < path.size(); ++i) {\\n\\t\\tanswer += currAdd;\\n\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\tanswer += C[path[i].first][path[i].second];\\n\\t\\tE[path[i].first][path[i].second].pop_front();\\n\\t\\tint front = E[path[i].first][path[i].second].front();\\n\\t\\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\\n\\t\\t\\tif (!lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd += B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 1;\\n\\t\\t} else {\\n\\t\\t\\tif (lightOn[path[i].first][path[i].second])\\n\\t\\t\\t\\tcurrAdd -= B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn[path[i].first][path[i].second] = 0;\\n\\t\\t\\tanswer += D[path[i].first][path[i].second];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << answer << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 54868,\n \"score_of_the_acc\": -1.4624,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2302_10726688\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int NMAX = 60, PMAX = 1010;\\nconst int dl[] = {1, 0, -1, 0};\\nconst int dc[] = {0, 1, 0, -1};\\n\\nint N, M, Q;\\nchar A[NMAX][NMAX];\\nint B[NMAX][NMAX];\\nint C[NMAX][NMAX];\\nint D[NMAX][NMAX];\\nlist<int> E[NMAX][NMAX];\\npair<int, int> from[NMAX][NMAX];\\nbool witness[NMAX][NMAX];\\n\\nvector<pair<int, int>> getPath(int startX, int startY, int finishX, int finishY) {\\n\\tvector<pair<int, int>> answer;\\n\\tqueue<pair<int, int>> Q;\\n\\n\\tmemset(witness, 0, sizeof witness);\\n\\tmemset(from, 0, sizeof from);\\n\\tQ.push({startX, startY});\\n\\twitness[startX][startY] = 1;\\n\\twhile (!Q.empty()) {\\n\\t\\tint currX, currY;\\n\\t\\ttie(currX, currY) = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\tint newX = currX + dl[i];\\n\\t\\t\\tint newY = currY + dc[i];\\n\\t\\t\\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tif (A[newX][newY] != '.' || witness[newX][newY])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfrom[newX][newY] = {currX, currY};\\n\\t\\t\\twitness[newX][newY] = 1;\\n\\t\\t\\tQ.push({newX, newY});\\n\\t\\t\\tif (newX == finishX && newY == finishY)\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tint currX, currY;\\n\\ttie(currX, currY) = from[finishX][finishY];\\n\\twhile (currX != startX || currY != startY) {\\n\\t\\tanswer.push_back({currX, currY});\\n\\t\\ttie(currX, currY) = from[currX][currY];\\n\\t}\\n\\treverse(answer.begin(), answer.end());\\n\\treturn answer;\\n}\\n\\nint main() {\\n//\\tassert(freopen(\\\"debug.in\\\", \\\"r\\\", stdin));\\n//\\tassert(freopen(\\\"debug.out\\\", \\\"w\\\", stdout));\\n\\n\\tint i, j;\\n\\n\\tcin >> N >> M >> Q;\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tcin >> A[i];\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tcin >> B[i][j];\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tcin >> C[i][j];\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tcin >> D[i][j];\\n\\n\\tvector<pair<int, int>> path;\\n\\tint lastX, lastY, currX, currY;\\n\\tcin >> lastX >> lastY;\\n\\twhile (Q-- > 1) {\\n\\t\\tcin >> currX >> currY;\\n\\t\\tpath.push_back({lastX, lastY});\\n\\t\\tvector<pair<int, int>> currPath = getPath(lastX, lastY, currX, currY);\\n\\t\\tfor (auto it: currPath)\\n\\t\\t\\tpath.push_back(it);\\n\\t\\tlastX = currX, lastY = currY;\\n\\t}\\n\\tpath.push_back({lastX, lastY});\\n\\n\\tfor (size_t i = 0; i < path.size(); ++i)\\n\\t\\tE[path[i].first][path[i].second].push_back(i);\\n\\n\\tset<pair<int, int>> lightOn;\\n\\tint answer = 0;\\n\\tint currAdd = 0;\\n\\tfor (size_t i = 0; i < path.size(); ++i) {\\n\\t\\tanswer += currAdd;\\n\\t\\tif (!lightOn.count(path[i]))\\n\\t\\t\\tanswer += C[path[i].first][path[i].second];\\n\\t\\tE[path[i].first][path[i].second].pop_front();\\n\\t\\tint front = E[path[i].first][path[i].second].front();\\n\\t\\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\\n\\t\\t\\tif (!lightOn.count(path[i]))\\n\\t\\t\\t\\tcurrAdd += B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn.insert(path[i]);\\n\\t\\t} else {\\n\\t\\t\\tif (lightOn.count(path[i]))\\n\\t\\t\\t\\tcurrAdd -= B[path[i].first][path[i].second];\\n\\t\\t\\tlightOn.erase(path[i]);\\n\\t\\t\\tanswer += D[path[i].first][path[i].second];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << answer << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 55088,\n \"score_of_the_acc\": -1.5333,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2302_10726686\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int NMAX = 60, PMAX = 1010;\\nconst int dl[] = {1, 0, -1, 0};\\nconst int dc[] = {0, 1, 0, -1};\\n\\nint N, M, Q;\\nchar A[NMAX][NMAX];\\nint B[NMAX][NMAX];\\nint C[NMAX][NMAX];\\nint D[NMAX][NMAX];\\nlist<int> E[NMAX][NMAX];\\npair<int, int> from[NMAX][NMAX];\\nbool witness[NMAX][NMAX];\\n\\nvector<pair<int, int>> getPath(int startX, int startY, int finishX, int finishY) {\\n\\tvector<pair<int, int>> answer;\\n\\tqueue<pair<int, int>> Q;\\n\\n\\tmemset(witness, 0, sizeof witness);\\n\\tmemset(from, 0, sizeof from);\\n\\tQ.push({startX, startY});\\n\\twitness[startX][startY] = 1;\\n\\twhile (!Q.empty()) {\\n\\t\\tint currX, currY;\\n\\t\\ttie(currX, currY) = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\tint newX = currX + dl[i];\\n\\t\\t\\tint newY = currY + dc[i];\\n\\t\\t\\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tif (A[newX][newY] != '.' || witness[newX][newY])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfrom[newX][newY] = {currX, currY};\\n\\t\\t\\twitness[newX][newY] = 1;\\n\\t\\t\\tQ.push({newX, newY});\\n\\t\\t\\tif (newX == finishX && newY == finishY)\\n\\t\\t\\t\\tbreak;\\n\\t\\t}\\n\\t}\\n\\tint currX, currY;\\n\\ttie(currX, currY) = from[finishX][finishY];\\n\\twhile (currX != startX || currY != startY) {\\n\\t\\tanswer.push_back({currX, currY});\\n\\t\\ttie(currX, currY) = from[currX][currY];\\n\\t}\\n\\treverse(answer.begin(), answer.end());\\n\\treturn answer;\\n}\\n\\nint main() {\\n//\\tassert(freopen(\\\"debug.in\\\", \\\"r\\\", stdin));\\n//\\tassert(freopen(\\\"debug.out\\\", \\\"w\\\", stdout));\\n\\n\\tint i, j;\\n\\n\\tcin >> N >> M >> Q;\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tcin >> A[i];\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tcin >> B[i][j];\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tcin >> C[i][j];\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tcin >> D[i][j];\\n\\n\\tvector<pair<int, int>> path;\\n\\tint lastX, lastY, currX, currY;\\n\\tcin >> lastX >> lastY;\\n\\twhile (Q-- > 1) {\\n\\t\\tcin >> currX >> currY;\\n\\t\\tpath.push_back({lastX, lastY});\\n\\t\\tvector<pair<int, int>> currPath = getPath(lastX, lastY, currX, currY);\\n\\t\\tfor (auto it: currPath)\\n\\t\\t\\tpath.push_back(it);\\n\\t\\tlastX = currX, lastY = currY;\\n\\t}\\n\\tpath.push_back({lastX, lastY});\\n\\n\\tfor (size_t i = 0; i < path.size(); ++i)\\n\\t\\tE[path[i].first][path[i].second].push_back(i);\\n\\n\\tset<pair<int, int>> lightOn;\\n\\tint answer = 0;\\n\\tfor (size_t i = 0; i < path.size(); ++i) {\\n\\t\\tfor (auto it: lightOn)\\n\\t\\t\\tanswer += B[it.first][it.second];\\n\\t\\tif (!lightOn.count(path[i]))\\n\\t\\t\\tanswer += C[path[i].first][path[i].second];\\n\\t\\tE[path[i].first][path[i].second].pop_front();\\n\\t\\tint front = E[path[i].first][path[i].second].front();\\n\\t\\tif (E[path[i].first][path[i].second].size() && (front - i) * B[path[i].first][path[i].second] < C[path[i].first][path[i].second] + D[path[i].first][path[i].second]) {\\n\\t\\t\\tlightOn.insert(path[i]);\\n\\t\\t} else {\\n\\t\\t\\tlightOn.erase(path[i]);\\n\\t\\t\\tanswer += D[path[i].first][path[i].second];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << answer << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 54896,\n \"score_of_the_acc\": -1.9963,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2302_10726682\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<string.h>\\nint room[60][60]={0},step[60][60]={0},appear[60][60][1010]={0};\\nunsigned long long on[60][60],off[60][60],keep[60][60];\\nint tasks[1000][2]={0};\\nint n,m,ntask,total;\\nconst int go[4][2]={{0,1},{0,-1},{1,0},{-1,0}};\\n\\nvoid indata()\\n{\\n int i,j,k;\\n scanf(\\\"%d %d %d\\\\n\\\",&n,&m,&ntask);\\n for (i=1;i<=n;i++)\\n {\\n for (j=1;j<=m;j++)\\n {\\n if (getchar()=='.')\\n room[i][j]=1;\\n }\\n getchar();\\n }\\n for (i=1;i<=n;i++)\\n for (j=1;j<=m;j++)\\n scanf(\\\"%d\\\",&keep[i][j]);\\n for (i=1;i<=n;i++)\\n for (j=1;j<=m;j++)\\n scanf(\\\"%d\\\",&on[i][j]);\\n for (i=1;i<=n;i++)\\n for (j=1;j<=m;j++)\\n scanf(\\\"%d\\\",&off[i][j]);\\n for (i=1;i<=ntask;i++)\\n {\\n scanf(\\\"%d%d\\\",&tasks[i][0],&tasks[i][1]);\\n tasks[i][0]++;\\n tasks[i][1]++;\\n }\\n}\\n\\nint bfs(int aimx,int aimy,int nowx,int nowy,int time)\\n{\\n int i,j,k;\\n int x,y;\\n for (i=0;i<4;i++)\\n {\\n x=nowx+go[i][0];\\n y=nowy+go[i][1];\\n if (room[x][y]&&(!step[x][y]))\\n {\\n step[x][y]=time;\\n if ((aimx==x)&&(aimy==y))\\n {\\n appear[x][y][++appear[x][y][0]]=time;\\n return time;\\n }\\n else\\n {\\n if (bfs(aimx,aimy,x,y,time+1))\\n {\\n appear[x][y][++appear[x][y][0]]=time;\\n return time;\\n }\\n }\\n }\\n }\\n return 0;\\n}\\n\\nint main()\\n{\\n /* freopen(\\\"input.txt\\\",\\\"r\\\",stdin);\\n freopen(\\\"output.txt\\\",\\\"w\\\",stdout);*/\\n int i,j,k,now;\\n unsigned long long ans=0;\\n indata();\\n appear[tasks[1][0]][tasks[1][1]][0]=1;\\n appear[tasks[1][0]][tasks[1][1]][1]=1;\\n now=1;\\n /*for (i=1;i<=ntask;i++)\\n printf(\\\"%d %d\\\\n\\\",tasks[i][0],tasks[i][1]);*/\\n for (i=2;i<=ntask;i++)\\n {\\n memset(step,0,sizeof(step));\\n step[tasks[i-1][0]][tasks[i-1][1]]=now;\\n bfs(tasks[i][0],tasks[i][1],tasks[i-1][0],tasks[i-1][1],now+1);\\n now=step[tasks[i][0]][tasks[i][1]];\\n }\\n /* for (i=1;i<=n;i++)\\n for (j=1;j<=m;j++)\\n {\\n printf(\\\"%d %d:\\\",i,j);\\n for (k=1;k<=appear[i][j][0];k++)\\n printf(\\\" %d\\\",appear[i][j][k]);\\n putchar('\\\\n');\\n }*/\\n for (i=1;i<=n;i++)\\n for (j=1;j<=m;j++)\\n {\\n if (appear[i][j][0])\\n ans+=on[i][j]+off[i][j];\\n for (k=1;k<appear[i][j][0];k++)\\n if ((appear[i][j][k+1]-appear[i][j][k])*keep[i][j]>on[i][j]+off[i][j])\\n ans+=on[i][j]+off[i][j];\\n else\\n ans+=(appear[i][j][k+1]-appear[i][j][k])*keep[i][j];\\n }\\n printf(\\\"%llu\\\\n\\\",ans);\\n /* fclose(stdin);\\n fclose(stdout);*/\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 14240,\n \"score_of_the_acc\": -0.2065,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2302_10726636\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nconst int NMAX = 60, PMAX = 1010;\\nconst int dl[] = {1, 0, -1, 0};\\nconst int dc[] = {0, 1, 0, -1};\\n\\nint N, M, Q;\\nchar A[NMAX][NMAX];\\nint B[NMAX][NMAX];\\nint C[NMAX][NMAX];\\nint D[NMAX][NMAX];\\nint Dist[NMAX][NMAX];\\nlist<int> E[NMAX][NMAX];\\npair<int, int> from[NMAX][NMAX];\\n\\nvoid getPath(int startX, int startY, int finishX, int finishY, vector<pair<int, int>> &dest) {\\n\\tqueue<pair<int, int>> Q;\\n\\n\\tbool witness[NMAX][NMAX] = {};\\n\\tQ.push({startX, startY});\\n\\twitness[startX][startY] = 1;\\n\\tDist[startX][startY] = 0;\\n\\tbool found = 0;\\n\\twhile (!Q.empty()) {\\n\\t\\tint currX, currY;\\n\\t\\ttie(currX, currY) = Q.front();\\n\\t\\tQ.pop();\\n\\t\\tfor (int i = 0; i < 4; ++i) {\\n\\t\\t\\tint newX = currX + dl[i];\\n\\t\\t\\tint newY = currY + dc[i];\\n\\t\\t\\tif (newX < 0 || newX >= N || newY < 0 || newY >= M)\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tif (A[newX][newY] != '.' || witness[newX][newY])\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\tfrom[newX][newY] = {currX, currY};\\n\\t\\t\\tDist[newX][newY] = Dist[currX][currY] + 1;\\n\\t\\t\\twitness[newX][newY] = 1;\\n\\t\\t\\tQ.push({newX, newY});\\n\\t\\t\\tif (newX == finishX && newY == finishY) {\\n\\t\\t\\t\\tfound = 1;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tassert(found);\\n\\tint currX, currY;\\n\\ttie(currX, currY) = from[finishX][finishY];\\n\\tint newSize = dest.size() + Dist[currX][currY];\\n\\tassert(newSize < 2500000);\\n\\tdest.resize(newSize);\\n\\t--newSize;\\n\\twhile (currX != startX || currY != startY) {\\n\\t\\tdest[newSize--] = {currX, currY};\\n\\t\\ttie(currX, currY) = from[currX][currY];\\n\\t}\\n}\\n\\nint main() {\\n//\\tassert(freopen(\\\"debug.in\\\", \\\"r\\\", stdin));\\n//\\tassert(freopen(\\\"debug.out\\\", \\\"w\\\", stdout));\\n\\n\\tint i, j;\\n\\n\\tscanf(\\\"%d %d %d\\\", &N, &M, &Q);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tscanf(\\\"%s\\\", A[i]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &B[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &C[i][j]);\\n\\tfor (i = 0; i < N; ++i)\\n\\t\\tfor (j = 0; j < M; ++j)\\n\\t\\t\\tscanf(\\\"%d\\\", &D[i][j]);\\n\\n\\tvector<pair<int, int>> path;\\n\\tint lastX, lastY, currX, currY;\\n\\tscanf(\\\"%d %d\\\", &lastX, &lastY);\\n\\twhile (Q-- > 1) {\\n\\t\\tscanf(\\\"%d %d\\\", &currX, &currY);\\n\\t\\tassert(lastX != currX || lastY != currY);\\n\\t\\tpath.push_back({lastX, lastY});\\n\\t\\tgetPath(lastX, lastY, currX, currY, path);\\n\\t\\tlastX = currX, lastY = currY;\\n\\t}\\n\\tpath.push_back({lastX, lastY});\\n\\n\\tassert(path.size() < 2500000);\\n\\n\\tfor (size_t i = 0; i < path.size(); ++i)\\n\\t\\tE[path[i].first][path[i].second].push_back(i);\\n\\n\\tbool lightOn[NMAX][NMAX] = {};\\n\\tint answer = 0;\\n\\tint currAdd = 0;\\n\\tfor (size_t i = 0; i < path.size(); ++i) {\\n\\t\\tint x = path[i].first, y = path[i].second;\\n\\t\\tanswer += currAdd;\\n\\t\\tif (!lightOn[x][y])\\n\\t\\t\\tanswer += C[x][y];\\n\\t\\tE[x][y].pop_front();\\n\\t\\tint front = E[x][y].front();\\n\\t\\tif (E[x][y].size() && (front - i) * B[x][y] < C[x][y] + D[x][y]) {\\n\\t\\t\\tif (!lightOn[x][y])\\n\\t\\t\\t\\tcurrAdd += B[x][y];\\n\\t\\t\\tlightOn[x][y] = 1;\\n\\t\\t} else {\\n\\t\\t\\tif (lightOn[x][y])\\n\\t\\t\\t\\tcurrAdd -= B[x][y];\\n\\t\\t\\tlightOn[x][y] = 0;\\n\\t\\t\\tanswer += D[x][y];\\n\\t\\t}\\n\\t}\\n\\n\\tcout << answer << '\\\\n';\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 53252,\n \"score_of_the_acc\": -1.3643,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2302_9696198\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\n int dx[4] = {1,0,-1,0}, dy[4] = {0,1,0,-1};\\n int N, M, K;\\n cin >> N >> M >> K;\\n vector G(N,vector<bool>(M));\\n rep(i,0,N) {\\n string S;\\n cin >> S;\\n rep(j,0,M) G[i][j] = (S[j] == '.' ? true : false);\\n }\\n vector A(N,vector<int>(M)), B(N,vector<int>(M)), C(N,vector<int>(M));\\n rep(i,0,N) rep(j,0,M) cin >> A[i][j];\\n rep(i,0,N) rep(j,0,M) cin >> B[i][j];\\n rep(i,0,N) rep(j,0,M) cin >> C[i][j];\\n vector<int> X(K), Y(K);\\n rep(i,0,K) cin >> X[i] >> Y[i];\\n vector D(N, vector(M, vector<int>()));\\n D[X[0]][Y[0]].push_back(0);\\n rep(i,0,K-1) {\\n vector Dist(N,vector<int>(M,inf));\\n Dist[X[i+1]][Y[i+1]] = 0;\\n queue<pair<int,int>> Q;\\n Q.push({X[i+1],Y[i+1]});\\n while(!Q.empty()) {\\n auto [CurX, CurY] = Q.front();\\n Q.pop();\\n rep(j,0,4) {\\n int NX = CurX + dx[j], NY = CurY + dy[j];\\n if (0 <= NX && NX < N && 0 <= NY && NY < M && G[NX][NY]) {\\n if (chmin(Dist[NX][NY],Dist[CurX][CurY]+1)) Q.push({NX,NY});\\n }\\n }\\n }\\n int NowX = X[i], NowY = Y[i];\\n while(1) {\\n if (Dist[NowX][NowY] == 0) break;\\n int NextX, NextY;\\n rep(j,0,4) {\\n int NX = NowX + dx[j], NY = NowY + dy[j];\\n if (0 <= NX && NX < N && 0 <= NY && NY < M && G[NX][NY] && Dist[NX][NY] == Dist[NowX][NowY] - 1) {\\n NextX = NX, NextY = NY;\\n break;\\n }\\n }\\n D[NextX][NextY].push_back(D[NowX][NowY].back()+1);\\n NowX = NextX, NowY = NextY;\\n }\\n }\\n int ANS = 0;\\n rep(i,0,N) {\\n rep(j,0,M) {\\n if (D[i][j].empty()) continue;\\n ANS += B[i][j] + C[i][j];\\n rep(k,0,D[i][j].size()-1) {\\n ANS += min(A[i][j]*(D[i][j][k+1]-D[i][j][k]),B[i][j]+C[i][j]);\\n }\\n }\\n }\\n cout << ANS << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 8728,\n \"score_of_the_acc\": -0.2994,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2302_8994721\",\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 H = in(), W = in(), M = in();\\n vector<string> S = in(H);\\n vector<vector<int>> c = in(H, W), on = in(H, W), off = in(H, W);\\n vector<pair<int,int>> task = in(M);\\n\\n vector<pair<int,int>> pos;\\n pos.push_back(task[0]);\\n for(int k : rep(M - 1)) {\\n vector dist(H, vector(W, -1));\\n {\\n auto [si, sj] = task[k + 1];\\n dist[si][sj] = 0;\\n queue<pair<int,int>> q;\\n q.push({si, sj});\\n while(not q.empty()) {\\n auto [i, j] = q.front(); q.pop();\\n for(auto [di, dj] : dir4) {\\n int ni = i + di, nj = j + dj;\\n if(0 <= ni and ni < H and 0 <= nj and nj < W and S[ni][nj] == '.' and dist[ni][nj] == -1) {\\n dist[ni][nj] = dist[i][j] + 1;\\n q.push({ni, nj});\\n }\\n }\\n }\\n }\\n\\n auto [i, j] = task[k];\\n do {\\n for(auto [di, dj] : dir4) {\\n int ni = i + di, nj = j + dj;\\n if(0 <= ni and ni < H and 0 <= nj and nj < W and S[ni][nj] == '.' and dist[ni][nj] == dist[i][j] - 1) {\\n pos.push_back({ni, nj});\\n tie(i, j) = make_pair(ni, nj);\\n break;\\n }\\n }\\n } while(dist[i][j] != 0);\\n }\\n\\n vector T(H, vector(W, vector<int>()));\\n for(int t : rep(int(pos.size()))) {\\n auto [i, j] = pos[t];\\n T[i][j].push_back(t);\\n }\\n\\n int ans = 0;\\n for(int i : rep(H)) for(int j : rep(W)) {\\n vector<int> & ts = T[i][j];\\n const int n = ts.size();\\n bool is_on = false;\\n int cost = 0;\\n for(int k : rep(n)) {\\n if(not is_on) {\\n cost += on[i][j];\\n is_on = true;\\n }\\n if(k + 1 < n and (ts[k + 1] - ts[k]) * c[i][j] <= off[i][j] + on[i][j]) {\\n cost += (ts[k + 1] - ts[k]) * c[i][j];\\n } else {\\n cost += off[i][j];\\n is_on = false;\\n }\\n }\\n ans += cost;\\n }\\n print(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 21460,\n \"score_of_the_acc\": -0.5467,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2302_6761315\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#ifdef _RUTHEN\\n#include \\\"debug.hpp\\\"\\n#else\\n#define show(...) true\\n#endif\\n\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\ntemplate <class T> using V = vector<T>;\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int H, W, M;\\n cin >> H >> W >> M;\\n V<string> S(H);\\n rep(i, H) cin >> S[i];\\n V<V<int>> A(H, V<int>(W)), B(H, V<int>(W)), C(H, V<int>(W));\\n rep(i, H) rep(j, W) cin >> A[i][j];\\n rep(i, H) rep(j, W) cin >> B[i][j];\\n rep(i, H) rep(j, W) cin >> C[i][j];\\n V<int> X(M), Y(M);\\n rep(i, M) cin >> X[i] >> Y[i];\\n V<int> P;\\n const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}, INF = 1 << 30;\\n rep(i, M - 1) {\\n // calculate path\\n V<V<int>> d(H, V<int>(W, INF)), pre(H, V<int>(W, -1));\\n d[X[i]][Y[i]] = 0;\\n queue<int> que;\\n que.push(X[i] * W + Y[i]);\\n while (!que.empty()) {\\n int val = que.front();\\n que.pop();\\n int cx = val / W, cy = val % W;\\n if (cx == X[i + 1] and cy == Y[i + 1]) break;\\n rep(k, 4) {\\n int nx = cx + dx[k], ny = cy + dy[k];\\n if (!(0 <= nx and nx < H and 0 <= ny and ny < W)) continue;\\n if (S[nx][ny] == '#') continue;\\n if (d[nx][ny] != INF) continue;\\n d[nx][ny] = d[cx][cy] + 1;\\n pre[nx][ny] = cx * W + cy;\\n que.push(nx * W + ny);\\n }\\n }\\n V<int> PP;\\n int cx = X[i + 1], cy = Y[i + 1];\\n while (cx != X[i] or cy != Y[i]) {\\n PP.push_back(pre[cx][cy]);\\n int nx = pre[cx][cy] / W, ny = pre[cx][cy] % W;\\n cx = nx, cy = ny;\\n }\\n reverse(PP.begin(), PP.end());\\n for (auto p : PP) P.push_back(p);\\n }\\n P.push_back(X[M - 1] * W + Y[M - 1]);\\n show(P);\\n V<V<int>> lt(H, V<int>(W, -1));\\n int N = P.size();\\n ll ans = 0;\\n for (int i = 0; i < N; i++) {\\n int cx = P[i] / W, cy = P[i] % W;\\n if (lt[cx][cy] != -1) {\\n ans += min(A[cx][cy] * (i - lt[cx][cy]), B[cx][cy] + C[cx][cy]);\\n } else {\\n ans += B[cx][cy] + C[cx][cy];\\n }\\n lt[cx][cy] = i;\\n }\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 13308,\n \"score_of_the_acc\": -0.3884,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2302_6688386\",\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\\nnamespace ebi {\\n\\nvoid main_() {\\n int r, c, m;\\n std::cin >> r >> c >> m;\\n std::vector<std::string> office(r);\\n std::cin >> office;\\n std::vector cost(r, std::vector<int>(c)), on(r, std::vector<int>(c)),\\n off(r, std::vector<int>(c));\\n std::cin >> cost >> on >> off;\\n std::vector<std::pair<int, int>> tasks(m);\\n std::cin >> tasks;\\n auto calc_path = [&](int sy, int sx, int gy, int gx) -> std::vector<std::pair<int,int>> {\\n std::queue<std::pair<int, int>> que;\\n std::vector dist(r, std::vector<int>(c, INF));\\n std::vector prev(r, std::vector<int>(c, -1));\\n dist[sy][sx] = 0;\\n que.push({sy, sx});\\n while (!que.empty()) {\\n auto [y, x] = que.front();\\n que.pop();\\n rep(i, 0, 4) {\\n int ny = dy[i] + y;\\n int nx = dx[i] + x;\\n if (0 <= ny && ny < r && 0 <= nx && nx < c &&\\n office[ny][nx] == '.' && dist[ny][nx] == INF) {\\n dist[ny][nx] = dist[y][x] + 1;\\n prev[ny][nx] = i;\\n que.push({ny, nx});\\n }\\n }\\n }\\n std::vector<std::pair<int,int>> path;\\n int y = gy, x = gx;\\n while(prev[y][x] >= 0) {\\n path.emplace_back(y, x);\\n int idx = prev[y][x];\\n int ny = y - dy[idx];\\n int nx = x - dx[idx];\\n assert(0 <= ny && ny < r && 0 <= nx && nx < c && office[ny][nx] == '.');\\n y = ny;\\n x = nx;\\n }\\n std::reverse(all(path));\\n return path;\\n };\\n std::map<std::pair<int, int>, int> map;\\n int ans = 0;\\n std::vector<std::pair<int,int>> path;\\n path.emplace_back(tasks[0]);\\n rep(i,1,m) {\\n auto [sy, sx] = tasks[i-1];\\n auto [gy, gx] = tasks[i];\\n auto p = calc_path(sy, sx, gy, gx);\\n path.insert(path.end(), p.begin(), p.end());\\n }\\n int n = path.size();\\n rep(i,0,n) {\\n auto [y, x] = path[i];\\n if(map.find({y, x}) == map.end()) {\\n ans += on[y][x] + off[y][x];\\n }\\n else {\\n int d = i - map[{y, x}];\\n ans += std::min(d * cost[y][x], off[y][x] + on[y][x]);\\n }\\n map[{y, x}] = i;\\n }\\n std::cout << ans << '\\\\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\": 160,\n \"memory_kb\": 15244,\n \"score_of_the_acc\": -1.226,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2302_6647067\",\n \"code_snippet\": \"/**\\n * author: otera\\n**/\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing int128_t = __int128_t;\\n#define repa(i, n) for(int i = 0; i < n; ++ i)\\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\\n#define overload4(a, b, c, d, e, ...) e\\n#define overload3(a, b, c, d, ...) d\\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\\ntypedef pair<int, int> P;\\ntypedef pair<ll, ll> LP;\\n#define pb push_back\\n#define pf push_front\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define rall(c) c.rbegin(), c.rend()\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define Sort(a) sort(all(a))\\n#define Rev(a) reverse(all(a))\\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define si(c) (int)(c).size()\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\n#define kth_bit(x, k) ((x>>k)&1)\\n#define unless(A) if(!(A))\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\ntemplate <class T> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T, class U> using umap = unordered_map<T, U>;\\ntemplate<class T> void scan(T& a){ cin >> a; }\\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\\nvoid print(){ cout << ' '; }\\ntemplate<class T> void print(const T& a){ cout << a; }\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\\nint out(){ cout << '\\\\n'; return 0; }\\ntemplate<class T> int out(const T& t){ print(t); cout << '\\\\n'; return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\\n#define CHOOSE(a) CHOOSE2 a\\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\\n#define debug_1(x1) cout<<#x1<<\\\": \\\"<<x1<<endl\\n#define debug_2(x1,x2) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<endl\\n#define debug_3(x1,x2,x3) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<endl\\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<endl\\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<\\\", \\\"#x5<<\\\": \\\"<<x5<<endl\\n#ifdef DEBUG\\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\\n#define dump(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...)\\n#define dump(...)\\n#endif\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(precision);\\n }\\n} io_setup_ {};\\n\\nconst int inf = 1e9 + 7;\\n\\nconst int dx[4] = {0, 1, 0, -1};\\nconst int dy[4] = {1, 0, -1, 0};\\n\\nvoid solve() {\\n INT(r, c, m);\\n VEC(string, f, r);\\n VV(int, c0, r, c);\\n VV(int, c1, r, c);\\n VV(int, c2, r, c);\\n vc<int> x(m), y(m);\\n rep(i, m) {\\n in(x[i], y[i]);\\n }\\n int cur = 0;\\n vvvc<int> g(r, vvc<int>(c, vc<int>()));\\n auto mv = [&](int x1, int y1, int x2, int y2) -> void {\\n debug(x1, y1, x2, y2);\\n queue<P> que;\\n vvc<int> di(r, vc<int>(c, inf));\\n vvc<P> pre(r, vc<P>(c, P{-1, -1}));\\n di[x1][y1] = cur;\\n que.push(P{x1, y1});\\n while(que.size()) {\\n auto [x, y] = que.front(); que.pop();\\n rep(_, 4) {\\n int nx = x + dx[_], ny = y + dy[_];\\n if(0 <= nx && nx < r && 0 <= ny && ny < c && f[nx][ny] == '.') {\\n if(chmin(di[nx][ny], di[x][y] + 1)) {\\n que.push(P{nx, ny});\\n pre[nx][ny] = P{x, y};\\n }\\n }\\n }\\n }\\n int x = x2, y = y2;\\n while(true) {\\n debug(x, y);\\n g[x][y].eb(di[x][y]);\\n auto [nx, ny] = pre[x][y];\\n debug(nx, ny);\\n if(nx == -1) break;\\n x = nx; y = ny;\\n }\\n cur = di[x2][y2];\\n };\\n rep(i, m - 1) {\\n mv(x[i], y[i], x[i + 1], y[i + 1]);\\n }\\n int ans = 0;\\n rep(x, r) {\\n rep(y, c) {\\n auto v = g[x][y];\\n int sz = si(v);\\n if(sz == 0) continue;\\n debug(x, y);\\n dump(v);\\n vvc<int> dp(sz, vc<int>(2, inf));\\n dp[0][0] = c1[x][y] + c2[x][y];\\n dp[0][1] = c1[x][y];\\n for(int i = 1; i < sz; ++ i) {\\n int ti = v[i] - v[i - 1];\\n int val = min(dp[i - 1][0] + c1[x][y], dp[i - 1][1] + c0[x][y] * ti);\\n chmin(dp[i][0], val + c2[x][y]);\\n chmin(dp[i][1], val);\\n }\\n ans += dp[sz - 1][0];\\n }\\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\": 60,\n \"memory_kb\": 13720,\n \"score_of_the_acc\": -0.5297,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2302_6365478\",\n \"code_snippet\": \"#line 1 \\\"library/me/template.cpp\\\"\\n// This is a dummy line\\n#ifndef ONLINE_JUDGE\\n#define _GLIBCXX_DEBUG\\n#endif\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define REP(i, n) for(int i = 0; i < (int)(n); i++)\\n#define FOR(i, a, b) for(ll i = a; i < (ll)(b); i++)\\n#define ALL(a) (a).begin(),(a).end()\\n#define END(...) { print(__VA_ARGS__); return; }\\n\\n#ifdef ONLINE_JUDGE\\n#define DBG(...) {}\\n#else\\n#define DBG(a) { cerr << #a << \\\": \\\"; dbg(a); }\\n#endif\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VVVI = vector<VVI>;\\nusing ll = long long;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing VVVL = vector<VVL>;\\nusing VD = vector<double>;\\nusing VVD = vector<VD>;\\nusing VVVD = vector<VVD>;\\nusing VS = vector<string>;\\nusing VVS = vector<VS>;\\nusing VVVS = vector<VVS>;\\nusing VC = vector<char>;\\nusing VVC = vector<VC>;\\nusing VVVC = vector<VVC>;\\nusing P = pair<int, int>;\\nusing VP = vector<P>;\\nusing VVP = vector<VP>;\\nusing VVVP = vector<VVP>;\\nusing LP = pair<ll, ll>;\\nusing VLP = vector<LP>;\\nusing VVLP = vector<VLP>;\\nusing VVVLP = vector<VVLP>;\\n\\ntemplate <typename T>\\nusing PQ = priority_queue<T>;\\ntemplate <typename T>\\nusing GPQ = priority_queue<T, vector<T>, greater<T>>;\\n\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr int DX[] = {1, 0, -1, 0};\\nconstexpr int DY[] = {0, 1, 0, -1};\\n\\n#ifdef aclmodint\\n\\nusing MI7 = modint1000000007;\\nusing V7 = vector<MI7>;\\nusing VV7 = vector<V7>;\\nusing VVV7 = vector<VV7>;\\nusing MI3 = modint998244353;\\nusing V3 = vector<MI3>;\\nusing VV3 = vector<V3>;\\nusing VVV3 = vector<VV3>;\\n\\nostream &operator<<(ostream &os, const modint &x) {\\n os << x.val();\\n return os;\\n}\\n\\nostream &operator<<(ostream &os, const MI3 &x) {\\n os << x.val();\\n return os;\\n}\\n\\nostream &operator<<(ostream &os, const MI7 &x) {\\n os << x.val();\\n return os;\\n}\\n\\nistream &operator>>(istream &is, modint &x) {\\n int y; is >> y;\\n x = y;\\n return is;\\n}\\n\\nistream &operator>>(istream &is, MI3 &x) {\\n int y; is >> y;\\n x = y;\\n return is;\\n}\\n\\nistream &operator>>(istream &is, MI7 &x) {\\n int y; is >> y;\\n x = y;\\n return is;\\n}\\n\\n#endif\\n\\nvoid print() { cout << '\\\\n'; }\\ntemplate<typename T>\\nvoid print(const T &t) { cout << t << '\\\\n'; }\\ntemplate<typename Head, typename... Tail>\\nvoid print(const Head &head, const Tail &... tail) {\\n cout << head << ' ';\\n print(tail...);\\n}\\n\\n#ifdef ONLINE_JUDGE\\ntemplate<typename... Args>\\nvoid dbg(const Args &... args) {}\\n#else\\nvoid dbg() { cerr << '\\\\n'; }\\ntemplate<typename T>\\nvoid dbg(const T &t) { cerr << t << '\\\\n'; }\\ntemplate<typename Head, typename... Tail>\\nvoid dbg(const Head &head, const Tail &... tail) {\\n cerr << head << ' ';\\n dbg(tail...);\\n}\\n#endif\\n\\ntemplate< typename T1, typename T2 >\\nostream &operator<<(ostream &os, const pair< T1, T2 >& p) {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\n\\ntemplate< typename T1, typename T2 >\\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate< typename T >\\nostream &operator<<(ostream &os, const vector< T > &v) {\\n for(int i = 0; i < (int) v.size(); i++) {\\n os << v[i] << (i + 1 != (int) v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate< typename T >\\nistream &operator>>(istream &is, vector< T > &v) {\\n for(T &in : v) is >> in;\\n return is;\\n}\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\ntemplate< typename T1, typename T2 >\\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n\\ntemplate <typename T>\\npair<VI, vector<T>> compress(const vector<T> &a) {\\n int n = a.size();\\n vector<T> x;\\n REP(i, n) x.push_back(a[i]);\\n sort(ALL(x)); x.erase(unique(ALL(x)), x.end());\\n VI res(n);\\n REP(i, n) res[i] = lower_bound(ALL(x), a[i]) - x.begin();\\n return make_pair(res, x);\\n}\\n\\ntemplate <typename T>\\npair<vector<T>, vector<T>> factorial(int n) {\\n vector<T> res(n+1), rev(n+1);\\n res[0] = 1;\\n REP(i, n) res[i+1] = res[i] * (i+1);\\n rev[n] = 1 / res[n];\\n for(int i = n; i > 0; i--) {\\n rev[i-1] = rev[i] * i;\\n }\\n return make_pair(res, rev);\\n}\\n\\n#ifdef aclsegtree\\n\\ntemplate<typename S>\\nstruct value_size { S value; int size; };\\n\\ntemplate<typename S>\\nS min_op(S l, S r) { return min(l, r); };\\ntemplate<typename S>\\nS max_op(S l, S r) { return max(l, r); };\\ntemplate<typename S>\\nS sum_op(S l, S r) { return l + r; };\\ntemplate<typename S>\\nvalue_size<S> sum_op_size(value_size<S> l, value_size<S> r) {\\n return {l.value + r.value, l.size + r.size};\\n};\\n\\ntemplate<typename S>\\nS min_e() { return numeric_limits<S>::max(); };\\ntemplate<typename S>\\nS max_e() { return numeric_limits<S>::min(); };\\ntemplate<typename S>\\nS sum_e() { return 0; }\\ntemplate<typename S>\\nvalue_size<S> sum_e_size() { return {0, 0}; }\\ntemplate<typename S>\\nvalue_size<S> min_e_size() { return {numeric_limits<S>::max(), 0}; }\\ntemplate<typename S>\\nvalue_size<S> max_e_size() { return {numeric_limits<S>::min(), 0}; }\\n\\ntemplate<typename S, typename F>\\nS chmin_mapping(F f, S x) { return min(x, f); }\\ntemplate<typename S, typename F>\\nS chmax_mapping(F f, S x) { return max(x, f); }\\ntemplate<typename S, typename F>\\nS add_mapping(F f, S x) { return x + f; }\\ntemplate<typename S, typename F>\\nvalue_size<S> add_mapping_size(F f, value_size<S> x) {\\n return {x.value + x.size * f, x.size};\\n}\\ntemplate <typename S,typename F, F ID>\\nS change_mapping(F f, S x) { return (f == ID? x : f); }\\ntemplate <typename S,typename F, F ID>\\nvalue_size<S> change_mapping_size(F f, value_size<S> x) { \\n value_size<S> ret = {f * x.size, x.size};\\n return (f == ID? x : ret); \\n}\\ntemplate <typename S, typename F1, typename F2>\\nS linear_mapping(pair<F1, F2> f, S x) { return x * f.first + f.second; }\\ntemplate <typename S, typename F1, typename F2>\\nvalue_size<S> linear_mapping_size(pair<F1, F2> f, value_size<S> x) { return {x.value * f.first + x.size * f.second, x.size}; }\\n\\ntemplate<typename F>\\nF chmin_composition(F f, F g) { return min(f, g); }\\ntemplate<typename F>\\nF chmax_composition(F f, F g) { return max(f, g); }\\ntemplate<typename F>\\nF add_composition(F f, F g) { return f + g; }\\ntemplate <typename F, F ID>\\nF change_composition(F f, F g) { return (f == ID? g : f); }\\ntemplate<typename F1, typename F2>\\npair<F1, F2> linear_composition(pair<F1, F2> f, pair<F1, F2> g) { return {f.first * g.first, f.first * g.second + f.second}; }\\n\\ntemplate<typename F>\\nF chmin_id() { return numeric_limits<F>::max(); }\\ntemplate<typename F>\\nF chmax_id() { return numeric_limits<F>::min(); }\\ntemplate<typename F>\\nF add_id() { return 0; }\\ntemplate<typename F, F ID>\\nF change_id() { return ID; }\\ntemplate<typename F1, typename F2>\\npair<F1, F2> linear_id() { return {1, 0}; }\\n\\ntemplate<typename S>\\nusing RSumQ = segtree<S, sum_op<S>, sum_e<S>>;\\ntemplate<typename S>\\nusing RMaxQ = segtree<S, max_op<S>, max_e<S>>;\\ntemplate<typename S>\\nusing RMinQ = segtree<S, min_op<S>, min_e<S>>;\\n\\ntemplate<typename S, typename F>\\nusing RAddSumQ = lazy_segtree<value_size<S>, sum_op_size<S>, sum_e_size<S>,\\n F, add_mapping_size<S, F>, add_composition<F>, add_id<F>>;\\ntemplate<typename S, typename F>\\nusing RAddMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\\n F, add_mapping<S, F>, add_composition<F>, add_id<F>>;\\ntemplate<typename S, typename F>\\nusing RAddMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\\n F, add_mapping<S, F>, add_composition<F>, add_id<F>>;\\ntemplate<typename S, typename F>\\nusing RMinMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\\n F, chmin_mapping<S, F>, chmin_composition<F>, chmin_id<F>>;\\ntemplate<typename S, typename F>\\nusing RMaxMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\\n F, chmax_mapping<S, F>, chmax_composition<F>, chmax_id<F>>;\\ntemplate<typename S, typename F, F ID>\\nusing RChangeMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\\n F, change_mapping<S, F, ID>,\\n change_composition<F, ID>,\\n change_id<F, ID>>;\\ntemplate<typename S, typename F, F ID>\\nusing RChangeMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\\n F, change_mapping<S, F, ID>,\\n change_composition<F, ID>,\\n change_id<F, ID>>;\\ntemplate<typename S, typename F, F ID>\\nusing RChangeSumQ = lazy_segtree<value_size<S>, sum_op_size<S>, sum_e_size<S>,\\n F, change_mapping_size<S, F, ID>,\\n change_composition<F, ID>,\\n change_id<F, ID>>;\\ntemplate<typename S, typename F1, typename F2>\\nusing RLinearMinQ = lazy_segtree<S, min_op<S>, min_e<S>,\\n pair<F1, F2>, linear_mapping<S, F1, F2>,\\n linear_composition<F1, F2>,\\n linear_id<F1, F2>>;\\ntemplate<typename S, typename F1, typename F2>\\nusing RLinearMaxQ = lazy_segtree<S, max_op<S>, max_e<S>,\\n pair<F1, F2>, linear_mapping<S, F1, F2>,\\n linear_composition<F1, F2>,\\n linear_id<F1, F2>>;\\ntemplate<typename S, typename F1, typename F2>\\nusing RLinearSumQ = lazy_segtree<value_size<S>, sum_op_size<S>, sum_e_size<S>,\\n pair<F1, F2>, linear_mapping_size<S, F1, F2>,\\n linear_composition<F1, F2>,\\n linear_id<F1, F2>>;\\n#endif\\n#line 2 \\\"Contests/Dummy/main.cpp\\\"\\n\\nbool run() {\\n int m, n; cin >> m >> n;\\n if(m == 0) return false;\\n VS s(n); cin >> s;\\n VI three_pow(m+1, 1);\\n REP(i, m) three_pow[i+1] = three_pow[i] * 3;\\n VI num(n, INF);\\n REP(i, three_pow[m]) {\\n VI v;\\n int cnt;\\n REP(j, n) {\\n bool ok = true;\\n cnt = 0;\\n REP(k, m) {\\n if(!(i / three_pow[k] % 3)) continue;\\n cnt++;\\n if(i / three_pow[k] % 3 - 1 != s[j][k] - '0') ok = false;\\n }\\n if(ok) v.push_back(j);\\n }\\n if(v.size() == 1) chmin(num[v[0]], cnt);\\n }\\n int ans = 0;\\n REP(i, n) chmax(ans, num[i]);\\n print(ans);\\n return true;\\n}\\n\\nvoid solve(){\\n int r, c, m; cin >> r >> c >> m;\\n VS maze(r); cin >> maze;\\n VVL power(r, VL(c)), turnon(r, VL(c)), turnoff(r, VL(c)); cin >> power >> turnon >> turnoff;\\n int prex, prey; cin >> prex >> prey;\\n ll ans = turnon[prex][prey] + turnoff[prex][prey];\\n VVL previsit(r, VL(c, -INF));\\n previsit[prex][prey] = 0;\\n ll t = 0;\\n REP(i, m - 1) {\\n int nxtx, nxty; cin >> nxtx >> nxty;\\n VVL dist(r, VL(c, INF));\\n dist[prex][prey] = 0;\\n queue<P> que;\\n que.emplace(prex, prey);\\n while(!que.empty()) {\\n auto [x, y] = que.front(); que.pop();\\n REP(j, 4) {\\n int nx = x + DX[j], ny = y + DY[j];\\n if(nx < 0 || nx >= r || ny < 0 || ny >= c) continue;\\n if(maze[nx][ny] == '#') continue;\\n if(dist[nx][ny] == INF) {\\n dist[nx][ny] = dist[x][y] + 1;\\n que.emplace(nx, ny);\\n }\\n }\\n }\\n int curx = nxtx, cury = nxty;\\n while(curx != prex || cury != prey) {\\n if(previsit[curx][cury] == -INF) ans += turnon[curx][cury]+turnoff[curx][cury];\\n else ans += min(turnon[curx][cury]+turnoff[curx][cury], power[curx][cury]*(t+dist[curx][cury]-previsit[curx][cury]));\\n previsit[curx][cury] = t + dist[curx][cury];\\n REP(j, 4) {\\n int nx = curx + DX[j], ny = cury + DY[j];\\n if(nx < 0 || nx >= r || ny < 0 || ny >= c) continue;\\n if(maze[nx][ny] == '#') continue;\\n if(dist[nx][ny] + 1 == dist[curx][cury]) {\\n curx = nx, cury = ny;\\n break;\\n }\\n }\\n }\\n t += dist[nxtx][nxty];\\n prex = nxtx, prey = nxty;\\n }\\n print(ans);\\n}\\n\\n// generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)\\nint main() {\\n // Fasterize input/output script\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(100);\\n // scanf/printf user should delete this fasterize input/output script\\n\\n int t = 1;\\n //cin >> t; // comment out if solving multi testcase\\n for(int testCase = 1;testCase <= t;++testCase){\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3612,\n \"score_of_the_acc\": -0.3333,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2302_6336656\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\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#define int long long\\nint cost[3][100][100];\\nvector<int> cost_cutter[100][100];\\nvoid solve()\\n{\\n int r, c, m;\\n cin >> r >> c >> m;\\n vector<string> inputs;\\n REP(i, r)\\n {\\n string s;\\n cin >> s;\\n inputs.push_back(s);\\n }\\n REP(t, 3)\\n {\\n REP(i, r)\\n {\\n REP(q, c)\\n {\\n cin >> cost[t][i][q];\\n }\\n }\\n }\\n pair<int, int> cur;\\n cin >> cur.first >> cur.second;\\n cost_cutter[cur.first][cur.second].push_back(0);\\n int cur_time = 0;\\n REP(i, m - 1)\\n {\\n pair<int, int> target;\\n cin >> target.first >> target.second;\\n\\n vector<vector<int>> dist(r, vector<int>(c, 1e18));\\n vector<vector<pair<int, int>>> backs(r, vector<pair<int, int>>(c));\\n\\n dist[cur.first][cur.second] = 0;\\n queue<pair<int, int>> nexts;\\n nexts.push(cur);\\n while (!nexts.empty())\\n {\\n pair<int, int> now = nexts.front();\\n nexts.pop();\\n int dx[4] = {-1, 1, 0, 0};\\n REP(i, 4)\\n {\\n int x = dx[i] + now.first;\\n int y = dx[3 - i] + now.second;\\n if (x >= 0 and x < r and y >= 0 and y < c)\\n {\\n if (inputs[x][y] == '#')\\n continue;\\n if (dist[x][y] == 1e18)\\n {\\n dist[x][y] = dist[now.first][now.second] + 1;\\n nexts.push({x, y});\\n backs[x][y] = now;\\n }\\n }\\n }\\n }\\n cur_time += dist[target.first][target.second];\\n\\n pair<int, int> now = target;\\n while (now != cur)\\n {\\n cost_cutter[now.first][now.second].push_back(cur_time);\\n cur_time--;\\n now = backs[now.first][now.second];\\n }\\n cur_time += dist[target.first][target.second];\\n\\n cur = target;\\n }\\n\\n int ans = 0;\\n REP(i, r)\\n {\\n REP(q, c)\\n {\\n cost_cutter[i][q].push_back(1e12);\\n REP(j, cost_cutter[i][q].size() - 1)\\n {\\n ans += cost[1][i][q];\\n int next_come = cost_cutter[i][q][j + 1] - cost_cutter[i][q][j];\\n next_come *= cost[0][i][q];\\n if (j == cost_cutter[i][q].size() - 2 or next_come > cost[1][i][q] + cost[2][i][q])\\n {\\n ans += cost[2][i][q];\\n }\\n else\\n {\\n ans += next_come;\\n ans -= cost[1][i][q];\\n }\\n }\\n }\\n }\\n cout << ans << 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\": 50,\n \"memory_kb\": 13904,\n \"score_of_the_acc\": -0.4666,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":1286,"cells":{"group_id":{"kind":"string","value":"aoj_2306_cpp"},"problem_description":{"kind":"string","value":"Rabbit Party\nA rabbit Taro decided to hold a party and invite some friends as guests.\nHe has\nn\nrabbit friends, and\nm\npairs of rabbits are also friends with each other.\n\nFriendliness of each pair is expressed with a positive integer.\nIf two rabbits are not friends, their friendliness is assumed to be 0.\nWhen a rabbit is invited to the party, his satisfaction score is defined as the minimal friendliness with any other guests.\n The satisfaction of the party itself is defined as the sum of satisfaction score for all the guests.\nTo maximize satisfaction scores for the party, who should Taro invite?\nWrite a program to calculate the maximal possible satisfaction score for the party.\nInput\nThe first line of the input contains two integers,\nn\nand\nm\n(\n1 \\leq n \\leq 100\n,\n0 \\leq m \\leq 100\n).\nThe rabbits are numbered from\n1\nto\nn\n.\nEach of the following\nm\nlines has three integers,\nu\n,\nv\nand\nf\n.\nu\nand\nv\n(\n1 \\leq u, v \\leq n\n,\nu \\neq v\n,\n1 \\leq f \\leq 1,000,000\n) stands for the rabbits' number, and\nf\nstands for their friendliness.\nYou may assume that the friendliness of a pair of rabbits will be given at most once.\nOutput\nOutput the maximal possible satisfaction score of the party in a line.\nSample Input 1\n3 3\n1 2 3\n2 3 1\n3 1 2\nOutput for the Sample Input 1\n6\nSample Input 2\n2 1\n1 2 5\nOutput for the Sample Input 2\n10\nSample Input 3\n1 0\nOutput for the Sample Input 3\n0\nSample Input 4\n4 5\n1 2 4\n1 3 3\n2 3 7\n2 4 5\n3 4 6\nOutput for the Sample Input 4\n16"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2306_10690753","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint N, M, ST, gans, ans, hg1, ohg1;\nint jiyou[120][120], val[200], oval[300];\nbool used[1000];\n\nint getans()\n{\n\tint i, res = 0, nc = 0;\n\tfor (i = ST; i <= N; ++i)\n\t\tif (used[i])\n\t\t{\n\t\t\t++nc;\n\t\t\tres += val[i];\n\t\t}\n\tif (nc < 2) return 0;\n\treturn res;\n}\n\nvoid dfs(int x);\n\nint main()\n{\n\tint i, j, k, x, y, l;\n\tmemset(jiyou, 0, sizeof(jiyou));\n\tscanf(\"%d%d\", &N, &M);\n\tfor (i = 0; i < M; ++i)\n\t{\n\t\tscanf(\"%d%d%d\", &x, &y, &l);\n\t\tjiyou[x][y] = l;\n\t\tjiyou[y][x] = l;\n\t}\n\tfor (i = 1; i < N; ++i)\n\t{\n\t\tST = i;\n\t\tans = 0;\n\t\tmemset(used, 0, sizeof(used));\n\t\tmemset(val, 127, sizeof(val));\n\t\tused[i] = true;\n\t\tdfs(i+1);\n\t}\n\tprintf(\"%d\\n\", gans);\n\treturn 0;\n}\n\nvoid dfs(int x)\n{\n\tint i, haogandu = 10000000;\n\tif (x > N)\n\t{\n\t\tgans = max(gans, getans());\n\t\treturn;\n\t}\n\tfor (i = ST; i <= N; ++i)\n\t\tif (used[i])\n\t\t\thaogandu = min(haogandu, jiyou[x][i]);\n\tif (haogandu)\n\t{\n\t\tfor (i = ST; i <= N; ++i)\n\t\t\toval[i] = val[i];\n\t\tval[x] = haogandu;\n\t\tfor (i = ST; i <= N; ++i)\n\t\t\tif (used[i])\n\t\t\t{\n\t\t\t\tval[i] = min(val[i], jiyou[x][i]);\n\t\t\t\tif (i > ST)\n\t\t\t\t\tval[ST] = min(val[ST], jiyou[i][ST]);\n\t\t\t}\n\t\tgans = max(gans, getans());\n\t\tused[x] = true;\n\t\tdfs(x+1);\n\t\tused[x] = false;\n\t\tfor (i = ST; i <= N; ++i)\n\t\t\tval[i] = oval[i];\n\t}\n\tdfs(x+1);\n}","accuracy":0.4727272727272727,"time_ms":20,"memory_kb":3060,"score_of_the_acc":-0.0052,"final_rank":20},{"submission_id":"aoj_2306_8302655","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\nbool is_end = false;\nmt19937 engine(42);\n\nvoid calc()\n{\n\tint N, M; cin >> N >> M;\n\tvector<bool> has_friends(N, false);\n\tvector<vector<int>> weight(N, vector<int>(N, 0));\n\tfor (int i = 0; i < M; ++i)\n\t{\n\t\tint a, b, f; cin >> a >> b >> f;\n\t\ta--, b--;\n\t\thas_friends[a] = has_friends[b] = true;\n\t\tweight[a][b] = weight[b][a] = f;\n\t}\n\t\n\tvector<int> perm;\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tif (has_friends[i]) {perm.emplace_back(i);}\n\t}\n\t\n\tint cnt = 0;\n\tint res = 0;\n\twhile (cnt < 100000)\n\t{\n\t\tcnt++;\n\t\tshuffle(perm.begin(), perm.end(), engine);\n\t\tvector<int> cleak;\n\t\t\n\t\tfor (auto v : perm)\n\t\t{\n\t\t\tbool flg = true;\n\t\t\tfor (auto c : cleak)\n\t\t\t{\n\t\t\t\tflg &= (weight[v][c] > 0);\n\t\t\t}\n\t\t\t\n\t\t\tif (!flg) {continue;}\n\t\t\tcleak.emplace_back(v);\n\t\t\t\n\t\t\tif (cleak.size() == 1) {continue;}\n\t\t\t\n\t\t\tint tmp = 0;\n\t\t\tfor (auto c : cleak)\n\t\t\t{\n\t\t\t\tint mn = 1e9;\n\t\t\t\tfor (auto d : cleak)\n\t\t\t\t{\n\t\t\t\t\tif (c != d) {mn = min(mn, weight[c][d]);}\n\t\t\t\t}\n\t\t\t\ttmp += mn;\n\t\t\t}\n\t\t\tres = max(res, tmp);\n\t\t}\n\t}\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":120,"memory_kb":3472,"score_of_the_acc":-0.0631,"final_rank":11},{"submission_id":"aoj_2306_8020162","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#define int ll\n\ntemplate <class T, class... Ts>\nvoid OUT(const T &a, const Ts &...b) {\n cout << a;\n (cout << ... << (cout << \" \", b));\n cout << endl;\n}\n\ntemplate <class T>\nvoid DEBUG_(string_view name, const T &a) {\n cout << name << \": \" << a << endl;\n}\n\ntemplate <class 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 <class T, class U>\nbool chmax(T &x, const U &y) {\n return x < y ? x = y, 1 : 0;\n}\ntemplate <class T, class U>\nbool chmin(T &x, const U &y) {\n return x > y ? x = y, 1 : 0;\n}\n\ntemplate <class T>\nusing minheap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class T>\nusing maxheap = priority_queue<T>;\n\nconst vl dy = {1, 0, -1, 0, 1, -1, -1, 1};\nconst vl dx = {0, 1, 0, -1, 1, 1, -1, -1};\n\ntemplate <class T = ll>\nstruct Edge {\n ll from, to;\n T cost;\n ll idx;\n Edge(ll f, ll t, T c = 1, ll i = -1) : from(f), to(t), cost(c), idx(i) {}\n operator int() const { return to; }\n};\n\ntemplate <class T = ll>\nstruct Graph {\n vector<vector<Edge<T>>> g;\n ll es;\n explicit Graph(ll n) : g(n), es(0) {}\n size_t size() const { return sz(g); }\n void add_directed_edge(ll from, ll to, T cost = 1) {\n g[from].eb(from, to, cost, es++);\n }\n void add_edge(ll from, ll to, T cost = 1) {\n g[from].eb(from, to, cost, es);\n g[to].eb(to, from, cost, es++);\n }\n inline vector<Edge<T>> &operator[](const int &k) { return g[k]; }\n inline const vector<Edge<T>> &operator[](const int &k) const {\n return g[k];\n }\n};\n\n//-----------------------------------------------------------------------\n\nvoid solve() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(15);\n\n int N, M;\n cin >> N >> M;\n vvl Fs(N, vl(N, 0));\n set<vl> clique;\n ll ans = 0;\n REP(i, M) {\n int u, v, f;\n cin >> u >> v >> f;\n u--;\n v--;\n Fs[u][v] = f;\n Fs[v][u] = f;\n clique.insert({u, v});\n chmax(ans, 2 * f);\n }\n\n auto calcScore = [&](const vl &clique) -> ll {\n // DEBUG(clique);\n ll ans = 0;\n EACH(c1, clique) {\n ll ans2 = INFL;\n EACH(c2, clique) {\n if (c1 == c2) continue;\n chmin(ans2, Fs[c1][c2]);\n }\n ans += ans2;\n }\n // DEBUG(ans);\n return ans;\n };\n\n while (!clique.empty()) {\n // DEBUG(clique.size());\n set<vl> newClique;\n EACH(c, clique) {\n REP(nv, N) {\n if (find(ALL(c), nv) != c.end()) {\n continue;\n }\n bool ok = true;\n EACH(v, c) {\n if (Fs[v][nv] == 0) {\n ok = false;\n break;\n }\n }\n if (!ok) continue;\n vl newC = c;\n newC.insert(lower_bound(ALL(newC), nv), nv);\n chmax(ans, calcScore(newC));\n newClique.insert(newC);\n }\n }\n swap(clique, newClique);\n }\n\n cout << ans << endl;\n}\n\nsigned main() {\n int T = 1;\n // cin >> T;\n\n while (T--) solve();\n\n // random_test();\n\n return 0;\n}","accuracy":1,"time_ms":1930,"memory_kb":74600,"score_of_the_acc":-2,"final_rank":19},{"submission_id":"aoj_2306_6793059","code_snippet":"/**\n * author: otera\n**/\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing int128_t = __int128_t;\n#define repa(i, n) for(int i = 0; i < n; ++ i)\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define overload3(a, b, c, d, ...) d\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\ntypedef pair<int, int> P;\ntypedef pair<ll, ll> LP;\n#define pb push_back\n#define pf push_front\n#define ppb pop_back\n#define ppf pop_front\n#define eb emplace_back\n#define fr first\n#define sc second\n#define all(c) c.begin(),c.end()\n#define rall(c) c.rbegin(), c.rend()\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define si(c) (int)(c).size()\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\n#define kth_bit(x, k) ((x>>k)&1)\n#define unless(A) if(!(A))\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate <class T> using vc = vector<T>;\ntemplate <class T> using vvc = vector<vc<T>>;\ntemplate <class T> using vvvc = vector<vvc<T>>;\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T, class U> using umap = unordered_map<T, U>;\ntemplate<class T> void scan(T& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\nvoid print(){ cout << ' '; }\ntemplate<class T> void print(const T& a){ cout << a; }\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\nint out(){ cout << '\\n'; return 0; }\ntemplate<class T> int out(const T& t){ print(t); cout << '\\n'; return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\n#define debug_1(x1) cout<<#x1<<\": \"<<x1<<endl\n#define debug_2(x1,x2) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<endl\n#define debug_3(x1,x2,x3) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<endl\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<endl\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<\", \"#x5<<\": \"<<x5<<endl\n#ifdef DEBUG\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\n#define dump(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...)\n#define dump(...)\n#endif\n\nstruct io_setup {\n io_setup(int precision = 20) {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout << fixed << setprecision(precision);\n }\n} io_setup_ {};\n\nconst int inf = 1e9 + 7;\n\nvoid solve() {\n INT(n, m);\n vvc<P> g(n);\n vvc<int> h(n, vc<int>(n, 0));\n rep(i, m) {\n INT(u, v, f); -- u, -- v;\n g[u].eb(v, f);\n g[v].eb(u, f);\n h[u][v] = h[v][u] = f; \n }\n int ans = 0;\n auto dfs = [&](auto&&dfs, vc<int> used, int i) -> void {\n int ret = 0;\n bool ok = 1;\n int cnt = 0;\n for(int x = 0; x < i; ++ x) {\n if(used[x]) {\n ++ cnt;\n int now = inf;\n for(int y = 0; y < i; ++ y) {\n if(y != x && used[y]) chmin(now, h[x][y]);\n }\n if(now == inf) ok = 0;\n ret += now;\n }\n }\n if(cnt >= 2 && !ok) return;\n if(ok) chmax(ans, ret);\n if(i == n) return;\n dfs(dfs, used, i + 1);\n ok = 1;\n if(cnt >= 1) {\n rep(x, i) {\n if(used[x]) {\n if(h[x][i] == 0) ok = 0;\n }\n }\n }\n used[i] = 1;\n if(ok) dfs(dfs, used, i + 1);\n used[i] = 0;\n return;\n };\n vc<int> cur(n, 0);\n dfs(dfs, cur, 0);\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":240,"memory_kb":3644,"score_of_the_acc":-0.128,"final_rank":12},{"submission_id":"aoj_2306_6176777","code_snippet":"#ifndef HIDDEN_IN_VISUAL_STUDIO // 折りたたみ用\n\n// 警告の抑制\n#define _CRT_SECURE_NO_WARNINGS\n\n// ライブラリの読み込み\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型名の短縮\nusing ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\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>;\nusing vl = vector<ll>;\t\tusing vvl = vector<vl>;\t\tusing vvvl = vector<vvl>;\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 = 3.14159265359;\nconst double DEG = PI / 180.; // θ [deg] = θ * DEG [rad]\nconst vi dx4 = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\nconst vi dy4 = { 0, 1, 0, -1 };\nconst vi dx8 = { 1, 1, 0, -1, -1, -1, 0, 1 }; // 8 近傍\nconst vi dy8 = { 0, 1, 1, 1, 0, -1, -1, -1 };\nconst int INF = 1001001001; const ll INFL = 2002002002002002002LL;\nconst double EPS = 1e-10; // 許容誤差に応じて調整\n\n// 入出力高速化\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } fastIOtmp;\n\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((int)(x).size())\n#define distance (int)distance\n#define Yes(b) {cout << ((b) ? \"Yes\" : \"No\") << endl;}\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 < (1 << int(d)); ++set) // d ビット全探索（昇順）\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\n#define repit(it, a) for(auto it = (a).begin(); it != (a).end(); ++it) // イテレータを回す（昇順）\n#define repitr(it, a) for(auto it = (a).rbegin(); it != (a).rend(); ++it) // イテレータを回す（降順）\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\n\n// 汎用関数の定義\ntemplate <class T> inline ll pow(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 を返す）\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, class U> inline ostream& operator<< (ostream& os, const pair<T, U>& p) { os << \"(\" << p.first << \",\" << p.second << \")\"; return os; }\ntemplate <class T, class U, class V> inline istream& operator>> (istream& is, tuple<T, U, V>& t) { is >> get<0>(t) >> get<1>(t) >> get<2>(t); return is; }\ntemplate <class T, class U, class V> inline ostream& operator<< (ostream& os, const tuple<T, U, V>& t) { os << \"(\" << get<0>(t) << \",\" << get<1>(t) << \",\" << get<2>(t) << \")\"; return os; }\ntemplate <class T, class U, class V, class W> inline istream& operator>> (istream& is, tuple<T, U, V, W>& t) { is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t); return is; }\ntemplate <class T, class U, class V, class W> inline ostream& operator<< (ostream& os, const tuple<T, U, V, W>& t) { os << \"(\" << get<0>(t) << \",\" << get<1>(t) << \",\" << get<2>(t) << \",\" << get<3>(t) << \")\"; return os; }\ntemplate <class T> inline istream& operator>> (istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\ntemplate <class T> inline ostream& operator<< (ostream& os, const vector<T>& v) { repe(x, v) os << x << \" \"; return os; }\ntemplate <class T> inline ostream& operator<< (ostream& os, const list<T>& v) { repe(x, v) os << x << \" \"; return os; }\ntemplate <class T> inline ostream& operator<< (ostream& os, const set<T>& s) { repe(x, s) os << x << \" \"; return os; }\ntemplate <class T> inline ostream& operator<< (ostream& os, const set<T, greater<T>>& s) { repe(x, s) os << x << \" \"; return os; }\ntemplate <class T> inline ostream& operator<< (ostream& os, const unordered_set<T>& s) { repe(x, s) os << x << \" \"; return os; }\ntemplate <class T, class U> inline ostream& operator<< (ostream& os, const map<T, U>& m) { repe(p, m) os << p << \" \"; return os; }\ntemplate <class T, class U> inline ostream& operator<< (ostream& os, const unordered_map<T, U>& m) { repe(p, m) os << p << \" \"; return os; }\ntemplate <class T> inline ostream& operator<< (ostream& os, stack<T> s) { while (!s.empty()) { os << s.top() << \" \"; s.pop(); } return os; }\ntemplate <class T> inline ostream& operator<< (ostream& os, queue<T> q) { while (!q.empty()) { os << q.front() << \" \"; q.pop(); } return os; }\ntemplate <class T> inline ostream& operator<< (ostream& os, deque<T> q) { while (!q.empty()) { os << q.front() << \" \"; q.pop_front(); } return os; }\ntemplate <class T> inline ostream& operator<< (ostream& os, priority_queue<T> q) { while (!q.empty()) { os << q.top() << \" \"; q.pop(); } return os; }\ntemplate <class T> inline ostream& operator<< (ostream& os, priority_queue_rev<T> q) { while (!q.empty()) { os << q.top() << \" \"; q.pop(); } return os; }\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { rep(_i_, sz(v)) --v[_i_]; return v; }\n\n// 手元環境（Visual Studio）\n#ifdef _MSC_VER\n#define popcount (int)__popcnt // 全ビット中の 1 の個数\n#define popcountll (int)__popcnt64\ninline int lsb(unsigned int n) { unsigned long i; _BitScanForward(&i, n); return i; } // 最下位ビットの位置（0-indexed）\ninline int lsbll(unsigned long long n) { unsigned long i; _BitScanForward64(&i, n); return i; }\ninline int msb(unsigned int n) { unsigned long i; _BitScanReverse(&i, n); return i; } // 最上位ビットの位置（0-indexed）\ninline int msbll(unsigned long long n) { unsigned long i; _BitScanReverse64(&i, n); return i; }\ntemplate <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }\n#define dump(x) cout << \"\\033[1;36m\" << (x) << \"\\033[0m\" << endl;\n#define dumps(x) cout << \"\\033[1;36m\" << (x) << \"\\033[0m \";\n#define dumpel(a) { int _i_ = -1; cout << \"\\033[1;36m\"; repe(x, a) {cout << ++_i_ << \": \" << x << endl;} cout << \"\\033[0m\"; }\n#define input_from_file(f) ifstream isTMP(f); cin.rdbuf(isTMP.rdbuf());\n#define output_to_file(f) ofstream osTMP(f); cout.rdbuf(osTMP.rdbuf());\n// 提出用（gcc）\n#else\n#define popcount (int)__builtin_popcount\n#define popcountll (int)__builtin_popcountll\n#define lsb __builtin_ctz\n#define lsbll __builtin_ctzll\n#define msb(n) (31 - __builtin_clz(n))\n#define msbll(n) (63 - __builtin_clzll(n))\n#define gcd __gcd\n#define dump(x)\n#define dumps(x)\n#define dumpel(v)\n#define input_from_file(f)\n#define output_to_file(f)\n#endif\n\n#endif // 折りたたみ用\n\n\n////-----------------AtCoder 専用-----------------\n//#include <atcoder/all>\n//using namespace atcoder;\n//\n//using mint = modint1000000007;\n////using mint = modint998244353;\n////using mint = modint; // mint::set_mod(m);\n//\n//template <class S, S(*op)(S, S), S(*e)()>ostream& operator<<(ostream& os, segtree<S, op, e> seg) { int n = seg.max_right(0, [](S x) {return true; }); rep(i, n) os << seg.get(i) << \" \"; return os; }\n//template <class S, S(*op)(S, S), S(*e)(), class F, S(*mp)(F, S), F(*cp)(F, F), F(*id)()>ostream& operator<<(ostream& os, lazy_segtree<S, op, e, F, mp, cp, id> seg) { int n = seg.max_right(0, [](S x) {return true; }); rep(i, n) os << seg.get(i) << \" \"; return os; }\n//istream& operator>> (istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\n//ostream& operator<< (ostream& os, const mint& x) { os << x.val(); return os; }\n//using vm = vector<mint>;\tusing vvm = vector<vm>;\t\tusing vvvm = vector<vvm>;\n////----------------------------------------------\n\n\n//【コスト付きグラフの入力（コストは別）】O(|V| + |E|)\n/*\n* 始点 終点 コストの組からなる入力を受け取り，n 頂点 m 辺のグラフを構成する．\n* 辺へのコストの割り当ては別で記録する．\n*\n* n : グラフの頂点の数\n* m : グラフの辺の数\n* g : ここにグラフを構築して返す\n* c : 辺 (s, t) のコストを c[s][t] に格納する\n* directed : 有向グラフなら true\n* one_indexed : 入力が 1-indexed で与えられるなら true\n*/\nvoid read_graph(int n, int m, Graph& g, vector<unordered_map<int, ll>>& c,\n\tbool directed = false, bool one_indexed = true) {\n\tg = Graph(n);\n\tc = vector<unordered_map<int, ll>>(n);\n\trep(i, m) {\n\t\tint a, b; ll x;\n\t\tcin >> a >> b >> x;\n\n\t\tif (one_indexed) { a--; b--; }\n\n\t\tg[a].push_back(b);\n\t\tc[a][b] = x;\n\t\tif (!directed) {\n\t\t\tg[b].push_back(a);\n\t\t\tc[b][a] = x;\n\t\t}\n\t}\n}\n\n\n//【クリークの列挙】O(2^√(2|E|) |V|)\n/*\n* 無向グラフ g の i 番目に見つけたクリークを cs[i] に頂点の列として列挙する．\n* S ⊂ V がクリークであるとは，S の任意の 2 点を結ぶ辺が E に属することをいう．\n*/\nvoid enumerate_clique(const Graph& g, vvi& cs) {\n\t// 参考：https://www.slideshare.net/wata_orz/ss-12131479\n\n\tint n = sz(g);\n\tcs.clear();\n\n\t// 隣接行列 adj，各頂点の次数 deg，総次数 deg_sum，\n\t// 最小次数 deg_min，次数最小頂点の番号 i_min を得る．\n\tvvb adj(n, vb(n));\n\tvi deg(n);\n\tint deg_sum = 0, deg_min = INF, i_min = -1;\n\trep(s, n) {\n\t\tdeg[s] = sz(g[s]);\n\t\tdeg_sum += deg[s];\n\t\trepe(t, g[s]) adj[s][t] = true;\n\n\t\tif (chmin(deg_min, deg[s])) i_min = s;\n\t}\n\n\t// 考慮すべき頂点のリスト\n\tvi v(n);\n\tiota(all(v), 0);\n\n\t// 素朴な方法で最大クリークを求める O(2^n n)\n\tfunction<void()> naive = [&]() {\n\t\t// 全ての部分集合 set について\n\t\trepb(set, n) {\n\t\t\tbool sum = 0;\n\n\t\t\t// n 頂点それぞれについて\n\t\t\trep(i, n) {\n\t\t\t\t// set に選んでいないなら無関係\n\t\t\t\tif (!(set & (1 << i))) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\t// i 番目以降の頂点について\n\t\t\t\trepi(j, i + 1, n - 1) {\n\t\t\t\t\t// set に選んでいないなら無関係 \n\t\t\t\t\tif (!(set & (1 << j))) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// 辺 (v[i], v[j]) がなければクリークでない．\n\t\t\t\t\tif (!adj[v[i]][v[j]]) {\n\t\t\t\t\t\tgoto NEXT_LOOP;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// クリークが見つかったので記録する．\n\t\t\tcs.push_back(vi());\n\t\t\trep(i, n) {\n\t\t\t\tif (set & (1 << i)) {\n\t\t\t\t\tcs.rbegin()->push_back(v[i]);\n\t\t\t\t}\n\t\t\t}\n\n\t\tNEXT_LOOP:;\n\t\t}\n\t};\n\n\tint res = 1;\n\twhile (n > 0) {\n\t\t// 辺に対して頂点が十分少ないなら素朴な方法で構わない．\n\t\tif (deg_min * deg_min >= deg_sum) {\n\t\t\tnaive();\n\t\t\treturn;\n\t\t}\n\n\t\t// 次数最小の頂点 v[i_min] の隣接点の番号の集合を得る．\n\t\t// 同時に v[i_min] に出入りする辺を削除したことにし，各頂点の次数 deg を更新する．\n\t\tvi ia;\n\t\trep(i, n) {\n\t\t\tif (adj[v[i_min]][v[i]]) {\n\t\t\t\tia.push_back(i);\n\n\t\t\t\tdeg[v[i]]--;\n\t\t\t}\n\t\t}\n\t\tint d = sz(ia);\n\n\t\t// まず v[i_min] を含む最大クリークの大きさ res を求める．\n\t\t// v[i_min] の隣接点の部分集合 sub すべてについて\n\t\trepb(sub, d) {\n\t\t\trep(i, d) {\n\t\t\t\t// sub に選んでいないなら無関係\n\t\t\t\tif (!(sub & (1 << i))) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\trepi(j, i + 1, d - 1) {\n\t\t\t\t\t// sub に選んでいないなら無関係\n\t\t\t\t\tif (!(sub & (1 << j))) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\t// sub がクリークでなければ何もしない．\n\t\t\t\t\tif (!adj[v[ia[i]]][v[ia[j]]]) {\n\t\t\t\t\t\tgoto LOOP_END;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// sub がクリークなら v[i_min] と合わせてもクリークとなるので記録する．\n\t\t\tcs.push_back(vi({ v[i_min] }));\n\t\t\trep(i, d) {\n\t\t\t\tif (sub & (1 << i)) {\n\t\t\t\t\tcs.rbegin()->push_back(v[ia[i]]);\n\t\t\t\t}\n\t\t\t}\n\n\t\tLOOP_END:;\n\t\t}\n\n\t\t// v[i_min] を含む最大クリークの大きさは求まったので，\n\t\t// 以降は v[i_min] を含まないクリークだけを考えれば良い．\n\t\t// 頂点 v[i_min] と v[n-1] を交換して n を減らすことで v[i_min] を除去する．\n\t\tswap(v[i_min], v[n - 1]);\n\t\tn--;\n\n\t\t// 総次数 deg_sum，最小次数 deg_min，次数最小頂点の番号 i_min を得る．\n\t\tdeg_sum = 0;\n\t\tdeg_min = INF;\n\t\trep(i, n) {\n\t\t\tif (chmin(deg_min, deg[v[i]])) {\n\t\t\t\ti_min = i;\n\t\t\t}\n\t\t\tdeg_sum += deg[v[i]];\n\t\t}\n\t}\n}\n\n\nint main() {\n//\tinput_from_file(\"input.txt\");\n//\toutput_to_file(\"output.txt\");\n\n\tint n, m;\n\tcin >> n >> m;\n\n\tGraph g;\n\tvector<unordered_map<int, ll>> c;\n\tread_graph(n, m, g, c);\n\tdumpel(g);\n\tdumpel(c);\n\n\tvvi cs;\n\tenumerate_clique(g, cs);\n\tdumpel(cs);\n\n\tll res = 0;\n\trepe(cq, cs) {\n\t\tint k = sz(cq);\n\t\tif (k <= 1) continue;\n\n\t\tll sc = 0;\n\t\trep(i, k) {\n\t\t\tll sat = INFL;\n\t\t\trep(j, k) {\n\t\t\t\tif (i == j) continue;\n\n\t\t\t\tchmin(sat, c[cq[i]][cq[j]]);\n\t\t\t}\n\t\t\tsc += sat;\n\t\t}\n\n\t\tchmax(res, sc);\n\t}\n\n\tcout << res << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4700,"score_of_the_acc":-0.0229,"final_rank":6},{"submission_id":"aoj_2306_5990282","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\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<vector<int>> G(n, vector<int>(n));\n set<vector<int>> st;\n for (int i = 0; i < m; ++i) {\n int u, v, f;\n cin >> u >> v >> f;\n --u, --v;\n if (u > v) swap(u, v);\n G[u][v] = G[v][u] = f;\n st.insert({u, v});\n }\n int ans = 0;\n while (!st.empty()) {\n set<vector<int>> nst;\n for (auto& v : st) {\n int val = 0;\n for (int i : v) {\n int m = 1e9;\n for (int j : v) {\n if (i != j) m = min(m, G[i][j]);\n }\n val += m;\n }\n ans = max(ans, val);\n\n for (int k = 0; k < n; ++k) {\n bool ok = true;\n for (int i : v) {\n if (G[i][k] == 0) {\n ok = false;\n break;\n }\n }\n if (ok) {\n auto u = v;\n u.push_back(k);\n sort(u.begin(), u.end());\n nst.insert(u);\n }\n }\n }\n st.swap(nst);\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":4356,"score_of_the_acc":-0.0233,"final_rank":7},{"submission_id":"aoj_2306_5959738","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//最大クリークが14\n//2^14*14^2 ->\n\nbool S[100];\nint N,M;\nint ans=0;\nvector<vector<int>> F;\n\nvoid dfs(int idx){\n\n if(idx==N){\n vector<int> v;\n for(int i=0;i<N;i++){\n if(S[i]) v.push_back(i);\n }\n if(v.size()==1) return;\n int t=0;\n for(size_t i=0;i<v.size();i++){\n int min_v=MAX;\n for(size_t j=0;j<v.size();j++){\n if(i==j) continue;\n chmin(min_v,F[v[i]][v[j]]);\n }\n t+=min_v;\n }\n chmax(ans,t);\n }else{\n for(int i=idx;i<N;i++){\n bool ok=true;\n for(int j=0;j<i;j++){\n if(S[j] and F[i][j]==0) ok=false;\n }\n if(not ok) continue;\n S[i]=true;\n dfs(i+1);\n S[i]=false;\n }\n dfs(N);\n }\n}\n\nvoid solve(){\n cin>>N>>M;\n F=vmake(N,N,0);\n for(int i=0;i<M;i++){\n int s,t; cin>>s>>t;\n s--; t--;\n cin>>F[s][t];\n F[t][s]=F[s][t];\n }\n dfs(0);\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":30,"memory_kb":3508,"score_of_the_acc":-0.0167,"final_rank":4},{"submission_id":"aoj_2306_5778590","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint N,M;\nint flag[105][105];\nvector<vector<int>>tmp;\n\nvoid dfs(int n,vector<int>res) {\n if(n == N) {\n tmp.push_back(res);\n return;\n }\n bool ok = true;\n for(int i = 0; i < res.size(); i++) {\n if(flag[res[i]][n] == 0) {\n ok = false;\n }\n }\n dfs(n+1,res);\n if(ok) {\n res.push_back(n);\n dfs(n+1,res);\n }\n}\n\nint main() {\n cin >> N >> M;\n for(int i = 0; i < M; i++) {\n int u,v,c;\n cin >> u >> v >> c;\n u--;\n v--;\n flag[u][v] = c;\n flag[v][u] = c;\n }\n dfs(0,{});\n int ans = 0;\n for(int i = 0; i < tmp.size(); i++) {\n int res = 0;\n for(int j = 0; j < tmp[i].size(); j++) {\n int mi = 1001001001;\n for(int k = 0; k < tmp[i].size(); k++) {\n if(tmp[i][j] == tmp[i][k]) {\n continue;\n }\n mi = min(mi,flag[tmp[i][j]][tmp[i][k]]);\n }\n res += mi;\n }\n if(tmp[i].size() == 1) {\n continue;\n }\n ans = max(ans,res);\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":4572,"score_of_the_acc":-0.0211,"final_rank":5},{"submission_id":"aoj_2306_5300799","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, x, n) for(int i = x; i <= n; i++)\n#define rep3(i, x, n) for(int i = x; i >= n; i--)\n#define each(e, v) for(auto &e: v)\n#define pb push_back\n#define eb emplace_back\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n#define sz(x) (int)x.size()\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pil = pair<int, ll>;\nusing pli = pair<ll, int>;\nusing pll = pair<ll, ll>;\nconst int MOD = 1000000007;\n//const int MOD = 998244353;\nconst int inf = (1<<30)-1;\nconst ll INF = (1LL<<60)-1;\ntemplate<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};\ntemplate<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};\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\nset<vector<int>> s;\nvector<vector<int>> es;\nint N, M;\nint ans = 0;\n\nvoid dfs(vector<int> v){\n sort(all(v));\n if(s.count(v)) return;\n s.emplace(v);\n\n int n = sz(v), tmp = 0;\n\n if(n > 1){\n rep(i, n){\n int x = inf;\n rep(j, n){\n if(j == i) continue;\n chmin(x, es[v[i]][v[j]]);\n }\n tmp += x;\n }\n }\n\n chmax(ans, tmp);\n\n vector<int> deg(N, 0);\n\n rep(i, n){\n rep(j, N){\n if(es[v[i]][j] > 0) deg[j]++;\n }\n }\n\n rep(i, N){\n if(deg[i] == n){\n v.eb(i), dfs(v), v.pop_back();\n }\n }\n}\n\nint main(){\n cin >> N >> M;\n\n es.assign(N, vector<int>(N, 0));\n\n rep(i, M){\n int u, v, c; cin >> u >> v >> c; u--, v--;\n es[u][v] = c, es[v][u] = c;\n }\n\n rep(i, N) dfs({i});\n\n cout << ans << '\\n';\n}","accuracy":1,"time_ms":30,"memory_kb":5152,"score_of_the_acc":-0.0397,"final_rank":8},{"submission_id":"aoj_2306_4972333","code_snippet":"#pragma GCC target(\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n// #include<ext/pb_ds/assoc_container.hpp>\n// #include<ext/pb_ds/tree_policy.hpp>\n// #include<ext/pb_ds/tag_and_trait.hpp>\n// using namespace __gnu_pbds;\n// #include<boost/multiprecision/cpp_int.hpp>\n// namespace multiprecisioninteger = boost::multiprecision;\n// using cint=multiprecisioninteger::cpp_int;\nusing namespace std;\nusing ll=long long;\n#define double long double\nusing datas=pair<ll,ll>;\nusing ddatas=pair<double,double>;\nusing tdata=pair<ll,datas>;\nusing vec=vector<ll>;\nusing mat=vector<vec>;\nusing pvec=vector<datas>;\nusing pmat=vector<pvec>;\n// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;\n#define For(i,a,b) for(i=a;i<(ll)b;++i)\n#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)\n#define rep(i,N) For(i,0,N)\n#define rep1(i,N) For(i,1,N)\n#define brep(i,N) bFor(i,N,0)\n#define brep1(i,N) bFor(i,N,1)\n#define all(v) (v).begin(),(v).end()\n#define allr(v) (v).rbegin(),(v).rend()\n#define vsort(v) sort(all(v))\n#define vrsort(v) sort(allr(v))\n#define endl \"\\n\"\n#define eb emplace_back\n#define print(x) cout<<x<<endl\n#define printyes print(\"Yes\")\n#define printno print(\"No\")\n#define printYES print(\"YES\")\n#define printNO print(\"NO\")\n#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?\" \":\"\")<<outi;f=1;}cout<<endl;}while(0)\n#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)\nconst ll mod=1000000007;\n// const ll mod=998244353;\nconst ll inf=1LL<<60;\nconst double PI=acos(-1);\nconst double eps=1e-9;\ntemplate<class T,class E> ostream& operator<<(ostream& os,pair<T,E>& p){return os<<\"(\"<<p.first<<\",\"<<p.second<<\")\";}\ntemplate<class T> ostream& operator<<(ostream& os,const vector<T>& v){\n os<<\"{\";ll i;\n rep(i,v.size()){\n if(i)os<<\",\";\n os<<v[i];\n }\n os<<\"}\";\n return os;\n}\ntemplate<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}\ntemplate<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}\n#ifdef DEBUG\nvoid debugg(){cerr<<endl;}\ntemplate<class T,class... Args>void debugg(const T& x,const Args&... args){cerr<<\" \"<<x;debugg(args...);}\n#define debug(...) cerr<<__LINE__<<\" [\"<<#__VA_ARGS__<<\"]:\",debugg(__VA_ARGS__)\n#else\n#define debug(...) (void(0))\n#endif\n\nvoid startupcpp(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout<<fixed<<setprecision(15);\n}\n\ndouble distance(ddatas x,ddatas y){\n double a=x.first-y.first,b=x.second-y.second;\n return sqrt(a*a+b*b);\n}\n\nll modinv(ll a,ll m=mod) {\n ll b=m,u=1,v=0,t;\n while(b){\n t=a/b;\n a-=t*b; swap(a,b);\n u-=t*v; swap(u,v);\n }\n return (u+m)%m;\n}\n\nll moddevide(ll a,ll b){return (a*modinv(b))%mod;}\n\nvec modncrlistp,modncrlistm;\n\nll modncr(ll n,ll r){\n if(n<r)return 0;\n ll i,size=modncrlistp.size();\n if(size<=n){\n modncrlistp.resize(n+1);\n modncrlistm.resize(n+1);\n if(!size){\n modncrlistp[0]=modncrlistm[0]=1;\n size++;\n }\n For(i,size,n+1){\n modncrlistp[i]=modncrlistp[i-1]*i%mod;\n modncrlistm[i]=modinv(modncrlistp[i]);\n }\n }\n return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;\n}\n\nll modpow(ll a,ll n,ll m=mod){\n ll res=1;\n while(n>0){\n if(n&1)res=res*a%m;\n a=a*a%m;\n n>>=1;\n }\n return res;\n}\n\nll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\n\nll countdigits(ll n){\n ll ans=0;\n while(n){n/=10;ans++;}\n return ans;\n}\n\nll sumdigits(ll n){\n ll ans=0;\n while(n){ans+=n%10;n/=10;}\n return ans;\n}\nll N;\nll ans;\nmat g;\nmap<vec,int> mp;\nvoid solve(vec v){\n vsort(v);\n if(mp[v])return;\n mp[v]=1;\n debug(v);\n ll i,j,K=v.size();\n rep(i,N){\n rep(j,K){\n if(!g[i][v[j]])break;\n }\n if(j==K){\n v.emplace_back(i);\n solve(v);\n v.pop_back();\n }\n }\n if(K>1){\n ll res=0;\n rep(i,K){\n ll x=inf;\n rep(j,K){\n if(i==j)continue;\n chmin(x,g[v[i]][v[j]]);\n }\n res+=x;\n }\n chmax(ans,res);\n }\n}\nint main(){\n startupcpp();\n ll i,j,k,M;\n cin>>N>>M;\n g.resize(N,vec(N,0));\n while(M--){\n cin>>i>>j>>k;\n --i;--j;\n g[j][i]=g[i][j]=k;\n }\n solve(vec());\n print(ans);\n}","accuracy":1,"time_ms":20,"memory_kb":5872,"score_of_the_acc":-0.0445,"final_rank":9},{"submission_id":"aoj_2306_4971122","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define var auto\n\nconst char newl = '\\n';\n\ntemplate<typename T1, typename T2>\ninline bool chmin(T1 &a, T2 b) { bool c = a > b; if (c) a = b; return c; }\ntemplate<typename T1, typename T2>\ninline bool chmax(T1 &a, T2 b) { bool c = a < b; if (c) a = b; return c; }\n\nsigned main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n int n, m;\n cin >> n >> m;\n vector<vector<ll>> mat(n, vector<ll>(n, 0));\n for (int i = 0; i < m; i++){\n int s, t, c;\n cin >> s >> t >> c;\n s--, t--;\n mat[s][t] = c;\n mat[t][s] = c;\n }\n vector<vector<int>> cliques{vector<int>{}};\n for (int i = 0; i < n; i++){\n var newqs = cliques;\n for (var&& clique : cliques){\n bool valid = true;\n for (var&& vert : clique){\n if (mat[vert][i] == 0){\n valid = false;\n break;\n }\n }\n if (!valid) continue;\n var newq = clique;\n newq.emplace_back(i);\n newqs.emplace_back(newq);\n }\n cliques = move(newqs);\n }\n ll res = 0;\n for (var&& clique : cliques){\n ll score = 0;\n for (var&& s : clique){\n ll mn = LLONG_MAX;\n for (var&& t : clique){\n if (s == t) continue;\n chmin(mn, mat[s][t]);\n }\n if (mn == LLONG_MAX) mn = 0;\n score += mn;\n }\n chmax(res, score);\n }\n cout << res << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":7276,"score_of_the_acc":-0.0589,"final_rank":10},{"submission_id":"aoj_2306_4934193","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\nint ans;\nint N,M;\nint d[100][100];\nvoid dfs(int id,vector<int>A)\n{\n\tif(id==N)\n\t{\n\t\tif(A.size()==1)return;\n\t\tint now=0;\n\t\tfor(int a:A)\n\t\t{\n\t\t\tint t=1e9;\n\t\t\tfor(int b:A)if(a!=b)t=min(t,d[a][b]);\n\t\t\tnow+=t;\n\t\t}\n\t\tif(ans<now)ans=now;\n\t\treturn;\n\t}\n\tdfs(id+1,A);\n\tfor(int a:A)if(d[a][id]==0)return;\n\tA.push_back(id);\n\tdfs(id+1,A);\n}\nmain()\n{\n\tcin>>N>>M;\n\tfor(int i=0;i<M;i++)\n\t{\n\t\tint u,v,f;cin>>u>>v>>f;\n\t\tu--,v--;\n\t\td[u][v]=d[v][u]=f;\n\t}\n\tvector<int>fst;\n\tdfs(0,fst);\n\tcout<<ans<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3220,"score_of_the_acc":-0.0022,"final_rank":1},{"submission_id":"aoj_2306_4883511","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-12;\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>>edge(N, vector<int>(N));\n\tfor (int i = 0; i < M; i++) {\n\t\tcin >> L >> R >> K;\n\t\tL--, R--;\n\t\tedge[L][R] = edge[R][L] = K;\n\t}\n\tvector<set<vector<int>>>vs(N + 1);\n\tfor (int i = 0; i < N; i++) {\n\t\tvector<int>w(N);\n\t\tw[i] = 1;\n\t\tvs[1].insert(w);\n\t}\n\tint ans = 0;\n\tfor (int i = 1; i < N; i++) {\n\t\tfor (auto j : vs[i]) {\n\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\tif (j[k])continue;\n\t\t\t\tbool flag = true;\n\t\t\t\tfor (int l = 0; l < N; l++) {\n\t\t\t\t\tif (j[l] && !edge[k][l])flag = false;\n\t\t\t\t}\n\t\t\t\tif (flag) {\n\t\t\t\t\tj[k] = 1;\n\t\t\t\t\tvs[i + 1].insert(j);\n\t\t\t\t\tj[k] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 2; i <= N; i++) {\n\t\tfor (auto j : vs[i]) {\n\t\t\tvector<int>sum(N);\n\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\tif (!j[k])continue;\n\t\t\t\tsum[k] = MOD;\n\t\t\t\tfor (int l = 0; l < N; l++) {\n\t\t\t\t\tif (!j[l])continue;\n\t\t\t\t\tif (k == l)continue;\n\t\t\t\t\tsum[k] = min(sum[k], edge[k][l]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = max(ans, accumulate(sum.begin(), sum.end(), 0));\n\t\t}\n\t}\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":190,"memory_kb":10928,"score_of_the_acc":-0.2037,"final_rank":15},{"submission_id":"aoj_2306_4820400","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint INF = 10000000;\nset<vector<bool>> st;\nint dfs(vector<bool> &used, vector<vector<int>> &E){\n if (st.count(used)){\n return 0;\n }\n st.insert(used);\n int n = E.size();\n int ans = 0;\n for (int i = 0; i < n; i++){\n if (used[i]){\n int mn = INF;\n for (int j = 0; j < n; j++){\n if (used[j] && i != j){\n mn = min(mn, E[i][j]);\n }\n }\n if (mn != INF){\n ans += mn;\n }\n }\n }\n for (int i = 0; i < n; i++){\n bool ok = true;\n for (int j = 0; j < n; j++){\n if (used[j]){\n if (E[i][j] == 0 || i == j){\n ok = false;\n }\n }\n }\n if (ok){\n used[i] = true;\n ans = max(ans, dfs(used, E));\n used[i] = false;\n }\n }\n return ans;\n}\nint main(){\n int n, m;\n cin >> n >> m;\n vector<vector<int>> E(n, vector<int>(n, 0));\n for (int i = 0; i < m; i++){\n int u, v, f;\n cin >> u >> v >> f;\n u--;\n v--;\n E[u][v] = f;\n E[v][u] = f;\n }\n vector<bool> used(n, false);\n cout << dfs(used, E) << endl;\n}","accuracy":1,"time_ms":430,"memory_kb":5024,"score_of_the_acc":-0.2462,"final_rank":16},{"submission_id":"aoj_2306_4256032","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-11L\n#define MAX_MOD 1000000007LL\n#define GYAKU 500000004LL\n\n#define MOD 998244353LL\n#define seg_size 262144\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 iostream::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n}\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//li chao tree by ei1333. It's public available.\n// https://ei1333.github.io/luzhiled/snippets/structure/li-chao-tree.html\n/*\ntemplate< typename T >\nstruct LiChaoTree {\n struct Line {\n T a, b;\n\n Line(T a, T b) : a(a), b(b) {}\n\n inline T get(T x) const { return a * x + b; }\n\n inline bool over(const Line& b, const T& x) const {\n return get(x) < b.get(x);\n }\n };\n\n vector< T > xs;\n vector< Line > seg;\n int sz;\n\n LiChaoTree(const vector< T >& x, T INF) : xs(x) {\n sz = 1;\n while (sz < xs.size()) sz <<= 1;\n while (xs.size() < sz) xs.push_back(xs.back() + 1);\n seg.assign(2 * sz - 1, Line(0, INF));\n }\n\n void update(Line& x, int k, int l, int r) {\n int mid = (l + r) >> 1;\n auto latte = x.over(seg[k], xs[l]), malta = x.over(seg[k], xs[mid]);\n if (malta) swap(seg[k], x);\n if (l + 1 >= r) return;\n else if (latte != malta) update(x, 2 * k + 1, l, mid);\n else update(x, 2 * k + 2, mid, r);\n }\n\n void update(T a, T b) { // ax+b\n Line l(a, b);\n update(l, 0, 0, sz);\n }\n\n T query(int k) { // xs[k]\n const T x = xs[k];\n k += sz - 1;\n T ret = seg[k].get(x);\n while (k > 0) {\n k = (k - 1) >> 1;\n ret = min(ret, seg[k].get(x));\n }\n return ret;\n }\n};\n\n#define int long long\nvoid solve() {\n int n, m;\n cin >> n >> m;\n vector<vector<int>> landmarks;\n vector<vector<int>> costs;\n REP(i, n) {\n vector<int> tmp;\n REP(q, m) {\n int b;\n cin >> b;\n b = xor128() % 10000000;\n tmp.push_back(b);\n }\n landmarks.push_back(tmp);\n }\n REP(i, n) {\n\n vector<int> tmp;\n {\n REP(q, m) {\n int b;\n cin >> b;\n b = xor128() % 100000000;\n tmp.push_back(b);\n }\n }\n costs.push_back(tmp);\n }\n vector<LiChaoTree<int>> yoko; // size should be m\n REP(i, n) {\n vector<int> hoge(m);\n REP(q, m) {\n hoge[q] = q;\n }\n LiChaoTree<int> now(hoge, 1e18);//size should be n\n yoko.push_back(now);\n }\n vector<vector<int>> dp = landmarks;\n for (int q = 0; q < m; ++q) {\n vector<int> hoge(n);\n REP(i, n) {\n hoge[i] = i;\n }\n LiChaoTree<int> now(hoge, 1e18);//size should be n\n\n for (int i = 0; i < n; ++i) {\n int now_min = costs[0][0] * (i + q);\n if (q < 0) {\n int geko = yoko[i].query(q);\n now_min = min(now_min, geko);\n }\n if (i != 0) {\n int geko = now.query(i);\n now_min = min(now_min, geko);\n }\n dp[i][q] = now_min;\n yoko[i].update(costs[i][q], landmarks[i][q] + dp[i][q] - q * costs[i][q]);\n now.update(costs[i][q], landmarks[i][q] + dp[i][q] - i * costs[i][q]);\n }\n }\n\n cout << dp[n - 1][m - 1] << endl;\n}\n*/\n\n#define int ll\nint used[200];\nvector<int> kouho;\nset<pair<int,int>> already;\nint dist[200][200];\nint n, m;\n\nint dfs(int now,pair<int,int> bit) {\n if (now < 50) {\n bit.first += (1LL << now);\n }\n else {\n bit.second += (1LL << (now - 50));\n }\n if (already.count(bit)) {\n return 0;\n }\n used[now] = 1;\n kouho.push_back(now);\n already.insert(bit);\n for (int i = 0; i < n; ++i) {\n if (used[i]) continue;\n int ok = 1;\n REP(q, kouho.size()) {\n if (dist[kouho[q]][i] == 0) {\n ok = 0;\n break;\n }\n }\n if (ok == 0) continue;\n dfs(i, bit);\n }\n kouho.pop_back();\n used[now] = 0;\n return 0;\n}\n\nvoid solve() {\n cin >> n >> m;\n REP(i, m) {\n int a, b, c;\n cin >> a >> b >> c;\n a--; b--;\n dist[a][b] = c;\n dist[b][a] = c;\n }\n int ans = 0;\n REP(i, n) {\n ans = max(ans, dfs(i, pair<int, int>{0, 0}));\n }\n for (auto x : already) {\n vector<int> huku;\n for (int q = 0; q < 51; ++q) {\n if ((1LL << q) & x.first) {\n huku.push_back(q);\n }\n if ((1LL << q) & x.second) {\n huku.push_back(q + 50);\n }\n }\n if (huku.size() == 1) continue;\n int tmp = 0;\n REP(q, huku.size()) {\n int hoge = 1e9;\n REP(j, huku.size()) {\n if (q == j) continue;\n hoge = min(hoge, dist[huku[q]][huku[j]]);\n }\n tmp += hoge;\n }\n ans = max(ans, tmp);\n }\n cout << ans << endl;\n}\n#undef int\nint main() {\n init();\n solve();\n}","accuracy":1,"time_ms":10,"memory_kb":4252,"score_of_the_acc":-0.0167,"final_rank":3},{"submission_id":"aoj_2306_4228355","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(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 = long long;\n\n#define fs first\n#define sc second\n\nconst LL MOD = 1e9+7;\n\nLL next_combination(LL mask) {\n LL x = mask & -mask, y = mask + x;\n return (((mask & ~y) / x) >> 1) | y;\n}\n\nint main()\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n int n, m; cin >> n >> m;\n auto G = make_v<int>(n, n);\n vector<int> deg(n);\n for (int i = 0; i < m; ++i) {\n int u, v, f;\n cin >> u >> v >> f;\n --u, --v;\n G[u][v] = G[v][u] = f;\n ++deg[u], ++deg[v];\n }\n\n int ans = 0;\n\n for (int k = 2; k <= 14; ++k) {\n vector<int> vs;\n for (int i = 0; i < n; ++i) {\n if (deg[i] >= k-1) {\n vs.emplace_back(i);\n }\n }\n\n if (k == 2) {\n for (int a : vs) {\n for (int b : vs) {\n chmax(ans, 2*G[a][b]);\n }\n }\n continue;\n }\n if (k == 3) {\n for (int a : vs) {\n for (int b : vs) {\n for (int c : vs) {\n chmax(ans,\n min(G[a][b],G[a][c]) +\n min(G[b][a],G[b][c]) +\n min(G[c][a],G[c][b])\n );\n }\n }\n }\n continue;\n }\n\n for (LL mask=(1LL<<k)-1; mask < 1LL<<vs.size(); mask=next_combination(mask))\n {\n assert(k <= vs.size());\n\n vector<int> score(n, numeric_limits<int>::max());\n\n for (int i = 0; i < vs.size(); ++i) if (mask >> i & 1) {\n for (int j = i+1; j < vs.size(); ++j) if (mask >> j & 1) {\n chmin(score[vs[i]], G[vs[i]][vs[j]]);\n chmin(score[vs[j]], G[vs[i]][vs[j]]);\n }\n }\n\n int total = 0;\n for (int i = 0; i < vs.size(); ++i) if (mask >> i & 1) {\n total += score[vs[i]];\n }\n chmax(ans, total);\n }\n }\n\n cout << ans << endl;\n\n return 0;\n}","accuracy":1,"time_ms":1720,"memory_kb":3264,"score_of_the_acc":-0.8935,"final_rank":18},{"submission_id":"aoj_2306_4217008","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int, int>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\nconst double eps = 1e-10;\nconst ll MOD = 1000000007;\nconst int INF = 1000000000;\nconst ll LINF = 1ll<<50;\ntemplate<typename T>\nvoid printv(const vector<T>& s) {\n for(int i=0;i<(int)(s.size());++i) {\n cout << s[i];\n if(i == (int)(s.size())-1) cout << endl;\n else cout << \" \";\n }\n}\ntemplate<typename T1, typename T2>\nostream& operator<<(ostream &os, const pair<T1, T2> p) {\n os << p.first << \":\" << p.second;\n return os;\n}\nstruct Edge {\n int from, to, friendliness;\n};\nmap<vector<bool>, int> mp;\nll dfs(int now, vector<bool> &sel, const vector<vector<Edge>> &g, const vvll &d, int n) {\n if(mp[sel] != 0) return mp[sel];\n ll res = 0;\n for(int i=0;i<n;++i) {\n if(!sel[i]) continue;\n ll val = LINF;\n for(int j=0;j<n;++j) {\n if(i == j || !sel[j]) continue;\n val = min(val, d[i][j]);\n }\n if(val == LINF) val = 0;\n res += val;\n }\n for(int i=0;i<(int)(g[now].size());++i) {\n int nxt = g[now][i].to;\n if(sel[nxt]) continue;\n bool ok = true;\n for(int j=0;j<n;++j) {\n if(j == nxt) continue;\n if(sel[j] && d[nxt][j] == 0) {\n ok = false;\n break;\n }\n }\n if(ok) {\n sel[nxt] = true;\n res = max(res, dfs(nxt, sel, g, d, n));\n sel[nxt] = false;\n }\n }\n return mp[sel] = res;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n int n, m; cin >> n >> m;\n vector<vector<Edge>> g(n);\n vvll d(n, vll(n, 0));\n for(int i=0;i<m;++i) {\n int u, v, f; cin >> u >> v >> f;\n u--; v--;\n g[u].push_back({u, v, f});\n g[v].push_back({v, u, f});\n d[u][v] = f;\n d[v][u] = f;\n }\n vector<bool> sel(n, false);\n ll ans = 0;\n for(int i=0;i<n;++i) {\n sel[i] = true;\n ans = max(ans, dfs(i, sel, g, d, n));\n sel[i] = false;\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":440,"memory_kb":5320,"score_of_the_acc":-0.2555,"final_rank":17},{"submission_id":"aoj_2306_4143122","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define all(x) (x).begin(),(x).end()\nconst int mod=998244353,MAX=103,INF=1<<30;\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,M;cin>>N>>M;\n vector<vector<int>> A(N,vector<int>(N));\n \n for(int i=0;i<M;i++){\n int a,b,c;cin>>a>>b>>c;\n a--;b--;\n A[a][b]=c;\n A[b][a]=c;\n }\n \n int ans=0;\n \n set<vector<int>> SE;\n \n for(int i=0;i<N;i++){\n for(int j=i+1;j<N;j++){\n if(A[i][j]){\n ans=max(ans,A[i][j]*2);\n vector<int> use(N);\n use[i]=1;\n use[j]=1;\n SE.insert(use);\n }\n }\n }\n \n for(int q=2;q<15;q++){\n if(SE.empty()) break;\n \n set<vector<int>> ne;\n \n for(auto it=SE.begin();it!=SE.end();it++){\n for(int i=0;i<N;i++){\n if((*it)[i]) continue;\n bool ok=true;\n \n for(int j=0;j<N;j++){\n if(i==j) continue;\n if((*it)[j]&&A[i][j]==0){\n ok=false;\n break;\n }\n }\n \n if(ok){\n vector<int> S=*it;\n S[i]=1;\n int sum=0;\n for(int j=0;j<N;j++){\n if(S[j]==0) continue;\n int mini=INF;\n for(int k=0;k<N;k++){\n if(S[k]==0) continue;\n if(j==k) continue;\n if(A[j][k]) mini=min(mini,A[j][k]);\n }\n sum+=mini;\n }\n \n ans=max(ans,sum);\n \n ne.insert(S);\n }\n }\n }\n \n SE=ne;\n }\n \n cout<<ans<<endl;\n}","accuracy":1,"time_ms":200,"memory_kb":6480,"score_of_the_acc":-0.1468,"final_rank":13},{"submission_id":"aoj_2306_4142225","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\ntemplate <typename T>\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>\nbool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//const ll mod = 1000000007;\nint N, M;\nbitset<100> bits[100];\nbitset<100> Zero;\nint A[100][100];\nint ans;\nvoid dfs(bitset<100> now, bitset<100> can, int vertex) {\n /*\n cerr << \"-----\" << endl;\n cerr << now << endl;\n cerr << can << endl;\n cerr << vertex << endl;\n cerr << \"-----\" << endl;\n */\n if(now.count() >= 2) {\n int score = 0;\n for(int i = 0; i < N; i++) {\n if(!now[i]) continue;\n int nowscore = 1e9;\n for(int j = 0; j < N; j++) {\n if(!now[j]) continue;\n if(i == j) continue;\n chmin(nowscore, A[i][j]);\n }\n score += nowscore;\n }\n chmax(ans, score);\n }\n for(int i = vertex; i < N; i++) {\n if(!can[i]) {\n //cerr << \"ng: \" << vertex << \" \" << i << endl;\n continue;\n }\n auto sub = now;\n sub[i] = true;\n auto sub2 = can;\n sub2 &= bits[i];\n //cerr << \"ok : \" << vertex << \" \" << i << endl;\n dfs(sub, sub2, i + 1);\n }\n}\n\nint main() {\n //cout.precision(10);\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> N >> M;\n for(int i = 0; i < M; i++) {\n int a, b, c;\n cin >> a >> b >> c;\n a--;\n b--;\n A[a][b] = c;\n A[b][a] = c;\n bits[a][b] = true;\n bits[b][a] = true;\n }\n bitset<100> One;\n for(int i = 0; i < N; i++) One[i] = true;\n dfs(Zero, One, 0);\n cout << ans << endl;\n /*\n for(int i = 0; i < N; i++) {\n cerr << bits[i] << endl;\n }\n */\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3256,"score_of_the_acc":-0.0027,"final_rank":2},{"submission_id":"aoj_2306_3917190","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 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//INSERT ABOVE HERE\nconst int MAX = 111;\nint es[MAX][MAX]={};\nsigned main(){\n int n,m;\n cin>>n>>m;\n for(int i=0;i<m;i++){\n int u,v,w;\n cin>>u>>v>>w;\n u--;v--;\n es[u][v]=es[v][u]=w;\n }\n\n int ans=0;\n vector<int> used(n,0);\n MFP([&](auto dfs,int v)->void{\n int res=0,cnt=0;\n for(int i=0;i<n;i++){\n if(!used[i]) continue;\n cnt++;\n int tmp=1e9;\n for(int j=0;j<n;j++)\n if(i!=j&&used[j]) chmin(tmp,es[i][j]);\n if(tmp==0) return;\n res+=tmp;\n }\n if(cnt>1) chmax(ans,res);\n\n if(v==n) return;\n\n used[v]=1;\n dfs(v+1);\n used[v]=0;\n dfs(v+1);\n })(0);\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":390,"memory_kb":3132,"score_of_the_acc":-0.1989,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_2306_10690753\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\nint N, M, ST, gans, ans, hg1, ohg1;\\nint jiyou[120][120], val[200], oval[300];\\nbool used[1000];\\n\\nint getans()\\n{\\n\\tint i, res = 0, nc = 0;\\n\\tfor (i = ST; i <= N; ++i)\\n\\t\\tif (used[i])\\n\\t\\t{\\n\\t\\t\\t++nc;\\n\\t\\t\\tres += val[i];\\n\\t\\t}\\n\\tif (nc < 2) return 0;\\n\\treturn res;\\n}\\n\\nvoid dfs(int x);\\n\\nint main()\\n{\\n\\tint i, j, k, x, y, l;\\n\\tmemset(jiyou, 0, sizeof(jiyou));\\n\\tscanf(\\\"%d%d\\\", &N, &M);\\n\\tfor (i = 0; i < M; ++i)\\n\\t{\\n\\t\\tscanf(\\\"%d%d%d\\\", &x, &y, &l);\\n\\t\\tjiyou[x][y] = l;\\n\\t\\tjiyou[y][x] = l;\\n\\t}\\n\\tfor (i = 1; i < N; ++i)\\n\\t{\\n\\t\\tST = i;\\n\\t\\tans = 0;\\n\\t\\tmemset(used, 0, sizeof(used));\\n\\t\\tmemset(val, 127, sizeof(val));\\n\\t\\tused[i] = true;\\n\\t\\tdfs(i+1);\\n\\t}\\n\\tprintf(\\\"%d\\\\n\\\", gans);\\n\\treturn 0;\\n}\\n\\nvoid dfs(int x)\\n{\\n\\tint i, haogandu = 10000000;\\n\\tif (x > N)\\n\\t{\\n\\t\\tgans = max(gans, getans());\\n\\t\\treturn;\\n\\t}\\n\\tfor (i = ST; i <= N; ++i)\\n\\t\\tif (used[i])\\n\\t\\t\\thaogandu = min(haogandu, jiyou[x][i]);\\n\\tif (haogandu)\\n\\t{\\n\\t\\tfor (i = ST; i <= N; ++i)\\n\\t\\t\\toval[i] = val[i];\\n\\t\\tval[x] = haogandu;\\n\\t\\tfor (i = ST; i <= N; ++i)\\n\\t\\t\\tif (used[i])\\n\\t\\t\\t{\\n\\t\\t\\t\\tval[i] = min(val[i], jiyou[x][i]);\\n\\t\\t\\t\\tif (i > ST)\\n\\t\\t\\t\\t\\tval[ST] = min(val[ST], jiyou[i][ST]);\\n\\t\\t\\t}\\n\\t\\tgans = max(gans, getans());\\n\\t\\tused[x] = true;\\n\\t\\tdfs(x+1);\\n\\t\\tused[x] = false;\\n\\t\\tfor (i = ST; i <= N; ++i)\\n\\t\\t\\tval[i] = oval[i];\\n\\t}\\n\\tdfs(x+1);\\n}\",\n \"accuracy\": 0.4727272727272727,\n \"time_ms\": 20,\n \"memory_kb\": 3060,\n \"score_of_the_acc\": -0.0052,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2306_8302655\",\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\\nbool is_end = false;\\nmt19937 engine(42);\\n\\nvoid calc()\\n{\\n\\tint N, M; cin >> N >> M;\\n\\tvector<bool> has_friends(N, false);\\n\\tvector<vector<int>> weight(N, vector<int>(N, 0));\\n\\tfor (int i = 0; i < M; ++i)\\n\\t{\\n\\t\\tint a, b, f; cin >> a >> b >> f;\\n\\t\\ta--, b--;\\n\\t\\thas_friends[a] = has_friends[b] = true;\\n\\t\\tweight[a][b] = weight[b][a] = f;\\n\\t}\\n\\t\\n\\tvector<int> perm;\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tif (has_friends[i]) {perm.emplace_back(i);}\\n\\t}\\n\\t\\n\\tint cnt = 0;\\n\\tint res = 0;\\n\\twhile (cnt < 100000)\\n\\t{\\n\\t\\tcnt++;\\n\\t\\tshuffle(perm.begin(), perm.end(), engine);\\n\\t\\tvector<int> cleak;\\n\\t\\t\\n\\t\\tfor (auto v : perm)\\n\\t\\t{\\n\\t\\t\\tbool flg = true;\\n\\t\\t\\tfor (auto c : cleak)\\n\\t\\t\\t{\\n\\t\\t\\t\\tflg &= (weight[v][c] > 0);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tif (!flg) {continue;}\\n\\t\\t\\tcleak.emplace_back(v);\\n\\t\\t\\t\\n\\t\\t\\tif (cleak.size() == 1) {continue;}\\n\\t\\t\\t\\n\\t\\t\\tint tmp = 0;\\n\\t\\t\\tfor (auto c : cleak)\\n\\t\\t\\t{\\n\\t\\t\\t\\tint mn = 1e9;\\n\\t\\t\\t\\tfor (auto d : cleak)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tif (c != d) {mn = min(mn, weight[c][d]);}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ttmp += mn;\\n\\t\\t\\t}\\n\\t\\t\\tres = max(res, tmp);\\n\\t\\t}\\n\\t}\\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\": 120,\n \"memory_kb\": 3472,\n \"score_of_the_acc\": -0.0631,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2306_8020162\",\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#define int ll\\n\\ntemplate <class T, class... Ts>\\nvoid OUT(const T &a, const Ts &...b) {\\n cout << a;\\n (cout << ... << (cout << \\\" \\\", b));\\n cout << endl;\\n}\\n\\ntemplate <class T>\\nvoid DEBUG_(string_view name, const T &a) {\\n cout << name << \\\": \\\" << a << endl;\\n}\\n\\ntemplate <class 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 <class T, class U>\\nbool chmax(T &x, const U &y) {\\n return x < y ? x = y, 1 : 0;\\n}\\ntemplate <class T, class U>\\nbool chmin(T &x, const U &y) {\\n return x > y ? x = y, 1 : 0;\\n}\\n\\ntemplate <class T>\\nusing minheap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <class T>\\nusing maxheap = priority_queue<T>;\\n\\nconst vl dy = {1, 0, -1, 0, 1, -1, -1, 1};\\nconst vl dx = {0, 1, 0, -1, 1, 1, -1, -1};\\n\\ntemplate <class T = ll>\\nstruct Edge {\\n ll from, to;\\n T cost;\\n ll idx;\\n Edge(ll f, ll t, T c = 1, ll i = -1) : from(f), to(t), cost(c), idx(i) {}\\n operator int() const { return to; }\\n};\\n\\ntemplate <class T = ll>\\nstruct Graph {\\n vector<vector<Edge<T>>> g;\\n ll es;\\n explicit Graph(ll n) : g(n), es(0) {}\\n size_t size() const { return sz(g); }\\n void add_directed_edge(ll from, ll to, T cost = 1) {\\n g[from].eb(from, to, cost, es++);\\n }\\n void add_edge(ll from, ll to, T cost = 1) {\\n g[from].eb(from, to, cost, es);\\n g[to].eb(to, from, cost, es++);\\n }\\n inline vector<Edge<T>> &operator[](const int &k) { return g[k]; }\\n inline const vector<Edge<T>> &operator[](const int &k) const {\\n return g[k];\\n }\\n};\\n\\n//-----------------------------------------------------------------------\\n\\nvoid solve() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(15);\\n\\n int N, M;\\n cin >> N >> M;\\n vvl Fs(N, vl(N, 0));\\n set<vl> clique;\\n ll ans = 0;\\n REP(i, M) {\\n int u, v, f;\\n cin >> u >> v >> f;\\n u--;\\n v--;\\n Fs[u][v] = f;\\n Fs[v][u] = f;\\n clique.insert({u, v});\\n chmax(ans, 2 * f);\\n }\\n\\n auto calcScore = [&](const vl &clique) -> ll {\\n // DEBUG(clique);\\n ll ans = 0;\\n EACH(c1, clique) {\\n ll ans2 = INFL;\\n EACH(c2, clique) {\\n if (c1 == c2) continue;\\n chmin(ans2, Fs[c1][c2]);\\n }\\n ans += ans2;\\n }\\n // DEBUG(ans);\\n return ans;\\n };\\n\\n while (!clique.empty()) {\\n // DEBUG(clique.size());\\n set<vl> newClique;\\n EACH(c, clique) {\\n REP(nv, N) {\\n if (find(ALL(c), nv) != c.end()) {\\n continue;\\n }\\n bool ok = true;\\n EACH(v, c) {\\n if (Fs[v][nv] == 0) {\\n ok = false;\\n break;\\n }\\n }\\n if (!ok) continue;\\n vl newC = c;\\n newC.insert(lower_bound(ALL(newC), nv), nv);\\n chmax(ans, calcScore(newC));\\n newClique.insert(newC);\\n }\\n }\\n swap(clique, newClique);\\n }\\n\\n cout << ans << endl;\\n}\\n\\nsigned main() {\\n int T = 1;\\n // cin >> T;\\n\\n while (T--) solve();\\n\\n // random_test();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1930,\n \"memory_kb\": 74600,\n \"score_of_the_acc\": -2,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2306_6793059\",\n \"code_snippet\": \"/**\\n * author: otera\\n**/\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing int128_t = __int128_t;\\n#define repa(i, n) for(int i = 0; i < n; ++ i)\\n#define repb(i, a, b) for(int i = a; i < b; ++ i)\\n#define repc(i, a, b, c) for(int i = a; i < b; i += c)\\n#define overload4(a, b, c, d, e, ...) e\\n#define overload3(a, b, c, d, ...) d\\n#define rep(...) overload4(__VA_ARGS__, repc, repb, repa)(__VA_ARGS__)\\n#define rep1a(i, n) for(int i = 0; i <= n; ++ i)\\n#define rep1b(i, a, b) for(int i = a; i <= b; ++ i)\\n#define rep1c(i, a, b, c) for(int i = a; i <= b; i += c)\\n#define rep1(...) overload4(__VA_ARGS__, rep1c, rep1b, rep1a)(__VA_ARGS__)\\n#define rev_repa(i, n) for(int i=n-1;i>=0;i--)\\n#define rev_repb(i, a, b) assert(a > b);for(int i=a;i>b;i--)\\n#define rev_rep(...) overload3(__VA_ARGS__, rev_repb, rev_repa)(__VA_ARGS__)\\n#define rev_rep1a(i, n) for(int i=n;i>=1;i--)\\n#define rev_rep1b(i, a, b) assert(a >= b);for(int i=a;i>=b;i--)\\n#define rev_rep1(...) overload3(__VA_ARGS__, rev_rep1b, rev_rep1a)(__VA_ARGS__)\\ntypedef pair<int, int> P;\\ntypedef pair<ll, ll> LP;\\n#define pb push_back\\n#define pf push_front\\n#define ppb pop_back\\n#define ppf pop_front\\n#define eb emplace_back\\n#define fr first\\n#define sc second\\n#define all(c) c.begin(),c.end()\\n#define rall(c) c.rbegin(), c.rend()\\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define Sort(a) sort(all(a))\\n#define Rev(a) reverse(all(a))\\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define si(c) (int)(c).size()\\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\\n#define kth_bit(x, k) ((x>>k)&1)\\n#define unless(A) if(!(A))\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll intpow(ll a, ll b, ll m) {ll ans = 1; while(b){ if(b & 1) (ans *= a) %= m; (a *= a) %= m; b /= 2; } return ans; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\\n#define VEC(type,name,size) vector<type>name(size);in(name)\\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\\ntemplate <class T> using vc = vector<T>;\\ntemplate <class T> using vvc = vector<vc<T>>;\\ntemplate <class T> using vvvc = vector<vvc<T>>;\\ntemplate <class T> using vvvvc = vector<vvvc<T>>;\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T, class U> using umap = unordered_map<T, U>;\\ntemplate<class T> void scan(T& a){ cin >> a; }\\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\\nvoid in(){}\\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){ scan(head); in(tail...); }\\nvoid print(){ cout << ' '; }\\ntemplate<class T> void print(const T& a){ cout << a; }\\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ cout << ' '; print(*i); } }\\nint out(){ cout << '\\\\n'; return 0; }\\ntemplate<class T> int out(const T& t){ print(t); cout << '\\\\n'; return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); cout << ' '; out(tail...); return 0; }\\n#define CHOOSE(a) CHOOSE2 a\\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\\n#define debug_1(x1) cout<<#x1<<\\\": \\\"<<x1<<endl\\n#define debug_2(x1,x2) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<endl\\n#define debug_3(x1,x2,x3) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<endl\\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<endl\\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<\\\", \\\"#x5<<\\\": \\\"<<x5<<endl\\n#ifdef DEBUG\\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\\n#define dump(...) { print(#__VA_ARGS__); print(\\\":\\\"); out(__VA_ARGS__); }\\n#else\\n#define debug(...)\\n#define dump(...)\\n#endif\\n\\nstruct io_setup {\\n io_setup(int precision = 20) {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n cout << fixed << setprecision(precision);\\n }\\n} io_setup_ {};\\n\\nconst int inf = 1e9 + 7;\\n\\nvoid solve() {\\n INT(n, m);\\n vvc<P> g(n);\\n vvc<int> h(n, vc<int>(n, 0));\\n rep(i, m) {\\n INT(u, v, f); -- u, -- v;\\n g[u].eb(v, f);\\n g[v].eb(u, f);\\n h[u][v] = h[v][u] = f; \\n }\\n int ans = 0;\\n auto dfs = [&](auto&&dfs, vc<int> used, int i) -> void {\\n int ret = 0;\\n bool ok = 1;\\n int cnt = 0;\\n for(int x = 0; x < i; ++ x) {\\n if(used[x]) {\\n ++ cnt;\\n int now = inf;\\n for(int y = 0; y < i; ++ y) {\\n if(y != x && used[y]) chmin(now, h[x][y]);\\n }\\n if(now == inf) ok = 0;\\n ret += now;\\n }\\n }\\n if(cnt >= 2 && !ok) return;\\n if(ok) chmax(ans, ret);\\n if(i == n) return;\\n dfs(dfs, used, i + 1);\\n ok = 1;\\n if(cnt >= 1) {\\n rep(x, i) {\\n if(used[x]) {\\n if(h[x][i] == 0) ok = 0;\\n }\\n }\\n }\\n used[i] = 1;\\n if(ok) dfs(dfs, used, i + 1);\\n used[i] = 0;\\n return;\\n };\\n vc<int> cur(n, 0);\\n dfs(dfs, cur, 0);\\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\": 240,\n \"memory_kb\": 3644,\n \"score_of_the_acc\": -0.128,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2306_6176777\",\n \"code_snippet\": \"#ifndef HIDDEN_IN_VISUAL_STUDIO // 折りたたみ用\\n\\n// 警告の抑制\\n#define _CRT_SECURE_NO_WARNINGS\\n\\n// ライブラリの読み込み\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 型名の短縮\\nusing ll = long long; // -2^63 ～ 2^63 = 9 * 10^18（int は -2^31 ～ 2^31 = 2 * 10^9）\\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>;\\nusing vl = vector<ll>;\\t\\tusing vvl = vector<vl>;\\t\\tusing vvvl = vector<vvl>;\\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 = 3.14159265359;\\nconst double DEG = PI / 180.; // θ [deg] = θ * DEG [rad]\\nconst vi dx4 = { 1, 0, -1, 0 }; // 4 近傍（下，右，上，左）\\nconst vi dy4 = { 0, 1, 0, -1 };\\nconst vi dx8 = { 1, 1, 0, -1, -1, -1, 0, 1 }; // 8 近傍\\nconst vi dy8 = { 0, 1, 1, 1, 0, -1, -1, -1 };\\nconst int INF = 1001001001; const ll INFL = 2002002002002002002LL;\\nconst double EPS = 1e-10; // 許容誤差に応じて調整\\n\\n// 入出力高速化\\nstruct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } fastIOtmp;\\n\\n// 汎用マクロの定義\\n#define all(a) (a).begin(), (a).end()\\n#define sz(x) ((int)(x).size())\\n#define distance (int)distance\\n#define Yes(b) {cout << ((b) ? \\\"Yes\\\" : \\\"No\\\") << endl;}\\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 < (1 << int(d)); ++set) // d ビット全探索（昇順）\\n#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て（昇順）\\n#define repit(it, a) for(auto it = (a).begin(); it != (a).end(); ++it) // イテレータを回す（昇順）\\n#define repitr(it, a) for(auto it = (a).rbegin(); it != (a).rend(); ++it) // イテレータを回す（降順）\\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\\n\\n// 汎用関数の定義\\ntemplate <class T> inline ll pow(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 を返す）\\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, class U> inline ostream& operator<< (ostream& os, const pair<T, U>& p) { os << \\\"(\\\" << p.first << \\\",\\\" << p.second << \\\")\\\"; return os; }\\ntemplate <class T, class U, class V> inline istream& operator>> (istream& is, tuple<T, U, V>& t) { is >> get<0>(t) >> get<1>(t) >> get<2>(t); return is; }\\ntemplate <class T, class U, class V> inline ostream& operator<< (ostream& os, const tuple<T, U, V>& t) { os << \\\"(\\\" << get<0>(t) << \\\",\\\" << get<1>(t) << \\\",\\\" << get<2>(t) << \\\")\\\"; return os; }\\ntemplate <class T, class U, class V, class W> inline istream& operator>> (istream& is, tuple<T, U, V, W>& t) { is >> get<0>(t) >> get<1>(t) >> get<2>(t) >> get<3>(t); return is; }\\ntemplate <class T, class U, class V, class W> inline ostream& operator<< (ostream& os, const tuple<T, U, V, W>& t) { os << \\\"(\\\" << get<0>(t) << \\\",\\\" << get<1>(t) << \\\",\\\" << get<2>(t) << \\\",\\\" << get<3>(t) << \\\")\\\"; return os; }\\ntemplate <class T> inline istream& operator>> (istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }\\ntemplate <class T> inline ostream& operator<< (ostream& os, const vector<T>& v) { repe(x, v) os << x << \\\" \\\"; return os; }\\ntemplate <class T> inline ostream& operator<< (ostream& os, const list<T>& v) { repe(x, v) os << x << \\\" \\\"; return os; }\\ntemplate <class T> inline ostream& operator<< (ostream& os, const set<T>& s) { repe(x, s) os << x << \\\" \\\"; return os; }\\ntemplate <class T> inline ostream& operator<< (ostream& os, const set<T, greater<T>>& s) { repe(x, s) os << x << \\\" \\\"; return os; }\\ntemplate <class T> inline ostream& operator<< (ostream& os, const unordered_set<T>& s) { repe(x, s) os << x << \\\" \\\"; return os; }\\ntemplate <class T, class U> inline ostream& operator<< (ostream& os, const map<T, U>& m) { repe(p, m) os << p << \\\" \\\"; return os; }\\ntemplate <class T, class U> inline ostream& operator<< (ostream& os, const unordered_map<T, U>& m) { repe(p, m) os << p << \\\" \\\"; return os; }\\ntemplate <class T> inline ostream& operator<< (ostream& os, stack<T> s) { while (!s.empty()) { os << s.top() << \\\" \\\"; s.pop(); } return os; }\\ntemplate <class T> inline ostream& operator<< (ostream& os, queue<T> q) { while (!q.empty()) { os << q.front() << \\\" \\\"; q.pop(); } return os; }\\ntemplate <class T> inline ostream& operator<< (ostream& os, deque<T> q) { while (!q.empty()) { os << q.front() << \\\" \\\"; q.pop_front(); } return os; }\\ntemplate <class T> inline ostream& operator<< (ostream& os, priority_queue<T> q) { while (!q.empty()) { os << q.top() << \\\" \\\"; q.pop(); } return os; }\\ntemplate <class T> inline ostream& operator<< (ostream& os, priority_queue_rev<T> q) { while (!q.empty()) { os << q.top() << \\\" \\\"; q.pop(); } return os; }\\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { rep(_i_, sz(v)) --v[_i_]; return v; }\\n\\n// 手元環境（Visual Studio）\\n#ifdef _MSC_VER\\n#define popcount (int)__popcnt // 全ビット中の 1 の個数\\n#define popcountll (int)__popcnt64\\ninline int lsb(unsigned int n) { unsigned long i; _BitScanForward(&i, n); return i; } // 最下位ビットの位置（0-indexed）\\ninline int lsbll(unsigned long long n) { unsigned long i; _BitScanForward64(&i, n); return i; }\\ninline int msb(unsigned int n) { unsigned long i; _BitScanReverse(&i, n); return i; } // 最上位ビットの位置（0-indexed）\\ninline int msbll(unsigned long long n) { unsigned long i; _BitScanReverse64(&i, n); return i; }\\ntemplate <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }\\n#define dump(x) cout << \\\"\\\\033[1;36m\\\" << (x) << \\\"\\\\033[0m\\\" << endl;\\n#define dumps(x) cout << \\\"\\\\033[1;36m\\\" << (x) << \\\"\\\\033[0m \\\";\\n#define dumpel(a) { int _i_ = -1; cout << \\\"\\\\033[1;36m\\\"; repe(x, a) {cout << ++_i_ << \\\": \\\" << x << endl;} cout << \\\"\\\\033[0m\\\"; }\\n#define input_from_file(f) ifstream isTMP(f); cin.rdbuf(isTMP.rdbuf());\\n#define output_to_file(f) ofstream osTMP(f); cout.rdbuf(osTMP.rdbuf());\\n// 提出用（gcc）\\n#else\\n#define popcount (int)__builtin_popcount\\n#define popcountll (int)__builtin_popcountll\\n#define lsb __builtin_ctz\\n#define lsbll __builtin_ctzll\\n#define msb(n) (31 - __builtin_clz(n))\\n#define msbll(n) (63 - __builtin_clzll(n))\\n#define gcd __gcd\\n#define dump(x)\\n#define dumps(x)\\n#define dumpel(v)\\n#define input_from_file(f)\\n#define output_to_file(f)\\n#endif\\n\\n#endif // 折りたたみ用\\n\\n\\n////-----------------AtCoder 専用-----------------\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n//\\n//using mint = modint1000000007;\\n////using mint = modint998244353;\\n////using mint = modint; // mint::set_mod(m);\\n//\\n//template <class S, S(*op)(S, S), S(*e)()>ostream& operator<<(ostream& os, segtree<S, op, e> seg) { int n = seg.max_right(0, [](S x) {return true; }); rep(i, n) os << seg.get(i) << \\\" \\\"; return os; }\\n//template <class S, S(*op)(S, S), S(*e)(), class F, S(*mp)(F, S), F(*cp)(F, F), F(*id)()>ostream& operator<<(ostream& os, lazy_segtree<S, op, e, F, mp, cp, id> seg) { int n = seg.max_right(0, [](S x) {return true; }); rep(i, n) os << seg.get(i) << \\\" \\\"; return os; }\\n//istream& operator>> (istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }\\n//ostream& operator<< (ostream& os, const mint& x) { os << x.val(); return os; }\\n//using vm = vector<mint>;\\tusing vvm = vector<vm>;\\t\\tusing vvvm = vector<vvm>;\\n////----------------------------------------------\\n\\n\\n//【コスト付きグラフの入力（コストは別）】O(|V| + |E|)\\n/*\\n* 始点 終点 コストの組からなる入力を受け取り，n 頂点 m 辺のグラフを構成する．\\n* 辺へのコストの割り当ては別で記録する．\\n*\\n* n : グラフの頂点の数\\n* m : グラフの辺の数\\n* g : ここにグラフを構築して返す\\n* c : 辺 (s, t) のコストを c[s][t] に格納する\\n* directed : 有向グラフなら true\\n* one_indexed : 入力が 1-indexed で与えられるなら true\\n*/\\nvoid read_graph(int n, int m, Graph& g, vector<unordered_map<int, ll>>& c,\\n\\tbool directed = false, bool one_indexed = true) {\\n\\tg = Graph(n);\\n\\tc = vector<unordered_map<int, ll>>(n);\\n\\trep(i, m) {\\n\\t\\tint a, b; ll x;\\n\\t\\tcin >> a >> b >> x;\\n\\n\\t\\tif (one_indexed) { a--; b--; }\\n\\n\\t\\tg[a].push_back(b);\\n\\t\\tc[a][b] = x;\\n\\t\\tif (!directed) {\\n\\t\\t\\tg[b].push_back(a);\\n\\t\\t\\tc[b][a] = x;\\n\\t\\t}\\n\\t}\\n}\\n\\n\\n//【クリークの列挙】O(2^√(2|E|) |V|)\\n/*\\n* 無向グラフ g の i 番目に見つけたクリークを cs[i] に頂点の列として列挙する．\\n* S ⊂ V がクリークであるとは，S の任意の 2 点を結ぶ辺が E に属することをいう．\\n*/\\nvoid enumerate_clique(const Graph& g, vvi& cs) {\\n\\t// 参考：https://www.slideshare.net/wata_orz/ss-12131479\\n\\n\\tint n = sz(g);\\n\\tcs.clear();\\n\\n\\t// 隣接行列 adj，各頂点の次数 deg，総次数 deg_sum，\\n\\t// 最小次数 deg_min，次数最小頂点の番号 i_min を得る．\\n\\tvvb adj(n, vb(n));\\n\\tvi deg(n);\\n\\tint deg_sum = 0, deg_min = INF, i_min = -1;\\n\\trep(s, n) {\\n\\t\\tdeg[s] = sz(g[s]);\\n\\t\\tdeg_sum += deg[s];\\n\\t\\trepe(t, g[s]) adj[s][t] = true;\\n\\n\\t\\tif (chmin(deg_min, deg[s])) i_min = s;\\n\\t}\\n\\n\\t// 考慮すべき頂点のリスト\\n\\tvi v(n);\\n\\tiota(all(v), 0);\\n\\n\\t// 素朴な方法で最大クリークを求める O(2^n n)\\n\\tfunction<void()> naive = [&]() {\\n\\t\\t// 全ての部分集合 set について\\n\\t\\trepb(set, n) {\\n\\t\\t\\tbool sum = 0;\\n\\n\\t\\t\\t// n 頂点それぞれについて\\n\\t\\t\\trep(i, n) {\\n\\t\\t\\t\\t// set に選んでいないなら無関係\\n\\t\\t\\t\\tif (!(set & (1 << i))) {\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t// i 番目以降の頂点について\\n\\t\\t\\t\\trepi(j, i + 1, n - 1) {\\n\\t\\t\\t\\t\\t// set に選んでいないなら無関係 \\n\\t\\t\\t\\t\\tif (!(set & (1 << j))) {\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t// 辺 (v[i], v[j]) がなければクリークでない．\\n\\t\\t\\t\\t\\tif (!adj[v[i]][v[j]]) {\\n\\t\\t\\t\\t\\t\\tgoto NEXT_LOOP;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t// クリークが見つかったので記録する．\\n\\t\\t\\tcs.push_back(vi());\\n\\t\\t\\trep(i, n) {\\n\\t\\t\\t\\tif (set & (1 << i)) {\\n\\t\\t\\t\\t\\tcs.rbegin()->push_back(v[i]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\tNEXT_LOOP:;\\n\\t\\t}\\n\\t};\\n\\n\\tint res = 1;\\n\\twhile (n > 0) {\\n\\t\\t// 辺に対して頂点が十分少ないなら素朴な方法で構わない．\\n\\t\\tif (deg_min * deg_min >= deg_sum) {\\n\\t\\t\\tnaive();\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\n\\t\\t// 次数最小の頂点 v[i_min] の隣接点の番号の集合を得る．\\n\\t\\t// 同時に v[i_min] に出入りする辺を削除したことにし，各頂点の次数 deg を更新する．\\n\\t\\tvi ia;\\n\\t\\trep(i, n) {\\n\\t\\t\\tif (adj[v[i_min]][v[i]]) {\\n\\t\\t\\t\\tia.push_back(i);\\n\\n\\t\\t\\t\\tdeg[v[i]]--;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint d = sz(ia);\\n\\n\\t\\t// まず v[i_min] を含む最大クリークの大きさ res を求める．\\n\\t\\t// v[i_min] の隣接点の部分集合 sub すべてについて\\n\\t\\trepb(sub, d) {\\n\\t\\t\\trep(i, d) {\\n\\t\\t\\t\\t// sub に選んでいないなら無関係\\n\\t\\t\\t\\tif (!(sub & (1 << i))) {\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\trepi(j, i + 1, d - 1) {\\n\\t\\t\\t\\t\\t// sub に選んでいないなら無関係\\n\\t\\t\\t\\t\\tif (!(sub & (1 << j))) {\\n\\t\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\t// sub がクリークでなければ何もしない．\\n\\t\\t\\t\\t\\tif (!adj[v[ia[i]]][v[ia[j]]]) {\\n\\t\\t\\t\\t\\t\\tgoto LOOP_END;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\t// sub がクリークなら v[i_min] と合わせてもクリークとなるので記録する．\\n\\t\\t\\tcs.push_back(vi({ v[i_min] }));\\n\\t\\t\\trep(i, d) {\\n\\t\\t\\t\\tif (sub & (1 << i)) {\\n\\t\\t\\t\\t\\tcs.rbegin()->push_back(v[ia[i]]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\tLOOP_END:;\\n\\t\\t}\\n\\n\\t\\t// v[i_min] を含む最大クリークの大きさは求まったので，\\n\\t\\t// 以降は v[i_min] を含まないクリークだけを考えれば良い．\\n\\t\\t// 頂点 v[i_min] と v[n-1] を交換して n を減らすことで v[i_min] を除去する．\\n\\t\\tswap(v[i_min], v[n - 1]);\\n\\t\\tn--;\\n\\n\\t\\t// 総次数 deg_sum，最小次数 deg_min，次数最小頂点の番号 i_min を得る．\\n\\t\\tdeg_sum = 0;\\n\\t\\tdeg_min = INF;\\n\\t\\trep(i, n) {\\n\\t\\t\\tif (chmin(deg_min, deg[v[i]])) {\\n\\t\\t\\t\\ti_min = i;\\n\\t\\t\\t}\\n\\t\\t\\tdeg_sum += deg[v[i]];\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nint main() {\\n//\\tinput_from_file(\\\"input.txt\\\");\\n//\\toutput_to_file(\\\"output.txt\\\");\\n\\n\\tint n, m;\\n\\tcin >> n >> m;\\n\\n\\tGraph g;\\n\\tvector<unordered_map<int, ll>> c;\\n\\tread_graph(n, m, g, c);\\n\\tdumpel(g);\\n\\tdumpel(c);\\n\\n\\tvvi cs;\\n\\tenumerate_clique(g, cs);\\n\\tdumpel(cs);\\n\\n\\tll res = 0;\\n\\trepe(cq, cs) {\\n\\t\\tint k = sz(cq);\\n\\t\\tif (k <= 1) continue;\\n\\n\\t\\tll sc = 0;\\n\\t\\trep(i, k) {\\n\\t\\t\\tll sat = INFL;\\n\\t\\t\\trep(j, k) {\\n\\t\\t\\t\\tif (i == j) continue;\\n\\n\\t\\t\\t\\tchmin(sat, c[cq[i]][cq[j]]);\\n\\t\\t\\t}\\n\\t\\t\\tsc += sat;\\n\\t\\t}\\n\\n\\t\\tchmax(res, sc);\\n\\t}\\n\\n\\tcout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4700,\n \"score_of_the_acc\": -0.0229,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2306_5990282\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\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<vector<int>> G(n, vector<int>(n));\\n set<vector<int>> st;\\n for (int i = 0; i < m; ++i) {\\n int u, v, f;\\n cin >> u >> v >> f;\\n --u, --v;\\n if (u > v) swap(u, v);\\n G[u][v] = G[v][u] = f;\\n st.insert({u, v});\\n }\\n int ans = 0;\\n while (!st.empty()) {\\n set<vector<int>> nst;\\n for (auto& v : st) {\\n int val = 0;\\n for (int i : v) {\\n int m = 1e9;\\n for (int j : v) {\\n if (i != j) m = min(m, G[i][j]);\\n }\\n val += m;\\n }\\n ans = max(ans, val);\\n\\n for (int k = 0; k < n; ++k) {\\n bool ok = true;\\n for (int i : v) {\\n if (G[i][k] == 0) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) {\\n auto u = v;\\n u.push_back(k);\\n sort(u.begin(), u.end());\\n nst.insert(u);\\n }\\n }\\n }\\n st.swap(nst);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4356,\n \"score_of_the_acc\": -0.0233,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2306_5959738\",\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//最大クリークが14\\n//2^14*14^2 ->\\n\\nbool S[100];\\nint N,M;\\nint ans=0;\\nvector<vector<int>> F;\\n\\nvoid dfs(int idx){\\n\\n if(idx==N){\\n vector<int> v;\\n for(int i=0;i<N;i++){\\n if(S[i]) v.push_back(i);\\n }\\n if(v.size()==1) return;\\n int t=0;\\n for(size_t i=0;i<v.size();i++){\\n int min_v=MAX;\\n for(size_t j=0;j<v.size();j++){\\n if(i==j) continue;\\n chmin(min_v,F[v[i]][v[j]]);\\n }\\n t+=min_v;\\n }\\n chmax(ans,t);\\n }else{\\n for(int i=idx;i<N;i++){\\n bool ok=true;\\n for(int j=0;j<i;j++){\\n if(S[j] and F[i][j]==0) ok=false;\\n }\\n if(not ok) continue;\\n S[i]=true;\\n dfs(i+1);\\n S[i]=false;\\n }\\n dfs(N);\\n }\\n}\\n\\nvoid solve(){\\n cin>>N>>M;\\n F=vmake(N,N,0);\\n for(int i=0;i<M;i++){\\n int s,t; cin>>s>>t;\\n s--; t--;\\n cin>>F[s][t];\\n F[t][s]=F[s][t];\\n }\\n dfs(0);\\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\": 30,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.0167,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2306_5778590\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint N,M;\\nint flag[105][105];\\nvector<vector<int>>tmp;\\n\\nvoid dfs(int n,vector<int>res) {\\n if(n == N) {\\n tmp.push_back(res);\\n return;\\n }\\n bool ok = true;\\n for(int i = 0; i < res.size(); i++) {\\n if(flag[res[i]][n] == 0) {\\n ok = false;\\n }\\n }\\n dfs(n+1,res);\\n if(ok) {\\n res.push_back(n);\\n dfs(n+1,res);\\n }\\n}\\n\\nint main() {\\n cin >> N >> M;\\n for(int i = 0; i < M; i++) {\\n int u,v,c;\\n cin >> u >> v >> c;\\n u--;\\n v--;\\n flag[u][v] = c;\\n flag[v][u] = c;\\n }\\n dfs(0,{});\\n int ans = 0;\\n for(int i = 0; i < tmp.size(); i++) {\\n int res = 0;\\n for(int j = 0; j < tmp[i].size(); j++) {\\n int mi = 1001001001;\\n for(int k = 0; k < tmp[i].size(); k++) {\\n if(tmp[i][j] == tmp[i][k]) {\\n continue;\\n }\\n mi = min(mi,flag[tmp[i][j]][tmp[i][k]]);\\n }\\n res += mi;\\n }\\n if(tmp[i].size() == 1) {\\n continue;\\n }\\n ans = max(ans,res);\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4572,\n \"score_of_the_acc\": -0.0211,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2306_5300799\",\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, x, n) for(int i = x; i <= n; i++)\\n#define rep3(i, x, n) for(int i = x; i >= n; i--)\\n#define each(e, v) for(auto &e: v)\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) x.begin(), x.end()\\n#define rall(x) x.rbegin(), x.rend()\\n#define sz(x) (int)x.size()\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pil = pair<int, ll>;\\nusing pli = pair<ll, int>;\\nusing pll = pair<ll, ll>;\\nconst int MOD = 1000000007;\\n//const int MOD = 998244353;\\nconst int inf = (1<<30)-1;\\nconst ll INF = (1LL<<60)-1;\\ntemplate<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};\\ntemplate<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};\\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\\nset<vector<int>> s;\\nvector<vector<int>> es;\\nint N, M;\\nint ans = 0;\\n\\nvoid dfs(vector<int> v){\\n sort(all(v));\\n if(s.count(v)) return;\\n s.emplace(v);\\n\\n int n = sz(v), tmp = 0;\\n\\n if(n > 1){\\n rep(i, n){\\n int x = inf;\\n rep(j, n){\\n if(j == i) continue;\\n chmin(x, es[v[i]][v[j]]);\\n }\\n tmp += x;\\n }\\n }\\n\\n chmax(ans, tmp);\\n\\n vector<int> deg(N, 0);\\n\\n rep(i, n){\\n rep(j, N){\\n if(es[v[i]][j] > 0) deg[j]++;\\n }\\n }\\n\\n rep(i, N){\\n if(deg[i] == n){\\n v.eb(i), dfs(v), v.pop_back();\\n }\\n }\\n}\\n\\nint main(){\\n cin >> N >> M;\\n\\n es.assign(N, vector<int>(N, 0));\\n\\n rep(i, M){\\n int u, v, c; cin >> u >> v >> c; u--, v--;\\n es[u][v] = c, es[v][u] = c;\\n }\\n\\n rep(i, N) dfs({i});\\n\\n cout << ans << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 5152,\n \"score_of_the_acc\": -0.0397,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2306_4972333\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<bits/stdc++.h>\\n// #include<ext/pb_ds/assoc_container.hpp>\\n// #include<ext/pb_ds/tree_policy.hpp>\\n// #include<ext/pb_ds/tag_and_trait.hpp>\\n// using namespace __gnu_pbds;\\n// #include<boost/multiprecision/cpp_int.hpp>\\n// namespace multiprecisioninteger = boost::multiprecision;\\n// using cint=multiprecisioninteger::cpp_int;\\nusing namespace std;\\nusing ll=long long;\\n#define double long double\\nusing datas=pair<ll,ll>;\\nusing ddatas=pair<double,double>;\\nusing tdata=pair<ll,datas>;\\nusing vec=vector<ll>;\\nusing mat=vector<vec>;\\nusing pvec=vector<datas>;\\nusing pmat=vector<pvec>;\\n// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;\\n#define For(i,a,b) for(i=a;i<(ll)b;++i)\\n#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)\\n#define rep(i,N) For(i,0,N)\\n#define rep1(i,N) For(i,1,N)\\n#define brep(i,N) bFor(i,N,0)\\n#define brep1(i,N) bFor(i,N,1)\\n#define all(v) (v).begin(),(v).end()\\n#define allr(v) (v).rbegin(),(v).rend()\\n#define vsort(v) sort(all(v))\\n#define vrsort(v) sort(allr(v))\\n#define endl \\\"\\\\n\\\"\\n#define eb emplace_back\\n#define print(x) cout<<x<<endl\\n#define printyes print(\\\"Yes\\\")\\n#define printno print(\\\"No\\\")\\n#define printYES print(\\\"YES\\\")\\n#define printNO print(\\\"NO\\\")\\n#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?\\\" \\\":\\\"\\\")<<outi;f=1;}cout<<endl;}while(0)\\n#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)\\nconst ll mod=1000000007;\\n// const ll mod=998244353;\\nconst ll inf=1LL<<60;\\nconst double PI=acos(-1);\\nconst double eps=1e-9;\\ntemplate<class T,class E> ostream& operator<<(ostream& os,pair<T,E>& p){return os<<\\\"(\\\"<<p.first<<\\\",\\\"<<p.second<<\\\")\\\";}\\ntemplate<class T> ostream& operator<<(ostream& os,const vector<T>& v){\\n os<<\\\"{\\\";ll i;\\n rep(i,v.size()){\\n if(i)os<<\\\",\\\";\\n os<<v[i];\\n }\\n os<<\\\"}\\\";\\n return os;\\n}\\ntemplate<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}\\ntemplate<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}\\n#ifdef DEBUG\\nvoid debugg(){cerr<<endl;}\\ntemplate<class T,class... Args>void debugg(const T& x,const Args&... args){cerr<<\\\" \\\"<<x;debugg(args...);}\\n#define debug(...) cerr<<__LINE__<<\\\" [\\\"<<#__VA_ARGS__<<\\\"]:\\\",debugg(__VA_ARGS__)\\n#else\\n#define debug(...) (void(0))\\n#endif\\n\\nvoid startupcpp(){\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout<<fixed<<setprecision(15);\\n}\\n\\ndouble distance(ddatas x,ddatas y){\\n double a=x.first-y.first,b=x.second-y.second;\\n return sqrt(a*a+b*b);\\n}\\n\\nll modinv(ll a,ll m=mod) {\\n ll b=m,u=1,v=0,t;\\n while(b){\\n t=a/b;\\n a-=t*b; swap(a,b);\\n u-=t*v; swap(u,v);\\n }\\n return (u+m)%m;\\n}\\n\\nll moddevide(ll a,ll b){return (a*modinv(b))%mod;}\\n\\nvec modncrlistp,modncrlistm;\\n\\nll modncr(ll n,ll r){\\n if(n<r)return 0;\\n ll i,size=modncrlistp.size();\\n if(size<=n){\\n modncrlistp.resize(n+1);\\n modncrlistm.resize(n+1);\\n if(!size){\\n modncrlistp[0]=modncrlistm[0]=1;\\n size++;\\n }\\n For(i,size,n+1){\\n modncrlistp[i]=modncrlistp[i-1]*i%mod;\\n modncrlistm[i]=modinv(modncrlistp[i]);\\n }\\n }\\n return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;\\n}\\n\\nll modpow(ll a,ll n,ll m=mod){\\n ll res=1;\\n while(n>0){\\n if(n&1)res=res*a%m;\\n a=a*a%m;\\n n>>=1;\\n }\\n return res;\\n}\\n\\nll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}\\nll lcm(ll a,ll b){return a/gcd(a,b)*b;}\\n\\nll countdigits(ll n){\\n ll ans=0;\\n while(n){n/=10;ans++;}\\n return ans;\\n}\\n\\nll sumdigits(ll n){\\n ll ans=0;\\n while(n){ans+=n%10;n/=10;}\\n return ans;\\n}\\nll N;\\nll ans;\\nmat g;\\nmap<vec,int> mp;\\nvoid solve(vec v){\\n vsort(v);\\n if(mp[v])return;\\n mp[v]=1;\\n debug(v);\\n ll i,j,K=v.size();\\n rep(i,N){\\n rep(j,K){\\n if(!g[i][v[j]])break;\\n }\\n if(j==K){\\n v.emplace_back(i);\\n solve(v);\\n v.pop_back();\\n }\\n }\\n if(K>1){\\n ll res=0;\\n rep(i,K){\\n ll x=inf;\\n rep(j,K){\\n if(i==j)continue;\\n chmin(x,g[v[i]][v[j]]);\\n }\\n res+=x;\\n }\\n chmax(ans,res);\\n }\\n}\\nint main(){\\n startupcpp();\\n ll i,j,k,M;\\n cin>>N>>M;\\n g.resize(N,vec(N,0));\\n while(M--){\\n cin>>i>>j>>k;\\n --i;--j;\\n g[j][i]=g[i][j]=k;\\n }\\n solve(vec());\\n print(ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5872,\n \"score_of_the_acc\": -0.0445,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2306_4971122\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define var auto\\n\\nconst char newl = '\\\\n';\\n\\ntemplate<typename T1, typename T2>\\ninline bool chmin(T1 &a, T2 b) { bool c = a > b; if (c) a = b; return c; }\\ntemplate<typename T1, typename T2>\\ninline bool chmax(T1 &a, T2 b) { bool c = a < b; if (c) a = b; return c; }\\n\\nsigned main() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n int n, m;\\n cin >> n >> m;\\n vector<vector<ll>> mat(n, vector<ll>(n, 0));\\n for (int i = 0; i < m; i++){\\n int s, t, c;\\n cin >> s >> t >> c;\\n s--, t--;\\n mat[s][t] = c;\\n mat[t][s] = c;\\n }\\n vector<vector<int>> cliques{vector<int>{}};\\n for (int i = 0; i < n; i++){\\n var newqs = cliques;\\n for (var&& clique : cliques){\\n bool valid = true;\\n for (var&& vert : clique){\\n if (mat[vert][i] == 0){\\n valid = false;\\n break;\\n }\\n }\\n if (!valid) continue;\\n var newq = clique;\\n newq.emplace_back(i);\\n newqs.emplace_back(newq);\\n }\\n cliques = move(newqs);\\n }\\n ll res = 0;\\n for (var&& clique : cliques){\\n ll score = 0;\\n for (var&& s : clique){\\n ll mn = LLONG_MAX;\\n for (var&& t : clique){\\n if (s == t) continue;\\n chmin(mn, mat[s][t]);\\n }\\n if (mn == LLONG_MAX) mn = 0;\\n score += mn;\\n }\\n chmax(res, score);\\n }\\n cout << res << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7276,\n \"score_of_the_acc\": -0.0589,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2306_4934193\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\nint ans;\\nint N,M;\\nint d[100][100];\\nvoid dfs(int id,vector<int>A)\\n{\\n\\tif(id==N)\\n\\t{\\n\\t\\tif(A.size()==1)return;\\n\\t\\tint now=0;\\n\\t\\tfor(int a:A)\\n\\t\\t{\\n\\t\\t\\tint t=1e9;\\n\\t\\t\\tfor(int b:A)if(a!=b)t=min(t,d[a][b]);\\n\\t\\t\\tnow+=t;\\n\\t\\t}\\n\\t\\tif(ans<now)ans=now;\\n\\t\\treturn;\\n\\t}\\n\\tdfs(id+1,A);\\n\\tfor(int a:A)if(d[a][id]==0)return;\\n\\tA.push_back(id);\\n\\tdfs(id+1,A);\\n}\\nmain()\\n{\\n\\tcin>>N>>M;\\n\\tfor(int i=0;i<M;i++)\\n\\t{\\n\\t\\tint u,v,f;cin>>u>>v>>f;\\n\\t\\tu--,v--;\\n\\t\\td[u][v]=d[v][u]=f;\\n\\t}\\n\\tvector<int>fst;\\n\\tdfs(0,fst);\\n\\tcout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.0022,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2306_4883511\",\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-12;\\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>>edge(N, vector<int>(N));\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tcin >> L >> R >> K;\\n\\t\\tL--, R--;\\n\\t\\tedge[L][R] = edge[R][L] = K;\\n\\t}\\n\\tvector<set<vector<int>>>vs(N + 1);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tvector<int>w(N);\\n\\t\\tw[i] = 1;\\n\\t\\tvs[1].insert(w);\\n\\t}\\n\\tint ans = 0;\\n\\tfor (int i = 1; i < N; i++) {\\n\\t\\tfor (auto j : vs[i]) {\\n\\t\\t\\tfor (int k = 0; k < N; k++) {\\n\\t\\t\\t\\tif (j[k])continue;\\n\\t\\t\\t\\tbool flag = true;\\n\\t\\t\\t\\tfor (int l = 0; l < N; l++) {\\n\\t\\t\\t\\t\\tif (j[l] && !edge[k][l])flag = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (flag) {\\n\\t\\t\\t\\t\\tj[k] = 1;\\n\\t\\t\\t\\t\\tvs[i + 1].insert(j);\\n\\t\\t\\t\\t\\tj[k] = 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 2; i <= N; i++) {\\n\\t\\tfor (auto j : vs[i]) {\\n\\t\\t\\tvector<int>sum(N);\\n\\t\\t\\tfor (int k = 0; k < N; k++) {\\n\\t\\t\\t\\tif (!j[k])continue;\\n\\t\\t\\t\\tsum[k] = MOD;\\n\\t\\t\\t\\tfor (int l = 0; l < N; l++) {\\n\\t\\t\\t\\t\\tif (!j[l])continue;\\n\\t\\t\\t\\t\\tif (k == l)continue;\\n\\t\\t\\t\\t\\tsum[k] = min(sum[k], edge[k][l]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tans = max(ans, accumulate(sum.begin(), sum.end(), 0));\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 10928,\n \"score_of_the_acc\": -0.2037,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2306_4820400\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint INF = 10000000;\\nset<vector<bool>> st;\\nint dfs(vector<bool> &used, vector<vector<int>> &E){\\n if (st.count(used)){\\n return 0;\\n }\\n st.insert(used);\\n int n = E.size();\\n int ans = 0;\\n for (int i = 0; i < n; i++){\\n if (used[i]){\\n int mn = INF;\\n for (int j = 0; j < n; j++){\\n if (used[j] && i != j){\\n mn = min(mn, E[i][j]);\\n }\\n }\\n if (mn != INF){\\n ans += mn;\\n }\\n }\\n }\\n for (int i = 0; i < n; i++){\\n bool ok = true;\\n for (int j = 0; j < n; j++){\\n if (used[j]){\\n if (E[i][j] == 0 || i == j){\\n ok = false;\\n }\\n }\\n }\\n if (ok){\\n used[i] = true;\\n ans = max(ans, dfs(used, E));\\n used[i] = false;\\n }\\n }\\n return ans;\\n}\\nint main(){\\n int n, m;\\n cin >> n >> m;\\n vector<vector<int>> E(n, vector<int>(n, 0));\\n for (int i = 0; i < m; i++){\\n int u, v, f;\\n cin >> u >> v >> f;\\n u--;\\n v--;\\n E[u][v] = f;\\n E[v][u] = f;\\n }\\n vector<bool> used(n, false);\\n cout << dfs(used, E) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 430,\n \"memory_kb\": 5024,\n \"score_of_the_acc\": -0.2462,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2306_4256032\",\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-11L\\n#define MAX_MOD 1000000007LL\\n#define GYAKU 500000004LL\\n\\n#define MOD 998244353LL\\n#define seg_size 262144\\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 iostream::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n}\\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//li chao tree by ei1333. It's public available.\\n// https://ei1333.github.io/luzhiled/snippets/structure/li-chao-tree.html\\n/*\\ntemplate< typename T >\\nstruct LiChaoTree {\\n struct Line {\\n T a, b;\\n\\n Line(T a, T b) : a(a), b(b) {}\\n\\n inline T get(T x) const { return a * x + b; }\\n\\n inline bool over(const Line& b, const T& x) const {\\n return get(x) < b.get(x);\\n }\\n };\\n\\n vector< T > xs;\\n vector< Line > seg;\\n int sz;\\n\\n LiChaoTree(const vector< T >& x, T INF) : xs(x) {\\n sz = 1;\\n while (sz < xs.size()) sz <<= 1;\\n while (xs.size() < sz) xs.push_back(xs.back() + 1);\\n seg.assign(2 * sz - 1, Line(0, INF));\\n }\\n\\n void update(Line& x, int k, int l, int r) {\\n int mid = (l + r) >> 1;\\n auto latte = x.over(seg[k], xs[l]), malta = x.over(seg[k], xs[mid]);\\n if (malta) swap(seg[k], x);\\n if (l + 1 >= r) return;\\n else if (latte != malta) update(x, 2 * k + 1, l, mid);\\n else update(x, 2 * k + 2, mid, r);\\n }\\n\\n void update(T a, T b) { // ax+b\\n Line l(a, b);\\n update(l, 0, 0, sz);\\n }\\n\\n T query(int k) { // xs[k]\\n const T x = xs[k];\\n k += sz - 1;\\n T ret = seg[k].get(x);\\n while (k > 0) {\\n k = (k - 1) >> 1;\\n ret = min(ret, seg[k].get(x));\\n }\\n return ret;\\n }\\n};\\n\\n#define int long long\\nvoid solve() {\\n int n, m;\\n cin >> n >> m;\\n vector<vector<int>> landmarks;\\n vector<vector<int>> costs;\\n REP(i, n) {\\n vector<int> tmp;\\n REP(q, m) {\\n int b;\\n cin >> b;\\n b = xor128() % 10000000;\\n tmp.push_back(b);\\n }\\n landmarks.push_back(tmp);\\n }\\n REP(i, n) {\\n\\n vector<int> tmp;\\n {\\n REP(q, m) {\\n int b;\\n cin >> b;\\n b = xor128() % 100000000;\\n tmp.push_back(b);\\n }\\n }\\n costs.push_back(tmp);\\n }\\n vector<LiChaoTree<int>> yoko; // size should be m\\n REP(i, n) {\\n vector<int> hoge(m);\\n REP(q, m) {\\n hoge[q] = q;\\n }\\n LiChaoTree<int> now(hoge, 1e18);//size should be n\\n yoko.push_back(now);\\n }\\n vector<vector<int>> dp = landmarks;\\n for (int q = 0; q < m; ++q) {\\n vector<int> hoge(n);\\n REP(i, n) {\\n hoge[i] = i;\\n }\\n LiChaoTree<int> now(hoge, 1e18);//size should be n\\n\\n for (int i = 0; i < n; ++i) {\\n int now_min = costs[0][0] * (i + q);\\n if (q < 0) {\\n int geko = yoko[i].query(q);\\n now_min = min(now_min, geko);\\n }\\n if (i != 0) {\\n int geko = now.query(i);\\n now_min = min(now_min, geko);\\n }\\n dp[i][q] = now_min;\\n yoko[i].update(costs[i][q], landmarks[i][q] + dp[i][q] - q * costs[i][q]);\\n now.update(costs[i][q], landmarks[i][q] + dp[i][q] - i * costs[i][q]);\\n }\\n }\\n\\n cout << dp[n - 1][m - 1] << endl;\\n}\\n*/\\n\\n#define int ll\\nint used[200];\\nvector<int> kouho;\\nset<pair<int,int>> already;\\nint dist[200][200];\\nint n, m;\\n\\nint dfs(int now,pair<int,int> bit) {\\n if (now < 50) {\\n bit.first += (1LL << now);\\n }\\n else {\\n bit.second += (1LL << (now - 50));\\n }\\n if (already.count(bit)) {\\n return 0;\\n }\\n used[now] = 1;\\n kouho.push_back(now);\\n already.insert(bit);\\n for (int i = 0; i < n; ++i) {\\n if (used[i]) continue;\\n int ok = 1;\\n REP(q, kouho.size()) {\\n if (dist[kouho[q]][i] == 0) {\\n ok = 0;\\n break;\\n }\\n }\\n if (ok == 0) continue;\\n dfs(i, bit);\\n }\\n kouho.pop_back();\\n used[now] = 0;\\n return 0;\\n}\\n\\nvoid solve() {\\n cin >> n >> m;\\n REP(i, m) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n a--; b--;\\n dist[a][b] = c;\\n dist[b][a] = c;\\n }\\n int ans = 0;\\n REP(i, n) {\\n ans = max(ans, dfs(i, pair<int, int>{0, 0}));\\n }\\n for (auto x : already) {\\n vector<int> huku;\\n for (int q = 0; q < 51; ++q) {\\n if ((1LL << q) & x.first) {\\n huku.push_back(q);\\n }\\n if ((1LL << q) & x.second) {\\n huku.push_back(q + 50);\\n }\\n }\\n if (huku.size() == 1) continue;\\n int tmp = 0;\\n REP(q, huku.size()) {\\n int hoge = 1e9;\\n REP(j, huku.size()) {\\n if (q == j) continue;\\n hoge = min(hoge, dist[huku[q]][huku[j]]);\\n }\\n tmp += hoge;\\n }\\n ans = max(ans, tmp);\\n }\\n cout << ans << endl;\\n}\\n#undef int\\nint main() {\\n init();\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4252,\n \"score_of_the_acc\": -0.0167,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2306_4228355\",\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(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 = long long;\\n\\n#define fs first\\n#define sc second\\n\\nconst LL MOD = 1e9+7;\\n\\nLL next_combination(LL mask) {\\n LL x = mask & -mask, y = mask + x;\\n return (((mask & ~y) / x) >> 1) | y;\\n}\\n\\nint main()\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n\\n int n, m; cin >> n >> m;\\n auto G = make_v<int>(n, n);\\n vector<int> deg(n);\\n for (int i = 0; i < m; ++i) {\\n int u, v, f;\\n cin >> u >> v >> f;\\n --u, --v;\\n G[u][v] = G[v][u] = f;\\n ++deg[u], ++deg[v];\\n }\\n\\n int ans = 0;\\n\\n for (int k = 2; k <= 14; ++k) {\\n vector<int> vs;\\n for (int i = 0; i < n; ++i) {\\n if (deg[i] >= k-1) {\\n vs.emplace_back(i);\\n }\\n }\\n\\n if (k == 2) {\\n for (int a : vs) {\\n for (int b : vs) {\\n chmax(ans, 2*G[a][b]);\\n }\\n }\\n continue;\\n }\\n if (k == 3) {\\n for (int a : vs) {\\n for (int b : vs) {\\n for (int c : vs) {\\n chmax(ans,\\n min(G[a][b],G[a][c]) +\\n min(G[b][a],G[b][c]) +\\n min(G[c][a],G[c][b])\\n );\\n }\\n }\\n }\\n continue;\\n }\\n\\n for (LL mask=(1LL<<k)-1; mask < 1LL<<vs.size(); mask=next_combination(mask))\\n {\\n assert(k <= vs.size());\\n\\n vector<int> score(n, numeric_limits<int>::max());\\n\\n for (int i = 0; i < vs.size(); ++i) if (mask >> i & 1) {\\n for (int j = i+1; j < vs.size(); ++j) if (mask >> j & 1) {\\n chmin(score[vs[i]], G[vs[i]][vs[j]]);\\n chmin(score[vs[j]], G[vs[i]][vs[j]]);\\n }\\n }\\n\\n int total = 0;\\n for (int i = 0; i < vs.size(); ++i) if (mask >> i & 1) {\\n total += score[vs[i]];\\n }\\n chmax(ans, total);\\n }\\n }\\n\\n cout << ans << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1720,\n \"memory_kb\": 3264,\n \"score_of_the_acc\": -0.8935,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2306_4217008\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vector<ll>>;\\nconst double eps = 1e-10;\\nconst ll MOD = 1000000007;\\nconst int INF = 1000000000;\\nconst ll LINF = 1ll<<50;\\ntemplate<typename T>\\nvoid printv(const vector<T>& s) {\\n for(int i=0;i<(int)(s.size());++i) {\\n cout << s[i];\\n if(i == (int)(s.size())-1) cout << endl;\\n else cout << \\\" \\\";\\n }\\n}\\ntemplate<typename T1, typename T2>\\nostream& operator<<(ostream &os, const pair<T1, T2> p) {\\n os << p.first << \\\":\\\" << p.second;\\n return os;\\n}\\nstruct Edge {\\n int from, to, friendliness;\\n};\\nmap<vector<bool>, int> mp;\\nll dfs(int now, vector<bool> &sel, const vector<vector<Edge>> &g, const vvll &d, int n) {\\n if(mp[sel] != 0) return mp[sel];\\n ll res = 0;\\n for(int i=0;i<n;++i) {\\n if(!sel[i]) continue;\\n ll val = LINF;\\n for(int j=0;j<n;++j) {\\n if(i == j || !sel[j]) continue;\\n val = min(val, d[i][j]);\\n }\\n if(val == LINF) val = 0;\\n res += val;\\n }\\n for(int i=0;i<(int)(g[now].size());++i) {\\n int nxt = g[now][i].to;\\n if(sel[nxt]) continue;\\n bool ok = true;\\n for(int j=0;j<n;++j) {\\n if(j == nxt) continue;\\n if(sel[j] && d[nxt][j] == 0) {\\n ok = false;\\n break;\\n }\\n }\\n if(ok) {\\n sel[nxt] = true;\\n res = max(res, dfs(nxt, sel, g, d, n));\\n sel[nxt] = false;\\n }\\n }\\n return mp[sel] = res;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n int n, m; cin >> n >> m;\\n vector<vector<Edge>> g(n);\\n vvll d(n, vll(n, 0));\\n for(int i=0;i<m;++i) {\\n int u, v, f; cin >> u >> v >> f;\\n u--; v--;\\n g[u].push_back({u, v, f});\\n g[v].push_back({v, u, f});\\n d[u][v] = f;\\n d[v][u] = f;\\n }\\n vector<bool> sel(n, false);\\n ll ans = 0;\\n for(int i=0;i<n;++i) {\\n sel[i] = true;\\n ans = max(ans, dfs(i, sel, g, d, n));\\n sel[i] = false;\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 440,\n \"memory_kb\": 5320,\n \"score_of_the_acc\": -0.2555,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2306_4143122\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n#define all(x) (x).begin(),(x).end()\\nconst int mod=998244353,MAX=103,INF=1<<30;\\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,M;cin>>N>>M;\\n vector<vector<int>> A(N,vector<int>(N));\\n \\n for(int i=0;i<M;i++){\\n int a,b,c;cin>>a>>b>>c;\\n a--;b--;\\n A[a][b]=c;\\n A[b][a]=c;\\n }\\n \\n int ans=0;\\n \\n set<vector<int>> SE;\\n \\n for(int i=0;i<N;i++){\\n for(int j=i+1;j<N;j++){\\n if(A[i][j]){\\n ans=max(ans,A[i][j]*2);\\n vector<int> use(N);\\n use[i]=1;\\n use[j]=1;\\n SE.insert(use);\\n }\\n }\\n }\\n \\n for(int q=2;q<15;q++){\\n if(SE.empty()) break;\\n \\n set<vector<int>> ne;\\n \\n for(auto it=SE.begin();it!=SE.end();it++){\\n for(int i=0;i<N;i++){\\n if((*it)[i]) continue;\\n bool ok=true;\\n \\n for(int j=0;j<N;j++){\\n if(i==j) continue;\\n if((*it)[j]&&A[i][j]==0){\\n ok=false;\\n break;\\n }\\n }\\n \\n if(ok){\\n vector<int> S=*it;\\n S[i]=1;\\n int sum=0;\\n for(int j=0;j<N;j++){\\n if(S[j]==0) continue;\\n int mini=INF;\\n for(int k=0;k<N;k++){\\n if(S[k]==0) continue;\\n if(j==k) continue;\\n if(A[j][k]) mini=min(mini,A[j][k]);\\n }\\n sum+=mini;\\n }\\n \\n ans=max(ans,sum);\\n \\n ne.insert(S);\\n }\\n }\\n }\\n \\n SE=ne;\\n }\\n \\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 6480,\n \"score_of_the_acc\": -0.1468,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2306_4142225\",\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\\ntemplate <typename T>\\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>\\nbool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\n//const ll mod = 1000000007;\\nint N, M;\\nbitset<100> bits[100];\\nbitset<100> Zero;\\nint A[100][100];\\nint ans;\\nvoid dfs(bitset<100> now, bitset<100> can, int vertex) {\\n /*\\n cerr << \\\"-----\\\" << endl;\\n cerr << now << endl;\\n cerr << can << endl;\\n cerr << vertex << endl;\\n cerr << \\\"-----\\\" << endl;\\n */\\n if(now.count() >= 2) {\\n int score = 0;\\n for(int i = 0; i < N; i++) {\\n if(!now[i]) continue;\\n int nowscore = 1e9;\\n for(int j = 0; j < N; j++) {\\n if(!now[j]) continue;\\n if(i == j) continue;\\n chmin(nowscore, A[i][j]);\\n }\\n score += nowscore;\\n }\\n chmax(ans, score);\\n }\\n for(int i = vertex; i < N; i++) {\\n if(!can[i]) {\\n //cerr << \\\"ng: \\\" << vertex << \\\" \\\" << i << endl;\\n continue;\\n }\\n auto sub = now;\\n sub[i] = true;\\n auto sub2 = can;\\n sub2 &= bits[i];\\n //cerr << \\\"ok : \\\" << vertex << \\\" \\\" << i << endl;\\n dfs(sub, sub2, i + 1);\\n }\\n}\\n\\nint main() {\\n //cout.precision(10);\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cin >> N >> M;\\n for(int i = 0; i < M; i++) {\\n int a, b, c;\\n cin >> a >> b >> c;\\n a--;\\n b--;\\n A[a][b] = c;\\n A[b][a] = c;\\n bits[a][b] = true;\\n bits[b][a] = true;\\n }\\n bitset<100> One;\\n for(int i = 0; i < N; i++) One[i] = true;\\n dfs(Zero, One, 0);\\n cout << ans << endl;\\n /*\\n for(int i = 0; i < N; i++) {\\n cerr << bits[i] << endl;\\n }\\n */\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3256,\n \"score_of_the_acc\": -0.0027,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2306_3917190\",\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 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//INSERT ABOVE HERE\\nconst int MAX = 111;\\nint es[MAX][MAX]={};\\nsigned main(){\\n int n,m;\\n cin>>n>>m;\\n for(int i=0;i<m;i++){\\n int u,v,w;\\n cin>>u>>v>>w;\\n u--;v--;\\n es[u][v]=es[v][u]=w;\\n }\\n\\n int ans=0;\\n vector<int> used(n,0);\\n MFP([&](auto dfs,int v)->void{\\n int res=0,cnt=0;\\n for(int i=0;i<n;i++){\\n if(!used[i]) continue;\\n cnt++;\\n int tmp=1e9;\\n for(int j=0;j<n;j++)\\n if(i!=j&&used[j]) chmin(tmp,es[i][j]);\\n if(tmp==0) return;\\n res+=tmp;\\n }\\n if(cnt>1) chmax(ans,res);\\n\\n if(v==n) return;\\n\\n used[v]=1;\\n dfs(v+1);\\n used[v]=0;\\n dfs(v+1);\\n })(0);\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 390,\n \"memory_kb\": 3132,\n \"score_of_the_acc\": -0.1989,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1287,"cells":{"group_id":{"kind":"string","value":"aoj_2303_cpp"},"problem_description":{"kind":"string","value":"Marathon Match\nN\npeople run a marathon.\nThere are\nM\nresting places on the way.\nFor each resting place, the\ni\n-th runner takes a break with probability\nP_i\npercent.\nWhen the\ni\n-th runner takes a break, he gets rest for\nT_i\ntime.\nThe\ni\n-th runner runs at constant speed\nV_i\n, and\nthe distance of the marathon is\nL\n.\nYou are requested to compute the probability for each runner to win the first place.\nIf a runner arrives at the goal with another person at the same time, they are not considered to win the first place.\nInput\nA dataset is given in the following format:\nN\nM\nL\nP_1\nT_1\nV_1\nP_2\nT_2\nV_2\n...\nP_N\nT_N\nV_N\nThe first line of a dataset contains three integers\nN\n(\n1 \\leq N \\leq 100\n),\nM\n(\n0 \\leq M \\leq 50\n) and\nL\n(\n1 \\leq L \\leq 100,000\n).\nN\nis the number of runners.\nM\nis the number of resting places.\nL\nis the distance of the marathon.\nEach of the following\nN\nlines contains three integers\nP_i\n(\n0 \\leq P_i \\leq 100\n),\nT_i\n(\n0 \\leq T_i \\leq 100\n) and\nV_i\n(\n0 \\leq V_i \\leq 100\n) describing the\ni\n-th runner.\nP_i\nis the probability to take a break.\nT_i\nis the time of resting.\nV_i\nis the speed.\nOutput\nFor each runner, you should answer the probability of winning.\nThe\ni\n-th line in the output should be the probability that the\ni\n-th runner wins the marathon.\nEach number in the output should not contain an error greater than\n10^{-5}\n.\nSample Input 1\n2 2 50\n30 50 1\n30 50 2\nOutput for the Sample Input 1\n0.28770000\n0.71230000\nSample Input 2\n2 1 100\n100 100 10\n0 100 1\nOutput for the Sample Input 2\n0.00000000\n1.00000000\nSample Input 3\n3 1 100\n50 1 1\n50 1 1\n50 1 1\nOutput for the Sample Input 3\n0.12500000\n0.12500000\n0.12500000\nSample Input 4\n2 2 50\n30 0 1\n30 50 2\nOutput for the Sample Input 4\n0.51000000\n0.49000000"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2303_10853140","code_snippet":"#include<bits/stdc++.h>\ntemplate <class T>\ninline bool rd(T &ret) {\n char c; int sgn;\n if(c=getchar(),c==EOF) return 0;\n while(c!='-'&&(c<'0'||c>'9')) c=getchar();\n sgn=(c=='-')?-1:1;\n ret=(c=='-')?0:(c-'0');\n while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');\n ret*=sgn;\n return 1;\n}\ntemplate <class T>\ninline void pt(T x) {\n if (x <0) {\n putchar('-');\n x = -x;\n }\n if(x>9) pt(x/10);\n putchar(x%10+'0');\n}\nusing namespace std;\ntypedef long long ll;\nconst int MAXN = 55;\ndouble C[MAXN+1][MAXN+1];\nvoid Initial()\n{\n memset(C, 0, sizeof C);\n for(int i=0; i<=MAXN; ++i)\n {\n C[0][i] = 0.0;\n C[i][0] = 1.0;\n }\n for(int i=1; i<=MAXN; ++i)\n {\n for(int j=1; j<=MAXN; ++j)\n C[i][j] = C[i-1][j] + C[i-1][j-1];\n }\n}\nconst int N = 110;\nint n, m;\nint l, t[N], v[N];\ndouble p[N];\ndouble Pow(double x, int y){\n double ans = 1.0;\n while(y){\n if(y&1)ans *= x;\n x = x*x;\n y >>= 1;\n }\n return ans;\n}\ndouble work(int x){\n double ans = 0.0;\n for(int i = 0; i <= m; i++)\n {\n double pp = C[m][i] * Pow(p[x], i) * Pow(1.0-p[x], m-i);\n for(int j = 1; j <= n; j++)\n {\n if(j == x)continue;\n double siz = 0;\n for(int k = m; k >= 0; k--)\n {\n if(l*v[j] + i*t[x]*v[j]*v[x] < l*v[x] + k*t[j]*v[x]*v[j])\n siz += C[m][k] * Pow(p[j], k) * Pow(1.0-p[j], m-k);\n else break;\n }\n pp *= siz;\n }\n ans += pp;\n }\n return ans;\n}\nvoid input(){\n for(int i = 1; i <= n; i++)\n {\n rd(p[i]);rd(t[i]);rd(v[i]);\n p[i] /= 100.0;\n }\n}\nint main(){\n Initial();\n while(cin>>n>>m>>l){\n input();\n for(int i = 1; i <= n; i++)\n printf(\"%.10f\\n\", work(i));\n }\n return 0;\n}\n/*\n30 0 12\n0.5\n0\n13\n\n*/","accuracy":1,"time_ms":70,"memory_kb":3596,"score_of_the_acc":-0.0703,"final_rank":5},{"submission_id":"aoj_2303_9666990","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\n ll N, M, L;\n cin >> N >> M >> L;\n vector<double> P(N);\n vector<ll> T(N), V(N);\n rep(i,0,N) {\n cin >> P[i] >> T[i] >> V[i];\n P[i] /= 100.0;\n }\n vector<vector<double>> X(N);\n rep(i,0,N) {\n if (V[i] == 0) continue;\n vector<double> DP(M+1,0), NewDP(M+1,0);\n DP[0] = 1;\n rep(j,0,M) {\n rep(k,0,M+1) NewDP[k] = 0;\n rep(k,0,M+1) {\n if (DP[k] == 0) continue;\n NewDP[k] += DP[k] * (1-P[i]);\n NewDP[k+1] += DP[k] * P[i];\n }\n swap(DP,NewDP);\n }\n X[i].resize(M+1);\n rep(j,0,M+1) X[i][j] = DP[j];\n }\n rep(i,0,N) {\n double ANS = 0;\n rep(j,0,X[i].size()) {\n double MUL = X[i][j];\n rep(k,0,N) {\n if (k == i) continue;\n double SUM = 0.0;\n if (X[k].empty()) SUM = 1.0;\n else {\n rep(l,0,X[k].size()) {\n if ((L+V[i]*T[i]*j)*V[k] < (L+V[k]*T[k]*l)*V[i]) SUM += X[k][l];\n }\n }\n MUL *= SUM;\n }\n ANS += MUL;\n }\n printf(\"%.12f\\n\", ANS);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3592,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2303_9666972","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\n ll N, M, L;\n cin >> N >> M >> L;\n vector<double> P(N);\n vector<ll> T(N), V(N);\n rep(i,0,N) {\n cin >> P[i] >> T[i] >> V[i];\n P[i] /= 100.0;\n }\n vector<vector<double>> X(N);\n rep(i,0,N) {\n if (V[i] == 0) continue;\n vector<double> DP(M+1,0), NewDP(M+1,0);\n DP[0] = 1;\n rep(j,0,M) {\n rep(k,0,M+1) NewDP[k] = 0;\n rep(k,0,M+1) {\n if (DP[k] == 0) continue;\n NewDP[k] += DP[k] * (1-P[i]);\n NewDP[k+1] += DP[k] * P[i];\n }\n swap(DP,NewDP);\n }\n X[i].resize(M+1);\n rep(j,0,M+1) X[i][j] = DP[j];\n }\n rep(i,0,N) {\n double ANS = 0;\n rep(j,0,X[i].size()) {\n double MUL = X[i][j];\n rep(k,0,N) {\n if (k == i) continue;\n double SUM = 0.0;\n rep(l,0,X[k].size()) {\n if ((L+V[i]*T[i]*j)*V[k] < (L+V[k]*T[k]*l)*V[i]) SUM += X[k][l];\n }\n MUL *= SUM;\n }\n ANS += MUL;\n }\n printf(\"%.12f\\n\", ANS);\n }\n}","accuracy":0.18571428571428572,"time_ms":10,"memory_kb":3612,"score_of_the_acc":-0.0104,"final_rank":13},{"submission_id":"aoj_2303_8986393","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 2 \"cp-library/src/number/binom_table.hpp\"\n\ntemplate < class T >\nstd::vector< std::vector< T > > binom_table(int N) {\n std::vector table(N + 1, std::vector(N + 1, T(0)));\n table[0][0] = 1;\n for(int i : rep(1, N + 1)) {\n table[i][0] = 1;\n for(int j : rep(1, N + 1))\n table[i][j] = table[i - 1][j - 1] + table[i - 1][j];\n }\n return table;\n}\n#line 4 \"A.cpp\"\n\nint main() {\n i64 N = in(), M = in(), L = in();\n vector<i64> P(N), T(N), V(N);\n for(int i : rep(N)) P[i] = in(), T[i] = in(), V[i] = in();\n\n auto comb = binom_table<ld>(55);\n\n vector<ld> ans(N, 0.0);\n for(int i : rep(N)) {\n for(int xi = 0; xi <= M; xi++) {\n ld pxi = 1.0;\n for(int j : rep(N)) if(j != i) {\n ld cur = 0.0;\n for(int xj = 0; xj <= M; xj++) {\n i64 lhs = V[i] * V[j] * T[i] * xi + L * V[j];\n i64 rhs = V[i] * V[j] * T[j] * xj + L * V[i];\n if(lhs < rhs) {\n cur += comb[M][xj] * pow(P[j] / 100.0, xj) * pow(1.0 - P[j] / 100.0, M - xj);\n }\n }\n pxi *= cur;\n }\n pxi *= comb[M][xi] * pow(P[i] / 100.0, xi) * pow(1.0 - P[i] / 100.0, M - xi);\n ans[i] += pxi;\n }\n }\n\n printer::precision(20);\n for(int i : rep(N)) print(ans[i]);\n}","accuracy":1,"time_ms":890,"memory_kb":4032,"score_of_the_acc":-1.2277,"final_rank":12},{"submission_id":"aoj_2303_6763587","code_snippet":"#include <bits/stdc++.h>\n#include <chrono>\n#include <thread>\n////#include <atcoder/all>\n\n//using namespace atcoder;\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\n#define all(A) A.begin(),A.end()\n#define 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\ndouble EPS = 1e-9;\ntemplate<class T>\nbool chmin(T& p, T q) {\n if (p > q + EPS) {\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 = 998244353;\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}\nvector<string>S;\nll dfs(ll L, ll R, ll n, char c = '+') {\n ll res = 0;\n if (c == '*')res = 1;\n for (ll i = L; i <= R; i++) {\n ll d = 0;\n if (S[i].size() != n + 1)continue;\n if (S[i][n] == '+') {\n bool OK = 1;\n for (ll j = i + 1; j < R; j++) {\n if (S[j].size() == n + 1) {\n d = dfs(i + 1, j - 1, n + 1, '+');\n OK = 0;\n break;\n }\n\n }\n if (OK)d = dfs(i + 1, R, n + 1, '+');\n }\n else if (S[i][n] == '*') {\n bool OK = 1;\n for (ll j = i + 1; j < R; j++) {\n if (S[j].size() == n + 1) {\n d = dfs(i + 1, j - 1, n + 1, '*');\n OK = 0;\n break;\n }\n\n }\n if (OK)d = dfs(i + 1, R, n + 1, '*');\n }\n else {\n d = S[i][n] - '0';\n }\n if (c == '+')res += d;\n else res *= d;\n }\n return res;\n}\nunordered_map<ll, ll> MA;\n\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n vvll comb(51,vll(51,0));\n rep(i,51){\n comb[i][0]=1;\n rep(j,50){\n comb[i][j+1]=comb[i][j]*double(i-j)/double(j+1);\n }\n }\n\n ll N,M,L;\n cin>>N>>M>>L;\n vector<tuple<double,ll,ll>> H(N);\n rep(n,N){\n double p;ll t,v;\n cin>>p>>t>>v;\n H[n]={p/100.0,t,v};\n }\n rep(n,N){\n double an=0.0;\n double p=get<0>(H[n]);\n ll t=get<1>(H[n]);\n ll v=get<2>(H[n]);\n if(v<0.5){\n cout<<0.0<<endl;\n continue;\n }\n rep(m,M+1){\n double q=double(comb[M][m])*pow(p,m)*pow(1-p,M-m);\n rep(i,N){\n if(n==i)continue;\n double res=0.0;\n double pi=get<0>(H[i]);\n ll ti=get<1>(H[i]);\n ll vi=get<2>(H[i]);\n rep(j,M+1){\n if(L*v+j*ti*vi*v<=L*vi+m*t*vi*v)continue;\n res+=double(comb[M][j])*pow(pi,j)*pow(1-pi,M-j);\n }\n q*=res;\n }\n an+=q;\n }\n cout<<fixed<<setprecision(16)<<an<<endl;\n }\n}","accuracy":1,"time_ms":860,"memory_kb":3996,"score_of_the_acc":-1.175,"final_rank":10},{"submission_id":"aoj_2303_6552971","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\n\ntemplate<class t>\nclass fraction{\n\tpublic:\n\t\tt numerator;\n\t\tt denominator;\n\n\t\tfraction():numerator(t(0)), denominator(t(1)){}\n\t\tfraction(t a, t b):numerator(a), denominator(b){}\n\t\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\n\n\t\tfraction pow(long long k){\n\t\t\tfraction res(1, 1);\n\t\t\tfraction sum(*this);\n\t\t\twhile(k){\n\t\t\t\tif(k&1)res*=sum;\n\t\t\t\tsum*=sum;\n\t\t\t\tk>>=1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tfraction& operator+=(fraction a){\n\t\t\tnumerator = numerator * a.denominator + a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator-=(fraction a){\n\t\t\tnumerator = numerator * a.denominator - a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator*=(fraction a){\n\t\t\tnumerator *= a.numerator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator/=(fraction a){\n\t\t\tnumerator *= a.denominator;\n\t\t\tdenominator *= a.numerator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction operator+(fraction a){return fraction(*this) += a;}\n\t\tfraction operator-(fraction a){return fraction(*this) -= a;}\n\t\tfraction operator*(fraction a){return fraction(*this) *= a;}\n\t\tfraction operator/(fraction a){return fraction(*this) /= a;}\n};\n\ntemplate<class t>\nbool operator<(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator < b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator>(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator > b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator==(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator == b.numerator * a.denominator;\n}\n\ndouble combination(int a,int b){\n double res = 1;\n rep(i,b){\n res *= a - i;\n res /= i + 1;\n }\n return res;\n}\n\nvector<long double> func(){\n int n = in();\n int m = in();\n int l = in();\n using F = fraction<ll>;\n using P = pair<F,long double>;\n method(calc,vector<P>,long double p,int v,int t){\n vector<P> res;\n rep(i,m+1){\n res.emplace_back(F(l,v)+F(t*i,1),combination(m,i) * pow(1-p,m-i) * pow(p,i));\n }\n return res;\n };\n vvector<P> line;\n const F inf = F(1000000,1);\n rep(i,n){\n long double p = in() / 100.0;\n int t = in();\n int v = in();\n if(v==0){\n line.emplace_back(vector<P>({{inf,1}}));\n }else{\n line.emplace_back(calc(p,v,t));\n }\n }\n vector<long double> res;\n rep(i,n){\n long double sum = 0;\n foreach(p,line[i]){\n long double add = p.second;\n rep(j,n){\n if(i==j)continue;\n long double psum = 0;\n foreach(k,line[j]){\n if(p.first < k.first)psum += k.second;\n }\n add *= psum;\n }\n sum += add;\n }\n res.emplace_back(sum);\n }\n return res;\n}\n\nint main(){\n foreach(i,func())printf(\"%.20Lf\\n\",i);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3748,"score_of_the_acc":-0.0921,"final_rank":6},{"submission_id":"aoj_2303_6552965","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\n\ntemplate<class t>\nclass fraction{\n\tpublic:\n\t\tt numerator;\n\t\tt denominator;\n\n\t\tfraction():numerator(t(0)), denominator(t(1)){}\n\t\tfraction(t a, t b):numerator(a), denominator(b){}\n\t\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\n\n\t\tfraction pow(long long k){\n\t\t\tfraction res(1, 1);\n\t\t\tfraction sum(*this);\n\t\t\twhile(k){\n\t\t\t\tif(k&1)res*=sum;\n\t\t\t\tsum*=sum;\n\t\t\t\tk>>=1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tfraction& operator+=(fraction a){\n\t\t\tnumerator = numerator * a.denominator + a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator-=(fraction a){\n\t\t\tnumerator = numerator * a.denominator - a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator*=(fraction a){\n\t\t\tnumerator *= a.numerator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator/=(fraction a){\n\t\t\tnumerator *= a.denominator;\n\t\t\tdenominator *= a.numerator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction operator+(fraction a){return fraction(*this) += a;}\n\t\tfraction operator-(fraction a){return fraction(*this) -= a;}\n\t\tfraction operator*(fraction a){return fraction(*this) *= a;}\n\t\tfraction operator/(fraction a){return fraction(*this) /= a;}\n};\n\ntemplate<class t>\nbool operator<(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator < b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator>(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator > b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator==(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator == b.numerator * a.denominator;\n}\n\ndouble combination(int a,int b){\n double res = 1;\n rep(i,b){\n res *= a - i;\n res /= i + 1;\n }\n return res;\n}\n\nvector<long double> func(){\n int n = in();\n int m = in();\n int l = in();\n using F = fraction<ll>;\n using P = pair<F,long double>;\n method(calc,vector<P>,long double p,int v,int t){\n vector<P> res;\n rep(i,m+1){\n res.emplace_back(F(l,v)+F(t*i,1),combination(m,i) * pow(1-p,m-i) * pow(p,i));\n }\n return res;\n };\n vvector<P> line;\n const F inf = F(1000000,1);\n rep(i,n){\n long double p = in() / 100.0;\n int t = in();\n int v = in();\n if(v==0){\n line.emplace_back(vector<P>({{inf,1}}));\n }else{\n line.emplace_back(calc(p,v,t));\n }\n }\n vector<long double> res;\n rep(i,n){\n long double sum = 0;\n foreach(p,line[i]){\n long double add = p.second;\n rep(j,n){\n if(i==j)continue;\n long double psum = 0;\n foreach(k,line[j]){\n if(p.first < k.first)psum += k.second;\n }\n add *= psum;\n }\n sum += add;\n }\n res.emplace_back(sum);\n }\n return res;\n}\n\nint main(){\n foreach(i,func())println(i);\n return 0;\n}","accuracy":0.14285714285714285,"time_ms":20,"memory_kb":3716,"score_of_the_acc":-0.0755,"final_rank":16},{"submission_id":"aoj_2303_6552932","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\n\ntemplate<class t>\nclass fraction{\n\tpublic:\n\t\tt numerator;\n\t\tt denominator;\n\n\t\tfraction():numerator(t(0)), denominator(t(1)){}\n\t\tfraction(t a, t b):numerator(a), denominator(b){}\n\t\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\n\n\t\tfraction pow(long long k){\n\t\t\tfraction res(1, 1);\n\t\t\tfraction sum(*this);\n\t\t\twhile(k){\n\t\t\t\tif(k&1)res*=sum;\n\t\t\t\tsum*=sum;\n\t\t\t\tk>>=1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tfraction& operator+=(fraction a){\n\t\t\tnumerator = numerator * a.denominator + a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator-=(fraction a){\n\t\t\tnumerator = numerator * a.denominator - a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator*=(fraction a){\n\t\t\tnumerator *= a.numerator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator/=(fraction a){\n\t\t\tnumerator *= a.denominator;\n\t\t\tdenominator *= a.numerator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction operator+(fraction a){return fraction(*this) += a;}\n\t\tfraction operator-(fraction a){return fraction(*this) -= a;}\n\t\tfraction operator*(fraction a){return fraction(*this) *= a;}\n\t\tfraction operator/(fraction a){return fraction(*this) /= a;}\n};\n\ntemplate<class t>\nbool operator<(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator < b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator>(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator > b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator==(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator == b.numerator * a.denominator;\n}\n\nvector<long double> func(){\n int n = in();\n int m = in();\n int l = in();\n using F = fraction<ll>;\n using P = pair<F,long double>;\n method(calc,vector<P>,long double p,int v,int t){\n vector<long double> dp(m+1,0);\n dp[0] = 1;\n rep(_,m){\n vector<long double> ndp(m+1,0);\n rep(i,m+1){\n ndp[i] += (1-p) * dp[i];\n if(i+1<dp.size()){\n ndp[i+1] += p * dp[i];\n }\n }\n swap(dp,ndp);\n }\n vector<P> res;\n rep(i,dp.size()){\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\n }\n return res;\n };\n vvector<P> line;\n const F inf = F(1000000,1);\n rep(i,n){\n long double p = in() / 100.0;\n int t = in();\n int v = in();\n if(v==0){\n line.emplace_back(vector<P>({{inf,1}}));\n }else{\n line.emplace_back(calc(p,v,t));\n }\n }\n vector<long double> res;\n rep(i,n){\n long double sum = 0;\n foreach(p,line[i]){\n long double add = p.second;\n rep(j,n){\n if(i==j)continue;\n long double psum = 0;\n foreach(k,line[j]){\n if(p.first < k.first)psum += k.second;\n }\n add *= psum;\n }\n sum += add;\n }\n res.emplace_back(sum);\n }\n return res;\n}\n\nint main(){\n foreach(i,func())println(i);\n return 0;\n}","accuracy":0.14285714285714285,"time_ms":20,"memory_kb":3676,"score_of_the_acc":-0.0548,"final_rank":14},{"submission_id":"aoj_2303_6552930","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\n\ntemplate<class t>\nclass fraction{\n\tpublic:\n\t\tt numerator;\n\t\tt denominator;\n\n\t\tfraction():numerator(t(0)), denominator(t(1)){}\n\t\tfraction(t a, t b):numerator(a), denominator(b){}\n\t\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\n\n\t\tfraction pow(long long k){\n\t\t\tfraction res(1, 1);\n\t\t\tfraction sum(*this);\n\t\t\twhile(k){\n\t\t\t\tif(k&1)res*=sum;\n\t\t\t\tsum*=sum;\n\t\t\t\tk>>=1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tfraction& operator+=(fraction a){\n\t\t\tnumerator = numerator * a.denominator + a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator-=(fraction a){\n\t\t\tnumerator = numerator * a.denominator - a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator*=(fraction a){\n\t\t\tnumerator *= a.numerator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator/=(fraction a){\n\t\t\tnumerator *= a.denominator;\n\t\t\tdenominator *= a.numerator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction operator+(fraction a){return fraction(*this) += a;}\n\t\tfraction operator-(fraction a){return fraction(*this) -= a;}\n\t\tfraction operator*(fraction a){return fraction(*this) *= a;}\n\t\tfraction operator/(fraction a){return fraction(*this) /= a;}\n};\n\ntemplate<class t>\nbool operator<(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator < b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator>(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator > b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator==(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator == b.numerator * a.denominator;\n}\n\nvector<long double> func(){\n int n = in();\n int m = in();\n int l = in();\n using F = fraction<ll>;\n using P = pair<F,long double>;\n method(calc,vector<P>,long double p,int v,int t){\n vector<long double> dp(m+1,0);\n dp[0] = 1;\n rep(_,m){\n vector<long double> ndp(m+1,0);\n rep(i,m+1){\n ndp[i] += (1-p) * dp[i];\n if(i+1<dp.size()){\n ndp[i+1] += p * dp[i];\n }\n }\n swap(dp,ndp);\n }\n vector<P> res;\n rep(i,dp.size()){\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\n }\n return res;\n };\n vvector<P> line;\n const F inf = F(1000000,1);\n rep(i,n){\n long double p = in() / 100.0;\n int t = in();\n int v = in();\n if(v==0){\n line.emplace_back(vector<P>({{inf,1}}));\n }else{\n line.emplace_back(calc(p,v,t));\n }\n }\n vector<long double> res;\n rep(i,n){\n long double sum = 0;\n foreach(p,line[i]){\n long double add = p.second;\n if(p.first==inf)continue;\n rep(j,n){\n if(i==j)continue;\n long double psum = 0;\n foreach(k,line[j]){\n if(p.first < k.first)psum += k.second;\n }\n add *= psum;\n }\n sum += add;\n }\n res.emplace_back(sum);\n }\n return res;\n}\n\nint main(){\n foreach(i,func())println(i);\n return 0;\n}","accuracy":0.14285714285714285,"time_ms":20,"memory_kb":3688,"score_of_the_acc":-0.0611,"final_rank":15},{"submission_id":"aoj_2303_6552908","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\n\ntemplate<class t>\nclass fraction{\n\tpublic:\n\t\tt numerator;\n\t\tt denominator;\n\n\t\tfraction():numerator(t(0)), denominator(t(1)){}\n\t\tfraction(t a, t b):numerator(a), denominator(b){}\n\t\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\n\n\t\tfraction pow(long long k){\n\t\t\tfraction res(1, 1);\n\t\t\tfraction sum(*this);\n\t\t\twhile(k){\n\t\t\t\tif(k&1)res*=sum;\n\t\t\t\tsum*=sum;\n\t\t\t\tk>>=1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tfraction& operator+=(fraction a){\n\t\t\tnumerator = numerator * a.denominator + a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator-=(fraction a){\n\t\t\tnumerator = numerator * a.denominator - a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator*=(fraction a){\n\t\t\tnumerator *= a.numerator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator/=(fraction a){\n\t\t\tnumerator *= a.denominator;\n\t\t\tdenominator *= a.numerator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction operator+(fraction a){return fraction(*this) += a;}\n\t\tfraction operator-(fraction a){return fraction(*this) -= a;}\n\t\tfraction operator*(fraction a){return fraction(*this) *= a;}\n\t\tfraction operator/(fraction a){return fraction(*this) /= a;}\n};\n\ntemplate<class t>\nbool operator<(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator < b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator>(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator > b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator==(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator == b.numerator * a.denominator;\n}\n\nvector<long double> func(){\n int n = in();\n int m = in();\n int l = in();\n using F = fraction<ll>;\n using P = pair<F,long double>;\n method(calc,vector<P>,long double p,int v,int t){\n vector<long double> dp(m+1,0);\n dp[0] = 1;\n rep(_,m){\n vector<long double> ndp(m+1,0);\n rep(i,m){\n ndp[i] += (1-p) * dp[i];\n ndp[i+1] += p * dp[i];\n }\n swap(dp,ndp);\n }\n vector<P> res;\n rep(i,dp.size()){\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\n }\n return res;\n };\n vvector<P> line;\n const F inf = F(1000000,1);\n rep(i,n){\n long double p = in() / 100.0;\n int t = in();\n int v = in();\n if(v==0){\n line.emplace_back(vector<P>({{inf,1}}));\n }else{\n line.emplace_back(calc(p,v,t));\n }\n }\n vector<long double> res;\n rep(i,n){\n long double sum = 0;\n foreach(p,line[i]){\n long double add = p.second;\n if(p.first==inf)continue;\n rep(j,n){\n if(i==j)continue;\n long double psum = 0;\n foreach(k,line[j]){\n if(p.first < k.first)psum += k.second;\n }\n add *= psum;\n }\n sum += add;\n }\n res.emplace_back(sum);\n }\n return res;\n}\n\nint main(){\n foreach(i,func())println(i);\n return 0;\n}","accuracy":0.14285714285714285,"time_ms":20,"memory_kb":3764,"score_of_the_acc":-0.1004,"final_rank":20},{"submission_id":"aoj_2303_6552894","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\n\ntemplate<class t>\nclass fraction{\n\tpublic:\n\t\tt numerator;\n\t\tt denominator;\n\n\t\tfraction():numerator(t(0)), denominator(t(1)){}\n\t\tfraction(t a, t b):numerator(a), denominator(b){}\n\t\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\n\n\t\tfraction pow(long long k){\n\t\t\tfraction res(1, 1);\n\t\t\tfraction sum(*this);\n\t\t\twhile(k){\n\t\t\t\tif(k&1)res*=sum;\n\t\t\t\tsum*=sum;\n\t\t\t\tk>>=1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tfraction& operator+=(fraction a){\n\t\t\tnumerator = numerator * a.denominator + a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator-=(fraction a){\n\t\t\tnumerator = numerator * a.denominator - a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator*=(fraction a){\n\t\t\tnumerator *= a.numerator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator/=(fraction a){\n\t\t\tnumerator *= a.denominator;\n\t\t\tdenominator *= a.numerator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction operator+(fraction a){return fraction(*this) += a;}\n\t\tfraction operator-(fraction a){return fraction(*this) -= a;}\n\t\tfraction operator*(fraction a){return fraction(*this) *= a;}\n\t\tfraction operator/(fraction a){return fraction(*this) /= a;}\n};\n\ntemplate<class t>\nbool operator<(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator < b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator>(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator > b.numerator * a.denominator;\n}\ntemplate<class t>\nbool operator==(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator == b.numerator * a.denominator;\n}\n\nvector<double> func(){\n int n = in();\n int m = in();\n int l = in();\n using F = fraction<ll>;\n using P = pair<F,double>;\n method(calc,vector<P>,double p,int v,int t){\n vector<double> dp(m+1,0);\n dp[0] = 1;\n rep(_,m){\n vector<double> ndp(m+1,0);\n rep(i,m){\n ndp[i] += (1-p) * dp[i];\n ndp[i+1] += p * dp[i];\n }\n swap(dp,ndp);\n }\n vector<P> res;\n rep(i,dp.size()){\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\n }\n return res;\n };\n vvector<P> line;\n const F inf = F(1000000,1);\n rep(i,n){\n double p = in() / 100.0;\n int t = in();\n int v = in();\n if(v==0){\n line.emplace_back(vector<P>({{inf,1}}));\n }else{\n line.emplace_back(calc(p,v,t));\n }\n }\n vector<double> res;\n rep(i,n){\n double sum = 0;\n foreach(p,line[i]){\n double add = p.second;\n if(p.first==inf)continue;\n rep(j,n){\n if(i==j)continue;\n double psum = 0;\n foreach(k,line[j]){\n if(p.first < k.first)psum += k.second;\n }\n add *= psum;\n }\n sum += add;\n }\n res.emplace_back(sum);\n }\n return res;\n}\n\nint main(){\n foreach(i,func())println(i);\n return 0;\n}","accuracy":0.14285714285714285,"time_ms":20,"memory_kb":3752,"score_of_the_acc":-0.0942,"final_rank":17},{"submission_id":"aoj_2303_6552878","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\n\ntemplate<class t>\nclass fraction{\n\tpublic:\n\t\tt numerator;\n\t\tt denominator;\n\n\t\tfraction():numerator(t(0)), denominator(t(1)){}\n\t\tfraction(t a, t b):numerator(a), denominator(b){}\n\t\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\n\n\t\tfraction pow(long long k){\n\t\t\tfraction res(1, 1);\n\t\t\tfraction sum(*this);\n\t\t\twhile(k){\n\t\t\t\tif(k&1)res*=sum;\n\t\t\t\tsum*=sum;\n\t\t\t\tk>>=1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tfraction& operator+=(fraction a){\n\t\t\tnumerator = numerator * a.denominator + a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator-=(fraction a){\n\t\t\tnumerator = numerator * a.denominator - a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator*=(fraction a){\n\t\t\tnumerator *= a.numerator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator/=(fraction a){\n\t\t\tnumerator *= a.denominator;\n\t\t\tdenominator *= a.numerator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction operator+(fraction a){return fraction(*this) += a;}\n\t\tfraction operator-(fraction a){return fraction(*this) -= a;}\n\t\tfraction operator*(fraction a){return fraction(*this) *= a;}\n\t\tfraction operator/(fraction a){return fraction(*this) /= a;}\n};\n\ntemplate<class t>\nbool operator<(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator < b.numerator * a.denominator;\n}\n\nvector<double> func(){\n int n = in();\n int m = in();\n int l = in();\n using F = fraction<ll>;\n using P = pair<F,double>;\n method(calc,vector<P>,double p,int v,int t){\n vector<double> dp(m+1,0);\n dp[0] = 1;\n rep(_,m){\n vector<double> ndp(m+1,0);\n rep(i,m){\n ndp[i] += (1-p) * dp[i];\n ndp[i+1] += p * dp[i];\n }\n swap(dp,ndp);\n }\n vector<P> res;\n rep(i,dp.size()){\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\n }\n return res;\n };\n vvector<P> line;\n rep(i,n){\n double p = in() / 100.0;\n int t = in();\n int v = in();\n if(v==0){\n line.emplace_back(vector<P>({{F(1000000,1),1}}));\n }else{\n line.emplace_back(calc(p,v,t));\n }\n }\n vector<double> res;\n rep(i,n){\n double sum = 0;\n foreach(p,line[i]){\n double add = p.second;\n rep(j,n){\n if(i==j)continue;\n double psum = 0;\n foreach(k,line[j]){\n if(p.first < k.first)psum += k.second;\n }\n add *= psum;\n }\n sum += add;\n }\n res.emplace_back(sum);\n }\n return res;\n}\n\nint main(){\n foreach(i,func())println(i);\n return 0;\n}","accuracy":0.14285714285714285,"time_ms":20,"memory_kb":3760,"score_of_the_acc":-0.0983,"final_rank":19},{"submission_id":"aoj_2303_6552870","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\n#define foreach(i, n) for(auto &i:(n))\n#define all(x) (x).begin(), (x).end()\n#define bit(x) (1ll << (x))\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n//const ll MOD = (ll)1e9+7;\nconst ll MOD = 998244353;\nconst int INF = (ll)1e9+7;\nconst ll INFLL = (ll)1e18;\ntemplate<class t>\nusing vvector = vector<vector<t>>;\ntemplate<class t>\nusing vvvector = vector<vector<vector<t>>>;\ntemplate<class t>\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\n#ifdef DEBUG\n#define debug(x) cout<<\"LINE \"<<__LINE__<<\": \"<<#x<<\" = \"<<x<<endl;\n#else\n#define debug(x) (void)0\n#endif\n\nnamespace templates{\n ll modpow(ll x, ll b,ll mod=MOD){\n ll res = 1;\n while(b){\n if(b&1)res = res * x % mod;\n x = x * x % mod;\n b>>=1;\n }\n return res;\n }\n\n ll modinv(ll x){\n return modpow(x, MOD-2);\n }\n\n bool was_output = false;\n\n void print();\n template <class t> void print(const vector<t> &);\n template <class t, class u> void print(const pair<t, u> &);\n template <class t> void print(const t&);\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\n\n template <class t> void println(const vector<vector<t>>&);\n template <class t> void println(const vector<t>&);\n template <class t> void println(const t&);\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\n void println();\n void newline();\n\n void print(){\n return;\n }\n\n template <class t>\n void print(const vector<t>&x){\n for(const t&i:x)print(i);\n }\n template <class t, class u>\n void print(const pair<t,u>&p){\n print(p.first);\n print(p.second);\n }\n template <class t>\n void print(const t&x){\n if(was_output)cout<<\" \";\n cout<<x;\n was_output = true;\n }\n template <class Head, class... Tail>\n void print(const Head&head,const Tail&...tail){\n print(head);\n print(tail...);\n }\n\n template<class t>\n void println(const vector<vector<t>>&x){\n for(vector<t> i:x)println(i);\n }\n template<class t>\n void println(const vector<t>&x){\n for(const t&i:x)print(i);\n println();\n }\n template <class t>\n void println(const t&x){\n print(x);\n println();\n }\n void println(){\n if(was_output){\n cout << endl;\n was_output = false;\n }\n }\n template <class Head, class... Tail>\n void println(const Head&head,const Tail&...tail){\n print(head);\n println(tail...);\n }\n\n void newline(){\n was_output = true;\n println();\n }\n\n template<class t>\n istream& operator>>(istream&is, vector<t>&x){\n for(auto &i:x)is >> i;\n return is;\n }\n\n template<class t, class u>\n istream& operator>>(istream&is, pair<t, u>&x){\n is >> x.first >> x.second;\n return is;\n }\n\n template<class t>\n ostream& operator<<(ostream&os, vector<t> &v){\n os << \"{\";\n for(t &i:v){\n os << i << \", \";\n }\n os << \"}\";\n return os;\n }\n\n template<class t = long long>\n t in(){\n t res; cin >> res; return res;\n }\n\n template<class t>\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\n sort(line.begin(),line.end(),comp);\n return line;\n }\n\n template<class t>\n vector<t> reversed(vector<t> line){\n reverse(line.begin(),line.end());\n return line;\n }\n string reversed(string str){\n reverse(str.begin(),str.end());\n return str;\n }\n\n long long gcd(long long a,long long b){\n while(b){\n a %= b;\n swap(a,b);\n }\n return a;\n }\n\n long long lcm(long long a,long long b){\n return a / gcd(a,b) * b;\n }\n\n class output_initializer{\n public:\n output_initializer(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << setprecision(20);\n }\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\n}\n\nusing namespace templates;\n\n\ntemplate<class t>\nclass fraction{\n\tpublic:\n\t\tt numerator;\n\t\tt denominator;\n\n\t\tfraction():numerator(t(0)), denominator(t(1)){}\n\t\tfraction(t a, t b):numerator(a), denominator(b){}\n\t\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\n\n\t\tfraction pow(long long k){\n\t\t\tfraction res(1, 1);\n\t\t\tfraction sum(*this);\n\t\t\twhile(k){\n\t\t\t\tif(k&1)res*=sum;\n\t\t\t\tsum*=sum;\n\t\t\t\tk>>=1;\n\t\t\t}\n\t\t\treturn res;\n\t\t}\n\n\t\tfraction& operator+=(fraction a){\n\t\t\tnumerator = numerator * a.denominator + a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator-=(fraction a){\n\t\t\tnumerator = numerator * a.denominator - a.numerator * denominator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator*=(fraction a){\n\t\t\tnumerator *= a.numerator;\n\t\t\tdenominator *= a.denominator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction& operator/=(fraction a){\n\t\t\tnumerator *= a.denominator;\n\t\t\tdenominator *= a.numerator;\n\t\t\treturn *this;\n\t\t}\n\n\t\tfraction operator+(fraction a){return fraction(*this) += a;}\n\t\tfraction operator-(fraction a){return fraction(*this) -= a;}\n\t\tfraction operator*(fraction a){return fraction(*this) *= a;}\n\t\tfraction operator/(fraction a){return fraction(*this) /= a;}\n};\n\ntemplate<class t>\nbool operator<(fraction<t> a,fraction<t> b){\n return a.numerator * b.denominator < b.numerator * a.denominator;\n}\n\nvector<double> func(){\n int n = in();\n int m = in();\n int l = in();\n using F = fraction<ll>;\n using P = pair<F,double>;\n method(calc,vector<P>,double p,int v,int t){\n vector<double> dp(m+1,0);\n dp[0] = 1;\n rep(_,m){\n vector<double> ndp(m+1,0);\n rep(i,m){\n ndp[i] += (1-p) * dp[i];\n ndp[i+1] += p * dp[i];\n }\n swap(dp,ndp);\n }\n vector<P> res;\n rep(i,dp.size()){\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\n }\n return res;\n };\n vvector<P> line;\n rep(i,n){\n double p = in() / 100.0;\n int t = in();\n int v = in();\n line.emplace_back(calc(p,v,t));\n }\n vector<double> res;\n rep(i,n){\n double sum = 0;\n foreach(p,line[i]){\n double add = p.second;\n rep(j,n){\n if(i==j)continue;\n double psum = 0;\n foreach(k,line[j]){\n if(p.first < k.first)psum += k.second;\n }\n add *= psum;\n }\n sum += add;\n }\n res.emplace_back(sum);\n }\n return res;\n}\n\nint main(){\n foreach(i,func())println(i);\n return 0;\n}","accuracy":0.14285714285714285,"time_ms":20,"memory_kb":3756,"score_of_the_acc":-0.0962,"final_rank":18},{"submission_id":"aoj_2303_5918315","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing P = pair<int64_t,int64_t>;\n\nvoid solve(){\n int64_t N, M, L;\n cin >> N >> M >> L;\n vector<long double> p(N);\n vector<P> vec(N);\n for(int i=0; i<N; i++){\n cin >> p[i];\n p[i] /= 100;\n int x, y;\n cin >> x >> y;\n vec[i] = P(x,y);\n }\n vector<int64_t> COM(M+1);\n vector<vector<long double>> C(N,vector<long double>(M+1));\n for(int i=0; i<=M; i++){\n if(i == 0){\n COM[i] = 1;\n }\n else{\n COM[i] = COM[i-1]*(M-i+1)/i;\n }\n for(int j=0; j<N; j++){\n C[j][i] = COM[i]*pow(p[j],i)*pow(1-p[j],M-i);\n }\n }\n for(int i=0; i<N; i++){ //person\n long double ans = 0;\n auto[a1,b1] = vec[i];\n for(int j=0; j<=M; j++){ //rest times\n long double prob = C[i][j];\n for(int k=0; k<N; k++){\n if(k == i){\n continue;\n }\n auto[a2,b2] = vec[k];\n long double prob2 = 0;\n for(int l=0; l<=M; l++){\n if(b2*(a1*j*b1 + L) < b1*(a2*l*b2 + L)){\n //cout << j << \" \" << k << \" \" << *pow(p[k],l)*pow(1-p[k],M-l) << endl;\n prob2 += C[k][l];\n }\n }\n //cout << \"SUM:\" << i << \" \" << j << \" \" << prob2 << endl;\n prob *= prob2;\n }\n ans += prob;\n }\n cout << fixed << setprecision(15) << ans << endl;\n }\n}\n\nint main(){\n while(true){\n solve();\n break;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3652,"score_of_the_acc":-0.0424,"final_rank":4},{"submission_id":"aoj_2303_5884342","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 ALL(v) (v).begin(), (v).end()\n#define RALL(v) (v).rbegin(), (v).rend()\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(i, n) FOR(i, 0, n)\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 60;\nconstexpr int MOD = 1000000007;\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\nll C[55][55];\n\nvoid init() {\n C[0][0] = 1;\n FOR(i, 1, 55) {\n C[i][0] = 1;\n FOR(j, 1, 55) {\n C[i][j] = C[i-1][j-1] + C[i-1][j];\n }\n }\n}\n\nint main() {\n init();\n int N, M, L;\n cin >> N >> M >> L;\n vector<ll> P(N), T(N), V(N);\n REP(i, N) cin >> P[i] >> T[i] >> V[i];\n\n vector prob(N, vector(M+1, vector<double>(M+1)));\n REP(i, N) {\n prob[i][0][0] = 1.0;\n REP(j, M) {\n REP(k, M+1) {\n prob[i][j+1][k] += prob[i][j][k] * (100 - P[i]) / 100;\n if(k < M) prob[i][j+1][k+1] += prob[i][j][k] * P[i] / 100;\n }\n }\n }\n\n REP(i, N) {\n if(V[i] == 0) {\n cout << 0.0 << endl;\n continue;\n }\n double ans = 0.0;\n REP(ci, M+1) {\n double p = prob[i][M][ci];\n REP(j, N) {\n if(i == j) continue;\n if(V[j] == 0) continue;\n double sum = 0;\n REP(cj, M+1) {\n double diff = double(L)/V[i] + ci*T[i] - double(L)/V[j] - cj*T[j];\n if(diff >= 0.0) continue;\n sum += prob[j][M][cj];\n }\n p *= sum;\n }\n ans += p;\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":5524,"score_of_the_acc":-1.0114,"final_rank":9},{"submission_id":"aoj_2303_5851689","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.01 15:05: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\nusing R = long double;\n\nvoid solve(int n) {\n\tint m;\n\tcin >> m;\n\tint length;\n\tcin >> length;\n\tvector<R> prob(n);\n\tvector<R> time(n);\n\tvector<R> velocity(n);\n\n\trep(i, n) {\n\t\tcin >> prob[i] >> time[i] >> velocity[i];\n\t\tprob[i] /= 100;\n\t}\n\n\tauto cost_all = [&](int person, int rest_count) {\n\t\treturn velocity[person] > 0 ? time[person] * rest_count + length / velocity[person] : INF;\n\t};\n\n\tVV<R> prob_rest(n, V<R>(m + 1));\n\trep(i, n) prob_rest[i][0] = 1;\n\trep(m) {\n\t\tauto tmp = prob_rest;\n\t\ttmp.assign(n, V<R>(m + 1, 0));\n\n\t\trep(i, n) {\n\t\t\trep(j, m + 1) {\n\t\t\t\ttmp[i][j] += prob_rest[i][j] * (1 - prob[i]);\n\t\t\t\tif(j < m) {\n\t\t\t\t\ttmp[i][j + 1] += prob_rest[i][j] * prob[i];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tswap(tmp, prob_rest);\n\t}\n\n\tdebug(prob_rest);\n\n\tauto win_prob = [&](int person, int rest_count) {\n\t\tR cost = cost_all(person, rest_count);\n\t\tR ans = 1;\n\t\tdebug(person, rest_count, cost);\n\t\trep(opponent, n) {\n\t\t\tif(opponent == person) continue;\n\t\t\tR res = 0;\n\t\t\trep(rest_count_opponent, m + 1) {\n\t\t\t\tif(cost_all(opponent, rest_count_opponent) > cost + 1e-10) {\n\t\t\t\t\tres += prob_rest[opponent][rest_count_opponent];\n\n\t\t\t\t\tdebug(opponent, rest_count_opponent);\n\t\t\t\t}\n\t\t\t}\n\t\t\tans *= res;\n\t\t}\n\t\treturn ans * prob_rest[person][rest_count];\n\t};\n\n\tR ret = 0;\n\trep(i, n) {\n\t\tret = 0;\n\t\trep(j, m + 1) { ret += win_prob(i, j); }\n\t\tcout << ret << dl;\n\t}\n\n\treturn;\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\t// std::cerr << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint n;\n\twhile(cin >> n) {\n\t\t// cout << (solve(n)) << dl;\n\t\tsolve(n);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3708,"score_of_the_acc":-0.0941,"final_rank":7},{"submission_id":"aoj_2303_5846900","code_snippet":"#line 1 \"/Users/nok0/Documents/Programming/nok0/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\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}\n#if __has_include(<atcoder/all>)\nstd::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\ntemplate <int m>\nstd::istream &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 &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\n#endif\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}\n#if __has_include(<atcoder/all>)\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\n#endif\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}\ntemplate <class T>\nvoid MUL(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v *= x;\n}\ntemplate <class T>\nvoid DIV(std::vector<T> &a, const T x) {\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}\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}\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 2 \"d.cpp\"\n\nvoid main_() {\n\tINT(n, m);\n\tDOUBLE(L);\n\tV<> P(n), t(n), v(n);\n\tREP(i, n) { cin >> P[i] >> t[i] >> v[i]; }\n\tV<double> p(n);\n\tREP(i, n) { p[i] = (double)P[i] / 100; }\n\tvector binom(m + 1, 1.0);\n\tdouble mul = 1;\n\tREPS(i, m) {\n\t\tmul *= (m + 1 - i);\n\t\tmul /= i;\n\t\tbinom[i] = mul;\n\t}\n\tREP(i, n) {\n\t\tdouble res = 0;\n\t\tREP(j, m + 1) {\n\t\t\t//iさんが休憩をちょうどj回とって勝つ確率\n\t\t\tdouble prob = binom[j] * pow(p[i], j) * pow(1 - p[i], m - j);\n\t\t\tREP(k, n) {\n\t\t\t\tif(k == i) continue;\n\t\t\t\tdouble tmp_sum = 0;\n\t\t\t\tREP(l, m + 1) {\n\t\t\t\t\tif(t[k] * l * v[k] * v[i] + L * v[i] <= t[i] * j * v[k] * v[i] + L * v[k]) continue;\n\t\t\t\t\tdebug(k, l);\n\t\t\t\t\tdouble tmp_prob = binom[l] * pow(p[k], l) * pow(1 - p[k], m - l);\n\t\t\t\t\ttmp_sum += tmp_prob;\n\t\t\t\t}\n\t\t\t\tprob *= tmp_sum;\n\t\t\t}\n\t\t\tres += prob;\n\t\t}\n\t\tprint(res);\n\t}\n}","accuracy":1,"time_ms":890,"memory_kb":3984,"score_of_the_acc":-1.2029,"final_rank":11},{"submission_id":"aoj_2303_5843632","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing T = tuple<long long, long long, long long>;\n\nint n, m, l;\nvector<vector<long long>> comb;\nvector<T> v;\n\nvector<long double> solve();\n\nint main() {\n cin >> n >> m >> l;\n for (int i = 0; i < n; ++i) {\n int x, y, z;\n cin >> x >> y >> z;\n v.emplace_back(x, y, z);\n }\n auto res = solve();\n cout << fixed << setprecision(10);\n for (auto &p : res) cout << p << endl;\n return 0;\n}\n\nvector<long double> solve() {\n comb.resize(m + 1);\n comb[0].push_back(1);\n for (int i = 1; i <= m; ++i) {\n comb[i].resize(i + 1);\n for (int j = 0; j < i; ++j)\n comb[i][j] += comb[i - 1][j], comb[i][j + 1] += comb[i - 1][j];\n }\n vector<vector<long double>> prob(n, vector<long double>(m + 1, 0));\n for (int i = 0; i < n; ++i) {\n auto [p, t, s] = v[i];\n for (int j = 0; j <= m; ++j) prob[i][j] = comb[m][j];\n long double now = 1;\n for (int j = 0; j <= m; ++j) {\n prob[i][j] *= now;\n now *= p / 100.0L;\n }\n now = 1;\n for (int j = m; j >= 0; --j) {\n prob[i][j] *= now;\n now *= (100 - p) / 100.0L;\n }\n }\n vector<long double> res(n, 0);\n for (int i = 0; i < n; ++i) {\n auto [pi, ti, si] = v[i];\n for (int itimes = 0; itimes <= m; ++itimes) {\n long double now = prob[i][itimes];\n for (int j = 0; j < n; ++j)\n if (i != j) {\n auto [pj, tj, sj] = v[j];\n long double sum = 0;\n for (int jtimes = 0; jtimes <= m; ++jtimes) {\n long long lef = (itimes * ti - jtimes * tj) * si * sj,\n righ = l * (si - sj);\n if (lef < righ) sum += prob[j][jtimes];\n }\n now *= sum;\n }\n res[i] += now;\n }\n }\n return res;\n}","accuracy":1,"time_ms":10,"memory_kb":3600,"score_of_the_acc":-0.0041,"final_rank":2},{"submission_id":"aoj_2303_5238661","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define INF_LL (int64)1e18\n#define INF (int32)1e9\n#define REP(i, n) for(int64 i = 0;i < (n);i++)\n#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)\n#define all(x) x.begin(),x.end()\n#define fs first\n#define sc second\n\nusing int32 = int_fast32_t;\nusing uint32 = uint_fast32_t;\nusing int64 = int_fast64_t;\nusing uint64 = uint_fast64_t;\nusing PII = pair<int32, int32>;\nusing PLL = pair<int64, int64>;\n\nconst double eps = 1e-10;\n\ntemplate<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}\ntemplate<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}\n\ntemplate<typename T>\nvector<T> make_v(size_t a){return vector<T>(a);}\n\ntemplate<typename T,typename... Ts>\nauto make_v(size_t a,Ts... ts){\n\treturn vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\n}\n\ntemplate<typename T,typename U,typename... V>\ntypename enable_if<is_same<T, U>::value!=0>::type\nfill_v(U &u,const V... v){u=U(v...);}\n\ntemplate<typename T,typename U,typename... V>\ntypename enable_if<is_same<T, U>::value==0>::type\nfill_v(U &u,const V... v){\n\tfor(auto &e:u) fill_v<T>(e,v...);\n}\n\ntemplate <typename F>\nclass\n#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\n [[nodiscard]]\n#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\nFixPoint final : private F\n{\npublic:\n template <typename G>\n explicit constexpr FixPoint(G&& g) noexcept\n : F{std::forward<G>(g)}\n {}\n\n template <typename... Args>\n constexpr decltype(auto)\n operator()(Args&&... args) const\n#if !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\n noexcept(noexcept(F::operator()(std::declval<FixPoint>(), std::declval<Args>()...)))\n#endif // !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\n {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n}; // class FixPoint\n\n\n#if defined(__cpp_deduction_guides)\ntemplate <typename F>\nFixPoint(F&&)\n -> FixPoint<std::decay_t<F>>;\n#endif // defined(__cpp_deduction_guides)\n\n\nnamespace\n{\n template <typename F>\n#if !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\n # if defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\n__attribute__((warn_unused_result))\n# elif defined(_MSC_VER) && _MSC_VER >= 1700 && defined(_Check_return_)\n_Check_return_\n# endif // defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\n#endif // !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\n inline constexpr decltype(auto)\n makeFixPoint(F&& f) noexcept\n {\n return FixPoint<std::decay_t<F>>{std::forward<std::decay_t<F>>(f)};\n }\n} // namespace\n\nvector<int64> dijkstra(const vector<vector<int64>>& G, int s) {\n priority_queue<PLL, vector<PLL>, greater<>> pq;\n vector<int64> d(G.size(), INF_LL);\n d[s] = 0;\n pq.emplace(0, s);\n\n while (pq.size()) {\n int64 v, c;\n tie(c, v) = pq.top(); pq.pop();\n if (d[v] < c) continue;\n for (auto& u : G[v]) {\n if (d[u] > c + 1) {\n d[u] = c + 1;\n pq.emplace(c+1, u);\n }\n }\n }\n return d;\n}\n\ndouble comb(int a, int b) {\n double res = 1;\n REP(i, b) {\n res = res * (a - i) / (b - i);\n }\n return res;\n}\n\nint main(void) {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int64 N, M;\n double L;\n cin >> N >> M >> L;\n vector<double> P(N), V(N);\n vector<int64> T(N);\n\n REP(i, N) {\n cin >> P[i] >> T[i] >> V[i];\n P[i] = P[i] / 100;\n }\n\n auto prob = make_v<double>(N, M+1);\n auto time = make_v<double>(N, M+1);\n\n REP(i, N) {\n REP(j, M+1) {\n double prest = 1, pnot = 1;\n REP(k, j) prest *= P[i];\n REP(k, M-j) pnot *= 1-P[i];\n prob[i][j] = comb(M, j) * prest * pnot;\n time[i][j] = L / V[i] + T[i] * j;\n// cout << \"(\" << prob[i][j] << \" \" << time[i][j] << \") \";\n }\n// cout << endl;\n }\n\n REP(i, N) {\n double res = 0;\n REP(j, M+1) {\n double rprob = prob[i][j];\n REP(k, N) {\n if (k == i) continue;\n double sum = 0;\n REP(l, M+1) {\n if (time[k][l] > time[i][j]) {\n sum += prob[k][l];\n }\n }\n// cout << sum << \" \";\n rprob *= sum;\n }\n// cout << rprob << endl;\n res += rprob;\n }\n cout << fixed << setprecision(10) << res << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3632,"score_of_the_acc":-0.0321,"final_rank":3},{"submission_id":"aoj_2303_5189978","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, x, n) for(int i = x; i <= n; i++)\n#define rep3(i, x, n) for(int i = x; i >= n; i--)\n#define each(e, v) for(auto &e: v)\n#define pb push_back\n#define eb emplace_back\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n#define sz(x) (int)x.size()\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pil = pair<int, ll>;\nusing pli = pair<ll, int>;\nusing pll = pair<ll, ll>;\nconst int MOD = 1000000007;\n//const int MOD = 998244353;\nconst int inf = (1<<30)-1;\nconst ll INF = (1LL<<60)-1;\ntemplate<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};\ntemplate<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};\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, M, L; cin >> N >> M >> L;\n\n vector<double> fac(M+1, 0.0);\n rep2(i, 1, M){\n fac[i] = fac[i-1]+log(i);\n }\n\n vector<vector<double>> q(N, vector<double>(M+1, 0.0));\n vector<int> T(N), V(N);\n rep(i, N){\n int P; cin >> P >> T[i] >> V[i];\n if(P == 0){\n q[i][0] = 1.0;\n continue;\n }\n if(P == 100){\n q[i][M] = 1.0;\n continue; \n }\n rep(j, M+1){\n double p = P/100.0;\n q[i][j] = fac[M]-fac[j]-fac[M-j]+j*log(p)+(M-j)*log(1.0-p);\n q[i][j] = exp(q[i][j]);\n }\n }\n\n double EPS = 1e-10;\n\n rep(i, N){\n if(V[i] == 0) {cout << 0.0 << '\\n'; continue;}\n double ans = 0.0;\n rep(j, M+1){\n double tmp = q[i][j], t = double(L)/V[i]+j*T[i];\n rep(k, N){\n if(k == i) continue;\n double s = 0.0;\n rep(l, M+1){\n if(V[k] == 0) {s += q[k][l]; continue;}\n if(t+EPS < double(L)/V[k]+l*T[k]) s += q[k][l];\n }\n tmp *= s;\n }\n ans += tmp;\n }\n\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":30,"memory_kb":4008,"score_of_the_acc":-0.238,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_2303_10853140\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntemplate <class T>\\ninline bool rd(T &ret) {\\n char c; int sgn;\\n if(c=getchar(),c==EOF) return 0;\\n while(c!='-'&&(c<'0'||c>'9')) c=getchar();\\n sgn=(c=='-')?-1:1;\\n ret=(c=='-')?0:(c-'0');\\n while(c=getchar(),c>='0'&&c<='9') ret=ret*10+(c-'0');\\n ret*=sgn;\\n return 1;\\n}\\ntemplate <class T>\\ninline void pt(T x) {\\n if (x <0) {\\n putchar('-');\\n x = -x;\\n }\\n if(x>9) pt(x/10);\\n putchar(x%10+'0');\\n}\\nusing namespace std;\\ntypedef long long ll;\\nconst int MAXN = 55;\\ndouble C[MAXN+1][MAXN+1];\\nvoid Initial()\\n{\\n memset(C, 0, sizeof C);\\n for(int i=0; i<=MAXN; ++i)\\n {\\n C[0][i] = 0.0;\\n C[i][0] = 1.0;\\n }\\n for(int i=1; i<=MAXN; ++i)\\n {\\n for(int j=1; j<=MAXN; ++j)\\n C[i][j] = C[i-1][j] + C[i-1][j-1];\\n }\\n}\\nconst int N = 110;\\nint n, m;\\nint l, t[N], v[N];\\ndouble p[N];\\ndouble Pow(double x, int y){\\n double ans = 1.0;\\n while(y){\\n if(y&1)ans *= x;\\n x = x*x;\\n y >>= 1;\\n }\\n return ans;\\n}\\ndouble work(int x){\\n double ans = 0.0;\\n for(int i = 0; i <= m; i++)\\n {\\n double pp = C[m][i] * Pow(p[x], i) * Pow(1.0-p[x], m-i);\\n for(int j = 1; j <= n; j++)\\n {\\n if(j == x)continue;\\n double siz = 0;\\n for(int k = m; k >= 0; k--)\\n {\\n if(l*v[j] + i*t[x]*v[j]*v[x] < l*v[x] + k*t[j]*v[x]*v[j])\\n siz += C[m][k] * Pow(p[j], k) * Pow(1.0-p[j], m-k);\\n else break;\\n }\\n pp *= siz;\\n }\\n ans += pp;\\n }\\n return ans;\\n}\\nvoid input(){\\n for(int i = 1; i <= n; i++)\\n {\\n rd(p[i]);rd(t[i]);rd(v[i]);\\n p[i] /= 100.0;\\n }\\n}\\nint main(){\\n Initial();\\n while(cin>>n>>m>>l){\\n input();\\n for(int i = 1; i <= n; i++)\\n printf(\\\"%.10f\\\\n\\\", work(i));\\n }\\n return 0;\\n}\\n/*\\n30 0 12\\n0.5\\n0\\n13\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3596,\n \"score_of_the_acc\": -0.0703,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2303_9666990\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\n ll N, M, L;\\n cin >> N >> M >> L;\\n vector<double> P(N);\\n vector<ll> T(N), V(N);\\n rep(i,0,N) {\\n cin >> P[i] >> T[i] >> V[i];\\n P[i] /= 100.0;\\n }\\n vector<vector<double>> X(N);\\n rep(i,0,N) {\\n if (V[i] == 0) continue;\\n vector<double> DP(M+1,0), NewDP(M+1,0);\\n DP[0] = 1;\\n rep(j,0,M) {\\n rep(k,0,M+1) NewDP[k] = 0;\\n rep(k,0,M+1) {\\n if (DP[k] == 0) continue;\\n NewDP[k] += DP[k] * (1-P[i]);\\n NewDP[k+1] += DP[k] * P[i];\\n }\\n swap(DP,NewDP);\\n }\\n X[i].resize(M+1);\\n rep(j,0,M+1) X[i][j] = DP[j];\\n }\\n rep(i,0,N) {\\n double ANS = 0;\\n rep(j,0,X[i].size()) {\\n double MUL = X[i][j];\\n rep(k,0,N) {\\n if (k == i) continue;\\n double SUM = 0.0;\\n if (X[k].empty()) SUM = 1.0;\\n else {\\n rep(l,0,X[k].size()) {\\n if ((L+V[i]*T[i]*j)*V[k] < (L+V[k]*T[k]*l)*V[i]) SUM += X[k][l];\\n }\\n }\\n MUL *= SUM;\\n }\\n ANS += MUL;\\n }\\n printf(\\\"%.12f\\\\n\\\", ANS);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2303_9666972\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\n ll N, M, L;\\n cin >> N >> M >> L;\\n vector<double> P(N);\\n vector<ll> T(N), V(N);\\n rep(i,0,N) {\\n cin >> P[i] >> T[i] >> V[i];\\n P[i] /= 100.0;\\n }\\n vector<vector<double>> X(N);\\n rep(i,0,N) {\\n if (V[i] == 0) continue;\\n vector<double> DP(M+1,0), NewDP(M+1,0);\\n DP[0] = 1;\\n rep(j,0,M) {\\n rep(k,0,M+1) NewDP[k] = 0;\\n rep(k,0,M+1) {\\n if (DP[k] == 0) continue;\\n NewDP[k] += DP[k] * (1-P[i]);\\n NewDP[k+1] += DP[k] * P[i];\\n }\\n swap(DP,NewDP);\\n }\\n X[i].resize(M+1);\\n rep(j,0,M+1) X[i][j] = DP[j];\\n }\\n rep(i,0,N) {\\n double ANS = 0;\\n rep(j,0,X[i].size()) {\\n double MUL = X[i][j];\\n rep(k,0,N) {\\n if (k == i) continue;\\n double SUM = 0.0;\\n rep(l,0,X[k].size()) {\\n if ((L+V[i]*T[i]*j)*V[k] < (L+V[k]*T[k]*l)*V[i]) SUM += X[k][l];\\n }\\n MUL *= SUM;\\n }\\n ANS += MUL;\\n }\\n printf(\\\"%.12f\\\\n\\\", ANS);\\n }\\n}\",\n \"accuracy\": 0.18571428571428572,\n \"time_ms\": 10,\n \"memory_kb\": 3612,\n \"score_of_the_acc\": -0.0104,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2303_8986393\",\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 2 \\\"cp-library/src/number/binom_table.hpp\\\"\\n\\ntemplate < class T >\\nstd::vector< std::vector< T > > binom_table(int N) {\\n std::vector table(N + 1, std::vector(N + 1, T(0)));\\n table[0][0] = 1;\\n for(int i : rep(1, N + 1)) {\\n table[i][0] = 1;\\n for(int j : rep(1, N + 1))\\n table[i][j] = table[i - 1][j - 1] + table[i - 1][j];\\n }\\n return table;\\n}\\n#line 4 \\\"A.cpp\\\"\\n\\nint main() {\\n i64 N = in(), M = in(), L = in();\\n vector<i64> P(N), T(N), V(N);\\n for(int i : rep(N)) P[i] = in(), T[i] = in(), V[i] = in();\\n\\n auto comb = binom_table<ld>(55);\\n\\n vector<ld> ans(N, 0.0);\\n for(int i : rep(N)) {\\n for(int xi = 0; xi <= M; xi++) {\\n ld pxi = 1.0;\\n for(int j : rep(N)) if(j != i) {\\n ld cur = 0.0;\\n for(int xj = 0; xj <= M; xj++) {\\n i64 lhs = V[i] * V[j] * T[i] * xi + L * V[j];\\n i64 rhs = V[i] * V[j] * T[j] * xj + L * V[i];\\n if(lhs < rhs) {\\n cur += comb[M][xj] * pow(P[j] / 100.0, xj) * pow(1.0 - P[j] / 100.0, M - xj);\\n }\\n }\\n pxi *= cur;\\n }\\n pxi *= comb[M][xi] * pow(P[i] / 100.0, xi) * pow(1.0 - P[i] / 100.0, M - xi);\\n ans[i] += pxi;\\n }\\n }\\n\\n printer::precision(20);\\n for(int i : rep(N)) print(ans[i]);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 4032,\n \"score_of_the_acc\": -1.2277,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2303_6763587\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <chrono>\\n#include <thread>\\n////#include <atcoder/all>\\n\\n//using namespace atcoder;\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\n#define all(A) A.begin(),A.end()\\n#define 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\\ndouble EPS = 1e-9;\\ntemplate<class T>\\nbool chmin(T& p, T q) {\\n if (p > q + EPS) {\\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 = 998244353;\\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}\\nvector<string>S;\\nll dfs(ll L, ll R, ll n, char c = '+') {\\n ll res = 0;\\n if (c == '*')res = 1;\\n for (ll i = L; i <= R; i++) {\\n ll d = 0;\\n if (S[i].size() != n + 1)continue;\\n if (S[i][n] == '+') {\\n bool OK = 1;\\n for (ll j = i + 1; j < R; j++) {\\n if (S[j].size() == n + 1) {\\n d = dfs(i + 1, j - 1, n + 1, '+');\\n OK = 0;\\n break;\\n }\\n\\n }\\n if (OK)d = dfs(i + 1, R, n + 1, '+');\\n }\\n else if (S[i][n] == '*') {\\n bool OK = 1;\\n for (ll j = i + 1; j < R; j++) {\\n if (S[j].size() == n + 1) {\\n d = dfs(i + 1, j - 1, n + 1, '*');\\n OK = 0;\\n break;\\n }\\n\\n }\\n if (OK)d = dfs(i + 1, R, n + 1, '*');\\n }\\n else {\\n d = S[i][n] - '0';\\n }\\n if (c == '+')res += d;\\n else res *= d;\\n }\\n return res;\\n}\\nunordered_map<ll, ll> MA;\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n vvll comb(51,vll(51,0));\\n rep(i,51){\\n comb[i][0]=1;\\n rep(j,50){\\n comb[i][j+1]=comb[i][j]*double(i-j)/double(j+1);\\n }\\n }\\n\\n ll N,M,L;\\n cin>>N>>M>>L;\\n vector<tuple<double,ll,ll>> H(N);\\n rep(n,N){\\n double p;ll t,v;\\n cin>>p>>t>>v;\\n H[n]={p/100.0,t,v};\\n }\\n rep(n,N){\\n double an=0.0;\\n double p=get<0>(H[n]);\\n ll t=get<1>(H[n]);\\n ll v=get<2>(H[n]);\\n if(v<0.5){\\n cout<<0.0<<endl;\\n continue;\\n }\\n rep(m,M+1){\\n double q=double(comb[M][m])*pow(p,m)*pow(1-p,M-m);\\n rep(i,N){\\n if(n==i)continue;\\n double res=0.0;\\n double pi=get<0>(H[i]);\\n ll ti=get<1>(H[i]);\\n ll vi=get<2>(H[i]);\\n rep(j,M+1){\\n if(L*v+j*ti*vi*v<=L*vi+m*t*vi*v)continue;\\n res+=double(comb[M][j])*pow(pi,j)*pow(1-pi,M-j);\\n }\\n q*=res;\\n }\\n an+=q;\\n }\\n cout<<fixed<<setprecision(16)<<an<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 860,\n \"memory_kb\": 3996,\n \"score_of_the_acc\": -1.175,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2303_6552971\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\n\\ntemplate<class t>\\nclass fraction{\\n\\tpublic:\\n\\t\\tt numerator;\\n\\t\\tt denominator;\\n\\n\\t\\tfraction():numerator(t(0)), denominator(t(1)){}\\n\\t\\tfraction(t a, t b):numerator(a), denominator(b){}\\n\\t\\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\\n\\n\\t\\tfraction pow(long long k){\\n\\t\\t\\tfraction res(1, 1);\\n\\t\\t\\tfraction sum(*this);\\n\\t\\t\\twhile(k){\\n\\t\\t\\t\\tif(k&1)res*=sum;\\n\\t\\t\\t\\tsum*=sum;\\n\\t\\t\\t\\tk>>=1;\\n\\t\\t\\t}\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\n\\t\\tfraction& operator+=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator + a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator-=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator - a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator*=(fraction a){\\n\\t\\t\\tnumerator *= a.numerator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator/=(fraction a){\\n\\t\\t\\tnumerator *= a.denominator;\\n\\t\\t\\tdenominator *= a.numerator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction operator+(fraction a){return fraction(*this) += a;}\\n\\t\\tfraction operator-(fraction a){return fraction(*this) -= a;}\\n\\t\\tfraction operator*(fraction a){return fraction(*this) *= a;}\\n\\t\\tfraction operator/(fraction a){return fraction(*this) /= a;}\\n};\\n\\ntemplate<class t>\\nbool operator<(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator < b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator>(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator > b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator==(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator == b.numerator * a.denominator;\\n}\\n\\ndouble combination(int a,int b){\\n double res = 1;\\n rep(i,b){\\n res *= a - i;\\n res /= i + 1;\\n }\\n return res;\\n}\\n\\nvector<long double> func(){\\n int n = in();\\n int m = in();\\n int l = in();\\n using F = fraction<ll>;\\n using P = pair<F,long double>;\\n method(calc,vector<P>,long double p,int v,int t){\\n vector<P> res;\\n rep(i,m+1){\\n res.emplace_back(F(l,v)+F(t*i,1),combination(m,i) * pow(1-p,m-i) * pow(p,i));\\n }\\n return res;\\n };\\n vvector<P> line;\\n const F inf = F(1000000,1);\\n rep(i,n){\\n long double p = in() / 100.0;\\n int t = in();\\n int v = in();\\n if(v==0){\\n line.emplace_back(vector<P>({{inf,1}}));\\n }else{\\n line.emplace_back(calc(p,v,t));\\n }\\n }\\n vector<long double> res;\\n rep(i,n){\\n long double sum = 0;\\n foreach(p,line[i]){\\n long double add = p.second;\\n rep(j,n){\\n if(i==j)continue;\\n long double psum = 0;\\n foreach(k,line[j]){\\n if(p.first < k.first)psum += k.second;\\n }\\n add *= psum;\\n }\\n sum += add;\\n }\\n res.emplace_back(sum);\\n }\\n return res;\\n}\\n\\nint main(){\\n foreach(i,func())printf(\\\"%.20Lf\\\\n\\\",i);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -0.0921,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2303_6552965\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\n\\ntemplate<class t>\\nclass fraction{\\n\\tpublic:\\n\\t\\tt numerator;\\n\\t\\tt denominator;\\n\\n\\t\\tfraction():numerator(t(0)), denominator(t(1)){}\\n\\t\\tfraction(t a, t b):numerator(a), denominator(b){}\\n\\t\\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\\n\\n\\t\\tfraction pow(long long k){\\n\\t\\t\\tfraction res(1, 1);\\n\\t\\t\\tfraction sum(*this);\\n\\t\\t\\twhile(k){\\n\\t\\t\\t\\tif(k&1)res*=sum;\\n\\t\\t\\t\\tsum*=sum;\\n\\t\\t\\t\\tk>>=1;\\n\\t\\t\\t}\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\n\\t\\tfraction& operator+=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator + a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator-=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator - a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator*=(fraction a){\\n\\t\\t\\tnumerator *= a.numerator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator/=(fraction a){\\n\\t\\t\\tnumerator *= a.denominator;\\n\\t\\t\\tdenominator *= a.numerator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction operator+(fraction a){return fraction(*this) += a;}\\n\\t\\tfraction operator-(fraction a){return fraction(*this) -= a;}\\n\\t\\tfraction operator*(fraction a){return fraction(*this) *= a;}\\n\\t\\tfraction operator/(fraction a){return fraction(*this) /= a;}\\n};\\n\\ntemplate<class t>\\nbool operator<(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator < b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator>(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator > b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator==(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator == b.numerator * a.denominator;\\n}\\n\\ndouble combination(int a,int b){\\n double res = 1;\\n rep(i,b){\\n res *= a - i;\\n res /= i + 1;\\n }\\n return res;\\n}\\n\\nvector<long double> func(){\\n int n = in();\\n int m = in();\\n int l = in();\\n using F = fraction<ll>;\\n using P = pair<F,long double>;\\n method(calc,vector<P>,long double p,int v,int t){\\n vector<P> res;\\n rep(i,m+1){\\n res.emplace_back(F(l,v)+F(t*i,1),combination(m,i) * pow(1-p,m-i) * pow(p,i));\\n }\\n return res;\\n };\\n vvector<P> line;\\n const F inf = F(1000000,1);\\n rep(i,n){\\n long double p = in() / 100.0;\\n int t = in();\\n int v = in();\\n if(v==0){\\n line.emplace_back(vector<P>({{inf,1}}));\\n }else{\\n line.emplace_back(calc(p,v,t));\\n }\\n }\\n vector<long double> res;\\n rep(i,n){\\n long double sum = 0;\\n foreach(p,line[i]){\\n long double add = p.second;\\n rep(j,n){\\n if(i==j)continue;\\n long double psum = 0;\\n foreach(k,line[j]){\\n if(p.first < k.first)psum += k.second;\\n }\\n add *= psum;\\n }\\n sum += add;\\n }\\n res.emplace_back(sum);\\n }\\n return res;\\n}\\n\\nint main(){\\n foreach(i,func())println(i);\\n return 0;\\n}\",\n \"accuracy\": 0.14285714285714285,\n \"time_ms\": 20,\n \"memory_kb\": 3716,\n \"score_of_the_acc\": -0.0755,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2303_6552932\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\n\\ntemplate<class t>\\nclass fraction{\\n\\tpublic:\\n\\t\\tt numerator;\\n\\t\\tt denominator;\\n\\n\\t\\tfraction():numerator(t(0)), denominator(t(1)){}\\n\\t\\tfraction(t a, t b):numerator(a), denominator(b){}\\n\\t\\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\\n\\n\\t\\tfraction pow(long long k){\\n\\t\\t\\tfraction res(1, 1);\\n\\t\\t\\tfraction sum(*this);\\n\\t\\t\\twhile(k){\\n\\t\\t\\t\\tif(k&1)res*=sum;\\n\\t\\t\\t\\tsum*=sum;\\n\\t\\t\\t\\tk>>=1;\\n\\t\\t\\t}\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\n\\t\\tfraction& operator+=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator + a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator-=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator - a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator*=(fraction a){\\n\\t\\t\\tnumerator *= a.numerator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator/=(fraction a){\\n\\t\\t\\tnumerator *= a.denominator;\\n\\t\\t\\tdenominator *= a.numerator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction operator+(fraction a){return fraction(*this) += a;}\\n\\t\\tfraction operator-(fraction a){return fraction(*this) -= a;}\\n\\t\\tfraction operator*(fraction a){return fraction(*this) *= a;}\\n\\t\\tfraction operator/(fraction a){return fraction(*this) /= a;}\\n};\\n\\ntemplate<class t>\\nbool operator<(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator < b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator>(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator > b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator==(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator == b.numerator * a.denominator;\\n}\\n\\nvector<long double> func(){\\n int n = in();\\n int m = in();\\n int l = in();\\n using F = fraction<ll>;\\n using P = pair<F,long double>;\\n method(calc,vector<P>,long double p,int v,int t){\\n vector<long double> dp(m+1,0);\\n dp[0] = 1;\\n rep(_,m){\\n vector<long double> ndp(m+1,0);\\n rep(i,m+1){\\n ndp[i] += (1-p) * dp[i];\\n if(i+1<dp.size()){\\n ndp[i+1] += p * dp[i];\\n }\\n }\\n swap(dp,ndp);\\n }\\n vector<P> res;\\n rep(i,dp.size()){\\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\\n }\\n return res;\\n };\\n vvector<P> line;\\n const F inf = F(1000000,1);\\n rep(i,n){\\n long double p = in() / 100.0;\\n int t = in();\\n int v = in();\\n if(v==0){\\n line.emplace_back(vector<P>({{inf,1}}));\\n }else{\\n line.emplace_back(calc(p,v,t));\\n }\\n }\\n vector<long double> res;\\n rep(i,n){\\n long double sum = 0;\\n foreach(p,line[i]){\\n long double add = p.second;\\n rep(j,n){\\n if(i==j)continue;\\n long double psum = 0;\\n foreach(k,line[j]){\\n if(p.first < k.first)psum += k.second;\\n }\\n add *= psum;\\n }\\n sum += add;\\n }\\n res.emplace_back(sum);\\n }\\n return res;\\n}\\n\\nint main(){\\n foreach(i,func())println(i);\\n return 0;\\n}\",\n \"accuracy\": 0.14285714285714285,\n \"time_ms\": 20,\n \"memory_kb\": 3676,\n \"score_of_the_acc\": -0.0548,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2303_6552930\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\n\\ntemplate<class t>\\nclass fraction{\\n\\tpublic:\\n\\t\\tt numerator;\\n\\t\\tt denominator;\\n\\n\\t\\tfraction():numerator(t(0)), denominator(t(1)){}\\n\\t\\tfraction(t a, t b):numerator(a), denominator(b){}\\n\\t\\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\\n\\n\\t\\tfraction pow(long long k){\\n\\t\\t\\tfraction res(1, 1);\\n\\t\\t\\tfraction sum(*this);\\n\\t\\t\\twhile(k){\\n\\t\\t\\t\\tif(k&1)res*=sum;\\n\\t\\t\\t\\tsum*=sum;\\n\\t\\t\\t\\tk>>=1;\\n\\t\\t\\t}\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\n\\t\\tfraction& operator+=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator + a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator-=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator - a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator*=(fraction a){\\n\\t\\t\\tnumerator *= a.numerator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator/=(fraction a){\\n\\t\\t\\tnumerator *= a.denominator;\\n\\t\\t\\tdenominator *= a.numerator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction operator+(fraction a){return fraction(*this) += a;}\\n\\t\\tfraction operator-(fraction a){return fraction(*this) -= a;}\\n\\t\\tfraction operator*(fraction a){return fraction(*this) *= a;}\\n\\t\\tfraction operator/(fraction a){return fraction(*this) /= a;}\\n};\\n\\ntemplate<class t>\\nbool operator<(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator < b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator>(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator > b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator==(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator == b.numerator * a.denominator;\\n}\\n\\nvector<long double> func(){\\n int n = in();\\n int m = in();\\n int l = in();\\n using F = fraction<ll>;\\n using P = pair<F,long double>;\\n method(calc,vector<P>,long double p,int v,int t){\\n vector<long double> dp(m+1,0);\\n dp[0] = 1;\\n rep(_,m){\\n vector<long double> ndp(m+1,0);\\n rep(i,m+1){\\n ndp[i] += (1-p) * dp[i];\\n if(i+1<dp.size()){\\n ndp[i+1] += p * dp[i];\\n }\\n }\\n swap(dp,ndp);\\n }\\n vector<P> res;\\n rep(i,dp.size()){\\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\\n }\\n return res;\\n };\\n vvector<P> line;\\n const F inf = F(1000000,1);\\n rep(i,n){\\n long double p = in() / 100.0;\\n int t = in();\\n int v = in();\\n if(v==0){\\n line.emplace_back(vector<P>({{inf,1}}));\\n }else{\\n line.emplace_back(calc(p,v,t));\\n }\\n }\\n vector<long double> res;\\n rep(i,n){\\n long double sum = 0;\\n foreach(p,line[i]){\\n long double add = p.second;\\n if(p.first==inf)continue;\\n rep(j,n){\\n if(i==j)continue;\\n long double psum = 0;\\n foreach(k,line[j]){\\n if(p.first < k.first)psum += k.second;\\n }\\n add *= psum;\\n }\\n sum += add;\\n }\\n res.emplace_back(sum);\\n }\\n return res;\\n}\\n\\nint main(){\\n foreach(i,func())println(i);\\n return 0;\\n}\",\n \"accuracy\": 0.14285714285714285,\n \"time_ms\": 20,\n \"memory_kb\": 3688,\n \"score_of_the_acc\": -0.0611,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2303_6552908\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\n\\ntemplate<class t>\\nclass fraction{\\n\\tpublic:\\n\\t\\tt numerator;\\n\\t\\tt denominator;\\n\\n\\t\\tfraction():numerator(t(0)), denominator(t(1)){}\\n\\t\\tfraction(t a, t b):numerator(a), denominator(b){}\\n\\t\\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\\n\\n\\t\\tfraction pow(long long k){\\n\\t\\t\\tfraction res(1, 1);\\n\\t\\t\\tfraction sum(*this);\\n\\t\\t\\twhile(k){\\n\\t\\t\\t\\tif(k&1)res*=sum;\\n\\t\\t\\t\\tsum*=sum;\\n\\t\\t\\t\\tk>>=1;\\n\\t\\t\\t}\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\n\\t\\tfraction& operator+=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator + a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator-=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator - a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator*=(fraction a){\\n\\t\\t\\tnumerator *= a.numerator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator/=(fraction a){\\n\\t\\t\\tnumerator *= a.denominator;\\n\\t\\t\\tdenominator *= a.numerator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction operator+(fraction a){return fraction(*this) += a;}\\n\\t\\tfraction operator-(fraction a){return fraction(*this) -= a;}\\n\\t\\tfraction operator*(fraction a){return fraction(*this) *= a;}\\n\\t\\tfraction operator/(fraction a){return fraction(*this) /= a;}\\n};\\n\\ntemplate<class t>\\nbool operator<(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator < b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator>(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator > b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator==(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator == b.numerator * a.denominator;\\n}\\n\\nvector<long double> func(){\\n int n = in();\\n int m = in();\\n int l = in();\\n using F = fraction<ll>;\\n using P = pair<F,long double>;\\n method(calc,vector<P>,long double p,int v,int t){\\n vector<long double> dp(m+1,0);\\n dp[0] = 1;\\n rep(_,m){\\n vector<long double> ndp(m+1,0);\\n rep(i,m){\\n ndp[i] += (1-p) * dp[i];\\n ndp[i+1] += p * dp[i];\\n }\\n swap(dp,ndp);\\n }\\n vector<P> res;\\n rep(i,dp.size()){\\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\\n }\\n return res;\\n };\\n vvector<P> line;\\n const F inf = F(1000000,1);\\n rep(i,n){\\n long double p = in() / 100.0;\\n int t = in();\\n int v = in();\\n if(v==0){\\n line.emplace_back(vector<P>({{inf,1}}));\\n }else{\\n line.emplace_back(calc(p,v,t));\\n }\\n }\\n vector<long double> res;\\n rep(i,n){\\n long double sum = 0;\\n foreach(p,line[i]){\\n long double add = p.second;\\n if(p.first==inf)continue;\\n rep(j,n){\\n if(i==j)continue;\\n long double psum = 0;\\n foreach(k,line[j]){\\n if(p.first < k.first)psum += k.second;\\n }\\n add *= psum;\\n }\\n sum += add;\\n }\\n res.emplace_back(sum);\\n }\\n return res;\\n}\\n\\nint main(){\\n foreach(i,func())println(i);\\n return 0;\\n}\",\n \"accuracy\": 0.14285714285714285,\n \"time_ms\": 20,\n \"memory_kb\": 3764,\n \"score_of_the_acc\": -0.1004,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2303_6552894\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\n\\ntemplate<class t>\\nclass fraction{\\n\\tpublic:\\n\\t\\tt numerator;\\n\\t\\tt denominator;\\n\\n\\t\\tfraction():numerator(t(0)), denominator(t(1)){}\\n\\t\\tfraction(t a, t b):numerator(a), denominator(b){}\\n\\t\\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\\n\\n\\t\\tfraction pow(long long k){\\n\\t\\t\\tfraction res(1, 1);\\n\\t\\t\\tfraction sum(*this);\\n\\t\\t\\twhile(k){\\n\\t\\t\\t\\tif(k&1)res*=sum;\\n\\t\\t\\t\\tsum*=sum;\\n\\t\\t\\t\\tk>>=1;\\n\\t\\t\\t}\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\n\\t\\tfraction& operator+=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator + a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator-=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator - a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator*=(fraction a){\\n\\t\\t\\tnumerator *= a.numerator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator/=(fraction a){\\n\\t\\t\\tnumerator *= a.denominator;\\n\\t\\t\\tdenominator *= a.numerator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction operator+(fraction a){return fraction(*this) += a;}\\n\\t\\tfraction operator-(fraction a){return fraction(*this) -= a;}\\n\\t\\tfraction operator*(fraction a){return fraction(*this) *= a;}\\n\\t\\tfraction operator/(fraction a){return fraction(*this) /= a;}\\n};\\n\\ntemplate<class t>\\nbool operator<(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator < b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator>(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator > b.numerator * a.denominator;\\n}\\ntemplate<class t>\\nbool operator==(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator == b.numerator * a.denominator;\\n}\\n\\nvector<double> func(){\\n int n = in();\\n int m = in();\\n int l = in();\\n using F = fraction<ll>;\\n using P = pair<F,double>;\\n method(calc,vector<P>,double p,int v,int t){\\n vector<double> dp(m+1,0);\\n dp[0] = 1;\\n rep(_,m){\\n vector<double> ndp(m+1,0);\\n rep(i,m){\\n ndp[i] += (1-p) * dp[i];\\n ndp[i+1] += p * dp[i];\\n }\\n swap(dp,ndp);\\n }\\n vector<P> res;\\n rep(i,dp.size()){\\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\\n }\\n return res;\\n };\\n vvector<P> line;\\n const F inf = F(1000000,1);\\n rep(i,n){\\n double p = in() / 100.0;\\n int t = in();\\n int v = in();\\n if(v==0){\\n line.emplace_back(vector<P>({{inf,1}}));\\n }else{\\n line.emplace_back(calc(p,v,t));\\n }\\n }\\n vector<double> res;\\n rep(i,n){\\n double sum = 0;\\n foreach(p,line[i]){\\n double add = p.second;\\n if(p.first==inf)continue;\\n rep(j,n){\\n if(i==j)continue;\\n double psum = 0;\\n foreach(k,line[j]){\\n if(p.first < k.first)psum += k.second;\\n }\\n add *= psum;\\n }\\n sum += add;\\n }\\n res.emplace_back(sum);\\n }\\n return res;\\n}\\n\\nint main(){\\n foreach(i,func())println(i);\\n return 0;\\n}\",\n \"accuracy\": 0.14285714285714285,\n \"time_ms\": 20,\n \"memory_kb\": 3752,\n \"score_of_the_acc\": -0.0942,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2303_6552878\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\n\\ntemplate<class t>\\nclass fraction{\\n\\tpublic:\\n\\t\\tt numerator;\\n\\t\\tt denominator;\\n\\n\\t\\tfraction():numerator(t(0)), denominator(t(1)){}\\n\\t\\tfraction(t a, t b):numerator(a), denominator(b){}\\n\\t\\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\\n\\n\\t\\tfraction pow(long long k){\\n\\t\\t\\tfraction res(1, 1);\\n\\t\\t\\tfraction sum(*this);\\n\\t\\t\\twhile(k){\\n\\t\\t\\t\\tif(k&1)res*=sum;\\n\\t\\t\\t\\tsum*=sum;\\n\\t\\t\\t\\tk>>=1;\\n\\t\\t\\t}\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\n\\t\\tfraction& operator+=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator + a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator-=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator - a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator*=(fraction a){\\n\\t\\t\\tnumerator *= a.numerator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator/=(fraction a){\\n\\t\\t\\tnumerator *= a.denominator;\\n\\t\\t\\tdenominator *= a.numerator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction operator+(fraction a){return fraction(*this) += a;}\\n\\t\\tfraction operator-(fraction a){return fraction(*this) -= a;}\\n\\t\\tfraction operator*(fraction a){return fraction(*this) *= a;}\\n\\t\\tfraction operator/(fraction a){return fraction(*this) /= a;}\\n};\\n\\ntemplate<class t>\\nbool operator<(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator < b.numerator * a.denominator;\\n}\\n\\nvector<double> func(){\\n int n = in();\\n int m = in();\\n int l = in();\\n using F = fraction<ll>;\\n using P = pair<F,double>;\\n method(calc,vector<P>,double p,int v,int t){\\n vector<double> dp(m+1,0);\\n dp[0] = 1;\\n rep(_,m){\\n vector<double> ndp(m+1,0);\\n rep(i,m){\\n ndp[i] += (1-p) * dp[i];\\n ndp[i+1] += p * dp[i];\\n }\\n swap(dp,ndp);\\n }\\n vector<P> res;\\n rep(i,dp.size()){\\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\\n }\\n return res;\\n };\\n vvector<P> line;\\n rep(i,n){\\n double p = in() / 100.0;\\n int t = in();\\n int v = in();\\n if(v==0){\\n line.emplace_back(vector<P>({{F(1000000,1),1}}));\\n }else{\\n line.emplace_back(calc(p,v,t));\\n }\\n }\\n vector<double> res;\\n rep(i,n){\\n double sum = 0;\\n foreach(p,line[i]){\\n double add = p.second;\\n rep(j,n){\\n if(i==j)continue;\\n double psum = 0;\\n foreach(k,line[j]){\\n if(p.first < k.first)psum += k.second;\\n }\\n add *= psum;\\n }\\n sum += add;\\n }\\n res.emplace_back(sum);\\n }\\n return res;\\n}\\n\\nint main(){\\n foreach(i,func())println(i);\\n return 0;\\n}\",\n \"accuracy\": 0.14285714285714285,\n \"time_ms\": 20,\n \"memory_kb\": 3760,\n \"score_of_the_acc\": -0.0983,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2303_6552870\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);--i)\\n#define foreach(i, n) for(auto &i:(n))\\n#define all(x) (x).begin(), (x).end()\\n#define bit(x) (1ll << (x))\\n#define lambda(RES_TYPE, ...) (function<RES_TYPE(__VA_ARGS__)>)[&](__VA_ARGS__) -> RES_TYPE\\n#define method(FUNC_NAME, RES_TYPE, ...) function<RES_TYPE(__VA_ARGS__)> FUNC_NAME = lambda(RES_TYPE, __VA_ARGS__)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\n//const ll MOD = (ll)1e9+7;\\nconst ll MOD = 998244353;\\nconst int INF = (ll)1e9+7;\\nconst ll INFLL = (ll)1e18;\\ntemplate<class t>\\nusing vvector = vector<vector<t>>;\\ntemplate<class t>\\nusing vvvector = vector<vector<vector<t>>>;\\ntemplate<class t>\\nusing priority_queuer = priority_queue<t, vector<t>, greater<t>>;\\ntemplate<class t, class u> bool chmax(t &a, u b){if(a<b){a=b;return true;}return false;}\\ntemplate<class t, class u> bool chmin(t &a, u b){if(a>b){a=b;return true;}return false;}\\n#ifdef DEBUG\\n#define debug(x) cout<<\\\"LINE \\\"<<__LINE__<<\\\": \\\"<<#x<<\\\" = \\\"<<x<<endl;\\n#else\\n#define debug(x) (void)0\\n#endif\\n\\nnamespace templates{\\n ll modpow(ll x, ll b,ll mod=MOD){\\n ll res = 1;\\n while(b){\\n if(b&1)res = res * x % mod;\\n x = x * x % mod;\\n b>>=1;\\n }\\n return res;\\n }\\n\\n ll modinv(ll x){\\n return modpow(x, MOD-2);\\n }\\n\\n bool was_output = false;\\n\\n void print();\\n template <class t> void print(const vector<t> &);\\n template <class t, class u> void print(const pair<t, u> &);\\n template <class t> void print(const t&);\\n template <class Head, class... Tail> void print(const Head&, const Tail&...);\\n\\n template <class t> void println(const vector<vector<t>>&);\\n template <class t> void println(const vector<t>&);\\n template <class t> void println(const t&);\\n template <class Head, class... Tail> void println(const Head&, const Tail&...);\\n void println();\\n void newline();\\n\\n void print(){\\n return;\\n }\\n\\n template <class t>\\n void print(const vector<t>&x){\\n for(const t&i:x)print(i);\\n }\\n template <class t, class u>\\n void print(const pair<t,u>&p){\\n print(p.first);\\n print(p.second);\\n }\\n template <class t>\\n void print(const t&x){\\n if(was_output)cout<<\\\" \\\";\\n cout<<x;\\n was_output = true;\\n }\\n template <class Head, class... Tail>\\n void print(const Head&head,const Tail&...tail){\\n print(head);\\n print(tail...);\\n }\\n\\n template<class t>\\n void println(const vector<vector<t>>&x){\\n for(vector<t> i:x)println(i);\\n }\\n template<class t>\\n void println(const vector<t>&x){\\n for(const t&i:x)print(i);\\n println();\\n }\\n template <class t>\\n void println(const t&x){\\n print(x);\\n println();\\n }\\n void println(){\\n if(was_output){\\n cout << endl;\\n was_output = false;\\n }\\n }\\n template <class Head, class... Tail>\\n void println(const Head&head,const Tail&...tail){\\n print(head);\\n println(tail...);\\n }\\n\\n void newline(){\\n was_output = true;\\n println();\\n }\\n\\n template<class t>\\n istream& operator>>(istream&is, vector<t>&x){\\n for(auto &i:x)is >> i;\\n return is;\\n }\\n\\n template<class t, class u>\\n istream& operator>>(istream&is, pair<t, u>&x){\\n is >> x.first >> x.second;\\n return is;\\n }\\n\\n template<class t>\\n ostream& operator<<(ostream&os, vector<t> &v){\\n os << \\\"{\\\";\\n for(t &i:v){\\n os << i << \\\", \\\";\\n }\\n os << \\\"}\\\";\\n return os;\\n }\\n\\n template<class t = long long>\\n t in(){\\n t res; cin >> res; return res;\\n }\\n\\n template<class t>\\n vector<t> sorted(vector<t> line,function<bool(t,t)> comp=[](t a,t b){return a<b;}){\\n sort(line.begin(),line.end(),comp);\\n return line;\\n }\\n\\n template<class t>\\n vector<t> reversed(vector<t> line){\\n reverse(line.begin(),line.end());\\n return line;\\n }\\n string reversed(string str){\\n reverse(str.begin(),str.end());\\n return str;\\n }\\n\\n long long gcd(long long a,long long b){\\n while(b){\\n a %= b;\\n swap(a,b);\\n }\\n return a;\\n }\\n\\n long long lcm(long long a,long long b){\\n return a / gcd(a,b) * b;\\n }\\n\\n class output_initializer{\\n public:\\n output_initializer(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << setprecision(20);\\n }\\n };output_initializer OUTPUT_INITIALIZER_INSTANCE = output_initializer();\\n}\\n\\nusing namespace templates;\\n\\n\\ntemplate<class t>\\nclass fraction{\\n\\tpublic:\\n\\t\\tt numerator;\\n\\t\\tt denominator;\\n\\n\\t\\tfraction():numerator(t(0)), denominator(t(1)){}\\n\\t\\tfraction(t a, t b):numerator(a), denominator(b){}\\n\\t\\tfraction(const fraction &a):numerator(a.numerator), denominator(a.denominator){}\\n\\n\\t\\tfraction pow(long long k){\\n\\t\\t\\tfraction res(1, 1);\\n\\t\\t\\tfraction sum(*this);\\n\\t\\t\\twhile(k){\\n\\t\\t\\t\\tif(k&1)res*=sum;\\n\\t\\t\\t\\tsum*=sum;\\n\\t\\t\\t\\tk>>=1;\\n\\t\\t\\t}\\n\\t\\t\\treturn res;\\n\\t\\t}\\n\\n\\t\\tfraction& operator+=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator + a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator-=(fraction a){\\n\\t\\t\\tnumerator = numerator * a.denominator - a.numerator * denominator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator*=(fraction a){\\n\\t\\t\\tnumerator *= a.numerator;\\n\\t\\t\\tdenominator *= a.denominator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction& operator/=(fraction a){\\n\\t\\t\\tnumerator *= a.denominator;\\n\\t\\t\\tdenominator *= a.numerator;\\n\\t\\t\\treturn *this;\\n\\t\\t}\\n\\n\\t\\tfraction operator+(fraction a){return fraction(*this) += a;}\\n\\t\\tfraction operator-(fraction a){return fraction(*this) -= a;}\\n\\t\\tfraction operator*(fraction a){return fraction(*this) *= a;}\\n\\t\\tfraction operator/(fraction a){return fraction(*this) /= a;}\\n};\\n\\ntemplate<class t>\\nbool operator<(fraction<t> a,fraction<t> b){\\n return a.numerator * b.denominator < b.numerator * a.denominator;\\n}\\n\\nvector<double> func(){\\n int n = in();\\n int m = in();\\n int l = in();\\n using F = fraction<ll>;\\n using P = pair<F,double>;\\n method(calc,vector<P>,double p,int v,int t){\\n vector<double> dp(m+1,0);\\n dp[0] = 1;\\n rep(_,m){\\n vector<double> ndp(m+1,0);\\n rep(i,m){\\n ndp[i] += (1-p) * dp[i];\\n ndp[i+1] += p * dp[i];\\n }\\n swap(dp,ndp);\\n }\\n vector<P> res;\\n rep(i,dp.size()){\\n res.emplace_back(F(l,v)+F(t*i,1),dp[i]);\\n }\\n return res;\\n };\\n vvector<P> line;\\n rep(i,n){\\n double p = in() / 100.0;\\n int t = in();\\n int v = in();\\n line.emplace_back(calc(p,v,t));\\n }\\n vector<double> res;\\n rep(i,n){\\n double sum = 0;\\n foreach(p,line[i]){\\n double add = p.second;\\n rep(j,n){\\n if(i==j)continue;\\n double psum = 0;\\n foreach(k,line[j]){\\n if(p.first < k.first)psum += k.second;\\n }\\n add *= psum;\\n }\\n sum += add;\\n }\\n res.emplace_back(sum);\\n }\\n return res;\\n}\\n\\nint main(){\\n foreach(i,func())println(i);\\n return 0;\\n}\",\n \"accuracy\": 0.14285714285714285,\n \"time_ms\": 20,\n \"memory_kb\": 3756,\n \"score_of_the_acc\": -0.0962,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2303_5918315\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing P = pair<int64_t,int64_t>;\\n\\nvoid solve(){\\n int64_t N, M, L;\\n cin >> N >> M >> L;\\n vector<long double> p(N);\\n vector<P> vec(N);\\n for(int i=0; i<N; i++){\\n cin >> p[i];\\n p[i] /= 100;\\n int x, y;\\n cin >> x >> y;\\n vec[i] = P(x,y);\\n }\\n vector<int64_t> COM(M+1);\\n vector<vector<long double>> C(N,vector<long double>(M+1));\\n for(int i=0; i<=M; i++){\\n if(i == 0){\\n COM[i] = 1;\\n }\\n else{\\n COM[i] = COM[i-1]*(M-i+1)/i;\\n }\\n for(int j=0; j<N; j++){\\n C[j][i] = COM[i]*pow(p[j],i)*pow(1-p[j],M-i);\\n }\\n }\\n for(int i=0; i<N; i++){ //person\\n long double ans = 0;\\n auto[a1,b1] = vec[i];\\n for(int j=0; j<=M; j++){ //rest times\\n long double prob = C[i][j];\\n for(int k=0; k<N; k++){\\n if(k == i){\\n continue;\\n }\\n auto[a2,b2] = vec[k];\\n long double prob2 = 0;\\n for(int l=0; l<=M; l++){\\n if(b2*(a1*j*b1 + L) < b1*(a2*l*b2 + L)){\\n //cout << j << \\\" \\\" << k << \\\" \\\" << *pow(p[k],l)*pow(1-p[k],M-l) << endl;\\n prob2 += C[k][l];\\n }\\n }\\n //cout << \\\"SUM:\\\" << i << \\\" \\\" << j << \\\" \\\" << prob2 << endl;\\n prob *= prob2;\\n }\\n ans += prob;\\n }\\n cout << fixed << setprecision(15) << ans << endl;\\n }\\n}\\n\\nint main(){\\n while(true){\\n solve();\\n break;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3652,\n \"score_of_the_acc\": -0.0424,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2303_5884342\",\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 ALL(v) (v).begin(), (v).end()\\n#define RALL(v) (v).rbegin(), (v).rend()\\n#define FOR(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(i, n) FOR(i, 0, n)\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 60;\\nconstexpr int MOD = 1000000007;\\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\\nll C[55][55];\\n\\nvoid init() {\\n C[0][0] = 1;\\n FOR(i, 1, 55) {\\n C[i][0] = 1;\\n FOR(j, 1, 55) {\\n C[i][j] = C[i-1][j-1] + C[i-1][j];\\n }\\n }\\n}\\n\\nint main() {\\n init();\\n int N, M, L;\\n cin >> N >> M >> L;\\n vector<ll> P(N), T(N), V(N);\\n REP(i, N) cin >> P[i] >> T[i] >> V[i];\\n\\n vector prob(N, vector(M+1, vector<double>(M+1)));\\n REP(i, N) {\\n prob[i][0][0] = 1.0;\\n REP(j, M) {\\n REP(k, M+1) {\\n prob[i][j+1][k] += prob[i][j][k] * (100 - P[i]) / 100;\\n if(k < M) prob[i][j+1][k+1] += prob[i][j][k] * P[i] / 100;\\n }\\n }\\n }\\n\\n REP(i, N) {\\n if(V[i] == 0) {\\n cout << 0.0 << endl;\\n continue;\\n }\\n double ans = 0.0;\\n REP(ci, M+1) {\\n double p = prob[i][M][ci];\\n REP(j, N) {\\n if(i == j) continue;\\n if(V[j] == 0) continue;\\n double sum = 0;\\n REP(cj, M+1) {\\n double diff = double(L)/V[i] + ci*T[i] - double(L)/V[j] - cj*T[j];\\n if(diff >= 0.0) continue;\\n sum += prob[j][M][cj];\\n }\\n p *= sum;\\n }\\n ans += p;\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5524,\n \"score_of_the_acc\": -1.0114,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2303_5851689\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.01 15:05: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\\nusing R = long double;\\n\\nvoid solve(int n) {\\n\\tint m;\\n\\tcin >> m;\\n\\tint length;\\n\\tcin >> length;\\n\\tvector<R> prob(n);\\n\\tvector<R> time(n);\\n\\tvector<R> velocity(n);\\n\\n\\trep(i, n) {\\n\\t\\tcin >> prob[i] >> time[i] >> velocity[i];\\n\\t\\tprob[i] /= 100;\\n\\t}\\n\\n\\tauto cost_all = [&](int person, int rest_count) {\\n\\t\\treturn velocity[person] > 0 ? time[person] * rest_count + length / velocity[person] : INF;\\n\\t};\\n\\n\\tVV<R> prob_rest(n, V<R>(m + 1));\\n\\trep(i, n) prob_rest[i][0] = 1;\\n\\trep(m) {\\n\\t\\tauto tmp = prob_rest;\\n\\t\\ttmp.assign(n, V<R>(m + 1, 0));\\n\\n\\t\\trep(i, n) {\\n\\t\\t\\trep(j, m + 1) {\\n\\t\\t\\t\\ttmp[i][j] += prob_rest[i][j] * (1 - prob[i]);\\n\\t\\t\\t\\tif(j < m) {\\n\\t\\t\\t\\t\\ttmp[i][j + 1] += prob_rest[i][j] * prob[i];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tswap(tmp, prob_rest);\\n\\t}\\n\\n\\tdebug(prob_rest);\\n\\n\\tauto win_prob = [&](int person, int rest_count) {\\n\\t\\tR cost = cost_all(person, rest_count);\\n\\t\\tR ans = 1;\\n\\t\\tdebug(person, rest_count, cost);\\n\\t\\trep(opponent, n) {\\n\\t\\t\\tif(opponent == person) continue;\\n\\t\\t\\tR res = 0;\\n\\t\\t\\trep(rest_count_opponent, m + 1) {\\n\\t\\t\\t\\tif(cost_all(opponent, rest_count_opponent) > cost + 1e-10) {\\n\\t\\t\\t\\t\\tres += prob_rest[opponent][rest_count_opponent];\\n\\n\\t\\t\\t\\t\\tdebug(opponent, rest_count_opponent);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tans *= res;\\n\\t\\t}\\n\\t\\treturn ans * prob_rest[person][rest_count];\\n\\t};\\n\\n\\tR ret = 0;\\n\\trep(i, n) {\\n\\t\\tret = 0;\\n\\t\\trep(j, m + 1) { ret += win_prob(i, j); }\\n\\t\\tcout << ret << dl;\\n\\t}\\n\\n\\treturn;\\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\\t// std::cerr << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint n;\\n\\twhile(cin >> n) {\\n\\t\\t// cout << (solve(n)) << dl;\\n\\t\\tsolve(n);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3708,\n \"score_of_the_acc\": -0.0941,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2303_5846900\",\n \"code_snippet\": \"#line 1 \\\"/Users/nok0/Documents/Programming/nok0/template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\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}\\n#if __has_include(<atcoder/all>)\\nstd::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\ntemplate <int m>\\nstd::istream &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 &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\n#endif\\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}\\n#if __has_include(<atcoder/all>)\\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }\\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\\n#endif\\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}\\ntemplate <class T>\\nvoid MUL(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v *= x;\\n}\\ntemplate <class T>\\nvoid DIV(std::vector<T> &a, const T x) {\\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}\\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}\\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 2 \\\"d.cpp\\\"\\n\\nvoid main_() {\\n\\tINT(n, m);\\n\\tDOUBLE(L);\\n\\tV<> P(n), t(n), v(n);\\n\\tREP(i, n) { cin >> P[i] >> t[i] >> v[i]; }\\n\\tV<double> p(n);\\n\\tREP(i, n) { p[i] = (double)P[i] / 100; }\\n\\tvector binom(m + 1, 1.0);\\n\\tdouble mul = 1;\\n\\tREPS(i, m) {\\n\\t\\tmul *= (m + 1 - i);\\n\\t\\tmul /= i;\\n\\t\\tbinom[i] = mul;\\n\\t}\\n\\tREP(i, n) {\\n\\t\\tdouble res = 0;\\n\\t\\tREP(j, m + 1) {\\n\\t\\t\\t//iさんが休憩をちょうどj回とって勝つ確率\\n\\t\\t\\tdouble prob = binom[j] * pow(p[i], j) * pow(1 - p[i], m - j);\\n\\t\\t\\tREP(k, n) {\\n\\t\\t\\t\\tif(k == i) continue;\\n\\t\\t\\t\\tdouble tmp_sum = 0;\\n\\t\\t\\t\\tREP(l, m + 1) {\\n\\t\\t\\t\\t\\tif(t[k] * l * v[k] * v[i] + L * v[i] <= t[i] * j * v[k] * v[i] + L * v[k]) continue;\\n\\t\\t\\t\\t\\tdebug(k, l);\\n\\t\\t\\t\\t\\tdouble tmp_prob = binom[l] * pow(p[k], l) * pow(1 - p[k], m - l);\\n\\t\\t\\t\\t\\ttmp_sum += tmp_prob;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tprob *= tmp_sum;\\n\\t\\t\\t}\\n\\t\\t\\tres += prob;\\n\\t\\t}\\n\\t\\tprint(res);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 890,\n \"memory_kb\": 3984,\n \"score_of_the_acc\": -1.2029,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2303_5843632\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing T = tuple<long long, long long, long long>;\\n\\nint n, m, l;\\nvector<vector<long long>> comb;\\nvector<T> v;\\n\\nvector<long double> solve();\\n\\nint main() {\\n cin >> n >> m >> l;\\n for (int i = 0; i < n; ++i) {\\n int x, y, z;\\n cin >> x >> y >> z;\\n v.emplace_back(x, y, z);\\n }\\n auto res = solve();\\n cout << fixed << setprecision(10);\\n for (auto &p : res) cout << p << endl;\\n return 0;\\n}\\n\\nvector<long double> solve() {\\n comb.resize(m + 1);\\n comb[0].push_back(1);\\n for (int i = 1; i <= m; ++i) {\\n comb[i].resize(i + 1);\\n for (int j = 0; j < i; ++j)\\n comb[i][j] += comb[i - 1][j], comb[i][j + 1] += comb[i - 1][j];\\n }\\n vector<vector<long double>> prob(n, vector<long double>(m + 1, 0));\\n for (int i = 0; i < n; ++i) {\\n auto [p, t, s] = v[i];\\n for (int j = 0; j <= m; ++j) prob[i][j] = comb[m][j];\\n long double now = 1;\\n for (int j = 0; j <= m; ++j) {\\n prob[i][j] *= now;\\n now *= p / 100.0L;\\n }\\n now = 1;\\n for (int j = m; j >= 0; --j) {\\n prob[i][j] *= now;\\n now *= (100 - p) / 100.0L;\\n }\\n }\\n vector<long double> res(n, 0);\\n for (int i = 0; i < n; ++i) {\\n auto [pi, ti, si] = v[i];\\n for (int itimes = 0; itimes <= m; ++itimes) {\\n long double now = prob[i][itimes];\\n for (int j = 0; j < n; ++j)\\n if (i != j) {\\n auto [pj, tj, sj] = v[j];\\n long double sum = 0;\\n for (int jtimes = 0; jtimes <= m; ++jtimes) {\\n long long lef = (itimes * ti - jtimes * tj) * si * sj,\\n righ = l * (si - sj);\\n if (lef < righ) sum += prob[j][jtimes];\\n }\\n now *= sum;\\n }\\n res[i] += now;\\n }\\n }\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3600,\n \"score_of_the_acc\": -0.0041,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2303_5238661\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define INF_LL (int64)1e18\\n#define INF (int32)1e9\\n#define REP(i, n) for(int64 i = 0;i < (n);i++)\\n#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)\\n#define all(x) x.begin(),x.end()\\n#define fs first\\n#define sc second\\n\\nusing int32 = int_fast32_t;\\nusing uint32 = uint_fast32_t;\\nusing int64 = int_fast64_t;\\nusing uint64 = uint_fast64_t;\\nusing PII = pair<int32, int32>;\\nusing PLL = pair<int64, int64>;\\n\\nconst double eps = 1e-10;\\n\\ntemplate<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}\\ntemplate<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}\\n\\ntemplate<typename T>\\nvector<T> make_v(size_t a){return vector<T>(a);}\\n\\ntemplate<typename T,typename... Ts>\\nauto make_v(size_t a,Ts... ts){\\n\\treturn vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));\\n}\\n\\ntemplate<typename T,typename U,typename... V>\\ntypename enable_if<is_same<T, U>::value!=0>::type\\nfill_v(U &u,const V... v){u=U(v...);}\\n\\ntemplate<typename T,typename U,typename... V>\\ntypename enable_if<is_same<T, U>::value==0>::type\\nfill_v(U &u,const V... v){\\n\\tfor(auto &e:u) fill_v<T>(e,v...);\\n}\\n\\ntemplate <typename F>\\nclass\\n#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\\n [[nodiscard]]\\n#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\\nFixPoint final : private F\\n{\\npublic:\\n template <typename G>\\n explicit constexpr FixPoint(G&& g) noexcept\\n : F{std::forward<G>(g)}\\n {}\\n\\n template <typename... Args>\\n constexpr decltype(auto)\\n operator()(Args&&... args) const\\n#if !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\\n noexcept(noexcept(F::operator()(std::declval<FixPoint>(), std::declval<Args>()...)))\\n#endif // !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\\n {\\n return F::operator()(*this, std::forward<Args>(args)...);\\n }\\n}; // class FixPoint\\n\\n\\n#if defined(__cpp_deduction_guides)\\ntemplate <typename F>\\nFixPoint(F&&)\\n -> FixPoint<std::decay_t<F>>;\\n#endif // defined(__cpp_deduction_guides)\\n\\n\\nnamespace\\n{\\n template <typename F>\\n#if !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\\n # if defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\\n__attribute__((warn_unused_result))\\n# elif defined(_MSC_VER) && _MSC_VER >= 1700 && defined(_Check_return_)\\n_Check_return_\\n# endif // defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\\n#endif // !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\\n inline constexpr decltype(auto)\\n makeFixPoint(F&& f) noexcept\\n {\\n return FixPoint<std::decay_t<F>>{std::forward<std::decay_t<F>>(f)};\\n }\\n} // namespace\\n\\nvector<int64> dijkstra(const vector<vector<int64>>& G, int s) {\\n priority_queue<PLL, vector<PLL>, greater<>> pq;\\n vector<int64> d(G.size(), INF_LL);\\n d[s] = 0;\\n pq.emplace(0, s);\\n\\n while (pq.size()) {\\n int64 v, c;\\n tie(c, v) = pq.top(); pq.pop();\\n if (d[v] < c) continue;\\n for (auto& u : G[v]) {\\n if (d[u] > c + 1) {\\n d[u] = c + 1;\\n pq.emplace(c+1, u);\\n }\\n }\\n }\\n return d;\\n}\\n\\ndouble comb(int a, int b) {\\n double res = 1;\\n REP(i, b) {\\n res = res * (a - i) / (b - i);\\n }\\n return res;\\n}\\n\\nint main(void) {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\n int64 N, M;\\n double L;\\n cin >> N >> M >> L;\\n vector<double> P(N), V(N);\\n vector<int64> T(N);\\n\\n REP(i, N) {\\n cin >> P[i] >> T[i] >> V[i];\\n P[i] = P[i] / 100;\\n }\\n\\n auto prob = make_v<double>(N, M+1);\\n auto time = make_v<double>(N, M+1);\\n\\n REP(i, N) {\\n REP(j, M+1) {\\n double prest = 1, pnot = 1;\\n REP(k, j) prest *= P[i];\\n REP(k, M-j) pnot *= 1-P[i];\\n prob[i][j] = comb(M, j) * prest * pnot;\\n time[i][j] = L / V[i] + T[i] * j;\\n// cout << \\\"(\\\" << prob[i][j] << \\\" \\\" << time[i][j] << \\\") \\\";\\n }\\n// cout << endl;\\n }\\n\\n REP(i, N) {\\n double res = 0;\\n REP(j, M+1) {\\n double rprob = prob[i][j];\\n REP(k, N) {\\n if (k == i) continue;\\n double sum = 0;\\n REP(l, M+1) {\\n if (time[k][l] > time[i][j]) {\\n sum += prob[k][l];\\n }\\n }\\n// cout << sum << \\\" \\\";\\n rprob *= sum;\\n }\\n// cout << rprob << endl;\\n res += rprob;\\n }\\n cout << fixed << setprecision(10) << res << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.0321,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2303_5189978\",\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, x, n) for(int i = x; i <= n; i++)\\n#define rep3(i, x, n) for(int i = x; i >= n; i--)\\n#define each(e, v) for(auto &e: v)\\n#define pb push_back\\n#define eb emplace_back\\n#define all(x) x.begin(), x.end()\\n#define rall(x) x.rbegin(), x.rend()\\n#define sz(x) (int)x.size()\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pil = pair<int, ll>;\\nusing pli = pair<ll, int>;\\nusing pll = pair<ll, ll>;\\nconst int MOD = 1000000007;\\n//const int MOD = 998244353;\\nconst int inf = (1<<30)-1;\\nconst ll INF = (1LL<<60)-1;\\ntemplate<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};\\ntemplate<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};\\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, M, L; cin >> N >> M >> L;\\n\\n vector<double> fac(M+1, 0.0);\\n rep2(i, 1, M){\\n fac[i] = fac[i-1]+log(i);\\n }\\n\\n vector<vector<double>> q(N, vector<double>(M+1, 0.0));\\n vector<int> T(N), V(N);\\n rep(i, N){\\n int P; cin >> P >> T[i] >> V[i];\\n if(P == 0){\\n q[i][0] = 1.0;\\n continue;\\n }\\n if(P == 100){\\n q[i][M] = 1.0;\\n continue; \\n }\\n rep(j, M+1){\\n double p = P/100.0;\\n q[i][j] = fac[M]-fac[j]-fac[M-j]+j*log(p)+(M-j)*log(1.0-p);\\n q[i][j] = exp(q[i][j]);\\n }\\n }\\n\\n double EPS = 1e-10;\\n\\n rep(i, N){\\n if(V[i] == 0) {cout << 0.0 << '\\\\n'; continue;}\\n double ans = 0.0;\\n rep(j, M+1){\\n double tmp = q[i][j], t = double(L)/V[i]+j*T[i];\\n rep(k, N){\\n if(k == i) continue;\\n double s = 0.0;\\n rep(l, M+1){\\n if(V[k] == 0) {s += q[k][l]; continue;}\\n if(t+EPS < double(L)/V[k]+l*T[k]) s += q[k][l];\\n }\\n tmp *= s;\\n }\\n ans += tmp;\\n }\\n\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4008,\n \"score_of_the_acc\": -0.238,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":1288,"cells":{"group_id":{"kind":"string","value":"aoj_2307_cpp"},"problem_description":{"kind":"string","value":"Palindrome Generator\nA palidrome craftsperson starts to work in the early morning, \nwith the clear air allowing him to polish up his palindromes.\nOn this morning, he is making his pieces to submit to the International Contest for Palindrome Craftspeople.\nBy the way, in order to make palindromes, he uses a special dictionary which contains a set of words and a set of ordered pairs of the words.\nAny words and any ordered pairs of consecutive words in his palindromes must appear in the dictionary.\nWe already have his dictionary, so let's estimate how long a palindrome he can make.\nInput\nThe first line in the data set consists of two integers\nN\n(\n1 \\leq N \\leq 100\n) and\nM\n(\n0 \\leq M \\leq 1\\,000\n).\nN\ndescribes the number of words in the dictionary and\nM\ndescribes the number of ordered pairs of words.\nThe following\nN\nlines describe the words he can use.\nThe\ni\n-th line (\n1\n-based) contains the word\ni\n, which consists of only lower-case letters and whose length is between\n1\nand\n10\n, inclusive.\nThe following\nM\nlines describe the ordered pairs of consecutive words he can use.\nThe\nj\n-th line (\n1\n-based) contains two integers\nX_j\nand\nY_j\n(\n1 \\leq X_j, Y_j \\leq N\n).\nX_j\ndescribes the (\n1\n-based) index of the former word in the palindrome and\nY_j\ndescribes that of the latter word.\nOutput\nPrint the maximal length of the possible palindrome in a line.\nIf he can make no palidromes, print \"0\".\nIf he can make arbitrary long palindromes, print \"-1\".\nSample Input 1\n2 2\nab\nba\n1 1\n1 2\nOutput for the Sample Input 1\n4\nSample Input 2\n2 2\nab\nba\n1 1\n2 2\nOutput for the Sample Input 2\n0\nSample Input 3\n2 2\nab\na\n1 1\n1 2\nOutput for the Sample Input 3\n-1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2307_10836481","code_snippet":"#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <set>\n#include <map>\n#include <cmath>\n#include <sstream>\n#include <iomanip>\n#include <queue>\n#include <ctime>\nusing namespace std;\ntemplate <class T> void checkmin(T &t,T x){if (x < t) t = x;}\ntemplate <class T> void checkmax(T &t,T x){if (x > t) t = x;}\ntemplate <class T> void _checkmin(T &t, T x){if (t == -1) t = x; if (x < t) t = x;}\ntemplate <class T> void _checkmax(T &t, T x){if (t == -1) t = x; if (x > t) t = x;}\ntypedef pair <int,int> PII;\ntypedef pair <double,double> PDD;\ntypedef long long lld;\n#define foreach(it,v) for (__typeof((v).begin()) it = (v).begin();it != (v).end();it++)\n#define DEBUG(a) cout << #a\" = \" << (a) << endl;\n#define DEBUGARR(a, n) for (int i = 0; i < (n); i++) { cout << #a\"[\" << i << \"] = \" << (a)[i] << endl; }\nconst int N = 105;\nconst int M = 300005;\nint n, m, cnt;\nstring s[N], rs[N];\nvector <int> next_arr[N];\nvector <int> pre[N];\nvector <PII> E[M];\nint v[M];\nint st[M];\nint du[M];\nint f[M];\nint fa[M];\nint wei[M];\nint palind[N][11];\nint rpalind[N][11];\nint pos[N][N][11][2];\nset <PII> Set;\n\nint ans;\n\nint abs(int x) {\n\treturn x < 0 ? -x : x;\n}\n\nint find(int x, int y) {\n\treturn Set.count(make_pair(x, y));\n}\n\nvector <PII> getEdge(int i, int j, int l, int d) {\n\tvector <PII> ret;\n\tif (d) {\n\t\tif (l > s[j].size()) return ret;\n\t\tif (find(i, j) && rpalind[j][s[j].size() - l]) {\n\t\t\tret.push_back(make_pair(cnt, l));\n\t\t}\n\t\tforeach (it, next_arr[i]) {\n\t\t\tint len = min(l, (int)s[*it].size());\n\t\t\tif (s[*it].substr(0, len) == rs[j].substr(s[j].size() - l, len)) {\n\t\t\t\tret.push_back(make_pair(pos[*it][j][abs(l - (int)s[*it].size())][l >= s[*it].size()], len * 2));\n\t\t\t}\n\t\t}\n\t} else if (l) {\n\t\tif (l > s[i].size()) return ret;\n\t\tif (find(i, j) && palind[i][s[i].size() - l]) {\n\t\t\tret.push_back(make_pair(cnt, l));\n\t\t}\n\t\tforeach (it, pre[j]) {\n\t\t\tint len = min(l, (int)s[*it].size());\n\t\t\tif (rs[*it].substr(0, len) == s[i].substr(s[i].size() - l, len)) {\n\t\t\t\tret.push_back(make_pair(pos[i][*it][abs(l - (int)s[*it].size())][s[*it].size() >= l], len * 2));\n\t\t\t}\n\t\t}\n\t}\n\treturn ret;\n}\n\nvoid build_graph() {\n\tcnt = 0;\n\tfor (int i = 0; i < n; i++) \n\t\tfor (int j = 0; j < n; j++)\n\t\t\tfor (int k = 0; k < 11; k++)\n\t\t\t\tfor (int l = 0; l < 2; l++)\n\t\t\t\t\tpos[i][j][k][l] = cnt++;\n\tfor (int i = 0; i < n; i++) {\n\t\tfor (int j = 0; j <= s[i].size(); j++) {\n\t\t\tint k = s[i].size() - 1;\n\t\t\tstring _s = s[i];\n\t\t\tint _i = j;\n\t\t\tint _j = k;\n\t\t\tint ok = 1;\n\t\t\twhile (_i < _j) {\n\t\t\t\tif (_s[_i++] != _s[_j--]) {\n\t\t\t\t\tok = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tpalind[i][j] = ok;\n\t\t\t_i = j;\n\t\t\t_j = k;\n\t\t\t_s = rs[i];\n\t\t\tok = 1;\n\t\t\twhile (_i < _j) {\n\t\t\t\tif (_s[_i++] != _s[_j--]) {\n\t\t\t\t\tok = 0;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\trpalind[i][j] = ok;\n\t\t}\n\t\tif (palind[i][0]) {\n\t\t\tcheckmax(ans, (int)s[i].size());\n\t\t}\n\t}\n\tfor (int i = 0; i < n; i++)\n\t\tfor (int j = 0; j < n; j++)\n\t\t\tfor (int k = 0; k < 11; k++)\n\t\t\t\tfor (int l = 0; l < 2; l++) {\n\t\t\t\t\tE[pos[i][j][k][l]] = getEdge(i, j, k, l);\n\t\t\t\t}\n}\n\nvoid bfs() {\n\tqueue <int> q;\n\tmemset(v, 0, sizeof(v));\n\tmemset(st, 0, sizeof(st));\n\tfor (int i = 0; i <= cnt; i++) v[i] = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tfor (int j = 0; j < n; j++) {\n\t\t\tint len = min(s[i].size(), s[j].size());\n\t\t\tif (s[i].substr(0, len) == rs[j].substr(0, len)) {\n\t\t\t\tint p = pos[i][j][abs((int)s[i].size() - (int)s[j].size())][s[j].size() >= s[i].size()];\n\t\t\t\tq.push(p);\n\t\t\t\tv[p] = 1;\n\t\t\t\tst[p] = 1;\n\t\t\t\tf[p] = min(s[i].size(), s[j].size()) * 2;\n\t\t\t}\n\t\t}\n\t}\n\twhile (!q.empty()) {\n\t\tint x = q.front();\n\t\tq.pop();\n\t\tforeach (it, E[x]) {\n\t\t\tif (!v[it->first]) {\n\t\t\t\tfa[it->first] = x;\n\t\t\t\tv[it->first] = 1;\n\t\t\t\tq.push(it->first);\n\t\t\t}\n\t\t}\n\t}\n}\n\nvector <int> q;\n\nvoid topsort() {\n\tmemset(du, 0, sizeof(du));\n\tq.clear();\n\tfor (int i = 0; i <= cnt; i++) {\n\t\tif (v[i]) {\n\t\t\tforeach (it, E[i]) {\n\t\t\t\tif (v[it->first]) {\n\t\t\t\t\tdu[it->first]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint head = 0;\n\tfor (int i = 0; i <= cnt; i++) {\n\t\tif (v[i] && !du[i]) {\n\t\t\tq.push_back(i);\n\t\t}\n\t}\n\twhile (head != q.size()) {\n\t\tint x = q[head++];\n\t\tforeach (it, E[x]) {\n\t\t\tif (v[it->first]) {\n\t\t\t\tdu[it->first]--;\n\t\t\t\tif (!du[it->first]) {\n\t\t\t\t\tq.push_back(it->first);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid dp() {\n\tif (!v[cnt] && ans == -1) {\n\t\tputs(\"0\");\n\t} else if (du[cnt]) {\n\t\tputs(\"-1\");\n\t} else {\n\t\tfor (int i = 0; i < q.size(); i++) {\n\t\t\tint x = q[i];\n\t\t\tif (f[x] != -1) {\n\t\t\t\tforeach (it, E[x]) {\n\t\t\t\t\tcheckmax(f[it->first], f[x] + it->second);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << max(f[cnt], ans) << endl;\n\t}\n}\n\nint main(){\n#ifdef cwj\n\tfreopen(\"in\", \"r\", stdin);\n#endif\n\tcin >> n >> m;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> s[i];\n\t\trs[i] = s[i];\n\t\treverse(rs[i].begin(), rs[i].end());\n\t}\n\tSet.clear();\n\tmemset(f, 0xFF, sizeof(f));\n\tfor (int i = 0; i < m; i++) {\n\t\tint x, y;\n\t\tcin >> x >> y;\n\t\tx--; y--;\n\t\tSet.insert(make_pair(x, y));\n\t\tnext_arr[x].push_back(y);\n\t\tpre[y].push_back(x);\n\t}\n\tans = -1;\n\tbuild_graph();\n\tbfs();\n\ttopsort();\n\tdp();\n}","accuracy":1,"time_ms":30,"memory_kb":21912,"score_of_the_acc":-0.1623,"final_rank":3},{"submission_id":"aoj_2307_8985727","code_snippet":"// time complexity: O(nml) where l = (maximum length of a word)\n\n#include <array>\n#include <string>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nstruct edge_base {\n\tint s, t, w;\n};\n\nstruct edge {\n\tint t, w;\n};\n\nbool check(string s, int pos) {\n\tint n = s.size();\n\tbool res = true;\n\tif (pos % 2 == 0) {\n\t\tfor (int i = 0; i < min(pos / 2, n - pos / 2); i++) {\n\t\t\tres = res && (s[pos / 2 - i - 1] == s[pos / 2 + i]);\n\t\t}\n\t} else {\n\t\tfor (int i = 1; i <= min(pos / 2, n - pos / 2 - 1); i++) {\n\t\t\tres = res && (s[pos / 2 - i] == s[pos / 2 + i]);\n\t\t}\n\t}\n\treturn res;\n}\n\nvector<bool> reachable(int N, vector<vector<edge> > G, vector<int> start) {\n\tvector<bool> ans(N, false);\n\tvector<int> st;\n\tfor (int i = 0; i < N; i++) {\n\t\tif (start[i] != -1) {\n\t\t\tans[i] = true;\n\t\t\tst.push_back(i);\n\t\t}\n\t}\n\twhile (!st.empty()) {\n\t\tint u = st.back();\n\t\tst.pop_back();\n\t\tfor (edge e : G[u]) {\n\t\t\tif (!ans[e.t]) {\n\t\t\t\tans[e.t] = true;\n\t\t\t\tst.push_back(e.t);\n\t\t\t}\n\t\t}\n\t}\n\treturn ans;\n}\n\nint longest_path(int N, vector<edge_base> es, vector<int> start, vector<int> goal) {\n\t// step #1. construct graph\n\tvector<vector<edge> > G1(N), G2(N);\n\tfor (edge_base e : es) {\n\t\tG1[e.s].push_back(edge{e.t, e.w});\n\t\tG2[e.t].push_back(edge{e.s, e.w});\n\t}\n\n\t// step #2. reduce graph\n\tvector<bool> reach1 = reachable(N, G1, start);\n\tvector<bool> reach2 = reachable(N, G2, goal);\n\tvector<bool> reach(N);\n\tfor (int i = 0; i < N; i++) {\n\t\treach[i] = reach1[i] && reach2[i];\n\t}\n\tvector<vector<edge> > G3(N);\n\tvector<int> deg(N);\n\tfor (edge_base e : es) {\n\t\tif (reach[e.s] && reach[e.t]) {\n\t\t\tG3[e.s].push_back(edge{e.t, e.w});\n\t\t\tdeg[e.t]++;\n\t\t}\n\t}\n\n\t// step #3. compute in topological order\n\tvector<int> dp(N);\n\tvector<int> st;\n\tfor (int i = 0; i < N; i++) {\n\t\tif (start[i] != -1 && deg[i] == 0) {\n\t\t\tdp[i] = start[i];\n\t\t\tst.push_back(i);\n\t\t}\n\t}\n\tint ans = 0;\n\twhile (!st.empty()) {\n\t\tint u = st.back();\n\t\tst.pop_back();\n\t\tif (goal[u] != -1) {\n\t\t\tans = max(ans, dp[u] + goal[u]);\n\t\t}\n\t\tfor (edge e : G3[u]) {\n\t\t\tdeg[e.t]--;\n\t\t\tdp[e.t] = max(dp[e.t], dp[u] + e.w);\n\t\t\tif (deg[e.t] == 0) {\n\t\t\t\tst.push_back(e.t);\n\t\t\t}\n\t\t}\n\t}\n\tif (deg != vector<int>(N, 0)) {\n\t\treturn -1;\n\t}\n\n\treturn ans;\n}\n\nint solve(int N, int M, vector<string> S, vector<edge_base> es) {\n\t// step #1. preparation\n\tvector<int> L(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tL[i] = S[i].size();\n\t}\n\tvector<vector<int> > G1(N), G2(N);\n\tfor (edge_base e : es) {\n\t\tG1[e.s].push_back(e.t);\n\t\tG2[e.t].push_back(e.s);\n\t}\n\tvector<array<int, 3> > states;\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tfor (int k = -L[i]; k <= +L[j]; k++) {\n\t\t\t\tstates.push_back({i, j, k});\n\t\t\t}\n\t\t}\n\t}\n\tint Z = states.size();\n\tauto search_state = [&](array<int, 3> v) {\n\t\tint pos = lower_bound(states.begin(), states.end(), v) - states.begin();\n\t\tif (pos == Z || states[pos] != v) {\n\t\t\treturn -1;\n\t\t}\n\t\treturn pos;\n\t};\n\n\t// step #2. compute all \"start/goal states\"\n\tvector<int> start(Z, -1), goal(Z, -1);\n\tfor (int i = 0; i < Z; i++) {\n\t\tif (states[i][0] == states[i][1] && check(S[states[i][0]], -states[i][2] + L[states[i][0]])) {\n\t\t\tstart[i] = L[states[i][0]];\n\t\t}\n\t\tif (states[i][2] == 0) {\n\t\t\tgoal[i] = 0;\n\t\t}\n\t}\n\n\t// step #3. construct graph\n\tvector<edge_base> eg;\n\tfor (int i = 0; i < Z; i++) {\n\t\tarray<int, 3> s = states[i];\n\t\t// add to left\n\t\tif (s[2] >= 0) {\n\t\t\tfor (int j : G2[s[0]]) {\n\t\t\t\tbool ok = true;\n\t\t\t\tfor (int k = 0; k < s[2] && k < L[j]; k++) {\n\t\t\t\t\tok = ok && (S[s[1]][L[s[1]] - s[2] + k] == S[j][L[j] - k - 1]);\n\t\t\t\t}\n\t\t\t\tif (ok) {\n\t\t\t\t\tint z = search_state({j, s[1], s[2] - L[j]});\n\t\t\t\t\teg.push_back(edge_base{i, z, L[j]});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// add to right\n\t\tif (s[2] <= 0) {\n\t\t\tfor (int j : G1[s[1]]) {\n\t\t\t\tbool ok = true;\n\t\t\t\tfor (int k = 0; k < -s[2] && k < L[j]; k++) {\n\t\t\t\t\tok = ok && (S[s[0]][-s[2] - k - 1] == S[j][k]);\n\t\t\t\t}\n\t\t\t\tif (ok) {\n\t\t\t\t\tint z = search_state({s[0], j, s[2] + L[j]});\n\t\t\t\t\teg.push_back(edge_base{i, z, L[j]});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// step #4. compute answer\n\tint ans = longest_path(Z, eg, start, goal);\n\n\treturn ans;\n}\n\nint main() {\n\tint N, M;\n\tcin >> N >> M;\n\tvector<string> S(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> S[i];\n\t}\n\tvector<edge_base> es(M);\n\tfor (int i = 0; i < M; i++) {\n\t\tcin >> es[i].s >> es[i].t;\n\t\tes[i].s--; es[i].t--;\n\t}\n\tint ans = solve(N, M, S, es);\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":40224,"score_of_the_acc":-0.3698,"final_rank":7},{"submission_id":"aoj_2307_8487347","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 all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define sz(x) (int)x.size()\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\nvector<int> scc(vector<vector<int>> es) {\n int n = sz(es);\n vector<vector<int>> rs(n);\n rep(i, n) each(e, es[i]) rs[e].eb(i);\n\n vector<int> comp(n, -1);\n vector<int> vs;\n\n auto dfs = [&](auto &&dfs, int now) -> void {\n if (comp[now] != -1) return;\n comp[now] = 1;\n each(e, es[now]) dfs(dfs, e);\n vs.eb(now);\n };\n\n auto rdfs = [&](auto &&rdfs, int now, int col) -> void {\n if (comp[now] != -1) return;\n comp[now] = col;\n each(e, rs[now]) rdfs(rdfs, e, col);\n };\n\n rep(i, n) dfs(dfs, i);\n fill(all(comp), -1);\n reverse(all(vs));\n int cnt = 0;\n each(e, vs) {\n if (comp[e] == -1) rdfs(rdfs, e, cnt++);\n }\n return comp;\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n\n vector<string> S(N + 1);\n rep(i, N) cin >> S[i];\n\n vector<vector<int>> adj(N + 1, vector<int>(N + 1, 0));\n rep(i, M) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n adj[u][v] = 1;\n }\n\n rep(i, N + 1) adj[i][N] = adj[N][i] = 1;\n\n int L = 11;\n\n int V = 2 * (N + 1) * (N + 1) * L;\n\n auto tupleToInt = [&](int i, int j, int f, int l) {\n int ret = 0;\n ret *= N + 1, ret += i;\n ret *= N + 1, ret += j;\n ret *= 2, ret += f;\n ret *= L, ret += l;\n return ret;\n };\n\n vector<vector<int>> es(V + 1);\n vector<vector<ll>> weight(V + 1);\n\n rep(i, N + 1) rep(j, N + 1) rep(f, 2) rep(l, L) {\n int u = tupleToInt(i, j, f, l);\n if (f == 0) {\n if (l > sz(S[i])) continue;\n rep(k, N) {\n if (!adj[k][j]) continue;\n int m = sz(S[k]);\n if (m <= l) {\n string X = S[i];\n reverse(all(X));\n if (X.substr(l - m, m) != S[k]) continue;\n int v = tupleToInt(i, k, 0, l - m);\n es[u].eb(v);\n weight[u].eb(m);\n } else {\n string X = S[i];\n reverse(all(X));\n if (X.substr(0, l) != S[k].substr(m - l, l)) continue;\n int v = tupleToInt(i, k, 1, m - l);\n es[u].eb(v);\n weight[u].eb(l);\n }\n }\n } else {\n if (l > sz(S[j])) continue;\n rep(k, N) {\n if (!adj[i][k]) continue;\n int m = sz(S[k]);\n if (m < l) {\n string X = S[k];\n reverse(all(X));\n if (S[j].substr(l - m, m) != X) continue;\n int v = tupleToInt(k, j, 1, l - m);\n es[u].eb(v);\n weight[u].eb(m);\n } else {\n string X = S[k];\n reverse(all(X));\n if (S[j].substr(0, l) != X.substr(m - l, l)) continue;\n int v = tupleToInt(k, j, 0, m - l);\n es[u].eb(v);\n weight[u].eb(l);\n }\n }\n }\n }\n\n auto comp = scc(es);\n int K = sz(comp);\n\n vector<vector<pll>> dagEs(K);\n vector<int> deg(K, 0);\n rep(i, V + 1) {\n int T = sz(es[i]);\n assert(sz(weight[i]) == T);\n rep(j, T) {\n int u = comp[i], v = comp[es[i][j]];\n if (u == v) continue;\n ll w = weight[i][j];\n dagEs[u].eb(v, w);\n deg[v]++;\n }\n }\n\n vector<int> cnt(K, 0);\n rep(i, V + 1) cnt[comp[i]]++;\n\n vector<ll> d(K, -INF);\n queue<int> que;\n d[comp[tupleToInt(N, N, 0, 0)]] = 0;\n\n rep(i, K) {\n if (deg[i] == 0) que.emplace(i);\n }\n\n while (!empty(que)) {\n int i = que.front();\n if (cnt[i] >= 2 && d[i] != -INF) d[i] = INF;\n que.pop();\n for (auto [j, w] : dagEs[i]) {\n if (d[i] == INF) {\n chmax(d[j], INF);\n } else if (d[i] != -INF) {\n chmax(d[j], d[i] + w);\n }\n if (--deg[j] == 0) que.emplace(j);\n }\n }\n\n ll ans = -INF;\n\n auto isPalindrome = [](string S) {\n auto T = S;\n reverse(all(T));\n return S == T;\n };\n\n rep(i, N + 1) rep(j, N + 1) rep(f, 2) rep(l, L) {\n int v = comp[tupleToInt(i, j, f, l)];\n // if (d[v] == 4) cout << i MM j MM f MM l << endl;\n if (!adj[i][j]) continue;\n\n if (f == 0) {\n if (l > sz(S[i])) continue;\n if (isPalindrome(S[i].substr(sz(S[i]) - l, l))) {\n chmax(ans, d[v] * 2 + l); //\n }\n } else {\n if (l > sz(S[j])) continue;\n if (isPalindrome(S[j].substr(0, l))) {\n chmax(ans, d[v] * 2 + l); //\n }\n }\n }\n\n cout << (ans >= INF ? -1 : ans) << '\\n';\n}","accuracy":1,"time_ms":110,"memory_kb":44788,"score_of_the_acc":-0.4254,"final_rank":9},{"submission_id":"aoj_2307_8487341","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 all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n#define sz(x) (int)x.size()\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\nvector<int> scc(vector<vector<int>> es) {\n int n = sz(es);\n vector<vector<int>> rs(n);\n rep(i, n) each(e, es[i]) rs[e].eb(i);\n\n vector<int> comp(n, -1);\n vector<int> vs;\n\n auto dfs = [&](auto &&dfs, int now) -> void {\n if (comp[now] != -1) return;\n comp[now] = 1;\n each(e, es[now]) dfs(dfs, e);\n vs.eb(now);\n };\n\n auto rdfs = [&](auto &&rdfs, int now, int col) -> void {\n if (comp[now] != -1) return;\n comp[now] = col;\n each(e, rs[now]) rdfs(rdfs, e, col);\n };\n\n rep(i, n) dfs(dfs, i);\n fill(all(comp), -1);\n reverse(all(vs));\n int cnt = 0;\n each(e, vs) {\n if (comp[e] == -1) rdfs(rdfs, e, cnt++);\n }\n return comp;\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n\n vector<string> S(N + 1);\n rep(i, N) cin >> S[i];\n\n vector<vector<int>> adj(N + 1, vector<int>(N + 1, 0));\n rep(i, M) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n adj[u][v] = 1;\n }\n\n rep(i, N + 1) adj[i][N] = adj[N][i] = 1;\n\n int L = 10;\n\n int V = 2 * (N + 1) * (N + 1) * L;\n\n auto tupleToInt = [&](int i, int j, int f, int l) {\n int ret = 0;\n ret *= N + 1, ret += i;\n ret *= N + 1, ret += j;\n ret *= 2, ret += f;\n ret *= L, ret += l;\n return ret;\n };\n\n vector<vector<int>> es(V + 1);\n vector<vector<ll>> weight(V + 1);\n\n rep(i, N + 1) rep(j, N + 1) rep(f, 2) rep(l, L) {\n int u = tupleToInt(i, j, f, l);\n if (f == 0) {\n if (l > sz(S[i])) continue;\n rep(k, N) {\n if (!adj[k][j]) continue;\n int m = sz(S[k]);\n if (m <= l) {\n string X = S[i];\n reverse(all(X));\n if (X.substr(l - m, m) != S[k]) continue;\n int v = tupleToInt(i, k, 0, l - m);\n es[u].eb(v);\n weight[u].eb(m);\n } else {\n string X = S[i];\n reverse(all(X));\n if (X.substr(0, l) != S[k].substr(m - l, l)) continue;\n int v = tupleToInt(i, k, 1, m - l);\n es[u].eb(v);\n weight[u].eb(l);\n }\n }\n } else {\n if (l > sz(S[j])) continue;\n rep(k, N) {\n if (!adj[i][k]) continue;\n int m = sz(S[k]);\n if (m < l) {\n string X = S[k];\n reverse(all(X));\n if (S[j].substr(l - m, m) != X) continue;\n int v = tupleToInt(k, j, 1, l - m);\n es[u].eb(v);\n weight[u].eb(m);\n } else {\n string X = S[k];\n reverse(all(X));\n if (S[j].substr(0, l) != X.substr(m - l, l)) continue;\n int v = tupleToInt(k, j, 0, m - l);\n es[u].eb(v);\n weight[u].eb(l);\n }\n }\n }\n }\n\n auto comp = scc(es);\n int K = sz(comp);\n\n vector<vector<pll>> dagEs(K);\n vector<int> deg(K, 0);\n rep(i, V + 1) {\n int T = sz(es[i]);\n assert(sz(weight[i]) == T);\n rep(j, T) {\n int u = comp[i], v = comp[es[i][j]];\n if (u == v) continue;\n ll w = weight[i][j];\n dagEs[u].eb(v, w);\n deg[v]++;\n }\n }\n\n vector<int> cnt(K, 0);\n rep(i, V + 1) cnt[comp[i]]++;\n\n vector<ll> d(K, -INF);\n queue<int> que;\n d[comp[tupleToInt(N, N, 0, 0)]] = 0;\n\n rep(i, K) {\n if (deg[i] == 0) que.emplace(i);\n }\n\n while (!empty(que)) {\n int i = que.front();\n if (cnt[i] >= 2 && d[i] != -INF) d[i] = INF;\n que.pop();\n for (auto [j, w] : dagEs[i]) {\n if (d[i] == INF) {\n chmax(d[j], INF);\n } else if (d[i] != -INF) {\n chmax(d[j], d[i] + w);\n }\n if (--deg[j] == 0) que.emplace(j);\n }\n }\n\n ll ans = -INF;\n\n auto isPalindrome = [](string S) {\n auto T = S;\n reverse(all(T));\n return S == T;\n };\n\n rep(i, N + 1) rep(j, N + 1) rep(f, 2) rep(l, L) {\n int v = comp[tupleToInt(i, j, f, l)];\n // if (d[v] == 4) cout << i MM j MM f MM l << endl;\n if (!adj[i][j]) continue;\n\n if (f == 0) {\n if (l > sz(S[i])) continue;\n if (isPalindrome(S[i].substr(sz(S[i]) - l, l))) {\n chmax(ans, d[v] * 2 + l); //\n }\n } else {\n if (l > sz(S[j])) continue;\n if (isPalindrome(S[j].substr(0, l))) {\n chmax(ans, d[v] * 2 + l); //\n }\n }\n }\n\n cout << (ans >= INF ? -1 : ans) << '\\n';\n}","accuracy":0.15306122448979592,"time_ms":90,"memory_kb":31768,"score_of_the_acc":-0.2814,"final_rank":20},{"submission_id":"aoj_2307_8416865","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// Normal Vaeiables\nint N; string S[1009];\nint M, X[1009], Y[1009];\nbool Valid[109][109];\n\n// Dynamic Programming\nint Time = -1;\nint Last = -1;\nint dp[109][109][2][19];\ntuple<int, int, int, int> NexL[109][109][19];\ntuple<int, int, int, int> NexR[109][109][19];\npriority_queue<tuple<int, int, int, int, int>, vector<tuple<int, int, int, int, int>>, greater<tuple<int, int, int, int, int>>> Q;\n\nvoid Get_NexL(int new_, int old_, int nag) {\n string str1 = S[new_]; reverse(str1.begin(), str1.end());\n string str2 = S[old_].substr((int)S[old_].size() - nag, nag);\n if (str1.size() < str2.size()) str2 = str2.substr(0, str1.size());\n if (str1.size() > str2.size()) str1 = str1.substr(0, str2.size());\n\n // Invalid Case\n if (str1 != str2) {\n NexL[new_][old_][nag] = make_tuple(-1, -1, -1, -1);\n return;\n }\n\n // Valid Case\n int Len1 = S[new_].size();\n int Len2 = nag;\n if (Len1 >= Len2) NexL[new_][old_][nag] = make_tuple(new_, old_, 0, Len1 - Len2);\n if (Len1 < Len2) NexL[new_][old_][nag] = make_tuple(new_, old_, 1, Len2 - Len1);\n}\n\nvoid Get_NexR(int old_, int new_, int nag) {\n string str2 = S[old_].substr(0, nag); reverse(str2.begin(), str2.end());\n string str1 = S[new_];\n if (str1.size() < str2.size()) str2 = str2.substr(0, str1.size());\n if (str1.size() > str2.size()) str1 = str1.substr(0, str2.size());\n\n // Invalid Case\n if (str1 != str2) {\n NexR[old_][new_][nag] = make_tuple(-1, -1, -1, -1);\n return;\n }\n\n // Valid Case\n int Len1 = nag;\n int Len2 = S[new_].size();\n if (Len1 >= Len2) NexR[old_][new_][nag] = make_tuple(old_, new_, 0, Len1 - Len2);\n if (Len1 < Len2) NexR[old_][new_][nag] = make_tuple(old_, new_, 1, Len2 - Len1);\n}\n\nvoid Update(int pos1, int pos2, int typ, int nag) {\n // Left is Longer\n if (typ == 0) {\n for (int i = 1; i <= N; i++) {\n if (Valid[pos2][i] == false) continue;\n if (NexR[pos1][i][nag] == make_tuple(-1, -1, -1, -1)) continue;\n int nex1 = get<0>(NexR[pos1][i][nag]);\n int nex2 = get<1>(NexR[pos1][i][nag]);\n int nexT = get<2>(NexR[pos1][i][nag]);\n int nexN = get<3>(NexR[pos1][i][nag]);\n if (dp[nex1][nex2][nexT][nexN] < dp[pos1][pos2][typ][nag] + (int)S[i].size()) {\n dp[nex1][nex2][nexT][nexN] = dp[pos1][pos2][typ][nag] + (int)S[i].size();\n Q.push(make_tuple(dp[nex1][nex2][nexT][nexN], nex1, nex2, nexT, nexN));\n if (nexN == 0) Last = clock() - Time;\n }\n }\n }\n\n // Right is Longer\n if (typ == 1) {\n for (int i = 1; i <= N; i++) {\n if (Valid[i][pos1] == false) continue;\n if (NexL[i][pos2][nag] == make_tuple(-1, -1, -1, -1)) continue;\n int nex1 = get<0>(NexL[i][pos2][nag]);\n int nex2 = get<1>(NexL[i][pos2][nag]);\n int nexT = get<2>(NexL[i][pos2][nag]);\n int nexN = get<3>(NexL[i][pos2][nag]);\n if (dp[nex1][nex2][nexT][nexN] < dp[pos1][pos2][typ][nag] + (int)S[i].size()) {\n dp[nex1][nex2][nexT][nexN] = dp[pos1][pos2][typ][nag] + (int)S[i].size();\n Q.push(make_tuple(dp[nex1][nex2][nexT][nexN], nex1, nex2, nexT, nexN));\n if (nexN == 0) Last = clock() - Time;\n }\n }\n }\n}\n\nint main() {\n // Step 1. Input\n cin >> N >> M;\n for (int i = 1; i <= N; i++) cin >> S[i];\n for (int i = 1; i <= M; i++) cin >> X[i] >> Y[i];\n for (int i = 1; i <= M; i++) Valid[X[i]][Y[i]] = true;\n\n // Step 2. DP Init 1\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) {\n for (int k = 0; k < 2; k++) {\n for (int l = 0; l <= 10; l++) dp[i][j][k][l] = -(1 << 30);\n }\n }\n }\n\n // Step 3. DP Init 2\n for (int i = 1; i <= N; i++) {\n for (int j = 0; j <= (int)S[i].size(); j++) {\n string str1 = S[i].substr(0, j); reverse(str1.begin(), str1.end());\n string str2 = S[i].substr(j, S[i].size() - j);\n if (str1.size() < str2.size()) str2 = str2.substr(0, str1.size());\n if (str1.size() > str2.size()) str1 = str1.substr(0, str2.size());\n if (str1 != str2) continue;\n int Len1 = j;\n int Len2 = S[i].size() - j;\n int Type = (Len1 >= Len2 ? 0 : 1);\n int Naga = abs(Len1 - Len2);\n dp[i][i][Type][Naga] = S[i].size();\n Q.push(make_tuple((int)S[i].size(), i, i, Type, Naga));\n }\n }\n\n // Step 3. DP Init 3\n for (int i = 1; i <= N; i++) {\n for (int j = 0; j <= (int)S[i].size() - 1; j++) {\n string str1 = S[i].substr(0, j); reverse(str1.begin(), str1.end());\n string str2 = S[i].substr(j + 1, S[i].size() - (j + 1));\n if (str1.size() < str2.size()) str2 = str2.substr(0, str1.size());\n if (str1.size() > str2.size()) str1 = str1.substr(0, str2.size());\n if (str1 != str2) continue;\n int Len1 = j;\n int Len2 = S[i].size() - (j + 1);\n int Type = (Len1 >= Len2 ? 0 : 1);\n int Naga = abs(Len1 - Len2);\n dp[i][i][Type][Naga] = S[i].size();\n Q.push(make_tuple((int)S[i].size(), i, i, Type, Naga));\n }\n }\n\n\n // Step 4. DP Init 3\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) {\n for (int k = 0; k <= (int)S[j].size(); k++) Get_NexL(i, j, k);\n for (int k = 0; k <= (int)S[i].size(); k++) Get_NexR(i, j, k);\n }\n }\n\n // Step 5. DP Start\n Time = clock();\n while (!Q.empty()) {\n int curr = get<0>(Q.top());\n int pos1 = get<1>(Q.top());\n int pos2 = get<2>(Q.top());\n int typ = get<3>(Q.top());\n int nag = get<4>(Q.top()); Q.pop();\n if (curr != dp[pos1][pos2][typ][nag]) continue;\n\n // Update\n Update(pos1, pos2, typ, nag);\n if (clock() - Time >= 45 * CLOCKS_PER_SEC / 10) break;\n }\n\n // Step 6. Output\n if (Last >= 30 * CLOCKS_PER_SEC / 10) cout << \"-1\" << endl;\n else {\n int Answer = 0;\n for (int i = 1; i <= N; i++) {\n for (int j = 1; j <= N; j++) {\n Answer = max(Answer, dp[i][j][0][0]);\n Answer = max(Answer, dp[i][j][1][0]);\n }\n }\n cout << Answer << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":4500,"memory_kb":12304,"score_of_the_acc":-1.0549,"final_rank":12},{"submission_id":"aoj_2307_7134603","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=210005,INF=1<<28;\n\nint V,cmp[MAX];\nvector<int> G[MAX],rG[MAX],vs;//vsがトポソの逆順になってる\nbool used[MAX];\n\nint get_id(int i,bool f){\n return 2*i+f;\n}\n\nvoid add_edge(int from,int to){\n G[from].push_back(to);\n rG[to].push_back(from);\n}\n\nvoid either(int i,bool f,int j,bool g){\n add_edge(get_id(i,!f),get_id(j,g));\n add_edge(get_id(j,!g),get_id(i,f));\n //add_edge(2*i+(!f),2*j+g);\n //add_edge(2*j+(!g),2*i+f);\n}\n\nvoid imply(int i,bool f,int j,bool g){\n either(i,!f,j,g);\n}\n//iがfならばjがg\n\nvoid must(int i,bool f){\n either(i,f,i,f);\n}\n\nvoid DFS(int v){\n used[v]=1;\n for(int i=0;i<G[v].size();i++){\n if(used[G[v][i]]==0) DFS(G[v][i]);\n }\n vs.push_back(v);\n}\n\nvoid rDFS(int v,int k){\n used[v]=1;\n cmp[v]=k;\n for(int i=0;i<rG[v].size();i++){\n if(used[rG[v][i]]==0) rDFS(rG[v][i],k);\n }\n}\n\nint scc(){\n memset(used,0,sizeof(used));\n vs.clear();\n for(int v=0;v<V;v++){\n if(used[v]==0) DFS(v);\n }\n \n memset(used,0,sizeof(used));\n int k=0;\n for(int i=vs.size()-1;i>=0;i--){\n if(used[vs[i]]==0) rDFS(vs[i],k++);\n }\n return k;\n}\n\nvoid init(int sz){\n V=sz;\n for(int i=0;i<V;i++){\n cmp[i]=0;\n G[i].clear();\n rG[i].clear();\n used[i]=false;\n }\n vs.clear();\n}\n\nbool E[105][105];\n\nvector<pair<int,int>> sv[MAX],T[MAX];\n\nbool cycle[MAX];\n\nint dp[MAX];\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int N,M;cin>>N>>M;\n auto idx=[&](int l,int r,bool left,int len){\n int res=0;\n res+=l*N*21;\n res+=r*21;\n if(len==0){\n \n }else if(left){\n res+=len;\n }else{\n res+=10+len;\n }\n return res;\n };\n \n vector<string> S(N);\n for(int i=0;i<N;i++) cin>>S[i];\n \n for(int i=0;i<M;i++){\n int a,b;cin>>a>>b;a--;b--;\n E[a][b]=true;\n }\n \n for(int l=0;l<N;l++){\n for(int r=0;r<N;r++){\n for(int lef=0;lef<2;lef++){\n for(int len=0;len<=10;len++){\n if(lef==0&&len==0) continue;\n if(lef==1){\n if(len>si(S[l])) continue;\n }else{\n if(len>si(S[r])) continue;\n }\n \n int a=idx(l,r,lef,len);\n \n if(len==0){\n for(int x=0;x<N;x++){\n if(E[x][l]){\n int b=idx(x,r,1,si(S[x]));\n add_edge(a,b);\n sv[a].push_back(mp(b,si(S[x])));\n }\n }\n }else if(lef){\n for(int x=0;x<N;x++){\n if(E[r][x]){\n bool ok=true;\n for(int i=0;i<min(len,si(S[x]));i++){\n ok&=(S[l][len-1-i]==S[x][i]);\n }\n if(ok){\n if(len>=si(S[x])){\n int b=idx(l,x,1,len-si(S[x]));\n add_edge(a,b);\n sv[a].push_back(mp(b,si(S[x])));\n }else{\n int b=idx(l,x,0,si(S[x])-len);\n add_edge(a,b);\n sv[a].push_back(mp(b,si(S[x])));\n }\n }\n }\n }\n }else{\n for(int x=0;x<N;x++){\n if(E[x][l]){\n bool ok=true;\n for(int i=0;i<min(len,si(S[x]));i++){\n ok&=(S[x][si(S[x])-1-i]==S[r][si(S[r])-len+i]);\n }\n if(ok){\n if(len>si(S[x])){\n int b=idx(x,r,0,len-si(S[x]));\n add_edge(a,b);\n sv[a].push_back(mp(b,si(S[x])));\n }else{\n int b=idx(x,r,1,si(S[x])-len);\n add_edge(a,b);\n sv[a].push_back(mp(b,si(S[x])));\n }\n }\n }\n }\n }\n }\n }\n }\n }\n int st=N*N*21;\n for(int x=0;x<N;x++){\n for(int k=0;k<=si(S[x]);k++){\n bool ok=true;\n for(int i=0;i<min(k,si(S[x])-k);i++){\n ok&=(S[x][k-1-i]==S[x][k+i]);\n }\n if(ok){\n int a=st;\n if(k<=si(S[x])-k){\n int b=idx(x,x,0,si(S[x])-k-k);\n add_edge(a,b);\n sv[a].push_back(mp(b,si(S[x])));\n }else{\n int b=idx(x,x,1,k-(si(S[x])-k));\n add_edge(a,b);\n sv[a].push_back(mp(b,si(S[x])));\n }\n }\n }\n for(int k=0;k<si(S[x]);k++){\n bool ok=true;\n for(int i=0;i<min(k,si(S[x])-1-k);i++){\n ok&=(S[x][k-1-i]==S[x][k+1+i]);\n }\n if(ok){\n int a=st;\n if(k<=si(S[x])-1-k){\n int b=idx(x,x,0,si(S[x])-1-k-k);\n add_edge(a,b);\n sv[a].push_back(mp(b,si(S[x])));\n }else{\n int b=idx(x,x,1,k-(si(S[x])-1-k));\n add_edge(a,b);\n sv[a].push_back(mp(b,si(S[x])));\n }\n }\n }\n }\n V=st+1;\n int K=scc();\n vector<int> sz(K);\n for(int i=0;i<=st;i++){\n sz[cmp[i]]++;\n }\n \n for(int i=0;i<K;i++){\n if(sz[i]>=2) cycle[i]=true;\n }\n \n for(int i=0;i<V;i++){\n for(auto [j,len]:sv[i]){\n if(cmp[i]!=cmp[j]){\n assert(cmp[i]<cmp[j]);\n T[cmp[i]].push_back(mp(cmp[j],len));\n }\n }\n }\n \n for(int i=0;i<K;i++) dp[i]=-INF;\n dp[cmp[st]]=0;\n \n for(int i=0;i<K;i++){\n if(dp[i]>=0){\n if(cycle[i]) dp[i]=INF;\n \n for(auto [j,len]:T[i]){\n chmax(dp[j],dp[i]+len);\n }\n }\n }\n \n int ans=-INF;\n \n for(int l=0;l<N;l++){\n for(int r=0;r<N;r++){\n int a=idx(l,r,0,0);\n chmax(ans,dp[cmp[a]]);\n }\n }\n \n if(ans<0) cout<<0<<\"\\n\";\n else if(ans>=INF) cout<<-1<<\"\\n\";\n else cout<<ans<<\"\\n\";\n}","accuracy":1,"time_ms":60,"memory_kb":40996,"score_of_the_acc":-0.3736,"final_rank":8},{"submission_id":"aoj_2307_6024494","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 = 998244353;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 2;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\n\nvector<string> s;\nvector<vector<int>> G, rG;\nvector<P> vp;\nvector<int> ad;\nbool e[100][100];\n\n\nstruct graph {\nprivate:\n\tint n;\n\tvector<bool> used;\n\tvector<int> vs;\n\n\tint mk;\n\tvector<vector<int>> fG;\n\tvector<vector<int>> ori;\n\tvector<int> trans;\npublic:\n\tgraph(int sz) {\n\t\tn = sz;\n\t\tused.resize(n);\n\n\t\tfG.resize(n);\n\t\ttrans.resize(n, -1);\n\t\tori.resize(n);\n\t}\n\tvoid dfs(int v) {\n\t\tused[v] = true;\n\t\tint i = v / vp.size();\n\t\tint j = v % vp.size();\n\t\tint id1 = vp[i].first;\n\t\tint loc1 = vp[i].second;\n\t\tint id2 = vp[j].first;\n\t\tint loc2 = vp[j].second;\n\n\t\tif (loc1 > 0 && loc2 + 1 < s[id2].size()) {\n\t\t\tif (s[id1][loc1 - 1] == s[id2][loc2 + 1]) {\n\t\t\t\tint to = (i - 1) * vp.size() + j + 1;\n\t\t\t\tif (!used[to])dfs(to);\n\t\t\t}\n\t\t}\n\t\telse if (loc1 > 0) {\n\t\t\tfor (int idto : G[id2]) {\n\t\t\t\tif (s[id1][loc1 - 1] == s[idto][0]) {\n\t\t\t\t\tint to = (ad[id1] + loc1 - 1) * vp.size() + ad[idto] + 0;\n\n\t\t\t\t\tif (!used[to])dfs(to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse if (loc2 + 1 < s[id2].size()) {\n\t\t\tfor (int idto : rG[id1]) {\n\t\t\t\tif (s[idto].back() == s[id2][loc2 + 1]) {\n\t\t\t\t\tint to = (ad[idto] + s[idto].size() - 1) * vp.size() + ad[id2] + loc2 + 1;\n\n\t\t\t\t\tif (!used[to])dfs(to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int idto1 : rG[id1]) {\n\t\t\t\tfor (int idto2 : G[id2]) {\n\t\t\t\t\tif (s[idto1].back() == s[idto2][0]) {\n\t\t\t\t\t\tint to = (ad[idto1] + s[idto1].size() - 1) * vp.size() + ad[idto2] + 0;\n\n\t\t\t\t\t\tif (!used[to])dfs(to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvs.push_back(v);\n\t}\n\tvoid rdfs(int v, int k) {\n\t\tused[v] = true;\n\t\tqueue<int> q; q.push(v);\n\t\tvector<int> c;\n\t\twhile (!q.empty()) {\n\t\t\tint id = q.front(); q.pop();\n\t\t\tori[k].push_back(id);\n\t\t\tint i = id % vp.size();\n\t\t\tint j = id / vp.size();\n\t\t\tint id1 = vp[i].first;\n\t\t\tint loc1 = vp[i].second;\n\t\t\tint id2 = vp[j].first;\n\t\t\tint loc2 = vp[j].second;\n\t\t\tif (s[id1][loc1] == s[id2][loc2]) {\n\t\t\t\tif (loc1 > 0 && loc2 + 1 < s[id2].size()) {\n\t\t\t\t\t//if (s[id1][loc1 - 1] == s[id2][loc2 + 1]) {\n\t\t\t\t\tint to = (i - 1) + (j + 1) * vp.size();\n\t\t\t\t\tif (used[to]) {\n\t\t\t\t\t\tif (trans[to] >= 0)c.push_back(trans[to]);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tused[to] = true;\n\t\t\t\t\t\tq.push(to);\n\t\t\t\t\t}\n\t\t\t\t\t//}\n\t\t\t\t}\n\t\t\t\telse if (loc1 > 0) {\n\t\t\t\t\tfor (int idto : G[id2]) {\n\t\t\t\t\t\t//if (s[id1][loc1 - 1] == s[idto][0]) {\n\t\t\t\t\t\tint to = (ad[id1] + loc1 - 1) + (ad[idto] + 0) * vp.size();\n\t\t\t\t\t\tif (used[to]) {\n\t\t\t\t\t\t\tif (trans[to] >= 0)c.push_back(trans[to]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tused[to] = true;\n\t\t\t\t\t\t\tq.push(to);\n\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\telse if (loc2 + 1 < s[id2].size()) {\n\t\t\t\t\tfor (int idto : rG[id1]) {\n\t\t\t\t\t\t//if (s[idto].back() == s[id2][loc2 + 1]) {\n\t\t\t\t\t\tint to = (ad[idto] + s[idto].size() - 1) + (ad[id2] + loc2 + 1) * vp.size();\n\t\t\t\t\t\tif (used[to]) {\n\t\t\t\t\t\t\tif (trans[to] >= 0)c.push_back(trans[to]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tused[to] = true;\n\t\t\t\t\t\t\tq.push(to);\n\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\telse {\n\t\t\t\t\tfor (int idto1 : rG[id1]) {\n\t\t\t\t\t\tfor (int idto2 : G[id2]) {\n\t\t\t\t\t\t\t//if (s[idto1].back() == s[idto2][0]) {\n\t\t\t\t\t\t\tint to = (ad[idto1] + s[idto1].size() - 1) + (ad[idto2] + 0) * vp.size();\n\t\t\t\t\t\t\tif (used[to]) {\n\t\t\t\t\t\t\t\tif (trans[to] >= 0)c.push_back(trans[to]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tused[to] = true;\n\t\t\t\t\t\t\t\tq.push(to);\n\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}\n\t\t}\n\t\tsort(c.begin(), c.end());\n\t\tint len = unique(c.begin(), c.end()) - c.begin();\n\t\trep(i, len) {\n\t\t\tfG[c[i]].push_back(k);\n\t\t}\n\t\trep(i, ori[k].size()) {\n\t\t\ttrans[ori[k][i]] = k;\n\t\t}\n\t}\n\tvoid scc() {\n\t\tfill(used.begin(), used.end(), false);\n\t\trep(i, n) {\n\t\t\tif (!used[i])dfs(i);\n\t\t}\n\t\tfill(used.begin(), used.end(), false);\n\t\tint k = 0;\n\t\tper(i, (int)vs.size()) {\n\t\t\tif (!used[vs[i]]) {\n\t\t\t\trdfs(vs[i], k); k++;\n\t\t\t}\n\t\t}\n\t\tmk = k;\n\t}\n\tint query(vector<P> ps) {\n\t\tvector<int> lens(s.size());\n\t\trep(i, s.size())lens[i] = s[i].size();\n\t\tint m = lens.size();\n\t\tvector<int> ad(m + 1);\n\t\trep(i, m)ad[i + 1] = ad[i] + lens[i];\n\t\tint sum = ad[m];\n\t\tvector<bool> canfin(n);\n\t\trep(i, m)rep(j, m) {\n\t\t\tint id = ad[i] * sum + ad[j] + lens[j] - 1;\n\t\t\tcanfin[id] = true;\n\t\t}\n\t\tvector<P> ans(mk);\n\t\tper(i, mk) {\n\t\t\tbool exifin = false;\n\t\t\tfor (int id : ori[i]) {\n\t\t\t\tif (canfin[id])exifin = true;\n\t\t\t}\n\t\t\tfor (int to : fG[i]) {\n\t\t\t\tif (ans[to].second)exifin = true;\n\t\t\t}\n\t\t\tif (!exifin) {\n\t\t\t\tans[i] = { 0,0 };\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tans[i].second = 1;\n\t\t\tint ma = 0;\n\t\t\tfor (int to : fG[i]) {\n\t\t\t\tif (ans[to].second) {\n\t\t\t\t\tma = max(ma, ans[to].first + 2);\n\t\t\t\t}\n\t\t\t}\n\t\t\tans[i].first = ma;\n\t\t\tbool exiinf = false;\n\t\t\tif (ori[i].size() > 1)exiinf = true;\n\t\t\telse {\n\t\t\t\tint id = ori[i][0];\n\t\t\t\tint id1 = id / vp.size();\n\t\t\t\tint id2 = id % vp.size();\n\t\t\t\tid1 = vp[id1].first;\n\t\t\t\tid2 = vp[id2].first;\n\t\t\t\tif (s[id1].size() == 1 && s[id2].size() == 1 && s[id1] == s[id2]&&e[id1][id1]&&e[id2][id2])exiinf = true;\n\t\t\t}\n\t\t\tif (exiinf)ans[i].first = mod;\n\t\t}\n\t\tint res = 0;\n\t\t//odd\n\t\trep(i, m)rep(j, lens[i]) {\n\t\t\tint cur = (ad[i] + j) * sum + ad[i] + j;\n\t\t\tcur = trans[cur];\n\t\t\tif (ans[cur].second) {\n\t\t\t\tres = max(res, ans[cur].first + 1);\n\t\t\t}\n\t\t}\n\t\t//even\n\t\trep(i, m)rep(j, lens[i] - 1) {\n\t\t\tif (s[i][j] == s[i][j + 1]) {\n\t\t\t\tint cur = (ad[i] + j) * sum + ad[i] + j + 1;\n\t\t\t\tcur = trans[cur];\n\t\t\t\tif (ans[cur].second) {\n\t\t\t\t\tres = max(res, ans[cur].first + 2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(P p:ps){\n\t\t\tint i = p.first, j = p.second;\n\t\t\tif (s[i].back() == s[j][0]) {\n\t\t\t\tint cur = (ad[i] + lens[i] - 1) * sum + ad[j];\n\t\t\t\tcur = trans[cur];\n\t\t\t\tif (ans[cur].second) {\n\t\t\t\t\t//cout << \"? \"<<ori[cur].size()<<\" \"<<ori[cur][0] << \" \" << ans[cur].first << \"\\n\";\n\t\t\t\t\tres = max(res, ans[cur].first + 2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (res >= mod)res = -1;\n\t\treturn res;\n\t}\n};\n\nint dx[4] = { 1,0,-1,0 };\nint dy[4] = { 0,1,0,-1 };\n\nll gcd(ll x, ll y) {\n\tx = abs(x), y = abs(y);\n\tif (x < y)swap(x, y);\n\twhile (y) {\n\t\tll r = x % y; x = y; y = r;\n\t}\n\treturn x;\n}\n\nvoid solve() {\n\tint n, m; cin >> n >> m;\n\ts.resize(n);\n\trep(i, n)cin >> s[i];\n\tad.resize(n);\n\trep(i, n) {\n\t\tad[i] = vp.size();\n\t\trep(j, s[i].size())vp.push_back({ i,j });\n\t}\n\tG.resize(n);\n\trG.resize(n);\n\tvector<P> ps;\n\trep(i, m) {\n\t\tint a, b; cin >> a >> b; a--; b--;\n\t\tG[a].push_back(b);\n\t\trG[b].push_back(a);\n\t\te[a][b] = true;\n\t\tps.push_back({ a,b });\n\t}\n\tgraph g(vp.size()*vp.size());\n\tg.scc();\n\tint ans = g.query(ps);\n\tcout << ans << \"\\n\";\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//int t; cin >> t; rep(i, t)\n\t//while (cin >> n>>s,n)\n\t\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":120,"memory_kb":100468,"score_of_the_acc":-1.0245,"final_rank":11},{"submission_id":"aoj_2307_6024418","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 = 998244353;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-8;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 2;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\n\nvector<string> s;\nvector<vector<int>> G, rG;\nvector<P> vp;\nvector<int> ad;\nbool e[100][100];\n\n\nstruct graph {\nprivate:\n\tint n;\n\tvector<bool> used;\n\tvector<int> vs;\n\n\tint mk;\n\tvector<vector<int>> fG;\n\tvector<vector<int>> ori;\n\tvector<int> trans;\npublic:\n\tgraph(int sz) {\n\t\tn = sz;\n\t\tused.resize(n);\n\n\t\tfG.resize(n);\n\t\ttrans.resize(n, -1);\n\t\tori.resize(n);\n\t}\n\tvoid dfs(int v) {\n\t\tused[v] = true;\n\t\tint i = v / vp.size();\n\t\tint j = v % vp.size();\n\t\tint id1 = vp[i].first;\n\t\tint loc1 = vp[i].second;\n\t\tint id2 = vp[j].first;\n\t\tint loc2 = vp[j].second;\n\n\t\tint cur = i * vp.size() + j;\n\t\tif (loc1 > 0 && loc2 + 1 < s[id2].size()) {\n\t\t\tif (s[id1][loc1 - 1] == s[id2][loc2 + 1]) {\n\t\t\t\tint to = (i - 1) * vp.size() + j + 1;\n\t\t\t\tif (!used[to])dfs(to);\n\t\t\t}\n\t\t}\n\t\telse if (loc1 > 0) {\n\t\t\tfor (int idto : G[id2]) {\n\t\t\t\tif (s[id1][loc1 - 1] == s[idto][0]) {\n\t\t\t\t\tint to = (ad[id1] + loc1 - 1) * vp.size() + ad[idto] + 0;\n\n\t\t\t\t\tif (!used[to])dfs(to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse if (loc2 + 1 < s[id2].size()) {\n\t\t\tfor (int idto : rG[id1]) {\n\t\t\t\tif (s[idto].back() == s[id2][loc2 + 1]) {\n\t\t\t\t\tint to = (ad[idto] + s[idto].size() - 1) * vp.size() + ad[id2] + loc2 + 1;\n\n\t\t\t\t\tif (!used[to])dfs(to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tfor (int idto1 : rG[id1]) {\n\t\t\t\tfor (int idto2 : G[id2]) {\n\t\t\t\t\tif (s[idto1].back() == s[idto2][0]) {\n\t\t\t\t\t\tint to = (ad[idto1] + s[idto1].size() - 1) * vp.size() + ad[idto2] + 0;\n\n\t\t\t\t\t\tif (!used[to])dfs(to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvs.push_back(v);\n\t}\n\tvoid rdfs(int v, int k) {\n\t\tused[v] = true;\n\t\tqueue<int> q; q.push(v);\n\t\tvector<int> c;\n\t\twhile (!q.empty()) {\n\t\t\tint id = q.front(); q.pop();\n\t\t\tori[k].push_back(id);\n\t\t\tint i = id % vp.size();\n\t\t\tint j = id / vp.size();\n\t\t\tint id1 = vp[i].first;\n\t\t\tint loc1 = vp[i].second;\n\t\t\tint id2 = vp[j].first;\n\t\t\tint loc2 = vp[j].second;\n\n\t\t\tint cur = i * vp.size() + j;\n\t\t\tif (loc1 > 0 && loc2 + 1 < s[id2].size()) {\n\t\t\t\tif (s[id1][loc1 - 1] == s[id2][loc2 + 1]) {\n\t\t\t\t\tint to = (i - 1) + (j + 1) * vp.size();\n\t\t\t\t\tif (used[to]) {\n\t\t\t\t\t\tif (trans[to] >= 0)c.push_back(trans[to]);\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tused[to] = true;\n\t\t\t\t\t\tq.push(to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (loc1 > 0) {\n\t\t\t\tfor (int idto : G[id2]) {\n\t\t\t\t\tif (s[id1][loc1 - 1] == s[idto][0]) {\n\t\t\t\t\t\tint to = (ad[id1] + loc1 - 1) + (ad[idto] + 0) * vp.size();\n\t\t\t\t\t\tif (used[to]) {\n\t\t\t\t\t\t\tif (trans[to] >= 0)c.push_back(trans[to]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tused[to] = true;\n\t\t\t\t\t\t\tq.push(to);\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\telse if (loc2 + 1 < s[id2].size()) {\n\t\t\t\tfor (int idto : rG[id1]) {\n\t\t\t\t\tif (s[idto].back() == s[id2][loc2 + 1]) {\n\t\t\t\t\t\tint to = (ad[idto] + s[idto].size() - 1) + (ad[id2] + loc2 + 1)*vp.size();\n\t\t\t\t\t\tif (used[to]) {\n\t\t\t\t\t\t\tif (trans[to] >= 0)c.push_back(trans[to]);\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tused[to] = true;\n\t\t\t\t\t\t\tq.push(to);\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\telse {\n\t\t\t\tfor (int idto1 : rG[id1]) {\n\t\t\t\t\tfor (int idto2 : G[id2]) {\n\t\t\t\t\t\tif (s[idto1].back() == s[idto2][0]) {\n\t\t\t\t\t\t\tint to = (ad[idto1] + s[idto1].size() - 1) + (ad[idto2] + 0)*vp.size();\n\t\t\t\t\t\t\tif (used[to]) {\n\t\t\t\t\t\t\t\tif (trans[to] >= 0)c.push_back(trans[to]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tused[to] = true;\n\t\t\t\t\t\t\t\tq.push(to);\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\tsort(c.begin(), c.end());\n\t\tint len = unique(c.begin(), c.end()) - c.begin();\n\t\trep(i, len) {\n\t\t\tfG[c[i]].push_back(k);\n\t\t}\n\t\trep(i, ori[k].size()) {\n\t\t\ttrans[ori[k][i]] = k;\n\t\t}\n\t}\n\tvoid scc() {\n\t\tfill(used.begin(), used.end(), false);\n\t\trep(i, n) {\n\t\t\tif (!used[i])dfs(i);\n\t\t}\n\t\tfill(used.begin(), used.end(), false);\n\t\tint k = 0;\n\t\tper(i, (int)vs.size()) {\n\t\t\tif (!used[vs[i]]) {\n\t\t\t\trdfs(vs[i], k); k++;\n\t\t\t}\n\t\t}\n\t\tmk = k;\n\t}\n\tint query(vector<P> ps) {\n\t\tvector<int> lens(s.size());\n\t\trep(i, s.size())lens[i] = s[i].size();\n\t\tint m = lens.size();\n\t\tvector<int> ad(m + 1);\n\t\trep(i, m)ad[i + 1] = ad[i] + lens[i];\n\t\tint sum = ad[m];\n\t\tvector<bool> canfin(n);\n\t\trep(i, m)rep(j, m) {\n\t\t\tint id = ad[i] * sum + ad[j] + lens[j] - 1;\n\t\t\tcanfin[id] = true;\n\t\t}\n\t\tvector<P> ans(mk);\n\t\tper(i, mk) {\n\t\t\tbool exifin = false;\n\t\t\tfor (int id : ori[i]) {\n\t\t\t\tif (canfin[id])exifin = true;\n\t\t\t}\n\t\t\tfor (int to : fG[i]) {\n\t\t\t\tif (ans[to].second)exifin = true;\n\t\t\t}\n\t\t\tif (!exifin) {\n\t\t\t\tans[i] = { 0,0 };\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tans[i].second = 1;\n\t\t\tint ma = 0;\n\t\t\tfor (int to : fG[i]) {\n\t\t\t\tif (ans[to].second) {\n\t\t\t\t\tma = max(ma, ans[to].first + 2);\n\t\t\t\t}\n\t\t\t}\n\t\t\tans[i].first = ma;\n\t\t\tbool exiinf = false;\n\t\t\tif (ori[i].size() > 1)exiinf = true;\n\t\t\telse {\n\t\t\t\tint id = ori[i][0];\n\t\t\t\tint id1 = id / vp.size();\n\t\t\t\tint id2 = id % vp.size();\n\t\t\t\tid1 = vp[id1].first;\n\t\t\t\tid2 = vp[id2].first;\n\t\t\t\tif (s[id1].size() == 1 && s[id2].size() == 1 && s[id1] == s[id2]&&e[id1][id1]&&e[id2][id2])exiinf = true;\n\t\t\t}\n\t\t\tif (exiinf)ans[i].first = mod;\n\t\t}\n\t\tint res = 0;\n\t\t//odd\n\t\trep(i, m)rep(j, lens[i]) {\n\t\t\tint cur = (ad[i] + j) * sum + ad[i] + j;\n\t\t\tcur = trans[cur];\n\t\t\tif (ans[cur].second) {\n\t\t\t\tres = max(res, ans[cur].first + 1);\n\t\t\t}\n\t\t}\n\t\t//even\n\t\trep(i, m)rep(j, lens[i] - 1) {\n\t\t\tif (s[i][j] == s[i][j + 1]) {\n\t\t\t\tint cur = (ad[i] + j) * sum + ad[i] + j + 1;\n\t\t\t\tcur = trans[cur];\n\t\t\t\tif (ans[cur].second) {\n\t\t\t\t\tres = max(res, ans[cur].first + 2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(P p:ps){\n\t\t\tint i = p.first, j = p.second;\n\t\t\tif (s[i].back() == s[j][0]) {\n\t\t\t\tint cur = (ad[i] + lens[i] - 1) * sum + ad[j];\n\t\t\t\tcur = trans[cur];\n\t\t\t\tif (ans[cur].second) {\n\t\t\t\t\t//cout << \"? \"<<ori[cur].size()<<\" \"<<ori[cur][0] << \" \" << ans[cur].first << \"\\n\";\n\t\t\t\t\tres = max(res, ans[cur].first + 2);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (res >= mod)res = -1;\n\t\treturn res;\n\t}\n};\n\nint dx[4] = { 1,0,-1,0 };\nint dy[4] = { 0,1,0,-1 };\n\nll gcd(ll x, ll y) {\n\tx = abs(x), y = abs(y);\n\tif (x < y)swap(x, y);\n\twhile (y) {\n\t\tll r = x % y; x = y; y = r;\n\t}\n\treturn x;\n}\n\nvoid solve() {\n\tint n, m; cin >> n >> m;\n\ts.resize(n);\n\trep(i, n)cin >> s[i];\n\tad.resize(n);\n\trep(i, n) {\n\t\tad[i] = vp.size();\n\t\trep(j, s[i].size())vp.push_back({ i,j });\n\t}\n\tG.resize(n);\n\trG.resize(n);\n\tvector<P> ps;\n\trep(i, m) {\n\t\tint a, b; cin >> a >> b; a--; b--;\n\t\tG[a].push_back(b);\n\t\trG[b].push_back(a);\n\t\te[a][b] = true;\n\t\tps.push_back({ a,b });\n\t}\n\tgraph g(vp.size()*vp.size());\n\tg.scc();\n\tint ans = g.query(ps);\n\tcout << ans << \"\\n\";\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//int t; cin >> t; rep(i, t)\n\t//while (cin >> n>>s,n)\n\t\tsolve();\n\treturn 0;\n}","accuracy":0.2653061224489796,"time_ms":120,"memory_kb":98532,"score_of_the_acc":-1.0037,"final_rank":19},{"submission_id":"aoj_2307_5846904","code_snippet":"#line 2 \"/Users/nok0/Documents/Programming/nok0/graph/graph.hpp\"\n#include <algorithm>\n#include <cassert>\n#include <deque>\n#include <iostream>\n#include <queue>\n#include <tuple>\n#include <utility>\n#include <vector>\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\ttemplate <class F>\n\tstruct rec_lambda {\n\t\tF f;\n\t\trec_lambda(F &&f_) : f(std::forward<F>(f_)) {}\n\t\ttemplate <class... Args>\n\t\tauto operator()(Args &&... args) const {\n\t\t\treturn f(*this, std::forward<Args>(args)...);\n\t\t}\n\t};\n\npublic:\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() { // 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\tfor(int i = 0; i < n; i++) {\n\t\t\trec_lambda([&](auto &&dfs, int k) -> void {\n\t\t\t\tif(not_DAG) return;\n\t\t\t\tif(used[k]) {\n\t\t\t\t\tif(used[k] == 1) not_DAG = true;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tused[k] = 1;\n\t\t\t\tfor(auto &e : edges[k]) dfs(e.to);\n\t\t\t\tused[k] = 2;\n\t\t\t\tres.push_back(k);\n\t\t\t})(i);\n\t\t}\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\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] == -1 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() { // 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// Ο(V+E)\n\t// return {s, v1, v2, ... t}\n\tstd::vector<int> diameter_path() {\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\tauto vec2 = bfs(v1);\n\t\tdia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec2[i]) dia = vec2[i], v2 = i;\n\t\tvec = bfs(v2);\n\t\tstd::vector<int> ret;\n\t\tauto dfs = [&](auto self, int now, int p) -> void {\n\t\t\tret.emplace_back(now);\n\t\t\tif(now == v2) return;\n\t\t\tfor(auto &[to, cost] : (*this)[now]) {\n\t\t\t\tif(vec[to] + vec2[to] == dia and to != p)\n\t\t\t\t\tself(self, to, now);\n\t\t\t}\n\t\t};\n\t\tdfs(dfs, v1, -1);\n\t\treturn ret;\n\t}\n\n\t// Ο(V+E)\n\t// return subtree_size, root = root\n\tstd::vector<int> subtree_size(const int root) {\n\t\tint n = size();\n\t\tstd::vector<int> ret(n, 1);\n\t\trec_lambda([&](auto &&dfs, int now, int p) -> void {\n\t\t\tfor(auto &[to, cost] : (*this)[now]) {\n\t\t\t\tif(to == p) continue;\n\t\t\t\tdfs(to, now);\n\t\t\t\tret[now] += ret[to];\n\t\t\t}\n\t\t})(root, -1);\n\t\treturn ret;\n\t}\n\n\t// Ο(ElogV)\n\tlong long prim() { // 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#line 3 \"/Users/nok0/Documents/Programming/nok0/graph/scc.hpp\"\n\nstruct strongly_connected_components {\nprivate:\n\tenum { CHECKED = -1,\n\t\t 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\npublic:\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 : 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#line 1 \"/Users/nok0/Documents/Programming/nok0/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\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}\n#if __has_include(<atcoder/all>)\nstd::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\ntemplate <int m>\nstd::istream &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 &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\n#endif\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}\n#if __has_include(<atcoder/all>)\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\n#endif\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}\ntemplate <class T>\nvoid MUL(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v *= x;\n}\ntemplate <class T>\nvoid DIV(std::vector<T> &a, const T x) {\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}\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}\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 4 \"h.cpp\"\n\nconst int MAX_LEN_P = 11;\nvoid main_() {\n\t//input\n\tINT(n, m);\n\tVEC(string, s, n);\n\tvector adj(n, vector(n, false));\n\tREP(i, m) {\n\t\tINT(x, y);\n\t\tadj[--x][--y] = true;\n\t}\n\n\tint N = n * n * MAX_LEN_P * 2;\n\tGraph g(N);\n\t//一番左がword l , 一番右がword r, 左がlen文字余ってる\n\tauto left_id = [&](int l, int r, int len) {\n\t\treturn l * n * MAX_LEN_P + r * MAX_LEN_P + len;\n\t};\n\tauto right_id = [&](int l, int r, int len) {\n\t\treturn n * n * MAX_LEN_P + l * n * MAX_LEN_P + r * MAX_LEN_P + len;\n\t};\n\n\tmap<pii, int> mp;\n\n\t//aaba -> aabaabc\n\t//左が余っている場合->右を追加する\n\tREP(l, n) {\n\t\tREP(len, SZ(s[l]) + 1) {\n\t\t\tauto amari = s[l].substr(0, len);\n\t\t\treverse(all(amari));\n\t\t\tREP(r, n) {\n\t\t\t\tREP(len2, SZ(s[r]) + 1) {\n\t\t\t\t\tauto kesu = s[r].substr(0, len2);\n\t\t\t\t\tif(amari != kesu) continue;\n\t\t\t\t\tREP(r2, n) {\n\t\t\t\t\t\tif(!adj[r2][r]) continue;\n\t\t\t\t\t\tint u = left_id(l, r2, len);\n\t\t\t\t\t\tint v = right_id(l, r, SZ(s[r]) - len2);\n\t\t\t\t\t\tg.add_edge(u, v, SZ(s[r]), 1);\n\t\t\t\t\t\tchmax(mp[{u, v}], SZ(s[r]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t//右が余っている場合\n\tREP(r, n) {\n\t\tREP(len, SZ(s[r]) + 1) {\n\t\t\tauto amari = s[r].substr(SZ(s[r]) - len);\n\t\t\treverse(all(amari));\n\t\t\tREP(l, n) {\n\t\t\t\tREP(len2, SZ(s[l]) + 1) {\n\t\t\t\t\tauto kesu = s[l].substr(SZ(s[l]) - len2);\n\t\t\t\t\tif(amari != kesu) continue;\n\t\t\t\t\tREP(l2, n) {\n\t\t\t\t\t\tif(!adj[l][l2]) continue;\n\t\t\t\t\t\tint u = right_id(l2, r, len);\n\t\t\t\t\t\tint v = left_id(l, r, SZ(s[l]) - len2);\n\t\t\t\t\t\tg.add_edge(u, v, SZ(s[l]), 1);\n\t\t\t\t\t\tchmax(mp[{u, v}], SZ(s[l]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t//左が余ってる->右追加する->やっぱり左余る\n\tREP(l, n) {\n\t\tREP(len, SZ(s[l]) + 1) {\n\t\t\tREP(r, n) {\n\t\t\t\tif(len < SZ(s[r])) continue;\n\t\t\t\tint len2 = SZ(s[r]);\n\t\t\t\tstring lef = s[l].substr(len - len2, len2);\n\t\t\t\treverse(all(lef));\n\t\t\t\tif(lef == s[r]) {\n\t\t\t\t\tREP(r2, n) {\n\t\t\t\t\t\tif(!adj[r2][r]) continue;\n\t\t\t\t\t\tint u = left_id(l, r2, len);\n\t\t\t\t\t\tint v = left_id(l, r, len - len2);\n\t\t\t\t\t\tg.add_edge(u, v, SZ(s[r]), 1);\n\t\t\t\t\t\tchmax(mp[{u, v}], SZ(s[r]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t//右が余ってる->左追加する->やっぱり右余る\n\tREP(r, n) {\n\t\tREP(len, SZ(s[r]) + 1) {\n\t\t\tREP(l, n) {\n\t\t\t\tif(len < SZ(s[l])) continue;\n\t\t\t\tint len2 = SZ(s[l]);\n\t\t\t\tstring rig = s[r].substr(SZ(s[r]) - len, len2);\n\t\t\t\treverse(all(rig));\n\t\t\t\tif(rig == s[l]) {\n\t\t\t\t\tREP(l2, n) {\n\t\t\t\t\t\tif(!adj[l][l2]) continue;\n\t\t\t\t\t\tint u = right_id(l2, r, len);\n\t\t\t\t\t\tint v = right_id(l, r, len - len2);\n\t\t\t\t\t\tg.add_edge(u, v, SZ(s[l]), 1);\n\t\t\t\t\t\tchmax(mp[{u, v}], SZ(s[l]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tstrongly_connected_components scc(g, 1);\n\tauto &h = scc.graph_compressed;\n\n\tN = SZ(h);\n\n\tvector dp(N, -inf);\n\tvector vis(N, false);\n\n\tREP(i, n) {\n\t\t//左を余らせる場合\n\t\tREP(len, SZ(s[i]) + 1) {\n\t\t\tstring lef = s[i].substr(len);\n\t\t\tstring rig = lef;\n\t\t\treverse(all(rig));\n\t\t\tif(lef == rig) {\n\t\t\t\tdp[scc[left_id(i, i, len)]] = SZ(s[i]);\n\t\t\t\tvis[scc[left_id(i, i, len)]] = 1;\n\t\t\t}\n\t\t}\n\n\t\t//右を余らせる場合\n\t\tREP(len, SZ(s[i]) + 1) {\n\t\t\tstring lef = s[i].substr(0, SZ(s[i]) - len);\n\t\t\tstring rig = lef;\n\t\t\treverse(all(rig));\n\t\t\tif(lef == rig) {\n\t\t\t\tdp[scc[right_id(i, i, len)]] = SZ(s[i]);\n\t\t\t\tvis[scc[right_id(i, i, len)]] = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tauto &groups = scc.groups;\n\t//debug(groups);\n\n\tREP(i, N) {\n\t\tif(SZ(groups[i]) != 1) dp[i] = inf;\n\t}\n\n\tauto tsort = h.topological_sort();\n\n\tfoa(idx, tsort) {\n\t\tif(!vis[idx]) continue;\n\t\tfor(auto [to, cost] : h[idx]) {\n\t\t\tvis[to] = true;\n\t\t\tchmax(dp[to], dp[idx] + mp[{groups[idx][0], groups[to][0]}]);\n\t\t}\n\t}\n\n\tint res = 0;\n\tREP(i, n) {\n\t\tREP(j, n) {\n\t\t\tint lid = scc[left_id(i, j, 0)];\n\t\t\tif(vis[lid]) {\n\t\t\t\tchmax(res, dp[lid]);\n\t\t\t}\n\t\t\tint rid = scc[right_id(i, j, 0)];\n\t\t\tif(vis[rid]) {\n\t\t\t\tchmax(res, dp[rid]);\n\t\t\t}\n\t\t}\n\t}\n\n\tprint(res >= inf ? -1 : res);\n}","accuracy":1,"time_ms":190,"memory_kb":87896,"score_of_the_acc":-0.9053,"final_rank":10},{"submission_id":"aoj_2307_5846516","code_snippet":"#line 2 \"/Users/nok0/Documents/Programming/nok0/graph/graph.hpp\"\n#include <algorithm>\n#include <cassert>\n#include <deque>\n#include <iostream>\n#include <queue>\n#include <tuple>\n#include <utility>\n#include <vector>\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\ttemplate <class F>\n\tstruct rec_lambda {\n\t\tF f;\n\t\trec_lambda(F &&f_) : f(std::forward<F>(f_)) {}\n\t\ttemplate <class... Args>\n\t\tauto operator()(Args &&... args) const {\n\t\t\treturn f(*this, std::forward<Args>(args)...);\n\t\t}\n\t};\n\npublic:\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() { // 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\tfor(int i = 0; i < n; i++) {\n\t\t\trec_lambda([&](auto &&dfs, int k) -> void {\n\t\t\t\tif(not_DAG) return;\n\t\t\t\tif(used[k]) {\n\t\t\t\t\tif(used[k] == 1) not_DAG = true;\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tused[k] = 1;\n\t\t\t\tfor(auto &e : edges[k]) dfs(e.to);\n\t\t\t\tused[k] = 2;\n\t\t\t\tres.push_back(k);\n\t\t\t})(i);\n\t\t}\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\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] == -1 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() { // 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// Ο(V+E)\n\t// return {s, v1, v2, ... t}\n\tstd::vector<int> diameter_path() {\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\tauto vec2 = bfs(v1);\n\t\tdia = -1;\n\t\tfor(int i = 0; i < int(size()); i++)\n\t\t\tif(dia < vec2[i]) dia = vec2[i], v2 = i;\n\t\tvec = bfs(v2);\n\t\tstd::vector<int> ret;\n\t\tauto dfs = [&](auto self, int now, int p) -> void {\n\t\t\tret.emplace_back(now);\n\t\t\tif(now == v2) return;\n\t\t\tfor(auto &[to, cost] : (*this)[now]) {\n\t\t\t\tif(vec[to] + vec2[to] == dia and to != p)\n\t\t\t\t\tself(self, to, now);\n\t\t\t}\n\t\t};\n\t\tdfs(dfs, v1, -1);\n\t\treturn ret;\n\t}\n\n\t// Ο(V+E)\n\t// return subtree_size, root = root\n\tstd::vector<int> subtree_size(const int root) {\n\t\tint n = size();\n\t\tstd::vector<int> ret(n, 1);\n\t\trec_lambda([&](auto &&dfs, int now, int p) -> void {\n\t\t\tfor(auto &[to, cost] : (*this)[now]) {\n\t\t\t\tif(to == p) continue;\n\t\t\t\tdfs(to, now);\n\t\t\t\tret[now] += ret[to];\n\t\t\t}\n\t\t})(root, -1);\n\t\treturn ret;\n\t}\n\n\t// Ο(ElogV)\n\tlong long prim() { // 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#line 3 \"/Users/nok0/Documents/Programming/nok0/graph/scc.hpp\"\n\nstruct strongly_connected_components {\nprivate:\n\tenum { CHECKED = -1,\n\t\t 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\npublic:\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 : 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#line 1 \"/Users/nok0/Documents/Programming/nok0/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\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}\n#if __has_include(<atcoder/all>)\nstd::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\ntemplate <int m>\nstd::istream &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 &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\n\tlong long v;\n\tis >> v;\n\ta = v;\n\treturn is;\n}\n#endif\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}\n#if __has_include(<atcoder/all>)\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\ntemplate <int m>\nstd::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\n#endif\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}\ntemplate <class T>\nvoid MUL(std::vector<T> &a, const T x) {\n\tfor(auto &v : a) v *= x;\n}\ntemplate <class T>\nvoid DIV(std::vector<T> &a, const T x) {\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}\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}\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 4 \"h.cpp\"\n\nconst int MAX_LEN_P = 11;\nvoid main_() {\n\tINT(n, m);\n\tVEC(string, s, n);\n\tvector adj(n, vector(n, false));\n\tREP(i, m) {\n\t\tINT(x, y);\n\t\tadj[--x][--y] = true;\n\t}\n\tint N = n * n * MAX_LEN_P * 2;\n\tGraph g(N);\n\tauto left_id = [&](int l, int r, int len) {\n\t\treturn l * n * MAX_LEN_P + r * MAX_LEN_P + len;\n\t};\n\tauto right_id = [&](int l, int r, int len) {\n\t\treturn n * n * MAX_LEN_P + l * n * MAX_LEN_P + r * MAX_LEN_P + len;\n\t};\n\n\tmap<pii, int> mp;\n\n\t//左が余っている場合\n\tREP(l, n) {\n\t\tREP(len, SZ(s[l]) + 1) {\n\t\t\tauto amari = s[l].substr(0, len);\n\t\t\treverse(all(amari));\n\t\t\tREP(r, n) {\n\t\t\t\tREP(len2, SZ(s[r]) + 1) {\n\t\t\t\t\tauto kesu = s[r].substr(0, len2);\n\t\t\t\t\tif(amari != kesu) continue;\n\t\t\t\t\tREP(r2, n) {\n\t\t\t\t\t\tif(!adj[r2][r]) continue;\n\t\t\t\t\t\tint u = left_id(l, r2, len);\n\t\t\t\t\t\tint v = right_id(l, r, SZ(s[r]) - len2);\n\t\t\t\t\t\tg.add_edge(u, v, SZ(s[r]), 1);\n\t\t\t\t\t\tchmax(mp[{u, v}], SZ(s[r]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t//右が余る場合\n\tREP(r, n) {\n\t\tREP(len, SZ(s[r]) + 1) {\n\t\t\tauto amari = s[r].substr(SZ(s[r]) - len);\n\t\t\treverse(all(amari));\n\t\t\tREP(l, n) {\n\t\t\t\tREP(len2, SZ(s[l]) + 1) {\n\t\t\t\t\tauto kesu = s[l].substr(SZ(s[l]) - len2);\n\t\t\t\t\tif(amari != kesu) continue;\n\t\t\t\t\tREP(l2, n) {\n\t\t\t\t\t\tif(!adj[l][l2]) continue;\n\t\t\t\t\t\tint u = right_id(l2, r, len);\n\t\t\t\t\t\tint v = left_id(l, r, SZ(s[l]) - len2);\n\t\t\t\t\t\tg.add_edge(u, v, SZ(s[l]), 1);\n\t\t\t\t\t\tchmax(mp[{u, v}], SZ(s[l]));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tstrongly_connected_components scc(g, 1);\n\tauto &h = scc.graph_compressed;\n\n\tN = SZ(h);\n\n\tvector dp(N, -inf);\n\tvector vis(N, false);\n\n\tREP(i, n) {\n\t\t//左を余らせる場合\n\t\tREP(len, SZ(s[i]) + 1) {\n\t\t\tstring lef = s[i].substr(len);\n\t\t\tstring rig = lef;\n\t\t\treverse(all(rig));\n\t\t\tif(lef == rig) {\n\t\t\t\tdp[scc[left_id(i, i, len)]] = SZ(s[i]);\n\t\t\t\tvis[scc[left_id(i, i, len)]] = 1;\n\t\t\t}\n\t\t}\n\n\t\t//右を余らせる場合\n\t\tREP(len, SZ(s[i]) + 1) {\n\t\t\tstring lef = s[i].substr(0, SZ(s[i]) - len);\n\t\t\tstring rig = lef;\n\t\t\treverse(all(rig));\n\t\t\tif(lef == rig) {\n\t\t\t\tdp[scc[right_id(i, i, len)]] = SZ(s[i]);\n\t\t\t\tvis[scc[right_id(i, i, len)]] = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tauto &groups = scc.groups;\n\t//debug(groups);\n\n\tREP(i, N) {\n\t\tif(SZ(groups[i]) != 1) dp[i] = inf;\n\t}\n\n\tdebug(dp);\n\n\tauto tsort = h.topological_sort();\n\n\tfoa(idx, tsort) {\n\t\tif(!vis[idx]) continue;\n\t\tfor(auto [to, cost] : h[idx]) {\n\t\t\tchmax(dp[to], dp[idx] + mp[{groups[idx][0], groups[to][0]}]);\n\t\t\tvis[to] = 1;\n\t\t}\n\t}\n\n\tint res = 0;\n\tREP(i, n) {\n\t\tREP(j, n) {\n\t\t\tint lid = scc[left_id(i, j, 0)];\n\t\t\tif(vis[lid]) {\n\t\t\t\tchmax(res, dp[lid]);\n\t\t\t}\n\t\t\tint rid = scc[right_id(i, j, 0)];\n\t\t\tif(vis[rid]) {\n\t\t\t\tchmax(res, dp[rid]);\n\t\t\t}\n\t\t}\n\t}\n\n\tprint(res >= inf ? -1 : res);\n}","accuracy":0.5816326530612245,"time_ms":100,"memory_kb":64072,"score_of_the_acc":-0.6299,"final_rank":16},{"submission_id":"aoj_2307_3731719","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 EMPTY 0 //空文字のインデックス\n#define NUM 105\n#define BALANCE 10\n\n/*\n * diff = 右の余り-左の余り+10\n * バランスしているとき、diffは10\n *\n * */\n\nstruct Data{\n\tData(int arg_next_id,int arg_add_len){\n\t\tnext_node_id = arg_next_id;\n\t\tadd_len = arg_add_len;\n\t}\n\tint next_node_id,add_len;\n};\n\nstruct Node{\n\n\tint left_id,right_id,diff;\n\tvector<Data> NEXT;\n};\n\nstruct Info{\n\n\tchar word[11];\n\tint length;\n};\n\nstruct State{\n\tState(int arg_node_id,int arg_sum_value){\n\t\tnode_id = arg_node_id;\n\t\tsum_value = arg_sum_value;\n\t}\n\tint node_id,sum_value;\n};\n\nint V,E;\nconst int start = 0,goal = 1;\nbool check[NUM][NUM];\nInfo info[NUM];\nvector<Node> NODES;\nmap<pair<int,int>,int> MAP[21]; //map[diff][make_pair(left_id,right_id)] = node_id\nmap<pair<int,int>,int> dp[21]; //dp[diff][make_pair(left_id,right_id)] = 最大長\n\n#define SIZE 200005\n\nvector<int> G[SIZE];\nvector<int> reverse_G[SIZE];\nbool can_goal[SIZE];\nbool cycle_FLG;\nbool visited[SIZE];\n\nvoid cycle_dfs(int start_id,int current_id){\n\n\tif(cycle_FLG)return;\n\n\tfor(int i = 0; i < G[current_id].size(); i++){\n\t\tif(G[current_id][i] == start_id){\n\n\t\t\tcycle_FLG = true;\n\t\t\treturn;\n\t\t}\n\t\tif(visited[G[current_id][i]])continue;\n\t\tvisited[G[current_id][i]] = true;\n\n\t\tcycle_dfs(start_id,G[current_id][i]);\n\t}\n}\n\nvoid goal_dfs(int node_id){\n\n\tcan_goal[node_id] = true;\n\n\tfor(int i = 0; i < reverse_G[node_id].size(); i++){\n\n\t\tif(visited[reverse_G[node_id][i]])continue;\n\t\tvisited[reverse_G[node_id][i]] = true;\n\n\t\tgoal_dfs(reverse_G[node_id][i]);\n\t}\n}\n\nvoid start_dfs(int node_id){\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tif(visited[G[node_id][i]])continue;\n\t\tvisited[G[node_id][i]] = true;\n\n\t\tstart_dfs(G[node_id][i]);\n\t}\n}\n\n\n\nint main(){\n\n\tscanf(\"%d %d\",&V,&E);\n\n\tfor(int i = 0; i <= V; i++){\n\t\tfor(int k = 0; k <= V; k++){\n\t\t\tcheck[i][k] = false;\n\t\t}\n\t}\n\n\tint length;\n\n\t//空文字\n\tinfo[0].word[0] = '\\0';\n\tinfo[0].length = 0;\n\n\tfor(int i = 1; i <= V; i++){\n\n\t\tscanf(\"%s\",info[i].word);\n\n\t\tfor(length = 0; info[i].word[length] != '\\0'; length++);\n\n\t\tinfo[i].length = length;\n\t}\n\n\tint from,to;\n\n\tfor(int loop = 0; loop < E; loop++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\n\t\tcheck[from][to] = true;\n\t}\n\n\tint num_nodes = 2;\n\tNode start_node,goal_node;\n\n\tstart_node.diff = BALANCE;\n\tstart_node.left_id = 0;\n\tstart_node.right_id = 0;\n\n\tgoal_node.diff = BALANCE;\n\tgoal_node.left_id = 0;\n\tgoal_node.right_id = 0;\n\n\tNODES.push_back(start_node);\n\tNODES.push_back(goal_node);\n\n\n\t//まず、スタートから遷移する最初のノードを作る\n\n\t/*★1つの単語★*/\n\n\t//全体が回文になっているものを探す。接続に制約があるので、回文になっている単語は全てノード化する\n\n\tfor(int i = 1; i <= V; i++){\n\n\t\tbool FLG = true;\n\t\tfor(int k = 0; k < info[i].length/2; k++){\n\t\t\tif(info[i].word[k] != info[i].word[info[i].length-1-k]){\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(FLG){\n\n\t\t\t//ノード作成\n\t\t\tNode node;\n\n\t\t\tnode.left_id = i;\n\t\t\tnode.right_id = i;\n\t\t\tnode.diff = BALANCE;\n\n\t\t\tNODES.push_back(node);\n\n\t\t\tMAP[BALANCE][make_pair(i,i)] = num_nodes; //マップにIDを登録\n\n\t\t\t//スタートからエッジを張る\n\t\t\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\n\t\t\tG[start].push_back(num_nodes);\n\t\t\treverse_G[num_nodes].push_back(start);\n\n\t\t\t//バランスしたので、ゴールにエッジを張る\n\t\t\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\n\t\t\tG[num_nodes].push_back(goal);\n\t\t\treverse_G[goal].push_back(num_nodes);\n\n\t\t\tnum_nodes++;\n\t\t}\n\t}\n\n\n\t//左端固定\n\tfor(int i = 1; i <= V; i++){\n\n\t\tfor(int right = 0; right <= info[i].length-2; right++){\n\t\t\tbool FLG = true;\n\n\t\t\t//0～rightが回文になっているか\n\t\t\tint tmp_len = right+1;\n\n\t\t\tfor(int k = 0; k < tmp_len/2; k++){\n\t\t\t\tif(info[i].word[k] != info[i].word[tmp_len-1-k]){\n\t\t\t\t\tFLG = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(FLG){\n\n\t\t\t\t//ノード作成\n\t\t\t\tNode node;\n\n\t\t\t\tnode.left_id = i;\n\t\t\t\tnode.right_id = i;\n\t\t\t\tnode.diff = (info[i].length-(right+1))+BALANCE;\n\n\t\t\t\tNODES.push_back(node);\n\n\t\t\t\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes; //マップにIDを登録\n\n\t\t\t\t//スタートからエッジを張る\n\t\t\t\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\n\t\t\t\tG[start].push_back(num_nodes);\n\t\t\t\treverse_G[num_nodes].push_back(start);\n\n\t\t\t\tnum_nodes++;\n\t\t\t}\n\t\t}\n\t}\n\n\t//右端固定\n\tfor(int i = 1; i <= V; i++){\n\n\t\tfor(int left = 1; left <= info[i].length-1; left++){\n\t\t\tbool FLG = true;\n\n\t\t\t//left～info[i].length-1が回文になっているか\n\t\t\tint tmp_len = info[i].length-left;\n\n\t\t\tfor(int k = 0; k < tmp_len/2; k++){\n\t\t\t\tif(info[i].word[left+k] != info[i].word[info[i].length-1-k]){\n\t\t\t\t\tFLG = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(FLG){\n\n\t\t\t\t//ノード作成\n\t\t\t\tNode node;\n\n\t\t\t\tnode.left_id = i;\n\t\t\t\tnode.right_id = i;\n\t\t\t\tnode.diff = -left+BALANCE;\n\n\t\t\t\tNODES.push_back(node);\n\n\t\t\t\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes; //マップにIDを登録\n\n\t\t\t\t//スタートからエッジを張る\n\t\t\t\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\n\t\t\t\tG[start].push_back(num_nodes);\n\t\t\t\treverse_G[num_nodes].push_back(start);\n\n\t\t\t\tnum_nodes++;\n\t\t\t}\n\t\t}\n\t}\n\n\t/*★2つの単語★*/\n\tfor(int L = 1; L <= V; L++){\n\t\tfor(int R = 1; R <= V; R++){\n\t\t\tif(!check[L][R])continue;\n\n\t\t\tbool FLG = true;\n\t\t\tint tmp_len = min(info[L].length,info[R].length);\n\n\t\t\tfor(int k = 0; k < tmp_len; k++){\n\t\t\t\tif(info[L].word[info[L].length-1-k] != info[R].word[k]){\n\t\t\t\t\tFLG = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(!FLG)continue;\n\n\t\t\t//ノード作成\n\t\t\tNode node;\n\n\t\t\tnode.left_id = L;\n\t\t\tnode.right_id = R;\n\t\t\tnode.diff = (info[R].length-info[L].length)+BALANCE;\n\n\t\t\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\n\n\t\t\tif(at != MAP[node.diff].end()){ //★注意★\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tNODES.push_back(node);\n\n\t\t\tMAP[node.diff][make_pair(L,R)] = num_nodes; //マップにIDを登録\n\n\t\t\t//スタートからエッジを張る\n\t\t\tNODES[start].NEXT.push_back(Data(num_nodes,info[L].length+info[R].length));\n\t\t\tG[start].push_back(num_nodes);\n\t\t\treverse_G[num_nodes].push_back(start);\n\n\n\t\t\tif(node.diff == BALANCE){\n\n\t\t\t\t//バランスしたので、ゴールにエッジを張る\n\t\t\t\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\n\t\t\t\tG[num_nodes].push_back(goal);\n\t\t\t\treverse_G[goal].push_back(num_nodes);\n\t\t\t}\n\n\t\t\tnum_nodes++;\n\t\t}\n\t}\n\n\t//発生し得る状態を全列挙\n\tqueue<int> Q;\n\n\tfor(int i = 0; i < NODES[start].NEXT.size(); i++){\n\n\t\tQ.push(NODES[start].NEXT[i].next_node_id);\n\t}\n\n\twhile(!Q.empty()){\n\n\t\tint node_id = Q.front();\n\t\tQ.pop();\n\n\t\tif(NODES[node_id].diff <= BALANCE){ //右に文字追加\n\n\t\t\tfor(int i = 1; i <= V; i++){\n\n\t\t\t\tif(!check[NODES[node_id].right_id][i])continue;\n\n\t\t\t\t//少なくとも重なる部分が全て一致するか調べる\n\t\t\t\tbool FLG = true;\n\t\t\t\tint left_diff = abs(NODES[node_id].diff-BALANCE);\n\t\t\t\tint tmp_len = min(left_diff,info[i].length);\n\t\t\t\tint left_id = NODES[node_id].left_id;\n\n\t\t\t\tfor(int k = 0; k < tmp_len; k++){\n\n\t\t\t\t\tif(info[left_id].word[left_diff-1-k] != info[i].word[k]){\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(!FLG)continue;\n\n\t\t\t\tNode node;\n\t\t\t\tnode.diff = info[i].length-left_diff+BALANCE;\n\t\t\t\tnode.left_id = NODES[node_id].left_id;\n\t\t\t\tnode.right_id = i;\n\n\t\t\t\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\n\n\t\t\t\tif(at != MAP[node.diff].end()){ //出現済:エッジだけ張る\n\n\t\t\t\t\tint next_node = MAP[node.diff][make_pair(node.left_id,node.right_id)];\n\n\t\t\t\t\tNODES[node_id].NEXT.push_back(Data(next_node,info[i].length));\n\t\t\t\t\tG[node_id].push_back(next_node);\n\t\t\t\t\treverse_G[next_node].push_back(node_id);\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tNODES.push_back(node); //初登場\n\n\t\t\t\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes;\n\n\t\t\t\t//node_idからエッジを張る\n\t\t\t\tNODES[node_id].NEXT.push_back(Data(num_nodes,info[i].length));\n\t\t\t\tG[node_id].push_back(num_nodes);\n\t\t\t\treverse_G[num_nodes].push_back(node_id);\n\n\n\t\t\t\tif(node.diff == BALANCE){ //バランスしていれば、ゴールにエッジを張る\n\n\t\t\t\t\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\n\t\t\t\t\tG[num_nodes].push_back(goal);\n\t\t\t\t\treverse_G[goal].push_back(num_nodes);\n\n\t\t\t\t}\n\n\t\t\t\tQ.push(num_nodes);\n\n\t\t\t\tnum_nodes++;\n\t\t\t}\n\n\t\t}\n\n\t\tif(NODES[node_id].diff >= BALANCE){ //左に文字追加\n\n\t\t\tfor(int i = 1; i <= V; i++){\n\n\t\t\t\tif(!check[i][NODES[node_id].left_id])continue;\n\n\t\t\t\t//少なくとも重なる部分が全て一致するか調べる\n\t\t\t\tbool FLG = true;\n\t\t\t\tint right_diff = NODES[node_id].diff-BALANCE;\n\t\t\t\tint tmp_len = min(right_diff,info[i].length);\n\t\t\t\tint right_id = NODES[node_id].right_id;\n\n\t\t\t\tfor(int k = 0; k < tmp_len; k++){\n\n\t\t\t\t\tif(info[right_id].word[info[right_id].length-right_diff+k] != info[i].word[info[i].length-1-k]){\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(!FLG)continue;\n\n\t\t\t\tNode node;\n\t\t\t\tnode.diff = right_diff-info[i].length+BALANCE;\n\t\t\t\tnode.left_id = i;\n\t\t\t\tnode.right_id = NODES[node_id].right_id;\n\n\t\t\t\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\n\n\t\t\t\tif(at != MAP[node.diff].end()){ //出現済:エッジだけ張る\n\n\t\t\t\t\tint next_node = MAP[node.diff][make_pair(node.left_id,node.right_id)];\n\n\t\t\t\t\tNODES[node_id].NEXT.push_back(Data(next_node,info[i].length));\n\t\t\t\t\tG[node_id].push_back(next_node);\n\t\t\t\t\treverse_G[next_node].push_back(node_id);\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tNODES.push_back(node); //初出現なのでノード追加\n\t\t\t\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes;\n\n\t\t\t\t//node_idからエッジを張る\n\t\t\t\tNODES[node_id].NEXT.push_back(Data(num_nodes,info[i].length));\n\t\t\t\tG[node_id].push_back(num_nodes);\n\t\t\t\treverse_G[num_nodes].push_back(node_id);\n\n\t\t\t\tif(node.diff == BALANCE){ //バランスしていれば、ゴールにエッジを張る\n\n\t\t\t\t\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\n\t\t\t\t\tG[num_nodes].push_back(goal);\n\t\t\t\t\treverse_G[goal].push_back(num_nodes);\n\t\t\t\t}\n\n\t\t\t\tQ.push(num_nodes);\n\n\t\t\t\tnum_nodes++;\n\t\t\t}\n\t\t}\n\t}\n\n\t//ゴールできるか調べる\n\tfor(int i = 0; i < num_nodes; i++){\n\n\t\tvisited[i] = false;\n\t}\n\tvisited[start] = true;\n\tstart_dfs(start);\n\n\tif(!visited[goal]){\n\n\t\tprintf(\"0\\n\");\n\t\treturn 0;\n\t}\n\n\t//ゴールできるノードを探す\n\tfor(int i = 0; i < num_nodes; i++){\n\n\t\tcan_goal[i] = false;\n\t\tvisited[i] = false;\n\t}\n\tvisited[goal] = true;\n\tgoal_dfs(goal);\n\n\n\t//ゴールできるものの中で、閉路に属するノードがないか調べる\n\tfor(int i = 0; i < num_nodes; i++){\n\t\tif(can_goal[i] == false)continue;\n\n\t\tfor(int k = 0; k < num_nodes; k++){\n\n\t\t\tvisited[k] = false;\n\t\t}\n\t\tcycle_FLG = false;\n\n\t\tvisited[i] = true;\n\t\tcycle_dfs(i,i);\n\n\t\tif(cycle_FLG){\n\n\t\t\tprintf(\"-1\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\t//dp計算する\n\tint ans = 0;\n\n\t//DAGになってるはずなのでdp計算\n\tqueue<State> final_Q;\n\n\tdp[NODES[start].diff][make_pair(NODES[start].left_id,NODES[start].right_id)] = 0;\n\tfinal_Q.push(State(start,0));\n\n\twhile(!final_Q.empty()){\n\n\t\tState state = final_Q.front();\n\t\tfinal_Q.pop();\n\n\t\tauto at = dp[NODES[state.node_id].diff].find(make_pair(NODES[state.node_id].left_id,NODES[state.node_id].right_id));\n\n\t\tif(at != dp[NODES[state.node_id].diff].end() && state.sum_value < dp[NODES[state.node_id].diff][make_pair(NODES[state.node_id].left_id,NODES[state.node_id].right_id)]){\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(state.node_id == goal){\n\n\t\t\tans = max(ans,state.sum_value);\n\t\t}\n\n\t\tfor(int i = 0; i < NODES[state.node_id].NEXT.size(); i++){\n\n\t\t\tint next_node = NODES[state.node_id].NEXT[i].next_node_id;\n\t\t\tif(!can_goal[next_node])continue;\n\n\t\t\tint next_value = state.sum_value+NODES[state.node_id].NEXT[i].add_len;\n\n\t\t\tat = dp[NODES[next_node].diff].find(make_pair(NODES[next_node].left_id,NODES[next_node].right_id));\n\n\t\t\tif(at == dp[NODES[next_node].diff].end()){\n\n\t\t\t\tdp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] = next_value;\n\n\t\t\t\tfinal_Q.push(State(next_node,next_value));\n\n\t\t\t}else{\n\n\t\t\t\tif(dp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] < next_value){\n\n\t\t\t\t\tdp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] = next_value;\n\t\t\t\t\tfinal_Q.push(State(next_node,next_value));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":17068,"score_of_the_acc":-0.1082,"final_rank":2},{"submission_id":"aoj_2307_3731718","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 EMPTY 0 //空文字のインデックス\n#define NUM 105\n#define BALANCE 10\n\n/*\n * diff = 右の余り-左の余り+10\n * バランスしているとき、diffは10\n *\n * */\n\nstruct Data{\n\tData(int arg_next_id,int arg_add_len){\n\t\tnext_node_id = arg_next_id;\n\t\tadd_len = arg_add_len;\n\t}\n\tint next_node_id,add_len;\n};\n\nstruct Node{\n\n\tint left_id,right_id,diff;\n\tvector<Data> NEXT;\n};\n\nstruct Info{\n\n\tchar word[11];\n\tint length;\n};\n\nstruct State{\n\tState(int arg_node_id,int arg_sum_value){\n\t\tnode_id = arg_node_id;\n\t\tsum_value = arg_sum_value;\n\t}\n\tint node_id,sum_value;\n};\n\nint V,E;\nconst int start = 0,goal = 1;\nbool check[NUM][NUM];\nInfo info[NUM];\nvector<Node> NODES;\nmap<pair<int,int>,int> MAP[21]; //map[diff][make_pair(left_id,right_id)] = node_id\nmap<pair<int,int>,int> dp[21]; //dp[diff][make_pair(left_id,right_id)] = 最大長\n\n#define SIZE 200005\n\nvector<int> G[SIZE];\nvector<int> reverse_G[SIZE];\nbool can_goal[SIZE];\nbool cycle_FLG;\nbool visited[SIZE];\n\nvoid cycle_dfs(int start_id,int current_id){\n\n\tif(cycle_FLG)return;\n\n\tfor(int i = 0; i < G[current_id].size(); i++){\n\t\tif(G[current_id][i] == start_id){\n\n\t\t\tcycle_FLG = true;\n\t\t\treturn;\n\t\t}\n\t\tif(visited[G[current_id][i]])continue;\n\t\t/*if(visited[G[current_id][i]]){\n\t\t\tif(can_goal[G[current_id][i]]){\n\t\t\tcycle_FLG = true;\n\t\t\treturn;\n\t\t\t}\n\t\t\tcontinue;\n\t\t}*/\n\t\tvisited[G[current_id][i]] = true;\n\n\t\tcycle_dfs(start_id,G[current_id][i]);\n\t}\n}\n\nvoid goal_dfs(int node_id){\n\n\tcan_goal[node_id] = true;\n\n\tfor(int i = 0; i < reverse_G[node_id].size(); i++){\n\n\t\tif(visited[reverse_G[node_id][i]])continue;\n\t\tvisited[reverse_G[node_id][i]] = true;\n\n\t\tgoal_dfs(reverse_G[node_id][i]);\n\t}\n}\n\nvoid start_dfs(int node_id){\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tif(visited[G[node_id][i]])continue;\n\t\tvisited[G[node_id][i]] = true;\n\n\t\tstart_dfs(G[node_id][i]);\n\t}\n}\n\n\n\nint main(){\n\n\tscanf(\"%d %d\",&V,&E);\n\n\tfor(int i = 0; i <= V; i++){\n\t\tfor(int k = 0; k <= V; k++){\n\t\t\tcheck[i][k] = false;\n\t\t}\n\t}\n\n\tint length;\n\n\t//空文字\n\tinfo[0].word[0] = '@';\n\tinfo[0].word[1] = '\\0';\n\tinfo[0].length = 0;\n\n\tfor(int i = 1; i <= V; i++){\n\n\t\tscanf(\"%s\",info[i].word);\n\n\t\tfor(length = 0; info[i].word[length] != '\\0'; length++);\n\n\t\tinfo[i].length = length;\n\t}\n\n\tint from,to;\n\n\tfor(int loop = 0; loop < E; loop++){\n\n\t\tscanf(\"%d %d\",&from,&to);\n\n\t\tcheck[from][to] = true;\n\t}\n\n\tint num_nodes = 2;\n\tNode start_node,goal_node;\n\n\tstart_node.diff = BALANCE;\n\tstart_node.left_id = 0;\n\tstart_node.right_id = 0;\n\n\tgoal_node.diff = BALANCE;\n\tgoal_node.left_id = 0;\n\tgoal_node.right_id = 0;\n\n\tNODES.push_back(start_node);\n\tNODES.push_back(goal_node);\n\n\n\t//まず、スタートから遷移する最初のノードを作る\n\n\t/*★1つの単語★*/\n\n\t//全体が回文になっているものを探す。接続に制約があるので、回文になっている単語は全てノード化する\n\n\tfor(int i = 1; i <= V; i++){\n\n\t\tbool FLG = true;\n\t\tfor(int k = 0; k < info[i].length/2; k++){\n\t\t\tif(info[i].word[k] != info[i].word[info[i].length-1-k]){\n\t\t\t\tFLG = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif(FLG){\n\n\t\t\t//ノード作成\n\t\t\tNode node;\n\n\t\t\tnode.left_id = i;\n\t\t\tnode.right_id = i;\n\t\t\tnode.diff = BALANCE;\n\n\t\t\tNODES.push_back(node);\n\n\t\t\tMAP[BALANCE][make_pair(i,i)] = num_nodes; //マップにIDを登録\n\n\t\t\t//スタートからエッジを張る\n\t\t\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\n\t\t\tG[start].push_back(num_nodes);\n\t\t\treverse_G[num_nodes].push_back(start);\n\n\t\t\t//バランスしたので、ゴールにエッジを張る\n\t\t\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\n\t\t\tG[num_nodes].push_back(goal);\n\t\t\treverse_G[goal].push_back(num_nodes);\n\n\t\t\tnum_nodes++;\n\t\t}\n\t}\n\n\n\t//左端固定\n\tfor(int i = 1; i <= V; i++){\n\n\t\tfor(int right = 0; right <= info[i].length-2; right++){\n\t\t\tbool FLG = true;\n\n\t\t\t//0～rightが回文になっているか\n\t\t\tint tmp_len = right+1;\n\n\t\t\tfor(int k = 0; k < tmp_len/2; k++){\n\t\t\t\tif(info[i].word[k] != info[i].word[tmp_len-1-k]){\n\t\t\t\t\tFLG = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(FLG){\n\n\t\t\t\t//ノード作成\n\t\t\t\tNode node;\n\n\t\t\t\tnode.left_id = i;\n\t\t\t\tnode.right_id = i;\n\t\t\t\tnode.diff = (info[i].length-(right+1))+BALANCE;\n\n\t\t\t\tNODES.push_back(node);\n\n\t\t\t\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes; //マップにIDを登録\n\n\t\t\t\t//スタートからエッジを張る\n\t\t\t\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\n\t\t\t\tG[start].push_back(num_nodes);\n\t\t\t\treverse_G[num_nodes].push_back(start);\n\n\t\t\t\tnum_nodes++;\n\t\t\t}\n\t\t}\n\t}\n\n\t//右端固定\n\tfor(int i = 1; i <= V; i++){\n\n\t\tfor(int left = 1; left <= info[i].length-1; left++){\n\t\t\tbool FLG = true;\n\n\t\t\t//left～info[i].length-1が回文になっているか\n\t\t\tint tmp_len = info[i].length-left;\n\n\t\t\tfor(int k = 0; k < tmp_len/2; k++){\n\t\t\t\tif(info[i].word[left+k] != info[i].word[info[i].length-1-k]){\n\t\t\t\t\tFLG = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(FLG){\n\n\t\t\t\t//ノード作成\n\t\t\t\tNode node;\n\n\t\t\t\tnode.left_id = i;\n\t\t\t\tnode.right_id = i;\n\t\t\t\tnode.diff = -left+BALANCE;\n\n\t\t\t\tNODES.push_back(node);\n\n\t\t\t\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes; //マップにIDを登録\n\n\t\t\t\t//スタートからエッジを張る\n\t\t\t\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\n\t\t\t\tG[start].push_back(num_nodes);\n\t\t\t\treverse_G[num_nodes].push_back(start);\n\n\t\t\t\tnum_nodes++;\n\t\t\t}\n\t\t}\n\t}\n\n\t/*★2つの単語★*/\n\tfor(int L = 1; L <= V; L++){\n\t\tfor(int R = 1; R <= V; R++){\n\t\t\tif(!check[L][R])continue;\n\n\t\t\tbool FLG = true;\n\t\t\tint tmp_len = min(info[L].length,info[R].length);\n\n\t\t\tfor(int k = 0; k < tmp_len; k++){\n\t\t\t\tif(info[L].word[info[L].length-1-k] != info[R].word[k]){\n\t\t\t\t\tFLG = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(!FLG)continue;\n\n\t\t\t//ノード作成\n\t\t\tNode node;\n\n\t\t\tnode.left_id = L;\n\t\t\tnode.right_id = R;\n\t\t\tnode.diff = (info[R].length-info[L].length)+BALANCE;\n\n\t\t\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\n\n\t\t\tif(at != MAP[node.diff].end()){ //★注意★\n\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tNODES.push_back(node);\n\n\t\t\tMAP[node.diff][make_pair(L,R)] = num_nodes; //マップにIDを登録\n\n\t\t\t//スタートからエッジを張る\n\t\t\tNODES[start].NEXT.push_back(Data(num_nodes,info[L].length+info[R].length));\n\t\t\tG[start].push_back(num_nodes);\n\t\t\treverse_G[num_nodes].push_back(start);\n\n\n\t\t\tif(node.diff == BALANCE){\n\n\t\t\t\t//バランスしたので、ゴールにエッジを張る\n\t\t\t\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\n\t\t\t\tG[num_nodes].push_back(goal);\n\t\t\t\treverse_G[goal].push_back(num_nodes);\n\t\t\t}\n\n\t\t\tnum_nodes++;\n\t\t}\n\t}\n\n\t//発生し得る状態を全列挙\n\tqueue<int> Q;\n\n\tfor(int i = 0; i < NODES[start].NEXT.size(); i++){\n\n\t\tQ.push(NODES[start].NEXT[i].next_node_id);\n\t}\n\n\n\n\t/*printf(\"Minhi!\\n\");\n\treturn 0;\n*/\n\twhile(!Q.empty()){\n\n\t\tint node_id = Q.front();\n\t\tQ.pop();\n\n\t\tif(NODES[node_id].diff <= BALANCE){ //右に文字追加\n\n\t\t\tfor(int i = 1; i <= V; i++){\n\n\t\t\t\tif(!check[NODES[node_id].right_id][i])continue;\n\n\t\t\t\t//少なくとも重なる部分が全て一致するか調べる\n\t\t\t\tbool FLG = true;\n\t\t\t\tint left_diff = abs(NODES[node_id].diff-BALANCE);\n\t\t\t\tint tmp_len = min(left_diff,info[i].length);\n\t\t\t\tint left_id = NODES[node_id].left_id;\n\n\t\t\t\tfor(int k = 0; k < tmp_len; k++){\n\n\t\t\t\t\tif(info[left_id].word[left_diff-1-k] != info[i].word[k]){\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(!FLG)continue;\n\n\t\t\t\tNode node;\n\t\t\t\tnode.diff = info[i].length-left_diff+BALANCE;\n\t\t\t\tnode.left_id = NODES[node_id].left_id;\n\t\t\t\tnode.right_id = i;\n\n\t\t\t\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\n\n\t\t\t\tif(at != MAP[node.diff].end()){ //出現済:エッジだけ張る\n\n\t\t\t\t\tint next_node = MAP[node.diff][make_pair(node.left_id,node.right_id)];\n\n\t\t\t\t\tNODES[node_id].NEXT.push_back(Data(next_node,info[i].length));\n\t\t\t\t\tG[node_id].push_back(next_node);\n\t\t\t\t\treverse_G[next_node].push_back(node_id);\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tNODES.push_back(node); //初登場\n\n\t\t\t\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes;\n\n\t\t\t\t//node_idからエッジを張る\n\t\t\t\tNODES[node_id].NEXT.push_back(Data(num_nodes,info[i].length));\n\t\t\t\tG[node_id].push_back(num_nodes);\n\t\t\t\treverse_G[num_nodes].push_back(node_id);\n\n\n\t\t\t\tif(node.diff == BALANCE){ //バランスしていれば、ゴールにエッジを張る\n\n\t\t\t\t\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\n\t\t\t\t\tG[num_nodes].push_back(goal);\n\t\t\t\t\treverse_G[goal].push_back(num_nodes);\n\n\t\t\t\t}\n\n\t\t\t\tQ.push(num_nodes);\n\n\t\t\t\tnum_nodes++;\n\t\t\t}\n\n\t\t}\n\n\t\tif(NODES[node_id].diff >= BALANCE){ //左に文字追加\n\n\t\t\tfor(int i = 1; i <= V; i++){\n\n\t\t\t\tif(!check[i][NODES[node_id].left_id])continue;\n\n\t\t\t\t//少なくとも重なる部分が全て一致するか調べる\n\t\t\t\tbool FLG = true;\n\t\t\t\tint right_diff = NODES[node_id].diff-BALANCE;\n\t\t\t\tint tmp_len = min(right_diff,info[i].length);\n\t\t\t\tint right_id = NODES[node_id].right_id;\n\n\t\t\t\tfor(int k = 0; k < tmp_len; k++){\n\n\t\t\t\t\tif(info[right_id].word[info[right_id].length-right_diff+k] != info[i].word[info[i].length-1-k]){\n\t\t\t\t\t\tFLG = false;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(!FLG)continue;\n\n\t\t\t\tNode node;\n\t\t\t\tnode.diff = right_diff-info[i].length+BALANCE;\n\t\t\t\tnode.left_id = i;\n\t\t\t\tnode.right_id = NODES[node_id].right_id;\n\n\t\t\t\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\n\n\t\t\t\tif(at != MAP[node.diff].end()){ //出現済:エッジだけ張る\n\n\t\t\t\t\tint next_node = MAP[node.diff][make_pair(node.left_id,node.right_id)];\n\n\t\t\t\t\tNODES[node_id].NEXT.push_back(Data(next_node,info[i].length));\n\t\t\t\t\tG[node_id].push_back(next_node);\n\t\t\t\t\treverse_G[next_node].push_back(node_id);\n\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tNODES.push_back(node); //初出現なのでノード追加\n\t\t\t\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes;\n\n\t\t\t\t//node_idからエッジを張る\n\t\t\t\tNODES[node_id].NEXT.push_back(Data(num_nodes,info[i].length));\n\t\t\t\tG[node_id].push_back(num_nodes);\n\t\t\t\treverse_G[num_nodes].push_back(node_id);\n\n\t\t\t\tif(node.diff == BALANCE){ //バランスしていれば、ゴールにエッジを張る\n\n\t\t\t\t\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\n\t\t\t\t\tG[num_nodes].push_back(goal);\n\t\t\t\t\treverse_G[goal].push_back(num_nodes);\n\t\t\t\t}\n\n\t\t\t\tQ.push(num_nodes);\n\n\t\t\t\tnum_nodes++;\n\t\t\t}\n\t\t}\n\t}\n\n\t//ゴールできるか調べる\n\tfor(int i = 0; i < num_nodes; i++){\n\n\t\tvisited[i] = false;\n\t}\n\tvisited[start] = true;\n\tstart_dfs(start);\n\n\tif(!visited[goal]){\n\n\t\tprintf(\"0\\n\");\n\t\treturn 0;\n\t}\n\n\t//ゴールできるノードを探す\n\tfor(int i = 0; i < num_nodes; i++){\n\n\t\tcan_goal[i] = false;\n\t\tvisited[i] = false;\n\t}\n\tvisited[goal] = true;\n\tgoal_dfs(goal);\n\n\n\t//ゴールできるものの中で、閉路に属するノードがないか調べる\n\tfor(int i = 0; i < num_nodes; i++){\n\t\tif(can_goal[i] == false)continue;\n\n\t\tfor(int k = 0; k < num_nodes; k++){\n\n\t\t\tvisited[k] = false;\n\t\t}\n\t\tcycle_FLG = false;\n\n\t\tvisited[i] = true;\n\t\tcycle_dfs(i,i);\n\n\t\tif(cycle_FLG){\n\n\t\t\tprintf(\"-1\\n\");\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\t//dp計算する\n\tint ans = 0;\n\n\t//DAGになってるはずなのでdp計算\n\tqueue<State> final_Q;\n\n\tdp[NODES[start].diff][make_pair(NODES[start].left_id,NODES[start].right_id)] = 0;\n\tfinal_Q.push(State(start,0));\n\n\twhile(!final_Q.empty()){\n\n\t\tState state = final_Q.front();\n\t\tfinal_Q.pop();\n\n\t\tauto at = dp[NODES[state.node_id].diff].find(make_pair(NODES[state.node_id].left_id,NODES[state.node_id].right_id));\n\n\t\tif(at != dp[NODES[state.node_id].diff].end() && state.sum_value < dp[NODES[state.node_id].diff][make_pair(NODES[state.node_id].left_id,NODES[state.node_id].right_id)]){\n\n\t\t\tcontinue;\n\t\t}\n\n\t\tif(state.node_id == goal){\n\n\t\t\tans = max(ans,state.sum_value);\n\t\t}\n\n\t\tfor(int i = 0; i < NODES[state.node_id].NEXT.size(); i++){\n\n\t\t\tint next_node = NODES[state.node_id].NEXT[i].next_node_id;\n\t\t\tif(!can_goal[next_node])continue;\n\n\t\t\tint next_value = state.sum_value+NODES[state.node_id].NEXT[i].add_len;\n\n\t\t\tat = dp[NODES[next_node].diff].find(make_pair(NODES[next_node].left_id,NODES[next_node].right_id));\n\n\t\t\tif(at == dp[NODES[next_node].diff].end()){\n\n\t\t\t\tdp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] = next_value;\n\n\t\t\t\tfinal_Q.push(State(next_node,next_value));\n\n\t\t\t}else{\n\n\t\t\t\tif(dp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] < next_value){\n\n\t\t\t\t\tdp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] = next_value;\n\t\t\t\t\tfinal_Q.push(State(next_node,next_value));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":16968,"score_of_the_acc":-0.1071,"final_rank":1},{"submission_id":"aoj_2307_3178278","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//INSERT ABOVE HERE\nsigned main(){\n const int D = 11;\n \n int n,m;\n cin>>n>>m;\n vector<string> s(n);\n for(int i=0;i<n;i++) cin>>s[i];\n\n vector<vector<int> > E(n,vector<int>(n,0));\n for(int i=0;i<m;i++){\n int x,y;\n cin>>x>>y;\n x--;y--;\n E[x][y]=1;\n }\n\n vector<int> l(n);\n for(int i=0;i<n;i++) l[i]=s[i].size();\n\n\n using T = tuple<int, int, int>;\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\n int sz=idx(D,n-1,n-1)+1;\n\n queue<T> qt;\n vector<int> dp(sz,-1);\n \n // center inside s[x]\n for(int x=0;x<n;x++){\n // even\n for(int i=1;i<l[x];i++){\n // [0, i) + [i, l)\n int k=min(i,l[x]-i),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+j];\n if(ok){\n\tint d=i-(l[x]-i);\n\tqt.emplace(d,x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n // odd\n for(int i=0;i<l[x];i++){\n // [0, i) + [i, i+1) + [i+1, l)\n int k=min(i,l[x]-(i+1)),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+1+j];\n if(ok){\n\tint d=i-(l[x]-(i+1));\n\tqt.emplace(i-(l[x]-(i+1)),x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n }\n\n // s[x] |center| s[y] (obviously even)\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n if(!E[x][y]) continue;\n int k=min(l[x],l[y]),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][l[x]-(j+1)]==s[y][j];\n if(ok){\n\tint d=l[x]-l[y];\n\tqt.emplace(d,x,y);\n\tchmax(dp[idx(d,x,y)],l[x]+l[y]);\n }\n } \n }\n\n using P = pair<int, int>;\n vector<vector<P> > G(sz),R(sz);\n \n for(int d=-D;d<=D;d++){\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n\tint v=idx(d,x,y);\n\tfor(int i=0;i<n;i++){\n\t // s[i] s[x] s[y]\n\t if(d<=0&&E[i][x]){\n\t int k=min(-d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]+d+j];\n\t if(ok){\t \n\t int nd=d+l[i];\n\t int u=idx(nd,i,y);\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t // s[x] s[y] s[i]\n\t if(d>=0&&E[y][i]){\n\t int k=min(d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][j]==s[x][d-(j+1)];\n\t if(ok){\n\t int nd=d-l[i];\n\t int u=idx(nd,x,i);\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t}\n } \n }\n }\n\n // find nodes that can reached from starts\n while(!qt.empty()){\n int d,x,y;\n tie(d,x,y)=qt.front();qt.pop();\n int v=idx(d,x,y);\n for(auto e:G[v]){\n int u,c;\n tie(u,c)=e;\n if(~dp[u]) continue;\n chmax(dp[u],dp[v]+c);\n qt.emplace(inv(u)); \n } \n }\n\n vector<int> dp2(sz,-1),used(sz,0),visit(sz,0);\n queue<int> qu;\n \n function<int(int)> dfs=\n [&](int v){\n int &res=dp2[v];\n if(used[v]) return res;\n \n visit[v]=1;\n qu.emplace(v);\n res=dp[v];\n \n for(auto e:R[v]){\n\tint u,c;\n\ttie(u,c)=e;\n\tif(dp[u]<0) continue;\n\tif(visit[u]==1){\n\t cout<<-1<<endl;\n\t exit(0);\n\t}\n\tchmax(res,dfs(u)+c);\n }\n \n visit[v]=0;\n return res;\n };\n \n int ans=0;\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n int v=idx(0,x,y);\n if(~dp[v]) chmax(ans,dfs(v));\n while(!qu.empty()){\n\tused[qu.front()]=1;\n\tvisit[qu.front()]=2;\n\tqu.pop();\n }\n }\n }\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":28380,"score_of_the_acc":-0.2473,"final_rank":4},{"submission_id":"aoj_2307_3178277","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//INSERT ABOVE HERE\nsigned main(){\n const int D = 11;\n \n int n,m;\n cin>>n>>m;\n vector<string> s(n);\n for(int i=0;i<n;i++) cin>>s[i];\n\n vector<vector<int> > E(n,vector<int>(n,0));\n for(int i=0;i<m;i++){\n int x,y;\n cin>>x>>y;\n x--;y--;\n E[x][y]=1;\n }\n\n vector<int> l(n);\n for(int i=0;i<n;i++) l[i]=s[i].size();\n\n\n using T = tuple<int, int, int>;\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\n int sz=idx(D,n-1,n-1)+1;\n\n queue<T> qt;\n vector<int> dp(sz,-1);\n \n // center inside s[x]\n for(int x=0;x<n;x++){\n // even\n for(int i=1;i<l[x];i++){\n // [0, i) + [i, l)\n int k=min(i,l[x]-i),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+j];\n if(ok){\n\tint d=i-(l[x]-i);\n\tqt.emplace(d,x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n // odd\n for(int i=0;i<l[x];i++){\n // [0, i) + [i, i+1) + [i+1, l)\n int k=min(i,l[x]-(i+1)),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+1+j];\n if(ok){\n\tint d=i-(l[x]-(i+1));\n\tqt.emplace(i-(l[x]-(i+1)),x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n }\n\n // s[x] |center| s[y] (obviously even)\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n if(!E[x][y]) continue;\n int k=min(l[x],l[y]),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][l[x]-(j+1)]==s[y][j];\n if(ok){\n\tint d=l[x]-l[y];\n\tqt.emplace(d,x,y);\n\tchmax(dp[idx(d,x,y)],l[x]+l[y]);\n }\n } \n }\n\n using P = pair<int, int>;\n vector<vector<P> > G(sz),R(sz);\n \n for(int d=-D;d<=D;d++){\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n\tint v=idx(d,x,y);\n\t//cout<<v<<\":\"<<d<<\" \"<<x<<\" \"<<y<<endl;\n\tfor(int i=0;i<n;i++){\n\t // s[i] s[x] s[y]\n\t if(d<=0&&E[i][x]){\n\t int k=min(-d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]+d+j];\n\t if(ok){\t \n\t int nd=d+l[i];\n\t int u=idx(nd,i,y);\n\t //cout<<v<<\" -> \"<<u<<endl;\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t // s[x] s[y] s[i]\n\t if(d>=0&&E[y][i]){\n\t int k=min(d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][j]==s[x][d-(j+1)];\n\t if(ok){\n\t int nd=d-l[i];\n\t int u=idx(nd,x,i);\n\t //cout<<v<<\" -> \"<<u<<endl;\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t}\n } \n }\n }\n\n // find nodes that can reached from starts\n while(!qt.empty()){\n int d,x,y;\n tie(d,x,y)=qt.front();qt.pop();\n int v=idx(d,x,y);\n //cout<<dp[v]<<\":\"<<d<<\" \"<<x<<\" \"<<y<<endl;\n for(auto e:G[v]){\n int u,c;\n tie(u,c)=e;\n if(~dp[u]) continue;\n chmax(dp[u],dp[v]+c);\n qt.emplace(inv(u)); \n } \n }\n\n vector<int> dp2(sz,-1),used(sz,0),visit(sz,0);\n queue<int> qu;\n \n function<int(int)> dfs=\n [&](int v){\n int &res=dp2[v];\n if(used[v]) return res;\n //cout<<v<<\"****\"<<s[get<1>(inv(v))]<<\" \"<<s[get<2>(inv(v))]<<endl;\n //cout<<get<0>(inv(v))<<\":\"<<get<1>(inv(v))<<\":\"<<get<2>(inv(v))<<endl;\n \n visit[v]=1;\n qu.emplace(v);\n res=dp[v];\n \n for(auto e:R[v]){\n\tint u,c;\n\ttie(u,c)=e;\n\tif(dp[u]<0) continue;\n\t//cout<<setw(6)<<v<<\":\"<<setw(3)<<dp[v]<<\":\"<<setw(3)<<visit[v]<<endl;\n\t//cout<<setw(6)<<u<<\"+\"<<setw(3)<<dp[u]<<\"+\"<<setw(3)<<visit[u]<<endl;\n\tif(visit[u]==1){\n\t cout<<-1<<endl;\n\t exit(0);\n\t}\n\tchmax(res,dfs(u)+c);\n }\n visit[v]=0;\n\n //cout<<v<<\"::\"<<res<<endl;\n return res;\n };\n \n int ans=0;\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n int v=idx(0,x,y);\n if(~dp[v]) chmax(ans,dfs(v));\n while(!qu.empty()){\n\tused[qu.front()]=1;\n\tvisit[qu.front()]=2;\n\tqu.pop();\n }\n }\n }\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":100,"memory_kb":28520,"score_of_the_acc":-0.2488,"final_rank":5},{"submission_id":"aoj_2307_3178274","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//INSERT ABOVE HERE\nsigned main(){\n const int D = 11;\n \n int n,m;\n cin>>n>>m;\n vector<string> s(n);\n for(int i=0;i<n;i++) cin>>s[i];\n\n vector<vector<int> > E(n,vector<int>(n,0));\n for(int i=0;i<m;i++){\n int x,y;\n cin>>x>>y;\n x--;y--;\n E[x][y]=1;\n }\n\n vector<int> l(n);\n for(int i=0;i<n;i++) l[i]=s[i].size();\n\n\n using T = tuple<int, int, int>;\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\n int sz=idx(D,n-1,n-1)+1;\n\n queue<T> qt;\n vector<int> dp(sz,-1);\n \n // center inside s[x]\n for(int x=0;x<n;x++){\n // even\n for(int i=1;i<l[x];i++){\n // [0, i) + [i, l)\n int k=min(i,l[x]-i),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+j];\n if(ok){\n\tint d=i-(l[x]-i);\n\tqt.emplace(d,x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n // odd\n for(int i=0;i<l[x];i++){\n // [0, i) + [i, i+1) + [i+1, l)\n int k=min(i,l[x]-(i+1)),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+1+j];\n if(ok){\n\tint d=i-(l[x]-(i+1));\n\tqt.emplace(i-(l[x]-(i+1)),x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n }\n\n // s[x] |center| s[y] (obviously even)\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n if(!E[x][y]) continue;\n int k=min(l[x],l[y]),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][l[x]-(j+1)]==s[y][j];\n if(ok){\n\tint d=l[x]-l[y];\n\tqt.emplace(d,x,y);\n\tchmax(dp[idx(d,x,x)],l[x]+l[y]);\n }\n } \n }\n\n using P = pair<int, int>;\n vector<vector<P> > G(sz),R(sz);\n \n for(int d=-D;d<=D;d++){\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n\tint v=idx(d,x,y);\n\t//cout<<v<<\":\"<<d<<\" \"<<x<<\" \"<<y<<endl;\n\tfor(int i=0;i<n;i++){\n\t // s[i] s[x] s[y]\n\t if(d<=0&&E[i][x]){\n\t int k=min(-d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]+d+j];\n\t if(ok){\t \n\t int nd=d+l[i];\n\t int u=idx(nd,i,y);\n\t //cout<<v<<\" -> \"<<u<<endl;\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t // s[x] s[y] s[i]\n\t if(d>=0&&E[y][i]){\n\t int k=min(d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][j]==s[x][d-(j+1)];\n\t if(ok){\n\t int nd=d-l[i];\n\t int u=idx(nd,x,i);\n\t //cout<<v<<\" -> \"<<u<<endl;\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t}\n } \n }\n }\n\n // find nodes that can reached from starts\n while(!qt.empty()){\n int d,x,y;\n tie(d,x,y)=qt.front();qt.pop();\n int v=idx(d,x,y);\n //cout<<dp[v]<<\":\"<<d<<\" \"<<x<<\" \"<<y<<endl;\n for(auto e:G[v]){\n int u,c;\n tie(u,c)=e;\n if(~dp[u]) continue;\n chmax(dp[u],dp[v]+c);\n qt.emplace(inv(u)); \n } \n }\n\n vector<int> dp2(sz,-1),used(sz,0),visit(sz,0);\n queue<int> qu;\n \n function<int(int)> dfs=\n [&](int v){\n int &res=dp2[v];\n if(used[v]) return res;\n //cout<<v<<\"****\"<<endl;\n //cout<<get<0>(inv(v))<<\":\"<<get<1>(inv(v))<<\":\"<<get<2>(inv(v))<<endl;\n \n visit[v]=1;\n qu.emplace(v);\n res=dp[v];\n for(auto e:R[v]){\n\tint u,c;\n\ttie(u,c)=e;\n\tif(dp[u]<0) continue;\n\t//cout<<setw(6)<<v<<\":\"<<setw(3)<<dp[v]<<\":\"<<setw(3)<<visit[v]<<endl;\n\t//cout<<setw(6)<<u<<\"+\"<<setw(3)<<dp[u]<<\"+\"<<setw(3)<<visit[u]<<endl;\n\tif(visit[u]==1){\n\t cout<<-1<<endl;\n\t exit(0);\n\t}\n\tchmax(res,dfs(u)+c);\n }\n visit[v]=0;\n return res;\n };\n \n int ans=0;\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n int v=idx(0,x,y);\n if(~dp[v]) chmax(ans,dfs(v));\n while(!qu.empty()){\n\tused[qu.front()]=1;\n\tvisit[qu.front()]=2;\n\tqu.pop();\n }\n }\n }\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.8163265306122449,"time_ms":110,"memory_kb":28468,"score_of_the_acc":-0.2504,"final_rank":13},{"submission_id":"aoj_2307_3178270","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//INSERT ABOVE HERE\nsigned main(){\n const int D = 11;\n \n int n,m;\n cin>>n>>m;\n vector<string> s(n);\n for(int i=0;i<n;i++) cin>>s[i];\n\n vector<vector<int> > E(n,vector<int>(n,0));\n for(int i=0;i<m;i++){\n int x,y;\n cin>>x>>y;\n x--;y--;\n E[x][y]=1;\n }\n\n vector<int> l(n);\n for(int i=0;i<n;i++) l[i]=s[i].size();\n\n\n using T = tuple<int, int, int>;\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\n int sz=idx(D,n-1,n-1)+1;\n\n queue<T> qt;\n vector<int> dp(sz,-1);\n \n // center inside s[x]\n for(int x=0;x<n;x++){\n // even\n for(int i=1;i<l[x];i++){\n // [0, i) + [i, l)\n int k=min(i,l[x]-i),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+j];\n if(ok){\n\tint d=i-(l[x]-i);\n\tqt.emplace(d,x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n // odd\n for(int i=0;i<l[x];i++){\n // [0, i) + [i, i+1) + [i+1, l)\n int k=min(i,l[x]-(i+1)),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+1+j];\n if(ok){\n\tint d=i-(l[x]-(i+1));\n\tqt.emplace(i-(l[x]-(i+1)),x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n }\n\n // s[x] |center| s[y] (obviously even)\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n if(!E[x][y]) continue;\n int k=min(l[x],l[y]),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][l[x]-(j+1)]==s[y][j];\n if(ok){\n\tint d=l[x]-l[y];\n\tqt.emplace(d,x,y);\n\tchmax(dp[idx(d,x,x)],l[x]+l[y]);\n }\n } \n }\n\n using P = pair<int, int>;\n vector<vector<P> > G(sz),R(sz);\n \n for(int d=-D;d<=D;d++){\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n\tint v=idx(d,x,y);\n\t//cout<<v<<\":\"<<d<<\" \"<<x<<\" \"<<y<<endl;\n\tfor(int i=0;i<n;i++){\n\t // s[i] s[x] s[y]\n\t if(d<=0&&E[i][x]){\n\t int k=min(-d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]+d+j];\n\t if(ok){\t \n\t int nd=d+l[i];\n\t int u=idx(nd,i,y);\n\t //cout<<v<<\" -> \"<<u<<endl;\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t // s[x] s[y] s[i]\n\t if(d>=0&&E[y][i]){\n\t int k=min(d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][j]==s[x][d-(j+1)];\n\t if(ok){\n\t int nd=d-l[i];\n\t int u=idx(nd,x,i);\n\t //cout<<v<<\" -> \"<<u<<endl;\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t}\n } \n }\n }\n\n // find nodes that can reached from starts\n while(!qt.empty()){\n int d,x,y;\n tie(d,x,y)=qt.front();qt.pop();\n int v=idx(d,x,y);\n //cout<<dp[v]<<\":\"<<d<<\" \"<<x<<\" \"<<y<<endl;\n for(auto e:G[v]){\n int u,c;\n tie(u,c)=e;\n if(~dp[u]) continue;\n chmax(dp[u],dp[v]+c);\n qt.emplace(inv(u)); \n } \n }\n\n vector<int> dp2(sz,-1),used(sz,0),visit(sz,-1);\n queue<int> qu;\n int pos=0;\n function<int(int)> dfs=\n [&](int v){\n int &res=dp2[v];\n if(used[v]) return res;\n //cout<<v<<\"****\"<<endl;\n //cout<<get<0>(inv(v))<<\":\"<<get<1>(inv(v))<<\":\"<<get<2>(inv(v))<<endl;\n \n visit[v]=pos++;\n qu.emplace(v);\n res=dp[v];\n for(auto e:R[v]){\n\tint u,c;\n\ttie(u,c)=e;\n\tif(dp[u]<0) continue;\n\t//cout<<setw(6)<<v<<\":\"<<setw(3)<<dp[v]<<\":\"<<setw(3)<<visit[v]<<endl;\n\t//cout<<setw(6)<<u<<\"+\"<<setw(3)<<dp[u]<<\"+\"<<setw(3)<<visit[u]<<endl;\n\tif(~visit[u]&&visit[u]<=visit[v]){\n\t cout<<-1<<endl;\n\t exit(0);\n\t}\n\tchmax(res,dfs(u)+c);\n }\n return res;\n };\n \n int ans=0;\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n int v=idx(0,x,y);\n if(~dp[v]) chmax(ans,dfs(v));\n while(!qu.empty()){\n\tused[qu.front()]=1;\n\tvisit[qu.front()]=sz+1;\n\tqu.pop();\n }\n }\n }\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.6632653061224489,"time_ms":100,"memory_kb":28464,"score_of_the_acc":-0.2482,"final_rank":14},{"submission_id":"aoj_2307_3178268","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//INSERT ABOVE HERE\nsigned main(){\n const int D = 11;\n \n int n,m;\n cin>>n>>m;\n vector<string> s(n);\n for(int i=0;i<n;i++) cin>>s[i];\n\n vector<vector<int> > E(n,vector<int>(n,0));\n for(int i=0;i<m;i++){\n int x,y;\n cin>>x>>y;\n x--;y--;\n E[x][y]=1;\n }\n\n vector<int> l(n);\n for(int i=0;i<n;i++) l[i]=s[i].size();\n\n\n using T = tuple<int, int, int>;\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\n int sz=idx(D,n-1,n-1)+1;\n\n queue<T> qt;\n vector<int> dp(sz,-1);\n \n // center inside s[x]\n for(int x=0;x<n;x++){\n // even\n for(int i=1;i<l[x];i++){\n // [0, i) + [i, l)\n int k=min(i,l[x]-i),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+j];\n if(ok){\n\tint d=i-(l[x]-i);\n\tqt.emplace(d,x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n // odd\n for(int i=0;i<l[x];i++){\n // [0, i) + [i, i+1) + [i+1, l)\n int k=min(i,l[x]-(i+1)),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+1+j];\n if(ok){\n\tint d=i-(l[x]-(i+1));\n\tqt.emplace(i-(l[x]-(i+1)),x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n }\n\n // s[x] |center| s[y] (obviously even)\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n if(!E[x][y]) continue;\n int k=min(l[x],l[y]),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][l[x]-(j+1)]==s[y][j];\n if(ok){\n\tint d=l[x]-l[y];\n\tqt.emplace(d,x,y);\n\tchmax(dp[idx(d,x,x)],l[x]+l[y]);\n }\n } \n }\n\n using P = pair<int, int>;\n vector<vector<P> > G(sz),R(sz);\n \n for(int d=-D;d<=D;d++){\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n\tint v=idx(d,x,y);\n\t//cout<<v<<\":\"<<d<<\" \"<<x<<\" \"<<y<<endl;\n\tfor(int i=0;i<n;i++){\n\t // s[i] s[x] s[y]\n\t if(d<=0&&E[i][x]){\n\t int k=min(-d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]+d+j];\n\t if(ok){\t \n\t int nd=d+l[i];\n\t int u=idx(nd,i,y);\n\t //cout<<v<<\" -> \"<<u<<endl;\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t // s[x] s[y] s[i]\n\t if(d>=0&&E[y][i]){\n\t int k=min(d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][j]==s[x][d-(j+1)];\n\t if(ok){\n\t int nd=d-l[i];\n\t int u=idx(nd,x,i);\n\t //cout<<v<<\" -> \"<<u<<endl;\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t}\n } \n }\n }\n\n // find nodes that can reached from starts\n while(!qt.empty()){\n int d,x,y;\n tie(d,x,y)=qt.front();qt.pop();\n int v=idx(d,x,y);\n //cout<<dp[v]<<\":\"<<d<<\" \"<<x<<\" \"<<y<<endl;\n for(auto e:G[v]){\n int u,c;\n tie(u,c)=e;\n if(~dp[u]) continue;\n chmax(dp[u],dp[v]+c);\n qt.emplace(inv(u)); \n } \n }\n\n vector<int> dp2(sz,-1),used(sz,0),visit(sz,-1);\n queue<int> qu;\n int pos=0;\n function<int(int)> dfs=\n [&](int v){\n int &res=dp2[v];\n if(used[v]) return res;\n //cout<<v<<\"****\"<<endl;\n //cout<<get<0>(inv(v))<<\":\"<<get<1>(inv(v))<<\":\"<<get<2>(inv(v))<<endl;\n \n visit[v]=pos++;\n qu.emplace(v);\n res=dp[v];\n for(auto e:R[v]){\n\tint u,c;\n\ttie(u,c)=e;\n\t//cout<<setw(6)<<v<<\":\"<<setw(3)<<dp[v]<<\":\"<<setw(3)<<visit[v]<<endl;\n\t//cout<<setw(6)<<u<<\"+\"<<setw(3)<<dp[u]<<\"+\"<<setw(3)<<visit[u]<<endl;\n\tif(dp[u]<0) continue;\n\tif(~visit[u]&&visit[u]<=visit[v]){\n\t cout<<-1<<endl;\n\t exit(0);\n\t}\n\tchmax(res,dfs(u)+c);\n }\n return res;\n };\n \n int ans=0;\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n int v=idx(0,x,y);\n if(~dp[v]) chmax(ans,dfs(v));\n while(!qu.empty()){\n\tused[qu.front()]=1;\n\tqu.pop();\n }\n }\n }\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.5816326530612245,"time_ms":110,"memory_kb":24084,"score_of_the_acc":-0.2034,"final_rank":15},{"submission_id":"aoj_2307_3178207","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//INSERT ABOVE HERE\nsigned main(){\n const int D = 11;\n \n int n,m;\n cin>>n>>m;\n vector<string> s(n);\n for(int i=0;i<n;i++) cin>>s[i];\n\n vector<vector<int> > E(n,vector<int>(n,0));\n for(int i=0;i<m;i++){\n int x,y;\n cin>>x>>y;\n x--;y--;\n E[x][y]=1;\n }\n\n vector<int> l(n);\n for(int i=0;i<n;i++) l[i]=s[i].size();\n\n\n using T = tuple<int, int, int>;\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\n int sz=idx(D,n-1,n-1)+1;\n\n queue<T> qt;\n vector<int> dp(sz,-1);\n \n // center inside s[x]\n for(int x=0;x<n;x++){\n // even\n for(int i=1;i<l[x];i++){\n // [0, i) + [i, l)\n int k=min(i,l[x]-i),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+j];\n if(ok){\n\tint d=i-(l[x]-i);\n\tqt.emplace(d,x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n // odd\n for(int i=0;i<l[x];i++){\n // [0, i) + [i, i+1) + [i+1, l)\n int k=min(i,l[x]-(i+1)),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][i-(j+1)]==s[x][i+1+j];\n if(ok){\n\tint d=i-(l[x]-(i+1));\n\tqt.emplace(i-(l[x]-(i+1)),x,x);\n\tchmax(dp[idx(d,x,x)],l[x]);\n }\n }\n }\n\n // s[x] |center| s[y] (obviously even)\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n if(!E[x][y]) continue;\n int k=min(l[x],l[y]),ok=1;\n for(int j=0;j<k;j++)\n\tok&=s[x][l[x]-(j+1)]==s[y][j];\n if(ok){\n\tint d=l[x]-l[y];\n\tqt.emplace(d,x,y);\n\tchmax(dp[idx(d,x,x)],l[x]+l[y]);\n }\n } \n }\n\n using P = pair<int, int>;\n vector<vector<P> > G(sz),R(sz);\n \n for(int d=-D;d<=D;d++){\n for(int x=0;x<n;x++){\n for(int y=0;y<n;y++){\n\tif(!E[x][y]) continue;\n\tfor(int i=0;i<n;i++){\n\t // s[i] s[x] s[y]\n\t if(d<=0&&E[i][x]){\n\t int k=min(-d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]-d+j];\n\t if(ok){\n\t int nd=d+l[i];\n\t int v=idx(d,x,y),u=idx(nd,i,y);\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t // s[x] s[y] s[i]\n\t if(d>=0&&E[y][i]){\n\t int k=min(d,l[i]),ok=1;\n\t for(int j=0;j<k;j++)\n\t ok&=s[i][j]==s[x][d-(j+1)];\n\t if(ok){\n\t int nd=d-l[i];\n\t int v=idx(d,x,y),u=idx(nd,x,i);\n\t G[v].emplace_back(u,l[i]);\n\t R[u].emplace_back(v,l[i]);\t \n\t }\n\t }\n\t}\n } \n }\n }\n\n // find nodes that can reached from starts\n while(!qt.empty()){\n int d,x,y;\n tie(d,x,y)=qt.front();qt.pop();\n int v=idx(d,x,y);\n for(auto e:G[v]){\n int u,c;\n tie(u,c)=e;\n if(~dp[u]) continue;\n chmax(dp[u],dp[v]+c);\n qt.emplace(inv(u)); \n } \n }\n\n vector<int> dp2(sz,-1),visit(sz,0);\n\n int pos=0;\n function<int(int)> dfs=\n [&](int v){\n int &res=dp2[v];\n if(~res) return res;\n visit[v]=pos++;\n res=dp[v];\n for(auto e:R[v]){\n\tint u,c;\n\ttie(u,c)=e;\n\tif(dp[u]<0) continue;\n\tif(visit[u]<=visit[v]){\n\t cout<<-1<<endl;\n\t exit(0);\n\t}\n\tchmax(res,dfs(u)+c);\n }\n return res;\n };\n \n int ans=0;\n for(int x=0;x<n;x++)\n for(int y=0;y<n;y++)\n if(~dp[idx(0,x,y)]&&dp2[idx(0,x,y)]<0)\n\tchmax(ans,dfs(idx(0,x,y)));\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.30612244897959184,"time_ms":10,"memory_kb":17224,"score_of_the_acc":-0.1076,"final_rank":18},{"submission_id":"aoj_2307_2658585","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\nint main()\n{\n\tvector<char>chs(2000);\n\tvector<vector<int>>real_edges(2000);\n\t{\n\t\tint N, M; cin >> N >> M;\n\t\tvector<string>sts;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tstring st; cin >> st;\n\t\t\tsts.push_back(st);\n\t\t}\n\t\tvector<pair<int, int>>edges;\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tint a, b; cin >> a >> b;\n\t\t\ta--; b--;\n\t\t\tedges.push_back(make_pair(a, b));\n\t\t}\n\t\tint id = 0;\n\t\tvector<int>ids(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tids[i] = id;\n\t\t\tfor (int j = 0; j < sts[i].size() - 1; ++j) {\n\t\t\t\treal_edges[ids[i] + j].push_back(ids[i] + j + 1);\n\t\t\t}\n\t\t\tfor (int j = 0; j < sts[i].size(); ++j) {\n\t\t\t\tchs[ids[i] + j] = sts[i][j];\n\t\t\t}\n\t\t\tid += sts[i].size();\n\t\t}\n\t\tids.push_back(id);\n\t\tfor (auto e : edges) {\n\t\t\treal_edges[ids[e.first + 1] - 1].push_back(ids[e.second]);\n\t\t}\n\t\tconst int start = id;\n\t\tconst int goal = start + 1;\n\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\treal_edges[start].push_back(ids[i]);\n\t\t\treal_edges[ids[i + 1] - 1].push_back(goal);\n\t\t}\n\t\tchs.resize(goal + 1);\n\t\treal_edges.resize(goal + 1);\n\t}\n\tconst int N = real_edges.size();\n\tvector<vector<int>>rev_edges(N);\n\n\tfor (int i = 0; i < N; ++i) {\n\t\tfor (auto e : real_edges[i]) {\n\t\t\trev_edges[e].push_back(i);\n\t\t}\n\t}\n\n\tvector<vector<int>>memo(N, vector<int>(N, -1));\n\tconst int S = N - 2;\n\tconst int G = S + 1;\n\tmemo[S][G]=0;\n\tqueue<pair<int,int>>que;\n\tque.push(make_pair(S,G));\n\tint ans=0;\n\twhile (!que.empty()) {\n\t\tconst auto atop(que.front());\n\t\tque.pop();\n\t\tconst int a=atop.first;\n\t\tconst int b=atop.second;\n\n\t\tif(memo[a][b]>8000)break;\n\t\n\n\t\tfor (auto next_a : real_edges[a]) {\n\t\t\tfor (auto next_b : rev_edges[b]) {\n\t\t\t\tif (chs[next_a] == chs[next_b]) {\n\t\t\t\t\tif (a == next_b&&b == next_a) {\n\t\t\t\t\t\tans=max(ans,memo[a][b]);\n\t\t\t\t\t\tif (ans > 2010) {\n\t\t\t\t\t\t\tans=-1;\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 (next_b == next_a) {\n\t\t\t\t\t\tans=max(ans,memo[a][b]+1);\n\t\t\t\t\t\tif (ans > 2010) {\n\t\t\t\t\t\t\tans = -1;\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 (memo[next_a][next_b] < memo[a][b]+2) {\n\t\t\t\t\t\tmemo[next_a][next_b]=memo[a][b]+2;\n\t\t\t\t\t\tque.push(make_pair(next_a,next_b));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\n\treturn 0;\n}","accuracy":1,"time_ms":870,"memory_kb":19844,"score_of_the_acc":-0.3273,"final_rank":6},{"submission_id":"aoj_2307_2658584","code_snippet":"#include \"bits/stdc++.h\"\n#include<unordered_map>\n#include<unordered_set>\n#pragma warning(disable:4996)\nusing namespace std;\n\nint main()\n{\n\tvector<char>chs(2000);\n\tvector<vector<int>>real_edges(2000);\n\t{\n\t\tint N, M; cin >> N >> M;\n\t\tvector<string>sts;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tstring st; cin >> st;\n\t\t\tsts.push_back(st);\n\t\t}\n\t\tvector<pair<int, int>>edges;\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tint a, b; cin >> a >> b;\n\t\t\ta--; b--;\n\t\t\tedges.push_back(make_pair(a, b));\n\t\t}\n\t\tint id = 0;\n\t\tvector<int>ids(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tids[i] = id;\n\t\t\tfor (int j = 0; j < sts[i].size() - 1; ++j) {\n\t\t\t\treal_edges[ids[i] + j].push_back(ids[i] + j + 1);\n\t\t\t}\n\t\t\tfor (int j = 0; j < sts[i].size(); ++j) {\n\t\t\t\tchs[ids[i] + j] = sts[i][j];\n\t\t\t}\n\t\t\tid += sts[i].size();\n\t\t}\n\t\tids.push_back(id);\n\t\tfor (auto e : edges) {\n\t\t\treal_edges[ids[e.first + 1] - 1].push_back(ids[e.second]);\n\t\t}\n\t\tconst int start = id;\n\t\tconst int goal = start + 1;\n\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\treal_edges[start].push_back(ids[i]);\n\t\t\treal_edges[ids[i + 1] - 1].push_back(goal);\n\t\t}\n\t\tchs.resize(goal + 1);\n\t\treal_edges.resize(goal + 1);\n\t}\n\tconst int N = real_edges.size();\n\tvector<vector<int>>rev_edges(N);\n\n\tfor (int i = 0; i < N; ++i) {\n\t\tfor (auto e : real_edges[i]) {\n\t\t\trev_edges[e].push_back(i);\n\t\t}\n\t}\n\n\tvector<vector<int>>memo(N, vector<int>(N, -1));\n\tconst int S = N - 2;\n\tconst int G = S + 1;\n\tmemo[S][G]=0;\n\tqueue<pair<int,int>>que;\n\tque.push(make_pair(S,G));\n\tint ans=0;\n\twhile (!que.empty()) {\n\t\tconst auto atop(que.front());\n\t\tque.pop();\n\t\tconst int a=atop.first;\n\t\tconst int b=atop.second;\n\n\t\tif(memo[a][b]>4000)break;\n\t\n\n\t\tfor (auto next_a : real_edges[a]) {\n\t\t\tfor (auto next_b : rev_edges[b]) {\n\t\t\t\tif (chs[next_a] == chs[next_b]) {\n\t\t\t\t\tif (a == next_b&&b == next_a) {\n\t\t\t\t\t\tans=max(ans,memo[a][b]);\n\t\t\t\t\t\tif (ans > 2010) {\n\t\t\t\t\t\t\tans=-1;\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 (next_b == next_a) {\n\t\t\t\t\t\tans=max(ans,memo[a][b]+1);\n\t\t\t\t\t\tif (ans > 2010) {\n\t\t\t\t\t\t\tans = -1;\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 (memo[next_a][next_b] < memo[a][b]+2) {\n\t\t\t\t\t\tmemo[next_a][next_b]=memo[a][b]+2;\n\t\t\t\t\t\tque.push(make_pair(next_a,next_b));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\n\treturn 0;\n}","accuracy":0.41836734693877553,"time_ms":10,"memory_kb":7184,"score_of_the_acc":0,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_2307_10836481\",\n \"code_snippet\": \"#include <cstdio>\\n#include <cstring>\\n#include <iostream>\\n#include <algorithm>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <cmath>\\n#include <sstream>\\n#include <iomanip>\\n#include <queue>\\n#include <ctime>\\nusing namespace std;\\ntemplate <class T> void checkmin(T &t,T x){if (x < t) t = x;}\\ntemplate <class T> void checkmax(T &t,T x){if (x > t) t = x;}\\ntemplate <class T> void _checkmin(T &t, T x){if (t == -1) t = x; if (x < t) t = x;}\\ntemplate <class T> void _checkmax(T &t, T x){if (t == -1) t = x; if (x > t) t = x;}\\ntypedef pair <int,int> PII;\\ntypedef pair <double,double> PDD;\\ntypedef long long lld;\\n#define foreach(it,v) for (__typeof((v).begin()) it = (v).begin();it != (v).end();it++)\\n#define DEBUG(a) cout << #a\\\" = \\\" << (a) << endl;\\n#define DEBUGARR(a, n) for (int i = 0; i < (n); i++) { cout << #a\\\"[\\\" << i << \\\"] = \\\" << (a)[i] << endl; }\\nconst int N = 105;\\nconst int M = 300005;\\nint n, m, cnt;\\nstring s[N], rs[N];\\nvector <int> next_arr[N];\\nvector <int> pre[N];\\nvector <PII> E[M];\\nint v[M];\\nint st[M];\\nint du[M];\\nint f[M];\\nint fa[M];\\nint wei[M];\\nint palind[N][11];\\nint rpalind[N][11];\\nint pos[N][N][11][2];\\nset <PII> Set;\\n\\nint ans;\\n\\nint abs(int x) {\\n\\treturn x < 0 ? -x : x;\\n}\\n\\nint find(int x, int y) {\\n\\treturn Set.count(make_pair(x, y));\\n}\\n\\nvector <PII> getEdge(int i, int j, int l, int d) {\\n\\tvector <PII> ret;\\n\\tif (d) {\\n\\t\\tif (l > s[j].size()) return ret;\\n\\t\\tif (find(i, j) && rpalind[j][s[j].size() - l]) {\\n\\t\\t\\tret.push_back(make_pair(cnt, l));\\n\\t\\t}\\n\\t\\tforeach (it, next_arr[i]) {\\n\\t\\t\\tint len = min(l, (int)s[*it].size());\\n\\t\\t\\tif (s[*it].substr(0, len) == rs[j].substr(s[j].size() - l, len)) {\\n\\t\\t\\t\\tret.push_back(make_pair(pos[*it][j][abs(l - (int)s[*it].size())][l >= s[*it].size()], len * 2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t} else if (l) {\\n\\t\\tif (l > s[i].size()) return ret;\\n\\t\\tif (find(i, j) && palind[i][s[i].size() - l]) {\\n\\t\\t\\tret.push_back(make_pair(cnt, l));\\n\\t\\t}\\n\\t\\tforeach (it, pre[j]) {\\n\\t\\t\\tint len = min(l, (int)s[*it].size());\\n\\t\\t\\tif (rs[*it].substr(0, len) == s[i].substr(s[i].size() - l, len)) {\\n\\t\\t\\t\\tret.push_back(make_pair(pos[i][*it][abs(l - (int)s[*it].size())][s[*it].size() >= l], len * 2));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\nvoid build_graph() {\\n\\tcnt = 0;\\n\\tfor (int i = 0; i < n; i++) \\n\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t\\tfor (int k = 0; k < 11; k++)\\n\\t\\t\\t\\tfor (int l = 0; l < 2; l++)\\n\\t\\t\\t\\t\\tpos[i][j][k][l] = cnt++;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tfor (int j = 0; j <= s[i].size(); j++) {\\n\\t\\t\\tint k = s[i].size() - 1;\\n\\t\\t\\tstring _s = s[i];\\n\\t\\t\\tint _i = j;\\n\\t\\t\\tint _j = k;\\n\\t\\t\\tint ok = 1;\\n\\t\\t\\twhile (_i < _j) {\\n\\t\\t\\t\\tif (_s[_i++] != _s[_j--]) {\\n\\t\\t\\t\\t\\tok = 0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tpalind[i][j] = ok;\\n\\t\\t\\t_i = j;\\n\\t\\t\\t_j = k;\\n\\t\\t\\t_s = rs[i];\\n\\t\\t\\tok = 1;\\n\\t\\t\\twhile (_i < _j) {\\n\\t\\t\\t\\tif (_s[_i++] != _s[_j--]) {\\n\\t\\t\\t\\t\\tok = 0;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\trpalind[i][j] = ok;\\n\\t\\t}\\n\\t\\tif (palind[i][0]) {\\n\\t\\t\\tcheckmax(ans, (int)s[i].size());\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < n; i++)\\n\\t\\tfor (int j = 0; j < n; j++)\\n\\t\\t\\tfor (int k = 0; k < 11; k++)\\n\\t\\t\\t\\tfor (int l = 0; l < 2; l++) {\\n\\t\\t\\t\\t\\tE[pos[i][j][k][l]] = getEdge(i, j, k, l);\\n\\t\\t\\t\\t}\\n}\\n\\nvoid bfs() {\\n\\tqueue <int> q;\\n\\tmemset(v, 0, sizeof(v));\\n\\tmemset(st, 0, sizeof(st));\\n\\tfor (int i = 0; i <= cnt; i++) v[i] = 0;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tfor (int j = 0; j < n; j++) {\\n\\t\\t\\tint len = min(s[i].size(), s[j].size());\\n\\t\\t\\tif (s[i].substr(0, len) == rs[j].substr(0, len)) {\\n\\t\\t\\t\\tint p = pos[i][j][abs((int)s[i].size() - (int)s[j].size())][s[j].size() >= s[i].size()];\\n\\t\\t\\t\\tq.push(p);\\n\\t\\t\\t\\tv[p] = 1;\\n\\t\\t\\t\\tst[p] = 1;\\n\\t\\t\\t\\tf[p] = min(s[i].size(), s[j].size()) * 2;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\twhile (!q.empty()) {\\n\\t\\tint x = q.front();\\n\\t\\tq.pop();\\n\\t\\tforeach (it, E[x]) {\\n\\t\\t\\tif (!v[it->first]) {\\n\\t\\t\\t\\tfa[it->first] = x;\\n\\t\\t\\t\\tv[it->first] = 1;\\n\\t\\t\\t\\tq.push(it->first);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvector <int> q;\\n\\nvoid topsort() {\\n\\tmemset(du, 0, sizeof(du));\\n\\tq.clear();\\n\\tfor (int i = 0; i <= cnt; i++) {\\n\\t\\tif (v[i]) {\\n\\t\\t\\tforeach (it, E[i]) {\\n\\t\\t\\t\\tif (v[it->first]) {\\n\\t\\t\\t\\t\\tdu[it->first]++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint head = 0;\\n\\tfor (int i = 0; i <= cnt; i++) {\\n\\t\\tif (v[i] && !du[i]) {\\n\\t\\t\\tq.push_back(i);\\n\\t\\t}\\n\\t}\\n\\twhile (head != q.size()) {\\n\\t\\tint x = q[head++];\\n\\t\\tforeach (it, E[x]) {\\n\\t\\t\\tif (v[it->first]) {\\n\\t\\t\\t\\tdu[it->first]--;\\n\\t\\t\\t\\tif (!du[it->first]) {\\n\\t\\t\\t\\t\\tq.push_back(it->first);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid dp() {\\n\\tif (!v[cnt] && ans == -1) {\\n\\t\\tputs(\\\"0\\\");\\n\\t} else if (du[cnt]) {\\n\\t\\tputs(\\\"-1\\\");\\n\\t} else {\\n\\t\\tfor (int i = 0; i < q.size(); i++) {\\n\\t\\t\\tint x = q[i];\\n\\t\\t\\tif (f[x] != -1) {\\n\\t\\t\\t\\tforeach (it, E[x]) {\\n\\t\\t\\t\\t\\tcheckmax(f[it->first], f[x] + it->second);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << max(f[cnt], ans) << endl;\\n\\t}\\n}\\n\\nint main(){\\n#ifdef cwj\\n\\tfreopen(\\\"in\\\", \\\"r\\\", stdin);\\n#endif\\n\\tcin >> n >> m;\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tcin >> s[i];\\n\\t\\trs[i] = s[i];\\n\\t\\treverse(rs[i].begin(), rs[i].end());\\n\\t}\\n\\tSet.clear();\\n\\tmemset(f, 0xFF, sizeof(f));\\n\\tfor (int i = 0; i < m; i++) {\\n\\t\\tint x, y;\\n\\t\\tcin >> x >> y;\\n\\t\\tx--; y--;\\n\\t\\tSet.insert(make_pair(x, y));\\n\\t\\tnext_arr[x].push_back(y);\\n\\t\\tpre[y].push_back(x);\\n\\t}\\n\\tans = -1;\\n\\tbuild_graph();\\n\\tbfs();\\n\\ttopsort();\\n\\tdp();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 21912,\n \"score_of_the_acc\": -0.1623,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2307_8985727\",\n \"code_snippet\": \"// time complexity: O(nml) where l = (maximum length of a word)\\n\\n#include <array>\\n#include <string>\\n#include <vector>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nstruct edge_base {\\n\\tint s, t, w;\\n};\\n\\nstruct edge {\\n\\tint t, w;\\n};\\n\\nbool check(string s, int pos) {\\n\\tint n = s.size();\\n\\tbool res = true;\\n\\tif (pos % 2 == 0) {\\n\\t\\tfor (int i = 0; i < min(pos / 2, n - pos / 2); i++) {\\n\\t\\t\\tres = res && (s[pos / 2 - i - 1] == s[pos / 2 + i]);\\n\\t\\t}\\n\\t} else {\\n\\t\\tfor (int i = 1; i <= min(pos / 2, n - pos / 2 - 1); i++) {\\n\\t\\t\\tres = res && (s[pos / 2 - i] == s[pos / 2 + i]);\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\nvector<bool> reachable(int N, vector<vector<edge> > G, vector<int> start) {\\n\\tvector<bool> ans(N, false);\\n\\tvector<int> st;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (start[i] != -1) {\\n\\t\\t\\tans[i] = true;\\n\\t\\t\\tst.push_back(i);\\n\\t\\t}\\n\\t}\\n\\twhile (!st.empty()) {\\n\\t\\tint u = st.back();\\n\\t\\tst.pop_back();\\n\\t\\tfor (edge e : G[u]) {\\n\\t\\t\\tif (!ans[e.t]) {\\n\\t\\t\\t\\tans[e.t] = true;\\n\\t\\t\\t\\tst.push_back(e.t);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nint longest_path(int N, vector<edge_base> es, vector<int> start, vector<int> goal) {\\n\\t// step #1. construct graph\\n\\tvector<vector<edge> > G1(N), G2(N);\\n\\tfor (edge_base e : es) {\\n\\t\\tG1[e.s].push_back(edge{e.t, e.w});\\n\\t\\tG2[e.t].push_back(edge{e.s, e.w});\\n\\t}\\n\\n\\t// step #2. reduce graph\\n\\tvector<bool> reach1 = reachable(N, G1, start);\\n\\tvector<bool> reach2 = reachable(N, G2, goal);\\n\\tvector<bool> reach(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\treach[i] = reach1[i] && reach2[i];\\n\\t}\\n\\tvector<vector<edge> > G3(N);\\n\\tvector<int> deg(N);\\n\\tfor (edge_base e : es) {\\n\\t\\tif (reach[e.s] && reach[e.t]) {\\n\\t\\t\\tG3[e.s].push_back(edge{e.t, e.w});\\n\\t\\t\\tdeg[e.t]++;\\n\\t\\t}\\n\\t}\\n\\n\\t// step #3. compute in topological order\\n\\tvector<int> dp(N);\\n\\tvector<int> st;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tif (start[i] != -1 && deg[i] == 0) {\\n\\t\\t\\tdp[i] = start[i];\\n\\t\\t\\tst.push_back(i);\\n\\t\\t}\\n\\t}\\n\\tint ans = 0;\\n\\twhile (!st.empty()) {\\n\\t\\tint u = st.back();\\n\\t\\tst.pop_back();\\n\\t\\tif (goal[u] != -1) {\\n\\t\\t\\tans = max(ans, dp[u] + goal[u]);\\n\\t\\t}\\n\\t\\tfor (edge e : G3[u]) {\\n\\t\\t\\tdeg[e.t]--;\\n\\t\\t\\tdp[e.t] = max(dp[e.t], dp[u] + e.w);\\n\\t\\t\\tif (deg[e.t] == 0) {\\n\\t\\t\\t\\tst.push_back(e.t);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (deg != vector<int>(N, 0)) {\\n\\t\\treturn -1;\\n\\t}\\n\\n\\treturn ans;\\n}\\n\\nint solve(int N, int M, vector<string> S, vector<edge_base> es) {\\n\\t// step #1. preparation\\n\\tvector<int> L(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tL[i] = S[i].size();\\n\\t}\\n\\tvector<vector<int> > G1(N), G2(N);\\n\\tfor (edge_base e : es) {\\n\\t\\tG1[e.s].push_back(e.t);\\n\\t\\tG2[e.t].push_back(e.s);\\n\\t}\\n\\tvector<array<int, 3> > states;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tfor (int k = -L[i]; k <= +L[j]; k++) {\\n\\t\\t\\t\\tstates.push_back({i, j, k});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tint Z = states.size();\\n\\tauto search_state = [&](array<int, 3> v) {\\n\\t\\tint pos = lower_bound(states.begin(), states.end(), v) - states.begin();\\n\\t\\tif (pos == Z || states[pos] != v) {\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t\\treturn pos;\\n\\t};\\n\\n\\t// step #2. compute all \\\"start/goal states\\\"\\n\\tvector<int> start(Z, -1), goal(Z, -1);\\n\\tfor (int i = 0; i < Z; i++) {\\n\\t\\tif (states[i][0] == states[i][1] && check(S[states[i][0]], -states[i][2] + L[states[i][0]])) {\\n\\t\\t\\tstart[i] = L[states[i][0]];\\n\\t\\t}\\n\\t\\tif (states[i][2] == 0) {\\n\\t\\t\\tgoal[i] = 0;\\n\\t\\t}\\n\\t}\\n\\n\\t// step #3. construct graph\\n\\tvector<edge_base> eg;\\n\\tfor (int i = 0; i < Z; i++) {\\n\\t\\tarray<int, 3> s = states[i];\\n\\t\\t// add to left\\n\\t\\tif (s[2] >= 0) {\\n\\t\\t\\tfor (int j : G2[s[0]]) {\\n\\t\\t\\t\\tbool ok = true;\\n\\t\\t\\t\\tfor (int k = 0; k < s[2] && k < L[j]; k++) {\\n\\t\\t\\t\\t\\tok = ok && (S[s[1]][L[s[1]] - s[2] + k] == S[j][L[j] - k - 1]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (ok) {\\n\\t\\t\\t\\t\\tint z = search_state({j, s[1], s[2] - L[j]});\\n\\t\\t\\t\\t\\teg.push_back(edge_base{i, z, L[j]});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// add to right\\n\\t\\tif (s[2] <= 0) {\\n\\t\\t\\tfor (int j : G1[s[1]]) {\\n\\t\\t\\t\\tbool ok = true;\\n\\t\\t\\t\\tfor (int k = 0; k < -s[2] && k < L[j]; k++) {\\n\\t\\t\\t\\t\\tok = ok && (S[s[0]][-s[2] - k - 1] == S[j][k]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (ok) {\\n\\t\\t\\t\\t\\tint z = search_state({s[0], j, s[2] + L[j]});\\n\\t\\t\\t\\t\\teg.push_back(edge_base{i, z, L[j]});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t// step #4. compute answer\\n\\tint ans = longest_path(Z, eg, start, goal);\\n\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tvector<string> S(N);\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tcin >> S[i];\\n\\t}\\n\\tvector<edge_base> es(M);\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tcin >> es[i].s >> es[i].t;\\n\\t\\tes[i].s--; es[i].t--;\\n\\t}\\n\\tint ans = solve(N, M, S, es);\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 40224,\n \"score_of_the_acc\": -0.3698,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2307_8487347\",\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 all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define sz(x) (int)x.size()\\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\\nvector<int> scc(vector<vector<int>> es) {\\n int n = sz(es);\\n vector<vector<int>> rs(n);\\n rep(i, n) each(e, es[i]) rs[e].eb(i);\\n\\n vector<int> comp(n, -1);\\n vector<int> vs;\\n\\n auto dfs = [&](auto &&dfs, int now) -> void {\\n if (comp[now] != -1) return;\\n comp[now] = 1;\\n each(e, es[now]) dfs(dfs, e);\\n vs.eb(now);\\n };\\n\\n auto rdfs = [&](auto &&rdfs, int now, int col) -> void {\\n if (comp[now] != -1) return;\\n comp[now] = col;\\n each(e, rs[now]) rdfs(rdfs, e, col);\\n };\\n\\n rep(i, n) dfs(dfs, i);\\n fill(all(comp), -1);\\n reverse(all(vs));\\n int cnt = 0;\\n each(e, vs) {\\n if (comp[e] == -1) rdfs(rdfs, e, cnt++);\\n }\\n return comp;\\n}\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n\\n vector<string> S(N + 1);\\n rep(i, N) cin >> S[i];\\n\\n vector<vector<int>> adj(N + 1, vector<int>(N + 1, 0));\\n rep(i, M) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n adj[u][v] = 1;\\n }\\n\\n rep(i, N + 1) adj[i][N] = adj[N][i] = 1;\\n\\n int L = 11;\\n\\n int V = 2 * (N + 1) * (N + 1) * L;\\n\\n auto tupleToInt = [&](int i, int j, int f, int l) {\\n int ret = 0;\\n ret *= N + 1, ret += i;\\n ret *= N + 1, ret += j;\\n ret *= 2, ret += f;\\n ret *= L, ret += l;\\n return ret;\\n };\\n\\n vector<vector<int>> es(V + 1);\\n vector<vector<ll>> weight(V + 1);\\n\\n rep(i, N + 1) rep(j, N + 1) rep(f, 2) rep(l, L) {\\n int u = tupleToInt(i, j, f, l);\\n if (f == 0) {\\n if (l > sz(S[i])) continue;\\n rep(k, N) {\\n if (!adj[k][j]) continue;\\n int m = sz(S[k]);\\n if (m <= l) {\\n string X = S[i];\\n reverse(all(X));\\n if (X.substr(l - m, m) != S[k]) continue;\\n int v = tupleToInt(i, k, 0, l - m);\\n es[u].eb(v);\\n weight[u].eb(m);\\n } else {\\n string X = S[i];\\n reverse(all(X));\\n if (X.substr(0, l) != S[k].substr(m - l, l)) continue;\\n int v = tupleToInt(i, k, 1, m - l);\\n es[u].eb(v);\\n weight[u].eb(l);\\n }\\n }\\n } else {\\n if (l > sz(S[j])) continue;\\n rep(k, N) {\\n if (!adj[i][k]) continue;\\n int m = sz(S[k]);\\n if (m < l) {\\n string X = S[k];\\n reverse(all(X));\\n if (S[j].substr(l - m, m) != X) continue;\\n int v = tupleToInt(k, j, 1, l - m);\\n es[u].eb(v);\\n weight[u].eb(m);\\n } else {\\n string X = S[k];\\n reverse(all(X));\\n if (S[j].substr(0, l) != X.substr(m - l, l)) continue;\\n int v = tupleToInt(k, j, 0, m - l);\\n es[u].eb(v);\\n weight[u].eb(l);\\n }\\n }\\n }\\n }\\n\\n auto comp = scc(es);\\n int K = sz(comp);\\n\\n vector<vector<pll>> dagEs(K);\\n vector<int> deg(K, 0);\\n rep(i, V + 1) {\\n int T = sz(es[i]);\\n assert(sz(weight[i]) == T);\\n rep(j, T) {\\n int u = comp[i], v = comp[es[i][j]];\\n if (u == v) continue;\\n ll w = weight[i][j];\\n dagEs[u].eb(v, w);\\n deg[v]++;\\n }\\n }\\n\\n vector<int> cnt(K, 0);\\n rep(i, V + 1) cnt[comp[i]]++;\\n\\n vector<ll> d(K, -INF);\\n queue<int> que;\\n d[comp[tupleToInt(N, N, 0, 0)]] = 0;\\n\\n rep(i, K) {\\n if (deg[i] == 0) que.emplace(i);\\n }\\n\\n while (!empty(que)) {\\n int i = que.front();\\n if (cnt[i] >= 2 && d[i] != -INF) d[i] = INF;\\n que.pop();\\n for (auto [j, w] : dagEs[i]) {\\n if (d[i] == INF) {\\n chmax(d[j], INF);\\n } else if (d[i] != -INF) {\\n chmax(d[j], d[i] + w);\\n }\\n if (--deg[j] == 0) que.emplace(j);\\n }\\n }\\n\\n ll ans = -INF;\\n\\n auto isPalindrome = [](string S) {\\n auto T = S;\\n reverse(all(T));\\n return S == T;\\n };\\n\\n rep(i, N + 1) rep(j, N + 1) rep(f, 2) rep(l, L) {\\n int v = comp[tupleToInt(i, j, f, l)];\\n // if (d[v] == 4) cout << i MM j MM f MM l << endl;\\n if (!adj[i][j]) continue;\\n\\n if (f == 0) {\\n if (l > sz(S[i])) continue;\\n if (isPalindrome(S[i].substr(sz(S[i]) - l, l))) {\\n chmax(ans, d[v] * 2 + l); //\\n }\\n } else {\\n if (l > sz(S[j])) continue;\\n if (isPalindrome(S[j].substr(0, l))) {\\n chmax(ans, d[v] * 2 + l); //\\n }\\n }\\n }\\n\\n cout << (ans >= INF ? -1 : ans) << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 44788,\n \"score_of_the_acc\": -0.4254,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2307_8487341\",\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 all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n#define sz(x) (int)x.size()\\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\\nvector<int> scc(vector<vector<int>> es) {\\n int n = sz(es);\\n vector<vector<int>> rs(n);\\n rep(i, n) each(e, es[i]) rs[e].eb(i);\\n\\n vector<int> comp(n, -1);\\n vector<int> vs;\\n\\n auto dfs = [&](auto &&dfs, int now) -> void {\\n if (comp[now] != -1) return;\\n comp[now] = 1;\\n each(e, es[now]) dfs(dfs, e);\\n vs.eb(now);\\n };\\n\\n auto rdfs = [&](auto &&rdfs, int now, int col) -> void {\\n if (comp[now] != -1) return;\\n comp[now] = col;\\n each(e, rs[now]) rdfs(rdfs, e, col);\\n };\\n\\n rep(i, n) dfs(dfs, i);\\n fill(all(comp), -1);\\n reverse(all(vs));\\n int cnt = 0;\\n each(e, vs) {\\n if (comp[e] == -1) rdfs(rdfs, e, cnt++);\\n }\\n return comp;\\n}\\n\\nint main() {\\n int N, M;\\n cin >> N >> M;\\n\\n vector<string> S(N + 1);\\n rep(i, N) cin >> S[i];\\n\\n vector<vector<int>> adj(N + 1, vector<int>(N + 1, 0));\\n rep(i, M) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n adj[u][v] = 1;\\n }\\n\\n rep(i, N + 1) adj[i][N] = adj[N][i] = 1;\\n\\n int L = 10;\\n\\n int V = 2 * (N + 1) * (N + 1) * L;\\n\\n auto tupleToInt = [&](int i, int j, int f, int l) {\\n int ret = 0;\\n ret *= N + 1, ret += i;\\n ret *= N + 1, ret += j;\\n ret *= 2, ret += f;\\n ret *= L, ret += l;\\n return ret;\\n };\\n\\n vector<vector<int>> es(V + 1);\\n vector<vector<ll>> weight(V + 1);\\n\\n rep(i, N + 1) rep(j, N + 1) rep(f, 2) rep(l, L) {\\n int u = tupleToInt(i, j, f, l);\\n if (f == 0) {\\n if (l > sz(S[i])) continue;\\n rep(k, N) {\\n if (!adj[k][j]) continue;\\n int m = sz(S[k]);\\n if (m <= l) {\\n string X = S[i];\\n reverse(all(X));\\n if (X.substr(l - m, m) != S[k]) continue;\\n int v = tupleToInt(i, k, 0, l - m);\\n es[u].eb(v);\\n weight[u].eb(m);\\n } else {\\n string X = S[i];\\n reverse(all(X));\\n if (X.substr(0, l) != S[k].substr(m - l, l)) continue;\\n int v = tupleToInt(i, k, 1, m - l);\\n es[u].eb(v);\\n weight[u].eb(l);\\n }\\n }\\n } else {\\n if (l > sz(S[j])) continue;\\n rep(k, N) {\\n if (!adj[i][k]) continue;\\n int m = sz(S[k]);\\n if (m < l) {\\n string X = S[k];\\n reverse(all(X));\\n if (S[j].substr(l - m, m) != X) continue;\\n int v = tupleToInt(k, j, 1, l - m);\\n es[u].eb(v);\\n weight[u].eb(m);\\n } else {\\n string X = S[k];\\n reverse(all(X));\\n if (S[j].substr(0, l) != X.substr(m - l, l)) continue;\\n int v = tupleToInt(k, j, 0, m - l);\\n es[u].eb(v);\\n weight[u].eb(l);\\n }\\n }\\n }\\n }\\n\\n auto comp = scc(es);\\n int K = sz(comp);\\n\\n vector<vector<pll>> dagEs(K);\\n vector<int> deg(K, 0);\\n rep(i, V + 1) {\\n int T = sz(es[i]);\\n assert(sz(weight[i]) == T);\\n rep(j, T) {\\n int u = comp[i], v = comp[es[i][j]];\\n if (u == v) continue;\\n ll w = weight[i][j];\\n dagEs[u].eb(v, w);\\n deg[v]++;\\n }\\n }\\n\\n vector<int> cnt(K, 0);\\n rep(i, V + 1) cnt[comp[i]]++;\\n\\n vector<ll> d(K, -INF);\\n queue<int> que;\\n d[comp[tupleToInt(N, N, 0, 0)]] = 0;\\n\\n rep(i, K) {\\n if (deg[i] == 0) que.emplace(i);\\n }\\n\\n while (!empty(que)) {\\n int i = que.front();\\n if (cnt[i] >= 2 && d[i] != -INF) d[i] = INF;\\n que.pop();\\n for (auto [j, w] : dagEs[i]) {\\n if (d[i] == INF) {\\n chmax(d[j], INF);\\n } else if (d[i] != -INF) {\\n chmax(d[j], d[i] + w);\\n }\\n if (--deg[j] == 0) que.emplace(j);\\n }\\n }\\n\\n ll ans = -INF;\\n\\n auto isPalindrome = [](string S) {\\n auto T = S;\\n reverse(all(T));\\n return S == T;\\n };\\n\\n rep(i, N + 1) rep(j, N + 1) rep(f, 2) rep(l, L) {\\n int v = comp[tupleToInt(i, j, f, l)];\\n // if (d[v] == 4) cout << i MM j MM f MM l << endl;\\n if (!adj[i][j]) continue;\\n\\n if (f == 0) {\\n if (l > sz(S[i])) continue;\\n if (isPalindrome(S[i].substr(sz(S[i]) - l, l))) {\\n chmax(ans, d[v] * 2 + l); //\\n }\\n } else {\\n if (l > sz(S[j])) continue;\\n if (isPalindrome(S[j].substr(0, l))) {\\n chmax(ans, d[v] * 2 + l); //\\n }\\n }\\n }\\n\\n cout << (ans >= INF ? -1 : ans) << '\\\\n';\\n}\",\n \"accuracy\": 0.15306122448979592,\n \"time_ms\": 90,\n \"memory_kb\": 31768,\n \"score_of_the_acc\": -0.2814,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2307_8416865\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// Normal Vaeiables\\nint N; string S[1009];\\nint M, X[1009], Y[1009];\\nbool Valid[109][109];\\n\\n// Dynamic Programming\\nint Time = -1;\\nint Last = -1;\\nint dp[109][109][2][19];\\ntuple<int, int, int, int> NexL[109][109][19];\\ntuple<int, int, int, int> NexR[109][109][19];\\npriority_queue<tuple<int, int, int, int, int>, vector<tuple<int, int, int, int, int>>, greater<tuple<int, int, int, int, int>>> Q;\\n\\nvoid Get_NexL(int new_, int old_, int nag) {\\n string str1 = S[new_]; reverse(str1.begin(), str1.end());\\n string str2 = S[old_].substr((int)S[old_].size() - nag, nag);\\n if (str1.size() < str2.size()) str2 = str2.substr(0, str1.size());\\n if (str1.size() > str2.size()) str1 = str1.substr(0, str2.size());\\n\\n // Invalid Case\\n if (str1 != str2) {\\n NexL[new_][old_][nag] = make_tuple(-1, -1, -1, -1);\\n return;\\n }\\n\\n // Valid Case\\n int Len1 = S[new_].size();\\n int Len2 = nag;\\n if (Len1 >= Len2) NexL[new_][old_][nag] = make_tuple(new_, old_, 0, Len1 - Len2);\\n if (Len1 < Len2) NexL[new_][old_][nag] = make_tuple(new_, old_, 1, Len2 - Len1);\\n}\\n\\nvoid Get_NexR(int old_, int new_, int nag) {\\n string str2 = S[old_].substr(0, nag); reverse(str2.begin(), str2.end());\\n string str1 = S[new_];\\n if (str1.size() < str2.size()) str2 = str2.substr(0, str1.size());\\n if (str1.size() > str2.size()) str1 = str1.substr(0, str2.size());\\n\\n // Invalid Case\\n if (str1 != str2) {\\n NexR[old_][new_][nag] = make_tuple(-1, -1, -1, -1);\\n return;\\n }\\n\\n // Valid Case\\n int Len1 = nag;\\n int Len2 = S[new_].size();\\n if (Len1 >= Len2) NexR[old_][new_][nag] = make_tuple(old_, new_, 0, Len1 - Len2);\\n if (Len1 < Len2) NexR[old_][new_][nag] = make_tuple(old_, new_, 1, Len2 - Len1);\\n}\\n\\nvoid Update(int pos1, int pos2, int typ, int nag) {\\n // Left is Longer\\n if (typ == 0) {\\n for (int i = 1; i <= N; i++) {\\n if (Valid[pos2][i] == false) continue;\\n if (NexR[pos1][i][nag] == make_tuple(-1, -1, -1, -1)) continue;\\n int nex1 = get<0>(NexR[pos1][i][nag]);\\n int nex2 = get<1>(NexR[pos1][i][nag]);\\n int nexT = get<2>(NexR[pos1][i][nag]);\\n int nexN = get<3>(NexR[pos1][i][nag]);\\n if (dp[nex1][nex2][nexT][nexN] < dp[pos1][pos2][typ][nag] + (int)S[i].size()) {\\n dp[nex1][nex2][nexT][nexN] = dp[pos1][pos2][typ][nag] + (int)S[i].size();\\n Q.push(make_tuple(dp[nex1][nex2][nexT][nexN], nex1, nex2, nexT, nexN));\\n if (nexN == 0) Last = clock() - Time;\\n }\\n }\\n }\\n\\n // Right is Longer\\n if (typ == 1) {\\n for (int i = 1; i <= N; i++) {\\n if (Valid[i][pos1] == false) continue;\\n if (NexL[i][pos2][nag] == make_tuple(-1, -1, -1, -1)) continue;\\n int nex1 = get<0>(NexL[i][pos2][nag]);\\n int nex2 = get<1>(NexL[i][pos2][nag]);\\n int nexT = get<2>(NexL[i][pos2][nag]);\\n int nexN = get<3>(NexL[i][pos2][nag]);\\n if (dp[nex1][nex2][nexT][nexN] < dp[pos1][pos2][typ][nag] + (int)S[i].size()) {\\n dp[nex1][nex2][nexT][nexN] = dp[pos1][pos2][typ][nag] + (int)S[i].size();\\n Q.push(make_tuple(dp[nex1][nex2][nexT][nexN], nex1, nex2, nexT, nexN));\\n if (nexN == 0) Last = clock() - Time;\\n }\\n }\\n }\\n}\\n\\nint main() {\\n // Step 1. Input\\n cin >> N >> M;\\n for (int i = 1; i <= N; i++) cin >> S[i];\\n for (int i = 1; i <= M; i++) cin >> X[i] >> Y[i];\\n for (int i = 1; i <= M; i++) Valid[X[i]][Y[i]] = true;\\n\\n // Step 2. DP Init 1\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) {\\n for (int k = 0; k < 2; k++) {\\n for (int l = 0; l <= 10; l++) dp[i][j][k][l] = -(1 << 30);\\n }\\n }\\n }\\n\\n // Step 3. DP Init 2\\n for (int i = 1; i <= N; i++) {\\n for (int j = 0; j <= (int)S[i].size(); j++) {\\n string str1 = S[i].substr(0, j); reverse(str1.begin(), str1.end());\\n string str2 = S[i].substr(j, S[i].size() - j);\\n if (str1.size() < str2.size()) str2 = str2.substr(0, str1.size());\\n if (str1.size() > str2.size()) str1 = str1.substr(0, str2.size());\\n if (str1 != str2) continue;\\n int Len1 = j;\\n int Len2 = S[i].size() - j;\\n int Type = (Len1 >= Len2 ? 0 : 1);\\n int Naga = abs(Len1 - Len2);\\n dp[i][i][Type][Naga] = S[i].size();\\n Q.push(make_tuple((int)S[i].size(), i, i, Type, Naga));\\n }\\n }\\n\\n // Step 3. DP Init 3\\n for (int i = 1; i <= N; i++) {\\n for (int j = 0; j <= (int)S[i].size() - 1; j++) {\\n string str1 = S[i].substr(0, j); reverse(str1.begin(), str1.end());\\n string str2 = S[i].substr(j + 1, S[i].size() - (j + 1));\\n if (str1.size() < str2.size()) str2 = str2.substr(0, str1.size());\\n if (str1.size() > str2.size()) str1 = str1.substr(0, str2.size());\\n if (str1 != str2) continue;\\n int Len1 = j;\\n int Len2 = S[i].size() - (j + 1);\\n int Type = (Len1 >= Len2 ? 0 : 1);\\n int Naga = abs(Len1 - Len2);\\n dp[i][i][Type][Naga] = S[i].size();\\n Q.push(make_tuple((int)S[i].size(), i, i, Type, Naga));\\n }\\n }\\n\\n\\n // Step 4. DP Init 3\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) {\\n for (int k = 0; k <= (int)S[j].size(); k++) Get_NexL(i, j, k);\\n for (int k = 0; k <= (int)S[i].size(); k++) Get_NexR(i, j, k);\\n }\\n }\\n\\n // Step 5. DP Start\\n Time = clock();\\n while (!Q.empty()) {\\n int curr = get<0>(Q.top());\\n int pos1 = get<1>(Q.top());\\n int pos2 = get<2>(Q.top());\\n int typ = get<3>(Q.top());\\n int nag = get<4>(Q.top()); Q.pop();\\n if (curr != dp[pos1][pos2][typ][nag]) continue;\\n\\n // Update\\n Update(pos1, pos2, typ, nag);\\n if (clock() - Time >= 45 * CLOCKS_PER_SEC / 10) break;\\n }\\n\\n // Step 6. Output\\n if (Last >= 30 * CLOCKS_PER_SEC / 10) cout << \\\"-1\\\" << endl;\\n else {\\n int Answer = 0;\\n for (int i = 1; i <= N; i++) {\\n for (int j = 1; j <= N; j++) {\\n Answer = max(Answer, dp[i][j][0][0]);\\n Answer = max(Answer, dp[i][j][1][0]);\\n }\\n }\\n cout << Answer << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4500,\n \"memory_kb\": 12304,\n \"score_of_the_acc\": -1.0549,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2307_7134603\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=210005,INF=1<<28;\\n\\nint V,cmp[MAX];\\nvector<int> G[MAX],rG[MAX],vs;//vsがトポソの逆順になってる\\nbool used[MAX];\\n\\nint get_id(int i,bool f){\\n return 2*i+f;\\n}\\n\\nvoid add_edge(int from,int to){\\n G[from].push_back(to);\\n rG[to].push_back(from);\\n}\\n\\nvoid either(int i,bool f,int j,bool g){\\n add_edge(get_id(i,!f),get_id(j,g));\\n add_edge(get_id(j,!g),get_id(i,f));\\n //add_edge(2*i+(!f),2*j+g);\\n //add_edge(2*j+(!g),2*i+f);\\n}\\n\\nvoid imply(int i,bool f,int j,bool g){\\n either(i,!f,j,g);\\n}\\n//iがfならばjがg\\n\\nvoid must(int i,bool f){\\n either(i,f,i,f);\\n}\\n\\nvoid DFS(int v){\\n used[v]=1;\\n for(int i=0;i<G[v].size();i++){\\n if(used[G[v][i]]==0) DFS(G[v][i]);\\n }\\n vs.push_back(v);\\n}\\n\\nvoid rDFS(int v,int k){\\n used[v]=1;\\n cmp[v]=k;\\n for(int i=0;i<rG[v].size();i++){\\n if(used[rG[v][i]]==0) rDFS(rG[v][i],k);\\n }\\n}\\n\\nint scc(){\\n memset(used,0,sizeof(used));\\n vs.clear();\\n for(int v=0;v<V;v++){\\n if(used[v]==0) DFS(v);\\n }\\n \\n memset(used,0,sizeof(used));\\n int k=0;\\n for(int i=vs.size()-1;i>=0;i--){\\n if(used[vs[i]]==0) rDFS(vs[i],k++);\\n }\\n return k;\\n}\\n\\nvoid init(int sz){\\n V=sz;\\n for(int i=0;i<V;i++){\\n cmp[i]=0;\\n G[i].clear();\\n rG[i].clear();\\n used[i]=false;\\n }\\n vs.clear();\\n}\\n\\nbool E[105][105];\\n\\nvector<pair<int,int>> sv[MAX],T[MAX];\\n\\nbool cycle[MAX];\\n\\nint dp[MAX];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n int N,M;cin>>N>>M;\\n auto idx=[&](int l,int r,bool left,int len){\\n int res=0;\\n res+=l*N*21;\\n res+=r*21;\\n if(len==0){\\n \\n }else if(left){\\n res+=len;\\n }else{\\n res+=10+len;\\n }\\n return res;\\n };\\n \\n vector<string> S(N);\\n for(int i=0;i<N;i++) cin>>S[i];\\n \\n for(int i=0;i<M;i++){\\n int a,b;cin>>a>>b;a--;b--;\\n E[a][b]=true;\\n }\\n \\n for(int l=0;l<N;l++){\\n for(int r=0;r<N;r++){\\n for(int lef=0;lef<2;lef++){\\n for(int len=0;len<=10;len++){\\n if(lef==0&&len==0) continue;\\n if(lef==1){\\n if(len>si(S[l])) continue;\\n }else{\\n if(len>si(S[r])) continue;\\n }\\n \\n int a=idx(l,r,lef,len);\\n \\n if(len==0){\\n for(int x=0;x<N;x++){\\n if(E[x][l]){\\n int b=idx(x,r,1,si(S[x]));\\n add_edge(a,b);\\n sv[a].push_back(mp(b,si(S[x])));\\n }\\n }\\n }else if(lef){\\n for(int x=0;x<N;x++){\\n if(E[r][x]){\\n bool ok=true;\\n for(int i=0;i<min(len,si(S[x]));i++){\\n ok&=(S[l][len-1-i]==S[x][i]);\\n }\\n if(ok){\\n if(len>=si(S[x])){\\n int b=idx(l,x,1,len-si(S[x]));\\n add_edge(a,b);\\n sv[a].push_back(mp(b,si(S[x])));\\n }else{\\n int b=idx(l,x,0,si(S[x])-len);\\n add_edge(a,b);\\n sv[a].push_back(mp(b,si(S[x])));\\n }\\n }\\n }\\n }\\n }else{\\n for(int x=0;x<N;x++){\\n if(E[x][l]){\\n bool ok=true;\\n for(int i=0;i<min(len,si(S[x]));i++){\\n ok&=(S[x][si(S[x])-1-i]==S[r][si(S[r])-len+i]);\\n }\\n if(ok){\\n if(len>si(S[x])){\\n int b=idx(x,r,0,len-si(S[x]));\\n add_edge(a,b);\\n sv[a].push_back(mp(b,si(S[x])));\\n }else{\\n int b=idx(x,r,1,si(S[x])-len);\\n add_edge(a,b);\\n sv[a].push_back(mp(b,si(S[x])));\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n }\\n int st=N*N*21;\\n for(int x=0;x<N;x++){\\n for(int k=0;k<=si(S[x]);k++){\\n bool ok=true;\\n for(int i=0;i<min(k,si(S[x])-k);i++){\\n ok&=(S[x][k-1-i]==S[x][k+i]);\\n }\\n if(ok){\\n int a=st;\\n if(k<=si(S[x])-k){\\n int b=idx(x,x,0,si(S[x])-k-k);\\n add_edge(a,b);\\n sv[a].push_back(mp(b,si(S[x])));\\n }else{\\n int b=idx(x,x,1,k-(si(S[x])-k));\\n add_edge(a,b);\\n sv[a].push_back(mp(b,si(S[x])));\\n }\\n }\\n }\\n for(int k=0;k<si(S[x]);k++){\\n bool ok=true;\\n for(int i=0;i<min(k,si(S[x])-1-k);i++){\\n ok&=(S[x][k-1-i]==S[x][k+1+i]);\\n }\\n if(ok){\\n int a=st;\\n if(k<=si(S[x])-1-k){\\n int b=idx(x,x,0,si(S[x])-1-k-k);\\n add_edge(a,b);\\n sv[a].push_back(mp(b,si(S[x])));\\n }else{\\n int b=idx(x,x,1,k-(si(S[x])-1-k));\\n add_edge(a,b);\\n sv[a].push_back(mp(b,si(S[x])));\\n }\\n }\\n }\\n }\\n V=st+1;\\n int K=scc();\\n vector<int> sz(K);\\n for(int i=0;i<=st;i++){\\n sz[cmp[i]]++;\\n }\\n \\n for(int i=0;i<K;i++){\\n if(sz[i]>=2) cycle[i]=true;\\n }\\n \\n for(int i=0;i<V;i++){\\n for(auto [j,len]:sv[i]){\\n if(cmp[i]!=cmp[j]){\\n assert(cmp[i]<cmp[j]);\\n T[cmp[i]].push_back(mp(cmp[j],len));\\n }\\n }\\n }\\n \\n for(int i=0;i<K;i++) dp[i]=-INF;\\n dp[cmp[st]]=0;\\n \\n for(int i=0;i<K;i++){\\n if(dp[i]>=0){\\n if(cycle[i]) dp[i]=INF;\\n \\n for(auto [j,len]:T[i]){\\n chmax(dp[j],dp[i]+len);\\n }\\n }\\n }\\n \\n int ans=-INF;\\n \\n for(int l=0;l<N;l++){\\n for(int r=0;r<N;r++){\\n int a=idx(l,r,0,0);\\n chmax(ans,dp[cmp[a]]);\\n }\\n }\\n \\n if(ans<0) cout<<0<<\\\"\\\\n\\\";\\n else if(ans>=INF) cout<<-1<<\\\"\\\\n\\\";\\n else cout<<ans<<\\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 40996,\n \"score_of_the_acc\": -0.3736,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2307_6024494\",\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 = 998244353;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 2;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\n\\nvector<string> s;\\nvector<vector<int>> G, rG;\\nvector<P> vp;\\nvector<int> ad;\\nbool e[100][100];\\n\\n\\nstruct graph {\\nprivate:\\n\\tint n;\\n\\tvector<bool> used;\\n\\tvector<int> vs;\\n\\n\\tint mk;\\n\\tvector<vector<int>> fG;\\n\\tvector<vector<int>> ori;\\n\\tvector<int> trans;\\npublic:\\n\\tgraph(int sz) {\\n\\t\\tn = sz;\\n\\t\\tused.resize(n);\\n\\n\\t\\tfG.resize(n);\\n\\t\\ttrans.resize(n, -1);\\n\\t\\tori.resize(n);\\n\\t}\\n\\tvoid dfs(int v) {\\n\\t\\tused[v] = true;\\n\\t\\tint i = v / vp.size();\\n\\t\\tint j = v % vp.size();\\n\\t\\tint id1 = vp[i].first;\\n\\t\\tint loc1 = vp[i].second;\\n\\t\\tint id2 = vp[j].first;\\n\\t\\tint loc2 = vp[j].second;\\n\\n\\t\\tif (loc1 > 0 && loc2 + 1 < s[id2].size()) {\\n\\t\\t\\tif (s[id1][loc1 - 1] == s[id2][loc2 + 1]) {\\n\\t\\t\\t\\tint to = (i - 1) * vp.size() + j + 1;\\n\\t\\t\\t\\tif (!used[to])dfs(to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if (loc1 > 0) {\\n\\t\\t\\tfor (int idto : G[id2]) {\\n\\t\\t\\t\\tif (s[id1][loc1 - 1] == s[idto][0]) {\\n\\t\\t\\t\\t\\tint to = (ad[id1] + loc1 - 1) * vp.size() + ad[idto] + 0;\\n\\n\\t\\t\\t\\t\\tif (!used[to])dfs(to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if (loc2 + 1 < s[id2].size()) {\\n\\t\\t\\tfor (int idto : rG[id1]) {\\n\\t\\t\\t\\tif (s[idto].back() == s[id2][loc2 + 1]) {\\n\\t\\t\\t\\t\\tint to = (ad[idto] + s[idto].size() - 1) * vp.size() + ad[id2] + loc2 + 1;\\n\\n\\t\\t\\t\\t\\tif (!used[to])dfs(to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tfor (int idto1 : rG[id1]) {\\n\\t\\t\\t\\tfor (int idto2 : G[id2]) {\\n\\t\\t\\t\\t\\tif (s[idto1].back() == s[idto2][0]) {\\n\\t\\t\\t\\t\\t\\tint to = (ad[idto1] + s[idto1].size() - 1) * vp.size() + ad[idto2] + 0;\\n\\n\\t\\t\\t\\t\\t\\tif (!used[to])dfs(to);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvs.push_back(v);\\n\\t}\\n\\tvoid rdfs(int v, int k) {\\n\\t\\tused[v] = true;\\n\\t\\tqueue<int> q; q.push(v);\\n\\t\\tvector<int> c;\\n\\t\\twhile (!q.empty()) {\\n\\t\\t\\tint id = q.front(); q.pop();\\n\\t\\t\\tori[k].push_back(id);\\n\\t\\t\\tint i = id % vp.size();\\n\\t\\t\\tint j = id / vp.size();\\n\\t\\t\\tint id1 = vp[i].first;\\n\\t\\t\\tint loc1 = vp[i].second;\\n\\t\\t\\tint id2 = vp[j].first;\\n\\t\\t\\tint loc2 = vp[j].second;\\n\\t\\t\\tif (s[id1][loc1] == s[id2][loc2]) {\\n\\t\\t\\t\\tif (loc1 > 0 && loc2 + 1 < s[id2].size()) {\\n\\t\\t\\t\\t\\t//if (s[id1][loc1 - 1] == s[id2][loc2 + 1]) {\\n\\t\\t\\t\\t\\tint to = (i - 1) + (j + 1) * vp.size();\\n\\t\\t\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\t\\t\\tif (trans[to] >= 0)c.push_back(trans[to]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\t\\t\\tq.push(to);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t//}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse if (loc1 > 0) {\\n\\t\\t\\t\\t\\tfor (int idto : G[id2]) {\\n\\t\\t\\t\\t\\t\\t//if (s[id1][loc1 - 1] == s[idto][0]) {\\n\\t\\t\\t\\t\\t\\tint to = (ad[id1] + loc1 - 1) + (ad[idto] + 0) * vp.size();\\n\\t\\t\\t\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\t\\t\\t\\tif (trans[to] >= 0)c.push_back(trans[to]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\t\\t\\t\\tq.push(to);\\n\\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\\telse if (loc2 + 1 < s[id2].size()) {\\n\\t\\t\\t\\t\\tfor (int idto : rG[id1]) {\\n\\t\\t\\t\\t\\t\\t//if (s[idto].back() == s[id2][loc2 + 1]) {\\n\\t\\t\\t\\t\\t\\tint to = (ad[idto] + s[idto].size() - 1) + (ad[id2] + loc2 + 1) * vp.size();\\n\\t\\t\\t\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\t\\t\\t\\tif (trans[to] >= 0)c.push_back(trans[to]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\t\\t\\t\\tq.push(to);\\n\\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\\telse {\\n\\t\\t\\t\\t\\tfor (int idto1 : rG[id1]) {\\n\\t\\t\\t\\t\\t\\tfor (int idto2 : G[id2]) {\\n\\t\\t\\t\\t\\t\\t\\t//if (s[idto1].back() == s[idto2][0]) {\\n\\t\\t\\t\\t\\t\\t\\tint to = (ad[idto1] + s[idto1].size() - 1) + (ad[idto2] + 0) * vp.size();\\n\\t\\t\\t\\t\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (trans[to] >= 0)c.push_back(trans[to]);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\t\\t\\t\\t\\tq.push(to);\\n\\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}\\n\\t\\t}\\n\\t\\tsort(c.begin(), c.end());\\n\\t\\tint len = unique(c.begin(), c.end()) - c.begin();\\n\\t\\trep(i, len) {\\n\\t\\t\\tfG[c[i]].push_back(k);\\n\\t\\t}\\n\\t\\trep(i, ori[k].size()) {\\n\\t\\t\\ttrans[ori[k][i]] = k;\\n\\t\\t}\\n\\t}\\n\\tvoid scc() {\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\trep(i, n) {\\n\\t\\t\\tif (!used[i])dfs(i);\\n\\t\\t}\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\tint k = 0;\\n\\t\\tper(i, (int)vs.size()) {\\n\\t\\t\\tif (!used[vs[i]]) {\\n\\t\\t\\t\\trdfs(vs[i], k); k++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmk = k;\\n\\t}\\n\\tint query(vector<P> ps) {\\n\\t\\tvector<int> lens(s.size());\\n\\t\\trep(i, s.size())lens[i] = s[i].size();\\n\\t\\tint m = lens.size();\\n\\t\\tvector<int> ad(m + 1);\\n\\t\\trep(i, m)ad[i + 1] = ad[i] + lens[i];\\n\\t\\tint sum = ad[m];\\n\\t\\tvector<bool> canfin(n);\\n\\t\\trep(i, m)rep(j, m) {\\n\\t\\t\\tint id = ad[i] * sum + ad[j] + lens[j] - 1;\\n\\t\\t\\tcanfin[id] = true;\\n\\t\\t}\\n\\t\\tvector<P> ans(mk);\\n\\t\\tper(i, mk) {\\n\\t\\t\\tbool exifin = false;\\n\\t\\t\\tfor (int id : ori[i]) {\\n\\t\\t\\t\\tif (canfin[id])exifin = true;\\n\\t\\t\\t}\\n\\t\\t\\tfor (int to : fG[i]) {\\n\\t\\t\\t\\tif (ans[to].second)exifin = true;\\n\\t\\t\\t}\\n\\t\\t\\tif (!exifin) {\\n\\t\\t\\t\\tans[i] = { 0,0 };\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tans[i].second = 1;\\n\\t\\t\\tint ma = 0;\\n\\t\\t\\tfor (int to : fG[i]) {\\n\\t\\t\\t\\tif (ans[to].second) {\\n\\t\\t\\t\\t\\tma = max(ma, ans[to].first + 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tans[i].first = ma;\\n\\t\\t\\tbool exiinf = false;\\n\\t\\t\\tif (ori[i].size() > 1)exiinf = true;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tint id = ori[i][0];\\n\\t\\t\\t\\tint id1 = id / vp.size();\\n\\t\\t\\t\\tint id2 = id % vp.size();\\n\\t\\t\\t\\tid1 = vp[id1].first;\\n\\t\\t\\t\\tid2 = vp[id2].first;\\n\\t\\t\\t\\tif (s[id1].size() == 1 && s[id2].size() == 1 && s[id1] == s[id2]&&e[id1][id1]&&e[id2][id2])exiinf = true;\\n\\t\\t\\t}\\n\\t\\t\\tif (exiinf)ans[i].first = mod;\\n\\t\\t}\\n\\t\\tint res = 0;\\n\\t\\t//odd\\n\\t\\trep(i, m)rep(j, lens[i]) {\\n\\t\\t\\tint cur = (ad[i] + j) * sum + ad[i] + j;\\n\\t\\t\\tcur = trans[cur];\\n\\t\\t\\tif (ans[cur].second) {\\n\\t\\t\\t\\tres = max(res, ans[cur].first + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//even\\n\\t\\trep(i, m)rep(j, lens[i] - 1) {\\n\\t\\t\\tif (s[i][j] == s[i][j + 1]) {\\n\\t\\t\\t\\tint cur = (ad[i] + j) * sum + ad[i] + j + 1;\\n\\t\\t\\t\\tcur = trans[cur];\\n\\t\\t\\t\\tif (ans[cur].second) {\\n\\t\\t\\t\\t\\tres = max(res, ans[cur].first + 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(P p:ps){\\n\\t\\t\\tint i = p.first, j = p.second;\\n\\t\\t\\tif (s[i].back() == s[j][0]) {\\n\\t\\t\\t\\tint cur = (ad[i] + lens[i] - 1) * sum + ad[j];\\n\\t\\t\\t\\tcur = trans[cur];\\n\\t\\t\\t\\tif (ans[cur].second) {\\n\\t\\t\\t\\t\\t//cout << \\\"? \\\"<<ori[cur].size()<<\\\" \\\"<<ori[cur][0] << \\\" \\\" << ans[cur].first << \\\"\\\\n\\\";\\n\\t\\t\\t\\t\\tres = max(res, ans[cur].first + 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (res >= mod)res = -1;\\n\\t\\treturn res;\\n\\t}\\n};\\n\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n\\nll gcd(ll x, ll y) {\\n\\tx = abs(x), y = abs(y);\\n\\tif (x < y)swap(x, y);\\n\\twhile (y) {\\n\\t\\tll r = x % y; x = y; y = r;\\n\\t}\\n\\treturn x;\\n}\\n\\nvoid solve() {\\n\\tint n, m; cin >> n >> m;\\n\\ts.resize(n);\\n\\trep(i, n)cin >> s[i];\\n\\tad.resize(n);\\n\\trep(i, n) {\\n\\t\\tad[i] = vp.size();\\n\\t\\trep(j, s[i].size())vp.push_back({ i,j });\\n\\t}\\n\\tG.resize(n);\\n\\trG.resize(n);\\n\\tvector<P> ps;\\n\\trep(i, m) {\\n\\t\\tint a, b; cin >> a >> b; a--; b--;\\n\\t\\tG[a].push_back(b);\\n\\t\\trG[b].push_back(a);\\n\\t\\te[a][b] = true;\\n\\t\\tps.push_back({ a,b });\\n\\t}\\n\\tgraph g(vp.size()*vp.size());\\n\\tg.scc();\\n\\tint ans = g.query(ps);\\n\\tcout << ans << \\\"\\\\n\\\";\\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//int t; cin >> t; rep(i, t)\\n\\t//while (cin >> n>>s,n)\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 100468,\n \"score_of_the_acc\": -1.0245,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2307_6024418\",\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 = 998244353;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-8;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 2;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\n\\nvector<string> s;\\nvector<vector<int>> G, rG;\\nvector<P> vp;\\nvector<int> ad;\\nbool e[100][100];\\n\\n\\nstruct graph {\\nprivate:\\n\\tint n;\\n\\tvector<bool> used;\\n\\tvector<int> vs;\\n\\n\\tint mk;\\n\\tvector<vector<int>> fG;\\n\\tvector<vector<int>> ori;\\n\\tvector<int> trans;\\npublic:\\n\\tgraph(int sz) {\\n\\t\\tn = sz;\\n\\t\\tused.resize(n);\\n\\n\\t\\tfG.resize(n);\\n\\t\\ttrans.resize(n, -1);\\n\\t\\tori.resize(n);\\n\\t}\\n\\tvoid dfs(int v) {\\n\\t\\tused[v] = true;\\n\\t\\tint i = v / vp.size();\\n\\t\\tint j = v % vp.size();\\n\\t\\tint id1 = vp[i].first;\\n\\t\\tint loc1 = vp[i].second;\\n\\t\\tint id2 = vp[j].first;\\n\\t\\tint loc2 = vp[j].second;\\n\\n\\t\\tint cur = i * vp.size() + j;\\n\\t\\tif (loc1 > 0 && loc2 + 1 < s[id2].size()) {\\n\\t\\t\\tif (s[id1][loc1 - 1] == s[id2][loc2 + 1]) {\\n\\t\\t\\t\\tint to = (i - 1) * vp.size() + j + 1;\\n\\t\\t\\t\\tif (!used[to])dfs(to);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if (loc1 > 0) {\\n\\t\\t\\tfor (int idto : G[id2]) {\\n\\t\\t\\t\\tif (s[id1][loc1 - 1] == s[idto][0]) {\\n\\t\\t\\t\\t\\tint to = (ad[id1] + loc1 - 1) * vp.size() + ad[idto] + 0;\\n\\n\\t\\t\\t\\t\\tif (!used[to])dfs(to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse if (loc2 + 1 < s[id2].size()) {\\n\\t\\t\\tfor (int idto : rG[id1]) {\\n\\t\\t\\t\\tif (s[idto].back() == s[id2][loc2 + 1]) {\\n\\t\\t\\t\\t\\tint to = (ad[idto] + s[idto].size() - 1) * vp.size() + ad[id2] + loc2 + 1;\\n\\n\\t\\t\\t\\t\\tif (!used[to])dfs(to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tfor (int idto1 : rG[id1]) {\\n\\t\\t\\t\\tfor (int idto2 : G[id2]) {\\n\\t\\t\\t\\t\\tif (s[idto1].back() == s[idto2][0]) {\\n\\t\\t\\t\\t\\t\\tint to = (ad[idto1] + s[idto1].size() - 1) * vp.size() + ad[idto2] + 0;\\n\\n\\t\\t\\t\\t\\t\\tif (!used[to])dfs(to);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvs.push_back(v);\\n\\t}\\n\\tvoid rdfs(int v, int k) {\\n\\t\\tused[v] = true;\\n\\t\\tqueue<int> q; q.push(v);\\n\\t\\tvector<int> c;\\n\\t\\twhile (!q.empty()) {\\n\\t\\t\\tint id = q.front(); q.pop();\\n\\t\\t\\tori[k].push_back(id);\\n\\t\\t\\tint i = id % vp.size();\\n\\t\\t\\tint j = id / vp.size();\\n\\t\\t\\tint id1 = vp[i].first;\\n\\t\\t\\tint loc1 = vp[i].second;\\n\\t\\t\\tint id2 = vp[j].first;\\n\\t\\t\\tint loc2 = vp[j].second;\\n\\n\\t\\t\\tint cur = i * vp.size() + j;\\n\\t\\t\\tif (loc1 > 0 && loc2 + 1 < s[id2].size()) {\\n\\t\\t\\t\\tif (s[id1][loc1 - 1] == s[id2][loc2 + 1]) {\\n\\t\\t\\t\\t\\tint to = (i - 1) + (j + 1) * vp.size();\\n\\t\\t\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\t\\t\\tif (trans[to] >= 0)c.push_back(trans[to]);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\t\\t\\tq.push(to);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if (loc1 > 0) {\\n\\t\\t\\t\\tfor (int idto : G[id2]) {\\n\\t\\t\\t\\t\\tif (s[id1][loc1 - 1] == s[idto][0]) {\\n\\t\\t\\t\\t\\t\\tint to = (ad[id1] + loc1 - 1) + (ad[idto] + 0) * vp.size();\\n\\t\\t\\t\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\t\\t\\t\\tif (trans[to] >= 0)c.push_back(trans[to]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\t\\t\\t\\tq.push(to);\\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\\telse if (loc2 + 1 < s[id2].size()) {\\n\\t\\t\\t\\tfor (int idto : rG[id1]) {\\n\\t\\t\\t\\t\\tif (s[idto].back() == s[id2][loc2 + 1]) {\\n\\t\\t\\t\\t\\t\\tint to = (ad[idto] + s[idto].size() - 1) + (ad[id2] + loc2 + 1)*vp.size();\\n\\t\\t\\t\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\t\\t\\t\\tif (trans[to] >= 0)c.push_back(trans[to]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\t\\t\\t\\tq.push(to);\\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\\telse {\\n\\t\\t\\t\\tfor (int idto1 : rG[id1]) {\\n\\t\\t\\t\\t\\tfor (int idto2 : G[id2]) {\\n\\t\\t\\t\\t\\t\\tif (s[idto1].back() == s[idto2][0]) {\\n\\t\\t\\t\\t\\t\\t\\tint to = (ad[idto1] + s[idto1].size() - 1) + (ad[idto2] + 0)*vp.size();\\n\\t\\t\\t\\t\\t\\t\\tif (used[to]) {\\n\\t\\t\\t\\t\\t\\t\\t\\tif (trans[to] >= 0)c.push_back(trans[to]);\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\t\\t\\tused[to] = true;\\n\\t\\t\\t\\t\\t\\t\\t\\tq.push(to);\\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\\tsort(c.begin(), c.end());\\n\\t\\tint len = unique(c.begin(), c.end()) - c.begin();\\n\\t\\trep(i, len) {\\n\\t\\t\\tfG[c[i]].push_back(k);\\n\\t\\t}\\n\\t\\trep(i, ori[k].size()) {\\n\\t\\t\\ttrans[ori[k][i]] = k;\\n\\t\\t}\\n\\t}\\n\\tvoid scc() {\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\trep(i, n) {\\n\\t\\t\\tif (!used[i])dfs(i);\\n\\t\\t}\\n\\t\\tfill(used.begin(), used.end(), false);\\n\\t\\tint k = 0;\\n\\t\\tper(i, (int)vs.size()) {\\n\\t\\t\\tif (!used[vs[i]]) {\\n\\t\\t\\t\\trdfs(vs[i], k); k++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmk = k;\\n\\t}\\n\\tint query(vector<P> ps) {\\n\\t\\tvector<int> lens(s.size());\\n\\t\\trep(i, s.size())lens[i] = s[i].size();\\n\\t\\tint m = lens.size();\\n\\t\\tvector<int> ad(m + 1);\\n\\t\\trep(i, m)ad[i + 1] = ad[i] + lens[i];\\n\\t\\tint sum = ad[m];\\n\\t\\tvector<bool> canfin(n);\\n\\t\\trep(i, m)rep(j, m) {\\n\\t\\t\\tint id = ad[i] * sum + ad[j] + lens[j] - 1;\\n\\t\\t\\tcanfin[id] = true;\\n\\t\\t}\\n\\t\\tvector<P> ans(mk);\\n\\t\\tper(i, mk) {\\n\\t\\t\\tbool exifin = false;\\n\\t\\t\\tfor (int id : ori[i]) {\\n\\t\\t\\t\\tif (canfin[id])exifin = true;\\n\\t\\t\\t}\\n\\t\\t\\tfor (int to : fG[i]) {\\n\\t\\t\\t\\tif (ans[to].second)exifin = true;\\n\\t\\t\\t}\\n\\t\\t\\tif (!exifin) {\\n\\t\\t\\t\\tans[i] = { 0,0 };\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\tans[i].second = 1;\\n\\t\\t\\tint ma = 0;\\n\\t\\t\\tfor (int to : fG[i]) {\\n\\t\\t\\t\\tif (ans[to].second) {\\n\\t\\t\\t\\t\\tma = max(ma, ans[to].first + 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tans[i].first = ma;\\n\\t\\t\\tbool exiinf = false;\\n\\t\\t\\tif (ori[i].size() > 1)exiinf = true;\\n\\t\\t\\telse {\\n\\t\\t\\t\\tint id = ori[i][0];\\n\\t\\t\\t\\tint id1 = id / vp.size();\\n\\t\\t\\t\\tint id2 = id % vp.size();\\n\\t\\t\\t\\tid1 = vp[id1].first;\\n\\t\\t\\t\\tid2 = vp[id2].first;\\n\\t\\t\\t\\tif (s[id1].size() == 1 && s[id2].size() == 1 && s[id1] == s[id2]&&e[id1][id1]&&e[id2][id2])exiinf = true;\\n\\t\\t\\t}\\n\\t\\t\\tif (exiinf)ans[i].first = mod;\\n\\t\\t}\\n\\t\\tint res = 0;\\n\\t\\t//odd\\n\\t\\trep(i, m)rep(j, lens[i]) {\\n\\t\\t\\tint cur = (ad[i] + j) * sum + ad[i] + j;\\n\\t\\t\\tcur = trans[cur];\\n\\t\\t\\tif (ans[cur].second) {\\n\\t\\t\\t\\tres = max(res, ans[cur].first + 1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//even\\n\\t\\trep(i, m)rep(j, lens[i] - 1) {\\n\\t\\t\\tif (s[i][j] == s[i][j + 1]) {\\n\\t\\t\\t\\tint cur = (ad[i] + j) * sum + ad[i] + j + 1;\\n\\t\\t\\t\\tcur = trans[cur];\\n\\t\\t\\t\\tif (ans[cur].second) {\\n\\t\\t\\t\\t\\tres = max(res, ans[cur].first + 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor(P p:ps){\\n\\t\\t\\tint i = p.first, j = p.second;\\n\\t\\t\\tif (s[i].back() == s[j][0]) {\\n\\t\\t\\t\\tint cur = (ad[i] + lens[i] - 1) * sum + ad[j];\\n\\t\\t\\t\\tcur = trans[cur];\\n\\t\\t\\t\\tif (ans[cur].second) {\\n\\t\\t\\t\\t\\t//cout << \\\"? \\\"<<ori[cur].size()<<\\\" \\\"<<ori[cur][0] << \\\" \\\" << ans[cur].first << \\\"\\\\n\\\";\\n\\t\\t\\t\\t\\tres = max(res, ans[cur].first + 2);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (res >= mod)res = -1;\\n\\t\\treturn res;\\n\\t}\\n};\\n\\nint dx[4] = { 1,0,-1,0 };\\nint dy[4] = { 0,1,0,-1 };\\n\\nll gcd(ll x, ll y) {\\n\\tx = abs(x), y = abs(y);\\n\\tif (x < y)swap(x, y);\\n\\twhile (y) {\\n\\t\\tll r = x % y; x = y; y = r;\\n\\t}\\n\\treturn x;\\n}\\n\\nvoid solve() {\\n\\tint n, m; cin >> n >> m;\\n\\ts.resize(n);\\n\\trep(i, n)cin >> s[i];\\n\\tad.resize(n);\\n\\trep(i, n) {\\n\\t\\tad[i] = vp.size();\\n\\t\\trep(j, s[i].size())vp.push_back({ i,j });\\n\\t}\\n\\tG.resize(n);\\n\\trG.resize(n);\\n\\tvector<P> ps;\\n\\trep(i, m) {\\n\\t\\tint a, b; cin >> a >> b; a--; b--;\\n\\t\\tG[a].push_back(b);\\n\\t\\trG[b].push_back(a);\\n\\t\\te[a][b] = true;\\n\\t\\tps.push_back({ a,b });\\n\\t}\\n\\tgraph g(vp.size()*vp.size());\\n\\tg.scc();\\n\\tint ans = g.query(ps);\\n\\tcout << ans << \\\"\\\\n\\\";\\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//int t; cin >> t; rep(i, t)\\n\\t//while (cin >> n>>s,n)\\n\\t\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.2653061224489796,\n \"time_ms\": 120,\n \"memory_kb\": 98532,\n \"score_of_the_acc\": -1.0037,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2307_5846904\",\n \"code_snippet\": \"#line 2 \\\"/Users/nok0/Documents/Programming/nok0/graph/graph.hpp\\\"\\n#include <algorithm>\\n#include <cassert>\\n#include <deque>\\n#include <iostream>\\n#include <queue>\\n#include <tuple>\\n#include <utility>\\n#include <vector>\\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\\ttemplate <class F>\\n\\tstruct rec_lambda {\\n\\t\\tF f;\\n\\t\\trec_lambda(F &&f_) : f(std::forward<F>(f_)) {}\\n\\t\\ttemplate <class... Args>\\n\\t\\tauto operator()(Args &&... args) const {\\n\\t\\t\\treturn f(*this, std::forward<Args>(args)...);\\n\\t\\t}\\n\\t};\\n\\npublic:\\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() { // 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\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\trec_lambda([&](auto &&dfs, int k) -> void {\\n\\t\\t\\t\\tif(not_DAG) return;\\n\\t\\t\\t\\tif(used[k]) {\\n\\t\\t\\t\\t\\tif(used[k] == 1) not_DAG = true;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tused[k] = 1;\\n\\t\\t\\t\\tfor(auto &e : edges[k]) dfs(e.to);\\n\\t\\t\\t\\tused[k] = 2;\\n\\t\\t\\t\\tres.push_back(k);\\n\\t\\t\\t})(i);\\n\\t\\t}\\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\\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] == -1 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() { // 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// Ο(V+E)\\n\\t// return {s, v1, v2, ... t}\\n\\tstd::vector<int> diameter_path() {\\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\\tauto vec2 = bfs(v1);\\n\\t\\tdia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec2[i]) dia = vec2[i], v2 = i;\\n\\t\\tvec = bfs(v2);\\n\\t\\tstd::vector<int> ret;\\n\\t\\tauto dfs = [&](auto self, int now, int p) -> void {\\n\\t\\t\\tret.emplace_back(now);\\n\\t\\t\\tif(now == v2) return;\\n\\t\\t\\tfor(auto &[to, cost] : (*this)[now]) {\\n\\t\\t\\t\\tif(vec[to] + vec2[to] == dia and to != p)\\n\\t\\t\\t\\t\\tself(self, to, now);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tdfs(dfs, v1, -1);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\t// return subtree_size, root = root\\n\\tstd::vector<int> subtree_size(const int root) {\\n\\t\\tint n = size();\\n\\t\\tstd::vector<int> ret(n, 1);\\n\\t\\trec_lambda([&](auto &&dfs, int now, int p) -> void {\\n\\t\\t\\tfor(auto &[to, cost] : (*this)[now]) {\\n\\t\\t\\t\\tif(to == p) continue;\\n\\t\\t\\t\\tdfs(to, now);\\n\\t\\t\\t\\tret[now] += ret[to];\\n\\t\\t\\t}\\n\\t\\t})(root, -1);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\t// Ο(ElogV)\\n\\tlong long prim() { // 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#line 3 \\\"/Users/nok0/Documents/Programming/nok0/graph/scc.hpp\\\"\\n\\nstruct strongly_connected_components {\\nprivate:\\n\\tenum { CHECKED = -1,\\n\\t\\t 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\\npublic:\\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 : 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#line 1 \\\"/Users/nok0/Documents/Programming/nok0/template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\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}\\n#if __has_include(<atcoder/all>)\\nstd::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\ntemplate <int m>\\nstd::istream &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 &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\n#endif\\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}\\n#if __has_include(<atcoder/all>)\\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }\\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\\n#endif\\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}\\ntemplate <class T>\\nvoid MUL(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v *= x;\\n}\\ntemplate <class T>\\nvoid DIV(std::vector<T> &a, const T x) {\\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}\\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}\\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 4 \\\"h.cpp\\\"\\n\\nconst int MAX_LEN_P = 11;\\nvoid main_() {\\n\\t//input\\n\\tINT(n, m);\\n\\tVEC(string, s, n);\\n\\tvector adj(n, vector(n, false));\\n\\tREP(i, m) {\\n\\t\\tINT(x, y);\\n\\t\\tadj[--x][--y] = true;\\n\\t}\\n\\n\\tint N = n * n * MAX_LEN_P * 2;\\n\\tGraph g(N);\\n\\t//一番左がword l , 一番右がword r, 左がlen文字余ってる\\n\\tauto left_id = [&](int l, int r, int len) {\\n\\t\\treturn l * n * MAX_LEN_P + r * MAX_LEN_P + len;\\n\\t};\\n\\tauto right_id = [&](int l, int r, int len) {\\n\\t\\treturn n * n * MAX_LEN_P + l * n * MAX_LEN_P + r * MAX_LEN_P + len;\\n\\t};\\n\\n\\tmap<pii, int> mp;\\n\\n\\t//aaba -> aabaabc\\n\\t//左が余っている場合->右を追加する\\n\\tREP(l, n) {\\n\\t\\tREP(len, SZ(s[l]) + 1) {\\n\\t\\t\\tauto amari = s[l].substr(0, len);\\n\\t\\t\\treverse(all(amari));\\n\\t\\t\\tREP(r, n) {\\n\\t\\t\\t\\tREP(len2, SZ(s[r]) + 1) {\\n\\t\\t\\t\\t\\tauto kesu = s[r].substr(0, len2);\\n\\t\\t\\t\\t\\tif(amari != kesu) continue;\\n\\t\\t\\t\\t\\tREP(r2, n) {\\n\\t\\t\\t\\t\\t\\tif(!adj[r2][r]) continue;\\n\\t\\t\\t\\t\\t\\tint u = left_id(l, r2, len);\\n\\t\\t\\t\\t\\t\\tint v = right_id(l, r, SZ(s[r]) - len2);\\n\\t\\t\\t\\t\\t\\tg.add_edge(u, v, SZ(s[r]), 1);\\n\\t\\t\\t\\t\\t\\tchmax(mp[{u, v}], SZ(s[r]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//右が余っている場合\\n\\tREP(r, n) {\\n\\t\\tREP(len, SZ(s[r]) + 1) {\\n\\t\\t\\tauto amari = s[r].substr(SZ(s[r]) - len);\\n\\t\\t\\treverse(all(amari));\\n\\t\\t\\tREP(l, n) {\\n\\t\\t\\t\\tREP(len2, SZ(s[l]) + 1) {\\n\\t\\t\\t\\t\\tauto kesu = s[l].substr(SZ(s[l]) - len2);\\n\\t\\t\\t\\t\\tif(amari != kesu) continue;\\n\\t\\t\\t\\t\\tREP(l2, n) {\\n\\t\\t\\t\\t\\t\\tif(!adj[l][l2]) continue;\\n\\t\\t\\t\\t\\t\\tint u = right_id(l2, r, len);\\n\\t\\t\\t\\t\\t\\tint v = left_id(l, r, SZ(s[l]) - len2);\\n\\t\\t\\t\\t\\t\\tg.add_edge(u, v, SZ(s[l]), 1);\\n\\t\\t\\t\\t\\t\\tchmax(mp[{u, v}], SZ(s[l]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//左が余ってる->右追加する->やっぱり左余る\\n\\tREP(l, n) {\\n\\t\\tREP(len, SZ(s[l]) + 1) {\\n\\t\\t\\tREP(r, n) {\\n\\t\\t\\t\\tif(len < SZ(s[r])) continue;\\n\\t\\t\\t\\tint len2 = SZ(s[r]);\\n\\t\\t\\t\\tstring lef = s[l].substr(len - len2, len2);\\n\\t\\t\\t\\treverse(all(lef));\\n\\t\\t\\t\\tif(lef == s[r]) {\\n\\t\\t\\t\\t\\tREP(r2, n) {\\n\\t\\t\\t\\t\\t\\tif(!adj[r2][r]) continue;\\n\\t\\t\\t\\t\\t\\tint u = left_id(l, r2, len);\\n\\t\\t\\t\\t\\t\\tint v = left_id(l, r, len - len2);\\n\\t\\t\\t\\t\\t\\tg.add_edge(u, v, SZ(s[r]), 1);\\n\\t\\t\\t\\t\\t\\tchmax(mp[{u, v}], SZ(s[r]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//右が余ってる->左追加する->やっぱり右余る\\n\\tREP(r, n) {\\n\\t\\tREP(len, SZ(s[r]) + 1) {\\n\\t\\t\\tREP(l, n) {\\n\\t\\t\\t\\tif(len < SZ(s[l])) continue;\\n\\t\\t\\t\\tint len2 = SZ(s[l]);\\n\\t\\t\\t\\tstring rig = s[r].substr(SZ(s[r]) - len, len2);\\n\\t\\t\\t\\treverse(all(rig));\\n\\t\\t\\t\\tif(rig == s[l]) {\\n\\t\\t\\t\\t\\tREP(l2, n) {\\n\\t\\t\\t\\t\\t\\tif(!adj[l][l2]) continue;\\n\\t\\t\\t\\t\\t\\tint u = right_id(l2, r, len);\\n\\t\\t\\t\\t\\t\\tint v = right_id(l, r, len - len2);\\n\\t\\t\\t\\t\\t\\tg.add_edge(u, v, SZ(s[l]), 1);\\n\\t\\t\\t\\t\\t\\tchmax(mp[{u, v}], SZ(s[l]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tstrongly_connected_components scc(g, 1);\\n\\tauto &h = scc.graph_compressed;\\n\\n\\tN = SZ(h);\\n\\n\\tvector dp(N, -inf);\\n\\tvector vis(N, false);\\n\\n\\tREP(i, n) {\\n\\t\\t//左を余らせる場合\\n\\t\\tREP(len, SZ(s[i]) + 1) {\\n\\t\\t\\tstring lef = s[i].substr(len);\\n\\t\\t\\tstring rig = lef;\\n\\t\\t\\treverse(all(rig));\\n\\t\\t\\tif(lef == rig) {\\n\\t\\t\\t\\tdp[scc[left_id(i, i, len)]] = SZ(s[i]);\\n\\t\\t\\t\\tvis[scc[left_id(i, i, len)]] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//右を余らせる場合\\n\\t\\tREP(len, SZ(s[i]) + 1) {\\n\\t\\t\\tstring lef = s[i].substr(0, SZ(s[i]) - len);\\n\\t\\t\\tstring rig = lef;\\n\\t\\t\\treverse(all(rig));\\n\\t\\t\\tif(lef == rig) {\\n\\t\\t\\t\\tdp[scc[right_id(i, i, len)]] = SZ(s[i]);\\n\\t\\t\\t\\tvis[scc[right_id(i, i, len)]] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tauto &groups = scc.groups;\\n\\t//debug(groups);\\n\\n\\tREP(i, N) {\\n\\t\\tif(SZ(groups[i]) != 1) dp[i] = inf;\\n\\t}\\n\\n\\tauto tsort = h.topological_sort();\\n\\n\\tfoa(idx, tsort) {\\n\\t\\tif(!vis[idx]) continue;\\n\\t\\tfor(auto [to, cost] : h[idx]) {\\n\\t\\t\\tvis[to] = true;\\n\\t\\t\\tchmax(dp[to], dp[idx] + mp[{groups[idx][0], groups[to][0]}]);\\n\\t\\t}\\n\\t}\\n\\n\\tint res = 0;\\n\\tREP(i, n) {\\n\\t\\tREP(j, n) {\\n\\t\\t\\tint lid = scc[left_id(i, j, 0)];\\n\\t\\t\\tif(vis[lid]) {\\n\\t\\t\\t\\tchmax(res, dp[lid]);\\n\\t\\t\\t}\\n\\t\\t\\tint rid = scc[right_id(i, j, 0)];\\n\\t\\t\\tif(vis[rid]) {\\n\\t\\t\\t\\tchmax(res, dp[rid]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprint(res >= inf ? -1 : res);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 87896,\n \"score_of_the_acc\": -0.9053,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2307_5846516\",\n \"code_snippet\": \"#line 2 \\\"/Users/nok0/Documents/Programming/nok0/graph/graph.hpp\\\"\\n#include <algorithm>\\n#include <cassert>\\n#include <deque>\\n#include <iostream>\\n#include <queue>\\n#include <tuple>\\n#include <utility>\\n#include <vector>\\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\\ttemplate <class F>\\n\\tstruct rec_lambda {\\n\\t\\tF f;\\n\\t\\trec_lambda(F &&f_) : f(std::forward<F>(f_)) {}\\n\\t\\ttemplate <class... Args>\\n\\t\\tauto operator()(Args &&... args) const {\\n\\t\\t\\treturn f(*this, std::forward<Args>(args)...);\\n\\t\\t}\\n\\t};\\n\\npublic:\\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() { // 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\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\trec_lambda([&](auto &&dfs, int k) -> void {\\n\\t\\t\\t\\tif(not_DAG) return;\\n\\t\\t\\t\\tif(used[k]) {\\n\\t\\t\\t\\t\\tif(used[k] == 1) not_DAG = true;\\n\\t\\t\\t\\t\\treturn;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tused[k] = 1;\\n\\t\\t\\t\\tfor(auto &e : edges[k]) dfs(e.to);\\n\\t\\t\\t\\tused[k] = 2;\\n\\t\\t\\t\\tres.push_back(k);\\n\\t\\t\\t})(i);\\n\\t\\t}\\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\\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] == -1 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() { // 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// Ο(V+E)\\n\\t// return {s, v1, v2, ... t}\\n\\tstd::vector<int> diameter_path() {\\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\\tauto vec2 = bfs(v1);\\n\\t\\tdia = -1;\\n\\t\\tfor(int i = 0; i < int(size()); i++)\\n\\t\\t\\tif(dia < vec2[i]) dia = vec2[i], v2 = i;\\n\\t\\tvec = bfs(v2);\\n\\t\\tstd::vector<int> ret;\\n\\t\\tauto dfs = [&](auto self, int now, int p) -> void {\\n\\t\\t\\tret.emplace_back(now);\\n\\t\\t\\tif(now == v2) return;\\n\\t\\t\\tfor(auto &[to, cost] : (*this)[now]) {\\n\\t\\t\\t\\tif(vec[to] + vec2[to] == dia and to != p)\\n\\t\\t\\t\\t\\tself(self, to, now);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\tdfs(dfs, v1, -1);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\t// Ο(V+E)\\n\\t// return subtree_size, root = root\\n\\tstd::vector<int> subtree_size(const int root) {\\n\\t\\tint n = size();\\n\\t\\tstd::vector<int> ret(n, 1);\\n\\t\\trec_lambda([&](auto &&dfs, int now, int p) -> void {\\n\\t\\t\\tfor(auto &[to, cost] : (*this)[now]) {\\n\\t\\t\\t\\tif(to == p) continue;\\n\\t\\t\\t\\tdfs(to, now);\\n\\t\\t\\t\\tret[now] += ret[to];\\n\\t\\t\\t}\\n\\t\\t})(root, -1);\\n\\t\\treturn ret;\\n\\t}\\n\\n\\t// Ο(ElogV)\\n\\tlong long prim() { // 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#line 3 \\\"/Users/nok0/Documents/Programming/nok0/graph/scc.hpp\\\"\\n\\nstruct strongly_connected_components {\\nprivate:\\n\\tenum { CHECKED = -1,\\n\\t\\t 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\\npublic:\\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 : 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#line 1 \\\"/Users/nok0/Documents/Programming/nok0/template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\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}\\n#if __has_include(<atcoder/all>)\\nstd::istream &operator>>(std::istream &is, atcoder::modint998244353 &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\nstd::istream &operator>>(std::istream &is, atcoder::modint1000000007 &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\ntemplate <int m>\\nstd::istream &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 &operator>>(std::istream &is, atcoder::dynamic_modint<m> &a) {\\n\\tlong long v;\\n\\tis >> v;\\n\\ta = v;\\n\\treturn is;\\n}\\n#endif\\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}\\n#if __has_include(<atcoder/all>)\\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint998244353 &a) { return os << a.val(); }\\nstd::ostream &operator<<(std::ostream &os, const atcoder::modint1000000007 &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &operator<<(std::ostream &os, const atcoder::static_modint<m> &a) { return os << a.val(); }\\ntemplate <int m>\\nstd::ostream &operator<<(std::ostream &os, const atcoder::dynamic_modint<m> &a) { return os << a.val(); }\\n#endif\\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}\\ntemplate <class T>\\nvoid MUL(std::vector<T> &a, const T x) {\\n\\tfor(auto &v : a) v *= x;\\n}\\ntemplate <class T>\\nvoid DIV(std::vector<T> &a, const T x) {\\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}\\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}\\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 4 \\\"h.cpp\\\"\\n\\nconst int MAX_LEN_P = 11;\\nvoid main_() {\\n\\tINT(n, m);\\n\\tVEC(string, s, n);\\n\\tvector adj(n, vector(n, false));\\n\\tREP(i, m) {\\n\\t\\tINT(x, y);\\n\\t\\tadj[--x][--y] = true;\\n\\t}\\n\\tint N = n * n * MAX_LEN_P * 2;\\n\\tGraph g(N);\\n\\tauto left_id = [&](int l, int r, int len) {\\n\\t\\treturn l * n * MAX_LEN_P + r * MAX_LEN_P + len;\\n\\t};\\n\\tauto right_id = [&](int l, int r, int len) {\\n\\t\\treturn n * n * MAX_LEN_P + l * n * MAX_LEN_P + r * MAX_LEN_P + len;\\n\\t};\\n\\n\\tmap<pii, int> mp;\\n\\n\\t//左が余っている場合\\n\\tREP(l, n) {\\n\\t\\tREP(len, SZ(s[l]) + 1) {\\n\\t\\t\\tauto amari = s[l].substr(0, len);\\n\\t\\t\\treverse(all(amari));\\n\\t\\t\\tREP(r, n) {\\n\\t\\t\\t\\tREP(len2, SZ(s[r]) + 1) {\\n\\t\\t\\t\\t\\tauto kesu = s[r].substr(0, len2);\\n\\t\\t\\t\\t\\tif(amari != kesu) continue;\\n\\t\\t\\t\\t\\tREP(r2, n) {\\n\\t\\t\\t\\t\\t\\tif(!adj[r2][r]) continue;\\n\\t\\t\\t\\t\\t\\tint u = left_id(l, r2, len);\\n\\t\\t\\t\\t\\t\\tint v = right_id(l, r, SZ(s[r]) - len2);\\n\\t\\t\\t\\t\\t\\tg.add_edge(u, v, SZ(s[r]), 1);\\n\\t\\t\\t\\t\\t\\tchmax(mp[{u, v}], SZ(s[r]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//右が余る場合\\n\\tREP(r, n) {\\n\\t\\tREP(len, SZ(s[r]) + 1) {\\n\\t\\t\\tauto amari = s[r].substr(SZ(s[r]) - len);\\n\\t\\t\\treverse(all(amari));\\n\\t\\t\\tREP(l, n) {\\n\\t\\t\\t\\tREP(len2, SZ(s[l]) + 1) {\\n\\t\\t\\t\\t\\tauto kesu = s[l].substr(SZ(s[l]) - len2);\\n\\t\\t\\t\\t\\tif(amari != kesu) continue;\\n\\t\\t\\t\\t\\tREP(l2, n) {\\n\\t\\t\\t\\t\\t\\tif(!adj[l][l2]) continue;\\n\\t\\t\\t\\t\\t\\tint u = right_id(l2, r, len);\\n\\t\\t\\t\\t\\t\\tint v = left_id(l, r, SZ(s[l]) - len2);\\n\\t\\t\\t\\t\\t\\tg.add_edge(u, v, SZ(s[l]), 1);\\n\\t\\t\\t\\t\\t\\tchmax(mp[{u, v}], SZ(s[l]));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tstrongly_connected_components scc(g, 1);\\n\\tauto &h = scc.graph_compressed;\\n\\n\\tN = SZ(h);\\n\\n\\tvector dp(N, -inf);\\n\\tvector vis(N, false);\\n\\n\\tREP(i, n) {\\n\\t\\t//左を余らせる場合\\n\\t\\tREP(len, SZ(s[i]) + 1) {\\n\\t\\t\\tstring lef = s[i].substr(len);\\n\\t\\t\\tstring rig = lef;\\n\\t\\t\\treverse(all(rig));\\n\\t\\t\\tif(lef == rig) {\\n\\t\\t\\t\\tdp[scc[left_id(i, i, len)]] = SZ(s[i]);\\n\\t\\t\\t\\tvis[scc[left_id(i, i, len)]] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\t//右を余らせる場合\\n\\t\\tREP(len, SZ(s[i]) + 1) {\\n\\t\\t\\tstring lef = s[i].substr(0, SZ(s[i]) - len);\\n\\t\\t\\tstring rig = lef;\\n\\t\\t\\treverse(all(rig));\\n\\t\\t\\tif(lef == rig) {\\n\\t\\t\\t\\tdp[scc[right_id(i, i, len)]] = SZ(s[i]);\\n\\t\\t\\t\\tvis[scc[right_id(i, i, len)]] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tauto &groups = scc.groups;\\n\\t//debug(groups);\\n\\n\\tREP(i, N) {\\n\\t\\tif(SZ(groups[i]) != 1) dp[i] = inf;\\n\\t}\\n\\n\\tdebug(dp);\\n\\n\\tauto tsort = h.topological_sort();\\n\\n\\tfoa(idx, tsort) {\\n\\t\\tif(!vis[idx]) continue;\\n\\t\\tfor(auto [to, cost] : h[idx]) {\\n\\t\\t\\tchmax(dp[to], dp[idx] + mp[{groups[idx][0], groups[to][0]}]);\\n\\t\\t\\tvis[to] = 1;\\n\\t\\t}\\n\\t}\\n\\n\\tint res = 0;\\n\\tREP(i, n) {\\n\\t\\tREP(j, n) {\\n\\t\\t\\tint lid = scc[left_id(i, j, 0)];\\n\\t\\t\\tif(vis[lid]) {\\n\\t\\t\\t\\tchmax(res, dp[lid]);\\n\\t\\t\\t}\\n\\t\\t\\tint rid = scc[right_id(i, j, 0)];\\n\\t\\t\\tif(vis[rid]) {\\n\\t\\t\\t\\tchmax(res, dp[rid]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprint(res >= inf ? -1 : res);\\n}\",\n \"accuracy\": 0.5816326530612245,\n \"time_ms\": 100,\n \"memory_kb\": 64072,\n \"score_of_the_acc\": -0.6299,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2307_3731719\",\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 EMPTY 0 //空文字のインデックス\\n#define NUM 105\\n#define BALANCE 10\\n\\n/*\\n * diff = 右の余り-左の余り+10\\n * バランスしているとき、diffは10\\n *\\n * */\\n\\nstruct Data{\\n\\tData(int arg_next_id,int arg_add_len){\\n\\t\\tnext_node_id = arg_next_id;\\n\\t\\tadd_len = arg_add_len;\\n\\t}\\n\\tint next_node_id,add_len;\\n};\\n\\nstruct Node{\\n\\n\\tint left_id,right_id,diff;\\n\\tvector<Data> NEXT;\\n};\\n\\nstruct Info{\\n\\n\\tchar word[11];\\n\\tint length;\\n};\\n\\nstruct State{\\n\\tState(int arg_node_id,int arg_sum_value){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tsum_value = arg_sum_value;\\n\\t}\\n\\tint node_id,sum_value;\\n};\\n\\nint V,E;\\nconst int start = 0,goal = 1;\\nbool check[NUM][NUM];\\nInfo info[NUM];\\nvector<Node> NODES;\\nmap<pair<int,int>,int> MAP[21]; //map[diff][make_pair(left_id,right_id)] = node_id\\nmap<pair<int,int>,int> dp[21]; //dp[diff][make_pair(left_id,right_id)] = 最大長\\n\\n#define SIZE 200005\\n\\nvector<int> G[SIZE];\\nvector<int> reverse_G[SIZE];\\nbool can_goal[SIZE];\\nbool cycle_FLG;\\nbool visited[SIZE];\\n\\nvoid cycle_dfs(int start_id,int current_id){\\n\\n\\tif(cycle_FLG)return;\\n\\n\\tfor(int i = 0; i < G[current_id].size(); i++){\\n\\t\\tif(G[current_id][i] == start_id){\\n\\n\\t\\t\\tcycle_FLG = true;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif(visited[G[current_id][i]])continue;\\n\\t\\tvisited[G[current_id][i]] = true;\\n\\n\\t\\tcycle_dfs(start_id,G[current_id][i]);\\n\\t}\\n}\\n\\nvoid goal_dfs(int node_id){\\n\\n\\tcan_goal[node_id] = true;\\n\\n\\tfor(int i = 0; i < reverse_G[node_id].size(); i++){\\n\\n\\t\\tif(visited[reverse_G[node_id][i]])continue;\\n\\t\\tvisited[reverse_G[node_id][i]] = true;\\n\\n\\t\\tgoal_dfs(reverse_G[node_id][i]);\\n\\t}\\n}\\n\\nvoid start_dfs(int node_id){\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tif(visited[G[node_id][i]])continue;\\n\\t\\tvisited[G[node_id][i]] = true;\\n\\n\\t\\tstart_dfs(G[node_id][i]);\\n\\t}\\n}\\n\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&V,&E);\\n\\n\\tfor(int i = 0; i <= V; i++){\\n\\t\\tfor(int k = 0; k <= V; k++){\\n\\t\\t\\tcheck[i][k] = false;\\n\\t\\t}\\n\\t}\\n\\n\\tint length;\\n\\n\\t//空文字\\n\\tinfo[0].word[0] = '\\\\0';\\n\\tinfo[0].length = 0;\\n\\n\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\tscanf(\\\"%s\\\",info[i].word);\\n\\n\\t\\tfor(length = 0; info[i].word[length] != '\\\\0'; length++);\\n\\n\\t\\tinfo[i].length = length;\\n\\t}\\n\\n\\tint from,to;\\n\\n\\tfor(int loop = 0; loop < E; loop++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\n\\t\\tcheck[from][to] = true;\\n\\t}\\n\\n\\tint num_nodes = 2;\\n\\tNode start_node,goal_node;\\n\\n\\tstart_node.diff = BALANCE;\\n\\tstart_node.left_id = 0;\\n\\tstart_node.right_id = 0;\\n\\n\\tgoal_node.diff = BALANCE;\\n\\tgoal_node.left_id = 0;\\n\\tgoal_node.right_id = 0;\\n\\n\\tNODES.push_back(start_node);\\n\\tNODES.push_back(goal_node);\\n\\n\\n\\t//まず、スタートから遷移する最初のノードを作る\\n\\n\\t/*★1つの単語★*/\\n\\n\\t//全体が回文になっているものを探す。接続に制約があるので、回文になっている単語は全てノード化する\\n\\n\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\tbool FLG = true;\\n\\t\\tfor(int k = 0; k < info[i].length/2; k++){\\n\\t\\t\\tif(info[i].word[k] != info[i].word[info[i].length-1-k]){\\n\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(FLG){\\n\\n\\t\\t\\t//ノード作成\\n\\t\\t\\tNode node;\\n\\n\\t\\t\\tnode.left_id = i;\\n\\t\\t\\tnode.right_id = i;\\n\\t\\t\\tnode.diff = BALANCE;\\n\\n\\t\\t\\tNODES.push_back(node);\\n\\n\\t\\t\\tMAP[BALANCE][make_pair(i,i)] = num_nodes; //マップにIDを登録\\n\\n\\t\\t\\t//スタートからエッジを張る\\n\\t\\t\\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\\n\\t\\t\\tG[start].push_back(num_nodes);\\n\\t\\t\\treverse_G[num_nodes].push_back(start);\\n\\n\\t\\t\\t//バランスしたので、ゴールにエッジを張る\\n\\t\\t\\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\\n\\t\\t\\tG[num_nodes].push_back(goal);\\n\\t\\t\\treverse_G[goal].push_back(num_nodes);\\n\\n\\t\\t\\tnum_nodes++;\\n\\t\\t}\\n\\t}\\n\\n\\n\\t//左端固定\\n\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\tfor(int right = 0; right <= info[i].length-2; right++){\\n\\t\\t\\tbool FLG = true;\\n\\n\\t\\t\\t//0～rightが回文になっているか\\n\\t\\t\\tint tmp_len = right+1;\\n\\n\\t\\t\\tfor(int k = 0; k < tmp_len/2; k++){\\n\\t\\t\\t\\tif(info[i].word[k] != info[i].word[tmp_len-1-k]){\\n\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t//ノード作成\\n\\t\\t\\t\\tNode node;\\n\\n\\t\\t\\t\\tnode.left_id = i;\\n\\t\\t\\t\\tnode.right_id = i;\\n\\t\\t\\t\\tnode.diff = (info[i].length-(right+1))+BALANCE;\\n\\n\\t\\t\\t\\tNODES.push_back(node);\\n\\n\\t\\t\\t\\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes; //マップにIDを登録\\n\\n\\t\\t\\t\\t//スタートからエッジを張る\\n\\t\\t\\t\\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\\n\\t\\t\\t\\tG[start].push_back(num_nodes);\\n\\t\\t\\t\\treverse_G[num_nodes].push_back(start);\\n\\n\\t\\t\\t\\tnum_nodes++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//右端固定\\n\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\tfor(int left = 1; left <= info[i].length-1; left++){\\n\\t\\t\\tbool FLG = true;\\n\\n\\t\\t\\t//left～info[i].length-1が回文になっているか\\n\\t\\t\\tint tmp_len = info[i].length-left;\\n\\n\\t\\t\\tfor(int k = 0; k < tmp_len/2; k++){\\n\\t\\t\\t\\tif(info[i].word[left+k] != info[i].word[info[i].length-1-k]){\\n\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t//ノード作成\\n\\t\\t\\t\\tNode node;\\n\\n\\t\\t\\t\\tnode.left_id = i;\\n\\t\\t\\t\\tnode.right_id = i;\\n\\t\\t\\t\\tnode.diff = -left+BALANCE;\\n\\n\\t\\t\\t\\tNODES.push_back(node);\\n\\n\\t\\t\\t\\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes; //マップにIDを登録\\n\\n\\t\\t\\t\\t//スタートからエッジを張る\\n\\t\\t\\t\\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\\n\\t\\t\\t\\tG[start].push_back(num_nodes);\\n\\t\\t\\t\\treverse_G[num_nodes].push_back(start);\\n\\n\\t\\t\\t\\tnum_nodes++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t/*★2つの単語★*/\\n\\tfor(int L = 1; L <= V; L++){\\n\\t\\tfor(int R = 1; R <= V; R++){\\n\\t\\t\\tif(!check[L][R])continue;\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tint tmp_len = min(info[L].length,info[R].length);\\n\\n\\t\\t\\tfor(int k = 0; k < tmp_len; k++){\\n\\t\\t\\t\\tif(info[L].word[info[L].length-1-k] != info[R].word[k]){\\n\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t//ノード作成\\n\\t\\t\\tNode node;\\n\\n\\t\\t\\tnode.left_id = L;\\n\\t\\t\\tnode.right_id = R;\\n\\t\\t\\tnode.diff = (info[R].length-info[L].length)+BALANCE;\\n\\n\\t\\t\\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\\n\\n\\t\\t\\tif(at != MAP[node.diff].end()){ //★注意★\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tNODES.push_back(node);\\n\\n\\t\\t\\tMAP[node.diff][make_pair(L,R)] = num_nodes; //マップにIDを登録\\n\\n\\t\\t\\t//スタートからエッジを張る\\n\\t\\t\\tNODES[start].NEXT.push_back(Data(num_nodes,info[L].length+info[R].length));\\n\\t\\t\\tG[start].push_back(num_nodes);\\n\\t\\t\\treverse_G[num_nodes].push_back(start);\\n\\n\\n\\t\\t\\tif(node.diff == BALANCE){\\n\\n\\t\\t\\t\\t//バランスしたので、ゴールにエッジを張る\\n\\t\\t\\t\\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\\n\\t\\t\\t\\tG[num_nodes].push_back(goal);\\n\\t\\t\\t\\treverse_G[goal].push_back(num_nodes);\\n\\t\\t\\t}\\n\\n\\t\\t\\tnum_nodes++;\\n\\t\\t}\\n\\t}\\n\\n\\t//発生し得る状態を全列挙\\n\\tqueue<int> Q;\\n\\n\\tfor(int i = 0; i < NODES[start].NEXT.size(); i++){\\n\\n\\t\\tQ.push(NODES[start].NEXT[i].next_node_id);\\n\\t}\\n\\n\\twhile(!Q.empty()){\\n\\n\\t\\tint node_id = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tif(NODES[node_id].diff <= BALANCE){ //右に文字追加\\n\\n\\t\\t\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\t\\t\\tif(!check[NODES[node_id].right_id][i])continue;\\n\\n\\t\\t\\t\\t//少なくとも重なる部分が全て一致するか調べる\\n\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\tint left_diff = abs(NODES[node_id].diff-BALANCE);\\n\\t\\t\\t\\tint tmp_len = min(left_diff,info[i].length);\\n\\t\\t\\t\\tint left_id = NODES[node_id].left_id;\\n\\n\\t\\t\\t\\tfor(int k = 0; k < tmp_len; k++){\\n\\n\\t\\t\\t\\t\\tif(info[left_id].word[left_diff-1-k] != info[i].word[k]){\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t\\tNode node;\\n\\t\\t\\t\\tnode.diff = info[i].length-left_diff+BALANCE;\\n\\t\\t\\t\\tnode.left_id = NODES[node_id].left_id;\\n\\t\\t\\t\\tnode.right_id = i;\\n\\n\\t\\t\\t\\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\\n\\n\\t\\t\\t\\tif(at != MAP[node.diff].end()){ //出現済:エッジだけ張る\\n\\n\\t\\t\\t\\t\\tint next_node = MAP[node.diff][make_pair(node.left_id,node.right_id)];\\n\\n\\t\\t\\t\\t\\tNODES[node_id].NEXT.push_back(Data(next_node,info[i].length));\\n\\t\\t\\t\\t\\tG[node_id].push_back(next_node);\\n\\t\\t\\t\\t\\treverse_G[next_node].push_back(node_id);\\n\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tNODES.push_back(node); //初登場\\n\\n\\t\\t\\t\\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes;\\n\\n\\t\\t\\t\\t//node_idからエッジを張る\\n\\t\\t\\t\\tNODES[node_id].NEXT.push_back(Data(num_nodes,info[i].length));\\n\\t\\t\\t\\tG[node_id].push_back(num_nodes);\\n\\t\\t\\t\\treverse_G[num_nodes].push_back(node_id);\\n\\n\\n\\t\\t\\t\\tif(node.diff == BALANCE){ //バランスしていれば、ゴールにエッジを張る\\n\\n\\t\\t\\t\\t\\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\\n\\t\\t\\t\\t\\tG[num_nodes].push_back(goal);\\n\\t\\t\\t\\t\\treverse_G[goal].push_back(num_nodes);\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tQ.push(num_nodes);\\n\\n\\t\\t\\t\\tnum_nodes++;\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tif(NODES[node_id].diff >= BALANCE){ //左に文字追加\\n\\n\\t\\t\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\t\\t\\tif(!check[i][NODES[node_id].left_id])continue;\\n\\n\\t\\t\\t\\t//少なくとも重なる部分が全て一致するか調べる\\n\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\tint right_diff = NODES[node_id].diff-BALANCE;\\n\\t\\t\\t\\tint tmp_len = min(right_diff,info[i].length);\\n\\t\\t\\t\\tint right_id = NODES[node_id].right_id;\\n\\n\\t\\t\\t\\tfor(int k = 0; k < tmp_len; k++){\\n\\n\\t\\t\\t\\t\\tif(info[right_id].word[info[right_id].length-right_diff+k] != info[i].word[info[i].length-1-k]){\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t\\tNode node;\\n\\t\\t\\t\\tnode.diff = right_diff-info[i].length+BALANCE;\\n\\t\\t\\t\\tnode.left_id = i;\\n\\t\\t\\t\\tnode.right_id = NODES[node_id].right_id;\\n\\n\\t\\t\\t\\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\\n\\n\\t\\t\\t\\tif(at != MAP[node.diff].end()){ //出現済:エッジだけ張る\\n\\n\\t\\t\\t\\t\\tint next_node = MAP[node.diff][make_pair(node.left_id,node.right_id)];\\n\\n\\t\\t\\t\\t\\tNODES[node_id].NEXT.push_back(Data(next_node,info[i].length));\\n\\t\\t\\t\\t\\tG[node_id].push_back(next_node);\\n\\t\\t\\t\\t\\treverse_G[next_node].push_back(node_id);\\n\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tNODES.push_back(node); //初出現なのでノード追加\\n\\t\\t\\t\\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes;\\n\\n\\t\\t\\t\\t//node_idからエッジを張る\\n\\t\\t\\t\\tNODES[node_id].NEXT.push_back(Data(num_nodes,info[i].length));\\n\\t\\t\\t\\tG[node_id].push_back(num_nodes);\\n\\t\\t\\t\\treverse_G[num_nodes].push_back(node_id);\\n\\n\\t\\t\\t\\tif(node.diff == BALANCE){ //バランスしていれば、ゴールにエッジを張る\\n\\n\\t\\t\\t\\t\\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\\n\\t\\t\\t\\t\\tG[num_nodes].push_back(goal);\\n\\t\\t\\t\\t\\treverse_G[goal].push_back(num_nodes);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tQ.push(num_nodes);\\n\\n\\t\\t\\t\\tnum_nodes++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//ゴールできるか調べる\\n\\tfor(int i = 0; i < num_nodes; i++){\\n\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\tvisited[start] = true;\\n\\tstart_dfs(start);\\n\\n\\tif(!visited[goal]){\\n\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\t//ゴールできるノードを探す\\n\\tfor(int i = 0; i < num_nodes; i++){\\n\\n\\t\\tcan_goal[i] = false;\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\tvisited[goal] = true;\\n\\tgoal_dfs(goal);\\n\\n\\n\\t//ゴールできるものの中で、閉路に属するノードがないか調べる\\n\\tfor(int i = 0; i < num_nodes; i++){\\n\\t\\tif(can_goal[i] == false)continue;\\n\\n\\t\\tfor(int k = 0; k < num_nodes; k++){\\n\\n\\t\\t\\tvisited[k] = false;\\n\\t\\t}\\n\\t\\tcycle_FLG = false;\\n\\n\\t\\tvisited[i] = true;\\n\\t\\tcycle_dfs(i,i);\\n\\n\\t\\tif(cycle_FLG){\\n\\n\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\t//dp計算する\\n\\tint ans = 0;\\n\\n\\t//DAGになってるはずなのでdp計算\\n\\tqueue<State> final_Q;\\n\\n\\tdp[NODES[start].diff][make_pair(NODES[start].left_id,NODES[start].right_id)] = 0;\\n\\tfinal_Q.push(State(start,0));\\n\\n\\twhile(!final_Q.empty()){\\n\\n\\t\\tState state = final_Q.front();\\n\\t\\tfinal_Q.pop();\\n\\n\\t\\tauto at = dp[NODES[state.node_id].diff].find(make_pair(NODES[state.node_id].left_id,NODES[state.node_id].right_id));\\n\\n\\t\\tif(at != dp[NODES[state.node_id].diff].end() && state.sum_value < dp[NODES[state.node_id].diff][make_pair(NODES[state.node_id].left_id,NODES[state.node_id].right_id)]){\\n\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tif(state.node_id == goal){\\n\\n\\t\\t\\tans = max(ans,state.sum_value);\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < NODES[state.node_id].NEXT.size(); i++){\\n\\n\\t\\t\\tint next_node = NODES[state.node_id].NEXT[i].next_node_id;\\n\\t\\t\\tif(!can_goal[next_node])continue;\\n\\n\\t\\t\\tint next_value = state.sum_value+NODES[state.node_id].NEXT[i].add_len;\\n\\n\\t\\t\\tat = dp[NODES[next_node].diff].find(make_pair(NODES[next_node].left_id,NODES[next_node].right_id));\\n\\n\\t\\t\\tif(at == dp[NODES[next_node].diff].end()){\\n\\n\\t\\t\\t\\tdp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] = next_value;\\n\\n\\t\\t\\t\\tfinal_Q.push(State(next_node,next_value));\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tif(dp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] < next_value){\\n\\n\\t\\t\\t\\t\\tdp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] = next_value;\\n\\t\\t\\t\\t\\tfinal_Q.push(State(next_node,next_value));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 17068,\n \"score_of_the_acc\": -0.1082,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2307_3731718\",\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 EMPTY 0 //空文字のインデックス\\n#define NUM 105\\n#define BALANCE 10\\n\\n/*\\n * diff = 右の余り-左の余り+10\\n * バランスしているとき、diffは10\\n *\\n * */\\n\\nstruct Data{\\n\\tData(int arg_next_id,int arg_add_len){\\n\\t\\tnext_node_id = arg_next_id;\\n\\t\\tadd_len = arg_add_len;\\n\\t}\\n\\tint next_node_id,add_len;\\n};\\n\\nstruct Node{\\n\\n\\tint left_id,right_id,diff;\\n\\tvector<Data> NEXT;\\n};\\n\\nstruct Info{\\n\\n\\tchar word[11];\\n\\tint length;\\n};\\n\\nstruct State{\\n\\tState(int arg_node_id,int arg_sum_value){\\n\\t\\tnode_id = arg_node_id;\\n\\t\\tsum_value = arg_sum_value;\\n\\t}\\n\\tint node_id,sum_value;\\n};\\n\\nint V,E;\\nconst int start = 0,goal = 1;\\nbool check[NUM][NUM];\\nInfo info[NUM];\\nvector<Node> NODES;\\nmap<pair<int,int>,int> MAP[21]; //map[diff][make_pair(left_id,right_id)] = node_id\\nmap<pair<int,int>,int> dp[21]; //dp[diff][make_pair(left_id,right_id)] = 最大長\\n\\n#define SIZE 200005\\n\\nvector<int> G[SIZE];\\nvector<int> reverse_G[SIZE];\\nbool can_goal[SIZE];\\nbool cycle_FLG;\\nbool visited[SIZE];\\n\\nvoid cycle_dfs(int start_id,int current_id){\\n\\n\\tif(cycle_FLG)return;\\n\\n\\tfor(int i = 0; i < G[current_id].size(); i++){\\n\\t\\tif(G[current_id][i] == start_id){\\n\\n\\t\\t\\tcycle_FLG = true;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tif(visited[G[current_id][i]])continue;\\n\\t\\t/*if(visited[G[current_id][i]]){\\n\\t\\t\\tif(can_goal[G[current_id][i]]){\\n\\t\\t\\tcycle_FLG = true;\\n\\t\\t\\treturn;\\n\\t\\t\\t}\\n\\t\\t\\tcontinue;\\n\\t\\t}*/\\n\\t\\tvisited[G[current_id][i]] = true;\\n\\n\\t\\tcycle_dfs(start_id,G[current_id][i]);\\n\\t}\\n}\\n\\nvoid goal_dfs(int node_id){\\n\\n\\tcan_goal[node_id] = true;\\n\\n\\tfor(int i = 0; i < reverse_G[node_id].size(); i++){\\n\\n\\t\\tif(visited[reverse_G[node_id][i]])continue;\\n\\t\\tvisited[reverse_G[node_id][i]] = true;\\n\\n\\t\\tgoal_dfs(reverse_G[node_id][i]);\\n\\t}\\n}\\n\\nvoid start_dfs(int node_id){\\n\\n\\tfor(int i = 0; i < G[node_id].size(); i++){\\n\\n\\t\\tif(visited[G[node_id][i]])continue;\\n\\t\\tvisited[G[node_id][i]] = true;\\n\\n\\t\\tstart_dfs(G[node_id][i]);\\n\\t}\\n}\\n\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&V,&E);\\n\\n\\tfor(int i = 0; i <= V; i++){\\n\\t\\tfor(int k = 0; k <= V; k++){\\n\\t\\t\\tcheck[i][k] = false;\\n\\t\\t}\\n\\t}\\n\\n\\tint length;\\n\\n\\t//空文字\\n\\tinfo[0].word[0] = '@';\\n\\tinfo[0].word[1] = '\\\\0';\\n\\tinfo[0].length = 0;\\n\\n\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\tscanf(\\\"%s\\\",info[i].word);\\n\\n\\t\\tfor(length = 0; info[i].word[length] != '\\\\0'; length++);\\n\\n\\t\\tinfo[i].length = length;\\n\\t}\\n\\n\\tint from,to;\\n\\n\\tfor(int loop = 0; loop < E; loop++){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&from,&to);\\n\\n\\t\\tcheck[from][to] = true;\\n\\t}\\n\\n\\tint num_nodes = 2;\\n\\tNode start_node,goal_node;\\n\\n\\tstart_node.diff = BALANCE;\\n\\tstart_node.left_id = 0;\\n\\tstart_node.right_id = 0;\\n\\n\\tgoal_node.diff = BALANCE;\\n\\tgoal_node.left_id = 0;\\n\\tgoal_node.right_id = 0;\\n\\n\\tNODES.push_back(start_node);\\n\\tNODES.push_back(goal_node);\\n\\n\\n\\t//まず、スタートから遷移する最初のノードを作る\\n\\n\\t/*★1つの単語★*/\\n\\n\\t//全体が回文になっているものを探す。接続に制約があるので、回文になっている単語は全てノード化する\\n\\n\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\tbool FLG = true;\\n\\t\\tfor(int k = 0; k < info[i].length/2; k++){\\n\\t\\t\\tif(info[i].word[k] != info[i].word[info[i].length-1-k]){\\n\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(FLG){\\n\\n\\t\\t\\t//ノード作成\\n\\t\\t\\tNode node;\\n\\n\\t\\t\\tnode.left_id = i;\\n\\t\\t\\tnode.right_id = i;\\n\\t\\t\\tnode.diff = BALANCE;\\n\\n\\t\\t\\tNODES.push_back(node);\\n\\n\\t\\t\\tMAP[BALANCE][make_pair(i,i)] = num_nodes; //マップにIDを登録\\n\\n\\t\\t\\t//スタートからエッジを張る\\n\\t\\t\\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\\n\\t\\t\\tG[start].push_back(num_nodes);\\n\\t\\t\\treverse_G[num_nodes].push_back(start);\\n\\n\\t\\t\\t//バランスしたので、ゴールにエッジを張る\\n\\t\\t\\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\\n\\t\\t\\tG[num_nodes].push_back(goal);\\n\\t\\t\\treverse_G[goal].push_back(num_nodes);\\n\\n\\t\\t\\tnum_nodes++;\\n\\t\\t}\\n\\t}\\n\\n\\n\\t//左端固定\\n\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\tfor(int right = 0; right <= info[i].length-2; right++){\\n\\t\\t\\tbool FLG = true;\\n\\n\\t\\t\\t//0～rightが回文になっているか\\n\\t\\t\\tint tmp_len = right+1;\\n\\n\\t\\t\\tfor(int k = 0; k < tmp_len/2; k++){\\n\\t\\t\\t\\tif(info[i].word[k] != info[i].word[tmp_len-1-k]){\\n\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t//ノード作成\\n\\t\\t\\t\\tNode node;\\n\\n\\t\\t\\t\\tnode.left_id = i;\\n\\t\\t\\t\\tnode.right_id = i;\\n\\t\\t\\t\\tnode.diff = (info[i].length-(right+1))+BALANCE;\\n\\n\\t\\t\\t\\tNODES.push_back(node);\\n\\n\\t\\t\\t\\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes; //マップにIDを登録\\n\\n\\t\\t\\t\\t//スタートからエッジを張る\\n\\t\\t\\t\\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\\n\\t\\t\\t\\tG[start].push_back(num_nodes);\\n\\t\\t\\t\\treverse_G[num_nodes].push_back(start);\\n\\n\\t\\t\\t\\tnum_nodes++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//右端固定\\n\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\tfor(int left = 1; left <= info[i].length-1; left++){\\n\\t\\t\\tbool FLG = true;\\n\\n\\t\\t\\t//left～info[i].length-1が回文になっているか\\n\\t\\t\\tint tmp_len = info[i].length-left;\\n\\n\\t\\t\\tfor(int k = 0; k < tmp_len/2; k++){\\n\\t\\t\\t\\tif(info[i].word[left+k] != info[i].word[info[i].length-1-k]){\\n\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(FLG){\\n\\n\\t\\t\\t\\t//ノード作成\\n\\t\\t\\t\\tNode node;\\n\\n\\t\\t\\t\\tnode.left_id = i;\\n\\t\\t\\t\\tnode.right_id = i;\\n\\t\\t\\t\\tnode.diff = -left+BALANCE;\\n\\n\\t\\t\\t\\tNODES.push_back(node);\\n\\n\\t\\t\\t\\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes; //マップにIDを登録\\n\\n\\t\\t\\t\\t//スタートからエッジを張る\\n\\t\\t\\t\\tNODES[start].NEXT.push_back(Data(num_nodes,info[i].length));\\n\\t\\t\\t\\tG[start].push_back(num_nodes);\\n\\t\\t\\t\\treverse_G[num_nodes].push_back(start);\\n\\n\\t\\t\\t\\tnum_nodes++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t/*★2つの単語★*/\\n\\tfor(int L = 1; L <= V; L++){\\n\\t\\tfor(int R = 1; R <= V; R++){\\n\\t\\t\\tif(!check[L][R])continue;\\n\\n\\t\\t\\tbool FLG = true;\\n\\t\\t\\tint tmp_len = min(info[L].length,info[R].length);\\n\\n\\t\\t\\tfor(int k = 0; k < tmp_len; k++){\\n\\t\\t\\t\\tif(info[L].word[info[L].length-1-k] != info[R].word[k]){\\n\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t//ノード作成\\n\\t\\t\\tNode node;\\n\\n\\t\\t\\tnode.left_id = L;\\n\\t\\t\\tnode.right_id = R;\\n\\t\\t\\tnode.diff = (info[R].length-info[L].length)+BALANCE;\\n\\n\\t\\t\\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\\n\\n\\t\\t\\tif(at != MAP[node.diff].end()){ //★注意★\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tNODES.push_back(node);\\n\\n\\t\\t\\tMAP[node.diff][make_pair(L,R)] = num_nodes; //マップにIDを登録\\n\\n\\t\\t\\t//スタートからエッジを張る\\n\\t\\t\\tNODES[start].NEXT.push_back(Data(num_nodes,info[L].length+info[R].length));\\n\\t\\t\\tG[start].push_back(num_nodes);\\n\\t\\t\\treverse_G[num_nodes].push_back(start);\\n\\n\\n\\t\\t\\tif(node.diff == BALANCE){\\n\\n\\t\\t\\t\\t//バランスしたので、ゴールにエッジを張る\\n\\t\\t\\t\\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\\n\\t\\t\\t\\tG[num_nodes].push_back(goal);\\n\\t\\t\\t\\treverse_G[goal].push_back(num_nodes);\\n\\t\\t\\t}\\n\\n\\t\\t\\tnum_nodes++;\\n\\t\\t}\\n\\t}\\n\\n\\t//発生し得る状態を全列挙\\n\\tqueue<int> Q;\\n\\n\\tfor(int i = 0; i < NODES[start].NEXT.size(); i++){\\n\\n\\t\\tQ.push(NODES[start].NEXT[i].next_node_id);\\n\\t}\\n\\n\\n\\n\\t/*printf(\\\"Minhi!\\\\n\\\");\\n\\treturn 0;\\n*/\\n\\twhile(!Q.empty()){\\n\\n\\t\\tint node_id = Q.front();\\n\\t\\tQ.pop();\\n\\n\\t\\tif(NODES[node_id].diff <= BALANCE){ //右に文字追加\\n\\n\\t\\t\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\t\\t\\tif(!check[NODES[node_id].right_id][i])continue;\\n\\n\\t\\t\\t\\t//少なくとも重なる部分が全て一致するか調べる\\n\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\tint left_diff = abs(NODES[node_id].diff-BALANCE);\\n\\t\\t\\t\\tint tmp_len = min(left_diff,info[i].length);\\n\\t\\t\\t\\tint left_id = NODES[node_id].left_id;\\n\\n\\t\\t\\t\\tfor(int k = 0; k < tmp_len; k++){\\n\\n\\t\\t\\t\\t\\tif(info[left_id].word[left_diff-1-k] != info[i].word[k]){\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t\\tNode node;\\n\\t\\t\\t\\tnode.diff = info[i].length-left_diff+BALANCE;\\n\\t\\t\\t\\tnode.left_id = NODES[node_id].left_id;\\n\\t\\t\\t\\tnode.right_id = i;\\n\\n\\t\\t\\t\\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\\n\\n\\t\\t\\t\\tif(at != MAP[node.diff].end()){ //出現済:エッジだけ張る\\n\\n\\t\\t\\t\\t\\tint next_node = MAP[node.diff][make_pair(node.left_id,node.right_id)];\\n\\n\\t\\t\\t\\t\\tNODES[node_id].NEXT.push_back(Data(next_node,info[i].length));\\n\\t\\t\\t\\t\\tG[node_id].push_back(next_node);\\n\\t\\t\\t\\t\\treverse_G[next_node].push_back(node_id);\\n\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tNODES.push_back(node); //初登場\\n\\n\\t\\t\\t\\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes;\\n\\n\\t\\t\\t\\t//node_idからエッジを張る\\n\\t\\t\\t\\tNODES[node_id].NEXT.push_back(Data(num_nodes,info[i].length));\\n\\t\\t\\t\\tG[node_id].push_back(num_nodes);\\n\\t\\t\\t\\treverse_G[num_nodes].push_back(node_id);\\n\\n\\n\\t\\t\\t\\tif(node.diff == BALANCE){ //バランスしていれば、ゴールにエッジを張る\\n\\n\\t\\t\\t\\t\\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\\n\\t\\t\\t\\t\\tG[num_nodes].push_back(goal);\\n\\t\\t\\t\\t\\treverse_G[goal].push_back(num_nodes);\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tQ.push(num_nodes);\\n\\n\\t\\t\\t\\tnum_nodes++;\\n\\t\\t\\t}\\n\\n\\t\\t}\\n\\n\\t\\tif(NODES[node_id].diff >= BALANCE){ //左に文字追加\\n\\n\\t\\t\\tfor(int i = 1; i <= V; i++){\\n\\n\\t\\t\\t\\tif(!check[i][NODES[node_id].left_id])continue;\\n\\n\\t\\t\\t\\t//少なくとも重なる部分が全て一致するか調べる\\n\\t\\t\\t\\tbool FLG = true;\\n\\t\\t\\t\\tint right_diff = NODES[node_id].diff-BALANCE;\\n\\t\\t\\t\\tint tmp_len = min(right_diff,info[i].length);\\n\\t\\t\\t\\tint right_id = NODES[node_id].right_id;\\n\\n\\t\\t\\t\\tfor(int k = 0; k < tmp_len; k++){\\n\\n\\t\\t\\t\\t\\tif(info[right_id].word[info[right_id].length-right_diff+k] != info[i].word[info[i].length-1-k]){\\n\\t\\t\\t\\t\\t\\tFLG = false;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(!FLG)continue;\\n\\n\\t\\t\\t\\tNode node;\\n\\t\\t\\t\\tnode.diff = right_diff-info[i].length+BALANCE;\\n\\t\\t\\t\\tnode.left_id = i;\\n\\t\\t\\t\\tnode.right_id = NODES[node_id].right_id;\\n\\n\\t\\t\\t\\tauto at = MAP[node.diff].find(make_pair(node.left_id,node.right_id));\\n\\n\\t\\t\\t\\tif(at != MAP[node.diff].end()){ //出現済:エッジだけ張る\\n\\n\\t\\t\\t\\t\\tint next_node = MAP[node.diff][make_pair(node.left_id,node.right_id)];\\n\\n\\t\\t\\t\\t\\tNODES[node_id].NEXT.push_back(Data(next_node,info[i].length));\\n\\t\\t\\t\\t\\tG[node_id].push_back(next_node);\\n\\t\\t\\t\\t\\treverse_G[next_node].push_back(node_id);\\n\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tNODES.push_back(node); //初出現なのでノード追加\\n\\t\\t\\t\\tMAP[node.diff][make_pair(node.left_id,node.right_id)] = num_nodes;\\n\\n\\t\\t\\t\\t//node_idからエッジを張る\\n\\t\\t\\t\\tNODES[node_id].NEXT.push_back(Data(num_nodes,info[i].length));\\n\\t\\t\\t\\tG[node_id].push_back(num_nodes);\\n\\t\\t\\t\\treverse_G[num_nodes].push_back(node_id);\\n\\n\\t\\t\\t\\tif(node.diff == BALANCE){ //バランスしていれば、ゴールにエッジを張る\\n\\n\\t\\t\\t\\t\\tNODES[num_nodes].NEXT.push_back(Data(goal,0));\\n\\t\\t\\t\\t\\tG[num_nodes].push_back(goal);\\n\\t\\t\\t\\t\\treverse_G[goal].push_back(num_nodes);\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tQ.push(num_nodes);\\n\\n\\t\\t\\t\\tnum_nodes++;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\t//ゴールできるか調べる\\n\\tfor(int i = 0; i < num_nodes; i++){\\n\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\tvisited[start] = true;\\n\\tstart_dfs(start);\\n\\n\\tif(!visited[goal]){\\n\\n\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\treturn 0;\\n\\t}\\n\\n\\t//ゴールできるノードを探す\\n\\tfor(int i = 0; i < num_nodes; i++){\\n\\n\\t\\tcan_goal[i] = false;\\n\\t\\tvisited[i] = false;\\n\\t}\\n\\tvisited[goal] = true;\\n\\tgoal_dfs(goal);\\n\\n\\n\\t//ゴールできるものの中で、閉路に属するノードがないか調べる\\n\\tfor(int i = 0; i < num_nodes; i++){\\n\\t\\tif(can_goal[i] == false)continue;\\n\\n\\t\\tfor(int k = 0; k < num_nodes; k++){\\n\\n\\t\\t\\tvisited[k] = false;\\n\\t\\t}\\n\\t\\tcycle_FLG = false;\\n\\n\\t\\tvisited[i] = true;\\n\\t\\tcycle_dfs(i,i);\\n\\n\\t\\tif(cycle_FLG){\\n\\n\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\t//dp計算する\\n\\tint ans = 0;\\n\\n\\t//DAGになってるはずなのでdp計算\\n\\tqueue<State> final_Q;\\n\\n\\tdp[NODES[start].diff][make_pair(NODES[start].left_id,NODES[start].right_id)] = 0;\\n\\tfinal_Q.push(State(start,0));\\n\\n\\twhile(!final_Q.empty()){\\n\\n\\t\\tState state = final_Q.front();\\n\\t\\tfinal_Q.pop();\\n\\n\\t\\tauto at = dp[NODES[state.node_id].diff].find(make_pair(NODES[state.node_id].left_id,NODES[state.node_id].right_id));\\n\\n\\t\\tif(at != dp[NODES[state.node_id].diff].end() && state.sum_value < dp[NODES[state.node_id].diff][make_pair(NODES[state.node_id].left_id,NODES[state.node_id].right_id)]){\\n\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tif(state.node_id == goal){\\n\\n\\t\\t\\tans = max(ans,state.sum_value);\\n\\t\\t}\\n\\n\\t\\tfor(int i = 0; i < NODES[state.node_id].NEXT.size(); i++){\\n\\n\\t\\t\\tint next_node = NODES[state.node_id].NEXT[i].next_node_id;\\n\\t\\t\\tif(!can_goal[next_node])continue;\\n\\n\\t\\t\\tint next_value = state.sum_value+NODES[state.node_id].NEXT[i].add_len;\\n\\n\\t\\t\\tat = dp[NODES[next_node].diff].find(make_pair(NODES[next_node].left_id,NODES[next_node].right_id));\\n\\n\\t\\t\\tif(at == dp[NODES[next_node].diff].end()){\\n\\n\\t\\t\\t\\tdp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] = next_value;\\n\\n\\t\\t\\t\\tfinal_Q.push(State(next_node,next_value));\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tif(dp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] < next_value){\\n\\n\\t\\t\\t\\t\\tdp[NODES[next_node].diff][make_pair(NODES[next_node].left_id,NODES[next_node].right_id)] = next_value;\\n\\t\\t\\t\\t\\tfinal_Q.push(State(next_node,next_value));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 16968,\n \"score_of_the_acc\": -0.1071,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2307_3178278\",\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//INSERT ABOVE HERE\\nsigned main(){\\n const int D = 11;\\n \\n int n,m;\\n cin>>n>>m;\\n vector<string> s(n);\\n for(int i=0;i<n;i++) cin>>s[i];\\n\\n vector<vector<int> > E(n,vector<int>(n,0));\\n for(int i=0;i<m;i++){\\n int x,y;\\n cin>>x>>y;\\n x--;y--;\\n E[x][y]=1;\\n }\\n\\n vector<int> l(n);\\n for(int i=0;i<n;i++) l[i]=s[i].size();\\n\\n\\n using T = tuple<int, int, int>;\\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\\n int sz=idx(D,n-1,n-1)+1;\\n\\n queue<T> qt;\\n vector<int> dp(sz,-1);\\n \\n // center inside s[x]\\n for(int x=0;x<n;x++){\\n // even\\n for(int i=1;i<l[x];i++){\\n // [0, i) + [i, l)\\n int k=min(i,l[x]-i),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+j];\\n if(ok){\\n\\tint d=i-(l[x]-i);\\n\\tqt.emplace(d,x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n // odd\\n for(int i=0;i<l[x];i++){\\n // [0, i) + [i, i+1) + [i+1, l)\\n int k=min(i,l[x]-(i+1)),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+1+j];\\n if(ok){\\n\\tint d=i-(l[x]-(i+1));\\n\\tqt.emplace(i-(l[x]-(i+1)),x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n }\\n\\n // s[x] |center| s[y] (obviously even)\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n if(!E[x][y]) continue;\\n int k=min(l[x],l[y]),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][l[x]-(j+1)]==s[y][j];\\n if(ok){\\n\\tint d=l[x]-l[y];\\n\\tqt.emplace(d,x,y);\\n\\tchmax(dp[idx(d,x,y)],l[x]+l[y]);\\n }\\n } \\n }\\n\\n using P = pair<int, int>;\\n vector<vector<P> > G(sz),R(sz);\\n \\n for(int d=-D;d<=D;d++){\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n\\tint v=idx(d,x,y);\\n\\tfor(int i=0;i<n;i++){\\n\\t // s[i] s[x] s[y]\\n\\t if(d<=0&&E[i][x]){\\n\\t int k=min(-d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]+d+j];\\n\\t if(ok){\\t \\n\\t int nd=d+l[i];\\n\\t int u=idx(nd,i,y);\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t // s[x] s[y] s[i]\\n\\t if(d>=0&&E[y][i]){\\n\\t int k=min(d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][j]==s[x][d-(j+1)];\\n\\t if(ok){\\n\\t int nd=d-l[i];\\n\\t int u=idx(nd,x,i);\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t}\\n } \\n }\\n }\\n\\n // find nodes that can reached from starts\\n while(!qt.empty()){\\n int d,x,y;\\n tie(d,x,y)=qt.front();qt.pop();\\n int v=idx(d,x,y);\\n for(auto e:G[v]){\\n int u,c;\\n tie(u,c)=e;\\n if(~dp[u]) continue;\\n chmax(dp[u],dp[v]+c);\\n qt.emplace(inv(u)); \\n } \\n }\\n\\n vector<int> dp2(sz,-1),used(sz,0),visit(sz,0);\\n queue<int> qu;\\n \\n function<int(int)> dfs=\\n [&](int v){\\n int &res=dp2[v];\\n if(used[v]) return res;\\n \\n visit[v]=1;\\n qu.emplace(v);\\n res=dp[v];\\n \\n for(auto e:R[v]){\\n\\tint u,c;\\n\\ttie(u,c)=e;\\n\\tif(dp[u]<0) continue;\\n\\tif(visit[u]==1){\\n\\t cout<<-1<<endl;\\n\\t exit(0);\\n\\t}\\n\\tchmax(res,dfs(u)+c);\\n }\\n \\n visit[v]=0;\\n return res;\\n };\\n \\n int ans=0;\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n int v=idx(0,x,y);\\n if(~dp[v]) chmax(ans,dfs(v));\\n while(!qu.empty()){\\n\\tused[qu.front()]=1;\\n\\tvisit[qu.front()]=2;\\n\\tqu.pop();\\n }\\n }\\n }\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 28380,\n \"score_of_the_acc\": -0.2473,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2307_3178277\",\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//INSERT ABOVE HERE\\nsigned main(){\\n const int D = 11;\\n \\n int n,m;\\n cin>>n>>m;\\n vector<string> s(n);\\n for(int i=0;i<n;i++) cin>>s[i];\\n\\n vector<vector<int> > E(n,vector<int>(n,0));\\n for(int i=0;i<m;i++){\\n int x,y;\\n cin>>x>>y;\\n x--;y--;\\n E[x][y]=1;\\n }\\n\\n vector<int> l(n);\\n for(int i=0;i<n;i++) l[i]=s[i].size();\\n\\n\\n using T = tuple<int, int, int>;\\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\\n int sz=idx(D,n-1,n-1)+1;\\n\\n queue<T> qt;\\n vector<int> dp(sz,-1);\\n \\n // center inside s[x]\\n for(int x=0;x<n;x++){\\n // even\\n for(int i=1;i<l[x];i++){\\n // [0, i) + [i, l)\\n int k=min(i,l[x]-i),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+j];\\n if(ok){\\n\\tint d=i-(l[x]-i);\\n\\tqt.emplace(d,x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n // odd\\n for(int i=0;i<l[x];i++){\\n // [0, i) + [i, i+1) + [i+1, l)\\n int k=min(i,l[x]-(i+1)),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+1+j];\\n if(ok){\\n\\tint d=i-(l[x]-(i+1));\\n\\tqt.emplace(i-(l[x]-(i+1)),x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n }\\n\\n // s[x] |center| s[y] (obviously even)\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n if(!E[x][y]) continue;\\n int k=min(l[x],l[y]),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][l[x]-(j+1)]==s[y][j];\\n if(ok){\\n\\tint d=l[x]-l[y];\\n\\tqt.emplace(d,x,y);\\n\\tchmax(dp[idx(d,x,y)],l[x]+l[y]);\\n }\\n } \\n }\\n\\n using P = pair<int, int>;\\n vector<vector<P> > G(sz),R(sz);\\n \\n for(int d=-D;d<=D;d++){\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n\\tint v=idx(d,x,y);\\n\\t//cout<<v<<\\\":\\\"<<d<<\\\" \\\"<<x<<\\\" \\\"<<y<<endl;\\n\\tfor(int i=0;i<n;i++){\\n\\t // s[i] s[x] s[y]\\n\\t if(d<=0&&E[i][x]){\\n\\t int k=min(-d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]+d+j];\\n\\t if(ok){\\t \\n\\t int nd=d+l[i];\\n\\t int u=idx(nd,i,y);\\n\\t //cout<<v<<\\\" -> \\\"<<u<<endl;\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t // s[x] s[y] s[i]\\n\\t if(d>=0&&E[y][i]){\\n\\t int k=min(d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][j]==s[x][d-(j+1)];\\n\\t if(ok){\\n\\t int nd=d-l[i];\\n\\t int u=idx(nd,x,i);\\n\\t //cout<<v<<\\\" -> \\\"<<u<<endl;\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t}\\n } \\n }\\n }\\n\\n // find nodes that can reached from starts\\n while(!qt.empty()){\\n int d,x,y;\\n tie(d,x,y)=qt.front();qt.pop();\\n int v=idx(d,x,y);\\n //cout<<dp[v]<<\\\":\\\"<<d<<\\\" \\\"<<x<<\\\" \\\"<<y<<endl;\\n for(auto e:G[v]){\\n int u,c;\\n tie(u,c)=e;\\n if(~dp[u]) continue;\\n chmax(dp[u],dp[v]+c);\\n qt.emplace(inv(u)); \\n } \\n }\\n\\n vector<int> dp2(sz,-1),used(sz,0),visit(sz,0);\\n queue<int> qu;\\n \\n function<int(int)> dfs=\\n [&](int v){\\n int &res=dp2[v];\\n if(used[v]) return res;\\n //cout<<v<<\\\"****\\\"<<s[get<1>(inv(v))]<<\\\" \\\"<<s[get<2>(inv(v))]<<endl;\\n //cout<<get<0>(inv(v))<<\\\":\\\"<<get<1>(inv(v))<<\\\":\\\"<<get<2>(inv(v))<<endl;\\n \\n visit[v]=1;\\n qu.emplace(v);\\n res=dp[v];\\n \\n for(auto e:R[v]){\\n\\tint u,c;\\n\\ttie(u,c)=e;\\n\\tif(dp[u]<0) continue;\\n\\t//cout<<setw(6)<<v<<\\\":\\\"<<setw(3)<<dp[v]<<\\\":\\\"<<setw(3)<<visit[v]<<endl;\\n\\t//cout<<setw(6)<<u<<\\\"+\\\"<<setw(3)<<dp[u]<<\\\"+\\\"<<setw(3)<<visit[u]<<endl;\\n\\tif(visit[u]==1){\\n\\t cout<<-1<<endl;\\n\\t exit(0);\\n\\t}\\n\\tchmax(res,dfs(u)+c);\\n }\\n visit[v]=0;\\n\\n //cout<<v<<\\\"::\\\"<<res<<endl;\\n return res;\\n };\\n \\n int ans=0;\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n int v=idx(0,x,y);\\n if(~dp[v]) chmax(ans,dfs(v));\\n while(!qu.empty()){\\n\\tused[qu.front()]=1;\\n\\tvisit[qu.front()]=2;\\n\\tqu.pop();\\n }\\n }\\n }\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 28520,\n \"score_of_the_acc\": -0.2488,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2307_3178274\",\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//INSERT ABOVE HERE\\nsigned main(){\\n const int D = 11;\\n \\n int n,m;\\n cin>>n>>m;\\n vector<string> s(n);\\n for(int i=0;i<n;i++) cin>>s[i];\\n\\n vector<vector<int> > E(n,vector<int>(n,0));\\n for(int i=0;i<m;i++){\\n int x,y;\\n cin>>x>>y;\\n x--;y--;\\n E[x][y]=1;\\n }\\n\\n vector<int> l(n);\\n for(int i=0;i<n;i++) l[i]=s[i].size();\\n\\n\\n using T = tuple<int, int, int>;\\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\\n int sz=idx(D,n-1,n-1)+1;\\n\\n queue<T> qt;\\n vector<int> dp(sz,-1);\\n \\n // center inside s[x]\\n for(int x=0;x<n;x++){\\n // even\\n for(int i=1;i<l[x];i++){\\n // [0, i) + [i, l)\\n int k=min(i,l[x]-i),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+j];\\n if(ok){\\n\\tint d=i-(l[x]-i);\\n\\tqt.emplace(d,x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n // odd\\n for(int i=0;i<l[x];i++){\\n // [0, i) + [i, i+1) + [i+1, l)\\n int k=min(i,l[x]-(i+1)),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+1+j];\\n if(ok){\\n\\tint d=i-(l[x]-(i+1));\\n\\tqt.emplace(i-(l[x]-(i+1)),x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n }\\n\\n // s[x] |center| s[y] (obviously even)\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n if(!E[x][y]) continue;\\n int k=min(l[x],l[y]),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][l[x]-(j+1)]==s[y][j];\\n if(ok){\\n\\tint d=l[x]-l[y];\\n\\tqt.emplace(d,x,y);\\n\\tchmax(dp[idx(d,x,x)],l[x]+l[y]);\\n }\\n } \\n }\\n\\n using P = pair<int, int>;\\n vector<vector<P> > G(sz),R(sz);\\n \\n for(int d=-D;d<=D;d++){\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n\\tint v=idx(d,x,y);\\n\\t//cout<<v<<\\\":\\\"<<d<<\\\" \\\"<<x<<\\\" \\\"<<y<<endl;\\n\\tfor(int i=0;i<n;i++){\\n\\t // s[i] s[x] s[y]\\n\\t if(d<=0&&E[i][x]){\\n\\t int k=min(-d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]+d+j];\\n\\t if(ok){\\t \\n\\t int nd=d+l[i];\\n\\t int u=idx(nd,i,y);\\n\\t //cout<<v<<\\\" -> \\\"<<u<<endl;\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t // s[x] s[y] s[i]\\n\\t if(d>=0&&E[y][i]){\\n\\t int k=min(d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][j]==s[x][d-(j+1)];\\n\\t if(ok){\\n\\t int nd=d-l[i];\\n\\t int u=idx(nd,x,i);\\n\\t //cout<<v<<\\\" -> \\\"<<u<<endl;\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t}\\n } \\n }\\n }\\n\\n // find nodes that can reached from starts\\n while(!qt.empty()){\\n int d,x,y;\\n tie(d,x,y)=qt.front();qt.pop();\\n int v=idx(d,x,y);\\n //cout<<dp[v]<<\\\":\\\"<<d<<\\\" \\\"<<x<<\\\" \\\"<<y<<endl;\\n for(auto e:G[v]){\\n int u,c;\\n tie(u,c)=e;\\n if(~dp[u]) continue;\\n chmax(dp[u],dp[v]+c);\\n qt.emplace(inv(u)); \\n } \\n }\\n\\n vector<int> dp2(sz,-1),used(sz,0),visit(sz,0);\\n queue<int> qu;\\n \\n function<int(int)> dfs=\\n [&](int v){\\n int &res=dp2[v];\\n if(used[v]) return res;\\n //cout<<v<<\\\"****\\\"<<endl;\\n //cout<<get<0>(inv(v))<<\\\":\\\"<<get<1>(inv(v))<<\\\":\\\"<<get<2>(inv(v))<<endl;\\n \\n visit[v]=1;\\n qu.emplace(v);\\n res=dp[v];\\n for(auto e:R[v]){\\n\\tint u,c;\\n\\ttie(u,c)=e;\\n\\tif(dp[u]<0) continue;\\n\\t//cout<<setw(6)<<v<<\\\":\\\"<<setw(3)<<dp[v]<<\\\":\\\"<<setw(3)<<visit[v]<<endl;\\n\\t//cout<<setw(6)<<u<<\\\"+\\\"<<setw(3)<<dp[u]<<\\\"+\\\"<<setw(3)<<visit[u]<<endl;\\n\\tif(visit[u]==1){\\n\\t cout<<-1<<endl;\\n\\t exit(0);\\n\\t}\\n\\tchmax(res,dfs(u)+c);\\n }\\n visit[v]=0;\\n return res;\\n };\\n \\n int ans=0;\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n int v=idx(0,x,y);\\n if(~dp[v]) chmax(ans,dfs(v));\\n while(!qu.empty()){\\n\\tused[qu.front()]=1;\\n\\tvisit[qu.front()]=2;\\n\\tqu.pop();\\n }\\n }\\n }\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.8163265306122449,\n \"time_ms\": 110,\n \"memory_kb\": 28468,\n \"score_of_the_acc\": -0.2504,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2307_3178270\",\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//INSERT ABOVE HERE\\nsigned main(){\\n const int D = 11;\\n \\n int n,m;\\n cin>>n>>m;\\n vector<string> s(n);\\n for(int i=0;i<n;i++) cin>>s[i];\\n\\n vector<vector<int> > E(n,vector<int>(n,0));\\n for(int i=0;i<m;i++){\\n int x,y;\\n cin>>x>>y;\\n x--;y--;\\n E[x][y]=1;\\n }\\n\\n vector<int> l(n);\\n for(int i=0;i<n;i++) l[i]=s[i].size();\\n\\n\\n using T = tuple<int, int, int>;\\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\\n int sz=idx(D,n-1,n-1)+1;\\n\\n queue<T> qt;\\n vector<int> dp(sz,-1);\\n \\n // center inside s[x]\\n for(int x=0;x<n;x++){\\n // even\\n for(int i=1;i<l[x];i++){\\n // [0, i) + [i, l)\\n int k=min(i,l[x]-i),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+j];\\n if(ok){\\n\\tint d=i-(l[x]-i);\\n\\tqt.emplace(d,x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n // odd\\n for(int i=0;i<l[x];i++){\\n // [0, i) + [i, i+1) + [i+1, l)\\n int k=min(i,l[x]-(i+1)),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+1+j];\\n if(ok){\\n\\tint d=i-(l[x]-(i+1));\\n\\tqt.emplace(i-(l[x]-(i+1)),x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n }\\n\\n // s[x] |center| s[y] (obviously even)\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n if(!E[x][y]) continue;\\n int k=min(l[x],l[y]),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][l[x]-(j+1)]==s[y][j];\\n if(ok){\\n\\tint d=l[x]-l[y];\\n\\tqt.emplace(d,x,y);\\n\\tchmax(dp[idx(d,x,x)],l[x]+l[y]);\\n }\\n } \\n }\\n\\n using P = pair<int, int>;\\n vector<vector<P> > G(sz),R(sz);\\n \\n for(int d=-D;d<=D;d++){\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n\\tint v=idx(d,x,y);\\n\\t//cout<<v<<\\\":\\\"<<d<<\\\" \\\"<<x<<\\\" \\\"<<y<<endl;\\n\\tfor(int i=0;i<n;i++){\\n\\t // s[i] s[x] s[y]\\n\\t if(d<=0&&E[i][x]){\\n\\t int k=min(-d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]+d+j];\\n\\t if(ok){\\t \\n\\t int nd=d+l[i];\\n\\t int u=idx(nd,i,y);\\n\\t //cout<<v<<\\\" -> \\\"<<u<<endl;\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t // s[x] s[y] s[i]\\n\\t if(d>=0&&E[y][i]){\\n\\t int k=min(d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][j]==s[x][d-(j+1)];\\n\\t if(ok){\\n\\t int nd=d-l[i];\\n\\t int u=idx(nd,x,i);\\n\\t //cout<<v<<\\\" -> \\\"<<u<<endl;\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t}\\n } \\n }\\n }\\n\\n // find nodes that can reached from starts\\n while(!qt.empty()){\\n int d,x,y;\\n tie(d,x,y)=qt.front();qt.pop();\\n int v=idx(d,x,y);\\n //cout<<dp[v]<<\\\":\\\"<<d<<\\\" \\\"<<x<<\\\" \\\"<<y<<endl;\\n for(auto e:G[v]){\\n int u,c;\\n tie(u,c)=e;\\n if(~dp[u]) continue;\\n chmax(dp[u],dp[v]+c);\\n qt.emplace(inv(u)); \\n } \\n }\\n\\n vector<int> dp2(sz,-1),used(sz,0),visit(sz,-1);\\n queue<int> qu;\\n int pos=0;\\n function<int(int)> dfs=\\n [&](int v){\\n int &res=dp2[v];\\n if(used[v]) return res;\\n //cout<<v<<\\\"****\\\"<<endl;\\n //cout<<get<0>(inv(v))<<\\\":\\\"<<get<1>(inv(v))<<\\\":\\\"<<get<2>(inv(v))<<endl;\\n \\n visit[v]=pos++;\\n qu.emplace(v);\\n res=dp[v];\\n for(auto e:R[v]){\\n\\tint u,c;\\n\\ttie(u,c)=e;\\n\\tif(dp[u]<0) continue;\\n\\t//cout<<setw(6)<<v<<\\\":\\\"<<setw(3)<<dp[v]<<\\\":\\\"<<setw(3)<<visit[v]<<endl;\\n\\t//cout<<setw(6)<<u<<\\\"+\\\"<<setw(3)<<dp[u]<<\\\"+\\\"<<setw(3)<<visit[u]<<endl;\\n\\tif(~visit[u]&&visit[u]<=visit[v]){\\n\\t cout<<-1<<endl;\\n\\t exit(0);\\n\\t}\\n\\tchmax(res,dfs(u)+c);\\n }\\n return res;\\n };\\n \\n int ans=0;\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n int v=idx(0,x,y);\\n if(~dp[v]) chmax(ans,dfs(v));\\n while(!qu.empty()){\\n\\tused[qu.front()]=1;\\n\\tvisit[qu.front()]=sz+1;\\n\\tqu.pop();\\n }\\n }\\n }\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.6632653061224489,\n \"time_ms\": 100,\n \"memory_kb\": 28464,\n \"score_of_the_acc\": -0.2482,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2307_3178268\",\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//INSERT ABOVE HERE\\nsigned main(){\\n const int D = 11;\\n \\n int n,m;\\n cin>>n>>m;\\n vector<string> s(n);\\n for(int i=0;i<n;i++) cin>>s[i];\\n\\n vector<vector<int> > E(n,vector<int>(n,0));\\n for(int i=0;i<m;i++){\\n int x,y;\\n cin>>x>>y;\\n x--;y--;\\n E[x][y]=1;\\n }\\n\\n vector<int> l(n);\\n for(int i=0;i<n;i++) l[i]=s[i].size();\\n\\n\\n using T = tuple<int, int, int>;\\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\\n int sz=idx(D,n-1,n-1)+1;\\n\\n queue<T> qt;\\n vector<int> dp(sz,-1);\\n \\n // center inside s[x]\\n for(int x=0;x<n;x++){\\n // even\\n for(int i=1;i<l[x];i++){\\n // [0, i) + [i, l)\\n int k=min(i,l[x]-i),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+j];\\n if(ok){\\n\\tint d=i-(l[x]-i);\\n\\tqt.emplace(d,x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n // odd\\n for(int i=0;i<l[x];i++){\\n // [0, i) + [i, i+1) + [i+1, l)\\n int k=min(i,l[x]-(i+1)),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+1+j];\\n if(ok){\\n\\tint d=i-(l[x]-(i+1));\\n\\tqt.emplace(i-(l[x]-(i+1)),x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n }\\n\\n // s[x] |center| s[y] (obviously even)\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n if(!E[x][y]) continue;\\n int k=min(l[x],l[y]),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][l[x]-(j+1)]==s[y][j];\\n if(ok){\\n\\tint d=l[x]-l[y];\\n\\tqt.emplace(d,x,y);\\n\\tchmax(dp[idx(d,x,x)],l[x]+l[y]);\\n }\\n } \\n }\\n\\n using P = pair<int, int>;\\n vector<vector<P> > G(sz),R(sz);\\n \\n for(int d=-D;d<=D;d++){\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n\\tint v=idx(d,x,y);\\n\\t//cout<<v<<\\\":\\\"<<d<<\\\" \\\"<<x<<\\\" \\\"<<y<<endl;\\n\\tfor(int i=0;i<n;i++){\\n\\t // s[i] s[x] s[y]\\n\\t if(d<=0&&E[i][x]){\\n\\t int k=min(-d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]+d+j];\\n\\t if(ok){\\t \\n\\t int nd=d+l[i];\\n\\t int u=idx(nd,i,y);\\n\\t //cout<<v<<\\\" -> \\\"<<u<<endl;\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t // s[x] s[y] s[i]\\n\\t if(d>=0&&E[y][i]){\\n\\t int k=min(d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][j]==s[x][d-(j+1)];\\n\\t if(ok){\\n\\t int nd=d-l[i];\\n\\t int u=idx(nd,x,i);\\n\\t //cout<<v<<\\\" -> \\\"<<u<<endl;\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t}\\n } \\n }\\n }\\n\\n // find nodes that can reached from starts\\n while(!qt.empty()){\\n int d,x,y;\\n tie(d,x,y)=qt.front();qt.pop();\\n int v=idx(d,x,y);\\n //cout<<dp[v]<<\\\":\\\"<<d<<\\\" \\\"<<x<<\\\" \\\"<<y<<endl;\\n for(auto e:G[v]){\\n int u,c;\\n tie(u,c)=e;\\n if(~dp[u]) continue;\\n chmax(dp[u],dp[v]+c);\\n qt.emplace(inv(u)); \\n } \\n }\\n\\n vector<int> dp2(sz,-1),used(sz,0),visit(sz,-1);\\n queue<int> qu;\\n int pos=0;\\n function<int(int)> dfs=\\n [&](int v){\\n int &res=dp2[v];\\n if(used[v]) return res;\\n //cout<<v<<\\\"****\\\"<<endl;\\n //cout<<get<0>(inv(v))<<\\\":\\\"<<get<1>(inv(v))<<\\\":\\\"<<get<2>(inv(v))<<endl;\\n \\n visit[v]=pos++;\\n qu.emplace(v);\\n res=dp[v];\\n for(auto e:R[v]){\\n\\tint u,c;\\n\\ttie(u,c)=e;\\n\\t//cout<<setw(6)<<v<<\\\":\\\"<<setw(3)<<dp[v]<<\\\":\\\"<<setw(3)<<visit[v]<<endl;\\n\\t//cout<<setw(6)<<u<<\\\"+\\\"<<setw(3)<<dp[u]<<\\\"+\\\"<<setw(3)<<visit[u]<<endl;\\n\\tif(dp[u]<0) continue;\\n\\tif(~visit[u]&&visit[u]<=visit[v]){\\n\\t cout<<-1<<endl;\\n\\t exit(0);\\n\\t}\\n\\tchmax(res,dfs(u)+c);\\n }\\n return res;\\n };\\n \\n int ans=0;\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n int v=idx(0,x,y);\\n if(~dp[v]) chmax(ans,dfs(v));\\n while(!qu.empty()){\\n\\tused[qu.front()]=1;\\n\\tqu.pop();\\n }\\n }\\n }\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.5816326530612245,\n \"time_ms\": 110,\n \"memory_kb\": 24084,\n \"score_of_the_acc\": -0.2034,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2307_3178207\",\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//INSERT ABOVE HERE\\nsigned main(){\\n const int D = 11;\\n \\n int n,m;\\n cin>>n>>m;\\n vector<string> s(n);\\n for(int i=0;i<n;i++) cin>>s[i];\\n\\n vector<vector<int> > E(n,vector<int>(n,0));\\n for(int i=0;i<m;i++){\\n int x,y;\\n cin>>x>>y;\\n x--;y--;\\n E[x][y]=1;\\n }\\n\\n vector<int> l(n);\\n for(int i=0;i<n;i++) l[i]=s[i].size();\\n\\n\\n using T = tuple<int, int, int>;\\n auto idx=[&](int d,int x,int y){return (D+d)*n*n+x*n+y;};\\n auto inv=[&](int v){return T(v/(n*n)-D,v%(n*n)/n,v%n);};\\n int sz=idx(D,n-1,n-1)+1;\\n\\n queue<T> qt;\\n vector<int> dp(sz,-1);\\n \\n // center inside s[x]\\n for(int x=0;x<n;x++){\\n // even\\n for(int i=1;i<l[x];i++){\\n // [0, i) + [i, l)\\n int k=min(i,l[x]-i),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+j];\\n if(ok){\\n\\tint d=i-(l[x]-i);\\n\\tqt.emplace(d,x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n // odd\\n for(int i=0;i<l[x];i++){\\n // [0, i) + [i, i+1) + [i+1, l)\\n int k=min(i,l[x]-(i+1)),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][i-(j+1)]==s[x][i+1+j];\\n if(ok){\\n\\tint d=i-(l[x]-(i+1));\\n\\tqt.emplace(i-(l[x]-(i+1)),x,x);\\n\\tchmax(dp[idx(d,x,x)],l[x]);\\n }\\n }\\n }\\n\\n // s[x] |center| s[y] (obviously even)\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n if(!E[x][y]) continue;\\n int k=min(l[x],l[y]),ok=1;\\n for(int j=0;j<k;j++)\\n\\tok&=s[x][l[x]-(j+1)]==s[y][j];\\n if(ok){\\n\\tint d=l[x]-l[y];\\n\\tqt.emplace(d,x,y);\\n\\tchmax(dp[idx(d,x,x)],l[x]+l[y]);\\n }\\n } \\n }\\n\\n using P = pair<int, int>;\\n vector<vector<P> > G(sz),R(sz);\\n \\n for(int d=-D;d<=D;d++){\\n for(int x=0;x<n;x++){\\n for(int y=0;y<n;y++){\\n\\tif(!E[x][y]) continue;\\n\\tfor(int i=0;i<n;i++){\\n\\t // s[i] s[x] s[y]\\n\\t if(d<=0&&E[i][x]){\\n\\t int k=min(-d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][l[i]-(j+1)]==s[y][l[y]-d+j];\\n\\t if(ok){\\n\\t int nd=d+l[i];\\n\\t int v=idx(d,x,y),u=idx(nd,i,y);\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t // s[x] s[y] s[i]\\n\\t if(d>=0&&E[y][i]){\\n\\t int k=min(d,l[i]),ok=1;\\n\\t for(int j=0;j<k;j++)\\n\\t ok&=s[i][j]==s[x][d-(j+1)];\\n\\t if(ok){\\n\\t int nd=d-l[i];\\n\\t int v=idx(d,x,y),u=idx(nd,x,i);\\n\\t G[v].emplace_back(u,l[i]);\\n\\t R[u].emplace_back(v,l[i]);\\t \\n\\t }\\n\\t }\\n\\t}\\n } \\n }\\n }\\n\\n // find nodes that can reached from starts\\n while(!qt.empty()){\\n int d,x,y;\\n tie(d,x,y)=qt.front();qt.pop();\\n int v=idx(d,x,y);\\n for(auto e:G[v]){\\n int u,c;\\n tie(u,c)=e;\\n if(~dp[u]) continue;\\n chmax(dp[u],dp[v]+c);\\n qt.emplace(inv(u)); \\n } \\n }\\n\\n vector<int> dp2(sz,-1),visit(sz,0);\\n\\n int pos=0;\\n function<int(int)> dfs=\\n [&](int v){\\n int &res=dp2[v];\\n if(~res) return res;\\n visit[v]=pos++;\\n res=dp[v];\\n for(auto e:R[v]){\\n\\tint u,c;\\n\\ttie(u,c)=e;\\n\\tif(dp[u]<0) continue;\\n\\tif(visit[u]<=visit[v]){\\n\\t cout<<-1<<endl;\\n\\t exit(0);\\n\\t}\\n\\tchmax(res,dfs(u)+c);\\n }\\n return res;\\n };\\n \\n int ans=0;\\n for(int x=0;x<n;x++)\\n for(int y=0;y<n;y++)\\n if(~dp[idx(0,x,y)]&&dp2[idx(0,x,y)]<0)\\n\\tchmax(ans,dfs(idx(0,x,y)));\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.30612244897959184,\n \"time_ms\": 10,\n \"memory_kb\": 17224,\n \"score_of_the_acc\": -0.1076,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2307_2658585\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nint main()\\n{\\n\\tvector<char>chs(2000);\\n\\tvector<vector<int>>real_edges(2000);\\n\\t{\\n\\t\\tint N, M; cin >> N >> M;\\n\\t\\tvector<string>sts;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tstring st; cin >> st;\\n\\t\\t\\tsts.push_back(st);\\n\\t\\t}\\n\\t\\tvector<pair<int, int>>edges;\\n\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\tint a, b; cin >> a >> b;\\n\\t\\t\\ta--; b--;\\n\\t\\t\\tedges.push_back(make_pair(a, b));\\n\\t\\t}\\n\\t\\tint id = 0;\\n\\t\\tvector<int>ids(N);\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tids[i] = id;\\n\\t\\t\\tfor (int j = 0; j < sts[i].size() - 1; ++j) {\\n\\t\\t\\t\\treal_edges[ids[i] + j].push_back(ids[i] + j + 1);\\n\\t\\t\\t}\\n\\t\\t\\tfor (int j = 0; j < sts[i].size(); ++j) {\\n\\t\\t\\t\\tchs[ids[i] + j] = sts[i][j];\\n\\t\\t\\t}\\n\\t\\t\\tid += sts[i].size();\\n\\t\\t}\\n\\t\\tids.push_back(id);\\n\\t\\tfor (auto e : edges) {\\n\\t\\t\\treal_edges[ids[e.first + 1] - 1].push_back(ids[e.second]);\\n\\t\\t}\\n\\t\\tconst int start = id;\\n\\t\\tconst int goal = start + 1;\\n\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\treal_edges[start].push_back(ids[i]);\\n\\t\\t\\treal_edges[ids[i + 1] - 1].push_back(goal);\\n\\t\\t}\\n\\t\\tchs.resize(goal + 1);\\n\\t\\treal_edges.resize(goal + 1);\\n\\t}\\n\\tconst int N = real_edges.size();\\n\\tvector<vector<int>>rev_edges(N);\\n\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tfor (auto e : real_edges[i]) {\\n\\t\\t\\trev_edges[e].push_back(i);\\n\\t\\t}\\n\\t}\\n\\n\\tvector<vector<int>>memo(N, vector<int>(N, -1));\\n\\tconst int S = N - 2;\\n\\tconst int G = S + 1;\\n\\tmemo[S][G]=0;\\n\\tqueue<pair<int,int>>que;\\n\\tque.push(make_pair(S,G));\\n\\tint ans=0;\\n\\twhile (!que.empty()) {\\n\\t\\tconst auto atop(que.front());\\n\\t\\tque.pop();\\n\\t\\tconst int a=atop.first;\\n\\t\\tconst int b=atop.second;\\n\\n\\t\\tif(memo[a][b]>8000)break;\\n\\t\\n\\n\\t\\tfor (auto next_a : real_edges[a]) {\\n\\t\\t\\tfor (auto next_b : rev_edges[b]) {\\n\\t\\t\\t\\tif (chs[next_a] == chs[next_b]) {\\n\\t\\t\\t\\t\\tif (a == next_b&&b == next_a) {\\n\\t\\t\\t\\t\\t\\tans=max(ans,memo[a][b]);\\n\\t\\t\\t\\t\\t\\tif (ans > 2010) {\\n\\t\\t\\t\\t\\t\\t\\tans=-1;\\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 (next_b == next_a) {\\n\\t\\t\\t\\t\\t\\tans=max(ans,memo[a][b]+1);\\n\\t\\t\\t\\t\\t\\tif (ans > 2010) {\\n\\t\\t\\t\\t\\t\\t\\tans = -1;\\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 (memo[next_a][next_b] < memo[a][b]+2) {\\n\\t\\t\\t\\t\\t\\tmemo[next_a][next_b]=memo[a][b]+2;\\n\\t\\t\\t\\t\\t\\tque.push(make_pair(next_a,next_b));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<ans<<endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 19844,\n \"score_of_the_acc\": -0.3273,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2307_2658584\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n#include<unordered_map>\\n#include<unordered_set>\\n#pragma warning(disable:4996)\\nusing namespace std;\\n\\nint main()\\n{\\n\\tvector<char>chs(2000);\\n\\tvector<vector<int>>real_edges(2000);\\n\\t{\\n\\t\\tint N, M; cin >> N >> M;\\n\\t\\tvector<string>sts;\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tstring st; cin >> st;\\n\\t\\t\\tsts.push_back(st);\\n\\t\\t}\\n\\t\\tvector<pair<int, int>>edges;\\n\\t\\tfor (int i = 0; i < M; ++i) {\\n\\t\\t\\tint a, b; cin >> a >> b;\\n\\t\\t\\ta--; b--;\\n\\t\\t\\tedges.push_back(make_pair(a, b));\\n\\t\\t}\\n\\t\\tint id = 0;\\n\\t\\tvector<int>ids(N);\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\tids[i] = id;\\n\\t\\t\\tfor (int j = 0; j < sts[i].size() - 1; ++j) {\\n\\t\\t\\t\\treal_edges[ids[i] + j].push_back(ids[i] + j + 1);\\n\\t\\t\\t}\\n\\t\\t\\tfor (int j = 0; j < sts[i].size(); ++j) {\\n\\t\\t\\t\\tchs[ids[i] + j] = sts[i][j];\\n\\t\\t\\t}\\n\\t\\t\\tid += sts[i].size();\\n\\t\\t}\\n\\t\\tids.push_back(id);\\n\\t\\tfor (auto e : edges) {\\n\\t\\t\\treal_edges[ids[e.first + 1] - 1].push_back(ids[e.second]);\\n\\t\\t}\\n\\t\\tconst int start = id;\\n\\t\\tconst int goal = start + 1;\\n\\n\\t\\tfor (int i = 0; i < N; ++i) {\\n\\t\\t\\treal_edges[start].push_back(ids[i]);\\n\\t\\t\\treal_edges[ids[i + 1] - 1].push_back(goal);\\n\\t\\t}\\n\\t\\tchs.resize(goal + 1);\\n\\t\\treal_edges.resize(goal + 1);\\n\\t}\\n\\tconst int N = real_edges.size();\\n\\tvector<vector<int>>rev_edges(N);\\n\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tfor (auto e : real_edges[i]) {\\n\\t\\t\\trev_edges[e].push_back(i);\\n\\t\\t}\\n\\t}\\n\\n\\tvector<vector<int>>memo(N, vector<int>(N, -1));\\n\\tconst int S = N - 2;\\n\\tconst int G = S + 1;\\n\\tmemo[S][G]=0;\\n\\tqueue<pair<int,int>>que;\\n\\tque.push(make_pair(S,G));\\n\\tint ans=0;\\n\\twhile (!que.empty()) {\\n\\t\\tconst auto atop(que.front());\\n\\t\\tque.pop();\\n\\t\\tconst int a=atop.first;\\n\\t\\tconst int b=atop.second;\\n\\n\\t\\tif(memo[a][b]>4000)break;\\n\\t\\n\\n\\t\\tfor (auto next_a : real_edges[a]) {\\n\\t\\t\\tfor (auto next_b : rev_edges[b]) {\\n\\t\\t\\t\\tif (chs[next_a] == chs[next_b]) {\\n\\t\\t\\t\\t\\tif (a == next_b&&b == next_a) {\\n\\t\\t\\t\\t\\t\\tans=max(ans,memo[a][b]);\\n\\t\\t\\t\\t\\t\\tif (ans > 2010) {\\n\\t\\t\\t\\t\\t\\t\\tans=-1;\\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 (next_b == next_a) {\\n\\t\\t\\t\\t\\t\\tans=max(ans,memo[a][b]+1);\\n\\t\\t\\t\\t\\t\\tif (ans > 2010) {\\n\\t\\t\\t\\t\\t\\t\\tans = -1;\\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 (memo[next_a][next_b] < memo[a][b]+2) {\\n\\t\\t\\t\\t\\t\\tmemo[next_a][next_b]=memo[a][b]+2;\\n\\t\\t\\t\\t\\t\\tque.push(make_pair(next_a,next_b));\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout<<ans<<endl;\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.41836734693877553,\n \"time_ms\": 10,\n \"memory_kb\": 7184,\n \"score_of_the_acc\": 0,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":1289,"cells":{"group_id":{"kind":"string","value":"aoj_2311_cpp"},"problem_description":{"kind":"string","value":"問題文\nお菓子の魔女 CHARLOTTE は\n巴マミ\nとクッキーゲームを楽しんでいる．クッキーゲームは\n8\\times 8\nの格子状に区切られたテーブルクロスの上にチーズクッキーとチョコレートクッキーを置いて行われる．各格子には高々\n1\n個のチョコレートクッキーまたはチーズクッキーしか置くことはできない．\nお菓子の魔女はチーズクッキーを，\n巴マミ\nはチョコレートクッキーを交互に置いてゲームを行う．自分のクッキーを置いたあと，そのクッキーから上下左右斜めの各\n8\n方向について，置くクッキーとすでに置いていた自分のクッキーの間に相手のクッキーのみが直線に並んでいた場合に，その挟まれた相手のクッキーのすべてが自分のクッキーで置き換えられる．クッキーゲームのプレイヤーは自分のターンが回ってきた時，\n1\nつ自分のクッキーを置くことができる．ただし，相手のクッキーを少なくとも\n1\nつ以上自分のクッキーに置き換えられなければならない．そのような置き場がない場合，自分のターンをパスをしなければならない．\nお菓子の魔女も\n巴マミ\nも考えるのが少々苦手である．そこで，回ってきたターン毎にそのターンの中で置き換えられるクッキーの数を最大化することを考えることにした．\n巴マミ\nのターンのときに置き換えられるクッキーの数を最大にするようなクッキーを置く場所の候補が複数ある場合は，より上の場所を，それでも複数ある場合はより左の場所を選択することにした．また同様に，お菓子の魔女のターンのときに候補が複数ある場合はより下の場所を，それでも複数ある場合はより右の場所を選択することにした．\nテーブルクロスに置かれたクッキーの状態が与えられるので，巴マミからはじめ，彼女たちがそこからクッキーゲームを行い，共に新たなクッキーが置けなくなるまでゲームを続けた時のテーブルクロスの上に置かれたクッキーの状態を求めよ．\n入力形式\n入力は以下の形式で与えられる．\ns_{11} s_{12} ... s_{18}\\\\\ns_{21} s_{22} ... s_{28}\\\\\n...\\\\\ns_{81} s_{82} ... s_{88}\\\\\ns_{ij}\nはテーブルクロスに置かれたクッキーの初期状態を表す文字で，上から\ni\n行目，左から\nj\n列目の格子の状態を表す．チョコレートクッキーが置かれているとき\ns_{ij}\nは\n'o'\nであり，チーズクッキーが置かれているときは\n'x'\n, 何も置かれていないときは\n'.'\nとなる．\n出力形式\nクッキーゲームが行われた後のテーブルクロスの上に置かれたクッキーの状態を，入力形式と同じ形式で出力せよ．\n制約\ns_{ij}\nは\n'o'\n,\n'x'\n,\n'.'\nのいずれかである．\n入出力例\n入力例 1\nooox....\n.x......\nooo.....\n........\n........\n........\n........\n........\n出力例1\nooooo...\n.o......\nooo.....\n...o....\n....o...\n........\n........\n........\n入力例 2\n........\n........\n........\n...ox...\n...xo...\n........\n........\n........\n出力例 2\nxxxxxxxx\nxxxooxxx\nxxxxooxx\nxxxxxxxx\nooxxooox\nooxoooox\noxooooox\nooooooox\n入力例 3\n........\n........\n..ooo...\n..oxo...\n..ooo...\n........\n........\n........\n出力例 3\n........\n........\n..ooo...\n..ooo...\n..ooo...\n.....o..\n......o.\n........\nProblem Setter: Flat35"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2311_3524913","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <bitset>\n#include <map>\n#include <tuple>\n#include <unordered_set>\n#include <unordered_map>\n#include <list>\n#include <numeric>\n#include <utility>\n#include <iterator>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <random>\n#include <cstring>\n\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\nusing namespace std;\nusing ll = long long;\n\nconst ll mod = 1000000007;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nint ddx[8]={-1,-1,0,1,1,1,0,-1};\nint ddy[8]={0,1,1,1,0,-1,-1,-1};\nbool debug=false;\n\n/*---------------------------------------------------*/\n\n#define CHOCO 'o'\n#define CHEESE 'x'\n#define NONE '.'\n\nusing Board = vector<vector<char>>;\n\nstruct Vector2 {\n int x;\n int y;\n};\n\nvoid debug_print(Board& board){\n for(int i = 0 ; i < 8; i++){\n for(int j = 0; j < 8; j++){\n cout << board[i][j]; \n }\n cout << endl;\n }\n cout << endl;\n}\n\nbool in_area(Vector2 v){\n return 0 <= v.x && v.x < 8 && 0 <= v.y && v.y < 8;\n}\n\nbool is_reverse(Board board, Vector2 v, int x, int y, char color){\n v.x += x; v.y += y;\n char check = (color == CHOCO ? CHEESE : CHOCO);\n bool ok = false;\n while(in_area(v)){\n if(board[v.y][v.x] == check) ok = true;\n else if(board[v.y][v.x] == color && ok) return true;\n else break;\n v.x += x; v.y += y;\n }\n return false;\n}\n\nint reverse_count(Board board, Vector2 v, char color){\n int reverse_num = 0;\n board[v.y][v.x] = color;\n for(int i = 0; i < 8; i++){\n if(is_reverse(board, v, ddx[i], ddy[i], color)) {\n Vector2 vv = v;\n vv.x += ddx[i], vv.y += ddy[i];\n while(board[vv.y][vv.x] != color) {\n\tboard[vv.y][vv.x] = color;\n\treverse_num++;\n\tvv.x += ddx[i], vv.y += ddy[i];\n }\n }\n }\n return reverse_num;\n}\n\nvoid reverse(Board& board, Vector2 v, char color){\n int reverse_num = 0;\n board[v.y][v.x] = color;\n for(int i = 0; i < 8; i++){\n if(is_reverse(board, v, ddx[i], ddy[i], color)) {\n Vector2 vv = v;\n vv.x += ddx[i], vv.y += ddy[i];\n while(board[vv.y][vv.x] != color) {\n\tboard[vv.y][vv.x] = color;\n\treverse_num++;\n\tvv.x += ddx[i], vv.y += ddy[i];\n }\n }\n }\n}\n\nvoid simulate(Board& board, char& color){\n int max_reverse = 0;\n Vector2 position;\n if(color == CHOCO){\n for(int h = 0; h < 8; h++){\n for(int w = 0; w < 8; w++) {\n\tif(board[h][w] != NONE) continue;\n\tint rev = reverse_count(board, {w, h}, color);\n\tif(max_reverse < rev) {\n\t max_reverse = rev;\n\t position = {w, h};\n\t}\n }\n }\n } else {\n for(int h = 7; h >= 0; h--){\n for(int w = 7; w >= 0; w--) {\n\tif(board[h][w] != NONE) continue;\n\tint rev = reverse_count(board, {w, h}, color);\n\tif(max_reverse < rev) {\n\t max_reverse = rev;\n\t position = {w, h};\n\t}\n }\n }\n }\n if(max_reverse == 0) return ;\n reverse(board, position, color);\n}\n\nint main(){\n vector<vector<char>> board = vector<vector<char>>(8, vector<char>(9));\n for(int i = 0; i < 8; i++){\n for(int j = 0; j < 8; j++){\n cin >> board[i][j];\n }\n }\n \n for(int turn = 0; turn < 64 * 2; turn++){\n char color = (turn % 2 == 0 ? CHOCO : CHEESE);\n simulate(board, color);\n // debug_print(board);\n }\n \n for(int i = 0 ; i < 8; i++){\n for(int j = 0; j < 8; j++){\n cout << board[i][j]; \n }\n cout << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3172,"score_of_the_acc":-0.9714,"final_rank":2},{"submission_id":"aoj_2311_2295235","code_snippet":"#include \"bits/stdc++.h\"\n\n#define REP(i,n) for(ll i=0;i<n;++i)\n#define RREP(i,n) for(ll i=n-1;i>=0;--i)\n#define FOR(i,m,n) for(ll i=m;i<n;++i)\n#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)\n#define ALL(v) (v).begin(),(v).end()\n#define PB(a) push_back(a)\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());\n#define DUMP(v) REP(i, (v).size()) { cout << v[i]; if (i != v.size() - 1)cout << \" \"; else cout << endl; }\n#define INF 1000000001ll\n#define MOD 1000000007ll\n#define EPS 1e-9\n\nconst int dx[8] = { 1,1,0,-1,-1,-1,0,1 };\nconst int dy[8] = { 0,1,1,1,0,-1,-1,-1 };\n\n\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<vi> vvi;\ntypedef vector<vl> vvl;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nll max(ll a, int b) { return max(a, ll(b)); }\nll max(int a, ll b) { return max(ll(a), b); }\nll min(ll a, int b) { return min(a, ll(b)); }\nll min(int a, ll b) { return min(ll(a), b); }\n///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tvector<string> v(8);\n\tREP(i, 8)cin >> v[i];\n\t\n\t\n\tREP(t, 10000) {\n\t\tint p = -1, q = -1, cmax = -1;\n\t\tif (t % 2 == 0) {\n\t\t\tvi m;\n\t\t\tREP(i, 8) {\n\t\t\t\tREP(j, 8) {\n\t\t\t\t\tif (v[i][j] == '.') {\n\t\t\t\t\t\tint c = 0;\n\t\t\t\t\t\tvi s;\n\t\t\t\t\t\tREP(k, 8) {\n\t\t\t\t\t\t\tint ni = i, nj = j;\n\t\t\t\t\t\t\tint tmp = 0;\n\n\t\t\t\t\t\t\tREP(l, INF) {\n\t\t\t\t\t\t\t\tni += dx[k], nj += dy[k];\n\t\t\t\t\t\t\t\tif (ni < 0 || nj < 0 || ni >= 8 || nj >= 8)break;\n\t\t\t\t\t\t\t\tif (v[ni][nj] == 'x')tmp++;\n\t\t\t\t\t\t\t\telse if (v[ni][nj] == 'o') {\n\t\t\t\t\t\t\t\t\tif (tmp != 0)s.push_back(k);\n\t\t\t\t\t\t\t\t\tc += tmp;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse break;\n\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (cmax < c) {\n\t\t\t\t\t\t\tcmax = c, p = i, q = j;\n\t\t\t\t\t\t\tm = s;\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 (cmax <= 0)continue;\n\t\t\telse {\n\n\t\t\t\tv[p][q] = 'o';\n\t\t\t\tREP(j, m.size()) {\n\t\t\t\t\tint ni = p, nj = q;\n\t\t\t\t\tREP(i, INF) {\n\t\t\t\t\t\tni += dx[m[j]], nj += dy[m[j]];\n\t\t\t\t\t\tif (ni >= 0 && nj >= 0 && ni < 8 && nj < 8 && v[ni][nj] == 'x')v[ni][nj] = 'o';\n\t\t\t\t\t\telse break;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\n\t\t\t}\n\t\t}\n\n\t\telse {\n\t\t\tvi m;\n\t\t\tREP(i, 8) {\n\t\t\t\tREP(j, 8) {\n\t\t\t\t\tif (v[i][j] == '.') {\n\t\t\t\t\t\tint c = 0;\n\t\t\t\t\t\tvi s;\n\t\t\t\t\t\tREP(k, 8) {\n\t\t\t\t\t\t\tint ni = i, nj = j;\n\t\t\t\t\t\t\tint tmp = 0;\n\n\t\t\t\t\t\t\tREP(l, INF) {\n\t\t\t\t\t\t\t\tni += dx[k], nj += dy[k];\n\t\t\t\t\t\t\t\tif (ni < 0 || nj < 0 || ni >= 8 || nj >= 8)break;\n\t\t\t\t\t\t\t\tif (v[ni][nj] == 'o')tmp++;\n\t\t\t\t\t\t\t\telse if (v[ni][nj] == 'x') {\n\t\t\t\t\t\t\t\t\tif (tmp != 0)s.push_back(k);\n\t\t\t\t\t\t\t\t\tc += tmp;\n\t\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\telse break;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (cmax <= c) {\n\t\t\t\t\t\t\tcmax = c, p = i, q = j;\n\t\t\t\t\t\t\tm = s;\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 (cmax <= 0)continue;\n\t\t\telse {\n\n\t\t\t\tv[p][q] = 'x';\n\t\t\t\tREP(j, m.size()) {\n\t\t\t\t\tint ni = p, nj = q;\n\t\t\t\t\tREP(i, INF) {\n\t\t\t\t\t\tni += dx[m[j]], nj += dy[m[j]];\n\t\t\t\t\t\tif (ni >= 0 && nj >= 0 && ni < 8 && nj < 8 && v[ni][nj] == 'o')v[ni][nj] = 'x';\n\t\t\t\t\t\telse break;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\n\t\t\t}\n\t\t}\n\t}\n\tREP(i, 8) {\n\t\tREP(j, 8) {\n\t\t\tcout << v[i][j];\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3232,"score_of_the_acc":-2,"final_rank":3},{"submission_id":"aoj_2311_1680848","code_snippet":"#include<iostream>\nusing namespace std;\n\n#define MAX_N 12\n#define MAX_T 10000\n\nint x[MAX_N][MAX_N];\nint z[8],y[8];\nchar c,T[4]=\".ox\";\n\nint main(){\n\tfor(int i=1;i<=8;i++){\n\t\tfor(int j=1;j<=8;j++){\n\t\t\tcin>>c;\n\t\t\tif(c=='o'){\n\t\t\t\tx[i][j]=1;\n\t\t\t}\n\t\t\tif(c=='x'){\n\t\t\t\tx[i][j]=2;\n\t\t\t}\n\t\t\tif(c=='.'){\n\t\t\t\tx[i][j]=0;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i=0;i<MAX_T;i++){\n\t\tint dx[8]={0,1,1,1,0,-1,-1,-1};\n\t\tint dy[8]={-1,-1,0,1,1,1,0,-1};\n\t\tfor(int h=2;h>0;h--){\n\t\t\tint score=0,maxn=0,cnt=0,X=0,Y=0,cx=0,cy=0;\n\t\t\tfor(int j=1;j<=8;j++){\n\t\t\t\tfor(int k=1;k<=8;k++){\n\t\t\t\t\tif(x[j][k]==0){\n\t\t\t\t\t\tscore=0;\n\t\t\t\t\t\tfor(int l=0;l<8;l++){\n\t\t\t\t\t\t\tz[l]=0;\n\t\t\t\t\t\t\tcnt=0;\n\t\t\t\t\t\t\tcx=j+dx[l];cy=k+dy[l];\n\t\t\t\t\t\t\twhile(cx>=1 && cx<=8 && cy>=1 && cy<=8){\n\t\t\t\t\t\t\t\tif(x[cx][cy]==0){\n\t\t\t\t\t\t\t\t\tgoto E;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(x[cx][cy]!=h){\n\t\t\t\t\t\t\t\t\tgoto F;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tcnt++;\n\t\t\t\t\t\t\t\tcx+=dx[l];cy+=dy[l];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tgoto E;\nF:;\n\t\t\t\t\t\t\tscore+=cnt;\n\t\t\t\t\t\t\tz[l]=1;\nE:;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(score>maxn || (score==maxn && h==1)){\n\t\t\t\t\t\t\tmaxn=score;X=j;Y=k;\n\t\t\t\t\t\t\tfor(int l=0;l<8;l++){y[l]=z[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\tif(maxn>=1){\n\t\t\t\tx[X][Y]=(3-h);\n\t\t\t\tfor(int l=0;l<8;l++){\n\t\t\t\t\tif(y[l]==1){\n\t\t\t\t\t\tcx=X+dx[l];cy=Y+dy[l];\n\t\t\t\t\t\twhile(cx>=1 && cx<=8 && cy>=1 && cy<=8){\n\t\t\t\t\t\t\tif(x[cx][cy]!=h){\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tx[cx][cy]=(3-h);\n\t\t\t\t\t\t\tcx+=dx[l];cy+=dy[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}\n\tfor(int i=1;i<=8;i++){\n\t\tfor(int j=1;j<=8;j++){\n\t\t\tcout<<T[x[i][j]];\n\t\t}\n\t\tcout<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":1136,"score_of_the_acc":-0.5,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_2311_3524913\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <bitset>\\n#include <map>\\n#include <tuple>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <list>\\n#include <numeric>\\n#include <utility>\\n#include <iterator>\\n#include <cstdio>\\n#include <cmath>\\n#include <cstdlib>\\n#include <cstring>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <random>\\n#include <cstring>\\n\\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\\nusing namespace std;\\nusing ll = long long;\\n\\nconst ll mod = 1000000007;\\nint dx[4]={1,0,-1,0};\\nint dy[4]={0,1,0,-1};\\nint ddx[8]={-1,-1,0,1,1,1,0,-1};\\nint ddy[8]={0,1,1,1,0,-1,-1,-1};\\nbool debug=false;\\n\\n/*---------------------------------------------------*/\\n\\n#define CHOCO 'o'\\n#define CHEESE 'x'\\n#define NONE '.'\\n\\nusing Board = vector<vector<char>>;\\n\\nstruct Vector2 {\\n int x;\\n int y;\\n};\\n\\nvoid debug_print(Board& board){\\n for(int i = 0 ; i < 8; i++){\\n for(int j = 0; j < 8; j++){\\n cout << board[i][j]; \\n }\\n cout << endl;\\n }\\n cout << endl;\\n}\\n\\nbool in_area(Vector2 v){\\n return 0 <= v.x && v.x < 8 && 0 <= v.y && v.y < 8;\\n}\\n\\nbool is_reverse(Board board, Vector2 v, int x, int y, char color){\\n v.x += x; v.y += y;\\n char check = (color == CHOCO ? CHEESE : CHOCO);\\n bool ok = false;\\n while(in_area(v)){\\n if(board[v.y][v.x] == check) ok = true;\\n else if(board[v.y][v.x] == color && ok) return true;\\n else break;\\n v.x += x; v.y += y;\\n }\\n return false;\\n}\\n\\nint reverse_count(Board board, Vector2 v, char color){\\n int reverse_num = 0;\\n board[v.y][v.x] = color;\\n for(int i = 0; i < 8; i++){\\n if(is_reverse(board, v, ddx[i], ddy[i], color)) {\\n Vector2 vv = v;\\n vv.x += ddx[i], vv.y += ddy[i];\\n while(board[vv.y][vv.x] != color) {\\n\\tboard[vv.y][vv.x] = color;\\n\\treverse_num++;\\n\\tvv.x += ddx[i], vv.y += ddy[i];\\n }\\n }\\n }\\n return reverse_num;\\n}\\n\\nvoid reverse(Board& board, Vector2 v, char color){\\n int reverse_num = 0;\\n board[v.y][v.x] = color;\\n for(int i = 0; i < 8; i++){\\n if(is_reverse(board, v, ddx[i], ddy[i], color)) {\\n Vector2 vv = v;\\n vv.x += ddx[i], vv.y += ddy[i];\\n while(board[vv.y][vv.x] != color) {\\n\\tboard[vv.y][vv.x] = color;\\n\\treverse_num++;\\n\\tvv.x += ddx[i], vv.y += ddy[i];\\n }\\n }\\n }\\n}\\n\\nvoid simulate(Board& board, char& color){\\n int max_reverse = 0;\\n Vector2 position;\\n if(color == CHOCO){\\n for(int h = 0; h < 8; h++){\\n for(int w = 0; w < 8; w++) {\\n\\tif(board[h][w] != NONE) continue;\\n\\tint rev = reverse_count(board, {w, h}, color);\\n\\tif(max_reverse < rev) {\\n\\t max_reverse = rev;\\n\\t position = {w, h};\\n\\t}\\n }\\n }\\n } else {\\n for(int h = 7; h >= 0; h--){\\n for(int w = 7; w >= 0; w--) {\\n\\tif(board[h][w] != NONE) continue;\\n\\tint rev = reverse_count(board, {w, h}, color);\\n\\tif(max_reverse < rev) {\\n\\t max_reverse = rev;\\n\\t position = {w, h};\\n\\t}\\n }\\n }\\n }\\n if(max_reverse == 0) return ;\\n reverse(board, position, color);\\n}\\n\\nint main(){\\n vector<vector<char>> board = vector<vector<char>>(8, vector<char>(9));\\n for(int i = 0; i < 8; i++){\\n for(int j = 0; j < 8; j++){\\n cin >> board[i][j];\\n }\\n }\\n \\n for(int turn = 0; turn < 64 * 2; turn++){\\n char color = (turn % 2 == 0 ? CHOCO : CHEESE);\\n simulate(board, color);\\n // debug_print(board);\\n }\\n \\n for(int i = 0 ; i < 8; i++){\\n for(int j = 0; j < 8; j++){\\n cout << board[i][j]; \\n }\\n cout << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.9714,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2311_2295235\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\n#define REP(i,n) for(ll i=0;i<n;++i)\\n#define RREP(i,n) for(ll i=n-1;i>=0;--i)\\n#define FOR(i,m,n) for(ll i=m;i<n;++i)\\n#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)\\n#define ALL(v) (v).begin(),(v).end()\\n#define PB(a) push_back(a)\\n#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());\\n#define DUMP(v) REP(i, (v).size()) { cout << v[i]; if (i != v.size() - 1)cout << \\\" \\\"; else cout << endl; }\\n#define INF 1000000001ll\\n#define MOD 1000000007ll\\n#define EPS 1e-9\\n\\nconst int dx[8] = { 1,1,0,-1,-1,-1,0,1 };\\nconst int dy[8] = { 0,1,1,1,0,-1,-1,-1 };\\n\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef vector<vi> vvi;\\ntypedef vector<vl> vvl;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nll max(ll a, int b) { return max(a, ll(b)); }\\nll max(int a, ll b) { return max(ll(a), b); }\\nll min(ll a, int b) { return min(a, ll(b)); }\\nll min(int a, ll b) { return min(ll(a), b); }\\n///(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)(?´????????`)///\\nint main() {\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\tvector<string> v(8);\\n\\tREP(i, 8)cin >> v[i];\\n\\t\\n\\t\\n\\tREP(t, 10000) {\\n\\t\\tint p = -1, q = -1, cmax = -1;\\n\\t\\tif (t % 2 == 0) {\\n\\t\\t\\tvi m;\\n\\t\\t\\tREP(i, 8) {\\n\\t\\t\\t\\tREP(j, 8) {\\n\\t\\t\\t\\t\\tif (v[i][j] == '.') {\\n\\t\\t\\t\\t\\t\\tint c = 0;\\n\\t\\t\\t\\t\\t\\tvi s;\\n\\t\\t\\t\\t\\t\\tREP(k, 8) {\\n\\t\\t\\t\\t\\t\\t\\tint ni = i, nj = j;\\n\\t\\t\\t\\t\\t\\t\\tint tmp = 0;\\n\\n\\t\\t\\t\\t\\t\\t\\tREP(l, INF) {\\n\\t\\t\\t\\t\\t\\t\\t\\tni += dx[k], nj += dy[k];\\n\\t\\t\\t\\t\\t\\t\\t\\tif (ni < 0 || nj < 0 || ni >= 8 || nj >= 8)break;\\n\\t\\t\\t\\t\\t\\t\\t\\tif (v[ni][nj] == 'x')tmp++;\\n\\t\\t\\t\\t\\t\\t\\t\\telse if (v[ni][nj] == 'o') {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (tmp != 0)s.push_back(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tc += tmp;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\telse break;\\n\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (cmax < c) {\\n\\t\\t\\t\\t\\t\\t\\tcmax = c, p = i, q = j;\\n\\t\\t\\t\\t\\t\\t\\tm = s;\\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 (cmax <= 0)continue;\\n\\t\\t\\telse {\\n\\n\\t\\t\\t\\tv[p][q] = 'o';\\n\\t\\t\\t\\tREP(j, m.size()) {\\n\\t\\t\\t\\t\\tint ni = p, nj = q;\\n\\t\\t\\t\\t\\tREP(i, INF) {\\n\\t\\t\\t\\t\\t\\tni += dx[m[j]], nj += dy[m[j]];\\n\\t\\t\\t\\t\\t\\tif (ni >= 0 && nj >= 0 && ni < 8 && nj < 8 && v[ni][nj] == 'x')v[ni][nj] = 'o';\\n\\t\\t\\t\\t\\t\\telse break;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\telse {\\n\\t\\t\\tvi m;\\n\\t\\t\\tREP(i, 8) {\\n\\t\\t\\t\\tREP(j, 8) {\\n\\t\\t\\t\\t\\tif (v[i][j] == '.') {\\n\\t\\t\\t\\t\\t\\tint c = 0;\\n\\t\\t\\t\\t\\t\\tvi s;\\n\\t\\t\\t\\t\\t\\tREP(k, 8) {\\n\\t\\t\\t\\t\\t\\t\\tint ni = i, nj = j;\\n\\t\\t\\t\\t\\t\\t\\tint tmp = 0;\\n\\n\\t\\t\\t\\t\\t\\t\\tREP(l, INF) {\\n\\t\\t\\t\\t\\t\\t\\t\\tni += dx[k], nj += dy[k];\\n\\t\\t\\t\\t\\t\\t\\t\\tif (ni < 0 || nj < 0 || ni >= 8 || nj >= 8)break;\\n\\t\\t\\t\\t\\t\\t\\t\\tif (v[ni][nj] == 'o')tmp++;\\n\\t\\t\\t\\t\\t\\t\\t\\telse if (v[ni][nj] == 'x') {\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tif (tmp != 0)s.push_back(k);\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tc += tmp;\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\telse break;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (cmax <= c) {\\n\\t\\t\\t\\t\\t\\t\\tcmax = c, p = i, q = j;\\n\\t\\t\\t\\t\\t\\t\\tm = s;\\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 (cmax <= 0)continue;\\n\\t\\t\\telse {\\n\\n\\t\\t\\t\\tv[p][q] = 'x';\\n\\t\\t\\t\\tREP(j, m.size()) {\\n\\t\\t\\t\\t\\tint ni = p, nj = q;\\n\\t\\t\\t\\t\\tREP(i, INF) {\\n\\t\\t\\t\\t\\t\\tni += dx[m[j]], nj += dy[m[j]];\\n\\t\\t\\t\\t\\t\\tif (ni >= 0 && nj >= 0 && ni < 8 && nj < 8 && v[ni][nj] == 'o')v[ni][nj] = 'x';\\n\\t\\t\\t\\t\\t\\telse break;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tREP(i, 8) {\\n\\t\\tREP(j, 8) {\\n\\t\\t\\tcout << v[i][j];\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3232,\n \"score_of_the_acc\": -2,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2311_1680848\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\n#define MAX_N 12\\n#define MAX_T 10000\\n\\nint x[MAX_N][MAX_N];\\nint z[8],y[8];\\nchar c,T[4]=\\\".ox\\\";\\n\\nint main(){\\n\\tfor(int i=1;i<=8;i++){\\n\\t\\tfor(int j=1;j<=8;j++){\\n\\t\\t\\tcin>>c;\\n\\t\\t\\tif(c=='o'){\\n\\t\\t\\t\\tx[i][j]=1;\\n\\t\\t\\t}\\n\\t\\t\\tif(c=='x'){\\n\\t\\t\\t\\tx[i][j]=2;\\n\\t\\t\\t}\\n\\t\\t\\tif(c=='.'){\\n\\t\\t\\t\\tx[i][j]=0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int i=0;i<MAX_T;i++){\\n\\t\\tint dx[8]={0,1,1,1,0,-1,-1,-1};\\n\\t\\tint dy[8]={-1,-1,0,1,1,1,0,-1};\\n\\t\\tfor(int h=2;h>0;h--){\\n\\t\\t\\tint score=0,maxn=0,cnt=0,X=0,Y=0,cx=0,cy=0;\\n\\t\\t\\tfor(int j=1;j<=8;j++){\\n\\t\\t\\t\\tfor(int k=1;k<=8;k++){\\n\\t\\t\\t\\t\\tif(x[j][k]==0){\\n\\t\\t\\t\\t\\t\\tscore=0;\\n\\t\\t\\t\\t\\t\\tfor(int l=0;l<8;l++){\\n\\t\\t\\t\\t\\t\\t\\tz[l]=0;\\n\\t\\t\\t\\t\\t\\t\\tcnt=0;\\n\\t\\t\\t\\t\\t\\t\\tcx=j+dx[l];cy=k+dy[l];\\n\\t\\t\\t\\t\\t\\t\\twhile(cx>=1 && cx<=8 && cy>=1 && cy<=8){\\n\\t\\t\\t\\t\\t\\t\\t\\tif(x[cx][cy]==0){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tgoto E;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tif(x[cx][cy]!=h){\\n\\t\\t\\t\\t\\t\\t\\t\\t\\tgoto F;\\n\\t\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\t\\t\\t\\t\\tcx+=dx[l];cy+=dy[l];\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tgoto E;\\nF:;\\n\\t\\t\\t\\t\\t\\t\\tscore+=cnt;\\n\\t\\t\\t\\t\\t\\t\\tz[l]=1;\\nE:;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif(score>maxn || (score==maxn && h==1)){\\n\\t\\t\\t\\t\\t\\t\\tmaxn=score;X=j;Y=k;\\n\\t\\t\\t\\t\\t\\t\\tfor(int l=0;l<8;l++){y[l]=z[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\\tif(maxn>=1){\\n\\t\\t\\t\\tx[X][Y]=(3-h);\\n\\t\\t\\t\\tfor(int l=0;l<8;l++){\\n\\t\\t\\t\\t\\tif(y[l]==1){\\n\\t\\t\\t\\t\\t\\tcx=X+dx[l];cy=Y+dy[l];\\n\\t\\t\\t\\t\\t\\twhile(cx>=1 && cx<=8 && cy>=1 && cy<=8){\\n\\t\\t\\t\\t\\t\\t\\tif(x[cx][cy]!=h){\\n\\t\\t\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t\\tx[cx][cy]=(3-h);\\n\\t\\t\\t\\t\\t\\t\\tcx+=dx[l];cy+=dy[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}\\n\\tfor(int i=1;i<=8;i++){\\n\\t\\tfor(int j=1;j<=8;j++){\\n\\t\\t\\tcout<<T[x[i][j]];\\n\\t\\t}\\n\\t\\tcout<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 1136,\n \"score_of_the_acc\": -0.5,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":1290,"cells":{"group_id":{"kind":"string","value":"aoj_2305_cpp"},"problem_description":{"kind":"string","value":"Beautiful Currency\nKM country has\nN\nkinds of coins and each coin has its value\na_i\n.\nThe king of the country, Kita_masa, thought that the current currency system is poor,\nand he decided to make it\nbeautiful\nby changing the values of some (possibly no) coins.\nA currency system is called beautiful\nif each coin has an integer value and the (\ni\n+1)-th smallest value is divisible by the\ni\n-th smallest value for all\ni\n(\n1 \\leq i \\leq N-1\n).\nFor example, the set\n{1, 5, 10, 50, 100, 500}\nis considered as a beautiful system,\nwhile the set\n{1, 5, 10, 25, 50, 100}\nis NOT,\nbecause\n25\nis not divisible by\n10\n.\nSince changing the currency system may confuse citizens,\nthe king, Kita_masa, wants to minimize the maximum value of the confusion ratios.\nHere, the confusion ratio for the change in the\ni\n-th coin is defined as\n|a_i - b_i| / a_i\n,\nwhere\na_i\nand\nb_i\nis the value of\ni\n-th coin before and after the structure changes, respectively.\nNote that Kita_masa can change the value of each existing coin,\nbut he cannot introduce new coins nor eliminate existing coins.\nAfter the modification, the values of two or more coins may coincide.\nInput\nEach dataset contains two lines.\nThe first line contains a single integer,\nN\n,\nand the second line contains\nN\nintegers,\n{a_i}\n.\nYou may assume the following constraints:\n1 \\leq N \\leq 20\n1 \\leq a_1 \\lt a_2 \\lt... \\lt a_N \\lt 10^5\nOutput\nOutput one number that represents the minimum of the maximum value of the confusion ratios.\nThe value may be printed with an arbitrary number of decimal digits,\nbut may not contain an absolute error greater than or equal to\n10^{-8}\n.\nSample Input 1\n3\n6 11 12\nOutput for the Sample Input 1\n0.090909090909\nSample Input 2\n3\n6 11 24\nOutput for the Sample Input 2\n0.090909090909\nSample Input 3\n3\n6 11 30\nOutput for the Sample Input 3\n0.166666666667"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2305_10867796","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\ntypedef long long ll;\nconst double inf = 1e15;\nconst double eps = 1e-8;\nconst int N = 25;\nconst int M = 200005;\nint a[N], n;\ndouble ans, dp[N][M];\ndouble dfs(int dep, int fa) {\n\tdouble &ret = dp[dep][fa];\n\tif(ret >= -eps) return ret;\n\n\tif(dep == n)\n\t\treturn ret = (double)(fabs(fa - a[dep])) / a[dep];\n\n\tret = inf;\n\tfor(int i = fa; i < M; i += fa) {\n\t\tret = min(ret, dfs(dep+1, i));\n\t}\n\tret = max(ret, (double)(fabs(fa - a[dep])) / a[dep]);\n\treturn ret;\n}\nint main() {\n\twhile(~scanf(\"%d\", &n)) {\n\t\tfor(int i = 1; i <= n; i ++)\n\t\t\tscanf(\"%d\", &a[i]);\n\n\t\tfor(int i = 1; i <= n; i ++)\n\t\t\tfor(int j = 0; j < M; j ++)\n\t\t\t\tdp[i][j] = -1;\n\n\t\t\n\t\tdouble ans = inf;\n\t\tfor(int i = 1; i < M; i ++)\n\t\t\tans = min(ans, dfs(1, i));\n\n\t\t\n\t\tprintf(\"%.10f\\n\", ans);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":36768,"score_of_the_acc":-0.4184,"final_rank":9},{"submission_id":"aoj_2305_10689567","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <time.h>\nusing namespace std;\ntypedef long long lint ;\n#define N 150010\nvector<int> v[N] ; \nvoid get_ans(){\n for(lint i = 1 ; i < N ; i++){\n v[i].clear() ;\n }\n for(lint i = 1 ; i < N ; i++){\n for(lint j = 1 ; j < N ; j++){\n if(i*j > N) break ;\n lint tag = i*j ;\n v[tag].push_back(i) ;\n }\n }\n}\ndouble f[21][150001];\ndouble a[21];\nint main(){\n\tint n;\n\tget_ans();\n\tscanf(\"%d\",&n);\n\tfor (int i=1;i<=n;i++){\n\t\tscanf(\"%lf\",&a[i]);\n\t}\n\tfor (int i=1;i<=20;i++)\n\t\tfor (int j=1;j<=150000;j++)\n\t\t\tf[i][j]=1000000000;\n\tfor (int i=1;i<=150000;i++){\n\t\tf[1][i]=abs(a[1]-i)/a[1];\n\t}\n\tfor (int i=2;i<=n;i++){\n\t\tfor (int j=1;j<=150000;j++)\n\t\t\tfor (int k=0;k<v[j].size();k++){\n\t\t\t\tint kk=v[j][k];\n\t\t\t\tf[i][j]=min(f[i][j],max(f[i-1][kk],abs(a[i]-j)/a[i]));\n\t\t\t}\n\t}\n\tdouble ans=1000000000;\n\tfor (int j=1;j<=150000;j++){\n\t\tans=min(ans,f[n][j]);\n\t}\n\tprintf(\"%0.10lf\\n\",ans);\n}","accuracy":1,"time_ms":110,"memory_kb":42848,"score_of_the_acc":-0.4814,"final_rank":10},{"submission_id":"aoj_2305_10689531","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n#include <math.h>\n#include <string>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <map>\n#include <set>\n\nusing namespace std;\n\nconst int maxn = 22;\nconst int maxm = 111111;\ndouble dp[maxn][maxm];\nint a[maxn];\n\ndouble rat (int x, int y) {\n\treturn 1.0 * abs (x - y) / x;\n}\n\nint main () {\n\tint n, i, j, k;\n\tdouble ans, Min;\n\twhile (~scanf (\"%d\", &n)) {\n\t\tfor (i = 1; i <= n; ++i) scanf (\"%d\", &a[i]);\n\t\tmemset (dp, 0x7f, sizeof (dp));\n\t\tfor (i = 1; i < maxm; ++i) {\n\t\t\tdp[1][i] = rat(a[1], i);\n\t\t}\n\t\tfor (i = 2; i <= n; ++i) {\n\t\t\t//Min = dp[0][0];\n\t\t\tfor (j = 1; j < maxm; ++j) {\n\t\t\t\tfor (k = 1; k * j < maxm; ++k) {\n\t\t\t\t\tdp[i][k * j] = min (dp[i][k * j], max(dp[i-1][j], rat (a[i], k * j)));\n\t\t\t\t\t//printf (\"%lf %lf %lf\\n\", dp[i][k * j], dp[i-1][j], rat (a[i], k * j));\n\t\t\t\t\t//Min = min (Min, dp[i][k * j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\t//printf (\"Min: %lf\\n\", Min);\n\t\t}\n\t\tans = dp[n][1];\n\t\tfor (j = 2; j < maxm; ++j) {\n\t\t\tans = min (ans, dp[n][j]);\n\t\t}\n\t\tprintf (\"%.12lf\\n\", ans);\n\t}\n\treturn 0;\n}","accuracy":0.7254901960784313,"time_ms":30,"memory_kb":22680,"score_of_the_acc":-0.1963,"final_rank":16},{"submission_id":"aoj_2305_10689514","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<cmath>\nusing namespace std;\n\ndouble dp[25][120005];\nint num[25];\nconst double INF = 1<<29;\n\nint main() {\n\tint n;\n\tscanf(\"%d\", &n);\n\tint maxnum = 0;\n\tfor (int i = 1; i <= n; i++) {\n\t\tscanf(\"%d\", &num[i]);\n\t}\n\tdouble ans = INF;\n\tfor (int i = 1; i <= n; i++) {\n\t\tfor (int j = 1; j < 120005; j++) {\n\t\t\tint m = sqrt((double)j);\n\t\t\tdp[i][j] = INF;\n\t\t\tfor (int x = 1; x <= m; x++) {\n\t\t\t\tif (j % x == 0) {\n\t\t\t\t\tdp[i][j] = min(max(dp[i-1][x], abs((double)(j-num[i]))/num[i]), dp[i][j]);\n\t\t\t\t\tdp[i][j] = min(max(dp[i-1][j/x], abs((double)(j-num[i]))/num[i]), dp[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (i == n)\n\t\t\t\tans = min(ans, dp[i][j]);\n\t\t}\n\t}\n\tprintf(\"%.12lf\\n\", ans);\n\treturn 0;\n}","accuracy":0.7254901960784313,"time_ms":1070,"memory_kb":23072,"score_of_the_acc":-1.1908,"final_rank":17},{"submission_id":"aoj_2305_10000296","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\nusing ld = long double;\nvoid chmin(ld &a, ld b) {a = min(a, b);}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) cin >> a[i];\n \n int m = 300000;\n vector<ld> dp(m, (ld) 1);\n for(int i = 1; i < m; i ++) {\n int diff = abs(i - a[0]);\n dp[i] = ld(diff) / ld(a[0]);\n }\n for(int i = 1; i < n; i ++) {\n vector<ld> nx(m, (ld) 1);\n for(int j = 1; j < m; j ++) {\n for(int k = j; k < m; k += j) {\n int diff = abs(k - a[i]);\n chmin(nx[k], max(dp[j], ld(diff) / ld(a[i])));\n }\n }\n swap(nx, dp);\n }\n dout(*min_element(all(dp)));\n\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":12600,"score_of_the_acc":-0.3014,"final_rank":6},{"submission_id":"aoj_2305_9730237","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\n int N;\n cin >> N;\n vector<int> A(N);\n rep(i,0,N) cin >> A[i];\n int MAXS = 160000;\n vector<double> DP(MAXS,inf);\n auto CalcCost = [&](int X, int Y) -> double {\n return (double)abs(X-Y) / (double)X;\n };\n rep(i,1,MAXS) DP[i] = CalcCost(A[0],i);\n rep(i,1,N) {\n vector<double> NewDP(MAXS,inf);\n rep(j,1,MAXS) {\n rep(k,1,MAXS) {\n if (j*k >= MAXS) break;\n chmin(NewDP[j*k],max(DP[j],CalcCost(A[i],j*k)));\n }\n }\n swap(NewDP,DP);\n }\n double ANS = inf;\n rep(i,1,MAXS) chmin(ANS,DP[i]);\n printf(\"%.12f\\n\", ANS);\n}","accuracy":1,"time_ms":80,"memory_kb":6040,"score_of_the_acc":-0.0715,"final_rank":3},{"submission_id":"aoj_2305_9433950","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<vvb> vvvb;\ntypedef vector<vvvb> vvvvb;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\n#define RREP(i,n) RFOR(i,0,n)\n#define sz(A) (ll)(A.size())\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())\n#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())\n#define COU(A,x) (UB(A,x)-LB(A,x))\n#define F first\n#define S second\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<\" \"<<p.S;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}\ntemplate<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}\nconst ll mod=998244353;\nint main(){\n while(1){\n ll N;cin>>N;\n vi A(N);cin>>A;\n //0.5\n vector<vector<ld>>DP(N,vector<ld>(2e5,1e18));\n FOR(i,1,2e5)DP[0][i]=abs(1-(ld)i/A[0]);\n FOR(i,1,N)FOR(j,1,2e5)for(ll k=j;k<2e5;k+=j){\n chmin(DP[i][k],max(DP[i-1][j],abs(1-(ld)k/A[i])));\n }\n ld ans=1e18;\n REP(i,2e5)chmin(ans,DP[N-1][i]);\n printf(\"%.20Lf\\n\",ans);\n return 0;\n }\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":68720,"score_of_the_acc":-0.8256,"final_rank":13},{"submission_id":"aoj_2305_9003846","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint main() {\n int N = in();\n vector<int> a = in(N);\n \n const int MAX_A = 100'000 * 2;\n const f64 INF = 1e18;\n vector<f64> dp(MAX_A + 1, INF);\n dp[1] = 0.0;\n for(int i : rep(N)) {\n vector<f64> nt(MAX_A + 1, INF);\n for(int prev = 1; prev <= MAX_A; prev++) {\n for(int x = prev; x <= MAX_A; x += prev) {\n chmin(nt[x], max(dp[prev], f64(abs(x - a[i])) / a[i]));\n }\n }\n dp = move(nt);\n }\n\n printer::precision(20);\n print(min_of<f64>(dp).val);\n}","accuracy":1,"time_ms":200,"memory_kb":9460,"score_of_the_acc":-0.2212,"final_rank":5},{"submission_id":"aoj_2305_9003842","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint main() {\n int N = in();\n vector<int> a = in(N);\n \n const int MAX_A = 100'000;\n const f64 INF = 1e18;\n vector<f64> dp(MAX_A + 1, INF);\n dp[1] = 0.0;\n for(int i : rep(N)) {\n vector<f64> nt(MAX_A + 1, INF);\n for(int prev = 1; prev <= MAX_A; prev++) {\n for(int x = prev; x <= MAX_A; x += prev) {\n chmin(nt[x], max(dp[prev], abs(x - a[i]) / f64(a[i])));\n }\n }\n dp = move(nt);\n }\n\n printer::precision(20);\n print(min_of<f64>(dp).val);\n}","accuracy":0.6274509803921569,"time_ms":80,"memory_kb":6268,"score_of_the_acc":-0.0739,"final_rank":19},{"submission_id":"aoj_2305_8304958","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\n\ntemplate<class T>\nbool chmin(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\nconst int amax = 2e5 + 100;\nconst ld INF = 1e18;\nld dp[25][amax];\n\nvoid init()\n{\n\tfor (int i = 0; i < 25; ++i)\n\t{\n\t\tfor (int j = 0; j < amax; ++j)\n\t\t{\n\t\t\tdp[i][j] = INF;\n\t\t}\n\t}\n\treturn;\n}\n\nvoid calc()\n{\n\tint N; cin >> N;\n\tvector<int> A(N);\n\tfor (int i = 0; i < N; ++i) {cin >> A[i];}\n\t\n\tvector<vector<int>> divisor(amax);\n\tfor (int n = 1; n < amax; ++n)\n\t{\n\t\tfor (int a = 1; a * a <= n; ++a)\n\t\t{\n\t\t\tif (n % a == 0)\n\t\t\t{\n\t\t\t\tdivisor[n].emplace_back(a);\n\t\t\t\tdivisor[n].emplace_back(n/a);\n\t\t\t}\n\t\t}\n\t\tsort(divisor[n].begin(), divisor[n].end());\t\t\n\t}\n\tinit();\n\t\n\tfor (int i = 0; i < N; ++i)\n\t{\n\t\tint a = A[i];\n\t\tfor (int n = 1; n < amax; ++n)\n\t\t{\n\t\t\tld diff = (ld)abs(n - a) / a;\n\t\t\t\n\t\t\tif (i == 0) {dp[i][n] = diff; continue;}\n\t\t\t\n\t\t\tfor (auto d : divisor[n])\n\t\t\t{\n\t\t\t\tchmin(dp[i][n], max(dp[i-1][d], diff));\n\t\t\t}\n\t\t}\n\t}\n\t\n\tld res = INF;\n\tfor (int n = 1; n < amax; ++n)\n\t{\n\t\tchmin(res, dp[N-1][n]);\n\t}\n\tcout << fixed << setprecision(20) << res << endl;\n\t\n\treturn;\n}\n\nint main()\n{\n\tcalc();\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":300,"memory_kb":101184,"score_of_the_acc":-1.2667,"final_rank":15},{"submission_id":"aoj_2305_7104164","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n// #include<atcoder/mincostflow>\nusing namespace std;\n// using namespace atcoder;\n\nvoid solve(){\n\tcout << fixed << setprecision(12);\n\tint n;\n\tcin >> n;\n\tvector<long double> A(n);\n\tfor(int i = 0; i < n; i++) cin >> A[i];\n\tconst int N = 200000;\n\tvector<long double> dp(N);\n\tfor(int i = 1; i < N; i++) dp[i] = abs(A[0] - i) / A[0];\n\t\n\tfor(int i = 1; i < n; i++){\n\t\tlong double a = A[i];\n\t\tvector<long double> nex(N, 1e9);\n\t\tfor(int j = 1; j < N; j++){\n\t\t\tfor(int k = j; k < N; k += j){\n\t\t\t\tnex[k] = min(nex[k], dp[j]);\n\t\t\t}\n\t\t\tnex[j] = max(nex[j], abs(a - j) / a);\n\t\t}\n\t\tswap(dp, nex);\n\t}\n\tlong double ans = 1e9;\n\tfor(int i = 1; i < N; i++) ans = min(ans, dp[i]);\n\tcout << ans << \"\\n\";\n}\n\nint main(){\n\tcin.tie(0)->sync_with_stdio(0);\n\tint t;\n\tt = 1;\n\t// cin >> t;\n\twhile(t--) solve();\n}","accuracy":1,"time_ms":110,"memory_kb":9544,"score_of_the_acc":-0.1364,"final_rank":4},{"submission_id":"aoj_2305_6444946","code_snippet":"#line 1 \"a.cpp\"\n#define PROBLEM \"\"\n#line 2 \"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\"\n#pragma GCC target(\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#line 2 \"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T, class U>\nbool chmax(T &a, const U &b) {\n return a < b ? a = b, true : false;\n}\ntemplate <class T, class U>\nbool chmin(T &a, const U &b) {\n return b < a ? a = b, true : false;\n}\nconstexpr int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr int MOD = 1000000007;\nconstexpr int MOD_N = 998244353;\nconstexpr double EPS = 1e-7;\nconst double PI = acos(-1.0);\n#line 6 \"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\"\nusing ll = int64_t;\nusing ld = long double;\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()\ntemplate<class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) { is >> p.first >> p.second; return is; }\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &i : v) is>>i; return is; }\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; } return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head&& head, Tail&&... tail) {\n if constexpr(sizeof...(tail)==0) std::cout<<head<<'\\n'; else std::cout<<head<<' ',co(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'; else std::cerr<<head<<' ',ce(forward<Tail>(tail)...);\n}\ntemplate<typename T, typename... Args>\nauto make_vector(T x, int arg, Args ...args) {\n if constexpr(sizeof...(args)==0) return std::vector<T>(arg,x); else return std::vector(arg,make_vector<T>(x,args...));\n}\nvoid sonic() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); }\nvoid setp(const int n) { std::cout<<std::fixed<<std::setprecision(n); }\nvoid Yes(bool is_correct) { std::cout<<(is_correct?\"Yes\":\"No\")<<std::endl; }\nvoid YES(bool is_correct) { std::cout<<(is_correct?\"YES\":\"NO\")<<std::endl; }\n#line 3 \"a.cpp\"\n\nint main(void) {\n sonic();\n int n;\n cin >> n;\n vector<int> a(n);\n cin >> a;\n\n vector<vector<double>> dp(n, vector<double>(200001, Inf));\n repr(i, n) {\n repn(j, 200000) {\n if (i == n - 1)\n dp[i][j] = (double)abs(j - a[i]) / a[i];\n else {\n rep(k, 200001) {\n if (j * k > 200000)\n break;\n chmin(dp[i][j], dp[i + 1][j * k]);\n }\n chmax(dp[i][j], (double)abs(j - a[i]) / a[i]);\n }\n }\n }\n\n double ans = Inf;\n repn(i, 200000) chmin(ans, dp[0][i]);\n setp(10);\n co(ans);\n\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":35712,"score_of_the_acc":-0.3503,"final_rank":7},{"submission_id":"aoj_2305_6025370","code_snippet":"#pragma region Macros\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate <class T> inline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T> inline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\n\nstruct Setup {\n Setup() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n }\n} __Setup;\n\nusing ll = long long;\n#define OVERLOAD3(_1, _2, _3, name, ...) name\n#define ALL(v) (v).begin(), (v).end()\n#define RALL(v) (v).rbegin(), (v).rend()\n#define REP1(i, n) for(int i = 0; i < (n); i++)\n#define REP2(i, a, b) for(int i = (a); i < int(b); i++)\n#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\nconst int INF = 1 << 30;\nconst ll LLINF = 1LL << 60;\nconstexpr int MOD = 1000000007;\nconstexpr int MOD2 = 998244353;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\nvoid Case(int i) { cout << \"Case #\" << i << \": \"; }\nint popcount(int x) { return __builtin_popcount(x); }\nll popcount(ll x) { return __builtin_popcountll(x); }\n#pragma endregion Macros\n\nconst int MAX = 1000010;\ndouble dp[2][MAX];\nint N;\nint a[21];\n\nint main() {\n cin >> N;\n REP(i, N) cin >> a[i];\n\n REP(i, 2) REP(j, MAX) dp[i][j] = INF;\n int now = 0, nxt = 1;\n dp[now][1] = 0;\n REP(i, N) {\n REP(j, 1, MAX) {\n if(dp[now][j] == INF) continue;\n for(int k = j; k < MAX; k += j) {\n chmin(dp[nxt][k], max(dp[now][j], double(abs(a[i] - k)) / a[i]));\n }\n dp[now][j] = INF;\n }\n swap(now, nxt);\n }\n double ans = INF;\n REP(j, MAX) chmin(ans, dp[now][j]);\n cout << ans << endl;\n}","accuracy":1,"time_ms":400,"memory_kb":19236,"score_of_the_acc":-0.513,"final_rank":11},{"submission_id":"aoj_2305_6012422","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 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\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\nvoid solve(){\n int N; cin>>N;\n vector<int> a(N);\n for(int i=0;i<N;i++) cin>>a[i];\n \n auto dp=vmake(N+1,2e5+10,(long double)MAX);\n dp[0][1]=0;\n\n for(int i=0;i<N;i++){\n for(int j=1;j<=2e5;j++){\n for(int k=j;k<=2e5;k+=j){\n long double x=abs(k-a[i]);\n x/=a[i];\n chmin(dp[i+1][k],max(dp[i][j],x));\n }\n }\n }\n long double ans=INF;\n for(auto x:dp[N]) chmin(ans,x);\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":210,"memory_kb":71868,"score_of_the_acc":-0.8773,"final_rank":14},{"submission_id":"aoj_2305_6012421","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 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\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\nvoid solve(){\n int N; cin>>N;\n vector<int> a(N);\n for(int i=0;i<N;i++) cin>>a[i];\n \n auto dp=vmake(N+1,2e5+10,(long double)MAX);\n dp[0][1]=0;\n\n for(int i=0;i<N;i++){\n for(int j=1;j<=2e5;j++){\n for(int k=j;k<=2e5;k+=j){\n long double x=abs(k-a[i]);\n x/=a[i];\n chmin(dp[i+1][k],max(dp[i][j],x));\n }\n }\n }\n long double ans=INF;\n for(auto x:dp[N]) if(x>EPS)chmin(ans,x);\n cout<<ans<<endl;\n}\n\nint main(){\n bin101();\n int T=1;\n //cin>>T;\n while(T--) solve();\n}","accuracy":0.058823529411764705,"time_ms":30,"memory_kb":18708,"score_of_the_acc":-0.1551,"final_rank":20},{"submission_id":"aoj_2305_6011745","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\n\nvector<vll> Q = { {1,2,5,6},{2,3,6,7},{3,4,7,8},{5,6,9,10},{6,7,10,11},{7,8,11,12},{9,10,13,14},{10,11,14,15},{11,12,15,16} };\nvector<vll> T = { {0,1,2,3,6},{0,1,2,4,7},{0,1,2,5,8},{3,4,5,0,6},{3,4,5,1,7},{3,4,5,2,8},{6,7,8,0,3},{6,7,8,1,4},{6,7,8,2,5} };\n\ndouble di(pair<double, double> P1, pair<double, double> P2) {\n\tdouble dx = P1.first - P2.first;\n\tdouble dy = P1.second - P2.second;\n\treturn sqrt(dx * dx + dy * dy);\n}\n\n/*bool kousa(pair<double, double> P1, pair<double, double> P2, pair<double, double> Q1, pair<double, double> Q2) {\n\tdouble xa = P1.first;\n\tdouble xb = P2.first;\n\tdouble ya = P1.second;\n\tdouble yb = P2.second;\n\tdouble xc = Q1.first;\n\tdouble xd = Q2.first;\n\tdouble yc = Q1.second;\n\tdouble yd = Q2.second;\n\tdouble s = (xa - xb) * (yc - ya) - (ya - yb) * (xc - xa);\n\tdouble t = (xa - xb) * (yd - ya) - (ya - yb) * (xd - xa);\n\treturn (s*t>=0);\n\n}*/\n\n\n\n\n\nint main() {\n\tll N;\n\tcin >> N;\n\tvll A(N);\n\trep(i, N) {\n\t\tcin >> A[i];\n\t}\n\tvector<vector<double>> DP(N + 1, vector<double>(ll(3e5), 1e18));\n\tDP[0][1] = 0;\n\trep(i, N) {\n\t\trep(k, 3e5) {\n\t\t\tif (k == 0)continue;\n\t\t\tfor (ll j = k; j < 3e5; j += k) {\n\t\t\t\tdouble p = double(abs(A[i] - j)) / double(A[i]);\n\t\t\t\tDP[i + 1][j] = min(DP[i + 1][j], max(DP[i][k],p));\n\t\t\t}\n\t\t}\n\t}\n\tdouble an = 1e18;\n\trep(i, 3e5) {\n\t\tan = min(an, DP[N][i]);\n\t}\n\tcout << fixed << setprecision(16) << an << endl;\n}","accuracy":1,"time_ms":130,"memory_kb":54644,"score_of_the_acc":-0.6226,"final_rank":12},{"submission_id":"aoj_2305_5960619","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n int N;\n cin >> N;\n vector<int> a(N);\n for (auto& x : a) cin >> x;\n const int M = 2e5;\n vector<vector<double>> ratio(N+1, vector<double>(M, 1e9));\n ratio[0][1] = 0;\n for (int i = 0; i < N; ++i) {\n for (int j = 1; j < M; ++j) {\n for (int k = 1; j * k < M; ++k) {\n ratio[i+1][j*k] = min(ratio[i+1][j*k], max(ratio[i][j], 1.0*abs(j*k - a[i])/a[i]));\n }\n }\n }\n cout << *min_element(ratio[N].begin(), ratio[N].end()) << \"\\n\";\n}","accuracy":1,"time_ms":60,"memory_kb":37276,"score_of_the_acc":-0.3761,"final_rank":8},{"submission_id":"aoj_2305_5925545","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int MAX_A = 200010;\nconst double INF = 1e9;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n int N;\n cin >> N;\n\n vector<double> dp(MAX_A, INF), ndp(MAX_A, INF);\n dp[1] = 0;\n for (int i = 0; i < N; i++) {\n int a;\n cin >> a;\n for (int j = MAX_A - 1; j > 0; j--) {\n for (int k = j + j; k < MAX_A; k += j) {\n dp[k] = min(dp[k], dp[j]);\n }\n }\n for (int j = 1; j < MAX_A; j++) dp[j] = max(dp[j], double(abs(j - a)) / a);\n }\n\n double ans = *min_element(dp.begin(), dp.end());\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":6236,"score_of_the_acc":-0.045,"final_rank":1},{"submission_id":"aoj_2305_5925540","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\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\nconst int MAX_A = 200010;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n int N;\n cin >> N;\n\n vector<double> dp(MAX_A, INF), ndp(MAX_A, INF);\n dp[1] = 0;\n for (int i = 0; i < N; i++) {\n int a;\n cin >> a;\n for (int j = MAX_A - 1; j > 0; j--) {\n for (int k = j + j; k < MAX_A; k += j) {\n dp[k] = min(dp[k], dp[j]);\n }\n }\n for (int j = 1; j < MAX_A; j++) dp[j] = max(dp[j], double(abs(j - a)) / a);\n }\n\n double ans = *min_element(dp.begin(), dp.end());\n cout << ans << '\\n';\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":6244,"score_of_the_acc":-0.0451,"final_rank":2},{"submission_id":"aoj_2305_5925533","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\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\nconst int MAX_A = 100010;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n int N;\n cin >> N;\n\n vector<double> dp(MAX_A, INF), ndp(MAX_A, INF);\n dp[1] = 0;\n for (int i = 0; i < N; i++) {\n int a;\n cin >> a;\n for (int j = MAX_A - 1; j > 0; j--) {\n for (int k = j + j; k < MAX_A; k += j) {\n dp[k] = min(dp[k], dp[j]);\n }\n }\n for (int j = 1; j < MAX_A; j++) dp[j] = max(dp[j], double(abs(j - a)) / a);\n }\n\n double ans = *min_element(dp.begin(), dp.end());\n cout << ans << '\\n';\n return 0;\n}","accuracy":0.6274509803921569,"time_ms":20,"memory_kb":4652,"score_of_the_acc":0,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_2305_10867796\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <algorithm>\\n#include <cmath>\\nusing namespace std;\\ntypedef long long ll;\\nconst double inf = 1e15;\\nconst double eps = 1e-8;\\nconst int N = 25;\\nconst int M = 200005;\\nint a[N], n;\\ndouble ans, dp[N][M];\\ndouble dfs(int dep, int fa) {\\n\\tdouble &ret = dp[dep][fa];\\n\\tif(ret >= -eps) return ret;\\n\\n\\tif(dep == n)\\n\\t\\treturn ret = (double)(fabs(fa - a[dep])) / a[dep];\\n\\n\\tret = inf;\\n\\tfor(int i = fa; i < M; i += fa) {\\n\\t\\tret = min(ret, dfs(dep+1, i));\\n\\t}\\n\\tret = max(ret, (double)(fabs(fa - a[dep])) / a[dep]);\\n\\treturn ret;\\n}\\nint main() {\\n\\twhile(~scanf(\\\"%d\\\", &n)) {\\n\\t\\tfor(int i = 1; i <= n; i ++)\\n\\t\\t\\tscanf(\\\"%d\\\", &a[i]);\\n\\n\\t\\tfor(int i = 1; i <= n; i ++)\\n\\t\\t\\tfor(int j = 0; j < M; j ++)\\n\\t\\t\\t\\tdp[i][j] = -1;\\n\\n\\t\\t\\n\\t\\tdouble ans = inf;\\n\\t\\tfor(int i = 1; i < M; i ++)\\n\\t\\t\\tans = min(ans, dfs(1, i));\\n\\n\\t\\t\\n\\t\\tprintf(\\\"%.10f\\\\n\\\", ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 36768,\n \"score_of_the_acc\": -0.4184,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2305_10689567\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <cmath>\\n#include <algorithm>\\n#include <string>\\n#include <vector>\\n#include <stack>\\n#include <queue>\\n#include <set>\\n#include <map>\\n#include <time.h>\\nusing namespace std;\\ntypedef long long lint ;\\n#define N 150010\\nvector<int> v[N] ; \\nvoid get_ans(){\\n for(lint i = 1 ; i < N ; i++){\\n v[i].clear() ;\\n }\\n for(lint i = 1 ; i < N ; i++){\\n for(lint j = 1 ; j < N ; j++){\\n if(i*j > N) break ;\\n lint tag = i*j ;\\n v[tag].push_back(i) ;\\n }\\n }\\n}\\ndouble f[21][150001];\\ndouble a[21];\\nint main(){\\n\\tint n;\\n\\tget_ans();\\n\\tscanf(\\\"%d\\\",&n);\\n\\tfor (int i=1;i<=n;i++){\\n\\t\\tscanf(\\\"%lf\\\",&a[i]);\\n\\t}\\n\\tfor (int i=1;i<=20;i++)\\n\\t\\tfor (int j=1;j<=150000;j++)\\n\\t\\t\\tf[i][j]=1000000000;\\n\\tfor (int i=1;i<=150000;i++){\\n\\t\\tf[1][i]=abs(a[1]-i)/a[1];\\n\\t}\\n\\tfor (int i=2;i<=n;i++){\\n\\t\\tfor (int j=1;j<=150000;j++)\\n\\t\\t\\tfor (int k=0;k<v[j].size();k++){\\n\\t\\t\\t\\tint kk=v[j][k];\\n\\t\\t\\t\\tf[i][j]=min(f[i][j],max(f[i-1][kk],abs(a[i]-j)/a[i]));\\n\\t\\t\\t}\\n\\t}\\n\\tdouble ans=1000000000;\\n\\tfor (int j=1;j<=150000;j++){\\n\\t\\tans=min(ans,f[n][j]);\\n\\t}\\n\\tprintf(\\\"%0.10lf\\\\n\\\",ans);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 42848,\n \"score_of_the_acc\": -0.4814,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2305_10689531\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <stdio.h>\\n#include <string.h>\\n#include <stdlib.h>\\n#include <math.h>\\n#include <string>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <map>\\n#include <set>\\n\\nusing namespace std;\\n\\nconst int maxn = 22;\\nconst int maxm = 111111;\\ndouble dp[maxn][maxm];\\nint a[maxn];\\n\\ndouble rat (int x, int y) {\\n\\treturn 1.0 * abs (x - y) / x;\\n}\\n\\nint main () {\\n\\tint n, i, j, k;\\n\\tdouble ans, Min;\\n\\twhile (~scanf (\\\"%d\\\", &n)) {\\n\\t\\tfor (i = 1; i <= n; ++i) scanf (\\\"%d\\\", &a[i]);\\n\\t\\tmemset (dp, 0x7f, sizeof (dp));\\n\\t\\tfor (i = 1; i < maxm; ++i) {\\n\\t\\t\\tdp[1][i] = rat(a[1], i);\\n\\t\\t}\\n\\t\\tfor (i = 2; i <= n; ++i) {\\n\\t\\t\\t//Min = dp[0][0];\\n\\t\\t\\tfor (j = 1; j < maxm; ++j) {\\n\\t\\t\\t\\tfor (k = 1; k * j < maxm; ++k) {\\n\\t\\t\\t\\t\\tdp[i][k * j] = min (dp[i][k * j], max(dp[i-1][j], rat (a[i], k * j)));\\n\\t\\t\\t\\t\\t//printf (\\\"%lf %lf %lf\\\\n\\\", dp[i][k * j], dp[i-1][j], rat (a[i], k * j));\\n\\t\\t\\t\\t\\t//Min = min (Min, dp[i][k * j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t//printf (\\\"Min: %lf\\\\n\\\", Min);\\n\\t\\t}\\n\\t\\tans = dp[n][1];\\n\\t\\tfor (j = 2; j < maxm; ++j) {\\n\\t\\t\\tans = min (ans, dp[n][j]);\\n\\t\\t}\\n\\t\\tprintf (\\\"%.12lf\\\\n\\\", ans);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.7254901960784313,\n \"time_ms\": 30,\n \"memory_kb\": 22680,\n \"score_of_the_acc\": -0.1963,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2305_10689514\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<cmath>\\nusing namespace std;\\n\\ndouble dp[25][120005];\\nint num[25];\\nconst double INF = 1<<29;\\n\\nint main() {\\n\\tint n;\\n\\tscanf(\\\"%d\\\", &n);\\n\\tint maxnum = 0;\\n\\tfor (int i = 1; i <= n; i++) {\\n\\t\\tscanf(\\\"%d\\\", &num[i]);\\n\\t}\\n\\tdouble ans = INF;\\n\\tfor (int i = 1; i <= n; i++) {\\n\\t\\tfor (int j = 1; j < 120005; j++) {\\n\\t\\t\\tint m = sqrt((double)j);\\n\\t\\t\\tdp[i][j] = INF;\\n\\t\\t\\tfor (int x = 1; x <= m; x++) {\\n\\t\\t\\t\\tif (j % x == 0) {\\n\\t\\t\\t\\t\\tdp[i][j] = min(max(dp[i-1][x], abs((double)(j-num[i]))/num[i]), dp[i][j]);\\n\\t\\t\\t\\t\\tdp[i][j] = min(max(dp[i-1][j/x], abs((double)(j-num[i]))/num[i]), dp[i][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (i == n)\\n\\t\\t\\t\\tans = min(ans, dp[i][j]);\\n\\t\\t}\\n\\t}\\n\\tprintf(\\\"%.12lf\\\\n\\\", ans);\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.7254901960784313,\n \"time_ms\": 1070,\n \"memory_kb\": 23072,\n \"score_of_the_acc\": -1.1908,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2305_10000296\",\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\\nusing ld = long double;\\nvoid chmin(ld &a, ld b) {a = min(a, b);}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n rep(i, n) cin >> a[i];\\n \\n int m = 300000;\\n vector<ld> dp(m, (ld) 1);\\n for(int i = 1; i < m; i ++) {\\n int diff = abs(i - a[0]);\\n dp[i] = ld(diff) / ld(a[0]);\\n }\\n for(int i = 1; i < n; i ++) {\\n vector<ld> nx(m, (ld) 1);\\n for(int j = 1; j < m; j ++) {\\n for(int k = j; k < m; k += j) {\\n int diff = abs(k - a[i]);\\n chmin(nx[k], max(dp[j], ld(diff) / ld(a[i])));\\n }\\n }\\n swap(nx, dp);\\n }\\n dout(*min_element(all(dp)));\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 12600,\n \"score_of_the_acc\": -0.3014,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2305_9730237\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\n int N;\\n cin >> N;\\n vector<int> A(N);\\n rep(i,0,N) cin >> A[i];\\n int MAXS = 160000;\\n vector<double> DP(MAXS,inf);\\n auto CalcCost = [&](int X, int Y) -> double {\\n return (double)abs(X-Y) / (double)X;\\n };\\n rep(i,1,MAXS) DP[i] = CalcCost(A[0],i);\\n rep(i,1,N) {\\n vector<double> NewDP(MAXS,inf);\\n rep(j,1,MAXS) {\\n rep(k,1,MAXS) {\\n if (j*k >= MAXS) break;\\n chmin(NewDP[j*k],max(DP[j],CalcCost(A[i],j*k)));\\n }\\n }\\n swap(NewDP,DP);\\n }\\n double ANS = inf;\\n rep(i,1,MAXS) chmin(ANS,DP[i]);\\n printf(\\\"%.12f\\\\n\\\", ANS);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 6040,\n \"score_of_the_acc\": -0.0715,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2305_9433950\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<vvi> vvvi;\\ntypedef vector<bool> vb;\\ntypedef vector<vb> vvb;\\ntypedef vector<vvb> vvvb;\\ntypedef vector<vvvb> vvvvb;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\\n#define RREP(i,n) RFOR(i,0,n)\\n#define sz(A) (ll)(A.size())\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())\\n#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())\\n#define COU(A,x) (UB(A,x)-LB(A,x))\\n#define F first\\n#define S second\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<\\\" \\\"<<p.S;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}\\ntemplate<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}\\nconst ll mod=998244353;\\nint main(){\\n while(1){\\n ll N;cin>>N;\\n vi A(N);cin>>A;\\n //0.5\\n vector<vector<ld>>DP(N,vector<ld>(2e5,1e18));\\n FOR(i,1,2e5)DP[0][i]=abs(1-(ld)i/A[0]);\\n FOR(i,1,N)FOR(j,1,2e5)for(ll k=j;k<2e5;k+=j){\\n chmin(DP[i][k],max(DP[i-1][j],abs(1-(ld)k/A[i])));\\n }\\n ld ans=1e18;\\n REP(i,2e5)chmin(ans,DP[N-1][i]);\\n printf(\\\"%.20Lf\\\\n\\\",ans);\\n return 0;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 68720,\n \"score_of_the_acc\": -0.8256,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2305_9003846\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint main() {\\n int N = in();\\n vector<int> a = in(N);\\n \\n const int MAX_A = 100'000 * 2;\\n const f64 INF = 1e18;\\n vector<f64> dp(MAX_A + 1, INF);\\n dp[1] = 0.0;\\n for(int i : rep(N)) {\\n vector<f64> nt(MAX_A + 1, INF);\\n for(int prev = 1; prev <= MAX_A; prev++) {\\n for(int x = prev; x <= MAX_A; x += prev) {\\n chmin(nt[x], max(dp[prev], f64(abs(x - a[i])) / a[i]));\\n }\\n }\\n dp = move(nt);\\n }\\n\\n printer::precision(20);\\n print(min_of<f64>(dp).val);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 9460,\n \"score_of_the_acc\": -0.2212,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2305_9003842\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nint main() {\\n int N = in();\\n vector<int> a = in(N);\\n \\n const int MAX_A = 100'000;\\n const f64 INF = 1e18;\\n vector<f64> dp(MAX_A + 1, INF);\\n dp[1] = 0.0;\\n for(int i : rep(N)) {\\n vector<f64> nt(MAX_A + 1, INF);\\n for(int prev = 1; prev <= MAX_A; prev++) {\\n for(int x = prev; x <= MAX_A; x += prev) {\\n chmin(nt[x], max(dp[prev], abs(x - a[i]) / f64(a[i])));\\n }\\n }\\n dp = move(nt);\\n }\\n\\n printer::precision(20);\\n print(min_of<f64>(dp).val);\\n}\",\n \"accuracy\": 0.6274509803921569,\n \"time_ms\": 80,\n \"memory_kb\": 6268,\n \"score_of_the_acc\": -0.0739,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2305_8304958\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate<class T>\\nbool chmax(T &a, const T &b) {if (a < b) {a = b; return 1;} return 0;}\\n\\ntemplate<class T>\\nbool chmin(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\\nconst int amax = 2e5 + 100;\\nconst ld INF = 1e18;\\nld dp[25][amax];\\n\\nvoid init()\\n{\\n\\tfor (int i = 0; i < 25; ++i)\\n\\t{\\n\\t\\tfor (int j = 0; j < amax; ++j)\\n\\t\\t{\\n\\t\\t\\tdp[i][j] = INF;\\n\\t\\t}\\n\\t}\\n\\treturn;\\n}\\n\\nvoid calc()\\n{\\n\\tint N; cin >> N;\\n\\tvector<int> A(N);\\n\\tfor (int i = 0; i < N; ++i) {cin >> A[i];}\\n\\t\\n\\tvector<vector<int>> divisor(amax);\\n\\tfor (int n = 1; n < amax; ++n)\\n\\t{\\n\\t\\tfor (int a = 1; a * a <= n; ++a)\\n\\t\\t{\\n\\t\\t\\tif (n % a == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\tdivisor[n].emplace_back(a);\\n\\t\\t\\t\\tdivisor[n].emplace_back(n/a);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tsort(divisor[n].begin(), divisor[n].end());\\t\\t\\n\\t}\\n\\tinit();\\n\\t\\n\\tfor (int i = 0; i < N; ++i)\\n\\t{\\n\\t\\tint a = A[i];\\n\\t\\tfor (int n = 1; n < amax; ++n)\\n\\t\\t{\\n\\t\\t\\tld diff = (ld)abs(n - a) / a;\\n\\t\\t\\t\\n\\t\\t\\tif (i == 0) {dp[i][n] = diff; continue;}\\n\\t\\t\\t\\n\\t\\t\\tfor (auto d : divisor[n])\\n\\t\\t\\t{\\n\\t\\t\\t\\tchmin(dp[i][n], max(dp[i-1][d], diff));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tld res = INF;\\n\\tfor (int n = 1; n < amax; ++n)\\n\\t{\\n\\t\\tchmin(res, dp[N-1][n]);\\n\\t}\\n\\tcout << fixed << setprecision(20) << 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\": 300,\n \"memory_kb\": 101184,\n \"score_of_the_acc\": -1.2667,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2305_7104164\",\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<atcoder/mincostflow>\\nusing namespace std;\\n// using namespace atcoder;\\n\\nvoid solve(){\\n\\tcout << fixed << setprecision(12);\\n\\tint n;\\n\\tcin >> n;\\n\\tvector<long double> A(n);\\n\\tfor(int i = 0; i < n; i++) cin >> A[i];\\n\\tconst int N = 200000;\\n\\tvector<long double> dp(N);\\n\\tfor(int i = 1; i < N; i++) dp[i] = abs(A[0] - i) / A[0];\\n\\t\\n\\tfor(int i = 1; i < n; i++){\\n\\t\\tlong double a = A[i];\\n\\t\\tvector<long double> nex(N, 1e9);\\n\\t\\tfor(int j = 1; j < N; j++){\\n\\t\\t\\tfor(int k = j; k < N; k += j){\\n\\t\\t\\t\\tnex[k] = min(nex[k], dp[j]);\\n\\t\\t\\t}\\n\\t\\t\\tnex[j] = max(nex[j], abs(a - j) / a);\\n\\t\\t}\\n\\t\\tswap(dp, nex);\\n\\t}\\n\\tlong double ans = 1e9;\\n\\tfor(int i = 1; i < N; i++) ans = min(ans, dp[i]);\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main(){\\n\\tcin.tie(0)->sync_with_stdio(0);\\n\\tint t;\\n\\tt = 1;\\n\\t// cin >> t;\\n\\twhile(t--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 9544,\n \"score_of_the_acc\": -0.1364,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2305_6444946\",\n \"code_snippet\": \"#line 1 \\\"a.cpp\\\"\\n#define PROBLEM \\\"\\\"\\n#line 2 \\\"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\\\"\\n#pragma GCC target(\\\"avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#line 2 \\\"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T, class U>\\nbool chmax(T &a, const U &b) {\\n return a < b ? a = b, true : false;\\n}\\ntemplate <class T, class U>\\nbool chmin(T &a, const U &b) {\\n return b < a ? a = b, true : false;\\n}\\nconstexpr int64_t INF = 1000000000000000003;\\nconstexpr int Inf = 1000000003;\\nconstexpr int MOD = 1000000007;\\nconstexpr int MOD_N = 998244353;\\nconstexpr double EPS = 1e-7;\\nconst double PI = acos(-1.0);\\n#line 6 \\\"/home/kuhaku/atcoder/github/atcoder-lib/lib/template/atcoder.hpp\\\"\\nusing ll = int64_t;\\nusing ld = long double;\\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()\\ntemplate<class T, class U>\\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) { is >> p.first >> p.second; return is; }\\ntemplate <class T>\\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) { for (T &i : v) is>>i; return is; }\\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; } return os;\\n}\\ntemplate <class Head, class... Tail>\\nvoid co(Head&& head, Tail&&... tail) {\\n if constexpr(sizeof...(tail)==0) std::cout<<head<<'\\\\n'; else std::cout<<head<<' ',co(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'; else std::cerr<<head<<' ',ce(forward<Tail>(tail)...);\\n}\\ntemplate<typename T, typename... Args>\\nauto make_vector(T x, int arg, Args ...args) {\\n if constexpr(sizeof...(args)==0) return std::vector<T>(arg,x); else return std::vector(arg,make_vector<T>(x,args...));\\n}\\nvoid sonic() { std::ios::sync_with_stdio(false); std::cin.tie(nullptr); }\\nvoid setp(const int n) { std::cout<<std::fixed<<std::setprecision(n); }\\nvoid Yes(bool is_correct) { std::cout<<(is_correct?\\\"Yes\\\":\\\"No\\\")<<std::endl; }\\nvoid YES(bool is_correct) { std::cout<<(is_correct?\\\"YES\\\":\\\"NO\\\")<<std::endl; }\\n#line 3 \\\"a.cpp\\\"\\n\\nint main(void) {\\n sonic();\\n int n;\\n cin >> n;\\n vector<int> a(n);\\n cin >> a;\\n\\n vector<vector<double>> dp(n, vector<double>(200001, Inf));\\n repr(i, n) {\\n repn(j, 200000) {\\n if (i == n - 1)\\n dp[i][j] = (double)abs(j - a[i]) / a[i];\\n else {\\n rep(k, 200001) {\\n if (j * k > 200000)\\n break;\\n chmin(dp[i][j], dp[i + 1][j * k]);\\n }\\n chmax(dp[i][j], (double)abs(j - a[i]) / a[i]);\\n }\\n }\\n }\\n\\n double ans = Inf;\\n repn(i, 200000) chmin(ans, dp[0][i]);\\n setp(10);\\n co(ans);\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 35712,\n \"score_of_the_acc\": -0.3503,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2305_6025370\",\n \"code_snippet\": \"#pragma region Macros\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntemplate <class T> inline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T> inline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\n\\nstruct Setup {\\n Setup() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n }\\n} __Setup;\\n\\nusing ll = long long;\\n#define OVERLOAD3(_1, _2, _3, name, ...) name\\n#define ALL(v) (v).begin(), (v).end()\\n#define RALL(v) (v).rbegin(), (v).rend()\\n#define REP1(i, n) for(int i = 0; i < (n); i++)\\n#define REP2(i, a, b) for(int i = (a); i < int(b); i++)\\n#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\nconst int INF = 1 << 30;\\nconst ll LLINF = 1LL << 60;\\nconstexpr int MOD = 1000000007;\\nconstexpr int MOD2 = 998244353;\\nconst int dx[4] = {1, 0, -1, 0};\\nconst int dy[4] = {0, 1, 0, -1};\\n\\nvoid Case(int i) { cout << \\\"Case #\\\" << i << \\\": \\\"; }\\nint popcount(int x) { return __builtin_popcount(x); }\\nll popcount(ll x) { return __builtin_popcountll(x); }\\n#pragma endregion Macros\\n\\nconst int MAX = 1000010;\\ndouble dp[2][MAX];\\nint N;\\nint a[21];\\n\\nint main() {\\n cin >> N;\\n REP(i, N) cin >> a[i];\\n\\n REP(i, 2) REP(j, MAX) dp[i][j] = INF;\\n int now = 0, nxt = 1;\\n dp[now][1] = 0;\\n REP(i, N) {\\n REP(j, 1, MAX) {\\n if(dp[now][j] == INF) continue;\\n for(int k = j; k < MAX; k += j) {\\n chmin(dp[nxt][k], max(dp[now][j], double(abs(a[i] - k)) / a[i]));\\n }\\n dp[now][j] = INF;\\n }\\n swap(now, nxt);\\n }\\n double ans = INF;\\n REP(j, MAX) chmin(ans, dp[now][j]);\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 19236,\n \"score_of_the_acc\": -0.513,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2305_6012422\",\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 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\\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\\nvoid solve(){\\n int N; cin>>N;\\n vector<int> a(N);\\n for(int i=0;i<N;i++) cin>>a[i];\\n \\n auto dp=vmake(N+1,2e5+10,(long double)MAX);\\n dp[0][1]=0;\\n\\n for(int i=0;i<N;i++){\\n for(int j=1;j<=2e5;j++){\\n for(int k=j;k<=2e5;k+=j){\\n long double x=abs(k-a[i]);\\n x/=a[i];\\n chmin(dp[i+1][k],max(dp[i][j],x));\\n }\\n }\\n }\\n long double ans=INF;\\n for(auto x:dp[N]) chmin(ans,x);\\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\": 210,\n \"memory_kb\": 71868,\n \"score_of_the_acc\": -0.8773,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2305_6012421\",\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 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\\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\\nvoid solve(){\\n int N; cin>>N;\\n vector<int> a(N);\\n for(int i=0;i<N;i++) cin>>a[i];\\n \\n auto dp=vmake(N+1,2e5+10,(long double)MAX);\\n dp[0][1]=0;\\n\\n for(int i=0;i<N;i++){\\n for(int j=1;j<=2e5;j++){\\n for(int k=j;k<=2e5;k+=j){\\n long double x=abs(k-a[i]);\\n x/=a[i];\\n chmin(dp[i+1][k],max(dp[i][j],x));\\n }\\n }\\n }\\n long double ans=INF;\\n for(auto x:dp[N]) if(x>EPS)chmin(ans,x);\\n cout<<ans<<endl;\\n}\\n\\nint main(){\\n bin101();\\n int T=1;\\n //cin>>T;\\n while(T--) solve();\\n}\",\n \"accuracy\": 0.058823529411764705,\n \"time_ms\": 30,\n \"memory_kb\": 18708,\n \"score_of_the_acc\": -0.1551,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2305_6011745\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define all(A) A.begin(),A.end()\\nusing vll = vector<ll>;\\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\\n\\nvector<vll> Q = { {1,2,5,6},{2,3,6,7},{3,4,7,8},{5,6,9,10},{6,7,10,11},{7,8,11,12},{9,10,13,14},{10,11,14,15},{11,12,15,16} };\\nvector<vll> T = { {0,1,2,3,6},{0,1,2,4,7},{0,1,2,5,8},{3,4,5,0,6},{3,4,5,1,7},{3,4,5,2,8},{6,7,8,0,3},{6,7,8,1,4},{6,7,8,2,5} };\\n\\ndouble di(pair<double, double> P1, pair<double, double> P2) {\\n\\tdouble dx = P1.first - P2.first;\\n\\tdouble dy = P1.second - P2.second;\\n\\treturn sqrt(dx * dx + dy * dy);\\n}\\n\\n/*bool kousa(pair<double, double> P1, pair<double, double> P2, pair<double, double> Q1, pair<double, double> Q2) {\\n\\tdouble xa = P1.first;\\n\\tdouble xb = P2.first;\\n\\tdouble ya = P1.second;\\n\\tdouble yb = P2.second;\\n\\tdouble xc = Q1.first;\\n\\tdouble xd = Q2.first;\\n\\tdouble yc = Q1.second;\\n\\tdouble yd = Q2.second;\\n\\tdouble s = (xa - xb) * (yc - ya) - (ya - yb) * (xc - xa);\\n\\tdouble t = (xa - xb) * (yd - ya) - (ya - yb) * (xd - xa);\\n\\treturn (s*t>=0);\\n\\n}*/\\n\\n\\n\\n\\n\\nint main() {\\n\\tll N;\\n\\tcin >> N;\\n\\tvll A(N);\\n\\trep(i, N) {\\n\\t\\tcin >> A[i];\\n\\t}\\n\\tvector<vector<double>> DP(N + 1, vector<double>(ll(3e5), 1e18));\\n\\tDP[0][1] = 0;\\n\\trep(i, N) {\\n\\t\\trep(k, 3e5) {\\n\\t\\t\\tif (k == 0)continue;\\n\\t\\t\\tfor (ll j = k; j < 3e5; j += k) {\\n\\t\\t\\t\\tdouble p = double(abs(A[i] - j)) / double(A[i]);\\n\\t\\t\\t\\tDP[i + 1][j] = min(DP[i + 1][j], max(DP[i][k],p));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tdouble an = 1e18;\\n\\trep(i, 3e5) {\\n\\t\\tan = min(an, DP[N][i]);\\n\\t}\\n\\tcout << fixed << setprecision(16) << an << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 54644,\n \"score_of_the_acc\": -0.6226,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2305_5960619\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n int N;\\n cin >> N;\\n vector<int> a(N);\\n for (auto& x : a) cin >> x;\\n const int M = 2e5;\\n vector<vector<double>> ratio(N+1, vector<double>(M, 1e9));\\n ratio[0][1] = 0;\\n for (int i = 0; i < N; ++i) {\\n for (int j = 1; j < M; ++j) {\\n for (int k = 1; j * k < M; ++k) {\\n ratio[i+1][j*k] = min(ratio[i+1][j*k], max(ratio[i][j], 1.0*abs(j*k - a[i])/a[i]));\\n }\\n }\\n }\\n cout << *min_element(ratio[N].begin(), ratio[N].end()) << \\\"\\\\n\\\";\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 37276,\n \"score_of_the_acc\": -0.3761,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2305_5925545\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int MAX_A = 200010;\\nconst double INF = 1e9;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n int N;\\n cin >> N;\\n\\n vector<double> dp(MAX_A, INF), ndp(MAX_A, INF);\\n dp[1] = 0;\\n for (int i = 0; i < N; i++) {\\n int a;\\n cin >> a;\\n for (int j = MAX_A - 1; j > 0; j--) {\\n for (int k = j + j; k < MAX_A; k += j) {\\n dp[k] = min(dp[k], dp[j]);\\n }\\n }\\n for (int j = 1; j < MAX_A; j++) dp[j] = max(dp[j], double(abs(j - a)) / a);\\n }\\n\\n double ans = *min_element(dp.begin(), dp.end());\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6236,\n \"score_of_the_acc\": -0.045,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2305_5925540\",\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\\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\\nconst int MAX_A = 200010;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n int N;\\n cin >> N;\\n\\n vector<double> dp(MAX_A, INF), ndp(MAX_A, INF);\\n dp[1] = 0;\\n for (int i = 0; i < N; i++) {\\n int a;\\n cin >> a;\\n for (int j = MAX_A - 1; j > 0; j--) {\\n for (int k = j + j; k < MAX_A; k += j) {\\n dp[k] = min(dp[k], dp[j]);\\n }\\n }\\n for (int j = 1; j < MAX_A; j++) dp[j] = max(dp[j], double(abs(j - a)) / a);\\n }\\n\\n double ans = *min_element(dp.begin(), dp.end());\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6244,\n \"score_of_the_acc\": -0.0451,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2305_5925533\",\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\\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\\nconst int MAX_A = 100010;\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n int N;\\n cin >> N;\\n\\n vector<double> dp(MAX_A, INF), ndp(MAX_A, INF);\\n dp[1] = 0;\\n for (int i = 0; i < N; i++) {\\n int a;\\n cin >> a;\\n for (int j = MAX_A - 1; j > 0; j--) {\\n for (int k = j + j; k < MAX_A; k += j) {\\n dp[k] = min(dp[k], dp[j]);\\n }\\n }\\n for (int j = 1; j < MAX_A; j++) dp[j] = max(dp[j], double(abs(j - a)) / a);\\n }\\n\\n double ans = *min_element(dp.begin(), dp.end());\\n cout << ans << '\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 0.6274509803921569,\n \"time_ms\": 20,\n \"memory_kb\": 4652,\n \"score_of_the_acc\": 0,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":1291,"cells":{"group_id":{"kind":"string","value":"aoj_2309_cpp"},"problem_description":{"kind":"string","value":"Vector Compression\nYou are recording a result of a secret experiment, which consists of a large set of\nN\n-dimensional vectors.\nSince the result may become very large, you are thinking of\ncompressing it. Fortunately you already have a good compression method\nfor vectors with small absolute values, all you have to do is to\npreprocess the vectors and make them small.\nYou can record the set of vectors in any order you like.\nLet's assume you process them in the order\nv_1\n,\nv_2\n,...,\nv_M\n.\nEach vector\nv_i\nis recorded either\nas is\n, or as a difference vector.\nWhen it is recorded as a difference,\nyou can arbitrarily pick up an already chosen vector\nv_j (j<i)\nand a real value\nr\n.\nThen the actual vector value recorded is\n(v_i - r v_j)\n.\nThe values of\nr\nand\nj\ndo not affect the compression ratio so much, so you don't have to care about them.\nGiven a set of vectors,\nyour task is to write a program that calculates the minimum sum of the squared length of the recorded vectors.\nInput\nThe input is like the following style.\nN\nM\nv_{1,1}\nv_{1,2}\n...\nv_{1,N}\n...\nv_{M,1}\nv_{M,2}\n...\nv_{M,N}\nThe first line contains two integers\nN\nand\nM\n(\n1 \\leq N, M \\leq 100\n),\nwhere\nN\nis the dimension of each vector,\nand\nM\nis the number of the vectors.\nEach of the following\nM\nlines contains\nN\nfloating point values\nv_{i,j}\n(\n-1.0 \\leq v_{i,j} \\leq 1.0\n)\nwhich represents the\nj\n-th element value of the\ni\n-th vector.\nOutput\nOutput the minimum sum of the squared length of the recorded vectors. \nThe output should not contain an absolute error greater than\n10^{-6}\n.\nSample Input 1\n2 3\n1.0 1.0\n-1.0 0.0\n0.5 0.5\nOutput for the Sample Input 1\n1.0\nSample Input 2\n1 1\n1.0\nOutput for the Sample Input 2\n1.0\nSample Input 3\n4 3\n1.0 1.0 0.0 0.0\n-1.0 0.0 -1.0 0.0\n0.5 0.5 0.5 0.5\nOutput for the Sample Input 3\n3.0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2309_9813617","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nstruct SCC{\n int n,m,cur;\n vector<vector<int>> g;\n vector<int> low,ord,id;\n SCC(int _n=0):n(_n),m(0),cur(0),g(_n),low(_n),ord(_n,-1),id(_n){}\n void resize(int _n){\n n=_n;\n g.resize(n);\n low.resize(n);\n ord.resize(n,-1);\n id.resize(n);\n }\n void add_edge(int u,int v){g[u].emplace_back(v);}\n void dfs(int v,vector<int>& used){\n ord[v]=low[v]=cur++;\n used.emplace_back(v);\n for(auto& nxt:g[v]){\n if(ord[nxt]==-1){\n dfs(nxt,used); chmin(low[v],low[nxt]);\n }\n else{\n chmin(low[v],ord[nxt]);\n }\n }\n if(ord[v]==low[v]){\n while(1){\n int add=used.back(); used.pop_back();\n ord[add]=n; id[add]=m;\n if(v==add)break;\n }\n m++;\n }\n }\n void run(){\n vector<int> used;\n rep(v,0,n)if(ord[v]==-1)dfs(v,used);\n for(auto& x:id)x=m-1-x;\n }\n};\n\n/**\n * @brief Strongly Connected Components\n */\n\ntemplate <typename T>\nstruct DirectedMST {\n const vector<vector<T>>& G;\n T _INF;\n\n DirectedMST(const vector<vector<T>>& G) : _INF(numeric_limits<T>::max()), G(G) {}\n\n T DFS(vector<vector<T>>& G, int Root, T Cur) {\n int N = G.size();\n vector<int> rev(N, -1);\n vector<T> weight(N, _INF);\n rep(i,0,N) {\n rep(j,0,N) {\n if (chmin(weight[j], G[i][j])) {\n rev[j] = i;\n }\n }\n }\n SCC scc(N);\n rep(i,0,N) {\n if (i == Root) continue;\n if (rev[i] == -1) return _INF;\n scc.add_edge(rev[i],i);\n Cur += weight[i];\n }\n scc.run();\n if (scc.m == N) return Cur;\n vector<vector<T>> NewG(scc.m,vector<T>(scc.m,_INF));\n rep(i,0,N) {\n rep(j,0,N) {\n if (scc.id[i] == scc.id[j]) continue;\n chmin(NewG[scc.id[i]][scc.id[j]], G[i][j]-weight[j]);\n }\n }\n return DFS(NewG, scc.id[Root], Cur);\n }\n};\n\nusing Vec = vector<double>;\n\ndouble dot(Vec A, Vec B) {\n int N = A.size();\n double Ret = 0.0;\n rep(i,0,N) Ret += A[i] * B[i];\n return Ret;\n}\n\nint main() {\n int N, M;\n cin >> M >> N;\n vector<Vec> V(N,vector<double>(M));\n rep(i,0,N) rep(j,0,M) cin >> V[i][j];\n vector<vector<double>> G(N+1,vector<double>(N+1,inf));\n rep(i,0,N) {\n rep(j,0,N) {\n if (i == j) continue;\n if (dot(V[i],V[i]) == 0.0) G[i][j] = dot(V[j],V[j]);\n G[i][j] = (dot(V[i],V[i])*dot(V[j],V[j])-dot(V[i],V[j])*dot(V[i],V[j])) / dot(V[i],V[i]);\n }\n }\n rep(i,0,N) {\n G[N][i] = dot(V[i],V[i]);\n }\n DirectedMST<double> mst(G);\n printf(\"%.12f\\n\",mst.DFS(G,N,0.0));\n}","accuracy":1,"time_ms":10,"memory_kb":4456,"score_of_the_acc":-0.0508,"final_rank":6},{"submission_id":"aoj_2309_5448636","code_snippet":"// #define _GLIBCXX_DEBUG // for STL debug (optional)\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\nusing namespace std;\nusing ll = long long int;\nusing int64 = long long int;\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst int INF = 1LL << 29;\nconst ll LONGINF = 1LL << 60;\nconst ll MOD = 1000000007LL;\n\ntemplate< typename T = int >\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n\n Edge() = default;\n\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\n\n operator int() const { return to; }\n};\n\ntemplate< typename T = int >\nstruct Graph {\n vector< vector< Edge< T > > > g;\n int es;\n\n Graph() = default;\n\n explicit Graph(int n) : g(n), es(0) {}\n\n size_t size() const {\n return g.size();\n }\n\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if(weighted) cin >> c;\n if(directed) add_directed_edge(a, b, c);\n else add_edge(a, b, c);\n }\n }\n};\n\ntemplate< typename T = int >\nusing Edges = vector< Edge< T > >;\n\n\n/**\n * @brief Skew-Heap\n */\ntemplate< typename T, bool isMin = true >\nstruct SkewHeap {\n struct Node {\n T key, lazy;\n Node *l, *r;\n int idx;\n\n explicit Node(const T &key, int idx) : key(key), idx(idx), lazy(0), l(nullptr), r(nullptr) {}\n };\n\n SkewHeap() = default;\n\n Node *alloc(const T &key, int idx = -1) {\n return new Node(key, idx);\n }\n\n Node *propagate(Node *t) {\n if(t && t->lazy != 0) {\n if(t->l) t->l->lazy += t->lazy;\n if(t->r) t->r->lazy += t->lazy;\n t->key += t->lazy;\n t->lazy = 0;\n }\n return t;\n }\n\n Node *meld(Node *x, Node *y) {\n propagate(x), propagate(y);\n if(!x || !y) return x ? x : y;\n if((x->key < y->key) ^ isMin) swap(x, y);\n x->r = meld(y, x->r);\n swap(x->l, x->r);\n return x;\n }\n\n Node *push(Node *t, const T &key, int idx = -1) {\n return meld(t, alloc(key, idx));\n }\n\n Node *pop(Node *t) {\n assert(t != nullptr);\n return meld(t->l, t->r);\n }\n\n Node *add(Node *t, const T &lazy) {\n if(t) {\n t->lazy += lazy;\n propagate(t);\n }\n return t;\n }\n\n Node *make_root() {\n return nullptr;\n }\n};\n\n\n/**\n * @brief Directed-Minimum-Spanning-Tree(最小有向全域木)\n */\ntemplate< typename T >\nstruct MinimumSpanningTree {\n T cost;\n Edges< T > edges;\n};\n\ntemplate< typename T >\nMinimumSpanningTree< T > directed_minimum_spanning_tree(int V, int root, Edges< T > edges) {\n for(int i = 0; i < V; ++i) {\n if(i != root) edges.emplace_back(i, root, 0);\n }\n\n int x = 0;\n vector< int > par(2 * V, -1), vis(par), link(par);\n\n using Heap = SkewHeap< T, true >;\n using Node = typename Heap::Node;\n\n Heap heap;\n vector< Node * > ins(2 * V, heap.make_root());\n\n for(int i = 0; i < (int) edges.size(); i++) {\n auto &e = edges[i];\n ins[e.to] = heap.push(ins[e.to], e.cost, i);\n }\n vector< int > st;\n auto go = [&](int x) {\n x = edges[ins[x]->idx].from;\n while(link[x] != -1) {\n st.emplace_back(x);\n x = link[x];\n }\n for(auto &p : st) {\n link[p] = x;\n }\n st.clear();\n return x;\n };\n for(int i = V; ins[x]; i++) {\n for(; vis[x] == -1; x = go(x)) vis[x] = 0;\n for(; x != i; x = go(x)) {\n auto w = ins[x]->key;\n auto v = heap.pop(ins[x]);\n v = heap.add(v, -w);\n ins[i] = heap.meld(ins[i], v);\n par[x] = i;\n link[x] = i;\n }\n for(; ins[x] && go(x) == x; ins[x] = heap.pop(ins[x]));\n }\n T cost = 0;\n Edges< T > ans;\n for(int i = root; i != -1; i = par[i]) {\n vis[i] = 1;\n }\n for(int i = x; i >= 0; i--) {\n if(vis[i] == 1) continue;\n cost += edges[ins[i]->idx].cost;\n ans.emplace_back(edges[ins[i]->idx]);\n for(int j = edges[ins[i]->idx].to; j != -1 && vis[j] == 0; j = par[j]) {\n vis[j] = 1;\n }\n }\n return {cost, ans};\n}\n\nint main() {\n int N, M; scanf(\"%d%d\", &N, &M);\n vector< vector<double> > V(M, vector<double>(N));\n for(int i=0; i<M; i++) {\n for(int j=0; j<N; j++) {\n scanf(\"%lf\", &V[i][j]);\n }\n }\n\n auto calc_cost = [&](int x, int y) {\n double ub = INF, lb = -INF;\n for(int i=0; i<200; i++) {\n double m1 = (lb + lb + ub) / 3.0;\n double m2 = (lb + ub + ub) / 3.0;\n double f1 = 0.0, f2 = 0.0;\n for(int i=0; i<N; i++) {\n f1 += (V[x][i] - m1 * V[y][i]) * (V[x][i] - m1 * V[y][i]);\n f2 += (V[x][i] - m2 * V[y][i]) * (V[x][i] - m2 * V[y][i]); \n }\n if(f1 < f2) ub = m2;\n else lb = m1;\n }\n double m = lb;\n double f = 0.0;\n for(int i=0; i<N; i++) {\n f += (V[x][i] - m * V[y][i]) * (V[x][i] - m * V[y][i]);\n }\n return f;\n };\n\n Edges<double> edges;\n for(int i=0; i<M; i++) {\n double cost = 0.0;\n for(int j=0; j<N; j++) {\n cost += V[i][j] * V[i][j];\n }\n edges.emplace_back(M, i, cost);\n for(int j=0; j<M; j++) {\n if(i == j) continue;\n edges.emplace_back(j, i, calc_cost(i, j));\n }\n }\n printf(\"%.12f\\n\", directed_minimum_spanning_tree(M+1, M, edges).cost);\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":3948,"score_of_the_acc":-0.2513,"final_rank":8},{"submission_id":"aoj_2309_5368428","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst double INF = 100000;\nint main(){\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n vector<vector<double>> A(M, vector<double>(N));\n for (int i = 0; i < M; i++){\n for (int j = 0; j < N; j++){\n cin >> A[i][j];\n }\n }\n vector<vector<pair<double, int>>> E(M + 1);\n for (int i = 0; i < M; i++){\n for (int j = 0; j < M; j++){\n if (i != j){\n double a = 0, b = 0, c = 0;\n for (int k = 0; k < N; k++){\n a += A[i][k] * A[i][k];\n b -= 2 * A[i][k] * A[j][k];\n c += A[j][k] * A[j][k];\n }\n double d = c - (b * b) / (4 * a);\n E[i].push_back(make_pair(d, j));\n }\n }\n }\n for (int i = 0; i < M; i++){\n double sum = 0;\n for (int j = 0; j < N; j++){\n sum += A[i][j] * A[i][j];\n }\n E[M].push_back(make_pair(sum, i));\n }\n int r = M;\n double ans = 0;\n while (true){\n int V = E.size();\n vector<double> mn(V, INF);\n vector<int> p(V);\n for (int i = 0; i < V; i++){\n for (auto P : E[i]){\n double c = P.first;\n int w = P.second;\n if (w != r && c < mn[w]){\n mn[w] = c;\n p[w] = i;\n }\n }\n }\n vector<int> d(V, 0);\n for (int i = 0; i < V; i++){\n if (i != r){\n d[p[i]]++;\n }\n }\n queue<int> Q;\n for (int i = 0; i < V; i++){\n \tif (i != r && d[i] == 0){\n Q.push(i);\n }\n }\n while (!Q.empty()){\n int v = Q.front();\n Q.pop();\n if (v != r){\n d[p[v]]--;\n if (d[p[v]] == 0){\n Q.push(p[v]);\n }\n }\n }\n vector<int> cycle;\n vector<int> id(V, -1);\n for (int i = 0; i < V; i++){\n if (d[i] == 1){\n cycle.push_back(i);\n while (true){\n int v = cycle.back();\n ans += mn[v];\n id[v] = 0;\n if (p[v] == i){\n break;\n }\n cycle.push_back(p[v]);\n }\n break;\n }\n }\n if (cycle.empty()){\n for (int i = 0; i < V; i++){\n if (i != r){\n ans += mn[i];\n }\n }\n break;\n }\n int cnt = 1;\n for (int i = 0; i < V; i++){\n if (id[i] == -1){\n id[i] = cnt;\n cnt++;\n }\n }\n vector<vector<pair<double, int>>> E2(cnt);\n for (int i = 0; i < V; i++){\n for (auto P : E[i]){\n double c = P.first;\n int w = P.second;\n if (id[w] == 0){\n c -= mn[w];\n }\n if (id[i] != id[w]){\n E2[id[i]].push_back(make_pair(c, id[w]));\n }\n }\n }\n swap(E, E2);\n r = id[r];\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3500,"score_of_the_acc":-0.0121,"final_rank":1},{"submission_id":"aoj_2309_5294410","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n#define endl \"\\n\"\nusing namespace std;\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nconst long long INF = 1e18;\n//const ll mod = 1000000007;\n\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define all(x) begin(x), end(x)\n#define sz(x) (int)(x).size()\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\n\nstruct RollbackUF {\n\tvi e; vector<pii> st;\n\tRollbackUF(int n) : e(n, -1) {}\n\tint size(int x) { return -e[find(x)]; }\n\tint find(int x) { return e[x] < 0 ? x : find(e[x]); }\n\tint time() { return sz(st); }\n\tvoid rollback(int t) {\n\t\tfor (int i = time(); i --> t;)\n\t\t\te[st[i].first] = st[i].second;\n\t\tst.resize(t);\n\t}\n\tbool join(int a, int b) {\n\t\ta = find(a), b = find(b);\n\t\tif (a == b) return false;\n\t\tif (e[a] > e[b]) swap(a, b);\n\t\tst.push_back({a, e[a]});\n\t\tst.push_back({b, e[b]});\n\t\te[a] += e[b]; e[b] = a;\n\t\treturn true;\n\t}\n};\nstruct Edge { int a, b; double w; };\nstruct Node { /// lazy skew heap node\n\tEdge key;\n\tNode *l, *r;\n\tdouble delta;\n\tvoid prop() {\n\t\tkey.w += delta;\n\t\tif (l) l->delta += delta;\n\t\tif (r) r->delta += delta;\n\t\tdelta = 0;\n\t}\n\tEdge top() { prop(); return key; }\n};\nNode *merge(Node *a, Node *b) {\n\tif (!a || !b) return a ?: b;\n\ta->prop(), b->prop();\n\tif (a->key.w > b->key.w) swap(a, b);\n\tswap(a->l, (a->r = merge(b, a->r)));\n\treturn a;\n}\nvoid pop(Node*& a) { a->prop(); a = merge(a->l, a->r); }\n\ndouble dmst(int n, int r, vector<Edge>& g) {\n\tRollbackUF uf(n);\n\tvector<Node*> heap(n);\n\tfor (Edge e : g) heap[e.b] = merge(heap[e.b], new Node{e});\n\tdouble res = 0;\n\tvi seen(n, -1), path(n), par(n);\n\tseen[r] = r;\n\tvector<Edge> Q(n), in(n, {-1,-1}), comp;\n\tdeque<tuple<int, int, vector<Edge>>> cycs;\n\trep(s,0,n) {\n\t\tint u = s, qi = 0, w;\n\t\twhile (seen[u] < 0) {\n\t\t\tif (!heap[u]) return -1;\n\t\t\tEdge e = heap[u]->top();\n\t\t\theap[u]->delta -= e.w, pop(heap[u]);\n\t\t\tQ[qi] = e, path[qi++] = u, seen[u] = s;\n\t\t\tres += e.w, u = uf.find(e.a);\n\t\t\tif (seen[u] == s) { /// found cycle, contract\n\t\t\t\tNode* cyc = 0;\n\t\t\t\tint end = qi, time = uf.time();\n\t\t\t\tdo cyc = merge(cyc, heap[w = path[--qi]]);\n\t\t\t\twhile (uf.join(u, w));\n\t\t\t\tu = uf.find(u), heap[u] = cyc, seen[u] = -1;\n\t\t\t\tcycs.push_front({u, time, {&Q[qi], &Q[end]}});\n\t\t\t}\n\t\t}\n\t\trep(i,0,qi) in[uf.find(Q[i].b)] = Q[i];\n\t}\n\n\tfor (auto& [u,t,comp] : cycs) { // restore sol (optional)\n\t\tuf.rollback(t);\n\t\tEdge inEdge = in[u];\n\t\tfor (auto& e : comp) in[uf.find(e.b)] = e;\n\t\tin[uf.find(inEdge.b)] = inEdge;\n\t}\n\trep(i,0,n) par[i] = in[i].a;\n\treturn res;\n}\n\ndouble dist[105][105];\n\nvector<double> Minus(vector<double> a, vector<double> b) {\n\tassert(a.size() == b.size());\n\tint n = a.size();\n\tvector<double> ret(n);\n\tfor(int i = 0; i < n; i++) ret[i] = a[i] - b[i];\n\treturn ret;\n}\nvector<double> prod(double t, vector<double> v) {\n\tfor(auto &tmp : v) tmp *= t;\n\treturn v;\n}\ndouble norm(vector<double> v) {\n\tdouble ret = 0;\n\tfor(auto tmp : v) ret += tmp * tmp;\n\treturn ret;\n}\n\ndouble f(vector<double> a, vector<double> b) {\n\tdouble r = 1e5;\n\tdouble l = -1e5;\n\tfor(int t = 0; t < 60; t++) {\n\t\tdouble ll = (l * 2 + r) / 3;\n\t\tdouble rr = (l + r * 2) / 3;\n \tif(norm(Minus(b, prod(ll, a))) < norm(Minus(b, prod(rr, a)))) {\n\t\t r = rr;\n \t} else {\n\t\t l = ll;\n\t }\n\t}\n\treturn norm(Minus(b, prod(l, a)));\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\tint N, M;\n\tcin >> N >> M;\n\tvector<vector<double>> A(M + 1, vector<double>(N));\n\tfor(int i = 1; i <= M; i++) {\n\t\tfor(int j = 0; j < N; j++) cin >> A[i][j];\n\t}\n\tvector<Edge> edges;\n\tfor(int i = 0; i <= M; i++) {\n\t\tfor(int j = 0; j <= M; j++) {\n\t\t\tdist[i][j] = f(A[i], A[j]);\n\t\t\t//cerr << dist[i][j] << \" \";\n\t\t}\n\t\t//cerr << endl;\n\t\tfor(int j = 0; j <= M; j++) {\n\t\t\tif(i == j) continue;\n\t\t\tedges.push_back({i, j, dist[i][j]});\n\t\t}\n\t}\n\tdouble ans = dmst(M + 1, 0, edges);\n\tcout << fixed << setprecision(30) << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":370,"memory_kb":4156,"score_of_the_acc":-0.4176,"final_rank":9},{"submission_id":"aoj_2309_4843795","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include<tuple>\n#include<cassert>\n#include<set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<long double,int> DP;\ntypedef pair<LL,int> LP;\nconst long double INF=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\n\nlong double vec[111][111];\nvector<vector<long double>> dis;\n\nint main(){\n int n,m;\n int i,j,k;\n int a,b,c;\n long double da,db,dc;\n cin>>m>>n;\n dis.assign(n,vector<long double>(n,INF));\n for(i=0;i<n;i++){\n for(j=0;j<m;j++){\n cin>>vec[i][j];\n }\n }\n for(i=0;i<n;i++){\n for(j=0;j<n;j++){\n if(i==j)continue;\n da=0,db=0;\n for(k=0;k<m;k++){\n da+=pow(vec[i][k],2),db+=2*vec[i][k]*vec[j][k];\n }\n if(da>0)db/=2*da;\n da=0;\n for(k=0;k<m;k++){\n da+=pow(vec[j][k]-vec[i][k]*db,2);\n }\n dis[i][j]=da;\n }\n }\n long double ds=INF;\n for(i=0;i<n;i++){\n db=0;\n for(j=0;j<m;j++){\n db+=pow(vec[i][j],2);\n }\n vector<vector<long double>> dis_temp=dis;\n vector<int> v1,v2,par(n,-1);\n for(j=0;j<n;j++){\n if(i!=j)v1.push_back(j);\n }\n while(!v1.empty()){\n a=v1.back(),v1.pop_back();\n da=INF,b=0;\n for(j=0;j<n;j++){\n if(da>dis_temp[j][a]){\n da=dis_temp[j][a];\n b=j;\n }\n }\n for(j=0;j<n;j++){\n if(j==b)dis_temp[j][a]=INF;\n else dis_temp[j][a]-=da;\n }\n db+=da,par[a]=b;\n v2.clear();\n c=a;\n while(c!=-1){\n v2.push_back(c);\n c=par[c];\n if(c==a)break;\n }\n if(c==-1)continue;\n a=v2.size();\n for(j=0;j<a;j++){\n for(k=0;k<a;k++){\n b=v2[j],c=v2[k];\n dis_temp[b][c]=INF;\n }\n }\n for(j=0;j<n;j++){\n b=v2[0];\n for(k=1;k<a;k++){\n c=v2[k];\n dis_temp[b][j]=min(dis_temp[b][j],dis_temp[c][j]);\n dis_temp[j][b]=min(dis_temp[j][b],dis_temp[j][c]);\n dis_temp[j][c]=INF,dis_temp[c][j]=INF;\n }\n }\n for(j=0;j<a;j++){\n b=v2[j];\n par[b]=-1;\n for(k=0;k<n;k++){\n if(par[k]==b)par[k]=v2[0];\n }\n }\n v1.push_back(v2[0]);\n }\n ds=min(ds,db);\n }\n cout<<fixed<<setprecision(15)<<ds<<endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3604,"score_of_the_acc":-0.0269,"final_rank":4},{"submission_id":"aoj_2309_4843780","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include<tuple>\n#include<cassert>\n#include<set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<long double,int> DP;\ntypedef pair<LL,int> LP;\nconst long double INF=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\n\nlong double vec[111][111];\nvector<vector<long double>> dis;\n\nint main(){\n int n,m;\n int i,j,k;\n int a,b,c;\n long double da,db,dc;\n cin>>m>>n;\n dis.assign(n,vector<long double>(n,INF));\n for(i=0;i<n;i++){\n for(j=0;j<m;j++){\n cin>>vec[i][j];\n }\n }\n for(i=0;i<n;i++){\n for(j=0;j<n;j++){\n if(i==j)continue;\n da=0,db=0;\n for(k=0;k<m;k++){\n da+=pow(vec[i][k],2),db+=2*vec[i][k]*vec[j][k];\n }\n if(da>0)db/=2*da;\n da=0;\n for(k=0;k<m;k++){\n da+=pow(vec[j][k]-vec[i][k]*db,2);\n }\n dis[i][j]=da;\n }\n }\n long double ds=INF;\n for(i=0;i<n;i++){\n db=0;\n for(j=0;j<m;j++){\n db+=pow(vec[i][j],2);\n }\n vector<vector<long double>> dis_temp=dis;\n vector<int> v1,v2,par(n,-1);\n \n for(int pos=0;pos<n;pos++){\n a=pos;\n while(a!=i){\n if(par[a]!=-1)break;\n da=INF,b=0;\n for(j=0;j<n;j++){\n if(da>dis_temp[j][a]){\n da=dis_temp[j][a];\n b=j;\n }\n }\n for(j=0;j<n;j++){\n if(j==b)dis_temp[j][a]=INF;\n else dis_temp[j][a]-=da;\n }\n db+=da,par[a]=b;\n v2.clear();\n c=a;\n while(c!=-1){\n v2.push_back(c);\n if(par[c]==a || par[c]<0)break;\n c=par[c];\n }\n if(par[c]<0){\n a=c;\n continue;\n }\n int sz=v2.size();\n for(j=0;j<sz;j++){\n for(k=0;k<sz;k++){\n b=v2[j],c=v2[k];\n dis_temp[b][c]=INF;\n }\n }\n for(j=0;j<n;j++){\n b=v2[0];\n for(k=1;k<sz;k++){\n c=v2[k];\n dis_temp[b][j]=min(dis_temp[b][j],dis_temp[c][j]);\n dis_temp[j][b]=min(dis_temp[j][b],dis_temp[j][c]);\n dis_temp[j][c]=INF,dis_temp[c][j]=INF;\n }\n }\n for(j=1;j<sz;j++){\n b=v2[j];\n par[b]=-2;\n for(k=0;k<n;k++){\n if(par[k]==b)par[k]=a;\n }\n }\n par[a]=-1;\n }\n }\n ds=min(ds,db);\n }\n cout<<fixed<<setprecision(15)<<ds<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3592,"score_of_the_acc":-0.0158,"final_rank":2},{"submission_id":"aoj_2309_4837603","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include<tuple>\n#include<cassert>\n#include<set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<long double,int> DP;\ntypedef pair<LL,int> LP;\nconst long double INF=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\n\nlong double vec[111][111];\nvector<vector<long double>> dis;\npriority_queue<DP,vector<DP>,greater<DP>> q1;\n\nint main(){\n int n,m;\n int i,j,k;\n int a,b,c;\n long double da,db,dc;\n cin>>m>>n;\n dis.assign(n,vector<long double>(n,INF));\n for(i=0;i<n;i++){\n for(j=0;j<m;j++){\n cin>>vec[i][j];\n }\n }\n for(i=0;i<n;i++){\n for(j=0;j<n;j++){\n if(i==j)continue;\n da=0,db=0;\n for(k=0;k<m;k++){\n if(vec[i][k]==0)continue;\n da+=pow(vec[i][k],2),db+=2*vec[i][k]*vec[j][k];\n }\n if(da>0)db/=2*da;\n da=0;\n for(k=0;k<m;k++){\n da+=pow(vec[j][k]-vec[i][k]*db,2);\n }\n dis[i][j]=da;\n }\n }\n long double ds=INF;\n for(i=0;i<n;i++){\n vector<char> used(n);\n da=0;\n for(j=0;j<m;j++){\n da+=pow(vec[i][j],2);\n }\n q1.push(make_pair(da,i));\n db=0;\n while(!q1.empty()){\n da=q1.top().first,a=q1.top().second,q1.pop();\n if(used[a])continue;\n used[a]=1;\n db+=da;\n for(j=0;j<n;j++){\n if(a==j)continue;\n q1.push(make_pair(dis[a][j],j));\n }\n }\n ds=min(ds,db);\n }\n cout<<fixed<<setprecision(15)<<ds<<endl;\n}","accuracy":0.061224489795918366,"time_ms":50,"memory_kb":3488,"score_of_the_acc":-0.0537,"final_rank":16},{"submission_id":"aoj_2309_4809757","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\n\nconst int max_n = 1000;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\n\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}\nstruct uf {\nprivate:\n\tvector<int> par, ran;\npublic:\n\tuf(int n) {\n\t\tpar.resize(n, 0);\n\t\tran.resize(n, 0);\n\t\trep(i, n) {\n\t\t\tpar[i] = i;\n\t\t}\n\t}\n\tint find(int x) {\n\t\tif (par[x] == x)return x;\n\t\telse return par[x] = find(par[x]);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = find(x), y = find(y);\n\t\tif (x == y)return;\n\t\tif (ran[x] < ran[y]) {\n\t\t\tpar[x] = y;\n\t\t}\n\t\telse {\n\t\t\tpar[y] = x;\n\t\t\tif (ran[x] == ran[y])ran[x]++;\n\t\t}\n\t}\n\tbool same(int x, int y) {\n\t\treturn find(x) == find(y);\n\t}\n};\n\nusing tval = ld;\nstruct edge {\n\tint to; tval cost;\n};\n\nvector<P> chu_liu_edmonds(vector<vector<edge>>&G, vector<bool> exi,int root=-1) {\n\t//cout << \"wow\\n\";\n\tint n = G.size();\n\tif (root < 0) {\n\t\troot = n;\n\t\tG.push_back({});\n\t\trep(i, n)G[root].push_back({ i,INF/10000 });\n\t\tn++;\n\t\texi.push_back(true);\n\t}\n\tvector<vector<edge>> rG(n);\n\trep(i, n)if(exi[i])for (edge e : G[i]) {\n\t\trG[e.to].push_back({ i,e.cost });\n\t}\n\tvector<int> par(n);\n\tvector<tval> memo(n);\n\trep(i, n)if (exi[i] && i != root) {\n\t\ttval mi = INF;\n\t\tfor (edge e: rG[i]) {\n\t\t\tif (e.cost < mi) {\n\t\t\t\tmi = e.cost;\n\t\t\t\tpar[i] = e.to;\n\t\t\t}\n\t\t}\n\t\t//cout << par[i] << \" \" << i << \"\\n\";\n\t\tmemo[i] = mi;\n\t}\n\tvector<bool> used(n);\n\tvector<bool> cused(n);\n\tvector<int> ts;\n\tused[root] = true;\n\trep(i, n)if (exi[i] && i != root) {\n\t\tif (used[i])continue;\n\t\tvector<int> ids;\n\t\tint cur = i;\n\t\tcused[i] = true;\n\t\tids.push_back(i);\n\t\tbool f = false;\n\t\twhile (true) {\n\t\t\tcur = par[cur];\n\t\t\tif (used[cur]) {\n\t\t\t\tfor (int id : ids) {\n\t\t\t\t\tcused[id] = false;\n\t\t\t\t\tused[id] = true;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (cused[cur]) {\n\t\t\t\tf = true;\n\t\t\t\trep(j, ids.size())if (ids[j] == cur) {\n\t\t\t\t\tids.erase(ids.begin(), ids.begin() + j);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcused[cur] = true;\n\t\t\t\tids.push_back(cur);\n\t\t\t}\n\t\t}\n\t\tif (f) {\n\t\t\tts = ids; break;\n\t\t}\n\t}\n\tif (ts.empty()) {\n\t\tvector<P> res; rep(i, n)if (exi[i] && i != root)res.push_back({ par[i],i });\n\t\treturn res;\n\t}\n\telse {\n\t\tint cr = ts[0];\n\t\tvector<tval> mifr(n, INF), mito(n, INF);\n\t\tvector<int> idfr(n, -1), idto(n, -1);\n\t\t\n\t\tfor (int id : ts) {\n\t\t\tfor (edge e : G[id]) {\n\t\t\t\tif (e.cost < mito[e.to]) {\n\t\t\t\t\tmito[e.to] = e.cost;\n\t\t\t\t\tidto[e.to] = id;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (edge e : rG[id]) {\n\t\t\t\tif (e.cost-memo[id] < mifr[e.to]) {\n\t\t\t\t\tmifr[e.to] = e.cost-memo[id];\n\t\t\t\t\tidfr[e.to] = id;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvector<bool> nexi = exi;\n\t\tfor (int id : ts) {\n\t\t\tnexi[id] = false;\n\t\t\tG[id].clear();\n\t\t}\n\t\trep(i, n)if (nexi[i]) {\n\t\t\tvector<edge> nw;\n\t\t\tfor (edge e : G[i])if (e.to != cr)nw.push_back(e);\n\t\t\tswap(nw, G[i]);\n\t\t}\n\t\tnexi[cr] = true;\n\t\trep(i, n)if (i!=cr&&nexi[i]) {\n\t\t\tif (idfr[i] >= 0) {\n\t\t\t\tG[i].push_back({ cr,mifr[i] });\n\t\t\t}\n\t\t\tif (idto[i] >= 0) {\n\t\t\t\tG[cr].push_back({ i,mito[i] });\n\t\t\t}\n\t\t}\n\t\tvector<P> np = chu_liu_edmonds(G, nexi, root);\n\t\t//cout << \"wow\" <<cr<<\"\\n\";\n\t\t//cout << memo[0] << \"\\n\";\n\t\t//cout << mifr[3] << \" \" << idfr[3] << \"\\n\";\n\t\t/*for (edge e : G[3]) {\n\t\t\tcout << e.to << \" \" << e.cost << \"\\n\";\n\t\t}\n\t\trep(i, np.size())cout << np[i].first << \" \" << np[i].second << \"\\n\";\n\t\t*/\n\t\tint chk = -1;\n\t\trep(i, np.size()) {\n\t\t\tif (np[i].second == cr) {\n\t\t\t\tchk = idfr[np[i].first];\n\t\t\t\tnp[i].second = chk;\n\t\t\t}\n\t\t\telse if (np[i].first == cr) {\n\t\t\t\tnp[i].first = idto[np[i].second];\n\t\t\t}\n\t\t}\n\t\tts.push_back(ts[0]);\n\t\trep(i, ts.size() - 1) {\n\t\t\tif (ts[i] != chk) {\n\t\t\t\tnp.push_back({ ts[i + 1], ts[i] });\n\t\t\t}\n\t\t}\n\t\treturn np;\n\t}\n}\n\nld calc(vector<ld> dp, vector<ld> p) {\n\tld le = -mod, ri = mod;\n\tauto cal = [&](ld t)->ld {\n\t\tld sum = 0;\n\t\trep(i, dp.size()) {\n\t\t\tld x = p[i] + t * dp[i];\n\t\t\tsum += x * x;\n\t\t}\n\t\treturn sum;\n\t};\n\trep(i, 200) {\n\t\tld ml = (le*2 + ri) / 3.0;\n\t\tld mr = (le+ ri * 2) / 3.0;\n\t\tld cl = cal(ml);\n\t\tld cr = cal(mr);\n\t\tif (cl < cr) {\n\t\t\tri = mr;\n\t\t}\n\t\telse le = ml;\n\t}\n\tld sum = 0;\n\trep(i, p.size())sum += p[i] * p[i];\n\tld mem = cal(le);\n\tsum -= mem;\n\treturn sum;\n}\n\nvoid solve() {\n\tint n, m; cin >> m >> n;\n\tvector<vector<ld>> vs(n, vector<ld>(m));\n\tvector<vector<edge>> G(n);\n\trep(i, n)rep(j, m) {\n\t\tcin >> vs[i][j];\n\t}\n\trep(i, n)Rep(j, i + 1, n) {\n\t\t//cout << i << \" \" << j << \" \"<<calc(vs[i], vs[j]) << \" \" << calc(vs[j], vs[i]) << \"\\n\";\n\t\tG[i].push_back({ j,-calc(vs[i],vs[j]) });\n\t\tG[j].push_back({ i,-calc(vs[j],vs[i]) });\n\t}\n\tvector<bool> exi(n, true);\n\tld ma = INF;\n\t\tvector<vector<edge>> nG = G;\n\t\t//cout << \"hello\\n\";\n\t\tvector<P> res = chu_liu_edmonds(nG, exi);\n\t\tmap<P, bool> mp;\n\t\tfor (P p : res) {\n\t\t\t//cout << p.first << \" \" << p.second << \"\\n\";\n\t\t\tmp[p] = true;\n\t\t}\n\t\tld sum = 0;\n\t\trep(i, n)for (edge e : G[i]) {\n\t\t\tif (mp[{i,e.to}])sum += e.cost;\n\t\t}ma = min(ma, sum);\n\t\n\trep(i, n) {\n\t\tld c = 0;\n\t\trep(j, vs[i].size()) {\n\t\t\tc += vs[i][j] * vs[i][j];\n\t\t}\n\t\tma +=c;\n\t}\n\tcout << ma << \"\\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//expr();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":450,"memory_kb":27940,"score_of_the_acc":-1.4632,"final_rank":10},{"submission_id":"aoj_2309_4809599","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\n\nconst int max_n = 1000;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\n\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}\nstruct uf {\nprivate:\n\tvector<int> par, ran;\npublic:\n\tuf(int n) {\n\t\tpar.resize(n, 0);\n\t\tran.resize(n, 0);\n\t\trep(i, n) {\n\t\t\tpar[i] = i;\n\t\t}\n\t}\n\tint find(int x) {\n\t\tif (par[x] == x)return x;\n\t\telse return par[x] = find(par[x]);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = find(x), y = find(y);\n\t\tif (x == y)return;\n\t\tif (ran[x] < ran[y]) {\n\t\t\tpar[x] = y;\n\t\t}\n\t\telse {\n\t\t\tpar[y] = x;\n\t\t\tif (ran[x] == ran[y])ran[x]++;\n\t\t}\n\t}\n\tbool same(int x, int y) {\n\t\treturn find(x) == find(y);\n\t}\n};\n\nusing tval = ld;\nstruct edge {\n\tint to; tval cost;\n};\n\nvector<P> chu_liu_edmonds(vector<vector<edge>>&G, vector<bool> exi,int root=-1) {\n\t//cout << \"wow\\n\";\n\tint n = G.size();\n\tif (root < 0) {\n\t\troot = n;\n\t\tG.push_back({});\n\t\trep(i, n)G[root].push_back({ i,INF/10000 });\n\t\tn++;\n\t\texi.push_back(true);\n\t}\n\tvector<vector<edge>> rG(n);\n\trep(i, n)if(exi[i])for (edge e : G[i]) {\n\t\trG[e.to].push_back({ i,e.cost });\n\t}\n\tvector<int> par(n);\n\tvector<tval> memo(n);\n\trep(i, n)if (exi[i] && i != root) {\n\t\ttval mi = INF;\n\t\tfor (edge e: rG[i]) {\n\t\t\tif (e.cost < mi) {\n\t\t\t\tmi = e.cost;\n\t\t\t\tpar[i] = e.to;\n\t\t\t}\n\t\t}\n\t\t//cout << par[i] << \" \" << i << \"\\n\";\n\t\tmemo[i] = mi;\n\t}\n\tvector<bool> used(n);\n\tvector<bool> cused(n);\n\tvector<int> ts;\n\tused[root] = true;\n\trep(i, n)if (exi[i] && i != root) {\n\t\tif (used[i])continue;\n\t\tvector<int> ids;\n\t\tint cur = i;\n\t\tcused[i] = true;\n\t\tids.push_back(i);\n\t\tbool f = false;\n\t\twhile (true) {\n\t\t\tcur = par[cur];\n\t\t\tif (used[cur]) {\n\t\t\t\tfor (int id : ids) {\n\t\t\t\t\tcused[id] = false;\n\t\t\t\t\tused[id] = true;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (cused[cur]) {\n\t\t\t\tf = true;\n\t\t\t\trep(j, ids.size())if (ids[j] == cur) {\n\t\t\t\t\tids.erase(ids.begin(), ids.begin() + j);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcused[cur] = true;\n\t\t\t\tids.push_back(cur);\n\t\t\t}\n\t\t}\n\t\tif (f) {\n\t\t\tts = ids; break;\n\t\t}\n\t}\n\tif (ts.empty()) {\n\t\tvector<P> res; rep(i, n)if (exi[i] && i != root)res.push_back({ par[i],i });\n\t\treturn res;\n\t}\n\telse {\n\t\tint cr = ts[0];\n\t\tvector<tval> mifr(n, INF), mito(n, INF);\n\t\tvector<int> idfr(n, -1), idto(n, -1);\n\t\t\n\t\tfor (int id : ts) {\n\t\t\tfor (edge e : G[id]) {\n\t\t\t\tif (e.cost < mito[e.to]) {\n\t\t\t\t\tmito[e.to] = e.cost;\n\t\t\t\t\tidto[e.to] = id;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (edge e : rG[id]) {\n\t\t\t\tif (e.cost-memo[id] < mifr[e.to]) {\n\t\t\t\t\tmifr[e.to] = e.cost-memo[id];\n\t\t\t\t\tidfr[e.to] = id;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tvector<bool> nexi = exi;\n\t\tfor (int id : ts) {\n\t\t\tnexi[id] = false;\n\t\t\tG[id].clear();\n\t\t}\n\t\tnexi[cr] = true;\n\t\trep(i, n)if (i!=cr&&nexi[i]) {\n\t\t\tif (idfr[i] >= 0) {\n\t\t\t\tG[i].push_back({ cr,mifr[i] });\n\t\t\t}\n\t\t\tif (idto[i] >= 0) {\n\t\t\t\tG[cr].push_back({ i,mito[i] });\n\t\t\t}\n\t\t}\n\t\tvector<P> np = chu_liu_edmonds(G, nexi, root);\n\t\tint chk = -1;\n\t\trep(i, np.size()) {\n\t\t\tif (np[i].second == cr) {\n\t\t\t\tchk = idfr[np[i].first];\n\t\t\t\tnp[i].second = chk;\n\t\t\t}\n\t\t\telse if (np[i].first == cr) {\n\t\t\t\tnp[i].first = idto[np[i].second];\n\t\t\t}\n\t\t}\n\t\tts.push_back(ts[0]);\n\t\trep(i, ts.size() - 1) {\n\t\t\tif (ts[i] != chk) {\n\t\t\t\tnp.push_back({ ts[i + 1], ts[i] });\n\t\t\t}\n\t\t}\n\t\treturn np;\n\t}\n}\n\nld calc(vector<ld> dp, vector<ld> p) {\n\tld le = -3, ri = 3;\n\tauto cal = [&](ld t) {\n\t\tld sum = 0;\n\t\trep(i, dp.size()) {\n\t\t\tld x = p[i] + t * dp[i];\n\t\t\tsum += x * x;\n\t\t}\n\t\treturn sqrtl(sum);\n\t};\n\trep(i, 60) {\n\t\tld ml = (le * 5 + ri * 4) / 9.0;\n\t\tld mr = (le * 4 + ri * 5) / 9.0;\n\t\tld cl = cal(ml);\n\t\tld cr = cal(mr);\n\t\tif (cl < cr) {\n\t\t\tri = mr;\n\t\t}\n\t\telse le = ml;\n\t}\n\tld sum = 0;\n\trep(i, p.size())sum += p[i] * p[i];\n\tld mem = cal(le);\n\tsum -= mem * mem;\n\treturn sum;\n}\n\nvoid solve() {\n\tint n, m; cin >> m >> n;\n\tvector<vector<ld>> vs(n, vector<ld>(m));\n\tvector<vector<edge>> G(n);\n\trep(i, n)rep(j, m) {\n\t\tcin >> vs[i][j];\n\t}\n\trep(i, n)Rep(j, i + 1, n) {\n\t\t//cout << i << \" \" << j << \" \"<<calc(vs[i], vs[j]) << \" \" << calc(vs[j], vs[i]) << \"\\n\";\n\t\tG[i].push_back({ j,-calc(vs[i],vs[j]) });\n\t\tG[j].push_back({ i,-calc(vs[j],vs[i]) });\n\t}\n\tvector<bool> exi(n, true);\n\tld ma = 0;\n\trep(i, n) {\n\t\tvector<vector<edge>> nG = G;\n\t\t//cout << \"hello\\n\";\n\t\tvector<P> res = chu_liu_edmonds(nG, exi,i);\n\t\tmap<P, bool> mp;\n\t\tfor (P p : res) {\n\t\t\t//cout << p.first << \" \" << p.second << \"\\n\";\n\t\t\tmp[p] = true;\n\t\t}\n\t\tld sum = 0;\n\t\trep(i, n)for (edge e : G[i]) {\n\t\t\tif (mp[{i, e.to}])sum += e.cost;\n\t\t}ma = min(ma, sum);\n\t}\n\t\n\trep(i, n) {\n\t\tld c = 0;\n\t\trep(j, vs[i].size()) {\n\t\t\tc += vs[i][j] * vs[i][j];\n\t\t}\n\t\tma +=c;\n\t}\n\tcout << ma << \"\\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//expr();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":0.061224489795918366,"time_ms":520,"memory_kb":15224,"score_of_the_acc":-1.0229,"final_rank":20},{"submission_id":"aoj_2309_4807312","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\n\nconst int max_n = 1000;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\n\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}\nstruct uf {\nprivate:\n\tvector<int> par, ran;\npublic:\n\tuf(int n) {\n\t\tpar.resize(n, 0);\n\t\tran.resize(n, 0);\n\t\trep(i, n) {\n\t\t\tpar[i] = i;\n\t\t}\n\t}\n\tint find(int x) {\n\t\tif (par[x] == x)return x;\n\t\telse return par[x] = find(par[x]);\n\t}\n\tvoid unite(int x, int y) {\n\t\tx = find(x), y = find(y);\n\t\tif (x == y)return;\n\t\tif (ran[x] < ran[y]) {\n\t\t\tpar[x] = y;\n\t\t}\n\t\telse {\n\t\t\tpar[y] = x;\n\t\t\tif (ran[x] == ran[y])ran[x]++;\n\t\t}\n\t}\n\tbool same(int x, int y) {\n\t\treturn find(x) == find(y);\n\t}\n};\nld calc(vector<ld> dp,vector<ld> p) {\n\tld le = -3, ri = 3;\n\tauto cal = [&](ld t) {\n\t\tld sum = 0;\n\t\trep(i, dp.size()) {\n\t\t\tld x = p[i] + t * dp[i];\n\t\t\tsum += x * x;\n\t\t}\n\t\treturn sqrtl(sum);\n\t};\n\trep(i, 60) {\n\t\tld ml = (le * 5 + ri * 4) / 9.0;\n\t\tld mr = (le * 4 + ri * 5) / 9.0;\n\t\tld cl = cal(ml);\n\t\tld cr = cal(mr);\n\t\tif (cl < cr) {\n\t\t\tri = mr;\n\t\t}\n\t\telse le = ml;\n\t}\n\tld sum = 0;\n\trep(i, p.size())sum += p[i] * p[i];\n\tld mem = cal(le);\n\tsum -= mem * mem;\n\treturn sum;\n}\nvoid solve() {\n\tint n, m; cin >> m >> n;\n\tvector<vector<ld>> vs(n,vector<ld>(m));\n\trep(i, n)rep(j, m) {\n\t\tcin >> vs[i][j];\n\t}\n\tvector < pair<ld,P>> v;\n\trep(i, n)Rep(j, i + 1, n) {\n\t\tv.push_back({ calc(vs[i],vs[j]),{i,j} });\n\t\tv.push_back({ calc(vs[j],vs[i]),{j,i} });\n\t}\n\tld ans = 0;\n\trep(i, n) {\n\t\tld sum = 0; rep(j, m)sum += vs[i][j] * vs[i][j];\n\t\tans += sum;\n\t}\n\tsort(all(v), greater<pair<ld, P>>());\n\tuf u(n);\n\tvector<bool> used(n);\n\tint tmp = 0;\n\trep(i, v.size()) {\n\t\tint l = v[i].second.first, r = v[i].second.second;\n\t\tif (!u.same(l,r)&&!used[r]) {\n\t\t\tu.unite(l, r); used[r] = true;\n\t\t\tans -= v[i].first;\n\n\t\t\t//cout << v[i].first << \" \" << l << \" \" << r << \"\\n\";\n\t\t}\n\t}\n\tcout << ans << \"\\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//expr();\n\t//int t; cin >> t; rep(i, t)\n\tsolve();\n\treturn 0;\n}","accuracy":0.061224489795918366,"time_ms":30,"memory_kb":3480,"score_of_the_acc":-0.0324,"final_rank":14},{"submission_id":"aoj_2309_3221148","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\n// (重み, u->v)\nusing Edge = pair<double,pair<int,int>>;\n\nconst double INF = 19191919;\n\n// 辺集合, 頂点数, 根\ndouble Chu_Liu_Edmonds(const vector<Edge> es, int V, int root){\n // 頂点iに入ってくる辺(u->i)の中で、最小のコストの辺を管理 (コスト, u)\n vector<pair<double,int>> mn(V, {INF,-1});\n for(Edge e:es){\n int u = e.se.fi, v = e.se.se;\n mn[v] = min(mn[v], {e.fi, u});\n }\n mn[root] = {0,-1};\n\n // 連結成分に分ける(1つの閉路に対して1つの番号を与える)\n vector<int> cmp(V);\n // この連結成分が閉路であるか\n vector<bool> cycle(V,false);\n int cc = 0;\n\n vector<bool> vis(V);\n rep(i,V){\n if(vis[i]) continue;\n\n vector<int> path;\n int now = i;\n\n while(now!=-1 && !vis[now]){\n vis[now] = true;\n path.pb(now);\n\n // 今張っている辺を逆方向にたどる\n now = mn[now].se;\n }\n\n if(now != -1){\n bool in_cycle = false;\n for(int j:path){\n cmp[j] = cc;\n if(j == now){\n // 閉路の始点(これ以降のpathに入ってる頂点が閉路をなす)\n in_cycle = true;\n cycle[cc] = true;\n }\n\n if(!in_cycle) ++cc;\n }\n if(in_cycle) ++cc;\n }\n else{\n // 閉路なし\n for(int j:path) cmp[j] = cc++;\n }\n }\n\n if(cc == V){\n // すべての頂点が違う連結成分に分かれたので 閉路なし\n double ans = 0;\n rep(i,V) ans += mn[i].fi;\n return ans;\n }\n\n // 閉路分のコスト\n double cycle_cost = 0;\n rep(i,V){\n if(i!=root && cycle[cmp[i]]) cycle_cost += mn[i].fi;\n }\n\n // コストを再設定\n vector<Edge> nes;\n for(Edge e:es){\n int u = e.se.fi, v = e.se.se;\n int cu = cmp[u], cv = cmp[v];\n\n if(cu == cv){\n // 閉路内の辺は無視\n continue;\n }\n else if(cycle[cv]){\n // コストを再設定\n nes.pb({e.fi - mn[v].fi, {cu,cv}});\n }\n else{\n nes.pb({e.fi, {cu,cv}});\n }\n }\n\n return cycle_cost + Chu_Liu_Edmonds(nes, cc, cmp[root]);\n};\n\ndouble size(const vector<double> &v){\n int n = v.size();\n double ret = 0;\n rep(i,n) ret += v[i]*v[i];\n return ret;\n}\n\nvector<double> getv(const vector<double> &v, const vector<double> &u, double r){\n int n = v.size();\n vector<double> ret(n);\n rep(i,n) ret[i] = v[i]+u[i]*r;\n return ret;\n}\n\nconst double LIM = 100;\ndouble calc(const vector<double> &v, const vector<double> &u){\n int n = v.size();\n\n double l=-LIM, r=LIM;\n rep(loop,60){\n double m1 = (2*l+r)/3, m2 = (l+2*r)/3;\n if(size(getv(v,u,m1)) < size(getv(v,u,m2))) r = m2;\n else l = m1;\n }\n\n return size(getv(v,u,r));\n}\n\nint main(){\n int n,m;\n cin >>n >>m;\n\n vector<vector<double>> v(m);\n rep(i,m){\n vector<double> tmp(n);\n rep(j,n) cin >>tmp[j];\n v[i] = tmp;\n }\n\n vector<Edge> Es;\n rep(i,m)rep(j,m)if(i!=j){\n Es.pb({calc(v[j],v[i]),{i,j}});\n // printf(\" %d %d -> %f\\n\",i,j,calc(v[j],v[i]));\n }\n\n double ans = INF;\n rep(i,m){\n double res = Chu_Liu_Edmonds(Es,m,i);\n ans = min(ans, size(v[i])+res);\n // printf(\" %d:: %f\\n\",i,res);\n }\n printf(\"%.10f\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":960,"memory_kb":23768,"score_of_the_acc":-1.8314,"final_rank":11},{"submission_id":"aoj_2309_3179710","code_snippet":"#include <bits/stdc++.h>\n#define re(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n\nstruct UnionFind{\n int n;\n vector<int> r,p;\n UnionFind(){}\n UnionFind(int sz):n(sz),r(sz,1),p(sz,0){iota(p.begin(),p.end(),0);}\n int find(int x){\n return (x==p[x]?x:p[x]=find(p[x]));\n }\n bool same(int x,int y){\n return find(x)==find(y);\n }\n void unite(int x,int y){\n x=find(x);y=find(y);\n if(x==y) return;\n r[x]+=r[y];\n p[y]=x;\n }\n};\n\ntemplate<typename T, typename E>\nstruct SkewHeap{\n using G = function<T(T,E)>;\n using H = function<E(E,E)>;\n using C = function<bool(T,T)>;\n G g;\n H h;\n C c;\n T INF;\n E ei;\n SkewHeap(G g,H h,C c,T INF,E ei):g(g),h(h),c(c),INF(INF),ei(ei){}\n \n struct Node{\n Node *l,*r;\n T val;\n E add;\n Node(T val,E add):val(val),add(add){l=r=nullptr;}\n };\n\n void eval(Node *a){\n if(a==nullptr) return;\n if(a->add==ei) return;\n if(a->l) a->l->add=h(a->l->add,a->add);\n if(a->r) a->r->add=h(a->r->add,a->add);\n a->val=g(a->val,a->add);\n a->add=ei;\n }\n \n T top(Node *a){\n return a!=nullptr?g(a->val,a->add):INF;\n }\n\n T snd(Node *a){\n eval(a);\n return a!=nullptr?min(top(a->l),top(a->r)):INF;\n }\n\n Node* add(Node *a,E d){\n if(a!=nullptr) a->add=h(a->add,d);\n return a;\n }\n \n Node* push(T v){\n return new Node(v,ei);\n }\n \n Node* meld(Node *a,Node *b){\n using V = tuple<Node*, Node*>;\n stack<V> st;\n Node* res;\n ENTRYPOINT:\n if(!a||!b) res=a?a:b;\n else{\n if(c(top(a),top(b))) swap(a,b);\n eval(a);\n st.emplace(a,b);\n a=a->r;\n goto ENTRYPOINT;\n RETURNPOINT:\n tie(a,b)=st.top();st.pop();\n a->r=res;\n swap(a->l,a->r);\n res=a;\n }\n if(!st.empty()) goto RETURNPOINT;\n return res;\n }\n \n Node* pop(Node* a){\n eval(a);\n auto res=meld(a->l,a->r);\n delete a;\n return res;\n }\n \n};\n\n//INSERT ABOVE HERE\ntemplate<typename T>\nstruct Arborescence{\n typedef pair<T, int> P;\n using Heap = SkewHeap<P, T>;\n \n struct edge{\n int from,to;\n T cost;\n edge(){}\n edge(int from,int to,T cost):from(from),to(to),cost(cost){}\n };\n \n int n;\n P INF;\n UnionFind uf;\n vector<edge> edges;\n vector<typename Heap::Node*> come;\n vector<int> used,from;\n vector<T> cost;\n \n Arborescence(int n,T INF):n(n),INF(INF,-1),uf(n),come(n,NULL),\n used(n,0),from(n,-1),cost(n,-1){};\n\n void add_edge(int from,int to,T cost){\n edges.emplace_back(from,to,cost);\n }\n\n void input(int m,int offset=0){\n for(int i=0;i<m;i++){\n int u,v;\n T c;\n cin>>u>>v>>c;\n add_edge(u+offset,v+offset,c);\n }\n }\n\n T build(int r){\n typename Heap::G g=[](P a,T b){return P(a.first+b,a.second);};\n typename Heap::H h=[](T a,T b){return a+b;};\n typename Heap::C c=[](P a,P b){return a>b;};\n Heap heap(g,h,c,INF,0);\n \n used[r]=2;\n for(int i=0;i<(int)edges.size();i++){\n edge &e=edges[i];\n come[e.to]=heap.meld(come[e.to],heap.push(P(e.cost,i)));\n }\n \n T res=0;\n for(int i=0;i<n;i++){\n if(used[i]) continue;\n int v=i;\n vector<int> l;\n while(used[v]!=2){\n used[v]=1;\n l.emplace_back(v);\n if(!come[v]) return T(-1);\n from[v]=uf.find(edges[come[v]->val.second].from);\n cost[v]=heap.top(come[v]).first;\n come[v]=heap.pop(come[v]);\n if(from[v]==v) continue;\n \n res+=cost[v];\n if(used[from[v]]==1){\n int p=v;\n do{\n if(come[p]!=nullptr) heap.add(come[p],-cost[p]);\n if(p!=v){\n uf.unite(v,p);\n come[v]=heap.meld(come[v],come[p]);\n }\n p=uf.find(from[p]);\n }while(p!=v);\n }else{\n v=from[v];\n }\n }\n for(int u:l) used[u]=2;\n }\n return res;\n }\n};\n\nint n,m;\ndouble v[111][111];\ndouble cost[111][111];\nsigned main(){\n cin>>n>>m;\n Arborescence<double> G(m+1,1e14);\n re(i,m)re(j,n)cin>>v[i][j];\n re(j,n)v[m][j]=0;\n re(i,m)re(j,m){\n if(i==j)continue;\n double L=-1000,R=1000;\n re(k,50){\n double mid=(L+R)/2;\n double s1=0,s2=0;\n re(l,n)s1+=abs(v[j][l]-mid*v[i][l])*abs(v[j][l]-mid*v[i][l]);\n re(l,n)s2+=abs(v[j][l]-(mid+1e-6)*v[i][l])*abs(v[j][l]-(mid+1e-6)*v[i][l]);\n if(s1>s2)L=mid;\n else R=mid;\n }\n double sum=0;\n re(l,n)sum+=abs(v[j][l]-L*v[i][l])*abs(v[j][l]-L*v[i][l]);\n G.add_edge(i,j,sum);\n }\n re(i,m){\n double sum=0;\n re(l,n)sum+=v[i][l]*v[i][l];\n G.add_edge(m,i,sum);\n }\n printf(\"%.9f\\n\", G.build(m));\n}","accuracy":1,"time_ms":80,"memory_kb":3844,"score_of_the_acc":-0.0997,"final_rank":7},{"submission_id":"aoj_2309_2994948","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\n#define double long double\n\ndouble size(const vector<double> &v){\n int n = v.size();\n double ret = 0;\n rep(i,n) ret += v[i]*v[i];\n return ret;\n}\n\nvector<double> getv(const vector<double> &v, const vector<double> &u, double r){\n int n = v.size();\n vector<double> ret(n);\n rep(i,n) ret[i] = v[i]+u[i]*r;\n return ret;\n}\n\nconst double LIM = 100;\ndouble calc(const vector<double> &v, const vector<double> &u){\n int n = v.size();\n\n double l=-LIM, r=LIM;\n rep(loop,40){\n double m1 = (2*l+r)/3, m2 = (l+2*r)/3;\n if(size(getv(v,u,m1)) < size(getv(v,u,m2))) r = m2;\n else l = m1;\n }\n\n return size(getv(v,u,r));\n}\n\nint main(){\n int n,m;\n cin >>n >>m;\n\n vector<vector<double>> v(m);\n rep(i,m){\n vector<double> tmp(n);\n rep(j,n) cin >>tmp[j];\n v[i] = tmp;\n }\n\n double ans = 0;\n\n using P = pair<double,int>;\n priority_queue<P, vector<P>, greater<P>> pq;\n vector<bool> vis(m);\n rep(i,m) pq.push({size(v[i]),i});\n while(!pq.empty()){\n P now = pq.top();\n pq.pop();\n int x = now.se;\n if(vis[x]) continue;\n\n vis[x] = true;\n ans += now.fi;\n rep(i,m){\n pq.push({calc(v[i],v[x]),i});\n }\n }\n\n printf(\"%.10Lf\\n\", ans);\n return 0;\n}","accuracy":0.061224489795918366,"time_ms":110,"memory_kb":3384,"score_of_the_acc":-0.1127,"final_rank":19},{"submission_id":"aoj_2309_2994905","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\n#define double long double\n\ndouble size(const vector<double> &v){\n int n = v.size();\n double ret = 0;\n rep(i,n) ret += v[i]*v[i];\n return ret;\n}\n\nvector<double> getv(const vector<double> &v, const vector<double> &u, double r){\n int n = v.size();\n vector<double> ret(n);\n rep(i,n) ret[i] = v[i]+u[i]*r;\n return ret;\n}\n\nconst double LIM = 100;\ndouble calc(const vector<double> &v, const vector<double> &u){\n int n = v.size();\n\n double l=-LIM, r=LIM;\n rep(loop,40){\n double m1 = (2*l+r)/3, m2 = (l+2*r)/3;\n if(size(getv(v,u,m1)) < size(getv(v,u,m2))) r = m2;\n else l = m1;\n }\n\n return size(getv(v,u,r));\n}\n\nbool comp(const vector<double> &v, const vector<double> &u){\n return size(v) + min(size(u),calc(u,v)) < size(u) + min(size(v),calc(v,u));\n}\n\nint main(){\n int n,m;\n cin >>n >>m;\n\n vector<vector<double>> v(m);\n rep(i,m){\n vector<double> tmp(n);\n rep(j,n) cin >>tmp[j];\n v[i] = tmp;\n }\n\n sort(all(v), comp);\n\n double ans = 0;\n rep(i,m){\n double add = size(v[i]);\n rep(j,i) add = min(add, calc(v[i],v[j]));\n ans += add;\n }\n printf(\"%.10Lf\\n\", ans);\n return 0;\n}","accuracy":0.061224489795918366,"time_ms":70,"memory_kb":3200,"score_of_the_acc":-0.0632,"final_rank":18},{"submission_id":"aoj_2309_2994892","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\ndouble size(const vector<double> &v){\n int n = v.size();\n double ret = 0;\n rep(i,n) ret += v[i]*v[i];\n return ret;\n}\n\nvector<double> getv(const vector<double> &v, const vector<double> &u, double r){\n int n = v.size();\n vector<double> ret(n);\n rep(i,n) ret[i] = v[i]+u[i]*r;\n return ret;\n}\n\nconst double LIM = 3;\ndouble calc(const vector<double> &v, const vector<double> &u){\n int n = v.size();\n\n double l=-LIM, r=LIM;\n rep(loop,40){\n double m1 = (2*l+r)/3, m2 = (l+2*r)/3;\n if(size(getv(v,u,m1)) < size(getv(v,u,m2))) r = m2;\n else l = m1;\n }\n\n return size(getv(v,u,r));\n}\n\nbool comp(const vector<double> &v, const vector<double> &u){\n return size(v) + calc(v,u) < size(u) + calc(u,v);\n}\n\nint main(){\n int n,m;\n cin >>n >>m;\n\n vector<vector<double>> v(m);\n rep(i,m){\n vector<double> tmp(n);\n rep(j,n) cin >>tmp[j];\n v[i] = tmp;\n }\n\n sort(all(v), comp);\n\n double ans = 0;\n rep(i,m){\n double add = size(v[i]);\n rep(j,i) add = min(add, calc(v[i],v[j]));\n ans += add;\n }\n printf(\"%.10f\\n\", ans);\n return 0;\n}","accuracy":0.061224489795918366,"time_ms":40,"memory_kb":3268,"score_of_the_acc":-0.0343,"final_rank":15},{"submission_id":"aoj_2309_2282933","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef double ldouble;\ntypedef vector<ldouble> Point;\nldouble INF=1e9;\n\nstruct UnionFind{\n vector<int> par,rank;\n void init(int n){\n par.clear();\n rank.clear();\n par.resize(n);\n rank.resize(n);\n for(int i=0;i<n;i++){\n par[i]=i;\n rank[i]=1;\n }\n }\n \n int find(int x){\n if(x==par[x])return x;\n return par[x]=find(par[x]);\n }\n\n bool same(int x,int y){\n return ( find(x)==find(y) );\n }\n \n void unite(int x,int y){\n x=find(x);\n y=find(y);\n if(x==y)return;\n if(rank[x]<rank[y])swap(x,y);\n par[y]=x;\n rank[x]+=rank[y];\n }\n};\n\nstruct edge{\n int from;\n int to;\n ldouble cost;\n int id;\n edge(int from,int to,ldouble cost,int id) :from(from), to(to),cost(cost),id(id) {}\n bool operator < (const edge e)const{\n return cost > e.cost;\n }\n};\n\ntypedef priority_queue< edge > prque;\ntypedef prque* Prque;\n\ntypedef vector<edge> Node;\ntypedef vector<Node> Graph;\n\n\nPrque Merge(vector< Prque > &Q, vector<edge> &ev,int A,int C){\n if( Q[C]->size() < Q[A]->size() ){\n\n while( !Q[C]->empty() ){\n edge e=Q[C]->top();\n e.cost-=ev[C].cost;\n e.cost+=ev[A].cost;\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<' '<<ev[A].cost<<' '<<ev[C].cost<<endl;\n Q[A]->push(e);\n Q[C]->pop();\n }\n ev[C].cost=ev[A].cost;\n return Q[A];\n }else{\n while( !Q[A]->empty() ){\n edge e=Q[A]->top();\n e.cost-=ev[A].cost;\n e.cost+=ev[C].cost;\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<endl;\n Q[C]->push(e);\n Q[A]->pop();\n }\n return Q[C];\n }\n}\n\nldouble solve(Graph &G,vector<edge> &edges,int root){\n\n int n=G.size();\n ldouble res=0;\n \n vector<int> used(n,0);\n vector< edge > ev(n, (edge){0,0,0,-1} );\n vector< prque > pool(n);\n vector< Prque > Q(n);\n for(int i=0;i<n;i++)Q[i]=&pool[i];\n \n UnionFind uf;\n uf.init(n);\n \n for(int i=0;i<(int)edges.size();i++){\n edge e=edges[i];\n Q[ e.to ]->push( e );\n }\n \n used[root]=2;\n for(int Pos=0;Pos<n;Pos++){\n if(used[Pos]==2)continue;\n int pos=Pos;\n vector<int> path;\n \n while( used[pos] != 2 ){\n pos=uf.find(pos);\n \n used[pos]=1;\n path.push_back(pos);\n if( Q[pos]->empty() ){\n return INF;\n }\n \n edge e=Q[pos]->top();\n\n \n Q[pos]->pop();\n e.cost-=ev[pos].cost;\n if( uf.same(e.from,pos) ) continue;\n ldouble tmpcost=ev[pos].cost;\n /*\n cout<<\" pos=\"<<pos;\n cout<<\" e.from=\"<<e.from;\n cout<<\" e.to=\"<<e.to;\n cout<<\" e.cost=\"<<e.cost;\n cout<<\" tmpcost=\"<<tmpcost<<endl;\n cout<<endl;\n */\n res+=e.cost;\n e.cost+=tmpcost;\n ev[pos]=e;\n if( used[ uf.find(e.from) ] == 2 )break;\n if( used[ uf.find(e.from) ] == 0 ){\n pos=e.from;\n continue;\n }\n int pre=uf.find(e.from);\n for(int i=0;i<100;i++){\n if(!uf.same(pre,pos)){\n int A=uf.find(pre), B=uf.find(pos);\n uf.unite(A,B);\n int C=uf.find(A);\n /*\n cout<<\" !!A=\"<<A;\n cout<<\" !!B=\"<<B;\n cout<<\" !!C=\"<<C<<endl;\n */\n Prque tmp=NULL;\n if(B==C)tmp=Merge(Q,ev,A,C);\n else if(A==C)tmp=Merge(Q,ev,B,C);\n else assert(0);\n \n Q[C]=tmp;\n }\n pre=uf.find(ev[pre].from);\n }\n }// while_pos\n\n for(int i=0;i<(int)path.size();i++)used[ path[i] ]=2;\n }// Pos\n return res;\n}\n\n\nPoint add(Point a,Point b){\n Point res(a.size());\n for(int i=0;i<(int)a.size();i++)\n res[i]=a[i]+b[i];\n return res;\n}\n\nPoint sub(Point a,Point b){\n Point res(a.size());\n for(int i=0;i<(int)a.size();i++)\n res[i]=a[i]-b[i];\n return res;\n}\n\nldouble dot(Point a,Point b){\n ldouble res=0;\n for(int i=0;i<(int)a.size();i++)\n res+=a[i]*b[i];\n return res;\n}\n\nldouble norm(Point p){\n return dot(p,p);\n}\n\nldouble abs(Point p){\n return sqrt( norm(p) );\n}\n\ndouble Sqrt(double x){\n if(x<0)return 0;\n return sqrt(x);\n}\n\ndouble project(Point a,Point b){\n ldouble t=dot(a,b);\n \n // cout<<a[0]<<' '<<a[1]<<endl;\n // cout<<b[0]<<' '<<b[1]<<endl;\n // cout<< dot(a,b) <<endl;\n return abs( norm(b) - (t*t/norm(a)) );\n}\n\n\nint main(){\n int n,m;\n vector< Point > t;\n \n cin>>m>>n;\n for(int i=0;i<n;i++){\n Point a(m);\n for(int j=0;j<m;j++){\n cin>>a[j];\n }\n\n if(norm(a) < 0.00000001){\n continue;\n }\n t.push_back(a);\n }\n n=t.size();\n Graph G;\n G.resize(n+1);\n int cc=0;\n for(int i=0;i<n;i++){\n G[n].push_back( edge(n,i,norm(t[i]) , cc++) );\n for(int j=0;j<n;j++){\n if(i==j)continue;\n ldouble cost=project(t[i],t[j]);\n G[i].push_back( edge(i,j,cost,cc++) );\n }\n }\n\n vector<edge> edges;\n for(int i=0;i<=n;i++)\n for(int j=0;j<(int)G[i].size();j++)\n edges.push_back(G[i][j]);\n \n printf(\"%.10f\\n\",(double) solve(G,edges,n) );\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4420,"score_of_the_acc":-0.0493,"final_rank":5},{"submission_id":"aoj_2309_2282859","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef vector<double> Point;\n\ndouble INF=1e9;\n\nstruct UnionFind{\n vector<int> par,rank;\n void init(int n){\n par.clear();\n rank.clear();\n par.resize(n);\n rank.resize(n);\n for(int i=0;i<n;i++){\n par[i]=i;\n rank[i]=1;\n }\n }\n \n int find(int x){\n if(x==par[x])return x;\n return par[x]=find(par[x]);\n }\n\n bool same(int x,int y){\n return ( find(x)==find(y) );\n }\n \n void unite(int x,int y){\n x=find(x);\n y=find(y);\n if(x==y)return;\n if(rank[x]<rank[y])swap(x,y);\n par[y]=x;\n rank[x]+=rank[y];\n }\n};\n\nstruct edge{\n int from;\n int to;\n double cost;\n int id;\n edge(int from,int to,double cost,int id) :from(from), to(to),cost(cost),id(id) {}\n bool operator < (const edge e)const{\n return cost > e.cost;\n }\n};\n\ntypedef priority_queue< edge > prque;\ntypedef prque* Prque;\n\ntypedef vector<edge> Node;\ntypedef vector<Node> Graph;\n\n\nPrque Merge(vector< Prque > &Q, vector<edge> &ev,int A,int C){\n if( Q[C]->size() < Q[A]->size() ){\n\n while( !Q[C]->empty() ){\n edge e=Q[C]->top();\n e.cost-=ev[C].cost;\n e.cost+=ev[A].cost;\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<' '<<ev[A].cost<<' '<<ev[C].cost<<endl;\n Q[A]->push(e);\n Q[C]->pop();\n }\n ev[C].cost=ev[A].cost;\n return Q[A];\n }else{\n while( !Q[A]->empty() ){\n edge e=Q[A]->top();\n e.cost-=ev[A].cost;\n e.cost+=ev[C].cost;\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<endl;\n Q[C]->push(e);\n Q[A]->pop();\n }\n return Q[C];\n }\n}\n\ndouble solve(Graph &G,vector<edge> &edges,int root){\n\n int n=G.size();\n double res=0;\n \n vector<int> used(n,0);\n vector< edge > ev(n, (edge){0,0,0,-1} );\n vector< prque > pool(n);\n vector< Prque > Q(n);\n for(int i=0;i<n;i++)Q[i]=&pool[i];\n \n UnionFind uf;\n uf.init(n);\n \n for(int i=0;i<(int)edges.size();i++){\n edge e=edges[i];\n Q[ e.to ]->push( e );\n }\n \n used[root]=2;\n for(int Pos=0;Pos<n;Pos++){\n if(used[Pos]==2)continue;\n int pos=Pos;\n vector<int> path;\n \n while( used[pos] != 2 ){\n pos=uf.find(pos);\n \n used[pos]=1;\n path.push_back(pos);\n if( Q[pos]->empty() ){\n return INF;\n }\n \n edge e=Q[pos]->top();\n\n \n Q[pos]->pop();\n e.cost-=ev[pos].cost;\n if( uf.same(e.from,pos) ) continue;\n double tmpcost=ev[pos].cost;\n /*\n cout<<\" pos=\"<<pos;\n cout<<\" e.from=\"<<e.from;\n cout<<\" e.to=\"<<e.to;\n cout<<\" e.cost=\"<<e.cost;\n cout<<\" tmpcost=\"<<tmpcost<<endl;\n cout<<endl;\n */\n res+=e.cost;\n e.cost+=tmpcost;\n ev[pos]=e;\n if( used[ uf.find(e.from) ] == 2 )break;\n if( used[ uf.find(e.from) ] == 0 ){\n pos=e.from;\n continue;\n }\n int pre=uf.find(e.from);\n for(int i=0;i<100;i++){\n if(!uf.same(pre,pos)){\n int A=uf.find(pre), B=uf.find(pos);\n uf.unite(A,B);\n int C=uf.find(A);\n /*\n cout<<\" !!A=\"<<A;\n cout<<\" !!B=\"<<B;\n cout<<\" !!C=\"<<C<<endl;\n */\n Prque tmp=NULL;\n if(B==C)tmp=Merge(Q,ev,A,C);\n else if(A==C)tmp=Merge(Q,ev,B,C);\n else assert(0);\n \n Q[C]=tmp;\n }\n pre=uf.find(ev[pre].from);\n }\n }// while_pos\n\n for(int i=0;i<(int)path.size();i++)used[ path[i] ]=2;\n }// Pos\n return res;\n}\n\n\nPoint add(Point a,Point b){\n Point res(a.size());\n for(int i=0;i<(int)a.size();i++)\n res[i]=a[i]+b[i];\n return res;\n}\n\nPoint sub(Point a,Point b){\n Point res(a.size());\n for(int i=0;i<(int)a.size();i++)\n res[i]=a[i]-b[i];\n return res;\n}\n\ndouble dot(Point a,Point b){\n double res=0;\n for(int i=0;i<(int)a.size();i++)\n res+=a[i]*b[i];\n return res;\n}\n\ndouble norm(Point p){\n return dot(p,p);\n}\n\nPoint project(Point a,Point b,Point p){\n Point base( a.size() );\n Point target( a.size() );\n for(int i=0;i<(int)a.size();i++){\n base[i]=b[i]-a[i];\n target[i]=p[i]-a[i];\n }\n double t=dot(base,target);\n Point res=a;\n for(int i=0;i<(int)a.size();i++)\n res[i]=res[i]+base[i]*t/norm(base);\n return res;\n}\n\n\nint main(){\n int n,m;\n vector< Point > t;\n \n cin>>m>>n;\n for(int i=0;i<n;i++){\n Point a(m);\n for(int j=0;j<m;j++){\n cin>>a[j];\n }\n t.push_back(a);\n }\n\n Point cen( m , 0 );\n \n Graph G;\n G.resize(n+1);\n int cc=0;\n for(int i=0;i<n;i++){\n G[n].push_back( edge(n,i,norm(t[i]) , cc++) );\n \n for(int j=0;j<n;j++){\n if(i==j)continue;\n Point pp = project( t[j] , add(t[j],t[i]) , cen);\n double cost= norm( pp);\n G[i].push_back( edge(i,j,cost,cc++) );\n }\n }\n\n vector<edge> edges;\n for(int i=0;i<=n;i++)\n for(int j=0;j<(int)G[i].size();j++)\n edges.push_back(G[i][j]);\n \n printf(\"%.10f\\n\", solve(G,edges,n) );\n \n return 0;\n}","accuracy":0.9183673469387755,"time_ms":130,"memory_kb":4564,"score_of_the_acc":-0.1814,"final_rank":12},{"submission_id":"aoj_2309_2282824","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef vector<double> Point;\n\ndouble INF=1e9;\n\nstruct UnionFind{\n vector<int> par,rank;\n void init(int n){\n par.clear();\n rank.clear();\n par.resize(n);\n rank.resize(n);\n for(int i=0;i<n;i++){\n par[i]=i;\n rank[i]=1;\n }\n }\n \n int find(int x){\n if(x==par[x])return x;\n return par[x]=find(par[x]);\n }\n\n bool same(int x,int y){\n return ( find(x)==find(y) );\n }\n \n void unite(int x,int y){\n x=find(x);\n y=find(y);\n if(x==y)return;\n if(rank[x]<rank[y])swap(x,y);\n par[y]=x;\n rank[x]+=rank[y];\n }\n};\n\nstruct edge{\n int from;\n int to;\n double cost;\n int id;\n edge(int from,int to,double cost,int id) :from(from), to(to),cost(cost),id(id) {}\n bool operator < (const edge e)const{\n return cost > e.cost;\n }\n};\n\ntypedef priority_queue< edge > prque;\ntypedef prque* Prque;\n\ntypedef vector<edge> Node;\ntypedef vector<Node> Graph;\n\n\nPrque Merge(vector< Prque > &Q, vector<edge> &ev,int A,int C){\n if( Q[C]->size() < Q[A]->size() ){\n\n while( !Q[C]->empty() ){\n edge e=Q[C]->top();\n e.cost-=ev[C].cost;\n e.cost+=ev[A].cost;\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<' '<<ev[A].cost<<' '<<ev[C].cost<<endl;\n Q[A]->push(e);\n Q[C]->pop();\n }\n ev[C].cost=ev[A].cost;\n return Q[A];\n }else{\n while( !Q[A]->empty() ){\n edge e=Q[A]->top();\n e.cost-=ev[A].cost;\n e.cost+=ev[C].cost;\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<endl;\n Q[C]->push(e);\n Q[A]->pop();\n }\n return Q[C];\n }\n}\n\ndouble solve(Graph &G,vector<edge> &edges,int root){\n\n int n=G.size();\n double res=0;\n \n vector<int> used(n,0);\n vector< edge > ev(n, (edge){0,0,0,-1} );\n vector< prque > pool(n);\n vector< Prque > Q(n);\n for(int i=0;i<n;i++)Q[i]=&pool[i];\n \n UnionFind uf;\n uf.init(n);\n \n for(int i=0;i<(int)edges.size();i++){\n edge e=edges[i];\n Q[ e.to ]->push( e );\n }\n \n used[root]=2;\n for(int Pos=0;Pos<n;Pos++){\n if(used[Pos]==2)continue;\n int pos=Pos;\n vector<int> path;\n \n while( used[pos] != 2 ){\n pos=uf.find(pos);\n \n used[pos]=1;\n path.push_back(pos);\n if( Q[pos]->empty() ){\n return INF;\n }\n \n edge e=Q[pos]->top();\n\n \n Q[pos]->pop();\n e.cost-=ev[pos].cost;\n if( uf.same(e.from,pos) ) continue;\n int tmpcost=ev[pos].cost;\n /*\n cout<<\" pos=\"<<pos;\n cout<<\" e.from=\"<<e.from;\n cout<<\" e.to=\"<<e.to;\n cout<<\" e.cost=\"<<e.cost;\n cout<<\" tmpcost=\"<<tmpcost<<endl;\n cout<<endl;\n */\n res+=e.cost;\n e.cost+=tmpcost;\n ev[pos]=e;\n if( used[ uf.find(e.from) ] == 2 )break;\n if( used[ uf.find(e.from) ] == 0 ){\n pos=e.from;\n continue;\n }\n int pre=uf.find(e.from);\n for(int i=0;i<100;i++){\n if(!uf.same(pre,pos)){\n int A=uf.find(pre), B=uf.find(pos);\n uf.unite(A,B);\n int C=uf.find(A);\n /*\n cout<<\" !!A=\"<<A;\n cout<<\" !!B=\"<<B;\n cout<<\" !!C=\"<<C<<endl;\n */\n Prque tmp=NULL;\n if(B==C)tmp=Merge(Q,ev,A,C);\n else if(A==C)tmp=Merge(Q,ev,B,C);\n else assert(0);\n \n Q[C]=tmp;\n }\n pre=uf.find(ev[pre].from);\n }\n }// while_pos\n\n for(int i=0;i<(int)path.size();i++)used[ path[i] ]=2;\n }// Pos\n return res;\n}\n\n\nPoint add(Point a,Point b){\n Point res(a.size());\n for(int i=0;i<(int)a.size();i++)\n res[i]=a[i]+b[i];\n return res;\n}\n\nPoint sub(Point a,Point b){\n Point res(a.size());\n for(int i=0;i<(int)a.size();i++)\n res[i]=a[i]-b[i];\n return res;\n}\n\ndouble dot(Point a,Point b){\n double res=0;\n for(int i=0;i<(int)a.size();i++)\n res+=a[i]*b[i];\n return res;\n}\n\ndouble norm(Point p){\n return dot(p,p);\n}\n\nPoint project(Point a,Point b,Point p){\n Point base( a.size() );\n Point target( a.size() );\n for(int i=0;i<(int)a.size();i++){\n base[i]=b[i]-a[i];\n target[i]=p[i]-a[i];\n }\n double t=dot(base,target);\n Point res=a;\n for(int i=0;i<(int)a.size();i++)\n res[i]=res[i]+base[i]*t/norm(base);\n return res;\n}\n\n\nint main(){\n int n,m;\n vector< Point > t;\n \n cin>>m>>n;\n for(int i=0;i<n;i++){\n Point a(m);\n for(int j=0;j<m;j++){\n cin>>a[j];\n }\n t.push_back(a);\n }\n\n Point cen( m , 0 );\n \n Graph G;\n G.resize(n+1);\n int cc=0;\n for(int i=0;i<n;i++){\n G[n].push_back( edge(n,i, (norm(t[i])) , cc++) );\n \n \n for(int j=0;j<n;j++){\n if(i==j)continue;\n \n Point pp = project( t[j] , add(t[j],t[i]) , cen);\n double cost= norm( pp);\n G[i].push_back( edge(i,j,cost,cc++) );\n\n // cout<<i<<' '<<j<<' '<< cost << ' ' <<pp[0]<<' '<<pp[1]<<endl;\n }\n }\n\n vector<edge> edges;\n for(int i=0;i<=n;i++)\n for(int j=0;j<(int)G[i].size();j++)\n edges.push_back(G[i][j]);\n \n printf(\"%.10f\\n\", solve(G,edges,n) );\n \n return 0;\n}","accuracy":0.061224489795918366,"time_ms":30,"memory_kb":4144,"score_of_the_acc":-0.0592,"final_rank":17},{"submission_id":"aoj_2309_2185204","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<queue>\n#include<stack>\n#include<vector>\nusing namespace std;\n\n\nstruct edge\n{\n int begin;int end;\t\n};\n\nconst int maxx=120;\nbool vis[maxx],indfs[maxx];\nvector<double>zero;\nint n,m,root;\nvector<vector<double> >vec;\ndouble cost[maxx][maxx],Cost[maxx][maxx];\nbool operator <(const edge a,const edge b)\n{\n double ac=cost[a.begin][a.end];double bc=cost[b.begin][b.end];\n return ac>bc;//´?????´?????\t\n};\npriority_queue<edge>que[maxx];\ndouble minv(vector<double> a,vector<double> b)\n{\n double ab=0,bsqrt=0,asqrt=0;\n for(int i=0;i<a.size();i++)\n \t{ab+=a[i]*b[i];bsqrt+=b[i]*b[i];asqrt+=a[i]*a[i];}\n \t\n if((bsqrt-0.0)<1e-10)return asqrt;\n return asqrt-(ab*ab/bsqrt);\n}\nint belongcircle[maxx];\nint findbelong(int x)\n{\n if(x==belongcircle[x])return x;\n \telse return belongcircle[x]=findbelong(belongcircle[x]);\n}\n\ndouble ans,ansnow;\ndouble min(double a,double b)\n{\n if(a<b)return a;\n \telse return b;\n}\nvoid combinecircle(int now,int begin)\n{\n now=findbelong(now);\n if(vis[now])return ;\n vis[now]=true;\n edge e1=que[now].top();\n double coste=cost[findbelong(e1.begin)][findbelong(e1.end)];\n ansnow+=coste;\n bool finish[maxx];\n memset(finish,0,sizeof(finish));\n for(int i=0;i<=m;i++)\n \t{\n \t int po=findbelong(i);\n \t if(po==now||po==begin)continue;\n \t if(finish[po])continue;\n \t finish[po]=true;\n \t cost[begin][po]=min(cost[begin][po],cost[now][po]-coste);\n \t cost[po][begin]=min(cost[po][begin],cost[po][now]);\n\t}\n belongcircle[now]=begin;\n combinecircle(e1.end,begin);\n return ;\n}\nvoid build();\nbool findcircle(int now)\n{\n if(now==root)return false; \n now=findbelong(now);\n if(indfs[now])\n \t{\n \t memset(vis,0,sizeof(vis));\n \t combinecircle(now,now);\n \t build();\n \t return true;\n\t}\n indfs[now]=true;\n return findcircle(que[now].top().end);\n}\n\nvoid build()\n{\n bool finish[maxx];\n memset(finish,0,sizeof(finish));\n for(int i=0;i<m;i++)\n \t{\n \t int po=findbelong(i);\n \t if(finish[po])continue;\n \t finish[po]=true;\n \t while(!que[po].empty())que[po].pop();\n \t for(int j=0;j<=m;j++)\n \t \t{\n \t \t int pb=findbelong(j);\n \t \t if(po==pb)continue;\n \t \t edge en;en.begin=po;en.end=pb;\n \t \t que[po].push(en);\n\t\t}\n\t}\n return ;\n}\nbool counted[maxx];\nint main()\n{\n ios::sync_with_stdio(false);\n cin>>n>>m;\n for(int i=0;i<n;i++)\n zero.push_back(0.0);\n for(int i=0;i<m;i++)\n \t{\n\t vector<double>nowv;\n\t for(int j=0;j<n;j++)\n\t \t{ double nv;cin>>nv;nowv.push_back(nv);}\n\t vec.push_back(nowv);\n\t}\n vec.push_back(zero);\n for(int i=0;i<=m;i++)\n \tfor(int j=0;j<=m;j++)\n \t\t{ cost[i][j]=minv(vec[i],vec[j]);}\n root=m;\n ansnow=0;\n belongcircle[root]=root;\n \t for(int i=0;i<m;i++)\n \t \t{\n \t \t belongcircle[i]=i;\n \t \t}\n\t bool exis=false;\n\t \t do\n\t \t \t{\n\t \t \t build();\n\t \t \t exis=false;\n\t \t \t bool finish[maxx];\n\t \t \t memset(finish,0,sizeof(finish));\n\t \t \t for(int i=0;i<m;i++)\n\t \t \t { \n\t\t\t int po=findbelong(i);\n\t\t\t if(finish[po])continue;\n\t \t \t memset(indfs,0,sizeof(indfs));\n\t \t \t exis=findcircle(po);\n\t \t \t finish[po]=true;\n\t\t\t }\n\t\t\t}while(exis);\n\t memset(counted,0,sizeof(counted));\n\t for(int i=0;i<m;i++)\n\t \t{\n\t\t int po=findbelong(i);\n\t\t if(counted[po])continue;\n\t\t counted[po]=true;\n\t\t ansnow+=cost[findbelong(que[po].top().begin)][findbelong(que[po].top().end)];\t\n\t\t}\n printf(\"%.8f\\n\",ansnow);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3564,"score_of_the_acc":-0.0252,"final_rank":3},{"submission_id":"aoj_2309_2185197","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<queue>\n#include<stack>\n#include<vector>\nusing namespace std;\n\n\nstruct edge\n{\n int begin;int end;\t\n};\n\nconst int maxx=120;\nbool vis[maxx],indfs[maxx];\nvector<double>zero;\nint n,m,root;\nvector<vector<double> >vec;\ndouble cost[maxx][maxx],Cost[maxx][maxx];\nbool operator <(const edge a,const edge b)\n{\n double ac=cost[a.begin][a.end];double bc=cost[b.begin][b.end];\n return ac>bc;//´?????´?????\t\n};\npriority_queue<edge>que[maxx];\ndouble minv(vector<double> a,vector<double> b)\n{\n double ab=0,bsqrt=0,asqrt=0;\n for(int i=0;i<a.size();i++)\n \t{ab+=a[i]*b[i];bsqrt+=b[i]*b[i];asqrt+=a[i]*a[i];}\n \t\n if((bsqrt-0.0)<1e-10)return asqrt;\n return asqrt-(ab*ab/bsqrt);\n}\nint belongcircle[maxx];\nint findbelong(int x)\n{\n if(x==belongcircle[x])return x;\n \telse return belongcircle[x]=findbelong(belongcircle[x]);\n}\n\ndouble ans,ansnow;\ndouble min(double a,double b)\n{\n if(a<b)return a;\n \telse return b;\n}\nvoid combinecircle(int now,int begin)\n{\n now=findbelong(now);\n if(vis[now])return ;\n vis[now]=true;\n edge e1=que[now].top();\n double coste=cost[findbelong(e1.begin)][findbelong(e1.end)];\n ansnow+=coste;\n bool finish[maxx];\n memset(finish,0,sizeof(finish));\n for(int i=0;i<=m;i++)\n \t{\n \t int po=findbelong(i);\n \t if(po==now||po==begin)continue;\n \t if(finish[po])continue;\n \t finish[po]=true;\n \t cost[begin][po]=min(cost[begin][po],cost[now][po]-coste);\n \t cost[po][begin]=min(cost[po][begin],cost[po][now]);\n\t}\n belongcircle[now]=begin;\n combinecircle(e1.end,begin);\n}\n\nbool findcircle(int now)\n{\n if(now==root)return false; \n now=findbelong(now);\n if(indfs[now])\n \t{\n \t memset(vis,0,sizeof(vis));\n \t combinecircle(now,now);\n \t return true;\n\t}\n indfs[now]=true;\n return findcircle(que[now].top().end);\n}\n\nvoid build()\n{\n bool finish[maxx];\n memset(finish,0,sizeof(finish));\n for(int i=0;i<m;i++)\n \t{\n \t int po=findbelong(i);\n \t if(finish[po])continue;\n \t finish[po]=true;\n \t while(!que[po].empty())que[po].pop();\n \t for(int j=0;j<=m;j++)\n \t \t{\n \t \t int pb=findbelong(j);\n \t \t if(po==pb)continue;\n \t \t edge en;en.begin=po;en.end=pb;\n \t \t que[po].push(en);\n\t\t}\n\t}\n return ;\n}\nbool counted[maxx];\nint main()\n{\n cin>>n>>m;\n for(int i=0;i<n;i++)\n zero.push_back(0.0);\n for(int i=0;i<m;i++)\n \t{\n\t vector<double>nowv;\n\t for(int j=0;j<n;j++)\n\t \t{ double nv;cin>>nv;nowv.push_back(nv);}\n\t vec.push_back(nowv);\n\t}\n vec.push_back(zero);\n for(int i=0;i<=m;i++)\n \tfor(int j=0;j<=m;j++)\n \t\t{ cost[i][j]=minv(vec[i],vec[j]);}\n root=m;\n ansnow=0;\n belongcircle[root]=root;\n \t for(int i=0;i<m;i++)\n \t \t{\n \t \t belongcircle[i]=i;\n \t \t}\n\t bool exis=false;\n\t \t do\n\t \t \t{\n\t \t \t build();\n\t \t \t exis=false;\n\t \t \t bool finish[maxx];\n\t \t \t memset(finish,0,sizeof(finish));\n\t \t \t for(int i=0;i<m;i++)\n\t \t \t { \n\t\t\t int po=findbelong(i);\n\t\t\t if(finish[po])continue;\n\t \t \t memset(indfs,0,sizeof(indfs));\n\t \t \t exis=findcircle(po);\n\t \t \t finish[po]=true;\n\t \t \t if(exis){break;}\n\t\t\t }\n\t\t\t}while(exis);\n\t memset(counted,0,sizeof(counted));\n\t for(int i=0;i<m;i++)\n\t \t{\n\t\t int po=findbelong(i);\n\t\t if(counted[po])continue;\n\t\t counted[po]=true;\n\t\t ansnow+=cost[findbelong(que[po].top().begin)][findbelong(que[po].top().end)];\t\n\t\t}\n cout<<ansnow<<endl;\n return 0;\n}","accuracy":0.061224489795918366,"time_ms":10,"memory_kb":3372,"score_of_the_acc":-0.007,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_2309_9813617\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nstruct SCC{\\n int n,m,cur;\\n vector<vector<int>> g;\\n vector<int> low,ord,id;\\n SCC(int _n=0):n(_n),m(0),cur(0),g(_n),low(_n),ord(_n,-1),id(_n){}\\n void resize(int _n){\\n n=_n;\\n g.resize(n);\\n low.resize(n);\\n ord.resize(n,-1);\\n id.resize(n);\\n }\\n void add_edge(int u,int v){g[u].emplace_back(v);}\\n void dfs(int v,vector<int>& used){\\n ord[v]=low[v]=cur++;\\n used.emplace_back(v);\\n for(auto& nxt:g[v]){\\n if(ord[nxt]==-1){\\n dfs(nxt,used); chmin(low[v],low[nxt]);\\n }\\n else{\\n chmin(low[v],ord[nxt]);\\n }\\n }\\n if(ord[v]==low[v]){\\n while(1){\\n int add=used.back(); used.pop_back();\\n ord[add]=n; id[add]=m;\\n if(v==add)break;\\n }\\n m++;\\n }\\n }\\n void run(){\\n vector<int> used;\\n rep(v,0,n)if(ord[v]==-1)dfs(v,used);\\n for(auto& x:id)x=m-1-x;\\n }\\n};\\n\\n/**\\n * @brief Strongly Connected Components\\n */\\n\\ntemplate <typename T>\\nstruct DirectedMST {\\n const vector<vector<T>>& G;\\n T _INF;\\n\\n DirectedMST(const vector<vector<T>>& G) : _INF(numeric_limits<T>::max()), G(G) {}\\n\\n T DFS(vector<vector<T>>& G, int Root, T Cur) {\\n int N = G.size();\\n vector<int> rev(N, -1);\\n vector<T> weight(N, _INF);\\n rep(i,0,N) {\\n rep(j,0,N) {\\n if (chmin(weight[j], G[i][j])) {\\n rev[j] = i;\\n }\\n }\\n }\\n SCC scc(N);\\n rep(i,0,N) {\\n if (i == Root) continue;\\n if (rev[i] == -1) return _INF;\\n scc.add_edge(rev[i],i);\\n Cur += weight[i];\\n }\\n scc.run();\\n if (scc.m == N) return Cur;\\n vector<vector<T>> NewG(scc.m,vector<T>(scc.m,_INF));\\n rep(i,0,N) {\\n rep(j,0,N) {\\n if (scc.id[i] == scc.id[j]) continue;\\n chmin(NewG[scc.id[i]][scc.id[j]], G[i][j]-weight[j]);\\n }\\n }\\n return DFS(NewG, scc.id[Root], Cur);\\n }\\n};\\n\\nusing Vec = vector<double>;\\n\\ndouble dot(Vec A, Vec B) {\\n int N = A.size();\\n double Ret = 0.0;\\n rep(i,0,N) Ret += A[i] * B[i];\\n return Ret;\\n}\\n\\nint main() {\\n int N, M;\\n cin >> M >> N;\\n vector<Vec> V(N,vector<double>(M));\\n rep(i,0,N) rep(j,0,M) cin >> V[i][j];\\n vector<vector<double>> G(N+1,vector<double>(N+1,inf));\\n rep(i,0,N) {\\n rep(j,0,N) {\\n if (i == j) continue;\\n if (dot(V[i],V[i]) == 0.0) G[i][j] = dot(V[j],V[j]);\\n G[i][j] = (dot(V[i],V[i])*dot(V[j],V[j])-dot(V[i],V[j])*dot(V[i],V[j])) / dot(V[i],V[i]);\\n }\\n }\\n rep(i,0,N) {\\n G[N][i] = dot(V[i],V[i]);\\n }\\n DirectedMST<double> mst(G);\\n printf(\\\"%.12f\\\\n\\\",mst.DFS(G,N,0.0));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4456,\n \"score_of_the_acc\": -0.0508,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2309_5448636\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG // for STL debug (optional)\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <cfloat>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <fstream>\\n#include <functional>\\n#include <bitset>\\nusing namespace std;\\nusing ll = long long int;\\nusing int64 = long long int;\\n \\ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\\n \\nint dx[] = {0, 0, 1, -1};\\nint dy[] = {1, -1, 0, 0};\\nconst int INF = 1LL << 29;\\nconst ll LONGINF = 1LL << 60;\\nconst ll MOD = 1000000007LL;\\n\\ntemplate< typename T = int >\\nstruct Edge {\\n int from, to;\\n T cost;\\n int idx;\\n\\n Edge() = default;\\n\\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\\n\\n operator int() const { return to; }\\n};\\n\\ntemplate< typename T = int >\\nstruct Graph {\\n vector< vector< Edge< T > > > g;\\n int es;\\n\\n Graph() = default;\\n\\n explicit Graph(int n) : g(n), es(0) {}\\n\\n size_t size() const {\\n return g.size();\\n }\\n\\n void add_directed_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es++);\\n }\\n\\n void add_edge(int from, int to, T cost = 1) {\\n g[from].emplace_back(from, to, cost, es);\\n g[to].emplace_back(to, from, cost, es++);\\n }\\n\\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\\n for(int i = 0; i < M; i++) {\\n int a, b;\\n cin >> a >> b;\\n a += padding;\\n b += padding;\\n T c = T(1);\\n if(weighted) cin >> c;\\n if(directed) add_directed_edge(a, b, c);\\n else add_edge(a, b, c);\\n }\\n }\\n};\\n\\ntemplate< typename T = int >\\nusing Edges = vector< Edge< T > >;\\n\\n\\n/**\\n * @brief Skew-Heap\\n */\\ntemplate< typename T, bool isMin = true >\\nstruct SkewHeap {\\n struct Node {\\n T key, lazy;\\n Node *l, *r;\\n int idx;\\n\\n explicit Node(const T &key, int idx) : key(key), idx(idx), lazy(0), l(nullptr), r(nullptr) {}\\n };\\n\\n SkewHeap() = default;\\n\\n Node *alloc(const T &key, int idx = -1) {\\n return new Node(key, idx);\\n }\\n\\n Node *propagate(Node *t) {\\n if(t && t->lazy != 0) {\\n if(t->l) t->l->lazy += t->lazy;\\n if(t->r) t->r->lazy += t->lazy;\\n t->key += t->lazy;\\n t->lazy = 0;\\n }\\n return t;\\n }\\n\\n Node *meld(Node *x, Node *y) {\\n propagate(x), propagate(y);\\n if(!x || !y) return x ? x : y;\\n if((x->key < y->key) ^ isMin) swap(x, y);\\n x->r = meld(y, x->r);\\n swap(x->l, x->r);\\n return x;\\n }\\n\\n Node *push(Node *t, const T &key, int idx = -1) {\\n return meld(t, alloc(key, idx));\\n }\\n\\n Node *pop(Node *t) {\\n assert(t != nullptr);\\n return meld(t->l, t->r);\\n }\\n\\n Node *add(Node *t, const T &lazy) {\\n if(t) {\\n t->lazy += lazy;\\n propagate(t);\\n }\\n return t;\\n }\\n\\n Node *make_root() {\\n return nullptr;\\n }\\n};\\n\\n\\n/**\\n * @brief Directed-Minimum-Spanning-Tree(最小有向全域木)\\n */\\ntemplate< typename T >\\nstruct MinimumSpanningTree {\\n T cost;\\n Edges< T > edges;\\n};\\n\\ntemplate< typename T >\\nMinimumSpanningTree< T > directed_minimum_spanning_tree(int V, int root, Edges< T > edges) {\\n for(int i = 0; i < V; ++i) {\\n if(i != root) edges.emplace_back(i, root, 0);\\n }\\n\\n int x = 0;\\n vector< int > par(2 * V, -1), vis(par), link(par);\\n\\n using Heap = SkewHeap< T, true >;\\n using Node = typename Heap::Node;\\n\\n Heap heap;\\n vector< Node * > ins(2 * V, heap.make_root());\\n\\n for(int i = 0; i < (int) edges.size(); i++) {\\n auto &e = edges[i];\\n ins[e.to] = heap.push(ins[e.to], e.cost, i);\\n }\\n vector< int > st;\\n auto go = [&](int x) {\\n x = edges[ins[x]->idx].from;\\n while(link[x] != -1) {\\n st.emplace_back(x);\\n x = link[x];\\n }\\n for(auto &p : st) {\\n link[p] = x;\\n }\\n st.clear();\\n return x;\\n };\\n for(int i = V; ins[x]; i++) {\\n for(; vis[x] == -1; x = go(x)) vis[x] = 0;\\n for(; x != i; x = go(x)) {\\n auto w = ins[x]->key;\\n auto v = heap.pop(ins[x]);\\n v = heap.add(v, -w);\\n ins[i] = heap.meld(ins[i], v);\\n par[x] = i;\\n link[x] = i;\\n }\\n for(; ins[x] && go(x) == x; ins[x] = heap.pop(ins[x]));\\n }\\n T cost = 0;\\n Edges< T > ans;\\n for(int i = root; i != -1; i = par[i]) {\\n vis[i] = 1;\\n }\\n for(int i = x; i >= 0; i--) {\\n if(vis[i] == 1) continue;\\n cost += edges[ins[i]->idx].cost;\\n ans.emplace_back(edges[ins[i]->idx]);\\n for(int j = edges[ins[i]->idx].to; j != -1 && vis[j] == 0; j = par[j]) {\\n vis[j] = 1;\\n }\\n }\\n return {cost, ans};\\n}\\n\\nint main() {\\n int N, M; scanf(\\\"%d%d\\\", &N, &M);\\n vector< vector<double> > V(M, vector<double>(N));\\n for(int i=0; i<M; i++) {\\n for(int j=0; j<N; j++) {\\n scanf(\\\"%lf\\\", &V[i][j]);\\n }\\n }\\n\\n auto calc_cost = [&](int x, int y) {\\n double ub = INF, lb = -INF;\\n for(int i=0; i<200; i++) {\\n double m1 = (lb + lb + ub) / 3.0;\\n double m2 = (lb + ub + ub) / 3.0;\\n double f1 = 0.0, f2 = 0.0;\\n for(int i=0; i<N; i++) {\\n f1 += (V[x][i] - m1 * V[y][i]) * (V[x][i] - m1 * V[y][i]);\\n f2 += (V[x][i] - m2 * V[y][i]) * (V[x][i] - m2 * V[y][i]); \\n }\\n if(f1 < f2) ub = m2;\\n else lb = m1;\\n }\\n double m = lb;\\n double f = 0.0;\\n for(int i=0; i<N; i++) {\\n f += (V[x][i] - m * V[y][i]) * (V[x][i] - m * V[y][i]);\\n }\\n return f;\\n };\\n\\n Edges<double> edges;\\n for(int i=0; i<M; i++) {\\n double cost = 0.0;\\n for(int j=0; j<N; j++) {\\n cost += V[i][j] * V[i][j];\\n }\\n edges.emplace_back(M, i, cost);\\n for(int j=0; j<M; j++) {\\n if(i == j) continue;\\n edges.emplace_back(j, i, calc_cost(i, j));\\n }\\n }\\n printf(\\\"%.12f\\\\n\\\", directed_minimum_spanning_tree(M+1, M, edges).cost);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 3948,\n \"score_of_the_acc\": -0.2513,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2309_5368428\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst double INF = 100000;\\nint main(){\\n cout << fixed << setprecision(20);\\n int N, M;\\n cin >> N >> M;\\n vector<vector<double>> A(M, vector<double>(N));\\n for (int i = 0; i < M; i++){\\n for (int j = 0; j < N; j++){\\n cin >> A[i][j];\\n }\\n }\\n vector<vector<pair<double, int>>> E(M + 1);\\n for (int i = 0; i < M; i++){\\n for (int j = 0; j < M; j++){\\n if (i != j){\\n double a = 0, b = 0, c = 0;\\n for (int k = 0; k < N; k++){\\n a += A[i][k] * A[i][k];\\n b -= 2 * A[i][k] * A[j][k];\\n c += A[j][k] * A[j][k];\\n }\\n double d = c - (b * b) / (4 * a);\\n E[i].push_back(make_pair(d, j));\\n }\\n }\\n }\\n for (int i = 0; i < M; i++){\\n double sum = 0;\\n for (int j = 0; j < N; j++){\\n sum += A[i][j] * A[i][j];\\n }\\n E[M].push_back(make_pair(sum, i));\\n }\\n int r = M;\\n double ans = 0;\\n while (true){\\n int V = E.size();\\n vector<double> mn(V, INF);\\n vector<int> p(V);\\n for (int i = 0; i < V; i++){\\n for (auto P : E[i]){\\n double c = P.first;\\n int w = P.second;\\n if (w != r && c < mn[w]){\\n mn[w] = c;\\n p[w] = i;\\n }\\n }\\n }\\n vector<int> d(V, 0);\\n for (int i = 0; i < V; i++){\\n if (i != r){\\n d[p[i]]++;\\n }\\n }\\n queue<int> Q;\\n for (int i = 0; i < V; i++){\\n \\tif (i != r && d[i] == 0){\\n Q.push(i);\\n }\\n }\\n while (!Q.empty()){\\n int v = Q.front();\\n Q.pop();\\n if (v != r){\\n d[p[v]]--;\\n if (d[p[v]] == 0){\\n Q.push(p[v]);\\n }\\n }\\n }\\n vector<int> cycle;\\n vector<int> id(V, -1);\\n for (int i = 0; i < V; i++){\\n if (d[i] == 1){\\n cycle.push_back(i);\\n while (true){\\n int v = cycle.back();\\n ans += mn[v];\\n id[v] = 0;\\n if (p[v] == i){\\n break;\\n }\\n cycle.push_back(p[v]);\\n }\\n break;\\n }\\n }\\n if (cycle.empty()){\\n for (int i = 0; i < V; i++){\\n if (i != r){\\n ans += mn[i];\\n }\\n }\\n break;\\n }\\n int cnt = 1;\\n for (int i = 0; i < V; i++){\\n if (id[i] == -1){\\n id[i] = cnt;\\n cnt++;\\n }\\n }\\n vector<vector<pair<double, int>>> E2(cnt);\\n for (int i = 0; i < V; i++){\\n for (auto P : E[i]){\\n double c = P.first;\\n int w = P.second;\\n if (id[w] == 0){\\n c -= mn[w];\\n }\\n if (id[i] != id[w]){\\n E2[id[i]].push_back(make_pair(c, id[w]));\\n }\\n }\\n }\\n swap(E, E2);\\n r = id[r];\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3500,\n \"score_of_the_acc\": -0.0121,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2309_5294410\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n#define endl \\\"\\\\n\\\"\\nusing namespace std;\\ntemplate<class T>\\ninline bool chmax(T &a, T b) {\\n if(a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\ntemplate<class T>\\ninline bool chmin(T &a, T b) {\\n if(a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nconst long long INF = 1e18;\\n//const ll mod = 1000000007;\\n\\n#define rep(i, a, b) for(int i = a; i < (b); ++i)\\n#define all(x) begin(x), end(x)\\n#define sz(x) (int)(x).size()\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\n\\nstruct RollbackUF {\\n\\tvi e; vector<pii> st;\\n\\tRollbackUF(int n) : e(n, -1) {}\\n\\tint size(int x) { return -e[find(x)]; }\\n\\tint find(int x) { return e[x] < 0 ? x : find(e[x]); }\\n\\tint time() { return sz(st); }\\n\\tvoid rollback(int t) {\\n\\t\\tfor (int i = time(); i --> t;)\\n\\t\\t\\te[st[i].first] = st[i].second;\\n\\t\\tst.resize(t);\\n\\t}\\n\\tbool join(int a, int b) {\\n\\t\\ta = find(a), b = find(b);\\n\\t\\tif (a == b) return false;\\n\\t\\tif (e[a] > e[b]) swap(a, b);\\n\\t\\tst.push_back({a, e[a]});\\n\\t\\tst.push_back({b, e[b]});\\n\\t\\te[a] += e[b]; e[b] = a;\\n\\t\\treturn true;\\n\\t}\\n};\\nstruct Edge { int a, b; double w; };\\nstruct Node { /// lazy skew heap node\\n\\tEdge key;\\n\\tNode *l, *r;\\n\\tdouble delta;\\n\\tvoid prop() {\\n\\t\\tkey.w += delta;\\n\\t\\tif (l) l->delta += delta;\\n\\t\\tif (r) r->delta += delta;\\n\\t\\tdelta = 0;\\n\\t}\\n\\tEdge top() { prop(); return key; }\\n};\\nNode *merge(Node *a, Node *b) {\\n\\tif (!a || !b) return a ?: b;\\n\\ta->prop(), b->prop();\\n\\tif (a->key.w > b->key.w) swap(a, b);\\n\\tswap(a->l, (a->r = merge(b, a->r)));\\n\\treturn a;\\n}\\nvoid pop(Node*& a) { a->prop(); a = merge(a->l, a->r); }\\n\\ndouble dmst(int n, int r, vector<Edge>& g) {\\n\\tRollbackUF uf(n);\\n\\tvector<Node*> heap(n);\\n\\tfor (Edge e : g) heap[e.b] = merge(heap[e.b], new Node{e});\\n\\tdouble res = 0;\\n\\tvi seen(n, -1), path(n), par(n);\\n\\tseen[r] = r;\\n\\tvector<Edge> Q(n), in(n, {-1,-1}), comp;\\n\\tdeque<tuple<int, int, vector<Edge>>> cycs;\\n\\trep(s,0,n) {\\n\\t\\tint u = s, qi = 0, w;\\n\\t\\twhile (seen[u] < 0) {\\n\\t\\t\\tif (!heap[u]) return -1;\\n\\t\\t\\tEdge e = heap[u]->top();\\n\\t\\t\\theap[u]->delta -= e.w, pop(heap[u]);\\n\\t\\t\\tQ[qi] = e, path[qi++] = u, seen[u] = s;\\n\\t\\t\\tres += e.w, u = uf.find(e.a);\\n\\t\\t\\tif (seen[u] == s) { /// found cycle, contract\\n\\t\\t\\t\\tNode* cyc = 0;\\n\\t\\t\\t\\tint end = qi, time = uf.time();\\n\\t\\t\\t\\tdo cyc = merge(cyc, heap[w = path[--qi]]);\\n\\t\\t\\t\\twhile (uf.join(u, w));\\n\\t\\t\\t\\tu = uf.find(u), heap[u] = cyc, seen[u] = -1;\\n\\t\\t\\t\\tcycs.push_front({u, time, {&Q[qi], &Q[end]}});\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i,0,qi) in[uf.find(Q[i].b)] = Q[i];\\n\\t}\\n\\n\\tfor (auto& [u,t,comp] : cycs) { // restore sol (optional)\\n\\t\\tuf.rollback(t);\\n\\t\\tEdge inEdge = in[u];\\n\\t\\tfor (auto& e : comp) in[uf.find(e.b)] = e;\\n\\t\\tin[uf.find(inEdge.b)] = inEdge;\\n\\t}\\n\\trep(i,0,n) par[i] = in[i].a;\\n\\treturn res;\\n}\\n\\ndouble dist[105][105];\\n\\nvector<double> Minus(vector<double> a, vector<double> b) {\\n\\tassert(a.size() == b.size());\\n\\tint n = a.size();\\n\\tvector<double> ret(n);\\n\\tfor(int i = 0; i < n; i++) ret[i] = a[i] - b[i];\\n\\treturn ret;\\n}\\nvector<double> prod(double t, vector<double> v) {\\n\\tfor(auto &tmp : v) tmp *= t;\\n\\treturn v;\\n}\\ndouble norm(vector<double> v) {\\n\\tdouble ret = 0;\\n\\tfor(auto tmp : v) ret += tmp * tmp;\\n\\treturn ret;\\n}\\n\\ndouble f(vector<double> a, vector<double> b) {\\n\\tdouble r = 1e5;\\n\\tdouble l = -1e5;\\n\\tfor(int t = 0; t < 60; t++) {\\n\\t\\tdouble ll = (l * 2 + r) / 3;\\n\\t\\tdouble rr = (l + r * 2) / 3;\\n \\tif(norm(Minus(b, prod(ll, a))) < norm(Minus(b, prod(rr, a)))) {\\n\\t\\t r = rr;\\n \\t} else {\\n\\t\\t l = ll;\\n\\t }\\n\\t}\\n\\treturn norm(Minus(b, prod(l, a)));\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n\\tint N, M;\\n\\tcin >> N >> M;\\n\\tvector<vector<double>> A(M + 1, vector<double>(N));\\n\\tfor(int i = 1; i <= M; i++) {\\n\\t\\tfor(int j = 0; j < N; j++) cin >> A[i][j];\\n\\t}\\n\\tvector<Edge> edges;\\n\\tfor(int i = 0; i <= M; i++) {\\n\\t\\tfor(int j = 0; j <= M; j++) {\\n\\t\\t\\tdist[i][j] = f(A[i], A[j]);\\n\\t\\t\\t//cerr << dist[i][j] << \\\" \\\";\\n\\t\\t}\\n\\t\\t//cerr << endl;\\n\\t\\tfor(int j = 0; j <= M; j++) {\\n\\t\\t\\tif(i == j) continue;\\n\\t\\t\\tedges.push_back({i, j, dist[i][j]});\\n\\t\\t}\\n\\t}\\n\\tdouble ans = dmst(M + 1, 0, edges);\\n\\tcout << fixed << setprecision(30) << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 370,\n \"memory_kb\": 4156,\n \"score_of_the_acc\": -0.4176,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2309_4843795\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<deque>\\n#include<iomanip>\\n#include<tuple>\\n#include<cassert>\\n#include<set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<long double,int> DP;\\ntypedef pair<LL,int> LP;\\nconst long double INF=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\n\\nlong double vec[111][111];\\nvector<vector<long double>> dis;\\n\\nint main(){\\n int n,m;\\n int i,j,k;\\n int a,b,c;\\n long double da,db,dc;\\n cin>>m>>n;\\n dis.assign(n,vector<long double>(n,INF));\\n for(i=0;i<n;i++){\\n for(j=0;j<m;j++){\\n cin>>vec[i][j];\\n }\\n }\\n for(i=0;i<n;i++){\\n for(j=0;j<n;j++){\\n if(i==j)continue;\\n da=0,db=0;\\n for(k=0;k<m;k++){\\n da+=pow(vec[i][k],2),db+=2*vec[i][k]*vec[j][k];\\n }\\n if(da>0)db/=2*da;\\n da=0;\\n for(k=0;k<m;k++){\\n da+=pow(vec[j][k]-vec[i][k]*db,2);\\n }\\n dis[i][j]=da;\\n }\\n }\\n long double ds=INF;\\n for(i=0;i<n;i++){\\n db=0;\\n for(j=0;j<m;j++){\\n db+=pow(vec[i][j],2);\\n }\\n vector<vector<long double>> dis_temp=dis;\\n vector<int> v1,v2,par(n,-1);\\n for(j=0;j<n;j++){\\n if(i!=j)v1.push_back(j);\\n }\\n while(!v1.empty()){\\n a=v1.back(),v1.pop_back();\\n da=INF,b=0;\\n for(j=0;j<n;j++){\\n if(da>dis_temp[j][a]){\\n da=dis_temp[j][a];\\n b=j;\\n }\\n }\\n for(j=0;j<n;j++){\\n if(j==b)dis_temp[j][a]=INF;\\n else dis_temp[j][a]-=da;\\n }\\n db+=da,par[a]=b;\\n v2.clear();\\n c=a;\\n while(c!=-1){\\n v2.push_back(c);\\n c=par[c];\\n if(c==a)break;\\n }\\n if(c==-1)continue;\\n a=v2.size();\\n for(j=0;j<a;j++){\\n for(k=0;k<a;k++){\\n b=v2[j],c=v2[k];\\n dis_temp[b][c]=INF;\\n }\\n }\\n for(j=0;j<n;j++){\\n b=v2[0];\\n for(k=1;k<a;k++){\\n c=v2[k];\\n dis_temp[b][j]=min(dis_temp[b][j],dis_temp[c][j]);\\n dis_temp[j][b]=min(dis_temp[j][b],dis_temp[j][c]);\\n dis_temp[j][c]=INF,dis_temp[c][j]=INF;\\n }\\n }\\n for(j=0;j<a;j++){\\n b=v2[j];\\n par[b]=-1;\\n for(k=0;k<n;k++){\\n if(par[k]==b)par[k]=v2[0];\\n }\\n }\\n v1.push_back(v2[0]);\\n }\\n ds=min(ds,db);\\n }\\n cout<<fixed<<setprecision(15)<<ds<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3604,\n \"score_of_the_acc\": -0.0269,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2309_4843780\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<deque>\\n#include<iomanip>\\n#include<tuple>\\n#include<cassert>\\n#include<set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<long double,int> DP;\\ntypedef pair<LL,int> LP;\\nconst long double INF=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\n\\nlong double vec[111][111];\\nvector<vector<long double>> dis;\\n\\nint main(){\\n int n,m;\\n int i,j,k;\\n int a,b,c;\\n long double da,db,dc;\\n cin>>m>>n;\\n dis.assign(n,vector<long double>(n,INF));\\n for(i=0;i<n;i++){\\n for(j=0;j<m;j++){\\n cin>>vec[i][j];\\n }\\n }\\n for(i=0;i<n;i++){\\n for(j=0;j<n;j++){\\n if(i==j)continue;\\n da=0,db=0;\\n for(k=0;k<m;k++){\\n da+=pow(vec[i][k],2),db+=2*vec[i][k]*vec[j][k];\\n }\\n if(da>0)db/=2*da;\\n da=0;\\n for(k=0;k<m;k++){\\n da+=pow(vec[j][k]-vec[i][k]*db,2);\\n }\\n dis[i][j]=da;\\n }\\n }\\n long double ds=INF;\\n for(i=0;i<n;i++){\\n db=0;\\n for(j=0;j<m;j++){\\n db+=pow(vec[i][j],2);\\n }\\n vector<vector<long double>> dis_temp=dis;\\n vector<int> v1,v2,par(n,-1);\\n \\n for(int pos=0;pos<n;pos++){\\n a=pos;\\n while(a!=i){\\n if(par[a]!=-1)break;\\n da=INF,b=0;\\n for(j=0;j<n;j++){\\n if(da>dis_temp[j][a]){\\n da=dis_temp[j][a];\\n b=j;\\n }\\n }\\n for(j=0;j<n;j++){\\n if(j==b)dis_temp[j][a]=INF;\\n else dis_temp[j][a]-=da;\\n }\\n db+=da,par[a]=b;\\n v2.clear();\\n c=a;\\n while(c!=-1){\\n v2.push_back(c);\\n if(par[c]==a || par[c]<0)break;\\n c=par[c];\\n }\\n if(par[c]<0){\\n a=c;\\n continue;\\n }\\n int sz=v2.size();\\n for(j=0;j<sz;j++){\\n for(k=0;k<sz;k++){\\n b=v2[j],c=v2[k];\\n dis_temp[b][c]=INF;\\n }\\n }\\n for(j=0;j<n;j++){\\n b=v2[0];\\n for(k=1;k<sz;k++){\\n c=v2[k];\\n dis_temp[b][j]=min(dis_temp[b][j],dis_temp[c][j]);\\n dis_temp[j][b]=min(dis_temp[j][b],dis_temp[j][c]);\\n dis_temp[j][c]=INF,dis_temp[c][j]=INF;\\n }\\n }\\n for(j=1;j<sz;j++){\\n b=v2[j];\\n par[b]=-2;\\n for(k=0;k<n;k++){\\n if(par[k]==b)par[k]=a;\\n }\\n }\\n par[a]=-1;\\n }\\n }\\n ds=min(ds,db);\\n }\\n cout<<fixed<<setprecision(15)<<ds<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3592,\n \"score_of_the_acc\": -0.0158,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2309_4837603\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<deque>\\n#include<iomanip>\\n#include<tuple>\\n#include<cassert>\\n#include<set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<long double,int> DP;\\ntypedef pair<LL,int> LP;\\nconst long double INF=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\n\\nlong double vec[111][111];\\nvector<vector<long double>> dis;\\npriority_queue<DP,vector<DP>,greater<DP>> q1;\\n\\nint main(){\\n int n,m;\\n int i,j,k;\\n int a,b,c;\\n long double da,db,dc;\\n cin>>m>>n;\\n dis.assign(n,vector<long double>(n,INF));\\n for(i=0;i<n;i++){\\n for(j=0;j<m;j++){\\n cin>>vec[i][j];\\n }\\n }\\n for(i=0;i<n;i++){\\n for(j=0;j<n;j++){\\n if(i==j)continue;\\n da=0,db=0;\\n for(k=0;k<m;k++){\\n if(vec[i][k]==0)continue;\\n da+=pow(vec[i][k],2),db+=2*vec[i][k]*vec[j][k];\\n }\\n if(da>0)db/=2*da;\\n da=0;\\n for(k=0;k<m;k++){\\n da+=pow(vec[j][k]-vec[i][k]*db,2);\\n }\\n dis[i][j]=da;\\n }\\n }\\n long double ds=INF;\\n for(i=0;i<n;i++){\\n vector<char> used(n);\\n da=0;\\n for(j=0;j<m;j++){\\n da+=pow(vec[i][j],2);\\n }\\n q1.push(make_pair(da,i));\\n db=0;\\n while(!q1.empty()){\\n da=q1.top().first,a=q1.top().second,q1.pop();\\n if(used[a])continue;\\n used[a]=1;\\n db+=da;\\n for(j=0;j<n;j++){\\n if(a==j)continue;\\n q1.push(make_pair(dis[a][j],j));\\n }\\n }\\n ds=min(ds,db);\\n }\\n cout<<fixed<<setprecision(15)<<ds<<endl;\\n}\",\n \"accuracy\": 0.061224489795918366,\n \"time_ms\": 50,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.0537,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2309_4809757\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\n\\nconst int max_n = 1000;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\n\\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}\\nstruct uf {\\nprivate:\\n\\tvector<int> par, ran;\\npublic:\\n\\tuf(int n) {\\n\\t\\tpar.resize(n, 0);\\n\\t\\tran.resize(n, 0);\\n\\t\\trep(i, n) {\\n\\t\\t\\tpar[i] = i;\\n\\t\\t}\\n\\t}\\n\\tint find(int x) {\\n\\t\\tif (par[x] == x)return x;\\n\\t\\telse return par[x] = find(par[x]);\\n\\t}\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x), y = find(y);\\n\\t\\tif (x == y)return;\\n\\t\\tif (ran[x] < ran[y]) {\\n\\t\\t\\tpar[x] = y;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpar[y] = x;\\n\\t\\t\\tif (ran[x] == ran[y])ran[x]++;\\n\\t\\t}\\n\\t}\\n\\tbool same(int x, int y) {\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n};\\n\\nusing tval = ld;\\nstruct edge {\\n\\tint to; tval cost;\\n};\\n\\nvector<P> chu_liu_edmonds(vector<vector<edge>>&G, vector<bool> exi,int root=-1) {\\n\\t//cout << \\\"wow\\\\n\\\";\\n\\tint n = G.size();\\n\\tif (root < 0) {\\n\\t\\troot = n;\\n\\t\\tG.push_back({});\\n\\t\\trep(i, n)G[root].push_back({ i,INF/10000 });\\n\\t\\tn++;\\n\\t\\texi.push_back(true);\\n\\t}\\n\\tvector<vector<edge>> rG(n);\\n\\trep(i, n)if(exi[i])for (edge e : G[i]) {\\n\\t\\trG[e.to].push_back({ i,e.cost });\\n\\t}\\n\\tvector<int> par(n);\\n\\tvector<tval> memo(n);\\n\\trep(i, n)if (exi[i] && i != root) {\\n\\t\\ttval mi = INF;\\n\\t\\tfor (edge e: rG[i]) {\\n\\t\\t\\tif (e.cost < mi) {\\n\\t\\t\\t\\tmi = e.cost;\\n\\t\\t\\t\\tpar[i] = e.to;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//cout << par[i] << \\\" \\\" << i << \\\"\\\\n\\\";\\n\\t\\tmemo[i] = mi;\\n\\t}\\n\\tvector<bool> used(n);\\n\\tvector<bool> cused(n);\\n\\tvector<int> ts;\\n\\tused[root] = true;\\n\\trep(i, n)if (exi[i] && i != root) {\\n\\t\\tif (used[i])continue;\\n\\t\\tvector<int> ids;\\n\\t\\tint cur = i;\\n\\t\\tcused[i] = true;\\n\\t\\tids.push_back(i);\\n\\t\\tbool f = false;\\n\\t\\twhile (true) {\\n\\t\\t\\tcur = par[cur];\\n\\t\\t\\tif (used[cur]) {\\n\\t\\t\\t\\tfor (int id : ids) {\\n\\t\\t\\t\\t\\tcused[id] = false;\\n\\t\\t\\t\\t\\tused[id] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse if (cused[cur]) {\\n\\t\\t\\t\\tf = true;\\n\\t\\t\\t\\trep(j, ids.size())if (ids[j] == cur) {\\n\\t\\t\\t\\t\\tids.erase(ids.begin(), ids.begin() + j);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tcused[cur] = true;\\n\\t\\t\\t\\tids.push_back(cur);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (f) {\\n\\t\\t\\tts = ids; break;\\n\\t\\t}\\n\\t}\\n\\tif (ts.empty()) {\\n\\t\\tvector<P> res; rep(i, n)if (exi[i] && i != root)res.push_back({ par[i],i });\\n\\t\\treturn res;\\n\\t}\\n\\telse {\\n\\t\\tint cr = ts[0];\\n\\t\\tvector<tval> mifr(n, INF), mito(n, INF);\\n\\t\\tvector<int> idfr(n, -1), idto(n, -1);\\n\\t\\t\\n\\t\\tfor (int id : ts) {\\n\\t\\t\\tfor (edge e : G[id]) {\\n\\t\\t\\t\\tif (e.cost < mito[e.to]) {\\n\\t\\t\\t\\t\\tmito[e.to] = e.cost;\\n\\t\\t\\t\\t\\tidto[e.to] = id;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (edge e : rG[id]) {\\n\\t\\t\\t\\tif (e.cost-memo[id] < mifr[e.to]) {\\n\\t\\t\\t\\t\\tmifr[e.to] = e.cost-memo[id];\\n\\t\\t\\t\\t\\tidfr[e.to] = id;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tvector<bool> nexi = exi;\\n\\t\\tfor (int id : ts) {\\n\\t\\t\\tnexi[id] = false;\\n\\t\\t\\tG[id].clear();\\n\\t\\t}\\n\\t\\trep(i, n)if (nexi[i]) {\\n\\t\\t\\tvector<edge> nw;\\n\\t\\t\\tfor (edge e : G[i])if (e.to != cr)nw.push_back(e);\\n\\t\\t\\tswap(nw, G[i]);\\n\\t\\t}\\n\\t\\tnexi[cr] = true;\\n\\t\\trep(i, n)if (i!=cr&&nexi[i]) {\\n\\t\\t\\tif (idfr[i] >= 0) {\\n\\t\\t\\t\\tG[i].push_back({ cr,mifr[i] });\\n\\t\\t\\t}\\n\\t\\t\\tif (idto[i] >= 0) {\\n\\t\\t\\t\\tG[cr].push_back({ i,mito[i] });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<P> np = chu_liu_edmonds(G, nexi, root);\\n\\t\\t//cout << \\\"wow\\\" <<cr<<\\\"\\\\n\\\";\\n\\t\\t//cout << memo[0] << \\\"\\\\n\\\";\\n\\t\\t//cout << mifr[3] << \\\" \\\" << idfr[3] << \\\"\\\\n\\\";\\n\\t\\t/*for (edge e : G[3]) {\\n\\t\\t\\tcout << e.to << \\\" \\\" << e.cost << \\\"\\\\n\\\";\\n\\t\\t}\\n\\t\\trep(i, np.size())cout << np[i].first << \\\" \\\" << np[i].second << \\\"\\\\n\\\";\\n\\t\\t*/\\n\\t\\tint chk = -1;\\n\\t\\trep(i, np.size()) {\\n\\t\\t\\tif (np[i].second == cr) {\\n\\t\\t\\t\\tchk = idfr[np[i].first];\\n\\t\\t\\t\\tnp[i].second = chk;\\n\\t\\t\\t}\\n\\t\\t\\telse if (np[i].first == cr) {\\n\\t\\t\\t\\tnp[i].first = idto[np[i].second];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tts.push_back(ts[0]);\\n\\t\\trep(i, ts.size() - 1) {\\n\\t\\t\\tif (ts[i] != chk) {\\n\\t\\t\\t\\tnp.push_back({ ts[i + 1], ts[i] });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn np;\\n\\t}\\n}\\n\\nld calc(vector<ld> dp, vector<ld> p) {\\n\\tld le = -mod, ri = mod;\\n\\tauto cal = [&](ld t)->ld {\\n\\t\\tld sum = 0;\\n\\t\\trep(i, dp.size()) {\\n\\t\\t\\tld x = p[i] + t * dp[i];\\n\\t\\t\\tsum += x * x;\\n\\t\\t}\\n\\t\\treturn sum;\\n\\t};\\n\\trep(i, 200) {\\n\\t\\tld ml = (le*2 + ri) / 3.0;\\n\\t\\tld mr = (le+ ri * 2) / 3.0;\\n\\t\\tld cl = cal(ml);\\n\\t\\tld cr = cal(mr);\\n\\t\\tif (cl < cr) {\\n\\t\\t\\tri = mr;\\n\\t\\t}\\n\\t\\telse le = ml;\\n\\t}\\n\\tld sum = 0;\\n\\trep(i, p.size())sum += p[i] * p[i];\\n\\tld mem = cal(le);\\n\\tsum -= mem;\\n\\treturn sum;\\n}\\n\\nvoid solve() {\\n\\tint n, m; cin >> m >> n;\\n\\tvector<vector<ld>> vs(n, vector<ld>(m));\\n\\tvector<vector<edge>> G(n);\\n\\trep(i, n)rep(j, m) {\\n\\t\\tcin >> vs[i][j];\\n\\t}\\n\\trep(i, n)Rep(j, i + 1, n) {\\n\\t\\t//cout << i << \\\" \\\" << j << \\\" \\\"<<calc(vs[i], vs[j]) << \\\" \\\" << calc(vs[j], vs[i]) << \\\"\\\\n\\\";\\n\\t\\tG[i].push_back({ j,-calc(vs[i],vs[j]) });\\n\\t\\tG[j].push_back({ i,-calc(vs[j],vs[i]) });\\n\\t}\\n\\tvector<bool> exi(n, true);\\n\\tld ma = INF;\\n\\t\\tvector<vector<edge>> nG = G;\\n\\t\\t//cout << \\\"hello\\\\n\\\";\\n\\t\\tvector<P> res = chu_liu_edmonds(nG, exi);\\n\\t\\tmap<P, bool> mp;\\n\\t\\tfor (P p : res) {\\n\\t\\t\\t//cout << p.first << \\\" \\\" << p.second << \\\"\\\\n\\\";\\n\\t\\t\\tmp[p] = true;\\n\\t\\t}\\n\\t\\tld sum = 0;\\n\\t\\trep(i, n)for (edge e : G[i]) {\\n\\t\\t\\tif (mp[{i,e.to}])sum += e.cost;\\n\\t\\t}ma = min(ma, sum);\\n\\t\\n\\trep(i, n) {\\n\\t\\tld c = 0;\\n\\t\\trep(j, vs[i].size()) {\\n\\t\\t\\tc += vs[i][j] * vs[i][j];\\n\\t\\t}\\n\\t\\tma +=c;\\n\\t}\\n\\tcout << ma << \\\"\\\\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//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 27940,\n \"score_of_the_acc\": -1.4632,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2309_4809599\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\n\\nconst int max_n = 1000;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\n\\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}\\nstruct uf {\\nprivate:\\n\\tvector<int> par, ran;\\npublic:\\n\\tuf(int n) {\\n\\t\\tpar.resize(n, 0);\\n\\t\\tran.resize(n, 0);\\n\\t\\trep(i, n) {\\n\\t\\t\\tpar[i] = i;\\n\\t\\t}\\n\\t}\\n\\tint find(int x) {\\n\\t\\tif (par[x] == x)return x;\\n\\t\\telse return par[x] = find(par[x]);\\n\\t}\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x), y = find(y);\\n\\t\\tif (x == y)return;\\n\\t\\tif (ran[x] < ran[y]) {\\n\\t\\t\\tpar[x] = y;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpar[y] = x;\\n\\t\\t\\tif (ran[x] == ran[y])ran[x]++;\\n\\t\\t}\\n\\t}\\n\\tbool same(int x, int y) {\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n};\\n\\nusing tval = ld;\\nstruct edge {\\n\\tint to; tval cost;\\n};\\n\\nvector<P> chu_liu_edmonds(vector<vector<edge>>&G, vector<bool> exi,int root=-1) {\\n\\t//cout << \\\"wow\\\\n\\\";\\n\\tint n = G.size();\\n\\tif (root < 0) {\\n\\t\\troot = n;\\n\\t\\tG.push_back({});\\n\\t\\trep(i, n)G[root].push_back({ i,INF/10000 });\\n\\t\\tn++;\\n\\t\\texi.push_back(true);\\n\\t}\\n\\tvector<vector<edge>> rG(n);\\n\\trep(i, n)if(exi[i])for (edge e : G[i]) {\\n\\t\\trG[e.to].push_back({ i,e.cost });\\n\\t}\\n\\tvector<int> par(n);\\n\\tvector<tval> memo(n);\\n\\trep(i, n)if (exi[i] && i != root) {\\n\\t\\ttval mi = INF;\\n\\t\\tfor (edge e: rG[i]) {\\n\\t\\t\\tif (e.cost < mi) {\\n\\t\\t\\t\\tmi = e.cost;\\n\\t\\t\\t\\tpar[i] = e.to;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//cout << par[i] << \\\" \\\" << i << \\\"\\\\n\\\";\\n\\t\\tmemo[i] = mi;\\n\\t}\\n\\tvector<bool> used(n);\\n\\tvector<bool> cused(n);\\n\\tvector<int> ts;\\n\\tused[root] = true;\\n\\trep(i, n)if (exi[i] && i != root) {\\n\\t\\tif (used[i])continue;\\n\\t\\tvector<int> ids;\\n\\t\\tint cur = i;\\n\\t\\tcused[i] = true;\\n\\t\\tids.push_back(i);\\n\\t\\tbool f = false;\\n\\t\\twhile (true) {\\n\\t\\t\\tcur = par[cur];\\n\\t\\t\\tif (used[cur]) {\\n\\t\\t\\t\\tfor (int id : ids) {\\n\\t\\t\\t\\t\\tcused[id] = false;\\n\\t\\t\\t\\t\\tused[id] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse if (cused[cur]) {\\n\\t\\t\\t\\tf = true;\\n\\t\\t\\t\\trep(j, ids.size())if (ids[j] == cur) {\\n\\t\\t\\t\\t\\tids.erase(ids.begin(), ids.begin() + j);\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tcused[cur] = true;\\n\\t\\t\\t\\tids.push_back(cur);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (f) {\\n\\t\\t\\tts = ids; break;\\n\\t\\t}\\n\\t}\\n\\tif (ts.empty()) {\\n\\t\\tvector<P> res; rep(i, n)if (exi[i] && i != root)res.push_back({ par[i],i });\\n\\t\\treturn res;\\n\\t}\\n\\telse {\\n\\t\\tint cr = ts[0];\\n\\t\\tvector<tval> mifr(n, INF), mito(n, INF);\\n\\t\\tvector<int> idfr(n, -1), idto(n, -1);\\n\\t\\t\\n\\t\\tfor (int id : ts) {\\n\\t\\t\\tfor (edge e : G[id]) {\\n\\t\\t\\t\\tif (e.cost < mito[e.to]) {\\n\\t\\t\\t\\t\\tmito[e.to] = e.cost;\\n\\t\\t\\t\\t\\tidto[e.to] = id;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (edge e : rG[id]) {\\n\\t\\t\\t\\tif (e.cost-memo[id] < mifr[e.to]) {\\n\\t\\t\\t\\t\\tmifr[e.to] = e.cost-memo[id];\\n\\t\\t\\t\\t\\tidfr[e.to] = id;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tvector<bool> nexi = exi;\\n\\t\\tfor (int id : ts) {\\n\\t\\t\\tnexi[id] = false;\\n\\t\\t\\tG[id].clear();\\n\\t\\t}\\n\\t\\tnexi[cr] = true;\\n\\t\\trep(i, n)if (i!=cr&&nexi[i]) {\\n\\t\\t\\tif (idfr[i] >= 0) {\\n\\t\\t\\t\\tG[i].push_back({ cr,mifr[i] });\\n\\t\\t\\t}\\n\\t\\t\\tif (idto[i] >= 0) {\\n\\t\\t\\t\\tG[cr].push_back({ i,mito[i] });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tvector<P> np = chu_liu_edmonds(G, nexi, root);\\n\\t\\tint chk = -1;\\n\\t\\trep(i, np.size()) {\\n\\t\\t\\tif (np[i].second == cr) {\\n\\t\\t\\t\\tchk = idfr[np[i].first];\\n\\t\\t\\t\\tnp[i].second = chk;\\n\\t\\t\\t}\\n\\t\\t\\telse if (np[i].first == cr) {\\n\\t\\t\\t\\tnp[i].first = idto[np[i].second];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tts.push_back(ts[0]);\\n\\t\\trep(i, ts.size() - 1) {\\n\\t\\t\\tif (ts[i] != chk) {\\n\\t\\t\\t\\tnp.push_back({ ts[i + 1], ts[i] });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn np;\\n\\t}\\n}\\n\\nld calc(vector<ld> dp, vector<ld> p) {\\n\\tld le = -3, ri = 3;\\n\\tauto cal = [&](ld t) {\\n\\t\\tld sum = 0;\\n\\t\\trep(i, dp.size()) {\\n\\t\\t\\tld x = p[i] + t * dp[i];\\n\\t\\t\\tsum += x * x;\\n\\t\\t}\\n\\t\\treturn sqrtl(sum);\\n\\t};\\n\\trep(i, 60) {\\n\\t\\tld ml = (le * 5 + ri * 4) / 9.0;\\n\\t\\tld mr = (le * 4 + ri * 5) / 9.0;\\n\\t\\tld cl = cal(ml);\\n\\t\\tld cr = cal(mr);\\n\\t\\tif (cl < cr) {\\n\\t\\t\\tri = mr;\\n\\t\\t}\\n\\t\\telse le = ml;\\n\\t}\\n\\tld sum = 0;\\n\\trep(i, p.size())sum += p[i] * p[i];\\n\\tld mem = cal(le);\\n\\tsum -= mem * mem;\\n\\treturn sum;\\n}\\n\\nvoid solve() {\\n\\tint n, m; cin >> m >> n;\\n\\tvector<vector<ld>> vs(n, vector<ld>(m));\\n\\tvector<vector<edge>> G(n);\\n\\trep(i, n)rep(j, m) {\\n\\t\\tcin >> vs[i][j];\\n\\t}\\n\\trep(i, n)Rep(j, i + 1, n) {\\n\\t\\t//cout << i << \\\" \\\" << j << \\\" \\\"<<calc(vs[i], vs[j]) << \\\" \\\" << calc(vs[j], vs[i]) << \\\"\\\\n\\\";\\n\\t\\tG[i].push_back({ j,-calc(vs[i],vs[j]) });\\n\\t\\tG[j].push_back({ i,-calc(vs[j],vs[i]) });\\n\\t}\\n\\tvector<bool> exi(n, true);\\n\\tld ma = 0;\\n\\trep(i, n) {\\n\\t\\tvector<vector<edge>> nG = G;\\n\\t\\t//cout << \\\"hello\\\\n\\\";\\n\\t\\tvector<P> res = chu_liu_edmonds(nG, exi,i);\\n\\t\\tmap<P, bool> mp;\\n\\t\\tfor (P p : res) {\\n\\t\\t\\t//cout << p.first << \\\" \\\" << p.second << \\\"\\\\n\\\";\\n\\t\\t\\tmp[p] = true;\\n\\t\\t}\\n\\t\\tld sum = 0;\\n\\t\\trep(i, n)for (edge e : G[i]) {\\n\\t\\t\\tif (mp[{i, e.to}])sum += e.cost;\\n\\t\\t}ma = min(ma, sum);\\n\\t}\\n\\t\\n\\trep(i, n) {\\n\\t\\tld c = 0;\\n\\t\\trep(j, vs[i].size()) {\\n\\t\\t\\tc += vs[i][j] * vs[i][j];\\n\\t\\t}\\n\\t\\tma +=c;\\n\\t}\\n\\tcout << ma << \\\"\\\\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//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.061224489795918366,\n \"time_ms\": 520,\n \"memory_kb\": 15224,\n \"score_of_the_acc\": -1.0229,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2309_4807312\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\n\\nconst int max_n = 1000;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\n\\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}\\nstruct uf {\\nprivate:\\n\\tvector<int> par, ran;\\npublic:\\n\\tuf(int n) {\\n\\t\\tpar.resize(n, 0);\\n\\t\\tran.resize(n, 0);\\n\\t\\trep(i, n) {\\n\\t\\t\\tpar[i] = i;\\n\\t\\t}\\n\\t}\\n\\tint find(int x) {\\n\\t\\tif (par[x] == x)return x;\\n\\t\\telse return par[x] = find(par[x]);\\n\\t}\\n\\tvoid unite(int x, int y) {\\n\\t\\tx = find(x), y = find(y);\\n\\t\\tif (x == y)return;\\n\\t\\tif (ran[x] < ran[y]) {\\n\\t\\t\\tpar[x] = y;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tpar[y] = x;\\n\\t\\t\\tif (ran[x] == ran[y])ran[x]++;\\n\\t\\t}\\n\\t}\\n\\tbool same(int x, int y) {\\n\\t\\treturn find(x) == find(y);\\n\\t}\\n};\\nld calc(vector<ld> dp,vector<ld> p) {\\n\\tld le = -3, ri = 3;\\n\\tauto cal = [&](ld t) {\\n\\t\\tld sum = 0;\\n\\t\\trep(i, dp.size()) {\\n\\t\\t\\tld x = p[i] + t * dp[i];\\n\\t\\t\\tsum += x * x;\\n\\t\\t}\\n\\t\\treturn sqrtl(sum);\\n\\t};\\n\\trep(i, 60) {\\n\\t\\tld ml = (le * 5 + ri * 4) / 9.0;\\n\\t\\tld mr = (le * 4 + ri * 5) / 9.0;\\n\\t\\tld cl = cal(ml);\\n\\t\\tld cr = cal(mr);\\n\\t\\tif (cl < cr) {\\n\\t\\t\\tri = mr;\\n\\t\\t}\\n\\t\\telse le = ml;\\n\\t}\\n\\tld sum = 0;\\n\\trep(i, p.size())sum += p[i] * p[i];\\n\\tld mem = cal(le);\\n\\tsum -= mem * mem;\\n\\treturn sum;\\n}\\nvoid solve() {\\n\\tint n, m; cin >> m >> n;\\n\\tvector<vector<ld>> vs(n,vector<ld>(m));\\n\\trep(i, n)rep(j, m) {\\n\\t\\tcin >> vs[i][j];\\n\\t}\\n\\tvector < pair<ld,P>> v;\\n\\trep(i, n)Rep(j, i + 1, n) {\\n\\t\\tv.push_back({ calc(vs[i],vs[j]),{i,j} });\\n\\t\\tv.push_back({ calc(vs[j],vs[i]),{j,i} });\\n\\t}\\n\\tld ans = 0;\\n\\trep(i, n) {\\n\\t\\tld sum = 0; rep(j, m)sum += vs[i][j] * vs[i][j];\\n\\t\\tans += sum;\\n\\t}\\n\\tsort(all(v), greater<pair<ld, P>>());\\n\\tuf u(n);\\n\\tvector<bool> used(n);\\n\\tint tmp = 0;\\n\\trep(i, v.size()) {\\n\\t\\tint l = v[i].second.first, r = v[i].second.second;\\n\\t\\tif (!u.same(l,r)&&!used[r]) {\\n\\t\\t\\tu.unite(l, r); used[r] = true;\\n\\t\\t\\tans -= v[i].first;\\n\\n\\t\\t\\t//cout << v[i].first << \\\" \\\" << l << \\\" \\\" << r << \\\"\\\\n\\\";\\n\\t\\t}\\n\\t}\\n\\tcout << ans << \\\"\\\\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//expr();\\n\\t//int t; cin >> t; rep(i, t)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.061224489795918366,\n \"time_ms\": 30,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.0324,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2309_3221148\",\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\\n// (重み, u->v)\\nusing Edge = pair<double,pair<int,int>>;\\n\\nconst double INF = 19191919;\\n\\n// 辺集合, 頂点数, 根\\ndouble Chu_Liu_Edmonds(const vector<Edge> es, int V, int root){\\n // 頂点iに入ってくる辺(u->i)の中で、最小のコストの辺を管理 (コスト, u)\\n vector<pair<double,int>> mn(V, {INF,-1});\\n for(Edge e:es){\\n int u = e.se.fi, v = e.se.se;\\n mn[v] = min(mn[v], {e.fi, u});\\n }\\n mn[root] = {0,-1};\\n\\n // 連結成分に分ける(1つの閉路に対して1つの番号を与える)\\n vector<int> cmp(V);\\n // この連結成分が閉路であるか\\n vector<bool> cycle(V,false);\\n int cc = 0;\\n\\n vector<bool> vis(V);\\n rep(i,V){\\n if(vis[i]) continue;\\n\\n vector<int> path;\\n int now = i;\\n\\n while(now!=-1 && !vis[now]){\\n vis[now] = true;\\n path.pb(now);\\n\\n // 今張っている辺を逆方向にたどる\\n now = mn[now].se;\\n }\\n\\n if(now != -1){\\n bool in_cycle = false;\\n for(int j:path){\\n cmp[j] = cc;\\n if(j == now){\\n // 閉路の始点(これ以降のpathに入ってる頂点が閉路をなす)\\n in_cycle = true;\\n cycle[cc] = true;\\n }\\n\\n if(!in_cycle) ++cc;\\n }\\n if(in_cycle) ++cc;\\n }\\n else{\\n // 閉路なし\\n for(int j:path) cmp[j] = cc++;\\n }\\n }\\n\\n if(cc == V){\\n // すべての頂点が違う連結成分に分かれたので 閉路なし\\n double ans = 0;\\n rep(i,V) ans += mn[i].fi;\\n return ans;\\n }\\n\\n // 閉路分のコスト\\n double cycle_cost = 0;\\n rep(i,V){\\n if(i!=root && cycle[cmp[i]]) cycle_cost += mn[i].fi;\\n }\\n\\n // コストを再設定\\n vector<Edge> nes;\\n for(Edge e:es){\\n int u = e.se.fi, v = e.se.se;\\n int cu = cmp[u], cv = cmp[v];\\n\\n if(cu == cv){\\n // 閉路内の辺は無視\\n continue;\\n }\\n else if(cycle[cv]){\\n // コストを再設定\\n nes.pb({e.fi - mn[v].fi, {cu,cv}});\\n }\\n else{\\n nes.pb({e.fi, {cu,cv}});\\n }\\n }\\n\\n return cycle_cost + Chu_Liu_Edmonds(nes, cc, cmp[root]);\\n};\\n\\ndouble size(const vector<double> &v){\\n int n = v.size();\\n double ret = 0;\\n rep(i,n) ret += v[i]*v[i];\\n return ret;\\n}\\n\\nvector<double> getv(const vector<double> &v, const vector<double> &u, double r){\\n int n = v.size();\\n vector<double> ret(n);\\n rep(i,n) ret[i] = v[i]+u[i]*r;\\n return ret;\\n}\\n\\nconst double LIM = 100;\\ndouble calc(const vector<double> &v, const vector<double> &u){\\n int n = v.size();\\n\\n double l=-LIM, r=LIM;\\n rep(loop,60){\\n double m1 = (2*l+r)/3, m2 = (l+2*r)/3;\\n if(size(getv(v,u,m1)) < size(getv(v,u,m2))) r = m2;\\n else l = m1;\\n }\\n\\n return size(getv(v,u,r));\\n}\\n\\nint main(){\\n int n,m;\\n cin >>n >>m;\\n\\n vector<vector<double>> v(m);\\n rep(i,m){\\n vector<double> tmp(n);\\n rep(j,n) cin >>tmp[j];\\n v[i] = tmp;\\n }\\n\\n vector<Edge> Es;\\n rep(i,m)rep(j,m)if(i!=j){\\n Es.pb({calc(v[j],v[i]),{i,j}});\\n // printf(\\\" %d %d -> %f\\\\n\\\",i,j,calc(v[j],v[i]));\\n }\\n\\n double ans = INF;\\n rep(i,m){\\n double res = Chu_Liu_Edmonds(Es,m,i);\\n ans = min(ans, size(v[i])+res);\\n // printf(\\\" %d:: %f\\\\n\\\",i,res);\\n }\\n printf(\\\"%.10f\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 960,\n \"memory_kb\": 23768,\n \"score_of_the_acc\": -1.8314,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2309_3179710\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define re(i,n) for(int i=0;i<n;i++)\\nusing namespace std;\\n\\nstruct UnionFind{\\n int n;\\n vector<int> r,p;\\n UnionFind(){}\\n UnionFind(int sz):n(sz),r(sz,1),p(sz,0){iota(p.begin(),p.end(),0);}\\n int find(int x){\\n return (x==p[x]?x:p[x]=find(p[x]));\\n }\\n bool same(int x,int y){\\n return find(x)==find(y);\\n }\\n void unite(int x,int y){\\n x=find(x);y=find(y);\\n if(x==y) return;\\n r[x]+=r[y];\\n p[y]=x;\\n }\\n};\\n\\ntemplate<typename T, typename E>\\nstruct SkewHeap{\\n using G = function<T(T,E)>;\\n using H = function<E(E,E)>;\\n using C = function<bool(T,T)>;\\n G g;\\n H h;\\n C c;\\n T INF;\\n E ei;\\n SkewHeap(G g,H h,C c,T INF,E ei):g(g),h(h),c(c),INF(INF),ei(ei){}\\n \\n struct Node{\\n Node *l,*r;\\n T val;\\n E add;\\n Node(T val,E add):val(val),add(add){l=r=nullptr;}\\n };\\n\\n void eval(Node *a){\\n if(a==nullptr) return;\\n if(a->add==ei) return;\\n if(a->l) a->l->add=h(a->l->add,a->add);\\n if(a->r) a->r->add=h(a->r->add,a->add);\\n a->val=g(a->val,a->add);\\n a->add=ei;\\n }\\n \\n T top(Node *a){\\n return a!=nullptr?g(a->val,a->add):INF;\\n }\\n\\n T snd(Node *a){\\n eval(a);\\n return a!=nullptr?min(top(a->l),top(a->r)):INF;\\n }\\n\\n Node* add(Node *a,E d){\\n if(a!=nullptr) a->add=h(a->add,d);\\n return a;\\n }\\n \\n Node* push(T v){\\n return new Node(v,ei);\\n }\\n \\n Node* meld(Node *a,Node *b){\\n using V = tuple<Node*, Node*>;\\n stack<V> st;\\n Node* res;\\n ENTRYPOINT:\\n if(!a||!b) res=a?a:b;\\n else{\\n if(c(top(a),top(b))) swap(a,b);\\n eval(a);\\n st.emplace(a,b);\\n a=a->r;\\n goto ENTRYPOINT;\\n RETURNPOINT:\\n tie(a,b)=st.top();st.pop();\\n a->r=res;\\n swap(a->l,a->r);\\n res=a;\\n }\\n if(!st.empty()) goto RETURNPOINT;\\n return res;\\n }\\n \\n Node* pop(Node* a){\\n eval(a);\\n auto res=meld(a->l,a->r);\\n delete a;\\n return res;\\n }\\n \\n};\\n\\n//INSERT ABOVE HERE\\ntemplate<typename T>\\nstruct Arborescence{\\n typedef pair<T, int> P;\\n using Heap = SkewHeap<P, T>;\\n \\n struct edge{\\n int from,to;\\n T cost;\\n edge(){}\\n edge(int from,int to,T cost):from(from),to(to),cost(cost){}\\n };\\n \\n int n;\\n P INF;\\n UnionFind uf;\\n vector<edge> edges;\\n vector<typename Heap::Node*> come;\\n vector<int> used,from;\\n vector<T> cost;\\n \\n Arborescence(int n,T INF):n(n),INF(INF,-1),uf(n),come(n,NULL),\\n used(n,0),from(n,-1),cost(n,-1){};\\n\\n void add_edge(int from,int to,T cost){\\n edges.emplace_back(from,to,cost);\\n }\\n\\n void input(int m,int offset=0){\\n for(int i=0;i<m;i++){\\n int u,v;\\n T c;\\n cin>>u>>v>>c;\\n add_edge(u+offset,v+offset,c);\\n }\\n }\\n\\n T build(int r){\\n typename Heap::G g=[](P a,T b){return P(a.first+b,a.second);};\\n typename Heap::H h=[](T a,T b){return a+b;};\\n typename Heap::C c=[](P a,P b){return a>b;};\\n Heap heap(g,h,c,INF,0);\\n \\n used[r]=2;\\n for(int i=0;i<(int)edges.size();i++){\\n edge &e=edges[i];\\n come[e.to]=heap.meld(come[e.to],heap.push(P(e.cost,i)));\\n }\\n \\n T res=0;\\n for(int i=0;i<n;i++){\\n if(used[i]) continue;\\n int v=i;\\n vector<int> l;\\n while(used[v]!=2){\\n used[v]=1;\\n l.emplace_back(v);\\n if(!come[v]) return T(-1);\\n from[v]=uf.find(edges[come[v]->val.second].from);\\n cost[v]=heap.top(come[v]).first;\\n come[v]=heap.pop(come[v]);\\n if(from[v]==v) continue;\\n \\n res+=cost[v];\\n if(used[from[v]]==1){\\n int p=v;\\n do{\\n if(come[p]!=nullptr) heap.add(come[p],-cost[p]);\\n if(p!=v){\\n uf.unite(v,p);\\n come[v]=heap.meld(come[v],come[p]);\\n }\\n p=uf.find(from[p]);\\n }while(p!=v);\\n }else{\\n v=from[v];\\n }\\n }\\n for(int u:l) used[u]=2;\\n }\\n return res;\\n }\\n};\\n\\nint n,m;\\ndouble v[111][111];\\ndouble cost[111][111];\\nsigned main(){\\n cin>>n>>m;\\n Arborescence<double> G(m+1,1e14);\\n re(i,m)re(j,n)cin>>v[i][j];\\n re(j,n)v[m][j]=0;\\n re(i,m)re(j,m){\\n if(i==j)continue;\\n double L=-1000,R=1000;\\n re(k,50){\\n double mid=(L+R)/2;\\n double s1=0,s2=0;\\n re(l,n)s1+=abs(v[j][l]-mid*v[i][l])*abs(v[j][l]-mid*v[i][l]);\\n re(l,n)s2+=abs(v[j][l]-(mid+1e-6)*v[i][l])*abs(v[j][l]-(mid+1e-6)*v[i][l]);\\n if(s1>s2)L=mid;\\n else R=mid;\\n }\\n double sum=0;\\n re(l,n)sum+=abs(v[j][l]-L*v[i][l])*abs(v[j][l]-L*v[i][l]);\\n G.add_edge(i,j,sum);\\n }\\n re(i,m){\\n double sum=0;\\n re(l,n)sum+=v[i][l]*v[i][l];\\n G.add_edge(m,i,sum);\\n }\\n printf(\\\"%.9f\\\\n\\\", G.build(m));\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3844,\n \"score_of_the_acc\": -0.0997,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2309_2994948\",\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\\n#define double long double\\n\\ndouble size(const vector<double> &v){\\n int n = v.size();\\n double ret = 0;\\n rep(i,n) ret += v[i]*v[i];\\n return ret;\\n}\\n\\nvector<double> getv(const vector<double> &v, const vector<double> &u, double r){\\n int n = v.size();\\n vector<double> ret(n);\\n rep(i,n) ret[i] = v[i]+u[i]*r;\\n return ret;\\n}\\n\\nconst double LIM = 100;\\ndouble calc(const vector<double> &v, const vector<double> &u){\\n int n = v.size();\\n\\n double l=-LIM, r=LIM;\\n rep(loop,40){\\n double m1 = (2*l+r)/3, m2 = (l+2*r)/3;\\n if(size(getv(v,u,m1)) < size(getv(v,u,m2))) r = m2;\\n else l = m1;\\n }\\n\\n return size(getv(v,u,r));\\n}\\n\\nint main(){\\n int n,m;\\n cin >>n >>m;\\n\\n vector<vector<double>> v(m);\\n rep(i,m){\\n vector<double> tmp(n);\\n rep(j,n) cin >>tmp[j];\\n v[i] = tmp;\\n }\\n\\n double ans = 0;\\n\\n using P = pair<double,int>;\\n priority_queue<P, vector<P>, greater<P>> pq;\\n vector<bool> vis(m);\\n rep(i,m) pq.push({size(v[i]),i});\\n while(!pq.empty()){\\n P now = pq.top();\\n pq.pop();\\n int x = now.se;\\n if(vis[x]) continue;\\n\\n vis[x] = true;\\n ans += now.fi;\\n rep(i,m){\\n pq.push({calc(v[i],v[x]),i});\\n }\\n }\\n\\n printf(\\\"%.10Lf\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 0.061224489795918366,\n \"time_ms\": 110,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -0.1127,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2309_2994905\",\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\\n#define double long double\\n\\ndouble size(const vector<double> &v){\\n int n = v.size();\\n double ret = 0;\\n rep(i,n) ret += v[i]*v[i];\\n return ret;\\n}\\n\\nvector<double> getv(const vector<double> &v, const vector<double> &u, double r){\\n int n = v.size();\\n vector<double> ret(n);\\n rep(i,n) ret[i] = v[i]+u[i]*r;\\n return ret;\\n}\\n\\nconst double LIM = 100;\\ndouble calc(const vector<double> &v, const vector<double> &u){\\n int n = v.size();\\n\\n double l=-LIM, r=LIM;\\n rep(loop,40){\\n double m1 = (2*l+r)/3, m2 = (l+2*r)/3;\\n if(size(getv(v,u,m1)) < size(getv(v,u,m2))) r = m2;\\n else l = m1;\\n }\\n\\n return size(getv(v,u,r));\\n}\\n\\nbool comp(const vector<double> &v, const vector<double> &u){\\n return size(v) + min(size(u),calc(u,v)) < size(u) + min(size(v),calc(v,u));\\n}\\n\\nint main(){\\n int n,m;\\n cin >>n >>m;\\n\\n vector<vector<double>> v(m);\\n rep(i,m){\\n vector<double> tmp(n);\\n rep(j,n) cin >>tmp[j];\\n v[i] = tmp;\\n }\\n\\n sort(all(v), comp);\\n\\n double ans = 0;\\n rep(i,m){\\n double add = size(v[i]);\\n rep(j,i) add = min(add, calc(v[i],v[j]));\\n ans += add;\\n }\\n printf(\\\"%.10Lf\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 0.061224489795918366,\n \"time_ms\": 70,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.0632,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2309_2994892\",\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\\ndouble size(const vector<double> &v){\\n int n = v.size();\\n double ret = 0;\\n rep(i,n) ret += v[i]*v[i];\\n return ret;\\n}\\n\\nvector<double> getv(const vector<double> &v, const vector<double> &u, double r){\\n int n = v.size();\\n vector<double> ret(n);\\n rep(i,n) ret[i] = v[i]+u[i]*r;\\n return ret;\\n}\\n\\nconst double LIM = 3;\\ndouble calc(const vector<double> &v, const vector<double> &u){\\n int n = v.size();\\n\\n double l=-LIM, r=LIM;\\n rep(loop,40){\\n double m1 = (2*l+r)/3, m2 = (l+2*r)/3;\\n if(size(getv(v,u,m1)) < size(getv(v,u,m2))) r = m2;\\n else l = m1;\\n }\\n\\n return size(getv(v,u,r));\\n}\\n\\nbool comp(const vector<double> &v, const vector<double> &u){\\n return size(v) + calc(v,u) < size(u) + calc(u,v);\\n}\\n\\nint main(){\\n int n,m;\\n cin >>n >>m;\\n\\n vector<vector<double>> v(m);\\n rep(i,m){\\n vector<double> tmp(n);\\n rep(j,n) cin >>tmp[j];\\n v[i] = tmp;\\n }\\n\\n sort(all(v), comp);\\n\\n double ans = 0;\\n rep(i,m){\\n double add = size(v[i]);\\n rep(j,i) add = min(add, calc(v[i],v[j]));\\n ans += add;\\n }\\n printf(\\\"%.10f\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 0.061224489795918366,\n \"time_ms\": 40,\n \"memory_kb\": 3268,\n \"score_of_the_acc\": -0.0343,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2309_2282933\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\ntypedef double ldouble;\\ntypedef vector<ldouble> Point;\\nldouble INF=1e9;\\n\\nstruct UnionFind{\\n vector<int> par,rank;\\n void init(int n){\\n par.clear();\\n rank.clear();\\n par.resize(n);\\n rank.resize(n);\\n for(int i=0;i<n;i++){\\n par[i]=i;\\n rank[i]=1;\\n }\\n }\\n \\n int find(int x){\\n if(x==par[x])return x;\\n return par[x]=find(par[x]);\\n }\\n\\n bool same(int x,int y){\\n return ( find(x)==find(y) );\\n }\\n \\n void unite(int x,int y){\\n x=find(x);\\n y=find(y);\\n if(x==y)return;\\n if(rank[x]<rank[y])swap(x,y);\\n par[y]=x;\\n rank[x]+=rank[y];\\n }\\n};\\n\\nstruct edge{\\n int from;\\n int to;\\n ldouble cost;\\n int id;\\n edge(int from,int to,ldouble cost,int id) :from(from), to(to),cost(cost),id(id) {}\\n bool operator < (const edge e)const{\\n return cost > e.cost;\\n }\\n};\\n\\ntypedef priority_queue< edge > prque;\\ntypedef prque* Prque;\\n\\ntypedef vector<edge> Node;\\ntypedef vector<Node> Graph;\\n\\n\\nPrque Merge(vector< Prque > &Q, vector<edge> &ev,int A,int C){\\n if( Q[C]->size() < Q[A]->size() ){\\n\\n while( !Q[C]->empty() ){\\n edge e=Q[C]->top();\\n e.cost-=ev[C].cost;\\n e.cost+=ev[A].cost;\\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<' '<<ev[A].cost<<' '<<ev[C].cost<<endl;\\n Q[A]->push(e);\\n Q[C]->pop();\\n }\\n ev[C].cost=ev[A].cost;\\n return Q[A];\\n }else{\\n while( !Q[A]->empty() ){\\n edge e=Q[A]->top();\\n e.cost-=ev[A].cost;\\n e.cost+=ev[C].cost;\\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<endl;\\n Q[C]->push(e);\\n Q[A]->pop();\\n }\\n return Q[C];\\n }\\n}\\n\\nldouble solve(Graph &G,vector<edge> &edges,int root){\\n\\n int n=G.size();\\n ldouble res=0;\\n \\n vector<int> used(n,0);\\n vector< edge > ev(n, (edge){0,0,0,-1} );\\n vector< prque > pool(n);\\n vector< Prque > Q(n);\\n for(int i=0;i<n;i++)Q[i]=&pool[i];\\n \\n UnionFind uf;\\n uf.init(n);\\n \\n for(int i=0;i<(int)edges.size();i++){\\n edge e=edges[i];\\n Q[ e.to ]->push( e );\\n }\\n \\n used[root]=2;\\n for(int Pos=0;Pos<n;Pos++){\\n if(used[Pos]==2)continue;\\n int pos=Pos;\\n vector<int> path;\\n \\n while( used[pos] != 2 ){\\n pos=uf.find(pos);\\n \\n used[pos]=1;\\n path.push_back(pos);\\n if( Q[pos]->empty() ){\\n return INF;\\n }\\n \\n edge e=Q[pos]->top();\\n\\n \\n Q[pos]->pop();\\n e.cost-=ev[pos].cost;\\n if( uf.same(e.from,pos) ) continue;\\n ldouble tmpcost=ev[pos].cost;\\n /*\\n cout<<\\\" pos=\\\"<<pos;\\n cout<<\\\" e.from=\\\"<<e.from;\\n cout<<\\\" e.to=\\\"<<e.to;\\n cout<<\\\" e.cost=\\\"<<e.cost;\\n cout<<\\\" tmpcost=\\\"<<tmpcost<<endl;\\n cout<<endl;\\n */\\n res+=e.cost;\\n e.cost+=tmpcost;\\n ev[pos]=e;\\n if( used[ uf.find(e.from) ] == 2 )break;\\n if( used[ uf.find(e.from) ] == 0 ){\\n pos=e.from;\\n continue;\\n }\\n int pre=uf.find(e.from);\\n for(int i=0;i<100;i++){\\n if(!uf.same(pre,pos)){\\n int A=uf.find(pre), B=uf.find(pos);\\n uf.unite(A,B);\\n int C=uf.find(A);\\n /*\\n cout<<\\\" !!A=\\\"<<A;\\n cout<<\\\" !!B=\\\"<<B;\\n cout<<\\\" !!C=\\\"<<C<<endl;\\n */\\n Prque tmp=NULL;\\n if(B==C)tmp=Merge(Q,ev,A,C);\\n else if(A==C)tmp=Merge(Q,ev,B,C);\\n else assert(0);\\n \\n Q[C]=tmp;\\n }\\n pre=uf.find(ev[pre].from);\\n }\\n }// while_pos\\n\\n for(int i=0;i<(int)path.size();i++)used[ path[i] ]=2;\\n }// Pos\\n return res;\\n}\\n\\n\\nPoint add(Point a,Point b){\\n Point res(a.size());\\n for(int i=0;i<(int)a.size();i++)\\n res[i]=a[i]+b[i];\\n return res;\\n}\\n\\nPoint sub(Point a,Point b){\\n Point res(a.size());\\n for(int i=0;i<(int)a.size();i++)\\n res[i]=a[i]-b[i];\\n return res;\\n}\\n\\nldouble dot(Point a,Point b){\\n ldouble res=0;\\n for(int i=0;i<(int)a.size();i++)\\n res+=a[i]*b[i];\\n return res;\\n}\\n\\nldouble norm(Point p){\\n return dot(p,p);\\n}\\n\\nldouble abs(Point p){\\n return sqrt( norm(p) );\\n}\\n\\ndouble Sqrt(double x){\\n if(x<0)return 0;\\n return sqrt(x);\\n}\\n\\ndouble project(Point a,Point b){\\n ldouble t=dot(a,b);\\n \\n // cout<<a[0]<<' '<<a[1]<<endl;\\n // cout<<b[0]<<' '<<b[1]<<endl;\\n // cout<< dot(a,b) <<endl;\\n return abs( norm(b) - (t*t/norm(a)) );\\n}\\n\\n\\nint main(){\\n int n,m;\\n vector< Point > t;\\n \\n cin>>m>>n;\\n for(int i=0;i<n;i++){\\n Point a(m);\\n for(int j=0;j<m;j++){\\n cin>>a[j];\\n }\\n\\n if(norm(a) < 0.00000001){\\n continue;\\n }\\n t.push_back(a);\\n }\\n n=t.size();\\n Graph G;\\n G.resize(n+1);\\n int cc=0;\\n for(int i=0;i<n;i++){\\n G[n].push_back( edge(n,i,norm(t[i]) , cc++) );\\n for(int j=0;j<n;j++){\\n if(i==j)continue;\\n ldouble cost=project(t[i],t[j]);\\n G[i].push_back( edge(i,j,cost,cc++) );\\n }\\n }\\n\\n vector<edge> edges;\\n for(int i=0;i<=n;i++)\\n for(int j=0;j<(int)G[i].size();j++)\\n edges.push_back(G[i][j]);\\n \\n printf(\\\"%.10f\\\\n\\\",(double) solve(G,edges,n) );\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4420,\n \"score_of_the_acc\": -0.0493,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2309_2282859\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef vector<double> Point;\\n\\ndouble INF=1e9;\\n\\nstruct UnionFind{\\n vector<int> par,rank;\\n void init(int n){\\n par.clear();\\n rank.clear();\\n par.resize(n);\\n rank.resize(n);\\n for(int i=0;i<n;i++){\\n par[i]=i;\\n rank[i]=1;\\n }\\n }\\n \\n int find(int x){\\n if(x==par[x])return x;\\n return par[x]=find(par[x]);\\n }\\n\\n bool same(int x,int y){\\n return ( find(x)==find(y) );\\n }\\n \\n void unite(int x,int y){\\n x=find(x);\\n y=find(y);\\n if(x==y)return;\\n if(rank[x]<rank[y])swap(x,y);\\n par[y]=x;\\n rank[x]+=rank[y];\\n }\\n};\\n\\nstruct edge{\\n int from;\\n int to;\\n double cost;\\n int id;\\n edge(int from,int to,double cost,int id) :from(from), to(to),cost(cost),id(id) {}\\n bool operator < (const edge e)const{\\n return cost > e.cost;\\n }\\n};\\n\\ntypedef priority_queue< edge > prque;\\ntypedef prque* Prque;\\n\\ntypedef vector<edge> Node;\\ntypedef vector<Node> Graph;\\n\\n\\nPrque Merge(vector< Prque > &Q, vector<edge> &ev,int A,int C){\\n if( Q[C]->size() < Q[A]->size() ){\\n\\n while( !Q[C]->empty() ){\\n edge e=Q[C]->top();\\n e.cost-=ev[C].cost;\\n e.cost+=ev[A].cost;\\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<' '<<ev[A].cost<<' '<<ev[C].cost<<endl;\\n Q[A]->push(e);\\n Q[C]->pop();\\n }\\n ev[C].cost=ev[A].cost;\\n return Q[A];\\n }else{\\n while( !Q[A]->empty() ){\\n edge e=Q[A]->top();\\n e.cost-=ev[A].cost;\\n e.cost+=ev[C].cost;\\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<endl;\\n Q[C]->push(e);\\n Q[A]->pop();\\n }\\n return Q[C];\\n }\\n}\\n\\ndouble solve(Graph &G,vector<edge> &edges,int root){\\n\\n int n=G.size();\\n double res=0;\\n \\n vector<int> used(n,0);\\n vector< edge > ev(n, (edge){0,0,0,-1} );\\n vector< prque > pool(n);\\n vector< Prque > Q(n);\\n for(int i=0;i<n;i++)Q[i]=&pool[i];\\n \\n UnionFind uf;\\n uf.init(n);\\n \\n for(int i=0;i<(int)edges.size();i++){\\n edge e=edges[i];\\n Q[ e.to ]->push( e );\\n }\\n \\n used[root]=2;\\n for(int Pos=0;Pos<n;Pos++){\\n if(used[Pos]==2)continue;\\n int pos=Pos;\\n vector<int> path;\\n \\n while( used[pos] != 2 ){\\n pos=uf.find(pos);\\n \\n used[pos]=1;\\n path.push_back(pos);\\n if( Q[pos]->empty() ){\\n return INF;\\n }\\n \\n edge e=Q[pos]->top();\\n\\n \\n Q[pos]->pop();\\n e.cost-=ev[pos].cost;\\n if( uf.same(e.from,pos) ) continue;\\n double tmpcost=ev[pos].cost;\\n /*\\n cout<<\\\" pos=\\\"<<pos;\\n cout<<\\\" e.from=\\\"<<e.from;\\n cout<<\\\" e.to=\\\"<<e.to;\\n cout<<\\\" e.cost=\\\"<<e.cost;\\n cout<<\\\" tmpcost=\\\"<<tmpcost<<endl;\\n cout<<endl;\\n */\\n res+=e.cost;\\n e.cost+=tmpcost;\\n ev[pos]=e;\\n if( used[ uf.find(e.from) ] == 2 )break;\\n if( used[ uf.find(e.from) ] == 0 ){\\n pos=e.from;\\n continue;\\n }\\n int pre=uf.find(e.from);\\n for(int i=0;i<100;i++){\\n if(!uf.same(pre,pos)){\\n int A=uf.find(pre), B=uf.find(pos);\\n uf.unite(A,B);\\n int C=uf.find(A);\\n /*\\n cout<<\\\" !!A=\\\"<<A;\\n cout<<\\\" !!B=\\\"<<B;\\n cout<<\\\" !!C=\\\"<<C<<endl;\\n */\\n Prque tmp=NULL;\\n if(B==C)tmp=Merge(Q,ev,A,C);\\n else if(A==C)tmp=Merge(Q,ev,B,C);\\n else assert(0);\\n \\n Q[C]=tmp;\\n }\\n pre=uf.find(ev[pre].from);\\n }\\n }// while_pos\\n\\n for(int i=0;i<(int)path.size();i++)used[ path[i] ]=2;\\n }// Pos\\n return res;\\n}\\n\\n\\nPoint add(Point a,Point b){\\n Point res(a.size());\\n for(int i=0;i<(int)a.size();i++)\\n res[i]=a[i]+b[i];\\n return res;\\n}\\n\\nPoint sub(Point a,Point b){\\n Point res(a.size());\\n for(int i=0;i<(int)a.size();i++)\\n res[i]=a[i]-b[i];\\n return res;\\n}\\n\\ndouble dot(Point a,Point b){\\n double res=0;\\n for(int i=0;i<(int)a.size();i++)\\n res+=a[i]*b[i];\\n return res;\\n}\\n\\ndouble norm(Point p){\\n return dot(p,p);\\n}\\n\\nPoint project(Point a,Point b,Point p){\\n Point base( a.size() );\\n Point target( a.size() );\\n for(int i=0;i<(int)a.size();i++){\\n base[i]=b[i]-a[i];\\n target[i]=p[i]-a[i];\\n }\\n double t=dot(base,target);\\n Point res=a;\\n for(int i=0;i<(int)a.size();i++)\\n res[i]=res[i]+base[i]*t/norm(base);\\n return res;\\n}\\n\\n\\nint main(){\\n int n,m;\\n vector< Point > t;\\n \\n cin>>m>>n;\\n for(int i=0;i<n;i++){\\n Point a(m);\\n for(int j=0;j<m;j++){\\n cin>>a[j];\\n }\\n t.push_back(a);\\n }\\n\\n Point cen( m , 0 );\\n \\n Graph G;\\n G.resize(n+1);\\n int cc=0;\\n for(int i=0;i<n;i++){\\n G[n].push_back( edge(n,i,norm(t[i]) , cc++) );\\n \\n for(int j=0;j<n;j++){\\n if(i==j)continue;\\n Point pp = project( t[j] , add(t[j],t[i]) , cen);\\n double cost= norm( pp);\\n G[i].push_back( edge(i,j,cost,cc++) );\\n }\\n }\\n\\n vector<edge> edges;\\n for(int i=0;i<=n;i++)\\n for(int j=0;j<(int)G[i].size();j++)\\n edges.push_back(G[i][j]);\\n \\n printf(\\\"%.10f\\\\n\\\", solve(G,edges,n) );\\n \\n return 0;\\n}\",\n \"accuracy\": 0.9183673469387755,\n \"time_ms\": 130,\n \"memory_kb\": 4564,\n \"score_of_the_acc\": -0.1814,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2309_2282824\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef vector<double> Point;\\n\\ndouble INF=1e9;\\n\\nstruct UnionFind{\\n vector<int> par,rank;\\n void init(int n){\\n par.clear();\\n rank.clear();\\n par.resize(n);\\n rank.resize(n);\\n for(int i=0;i<n;i++){\\n par[i]=i;\\n rank[i]=1;\\n }\\n }\\n \\n int find(int x){\\n if(x==par[x])return x;\\n return par[x]=find(par[x]);\\n }\\n\\n bool same(int x,int y){\\n return ( find(x)==find(y) );\\n }\\n \\n void unite(int x,int y){\\n x=find(x);\\n y=find(y);\\n if(x==y)return;\\n if(rank[x]<rank[y])swap(x,y);\\n par[y]=x;\\n rank[x]+=rank[y];\\n }\\n};\\n\\nstruct edge{\\n int from;\\n int to;\\n double cost;\\n int id;\\n edge(int from,int to,double cost,int id) :from(from), to(to),cost(cost),id(id) {}\\n bool operator < (const edge e)const{\\n return cost > e.cost;\\n }\\n};\\n\\ntypedef priority_queue< edge > prque;\\ntypedef prque* Prque;\\n\\ntypedef vector<edge> Node;\\ntypedef vector<Node> Graph;\\n\\n\\nPrque Merge(vector< Prque > &Q, vector<edge> &ev,int A,int C){\\n if( Q[C]->size() < Q[A]->size() ){\\n\\n while( !Q[C]->empty() ){\\n edge e=Q[C]->top();\\n e.cost-=ev[C].cost;\\n e.cost+=ev[A].cost;\\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<' '<<ev[A].cost<<' '<<ev[C].cost<<endl;\\n Q[A]->push(e);\\n Q[C]->pop();\\n }\\n ev[C].cost=ev[A].cost;\\n return Q[A];\\n }else{\\n while( !Q[A]->empty() ){\\n edge e=Q[A]->top();\\n e.cost-=ev[A].cost;\\n e.cost+=ev[C].cost;\\n // cout<<e.from<<' '<<e.to<<' '<<e.cost<<endl;\\n Q[C]->push(e);\\n Q[A]->pop();\\n }\\n return Q[C];\\n }\\n}\\n\\ndouble solve(Graph &G,vector<edge> &edges,int root){\\n\\n int n=G.size();\\n double res=0;\\n \\n vector<int> used(n,0);\\n vector< edge > ev(n, (edge){0,0,0,-1} );\\n vector< prque > pool(n);\\n vector< Prque > Q(n);\\n for(int i=0;i<n;i++)Q[i]=&pool[i];\\n \\n UnionFind uf;\\n uf.init(n);\\n \\n for(int i=0;i<(int)edges.size();i++){\\n edge e=edges[i];\\n Q[ e.to ]->push( e );\\n }\\n \\n used[root]=2;\\n for(int Pos=0;Pos<n;Pos++){\\n if(used[Pos]==2)continue;\\n int pos=Pos;\\n vector<int> path;\\n \\n while( used[pos] != 2 ){\\n pos=uf.find(pos);\\n \\n used[pos]=1;\\n path.push_back(pos);\\n if( Q[pos]->empty() ){\\n return INF;\\n }\\n \\n edge e=Q[pos]->top();\\n\\n \\n Q[pos]->pop();\\n e.cost-=ev[pos].cost;\\n if( uf.same(e.from,pos) ) continue;\\n int tmpcost=ev[pos].cost;\\n /*\\n cout<<\\\" pos=\\\"<<pos;\\n cout<<\\\" e.from=\\\"<<e.from;\\n cout<<\\\" e.to=\\\"<<e.to;\\n cout<<\\\" e.cost=\\\"<<e.cost;\\n cout<<\\\" tmpcost=\\\"<<tmpcost<<endl;\\n cout<<endl;\\n */\\n res+=e.cost;\\n e.cost+=tmpcost;\\n ev[pos]=e;\\n if( used[ uf.find(e.from) ] == 2 )break;\\n if( used[ uf.find(e.from) ] == 0 ){\\n pos=e.from;\\n continue;\\n }\\n int pre=uf.find(e.from);\\n for(int i=0;i<100;i++){\\n if(!uf.same(pre,pos)){\\n int A=uf.find(pre), B=uf.find(pos);\\n uf.unite(A,B);\\n int C=uf.find(A);\\n /*\\n cout<<\\\" !!A=\\\"<<A;\\n cout<<\\\" !!B=\\\"<<B;\\n cout<<\\\" !!C=\\\"<<C<<endl;\\n */\\n Prque tmp=NULL;\\n if(B==C)tmp=Merge(Q,ev,A,C);\\n else if(A==C)tmp=Merge(Q,ev,B,C);\\n else assert(0);\\n \\n Q[C]=tmp;\\n }\\n pre=uf.find(ev[pre].from);\\n }\\n }// while_pos\\n\\n for(int i=0;i<(int)path.size();i++)used[ path[i] ]=2;\\n }// Pos\\n return res;\\n}\\n\\n\\nPoint add(Point a,Point b){\\n Point res(a.size());\\n for(int i=0;i<(int)a.size();i++)\\n res[i]=a[i]+b[i];\\n return res;\\n}\\n\\nPoint sub(Point a,Point b){\\n Point res(a.size());\\n for(int i=0;i<(int)a.size();i++)\\n res[i]=a[i]-b[i];\\n return res;\\n}\\n\\ndouble dot(Point a,Point b){\\n double res=0;\\n for(int i=0;i<(int)a.size();i++)\\n res+=a[i]*b[i];\\n return res;\\n}\\n\\ndouble norm(Point p){\\n return dot(p,p);\\n}\\n\\nPoint project(Point a,Point b,Point p){\\n Point base( a.size() );\\n Point target( a.size() );\\n for(int i=0;i<(int)a.size();i++){\\n base[i]=b[i]-a[i];\\n target[i]=p[i]-a[i];\\n }\\n double t=dot(base,target);\\n Point res=a;\\n for(int i=0;i<(int)a.size();i++)\\n res[i]=res[i]+base[i]*t/norm(base);\\n return res;\\n}\\n\\n\\nint main(){\\n int n,m;\\n vector< Point > t;\\n \\n cin>>m>>n;\\n for(int i=0;i<n;i++){\\n Point a(m);\\n for(int j=0;j<m;j++){\\n cin>>a[j];\\n }\\n t.push_back(a);\\n }\\n\\n Point cen( m , 0 );\\n \\n Graph G;\\n G.resize(n+1);\\n int cc=0;\\n for(int i=0;i<n;i++){\\n G[n].push_back( edge(n,i, (norm(t[i])) , cc++) );\\n \\n \\n for(int j=0;j<n;j++){\\n if(i==j)continue;\\n \\n Point pp = project( t[j] , add(t[j],t[i]) , cen);\\n double cost= norm( pp);\\n G[i].push_back( edge(i,j,cost,cc++) );\\n\\n // cout<<i<<' '<<j<<' '<< cost << ' ' <<pp[0]<<' '<<pp[1]<<endl;\\n }\\n }\\n\\n vector<edge> edges;\\n for(int i=0;i<=n;i++)\\n for(int j=0;j<(int)G[i].size();j++)\\n edges.push_back(G[i][j]);\\n \\n printf(\\\"%.10f\\\\n\\\", solve(G,edges,n) );\\n \\n return 0;\\n}\",\n \"accuracy\": 0.061224489795918366,\n \"time_ms\": 30,\n \"memory_kb\": 4144,\n \"score_of_the_acc\": -0.0592,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2309_2185204\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<queue>\\n#include<stack>\\n#include<vector>\\nusing namespace std;\\n\\n\\nstruct edge\\n{\\n int begin;int end;\\t\\n};\\n\\nconst int maxx=120;\\nbool vis[maxx],indfs[maxx];\\nvector<double>zero;\\nint n,m,root;\\nvector<vector<double> >vec;\\ndouble cost[maxx][maxx],Cost[maxx][maxx];\\nbool operator <(const edge a,const edge b)\\n{\\n double ac=cost[a.begin][a.end];double bc=cost[b.begin][b.end];\\n return ac>bc;//´?????´?????\\t\\n};\\npriority_queue<edge>que[maxx];\\ndouble minv(vector<double> a,vector<double> b)\\n{\\n double ab=0,bsqrt=0,asqrt=0;\\n for(int i=0;i<a.size();i++)\\n \\t{ab+=a[i]*b[i];bsqrt+=b[i]*b[i];asqrt+=a[i]*a[i];}\\n \\t\\n if((bsqrt-0.0)<1e-10)return asqrt;\\n return asqrt-(ab*ab/bsqrt);\\n}\\nint belongcircle[maxx];\\nint findbelong(int x)\\n{\\n if(x==belongcircle[x])return x;\\n \\telse return belongcircle[x]=findbelong(belongcircle[x]);\\n}\\n\\ndouble ans,ansnow;\\ndouble min(double a,double b)\\n{\\n if(a<b)return a;\\n \\telse return b;\\n}\\nvoid combinecircle(int now,int begin)\\n{\\n now=findbelong(now);\\n if(vis[now])return ;\\n vis[now]=true;\\n edge e1=que[now].top();\\n double coste=cost[findbelong(e1.begin)][findbelong(e1.end)];\\n ansnow+=coste;\\n bool finish[maxx];\\n memset(finish,0,sizeof(finish));\\n for(int i=0;i<=m;i++)\\n \\t{\\n \\t int po=findbelong(i);\\n \\t if(po==now||po==begin)continue;\\n \\t if(finish[po])continue;\\n \\t finish[po]=true;\\n \\t cost[begin][po]=min(cost[begin][po],cost[now][po]-coste);\\n \\t cost[po][begin]=min(cost[po][begin],cost[po][now]);\\n\\t}\\n belongcircle[now]=begin;\\n combinecircle(e1.end,begin);\\n return ;\\n}\\nvoid build();\\nbool findcircle(int now)\\n{\\n if(now==root)return false; \\n now=findbelong(now);\\n if(indfs[now])\\n \\t{\\n \\t memset(vis,0,sizeof(vis));\\n \\t combinecircle(now,now);\\n \\t build();\\n \\t return true;\\n\\t}\\n indfs[now]=true;\\n return findcircle(que[now].top().end);\\n}\\n\\nvoid build()\\n{\\n bool finish[maxx];\\n memset(finish,0,sizeof(finish));\\n for(int i=0;i<m;i++)\\n \\t{\\n \\t int po=findbelong(i);\\n \\t if(finish[po])continue;\\n \\t finish[po]=true;\\n \\t while(!que[po].empty())que[po].pop();\\n \\t for(int j=0;j<=m;j++)\\n \\t \\t{\\n \\t \\t int pb=findbelong(j);\\n \\t \\t if(po==pb)continue;\\n \\t \\t edge en;en.begin=po;en.end=pb;\\n \\t \\t que[po].push(en);\\n\\t\\t}\\n\\t}\\n return ;\\n}\\nbool counted[maxx];\\nint main()\\n{\\n ios::sync_with_stdio(false);\\n cin>>n>>m;\\n for(int i=0;i<n;i++)\\n zero.push_back(0.0);\\n for(int i=0;i<m;i++)\\n \\t{\\n\\t vector<double>nowv;\\n\\t for(int j=0;j<n;j++)\\n\\t \\t{ double nv;cin>>nv;nowv.push_back(nv);}\\n\\t vec.push_back(nowv);\\n\\t}\\n vec.push_back(zero);\\n for(int i=0;i<=m;i++)\\n \\tfor(int j=0;j<=m;j++)\\n \\t\\t{ cost[i][j]=minv(vec[i],vec[j]);}\\n root=m;\\n ansnow=0;\\n belongcircle[root]=root;\\n \\t for(int i=0;i<m;i++)\\n \\t \\t{\\n \\t \\t belongcircle[i]=i;\\n \\t \\t}\\n\\t bool exis=false;\\n\\t \\t do\\n\\t \\t \\t{\\n\\t \\t \\t build();\\n\\t \\t \\t exis=false;\\n\\t \\t \\t bool finish[maxx];\\n\\t \\t \\t memset(finish,0,sizeof(finish));\\n\\t \\t \\t for(int i=0;i<m;i++)\\n\\t \\t \\t { \\n\\t\\t\\t int po=findbelong(i);\\n\\t\\t\\t if(finish[po])continue;\\n\\t \\t \\t memset(indfs,0,sizeof(indfs));\\n\\t \\t \\t exis=findcircle(po);\\n\\t \\t \\t finish[po]=true;\\n\\t\\t\\t }\\n\\t\\t\\t}while(exis);\\n\\t memset(counted,0,sizeof(counted));\\n\\t for(int i=0;i<m;i++)\\n\\t \\t{\\n\\t\\t int po=findbelong(i);\\n\\t\\t if(counted[po])continue;\\n\\t\\t counted[po]=true;\\n\\t\\t ansnow+=cost[findbelong(que[po].top().begin)][findbelong(que[po].top().end)];\\t\\n\\t\\t}\\n printf(\\\"%.8f\\\\n\\\",ansnow);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": -0.0252,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2309_2185197\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n#include<queue>\\n#include<stack>\\n#include<vector>\\nusing namespace std;\\n\\n\\nstruct edge\\n{\\n int begin;int end;\\t\\n};\\n\\nconst int maxx=120;\\nbool vis[maxx],indfs[maxx];\\nvector<double>zero;\\nint n,m,root;\\nvector<vector<double> >vec;\\ndouble cost[maxx][maxx],Cost[maxx][maxx];\\nbool operator <(const edge a,const edge b)\\n{\\n double ac=cost[a.begin][a.end];double bc=cost[b.begin][b.end];\\n return ac>bc;//´?????´?????\\t\\n};\\npriority_queue<edge>que[maxx];\\ndouble minv(vector<double> a,vector<double> b)\\n{\\n double ab=0,bsqrt=0,asqrt=0;\\n for(int i=0;i<a.size();i++)\\n \\t{ab+=a[i]*b[i];bsqrt+=b[i]*b[i];asqrt+=a[i]*a[i];}\\n \\t\\n if((bsqrt-0.0)<1e-10)return asqrt;\\n return asqrt-(ab*ab/bsqrt);\\n}\\nint belongcircle[maxx];\\nint findbelong(int x)\\n{\\n if(x==belongcircle[x])return x;\\n \\telse return belongcircle[x]=findbelong(belongcircle[x]);\\n}\\n\\ndouble ans,ansnow;\\ndouble min(double a,double b)\\n{\\n if(a<b)return a;\\n \\telse return b;\\n}\\nvoid combinecircle(int now,int begin)\\n{\\n now=findbelong(now);\\n if(vis[now])return ;\\n vis[now]=true;\\n edge e1=que[now].top();\\n double coste=cost[findbelong(e1.begin)][findbelong(e1.end)];\\n ansnow+=coste;\\n bool finish[maxx];\\n memset(finish,0,sizeof(finish));\\n for(int i=0;i<=m;i++)\\n \\t{\\n \\t int po=findbelong(i);\\n \\t if(po==now||po==begin)continue;\\n \\t if(finish[po])continue;\\n \\t finish[po]=true;\\n \\t cost[begin][po]=min(cost[begin][po],cost[now][po]-coste);\\n \\t cost[po][begin]=min(cost[po][begin],cost[po][now]);\\n\\t}\\n belongcircle[now]=begin;\\n combinecircle(e1.end,begin);\\n}\\n\\nbool findcircle(int now)\\n{\\n if(now==root)return false; \\n now=findbelong(now);\\n if(indfs[now])\\n \\t{\\n \\t memset(vis,0,sizeof(vis));\\n \\t combinecircle(now,now);\\n \\t return true;\\n\\t}\\n indfs[now]=true;\\n return findcircle(que[now].top().end);\\n}\\n\\nvoid build()\\n{\\n bool finish[maxx];\\n memset(finish,0,sizeof(finish));\\n for(int i=0;i<m;i++)\\n \\t{\\n \\t int po=findbelong(i);\\n \\t if(finish[po])continue;\\n \\t finish[po]=true;\\n \\t while(!que[po].empty())que[po].pop();\\n \\t for(int j=0;j<=m;j++)\\n \\t \\t{\\n \\t \\t int pb=findbelong(j);\\n \\t \\t if(po==pb)continue;\\n \\t \\t edge en;en.begin=po;en.end=pb;\\n \\t \\t que[po].push(en);\\n\\t\\t}\\n\\t}\\n return ;\\n}\\nbool counted[maxx];\\nint main()\\n{\\n cin>>n>>m;\\n for(int i=0;i<n;i++)\\n zero.push_back(0.0);\\n for(int i=0;i<m;i++)\\n \\t{\\n\\t vector<double>nowv;\\n\\t for(int j=0;j<n;j++)\\n\\t \\t{ double nv;cin>>nv;nowv.push_back(nv);}\\n\\t vec.push_back(nowv);\\n\\t}\\n vec.push_back(zero);\\n for(int i=0;i<=m;i++)\\n \\tfor(int j=0;j<=m;j++)\\n \\t\\t{ cost[i][j]=minv(vec[i],vec[j]);}\\n root=m;\\n ansnow=0;\\n belongcircle[root]=root;\\n \\t for(int i=0;i<m;i++)\\n \\t \\t{\\n \\t \\t belongcircle[i]=i;\\n \\t \\t}\\n\\t bool exis=false;\\n\\t \\t do\\n\\t \\t \\t{\\n\\t \\t \\t build();\\n\\t \\t \\t exis=false;\\n\\t \\t \\t bool finish[maxx];\\n\\t \\t \\t memset(finish,0,sizeof(finish));\\n\\t \\t \\t for(int i=0;i<m;i++)\\n\\t \\t \\t { \\n\\t\\t\\t int po=findbelong(i);\\n\\t\\t\\t if(finish[po])continue;\\n\\t \\t \\t memset(indfs,0,sizeof(indfs));\\n\\t \\t \\t exis=findcircle(po);\\n\\t \\t \\t finish[po]=true;\\n\\t \\t \\t if(exis){break;}\\n\\t\\t\\t }\\n\\t\\t\\t}while(exis);\\n\\t memset(counted,0,sizeof(counted));\\n\\t for(int i=0;i<m;i++)\\n\\t \\t{\\n\\t\\t int po=findbelong(i);\\n\\t\\t if(counted[po])continue;\\n\\t\\t counted[po]=true;\\n\\t\\t ansnow+=cost[findbelong(que[po].top().begin)][findbelong(que[po].top().end)];\\t\\n\\t\\t}\\n cout<<ansnow<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.061224489795918366,\n \"time_ms\": 10,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.007,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":1292,"cells":{"group_id":{"kind":"string","value":"aoj_2310_cpp"},"problem_description":{"kind":"string","value":"〜魔女からこの世界を守るため\nキュゥべえ\nと共に戦う 5 人の魔法少女達の物語〜\n問題 A\n問題文\n薔薇園の魔女 GERTRUD は幅\nW\nメートル，高さ\nH\nメートルの長方形の庭でバラを育てている．庭は一辺\n1\nメートルの正方形で区切られており，\nW\\times H\nのブロックに分けられている．各ブロックはバラが育てられているか育てられていないかのどちらかである．\nただ驚くべきことに，この庭で育てられているバラはブロックを越えて絡み合い\n1\nつの生命体となっている．この生命体は辺を共有しているブロック間を越えて絡み合うことができ，どこかある\n1\n点を共有していれば同じ生命体となる．\n巴マミ\nは庭の左下の角から直線に必殺技「ティロ・フィナーレ」で巨大な銃を撃ち，その弾丸が通る直線上でその生命体を分割した時，生命体が出来る限り多くの分割数に分断されるようにすることによりダメージを与えたい．ティロ・フィナーレは最大でこの生物を何分割できるか求めよ．\n入力形式\n入力は以下の形式で与えられる．\nH\\ W\\\\\nf_{11} f_{12} ... f_{1W}\\\\\nf_{21} f_{22} ... f_{2W}\\\\\n...\\\\\nf_{H1} f_{H2} ... f_{HW}\\\\\nH\nは庭の高さ，\nW\nは庭の幅を表す．\nf_{ij}\nは庭の各ブロックを表す文字であり，上から\ni\n行目，左から\nj\n列目のブロックの状態を表す．ブロックにバラが育てられている場合は\nf_{ij}\nは\n'#'\nとなり，そうでない場合は\n'.'\nとなる．\n出力形式\n生命体を直線で分割する時に，最大でいくつの部分に分割できるかを1行で出力せよ．\n制約\n1 ≤ H ≤ 600\n1 ≤ W ≤ 600\nf_{ij}\nは\n'#'\n,\n'.'\nのいずれかである．\n少なくとも\n1\nつは\nf_{ij} =\n'#'\nとなるマス\nf_{ij}\nが存在する．\n2\nつのブロックが辺を共有するとき，それらは\n隣接している\nと呼ぶことにする．任意の\n2\nつの異なる\n'#'\nのブロック\nf_A, f_B\nに対して，\nf_A\nから隣接している\n'#'\nのブロックを辿っていって\nf_B\nに着くことができる．(すなわち，薔薇のブロックは連結である．)\n入力中で\n1\n行目の行，\nH\n行目の行，\n1\n列目の列，または\nW\n列目の列にあるブロックを\n盤面の端のブロック\nと呼ぶことにする．任意の\n'.'\nのブロック\nf_C\nに対して，\nf_C\nから隣接している\n'.'\nのブロックを辿っていって，ある\n'.'\nの盤面の端のブロックに着くことができる．(すなわち，入力に\"空洞\"のブロックは存在しない．)\n入出力例\n入力例 1\n3 5\n##..#\n#..##\n####.\n出力例1\n4\nこのとき以下のように\n4\nつの部分に分割することができる．\n入力例 2\n3 3\n#.#\n###\n#.#\n出力例 2\n3\n入力例 3\n10 9\n.........\n.........\n####.....\n#..#.##..\n#..#..#..\n#..##.###\n#..##...#\n##..##.##\n###.#..#.\n###.####.\n出力例 3\n6\n入力例 4\n10 11\n###########\n#.#.#.#.#.#\n#.#.#.#.#.#\n#.#.#.#.#.#\n#.#.#.#.#.#\n#.#.#.#.#.#\n#.#.#.#.#.#\n#.#.#.#.#.#\n#.#.#.#.#.#\n#.#.#.#.#.#\n出力例 4\n7\n入力例 5\n25 38\n...........#...............#..........\n...........###..........####..........\n...........#####.......####...........\n............###############...........\n............###############...........\n............##############............\n.............#############............\n............###############...........\n...........#################..........\n.......#...#################...#......\n.......##.##################..##......\n........####################.##.......\n..........####################........\n.........#####..########..#####.......\n.......######....#####....######......\n......########...#####..########.#....\n....#######..#...#####..#..########...\n..#########.....#######......#######..\n...#######......#######........###....\n..####.........#########........###...\n...............#########..............\n..............##########..............\n..............##########..............\n...............########...............\n...............########...............\n出力例 5\n8\nProblem Setter: Flat35"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2310_10851592","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \"(\" << o.first << \",\" << o.second << \")\"; return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \" \";} return out; }\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \"{ \"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \":\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \", \"; } out << \" }\"; return out; }\n\n/*\n <url:>\n 問題文============================================================\n =================================================================\n 解説=============================================================\n ================================================================\n */\n\nconst double eps = 1e-9;\nll solve(){\n ll H,W; cin >> H >> W;\n ll res = 1;\n vector<vector<char>> masu(H+2,vector<char>(W+2,'.'));\n vector<pair<double,int>> event;\n for(int i = 1; i <= H;i++){\n for(int j = 1; j <= W;j++){\n cin >> masu[i][j];\n }\n }\n \n vector<vector<pii>> masu2(H+2,vector<pii>(W+2));\n for(int i = 1; i <= H;i++){\n for(int j = 1; j <= W;j++){\n masu2[i][j] = {j-1,H-i};\n }\n }\n //cout << masu << endl;\n //cout << masu2 << endl;\n for(int i = 1; i <= H;i++){\n for(int j = 1; j <= W;j++){\n if(masu[i][j] == '#'){\n \n double angle = 0;\n // increment pattern\n // ..\n // .#\n if(masu[i-1][j-1] == '.' && masu[i-1][j] == '.' && masu[i][j-1] == '.'){\n angle = atan2(masu2[i][j].second+1,masu2[i][j].first);\n event.push_back({angle,-1});\n }\n \n // increment pattern\n // ##\n // #.\n if(masu[i+1][j+1] == '.' && masu[i+1][j] == '#' && masu[i][j+1] == '#'){\n angle = atan2(masu2[i][j].second,masu2[i][j].first+1);\n event.push_back({angle,-1});\n }\n \n // decrement pattern\n // .#\n // ##\n if(masu[i-1][j-1] == '.' && masu[i-1][j] == '#' && masu[i][j-1] == '#'){\n angle = atan2(masu2[i][j].second+1,masu2[i][j].first);\n event.push_back({angle,1});\n }\n \n // decrement pattern\n // #.\n // ..\n if(masu[i+1][j+1] == '.' && masu[i+1][j] == '.' && masu[i][j+1] == '.'){\n angle = atan2(masu2[i][j].second,masu2[i][j].first+1);\n event.push_back({angle,1});\n }\n }\n }\n }\n \n sort(event.begin(),event.end());\n \n ll cnt = 1;\n for(auto it = event.rbegin(); it != event.rend(); it++){\n auto e = *it;\n //cout << -e.second << endl;\n cnt -= e.second;\n res = max(res,cnt);\n }\n return res;\n}\nint main(void) {\n cin.tie(0); ios_base::sync_with_stdio(false);\n cout << solve() << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":8728,"score_of_the_acc":-0.2291,"final_rank":13},{"submission_id":"aoj_2310_10408241","code_snippet":"#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n#include <tuple>\n// #include \"Src/Number/IntegerDivision.hpp\"\n// #include \"Src/Utility/BinarySearch.hpp\"\n// #include \"Src/Sequence/CompressedSequence.hpp\"\n// #include \"Src/Sequence/RunLengthEncoding.hpp\"\n// #include \"Src/Algebra/Group/AdditiveGroup.hpp\"\n// #include \"Src/DataStructure/FenwickTree/FenwickTree.hpp\"\n// using namespace zawa;\n// #include \"atcoder/modint\"\n// using mint = atcoder::modint998244353;\nint H, W;\nstd::string S[610];\nbool in(int x, int y) {\n return 0 <= x and x < H and 0 <= y and y < W;\n}\nbool block(int x, int y) {\n return in(x, y) and S[x][y] == '#';\n}\nbool blank(int x, int y) {\n return !block(x, y);\n}\nusing item = std::pair<std::pair<int, int>, int>;\nint norm(std::pair<int, int> p) {\n return p.first * p.first + p.second * p.second;\n}\nint cross(std::pair<int, int> l, std::pair<int, int> r) {\n return l.first * r.second - l.second * r.first; \n}\nbool argcomp(std::pair<int, int> l, std::pair<int, int> r) {\n const int c = cross(l, r);\n if (c) return c > 0;\n else return norm(l) < norm(r);\n}\nbool comp(item l, item r) {\n return argcomp(l.first, r.first);\n}\nint main() {\n std::cin.tie(nullptr);\n std::cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n std::cin >> H >> W;\n for (int i = 0 ; i < H ; i++) {\n std::cin >> S[i];\n }\n std::vector<item> P;\n for (int x = H - 1 ; x >= 0 ; x--) for (int y = 0 ; y < W ; y++) if (block(x, y)) {\n if (blank(x+1,y) and blank(x+1,y+1) and blank(x,y+1)) {\n P.push_back(std::make_pair(\n // std::make_pair(H-(x+1),y+1),1\n std::make_pair(y+1,H-(x+1)),1\n ));\n }\n if (blank(x-1,y) and blank(x-1,y-1) and blank(x,y-1)) {\n P.push_back(std::make_pair(\n // std::make_pair(H-x,y),-1\n std::make_pair(y,H-x),-1\n ));\n }\n if (blank(x-1,y) and blank(x-1,y+1) and blank(x,y+1)) {\n P.push_back(std::make_pair(\n // std::make_pair(H-x,y+1),0\n std::make_pair(y+1,H-x),0\n ));\n }\n if (blank(x+1,y) and blank(x+1,y-1) and blank(x,y-1)) {\n P.push_back(std::make_pair(\n // std::make_pair(H-(x+1),y),0\n std::make_pair(y,H-(x+1)),0\n ));\n }\n if (block(x-1,y) and blank(x-1,y+1) and block(x,y+1)) {\n P.push_back(std::make_pair(\n std::make_pair(y+1,H-x),0\n ));\n }\n if (block(x-1,y) and blank(x-1,y-1) and block(x,y-1)) {\n P.push_back(std::make_pair(\n std::make_pair(y,H-x),1\n ));\n }\n if (block(x+1,y) and blank(x+1,y+1) and block(x,y+1)) {\n P.push_back(std::make_pair(\n std::make_pair(y+1,H-x-1),-1\n ));\n }\n if (block(x+1,y) and blank(x+1,y-1) and block(x,y-1)) {\n P.push_back(std::make_pair(\n std::make_pair(y+1,H-x-1),0\n ));\n }\n }\n std::sort(P.begin(), P.end(), comp);\n // for (int k = 0 ; k < (int)P.size() ; k++) std::cout << P[k].first.first << ',' << P[k].first.second << \" : \" << P[k].second << '\\n';\n // std::cout.flush();\n int ans = 1, res = 1;\n for (int i = P[0].first == std::make_pair(0, 0), j = i ; i < (int)P.size() ; i = j) {\n while (j < (int)P.size() and cross(P[i].first, P[j].first) == 0) ans += P[j++].second;\n // for (int k = i ; k < j ; k++) std::cout << P[k].first.first << ',' << P[k].first.second << \" : \" << P[k].second << '\\n';\n // std::cout << \"----------------\" << std::endl;\n res = std::max(res, ans);\n }\n std::cout << res << '\\n';\n}","accuracy":1,"time_ms":10,"memory_kb":8048,"score_of_the_acc":-0.1865,"final_rank":10},{"submission_id":"aoj_2310_9999943","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\nstruct node {\n int x, y, val;\n};\nint cross(int x1, int y1, int x2, int y2) {\n return x1 * y2 - x2 * y1;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h, w;\n cin >> h >> w;\n vector<string> s(h);\n rep(i, h) cin >> s[i];\n reverse(all(s));\n vector<node> v;\n rep(i, h) rep(j, w) {\n if(s[i][j] == '#') {\n if(i == h - 1 or s[i + 1][j] == '.') {\n v.push_back(node{j + 1, i + 1, 1});\n v.push_back(node{j, i + 1, -1});\n } \n if(j == w - 1 or s[i][j + 1] == '.') {\n v.push_back(node{j + 1, i, 1});\n v.push_back(node{j + 1, i + 1, -1});\n }\n }\n } \n sort(all(v), [&](node a, node b) {\n return cross(a.x, a.y, b.x, b.y) > 0;\n });\n int ans = 0, sum = 0;\n int sz = v.size();\n rep(i, sz) {\n sum += v[i].val;\n while(i + 1 < sz and cross(v[i].x, v[i].y, v[i + 1].x, v[i + 1].y) == 0) {\n i ++;\n sum += v[i].val;\n }\n ans = max(ans, sum);\n }\n cout << ans + 1 << endl;\n \n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":10336,"score_of_the_acc":-0.3643,"final_rank":16},{"submission_id":"aoj_2310_9629481","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n int h, w;\n cin >> h >> w;\n vector<string> v(h);\n for (auto &i : v)\n cin >> i;\n reverse(v.begin(), v.end());\n v.push_back(string(w, '.'));\n for (auto &i : v)\n i += '.';\n map<long double, int> x;\n for (int i = 0; i <= h; i++) {\n for (int j = 0; j <= w; j++) {\n if (i && v[i - 1][j] != v[i][j]) {\n x[(long double) i / (j + 1)]++;\n x[(long double) i / j]--;\n }\n if (j && v[i][j] != v[i][j - 1]) {\n x[(long double) (i + 1) / j]--;\n x[(long double) i / j]++;\n }\n }\n }\n int cnt = 0;\n if (v[0][0] == '#')\n cnt = 1;\n int ans = cnt;\n for (auto [_, t] : x) {\n cnt += t;\n ans = max(ans, cnt);\n }\n cout << ans / 2 + 1 << '\\n';\n}","accuracy":1,"time_ms":110,"memory_kb":21032,"score_of_the_acc":-1.3448,"final_rank":18},{"submission_id":"aoj_2310_9563250","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, M;\n cin >> M >> N;\n vector<vector<char>> C(N, vector<char>(M));\n rrep(j,0,M) {\n rep(i,0,N) cin >> C[i][j];\n }\n rep(i,0,N) C[i].push_back('.');\n C.push_back(vector<char>(M+1,'.'));\n int COUNT = 1;\n rep(i,0,N) {\n if (C[i][0] == '#' && C[i+1][0] == '.') COUNT++;\n }\n vector<pair<pair<int,int>,int>> V;\n rep(i,1,N+1) {\n rep(j,1,M+1) {\n char a = C[i-1][j-1], b = C[i][j-1], c = C[i-1][j], d = C[i][j];\n if (a == b && a != c && a == d) V.push_back({{i,j},1});\n if (a != b && a == c && a == d) V.push_back({{i,j},-1});\n }\n }\n sort(V.begin(), V.end(), [](pair<pair<int,int>,int> P1, pair<pair<int,int>,int> P2) {\n if (P1.first.first * P2.first.second == P1.first.second * P2.first.first) return P1.second < P2.second;\n return P1.first.second * P2.first.first < P1.first.first * P2.first.second;\n });\n int ANS = COUNT;\n for (pair<pair<int,int>,int> P : V) {\n COUNT += P.second;\n chmax(ANS,COUNT);\n }\n cout << ANS << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":5584,"score_of_the_acc":-0.0321,"final_rank":3},{"submission_id":"aoj_2310_7219709","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;}\n//vector<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}\ntemplate<typename T> vector<T> inv_perm(const vector<T>&ord){\n vector<T>inv(ord.size());\n for(int i=0;i<ord.size();i++)inv[ord[i]] = i;\n return inv;\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\ntemplate <typename F>\nclass\n#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\n [[nodiscard]]\n#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\nFixPoint final : private F\n{\npublic:\n template <typename G>\n explicit constexpr FixPoint(G&& g) noexcept\n : F{std::forward<G>(g)}\n {}\n\n template <typename... Args>\n constexpr decltype(auto)\n operator()(Args&&... args) const\n#if !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\n noexcept(noexcept(F::operator()(std::declval<FixPoint>(), std::declval<Args>()...)))\n#endif // !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\n {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n}; // class FixPoint\n\n\n#if defined(__cpp_deduction_guides)\ntemplate <typename F>\nFixPoint(F&&)\n-> FixPoint<std::decay_t<F>>;\n#endif // defined(__cpp_deduction_guides)\n\n\nnamespace\n{\n template <typename F>\n#if !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\n # if defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\n __attribute__((warn_unused_result))\n# elif defined(_MSC_VER) && _MSC_VER >= 1700 && defined(_Check_return_)\n _Check_return_\n# endif // defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\n#endif // !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\n inline constexpr decltype(auto)\n makeFixPoint(F&& f) noexcept\n {\n return FixPoint<std::decay_t<F>>{std::forward<std::decay_t<F>>(f)};\n }\n} // namespace\n\nusing Real = long double;\nusing Point = complex<Real>;\nconst Real EPS = 1e-10, PI = acos((Real)(-1.0));\n\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\ninline bool eq(Point a, Point 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\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\nnamespace std {\n bool operator<(const Point& a, const Point& b) {\n return !eq(a.real(), b.real()) ? a.real() < b.real() : a.imag() < b.imag();\n }\n}\n\nstruct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b): a(a), b(b) {}\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\nstruct Circle {\n Point c;\n Real r;\n Circle() = default;\n Circle(Point c, Real r): c(c), r(r) {}\n\n friend ostream &operator<<(ostream &os, Circle &c) {\n return os << c.c << \": \" << c.r;\n }\n\n friend istream &operator>>(istream &is, Circle &c) {\n return is >> c.c >> c.r;\n }\n};\n\nReal cross(const Point &a, const Point &b) {\n return real(a) * imag(b) - real(b) * imag(a);\n}\n\nReal dot(const Point &a, const Point &b) {\n return real(a) * real(b) + imag(a) * imag(b);\n}\n\nstruct Segment : Line {\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\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\n if (cross(b, c) < -EPS) return -1; // CLOCKWISE\n if (dot(b, c) < 0) return +2; // ONLINE_BACK\n if (norm(b) < norm(c)) return -2; // ONLINE_FRONT\n return 0; // ON_SEGMENT\n}\n\nbool intersect(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == 0;\n}\n\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\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\nint intersect(const Circle &c, const Circle &d) {\n Real dis = fabs(c.c - d.c);\n\n if (dis > c.r + d.r + EPS) return 4;\n else if (eq(dis, c.r + d.r)) return 3;\n else if (eq(dis, abs(c.r - d.r))) return 1;\n else if (dis + min(c.r, d.r) < max(c.r, d.r) - EPS) return 0;\n else return 2;\n}\n\nbool parallel(const Line &a, const Line &b) {\n return abs(cross(a.b - a.a, b.b - b.a)) < EPS;\n}\n\nbool orthogonal(const Line &a, const Line &b) {\n return abs(dot(a.b - a.a, b.b - b.a)) < EPS;\n}\n\nPoint projection(const Line& s, const Point &p) {\n double 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\nPoint projection(const Segment& l, const Point &p) {\n return projection(Line(l), p);\n}\n\nPoint reflection(const Line &l, const Point &p) {\n Point r = projection(l, p);\n return p + (r - p) * 2;\n}\n\nReal distance(const Line &l, const Point &p) {\n Point r = projection(l, p);\n return fabs(p - r);\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\nReal distance(const Segment& a, const Segment& b) {\n if (intersect(a, b)) return 0;\n return min({\n distance(a, b.a),\n distance(a, b.b),\n distance(b, a.a),\n distance(b, a.b)\n });\n}\n\nbool contains(const Circle &c, const Point &p) {\n if (fabs(c.c - p) < c.r + EPS) return true;\n return false;\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\nPoint crosspoint(const Segment& l, const Segment& m) {\n return crosspoint(Line(l), Line(m));\n}\n\nLine bisector_of_angle(const Point& a, const Point& b, const Point& c) {\n Real d_ab = fabs(a - b);\n Real d_bc = fabs(b - c);\n Point c_ = b + (c - b) * d_ab / d_bc;\n\n return Line(b, (a + c_) * 0.5);\n}\n\nLine bisector(const Point& a, const Point& b) {\n Point c = (a + b) * 0.5;\n Point d = c + rotate(PI / 2, b - c);\n\n return Line(c, d);\n}\n\nint intersect(const Circle &c, const Line &l) {\n Real d = distance(l, c.c);\n\n if (d > c.r + EPS) return 0;\n if (eq(d, c.r)) return 1;\n return 2;\n}\n\npair<Point, Point> crosspoint(const Circle& c, const Line& l) {\n Real d = distance(l, c.c);\n\n Point p = projection(l, c.c);\n if (intersect(c, l) == 1) return { p, p };\n\n Real d2 = sqrt(c.r * c.r - d * d);\n Point v = (l.a - l.b) * (1.0 / fabs(l.a - l.b));\n\n return { p + d2 * v, p - d2 * v };\n}\n\nvector<Point> crosspoint(const Circle &c, const Segment &s) {\n int isect = intersect(c, Line(s));\n if (isect == 0) return {};\n\n auto [p1, p2] = crosspoint(c, Line(s));\n\n vector<Point> res;\n if (ccw(s.a, s.b, p1) == 0) res.push_back(p1);\n if (ccw(s.a, s.b, p2) == 0) res.push_back(p2);\n\n if (res.size() == 2 && ccw(s.a, p1, p2) == 0) swap(res[0], res[1]);\n return res;\n}\n\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n Real d = fabs(c1.c - c2.c);\n Real x1 = (c1.r * c1.r + d * d - c2.r * c2.r) / 2 / d;\n Real y = sqrt(c1.r * c1.r - x1 * x1);\n\n Point base = (c2.c * x1 + c1.c * (d - x1)) * (1.0 / d);\n Point v = rotate(PI / 2, c1.c - base);\n v = v / fabs(v);\n\n return { base + v * y, base - v * y };\n}\n\npair<Point, Point> tangent(const Circle &c, const Point &p) {\n Real d = fabs(c.c - p);\n Real d2 = sqrt(d * d - c.r * c.r);\n Real a = acos(d2 / d);\n\n\n Point q = c.c - p;\n q = q / fabs(q);\n\n// cout << d << \" \" << d2 << \" \" << a << \" \" << q << endl;\n return {\n p + rotate(a, q) * d2,\n p + rotate(-a, q) * d2\n };\n}\n\nvector<Segment> common_tangent(Circle c1, Circle c2) {\n int isect = intersect(c1, c2);\n Real d = fabs(c1.c - c2.c);\n Point v = (c2.c - c1.c) / d;\n\n vector<Segment> res;\n\n if (isect == 0) {\n return {};\n } else if (isect == 1) {\n auto [p1, p2] = crosspoint(c1, Line(c1.c, c2.c));\n if (eq(fabs(p2 - c2.c), c2.r)) swap(p1, p2);\n\n Point v = p1 + rotate(PI/2, c2.c - p1);\n return { Segment(p1, v) };\n } else if (isect == 2) {\n } else if (isect == 3) {\n auto [p1, p2] = crosspoint(c1, c2);\n res.emplace_back(p1, rotate(PI / 2, c1.c - p1) + p1);\n } else {\n Real a = d * c1.r / (c1.r + c2.r);\n Point p = c1.c + v * a;\n\n Real d1 = sqrt(a * a - c1.r * c1.r), d2 = sqrt(norm(p - c2.c) - c2.r * c2.r);\n Real theta = acos(d1 / a);\n\n// cout << d << endl;\n// cout << a << \" \" << d1 << \" \" << d2 << \" \" << theta << \": \" << p << endl;\n\n Point e = (c1.c - p) * (1.0 / fabs(c1.c - p));\n Point e1 = rotate(theta, e), e2 = rotate(-theta, e);\n\n res.emplace_back(p + e1 * d1, p - e1 * d2);\n res.emplace_back(p + e2 * d1, p - e2 * d2);\n }\n\n if (eq(c1.r, c2.r)) {\n Point e = rotate(PI / 2, v);\n res.push_back(Segment(c1.c + e * c1.r, c2.c + e * c1.r));\n res.push_back(Segment(c1.c - e * c1.r, c2.c - e * c1.r));\n return res;\n }\n\n if (c1.r > c2.r) swap(c1, c2);\n\n v = c1.c - c2.c;\n Point p = v * (1.0 / (c2.r - c1.r)) * c2.r + c2.c;\n\n auto [q1, q2] = tangent(c1, p);\n res.emplace_back(q1, crosspoint(c2, Line(p, q1)).first);\n res.emplace_back(q2, crosspoint(c2, Line(p, q2)).first);\n\n return res;\n}\n\nusing Polygon = vector<Point>;\n\nistream& operator>>(istream& is, Polygon &p) {\n for (int i = 0; i < p.size(); i++) is >> p[i];\n return is;\n}\n\nostream& operator<<(ostream& os, Polygon &p) {\n for (int i = 0; i < p.size(); i++) os << p[i];\n return os;\n}\n\nReal area(const Polygon& p) {\n Real res = 0;\n for (int i = 0; i < p.size(); i++) {\n res += cross(p[i], p[(i + 1) % p.size()]);\n }\n return abs(res)/2;\n}\n\nReal arcarea(const Circle &c, const Point &p1_, const Point &p2_) {\n Point p1 = p1_ - c.c, p2 = p2_ - c.c;\n Real a2 = atan2(imag(p2), real(p2));\n Point p = rotate(-a2, p1);\n Real a1 = atan2(imag(p), real(p));\n// cout << p1 << \" \" << p2 << \" --- \" << a2 << \" \" << a1 << endl;\n return - a1 / 2 * c.r * c.r;\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 Point a=g[i]-p,b=g[(i+1)%n]-p;\n if(fabs(cross(a,b)) < EPS and dot(a,b) < EPS) return 1;\n if(a.imag()>b.imag()) swap(a,b);\n if(a.imag() < EPS and EPS < b.imag() and cross(a,b) > EPS ) {\n// cout << a << \" --- \" << b << \": \" << cross(a, b) << endl;\n x = !x;\n }\n }\n return (x?2:0);\n}\n\nPolygon convex_hull(Polygon Q) {\n sort(ALL(Q));\n\n Polygon upper({Q[0]}), lower({Q[0]});\n\n rep(i, 1, Q.size()) {\n while (upper.size() >= 2) {\n int _ccw = ccw(upper[upper.size() - 2], upper[upper.size() - 1], Q[i]);\n if (_ccw == 1) {\n upper.pop_back();\n } else {\n break;\n }\n }\n if (upper.size() <= 1) {\n upper.push_back(Q[i]);\n } else if (upper.size() > 1) {\n int _ccw = ccw(upper[upper.size() - 2], upper[upper.size() - 1], Q[i]);\n if (_ccw == -1 || _ccw == -2) {\n upper.push_back(Q[i]);\n }\n }\n }\n rep(i, 1, Q.size()) {\n while (lower.size() >= 2) {\n int _ccw = ccw(lower[lower.size() - 2], lower[lower.size() - 1], Q[i]);\n if (_ccw == -1) {\n lower.pop_back();\n } else {\n break;\n }\n }\n\n if (lower.size() <= 1) {\n lower.push_back(Q[i]);\n } else if (lower.size() > 1) {\n int _ccw = ccw(lower[lower.size() - 2], lower[lower.size() - 1], Q[i]);\n if (_ccw == 1 || _ccw == -2) {\n lower.push_back(Q[i]);\n }\n }\n }\n\n Polygon ret;\n\n rep(i, 0, lower.size()) {\n ret.push_back(lower[i]);\n// cout << lower[i] << endl;\n }\n\n// cout << \" | \" << endl;\n\n rrep(i, 0, upper.size()) {\n if (!eq(lower[0], upper[i]) && !eq(lower.back(), upper[i]))\n ret.push_back(upper[i]);\n// cout << upper[i] << endl;\n }\n\n int start = 0;\n\n// cout << ret.size() << endl;\n rep(i, 0, ret.size()) {\n if (ret[i].imag() < ret[start].imag() || (eq(ret[i].imag(), ret[start].imag()) && ret[i].real() < ret[start].real())) {\n start = i;\n }\n }\n\n cout << ret.size() << endl;\n rep(i, 0, ret.size()) {\n auto p = ret[(i + start) % ret.size()];\n cout << (int)p.real() << \" \" << (int)p.imag() << endl;\n }\n\n return ret;\n}\n\nReal closest_pair(vector<Point> &pts, int l, int r) {\n int m = (l + r) / 2;\n if (r - l <= 1) {\n return INF;\n } else if (r - l == 2) {\n if (imag(pts[l]) > imag(pts[l + 1])) swap(pts[l], pts[l + 1]);\n return fabs(pts[l] - pts[l + 1]);\n }\n\n Real mid = pts[m].real();\n Real d = min(closest_pair(pts, l, m), closest_pair(pts, m, r));\n\n inplace_merge(pts.begin() + l, pts.begin() + m, pts.begin() + r, [](const Point &a, const Point& b) {\n return a.imag() < b.imag();\n });\n\n vector<Point> ret;\n\n for (int i = l; i < r; i++) {\n if (fabs(pts[i].real() - mid) >= d) continue;\n\n for (int j = ret.size() - 1; j >= 0; j--) {\n if (fabs(imag(ret[j]) - imag(pts[i])) >= d) break;\n chmin(d, fabs(ret[j] - pts[i]));\n }\n\n ret.emplace_back(pts[i]);\n }\n\n return d;\n}\n\nint main() {\n cout << fixed << setprecision(10);\n\n int H, W;\n cin >> H >> W;\n vector<string> s(H);\n\n rep(i, 0, H) cin >> s[i];\n\n ll res = 1;\n ll cnt = 1;\n\n vector<P> pts;\n rep(i, 0, H + 1) {\n rep(j, 0, W + 1) {\n if (i == 0 && j == 0) continue;\n pts.emplace_back(i, j);\n }\n }\n\n auto same = [](P a, P b) {\n return a.fi * b.se - b.fi * a.se == 0;\n };\n\n auto cmp = [](const P &a, const P &b) {\n return a.fi * b.se - b.fi * a.se > 0;\n };\n\n sort(ALL(pts), cmp);\n\n auto in = [&](int y, int x) {\n return 0 <= y && y < H && 0 <= x && x < W;\n };\n\n auto tp = [&](int y, int x) {\n string t(\"....\");\n y = H - y;\n if (in(y - 1, x - 1) && s[y - 1][x - 1] == '#') t[0] = '#';\n if (in(y - 1, x) && s[y - 1][x] == '#') t[1] = '#';\n if (in(y, x - 1) && s[y][x - 1] == '#') t[2] = '#';\n if (in(y, x) && s[y][x] == '#') t[3] = '#';\n// cout << y << \" \" << x << \": \" << t << endl;\n\n if (t == \"...#\" || t == \"###.\") return 1;\n if (t == \"#...\" || t == \".###\") return -1;\n return 0;\n };\n\n rep(i, 0, pts.size()) {\n cnt += tp(pts[i].fi, pts[i].se);\n\n while (i < pts.size() && same(pts[i], pts[i+1])) {\n i++;\n cnt += tp(pts[i].fi, pts[i].se);\n }\n// cout << cnt << endl;\n chmax(res, cnt);\n }\n\n cout << res << endl;\n}","accuracy":1,"time_ms":30,"memory_kb":13768,"score_of_the_acc":-0.6138,"final_rank":17},{"submission_id":"aoj_2310_6984595","code_snippet":"#include <bits/stdc++.h>\n#include <complex>\n#include <random>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\nusing vvvvvll = vector<vvvvll>;\nusing vvvvvvll = vector<vvvvvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vvvvb = vector<vvvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\nusing vvvvd = vector<vvvd>;\nusing vvvvvd = vector<vvvvd>;\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#define tN(t) (t==1?XN:YN)\n#define tS(t) (t==1?XS:YS)\n#define tA(t) (t==1?XA:YA)\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}\nll sqrtz(ll N) {\n ll L = 0;\n ll R = sqrt(N) + 10000;\n while (abs(R - L) > 1) {\n ll mid = (R + L) / 2;\n if (mid * mid <= N)L = mid;\n else R = mid;\n }\n return L;\n\n}\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 (n < k) return 0;\n return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;\n}\n\n\n\nll modPow(ll a, ll n, ll p) {\n ll res = 1;\n ll k = a;\n while (n > 0) {\n if (n % 2 == 1) {\n res *= k;\n if (res > p)res %= p;\n }\n k = k * k;\n if (k > p)k %= p;\n n /= 2;\n }\n return res;\n}\n\nstruct quot {\n ll de, nu;//de分母\n quot() = default;\n quot(ll nu, ll de) :de(de), nu(nu) { init(*this); }\n quot(ll z) :de(1), nu(z) { init(*this); }\n void init(quot& a) {\n if (a.nu == 0) {\n a.de = 1;\n }\n else {\n ll g = GcD(a.de, a.nu);\n a.de /= g;\n a.nu /= g;\n if (a.de < 0) {\n a.de *= -1;\n a.nu *= -1;\n }\n }\n }\n ll GcD(ll(a), ll(b)) {\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\n quot operator *(const quot& p) {\n quot res;\n res.de = this->de * p.de;\n res.nu = this->nu * p.nu;\n init(res);\n return res;\n };\n quot operator +(const quot& p) {\n quot res;\n res.de = this->de * p.de;\n res.nu = this->nu * p.de + this->de * p.nu;\n init(res);\n return res;\n };\n\n quot operator-()const {\n quot res;\n res.de = this->de;\n res.nu = -this->nu;\n return res;\n };\n quot operator -(const quot& p) {\n return *this + (-p);\n };\n quot inv(quot q) {\n quot res;\n res.de = q.nu;\n res.nu = q.de;\n return res;\n }\n quot operator/(const quot& q) {\n return *this * inv(q);\n }\n\n bool operator==(const quot& q) {\n return (this->de == q.de && this->nu == q.nu);\n }\n\n bool operator<(const quot& q)const {\n return (this->nu * q.de - this->de * q.nu < 0);\n }\n bool operator>(const quot& q) {\n return !(*this == q || *this < q);\n }\n\n double tod(const quot& q) {\n return (double(nu) / double(de));\n }\n\n void print() {\n cout << nu << \" \" << de << endl;\n }\n\n void printd() {\n cout << tod(*this) << endl;\n }\n};\n\n\n\n\n\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll H, W,an=0,m=1;\n cin >> H >> W;\n map<quot, ll> M;\n vector<string> S(H + 2, \"\");\n rep(w, W + 2)S[0].push_back('.'), S[H + 1].push_back('.');\n rep(h, H) {\n cin >> S[h+1];\n S[h+1] = '.' + S[h+1] + '.';\n }\n rep(h, H + 1)rep(w, W + 1) {\n ll cnt = 0;\n rep(dh, 2)rep(dw, 2)cnt += (S[h + dh][w + dw] == '#');\n if (cnt == 1) {\n if (S[h][w] == '#')M[quot(H - h, w)]++;\n else if (S[h + 1][w + 1] == '#')M[quot(H - h, w)]--;\n }\n if (cnt == 3) {\n if (S[h][w] == '.')M[quot(H - h, w)]++;\n else if (S[h + 1][w + 1] == '.')M[quot(H - h, w)]--;\n }\n }\n for (auto p : M) {\n m += p.second;\n chmax(an, m);\n }\n cout << an << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":8116,"score_of_the_acc":-0.2252,"final_rank":12},{"submission_id":"aoj_2310_6984578","code_snippet":"#include <bits/stdc++.h>\n#include <complex>\n#include <random>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\nusing vvvvvll = vector<vvvvll>;\nusing vvvvvvll = vector<vvvvvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vvvvb = vector<vvvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\nusing vvvvd = vector<vvvd>;\nusing vvvvvd = vector<vvvvd>;\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#define tN(t) (t==1?XN:YN)\n#define tS(t) (t==1?XS:YS)\n#define tA(t) (t==1?XA:YA)\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}\nll sqrtz(ll N) {\n ll L = 0;\n ll R = sqrt(N) + 10000;\n while (abs(R - L) > 1) {\n ll mid = (R + L) / 2;\n if (mid * mid <= N)L = mid;\n else R = mid;\n }\n return L;\n\n}\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 (n < k) return 0;\n return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;\n}\n\n\n\nll modPow(ll a, ll n, ll p) {\n ll res = 1;\n ll k = a;\n while (n > 0) {\n if (n % 2 == 1) {\n res *= k;\n if (res > p)res %= p;\n }\n k = k * k;\n if (k > p)k %= p;\n n /= 2;\n }\n return res;\n}\n\nstruct quot {\n ll de, nu;//de分母\n quot() = default;\n quot(ll nu, ll de) :de(de), nu(nu) { init(*this); }\n quot(ll z) :de(1), nu(z) { init(*this); }\n void init(quot& a) {\n if (a.nu == 0) {\n a.de = 1;\n }\n else {\n ll g = GcD(a.de, a.nu);\n a.de /= g;\n a.nu /= g;\n if (a.de < 0) {\n a.de *= -1;\n a.nu *= -1;\n }\n }\n }\n ll GcD(ll(a), ll(b)) {\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\n quot operator *(const quot& p) {\n quot res;\n res.de = this->de * p.de;\n res.nu = this->nu * p.nu;\n init(res);\n return res;\n };\n quot operator +(const quot& p) {\n quot res;\n res.de = this->de * p.de;\n res.nu = this->nu * p.de + this->de * p.nu;\n init(res);\n return res;\n };\n\n quot operator-()const {\n quot res;\n res.de = this->de;\n res.nu = -this->nu;\n return res;\n };\n quot operator -(const quot& p) {\n return *this + (-p);\n };\n quot inv(quot q) {\n quot res;\n res.de = q.nu;\n res.nu = q.de;\n return res;\n }\n quot operator/(const quot& q) {\n return *this * inv(q);\n }\n\n bool operator==(const quot& q) {\n return (this->de == q.de && this->nu == q.nu);\n }\n\n bool operator<(const quot& q)const {\n return (this->nu * q.de - this->de * q.nu < 0);\n }\n bool operator>(const quot& q) {\n return !(*this == q || *this < q);\n }\n\n double tod(const quot& q) {\n return (double(nu) / double(de));\n }\n\n void print() {\n cout << nu << \" \" << de << endl;\n }\n\n void printd() {\n cout << tod(*this) << endl;\n }\n};\n\n\n\n\n\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll H, W;\n cin >> H >> W;\n map<quot, ll> M;\n vector<string> S(H + 2, \"\");\n rep(w, W + 2)S[0].push_back('.'), S[H + 1].push_back('.');\n rep(h, H) {\n cin >> S[h+1];\n S[h+1] = '.' + S[h+1] + '.';\n }\n rep(h, H + 1) {\n rep(w, W + 1) {\n ll cnt = 0;\n rep(dh, 2)rep(dw, 2) {\n cnt += (S[h + dh][w + dw] == '#');\n \n }\n if (cnt == 1) {\n if (S[h][w] == '#') {\n M[quot(H - h, w)]++;\n }\n else if (S[h + 1][w + 1] == '#') {\n M[quot(H - h, w)]--;\n }\n }\n if (cnt == 3) {\n if (S[h][w] == '.') {\n M[quot(H - h, w)]++;\n }\n else if (S[h + 1][w + 1] == '.') {\n M[quot(H - h, w)]--;\n }\n }\n }\n }\n ll an = 0;\n ll m = 1;\n for (auto p : M) {\n m += p.second;\n chmax(an, m);\n }\n cout << an << endl;\n\n\n\n}","accuracy":1,"time_ms":20,"memory_kb":8288,"score_of_the_acc":-0.236,"final_rank":14},{"submission_id":"aoj_2310_6666218","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// template {{{\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\n\n#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)\n#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)\n\n#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x)\n#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)\n\n#define debug(x) cerr << \"(\" << __LINE__ << \")\" << #x << \": \" << (x) << endl\n\nconstexpr i32 inf = 1001001001;\nconstexpr i64 infll = 1001001001001001001ll;\n\nconstexpr i32 dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; \nconstexpr i32 dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};\n\nstruct IoSetup { IoSetup(i32 x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;\n\ntemplate <typename T = i64> T input() { T x; cin >> x; return x; }\n\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != (int)v.size() ? \" \" : \"\"); } return os; } \ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }\n\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; }\n\ntemplate <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }\ntemplate <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }\n\ntemplate <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\ntemplate <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n// }}}\n\nnamespace intgeometry2d {\n using isize = std::ptrdiff_t;\n using usize = std::size_t;\n\n using i32 = std::int_fast32_t;\n using i64 = std::int_fast64_t;\n using u32 = std::uint_fast32_t;\n using u64 = std::uint_fast64_t;\n} // intgeometry2d\n\nnamespace intgeometry2d {\n\n template< typename Z >\n class lattice_point {\n Z x_, y_;\n\n public:\n lattice_point() {}\n lattice_point(Z x_, Z y_) : x_(x_), y_(y_) {}\n \n Z x() const { return x_; }\n Z y() const { return y_; }\n\n bool operator==(const lattice_point &p) const { return x_ == p.x_ and y_ == p.y_; }\n bool operator!=(const lattice_point &p) const { return x_ != p.x_ or y_ != p.y_; }\n\n lattice_point operator+(lattice_point p) { return lattice_point(x_ + p.x_, y_ + p.y_); }\n lattice_point operator-(lattice_point p) { return lattice_point(x_ - p.x_, y_ - p.y_); }\n\n Z norm() const { return x_ * x_ + y_ * y_; }\n };\n\n} // intgeometry2d\n\nnamespace intgeometry2d {\n\n template< typename Z >\n Z det(const lattice_point<Z> &a, const lattice_point<Z> &b) {\n return a.x() * b.y() - a.y() * b.x();\n }\n\n} // intgeometry2d\n\nnamespace intgeometry2d {\n template< typename Z >\n bool argcmp(const lattice_point<Z> &a, const lattice_point<Z> &b) {\n using std::pair;\n bool fa = pair(a.y(), a.x()) < pair<Z, Z>(0, 0);\n bool fb = pair(b.y(), b.x()) < pair<Z, Z>(0, 0);\n Z d = det(a, b);\n return fa != fb ? fa < fb : (d == 0 ? a.norm() < b.norm() : d > 0);\n }\n} // intgeometry2d\n\nvoid solve() {\n int h = input(), w = input();\n\n auto cs = make_vector(h + 2, w + 2, '.');\n range(i, 1, h + 1) range(j, 1, w + 1) {\n cin >> cs[i][j];\n }\n\n using point = intgeometry2d::lattice_point<i32>;\n vector< pair<point, int> > pts;\n rrange(i, 0, h + 1) range(j, 0, w + 1) {\n // cs[ i ][j] cs[ i ][j+1]\n // cs[i+1][j] cs[i+1][j+1]\n // centor: (h - i, j) ?\n auto is_dot = [](char c) {\n return '.' == c;\n };\n\n bool ul = is_dot(cs[i][j]);\n bool ur = is_dot(cs[i][j + 1]);\n bool dl = is_dot(cs[i + 1][j]);\n bool dr = is_dot(cs[i + 1][j + 1]);\n\n // split pattern:\n // #. .#\n // .. or ##\n if ((ul != ur) and (ur == dl) and (dl == dr)) {\n pts.emplace_back(point(h - i, j), -1);\n }\n\n // merge pattern:\n // .. ##\n // .# or #.\n if (ul == ur and ur == dl and dl != dr) {\n pts.emplace_back(point(h - i, j), 1);\n }\n }\n\n pts.emplace_back(point(-1, -1), 0);\n\n auto cmp = [](pair<point, int> &a, pair<point, int> &b) {\n return intgeometry2d::argcmp(a.first, b.first);\n };\n whole(sort, pts, cmp);\n\n int ans = 1;\n int cnt = 2;\n range(i, 1, pts.size()) {\n point pre = pts[i - 1].first;\n point pt = pts[i].first;\n if (intgeometry2d::det(pre, pt)) {\n chmax(ans, cnt);\n }\n\n cnt += pts[i].second;\n }\n\n cout << ans << endl;\n}\n\nsigned main() {\n solve();\n}","accuracy":1,"time_ms":10,"memory_kb":5156,"score_of_the_acc":-0.0053,"final_rank":2},{"submission_id":"aoj_2310_6652175","code_snippet":"#include <bits/extc++.h>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define reps(i,s,n) for(int i=(s);i<=(n);++i)\n#define all(x) begin(x), end(x)\n#define Fixed fixed << setprecision(12)\n#define int int64_t\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\n\ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func>{forward<Func>(f)};\n}\n\ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\n\ntemplate <class T> using max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A,B>;\n\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\n\ntemplate <class T> inline void bye(T x) { cout << x << '\\n'; exit(0); }\n\ninline int updiv(int a,int b){ return (a + b - 1) / b; }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\n\nsigned main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int h, w;\n cin >> h >> w;\n\n vector<string> mat(h);\n\n for (int i = 0; i < h; ++i) cin >> mat[i];\n reverse(all(mat));\n\n vector<pair<int, int> > points;\n\n auto inside = [&](int y, int x) {\n return (0 <= y && y < h && 0 <= x && x < w);\n };\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if (mat[i][j] != '#') continue;\n for (int k = 4; k < 8; ++k) {\n vector<bool> flg(4);\n int y = i + dy[k], x = j + dx[k];\n if (inside(y, x) && mat[y][x] != '.') continue;\n if (y == -1 && x == -1) continue;\n // cout << i << ' ' << j << \" : \" << y << ' ' << x << '\\n';\n for (int s = 0; s < 4; ++s) {\n int ty = y + dy[s], tx = x + dx[s];\n if (inside(ty, tx) && mat[ty][tx] == '#') {\n flg[s] = true;\n }\n }\n if (k == 4) {\n if (flg[1] == flg[2]) points.emplace_back(i + 1, j + 1);\n } else if (k == 5) {\n if (flg[3] == flg[2]) points.emplace_back(i, j + 1);\n } else if (k == 6) {\n if (flg[0] == flg[3]) points.emplace_back(i, j);\n } else {\n if (flg[0] == flg[1]) points.emplace_back(i + 1, j);\n }\n }\n }\n }\n\n sort(all(points), [](const auto &a, const auto &b) -> bool {\n return (atan2l(a.first, a.second) < atan2l(b.first, b.second));\n });\n\n points.erase(unique(all(points)), points.end());\n\n // for (auto [y, x] : points) {\n // cout << y << ' ' << x << ' ' << atan2l(y, x) << '\\n';\n // }\n\n vector<vector<pair<int, int> > > points2;\n\n for (auto [y, x] : points) {\n if (points2.empty() || atan2l(points2.back().back().first, points2.back().back().second) != atan2l(y, x)) {\n points2.emplace_back(vector<pair<int, int> >(1, make_pair(y, x)));\n } else {\n points2.back().emplace_back(y, x);\n }\n }\n\n for (auto &v : points2) {\n sort(all(v), [](const auto &a, const auto &b) {\n return (a.second != b.second ? a.second < b.second : a.first < b.first);\n });\n }\n\n auto Tile = [&](int y, int x) {\n return !(!inside(y, x) || mat[y][x] == '.');\n };\n auto Type = [&](int y, int x) {\n if (Tile(y - 1, x - 1)) {\n if (Tile(y - 1, x) && Tile(y, x - 1)) return (0);\n if (!Tile(y - 1, x) && !Tile(y, x - 1)) return (1);\n }\n if (Tile(y, x - 1)) {\n if (Tile(y, x) && Tile(y - 1, x - 1)) return (2);\n if (!Tile(y, x) && !Tile(y - 1, x - 1)) return (3);\n }\n if (Tile(y, x)) {\n if (Tile(y, x - 1) && Tile(y - 1, x)) return (4);\n if (!Tile(y, x - 1) && !Tile(y - 1, x)) return (5);\n }\n if (Tile(y - 1, x)) {\n if (Tile(y, x) && Tile(y - 1, x - 1)) return (6); \n if (!Tile(y, x) && !Tile(y - 1, x - 1)) return (7);\n }\n return (-1);\n };\n\n int sz = points2.size(), cnt = 0, res = 0;\n for (int i = 0; i < sz - 1; ++i) {\n for (auto [y, x] : points2[i]) {\n // cout << y << ' ' << x << '\\n';\n switch (Type(y, x)) {\n case 0:\n break;\n case 1:\n break;\n case 2:\n cnt -= 2;\n break;\n case 3:\n cnt += 2;\n break;\n case 4:\n break;\n case 5:\n break;\n case 6:\n cnt += 2;\n break;\n case 7:\n cnt -= 2;\n break;\n default:\n // cout << \"Error\\n\";\n break;\n }\n }\n // cout << \"-----\\n>\";\n // cout << cnt << '\\n';\n // cout << \"-----\\n\";\n chmax(res, cnt);\n }\n\n cout << res / 2 + 1 << '\\n';\n\n return(0);\n}","accuracy":1,"time_ms":300,"memory_kb":12912,"score_of_the_acc":-1.4912,"final_rank":19},{"submission_id":"aoj_2310_6624406","code_snippet":"#include <bits/extc++.h>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define reps(i,s,n) for(int i=(s);i<=(n);++i)\n#define all(x) begin(x), end(x)\n#define Fixed fixed << setprecision(12)\n#define int int64_t\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\n\ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func>{forward<Func>(f)};\n}\n\ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\n\ntemplate <class T> using max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A,B>;\n\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\n\ntemplate <class T> inline void bye(T x) { cout << x << '\\n'; exit(0); }\n\ninline int updiv(int a,int b){ return (a + b - 1) / b; }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\n\nsigned main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int h, w;\n cin >> h >> w;\n\n vector<string> mat(h);\n\n for (int i = 0; i < h; ++i) cin >> mat[i];\n reverse(all(mat));\n\n vector<pair<int, int> > points;\n\n auto inside = [&](int y, int x) {\n return (0 <= y && y < h && 0 <= x && x < w);\n };\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if (mat[i][j] != '#') continue;\n for (int k = 4; k < 8; ++k) {\n vector<bool> flg(4);\n int y = i + dy[k], x = j + dx[k];\n if (inside(y, x) && mat[y][x] != '.') continue;\n if (y == -1 && x == -1) continue;\n // cout << i << ' ' << j << \" : \" << y << ' ' << x << '\\n';\n for (int s = 0; s < 4; ++s) {\n int ty = y + dy[s], tx = x + dx[s];\n if (inside(ty, tx) && mat[ty][tx] == '#') {\n flg[s] = true;\n }\n }\n if (k == 4) {\n if (flg[1] == flg[2]) points.emplace_back(i + 1, j + 1);\n } else if (k == 5) {\n if (flg[3] == flg[2]) points.emplace_back(i, j + 1);\n } else if (k == 6) {\n if (flg[0] == flg[3]) points.emplace_back(i, j);\n } else {\n if (flg[0] == flg[1]) points.emplace_back(i + 1, j);\n }\n }\n }\n }\n\n sort(all(points), [](const auto &a, const auto &b) -> bool {\n return (atan2l(a.first, a.second) < atan2l(b.first, b.second));\n });\n\n points.erase(unique(all(points)), points.end());\n\n // for (auto [y, x] : points) {\n // cout << y << ' ' << x << ' ' << atan2l(y, x) << '\\n';\n // }\n\n vector<vector<pair<int, int> > > points2;\n\n for (auto [y, x] : points) {\n if (points2.empty() || atan2l(points2.back().back().first, points2.back().back().second) != atan2l(y, x)) {\n points2.emplace_back(vector<pair<int, int> >(1, make_pair(y, x)));\n } else {\n points2.back().emplace_back(y, x);\n }\n }\n\n for (auto &v : points2) {\n sort(all(v), [](const auto &a, const auto &b) {\n return (a.second != b.second ? a.second < b.second : a.first < b.first);\n });\n }\n\n auto Tile = [&](int y, int x) {\n return !(!inside(y, x) || mat[y][x] == '.');\n };\n auto Type = [&](int y, int x) {\n if (Tile(y - 1, x - 1)) {\n if (Tile(y - 1, x) && Tile(y, x - 1)) return (0);\n if (!Tile(y - 1, x) && !Tile(y, x - 1)) return (1);\n }\n if (Tile(y, x - 1)) {\n if (Tile(y, x) && Tile(y - 1, x - 1)) return (2);\n if (!Tile(y, x) && !Tile(y - 1, x - 1)) return (3);\n }\n if (Tile(y, x)) {\n if (Tile(y, x - 1) && Tile(y - 1, x)) return (4);\n if (!Tile(y, x - 1) && !Tile(y - 1, x)) return (5);\n }\n if (Tile(y - 1, x)) {\n if (Tile(y, x) && Tile(y - 1, x - 1)) return (6); \n if (!Tile(y, x) && !Tile(y - 1, x - 1)) return (7);\n }\n return (-1);\n };\n\n int sz = points2.size(), cnt = 0, res = 0;\n for (int i = 0; i < sz - 1; ++i) {\n for (auto [y, x] : points2[i]) {\n // cout << y << ' ' << x << '\\n';\n switch (Type(y, x)) {\n case 0:\n break;\n case 1:\n break;\n case 2:\n cnt -= 2;\n break;\n case 3:\n cnt += 2;\n break;\n case 4:\n break;\n case 5:\n break;\n case 6:\n cnt += 2;\n break;\n case 7:\n cnt -= 2;\n break;\n default:\n // cout << \"Error\\n\";\n break;\n }\n }\n // cout << \"-----\\n>\";\n // cout << cnt << '\\n';\n // cout << \"-----\\n\";\n chmax(res, cnt);\n }\n\n cout << res / 2 + 1 << '\\n';\n\n return(0);\n}","accuracy":1,"time_ms":300,"memory_kb":13512,"score_of_the_acc":-1.5288,"final_rank":20},{"submission_id":"aoj_2310_6620054","code_snippet":"#include<bits/stdc++.h>\n#define int ll\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 per(i, N) for(int i = N-1; i >= 0; --i)\n#define per1(i, N) for(int i = N; i >= 1; --i)\n#define FOR(i, f, t) for(int i = f; i < (int)t; ++i)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bit(n) (1ll << (n))\n#define pcnt(n) (__builtin_popcount(n))\n#define TakAo(ans) ans ? cout << \"Takahashi\\n\" : cout << \"Aoki\\n\"\n#define YesNo(ans) ans ? cout << \"Yes\\n\" : cout << \"No\\n\"\n#define endl '\\n'\n#define fi first\n#define se second\n#define mkpr make_pair\n#define mktpl make_tuple\n#define eb emplace_back\n\nusing namespace std;\nusing ll = int64_t;\nusing ull = uint64_t;\nusing ld = long double;\nusing point = struct{ ll x, y; };\ntemplate<class T> using max_heap = priority_queue<T>;\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vec<vec<T>>;\ntemplate<class T> using vvvec = vec<vec<vec<T>>>;\ntemplate<class T> using vvvvec = vec<vec<vec<vec<T>>>>;\n\nconstexpr ld EPS = 1e-10;\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr int MOD = 1e9+7;\n//constexpr ll MOD = 998244353;\nconstexpr int div2 = (MOD + 1) >> 1;\nconstexpr int NIL = -1;\nconstexpr int pm[2] = {1, -1};\nconstexpr int dy[4] = {0, 1, 0, -1};\nconstexpr int dx[4] = {1, 0, -1, 0};\n\nll cel(ll a, ll b){ return (a + b - 1) / b;}\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : a;}\ntemplate<class T> T powi(T x, ll exp){\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : 1;\n}\nll modpow(ll x, ll exp, ll mod){\n x %= mod;\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\n}\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\n\nusing P = pair<ll, ll>;\nusing Tpl = tuple<int, int, int, int>;\n\nbool comp(pair<point, ll> &a, pair<point, ll> &b){\n return a.fi.x * b.fi.y < a.fi.y * b.fi.x;\n}\n\nbool eq(pair<point, ll> &a, pair<point, ll> &b){\n return a.fi.x * b.fi.y == a.fi.y * b.fi.x;\n}\n\nvoid Main(){\n int H, W; cin >> H >> W;\n vvec<char> G(H + 10, vec<char>(W + 10, '.'));\n rep(i, H){\n rep(j, W) cin >> G[i + 1][j + 1];\n }\n vec<pair<point, ll>> XY;\n\n rep(i, H){\n rep(j, W){\n if(G[i + 1][j + 1] == '#'){\n if(G[i][j] == '.' && G[i + 1][j] == '.' && G[i][j + 1] == '.'){\n XY.eb(mkpr(point{j, H - i}, 1));\n }\n }\n else{\n if(G[i][j] == '#' && G[i + 1][j] == '#' && G[i][j + 1] == '#'){\n XY.eb(mkpr(point{j, H - i}, 1));\n }\n }\n }\n }\n rep(i, H){\n rep(j, W){\n if(G[i + 1][j + 1] == '#'){\n if(G[i + 2][j + 2] == '.' && G[i + 2][j + 1] == '.' && G[i + 1][j + 2] == '.'){\n XY.eb(mkpr(point{j + 1, H - i - 1}, -1));\n }\n }\n else{\n if(G[i + 2][j + 2] == '#' && G[i + 2][j + 1] == '#' && G[i + 1][j + 2] == '#'){\n XY.eb(mkpr(point{j + 1, H - i - 1}, -1));\n }\n }\n }\n }\n if(int(XY.size()) == 0){\n cout << 0 << endl;\n return;\n }\n\n sort(all(XY), comp);\n\n /* \n for(auto it : XY){\n cout << it.fi.x << \" \" << it.fi.y << \" \" << it.se << endl;\n }\n */\n \n int M = int(XY.size());\n pair<point, ll> prev = XY[0];\n int cnt = 2;\n int ans = 0;\n rep(i, M){\n if(i == 0) continue;\n if(eq(XY[i], prev)){\n cnt += XY[i].se;\n prev = XY[i];\n }\n else{\n chmax(ans, cnt);\n //cout << cnt << endl;\n cnt += XY[i].se;\n prev = XY[i];\n }\n }\n cout << ans << endl;\n}\n\nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n Main();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":7868,"score_of_the_acc":-0.1752,"final_rank":8},{"submission_id":"aoj_2310_6620030","code_snippet":"#include<bits/stdc++.h>\n#define int ll\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 per(i, N) for(int i = N-1; i >= 0; --i)\n#define per1(i, N) for(int i = N; i >= 1; --i)\n#define FOR(i, f, t) for(int i = f; i < (int)t; ++i)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bit(n) (1ll << (n))\n#define pcnt(n) (__builtin_popcount(n))\n#define TakAo(ans) ans ? cout << \"Takahashi\\n\" : cout << \"Aoki\\n\"\n#define YesNo(ans) ans ? cout << \"Yes\\n\" : cout << \"No\\n\"\n#define endl '\\n'\n#define fi first\n#define se second\n#define mkpr make_pair\n#define mktpl make_tuple\n#define eb emplace_back\n\nusing namespace std;\nusing ll = int64_t;\nusing ull = uint64_t;\nusing ld = long double;\nusing point = struct{ ll x, y; };\ntemplate<class T> using max_heap = priority_queue<T>;\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vec<vec<T>>;\ntemplate<class T> using vvvec = vec<vec<vec<T>>>;\ntemplate<class T> using vvvvec = vec<vec<vec<vec<T>>>>;\n\nconstexpr ld EPS = 1e-10;\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr int MOD = 1e9+7;\n//constexpr ll MOD = 998244353;\nconstexpr int div2 = (MOD + 1) >> 1;\nconstexpr int NIL = -1;\nconstexpr int pm[2] = {1, -1};\nconstexpr int dy[4] = {0, 1, 0, -1};\nconstexpr int dx[4] = {1, 0, -1, 0};\n\nll cel(ll a, ll b){ return (a + b - 1) / b;}\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : a;}\ntemplate<class T> T powi(T x, ll exp){\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : 1;\n}\nll modpow(ll x, ll exp, ll mod){\n x %= mod;\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\n}\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\n\nusing P = pair<ll, ll>;\nusing Tpl = tuple<int, int, int, int>;\n\nbool comp(pair<point, ll> &a, pair<point, ll> &b){\n return a.fi.x * b.fi.y < a.fi.y * b.fi.x;\n}\n\nbool eq(pair<point, ll> &a, pair<point, ll> &b){\n return a.fi.x * b.fi.y == a.fi.y * b.fi.x;\n}\n\nvoid Main(){\n int H, W; cin >> H >> W;\n vvec<char> G(H + 10, vec<char>(W + 10, '.'));\n rep(i, H){\n rep(j, W) cin >> G[i + 1][j + 1];\n }\n vec<pair<point, ll>> XY;\n\n rep(i, H){\n rep(j, W){\n if(G[i + 1][j + 1] == '#'){\n if(G[i][j] == '.' && G[i + 1][j] == '.' && G[i][j + 1] == '.'){\n XY.eb(mkpr(point{j, H - i}, 1));\n }\n }\n else{\n if(G[i][j] == '#' && G[i + 1][j] == '#' && G[i][j + 1] == '#'){\n XY.eb(mkpr(point{j, H - i}, 1));\n }\n }\n }\n }\n rep(I, H){\n rep(j, W){\n if(G[I + 1][j + 1] == '#'){\n if(G[I + 2][j + 2] == '.' && G[I + 2][j + 1] == '.' && G[I + 1][j + 2] == '.'){\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\n }\n }\n else{\n if(G[I + 2][j + 2] == '#' && G[I + 2][j + 1] == '#' && G[I + 1][j + 2] == '#'){\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\n }\n }\n }\n }\n if(int(XY.size()) == 0){\n cout << 0 << endl;\n return;\n }\n\n sort(all(XY), comp);\n\n /* \n for(auto it : XY){\n cout << it.fi.x << \" \" << it.fi.y << \" \" << it.se << endl;\n }\n */\n \n int M = int(XY.size());\n pair<point, ll> prev = XY[0];\n int cnt = 2;\n int ans = 0;\n rep(i, M){\n if(i == 0) continue;\n if(eq(XY[i], prev)){\n cnt += XY[i].se;\n prev = XY[i];\n }\n else{\n chmax(ans, cnt);\n //cout << cnt << endl;\n cnt += XY[i].se;\n prev = XY[i];\n }\n }\n cout << ans << endl;\n}\n\nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n Main();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":7980,"score_of_the_acc":-0.1822,"final_rank":9},{"submission_id":"aoj_2310_6620029","code_snippet":"#include<bits/stdc++.h>\n#define int ll\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 per(i, N) for(int i = N-1; i >= 0; --i)\n#define per1(i, N) for(int i = N; i >= 1; --i)\n#define FOR(i, f, t) for(int i = f; i < (int)t; ++i)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bit(n) (1ll << (n))\n#define pcnt(n) (__builtin_popcount(n))\n#define TakAo(ans) ans ? cout << \"Takahashi\\n\" : cout << \"Aoki\\n\"\n#define YesNo(ans) ans ? cout << \"Yes\\n\" : cout << \"No\\n\"\n#define endl '\\n'\n#define fi first\n#define se second\n#define mkpr make_pair\n#define mktpl make_tuple\n#define eb emplace_back\n\nusing namespace std;\nusing ll = int64_t;\nusing ull = uint64_t;\nusing ld = long double;\nusing point = struct{ ll x, y; };\ntemplate<class T> using max_heap = priority_queue<T>;\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vec<vec<T>>;\ntemplate<class T> using vvvec = vec<vec<vec<T>>>;\ntemplate<class T> using vvvvec = vec<vec<vec<vec<T>>>>;\n\nconstexpr ld EPS = 1e-10;\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr int MOD = 1e9+7;\n//constexpr ll MOD = 998244353;\nconstexpr int div2 = (MOD + 1) >> 1;\nconstexpr int NIL = -1;\nconstexpr int pm[2] = {1, -1};\nconstexpr int dy[4] = {0, 1, 0, -1};\nconstexpr int dx[4] = {1, 0, -1, 0};\n\nll cel(ll a, ll b){ return (a + b - 1) / b;}\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : a;}\ntemplate<class T> T powi(T x, ll exp){\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : 1;\n}\nll modpow(ll x, ll exp, ll mod){\n x %= mod;\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\n}\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\n\nusing P = pair<ll, ll>;\nusing Tpl = tuple<int, int, int, int>;\n\nbool comp(pair<point, ll> &a, pair<point, ll> &b){\n return a.fi.x * b.fi.y < a.fi.y * b.fi.x;\n}\n\nbool eq(pair<point, ll> &a, pair<point, ll> &b){\n return a.fi.x * b.fi.y == a.fi.y * b.fi.x;\n}\n\nvoid Main(){\n int H, W; cin >> H >> W;\n vvec<char> G(H + 700, vec<char>(W + 700, '.'));\n rep(i, H){\n rep(j, W) cin >> G[i + 1][j + 1];\n }\n vec<pair<point, ll>> XY;\n\n rep(i, H){\n rep(j, W){\n if(G[i + 1][j + 1] == '#'){\n if(G[i][j] == '.' && G[i + 1][j] == '.' && G[i][j + 1] == '.'){\n XY.eb(mkpr(point{j, H - i}, 1));\n }\n }\n else{\n if(G[i][j] == '#' && G[i + 1][j] == '#' && G[i][j + 1] == '#'){\n XY.eb(mkpr(point{j, H - i}, 1));\n }\n }\n }\n }\n rep(I, H){\n rep(j, W){\n if(G[I + 1][j + 1] == '#'){\n if(G[I + 2][j + 2] == '.' && G[I + 2][j + 1] == '.' && G[I + 1][j + 2] == '.'){\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\n }\n }\n else{\n if(G[I + 2][j + 2] == '#' && G[I + 2][j + 1] == '#' && G[I + 1][j + 2] == '#'){\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\n }\n }\n }\n }\n if(int(XY.size()) == 0){\n cout << 0 << endl;\n return;\n }\n\n sort(all(XY), comp);\n\n /* \n for(auto it : XY){\n cout << it.fi.x << \" \" << it.fi.y << \" \" << it.se << endl;\n }\n */\n \n int M = int(XY.size());\n pair<point, ll> prev = XY[0];\n int cnt = 2;\n int ans = 0;\n rep(i, M){\n if(i == 0) continue;\n if(eq(XY[i], prev)){\n cnt += XY[i].se;\n prev = XY[i];\n }\n else{\n chmax(ans, cnt);\n //cout << cnt << endl;\n cnt += XY[i].se;\n prev = XY[i];\n }\n }\n cout << ans << endl;\n}\n\nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n Main();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":8656,"score_of_the_acc":-0.2246,"final_rank":11},{"submission_id":"aoj_2310_6619556","code_snippet":"#include<bits/stdc++.h>\n#define int ll\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 per(i, N) for(int i = N-1; i >= 0; --i)\n#define per1(i, N) for(int i = N; i >= 1; --i)\n#define FOR(i, f, t) for(int i = f; i < (int)t; ++i)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define bit(n) (1ll << (n))\n#define pcnt(n) (__builtin_popcount(n))\n#define TakAo(ans) ans ? cout << \"Takahashi\\n\" : cout << \"Aoki\\n\"\n#define YesNo(ans) ans ? cout << \"Yes\\n\" : cout << \"No\\n\"\n#define endl '\\n'\n#define fi first\n#define se second\n#define mkpr make_pair\n#define mktpl make_tuple\n#define eb emplace_back\n\nusing namespace std;\nusing ll = int64_t;\nusing ull = uint64_t;\nusing ld = long double;\nusing point = struct{ ll x, y; };\ntemplate<class T> using max_heap = priority_queue<T>;\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> using vec = vector<T>;\ntemplate<class T> using vvec = vec<vec<T>>;\ntemplate<class T> using vvvec = vec<vec<vec<T>>>;\ntemplate<class T> using vvvvec = vec<vec<vec<vec<T>>>>;\n\nconstexpr ld EPS = 1e-10;\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr int MOD = 1e9+7;\n//constexpr ll MOD = 998244353;\nconstexpr int div2 = (MOD + 1) >> 1;\nconstexpr int NIL = -1;\nconstexpr int pm[2] = {1, -1};\nconstexpr int dy[4] = {0, 1, 0, -1};\nconstexpr int dx[4] = {1, 0, -1, 0};\n\nll cel(ll a, ll b){ return (a + b - 1) / b;}\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : a;}\ntemplate<class T> T powi(T x, ll exp){\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : 1;\n}\nll modpow(ll x, ll exp, ll mod){\n x %= mod;\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\n}\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\n\nusing P = pair<ll, ll>;\nusing Tpl = tuple<int, int, int, int>;\n\nbool comp(const pair<point, ll> &a, const pair<point, ll> &b){\n return a.fi.x * b.fi.y < a.fi.y * b.fi.x;\n}\n\nbool eq(const pair<point, ll> &a, const pair<point, ll> &b){\n return a.fi.x * b.fi.y == a.fi.y * b.fi.x;\n}\n\nvoid Main(){\n int H, W; cin >> H >> W;\n vvec<char> G(H + 700, vec<char>(W + 700, '.'));\n rep(i, H){\n rep(j, W) cin >> G[i + 1][j + 1];\n }\n vec<pair<point, ll>> XY;\n\n rep(i, H){\n rep(j, W){\n if(G[i + 1][j + 1] == '#'){\n if(G[i][j] == '.' && G[i + 1][j] == '.' && G[i][j + 1] == '.'){\n XY.eb(mkpr(point{j, H - i}, 1));\n }\n }\n else{\n if(G[i][j] == '#' && G[i + 1][j] == '#' && G[i][j + 1] == '#'){\n XY.eb(mkpr(point{j, H - i}, 1));\n }\n }\n }\n }\n rep(I, H){\n rep(j, W){\n if(G[I + 1][j + 1] == '#'){\n if(G[I + 2][j + 2] == '.' && G[I + 2][j + 1] == '.' && G[I + 1][j + 2] == '.'){\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\n }\n }\n else{\n if(G[I + 2][j + 2] == '#' && G[I + 2][j + 1] == '#' && G[I + 1][j + 2] == '#'){\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\n }\n }\n }\n }\n if(int(XY.size()) == 0){\n cout << 0 << endl;\n return;\n }\n\n sort(all(XY), comp);\n\n /* \n for(auto it : XY){\n cout << it.fi.x << \" \" << it.fi.y << \" \" << it.se << endl;\n }\n */\n \n int M = int(XY.size());\n pair<point, ll> prev = XY[0];\n int cnt = 2;\n int ans = 0;\n rep(i, M){\n if(i == 0) continue;\n if(eq(XY[i], prev)){\n cnt += XY[i].se;\n prev = XY[i];\n }\n else{\n chmax(ans, cnt);\n //cout << cnt << endl;\n cnt += XY[i].se;\n prev = XY[i];\n }\n }\n cout << ans << endl;\n}\n\nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n Main();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":9460,"score_of_the_acc":-0.2749,"final_rank":15},{"submission_id":"aoj_2310_6275397","code_snippet":"#include \"bits/stdc++.h\"\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#define int long long\nvoid solve(){\n int h, w;\n cin >> h >> w;\n vector<string> inputs;\n inputs.push_back(string(w + 2, '.'));\n REP(i, h)\n {\n string s;\n cin >> s;\n s = \".\" + s + \".\";\n inputs.push_back(s);\n }\n inputs.push_back(string(w + 2, '.'));\n vector<pair<double, int>> cnter;\n REP(i, h + 1)\n {\n REP(q, w + 1)\n {\n double ang = atan2(h - i, q); \n if(inputs[i][q] =='#' and inputs[i+1][q] == '.' and inputs[i][q+1] == '.' and inputs[i+1][q+1] == '.'){\n cnter.push_back({ang, 1});\n }\n if(inputs[i][q] =='.' and inputs[i+1][q] == '.' and inputs[i][q+1] == '.' and inputs[i+1][q+1] == '#'){\n cnter.push_back({ang, -1});\n }\n if(inputs[i][q] =='.' and inputs[i+1][q] == '#' and inputs[i][q+1] == '#' and inputs[i+1][q+1] == '#'){\n cnter.push_back({ang, 1});\n }\n if(inputs[i][q] =='#' and inputs[i+1][q] == '#' and inputs[i][q+1] == '#' and inputs[i+1][q+1] == '.'){\n cnter.push_back({ang, -1});\n }\n }\n }\n sort(ALL(cnter));\n int cur = 1;\n int ans = 2;\n for(auto x:cnter){\n cur += x.second;\n ans = max(ans, cur);\n }\n cout << ans << endl;\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 // Fasterize input/output script\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(100);\n // scanf/printf user should delete this fasterize input/output script\n\n int t = 1;\n //cin >> t; // comment out if solving multi testcase\n for (int testCase = 1; testCase <= t; ++testCase) {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6060,"score_of_the_acc":-0.0619,"final_rank":6},{"submission_id":"aoj_2310_6028723","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 int INF=1<<30;\nconst LL MAX=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\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\nclass Fraction{\n typedef long long int ll;\n long long int gcd(long long int a,long long int b){\n if(a<b)swap(a,b);\n if(b==0)return a;\n return gcd(b,a%b);\n }\n\npublic:\n ll x,y;\n Fraction(){};\n Fraction(ll _x, ll _y):x(_x),y(_y){\n if(x==0 && y==0)return;\n if(y<0)x=-x,y=-y;\n ll d=gcd(abs(x),abs(y));\n x/=d,y/=d;\n }\n template<typename T> Fraction(pair<T,T> p){\n Fraction(p.first,p.second);\n }\n\n bool operator==(const Fraction f)const{\n return x==f.x && y==f.y;\n }\n bool operator<(const Fraction f)const{\n return x*f.y<f.x*y;\n }\n bool operator<=(const Fraction f)const{\n return x*f.y<=f.x*y;\n }\n bool operator>(const Fraction f)const{return !((*this)<=f);}\n bool operator>=(const Fraction f)const{return !((*this)<f);}\n};\n\nnamespace sol{\n\n void solve(){\n int n,m;\n int i,j,k;\n int a,b,c;\n cin>>n>>m;\n vector<vector<char>> grid(n+2,vector<char>(m+2));\n string sa;\n for(i=0;i<n;i++){\n cin>>sa;\n for(j=0;j<m;j++){\n if(sa[j]=='#')grid[i+1][j+1]=1;\n }\n }\n vector<pair<Fraction,int>> v1;\n for(i=0;i<=n;i++){\n for(j=0;j<=m;j++){\n c=0;\n for(a=0;a<2;a++){\n for(b=0;b<2;b++){\n c+=grid[i+a][j+b];\n }\n }\n if(c%2==0)continue;\n c=1-c/2;\n if(grid[i][j]==c)v1.push_back({Fraction(n-i,j),1});\n if(grid[i+1][j+1]==c)v1.push_back({Fraction(n-i,j),-1});\n }\n }\n sort(v1.begin(),v1.end());\n int s=0;\n int cnt=1;\n for(i=0;i<v1.size();i++){\n Fraction f=v1[i].first;\n a=v1[i].second;\n cnt+=a;\n if(i+1<v1.size() && f==v1[i+1].first)continue;\n s=max(s,cnt);\n }\n cout<<s<<endl;\n }\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n sol::solve();\n}","accuracy":1,"time_ms":10,"memory_kb":7752,"score_of_the_acc":-0.1679,"final_rank":7},{"submission_id":"aoj_2310_6027629","code_snippet":"#pragma GCC ta g(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define DEBUG\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n int sz = a.size();\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr;\n sz--;\n if(sz) cout << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\n//#include <atcoder/maxflow>\n//using namespace atcoder;\nconst int inf = (1<<30)-1;\nconst ll linf = 1LL<<61;\nconst int MAX = 510000;\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\nconst double pi = acos(-1);\nconst double eps = 1e-9;\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nint main(){\n\tint h,w; cin >> h >> w;\n\tvs s(h); rep(i,h) cin >> s[i];\n\trep(i,h) s[i].push_back('.');\n\ts.push_back(string(w+1,'.'));\n\tvector<pair<double,int>> ev;\n\trep(i,h) rep(j,w){\n\t\tchar a = s[i][j], b = s[i][j+1], c = s[i+1][j], d = s[i+1][j+1];\n\t\tif(a == b && b == c && a != d) ev.emplace_back((double)(h-i-1)/(j+1),-1);\n\t\tif(b == c && c == d && a != b) ev.emplace_back((double)(h-i-1)/(j+1),1);\n\t}\n\trep(j,w-1) if(s[0][j] == '.' && s[0][j+1] == '#') ev.emplace_back((double)h/(j+1),-1);\n\tsort(all(ev));\n\tint now = 0, ans = 0, mn = 0;\n\tfor(auto p : ev){\n\t\tnow += p.second;\n\t\tchmin(mn,now);\n\t\tchmax(ans, now-mn);\n\t}\n\tcout << ans+1 << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":5764,"score_of_the_acc":-0.0434,"final_rank":4},{"submission_id":"aoj_2310_5989166","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}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false); \n int h,w; cin >> h >> w;\n vector<vector<char>> s(h+2,vector<char>(w+2,'.'));\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n cin >> s[h-i][j+1];\n }\n }\n /*\n +1\n X. .X\n .. XX\n -1\n .. XX\n .X X.\n */\n vector<pair<pair<int,int>,int>> v;\n for(int i=0;i<=h;i++){\n for(int j=0;j<=w;j++){\n if(s[i][j] == '.' and s[i+1][j] == '#' and s[i][j+1] == '.' and s[i+1][j+1] == '.'){\n v.push_back({{i,j},1});\n }\n if(s[i][j] == '#' and s[i+1][j] == '.' and s[i][j+1] == '#' and s[i+1][j+1] == '#'){\n v.push_back({{i,j},1});\n }\n if(s[i][j] == '.' and s[i+1][j] == '.' and s[i][j+1] == '#' and s[i+1][j+1] == '.'){\n v.push_back({{i,j},-1});\n }\n if(s[i][j] == '#' and s[i+1][j] == '#' and s[i][j+1] == '.' and s[i+1][j+1] == '#'){\n v.push_back({{i,j},-1});\n }\n }\n }\n int res = 1;\n int cnt = 1;\n sort(v.begin(), v.end(), [&](auto i,auto j){\n int ix = i.first.second, iy = i.first.first;\n int jx = j.first.second, jy = j.first.first;\n // iy/ix < jy/jx\n if(iy*jx < jy*ix) return true;\n else if(iy*jx > jy*ix) return false;\n else{\n return i.second < j.second;\n }\n });\n for(int i=0;i<(int)v.size();i++){\n cnt += v[i].second;\n res = max(res, cnt);\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":5072,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_2310_5971590","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\n#pragma GCC target (\"avx2\")\n#pragma GCC optimization (\"O3\")\n#pragma GCC optimization (\"unroll-loops\")\nusing namespace std;\n \ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<int, int> pii;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\n \ntypedef long long ll;\ntypedef long double ld;\ntypedef unsigned long long ull;\n \n \n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define trav(a, x) for (auto &a : x)\n#define all(x) x.begin(), x.end()\n \n#define MOD 1000000007\n \ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\nconst double EPS = 1e-8, PI = acos(-1);\nconst double pi = 3.141592653589793238462643383279;\n//ここから編集 \ntypedef string::const_iterator State;\nll GCD(ll a, ll b){\n return (b==0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b) * b;\n}\ntemplate< int mod >\nstruct ModInt {\n int x;\n \n ModInt() : x(0) {}\n \n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n \n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n \n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n \n ModInt operator-() const { return ModInt(-x); }\n \n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n \n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n \n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n \n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n \n bool operator==(const ModInt &p) const { return x == p.x; }\n \n bool operator!=(const ModInt &p) const { return x != p.x; }\n \n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n \n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n \n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n \n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n \n static int get_mod() { return mod; }\n};\n \nusing modint = ModInt< 1000000007 >;\ntemplate< typename T >\nstruct Combination {\n vector< T > _fact, _rfact, _inv;\n \n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\n _fact[0] = _rfact[sz] = _inv[0] = 1;\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\n _rfact[sz] /= _fact[sz];\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\n }\n \n inline T fact(int k) const { return _fact[k]; }\n \n inline T rfact(int k) const { return _rfact[k]; }\n \n inline T inv(int k) const { return _inv[k]; }\n \n T P(int n, int r) const {\n if(r < 0 || n < r) return 0;\n return fact(n) * rfact(n - r);\n }\n \n T C(int p, int q) const {\n if(q < 0 || p < q) return 0;\n return fact(p) * rfact(q) * rfact(p - q);\n }\n \n T H(int n, int r) const {\n if(n < 0 || r < 0) return (0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\n \nll modpow(ll x, ll n, ll mod) {\n ll res = 1;\n x %= mod;\n if(x == 0) return 0;\n while(n) {\n if(n&1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n} \ninline long long mod(long long a, long long m) {\n return (a % m + m) % m;\n}\ntemplate<typename T> \nstruct BIT{\n int N;\n std::vector<T> node;\n BIT(){}\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\n void build(int n) {\n N = n;\n node.resize(N+10);\n }\n /* a: 1-indexed */\n void add(int a, T x){\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\n }\n\n /* [1, a] */\n T sum(int a){\n T res = 0;\n for(int x=a; x>0; x -= x & -x) res += node[x];\n return res;\n }\n\n /* [l, r] */\n T rangesum(int l, int r){\n return sum(r) - sum(l-1);\n }\n\n /* \n a1+a2+...+aw >= valとなるような最小のwを返す\n @verify https://codeforces.com/contest/992/problem/E\n */\n int lower_bound(T val) {\n if(val < 0) return 0;\n\n int res = 0;\n int n = 1; \n while (n < N) n *= 2;\n\n T tv=0;\n for (int k = n; k > 0; k /= 2) {\n if(res + k < N && node[res + k] < val){\n val -= node[res+k];\n res += k;\n }\n }\n return res+1; \n }\n};\nstruct UnionFind{\n std::vector<int> par;\n std::vector<int> siz;\n\n UnionFind(int sz_): par(sz_), siz(sz_) {\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n void init(int sz_){\n par.resize(sz_);\n siz.resize(sz_);\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n int root(int x){\n if(x == par[x]) return x;\n return par[x] = root(par[x]);\n }\n\n bool merge(int x, int y){\n x = root(x), y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) std::swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n\n bool issame(int x, int y){\n return root(x) == root(y);\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\nstruct RollingHash{\n\n using ull = unsigned long long;\n const ull mod = (1ULL << 61) - 1;\n const ull MASK30 = (1ULL << 30) - 1;\n const ull MASK31 = (1ULL << 31) - 1;\n\n const ull MASK61 = mod;\n\n ull base;\n int n;\n vector<ull> hash, pow;\n\n RollingHash(const string &s)\n {\n random_device rnd;\n mt19937_64 mt(rnd());\n base = 1001;\n \n n = (int)s.size();\n hash.assign(n+1, 0);\n pow.assign(n+1, 1);\n \n for(int i=0; i<n; i++){\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\n pow[i+1] = calc_mod(mul(pow[i], base));\n }\n }\n\n ull calc_mod(ull x){\n ull xu = x >> 61;\n ull xd = x & MASK61;\n ull res = xu + xd;\n if(res >= mod) res -= mod;\n return res;\n }\n\n ull mul(ull a, ull b){\n ull au = a >> 31;\n ull ad = a & MASK31;\n ull bu = b >> 31;\n ull bd = b & MASK31;\n ull mid = ad * bu + au * bd;\n ull midu = mid >> 30;\n ull midd = mid & MASK30;\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\n }\n\n //[l,r)のハッシュ値\n inline ull get(int l, int r){\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\n return res;\n }\n //string tのハッシュ値\n inline ull get(string t){\n ull res = 0;\n for(int i=0; i<t.size(); i++){\n res = calc_mod(mul(res, base)+t[i]);\n }\n return res;\n }\n //string s中のtの数をカウント\n inline int count(string t) {\n if(t.size() > n) return 0;\n auto hs = get(t);\n int res = 0;\n for(int i=0; i<n-t.size()+1; i++){\n if(get(i, i+t.size()) == hs) res++; \n }\n return res;\n }\n\n /* \n concat \n @verify https://codeforces.com/problemset/problem/514/C\n */\n inline ull concat(ull h1, ull h2, int h2len){\n return calc_mod(h2 + mul(h1, pow[h2len]));\n }\n\n // LCPを求める S[a:] T[b:]\n inline int LCP(int a, int b){\n int len = min((int)hash.size()-a, (int)hash.size()-b);\n \n int lb = -1, ub = len;\n while(ub-lb>1){\n int mid = (lb+ub)/2;\n\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\n else ub = mid;\n }\n return lb;\n }\n};\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 h += 2; w += 2;\n vector<vector<char>> f(h, vector<char>(w, '.'));\n for(int i=1; i<h-1; i++) {\n for(int j=1; j<w-1; j++) {\n cin >> f[i][j];\n }\n }\n \n vector<pair<double, int>> v;\n REP(i,h-1) {\n REP(j,w-1) {\n int num = 0;\n double arg = atan2(h-2-i, j);\n if(f[i][j] == '#' && f[i][j+1] == '.' && f[i+1][j] == '.' && f[i+1][j+1] == '.') {\n v.push_back({arg, 1});\n }\n if(f[i][j] == '.' && f[i][j+1] == '#' && f[i+1][j] == '#' && f[i+1][j+1] == '#') {\n v.push_back({arg, 1});\n }\n if(f[i][j] == '#' && f[i][j+1] == '#' && f[i+1][j] == '#' && f[i+1][j+1] == '.') {\n v.push_back({arg, -1});\n }\n if(f[i][j] == '.' && f[i][j+1] == '.' && f[i+1][j] == '.' && f[i+1][j+1] == '#') {\n v.push_back({arg, -1});\n }\n }\n } \n sort(all(v));\n int ans = 2;\n int cnt = 1;\n REP(i,v.size()) {\n cnt += v[i].second;\n ans = max(ans, cnt);\n }\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":6024,"score_of_the_acc":-0.0596,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_2310_10851592\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\nconst int INF = 1e9;\\nconst ll LINF = 1e18;\\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << \\\"(\\\" << o.first << \\\",\\\" << o.second << \\\")\\\"; return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << \\\" \\\";} return out; }\\ntemplate<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }\\ntemplate<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << \\\"{ \\\"; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << \\\":\\\" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << \\\", \\\"; } out << \\\" }\\\"; return out; }\\n\\n/*\\n <url:>\\n 問題文============================================================\\n =================================================================\\n 解説=============================================================\\n ================================================================\\n */\\n\\nconst double eps = 1e-9;\\nll solve(){\\n ll H,W; cin >> H >> W;\\n ll res = 1;\\n vector<vector<char>> masu(H+2,vector<char>(W+2,'.'));\\n vector<pair<double,int>> event;\\n for(int i = 1; i <= H;i++){\\n for(int j = 1; j <= W;j++){\\n cin >> masu[i][j];\\n }\\n }\\n \\n vector<vector<pii>> masu2(H+2,vector<pii>(W+2));\\n for(int i = 1; i <= H;i++){\\n for(int j = 1; j <= W;j++){\\n masu2[i][j] = {j-1,H-i};\\n }\\n }\\n //cout << masu << endl;\\n //cout << masu2 << endl;\\n for(int i = 1; i <= H;i++){\\n for(int j = 1; j <= W;j++){\\n if(masu[i][j] == '#'){\\n \\n double angle = 0;\\n // increment pattern\\n // ..\\n // .#\\n if(masu[i-1][j-1] == '.' && masu[i-1][j] == '.' && masu[i][j-1] == '.'){\\n angle = atan2(masu2[i][j].second+1,masu2[i][j].first);\\n event.push_back({angle,-1});\\n }\\n \\n // increment pattern\\n // ##\\n // #.\\n if(masu[i+1][j+1] == '.' && masu[i+1][j] == '#' && masu[i][j+1] == '#'){\\n angle = atan2(masu2[i][j].second,masu2[i][j].first+1);\\n event.push_back({angle,-1});\\n }\\n \\n // decrement pattern\\n // .#\\n // ##\\n if(masu[i-1][j-1] == '.' && masu[i-1][j] == '#' && masu[i][j-1] == '#'){\\n angle = atan2(masu2[i][j].second+1,masu2[i][j].first);\\n event.push_back({angle,1});\\n }\\n \\n // decrement pattern\\n // #.\\n // ..\\n if(masu[i+1][j+1] == '.' && masu[i+1][j] == '.' && masu[i][j+1] == '.'){\\n angle = atan2(masu2[i][j].second,masu2[i][j].first+1);\\n event.push_back({angle,1});\\n }\\n }\\n }\\n }\\n \\n sort(event.begin(),event.end());\\n \\n ll cnt = 1;\\n for(auto it = event.rbegin(); it != event.rend(); it++){\\n auto e = *it;\\n //cout << -e.second << endl;\\n cnt -= e.second;\\n res = max(res,cnt);\\n }\\n return res;\\n}\\nint main(void) {\\n cin.tie(0); ios_base::sync_with_stdio(false);\\n cout << solve() << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 8728,\n \"score_of_the_acc\": -0.2291,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2310_10408241\",\n \"code_snippet\": \"#include <iostream>\\n#include <iomanip>\\n#include <cassert>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\n#include <numeric>\\n#include <tuple>\\n// #include \\\"Src/Number/IntegerDivision.hpp\\\"\\n// #include \\\"Src/Utility/BinarySearch.hpp\\\"\\n// #include \\\"Src/Sequence/CompressedSequence.hpp\\\"\\n// #include \\\"Src/Sequence/RunLengthEncoding.hpp\\\"\\n// #include \\\"Src/Algebra/Group/AdditiveGroup.hpp\\\"\\n// #include \\\"Src/DataStructure/FenwickTree/FenwickTree.hpp\\\"\\n// using namespace zawa;\\n// #include \\\"atcoder/modint\\\"\\n// using mint = atcoder::modint998244353;\\nint H, W;\\nstd::string S[610];\\nbool in(int x, int y) {\\n return 0 <= x and x < H and 0 <= y and y < W;\\n}\\nbool block(int x, int y) {\\n return in(x, y) and S[x][y] == '#';\\n}\\nbool blank(int x, int y) {\\n return !block(x, y);\\n}\\nusing item = std::pair<std::pair<int, int>, int>;\\nint norm(std::pair<int, int> p) {\\n return p.first * p.first + p.second * p.second;\\n}\\nint cross(std::pair<int, int> l, std::pair<int, int> r) {\\n return l.first * r.second - l.second * r.first; \\n}\\nbool argcomp(std::pair<int, int> l, std::pair<int, int> r) {\\n const int c = cross(l, r);\\n if (c) return c > 0;\\n else return norm(l) < norm(r);\\n}\\nbool comp(item l, item r) {\\n return argcomp(l.first, r.first);\\n}\\nint main() {\\n std::cin.tie(nullptr);\\n std::cout.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n std::cin >> H >> W;\\n for (int i = 0 ; i < H ; i++) {\\n std::cin >> S[i];\\n }\\n std::vector<item> P;\\n for (int x = H - 1 ; x >= 0 ; x--) for (int y = 0 ; y < W ; y++) if (block(x, y)) {\\n if (blank(x+1,y) and blank(x+1,y+1) and blank(x,y+1)) {\\n P.push_back(std::make_pair(\\n // std::make_pair(H-(x+1),y+1),1\\n std::make_pair(y+1,H-(x+1)),1\\n ));\\n }\\n if (blank(x-1,y) and blank(x-1,y-1) and blank(x,y-1)) {\\n P.push_back(std::make_pair(\\n // std::make_pair(H-x,y),-1\\n std::make_pair(y,H-x),-1\\n ));\\n }\\n if (blank(x-1,y) and blank(x-1,y+1) and blank(x,y+1)) {\\n P.push_back(std::make_pair(\\n // std::make_pair(H-x,y+1),0\\n std::make_pair(y+1,H-x),0\\n ));\\n }\\n if (blank(x+1,y) and blank(x+1,y-1) and blank(x,y-1)) {\\n P.push_back(std::make_pair(\\n // std::make_pair(H-(x+1),y),0\\n std::make_pair(y,H-(x+1)),0\\n ));\\n }\\n if (block(x-1,y) and blank(x-1,y+1) and block(x,y+1)) {\\n P.push_back(std::make_pair(\\n std::make_pair(y+1,H-x),0\\n ));\\n }\\n if (block(x-1,y) and blank(x-1,y-1) and block(x,y-1)) {\\n P.push_back(std::make_pair(\\n std::make_pair(y,H-x),1\\n ));\\n }\\n if (block(x+1,y) and blank(x+1,y+1) and block(x,y+1)) {\\n P.push_back(std::make_pair(\\n std::make_pair(y+1,H-x-1),-1\\n ));\\n }\\n if (block(x+1,y) and blank(x+1,y-1) and block(x,y-1)) {\\n P.push_back(std::make_pair(\\n std::make_pair(y+1,H-x-1),0\\n ));\\n }\\n }\\n std::sort(P.begin(), P.end(), comp);\\n // for (int k = 0 ; k < (int)P.size() ; k++) std::cout << P[k].first.first << ',' << P[k].first.second << \\\" : \\\" << P[k].second << '\\\\n';\\n // std::cout.flush();\\n int ans = 1, res = 1;\\n for (int i = P[0].first == std::make_pair(0, 0), j = i ; i < (int)P.size() ; i = j) {\\n while (j < (int)P.size() and cross(P[i].first, P[j].first) == 0) ans += P[j++].second;\\n // for (int k = i ; k < j ; k++) std::cout << P[k].first.first << ',' << P[k].first.second << \\\" : \\\" << P[k].second << '\\\\n';\\n // std::cout << \\\"----------------\\\" << std::endl;\\n res = std::max(res, ans);\\n }\\n std::cout << res << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 8048,\n \"score_of_the_acc\": -0.1865,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2310_9999943\",\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\\nstruct node {\\n int x, y, val;\\n};\\nint cross(int x1, int y1, int x2, int y2) {\\n return x1 * y2 - x2 * y1;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int h, w;\\n cin >> h >> w;\\n vector<string> s(h);\\n rep(i, h) cin >> s[i];\\n reverse(all(s));\\n vector<node> v;\\n rep(i, h) rep(j, w) {\\n if(s[i][j] == '#') {\\n if(i == h - 1 or s[i + 1][j] == '.') {\\n v.push_back(node{j + 1, i + 1, 1});\\n v.push_back(node{j, i + 1, -1});\\n } \\n if(j == w - 1 or s[i][j + 1] == '.') {\\n v.push_back(node{j + 1, i, 1});\\n v.push_back(node{j + 1, i + 1, -1});\\n }\\n }\\n } \\n sort(all(v), [&](node a, node b) {\\n return cross(a.x, a.y, b.x, b.y) > 0;\\n });\\n int ans = 0, sum = 0;\\n int sz = v.size();\\n rep(i, sz) {\\n sum += v[i].val;\\n while(i + 1 < sz and cross(v[i].x, v[i].y, v[i + 1].x, v[i + 1].y) == 0) {\\n i ++;\\n sum += v[i].val;\\n }\\n ans = max(ans, sum);\\n }\\n cout << ans + 1 << endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 10336,\n \"score_of_the_acc\": -0.3643,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2310_9629481\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main() {\\n int h, w;\\n cin >> h >> w;\\n vector<string> v(h);\\n for (auto &i : v)\\n cin >> i;\\n reverse(v.begin(), v.end());\\n v.push_back(string(w, '.'));\\n for (auto &i : v)\\n i += '.';\\n map<long double, int> x;\\n for (int i = 0; i <= h; i++) {\\n for (int j = 0; j <= w; j++) {\\n if (i && v[i - 1][j] != v[i][j]) {\\n x[(long double) i / (j + 1)]++;\\n x[(long double) i / j]--;\\n }\\n if (j && v[i][j] != v[i][j - 1]) {\\n x[(long double) (i + 1) / j]--;\\n x[(long double) i / j]++;\\n }\\n }\\n }\\n int cnt = 0;\\n if (v[0][0] == '#')\\n cnt = 1;\\n int ans = cnt;\\n for (auto [_, t] : x) {\\n cnt += t;\\n ans = max(ans, cnt);\\n }\\n cout << ans / 2 + 1 << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 21032,\n \"score_of_the_acc\": -1.3448,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2310_9563250\",\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, M;\\n cin >> M >> N;\\n vector<vector<char>> C(N, vector<char>(M));\\n rrep(j,0,M) {\\n rep(i,0,N) cin >> C[i][j];\\n }\\n rep(i,0,N) C[i].push_back('.');\\n C.push_back(vector<char>(M+1,'.'));\\n int COUNT = 1;\\n rep(i,0,N) {\\n if (C[i][0] == '#' && C[i+1][0] == '.') COUNT++;\\n }\\n vector<pair<pair<int,int>,int>> V;\\n rep(i,1,N+1) {\\n rep(j,1,M+1) {\\n char a = C[i-1][j-1], b = C[i][j-1], c = C[i-1][j], d = C[i][j];\\n if (a == b && a != c && a == d) V.push_back({{i,j},1});\\n if (a != b && a == c && a == d) V.push_back({{i,j},-1});\\n }\\n }\\n sort(V.begin(), V.end(), [](pair<pair<int,int>,int> P1, pair<pair<int,int>,int> P2) {\\n if (P1.first.first * P2.first.second == P1.first.second * P2.first.first) return P1.second < P2.second;\\n return P1.first.second * P2.first.first < P1.first.first * P2.first.second;\\n });\\n int ANS = COUNT;\\n for (pair<pair<int,int>,int> P : V) {\\n COUNT += P.second;\\n chmax(ANS,COUNT);\\n }\\n cout << ANS << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5584,\n \"score_of_the_acc\": -0.0321,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2310_7219709\",\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;}\\n//vector<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}\\ntemplate<typename T> vector<T> inv_perm(const vector<T>&ord){\\n vector<T>inv(ord.size());\\n for(int i=0;i<ord.size();i++)inv[ord[i]] = i;\\n return inv;\\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\\ntemplate <typename F>\\nclass\\n#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\\n [[nodiscard]]\\n#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)\\nFixPoint final : private F\\n{\\npublic:\\n template <typename G>\\n explicit constexpr FixPoint(G&& g) noexcept\\n : F{std::forward<G>(g)}\\n {}\\n\\n template <typename... Args>\\n constexpr decltype(auto)\\n operator()(Args&&... args) const\\n#if !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\\n noexcept(noexcept(F::operator()(std::declval<FixPoint>(), std::declval<Args>()...)))\\n#endif // !defined(__GNUC__) || defined(__clang__) || __GNUC__ >= 9\\n {\\n return F::operator()(*this, std::forward<Args>(args)...);\\n }\\n}; // class FixPoint\\n\\n\\n#if defined(__cpp_deduction_guides)\\ntemplate <typename F>\\nFixPoint(F&&)\\n-> FixPoint<std::decay_t<F>>;\\n#endif // defined(__cpp_deduction_guides)\\n\\n\\nnamespace\\n{\\n template <typename F>\\n#if !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\\n # if defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\\n __attribute__((warn_unused_result))\\n# elif defined(_MSC_VER) && _MSC_VER >= 1700 && defined(_Check_return_)\\n _Check_return_\\n# endif // defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)\\n#endif // !defined(__has_cpp_attribute) || !__has_cpp_attribute(nodiscard)\\n inline constexpr decltype(auto)\\n makeFixPoint(F&& f) noexcept\\n {\\n return FixPoint<std::decay_t<F>>{std::forward<std::decay_t<F>>(f)};\\n }\\n} // namespace\\n\\nusing Real = long double;\\nusing Point = complex<Real>;\\nconst Real EPS = 1e-10, PI = acos((Real)(-1.0));\\n\\ninline bool eq(Real a, Real b) { return fabs(b - a) < EPS; }\\ninline bool eq(Point a, Point 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\\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\\nnamespace std {\\n bool operator<(const Point& a, const Point& b) {\\n return !eq(a.real(), b.real()) ? a.real() < b.real() : a.imag() < b.imag();\\n }\\n}\\n\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b): a(a), b(b) {}\\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\\nstruct Circle {\\n Point c;\\n Real r;\\n Circle() = default;\\n Circle(Point c, Real r): c(c), r(r) {}\\n\\n friend ostream &operator<<(ostream &os, Circle &c) {\\n return os << c.c << \\\": \\\" << c.r;\\n }\\n\\n friend istream &operator>>(istream &is, Circle &c) {\\n return is >> c.c >> c.r;\\n }\\n};\\n\\nReal cross(const Point &a, const Point &b) {\\n return real(a) * imag(b) - real(b) * imag(a);\\n}\\n\\nReal dot(const Point &a, const Point &b) {\\n return real(a) * real(b) + imag(a) * imag(b);\\n}\\n\\nstruct Segment : Line {\\n Segment() = default;\\n Segment(Point a, Point b) : Line(a, b) {}\\n};\\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\\n if (cross(b, c) < -EPS) return -1; // CLOCKWISE\\n if (dot(b, c) < 0) return +2; // ONLINE_BACK\\n if (norm(b) < norm(c)) return -2; // ONLINE_FRONT\\n return 0; // ON_SEGMENT\\n}\\n\\nbool intersect(const Segment &s, const Point &p) {\\n return ccw(s.a, s.b, p) == 0;\\n}\\n\\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\\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\\nint intersect(const Circle &c, const Circle &d) {\\n Real dis = fabs(c.c - d.c);\\n\\n if (dis > c.r + d.r + EPS) return 4;\\n else if (eq(dis, c.r + d.r)) return 3;\\n else if (eq(dis, abs(c.r - d.r))) return 1;\\n else if (dis + min(c.r, d.r) < max(c.r, d.r) - EPS) return 0;\\n else return 2;\\n}\\n\\nbool parallel(const Line &a, const Line &b) {\\n return abs(cross(a.b - a.a, b.b - b.a)) < EPS;\\n}\\n\\nbool orthogonal(const Line &a, const Line &b) {\\n return abs(dot(a.b - a.a, b.b - b.a)) < EPS;\\n}\\n\\nPoint projection(const Line& s, const Point &p) {\\n double 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\\nPoint projection(const Segment& l, const Point &p) {\\n return projection(Line(l), p);\\n}\\n\\nPoint reflection(const Line &l, const Point &p) {\\n Point r = projection(l, p);\\n return p + (r - p) * 2;\\n}\\n\\nReal distance(const Line &l, const Point &p) {\\n Point r = projection(l, p);\\n return fabs(p - r);\\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\\nReal distance(const Segment& a, const Segment& b) {\\n if (intersect(a, b)) return 0;\\n return min({\\n distance(a, b.a),\\n distance(a, b.b),\\n distance(b, a.a),\\n distance(b, a.b)\\n });\\n}\\n\\nbool contains(const Circle &c, const Point &p) {\\n if (fabs(c.c - p) < c.r + EPS) return true;\\n return false;\\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\\nPoint crosspoint(const Segment& l, const Segment& m) {\\n return crosspoint(Line(l), Line(m));\\n}\\n\\nLine bisector_of_angle(const Point& a, const Point& b, const Point& c) {\\n Real d_ab = fabs(a - b);\\n Real d_bc = fabs(b - c);\\n Point c_ = b + (c - b) * d_ab / d_bc;\\n\\n return Line(b, (a + c_) * 0.5);\\n}\\n\\nLine bisector(const Point& a, const Point& b) {\\n Point c = (a + b) * 0.5;\\n Point d = c + rotate(PI / 2, b - c);\\n\\n return Line(c, d);\\n}\\n\\nint intersect(const Circle &c, const Line &l) {\\n Real d = distance(l, c.c);\\n\\n if (d > c.r + EPS) return 0;\\n if (eq(d, c.r)) return 1;\\n return 2;\\n}\\n\\npair<Point, Point> crosspoint(const Circle& c, const Line& l) {\\n Real d = distance(l, c.c);\\n\\n Point p = projection(l, c.c);\\n if (intersect(c, l) == 1) return { p, p };\\n\\n Real d2 = sqrt(c.r * c.r - d * d);\\n Point v = (l.a - l.b) * (1.0 / fabs(l.a - l.b));\\n\\n return { p + d2 * v, p - d2 * v };\\n}\\n\\nvector<Point> crosspoint(const Circle &c, const Segment &s) {\\n int isect = intersect(c, Line(s));\\n if (isect == 0) return {};\\n\\n auto [p1, p2] = crosspoint(c, Line(s));\\n\\n vector<Point> res;\\n if (ccw(s.a, s.b, p1) == 0) res.push_back(p1);\\n if (ccw(s.a, s.b, p2) == 0) res.push_back(p2);\\n\\n if (res.size() == 2 && ccw(s.a, p1, p2) == 0) swap(res[0], res[1]);\\n return res;\\n}\\n\\npair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n Real d = fabs(c1.c - c2.c);\\n Real x1 = (c1.r * c1.r + d * d - c2.r * c2.r) / 2 / d;\\n Real y = sqrt(c1.r * c1.r - x1 * x1);\\n\\n Point base = (c2.c * x1 + c1.c * (d - x1)) * (1.0 / d);\\n Point v = rotate(PI / 2, c1.c - base);\\n v = v / fabs(v);\\n\\n return { base + v * y, base - v * y };\\n}\\n\\npair<Point, Point> tangent(const Circle &c, const Point &p) {\\n Real d = fabs(c.c - p);\\n Real d2 = sqrt(d * d - c.r * c.r);\\n Real a = acos(d2 / d);\\n\\n\\n Point q = c.c - p;\\n q = q / fabs(q);\\n\\n// cout << d << \\\" \\\" << d2 << \\\" \\\" << a << \\\" \\\" << q << endl;\\n return {\\n p + rotate(a, q) * d2,\\n p + rotate(-a, q) * d2\\n };\\n}\\n\\nvector<Segment> common_tangent(Circle c1, Circle c2) {\\n int isect = intersect(c1, c2);\\n Real d = fabs(c1.c - c2.c);\\n Point v = (c2.c - c1.c) / d;\\n\\n vector<Segment> res;\\n\\n if (isect == 0) {\\n return {};\\n } else if (isect == 1) {\\n auto [p1, p2] = crosspoint(c1, Line(c1.c, c2.c));\\n if (eq(fabs(p2 - c2.c), c2.r)) swap(p1, p2);\\n\\n Point v = p1 + rotate(PI/2, c2.c - p1);\\n return { Segment(p1, v) };\\n } else if (isect == 2) {\\n } else if (isect == 3) {\\n auto [p1, p2] = crosspoint(c1, c2);\\n res.emplace_back(p1, rotate(PI / 2, c1.c - p1) + p1);\\n } else {\\n Real a = d * c1.r / (c1.r + c2.r);\\n Point p = c1.c + v * a;\\n\\n Real d1 = sqrt(a * a - c1.r * c1.r), d2 = sqrt(norm(p - c2.c) - c2.r * c2.r);\\n Real theta = acos(d1 / a);\\n\\n// cout << d << endl;\\n// cout << a << \\\" \\\" << d1 << \\\" \\\" << d2 << \\\" \\\" << theta << \\\": \\\" << p << endl;\\n\\n Point e = (c1.c - p) * (1.0 / fabs(c1.c - p));\\n Point e1 = rotate(theta, e), e2 = rotate(-theta, e);\\n\\n res.emplace_back(p + e1 * d1, p - e1 * d2);\\n res.emplace_back(p + e2 * d1, p - e2 * d2);\\n }\\n\\n if (eq(c1.r, c2.r)) {\\n Point e = rotate(PI / 2, v);\\n res.push_back(Segment(c1.c + e * c1.r, c2.c + e * c1.r));\\n res.push_back(Segment(c1.c - e * c1.r, c2.c - e * c1.r));\\n return res;\\n }\\n\\n if (c1.r > c2.r) swap(c1, c2);\\n\\n v = c1.c - c2.c;\\n Point p = v * (1.0 / (c2.r - c1.r)) * c2.r + c2.c;\\n\\n auto [q1, q2] = tangent(c1, p);\\n res.emplace_back(q1, crosspoint(c2, Line(p, q1)).first);\\n res.emplace_back(q2, crosspoint(c2, Line(p, q2)).first);\\n\\n return res;\\n}\\n\\nusing Polygon = vector<Point>;\\n\\nistream& operator>>(istream& is, Polygon &p) {\\n for (int i = 0; i < p.size(); i++) is >> p[i];\\n return is;\\n}\\n\\nostream& operator<<(ostream& os, Polygon &p) {\\n for (int i = 0; i < p.size(); i++) os << p[i];\\n return os;\\n}\\n\\nReal area(const Polygon& p) {\\n Real res = 0;\\n for (int i = 0; i < p.size(); i++) {\\n res += cross(p[i], p[(i + 1) % p.size()]);\\n }\\n return abs(res)/2;\\n}\\n\\nReal arcarea(const Circle &c, const Point &p1_, const Point &p2_) {\\n Point p1 = p1_ - c.c, p2 = p2_ - c.c;\\n Real a2 = atan2(imag(p2), real(p2));\\n Point p = rotate(-a2, p1);\\n Real a1 = atan2(imag(p), real(p));\\n// cout << p1 << \\\" \\\" << p2 << \\\" --- \\\" << a2 << \\\" \\\" << a1 << endl;\\n return - a1 / 2 * c.r * c.r;\\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 Point a=g[i]-p,b=g[(i+1)%n]-p;\\n if(fabs(cross(a,b)) < EPS and dot(a,b) < EPS) return 1;\\n if(a.imag()>b.imag()) swap(a,b);\\n if(a.imag() < EPS and EPS < b.imag() and cross(a,b) > EPS ) {\\n// cout << a << \\\" --- \\\" << b << \\\": \\\" << cross(a, b) << endl;\\n x = !x;\\n }\\n }\\n return (x?2:0);\\n}\\n\\nPolygon convex_hull(Polygon Q) {\\n sort(ALL(Q));\\n\\n Polygon upper({Q[0]}), lower({Q[0]});\\n\\n rep(i, 1, Q.size()) {\\n while (upper.size() >= 2) {\\n int _ccw = ccw(upper[upper.size() - 2], upper[upper.size() - 1], Q[i]);\\n if (_ccw == 1) {\\n upper.pop_back();\\n } else {\\n break;\\n }\\n }\\n if (upper.size() <= 1) {\\n upper.push_back(Q[i]);\\n } else if (upper.size() > 1) {\\n int _ccw = ccw(upper[upper.size() - 2], upper[upper.size() - 1], Q[i]);\\n if (_ccw == -1 || _ccw == -2) {\\n upper.push_back(Q[i]);\\n }\\n }\\n }\\n rep(i, 1, Q.size()) {\\n while (lower.size() >= 2) {\\n int _ccw = ccw(lower[lower.size() - 2], lower[lower.size() - 1], Q[i]);\\n if (_ccw == -1) {\\n lower.pop_back();\\n } else {\\n break;\\n }\\n }\\n\\n if (lower.size() <= 1) {\\n lower.push_back(Q[i]);\\n } else if (lower.size() > 1) {\\n int _ccw = ccw(lower[lower.size() - 2], lower[lower.size() - 1], Q[i]);\\n if (_ccw == 1 || _ccw == -2) {\\n lower.push_back(Q[i]);\\n }\\n }\\n }\\n\\n Polygon ret;\\n\\n rep(i, 0, lower.size()) {\\n ret.push_back(lower[i]);\\n// cout << lower[i] << endl;\\n }\\n\\n// cout << \\\" | \\\" << endl;\\n\\n rrep(i, 0, upper.size()) {\\n if (!eq(lower[0], upper[i]) && !eq(lower.back(), upper[i]))\\n ret.push_back(upper[i]);\\n// cout << upper[i] << endl;\\n }\\n\\n int start = 0;\\n\\n// cout << ret.size() << endl;\\n rep(i, 0, ret.size()) {\\n if (ret[i].imag() < ret[start].imag() || (eq(ret[i].imag(), ret[start].imag()) && ret[i].real() < ret[start].real())) {\\n start = i;\\n }\\n }\\n\\n cout << ret.size() << endl;\\n rep(i, 0, ret.size()) {\\n auto p = ret[(i + start) % ret.size()];\\n cout << (int)p.real() << \\\" \\\" << (int)p.imag() << endl;\\n }\\n\\n return ret;\\n}\\n\\nReal closest_pair(vector<Point> &pts, int l, int r) {\\n int m = (l + r) / 2;\\n if (r - l <= 1) {\\n return INF;\\n } else if (r - l == 2) {\\n if (imag(pts[l]) > imag(pts[l + 1])) swap(pts[l], pts[l + 1]);\\n return fabs(pts[l] - pts[l + 1]);\\n }\\n\\n Real mid = pts[m].real();\\n Real d = min(closest_pair(pts, l, m), closest_pair(pts, m, r));\\n\\n inplace_merge(pts.begin() + l, pts.begin() + m, pts.begin() + r, [](const Point &a, const Point& b) {\\n return a.imag() < b.imag();\\n });\\n\\n vector<Point> ret;\\n\\n for (int i = l; i < r; i++) {\\n if (fabs(pts[i].real() - mid) >= d) continue;\\n\\n for (int j = ret.size() - 1; j >= 0; j--) {\\n if (fabs(imag(ret[j]) - imag(pts[i])) >= d) break;\\n chmin(d, fabs(ret[j] - pts[i]));\\n }\\n\\n ret.emplace_back(pts[i]);\\n }\\n\\n return d;\\n}\\n\\nint main() {\\n cout << fixed << setprecision(10);\\n\\n int H, W;\\n cin >> H >> W;\\n vector<string> s(H);\\n\\n rep(i, 0, H) cin >> s[i];\\n\\n ll res = 1;\\n ll cnt = 1;\\n\\n vector<P> pts;\\n rep(i, 0, H + 1) {\\n rep(j, 0, W + 1) {\\n if (i == 0 && j == 0) continue;\\n pts.emplace_back(i, j);\\n }\\n }\\n\\n auto same = [](P a, P b) {\\n return a.fi * b.se - b.fi * a.se == 0;\\n };\\n\\n auto cmp = [](const P &a, const P &b) {\\n return a.fi * b.se - b.fi * a.se > 0;\\n };\\n\\n sort(ALL(pts), cmp);\\n\\n auto in = [&](int y, int x) {\\n return 0 <= y && y < H && 0 <= x && x < W;\\n };\\n\\n auto tp = [&](int y, int x) {\\n string t(\\\"....\\\");\\n y = H - y;\\n if (in(y - 1, x - 1) && s[y - 1][x - 1] == '#') t[0] = '#';\\n if (in(y - 1, x) && s[y - 1][x] == '#') t[1] = '#';\\n if (in(y, x - 1) && s[y][x - 1] == '#') t[2] = '#';\\n if (in(y, x) && s[y][x] == '#') t[3] = '#';\\n// cout << y << \\\" \\\" << x << \\\": \\\" << t << endl;\\n\\n if (t == \\\"...#\\\" || t == \\\"###.\\\") return 1;\\n if (t == \\\"#...\\\" || t == \\\".###\\\") return -1;\\n return 0;\\n };\\n\\n rep(i, 0, pts.size()) {\\n cnt += tp(pts[i].fi, pts[i].se);\\n\\n while (i < pts.size() && same(pts[i], pts[i+1])) {\\n i++;\\n cnt += tp(pts[i].fi, pts[i].se);\\n }\\n// cout << cnt << endl;\\n chmax(res, cnt);\\n }\\n\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 13768,\n \"score_of_the_acc\": -0.6138,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2310_6984595\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <complex>\\n#include <random>\\nusing namespace std;\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vvvvll = vector<vvvll>;\\nusing vvvvvll = vector<vvvvll>;\\nusing vvvvvvll = vector<vvvvvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\nusing vvvvb = vector<vvvb>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\nusing vvvvd = vector<vvvd>;\\nusing vvvvvd = vector<vvvvd>;\\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#define tN(t) (t==1?XN:YN)\\n#define tS(t) (t==1?XS:YS)\\n#define tA(t) (t==1?XA:YA)\\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}\\nll sqrtz(ll N) {\\n ll L = 0;\\n ll R = sqrt(N) + 10000;\\n while (abs(R - L) > 1) {\\n ll mid = (R + L) / 2;\\n if (mid * mid <= N)L = mid;\\n else R = mid;\\n }\\n return L;\\n\\n}\\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 (n < k) return 0;\\n return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;\\n}\\n\\n\\n\\nll modPow(ll a, ll n, ll p) {\\n ll res = 1;\\n ll k = a;\\n while (n > 0) {\\n if (n % 2 == 1) {\\n res *= k;\\n if (res > p)res %= p;\\n }\\n k = k * k;\\n if (k > p)k %= p;\\n n /= 2;\\n }\\n return res;\\n}\\n\\nstruct quot {\\n ll de, nu;//de分母\\n quot() = default;\\n quot(ll nu, ll de) :de(de), nu(nu) { init(*this); }\\n quot(ll z) :de(1), nu(z) { init(*this); }\\n void init(quot& a) {\\n if (a.nu == 0) {\\n a.de = 1;\\n }\\n else {\\n ll g = GcD(a.de, a.nu);\\n a.de /= g;\\n a.nu /= g;\\n if (a.de < 0) {\\n a.de *= -1;\\n a.nu *= -1;\\n }\\n }\\n }\\n ll GcD(ll(a), ll(b)) {\\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\\n quot operator *(const quot& p) {\\n quot res;\\n res.de = this->de * p.de;\\n res.nu = this->nu * p.nu;\\n init(res);\\n return res;\\n };\\n quot operator +(const quot& p) {\\n quot res;\\n res.de = this->de * p.de;\\n res.nu = this->nu * p.de + this->de * p.nu;\\n init(res);\\n return res;\\n };\\n\\n quot operator-()const {\\n quot res;\\n res.de = this->de;\\n res.nu = -this->nu;\\n return res;\\n };\\n quot operator -(const quot& p) {\\n return *this + (-p);\\n };\\n quot inv(quot q) {\\n quot res;\\n res.de = q.nu;\\n res.nu = q.de;\\n return res;\\n }\\n quot operator/(const quot& q) {\\n return *this * inv(q);\\n }\\n\\n bool operator==(const quot& q) {\\n return (this->de == q.de && this->nu == q.nu);\\n }\\n\\n bool operator<(const quot& q)const {\\n return (this->nu * q.de - this->de * q.nu < 0);\\n }\\n bool operator>(const quot& q) {\\n return !(*this == q || *this < q);\\n }\\n\\n double tod(const quot& q) {\\n return (double(nu) / double(de));\\n }\\n\\n void print() {\\n cout << nu << \\\" \\\" << de << endl;\\n }\\n\\n void printd() {\\n cout << tod(*this) << endl;\\n }\\n};\\n\\n\\n\\n\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll H, W,an=0,m=1;\\n cin >> H >> W;\\n map<quot, ll> M;\\n vector<string> S(H + 2, \\\"\\\");\\n rep(w, W + 2)S[0].push_back('.'), S[H + 1].push_back('.');\\n rep(h, H) {\\n cin >> S[h+1];\\n S[h+1] = '.' + S[h+1] + '.';\\n }\\n rep(h, H + 1)rep(w, W + 1) {\\n ll cnt = 0;\\n rep(dh, 2)rep(dw, 2)cnt += (S[h + dh][w + dw] == '#');\\n if (cnt == 1) {\\n if (S[h][w] == '#')M[quot(H - h, w)]++;\\n else if (S[h + 1][w + 1] == '#')M[quot(H - h, w)]--;\\n }\\n if (cnt == 3) {\\n if (S[h][w] == '.')M[quot(H - h, w)]++;\\n else if (S[h + 1][w + 1] == '.')M[quot(H - h, w)]--;\\n }\\n }\\n for (auto p : M) {\\n m += p.second;\\n chmax(an, m);\\n }\\n cout << an << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 8116,\n \"score_of_the_acc\": -0.2252,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2310_6984578\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <complex>\\n#include <random>\\nusing namespace std;\\n//#include <atcoder/all>\\n//using namespace atcoder;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vvvvll = vector<vvvll>;\\nusing vvvvvll = vector<vvvvll>;\\nusing vvvvvvll = vector<vvvvvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\nusing vvvvb = vector<vvvb>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\nusing vvvvd = vector<vvvd>;\\nusing vvvvvd = vector<vvvvd>;\\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#define tN(t) (t==1?XN:YN)\\n#define tS(t) (t==1?XS:YS)\\n#define tA(t) (t==1?XA:YA)\\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}\\nll sqrtz(ll N) {\\n ll L = 0;\\n ll R = sqrt(N) + 10000;\\n while (abs(R - L) > 1) {\\n ll mid = (R + L) / 2;\\n if (mid * mid <= N)L = mid;\\n else R = mid;\\n }\\n return L;\\n\\n}\\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 (n < k) return 0;\\n return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;\\n}\\n\\n\\n\\nll modPow(ll a, ll n, ll p) {\\n ll res = 1;\\n ll k = a;\\n while (n > 0) {\\n if (n % 2 == 1) {\\n res *= k;\\n if (res > p)res %= p;\\n }\\n k = k * k;\\n if (k > p)k %= p;\\n n /= 2;\\n }\\n return res;\\n}\\n\\nstruct quot {\\n ll de, nu;//de分母\\n quot() = default;\\n quot(ll nu, ll de) :de(de), nu(nu) { init(*this); }\\n quot(ll z) :de(1), nu(z) { init(*this); }\\n void init(quot& a) {\\n if (a.nu == 0) {\\n a.de = 1;\\n }\\n else {\\n ll g = GcD(a.de, a.nu);\\n a.de /= g;\\n a.nu /= g;\\n if (a.de < 0) {\\n a.de *= -1;\\n a.nu *= -1;\\n }\\n }\\n }\\n ll GcD(ll(a), ll(b)) {\\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\\n quot operator *(const quot& p) {\\n quot res;\\n res.de = this->de * p.de;\\n res.nu = this->nu * p.nu;\\n init(res);\\n return res;\\n };\\n quot operator +(const quot& p) {\\n quot res;\\n res.de = this->de * p.de;\\n res.nu = this->nu * p.de + this->de * p.nu;\\n init(res);\\n return res;\\n };\\n\\n quot operator-()const {\\n quot res;\\n res.de = this->de;\\n res.nu = -this->nu;\\n return res;\\n };\\n quot operator -(const quot& p) {\\n return *this + (-p);\\n };\\n quot inv(quot q) {\\n quot res;\\n res.de = q.nu;\\n res.nu = q.de;\\n return res;\\n }\\n quot operator/(const quot& q) {\\n return *this * inv(q);\\n }\\n\\n bool operator==(const quot& q) {\\n return (this->de == q.de && this->nu == q.nu);\\n }\\n\\n bool operator<(const quot& q)const {\\n return (this->nu * q.de - this->de * q.nu < 0);\\n }\\n bool operator>(const quot& q) {\\n return !(*this == q || *this < q);\\n }\\n\\n double tod(const quot& q) {\\n return (double(nu) / double(de));\\n }\\n\\n void print() {\\n cout << nu << \\\" \\\" << de << endl;\\n }\\n\\n void printd() {\\n cout << tod(*this) << endl;\\n }\\n};\\n\\n\\n\\n\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll H, W;\\n cin >> H >> W;\\n map<quot, ll> M;\\n vector<string> S(H + 2, \\\"\\\");\\n rep(w, W + 2)S[0].push_back('.'), S[H + 1].push_back('.');\\n rep(h, H) {\\n cin >> S[h+1];\\n S[h+1] = '.' + S[h+1] + '.';\\n }\\n rep(h, H + 1) {\\n rep(w, W + 1) {\\n ll cnt = 0;\\n rep(dh, 2)rep(dw, 2) {\\n cnt += (S[h + dh][w + dw] == '#');\\n \\n }\\n if (cnt == 1) {\\n if (S[h][w] == '#') {\\n M[quot(H - h, w)]++;\\n }\\n else if (S[h + 1][w + 1] == '#') {\\n M[quot(H - h, w)]--;\\n }\\n }\\n if (cnt == 3) {\\n if (S[h][w] == '.') {\\n M[quot(H - h, w)]++;\\n }\\n else if (S[h + 1][w + 1] == '.') {\\n M[quot(H - h, w)]--;\\n }\\n }\\n }\\n }\\n ll an = 0;\\n ll m = 1;\\n for (auto p : M) {\\n m += p.second;\\n chmax(an, m);\\n }\\n cout << an << endl;\\n\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 8288,\n \"score_of_the_acc\": -0.236,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2310_6666218\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// template {{{\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\n\\n#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)\\n#define rrange(i, l, r) for (i64 i = (i64)(r) - 1; i >= (i64)(l); (i) -= 1)\\n\\n#define whole(f, x, ...) ([&](decltype((x)) container) { return (f)( begin(container), end(container), ## __VA_ARGS__); })(x)\\n#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)\\n\\n#define debug(x) cerr << \\\"(\\\" << __LINE__ << \\\")\\\" << #x << \\\": \\\" << (x) << endl\\n\\nconstexpr i32 inf = 1001001001;\\nconstexpr i64 infll = 1001001001001001001ll;\\n\\nconstexpr i32 dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; \\nconstexpr i32 dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};\\n\\nstruct IoSetup { IoSetup(i32 x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;\\n\\ntemplate <typename T = i64> T input() { T x; cin >> x; return x; }\\n\\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != (int)v.size() ? \\\" \\\" : \\\"\\\"); } return os; } \\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }\\n\\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; }\\n\\ntemplate <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }\\ntemplate <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }\\n\\ntemplate <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\ntemplate <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\\n// }}}\\n\\nnamespace intgeometry2d {\\n using isize = std::ptrdiff_t;\\n using usize = std::size_t;\\n\\n using i32 = std::int_fast32_t;\\n using i64 = std::int_fast64_t;\\n using u32 = std::uint_fast32_t;\\n using u64 = std::uint_fast64_t;\\n} // intgeometry2d\\n\\nnamespace intgeometry2d {\\n\\n template< typename Z >\\n class lattice_point {\\n Z x_, y_;\\n\\n public:\\n lattice_point() {}\\n lattice_point(Z x_, Z y_) : x_(x_), y_(y_) {}\\n \\n Z x() const { return x_; }\\n Z y() const { return y_; }\\n\\n bool operator==(const lattice_point &p) const { return x_ == p.x_ and y_ == p.y_; }\\n bool operator!=(const lattice_point &p) const { return x_ != p.x_ or y_ != p.y_; }\\n\\n lattice_point operator+(lattice_point p) { return lattice_point(x_ + p.x_, y_ + p.y_); }\\n lattice_point operator-(lattice_point p) { return lattice_point(x_ - p.x_, y_ - p.y_); }\\n\\n Z norm() const { return x_ * x_ + y_ * y_; }\\n };\\n\\n} // intgeometry2d\\n\\nnamespace intgeometry2d {\\n\\n template< typename Z >\\n Z det(const lattice_point<Z> &a, const lattice_point<Z> &b) {\\n return a.x() * b.y() - a.y() * b.x();\\n }\\n\\n} // intgeometry2d\\n\\nnamespace intgeometry2d {\\n template< typename Z >\\n bool argcmp(const lattice_point<Z> &a, const lattice_point<Z> &b) {\\n using std::pair;\\n bool fa = pair(a.y(), a.x()) < pair<Z, Z>(0, 0);\\n bool fb = pair(b.y(), b.x()) < pair<Z, Z>(0, 0);\\n Z d = det(a, b);\\n return fa != fb ? fa < fb : (d == 0 ? a.norm() < b.norm() : d > 0);\\n }\\n} // intgeometry2d\\n\\nvoid solve() {\\n int h = input(), w = input();\\n\\n auto cs = make_vector(h + 2, w + 2, '.');\\n range(i, 1, h + 1) range(j, 1, w + 1) {\\n cin >> cs[i][j];\\n }\\n\\n using point = intgeometry2d::lattice_point<i32>;\\n vector< pair<point, int> > pts;\\n rrange(i, 0, h + 1) range(j, 0, w + 1) {\\n // cs[ i ][j] cs[ i ][j+1]\\n // cs[i+1][j] cs[i+1][j+1]\\n // centor: (h - i, j) ?\\n auto is_dot = [](char c) {\\n return '.' == c;\\n };\\n\\n bool ul = is_dot(cs[i][j]);\\n bool ur = is_dot(cs[i][j + 1]);\\n bool dl = is_dot(cs[i + 1][j]);\\n bool dr = is_dot(cs[i + 1][j + 1]);\\n\\n // split pattern:\\n // #. .#\\n // .. or ##\\n if ((ul != ur) and (ur == dl) and (dl == dr)) {\\n pts.emplace_back(point(h - i, j), -1);\\n }\\n\\n // merge pattern:\\n // .. ##\\n // .# or #.\\n if (ul == ur and ur == dl and dl != dr) {\\n pts.emplace_back(point(h - i, j), 1);\\n }\\n }\\n\\n pts.emplace_back(point(-1, -1), 0);\\n\\n auto cmp = [](pair<point, int> &a, pair<point, int> &b) {\\n return intgeometry2d::argcmp(a.first, b.first);\\n };\\n whole(sort, pts, cmp);\\n\\n int ans = 1;\\n int cnt = 2;\\n range(i, 1, pts.size()) {\\n point pre = pts[i - 1].first;\\n point pt = pts[i].first;\\n if (intgeometry2d::det(pre, pt)) {\\n chmax(ans, cnt);\\n }\\n\\n cnt += pts[i].second;\\n }\\n\\n cout << ans << endl;\\n}\\n\\nsigned main() {\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5156,\n \"score_of_the_acc\": -0.0053,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2310_6652175\",\n \"code_snippet\": \"#include <bits/extc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define reps(i,s,n) for(int i=(s);i<=(n);++i)\\n#define all(x) begin(x), end(x)\\n#define Fixed fixed << setprecision(12)\\n#define int int64_t\\nusing pii = pair<int,int>;\\nconstexpr int32_t INF = 0x3f3f3f3f;\\nconstexpr int64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\\nconstexpr int mod1 = 1e9+7;\\nconstexpr int mod2 = 998244353;\\n\\ntemplate <class Func>\\nclass FixPoint : Func {\\npublic:\\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\\n\\n template <class... Args>\\n constexpr decltype(auto) operator()(Args&&... args) const {\\n return Func::operator()(*this, std::forward<Args>(args)...);\\n }\\n};\\n\\ntemplate <class Func>\\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\\n return FixPoint<Func>{forward<Func>(f)};\\n}\\n\\ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\\n\\ntemplate <class T> using max_heap = priority_queue<T>;\\ntemplate <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;\\ntemplate <class A, class B> using umap = unordered_map<A,B>;\\n\\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\\n\\ntemplate <class T> inline void bye(T x) { cout << x << '\\\\n'; exit(0); }\\n\\ninline int updiv(int a,int b){ return (a + b - 1) / b; }\\n\\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\\n\\n\\nsigned main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n int h, w;\\n cin >> h >> w;\\n\\n vector<string> mat(h);\\n\\n for (int i = 0; i < h; ++i) cin >> mat[i];\\n reverse(all(mat));\\n\\n vector<pair<int, int> > points;\\n\\n auto inside = [&](int y, int x) {\\n return (0 <= y && y < h && 0 <= x && x < w);\\n };\\n\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n if (mat[i][j] != '#') continue;\\n for (int k = 4; k < 8; ++k) {\\n vector<bool> flg(4);\\n int y = i + dy[k], x = j + dx[k];\\n if (inside(y, x) && mat[y][x] != '.') continue;\\n if (y == -1 && x == -1) continue;\\n // cout << i << ' ' << j << \\\" : \\\" << y << ' ' << x << '\\\\n';\\n for (int s = 0; s < 4; ++s) {\\n int ty = y + dy[s], tx = x + dx[s];\\n if (inside(ty, tx) && mat[ty][tx] == '#') {\\n flg[s] = true;\\n }\\n }\\n if (k == 4) {\\n if (flg[1] == flg[2]) points.emplace_back(i + 1, j + 1);\\n } else if (k == 5) {\\n if (flg[3] == flg[2]) points.emplace_back(i, j + 1);\\n } else if (k == 6) {\\n if (flg[0] == flg[3]) points.emplace_back(i, j);\\n } else {\\n if (flg[0] == flg[1]) points.emplace_back(i + 1, j);\\n }\\n }\\n }\\n }\\n\\n sort(all(points), [](const auto &a, const auto &b) -> bool {\\n return (atan2l(a.first, a.second) < atan2l(b.first, b.second));\\n });\\n\\n points.erase(unique(all(points)), points.end());\\n\\n // for (auto [y, x] : points) {\\n // cout << y << ' ' << x << ' ' << atan2l(y, x) << '\\\\n';\\n // }\\n\\n vector<vector<pair<int, int> > > points2;\\n\\n for (auto [y, x] : points) {\\n if (points2.empty() || atan2l(points2.back().back().first, points2.back().back().second) != atan2l(y, x)) {\\n points2.emplace_back(vector<pair<int, int> >(1, make_pair(y, x)));\\n } else {\\n points2.back().emplace_back(y, x);\\n }\\n }\\n\\n for (auto &v : points2) {\\n sort(all(v), [](const auto &a, const auto &b) {\\n return (a.second != b.second ? a.second < b.second : a.first < b.first);\\n });\\n }\\n\\n auto Tile = [&](int y, int x) {\\n return !(!inside(y, x) || mat[y][x] == '.');\\n };\\n auto Type = [&](int y, int x) {\\n if (Tile(y - 1, x - 1)) {\\n if (Tile(y - 1, x) && Tile(y, x - 1)) return (0);\\n if (!Tile(y - 1, x) && !Tile(y, x - 1)) return (1);\\n }\\n if (Tile(y, x - 1)) {\\n if (Tile(y, x) && Tile(y - 1, x - 1)) return (2);\\n if (!Tile(y, x) && !Tile(y - 1, x - 1)) return (3);\\n }\\n if (Tile(y, x)) {\\n if (Tile(y, x - 1) && Tile(y - 1, x)) return (4);\\n if (!Tile(y, x - 1) && !Tile(y - 1, x)) return (5);\\n }\\n if (Tile(y - 1, x)) {\\n if (Tile(y, x) && Tile(y - 1, x - 1)) return (6); \\n if (!Tile(y, x) && !Tile(y - 1, x - 1)) return (7);\\n }\\n return (-1);\\n };\\n\\n int sz = points2.size(), cnt = 0, res = 0;\\n for (int i = 0; i < sz - 1; ++i) {\\n for (auto [y, x] : points2[i]) {\\n // cout << y << ' ' << x << '\\\\n';\\n switch (Type(y, x)) {\\n case 0:\\n break;\\n case 1:\\n break;\\n case 2:\\n cnt -= 2;\\n break;\\n case 3:\\n cnt += 2;\\n break;\\n case 4:\\n break;\\n case 5:\\n break;\\n case 6:\\n cnt += 2;\\n break;\\n case 7:\\n cnt -= 2;\\n break;\\n default:\\n // cout << \\\"Error\\\\n\\\";\\n break;\\n }\\n }\\n // cout << \\\"-----\\\\n>\\\";\\n // cout << cnt << '\\\\n';\\n // cout << \\\"-----\\\\n\\\";\\n chmax(res, cnt);\\n }\\n\\n cout << res / 2 + 1 << '\\\\n';\\n\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 12912,\n \"score_of_the_acc\": -1.4912,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2310_6624406\",\n \"code_snippet\": \"#include <bits/extc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i,n) for(int i=0;i<(n);++i)\\n#define reps(i,s,n) for(int i=(s);i<=(n);++i)\\n#define all(x) begin(x), end(x)\\n#define Fixed fixed << setprecision(12)\\n#define int int64_t\\nusing pii = pair<int,int>;\\nconstexpr int32_t INF = 0x3f3f3f3f;\\nconstexpr int64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\\nconstexpr int mod1 = 1e9+7;\\nconstexpr int mod2 = 998244353;\\n\\ntemplate <class Func>\\nclass FixPoint : Func {\\npublic:\\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\\n\\n template <class... Args>\\n constexpr decltype(auto) operator()(Args&&... args) const {\\n return Func::operator()(*this, std::forward<Args>(args)...);\\n }\\n};\\n\\ntemplate <class Func>\\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\\n return FixPoint<Func>{forward<Func>(f)};\\n}\\n\\ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\\n\\ntemplate <class T> using max_heap = priority_queue<T>;\\ntemplate <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;\\ntemplate <class A, class B> using umap = unordered_map<A,B>;\\n\\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\\n\\ntemplate <class T> inline void bye(T x) { cout << x << '\\\\n'; exit(0); }\\n\\ninline int updiv(int a,int b){ return (a + b - 1) / b; }\\n\\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\\n\\n\\nsigned main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n int h, w;\\n cin >> h >> w;\\n\\n vector<string> mat(h);\\n\\n for (int i = 0; i < h; ++i) cin >> mat[i];\\n reverse(all(mat));\\n\\n vector<pair<int, int> > points;\\n\\n auto inside = [&](int y, int x) {\\n return (0 <= y && y < h && 0 <= x && x < w);\\n };\\n\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n if (mat[i][j] != '#') continue;\\n for (int k = 4; k < 8; ++k) {\\n vector<bool> flg(4);\\n int y = i + dy[k], x = j + dx[k];\\n if (inside(y, x) && mat[y][x] != '.') continue;\\n if (y == -1 && x == -1) continue;\\n // cout << i << ' ' << j << \\\" : \\\" << y << ' ' << x << '\\\\n';\\n for (int s = 0; s < 4; ++s) {\\n int ty = y + dy[s], tx = x + dx[s];\\n if (inside(ty, tx) && mat[ty][tx] == '#') {\\n flg[s] = true;\\n }\\n }\\n if (k == 4) {\\n if (flg[1] == flg[2]) points.emplace_back(i + 1, j + 1);\\n } else if (k == 5) {\\n if (flg[3] == flg[2]) points.emplace_back(i, j + 1);\\n } else if (k == 6) {\\n if (flg[0] == flg[3]) points.emplace_back(i, j);\\n } else {\\n if (flg[0] == flg[1]) points.emplace_back(i + 1, j);\\n }\\n }\\n }\\n }\\n\\n sort(all(points), [](const auto &a, const auto &b) -> bool {\\n return (atan2l(a.first, a.second) < atan2l(b.first, b.second));\\n });\\n\\n points.erase(unique(all(points)), points.end());\\n\\n // for (auto [y, x] : points) {\\n // cout << y << ' ' << x << ' ' << atan2l(y, x) << '\\\\n';\\n // }\\n\\n vector<vector<pair<int, int> > > points2;\\n\\n for (auto [y, x] : points) {\\n if (points2.empty() || atan2l(points2.back().back().first, points2.back().back().second) != atan2l(y, x)) {\\n points2.emplace_back(vector<pair<int, int> >(1, make_pair(y, x)));\\n } else {\\n points2.back().emplace_back(y, x);\\n }\\n }\\n\\n for (auto &v : points2) {\\n sort(all(v), [](const auto &a, const auto &b) {\\n return (a.second != b.second ? a.second < b.second : a.first < b.first);\\n });\\n }\\n\\n auto Tile = [&](int y, int x) {\\n return !(!inside(y, x) || mat[y][x] == '.');\\n };\\n auto Type = [&](int y, int x) {\\n if (Tile(y - 1, x - 1)) {\\n if (Tile(y - 1, x) && Tile(y, x - 1)) return (0);\\n if (!Tile(y - 1, x) && !Tile(y, x - 1)) return (1);\\n }\\n if (Tile(y, x - 1)) {\\n if (Tile(y, x) && Tile(y - 1, x - 1)) return (2);\\n if (!Tile(y, x) && !Tile(y - 1, x - 1)) return (3);\\n }\\n if (Tile(y, x)) {\\n if (Tile(y, x - 1) && Tile(y - 1, x)) return (4);\\n if (!Tile(y, x - 1) && !Tile(y - 1, x)) return (5);\\n }\\n if (Tile(y - 1, x)) {\\n if (Tile(y, x) && Tile(y - 1, x - 1)) return (6); \\n if (!Tile(y, x) && !Tile(y - 1, x - 1)) return (7);\\n }\\n return (-1);\\n };\\n\\n int sz = points2.size(), cnt = 0, res = 0;\\n for (int i = 0; i < sz - 1; ++i) {\\n for (auto [y, x] : points2[i]) {\\n // cout << y << ' ' << x << '\\\\n';\\n switch (Type(y, x)) {\\n case 0:\\n break;\\n case 1:\\n break;\\n case 2:\\n cnt -= 2;\\n break;\\n case 3:\\n cnt += 2;\\n break;\\n case 4:\\n break;\\n case 5:\\n break;\\n case 6:\\n cnt += 2;\\n break;\\n case 7:\\n cnt -= 2;\\n break;\\n default:\\n // cout << \\\"Error\\\\n\\\";\\n break;\\n }\\n }\\n // cout << \\\"-----\\\\n>\\\";\\n // cout << cnt << '\\\\n';\\n // cout << \\\"-----\\\\n\\\";\\n chmax(res, cnt);\\n }\\n\\n cout << res / 2 + 1 << '\\\\n';\\n\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 13512,\n \"score_of_the_acc\": -1.5288,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2310_6620054\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define int ll\\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 per(i, N) for(int i = N-1; i >= 0; --i)\\n#define per1(i, N) for(int i = N; i >= 1; --i)\\n#define FOR(i, f, t) for(int i = f; i < (int)t; ++i)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bit(n) (1ll << (n))\\n#define pcnt(n) (__builtin_popcount(n))\\n#define TakAo(ans) ans ? cout << \\\"Takahashi\\\\n\\\" : cout << \\\"Aoki\\\\n\\\"\\n#define YesNo(ans) ans ? cout << \\\"Yes\\\\n\\\" : cout << \\\"No\\\\n\\\"\\n#define endl '\\\\n'\\n#define fi first\\n#define se second\\n#define mkpr make_pair\\n#define mktpl make_tuple\\n#define eb emplace_back\\n\\nusing namespace std;\\nusing ll = int64_t;\\nusing ull = uint64_t;\\nusing ld = long double;\\nusing point = struct{ ll x, y; };\\ntemplate<class T> using max_heap = priority_queue<T>;\\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vec<vec<T>>;\\ntemplate<class T> using vvvec = vec<vec<vec<T>>>;\\ntemplate<class T> using vvvvec = vec<vec<vec<vec<T>>>>;\\n\\nconstexpr ld EPS = 1e-10;\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr int MOD = 1e9+7;\\n//constexpr ll MOD = 998244353;\\nconstexpr int div2 = (MOD + 1) >> 1;\\nconstexpr int NIL = -1;\\nconstexpr int pm[2] = {1, -1};\\nconstexpr int dy[4] = {0, 1, 0, -1};\\nconstexpr int dx[4] = {1, 0, -1, 0};\\n\\nll cel(ll a, ll b){ return (a + b - 1) / b;}\\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : a;}\\ntemplate<class T> T powi(T x, ll exp){\\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : 1;\\n}\\nll modpow(ll x, ll exp, ll mod){\\n x %= mod;\\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\\n}\\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\\n\\nusing P = pair<ll, ll>;\\nusing Tpl = tuple<int, int, int, int>;\\n\\nbool comp(pair<point, ll> &a, pair<point, ll> &b){\\n return a.fi.x * b.fi.y < a.fi.y * b.fi.x;\\n}\\n\\nbool eq(pair<point, ll> &a, pair<point, ll> &b){\\n return a.fi.x * b.fi.y == a.fi.y * b.fi.x;\\n}\\n\\nvoid Main(){\\n int H, W; cin >> H >> W;\\n vvec<char> G(H + 10, vec<char>(W + 10, '.'));\\n rep(i, H){\\n rep(j, W) cin >> G[i + 1][j + 1];\\n }\\n vec<pair<point, ll>> XY;\\n\\n rep(i, H){\\n rep(j, W){\\n if(G[i + 1][j + 1] == '#'){\\n if(G[i][j] == '.' && G[i + 1][j] == '.' && G[i][j + 1] == '.'){\\n XY.eb(mkpr(point{j, H - i}, 1));\\n }\\n }\\n else{\\n if(G[i][j] == '#' && G[i + 1][j] == '#' && G[i][j + 1] == '#'){\\n XY.eb(mkpr(point{j, H - i}, 1));\\n }\\n }\\n }\\n }\\n rep(i, H){\\n rep(j, W){\\n if(G[i + 1][j + 1] == '#'){\\n if(G[i + 2][j + 2] == '.' && G[i + 2][j + 1] == '.' && G[i + 1][j + 2] == '.'){\\n XY.eb(mkpr(point{j + 1, H - i - 1}, -1));\\n }\\n }\\n else{\\n if(G[i + 2][j + 2] == '#' && G[i + 2][j + 1] == '#' && G[i + 1][j + 2] == '#'){\\n XY.eb(mkpr(point{j + 1, H - i - 1}, -1));\\n }\\n }\\n }\\n }\\n if(int(XY.size()) == 0){\\n cout << 0 << endl;\\n return;\\n }\\n\\n sort(all(XY), comp);\\n\\n /* \\n for(auto it : XY){\\n cout << it.fi.x << \\\" \\\" << it.fi.y << \\\" \\\" << it.se << endl;\\n }\\n */\\n \\n int M = int(XY.size());\\n pair<point, ll> prev = XY[0];\\n int cnt = 2;\\n int ans = 0;\\n rep(i, M){\\n if(i == 0) continue;\\n if(eq(XY[i], prev)){\\n cnt += XY[i].se;\\n prev = XY[i];\\n }\\n else{\\n chmax(ans, cnt);\\n //cout << cnt << endl;\\n cnt += XY[i].se;\\n prev = XY[i];\\n }\\n }\\n cout << ans << endl;\\n}\\n\\nsigned main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7868,\n \"score_of_the_acc\": -0.1752,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2310_6620030\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define int ll\\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 per(i, N) for(int i = N-1; i >= 0; --i)\\n#define per1(i, N) for(int i = N; i >= 1; --i)\\n#define FOR(i, f, t) for(int i = f; i < (int)t; ++i)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bit(n) (1ll << (n))\\n#define pcnt(n) (__builtin_popcount(n))\\n#define TakAo(ans) ans ? cout << \\\"Takahashi\\\\n\\\" : cout << \\\"Aoki\\\\n\\\"\\n#define YesNo(ans) ans ? cout << \\\"Yes\\\\n\\\" : cout << \\\"No\\\\n\\\"\\n#define endl '\\\\n'\\n#define fi first\\n#define se second\\n#define mkpr make_pair\\n#define mktpl make_tuple\\n#define eb emplace_back\\n\\nusing namespace std;\\nusing ll = int64_t;\\nusing ull = uint64_t;\\nusing ld = long double;\\nusing point = struct{ ll x, y; };\\ntemplate<class T> using max_heap = priority_queue<T>;\\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vec<vec<T>>;\\ntemplate<class T> using vvvec = vec<vec<vec<T>>>;\\ntemplate<class T> using vvvvec = vec<vec<vec<vec<T>>>>;\\n\\nconstexpr ld EPS = 1e-10;\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr int MOD = 1e9+7;\\n//constexpr ll MOD = 998244353;\\nconstexpr int div2 = (MOD + 1) >> 1;\\nconstexpr int NIL = -1;\\nconstexpr int pm[2] = {1, -1};\\nconstexpr int dy[4] = {0, 1, 0, -1};\\nconstexpr int dx[4] = {1, 0, -1, 0};\\n\\nll cel(ll a, ll b){ return (a + b - 1) / b;}\\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : a;}\\ntemplate<class T> T powi(T x, ll exp){\\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : 1;\\n}\\nll modpow(ll x, ll exp, ll mod){\\n x %= mod;\\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\\n}\\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\\n\\nusing P = pair<ll, ll>;\\nusing Tpl = tuple<int, int, int, int>;\\n\\nbool comp(pair<point, ll> &a, pair<point, ll> &b){\\n return a.fi.x * b.fi.y < a.fi.y * b.fi.x;\\n}\\n\\nbool eq(pair<point, ll> &a, pair<point, ll> &b){\\n return a.fi.x * b.fi.y == a.fi.y * b.fi.x;\\n}\\n\\nvoid Main(){\\n int H, W; cin >> H >> W;\\n vvec<char> G(H + 10, vec<char>(W + 10, '.'));\\n rep(i, H){\\n rep(j, W) cin >> G[i + 1][j + 1];\\n }\\n vec<pair<point, ll>> XY;\\n\\n rep(i, H){\\n rep(j, W){\\n if(G[i + 1][j + 1] == '#'){\\n if(G[i][j] == '.' && G[i + 1][j] == '.' && G[i][j + 1] == '.'){\\n XY.eb(mkpr(point{j, H - i}, 1));\\n }\\n }\\n else{\\n if(G[i][j] == '#' && G[i + 1][j] == '#' && G[i][j + 1] == '#'){\\n XY.eb(mkpr(point{j, H - i}, 1));\\n }\\n }\\n }\\n }\\n rep(I, H){\\n rep(j, W){\\n if(G[I + 1][j + 1] == '#'){\\n if(G[I + 2][j + 2] == '.' && G[I + 2][j + 1] == '.' && G[I + 1][j + 2] == '.'){\\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\\n }\\n }\\n else{\\n if(G[I + 2][j + 2] == '#' && G[I + 2][j + 1] == '#' && G[I + 1][j + 2] == '#'){\\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\\n }\\n }\\n }\\n }\\n if(int(XY.size()) == 0){\\n cout << 0 << endl;\\n return;\\n }\\n\\n sort(all(XY), comp);\\n\\n /* \\n for(auto it : XY){\\n cout << it.fi.x << \\\" \\\" << it.fi.y << \\\" \\\" << it.se << endl;\\n }\\n */\\n \\n int M = int(XY.size());\\n pair<point, ll> prev = XY[0];\\n int cnt = 2;\\n int ans = 0;\\n rep(i, M){\\n if(i == 0) continue;\\n if(eq(XY[i], prev)){\\n cnt += XY[i].se;\\n prev = XY[i];\\n }\\n else{\\n chmax(ans, cnt);\\n //cout << cnt << endl;\\n cnt += XY[i].se;\\n prev = XY[i];\\n }\\n }\\n cout << ans << endl;\\n}\\n\\nsigned main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7980,\n \"score_of_the_acc\": -0.1822,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2310_6620029\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define int ll\\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 per(i, N) for(int i = N-1; i >= 0; --i)\\n#define per1(i, N) for(int i = N; i >= 1; --i)\\n#define FOR(i, f, t) for(int i = f; i < (int)t; ++i)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bit(n) (1ll << (n))\\n#define pcnt(n) (__builtin_popcount(n))\\n#define TakAo(ans) ans ? cout << \\\"Takahashi\\\\n\\\" : cout << \\\"Aoki\\\\n\\\"\\n#define YesNo(ans) ans ? cout << \\\"Yes\\\\n\\\" : cout << \\\"No\\\\n\\\"\\n#define endl '\\\\n'\\n#define fi first\\n#define se second\\n#define mkpr make_pair\\n#define mktpl make_tuple\\n#define eb emplace_back\\n\\nusing namespace std;\\nusing ll = int64_t;\\nusing ull = uint64_t;\\nusing ld = long double;\\nusing point = struct{ ll x, y; };\\ntemplate<class T> using max_heap = priority_queue<T>;\\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vec<vec<T>>;\\ntemplate<class T> using vvvec = vec<vec<vec<T>>>;\\ntemplate<class T> using vvvvec = vec<vec<vec<vec<T>>>>;\\n\\nconstexpr ld EPS = 1e-10;\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr int MOD = 1e9+7;\\n//constexpr ll MOD = 998244353;\\nconstexpr int div2 = (MOD + 1) >> 1;\\nconstexpr int NIL = -1;\\nconstexpr int pm[2] = {1, -1};\\nconstexpr int dy[4] = {0, 1, 0, -1};\\nconstexpr int dx[4] = {1, 0, -1, 0};\\n\\nll cel(ll a, ll b){ return (a + b - 1) / b;}\\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : a;}\\ntemplate<class T> T powi(T x, ll exp){\\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : 1;\\n}\\nll modpow(ll x, ll exp, ll mod){\\n x %= mod;\\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\\n}\\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\\n\\nusing P = pair<ll, ll>;\\nusing Tpl = tuple<int, int, int, int>;\\n\\nbool comp(pair<point, ll> &a, pair<point, ll> &b){\\n return a.fi.x * b.fi.y < a.fi.y * b.fi.x;\\n}\\n\\nbool eq(pair<point, ll> &a, pair<point, ll> &b){\\n return a.fi.x * b.fi.y == a.fi.y * b.fi.x;\\n}\\n\\nvoid Main(){\\n int H, W; cin >> H >> W;\\n vvec<char> G(H + 700, vec<char>(W + 700, '.'));\\n rep(i, H){\\n rep(j, W) cin >> G[i + 1][j + 1];\\n }\\n vec<pair<point, ll>> XY;\\n\\n rep(i, H){\\n rep(j, W){\\n if(G[i + 1][j + 1] == '#'){\\n if(G[i][j] == '.' && G[i + 1][j] == '.' && G[i][j + 1] == '.'){\\n XY.eb(mkpr(point{j, H - i}, 1));\\n }\\n }\\n else{\\n if(G[i][j] == '#' && G[i + 1][j] == '#' && G[i][j + 1] == '#'){\\n XY.eb(mkpr(point{j, H - i}, 1));\\n }\\n }\\n }\\n }\\n rep(I, H){\\n rep(j, W){\\n if(G[I + 1][j + 1] == '#'){\\n if(G[I + 2][j + 2] == '.' && G[I + 2][j + 1] == '.' && G[I + 1][j + 2] == '.'){\\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\\n }\\n }\\n else{\\n if(G[I + 2][j + 2] == '#' && G[I + 2][j + 1] == '#' && G[I + 1][j + 2] == '#'){\\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\\n }\\n }\\n }\\n }\\n if(int(XY.size()) == 0){\\n cout << 0 << endl;\\n return;\\n }\\n\\n sort(all(XY), comp);\\n\\n /* \\n for(auto it : XY){\\n cout << it.fi.x << \\\" \\\" << it.fi.y << \\\" \\\" << it.se << endl;\\n }\\n */\\n \\n int M = int(XY.size());\\n pair<point, ll> prev = XY[0];\\n int cnt = 2;\\n int ans = 0;\\n rep(i, M){\\n if(i == 0) continue;\\n if(eq(XY[i], prev)){\\n cnt += XY[i].se;\\n prev = XY[i];\\n }\\n else{\\n chmax(ans, cnt);\\n //cout << cnt << endl;\\n cnt += XY[i].se;\\n prev = XY[i];\\n }\\n }\\n cout << ans << endl;\\n}\\n\\nsigned main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 8656,\n \"score_of_the_acc\": -0.2246,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2310_6619556\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define int ll\\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 per(i, N) for(int i = N-1; i >= 0; --i)\\n#define per1(i, N) for(int i = N; i >= 1; --i)\\n#define FOR(i, f, t) for(int i = f; i < (int)t; ++i)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define bit(n) (1ll << (n))\\n#define pcnt(n) (__builtin_popcount(n))\\n#define TakAo(ans) ans ? cout << \\\"Takahashi\\\\n\\\" : cout << \\\"Aoki\\\\n\\\"\\n#define YesNo(ans) ans ? cout << \\\"Yes\\\\n\\\" : cout << \\\"No\\\\n\\\"\\n#define endl '\\\\n'\\n#define fi first\\n#define se second\\n#define mkpr make_pair\\n#define mktpl make_tuple\\n#define eb emplace_back\\n\\nusing namespace std;\\nusing ll = int64_t;\\nusing ull = uint64_t;\\nusing ld = long double;\\nusing point = struct{ ll x, y; };\\ntemplate<class T> using max_heap = priority_queue<T>;\\ntemplate<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\\ntemplate<class T> using vec = vector<T>;\\ntemplate<class T> using vvec = vec<vec<T>>;\\ntemplate<class T> using vvvec = vec<vec<vec<T>>>;\\ntemplate<class T> using vvvvec = vec<vec<vec<vec<T>>>>;\\n\\nconstexpr ld EPS = 1e-10;\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr int MOD = 1e9+7;\\n//constexpr ll MOD = 998244353;\\nconstexpr int div2 = (MOD + 1) >> 1;\\nconstexpr int NIL = -1;\\nconstexpr int pm[2] = {1, -1};\\nconstexpr int dy[4] = {0, 1, 0, -1};\\nconstexpr int dx[4] = {1, 0, -1, 0};\\n\\nll cel(ll a, ll b){ return (a + b - 1) / b;}\\nll Gcd(ll a, ll b){ return b ? Gcd(b, a % b) : a;}\\ntemplate<class T> T powi(T x, ll exp){\\n return exp > 0 ? (exp & 1 ? x : 1) * powi(x * x, exp >> 1) : 1;\\n}\\nll modpow(ll x, ll exp, ll mod){\\n x %= mod;\\n return exp > 0 ? (exp & 1 ? x : 1) * modpow(x * x, exp >> 1, mod) % mod : 1;\\n}\\ntemplate<class T> bool chmin(T &a, T b){ return a > b ? (a = b, true) : 0;}\\ntemplate<class T> bool chmax(T &a, T b){ return a < b ? (a = b, true) : 0;}\\n\\nusing P = pair<ll, ll>;\\nusing Tpl = tuple<int, int, int, int>;\\n\\nbool comp(const pair<point, ll> &a, const pair<point, ll> &b){\\n return a.fi.x * b.fi.y < a.fi.y * b.fi.x;\\n}\\n\\nbool eq(const pair<point, ll> &a, const pair<point, ll> &b){\\n return a.fi.x * b.fi.y == a.fi.y * b.fi.x;\\n}\\n\\nvoid Main(){\\n int H, W; cin >> H >> W;\\n vvec<char> G(H + 700, vec<char>(W + 700, '.'));\\n rep(i, H){\\n rep(j, W) cin >> G[i + 1][j + 1];\\n }\\n vec<pair<point, ll>> XY;\\n\\n rep(i, H){\\n rep(j, W){\\n if(G[i + 1][j + 1] == '#'){\\n if(G[i][j] == '.' && G[i + 1][j] == '.' && G[i][j + 1] == '.'){\\n XY.eb(mkpr(point{j, H - i}, 1));\\n }\\n }\\n else{\\n if(G[i][j] == '#' && G[i + 1][j] == '#' && G[i][j + 1] == '#'){\\n XY.eb(mkpr(point{j, H - i}, 1));\\n }\\n }\\n }\\n }\\n rep(I, H){\\n rep(j, W){\\n if(G[I + 1][j + 1] == '#'){\\n if(G[I + 2][j + 2] == '.' && G[I + 2][j + 1] == '.' && G[I + 1][j + 2] == '.'){\\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\\n }\\n }\\n else{\\n if(G[I + 2][j + 2] == '#' && G[I + 2][j + 1] == '#' && G[I + 1][j + 2] == '#'){\\n XY.eb(mkpr(point{j + 1, H - I - 1}, -1));\\n }\\n }\\n }\\n }\\n if(int(XY.size()) == 0){\\n cout << 0 << endl;\\n return;\\n }\\n\\n sort(all(XY), comp);\\n\\n /* \\n for(auto it : XY){\\n cout << it.fi.x << \\\" \\\" << it.fi.y << \\\" \\\" << it.se << endl;\\n }\\n */\\n \\n int M = int(XY.size());\\n pair<point, ll> prev = XY[0];\\n int cnt = 2;\\n int ans = 0;\\n rep(i, M){\\n if(i == 0) continue;\\n if(eq(XY[i], prev)){\\n cnt += XY[i].se;\\n prev = XY[i];\\n }\\n else{\\n chmax(ans, cnt);\\n //cout << cnt << endl;\\n cnt += XY[i].se;\\n prev = XY[i];\\n }\\n }\\n cout << ans << endl;\\n}\\n\\nsigned main(){\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 9460,\n \"score_of_the_acc\": -0.2749,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2310_6275397\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\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#define int long long\\nvoid solve(){\\n int h, w;\\n cin >> h >> w;\\n vector<string> inputs;\\n inputs.push_back(string(w + 2, '.'));\\n REP(i, h)\\n {\\n string s;\\n cin >> s;\\n s = \\\".\\\" + s + \\\".\\\";\\n inputs.push_back(s);\\n }\\n inputs.push_back(string(w + 2, '.'));\\n vector<pair<double, int>> cnter;\\n REP(i, h + 1)\\n {\\n REP(q, w + 1)\\n {\\n double ang = atan2(h - i, q); \\n if(inputs[i][q] =='#' and inputs[i+1][q] == '.' and inputs[i][q+1] == '.' and inputs[i+1][q+1] == '.'){\\n cnter.push_back({ang, 1});\\n }\\n if(inputs[i][q] =='.' and inputs[i+1][q] == '.' and inputs[i][q+1] == '.' and inputs[i+1][q+1] == '#'){\\n cnter.push_back({ang, -1});\\n }\\n if(inputs[i][q] =='.' and inputs[i+1][q] == '#' and inputs[i][q+1] == '#' and inputs[i+1][q+1] == '#'){\\n cnter.push_back({ang, 1});\\n }\\n if(inputs[i][q] =='#' and inputs[i+1][q] == '#' and inputs[i][q+1] == '#' and inputs[i+1][q+1] == '.'){\\n cnter.push_back({ang, -1});\\n }\\n }\\n }\\n sort(ALL(cnter));\\n int cur = 1;\\n int ans = 2;\\n for(auto x:cnter){\\n cur += x.second;\\n ans = max(ans, cur);\\n }\\n cout << ans << endl;\\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 // Fasterize input/output script\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(100);\\n // scanf/printf user should delete this fasterize input/output script\\n\\n int t = 1;\\n //cin >> t; // comment out if solving multi testcase\\n for (int testCase = 1; testCase <= t; ++testCase) {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6060,\n \"score_of_the_acc\": -0.0619,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2310_6028723\",\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 int INF=1<<30;\\nconst LL MAX=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\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\\nclass Fraction{\\n typedef long long int ll;\\n long long int gcd(long long int a,long long int b){\\n if(a<b)swap(a,b);\\n if(b==0)return a;\\n return gcd(b,a%b);\\n }\\n\\npublic:\\n ll x,y;\\n Fraction(){};\\n Fraction(ll _x, ll _y):x(_x),y(_y){\\n if(x==0 && y==0)return;\\n if(y<0)x=-x,y=-y;\\n ll d=gcd(abs(x),abs(y));\\n x/=d,y/=d;\\n }\\n template<typename T> Fraction(pair<T,T> p){\\n Fraction(p.first,p.second);\\n }\\n\\n bool operator==(const Fraction f)const{\\n return x==f.x && y==f.y;\\n }\\n bool operator<(const Fraction f)const{\\n return x*f.y<f.x*y;\\n }\\n bool operator<=(const Fraction f)const{\\n return x*f.y<=f.x*y;\\n }\\n bool operator>(const Fraction f)const{return !((*this)<=f);}\\n bool operator>=(const Fraction f)const{return !((*this)<f);}\\n};\\n\\nnamespace sol{\\n\\n void solve(){\\n int n,m;\\n int i,j,k;\\n int a,b,c;\\n cin>>n>>m;\\n vector<vector<char>> grid(n+2,vector<char>(m+2));\\n string sa;\\n for(i=0;i<n;i++){\\n cin>>sa;\\n for(j=0;j<m;j++){\\n if(sa[j]=='#')grid[i+1][j+1]=1;\\n }\\n }\\n vector<pair<Fraction,int>> v1;\\n for(i=0;i<=n;i++){\\n for(j=0;j<=m;j++){\\n c=0;\\n for(a=0;a<2;a++){\\n for(b=0;b<2;b++){\\n c+=grid[i+a][j+b];\\n }\\n }\\n if(c%2==0)continue;\\n c=1-c/2;\\n if(grid[i][j]==c)v1.push_back({Fraction(n-i,j),1});\\n if(grid[i+1][j+1]==c)v1.push_back({Fraction(n-i,j),-1});\\n }\\n }\\n sort(v1.begin(),v1.end());\\n int s=0;\\n int cnt=1;\\n for(i=0;i<v1.size();i++){\\n Fraction f=v1[i].first;\\n a=v1[i].second;\\n cnt+=a;\\n if(i+1<v1.size() && f==v1[i+1].first)continue;\\n s=max(s,cnt);\\n }\\n cout<<s<<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\": 10,\n \"memory_kb\": 7752,\n \"score_of_the_acc\": -0.1679,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2310_6027629\",\n \"code_snippet\": \"#pragma GCC ta g(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define DEBUG\\n#ifdef DEBUG\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\\n os << '{';\\n for(int i = 0; i < (int)v.size(); i++) {\\n if(i) { os << ','; }\\n os << v[i];\\n }\\n os << '}';\\n return os;\\n}\\nvoid debugg() { cerr << endl; }\\ntemplate <class T, class... Args>\\nvoid debugg(const T &x, const Args &... args) {\\n cerr << \\\" \\\" << x;\\n debugg(args...);\\n}\\n#define debug(...) \\\\\\n cerr << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]: \\\", debugg(__VA_ARGS__)\\n#define dump(x) cerr << __LINE__ << \\\" \\\" << #x << \\\" = \\\" << (x) << endl\\n#else\\n#define debug(...) (void(0))\\n#define dump(x) (void(0))\\n#endif\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<char> vc;\\ntypedef vector<string> vs;\\ntypedef vector<bool> vb;\\ntypedef vector<double> vd;\\ntypedef pair<ll,ll> P;\\ntypedef pair<int,int> pii;\\ntypedef vector<P> vpl;\\ntypedef tuple<ll,ll,ll> tapu;\\n#define rep(i,n) for(int i=0; i<(n); i++)\\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\\n\\tif(a>b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\\n\\tif(a<b){\\n\\t\\ta = b; return true;\\n\\t}\\n\\telse return false;\\n}\\ntemplate<typename T> inline void print(T &a){\\n int sz = a.size();\\n for(auto itr = a.begin(); itr != a.end(); itr++){\\n\\t\\tcout << *itr;\\n sz--;\\n if(sz) cout << \\\" \\\";\\n\\t}\\n cout << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\\n\\tcout << a << \\\" \\\" << b << \\\"\\\\n\\\";\\n}\\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\\n\\tcout << a << \\\" \\\" << b << \\\" \\\" << c << \\\"\\\\n\\\";\\n}\\nvoid mark() {cout << \\\"#\\\" << \\\"\\\\n\\\";}\\nll pcount(ll x) {return __builtin_popcountll(x);}\\n//#include <atcoder/maxflow>\\n//using namespace atcoder;\\nconst int inf = (1<<30)-1;\\nconst ll linf = 1LL<<61;\\nconst int MAX = 510000;\\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\\nconst double pi = acos(-1);\\nconst double eps = 1e-9;\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nint main(){\\n\\tint h,w; cin >> h >> w;\\n\\tvs s(h); rep(i,h) cin >> s[i];\\n\\trep(i,h) s[i].push_back('.');\\n\\ts.push_back(string(w+1,'.'));\\n\\tvector<pair<double,int>> ev;\\n\\trep(i,h) rep(j,w){\\n\\t\\tchar a = s[i][j], b = s[i][j+1], c = s[i+1][j], d = s[i+1][j+1];\\n\\t\\tif(a == b && b == c && a != d) ev.emplace_back((double)(h-i-1)/(j+1),-1);\\n\\t\\tif(b == c && c == d && a != b) ev.emplace_back((double)(h-i-1)/(j+1),1);\\n\\t}\\n\\trep(j,w-1) if(s[0][j] == '.' && s[0][j+1] == '#') ev.emplace_back((double)h/(j+1),-1);\\n\\tsort(all(ev));\\n\\tint now = 0, ans = 0, mn = 0;\\n\\tfor(auto p : ev){\\n\\t\\tnow += p.second;\\n\\t\\tchmin(mn,now);\\n\\t\\tchmax(ans, now-mn);\\n\\t}\\n\\tcout << ans+1 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5764,\n \"score_of_the_acc\": -0.0434,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2310_5989166\",\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}\\ninline double time() {\\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false); \\n int h,w; cin >> h >> w;\\n vector<vector<char>> s(h+2,vector<char>(w+2,'.'));\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n cin >> s[h-i][j+1];\\n }\\n }\\n /*\\n +1\\n X. .X\\n .. XX\\n -1\\n .. XX\\n .X X.\\n */\\n vector<pair<pair<int,int>,int>> v;\\n for(int i=0;i<=h;i++){\\n for(int j=0;j<=w;j++){\\n if(s[i][j] == '.' and s[i+1][j] == '#' and s[i][j+1] == '.' and s[i+1][j+1] == '.'){\\n v.push_back({{i,j},1});\\n }\\n if(s[i][j] == '#' and s[i+1][j] == '.' and s[i][j+1] == '#' and s[i+1][j+1] == '#'){\\n v.push_back({{i,j},1});\\n }\\n if(s[i][j] == '.' and s[i+1][j] == '.' and s[i][j+1] == '#' and s[i+1][j+1] == '.'){\\n v.push_back({{i,j},-1});\\n }\\n if(s[i][j] == '#' and s[i+1][j] == '#' and s[i][j+1] == '.' and s[i+1][j+1] == '#'){\\n v.push_back({{i,j},-1});\\n }\\n }\\n }\\n int res = 1;\\n int cnt = 1;\\n sort(v.begin(), v.end(), [&](auto i,auto j){\\n int ix = i.first.second, iy = i.first.first;\\n int jx = j.first.second, jy = j.first.first;\\n // iy/ix < jy/jx\\n if(iy*jx < jy*ix) return true;\\n else if(iy*jx > jy*ix) return false;\\n else{\\n return i.second < j.second;\\n }\\n });\\n for(int i=0;i<(int)v.size();i++){\\n cnt += v[i].second;\\n res = max(res, cnt);\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5072,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2310_5971590\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n#pragma GCC target (\\\"avx2\\\")\\n#pragma GCC optimization (\\\"O3\\\")\\n#pragma GCC optimization (\\\"unroll-loops\\\")\\nusing namespace std;\\n \\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<int, int> pii;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\n \\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef unsigned long long ull;\\n \\n \\n#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)\\n#define REP(i, n) FOR(i, 0, n)\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define trav(a, x) for (auto &a : x)\\n#define all(x) x.begin(), x.end()\\n \\n#define MOD 1000000007\\n \\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\nconst double EPS = 1e-8, PI = acos(-1);\\nconst double pi = 3.141592653589793238462643383279;\\n//ここから編集 \\ntypedef string::const_iterator State;\\nll GCD(ll a, ll b){\\n return (b==0)?a:GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b) * b;\\n}\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n \\n ModInt() : x(0) {}\\n \\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n \\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n \\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n \\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n \\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n \\n ModInt operator-() const { return ModInt(-x); }\\n \\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n \\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n \\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n \\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n \\n bool operator==(const ModInt &p) const { return x == p.x; }\\n \\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n \\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n \\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n \\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n \\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n \\n static int get_mod() { return mod; }\\n};\\n \\nusing modint = ModInt< 1000000007 >;\\ntemplate< typename T >\\nstruct Combination {\\n vector< T > _fact, _rfact, _inv;\\n \\n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\\n _fact[0] = _rfact[sz] = _inv[0] = 1;\\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\\n _rfact[sz] /= _fact[sz];\\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\\n }\\n \\n inline T fact(int k) const { return _fact[k]; }\\n \\n inline T rfact(int k) const { return _rfact[k]; }\\n \\n inline T inv(int k) const { return _inv[k]; }\\n \\n T P(int n, int r) const {\\n if(r < 0 || n < r) return 0;\\n return fact(n) * rfact(n - r);\\n }\\n \\n T C(int p, int q) const {\\n if(q < 0 || p < q) return 0;\\n return fact(p) * rfact(q) * rfact(p - q);\\n }\\n \\n T H(int n, int r) const {\\n if(n < 0 || r < 0) return (0);\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\n \\nll modpow(ll x, ll n, ll mod) {\\n ll res = 1;\\n x %= mod;\\n if(x == 0) return 0;\\n while(n) {\\n if(n&1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n} \\ninline long long mod(long long a, long long m) {\\n return (a % m + m) % m;\\n}\\ntemplate<typename T> \\nstruct BIT{\\n int N;\\n std::vector<T> node;\\n BIT(){}\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\n void build(int n) {\\n N = n;\\n node.resize(N+10);\\n }\\n /* a: 1-indexed */\\n void add(int a, T x){\\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\\n }\\n\\n /* [1, a] */\\n T sum(int a){\\n T res = 0;\\n for(int x=a; x>0; x -= x & -x) res += node[x];\\n return res;\\n }\\n\\n /* [l, r] */\\n T rangesum(int l, int r){\\n return sum(r) - sum(l-1);\\n }\\n\\n /* \\n a1+a2+...+aw >= valとなるような最小のwを返す\\n @verify https://codeforces.com/contest/992/problem/E\\n */\\n int lower_bound(T val) {\\n if(val < 0) return 0;\\n\\n int res = 0;\\n int n = 1; \\n while (n < N) n *= 2;\\n\\n T tv=0;\\n for (int k = n; k > 0; k /= 2) {\\n if(res + k < N && node[res + k] < val){\\n val -= node[res+k];\\n res += k;\\n }\\n }\\n return res+1; \\n }\\n};\\nstruct UnionFind{\\n std::vector<int> par;\\n std::vector<int> siz;\\n\\n UnionFind(int sz_): par(sz_), siz(sz_) {\\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\\n }\\n\\n void init(int sz_){\\n par.resize(sz_);\\n siz.resize(sz_);\\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\\n }\\n\\n int root(int x){\\n if(x == par[x]) return x;\\n return par[x] = root(par[x]);\\n }\\n\\n bool merge(int x, int y){\\n x = root(x), y = root(y);\\n if(x == y) return false;\\n if(siz[x] < siz[y]) std::swap(x, y);\\n siz[x] += siz[y];\\n par[y] = x;\\n return true;\\n }\\n\\n bool issame(int x, int y){\\n return root(x) == root(y);\\n }\\n\\n int size(int x){\\n return siz[root(x)];\\n }\\n};\\nstruct RollingHash{\\n\\n using ull = unsigned long long;\\n const ull mod = (1ULL << 61) - 1;\\n const ull MASK30 = (1ULL << 30) - 1;\\n const ull MASK31 = (1ULL << 31) - 1;\\n\\n const ull MASK61 = mod;\\n\\n ull base;\\n int n;\\n vector<ull> hash, pow;\\n\\n RollingHash(const string &s)\\n {\\n random_device rnd;\\n mt19937_64 mt(rnd());\\n base = 1001;\\n \\n n = (int)s.size();\\n hash.assign(n+1, 0);\\n pow.assign(n+1, 1);\\n \\n for(int i=0; i<n; i++){\\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\\n pow[i+1] = calc_mod(mul(pow[i], base));\\n }\\n }\\n\\n ull calc_mod(ull x){\\n ull xu = x >> 61;\\n ull xd = x & MASK61;\\n ull res = xu + xd;\\n if(res >= mod) res -= mod;\\n return res;\\n }\\n\\n ull mul(ull a, ull b){\\n ull au = a >> 31;\\n ull ad = a & MASK31;\\n ull bu = b >> 31;\\n ull bd = b & MASK31;\\n ull mid = ad * bu + au * bd;\\n ull midu = mid >> 30;\\n ull midd = mid & MASK30;\\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\\n }\\n\\n //[l,r)のハッシュ値\\n inline ull get(int l, int r){\\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\\n return res;\\n }\\n //string tのハッシュ値\\n inline ull get(string t){\\n ull res = 0;\\n for(int i=0; i<t.size(); i++){\\n res = calc_mod(mul(res, base)+t[i]);\\n }\\n return res;\\n }\\n //string s中のtの数をカウント\\n inline int count(string t) {\\n if(t.size() > n) return 0;\\n auto hs = get(t);\\n int res = 0;\\n for(int i=0; i<n-t.size()+1; i++){\\n if(get(i, i+t.size()) == hs) res++; \\n }\\n return res;\\n }\\n\\n /* \\n concat \\n @verify https://codeforces.com/problemset/problem/514/C\\n */\\n inline ull concat(ull h1, ull h2, int h2len){\\n return calc_mod(h2 + mul(h1, pow[h2len]));\\n }\\n\\n // LCPを求める S[a:] T[b:]\\n inline int LCP(int a, int b){\\n int len = min((int)hash.size()-a, (int)hash.size()-b);\\n \\n int lb = -1, ub = len;\\n while(ub-lb>1){\\n int mid = (lb+ub)/2;\\n\\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\\n else ub = mid;\\n }\\n return lb;\\n }\\n};\\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 h += 2; w += 2;\\n vector<vector<char>> f(h, vector<char>(w, '.'));\\n for(int i=1; i<h-1; i++) {\\n for(int j=1; j<w-1; j++) {\\n cin >> f[i][j];\\n }\\n }\\n \\n vector<pair<double, int>> v;\\n REP(i,h-1) {\\n REP(j,w-1) {\\n int num = 0;\\n double arg = atan2(h-2-i, j);\\n if(f[i][j] == '#' && f[i][j+1] == '.' && f[i+1][j] == '.' && f[i+1][j+1] == '.') {\\n v.push_back({arg, 1});\\n }\\n if(f[i][j] == '.' && f[i][j+1] == '#' && f[i+1][j] == '#' && f[i+1][j+1] == '#') {\\n v.push_back({arg, 1});\\n }\\n if(f[i][j] == '#' && f[i][j+1] == '#' && f[i+1][j] == '#' && f[i+1][j+1] == '.') {\\n v.push_back({arg, -1});\\n }\\n if(f[i][j] == '.' && f[i][j+1] == '.' && f[i+1][j] == '.' && f[i+1][j+1] == '#') {\\n v.push_back({arg, -1});\\n }\\n }\\n } \\n sort(all(v));\\n int ans = 2;\\n int cnt = 1;\\n REP(i,v.size()) {\\n cnt += v[i].second;\\n ans = max(ans, cnt);\\n }\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 6024,\n \"score_of_the_acc\": -0.0596,\n \"final_rank\": 5\n }\n]","isConversational":false}}},{"rowIdx":1293,"cells":{"group_id":{"kind":"string","value":"aoj_2308_cpp"},"problem_description":{"kind":"string","value":"White Bird\nAngry Birds is a mobile game of a big craze all over the world.\nYou were convinced that it was a waste of time to play the game, so you decided to create an automatic solver.\nYou are describing a routine that optimizes the white bird's strategy to defeat a pig (enemy) by hitting an egg bomb.\nThe white bird follows a parabolic trajectory from the initial position,\nand it can vertically drop egg bombs on the way.\nIn order to make it easy to solve, the following conditions hold for the stages.\nN\nobstacles are put on the stage.\nEach obstacle is a rectangle whose sides are parallel to the coordinate axes.\nThe pig is put on the point\n(X, Y)\n.\nYou can launch the white bird in any direction at an initial velocity\nV\nfrom the origin.\nIf the white bird collides with an obstacle, it becomes unable to drop egg bombs.\nIf the egg bomb collides with an obstacle, the egg bomb is vanished.\nThe acceleration of gravity is\n9.8 {\\rm m/s^2}\n.\nGravity exerts a force on the objects in the decreasing direction of\ny\n-coordinate.\nInput\nA dataset follows the format shown below:\nN\nV\nX\nY\nL_1\nB_1\nR_1\nT_1\n...\nL_N\nB_N\nR_N\nT_N\nAll inputs are integer.\nN\n: the number of obstacles\nV\n: the initial speed of the white bird\nX\n,\nY\n: the position of the pig\n(\n0 \\leq N \\leq 50\n,\n0 \\leq V \\leq 50\n,\n0 \\leq X, Y \\leq 300\n,\nX \\neq 0\n)\nfor\n1 \\leq i \\leq N,\nL_i\n: the x-coordinate of the left side of the\ni\n-th obstacle\nB_i\n: the y-coordinate of the bottom side of the\ni\n-th obstacle\nR_i\n: the x-coordinate of the right side of the\ni\n-th obstacle\nT_i\n: the y-coordinate of the top side of the\ni\n-th obstacle\n(\n0 \\leq L_i, B_i, R_i, T_i \\leq 300\n)\nIt is guaranteed that the answer remains unaffected by a change of\nL_i\n,\nB_i\n,\nR_i\nand\nT_i\nin\n10^{-6}\n.\nOutput\nYes/No\nYou should answer whether the white bird can drop an egg bomb toward the pig.\nSample Input 1\n0 7 3 1\nOutput for the Sample Input 1\nYes\nSample Input 2\n1 7 3 1\n1 1 2 2\nOutput for the Sample Input 2\nNo\nSample Input 3\n1 7 2 2\n0 1 1 2\nOutput for the Sample Input 3\nNo"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2308_5846707","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.01 15:05: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\nusing R = long double;\n\n#pragma region geometry_light\n\nusing Real = long double;\nusing R = Real;\nusing Point = std::complex<Real>;\nusing Vec = Point;\nconst Real EPS = 1e-10, PI = acos(-1);\n\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\n/*\n\t-1: a < b\n\t0 : a == b\n\t1 : a > b\n*/\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\n\nnamespace std {\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n} // namespace std\n\nstd::istream &operator>>(std::istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// rotate point 'p' for counter clockwise direction\nconst Point rotate(const Real &theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\n\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\n\n// get angle a-b-c (<pi)\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), w(c - b);\n\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\n\treturn std::min(theta, 2 * PI - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \" -- \" << p.b; }\n\n\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = std::vector<Point>;\nusing Segments = std::vector<Segment>;\nusing Lines = std::vector<Line>;\nusing Circles = std::vector<Circle>;\n\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nconst int ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1;\t\t// \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1;\t\t// \"CLOCKWISE\"\n\tif(dot(b, c) < -EPS) return +2;\t\t\t// \"ONLINE_BACK\"\n\tif(norm(b) + EPS < norm(c)) return -2;\t// \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t\t\t// \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\n\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\n\nint intersect(const Line &l, const Line &m) {\n\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\n\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\n}\n\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\n\nint intersect(const Line &l, const Segment &s) {\n\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\n\treturn 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\nint intersect(const Circle &c, const Line &l) {\n\tReal d = c.r - distance(l, c.p);\n\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\n}\n\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nint intersect(const Segment &s, const Segment &t) {\n\tif(eq(s.a, s.b)) return intersect(t, s.a);\n\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\n\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\n\t\treturn -1;\n\treturn int(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\tconst Point h = projection(l, c.p);\n\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\n\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\n}\n\nReal distance(const Point &a, const Point &b);\n\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\n\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\n\tint com = compare(r1 + r2, d);\n\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\n\t// if(c1.r < c2.r) swap(c1, c2);\n\t// Real d = abs(c1.p - c2.p);\n\t// if(compare(c1.r + c2.r, d) == -1) return 4;\n\t// if(eq(c1.r + c2.r, d)) return 3;\n\t// if(compare(c1.r - c2.r, d) == -1) return 2;\n\t// return int(eq(c1.r - c2.r, d));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\treturn intersect(s, r) ? distance(r, p) : std::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\tif(intersect(a, b)) return 0;\n\treturn std::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\tif(intersect(l, s)) return 0;\n\treturn std::min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn 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) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\n\treturn make_pair(pr - v, pr + v);\n\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\n\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\n\t// return {pr - e * base, pr + e * base};\n}\n\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\n\tauto ret = crosspoint(c, Line(l.a, l.b));\n\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn make_pair(p1, p2);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\n\treturn 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\tLines ret;\n\tif(c1.r < c2.r) std::swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tVec u = (c2.p - c1.p) / Real(sqrt(g));\n\tVec v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n#pragma endregion\n\nbool solve(int n) {\n\tR velocity;\n\tcin >> velocity;\n\tR x_pig, y_pig;\n\tcin >> x_pig >> y_pig;\n\n\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\n\n\tPoints pts;\n\n\trep(j, n) {\n\t\tR l, b, r, t;\n\t\tcin >> l >> b >> r >> t;\n\t\tpts.emplace_back(l, t);\n\t\tpts.emplace_back(l, b);\n\t\tpts.emplace_back(r, t);\n\t\tpts.emplace_back(r, b);\n\n\t\tR mid_x = (l + r) / 2;\n\t\tR mid_y = (b + t) / 2;\n\t\tPoints pts;\n\t\tfor(R x : {l, mid_x, r}) {\n\t\t\tfor(R y : {b, mid_y, t}) {\n\t\t\t\tpts.emplace_back(x, y);\n\t\t\t}\n\t\t}\n\t\trep(i, 3) obstacle[j].emplace_back(pts[i], pts[i + 6]);\n\t\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\n\t}\n\n\tconst R g = 9.8;\n\n\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\n\n\tauto calc_top = [&](R obj_x) -> R {\n\t\tR inf = 0;\n\t\tR sup = pi / 2 - EPS;\n\t\tR lef, rig;\n\t\trep(300) {\n\t\t\tlef = inf + (sup - inf) / 3;\n\t\t\trig = (lef + sup) / 2;\n\t\t\tif(f(lef, obj_x) < f(rig, obj_x)) {\n\t\t\t\tinf = lef;\n\t\t\t} else {\n\t\t\t\tsup = rig;\n\t\t\t}\n\t\t}\n\t\treturn lef;\n\t};\n\n\tauto binarysearch = [&](R lef, R rig, R obj_x, R obj_y, bool lef_is_large) {\n\t\tR mid;\n\t\trep(300) {\n\t\t\tmid = lef + rig;\n\t\t\tmid /= 2;\n\t\t\tif(bool(f(mid, obj_x) > obj_y) ^ (bool)lef_is_large) {\n\t\t\t\trig = mid;\n\t\t\t} else {\n\t\t\t\tlef = mid;\n\t\t\t}\n\t\t}\n\t\treturn mid;\n\t};\n\n\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\n\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\n\t\tR inf = 0;\n\t\tR sup = pi / 2 - EPS;\n\t\tR mid = calc_top(obj_x);\n\t\tif(compare(f(mid, obj_x), obj_y) == -1) return make_pair(-1., -1.);\n\t\t// R a, b;\n\t\t// inf = 0;\n\t\t// rep(300) {\n\t\t// \ta = (inf + mid) / 2;\n\t\t// \tif(f(a, obj_x) < obj_y) {\n\t\t// \t\tinf = a;\n\t\t// \t} else {\n\t\t// \t\tmid = a;\n\t\t// \t}\n\t\t// }\n\t\t// mid = sup;\n\t\t// sup = pi / 2 - EPS;\n\t\t// rep(300) {\n\t\t// \tb = (mid + sup) / 2;\n\t\t// \tif(f(b, obj_x) < obj_y) {\n\t\t// \t\tsup = b;\n\t\t// \t} else {\n\t\t// \t\tmid = b;\n\t\t// \t}\n\t\t// }\n\t\treturn make_pair(binarysearch(inf, mid, obj_x, obj_y, false), binarysearch(mid, sup, obj_x, obj_y, true));\n\t};\n\n\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\n\n\tauto collision = [&](R theta, int obs_idx) -> bool {\n\t\tR top = tp(theta);\n\t\trep(i, 3) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR xl, xr, y;\n\t\t\ty = seg.a.imag();\n\t\t\txl = seg.a.real();\n\t\t\txr = seg.b.real();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(y, xl, xr);\n\t\t\t}\n\t\t\tif(xl > xr) swap(xl, xr);\n\t\t\tif(x_pig <= xl) continue;\n\t\t\tchmin(xr, x_pig);\n\t\t\tR yl = f(theta, xl);\n\t\t\tR yr = f(theta, xr);\n\t\t\tif(xl <= top && top <= xr) {\n\t\t\t\tif(compare(f(theta, top), y) == 1) {\n\t\t\t\t\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(compare(yl, y) * compare(yr, y) == -1) return true;\n\t\t}\n\n\t\trep(i, 3, 6) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR yd, x, yt;\n\t\t\tx = seg.a.real();\n\t\t\tyd = seg.a.imag();\n\t\t\tyt = seg.b.imag();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(x, yd, yt);\n\t\t\t}\n\t\t\tif(x_pig < x) continue;\n\t\t\tif(yd > yt) swap(yd, yt);\n\t\t\tR y = f(theta, x);\n\t\t\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\n\t\t}\n\n\t\treturn false;\n\t};\n\n\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\n\n\tauto ok = [&](R angle) {\n\t\tif(!use(angle)) return false;\n\t\trep(i, n) if(collision(angle, i)) return false;\n\t\tR y = f(angle, x_pig);\n\t\tif(compare(y, y_pig) == -1) return false;\n\t\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\n\t\tfoa(ob, obstacle) {\n\t\t\tfoa(seg, ob) {\n\t\t\t\tif(intersect(seg, egg)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn true;\n\t};\n\n\tfoa(p, pts) {\n\t\tif(eq(p.real(), 0.)) continue;\n\t\tauto angles = calc_theta(p.real(), p.imag());\n\t\tif(ok(angles.first) || ok(angles.second)) return true;\n\t}\n\n\tauto angles = calc_theta(x_pig, y_pig);\n\treturn (ok(angles.first) || ok(angles.second));\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\t// std::cerr << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint n;\n\twhile(cin >> n) {\n\t\tYes(solve(n));\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3952,"score_of_the_acc":-1.0836,"final_rank":4},{"submission_id":"aoj_2308_5846664","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.01 15:05: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\nusing R = long double;\n\n#pragma region geometry_light\n\nusing Real = long double;\nusing R = Real;\nusing Point = std::complex<Real>;\nusing Vec = Point;\nconst Real EPS = 1e-10, PI = acos(-1);\n\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\n/*\n\t-1: a < b\n\t0 : a == b\n\t1 : a > b\n*/\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\n\nnamespace std {\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n} // namespace std\n\nstd::istream &operator>>(std::istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// rotate point 'p' for counter clockwise direction\nconst Point rotate(const Real &theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\n\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\n\n// get angle a-b-c (<pi)\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), w(c - b);\n\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\n\treturn std::min(theta, 2 * PI - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \" -- \" << p.b; }\n\n\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = std::vector<Point>;\nusing Segments = std::vector<Segment>;\nusing Lines = std::vector<Line>;\nusing Circles = std::vector<Circle>;\n\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nconst int ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1;\t\t// \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1;\t\t// \"CLOCKWISE\"\n\tif(dot(b, c) < -EPS) return +2;\t\t\t// \"ONLINE_BACK\"\n\tif(norm(b) + EPS < norm(c)) return -2;\t// \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t\t\t// \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\n\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\n\nint intersect(const Line &l, const Line &m) {\n\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\n\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\n}\n\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\n\nint intersect(const Line &l, const Segment &s) {\n\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\n\treturn 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\nint intersect(const Circle &c, const Line &l) {\n\tReal d = c.r - distance(l, c.p);\n\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\n}\n\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nint intersect(const Segment &s, const Segment &t) {\n\tif(eq(s.a, s.b)) return intersect(t, s.a);\n\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\n\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\n\t\treturn -1;\n\treturn int(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\tconst Point h = projection(l, c.p);\n\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\n\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\n}\n\nReal distance(const Point &a, const Point &b);\n\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\n\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\n\tint com = compare(r1 + r2, d);\n\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\n\t// if(c1.r < c2.r) swap(c1, c2);\n\t// Real d = abs(c1.p - c2.p);\n\t// if(compare(c1.r + c2.r, d) == -1) return 4;\n\t// if(eq(c1.r + c2.r, d)) return 3;\n\t// if(compare(c1.r - c2.r, d) == -1) return 2;\n\t// return int(eq(c1.r - c2.r, d));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\treturn intersect(s, r) ? distance(r, p) : std::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\tif(intersect(a, b)) return 0;\n\treturn std::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\tif(intersect(l, s)) return 0;\n\treturn std::min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn 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) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\n\treturn make_pair(pr - v, pr + v);\n\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\n\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\n\t// return {pr - e * base, pr + e * base};\n}\n\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\n\tauto ret = crosspoint(c, Line(l.a, l.b));\n\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn make_pair(p1, p2);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\n\treturn 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\tLines ret;\n\tif(c1.r < c2.r) std::swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tVec u = (c2.p - c1.p) / Real(sqrt(g));\n\tVec v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n#pragma endregion\n\nbool solve(int n) {\n\tR velocity;\n\tcin >> velocity;\n\tR x_pig, y_pig;\n\tcin >> x_pig >> y_pig;\n\n\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\n\n\tPoints pts;\n\n\trep(j, n) {\n\t\tR l, b, r, t;\n\t\tcin >> l >> b >> r >> t;\n\t\tpts.emplace_back(l, t);\n\t\tpts.emplace_back(l, b);\n\t\tpts.emplace_back(r, t);\n\t\tpts.emplace_back(r, b);\n\n\t\tR mid_x = (l + r) / 2;\n\t\tR mid_y = (b + t) / 2;\n\t\tPoints pts;\n\t\tfor(R x : {l, mid_x, r}) {\n\t\t\tfor(R y : {b, mid_y, t}) {\n\t\t\t\tpts.emplace_back(x, y);\n\t\t\t}\n\t\t}\n\t\trep(i, 3) { obstacle[j].emplace_back(pts[i], pts[i + 6]); }\n\t\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\n\t}\n\n\tconst R g = 9.8;\n\n\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\n\n\tauto calc_top = [&](R obj_x) -> R {\n\t\tR inf = 0;\n\t\tR sup = pi / 2 - EPS;\n\t\tR lef, rig;\n\t\trep(300) {\n\t\t\tlef = inf + (sup - inf) / 3;\n\t\t\trig = (lef + sup) / 2;\n\t\t\tif(f(lef, obj_x) < f(rig, obj_x)) {\n\t\t\t\tinf = lef;\n\t\t\t} else {\n\t\t\t\tsup = rig;\n\t\t\t}\n\t\t}\n\t\treturn lef;\n\t};\n\n\tauto binarysearch = [&](R lef, R rig, R obj_x, R obj_y, bool lef_is_large) {\n\t\tR mid;\n\t\trep(300) {\n\t\t\tmid = lef + rig;\n\t\t\tmid /= 2;\n\t\t\tif(bool(f(mid, obj_x) > obj_y) ^ (bool)lef_is_large) {\n\t\t\t\trig = mid;\n\t\t\t} else {\n\t\t\t\tlef = mid;\n\t\t\t}\n\t\t}\n\t\treturn mid;\n\t};\n\n\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\n\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\n\t\tR inf = 0;\n\t\tR sup = pi / 2 - EPS;\n\t\tR mid = calc_top(obj_x);\n\t\tif(compare(f(mid, obj_x), obj_y) == -1) return make_pair(-1., -1.);\n\t\t// R a, b;\n\t\t// inf = 0;\n\t\t// rep(300) {\n\t\t// \ta = (inf + mid) / 2;\n\t\t// \tif(f(a, obj_x) < obj_y) {\n\t\t// \t\tinf = a;\n\t\t// \t} else {\n\t\t// \t\tmid = a;\n\t\t// \t}\n\t\t// }\n\t\t// mid = sup;\n\t\t// sup = pi / 2 - EPS;\n\t\t// rep(300) {\n\t\t// \tb = (mid + sup) / 2;\n\t\t// \tif(f(b, obj_x) < obj_y) {\n\t\t// \t\tsup = b;\n\t\t// \t} else {\n\t\t// \t\tmid = b;\n\t\t// \t}\n\t\t// }\n\t\treturn make_pair(binarysearch(inf, mid, obj_x, obj_y, false), binarysearch(mid, sup, obj_x, obj_y, true));\n\t};\n\n\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\n\n\tauto collision = [&](R theta, int obs_idx) -> bool {\n\t\tR top = tp(theta);\n\t\trep(i, 3) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR xl, xr, y;\n\t\t\ty = seg.a.imag();\n\t\t\txl = seg.a.real();\n\t\t\txr = seg.b.real();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(y, xl, xr);\n\t\t\t}\n\t\t\tif(xl > xr) swap(xl, xr);\n\t\t\tif(x_pig <= xl) continue;\n\t\t\tchmin(xr, x_pig);\n\t\t\tR yl = f(theta, xl);\n\t\t\tR yr = f(theta, xr);\n\t\t\tif(xl <= top && top <= xr) {\n\t\t\t\t// if(f(theta, top) > y) {\n\t\t\t\tif(compare(f(theta, top), y) == 1) {\n\t\t\t\t\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(compare(yl, y) * compare(yr, y) == -1) return true;\n\t\t}\n\n\t\tdebug(theta);\n\n\t\trep(i, 3, 6) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR yd, x, yt;\n\t\t\tx = seg.a.real();\n\t\t\tyd = seg.a.imag();\n\t\t\tyt = seg.b.imag();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(x, yd, yt);\n\t\t\t}\n\t\t\tif(x_pig < x) continue;\n\t\t\tif(yd > yt) swap(yd, yt);\n\t\t\tR y = f(theta, x);\n\t\t\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\n\t\t}\n\n\t\treturn false;\n\t};\n\n\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\n\n\tauto ok = [&](R angle) {\n\t\tif(!use(angle)) return false;\n\t\trep(i, n) if(collision(angle, i)) return false;\n\t\tR y = f(angle, x_pig);\n\t\tif(y < y_pig) return false;\n\t\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\n\t\tfoa(ob, obstacle) {\n\t\t\tfoa(seg, ob) {\n\t\t\t\tif(intersect(seg, egg)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdebug(angle);\n\t\tdebug(f(angle, 1));\n\t\tdebug(f(angle, 2));\n\t\tdebug(f(angle, 3));\n\t\treturn true;\n\t};\n\n\t// // auto res = calc_theta(0.5, 12);\n\t// debug(res);\n\t// debug(f(res.first, 1.2));\n\t// debug(f(res.second, 1.2));\n\n\tfoa(p, pts) {\n\t\tif(eq(p.real(), 0.)) continue;\n\t\tauto angles = calc_theta(p.real(), p.imag());\n\t\tif(ok(angles.first) || ok(angles.second)) return true;\n\t}\n\n\tauto angles = calc_theta(x_pig, y_pig);\n\treturn (ok(angles.first) || ok(angles.second));\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\t// std::cerr << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint n;\n\twhile(cin >> n) {\n\t\tYes(solve(n));\n\t}\n\n\treturn 0;\n}","accuracy":0.8,"time_ms":50,"memory_kb":3952,"score_of_the_acc":-1.0836,"final_rank":7},{"submission_id":"aoj_2308_5846601","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.01 15:05: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\nusing R = long double;\n\n#pragma region geometry_light\n\nusing Real = long double;\nusing R = Real;\nusing Point = std::complex<Real>;\nusing Vec = Point;\nconst Real EPS = 1e-10, PI = acos(-1);\n\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\n/*\n\t-1: a < b\n\t0 : a == b\n\t1 : a > b\n*/\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\n\nnamespace std {\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n} // namespace std\n\nstd::istream &operator>>(std::istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// rotate point 'p' for counter clockwise direction\nconst Point rotate(const Real &theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\n\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\n\n// get angle a-b-c (<pi)\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), w(c - b);\n\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\n\treturn std::min(theta, 2 * PI - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \" -- \" << p.b; }\n\n\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = std::vector<Point>;\nusing Segments = std::vector<Segment>;\nusing Lines = std::vector<Line>;\nusing Circles = std::vector<Circle>;\n\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nconst int ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1;\t\t// \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1;\t\t// \"CLOCKWISE\"\n\tif(dot(b, c) < -EPS) return +2;\t\t\t// \"ONLINE_BACK\"\n\tif(norm(b) + EPS < norm(c)) return -2;\t// \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t\t\t// \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\n\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\n\nint intersect(const Line &l, const Line &m) {\n\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\n\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\n}\n\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\n\nint intersect(const Line &l, const Segment &s) {\n\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\n\treturn 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\nint intersect(const Circle &c, const Line &l) {\n\tReal d = c.r - distance(l, c.p);\n\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\n}\n\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nint intersect(const Segment &s, const Segment &t) {\n\tif(eq(s.a, s.b)) return intersect(t, s.a);\n\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\n\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\n\t\treturn -1;\n\treturn int(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\tconst Point h = projection(l, c.p);\n\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\n\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\n}\n\nReal distance(const Point &a, const Point &b);\n\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\n\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\n\tint com = compare(r1 + r2, d);\n\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\n\t// if(c1.r < c2.r) swap(c1, c2);\n\t// Real d = abs(c1.p - c2.p);\n\t// if(compare(c1.r + c2.r, d) == -1) return 4;\n\t// if(eq(c1.r + c2.r, d)) return 3;\n\t// if(compare(c1.r - c2.r, d) == -1) return 2;\n\t// return int(eq(c1.r - c2.r, d));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\treturn intersect(s, r) ? distance(r, p) : std::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\tif(intersect(a, b)) return 0;\n\treturn std::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\tif(intersect(l, s)) return 0;\n\treturn std::min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn 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) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\n\treturn make_pair(pr - v, pr + v);\n\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\n\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\n\t// return {pr - e * base, pr + e * base};\n}\n\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\n\tauto ret = crosspoint(c, Line(l.a, l.b));\n\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn make_pair(p1, p2);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\n\treturn 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\tLines ret;\n\tif(c1.r < c2.r) std::swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tVec u = (c2.p - c1.p) / Real(sqrt(g));\n\tVec v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n#pragma endregion\n\nbool solve(int n) {\n\tR velocity;\n\tcin >> velocity;\n\tR x_pig, y_pig;\n\tcin >> x_pig >> y_pig;\n\n\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\n\n\tPoints pts;\n\n\trep(j, n) {\n\t\tR l, b, r, t;\n\t\tcin >> l >> b >> r >> t;\n\t\tpts.emplace_back(l, t);\n\t\tpts.emplace_back(l, b);\n\t\tpts.emplace_back(r, t);\n\t\tpts.emplace_back(r, b);\n\n\t\tR mid_x = (l + r) / 2;\n\t\tR mid_y = (b + t) / 2;\n\t\tPoints pts;\n\t\tfor(R x : {l, mid_x, r}) {\n\t\t\tfor(R y : {b, mid_y, t}) {\n\t\t\t\tpts.emplace_back(x, y);\n\t\t\t}\n\t\t}\n\t\trep(i, 3) { obstacle[j].emplace_back(pts[i], pts[i + 6]); }\n\t\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\n\t}\n\n\tconst R g = 9.8;\n\n\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\n\n\tauto calc_top = [&](R obj_x) -> R {\n\t\tR inf = 0;\n\t\tR sup = pi / 2 - EPS;\n\t\tR lef, rig;\n\t\trep(300) {\n\t\t\tlef = inf + (sup - inf) / 3;\n\t\t\trig = (lef + sup) / 2;\n\t\t\tif(f(lef, obj_x) < f(rig, obj_x)) {\n\t\t\t\tinf = lef;\n\t\t\t} else {\n\t\t\t\tsup = rig;\n\t\t\t}\n\t\t}\n\t\treturn lef;\n\t};\n\n\tauto binarysearch = [&](R lef, R rig, R obj_x, R obj_y, bool lef_is_large) {\n\t\tR mid;\n\t\trep(300) {\n\t\t\tmid = lef + rig;\n\t\t\tmid /= 2;\n\t\t\tif(bool(f(mid, obj_x) > obj_y) ^ (bool)lef_is_large) {\n\t\t\t\trig = mid;\n\t\t\t} else {\n\t\t\t\tlef = mid;\n\t\t\t}\n\t\t}\n\t\treturn mid;\n\t};\n\n\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\n\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\n\t\tR inf = 0;\n\t\tR sup = pi / 2 - EPS;\n\n\t\tR mid = calc_top(obj_x);\n\n\t\tif(compare(f(mid, obj_x), obj_y) == -1) {\n\t\t\treturn make_pair(-1., -1.);\n\t\t}\n\n\t\t// R a, b;\n\t\t// inf = 0;\n\t\t// rep(300) {\n\t\t// \ta = (inf + mid) / 2;\n\t\t// \tif(f(a, obj_x) < obj_y) {\n\t\t// \t\tinf = a;\n\t\t// \t} else {\n\t\t// \t\tmid = a;\n\t\t// \t}\n\t\t// }\n\n\t\t// mid = sup;\n\t\t// sup = pi / 2 - EPS;\n\n\t\t// rep(300) {\n\t\t// \tb = (mid + sup) / 2;\n\t\t// \tif(f(b, obj_x) < obj_y) {\n\t\t// \t\tsup = b;\n\t\t// \t} else {\n\t\t// \t\tmid = b;\n\t\t// \t}\n\t\t// }\n\n\t\treturn make_pair(binarysearch(inf, mid, obj_x, obj_y, false), binarysearch(mid, sup, obj_x, obj_y, true));\n\t};\n\n\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\n\n\tauto collision = [&](R theta, int obs_idx) -> bool {\n\t\tR top = tp(theta);\n\t\trep(i, 3) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR xl, xr, y;\n\t\t\ty = seg.a.imag();\n\t\t\txl = seg.a.real();\n\t\t\txr = seg.b.real();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(y, xl, xr);\n\t\t\t}\n\t\t\tif(xl > xr) swap(xl, xr);\n\t\t\tif(x_pig <= xl) continue;\n\t\t\tchmin(xr, x_pig);\n\t\t\tR yl = f(theta, xl);\n\t\t\tR yr = f(theta, xr);\n\t\t\tif(xl <= top && top <= xr) {\n\t\t\t\t// if(f(theta, top) > y) {\n\t\t\t\tif(compare(f(theta, top), y) == 1) {\n\t\t\t\t\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif((yl - y) * (yr - y) < -EPS) return true;\n\t\t}\n\n\t\tdebug(theta);\n\n\t\trep(i, 3, 6) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR yd, x, yt;\n\t\t\tx = seg.a.real();\n\t\t\tyd = seg.a.imag();\n\t\t\tyt = seg.b.imag();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(x, yd, yt);\n\t\t\t}\n\t\t\tif(x_pig < x) continue;\n\t\t\tif(yd > yt) swap(yd, yt);\n\t\t\tR y = f(theta, x);\n\t\t\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\n\t\t}\n\n\t\treturn false;\n\t};\n\n\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\n\n\tauto ok = [&](R angle) {\n\t\tif(!use(angle)) return false;\n\t\trep(i, n) if(collision(angle, i)) return false;\n\t\tR y = f(angle, x_pig);\n\t\tif(y < y_pig) return false;\n\t\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\n\t\tfoa(ob, obstacle) {\n\t\t\tfoa(seg, ob) {\n\t\t\t\tif(intersect(seg, egg)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdebug(angle);\n\t\tdebug(f(angle, 1));\n\t\tdebug(f(angle, 2));\n\t\tdebug(f(angle, 3));\n\t\treturn true;\n\t};\n\n\t// // auto res = calc_theta(0.5, 12);\n\t// debug(res);\n\t// debug(f(res.first, 1.2));\n\t// debug(f(res.second, 1.2));\n\n\tfoa(p, pts) {\n\t\tif(eq(p, 0.)) continue;\n\t\tauto angles = calc_theta(p.real(), p.imag());\n\t\tif(ok(angles.first) || ok(angles.second)) return true;\n\t}\n\n\tauto angles = calc_theta(x_pig, y_pig);\n\treturn (ok(angles.first) || ok(angles.second));\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\t// std::cerr << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint n;\n\twhile(cin >> n) {\n\t\tYes(solve(n));\n\t}\n\n\treturn 0;\n}","accuracy":0.8,"time_ms":50,"memory_kb":3940,"score_of_the_acc":-1.079,"final_rank":6},{"submission_id":"aoj_2308_5846579","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.01 15:05: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\nusing R = long double;\n\n#pragma region geometry_light\n\nusing Real = long double;\nusing R = Real;\nusing Point = std::complex<Real>;\nusing Vec = Point;\nconst Real EPS = 1e-10, PI = acos(-1);\n\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\n/*\n\t-1: a < b\n\t0 : a == b\n\t1 : a > b\n*/\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\n\nnamespace std {\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n} // namespace std\n\nstd::istream &operator>>(std::istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// rotate point 'p' for counter clockwise direction\nconst Point rotate(const Real &theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\n\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\n\n// get angle a-b-c (<pi)\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), w(c - b);\n\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\n\treturn std::min(theta, 2 * PI - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \" -- \" << p.b; }\n\n\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = std::vector<Point>;\nusing Segments = std::vector<Segment>;\nusing Lines = std::vector<Line>;\nusing Circles = std::vector<Circle>;\n\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nconst int ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1;\t\t// \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1;\t\t// \"CLOCKWISE\"\n\tif(dot(b, c) < -EPS) return +2;\t\t\t// \"ONLINE_BACK\"\n\tif(norm(b) + EPS < norm(c)) return -2;\t// \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t\t\t// \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\n\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\n\nint intersect(const Line &l, const Line &m) {\n\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\n\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\n}\n\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\n\nint intersect(const Line &l, const Segment &s) {\n\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\n\treturn 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\nint intersect(const Circle &c, const Line &l) {\n\tReal d = c.r - distance(l, c.p);\n\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\n}\n\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nint intersect(const Segment &s, const Segment &t) {\n\tif(eq(s.a, s.b)) return intersect(t, s.a);\n\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\n\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\n\t\treturn -1;\n\treturn int(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\tconst Point h = projection(l, c.p);\n\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\n\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\n}\n\nReal distance(const Point &a, const Point &b);\n\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\n\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\n\tint com = compare(r1 + r2, d);\n\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\n\t// if(c1.r < c2.r) swap(c1, c2);\n\t// Real d = abs(c1.p - c2.p);\n\t// if(compare(c1.r + c2.r, d) == -1) return 4;\n\t// if(eq(c1.r + c2.r, d)) return 3;\n\t// if(compare(c1.r - c2.r, d) == -1) return 2;\n\t// return int(eq(c1.r - c2.r, d));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\treturn intersect(s, r) ? distance(r, p) : std::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\tif(intersect(a, b)) return 0;\n\treturn std::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\tif(intersect(l, s)) return 0;\n\treturn std::min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn 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) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\n\treturn make_pair(pr - v, pr + v);\n\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\n\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\n\t// return {pr - e * base, pr + e * base};\n}\n\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\n\tauto ret = crosspoint(c, Line(l.a, l.b));\n\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn make_pair(p1, p2);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\n\treturn 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\tLines ret;\n\tif(c1.r < c2.r) std::swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tVec u = (c2.p - c1.p) / Real(sqrt(g));\n\tVec v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n#pragma endregion\n\nbool solve(int n) {\n\tR velocity;\n\tcin >> velocity;\n\tR x_pig, y_pig;\n\tcin >> x_pig >> y_pig;\n\n\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\n\n\tPoints pts;\n\n\trep(j, n) {\n\t\tR l, b, r, t;\n\t\tcin >> l >> b >> r >> t;\n\t\tpts.emplace_back(l, t);\n\t\tpts.emplace_back(l, b);\n\t\tpts.emplace_back(r, t);\n\t\tpts.emplace_back(r, b);\n\n\t\tR mid_x = (l + r) / 2;\n\t\tR mid_y = (b + t) / 2;\n\t\tPoints pts;\n\t\tfor(R x : {l, mid_x, r}) {\n\t\t\tfor(R y : {b, mid_y, t}) {\n\t\t\t\tpts.emplace_back(x, y);\n\t\t\t}\n\t\t}\n\t\trep(i, 3) { obstacle[j].emplace_back(pts[i], pts[i + 6]); }\n\t\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\n\t}\n\n\tconst R g = 9.8;\n\n\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\n\n\tauto calc_top = [&](R obj_x) -> R {\n\t\tR inf = 0;\n\t\tR sup = pi / 2 - EPS;\n\t\tR lef, rig;\n\t\trep(300) {\n\t\t\tlef = inf + (sup - inf) / 3;\n\t\t\trig = (lef + sup) / 2;\n\t\t\tif(f(lef, obj_x) < f(rig, obj_x)) {\n\t\t\t\tinf = lef;\n\t\t\t} else {\n\t\t\t\tsup = rig;\n\t\t\t}\n\t\t}\n\t\treturn lef;\n\t};\n\n\tauto binarysearch = [&](R lef, R rig, R obj_x, R obj_y) {\n\t\tR mid;\n\t\trep(300) {\n\t\t\tmid = lef + rig;\n\t\t\tmid /= 2;\n\t\t\tif((f(mid, obj_x) - obj_y) * (f(lef, obj_x) - obj_y) > 0) {\n\t\t\t\tlef = mid;\n\t\t\t} else {\n\t\t\t\trig = mid;\n\t\t\t}\n\t\t}\n\t\treturn mid;\n\t};\n\n\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\n\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\n\t\tR inf = 0;\n\t\tR sup = pi / 2 - EPS;\n\n\t\tR mid = calc_top(obj_x);\n\n\t\tif(compare(f(mid, obj_x), obj_y) == -1) {\n\t\t\treturn make_pair(-1., -1.);\n\t\t}\n\n\t\t// R a, b;\n\t\t// inf = 0;\n\t\t// rep(300) {\n\t\t// \ta = (inf + mid) / 2;\n\t\t// \tif(f(a, obj_x) < obj_y) {\n\t\t// \t\tinf = a;\n\t\t// \t} else {\n\t\t// \t\tmid = a;\n\t\t// \t}\n\t\t// }\n\n\t\t// mid = sup;\n\t\t// sup = pi / 2 - EPS;\n\n\t\t// rep(300) {\n\t\t// \tb = (mid + sup) / 2;\n\t\t// \tif(f(b, obj_x) < obj_y) {\n\t\t// \t\tsup = b;\n\t\t// \t} else {\n\t\t// \t\tmid = b;\n\t\t// \t}\n\t\t// }\n\n\t\treturn make_pair(binarysearch(inf, mid, obj_x, obj_y), binarysearch(mid, sup, obj_x, obj_y));\n\t};\n\n\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\n\n\tauto collision = [&](R theta, int obs_idx) -> bool {\n\t\tR top = tp(theta);\n\t\trep(i, 3) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR xl, xr, y;\n\t\t\ty = seg.a.imag();\n\t\t\txl = seg.a.real();\n\t\t\txr = seg.b.real();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(y, xl, xr);\n\t\t\t}\n\t\t\tif(xl > xr) swap(xl, xr);\n\t\t\tif(x_pig <= xl) continue;\n\t\t\tchmin(xr, x_pig);\n\t\t\tR yl = f(theta, xl);\n\t\t\tR yr = f(theta, xr);\n\t\t\tif(xl <= top && top <= xr) {\n\t\t\t\t// if(f(theta, top) > y) {\n\t\t\t\tif(compare(f(theta, top), y) == 1) {\n\t\t\t\t\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif((yl - y) * (yr - y) < -EPS) return true;\n\t\t}\n\n\t\tdebug(theta);\n\n\t\trep(i, 3, 6) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR yd, x, yt;\n\t\t\tx = seg.a.real();\n\t\t\tyd = seg.a.imag();\n\t\t\tyt = seg.b.imag();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(x, yd, yt);\n\t\t\t}\n\t\t\tif(x_pig < x) continue;\n\t\t\tif(yd > yt) swap(yd, yt);\n\t\t\tR y = f(theta, x);\n\t\t\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\n\t\t}\n\n\t\treturn false;\n\t};\n\n\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\n\n\tauto ok = [&](R angle) {\n\t\tif(!use(angle)) return false;\n\t\trep(i, n) if(collision(angle, i)) return false;\n\t\tR y = f(angle, x_pig);\n\t\tif(y < y_pig) return false;\n\t\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\n\t\tfoa(ob, obstacle) {\n\t\t\tfoa(seg, ob) {\n\t\t\t\tif(intersect(seg, egg)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdebug(angle);\n\t\tdebug(f(angle, 1));\n\t\tdebug(f(angle, 2));\n\t\tdebug(f(angle, 3));\n\t\treturn true;\n\t};\n\n\tauto res = calc_theta(1.2, 1.5);\n\tdebug(f(res.first, 1.2));\n\tdebug(f(res.second, 1.2));\n\n\tfoa(p, pts) {\n\t\tif(eq(p, 0.)) continue;\n\t\tauto angles = calc_theta(p.real(), p.imag());\n\t\tif(ok(angles.first) || ok(angles.second)) return true;\n\t}\n\n\tauto angles = calc_theta(x_pig, y_pig);\n\treturn (ok(angles.first) || ok(angles.second));\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\t// std::cerr << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint n;\n\twhile(cin >> n) {\n\t\tYes(solve(n));\n\t}\n\n\treturn 0;\n}","accuracy":0.8,"time_ms":70,"memory_kb":3940,"score_of_the_acc":-1.1215,"final_rank":8},{"submission_id":"aoj_2308_5846497","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.01 15:05: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\nusing R = long double;\n\n#pragma region geometry_light\n\nusing Real = long double;\nusing R = Real;\nusing Point = std::complex<Real>;\nusing Vec = Point;\nconst Real EPS = 1e-10, PI = acos(-1);\n\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\n/*\n\t-1: a < b\n\t0 : a == b\n\t1 : a > b\n*/\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\n\nnamespace std {\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n} // namespace std\n\nstd::istream &operator>>(std::istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// rotate point 'p' for counter clockwise direction\nconst Point rotate(const Real &theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\n\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\n\n// get angle a-b-c (<pi)\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), w(c - b);\n\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\n\treturn std::min(theta, 2 * PI - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \" -- \" << p.b; }\n\n\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = std::vector<Point>;\nusing Segments = std::vector<Segment>;\nusing Lines = std::vector<Line>;\nusing Circles = std::vector<Circle>;\n\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nconst int ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1;\t\t// \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1;\t\t// \"CLOCKWISE\"\n\tif(dot(b, c) < -EPS) return +2;\t\t\t// \"ONLINE_BACK\"\n\tif(norm(b) + EPS < norm(c)) return -2;\t// \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t\t\t// \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\n\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\n\nint intersect(const Line &l, const Line &m) {\n\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\n\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\n}\n\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\n\nint intersect(const Line &l, const Segment &s) {\n\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\n\treturn 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\nint intersect(const Circle &c, const Line &l) {\n\tReal d = c.r - distance(l, c.p);\n\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\n}\n\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nint intersect(const Segment &s, const Segment &t) {\n\tif(eq(s.a, s.b)) return intersect(t, s.a);\n\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\n\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\n\t\treturn -1;\n\treturn int(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\tconst Point h = projection(l, c.p);\n\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\n\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\n}\n\nReal distance(const Point &a, const Point &b);\n\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\n\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\n\tint com = compare(r1 + r2, d);\n\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\n\t// if(c1.r < c2.r) swap(c1, c2);\n\t// Real d = abs(c1.p - c2.p);\n\t// if(compare(c1.r + c2.r, d) == -1) return 4;\n\t// if(eq(c1.r + c2.r, d)) return 3;\n\t// if(compare(c1.r - c2.r, d) == -1) return 2;\n\t// return int(eq(c1.r - c2.r, d));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\treturn intersect(s, r) ? distance(r, p) : std::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\tif(intersect(a, b)) return 0;\n\treturn std::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\tif(intersect(l, s)) return 0;\n\treturn std::min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn 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) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\n\treturn make_pair(pr - v, pr + v);\n\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\n\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\n\t// return {pr - e * base, pr + e * base};\n}\n\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\n\tauto ret = crosspoint(c, Line(l.a, l.b));\n\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn make_pair(p1, p2);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\n\treturn 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\tLines ret;\n\tif(c1.r < c2.r) std::swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tVec u = (c2.p - c1.p) / Real(sqrt(g));\n\tVec v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n#pragma endregion\n\nbool solve(int n) {\n\tR velocity;\n\tcin >> velocity;\n\tR x_pig, y_pig;\n\tcin >> x_pig >> y_pig;\n\n\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\n\n\tPoints pts;\n\n\trep(j, n) {\n\t\tR l, b, r, t;\n\t\tcin >> l >> b >> r >> t;\n\t\tpts.emplace_back(l, t);\n\t\tpts.emplace_back(l, b);\n\t\tpts.emplace_back(r, t);\n\t\tpts.emplace_back(r, b);\n\n\t\tR mid_x = (l + r) / 2;\n\t\tR mid_y = (b + t) / 2;\n\t\tPoints pts;\n\t\tfor(R x : {l, mid_x, r}) {\n\t\t\tfor(R y : {b, mid_y, t}) {\n\t\t\t\tpts.emplace_back(x, y);\n\t\t\t}\n\t\t}\n\t\trep(i, 3) { obstacle[j].emplace_back(pts[i], pts[i + 6]); }\n\t\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\n\t}\n\n\tconst R g = 9.8;\n\n\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\n\n\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\n\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\n\t\tR inf = 0;\n\t\tR sup = pi / 2 - EPS;\n\n\t\trep(300) {\n\t\t\tR lef = inf + (sup - inf) / 3;\n\t\t\tR rig = (lef + sup) / 2;\n\t\t\tif(f(lef, obj_x) < f(rig, obj_x)) {\n\t\t\t\tinf = lef;\n\t\t\t} else {\n\t\t\t\tsup = rig;\n\t\t\t}\n\t\t}\n\n\t\tif(compare(f(sup, obj_x), obj_y) == -1) {\n\t\t\treturn make_pair(-1., -1.);\n\t\t}\n\n\t\tR mid = sup;\n\t\tR a, b;\n\t\tinf = 0;\n\t\trep(300) {\n\t\t\ta = (inf + mid) / 2;\n\t\t\tif(f(a, obj_x) < obj_y) {\n\t\t\t\tinf = a;\n\t\t\t} else {\n\t\t\t\tmid = a;\n\t\t\t}\n\t\t}\n\n\t\tmid = sup;\n\t\tsup = pi / 2 - EPS;\n\n\t\trep(300) {\n\t\t\tb = (mid + sup) / 2;\n\t\t\tif(f(b, obj_x) < obj_x) {\n\t\t\t\tsup = b;\n\t\t\t} else {\n\t\t\t\tmid = b;\n\t\t\t}\n\t\t}\n\n\t\treturn pair(a, b);\n\t};\n\n\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\n\n\tauto collision = [&](R theta, int obs_idx) -> bool {\n\t\tR top = tp(theta);\n\t\trep(i, 3) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR xl, xr, y;\n\t\t\ty = seg.a.imag();\n\t\t\txl = seg.a.real();\n\t\t\txr = seg.b.real();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(y, xl, xr);\n\t\t\t}\n\t\t\tif(xl > xr) swap(xl, xr);\n\t\t\tif(x_pig <= xl) continue;\n\t\t\tchmin(xr, x_pig);\n\t\t\tR yl = f(theta, xl);\n\t\t\tR yr = f(theta, xr);\n\t\t\tif(xl <= top && top <= xr) {\n\t\t\t\t// if(f(theta, top) > y) {\n\t\t\t\tif(compare(f(theta, top), y) == 1) {\n\t\t\t\t\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif((yl - y) * (yr - y) < -EPS) return true;\n\t\t}\n\n\t\tdebug(theta);\n\n\t\trep(i, 3, 6) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR yd, x, yt;\n\t\t\tx = seg.a.real();\n\t\t\tyd = seg.a.imag();\n\t\t\tyt = seg.b.imag();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(x, yd, yt);\n\t\t\t}\n\t\t\tif(x > x_pig) continue;\n\t\t\tif(yd > yt) swap(yd, yt);\n\t\t\tR y = f(theta, x);\n\t\t\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\n\t\t}\n\n\t\treturn false;\n\t};\n\n\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\n\n\tauto ok = [&](R angle) {\n\t\tif(!use(angle)) return false;\n\t\trep(i, n) if(collision(angle, i)) return false;\n\t\tR y = f(angle, x_pig);\n\t\tif(y < y_pig) return false;\n\t\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\n\t\tfoa(ob, obstacle) {\n\t\t\tfoa(seg, ob) {\n\t\t\t\tif(intersect(seg, egg)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdebug(angle);\n\t\tdebug(f(angle, 1));\n\t\tdebug(f(angle, 2));\n\t\tdebug(f(angle, 3));\n\t\treturn true;\n\t};\n\n\tfoa(p, pts) {\n\t\tif(eq(p, 0.)) continue;\n\t\tauto angles = calc_theta(p.real(), p.imag());\n\t\tif(ok(angles.first) || ok(angles.second)) return true;\n\t}\n\n\tauto angles = calc_theta(x_pig, y_pig);\n\treturn (ok(angles.first) || ok(angles.second));\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\t// std::cerr << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint n;\n\twhile(cin >> n) {\n\t\tYes(solve(n));\n\t}\n\n\treturn 0;\n}","accuracy":0.6,"time_ms":30,"memory_kb":3956,"score_of_the_acc":-1.0426,"final_rank":10},{"submission_id":"aoj_2308_5846469","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.01 15:05: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\nusing R = long double;\n\n#pragma region geometry_light\n\nusing Real = long double;\nusing R = Real;\nusing Point = std::complex<Real>;\nusing Vec = Point;\nconst Real EPS = 1e-10, PI = acos(-1);\n\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\n/*\n\t-1: a < b\n\t0 : a == b\n\t1 : a > b\n*/\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\n\nnamespace std {\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n} // namespace std\n\nstd::istream &operator>>(std::istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// rotate point 'p' for counter clockwise direction\nconst Point rotate(const Real &theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\n\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\n\n// get angle a-b-c (<pi)\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), w(c - b);\n\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\n\treturn std::min(theta, 2 * PI - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \" -- \" << p.b; }\n\n\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = std::vector<Point>;\nusing Segments = std::vector<Segment>;\nusing Lines = std::vector<Line>;\nusing Circles = std::vector<Circle>;\n\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nconst int ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1;\t\t// \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1;\t\t// \"CLOCKWISE\"\n\tif(dot(b, c) < -EPS) return +2;\t\t\t// \"ONLINE_BACK\"\n\tif(norm(b) + EPS < norm(c)) return -2;\t// \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t\t\t// \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\n\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\n\nint intersect(const Line &l, const Line &m) {\n\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\n\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\n}\n\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\n\nint intersect(const Line &l, const Segment &s) {\n\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\n\treturn 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\nint intersect(const Circle &c, const Line &l) {\n\tReal d = c.r - distance(l, c.p);\n\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\n}\n\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nint intersect(const Segment &s, const Segment &t) {\n\tif(eq(s.a, s.b)) return intersect(t, s.a);\n\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\n\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\n\t\treturn -1;\n\treturn int(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\tconst Point h = projection(l, c.p);\n\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\n\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\n}\n\nReal distance(const Point &a, const Point &b);\n\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\n\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\n\tint com = compare(r1 + r2, d);\n\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\n\t// if(c1.r < c2.r) swap(c1, c2);\n\t// Real d = abs(c1.p - c2.p);\n\t// if(compare(c1.r + c2.r, d) == -1) return 4;\n\t// if(eq(c1.r + c2.r, d)) return 3;\n\t// if(compare(c1.r - c2.r, d) == -1) return 2;\n\t// return int(eq(c1.r - c2.r, d));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\treturn intersect(s, r) ? distance(r, p) : std::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\tif(intersect(a, b)) return 0;\n\treturn std::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\tif(intersect(l, s)) return 0;\n\treturn std::min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn 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) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\n\treturn make_pair(pr - v, pr + v);\n\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\n\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\n\t// return {pr - e * base, pr + e * base};\n}\n\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\n\tauto ret = crosspoint(c, Line(l.a, l.b));\n\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn make_pair(p1, p2);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\n\treturn 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\tLines ret;\n\tif(c1.r < c2.r) std::swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tVec u = (c2.p - c1.p) / Real(sqrt(g));\n\tVec v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n#pragma endregion\n\nbool solve(int n) {\n\tR velocity;\n\tcin >> velocity;\n\tR x_pig, y_pig;\n\tcin >> x_pig >> y_pig;\n\n\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\n\n\tPoints pts;\n\n\trep(j, n) {\n\t\tR l, b, r, t;\n\t\tcin >> l >> b >> r >> t;\n\t\tpts.emplace_back(l, t);\n\t\tpts.emplace_back(l, b);\n\t\tpts.emplace_back(r, t);\n\t\tpts.emplace_back(r, b);\n\n\t\tR mid_x = (l + r) / 2;\n\t\tR mid_y = (b + t) / 2;\n\t\tPoints pts;\n\t\tfor(R x : {l, mid_x, r}) {\n\t\t\tfor(R y : {b, mid_y, t}) {\n\t\t\t\tpts.emplace_back(x, y);\n\t\t\t}\n\t\t}\n\t\trep(i, 3) { obstacle[j].emplace_back(pts[i], pts[i + 6]); }\n\t\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\n\t}\n\n\tconst R g = 9.8;\n\n\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\n\n\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\n\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\n\t\tR inf = 0;\n\t\tR sup = pi / 2 - EPS;\n\n\t\trep(100) {\n\t\t\tR lef = inf + (sup - inf) / 3;\n\t\t\tR rig = (lef + sup) / 2;\n\t\t\tif(f(lef, obj_x) < f(rig, obj_x)) {\n\t\t\t\tinf = lef;\n\t\t\t} else {\n\t\t\t\tsup = rig;\n\t\t\t}\n\t\t}\n\n\t\tif(compare(f(sup, obj_x), obj_y) == -1) {\n\t\t\treturn make_pair(-1., -1.);\n\t\t}\n\n\t\tR mid = sup;\n\t\tR a, b;\n\t\tinf = 0;\n\t\trep(100) {\n\t\t\ta = (inf + mid) / 2;\n\t\t\tif(f(a, obj_x) < obj_y) {\n\t\t\t\tinf = a;\n\t\t\t} else {\n\t\t\t\tmid = a;\n\t\t\t}\n\t\t}\n\n\t\tmid = sup;\n\t\tsup = pi / 2 - EPS;\n\n\t\trep(100) {\n\t\t\tb = (mid + sup) / 2;\n\t\t\tif(f(b, obj_x) < obj_x) {\n\t\t\t\tsup = b;\n\t\t\t} else {\n\t\t\t\tmid = b;\n\t\t\t}\n\t\t}\n\n\t\treturn pair(a, b);\n\t};\n\n\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\n\n\tauto collision = [&](R theta, int obs_idx) -> bool {\n\t\tR top = tp(theta);\n\t\trep(i, 3) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR xl, xr, y;\n\t\t\ty = seg.a.imag();\n\t\t\txl = seg.a.real();\n\t\t\txr = seg.b.real();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(y, xl, xr);\n\t\t\t}\n\t\t\tif(xl > xr) swap(xl, xr);\n\t\t\tif(x_pig <= xl) continue;\n\t\t\tchmin(xr, x_pig);\n\t\t\tR yl = f(theta, xl);\n\t\t\tR yr = f(theta, xr);\n\t\t\tif(xl <= top && top <= xr) {\n\t\t\t\t// if(f(theta, top) > y) {\n\t\t\t\tif(compare(f(theta, top), y) == 1) {\n\t\t\t\t\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif((yl - y) * (yr - y) < -EPS) return true;\n\t\t}\n\n\t\tdebug(theta);\n\n\t\trep(i, 3, 6) {\n\t\t\tauto &seg = obstacle[obs_idx][i];\n\t\t\tR yd, x, yt;\n\t\t\tx = seg.a.real();\n\t\t\tyd = seg.a.imag();\n\t\t\tyt = seg.b.imag();\n\t\t\tif(eq(theta, 0.899297831746404)) {\n\t\t\t\tdebug(x, yd, yt);\n\t\t\t}\n\t\t\tif(x > x_pig) continue;\n\t\t\tif(yd > yt) swap(yd, yt);\n\t\t\tR y = f(theta, x);\n\t\t\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\n\t\t}\n\n\t\treturn false;\n\t};\n\n\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\n\n\tauto ok = [&](R angle) {\n\t\tif(!use(angle)) return false;\n\t\trep(i, n) if(collision(angle, i)) return false;\n\t\tR y = f(angle, x_pig);\n\t\tif(y < y_pig) return false;\n\t\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\n\t\tfoa(ob, obstacle) {\n\t\t\tfoa(seg, ob) {\n\t\t\t\tif(intersect(seg, egg)) {\n\t\t\t\t\treturn false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdebug(angle);\n\t\tdebug(f(angle, 1));\n\t\tdebug(f(angle, 2));\n\t\tdebug(f(angle, 3));\n\t\treturn true;\n\t};\n\n\tfoa(p, pts) {\n\t\tif(eq(p, 0.)) continue;\n\t\tauto angles = calc_theta(p.real(), p.imag());\n\t\tif(ok(angles.first) || ok(angles.second)) return true;\n\t}\n\n\tauto angles = calc_theta(x_pig, y_pig);\n\treturn (ok(angles.first) || ok(angles.second));\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\t// std::cerr << std::fixed << std::setprecision(15);\n\tsrand((unsigned)time(NULL));\n\n\tint n;\n\twhile(cin >> n) {\n\t\tYes(solve(n));\n\t}\n\n\treturn 0;\n}","accuracy":0.6,"time_ms":10,"memory_kb":3884,"score_of_the_acc":-0.9723,"final_rank":9},{"submission_id":"aoj_2308_2682265","code_snippet":"#include <iostream>\n#include <cmath>\n\nusing namespace std;\n\n#define _USE_MATH_DEFINES\n\nconst int NMax = 150;\nconst double eps = 1e-8;\nconst double eps1 = 1e-6;\nconst double gravity = 9.8;\nconst double PI = 3.14159265;\n\nint N, V, X, Y;\nint L[NMax], B[NMax], R[NMax], T[NMax];\n\nint main()\n{\n\tcin >>N >>V >>X >>Y;\n\n\tfor (int i = 1; i <= N; ++i)\n\t\tcin >>L[i] >>B[i] >>R[i] >>T[i];\n\n\tfor (double alpha = -eps1; alpha <= PI/2; alpha += eps1)\n\t{\n\t\tdouble V_0x = V * cos(alpha);\n\t\tdouble V_0y = V * sin(alpha);\n\t\tdouble Time = X / V_0x;\n\t\tdouble LandY = V_0y * Time - 0.5*gravity*(Time*Time);\n\n\t\tif (Y - LandY <= eps)\n\t\t{\n bool intersect = 0;\n\n for (int i = 1; i <= N; ++i)\n if (X - L[i] >= eps && X - R[i] <= eps &&\n\t\t\t\t\tLandY - B[i] >= eps && LandY - T[i] <= eps)\n\t\t\t\t\tintersect = 1;\n\n for (int i = 1; i <= N; ++i)\n\t\t\t\tfor (int j = L[i]; j <= R[i]; ++j)\n\t\t\t\t{\n\t\t\t\t\tdouble TimeToJ = j / V_0x;\n\t\t\t\t\tif (Time - TimeToJ >= eps)\n\t\t\t\t\t{\n double newY = V_0y * TimeToJ - 0.5*gravity*(TimeToJ*TimeToJ);\n if (newY - B[i] - eps >= 0 &&\n\t\t\t\t\t\t\tnewY - T[i] - eps <= 0)\n\t\t\t\t\t\t\t\tintersect = 1;\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\tif (!intersect)\n\t\t\t{\n cout <<\"Yes\" <<'\\n';\n return 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tcout <<\"No\" <<'\\n';\n return 0;\n}","accuracy":1,"time_ms":480,"memory_kb":3484,"score_of_the_acc":-1.8185,"final_rank":5},{"submission_id":"aoj_2308_2517963","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\n#define MAXN 55\n#define EPS 1e-6\n#define g 9.8\n#define PI acos(-1)\n\nstruct Obstacle\n{\n int l;\n int r;\n int t;\n int b;\n} ob[MAXN];\n\nint n,v,tx,ty;\ndouble a,b,c;\n\nvoid getabc(double angle)\n{\n double vx = v * cos(angle); //x?方向速度\n double vy = v * sin(angle); //y?方向速度\n a = -0.5 * g / (vx * vx);\n b = vy / vx;\n c = 0;\n}\n\nbool check1(double x, double up, double down) //是否会撞到障碍物的左（右）?端或者左（右）底端\n{\n if(x >= tx) //如果障碍物的x坐?在猪的x坐?的右?，?就算会撞到也不要?（?炸??死猪不受?障碍物影?）\n return false;\n double y = a * x * x + b * x + c; //求出相?的y坐?\n if(up <= y && y <= down) //会撞到\n return true;\n return false;\n}\n\nbool check2(double y, double left, double right)\n{\n double delta = b * b - 4 * a * y;\n if(delta < 0) //抛物?与障碍物上（下）的左端和右端形成的?段没有交点，?不会相撞\n return false;\n delta = sqrt(delta);\n double x1 = (-b + delta) / (2 * a);\n double x2 = (-b - delta) / (2 * a);\n if(x1 < tx && left <= x1 && x1 <= right) //如果抛物?与障碍物上（下）的左端点有交点且交点的x坐?在猪的左?，?无法?死猪\n return true;\n if(x2 < tx && left <= x2 && x2 <= right) //如果抛物?与障碍物上（下）的右端点有交点且交点的x坐?在猪的左?，?无法?死猪\n return true;\n return false;\n}\n\nbool check3(double x, double y, double h, double t, double l, double r)\n{\n if(l <= x && x <= r && y <= t && t <= h) //如果障碍正好?在白??行的抛物??迹和猪的中?，?炸蛋无法?中猪\n return true;\n return false;\n}\n\nbool check(double angle)\n{\n getabc(angle);\n double h = a * tx * tx + b * tx + c;\n if(h < ty) //?不到猪的上方，?不可能?死猪\n return false;\n for(int i=0; i<n; i++)\n {\n if(check1(ob[i].l,ob[i].b,ob[i].t))\n return false;\n if(check1(ob[i].r,ob[i].b,ob[i].t))\n return false;\n if(check2(ob[i].b,ob[i].l,ob[i].r))\n return false;\n if(check2(ob[i].t,ob[i].l,ob[i].r))\n return false;\n if(check3(tx,ty,h,ob[i].b,ob[i].l,ob[i].r))\n return false;\n //if(check3(tx,ty,h,ob[i].t,ob[i].l,ob[i].r))\n // return false;\n }\n return true;\n}\n\nbool solve()\n{\n for(double i=0; i<0.5*PI; i+=0.000001)\n {\n if(check(i))\n return true;\n }\n return false;\n}\n\nint main()\n{\n scanf(\"%d%d%d%d\",&n,&v,&tx,&ty);\n for(int i=0; i<n; i++)\n scanf(\"%d%d%d%d\",&ob[i].l,&ob[i].b,&ob[i].r,&ob[i].t);\n if(solve())\n puts(\"Yes\");\n else\n puts(\"No\");\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3536,"score_of_the_acc":-1.0087,"final_rank":3},{"submission_id":"aoj_2308_2040309","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define x() real()\n#define y() imag()\n#define x1 jfwekljfwklj\n#define x2 jfwekljwefkjklf\ntypedef complex<double> P;\nconst double g = 4.9;\nconst double EPS = 1e-8;\nint N;\ndouble V,X,Y;\n \n// = -(gx2/v2)tan2 + xtan - y\n \nstruct Box{\n P p1,p2,p3,p4;\n};\nvector<Box> box;\n \nP in(){\n double x,y;\n cin >> x >> y;\n return P(x,y);\n}\n \nbool inner(double a,double b,double c){\n return a + EPS < b and b < c - EPS;\n}\nvoid trying(double tanv){\n double a = - g / V / V * (1+tanv * tanv);\n double b = tanv;\n auto f = [a,b](double x){\n return a * x * x + b * x;\n };\n auto g = [a,b](double y){ \n vector<double> ps;\n double c = -y;\n double D = b*b-4*a*c;\n if( D < -EPS ){\n return ps;\n }\n if( D < EPS ) D = 0;\n D = sqrt(D);\n double x1 = (-b+D)/(2*a);\n double x2 = (-b-D)/(2*a);\n ps = {x1,x2};\n return ps;\n };\n \n \n double hx = 1e9;\n double hy = 1e9;\n vector<double> uxtmp;\n \n for( auto b : box ){\n if( inner(b.p1.x(),X,b.p2.x()) and b.p1.y() > Y ){\n hy = min(hy,b.p1.y());\n }\n }\n for( auto b : box ){\n double x = b.p1.x();\n uxtmp.push_back(x);\n double y = f(x);\n if( inner(b.p1.y(),y,b.p4.y()) ){\n hx = min(x,hx);\n }\n }\n \n for( auto b : box ){\n double x = b.p2.x();\n double y = f(x);\n uxtmp.push_back(x);\n if( inner(b.p2.y(),y,b.p3.y()) ){\n hx = min(x,hx);\n }\n }\n \n for( auto b : box ){\n double y = b.p1.y();\n for( double x : g(y) ){\n uxtmp.push_back(x);\n if( inner(b.p1.x(),x,b.p2.x()) ){\n hx = min(x,hx);\n }\n }\n }\n \n for( auto b : box ){\n double y = b.p3.y();\n for( double x : g(y) ){\n uxtmp.push_back(x);\n if( inner(b.p1.x(),x,b.p2.x()) ){\n hx = min(x,hx);\n }\n }\n }\n sort(uxtmp.begin(),uxtmp.end());\n vector<double> ux;\n for(int i = 0 ; i < uxtmp.size() ; i++)\n if( !i or uxtmp[i] - uxtmp[i-1] > EPS )\n ux.push_back(uxtmp[i]);\n \n for( auto b : box ){\n if( inner(b.p1.x(),X,b.p2.x()) ){\n if( inner(b.p1.y(),Y,b.p4.y()) ){\n hx = -1e9;\n }\n }\n }\n for(int i = 0 ; i+1 < ux.size() ; i++){\n \n double x = (ux[i] + ux[i+1] ) / 2;\n double y = f(x);\n for( auto b : box ){\n if( inner(b.p1.x(),x,b.p2.x()) ){\n if( inner(b.p1.y(),y,b.p4.y()) ){\n hx = min(ux[i],hx);\n }\n }\n }\n }\n //cout << f(1) << endl;\n //cout << hy << endl;\n //cout << V << \" \" << tanv << \" \" << a << \" \" << b << \" \" << X << \" \" << f(X) << endl;\n if( hx + EPS > X ){\n //cout << f(X) << \" \" << Y - EPS << endl;\n if( f(X) > Y - EPS and f(X) < hy - EPS ){\n cout << \"Yes\" << endl;\n //cout << atan(tanv) << endl;\n exit(0);\n }\n }\n \n \n \n \n \n \n}\n \n \nint main(){\n \n cin >> N;\n cin >> V >> X >> Y;\n \n \n vector<P> ps;\n for(int i = 0 ; i < N ; i++){\n P a,b;\n a = in();\n b = in();\n ps.push_back(a);\n ps.push_back(P(b.x(),a.y()));\n ps.push_back(b);\n ps.push_back(P(a.x(),b.y()));\n box.push_back({P(a.x(),a.y()),P(b.x(),a.y()),P(b.x(),b.y()),P(a.x(),b.y())}); \n \n }\n for(int i = 0 ; i < 3000 ; i++){\n trying(0.001*i);\n }\n if(true){\n double x = X;\n double y = Y;\n double a = -g/V/V*x*x;\n double b = x;\n double c = -y-g/V/V*x*x;\n //cout << a << \" \" << b << \" \" << c << \" ( \" << g << \" \" << V << \" \" << x << endl;\n double D = b*b-4*a*c;\n if( D < -EPS ){\n \n }else{\n D = max(0.0,D);\n D = sqrt(D);\n double t1 = (-b+D)/(2*a);\n double t2 = (-b-D)/(2*a);\n trying(t1);\n trying(t2);\n }\n }\n \n for(int i = 0 ; i < ps.size() ; i++){\n double x = ps[i].x();\n double y = ps[i].y();\n if( x == 0 ) continue;\n double a = -g/V/V*x*x;\n double b = x;\n double c = -y-g/V/V*x*x;\n \n \n double D = b*b-4*a*c;\n if( D < -EPS ){\n continue;\n }\n \n //printf(\"%.20lf\\n\",D); \n if( D < EPS ) D = 0;\n \n \n double t1 = (-b+D)/(2*a);\n double t2 = (-b-D)/(2*a);\n trying(t1);\n trying(t2);\n }\n \n cout << \"No\" << endl;\n \n}","accuracy":1,"time_ms":40,"memory_kb":3300,"score_of_the_acc":-0.8115,"final_rank":1},{"submission_id":"aoj_2308_1777434","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;\ntemplate<class T>\nusing Table = vector<vector<T>>;\nconst ld eps=1e-9;\n\n//// < \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\a.txt\"\n\n\n/* ??????????????¬ */\n\n#include <complex>\n\ntypedef long double ld;\ntypedef complex<ld> Point;\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// ????????\\???\nPoint input_point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// ????????????????????????\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// ??????\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// ??????\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// ??´????????????\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// ????????????\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// CCW\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\n\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\n\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\n\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\n\treturn 0; // a,c,b???????????´???????????¶\n}\n\n\n/* ???????????? */\n\n// ??´?????¨??´??????????????????\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// ??´?????¨?????????????????????\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// ????????¨?????????????????????\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// ????????´????????????\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// ?????????????????????\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// ??????????¶?\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// ????????¨???????????????\n//???????????£????????¨???????????¨assert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//??????isis_ss?????????\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// ??´?????¨???????????¢\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n// ??´?????¨??´???????????¢\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// ??´?????¨??????????????¢\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// ????????¨???????????¢\nld dist_sp(const Line& s, const 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\n// ????????¨??????????????¢\nld dist_ss(const Line& s, const 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\n\n//??´?????¨??´?????????????????????????????????\nLine bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:??????\n//c:????????§??????\n//???????????´?????????????????¢?????????????±??????????\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* ??? */\n\n// ?????¨????????????\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n//???????????????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n//???lc??????rc??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint circle_in_circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// ?????¨??´????????????\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// ?????¨??????????????¢\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), ALL(nret));\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//??????????????????????????¢???\nld two_circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* ????§???¢ */\n\ntypedef vector<Point> Polygon;\n\n// ??¢???\nld area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n// ????§???¢????????¢??????\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// ??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//??????????????????2?????????\nenum { OUT, ON, IN };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// ??????\n// ???????????????????????¨????????????????????§??¨???\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n// ????????????\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon Q;\n\tPolygon R;\n\tREP(i, n) {\n\t\tPoint A = ps[i], B = ps[(i + 1) % n];\n\t\tLine m = Line(A, B);\n\t\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\n\t\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\n\t\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\n\t\t\tQ.push_back(is_ll(l, m));\n\t\t\tR.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ Q,R };\n\treturn polys;\n}\n\n\n/* ??¢??¬??????????????? */\nvoid add_point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\ntypedef int Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\n\tg[from].push_back(Edge{ from, to, weight });\n}\n\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\n\tint n = p.size(), m = s.size();\n\tGraph g(n);\n\tREP(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\tREP(j, n) if (isis_sp(s[i], p[j]))\n\t\t\tvec.emplace_back(abs(s[i].a - p[j]), j);\n\t\tsort(ALL(vec));\n\t\tREP(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\n\t\t}\n\t}\n\treturn g;\n}\nGraph sennbunn_arrangement(const vector<Line>&s) {\n\tvector<Point>crss;\n\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\n\t\t\tif (isis_ss(s[i], s[j])) {\n\t\t\t\tcrss.push_back(is_ll(s[i], s[j]));\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\n\t\tcrss.push_back(s[i][0]);\n\t\tcrss.push_back(s[i][1]);\n\t}\n\treturn segment_arrangement(s, crss);\n}\n\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\n//\tint n = p.size(), m = c.size();\n//\tGraph g(n);\n//\tREP(i, m) {\n//\t\tvector<pair<ld, int>> vec;\n//\t\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\n//\t\t\tvec.emplace_back(arg(c[i].p - p[j]), j);\n//\t\tsort(ALL(vec));\n//\t\tREP(j, vec.size() - 1) {\n//\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n//\t\t\tld angle = vec[j + 1].first - vec[j].first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t\tif (vec.size() >= 2) {\n//\t\t\tint from = vec.back().second, to = vec.front().first;\n//\t\t\tld angle = vec.front().first - vec.back().first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t}\n//\treturn g;\n//}\n\n\n\nconst ld G= 9.8;\n\nstruct box {\n\tvector<ld>xs;\n\tvector<ld>ys;\n};\n\n\nint N, V, X, Y;\nbool check(const ld theta, const box& b) {\n\n\tconst ld vx = V*cos(theta);\n\tconst ld vy = V*sin(theta);\n\n\tld y_max = -1e18;\n\tld y_min = 1e18;\n\n\t//?????????????¢????\n\t{\n\t\tconst ld toptime = vy / G;\n\t\tconst ld top_x = toptime*vx;\n\t\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\n\t\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\n\t\t\ty_max = max(y_max, top_y);\n\t\t}\n\t}\n\t//???????????????????¢????\n\t{\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tconst ld time = b.xs[x]/vx;\n\t\t\tconst ld ay = vy*time - time*time*G / 2;\n\t\t\ty_max = max(y_max, ay);\n\t\t\ty_min = min(y_min, ay);\n\t\t}\n\t}\n\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\n\t\t\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\n\tif (p.real() < eps)return;\n\tbool ok = true;\n\tld amin, amax;\n\n\t//?????????????¨????\n\t{\n\t\tconst ld tan = V*V / G / p.real();\n\t\tconst ld theta = atan(tan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld max_y = vy*time - G*time*time / 2;\n\t\tif (max_y < p.imag()) {\n\t\t\tok = false;\n\t\t}\n\t\tif (leftup) {\n\t\t\tamax = tan;\n\t\t\tamin = 0;\n\t\t}\n\t\telse {\n\t\t\tamax = 1e18;\n\t\t\tamin = tan;\n\t\t}\n\t}\n\tif (ok) {\n\t\tint rep = 1000;\n\t\twhile (rep--) {\n\t\t\tconst ld amidtan = (amin + amax) / 2;\n\t\t\tconst ld theta = atan(amidtan);\n\t\t\tconst ld vx = V*cos(theta);\n\t\t\tconst ld vy = V*sin(theta);\n\t\t\tconst ld time = p.real() / vx;\n\t\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\t\tif (ay > p.imag()) {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst ld amidtan = (amin + amax) / 2;\n\t\tconst ld theta = atan(amidtan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\ttans.push_back(amin);\n\t}\n}\n\nint main() { cin >> N >> V >> X >> Y;\n\tvector<box>bs;\n\tvector<ld>tans;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint L, B, R, T; cin >> L >> B >> R >> T;\n\n\t\tR = min(R, X);\n\t\tbox b;\n\t\tb.xs.push_back(L);\n\t\tb.xs.push_back(R);\n\t\tb.ys.push_back(B);\n\t\tb.ys.push_back(T);\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tfor (int y = 0; y < 2; ++y) {\n\t\t\t\tPoint p(b.xs[x], b.ys[y]);\n\t\t\t\tgettan(tans, p, (x + y) % 2);\n\t\t\t\t//gettan(tans, p, (x + y+1) % 2);\n\t\t\t}\n\t\t}\n\t\tif (L >= X)continue;\n\t\tbs.push_back(b);\n\t}\n\tconst ld down = Y;\n\tld up = 1e18;\n\tfor (int i = 0; i < bs.size(); ++i) {\n\t\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\n\t\t\tif (bs[i].ys[0] > Y) {\n\n\t\t\t\tup = min(up, bs[i].ys[0]);\n\t\t\t}\n\t\t}\n\t}\n\t\n\t{\n\t\tPoint p(X,Y);\n\t\tgettan(tans, p,true);\n\t}\n\t{\n\t\tfor (int y = 1; y <= 300; ++y) {\n\t\t\tif (V*V / 2 >= y) {\n\t\t\t\tld vy = sqrt(2 * y);\n\t\t\t\tif (vy > V)break;\n\t\t\t\tld vx = sqrt(V*V - vy*vy);\n\t\t\t\tld tan = vy / vx;\n\t\t\t\ttans.push_back(tan);\n\t\t\t}\n\t\t}\n\t}\n\tsort(tans.begin(), tans.end());\n\t{\n\t\tvector<ld>ntans;\n\t\tfor (int i = 0; i < tans.size(); ++i) {\n\t\t\tntans.push_back(tans[i]);\n\t\t\tif (i != tans.size() - 1) {\n\t\t\t\tntans.push_back((tans[i] + tans[i + 1]) / 2);\n\t\t\t}\n\t\t}\n\t\ttans = ntans;\n\t}\n\tstring ans = \"No\";\n\tfor (auto t : tans) {\n\t\tconst ld theta = atan(t);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = X / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\tif (down-eps <= ay&&ay <= up+eps) {\n\t\t\tbool ok = true;\n\t\t\tfor (int i = 0; i < bs.size(); ++i) {\n\t\t\t\tauto b = bs[i];\n\n\t\t\t\tif (!check(theta, b)) {\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (ok) {\n\n\t\t\t\tconst ld vx = V*cos(theta);\n\t\t\t\tconst ld vy = V*sin(theta);\n\t\t\t\t//cout << \"vx:\" << vx << \" vy:\" << vy << endl;\n\t\t\t\tfor (int x = 0; x <=100; ++x) {\n\t\t\t\t\tconst ld t = x / vx;\n\t\t\t\t\t//cout << \"x:\" << x << endl;\n\t\t\t\t\t//cout << \"y:\" << vy*t - G*t*t / 2 << endl;\n\t\t\t\t}\t\n\t\t\t\tans = \"Yes\";\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcontinue;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3568,"score_of_the_acc":-0.8933,"final_rank":2},{"submission_id":"aoj_2308_1777433","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;\ntemplate<class T>\nusing Table = vector<vector<T>>;\nconst ld eps=1e-9;\n\n//// < \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\a.txt\"\n\n\n/* ??????????????¬ */\n\n#include <complex>\n\ntypedef long double ld;\ntypedef complex<ld> Point;\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// ????????\\???\nPoint input_point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// ????????????????????????\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// ??????\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// ??????\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// ??´????????????\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// ????????????\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// CCW\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\n\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\n\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\n\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\n\treturn 0; // a,c,b???????????´???????????¶\n}\n\n\n/* ???????????? */\n\n// ??´?????¨??´??????????????????\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// ??´?????¨?????????????????????\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// ????????¨?????????????????????\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// ????????´????????????\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// ?????????????????????\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// ??????????¶?\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// ????????¨???????????????\n//???????????£????????¨???????????¨assert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//??????isis_ss?????????\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// ??´?????¨???????????¢\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n// ??´?????¨??´???????????¢\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// ??´?????¨??????????????¢\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// ????????¨???????????¢\nld dist_sp(const Line& s, const 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\n// ????????¨??????????????¢\nld dist_ss(const Line& s, const 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\n\n//??´?????¨??´?????????????????????????????????\nLine bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:??????\n//c:????????§??????\n//???????????´?????????????????¢?????????????±??????????\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* ??? */\n\n// ?????¨????????????\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n//???????????????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n//???lc??????rc??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint circle_in_circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// ?????¨??´????????????\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// ?????¨??????????????¢\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), ALL(nret));\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//??????????????????????????¢???\nld two_circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* ????§???¢ */\n\ntypedef vector<Point> Polygon;\n\n// ??¢???\nld area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n// ????§???¢????????¢??????\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// ??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//??????????????????2?????????\nenum { OUT, ON, IN };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// ??????\n// ???????????????????????¨????????????????????§??¨???\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n// ????????????\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon Q;\n\tPolygon R;\n\tREP(i, n) {\n\t\tPoint A = ps[i], B = ps[(i + 1) % n];\n\t\tLine m = Line(A, B);\n\t\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\n\t\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\n\t\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\n\t\t\tQ.push_back(is_ll(l, m));\n\t\t\tR.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ Q,R };\n\treturn polys;\n}\n\n\n/* ??¢??¬??????????????? */\nvoid add_point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\ntypedef int Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\n\tg[from].push_back(Edge{ from, to, weight });\n}\n\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\n\tint n = p.size(), m = s.size();\n\tGraph g(n);\n\tREP(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\tREP(j, n) if (isis_sp(s[i], p[j]))\n\t\t\tvec.emplace_back(abs(s[i].a - p[j]), j);\n\t\tsort(ALL(vec));\n\t\tREP(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\n\t\t}\n\t}\n\treturn g;\n}\nGraph sennbunn_arrangement(const vector<Line>&s) {\n\tvector<Point>crss;\n\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\n\t\t\tif (isis_ss(s[i], s[j])) {\n\t\t\t\tcrss.push_back(is_ll(s[i], s[j]));\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\n\t\tcrss.push_back(s[i][0]);\n\t\tcrss.push_back(s[i][1]);\n\t}\n\treturn segment_arrangement(s, crss);\n}\n\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\n//\tint n = p.size(), m = c.size();\n//\tGraph g(n);\n//\tREP(i, m) {\n//\t\tvector<pair<ld, int>> vec;\n//\t\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\n//\t\t\tvec.emplace_back(arg(c[i].p - p[j]), j);\n//\t\tsort(ALL(vec));\n//\t\tREP(j, vec.size() - 1) {\n//\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n//\t\t\tld angle = vec[j + 1].first - vec[j].first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t\tif (vec.size() >= 2) {\n//\t\t\tint from = vec.back().second, to = vec.front().first;\n//\t\t\tld angle = vec.front().first - vec.back().first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t}\n//\treturn g;\n//}\n\n\n\nconst ld G= 9.8;\n\nstruct box {\n\tvector<ld>xs;\n\tvector<ld>ys;\n};\n\n\nint N, V, X, Y;\nbool check(const ld theta, const box& b) {\n\n\tconst ld vx = V*cos(theta);\n\tconst ld vy = V*sin(theta);\n\n\tld y_max = -1e18;\n\tld y_min = 1e18;\n\n\t//?????????????¢????\n\t{\n\t\tconst ld toptime = vy / G;\n\t\tconst ld top_x = toptime*vx;\n\t\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\n\t\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\n\t\t\ty_max = max(y_max, top_y);\n\t\t}\n\t}\n\t//???????????????????¢????\n\t{\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tconst ld time = b.xs[x]/vx;\n\t\t\tconst ld ay = vy*time - time*time*G / 2;\n\t\t\ty_max = max(y_max, ay);\n\t\t\ty_min = min(y_min, ay);\n\t\t}\n\t}\n\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\n\t\t\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\n\tif (p.real() < eps)return;\n\tbool ok = true;\n\tld amin, amax;\n\n\t//?????????????¨????\n\t{\n\t\tconst ld tan = V*V / G / p.real();\n\t\tconst ld theta = atan(tan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld max_y = vy*time - G*time*time / 2;\n\t\tif (max_y < p.imag()) {\n\t\t\tok = false;\n\t\t}\n\t\tif (leftup) {\n\t\t\tamax = tan;\n\t\t\tamin = 0;\n\t\t}\n\t\telse {\n\t\t\tamax = 1e18;\n\t\t\tamin = tan;\n\t\t}\n\t}\n\tif (ok) {\n\t\tint rep = 1000;\n\t\twhile (rep--) {\n\t\t\tconst ld amidtan = (amin + amax) / 2;\n\t\t\tconst ld theta = atan(amidtan);\n\t\t\tconst ld vx = V*cos(theta);\n\t\t\tconst ld vy = V*sin(theta);\n\t\t\tconst ld time = p.real() / vx;\n\t\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\t\tif (ay > p.imag()) {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst ld amidtan = (amin + amax) / 2;\n\t\tconst ld theta = atan(amidtan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\ttans.push_back(amin);\n\t}\n}\n\nint main() { cin >> N >> V >> X >> Y;\n\tvector<box>bs;\n\tvector<ld>tans;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint L, B, R, T; cin >> L >> B >> R >> T;\n\n\t\tR = min(R, X);\n\t\tbox b;\n\t\tb.xs.push_back(L);\n\t\tb.xs.push_back(R);\n\t\tb.ys.push_back(B);\n\t\tb.ys.push_back(T);\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tfor (int y = 0; y < 2; ++y) {\n\t\t\t\tPoint p(b.xs[x], b.ys[y]);\n\t\t\t\tgettan(tans, p, (x + y) % 2);\n\t\t\t\t//gettan(tans, p, (x + y+1) % 2);\n\t\t\t}\n\t\t}\n\t\t//if (L >= X)continue;\n\t\tbs.push_back(b);\n\t}\n\tconst ld down = Y;\n\tld up = 1e18;\n\tfor (int i = 0; i < bs.size(); ++i) {\n\t\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\n\t\t\tif (bs[i].ys[0] > Y) {\n\n\t\t\t\tup = min(up, bs[i].ys[0]);\n\t\t\t}\n\t\t}\n\t}\n\t\n\t{\n\t\tPoint p(X,Y);\n\t\tgettan(tans, p,true);\n\t}\n\t{\n\t\tfor (int y = 1; y <= 300; ++y) {\n\t\t\tif (V*V / 2 >= y) {\n\t\t\t\tld vy = sqrt(2 * y);\n\t\t\t\tif (vy > V)break;\n\t\t\t\tld vx = sqrt(V*V - vy*vy);\n\t\t\t\tld tan = vy / vx;\n\t\t\t\ttans.push_back(tan);\n\t\t\t}\n\t\t}\n\t}\n\tsort(tans.begin(), tans.end());\n\t{\n\t\tvector<ld>ntans;\n\t\tfor (int i = 0; i < tans.size(); ++i) {\n\t\t\tntans.push_back(tans[i]);\n\t\t\tif (i != tans.size() - 1) {\n\t\t\t\tntans.push_back((tans[i] + tans[i + 1]) / 2);\n\t\t\t}\n\t\t}\n\t\ttans = ntans;\n\t}\n\tstring ans = \"No\";\n\tfor (auto t : tans) {\n\t\tconst ld theta = atan(t);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = X / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\tif (down-eps <= ay&&ay <= up+eps) {\n\t\t\tbool ok = true;\n\t\t\tfor (int i = 0; i < bs.size(); ++i) {\n\t\t\t\tauto b = bs[i];\n\n\t\t\t\tif (!check(theta, b)) {\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (ok) {\n\n\t\t\t\tconst ld vx = V*cos(theta);\n\t\t\t\tconst ld vy = V*sin(theta);\n\t\t\t\t//cout << \"vx:\" << vx << \" vy:\" << vy << endl;\n\t\t\t\tfor (int x = 0; x <=100; ++x) {\n\t\t\t\t\tconst ld t = x / vx;\n\t\t\t\t\t//cout << \"x:\" << x << endl;\n\t\t\t\t\t//cout << \"y:\" << vy*t - G*t*t / 2 << endl;\n\t\t\t\t}\t\n\t\t\t\tans = \"Yes\";\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcontinue;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.2,"time_ms":30,"memory_kb":3580,"score_of_the_acc":-0.8979,"final_rank":15},{"submission_id":"aoj_2308_1777230","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;\ntemplate<class T>\nusing Table = vector<vector<T>>;\nconst ld eps=1e-9;\n\n//// < \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\a.txt\"\n\n\n/* ??????????????¬ */\n\n#include <complex>\n\ntypedef long double ld;\ntypedef complex<ld> Point;\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// ????????\\???\nPoint input_point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// ????????????????????????\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// ??????\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// ??????\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// ??´????????????\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// ????????????\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// CCW\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\n\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\n\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\n\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\n\treturn 0; // a,c,b???????????´???????????¶\n}\n\n\n/* ???????????? */\n\n// ??´?????¨??´??????????????????\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// ??´?????¨?????????????????????\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// ????????¨?????????????????????\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// ????????´????????????\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// ?????????????????????\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// ??????????¶?\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// ????????¨???????????????\n//???????????£????????¨???????????¨assert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//??????isis_ss?????????\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// ??´?????¨???????????¢\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n// ??´?????¨??´???????????¢\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// ??´?????¨??????????????¢\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// ????????¨???????????¢\nld dist_sp(const Line& s, const 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\n// ????????¨??????????????¢\nld dist_ss(const Line& s, const 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\n\n//??´?????¨??´?????????????????????????????????\nLine bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:??????\n//c:????????§??????\n//???????????´?????????????????¢?????????????±??????????\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* ??? */\n\n// ?????¨????????????\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n//???????????????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n//???lc??????rc??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint circle_in_circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// ?????¨??´????????????\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// ?????¨??????????????¢\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), ALL(nret));\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//??????????????????????????¢???\nld two_circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* ????§???¢ */\n\ntypedef vector<Point> Polygon;\n\n// ??¢???\nld area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n// ????§???¢????????¢??????\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// ??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//??????????????????2?????????\nenum { OUT, ON, IN };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// ??????\n// ???????????????????????¨????????????????????§??¨???\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n// ????????????\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon Q;\n\tPolygon R;\n\tREP(i, n) {\n\t\tPoint A = ps[i], B = ps[(i + 1) % n];\n\t\tLine m = Line(A, B);\n\t\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\n\t\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\n\t\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\n\t\t\tQ.push_back(is_ll(l, m));\n\t\t\tR.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ Q,R };\n\treturn polys;\n}\n\n\n/* ??¢??¬??????????????? */\nvoid add_point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\ntypedef int Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\n\tg[from].push_back(Edge{ from, to, weight });\n}\n\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\n\tint n = p.size(), m = s.size();\n\tGraph g(n);\n\tREP(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\tREP(j, n) if (isis_sp(s[i], p[j]))\n\t\t\tvec.emplace_back(abs(s[i].a - p[j]), j);\n\t\tsort(ALL(vec));\n\t\tREP(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\n\t\t}\n\t}\n\treturn g;\n}\nGraph sennbunn_arrangement(const vector<Line>&s) {\n\tvector<Point>crss;\n\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\n\t\t\tif (isis_ss(s[i], s[j])) {\n\t\t\t\tcrss.push_back(is_ll(s[i], s[j]));\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\n\t\tcrss.push_back(s[i][0]);\n\t\tcrss.push_back(s[i][1]);\n\t}\n\treturn segment_arrangement(s, crss);\n}\n\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\n//\tint n = p.size(), m = c.size();\n//\tGraph g(n);\n//\tREP(i, m) {\n//\t\tvector<pair<ld, int>> vec;\n//\t\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\n//\t\t\tvec.emplace_back(arg(c[i].p - p[j]), j);\n//\t\tsort(ALL(vec));\n//\t\tREP(j, vec.size() - 1) {\n//\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n//\t\t\tld angle = vec[j + 1].first - vec[j].first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t\tif (vec.size() >= 2) {\n//\t\t\tint from = vec.back().second, to = vec.front().first;\n//\t\t\tld angle = vec.front().first - vec.back().first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t}\n//\treturn g;\n//}\n\n\n\nconst ld G= 9.8;\n\nstruct box {\n\tvector<ld>xs;\n\tvector<ld>ys;\n};\n\n\nint N, V, X, Y;\nbool check(const ld theta, const box& b) {\n\n\tconst ld vx = V*cos(theta);\n\tconst ld vy = V*sin(theta);\n\n\tld y_max = -1e18;\n\tld y_min = 1e18;\n\n\t//?????????????¢????\n\t{\n\t\tconst ld toptime = vy / G;\n\t\tconst ld top_x = toptime*vx;\n\t\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\n\t\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\n\t\t\ty_max = max(y_max, top_y);\n\t\t}\n\t}\n\t//???????????????????¢????\n\t{\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tconst ld time = b.xs[x]/vx;\n\t\t\tconst ld ay = vy*time - time*time*G / 2;\n\t\t\ty_max = max(y_max, ay);\n\t\t\ty_min = min(y_min, ay);\n\t\t}\n\t}\n\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\n\t\t\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\n\tif (p.real() < eps)return;\n\tbool ok = true;\n\tld amin, amax;\n\n\t//?????????????¨????\n\t{\n\t\tconst ld tan = V*V / G / p.real();\n\t\tconst ld theta = atan(tan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld max_y = vy*time - G*time*time / 2;\n\t\tif (max_y < p.imag()) {\n\t\t\tok = false;\n\t\t}\n\t\tif (leftup) {\n\t\t\tamax = tan;\n\t\t\tamin = 0;\n\t\t}\n\t\telse {\n\t\t\tamax = 1e18;\n\t\t\tamin = tan;\n\t\t}\n\t}\n\tif (ok) {\n\t\tint rep = 1000;\n\t\twhile (rep--) {\n\t\t\tconst ld amidtan = (amin + amax) / 2;\n\t\t\tconst ld theta = atan(amidtan);\n\t\t\tconst ld vx = V*cos(theta);\n\t\t\tconst ld vy = V*sin(theta);\n\t\t\tconst ld time = p.real() / vx;\n\t\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\t\tif (ay > p.imag()) {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst ld amidtan = (amin + amax) / 2;\n\t\tconst ld theta = atan(amidtan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\ttans.push_back(amin);\n\t}\n}\n\nint main() { cin >> N >> V >> X >> Y;\n\tvector<box>bs;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint L, B, R, T; cin >> L >> B >> R >> T;\n\t\tbox b;\n\t\tb.xs.push_back(L);\n\t\tb.xs.push_back(R);\n\t\tb.ys.push_back(B);\n\t\tb.ys.push_back(T);\n\t\tbs.push_back(b);\n\t}\n\tconst ld down = Y;\n\tld up = 1e18;\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\n\t\t\tif (bs[i].ys[0] > Y) {\n\n\t\t\t\tup = min(up, bs[i].ys[0]);\n\t\t\t}\n\t\t}\n\t}\n\tvector<ld>tans;\n\tfor (auto b : bs) {\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tfor (int y = 0; y < 2; ++y) {\n\t\t\t\tPoint p(b.xs[x], b.ys[y]);\n\t\t\t\tgettan(tans, p,(x+y)%2);\n\t\t\t\t//gettan(tans, p, (x + y+1) % 2);\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tPoint p(X,Y);\n\t\tgettan(tans, p,true);\n\t}\n\t{\n\t\tfor (int y = 1; y <= 300; ++y) {\n\t\t\tif (V*V / 2 >= y) {\n\t\t\t\tld vy = sqrt(2 * y);\n\t\t\t\tif (vy > V)break;\n\t\t\t\tld vx = sqrt(V*V - vy*vy);\n\t\t\t\tld tan = vy / vx;\n\t\t\t\ttans.push_back(tan);\n\t\t\t}\n\t\t}\n\t}\n\tsort(tans.begin(), tans.end());\n\t{\n\t\tvector<ld>ntans;\n\t\tfor (int i = 0; i < tans.size(); ++i) {\n\t\t\tntans.push_back(tans[i]);\n\t\t\tif (i != tans.size() - 1) {\n\t\t\t\tntans.push_back((tans[i] + tans[i + 1]) / 2);\n\t\t\t}\n\t\t}\n\t\ttans = ntans;\n\t}\n\n\tstring ans = \"No\";\n\tfor (auto t : tans) {\n\t\tconst ld theta = atan(t);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = X / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\tif (down-eps <= ay&&ay <= up+eps) {\n\t\t\tbool ok = true;\n\t\t\tfor (auto b : bs) {\n\t\t\t\tif (!check(theta, b)) {\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\tif (ok) {\n\n\t\t\t\tconst ld vx = V*cos(theta);\n\t\t\t\tconst ld vy = V*sin(theta);\n\t\t\t\t//cout << \"vx:\" << vx << \" vy:\" << vy << endl;\n\t\t\t\tfor (int x = 0; x <=100; ++x) {\n\t\t\t\t\tconst ld t = x / vx;\n\t\t\t\t\t//cout << \"x:\" << x << endl;\n\t\t\t\t\t//cout << \"y:\" << vy*t - G*t*t / 2 << endl;\n\t\t\t\t}\t\t\t\t\tans = \"Yes\";\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcontinue;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.2,"time_ms":30,"memory_kb":3520,"score_of_the_acc":-0.8749,"final_rank":13},{"submission_id":"aoj_2308_1777183","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;\ntemplate<class T>\nusing Table = vector<vector<T>>;\nconst ld eps=1e-9;\n\n//// < \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\a.txt\"\n\n\n/* ??????????????¬ */\n\n#include <complex>\n\ntypedef long double ld;\ntypedef complex<ld> Point;\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// ????????\\???\nPoint input_point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// ????????????????????????\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// ??????\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// ??????\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// ??´????????????\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// ????????????\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// CCW\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\n\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\n\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\n\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\n\treturn 0; // a,c,b???????????´???????????¶\n}\n\n\n/* ???????????? */\n\n// ??´?????¨??´??????????????????\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// ??´?????¨?????????????????????\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// ????????¨?????????????????????\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// ????????´????????????\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// ?????????????????????\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// ??????????¶?\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// ????????¨???????????????\n//???????????£????????¨???????????¨assert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//??????isis_ss?????????\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// ??´?????¨???????????¢\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n// ??´?????¨??´???????????¢\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// ??´?????¨??????????????¢\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// ????????¨???????????¢\nld dist_sp(const Line& s, const 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\n// ????????¨??????????????¢\nld dist_ss(const Line& s, const 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\n\n//??´?????¨??´?????????????????????????????????\nLine bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:??????\n//c:????????§??????\n//???????????´?????????????????¢?????????????±??????????\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* ??? */\n\n// ?????¨????????????\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n//???????????????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n//???lc??????rc??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint circle_in_circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// ?????¨??´????????????\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// ?????¨??????????????¢\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), ALL(nret));\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//??????????????????????????¢???\nld two_circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* ????§???¢ */\n\ntypedef vector<Point> Polygon;\n\n// ??¢???\nld area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n// ????§???¢????????¢??????\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// ??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//??????????????????2?????????\nenum { OUT, ON, IN };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// ??????\n// ???????????????????????¨????????????????????§??¨???\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n// ????????????\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon Q;\n\tPolygon R;\n\tREP(i, n) {\n\t\tPoint A = ps[i], B = ps[(i + 1) % n];\n\t\tLine m = Line(A, B);\n\t\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\n\t\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\n\t\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\n\t\t\tQ.push_back(is_ll(l, m));\n\t\t\tR.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ Q,R };\n\treturn polys;\n}\n\n\n/* ??¢??¬??????????????? */\nvoid add_point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\ntypedef int Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\n\tg[from].push_back(Edge{ from, to, weight });\n}\n\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\n\tint n = p.size(), m = s.size();\n\tGraph g(n);\n\tREP(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\tREP(j, n) if (isis_sp(s[i], p[j]))\n\t\t\tvec.emplace_back(abs(s[i].a - p[j]), j);\n\t\tsort(ALL(vec));\n\t\tREP(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\n\t\t}\n\t}\n\treturn g;\n}\nGraph sennbunn_arrangement(const vector<Line>&s) {\n\tvector<Point>crss;\n\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\n\t\t\tif (isis_ss(s[i], s[j])) {\n\t\t\t\tcrss.push_back(is_ll(s[i], s[j]));\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\n\t\tcrss.push_back(s[i][0]);\n\t\tcrss.push_back(s[i][1]);\n\t}\n\treturn segment_arrangement(s, crss);\n}\n\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\n//\tint n = p.size(), m = c.size();\n//\tGraph g(n);\n//\tREP(i, m) {\n//\t\tvector<pair<ld, int>> vec;\n//\t\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\n//\t\t\tvec.emplace_back(arg(c[i].p - p[j]), j);\n//\t\tsort(ALL(vec));\n//\t\tREP(j, vec.size() - 1) {\n//\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n//\t\t\tld angle = vec[j + 1].first - vec[j].first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t\tif (vec.size() >= 2) {\n//\t\t\tint from = vec.back().second, to = vec.front().first;\n//\t\t\tld angle = vec.front().first - vec.back().first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t}\n//\treturn g;\n//}\n\n\n\nconst ld G= 9.8;\n\nstruct box {\n\tvector<ld>xs;\n\tvector<ld>ys;\n};\n\n\nint N, V, X, Y;\nbool check(const ld theta, const box& b) {\n\n\tconst ld vx = V*cos(theta);\n\tconst ld vy = V*sin(theta);\n\n\tld y_max = -1e18;\n\tld y_min = 1e18;\n\n\t//?????????????¢????\n\t{\n\t\tconst ld toptime = vy / G;\n\t\tconst ld top_x = toptime*vx;\n\t\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\n\t\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\n\t\t\ty_max = max(y_max, top_y);\n\t\t}\n\t}\n\t//???????????????????¢????\n\t{\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tconst ld time = b.xs[x]/vx;\n\t\t\tconst ld ay = vy*time - time*time*G / 2;\n\t\t\ty_max = max(y_max, ay);\n\t\t\ty_min = min(y_min, ay);\n\t\t}\n\t}\n\tif (y_max- 1e-7 < b.ys[0] || b.ys[1] < y_min + 1e-7) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\n\tif (p.real() < eps)return;\n\tbool ok = true;\n\tld amin, amax;\n\n\t//?????????????¨????\n\t{\n\t\tconst ld tan = V*V / G / p.real();\n\t\tconst ld theta = atan(tan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld max_y = vy*time - G*time*time / 2;\n\t\tif (max_y < p.imag()) {\n\t\t\tok = false;\n\t\t}\n\t\tif (leftup) {\n\t\t\tamax = tan;\n\t\t\tamin = 0;\n\t\t}\n\t\telse {\n\t\t\tamax = 1e18;\n\t\t\tamin = tan;\n\t\t}\n\t}\n\tif (ok) {\n\t\tint rep = 1000;\n\t\twhile (rep--) {\n\t\t\tconst ld amidtan = (amin + amax) / 2;\n\t\t\tconst ld theta = atan(amidtan);\n\t\t\tconst ld vx = V*cos(theta);\n\t\t\tconst ld vy = V*sin(theta);\n\t\t\tconst ld time = p.real() / vx;\n\t\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\t\tif (ay > p.imag()) {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst ld amidtan = (amin + amax) / 2;\n\t\tconst ld theta = atan(amidtan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\ttans.push_back(amin);\n\t}\n}\n\nint main() { cin >> N >> V >> X >> Y;\n\tvector<box>bs;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint L, B, R, T; cin >> L >> B >> R >> T;\n\t\tbox b;\n\t\tb.xs.push_back(L);\n\t\tb.xs.push_back(R);\n\t\tb.ys.push_back(B);\n\t\tb.ys.push_back(T);\n\t\tbs.push_back(b);\n\t}\n\tconst ld down = Y;\n\tld up = 1e18;\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\n\t\t\tif (bs[i].ys[0] > Y) {\n\n\t\t\t\tup = min(up, bs[i].ys[0]);\n\t\t\t}\n\t\t}\n\t}\n\tvector<ld>tans;\n\tfor (auto b : bs) {\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tfor (int y = 0; y < 2; ++y) {\n\t\t\t\tPoint p(b.xs[x], b.ys[y]);\n\t\t\t\tgettan(tans, p,(x+y)%2);\n\t\t\t\t//gettan(tans, p, (x + y+1) % 2);\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tPoint p(X,Y);\n\t\tgettan(tans, p,true);\n\t}\n\tsort(tans.begin(), tans.end());\n\t{\n\t\tvector<ld>ntans;\n\t\tfor (int i = 0; i < tans.size(); ++i) {\n\t\t\tntans.push_back(tans[i]);\n\t\t\tif (i != tans.size() - 1) {\n\t\t\t\tntans.push_back((tans[i] + tans[i + 1]) / 2);\n\t\t\t}\n\t\t}\n\t\t//tans = ntans;\n\t}\n\n\tstring ans = \"No\";\n\tfor (auto t : tans) {\n\t\tconst ld theta = atan(t);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = X / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\tif (down-eps <= ay&&ay <= up+eps) {\n\t\t\tbool ok = true;\n\t\t\tfor (auto b : bs) {\n\t\t\t\tif (!check(theta, b))ok = false;\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\tans = \"Yes\";\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcontinue;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.2,"time_ms":40,"memory_kb":3472,"score_of_the_acc":-0.8777,"final_rank":14},{"submission_id":"aoj_2308_1777179","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;\ntemplate<class T>\nusing Table = vector<vector<T>>;\nconst ld eps=1e-9;\n\n//// < \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\a.txt\"\n\n\n/* ??????????????¬ */\n\n#include <complex>\n\ntypedef long double ld;\ntypedef complex<ld> Point;\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// ????????\\???\nPoint input_point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// ????????????????????????\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// ??????\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// ??????\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// ??´????????????\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// ????????????\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// CCW\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\n\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\n\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\n\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\n\treturn 0; // a,c,b???????????´???????????¶\n}\n\n\n/* ???????????? */\n\n// ??´?????¨??´??????????????????\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// ??´?????¨?????????????????????\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// ????????¨?????????????????????\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// ????????´????????????\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// ?????????????????????\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// ??????????¶?\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// ????????¨???????????????\n//???????????£????????¨???????????¨assert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//??????isis_ss?????????\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// ??´?????¨???????????¢\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n// ??´?????¨??´???????????¢\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// ??´?????¨??????????????¢\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// ????????¨???????????¢\nld dist_sp(const Line& s, const 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\n// ????????¨??????????????¢\nld dist_ss(const Line& s, const 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\n\n//??´?????¨??´?????????????????????????????????\nLine bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:??????\n//c:????????§??????\n//???????????´?????????????????¢?????????????±??????????\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* ??? */\n\n// ?????¨????????????\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n//???????????????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n//???lc??????rc??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint circle_in_circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// ?????¨??´????????????\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// ?????¨??????????????¢\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), ALL(nret));\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//??????????????????????????¢???\nld two_circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* ????§???¢ */\n\ntypedef vector<Point> Polygon;\n\n// ??¢???\nld area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n// ????§???¢????????¢??????\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// ??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//??????????????????2?????????\nenum { OUT, ON, IN };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// ??????\n// ???????????????????????¨????????????????????§??¨???\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n// ????????????\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon Q;\n\tPolygon R;\n\tREP(i, n) {\n\t\tPoint A = ps[i], B = ps[(i + 1) % n];\n\t\tLine m = Line(A, B);\n\t\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\n\t\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\n\t\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\n\t\t\tQ.push_back(is_ll(l, m));\n\t\t\tR.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ Q,R };\n\treturn polys;\n}\n\n\n/* ??¢??¬??????????????? */\nvoid add_point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\ntypedef int Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\n\tg[from].push_back(Edge{ from, to, weight });\n}\n\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\n\tint n = p.size(), m = s.size();\n\tGraph g(n);\n\tREP(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\tREP(j, n) if (isis_sp(s[i], p[j]))\n\t\t\tvec.emplace_back(abs(s[i].a - p[j]), j);\n\t\tsort(ALL(vec));\n\t\tREP(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\n\t\t}\n\t}\n\treturn g;\n}\nGraph sennbunn_arrangement(const vector<Line>&s) {\n\tvector<Point>crss;\n\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\n\t\t\tif (isis_ss(s[i], s[j])) {\n\t\t\t\tcrss.push_back(is_ll(s[i], s[j]));\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\n\t\tcrss.push_back(s[i][0]);\n\t\tcrss.push_back(s[i][1]);\n\t}\n\treturn segment_arrangement(s, crss);\n}\n\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\n//\tint n = p.size(), m = c.size();\n//\tGraph g(n);\n//\tREP(i, m) {\n//\t\tvector<pair<ld, int>> vec;\n//\t\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\n//\t\t\tvec.emplace_back(arg(c[i].p - p[j]), j);\n//\t\tsort(ALL(vec));\n//\t\tREP(j, vec.size() - 1) {\n//\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n//\t\t\tld angle = vec[j + 1].first - vec[j].first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t\tif (vec.size() >= 2) {\n//\t\t\tint from = vec.back().second, to = vec.front().first;\n//\t\t\tld angle = vec.front().first - vec.back().first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t}\n//\treturn g;\n//}\n\n\n\nconst ld G= 9.8;\n\nstruct box {\n\tvector<ld>xs;\n\tvector<ld>ys;\n};\n\n\nint N, V, X, Y;\nbool check(const ld theta, const box& b) {\n\n\tconst ld vx = V*cos(theta);\n\tconst ld vy = V*sin(theta);\n\n\tld y_max = -1e18;\n\tld y_min = 1e18;\n\n\t//?????????????¢????\n\t{\n\t\tconst ld toptime = vy / G;\n\t\tconst ld top_x = toptime*vx;\n\t\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\n\t\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\n\t\t\ty_max = max(y_max, top_y);\n\t\t}\n\t}\n\t//???????????????????¢????\n\t{\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tconst ld time = b.xs[x]/vx;\n\t\t\tconst ld ay = vy*time - time*time*G / 2;\n\t\t\ty_max = max(y_max, ay);\n\t\t\ty_min = min(y_min, ay);\n\t\t}\n\t}\n\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\n\tif (p.real() < eps)return;\n\tbool ok = true;\n\tld amin, amax;\n\n\t//?????????????¨????\n\t{\n\t\tconst ld tan = V*V / G / p.real();\n\t\tconst ld theta = atan(tan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld max_y = vy*time - G*time*time / 2;\n\t\tif (max_y < p.imag()) {\n\t\t\tok = false;\n\t\t}\n\t\tif (leftup) {\n\t\t\tamax = tan;\n\t\t\tamin = 0;\n\t\t}\n\t\telse {\n\t\t\tamax = 1e18;\n\t\t\tamin = tan;\n\t\t}\n\t}\n\tif (ok) {\n\t\tint rep = 1000;\n\t\twhile (rep--) {\n\t\t\tconst ld amidtan = (amin + amax) / 2;\n\t\t\tconst ld theta = atan(amidtan);\n\t\t\tconst ld vx = V*cos(theta);\n\t\t\tconst ld vy = V*sin(theta);\n\t\t\tconst ld time = p.real() / vx;\n\t\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\t\tif (ay > p.imag()) {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst ld amidtan = (amin + amax) / 2;\n\t\tconst ld theta = atan(amidtan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\ttans.push_back(amin);\n\t}\n}\n\nint main() { cin >> N >> V >> X >> Y;\n\tvector<box>bs;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint L, B, R, T; cin >> L >> B >> R >> T;\n\t\tbox b;\n\t\tb.xs.push_back(L);\n\t\tb.xs.push_back(R);\n\t\tb.ys.push_back(B);\n\t\tb.ys.push_back(T);\n\t\tbs.push_back(b);\n\t}\n\tconst ld down = Y;\n\tld up = 1e18;\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\n\t\t\tif (bs[i].ys[0] > Y) {\n\n\t\t\t\tup = min(up, bs[i].ys[0]);\n\t\t\t}\n\t\t}\n\t}\n\tvector<ld>tans;\n\tfor (auto b : bs) {\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tfor (int y = 0; y < 2; ++y) {\n\t\t\t\tPoint p(b.xs[x], b.ys[y]);\n\t\t\t\tgettan(tans, p,(x+y)%2);\n\t\t\t\tgettan(tans, p, (x + y+1) % 2);\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tPoint p(X,Y);\n\t\tgettan(tans, p,true);\n\t}\n\tsort(tans.begin(), tans.end());\n\t{\n\t\tvector<ld>ntans;\n\t\tfor (int i = 0; i < tans.size(); ++i) {\n\t\t\tntans.push_back(tans[i]);\n\t\t\tif (i != tans.size() - 1) {\n\t\t\t\tntans.push_back((tans[i] + tans[i + 1]) / 2);\n\t\t\t}\n\t\t}\n\t\ttans = ntans;\n\t}\n\n\tstring ans = \"No\";\n\tfor (auto t : tans) {\n\t\tconst ld theta = atan(t);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = X / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\tif (down-eps <= ay&&ay <= up+eps) {\n\t\t\tbool ok = true;\n\t\t\tfor (auto b : bs) {\n\t\t\t\tif (!check(theta, b))ok = false;\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\tans = \"Yes\";\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcontinue;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.2,"time_ms":70,"memory_kb":3484,"score_of_the_acc":-0.9461,"final_rank":16},{"submission_id":"aoj_2308_1777166","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;\ntemplate<class T>\nusing Table = vector<vector<T>>;\nconst ld eps=1e-9;\n\n//// < \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\a.txt\"\n\n\n/* ??????????????¬ */\n\n#include <complex>\n\ntypedef long double ld;\ntypedef complex<ld> Point;\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// ????????\\???\nPoint input_point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// ????????????????????????\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// ??????\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// ??????\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// ??´????????????\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// ????????????\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// CCW\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\n\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\n\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\n\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\n\treturn 0; // a,c,b???????????´???????????¶\n}\n\n\n/* ???????????? */\n\n// ??´?????¨??´??????????????????\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// ??´?????¨?????????????????????\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// ????????¨?????????????????????\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// ????????´????????????\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// ?????????????????????\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// ??????????¶?\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// ????????¨???????????????\n//???????????£????????¨???????????¨assert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//??????isis_ss?????????\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// ??´?????¨???????????¢\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n// ??´?????¨??´???????????¢\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// ??´?????¨??????????????¢\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// ????????¨???????????¢\nld dist_sp(const Line& s, const 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\n// ????????¨??????????????¢\nld dist_ss(const Line& s, const 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\n\n//??´?????¨??´?????????????????????????????????\nLine bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:??????\n//c:????????§??????\n//???????????´?????????????????¢?????????????±??????????\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* ??? */\n\n// ?????¨????????????\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n//???????????????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n//???lc??????rc??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint circle_in_circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// ?????¨??´????????????\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// ?????¨??????????????¢\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), ALL(nret));\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//??????????????????????????¢???\nld two_circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* ????§???¢ */\n\ntypedef vector<Point> Polygon;\n\n// ??¢???\nld area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n// ????§???¢????????¢??????\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// ??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//??????????????????2?????????\nenum { OUT, ON, IN };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// ??????\n// ???????????????????????¨????????????????????§??¨???\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n// ????????????\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon Q;\n\tPolygon R;\n\tREP(i, n) {\n\t\tPoint A = ps[i], B = ps[(i + 1) % n];\n\t\tLine m = Line(A, B);\n\t\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\n\t\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\n\t\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\n\t\t\tQ.push_back(is_ll(l, m));\n\t\t\tR.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ Q,R };\n\treturn polys;\n}\n\n\n/* ??¢??¬??????????????? */\nvoid add_point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\ntypedef int Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\n\tg[from].push_back(Edge{ from, to, weight });\n}\n\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\n\tint n = p.size(), m = s.size();\n\tGraph g(n);\n\tREP(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\tREP(j, n) if (isis_sp(s[i], p[j]))\n\t\t\tvec.emplace_back(abs(s[i].a - p[j]), j);\n\t\tsort(ALL(vec));\n\t\tREP(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\n\t\t}\n\t}\n\treturn g;\n}\nGraph sennbunn_arrangement(const vector<Line>&s) {\n\tvector<Point>crss;\n\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\n\t\t\tif (isis_ss(s[i], s[j])) {\n\t\t\t\tcrss.push_back(is_ll(s[i], s[j]));\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\n\t\tcrss.push_back(s[i][0]);\n\t\tcrss.push_back(s[i][1]);\n\t}\n\treturn segment_arrangement(s, crss);\n}\n\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\n//\tint n = p.size(), m = c.size();\n//\tGraph g(n);\n//\tREP(i, m) {\n//\t\tvector<pair<ld, int>> vec;\n//\t\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\n//\t\t\tvec.emplace_back(arg(c[i].p - p[j]), j);\n//\t\tsort(ALL(vec));\n//\t\tREP(j, vec.size() - 1) {\n//\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n//\t\t\tld angle = vec[j + 1].first - vec[j].first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t\tif (vec.size() >= 2) {\n//\t\t\tint from = vec.back().second, to = vec.front().first;\n//\t\t\tld angle = vec.front().first - vec.back().first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t}\n//\treturn g;\n//}\n\n\n\nconst ld G= 9.8;\n\nstruct box {\n\tvector<ld>xs;\n\tvector<ld>ys;\n};\n\n\nint N, V, X, Y;\nbool check(const ld theta, const box& b) {\n\n\tconst ld vx = V*cos(theta);\n\tconst ld vy = V*sin(theta);\n\n\tld y_max = -1e18;\n\tld y_min = 1e18;\n\n\t//?????????????¢????\n\t{\n\t\tconst ld toptime = vy / G;\n\t\tconst ld top_x = toptime*vx;\n\t\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\n\t\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\n\t\t\ty_max = max(y_max, top_y);\n\t\t}\n\t}\n\t//???????????????????¢????\n\t{\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tconst ld time = b.xs[x]/vx;\n\t\t\tconst ld ay = vy*time - time*time*G / 2;\n\t\t\ty_max = max(y_max, ay);\n\t\t\ty_min = min(y_min, ay);\n\t\t}\n\t}\n\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\n\tif (p.real() < eps)return;\n\tbool ok = true;\n\tld amin, amax;\n\n\t//?????????????¨????\n\t{\n\t\tconst ld tan = V*V / G / p.real();\n\t\tconst ld theta = atan(tan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld max_y = vy*time - G*time*time / 2;\n\t\tif (max_y < p.imag()) {\n\t\t\tok = false;\n\t\t}\n\t\tif (leftup) {\n\t\t\tamax = tan;\n\t\t\tamin = 0;\n\t\t}\n\t\telse {\n\t\t\tamax = 1e18;\n\t\t\tamin = tan;\n\t\t}\n\t}\n\tif (ok) {\n\t\tint rep = 1000;\n\t\twhile (rep--) {\n\t\t\tconst ld amidtan = (amin + amax) / 2;\n\t\t\tconst ld theta = atan(amidtan);\n\t\t\tconst ld vx = V*cos(theta);\n\t\t\tconst ld vy = V*sin(theta);\n\t\t\tconst ld time = p.real() / vx;\n\t\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\t\tif (ay > p.imag()) {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst ld amidtan = (amin + amax) / 2;\n\t\tconst ld theta = atan(amidtan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\ttans.push_back(amin);\n\t}\n}\n\nint main() { cin >> N >> V >> X >> Y;\n\tvector<box>bs;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint L, B, R, T; cin >> L >> B >> R >> T;\n\t\tbox b;\n\t\tb.xs.push_back(L);\n\t\tb.xs.push_back(R);\n\t\tb.ys.push_back(B);\n\t\tb.ys.push_back(T);\n\t\tbs.push_back(b);\n\t}\n\tconst ld down = Y;\n\tld up = 1e18;\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\n\t\t\tif (bs[i].ys[0] > Y) {\n\n\t\t\t\tup = min(up, bs[i].ys[0]);\n\t\t\t}\n\t\t}\n\t}\n\tvector<ld>tans;\n\tfor (auto b : bs) {\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tfor (int y = 0; y < 2; ++y) {\n\t\t\t\tPoint p(b.xs[x], b.ys[y]);\n\t\t\t\tgettan(tans, p,(x+y)%2);\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tPoint p(X,Y);\n\t\tgettan(tans, p,true);\n\t}\n\tsort(tans.begin(), tans.end());\n\t{\n\t\tvector<ld>ntans;\n\t\tfor (int i = 0; i < tans.size(); ++i) {\n\t\t\tntans.push_back(tans[i]);\n\t\t\tif (i != tans.size() - 1) {\n\t\t\t\tntans.push_back((tans[i] + tans[i + 1]) / 2);\n\t\t\t}\n\t\t}\n\t\t//tans = ntans;\n\t}\n\n\tstring ans = \"No\";\n\tfor (auto t : tans) {\n\t\tconst ld theta = atan(t);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = X / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\tif (down-eps <= ay&&ay <= up+eps) {\n\t\t\tbool ok = true;\n\t\t\tfor (auto b : bs) {\n\t\t\t\tif (!check(theta, b))ok = false;\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\tans = \"Yes\";\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcontinue;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.2,"time_ms":30,"memory_kb":3504,"score_of_the_acc":-0.8687,"final_rank":12},{"submission_id":"aoj_2308_1777164","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;\ntemplate<class T>\nusing Table = vector<vector<T>>;\nconst ld eps=1e-9;\n\n//// < \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\a.txt\"\n\n\n/* ??????????????¬ */\n\n#include <complex>\n\ntypedef long double ld;\ntypedef complex<ld> Point;\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// ????????\\???\nPoint input_point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// ????????????????????????\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// ??????\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// ??????\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// ??´????????????\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// ????????????\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// CCW\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\n\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\n\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\n\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\n\treturn 0; // a,c,b???????????´???????????¶\n}\n\n\n/* ???????????? */\n\n// ??´?????¨??´??????????????????\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// ??´?????¨?????????????????????\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// ????????¨?????????????????????\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// ????????´????????????\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// ?????????????????????\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// ??????????¶?\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// ????????¨???????????????\n//???????????£????????¨???????????¨assert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//??????isis_ss?????????\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// ??´?????¨???????????¢\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n// ??´?????¨??´???????????¢\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// ??´?????¨??????????????¢\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// ????????¨???????????¢\nld dist_sp(const Line& s, const 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\n// ????????¨??????????????¢\nld dist_ss(const Line& s, const 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\n\n//??´?????¨??´?????????????????????????????????\nLine bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:??????\n//c:????????§??????\n//???????????´?????????????????¢?????????????±??????????\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* ??? */\n\n// ?????¨????????????\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n//???????????????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n//???lc??????rc??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint circle_in_circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// ?????¨??´????????????\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// ?????¨??????????????¢\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), ALL(nret));\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//??????????????????????????¢???\nld two_circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* ????§???¢ */\n\ntypedef vector<Point> Polygon;\n\n// ??¢???\nld area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n// ????§???¢????????¢??????\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// ??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//??????????????????2?????????\nenum { OUT, ON, IN };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// ??????\n// ???????????????????????¨????????????????????§??¨???\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n// ????????????\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon Q;\n\tPolygon R;\n\tREP(i, n) {\n\t\tPoint A = ps[i], B = ps[(i + 1) % n];\n\t\tLine m = Line(A, B);\n\t\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\n\t\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\n\t\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\n\t\t\tQ.push_back(is_ll(l, m));\n\t\t\tR.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ Q,R };\n\treturn polys;\n}\n\n\n/* ??¢??¬??????????????? */\nvoid add_point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\ntypedef int Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\n\tg[from].push_back(Edge{ from, to, weight });\n}\n\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\n\tint n = p.size(), m = s.size();\n\tGraph g(n);\n\tREP(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\tREP(j, n) if (isis_sp(s[i], p[j]))\n\t\t\tvec.emplace_back(abs(s[i].a - p[j]), j);\n\t\tsort(ALL(vec));\n\t\tREP(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\n\t\t}\n\t}\n\treturn g;\n}\nGraph sennbunn_arrangement(const vector<Line>&s) {\n\tvector<Point>crss;\n\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\n\t\t\tif (isis_ss(s[i], s[j])) {\n\t\t\t\tcrss.push_back(is_ll(s[i], s[j]));\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\n\t\tcrss.push_back(s[i][0]);\n\t\tcrss.push_back(s[i][1]);\n\t}\n\treturn segment_arrangement(s, crss);\n}\n\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\n//\tint n = p.size(), m = c.size();\n//\tGraph g(n);\n//\tREP(i, m) {\n//\t\tvector<pair<ld, int>> vec;\n//\t\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\n//\t\t\tvec.emplace_back(arg(c[i].p - p[j]), j);\n//\t\tsort(ALL(vec));\n//\t\tREP(j, vec.size() - 1) {\n//\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n//\t\t\tld angle = vec[j + 1].first - vec[j].first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t\tif (vec.size() >= 2) {\n//\t\t\tint from = vec.back().second, to = vec.front().first;\n//\t\t\tld angle = vec.front().first - vec.back().first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t}\n//\treturn g;\n//}\n\n\n\nconst ld G= 9.8;\n\nstruct box {\n\tvector<ld>xs;\n\tvector<ld>ys;\n};\n\n\nint N, V, X, Y;\nbool check(const ld theta, const box& b) {\n\n\tconst ld vx = V*cos(theta);\n\tconst ld vy = V*sin(theta);\n\n\tld y_max = -1e18;\n\tld y_min = 1e18;\n\n\t//?????????????¢????\n\t{\n\t\tconst ld toptime = vy / G;\n\t\tconst ld top_x = toptime*vx;\n\t\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\n\t\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\n\t\t\ty_max = max(y_max, top_y);\n\t\t}\n\t}\n\t//???????????????????¢????\n\t{\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tconst ld time = b.xs[x]/vx;\n\t\t\tconst ld ay = vy*time - time*time*G / 2;\n\t\t\ty_max = max(y_max, ay);\n\t\t\ty_min = min(y_min, ay);\n\t\t}\n\t}\n\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\n\tif (p.real() < eps)return;\n\tbool ok = true;\n\tld amin, amax;\n\n\t//?????????????¨????\n\t{\n\t\tconst ld tan = V*V / G / p.real();\n\t\tconst ld theta = atan(tan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld max_y = vy*time - G*time*time / 2;\n\t\tif (max_y < p.imag()) {\n\t\t\tok = false;\n\t\t}\n\t\tif (leftup) {\n\t\t\tamax = tan;\n\t\t\tamin = 0;\n\t\t}\n\t\telse {\n\t\t\tamax = 1e18;\n\t\t\tamin = tan;\n\t\t}\n\t}\n\tif (ok) {\n\t\tint rep = 1000;\n\t\twhile (rep--) {\n\t\t\tconst ld amidtan = (amin + amax) / 2;\n\t\t\tconst ld theta = atan(amidtan);\n\t\t\tconst ld vx = V*cos(theta);\n\t\t\tconst ld vy = V*sin(theta);\n\t\t\tconst ld time = p.real() / vx;\n\t\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\t\tif (ay > p.imag()) {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst ld amidtan = (amin + amax) / 2;\n\t\tconst ld theta = atan(amidtan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\ttans.push_back(amin);\n\t}\n}\n\nint main() { cin >> N >> V >> X >> Y;\n\tvector<box>bs;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint L, B, R, T; cin >> L >> B >> R >> T;\n\t\tbox b;\n\t\tb.xs.push_back(L);\n\t\tb.xs.push_back(R);\n\t\tb.ys.push_back(B);\n\t\tb.ys.push_back(T);\n\t\tbs.push_back(b);\n\t}\n\tconst ld down = Y;\n\tld up = 1e18;\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\n\t\t\tup = min(up, bs[i].ys[0]);\n\t\t}\n\t}\n\tvector<ld>tans;\n\tfor (auto b : bs) {\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tfor (int y = 0; y < 2; ++y) {\n\t\t\t\tPoint p(b.xs[x], b.ys[y]);\n\t\t\t\tgettan(tans, p,(x+y)%2);\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tPoint p(X,Y);\n\t\tgettan(tans, p,true);\n\t}\n\tsort(tans.begin(), tans.end());\n\t{\n\t\tvector<ld>ntans;\n\t\tfor (int i = 0; i < tans.size(); ++i) {\n\t\t\tntans.push_back(tans[i]);\n\t\t\tif (i != tans.size() - 1) {\n\t\t\t\tntans.push_back((tans[i] + tans[i + 1]) / 2);\n\t\t\t}\n\t\t}\n\t\ttans = ntans;\n\t}\n\n\tstring ans = \"No\";\n\tfor (auto t : tans) {\n\t\tconst ld theta = atan(t);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = X / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\tif (down-eps <= ay&&ay <= up+eps) {\n\t\t\tbool ok = true;\n\t\t\tfor (auto b : bs) {\n\t\t\t\tif (!check(theta, b))ok = false;\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\tans = \"Yes\";\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcontinue;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.16666666666666666,"time_ms":30,"memory_kb":3476,"score_of_the_acc":-0.8579,"final_rank":17},{"submission_id":"aoj_2308_1777161","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;\ntemplate<class T>\nusing Table = vector<vector<T>>;\nconst ld eps=1e-9;\n\n//// < \"D:\\D_Download\\Visual Studio 2015\\Projects\\programing_contest_c++\\Debug\\a.txt\"\n\n\n/* ??????????????¬ */\n\n#include <complex>\n\ntypedef long double ld;\ntypedef complex<ld> Point;\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\n\nconst ld pi = acos(-1.0);\nconst ld dtop = pi / 180.;\nconst ld ptod = 1. / dtop;\n\nnamespace std {\n\tbool operator<(const Point &lhs, const Point &rhs) {\n\t\tif (lhs.real() < rhs.real() - eps) return true;\n\t\tif (lhs.real() > rhs.real() + eps) return false;\n\t\treturn lhs.imag() < rhs.imag();\n\t}\n}\n\n// ????????\\???\nPoint input_point() {\n\tld x, y;\n\tcin >> x >> y;\n\treturn Point(x, y);\n}\n\n// ????????????????????????\nbool eq(const ld a, const ld b) {\n\treturn (abs(a - b) < eps);\n}\n\n// ??????\nld dot(const Point& a, const Point& b) {\n\treturn real(conj(a) * b);\n}\n\n// ??????\nld cross(const Point& a, const Point& b) {\n\treturn imag(conj(a) * b);\n}\n\n// ??´????????????\nclass Line {\npublic:\n\tPoint a, b;\n\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\n\tLine(Point a, Point b) : a(a), b(b) {}\n\tPoint operator[](const int _num)const {\n\t\tif (_num == 0)return a;\n\t\telse if (_num == 1)return b;\n\t\telse {\n\t\t\tassert(false);\n\t\t\treturn Point();\n\t\t}\n\t}\n};\n\n// ????????????\nclass Circle {\npublic:\n\tPoint p;\n\tld r;\n\tCircle() : p(Point(0, 0)), r(0) {}\n\tCircle(Point p, ld r) : p(p), r(r) {}\n};\n\n// CCW\nint ccw(const Point& a, const Point &b, const Point &c) {\n\tconst Point nb(b - a);\n\tconst Point nc(c - a);\n\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\n\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\n\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\n\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\n\treturn 0; // a,c,b???????????´???????????¶\n}\n\n\n/* ???????????? */\n\n// ??´?????¨??´??????????????????\nbool isis_ll(const Line& l, const Line& m) {\n\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\n}\n\n// ??´?????¨?????????????????????\nbool isis_ls(const Line& l, const Line& s) {\n\treturn isis_ll(l, s) &&\n\t\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\n}\n\n// ????????¨?????????????????????\nbool isis_ss(const Line& s, const Line& t) {\n\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n\t\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// ????????´????????????\nbool isis_lp(const Line& l, const Point& p) {\n\treturn (abs(cross(l.b - p, l.a - p)) < eps);\n}\n\n// ?????????????????????\nbool isis_sp(const Line& s, const Point& p) {\n\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\n}\n\n// ??????????¶?\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\nvector<Point> is_ll2(const Line &s, const Line& t) {\n\tPoint sv = s.b - s.a, tv = t.b - t.a;\n\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\n\telse {\n\t\tvector<Point>ans;\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\n\t\t\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\n\t\t}\n\t\treturn ans;\n\t}\n}\n// ????????¨???????????????\n//???????????£????????¨???????????¨assert(false)\nPoint is_ss(const Line &s, const Line& t) {\n\tif (isis_ss(s, t)) {\n\t\tfor (int k = 0; k < 2; ++k) {\n\t\t\tfor (int l = 0; l < 2; ++l) {\n\t\t\t\tif (s[k] == t[l])return s[k];\n\t\t\t}\n\t\t}\n\t\treturn is_ll(s, t);\n\t}\n\telse {\n\t\t//??????isis_ss?????????\n\t\tassert(false);\n\t\treturn Point(0, 0);\n\t}\n}\n// ??´?????¨???????????¢\nld dist_lp(const Line& l, const Point& p) {\n\treturn abs(p - proj(l, p));\n}\n\n// ??´?????¨??´???????????¢\nld dist_ll(const Line& l, const Line& m) {\n\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\n}\n\n// ??´?????¨??????????????¢\nld dist_ls(const Line& l, const Line& s) {\n\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\n}\n\n// ????????¨???????????¢\nld dist_sp(const Line& s, const 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\n// ????????¨??????????????¢\nld dist_ss(const Line& s, const 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\n\n//??´?????¨??´?????????????????????????????????\nLine bisection(const Line &s, const Line &t) {\n\tconst Point laglanju(is_ll(s, t));\n\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\n\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\n\n\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\n}\n\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nPoint inner_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\n\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\n\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\n\tif (bi1[0] == bi2[0])return bi1[0];\n\telse {\n\t\treturn is_ll(bi1, bi2);\n\t}\n}\n\n//???????????´?????????????????????\n//???????????´??????????????§???????????¨????¢?????????¨?????????\nvector<Point> ex_center(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\n\t\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\n\t}\n\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\n\tvector<Point>ecs;\n\tfor (int i = 0; i < 3; ++i) {\n\t\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\n\t\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\n\t\tecs.push_back(is_ll(bi1, bi2));\n\t}\n\treturn ecs;\n}\n\n\n//a,b:??????\n//c:????????§??????\n//???????????´?????????????????¢?????????????±??????????\nvector<Point> same_dis(const vector<Line>&ls) {\n\tvector<Point>vertics;\n\tvertics.push_back(is_ll(ls[0], ls[2]));\n\tvertics.push_back(is_ll(ls[1], ls[2]));\n\n\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\n\tLine bis(bisection(ls[0], ls[1]));\n\tvector<Point>ecs;\n\n\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, abi));\n\n\n\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\n\tecs.push_back(is_ll(bis, bbi));\n\n\treturn ecs;\n}\n/* ??? */\n\n// ?????¨????????????\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\n\tvector<Point> res;\n\tld d = abs(c1.p - c2.p);\n\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n\tld dfr = c1.r * c1.r - rc * rc;\n\tif (abs(dfr) < eps) dfr = 0.0;\n\telse if (dfr < 0.0) return res; // no intersection\n\tld rs = sqrt(dfr);\n\tPoint diff = (c2.p - c1.p) / d;\n\tres.push_back(c1.p + diff * Point(rc, rs));\n\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\n\treturn res;\n}\n\n//???????????????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_circle(const Circle &cir, const Point& p) {\n\tld dis = abs(cir.p - p);\n\tif (dis > cir.r + eps)return 0;\n\telse if (dis < cir.r - eps)return 2;\n\telse return 1;\n}\n//???lc??????rc??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint circle_in_circle(const Circle &lc, const Circle&rc) {\n\tld dis = abs(lc.p - rc.p);\n\tif (dis < rc.r - lc.r - eps)return 2;\n\telse if (dis>rc.r - lc.r + eps)return 0;\n\telse return 1;\n}\n\n// ?????¨??´????????????\nvector<Point> is_lc(const Circle& c, const Line& l) {\n\tvector<Point> res;\n\tld d = dist_lp(l, c.p);\n\tif (d < c.r + eps) {\n\t\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\n\t\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\n\t\tres.push_back(proj(l, c.p) + len * nor);\n\t\tres.push_back(proj(l, c.p) - len * nor);\n\t}\n\treturn res;\n}\n\n// ?????¨??????????????¢\nvector<Point> is_sc(const Circle& c, const Line& l) {\n\tvector<Point> v = is_lc(c, l), res;\n\tfor (Point p : v)\n\t\tif (isis_sp(l, p)) res.push_back(p);\n\treturn res;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\n\tvector<Line> ret;\n\tPoint v = c.p - p;\n\tld d = abs(v);\n\tld l = sqrt(norm(v) - c.r * c.r);\n\tif (isnan(l)) { return ret; }\n\tPoint v1 = v * Point(l / d, c.r / d);\n\tPoint v2 = v * Point(l / d, -c.r / d);\n\tret.push_back(Line(p, p + v1));\n\tif (l < eps) return ret;\n\tret.push_back(Line(p, p + v2));\n\treturn ret;\n}\n\n// ?????¨????????\\???\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\n\tvector<Line> ret;\n\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\n\t\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\n\t\tret = tangent_cp(c1, center);\n\t}\n\tif (abs(c1.r - c2.r) > eps) {\n\t\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\n\t\tvector<Line> nret = tangent_cp(c1, out);\n\t\tret.insert(ret.end(), ALL(nret));\n\t}\n\telse {\n\t\tPoint v = c2.p - c1.p;\n\t\tv /= abs(v);\n\t\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\n\t\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\n\t\tret.push_back(Line(q1, q1 + v));\n\t\tret.push_back(Line(q2, q2 + v));\n\t}\n\treturn ret;\n}\n//??????????????????????????¢???\nld two_circle_area(const Circle&l, const Circle&r) {\n\tld dis = abs(l.p - r.p);\n\tif (dis > l.r + r.r)return 0;\n\telse if (dis + r.r < l.r) {\n\t\treturn r.r*r.r*pi;\n\t}\n\telse if (dis + l.r < r.r) {\n\t\treturn l.r*l.r*pi;\n\t}\n\telse {\n\t\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\n\t\t\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\n\t\t\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\n\t\treturn ans;\n\t}\n\n}\n\n/* ????§???¢ */\n\ntypedef vector<Point> Polygon;\n\n// ??¢???\nld area(const Polygon &p) {\n\tld res = 0;\n\tint n = p.size();\n\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\n\treturn res / 2;\n}\n\n// ????§???¢????????¢??????\nbool is_counter_clockwise(const Polygon &poly) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\n\t\tangle += arg((c - b) / (b - a));\n\t}\n\treturn angle > eps;\n}\n\n// ??????????????????\n// 0 => out\n// 1 => on\n// 2 => in\nint is_in_polygon(const Polygon &poly, const Point& p) {\n\tld angle = 0;\n\tint n = poly.size();\n\tREP(i, n) {\n\t\tPoint a = poly[i], b = poly[(i + 1) % n];\n\t\tif (isis_sp(Line(a, b), p)) return 1;\n\t\tangle += arg((b - p) / (a - p));\n\t}\n\treturn eq(angle, 0) ? 0 : 2;\n}\n//??????????????????2?????????\nenum { OUT, ON, IN };\nint convex_contains(const Polygon &P, const Point &p) {\n\tconst int n = P.size();\n\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\n\tint a = 0, b = n;\n\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\n\t\tint c = (a + b) / 2;\n\t\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\n\t\t\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\n\t\t\telse a = c;\n\t\t}\n\t\telse {\n\t\t\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\n\t\t\telse b = c;\n\t\t}\n\t}\n\tb %= n;\n\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\n\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\n\treturn 1;\n}\n\n// ??????\n// ???????????????????????¨????????????????????§??¨???\nPolygon convex_hull(vector<Point> ps) {\n\tint n = ps.size();\n\tint k = 0;\n\tsort(ps.begin(), ps.end());\n\tPolygon ch(2 * n);\n\tfor (int i = 0; i < n; ch[k++] = ps[i++])\n\t\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\n\t\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\n\tch.resize(k - 1);\n\treturn ch;\n}\n\n\n\n// ????????????\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\n\tint n = ps.size();\n\tPolygon Q;\n\tPolygon R;\n\tREP(i, n) {\n\t\tPoint A = ps[i], B = ps[(i + 1) % n];\n\t\tLine m = Line(A, B);\n\t\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\n\t\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\n\t\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\n\t\t\tQ.push_back(is_ll(l, m));\n\t\t\tR.push_back(is_ll(l, m));\n\t\t}\n\t}\n\tconst vector<Polygon>polys{ Q,R };\n\treturn polys;\n}\n\n\n/* ??¢??¬??????????????? */\nvoid add_point(vector<Point> &ps, const Point p) {\n\tfor (Point q : ps) if (abs(q - p) < eps) return;\n\tps.push_back(p);\n}\n\ntypedef int Weight;\nstruct Edge {\n\tint src, dst;\n\tWeight weight;\n\tEdge(int src, int dst, Weight weight) :\n\t\tsrc(src), dst(dst), weight(weight) { }\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\n\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\n\tg[from].push_back(Edge{ from, to, weight });\n}\n\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\n\tint n = p.size(), m = s.size();\n\tGraph g(n);\n\tREP(i, m) {\n\t\tvector<pair<ld, int>> vec;\n\t\tREP(j, n) if (isis_sp(s[i], p[j]))\n\t\t\tvec.emplace_back(abs(s[i].a - p[j]), j);\n\t\tsort(ALL(vec));\n\t\tREP(j, vec.size() - 1) {\n\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n\t\t\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\n\t\t}\n\t}\n\treturn g;\n}\nGraph sennbunn_arrangement(const vector<Line>&s) {\n\tvector<Point>crss;\n\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\n\t\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\n\t\t\tif (isis_ss(s[i], s[j])) {\n\t\t\t\tcrss.push_back(is_ll(s[i], s[j]));\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\n\t\tcrss.push_back(s[i][0]);\n\t\tcrss.push_back(s[i][1]);\n\t}\n\treturn segment_arrangement(s, crss);\n}\n\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\n//\tint n = p.size(), m = c.size();\n//\tGraph g(n);\n//\tREP(i, m) {\n//\t\tvector<pair<ld, int>> vec;\n//\t\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\n//\t\t\tvec.emplace_back(arg(c[i].p - p[j]), j);\n//\t\tsort(ALL(vec));\n//\t\tREP(j, vec.size() - 1) {\n//\t\t\tint from = vec[j].second, to = vec[j + 1].second;\n//\t\t\tld angle = vec[j + 1].first - vec[j].first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t\tif (vec.size() >= 2) {\n//\t\t\tint from = vec.back().second, to = vec.front().first;\n//\t\t\tld angle = vec.front().first - vec.back().first;\n//\t\t\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\n//\t\t}\n//\t}\n//\treturn g;\n//}\n\n\n\nconst ld G= 9.8;\n\nstruct box {\n\tvector<ld>xs;\n\tvector<ld>ys;\n};\n\n\nint N, V, X, Y;\nbool check(const ld theta, const box& b) {\n\n\tconst ld vx = V*cos(theta);\n\tconst ld vy = V*sin(theta);\n\n\tld y_max = -1e18;\n\tld y_min = 1e18;\n\n\t//?????????????¢????\n\t{\n\t\tconst ld toptime = vy / G;\n\t\tconst ld top_x = toptime*vx;\n\t\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\n\t\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\n\t\t\ty_max = max(y_max, top_y);\n\t\t}\n\t}\n\t//???????????????????¢????\n\t{\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tconst ld time = b.xs[x]/vx;\n\t\t\tconst ld ay = vy*time - time*time*G / 2;\n\t\t\ty_max = max(y_max, ay);\n\t\t\ty_min = min(y_min, ay);\n\t\t}\n\t}\n\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\n\t\treturn true;\n\t}\n\telse {\n\t\treturn false;\n\t}\n}\n\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\n\tif (p.real() < eps)return;\n\tbool ok = true;\n\tld amin, amax;\n\n\t//?????????????¨????\n\t{\n\t\tconst ld tan = V*V / G / p.real();\n\t\tconst ld theta = atan(tan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld max_y = vy*time - G*time*time / 2;\n\t\tif (max_y < p.imag()) {\n\t\t\tok = false;\n\t\t}\n\t\tif (leftup) {\n\t\t\tamax = tan;\n\t\t\tamin = 0;\n\t\t}\n\t\telse {\n\t\t\tamax = 1e18;\n\t\t\tamin = tan;\n\t\t}\n\t}\n\tif (ok) {\n\t\tint rep = 1000;\n\t\twhile (rep--) {\n\t\t\tconst ld amidtan = (amin + amax) / 2;\n\t\t\tconst ld theta = atan(amidtan);\n\t\t\tconst ld vx = V*cos(theta);\n\t\t\tconst ld vy = V*sin(theta);\n\t\t\tconst ld time = p.real() / vx;\n\t\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\t\tif (ay > p.imag()) {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (leftup) {\n\t\t\t\t\tamin = amidtan;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tamax = amidtan;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tconst ld amidtan = (amin + amax) / 2;\n\t\tconst ld theta = atan(amidtan);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = p.real() / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\ttans.push_back(amin);\n\t}\n}\n\nint main() { cin >> N >> V >> X >> Y;\n\tvector<box>bs;\n\tfor (int i = 0; i < N; ++i) {\n\t\tint L, B, R, T; cin >> L >> B >> R >> T;\n\t\tbox b;\n\t\tb.xs.push_back(L);\n\t\tb.xs.push_back(R);\n\t\tb.ys.push_back(B);\n\t\tb.ys.push_back(T);\n\t\tbs.push_back(b);\n\t}\n\tconst ld down = Y;\n\tld up = 1e18;\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\n\t\t\tup = min(up, bs[i].ys[0]);\n\t\t}\n\t}\n\tvector<ld>tans;\n\tfor (auto b : bs) {\n\t\tfor (int x = 0; x < 2; ++x) {\n\t\t\tfor (int y = 0; y < 2; ++y) {\n\t\t\t\tPoint p(b.xs[x], b.ys[y]);\n\t\t\t\tgettan(tans, p,(x+y)%2);\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tPoint p(X,Y);\n\t\tgettan(tans, p,true);\n\t}\n\n\tstring ans = \"No\";\n\tfor (auto t : tans) {\n\t\tconst ld theta = atan(t);\n\t\tconst ld vx = V*cos(theta);\n\t\tconst ld vy = V*sin(theta);\n\t\tconst ld time = X / vx;\n\t\tconst ld ay = vy*time - G*time*time / 2;\n\t\tif (down-eps <= ay&&ay <= up+eps) {\n\t\t\tbool ok = true;\n\t\t\tfor (auto b : bs) {\n\t\t\t\tif (!check(theta, b))ok = false;\n\t\t\t}\n\t\t\tif (ok) {\n\t\t\t\tans = \"Yes\";\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tcontinue;\n\t\t}\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.16666666666666666,"time_ms":30,"memory_kb":3516,"score_of_the_acc":-0.8733,"final_rank":18},{"submission_id":"aoj_2308_1563859","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\nconst double eps=1e-8;\nconst int N=100;\nconst int MAXN=1000000;\nconst double pi=acos(-1);\nconst double gg=9.8;\nint n;\ndouble v,x,y,l[N],b[N],r[N],t[N],B,A,rr[N];\nint work(double x,double y)\n{\n\tdouble yy=A * x * x + B * x;\n\t//if (fabs(yy-y) < eps) return 0;\n\tif (y > yy) return 1;\n\treturn -1;\n}\nbool check(double thi)\n{\n\tA=-gg/(2 * v * v * cos(thi) * cos(thi));\n\tB=tan(thi);\n\tdouble MAX_top=-B*B/(4 *A);\n\tdouble mid=-B/(2 * A);\n\tfor(int i=1;i<=n;i++)\n\tif (l[i] < x+eps)\n\t{\n\t\t//rr[i]=min(r[i],x);\n\t\trr[i]=r[i];\n\t\tif (work(l[i],t[i]) * work(rr[i],t[i]) <0) return 0;\n\t\tif (work(l[i],b[i]) * work(rr[i],b[i]) <0) return 0;\n\t\tif (work(l[i],t[i]) * work(l[i],b[i]) <0) return 0;\n\t\tif (r[i]<x+ eps && work(r[i],t[i]) * work(r[i],b[i]) <0) return 0;\n\t\tif (work(l[i],b[i])>0 && work(rr[i],b[i])>0 && MAX_top > b[i]-eps && (mid>l[i] && mid<rr[i])) return 0;\n\t}\n\tif (work(x,y) > 0) return 0;\n\tdouble tmp=A * x * x + B * x;\n\tfor(int i=1;i<=n;i++)\n\t\tif (l[i]< x-eps && r[i]> x+eps)\n\t\t{\n\t\t\tif (t[i] < tmp-eps && t[i]>y+eps) return 0;\n\t\t\tif (b[i] < tmp-eps && b[i]>y+eps) return 0;\n\t\t}\n\treturn 1;\n}\nint main()\n{\n\tcin>>n>>v>>x>>y;\n\tfor(int i=1;i<=n;i++)\n\t\tscanf(\"%lf%lf%lf%lf\",&l[i],&b[i],&r[i],&t[i]);\n\tfor(int i=1;i<MAXN;i++)\n\t{\n\t\tdouble thi=pi / 2 * i / MAXN;\n\t\tif (check(thi))\n\t\t{\n\t\t\tcout<<\"Yes\"<<endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\tcout<<\"No\"<<endl;\n}","accuracy":0.26666666666666666,"time_ms":220,"memory_kb":1356,"score_of_the_acc":-0.4468,"final_rank":11},{"submission_id":"aoj_2308_1563855","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\nconst double eps=1e-8;\nconst int N=100;\nconst int MAXN=1000000;\nconst double pi=acos(-1);\nconst double gg=9.8;\nint n;\ndouble v,x,y,l[N],b[N],r[N],t[N],B,A,rr[N];\nint work(double x,double y)\n{\n\tdouble yy=A * x * x + B * x;\n\t//if (fabs(yy-y) < eps) return 0;\n\tif (y > yy) return 1;\n\treturn -1;\n}\nbool check(double thi)\n{\n\tA=-gg/(2 * v * v * cos(thi) * cos(thi));\n\tB=tan(thi);\n\tdouble MAX_top=-B*B/(4 *A);\n\tfor(int i=1;i<=n;i++)\n\tif (l[i] < x+eps)\n\t{\n\t\trr[i]=min(r[i],x);\n\t\tif (work(l[i],t[i]) * work(rr[i],t[i]) <0) return 0;\n\t\tif (work(l[i],b[i]) * work(rr[i],b[i]) <0) return 0;\n\t\tif (work(l[i],t[i]) * work(l[i],b[i]) <0) return 0;\n\t\tif (r[i]<x+ eps && work(r[i],t[i]) * work(r[i],b[i]) <0) return 0;\n\t\tif (work(l[i],b[i])>0 && work(rr[i],b[i])>0 && MAX_top > b[i]-eps) return 0;\n\t}\n\tif (work(x,y) > 0) return 0;\n\tdouble tmp=A * x * x + B * x;\n\tfor(int i=1;i<=n;i++)\n\t\tif (l[i]< x-eps && r[i]> x+eps)\n\t\t{\n\t\t\tif (t[i] < tmp-eps && t[i]>y+eps) return 0;\n\t\t\tif (b[i] < tmp-eps && b[i]>y+eps) return 0;\n\t\t}\n\treturn 1;\n}\nint main()\n{\n\tcin>>n>>v>>x>>y;\n\tfor(int i=1;i<=n;i++)\n\t\tscanf(\"%lf%lf%lf%lf\",&l[i],&b[i],&r[i],&t[i]);\n\tfor(int i=1;i<MAXN;i++)\n\t{\n\t\tdouble thi=pi / 2 * i / MAXN;\n\t\tif (check(thi))\n\t\t{\n\t\t\tcout<<\"Yes\"<<endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\tcout<<\"No\"<<endl;\n}","accuracy":0.1,"time_ms":70,"memory_kb":1360,"score_of_the_acc":-0.1292,"final_rank":19},{"submission_id":"aoj_2308_1563840","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cmath>\n#include<algorithm>\nusing namespace std;\nconst double eps=1e-8;\nconst int N=100;\nconst int MAXN=1000000;\nconst double pi=acos(-1);\nconst double gg=9.8;\nint n;\ndouble v,x,y,l[N],b[N],r[N],t[N],B,A,rr[N];\nint work(double x,double y)\n{\n\tdouble yy=A * x * x + B * x;\n\t//if (fabs(yy-y) < eps) return 0;\n\tif (y > yy) return 1;\n\treturn -1;\n}\nbool check(double thi)\n{\n\tA=-gg/(2 * v * v * cos(thi) * cos(thi));\n\tB=tan(thi);\n\tdouble MAX_top=-B*B/(4 *A);\n\tfor(int i=1;i<=n;i++)\n\tif (l[i] < x+eps)\n\t{\n\t\trr[i]=min(r[i],x);\n\t\tif (work(l[i],t[i]) * work(rr[i],t[i]) <0) return 0;\n\t\tif (work(l[i],b[i]) * work(rr[i],b[i]) <0) return 0;\n\t\tif (work(l[i],t[i]) * work(l[i],b[i]) <0) return 0;\n\t\tif (r[i]<x+ eps && work(r[i],t[i]) * work(r[i],b[i]) <0) return 0;\n\t\tif (work(l[i],b[i])>0 && work(r[i],b[i])>0 && MAX_top > b[i]-eps) return 0;\n\t}\n\tif (work(x,y) > 0) return 0;\n\tdouble tmp=A * x * x + B * x;\n\tfor(int i=1;i<=n;i++)\n\t\tif (l[i]< x-eps && r[i]> x+eps)\n\t\t{\n\t\t\tif (t[i] < tmp-eps && t[i]>y+eps) return 0;\n\t\t\tif (b[i] < tmp-eps && b[i]>y+eps) return 0;\n\t\t}\n\treturn 1;\n}\nint main()\n{\n\tcin>>n>>v>>x>>y;\n\tfor(int i=1;i<=n;i++)\n\t\tscanf(\"%lf%lf%lf%lf\",&l[i],&b[i],&r[i],&t[i]);\n\tfor(int i=1;i<MAXN;i++)\n\t{\n\t\tdouble thi=pi / 2 * i / MAXN;\n\t\tif (check(thi))\n\t\t{\n\t\t\tcout<<\"Yes\"<<endl;\n\t\t\treturn 0;\n\t\t}\n\t}\n\tcout<<\"No\"<<endl;\n}","accuracy":0.1,"time_ms":70,"memory_kb":1360,"score_of_the_acc":-0.1292,"final_rank":19}],"string":"[\n {\n \"submission_id\": \"aoj_2308_5846707\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.01 15:05: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\\nusing R = long double;\\n\\n#pragma region geometry_light\\n\\nusing Real = long double;\\nusing R = Real;\\nusing Point = std::complex<Real>;\\nusing Vec = Point;\\nconst Real EPS = 1e-10, PI = acos(-1);\\n\\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\\n/*\\n\\t-1: a < b\\n\\t0 : a == b\\n\\t1 : a > b\\n*/\\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\\n\\nnamespace std {\\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n} // namespace std\\n\\nstd::istream &operator>>(std::istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// rotate point 'p' for counter clockwise direction\\nconst Point rotate(const Real &theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\\n\\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\\n\\n// get angle a-b-c (<pi)\\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), w(c - b);\\n\\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\\n\\treturn std::min(theta, 2 * PI - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \\\" -- \\\" << p.b; }\\n\\n\\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = std::vector<Point>;\\nusing Polygon = std::vector<Point>;\\nusing Segments = std::vector<Segment>;\\nusing Lines = std::vector<Line>;\\nusing Circles = std::vector<Circle>;\\n\\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nconst int ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1;\\t\\t// \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1;\\t\\t// \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < -EPS) return +2;\\t\\t\\t// \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) + EPS < norm(c)) return -2;\\t// \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\\n\\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\\n\\nint intersect(const Line &l, const Line &m) {\\n\\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\\n\\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\\n}\\n\\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\\n\\nint intersect(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\\n\\treturn 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\\nint intersect(const Circle &c, const Line &l) {\\n\\tReal d = c.r - distance(l, c.p);\\n\\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\\n}\\n\\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nint intersect(const Segment &s, const Segment &t) {\\n\\tif(eq(s.a, s.b)) return intersect(t, s.a);\\n\\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\\n\\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\\n\\t\\treturn -1;\\n\\treturn int(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\\tconst Point h = projection(l, c.p);\\n\\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\\n\\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\\n}\\n\\nReal distance(const Point &a, const Point &b);\\n\\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\\n\\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\\n\\tint com = compare(r1 + r2, d);\\n\\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\\n\\t// if(c1.r < c2.r) swap(c1, c2);\\n\\t// Real d = abs(c1.p - c2.p);\\n\\t// if(compare(c1.r + c2.r, d) == -1) return 4;\\n\\t// if(eq(c1.r + c2.r, d)) return 3;\\n\\t// if(compare(c1.r - c2.r, d) == -1) return 2;\\n\\t// return int(eq(c1.r - c2.r, d));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\treturn intersect(s, r) ? distance(r, p) : std::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\\tif(intersect(a, b)) return 0;\\n\\treturn std::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\\tif(intersect(l, s)) return 0;\\n\\treturn std::min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn 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) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn make_pair(pr - v, pr + v);\\n\\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\\n\\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\t// return {pr - e * base, pr + e * base};\\n}\\n\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\\n\\tauto ret = crosspoint(c, Line(l.a, l.b));\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn make_pair(p1, p2);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\\n\\treturn 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\\tLines ret;\\n\\tif(c1.r < c2.r) std::swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tVec u = (c2.p - c1.p) / Real(sqrt(g));\\n\\tVec v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\nbool solve(int n) {\\n\\tR velocity;\\n\\tcin >> velocity;\\n\\tR x_pig, y_pig;\\n\\tcin >> x_pig >> y_pig;\\n\\n\\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\\n\\n\\tPoints pts;\\n\\n\\trep(j, n) {\\n\\t\\tR l, b, r, t;\\n\\t\\tcin >> l >> b >> r >> t;\\n\\t\\tpts.emplace_back(l, t);\\n\\t\\tpts.emplace_back(l, b);\\n\\t\\tpts.emplace_back(r, t);\\n\\t\\tpts.emplace_back(r, b);\\n\\n\\t\\tR mid_x = (l + r) / 2;\\n\\t\\tR mid_y = (b + t) / 2;\\n\\t\\tPoints pts;\\n\\t\\tfor(R x : {l, mid_x, r}) {\\n\\t\\t\\tfor(R y : {b, mid_y, t}) {\\n\\t\\t\\t\\tpts.emplace_back(x, y);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, 3) obstacle[j].emplace_back(pts[i], pts[i + 6]);\\n\\t\\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\\n\\t}\\n\\n\\tconst R g = 9.8;\\n\\n\\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\\n\\n\\tauto calc_top = [&](R obj_x) -> R {\\n\\t\\tR inf = 0;\\n\\t\\tR sup = pi / 2 - EPS;\\n\\t\\tR lef, rig;\\n\\t\\trep(300) {\\n\\t\\t\\tlef = inf + (sup - inf) / 3;\\n\\t\\t\\trig = (lef + sup) / 2;\\n\\t\\t\\tif(f(lef, obj_x) < f(rig, obj_x)) {\\n\\t\\t\\t\\tinf = lef;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tsup = rig;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn lef;\\n\\t};\\n\\n\\tauto binarysearch = [&](R lef, R rig, R obj_x, R obj_y, bool lef_is_large) {\\n\\t\\tR mid;\\n\\t\\trep(300) {\\n\\t\\t\\tmid = lef + rig;\\n\\t\\t\\tmid /= 2;\\n\\t\\t\\tif(bool(f(mid, obj_x) > obj_y) ^ (bool)lef_is_large) {\\n\\t\\t\\t\\trig = mid;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tlef = mid;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn mid;\\n\\t};\\n\\n\\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\\n\\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\\n\\t\\tR inf = 0;\\n\\t\\tR sup = pi / 2 - EPS;\\n\\t\\tR mid = calc_top(obj_x);\\n\\t\\tif(compare(f(mid, obj_x), obj_y) == -1) return make_pair(-1., -1.);\\n\\t\\t// R a, b;\\n\\t\\t// inf = 0;\\n\\t\\t// rep(300) {\\n\\t\\t// \\ta = (inf + mid) / 2;\\n\\t\\t// \\tif(f(a, obj_x) < obj_y) {\\n\\t\\t// \\t\\tinf = a;\\n\\t\\t// \\t} else {\\n\\t\\t// \\t\\tmid = a;\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\t\\t// mid = sup;\\n\\t\\t// sup = pi / 2 - EPS;\\n\\t\\t// rep(300) {\\n\\t\\t// \\tb = (mid + sup) / 2;\\n\\t\\t// \\tif(f(b, obj_x) < obj_y) {\\n\\t\\t// \\t\\tsup = b;\\n\\t\\t// \\t} else {\\n\\t\\t// \\t\\tmid = b;\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\t\\treturn make_pair(binarysearch(inf, mid, obj_x, obj_y, false), binarysearch(mid, sup, obj_x, obj_y, true));\\n\\t};\\n\\n\\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\\n\\n\\tauto collision = [&](R theta, int obs_idx) -> bool {\\n\\t\\tR top = tp(theta);\\n\\t\\trep(i, 3) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR xl, xr, y;\\n\\t\\t\\ty = seg.a.imag();\\n\\t\\t\\txl = seg.a.real();\\n\\t\\t\\txr = seg.b.real();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(y, xl, xr);\\n\\t\\t\\t}\\n\\t\\t\\tif(xl > xr) swap(xl, xr);\\n\\t\\t\\tif(x_pig <= xl) continue;\\n\\t\\t\\tchmin(xr, x_pig);\\n\\t\\t\\tR yl = f(theta, xl);\\n\\t\\t\\tR yr = f(theta, xr);\\n\\t\\t\\tif(xl <= top && top <= xr) {\\n\\t\\t\\t\\tif(compare(f(theta, top), y) == 1) {\\n\\t\\t\\t\\t\\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(compare(yl, y) * compare(yr, y) == -1) return true;\\n\\t\\t}\\n\\n\\t\\trep(i, 3, 6) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR yd, x, yt;\\n\\t\\t\\tx = seg.a.real();\\n\\t\\t\\tyd = seg.a.imag();\\n\\t\\t\\tyt = seg.b.imag();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(x, yd, yt);\\n\\t\\t\\t}\\n\\t\\t\\tif(x_pig < x) continue;\\n\\t\\t\\tif(yd > yt) swap(yd, yt);\\n\\t\\t\\tR y = f(theta, x);\\n\\t\\t\\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\\n\\t\\t}\\n\\n\\t\\treturn false;\\n\\t};\\n\\n\\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\\n\\n\\tauto ok = [&](R angle) {\\n\\t\\tif(!use(angle)) return false;\\n\\t\\trep(i, n) if(collision(angle, i)) return false;\\n\\t\\tR y = f(angle, x_pig);\\n\\t\\tif(compare(y, y_pig) == -1) return false;\\n\\t\\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\\n\\t\\tfoa(ob, obstacle) {\\n\\t\\t\\tfoa(seg, ob) {\\n\\t\\t\\t\\tif(intersect(seg, egg)) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn true;\\n\\t};\\n\\n\\tfoa(p, pts) {\\n\\t\\tif(eq(p.real(), 0.)) continue;\\n\\t\\tauto angles = calc_theta(p.real(), p.imag());\\n\\t\\tif(ok(angles.first) || ok(angles.second)) return true;\\n\\t}\\n\\n\\tauto angles = calc_theta(x_pig, y_pig);\\n\\treturn (ok(angles.first) || ok(angles.second));\\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\\t// std::cerr << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint n;\\n\\twhile(cin >> n) {\\n\\t\\tYes(solve(n));\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3952,\n \"score_of_the_acc\": -1.0836,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2308_5846664\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.01 15:05: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\\nusing R = long double;\\n\\n#pragma region geometry_light\\n\\nusing Real = long double;\\nusing R = Real;\\nusing Point = std::complex<Real>;\\nusing Vec = Point;\\nconst Real EPS = 1e-10, PI = acos(-1);\\n\\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\\n/*\\n\\t-1: a < b\\n\\t0 : a == b\\n\\t1 : a > b\\n*/\\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\\n\\nnamespace std {\\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n} // namespace std\\n\\nstd::istream &operator>>(std::istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// rotate point 'p' for counter clockwise direction\\nconst Point rotate(const Real &theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\\n\\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\\n\\n// get angle a-b-c (<pi)\\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), w(c - b);\\n\\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\\n\\treturn std::min(theta, 2 * PI - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \\\" -- \\\" << p.b; }\\n\\n\\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = std::vector<Point>;\\nusing Polygon = std::vector<Point>;\\nusing Segments = std::vector<Segment>;\\nusing Lines = std::vector<Line>;\\nusing Circles = std::vector<Circle>;\\n\\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nconst int ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1;\\t\\t// \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1;\\t\\t// \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < -EPS) return +2;\\t\\t\\t// \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) + EPS < norm(c)) return -2;\\t// \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\\n\\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\\n\\nint intersect(const Line &l, const Line &m) {\\n\\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\\n\\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\\n}\\n\\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\\n\\nint intersect(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\\n\\treturn 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\\nint intersect(const Circle &c, const Line &l) {\\n\\tReal d = c.r - distance(l, c.p);\\n\\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\\n}\\n\\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nint intersect(const Segment &s, const Segment &t) {\\n\\tif(eq(s.a, s.b)) return intersect(t, s.a);\\n\\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\\n\\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\\n\\t\\treturn -1;\\n\\treturn int(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\\tconst Point h = projection(l, c.p);\\n\\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\\n\\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\\n}\\n\\nReal distance(const Point &a, const Point &b);\\n\\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\\n\\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\\n\\tint com = compare(r1 + r2, d);\\n\\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\\n\\t// if(c1.r < c2.r) swap(c1, c2);\\n\\t// Real d = abs(c1.p - c2.p);\\n\\t// if(compare(c1.r + c2.r, d) == -1) return 4;\\n\\t// if(eq(c1.r + c2.r, d)) return 3;\\n\\t// if(compare(c1.r - c2.r, d) == -1) return 2;\\n\\t// return int(eq(c1.r - c2.r, d));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\treturn intersect(s, r) ? distance(r, p) : std::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\\tif(intersect(a, b)) return 0;\\n\\treturn std::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\\tif(intersect(l, s)) return 0;\\n\\treturn std::min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn 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) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn make_pair(pr - v, pr + v);\\n\\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\\n\\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\t// return {pr - e * base, pr + e * base};\\n}\\n\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\\n\\tauto ret = crosspoint(c, Line(l.a, l.b));\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn make_pair(p1, p2);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\\n\\treturn 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\\tLines ret;\\n\\tif(c1.r < c2.r) std::swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tVec u = (c2.p - c1.p) / Real(sqrt(g));\\n\\tVec v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\nbool solve(int n) {\\n\\tR velocity;\\n\\tcin >> velocity;\\n\\tR x_pig, y_pig;\\n\\tcin >> x_pig >> y_pig;\\n\\n\\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\\n\\n\\tPoints pts;\\n\\n\\trep(j, n) {\\n\\t\\tR l, b, r, t;\\n\\t\\tcin >> l >> b >> r >> t;\\n\\t\\tpts.emplace_back(l, t);\\n\\t\\tpts.emplace_back(l, b);\\n\\t\\tpts.emplace_back(r, t);\\n\\t\\tpts.emplace_back(r, b);\\n\\n\\t\\tR mid_x = (l + r) / 2;\\n\\t\\tR mid_y = (b + t) / 2;\\n\\t\\tPoints pts;\\n\\t\\tfor(R x : {l, mid_x, r}) {\\n\\t\\t\\tfor(R y : {b, mid_y, t}) {\\n\\t\\t\\t\\tpts.emplace_back(x, y);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, 3) { obstacle[j].emplace_back(pts[i], pts[i + 6]); }\\n\\t\\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\\n\\t}\\n\\n\\tconst R g = 9.8;\\n\\n\\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\\n\\n\\tauto calc_top = [&](R obj_x) -> R {\\n\\t\\tR inf = 0;\\n\\t\\tR sup = pi / 2 - EPS;\\n\\t\\tR lef, rig;\\n\\t\\trep(300) {\\n\\t\\t\\tlef = inf + (sup - inf) / 3;\\n\\t\\t\\trig = (lef + sup) / 2;\\n\\t\\t\\tif(f(lef, obj_x) < f(rig, obj_x)) {\\n\\t\\t\\t\\tinf = lef;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tsup = rig;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn lef;\\n\\t};\\n\\n\\tauto binarysearch = [&](R lef, R rig, R obj_x, R obj_y, bool lef_is_large) {\\n\\t\\tR mid;\\n\\t\\trep(300) {\\n\\t\\t\\tmid = lef + rig;\\n\\t\\t\\tmid /= 2;\\n\\t\\t\\tif(bool(f(mid, obj_x) > obj_y) ^ (bool)lef_is_large) {\\n\\t\\t\\t\\trig = mid;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tlef = mid;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn mid;\\n\\t};\\n\\n\\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\\n\\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\\n\\t\\tR inf = 0;\\n\\t\\tR sup = pi / 2 - EPS;\\n\\t\\tR mid = calc_top(obj_x);\\n\\t\\tif(compare(f(mid, obj_x), obj_y) == -1) return make_pair(-1., -1.);\\n\\t\\t// R a, b;\\n\\t\\t// inf = 0;\\n\\t\\t// rep(300) {\\n\\t\\t// \\ta = (inf + mid) / 2;\\n\\t\\t// \\tif(f(a, obj_x) < obj_y) {\\n\\t\\t// \\t\\tinf = a;\\n\\t\\t// \\t} else {\\n\\t\\t// \\t\\tmid = a;\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\t\\t// mid = sup;\\n\\t\\t// sup = pi / 2 - EPS;\\n\\t\\t// rep(300) {\\n\\t\\t// \\tb = (mid + sup) / 2;\\n\\t\\t// \\tif(f(b, obj_x) < obj_y) {\\n\\t\\t// \\t\\tsup = b;\\n\\t\\t// \\t} else {\\n\\t\\t// \\t\\tmid = b;\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\t\\treturn make_pair(binarysearch(inf, mid, obj_x, obj_y, false), binarysearch(mid, sup, obj_x, obj_y, true));\\n\\t};\\n\\n\\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\\n\\n\\tauto collision = [&](R theta, int obs_idx) -> bool {\\n\\t\\tR top = tp(theta);\\n\\t\\trep(i, 3) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR xl, xr, y;\\n\\t\\t\\ty = seg.a.imag();\\n\\t\\t\\txl = seg.a.real();\\n\\t\\t\\txr = seg.b.real();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(y, xl, xr);\\n\\t\\t\\t}\\n\\t\\t\\tif(xl > xr) swap(xl, xr);\\n\\t\\t\\tif(x_pig <= xl) continue;\\n\\t\\t\\tchmin(xr, x_pig);\\n\\t\\t\\tR yl = f(theta, xl);\\n\\t\\t\\tR yr = f(theta, xr);\\n\\t\\t\\tif(xl <= top && top <= xr) {\\n\\t\\t\\t\\t// if(f(theta, top) > y) {\\n\\t\\t\\t\\tif(compare(f(theta, top), y) == 1) {\\n\\t\\t\\t\\t\\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(compare(yl, y) * compare(yr, y) == -1) return true;\\n\\t\\t}\\n\\n\\t\\tdebug(theta);\\n\\n\\t\\trep(i, 3, 6) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR yd, x, yt;\\n\\t\\t\\tx = seg.a.real();\\n\\t\\t\\tyd = seg.a.imag();\\n\\t\\t\\tyt = seg.b.imag();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(x, yd, yt);\\n\\t\\t\\t}\\n\\t\\t\\tif(x_pig < x) continue;\\n\\t\\t\\tif(yd > yt) swap(yd, yt);\\n\\t\\t\\tR y = f(theta, x);\\n\\t\\t\\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\\n\\t\\t}\\n\\n\\t\\treturn false;\\n\\t};\\n\\n\\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\\n\\n\\tauto ok = [&](R angle) {\\n\\t\\tif(!use(angle)) return false;\\n\\t\\trep(i, n) if(collision(angle, i)) return false;\\n\\t\\tR y = f(angle, x_pig);\\n\\t\\tif(y < y_pig) return false;\\n\\t\\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\\n\\t\\tfoa(ob, obstacle) {\\n\\t\\t\\tfoa(seg, ob) {\\n\\t\\t\\t\\tif(intersect(seg, egg)) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdebug(angle);\\n\\t\\tdebug(f(angle, 1));\\n\\t\\tdebug(f(angle, 2));\\n\\t\\tdebug(f(angle, 3));\\n\\t\\treturn true;\\n\\t};\\n\\n\\t// // auto res = calc_theta(0.5, 12);\\n\\t// debug(res);\\n\\t// debug(f(res.first, 1.2));\\n\\t// debug(f(res.second, 1.2));\\n\\n\\tfoa(p, pts) {\\n\\t\\tif(eq(p.real(), 0.)) continue;\\n\\t\\tauto angles = calc_theta(p.real(), p.imag());\\n\\t\\tif(ok(angles.first) || ok(angles.second)) return true;\\n\\t}\\n\\n\\tauto angles = calc_theta(x_pig, y_pig);\\n\\treturn (ok(angles.first) || ok(angles.second));\\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\\t// std::cerr << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint n;\\n\\twhile(cin >> n) {\\n\\t\\tYes(solve(n));\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.8,\n \"time_ms\": 50,\n \"memory_kb\": 3952,\n \"score_of_the_acc\": -1.0836,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2308_5846601\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.01 15:05: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\\nusing R = long double;\\n\\n#pragma region geometry_light\\n\\nusing Real = long double;\\nusing R = Real;\\nusing Point = std::complex<Real>;\\nusing Vec = Point;\\nconst Real EPS = 1e-10, PI = acos(-1);\\n\\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\\n/*\\n\\t-1: a < b\\n\\t0 : a == b\\n\\t1 : a > b\\n*/\\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\\n\\nnamespace std {\\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n} // namespace std\\n\\nstd::istream &operator>>(std::istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// rotate point 'p' for counter clockwise direction\\nconst Point rotate(const Real &theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\\n\\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\\n\\n// get angle a-b-c (<pi)\\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), w(c - b);\\n\\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\\n\\treturn std::min(theta, 2 * PI - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \\\" -- \\\" << p.b; }\\n\\n\\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = std::vector<Point>;\\nusing Polygon = std::vector<Point>;\\nusing Segments = std::vector<Segment>;\\nusing Lines = std::vector<Line>;\\nusing Circles = std::vector<Circle>;\\n\\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nconst int ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1;\\t\\t// \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1;\\t\\t// \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < -EPS) return +2;\\t\\t\\t// \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) + EPS < norm(c)) return -2;\\t// \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\\n\\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\\n\\nint intersect(const Line &l, const Line &m) {\\n\\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\\n\\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\\n}\\n\\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\\n\\nint intersect(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\\n\\treturn 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\\nint intersect(const Circle &c, const Line &l) {\\n\\tReal d = c.r - distance(l, c.p);\\n\\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\\n}\\n\\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nint intersect(const Segment &s, const Segment &t) {\\n\\tif(eq(s.a, s.b)) return intersect(t, s.a);\\n\\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\\n\\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\\n\\t\\treturn -1;\\n\\treturn int(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\\tconst Point h = projection(l, c.p);\\n\\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\\n\\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\\n}\\n\\nReal distance(const Point &a, const Point &b);\\n\\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\\n\\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\\n\\tint com = compare(r1 + r2, d);\\n\\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\\n\\t// if(c1.r < c2.r) swap(c1, c2);\\n\\t// Real d = abs(c1.p - c2.p);\\n\\t// if(compare(c1.r + c2.r, d) == -1) return 4;\\n\\t// if(eq(c1.r + c2.r, d)) return 3;\\n\\t// if(compare(c1.r - c2.r, d) == -1) return 2;\\n\\t// return int(eq(c1.r - c2.r, d));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\treturn intersect(s, r) ? distance(r, p) : std::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\\tif(intersect(a, b)) return 0;\\n\\treturn std::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\\tif(intersect(l, s)) return 0;\\n\\treturn std::min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn 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) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn make_pair(pr - v, pr + v);\\n\\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\\n\\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\t// return {pr - e * base, pr + e * base};\\n}\\n\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\\n\\tauto ret = crosspoint(c, Line(l.a, l.b));\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn make_pair(p1, p2);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\\n\\treturn 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\\tLines ret;\\n\\tif(c1.r < c2.r) std::swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tVec u = (c2.p - c1.p) / Real(sqrt(g));\\n\\tVec v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\nbool solve(int n) {\\n\\tR velocity;\\n\\tcin >> velocity;\\n\\tR x_pig, y_pig;\\n\\tcin >> x_pig >> y_pig;\\n\\n\\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\\n\\n\\tPoints pts;\\n\\n\\trep(j, n) {\\n\\t\\tR l, b, r, t;\\n\\t\\tcin >> l >> b >> r >> t;\\n\\t\\tpts.emplace_back(l, t);\\n\\t\\tpts.emplace_back(l, b);\\n\\t\\tpts.emplace_back(r, t);\\n\\t\\tpts.emplace_back(r, b);\\n\\n\\t\\tR mid_x = (l + r) / 2;\\n\\t\\tR mid_y = (b + t) / 2;\\n\\t\\tPoints pts;\\n\\t\\tfor(R x : {l, mid_x, r}) {\\n\\t\\t\\tfor(R y : {b, mid_y, t}) {\\n\\t\\t\\t\\tpts.emplace_back(x, y);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, 3) { obstacle[j].emplace_back(pts[i], pts[i + 6]); }\\n\\t\\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\\n\\t}\\n\\n\\tconst R g = 9.8;\\n\\n\\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\\n\\n\\tauto calc_top = [&](R obj_x) -> R {\\n\\t\\tR inf = 0;\\n\\t\\tR sup = pi / 2 - EPS;\\n\\t\\tR lef, rig;\\n\\t\\trep(300) {\\n\\t\\t\\tlef = inf + (sup - inf) / 3;\\n\\t\\t\\trig = (lef + sup) / 2;\\n\\t\\t\\tif(f(lef, obj_x) < f(rig, obj_x)) {\\n\\t\\t\\t\\tinf = lef;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tsup = rig;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn lef;\\n\\t};\\n\\n\\tauto binarysearch = [&](R lef, R rig, R obj_x, R obj_y, bool lef_is_large) {\\n\\t\\tR mid;\\n\\t\\trep(300) {\\n\\t\\t\\tmid = lef + rig;\\n\\t\\t\\tmid /= 2;\\n\\t\\t\\tif(bool(f(mid, obj_x) > obj_y) ^ (bool)lef_is_large) {\\n\\t\\t\\t\\trig = mid;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tlef = mid;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn mid;\\n\\t};\\n\\n\\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\\n\\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\\n\\t\\tR inf = 0;\\n\\t\\tR sup = pi / 2 - EPS;\\n\\n\\t\\tR mid = calc_top(obj_x);\\n\\n\\t\\tif(compare(f(mid, obj_x), obj_y) == -1) {\\n\\t\\t\\treturn make_pair(-1., -1.);\\n\\t\\t}\\n\\n\\t\\t// R a, b;\\n\\t\\t// inf = 0;\\n\\t\\t// rep(300) {\\n\\t\\t// \\ta = (inf + mid) / 2;\\n\\t\\t// \\tif(f(a, obj_x) < obj_y) {\\n\\t\\t// \\t\\tinf = a;\\n\\t\\t// \\t} else {\\n\\t\\t// \\t\\tmid = a;\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\n\\t\\t// mid = sup;\\n\\t\\t// sup = pi / 2 - EPS;\\n\\n\\t\\t// rep(300) {\\n\\t\\t// \\tb = (mid + sup) / 2;\\n\\t\\t// \\tif(f(b, obj_x) < obj_y) {\\n\\t\\t// \\t\\tsup = b;\\n\\t\\t// \\t} else {\\n\\t\\t// \\t\\tmid = b;\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\n\\t\\treturn make_pair(binarysearch(inf, mid, obj_x, obj_y, false), binarysearch(mid, sup, obj_x, obj_y, true));\\n\\t};\\n\\n\\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\\n\\n\\tauto collision = [&](R theta, int obs_idx) -> bool {\\n\\t\\tR top = tp(theta);\\n\\t\\trep(i, 3) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR xl, xr, y;\\n\\t\\t\\ty = seg.a.imag();\\n\\t\\t\\txl = seg.a.real();\\n\\t\\t\\txr = seg.b.real();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(y, xl, xr);\\n\\t\\t\\t}\\n\\t\\t\\tif(xl > xr) swap(xl, xr);\\n\\t\\t\\tif(x_pig <= xl) continue;\\n\\t\\t\\tchmin(xr, x_pig);\\n\\t\\t\\tR yl = f(theta, xl);\\n\\t\\t\\tR yr = f(theta, xr);\\n\\t\\t\\tif(xl <= top && top <= xr) {\\n\\t\\t\\t\\t// if(f(theta, top) > y) {\\n\\t\\t\\t\\tif(compare(f(theta, top), y) == 1) {\\n\\t\\t\\t\\t\\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif((yl - y) * (yr - y) < -EPS) return true;\\n\\t\\t}\\n\\n\\t\\tdebug(theta);\\n\\n\\t\\trep(i, 3, 6) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR yd, x, yt;\\n\\t\\t\\tx = seg.a.real();\\n\\t\\t\\tyd = seg.a.imag();\\n\\t\\t\\tyt = seg.b.imag();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(x, yd, yt);\\n\\t\\t\\t}\\n\\t\\t\\tif(x_pig < x) continue;\\n\\t\\t\\tif(yd > yt) swap(yd, yt);\\n\\t\\t\\tR y = f(theta, x);\\n\\t\\t\\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\\n\\t\\t}\\n\\n\\t\\treturn false;\\n\\t};\\n\\n\\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\\n\\n\\tauto ok = [&](R angle) {\\n\\t\\tif(!use(angle)) return false;\\n\\t\\trep(i, n) if(collision(angle, i)) return false;\\n\\t\\tR y = f(angle, x_pig);\\n\\t\\tif(y < y_pig) return false;\\n\\t\\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\\n\\t\\tfoa(ob, obstacle) {\\n\\t\\t\\tfoa(seg, ob) {\\n\\t\\t\\t\\tif(intersect(seg, egg)) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdebug(angle);\\n\\t\\tdebug(f(angle, 1));\\n\\t\\tdebug(f(angle, 2));\\n\\t\\tdebug(f(angle, 3));\\n\\t\\treturn true;\\n\\t};\\n\\n\\t// // auto res = calc_theta(0.5, 12);\\n\\t// debug(res);\\n\\t// debug(f(res.first, 1.2));\\n\\t// debug(f(res.second, 1.2));\\n\\n\\tfoa(p, pts) {\\n\\t\\tif(eq(p, 0.)) continue;\\n\\t\\tauto angles = calc_theta(p.real(), p.imag());\\n\\t\\tif(ok(angles.first) || ok(angles.second)) return true;\\n\\t}\\n\\n\\tauto angles = calc_theta(x_pig, y_pig);\\n\\treturn (ok(angles.first) || ok(angles.second));\\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\\t// std::cerr << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint n;\\n\\twhile(cin >> n) {\\n\\t\\tYes(solve(n));\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.8,\n \"time_ms\": 50,\n \"memory_kb\": 3940,\n \"score_of_the_acc\": -1.079,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2308_5846579\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.01 15:05: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\\nusing R = long double;\\n\\n#pragma region geometry_light\\n\\nusing Real = long double;\\nusing R = Real;\\nusing Point = std::complex<Real>;\\nusing Vec = Point;\\nconst Real EPS = 1e-10, PI = acos(-1);\\n\\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\\n/*\\n\\t-1: a < b\\n\\t0 : a == b\\n\\t1 : a > b\\n*/\\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\\n\\nnamespace std {\\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n} // namespace std\\n\\nstd::istream &operator>>(std::istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// rotate point 'p' for counter clockwise direction\\nconst Point rotate(const Real &theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\\n\\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\\n\\n// get angle a-b-c (<pi)\\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), w(c - b);\\n\\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\\n\\treturn std::min(theta, 2 * PI - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \\\" -- \\\" << p.b; }\\n\\n\\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = std::vector<Point>;\\nusing Polygon = std::vector<Point>;\\nusing Segments = std::vector<Segment>;\\nusing Lines = std::vector<Line>;\\nusing Circles = std::vector<Circle>;\\n\\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nconst int ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1;\\t\\t// \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1;\\t\\t// \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < -EPS) return +2;\\t\\t\\t// \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) + EPS < norm(c)) return -2;\\t// \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\\n\\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\\n\\nint intersect(const Line &l, const Line &m) {\\n\\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\\n\\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\\n}\\n\\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\\n\\nint intersect(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\\n\\treturn 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\\nint intersect(const Circle &c, const Line &l) {\\n\\tReal d = c.r - distance(l, c.p);\\n\\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\\n}\\n\\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nint intersect(const Segment &s, const Segment &t) {\\n\\tif(eq(s.a, s.b)) return intersect(t, s.a);\\n\\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\\n\\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\\n\\t\\treturn -1;\\n\\treturn int(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\\tconst Point h = projection(l, c.p);\\n\\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\\n\\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\\n}\\n\\nReal distance(const Point &a, const Point &b);\\n\\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\\n\\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\\n\\tint com = compare(r1 + r2, d);\\n\\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\\n\\t// if(c1.r < c2.r) swap(c1, c2);\\n\\t// Real d = abs(c1.p - c2.p);\\n\\t// if(compare(c1.r + c2.r, d) == -1) return 4;\\n\\t// if(eq(c1.r + c2.r, d)) return 3;\\n\\t// if(compare(c1.r - c2.r, d) == -1) return 2;\\n\\t// return int(eq(c1.r - c2.r, d));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\treturn intersect(s, r) ? distance(r, p) : std::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\\tif(intersect(a, b)) return 0;\\n\\treturn std::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\\tif(intersect(l, s)) return 0;\\n\\treturn std::min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn 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) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn make_pair(pr - v, pr + v);\\n\\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\\n\\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\t// return {pr - e * base, pr + e * base};\\n}\\n\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\\n\\tauto ret = crosspoint(c, Line(l.a, l.b));\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn make_pair(p1, p2);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\\n\\treturn 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\\tLines ret;\\n\\tif(c1.r < c2.r) std::swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tVec u = (c2.p - c1.p) / Real(sqrt(g));\\n\\tVec v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\nbool solve(int n) {\\n\\tR velocity;\\n\\tcin >> velocity;\\n\\tR x_pig, y_pig;\\n\\tcin >> x_pig >> y_pig;\\n\\n\\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\\n\\n\\tPoints pts;\\n\\n\\trep(j, n) {\\n\\t\\tR l, b, r, t;\\n\\t\\tcin >> l >> b >> r >> t;\\n\\t\\tpts.emplace_back(l, t);\\n\\t\\tpts.emplace_back(l, b);\\n\\t\\tpts.emplace_back(r, t);\\n\\t\\tpts.emplace_back(r, b);\\n\\n\\t\\tR mid_x = (l + r) / 2;\\n\\t\\tR mid_y = (b + t) / 2;\\n\\t\\tPoints pts;\\n\\t\\tfor(R x : {l, mid_x, r}) {\\n\\t\\t\\tfor(R y : {b, mid_y, t}) {\\n\\t\\t\\t\\tpts.emplace_back(x, y);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, 3) { obstacle[j].emplace_back(pts[i], pts[i + 6]); }\\n\\t\\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\\n\\t}\\n\\n\\tconst R g = 9.8;\\n\\n\\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\\n\\n\\tauto calc_top = [&](R obj_x) -> R {\\n\\t\\tR inf = 0;\\n\\t\\tR sup = pi / 2 - EPS;\\n\\t\\tR lef, rig;\\n\\t\\trep(300) {\\n\\t\\t\\tlef = inf + (sup - inf) / 3;\\n\\t\\t\\trig = (lef + sup) / 2;\\n\\t\\t\\tif(f(lef, obj_x) < f(rig, obj_x)) {\\n\\t\\t\\t\\tinf = lef;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tsup = rig;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn lef;\\n\\t};\\n\\n\\tauto binarysearch = [&](R lef, R rig, R obj_x, R obj_y) {\\n\\t\\tR mid;\\n\\t\\trep(300) {\\n\\t\\t\\tmid = lef + rig;\\n\\t\\t\\tmid /= 2;\\n\\t\\t\\tif((f(mid, obj_x) - obj_y) * (f(lef, obj_x) - obj_y) > 0) {\\n\\t\\t\\t\\tlef = mid;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\trig = mid;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn mid;\\n\\t};\\n\\n\\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\\n\\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\\n\\t\\tR inf = 0;\\n\\t\\tR sup = pi / 2 - EPS;\\n\\n\\t\\tR mid = calc_top(obj_x);\\n\\n\\t\\tif(compare(f(mid, obj_x), obj_y) == -1) {\\n\\t\\t\\treturn make_pair(-1., -1.);\\n\\t\\t}\\n\\n\\t\\t// R a, b;\\n\\t\\t// inf = 0;\\n\\t\\t// rep(300) {\\n\\t\\t// \\ta = (inf + mid) / 2;\\n\\t\\t// \\tif(f(a, obj_x) < obj_y) {\\n\\t\\t// \\t\\tinf = a;\\n\\t\\t// \\t} else {\\n\\t\\t// \\t\\tmid = a;\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\n\\t\\t// mid = sup;\\n\\t\\t// sup = pi / 2 - EPS;\\n\\n\\t\\t// rep(300) {\\n\\t\\t// \\tb = (mid + sup) / 2;\\n\\t\\t// \\tif(f(b, obj_x) < obj_y) {\\n\\t\\t// \\t\\tsup = b;\\n\\t\\t// \\t} else {\\n\\t\\t// \\t\\tmid = b;\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\n\\t\\treturn make_pair(binarysearch(inf, mid, obj_x, obj_y), binarysearch(mid, sup, obj_x, obj_y));\\n\\t};\\n\\n\\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\\n\\n\\tauto collision = [&](R theta, int obs_idx) -> bool {\\n\\t\\tR top = tp(theta);\\n\\t\\trep(i, 3) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR xl, xr, y;\\n\\t\\t\\ty = seg.a.imag();\\n\\t\\t\\txl = seg.a.real();\\n\\t\\t\\txr = seg.b.real();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(y, xl, xr);\\n\\t\\t\\t}\\n\\t\\t\\tif(xl > xr) swap(xl, xr);\\n\\t\\t\\tif(x_pig <= xl) continue;\\n\\t\\t\\tchmin(xr, x_pig);\\n\\t\\t\\tR yl = f(theta, xl);\\n\\t\\t\\tR yr = f(theta, xr);\\n\\t\\t\\tif(xl <= top && top <= xr) {\\n\\t\\t\\t\\t// if(f(theta, top) > y) {\\n\\t\\t\\t\\tif(compare(f(theta, top), y) == 1) {\\n\\t\\t\\t\\t\\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif((yl - y) * (yr - y) < -EPS) return true;\\n\\t\\t}\\n\\n\\t\\tdebug(theta);\\n\\n\\t\\trep(i, 3, 6) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR yd, x, yt;\\n\\t\\t\\tx = seg.a.real();\\n\\t\\t\\tyd = seg.a.imag();\\n\\t\\t\\tyt = seg.b.imag();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(x, yd, yt);\\n\\t\\t\\t}\\n\\t\\t\\tif(x_pig < x) continue;\\n\\t\\t\\tif(yd > yt) swap(yd, yt);\\n\\t\\t\\tR y = f(theta, x);\\n\\t\\t\\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\\n\\t\\t}\\n\\n\\t\\treturn false;\\n\\t};\\n\\n\\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\\n\\n\\tauto ok = [&](R angle) {\\n\\t\\tif(!use(angle)) return false;\\n\\t\\trep(i, n) if(collision(angle, i)) return false;\\n\\t\\tR y = f(angle, x_pig);\\n\\t\\tif(y < y_pig) return false;\\n\\t\\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\\n\\t\\tfoa(ob, obstacle) {\\n\\t\\t\\tfoa(seg, ob) {\\n\\t\\t\\t\\tif(intersect(seg, egg)) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdebug(angle);\\n\\t\\tdebug(f(angle, 1));\\n\\t\\tdebug(f(angle, 2));\\n\\t\\tdebug(f(angle, 3));\\n\\t\\treturn true;\\n\\t};\\n\\n\\tauto res = calc_theta(1.2, 1.5);\\n\\tdebug(f(res.first, 1.2));\\n\\tdebug(f(res.second, 1.2));\\n\\n\\tfoa(p, pts) {\\n\\t\\tif(eq(p, 0.)) continue;\\n\\t\\tauto angles = calc_theta(p.real(), p.imag());\\n\\t\\tif(ok(angles.first) || ok(angles.second)) return true;\\n\\t}\\n\\n\\tauto angles = calc_theta(x_pig, y_pig);\\n\\treturn (ok(angles.first) || ok(angles.second));\\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\\t// std::cerr << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint n;\\n\\twhile(cin >> n) {\\n\\t\\tYes(solve(n));\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.8,\n \"time_ms\": 70,\n \"memory_kb\": 3940,\n \"score_of_the_acc\": -1.1215,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2308_5846497\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.01 15:05: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\\nusing R = long double;\\n\\n#pragma region geometry_light\\n\\nusing Real = long double;\\nusing R = Real;\\nusing Point = std::complex<Real>;\\nusing Vec = Point;\\nconst Real EPS = 1e-10, PI = acos(-1);\\n\\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\\n/*\\n\\t-1: a < b\\n\\t0 : a == b\\n\\t1 : a > b\\n*/\\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\\n\\nnamespace std {\\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n} // namespace std\\n\\nstd::istream &operator>>(std::istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// rotate point 'p' for counter clockwise direction\\nconst Point rotate(const Real &theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\\n\\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\\n\\n// get angle a-b-c (<pi)\\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), w(c - b);\\n\\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\\n\\treturn std::min(theta, 2 * PI - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \\\" -- \\\" << p.b; }\\n\\n\\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = std::vector<Point>;\\nusing Polygon = std::vector<Point>;\\nusing Segments = std::vector<Segment>;\\nusing Lines = std::vector<Line>;\\nusing Circles = std::vector<Circle>;\\n\\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nconst int ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1;\\t\\t// \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1;\\t\\t// \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < -EPS) return +2;\\t\\t\\t// \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) + EPS < norm(c)) return -2;\\t// \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\\n\\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\\n\\nint intersect(const Line &l, const Line &m) {\\n\\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\\n\\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\\n}\\n\\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\\n\\nint intersect(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\\n\\treturn 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\\nint intersect(const Circle &c, const Line &l) {\\n\\tReal d = c.r - distance(l, c.p);\\n\\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\\n}\\n\\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nint intersect(const Segment &s, const Segment &t) {\\n\\tif(eq(s.a, s.b)) return intersect(t, s.a);\\n\\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\\n\\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\\n\\t\\treturn -1;\\n\\treturn int(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\\tconst Point h = projection(l, c.p);\\n\\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\\n\\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\\n}\\n\\nReal distance(const Point &a, const Point &b);\\n\\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\\n\\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\\n\\tint com = compare(r1 + r2, d);\\n\\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\\n\\t// if(c1.r < c2.r) swap(c1, c2);\\n\\t// Real d = abs(c1.p - c2.p);\\n\\t// if(compare(c1.r + c2.r, d) == -1) return 4;\\n\\t// if(eq(c1.r + c2.r, d)) return 3;\\n\\t// if(compare(c1.r - c2.r, d) == -1) return 2;\\n\\t// return int(eq(c1.r - c2.r, d));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\treturn intersect(s, r) ? distance(r, p) : std::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\\tif(intersect(a, b)) return 0;\\n\\treturn std::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\\tif(intersect(l, s)) return 0;\\n\\treturn std::min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn 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) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn make_pair(pr - v, pr + v);\\n\\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\\n\\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\t// return {pr - e * base, pr + e * base};\\n}\\n\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\\n\\tauto ret = crosspoint(c, Line(l.a, l.b));\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn make_pair(p1, p2);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\\n\\treturn 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\\tLines ret;\\n\\tif(c1.r < c2.r) std::swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tVec u = (c2.p - c1.p) / Real(sqrt(g));\\n\\tVec v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\nbool solve(int n) {\\n\\tR velocity;\\n\\tcin >> velocity;\\n\\tR x_pig, y_pig;\\n\\tcin >> x_pig >> y_pig;\\n\\n\\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\\n\\n\\tPoints pts;\\n\\n\\trep(j, n) {\\n\\t\\tR l, b, r, t;\\n\\t\\tcin >> l >> b >> r >> t;\\n\\t\\tpts.emplace_back(l, t);\\n\\t\\tpts.emplace_back(l, b);\\n\\t\\tpts.emplace_back(r, t);\\n\\t\\tpts.emplace_back(r, b);\\n\\n\\t\\tR mid_x = (l + r) / 2;\\n\\t\\tR mid_y = (b + t) / 2;\\n\\t\\tPoints pts;\\n\\t\\tfor(R x : {l, mid_x, r}) {\\n\\t\\t\\tfor(R y : {b, mid_y, t}) {\\n\\t\\t\\t\\tpts.emplace_back(x, y);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, 3) { obstacle[j].emplace_back(pts[i], pts[i + 6]); }\\n\\t\\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\\n\\t}\\n\\n\\tconst R g = 9.8;\\n\\n\\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\\n\\n\\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\\n\\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\\n\\t\\tR inf = 0;\\n\\t\\tR sup = pi / 2 - EPS;\\n\\n\\t\\trep(300) {\\n\\t\\t\\tR lef = inf + (sup - inf) / 3;\\n\\t\\t\\tR rig = (lef + sup) / 2;\\n\\t\\t\\tif(f(lef, obj_x) < f(rig, obj_x)) {\\n\\t\\t\\t\\tinf = lef;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tsup = rig;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(compare(f(sup, obj_x), obj_y) == -1) {\\n\\t\\t\\treturn make_pair(-1., -1.);\\n\\t\\t}\\n\\n\\t\\tR mid = sup;\\n\\t\\tR a, b;\\n\\t\\tinf = 0;\\n\\t\\trep(300) {\\n\\t\\t\\ta = (inf + mid) / 2;\\n\\t\\t\\tif(f(a, obj_x) < obj_y) {\\n\\t\\t\\t\\tinf = a;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tmid = a;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tmid = sup;\\n\\t\\tsup = pi / 2 - EPS;\\n\\n\\t\\trep(300) {\\n\\t\\t\\tb = (mid + sup) / 2;\\n\\t\\t\\tif(f(b, obj_x) < obj_x) {\\n\\t\\t\\t\\tsup = b;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tmid = b;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn pair(a, b);\\n\\t};\\n\\n\\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\\n\\n\\tauto collision = [&](R theta, int obs_idx) -> bool {\\n\\t\\tR top = tp(theta);\\n\\t\\trep(i, 3) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR xl, xr, y;\\n\\t\\t\\ty = seg.a.imag();\\n\\t\\t\\txl = seg.a.real();\\n\\t\\t\\txr = seg.b.real();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(y, xl, xr);\\n\\t\\t\\t}\\n\\t\\t\\tif(xl > xr) swap(xl, xr);\\n\\t\\t\\tif(x_pig <= xl) continue;\\n\\t\\t\\tchmin(xr, x_pig);\\n\\t\\t\\tR yl = f(theta, xl);\\n\\t\\t\\tR yr = f(theta, xr);\\n\\t\\t\\tif(xl <= top && top <= xr) {\\n\\t\\t\\t\\t// if(f(theta, top) > y) {\\n\\t\\t\\t\\tif(compare(f(theta, top), y) == 1) {\\n\\t\\t\\t\\t\\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif((yl - y) * (yr - y) < -EPS) return true;\\n\\t\\t}\\n\\n\\t\\tdebug(theta);\\n\\n\\t\\trep(i, 3, 6) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR yd, x, yt;\\n\\t\\t\\tx = seg.a.real();\\n\\t\\t\\tyd = seg.a.imag();\\n\\t\\t\\tyt = seg.b.imag();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(x, yd, yt);\\n\\t\\t\\t}\\n\\t\\t\\tif(x > x_pig) continue;\\n\\t\\t\\tif(yd > yt) swap(yd, yt);\\n\\t\\t\\tR y = f(theta, x);\\n\\t\\t\\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\\n\\t\\t}\\n\\n\\t\\treturn false;\\n\\t};\\n\\n\\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\\n\\n\\tauto ok = [&](R angle) {\\n\\t\\tif(!use(angle)) return false;\\n\\t\\trep(i, n) if(collision(angle, i)) return false;\\n\\t\\tR y = f(angle, x_pig);\\n\\t\\tif(y < y_pig) return false;\\n\\t\\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\\n\\t\\tfoa(ob, obstacle) {\\n\\t\\t\\tfoa(seg, ob) {\\n\\t\\t\\t\\tif(intersect(seg, egg)) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdebug(angle);\\n\\t\\tdebug(f(angle, 1));\\n\\t\\tdebug(f(angle, 2));\\n\\t\\tdebug(f(angle, 3));\\n\\t\\treturn true;\\n\\t};\\n\\n\\tfoa(p, pts) {\\n\\t\\tif(eq(p, 0.)) continue;\\n\\t\\tauto angles = calc_theta(p.real(), p.imag());\\n\\t\\tif(ok(angles.first) || ok(angles.second)) return true;\\n\\t}\\n\\n\\tauto angles = calc_theta(x_pig, y_pig);\\n\\treturn (ok(angles.first) || ok(angles.second));\\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\\t// std::cerr << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint n;\\n\\twhile(cin >> n) {\\n\\t\\tYes(solve(n));\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6,\n \"time_ms\": 30,\n \"memory_kb\": 3956,\n \"score_of_the_acc\": -1.0426,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2308_5846469\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.01 15:05: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\\nusing R = long double;\\n\\n#pragma region geometry_light\\n\\nusing Real = long double;\\nusing R = Real;\\nusing Point = std::complex<Real>;\\nusing Vec = Point;\\nconst Real EPS = 1e-10, PI = acos(-1);\\n\\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\\n/*\\n\\t-1: a < b\\n\\t0 : a == b\\n\\t1 : a > b\\n*/\\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\\n\\nnamespace std {\\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n} // namespace std\\n\\nstd::istream &operator>>(std::istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// rotate point 'p' for counter clockwise direction\\nconst Point rotate(const Real &theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\\n\\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\\n\\n// get angle a-b-c (<pi)\\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), w(c - b);\\n\\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\\n\\treturn std::min(theta, 2 * PI - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \\\" -- \\\" << p.b; }\\n\\n\\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = std::vector<Point>;\\nusing Polygon = std::vector<Point>;\\nusing Segments = std::vector<Segment>;\\nusing Lines = std::vector<Line>;\\nusing Circles = std::vector<Circle>;\\n\\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nconst int ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1;\\t\\t// \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1;\\t\\t// \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < -EPS) return +2;\\t\\t\\t// \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) + EPS < norm(c)) return -2;\\t// \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\\n\\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\\n\\nint intersect(const Line &l, const Line &m) {\\n\\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\\n\\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\\n}\\n\\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\\n\\nint intersect(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\\n\\treturn 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\\nint intersect(const Circle &c, const Line &l) {\\n\\tReal d = c.r - distance(l, c.p);\\n\\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\\n}\\n\\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nint intersect(const Segment &s, const Segment &t) {\\n\\tif(eq(s.a, s.b)) return intersect(t, s.a);\\n\\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\\n\\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\\n\\t\\treturn -1;\\n\\treturn int(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\\tconst Point h = projection(l, c.p);\\n\\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\\n\\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\\n}\\n\\nReal distance(const Point &a, const Point &b);\\n\\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\\n\\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\\n\\tint com = compare(r1 + r2, d);\\n\\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\\n\\t// if(c1.r < c2.r) swap(c1, c2);\\n\\t// Real d = abs(c1.p - c2.p);\\n\\t// if(compare(c1.r + c2.r, d) == -1) return 4;\\n\\t// if(eq(c1.r + c2.r, d)) return 3;\\n\\t// if(compare(c1.r - c2.r, d) == -1) return 2;\\n\\t// return int(eq(c1.r - c2.r, d));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\treturn intersect(s, r) ? distance(r, p) : std::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\\tif(intersect(a, b)) return 0;\\n\\treturn std::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\\tif(intersect(l, s)) return 0;\\n\\treturn std::min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn 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) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn make_pair(pr - v, pr + v);\\n\\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\\n\\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\t// return {pr - e * base, pr + e * base};\\n}\\n\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\\n\\tauto ret = crosspoint(c, Line(l.a, l.b));\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn make_pair(p1, p2);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\\n\\treturn 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\\tLines ret;\\n\\tif(c1.r < c2.r) std::swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tVec u = (c2.p - c1.p) / Real(sqrt(g));\\n\\tVec v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\nbool solve(int n) {\\n\\tR velocity;\\n\\tcin >> velocity;\\n\\tR x_pig, y_pig;\\n\\tcin >> x_pig >> y_pig;\\n\\n\\tVV<Segment> obstacle(n); // 0 ~ 2 yoko, 3~5 tate\\n\\n\\tPoints pts;\\n\\n\\trep(j, n) {\\n\\t\\tR l, b, r, t;\\n\\t\\tcin >> l >> b >> r >> t;\\n\\t\\tpts.emplace_back(l, t);\\n\\t\\tpts.emplace_back(l, b);\\n\\t\\tpts.emplace_back(r, t);\\n\\t\\tpts.emplace_back(r, b);\\n\\n\\t\\tR mid_x = (l + r) / 2;\\n\\t\\tR mid_y = (b + t) / 2;\\n\\t\\tPoints pts;\\n\\t\\tfor(R x : {l, mid_x, r}) {\\n\\t\\t\\tfor(R y : {b, mid_y, t}) {\\n\\t\\t\\t\\tpts.emplace_back(x, y);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trep(i, 3) { obstacle[j].emplace_back(pts[i], pts[i + 6]); }\\n\\t\\trep(i, 3) obstacle[j].emplace_back(pts[i * 3], pts[i * 3 + 2]);\\n\\t}\\n\\n\\tconst R g = 9.8;\\n\\n\\tauto f = [&](R theta, R x) { return x * tan(theta) - g / 2 * pow(x / (velocity * cos(theta)), (R)2.); };\\n\\n\\t// y = x tan theta - (g/2) (x/(v_0 cos theta))^2\\n\\tauto calc_theta = [&](R obj_x, R obj_y) -> pair<R, R> {\\n\\t\\tR inf = 0;\\n\\t\\tR sup = pi / 2 - EPS;\\n\\n\\t\\trep(100) {\\n\\t\\t\\tR lef = inf + (sup - inf) / 3;\\n\\t\\t\\tR rig = (lef + sup) / 2;\\n\\t\\t\\tif(f(lef, obj_x) < f(rig, obj_x)) {\\n\\t\\t\\t\\tinf = lef;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tsup = rig;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif(compare(f(sup, obj_x), obj_y) == -1) {\\n\\t\\t\\treturn make_pair(-1., -1.);\\n\\t\\t}\\n\\n\\t\\tR mid = sup;\\n\\t\\tR a, b;\\n\\t\\tinf = 0;\\n\\t\\trep(100) {\\n\\t\\t\\ta = (inf + mid) / 2;\\n\\t\\t\\tif(f(a, obj_x) < obj_y) {\\n\\t\\t\\t\\tinf = a;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tmid = a;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tmid = sup;\\n\\t\\tsup = pi / 2 - EPS;\\n\\n\\t\\trep(100) {\\n\\t\\t\\tb = (mid + sup) / 2;\\n\\t\\t\\tif(f(b, obj_x) < obj_x) {\\n\\t\\t\\t\\tsup = b;\\n\\t\\t\\t} else {\\n\\t\\t\\t\\tmid = b;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn pair(a, b);\\n\\t};\\n\\n\\tauto tp = [&](R theta) { return pow(velocity, 2.) * cos(theta) * sin(theta) / g; };\\n\\n\\tauto collision = [&](R theta, int obs_idx) -> bool {\\n\\t\\tR top = tp(theta);\\n\\t\\trep(i, 3) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR xl, xr, y;\\n\\t\\t\\ty = seg.a.imag();\\n\\t\\t\\txl = seg.a.real();\\n\\t\\t\\txr = seg.b.real();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(y, xl, xr);\\n\\t\\t\\t}\\n\\t\\t\\tif(xl > xr) swap(xl, xr);\\n\\t\\t\\tif(x_pig <= xl) continue;\\n\\t\\t\\tchmin(xr, x_pig);\\n\\t\\t\\tR yl = f(theta, xl);\\n\\t\\t\\tR yr = f(theta, xr);\\n\\t\\t\\tif(xl <= top && top <= xr) {\\n\\t\\t\\t\\t// if(f(theta, top) > y) {\\n\\t\\t\\t\\tif(compare(f(theta, top), y) == 1) {\\n\\t\\t\\t\\t\\tif(compare(yl, y) == -1 || compare(yr, y) == -1) return true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif((yl - y) * (yr - y) < -EPS) return true;\\n\\t\\t}\\n\\n\\t\\tdebug(theta);\\n\\n\\t\\trep(i, 3, 6) {\\n\\t\\t\\tauto &seg = obstacle[obs_idx][i];\\n\\t\\t\\tR yd, x, yt;\\n\\t\\t\\tx = seg.a.real();\\n\\t\\t\\tyd = seg.a.imag();\\n\\t\\t\\tyt = seg.b.imag();\\n\\t\\t\\tif(eq(theta, 0.899297831746404)) {\\n\\t\\t\\t\\tdebug(x, yd, yt);\\n\\t\\t\\t}\\n\\t\\t\\tif(x > x_pig) continue;\\n\\t\\t\\tif(yd > yt) swap(yd, yt);\\n\\t\\t\\tR y = f(theta, x);\\n\\t\\t\\tif(compare(yd, y) == -1 && compare(y, yt) == -1) return true;\\n\\t\\t}\\n\\n\\t\\treturn false;\\n\\t};\\n\\n\\tauto use = [&](R angle) { return EPS < angle && angle < pi / 2 - EPS * 2; };\\n\\n\\tauto ok = [&](R angle) {\\n\\t\\tif(!use(angle)) return false;\\n\\t\\trep(i, n) if(collision(angle, i)) return false;\\n\\t\\tR y = f(angle, x_pig);\\n\\t\\tif(y < y_pig) return false;\\n\\t\\tSegment egg(Point(x_pig, y), Point(x_pig, y_pig));\\n\\t\\tfoa(ob, obstacle) {\\n\\t\\t\\tfoa(seg, ob) {\\n\\t\\t\\t\\tif(intersect(seg, egg)) {\\n\\t\\t\\t\\t\\treturn false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdebug(angle);\\n\\t\\tdebug(f(angle, 1));\\n\\t\\tdebug(f(angle, 2));\\n\\t\\tdebug(f(angle, 3));\\n\\t\\treturn true;\\n\\t};\\n\\n\\tfoa(p, pts) {\\n\\t\\tif(eq(p, 0.)) continue;\\n\\t\\tauto angles = calc_theta(p.real(), p.imag());\\n\\t\\tif(ok(angles.first) || ok(angles.second)) return true;\\n\\t}\\n\\n\\tauto angles = calc_theta(x_pig, y_pig);\\n\\treturn (ok(angles.first) || ok(angles.second));\\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\\t// std::cerr << std::fixed << std::setprecision(15);\\n\\tsrand((unsigned)time(NULL));\\n\\n\\tint n;\\n\\twhile(cin >> n) {\\n\\t\\tYes(solve(n));\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6,\n \"time_ms\": 10,\n \"memory_kb\": 3884,\n \"score_of_the_acc\": -0.9723,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2308_2682265\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n\\nusing namespace std;\\n\\n#define _USE_MATH_DEFINES\\n\\nconst int NMax = 150;\\nconst double eps = 1e-8;\\nconst double eps1 = 1e-6;\\nconst double gravity = 9.8;\\nconst double PI = 3.14159265;\\n\\nint N, V, X, Y;\\nint L[NMax], B[NMax], R[NMax], T[NMax];\\n\\nint main()\\n{\\n\\tcin >>N >>V >>X >>Y;\\n\\n\\tfor (int i = 1; i <= N; ++i)\\n\\t\\tcin >>L[i] >>B[i] >>R[i] >>T[i];\\n\\n\\tfor (double alpha = -eps1; alpha <= PI/2; alpha += eps1)\\n\\t{\\n\\t\\tdouble V_0x = V * cos(alpha);\\n\\t\\tdouble V_0y = V * sin(alpha);\\n\\t\\tdouble Time = X / V_0x;\\n\\t\\tdouble LandY = V_0y * Time - 0.5*gravity*(Time*Time);\\n\\n\\t\\tif (Y - LandY <= eps)\\n\\t\\t{\\n bool intersect = 0;\\n\\n for (int i = 1; i <= N; ++i)\\n if (X - L[i] >= eps && X - R[i] <= eps &&\\n\\t\\t\\t\\t\\tLandY - B[i] >= eps && LandY - T[i] <= eps)\\n\\t\\t\\t\\t\\tintersect = 1;\\n\\n for (int i = 1; i <= N; ++i)\\n\\t\\t\\t\\tfor (int j = L[i]; j <= R[i]; ++j)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tdouble TimeToJ = j / V_0x;\\n\\t\\t\\t\\t\\tif (Time - TimeToJ >= eps)\\n\\t\\t\\t\\t\\t{\\n double newY = V_0y * TimeToJ - 0.5*gravity*(TimeToJ*TimeToJ);\\n if (newY - B[i] - eps >= 0 &&\\n\\t\\t\\t\\t\\t\\t\\tnewY - T[i] - eps <= 0)\\n\\t\\t\\t\\t\\t\\t\\t\\tintersect = 1;\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\tif (!intersect)\\n\\t\\t\\t{\\n cout <<\\\"Yes\\\" <<'\\\\n';\\n return 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tcout <<\\\"No\\\" <<'\\\\n';\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 480,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -1.8185,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2308_2517963\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstring>\\n#include <algorithm>\\n#include <cmath>\\nusing namespace std;\\n\\n#define MAXN 55\\n#define EPS 1e-6\\n#define g 9.8\\n#define PI acos(-1)\\n\\nstruct Obstacle\\n{\\n int l;\\n int r;\\n int t;\\n int b;\\n} ob[MAXN];\\n\\nint n,v,tx,ty;\\ndouble a,b,c;\\n\\nvoid getabc(double angle)\\n{\\n double vx = v * cos(angle); //x?方向速度\\n double vy = v * sin(angle); //y?方向速度\\n a = -0.5 * g / (vx * vx);\\n b = vy / vx;\\n c = 0;\\n}\\n\\nbool check1(double x, double up, double down) //是否会撞到障碍物的左（右）?端或者左（右）底端\\n{\\n if(x >= tx) //如果障碍物的x坐?在猪的x坐?的右?，?就算会撞到也不要?（?炸??死猪不受?障碍物影?）\\n return false;\\n double y = a * x * x + b * x + c; //求出相?的y坐?\\n if(up <= y && y <= down) //会撞到\\n return true;\\n return false;\\n}\\n\\nbool check2(double y, double left, double right)\\n{\\n double delta = b * b - 4 * a * y;\\n if(delta < 0) //抛物?与障碍物上（下）的左端和右端形成的?段没有交点，?不会相撞\\n return false;\\n delta = sqrt(delta);\\n double x1 = (-b + delta) / (2 * a);\\n double x2 = (-b - delta) / (2 * a);\\n if(x1 < tx && left <= x1 && x1 <= right) //如果抛物?与障碍物上（下）的左端点有交点且交点的x坐?在猪的左?，?无法?死猪\\n return true;\\n if(x2 < tx && left <= x2 && x2 <= right) //如果抛物?与障碍物上（下）的右端点有交点且交点的x坐?在猪的左?，?无法?死猪\\n return true;\\n return false;\\n}\\n\\nbool check3(double x, double y, double h, double t, double l, double r)\\n{\\n if(l <= x && x <= r && y <= t && t <= h) //如果障碍正好?在白??行的抛物??迹和猪的中?，?炸蛋无法?中猪\\n return true;\\n return false;\\n}\\n\\nbool check(double angle)\\n{\\n getabc(angle);\\n double h = a * tx * tx + b * tx + c;\\n if(h < ty) //?不到猪的上方，?不可能?死猪\\n return false;\\n for(int i=0; i<n; i++)\\n {\\n if(check1(ob[i].l,ob[i].b,ob[i].t))\\n return false;\\n if(check1(ob[i].r,ob[i].b,ob[i].t))\\n return false;\\n if(check2(ob[i].b,ob[i].l,ob[i].r))\\n return false;\\n if(check2(ob[i].t,ob[i].l,ob[i].r))\\n return false;\\n if(check3(tx,ty,h,ob[i].b,ob[i].l,ob[i].r))\\n return false;\\n //if(check3(tx,ty,h,ob[i].t,ob[i].l,ob[i].r))\\n // return false;\\n }\\n return true;\\n}\\n\\nbool solve()\\n{\\n for(double i=0; i<0.5*PI; i+=0.000001)\\n {\\n if(check(i))\\n return true;\\n }\\n return false;\\n}\\n\\nint main()\\n{\\n scanf(\\\"%d%d%d%d\\\",&n,&v,&tx,&ty);\\n for(int i=0; i<n; i++)\\n scanf(\\\"%d%d%d%d\\\",&ob[i].l,&ob[i].b,&ob[i].r,&ob[i].t);\\n if(solve())\\n puts(\\\"Yes\\\");\\n else\\n puts(\\\"No\\\");\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -1.0087,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2308_2040309\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define x() real()\\n#define y() imag()\\n#define x1 jfwekljfwklj\\n#define x2 jfwekljwefkjklf\\ntypedef complex<double> P;\\nconst double g = 4.9;\\nconst double EPS = 1e-8;\\nint N;\\ndouble V,X,Y;\\n \\n// = -(gx2/v2)tan2 + xtan - y\\n \\nstruct Box{\\n P p1,p2,p3,p4;\\n};\\nvector<Box> box;\\n \\nP in(){\\n double x,y;\\n cin >> x >> y;\\n return P(x,y);\\n}\\n \\nbool inner(double a,double b,double c){\\n return a + EPS < b and b < c - EPS;\\n}\\nvoid trying(double tanv){\\n double a = - g / V / V * (1+tanv * tanv);\\n double b = tanv;\\n auto f = [a,b](double x){\\n return a * x * x + b * x;\\n };\\n auto g = [a,b](double y){ \\n vector<double> ps;\\n double c = -y;\\n double D = b*b-4*a*c;\\n if( D < -EPS ){\\n return ps;\\n }\\n if( D < EPS ) D = 0;\\n D = sqrt(D);\\n double x1 = (-b+D)/(2*a);\\n double x2 = (-b-D)/(2*a);\\n ps = {x1,x2};\\n return ps;\\n };\\n \\n \\n double hx = 1e9;\\n double hy = 1e9;\\n vector<double> uxtmp;\\n \\n for( auto b : box ){\\n if( inner(b.p1.x(),X,b.p2.x()) and b.p1.y() > Y ){\\n hy = min(hy,b.p1.y());\\n }\\n }\\n for( auto b : box ){\\n double x = b.p1.x();\\n uxtmp.push_back(x);\\n double y = f(x);\\n if( inner(b.p1.y(),y,b.p4.y()) ){\\n hx = min(x,hx);\\n }\\n }\\n \\n for( auto b : box ){\\n double x = b.p2.x();\\n double y = f(x);\\n uxtmp.push_back(x);\\n if( inner(b.p2.y(),y,b.p3.y()) ){\\n hx = min(x,hx);\\n }\\n }\\n \\n for( auto b : box ){\\n double y = b.p1.y();\\n for( double x : g(y) ){\\n uxtmp.push_back(x);\\n if( inner(b.p1.x(),x,b.p2.x()) ){\\n hx = min(x,hx);\\n }\\n }\\n }\\n \\n for( auto b : box ){\\n double y = b.p3.y();\\n for( double x : g(y) ){\\n uxtmp.push_back(x);\\n if( inner(b.p1.x(),x,b.p2.x()) ){\\n hx = min(x,hx);\\n }\\n }\\n }\\n sort(uxtmp.begin(),uxtmp.end());\\n vector<double> ux;\\n for(int i = 0 ; i < uxtmp.size() ; i++)\\n if( !i or uxtmp[i] - uxtmp[i-1] > EPS )\\n ux.push_back(uxtmp[i]);\\n \\n for( auto b : box ){\\n if( inner(b.p1.x(),X,b.p2.x()) ){\\n if( inner(b.p1.y(),Y,b.p4.y()) ){\\n hx = -1e9;\\n }\\n }\\n }\\n for(int i = 0 ; i+1 < ux.size() ; i++){\\n \\n double x = (ux[i] + ux[i+1] ) / 2;\\n double y = f(x);\\n for( auto b : box ){\\n if( inner(b.p1.x(),x,b.p2.x()) ){\\n if( inner(b.p1.y(),y,b.p4.y()) ){\\n hx = min(ux[i],hx);\\n }\\n }\\n }\\n }\\n //cout << f(1) << endl;\\n //cout << hy << endl;\\n //cout << V << \\\" \\\" << tanv << \\\" \\\" << a << \\\" \\\" << b << \\\" \\\" << X << \\\" \\\" << f(X) << endl;\\n if( hx + EPS > X ){\\n //cout << f(X) << \\\" \\\" << Y - EPS << endl;\\n if( f(X) > Y - EPS and f(X) < hy - EPS ){\\n cout << \\\"Yes\\\" << endl;\\n //cout << atan(tanv) << endl;\\n exit(0);\\n }\\n }\\n \\n \\n \\n \\n \\n \\n}\\n \\n \\nint main(){\\n \\n cin >> N;\\n cin >> V >> X >> Y;\\n \\n \\n vector<P> ps;\\n for(int i = 0 ; i < N ; i++){\\n P a,b;\\n a = in();\\n b = in();\\n ps.push_back(a);\\n ps.push_back(P(b.x(),a.y()));\\n ps.push_back(b);\\n ps.push_back(P(a.x(),b.y()));\\n box.push_back({P(a.x(),a.y()),P(b.x(),a.y()),P(b.x(),b.y()),P(a.x(),b.y())}); \\n \\n }\\n for(int i = 0 ; i < 3000 ; i++){\\n trying(0.001*i);\\n }\\n if(true){\\n double x = X;\\n double y = Y;\\n double a = -g/V/V*x*x;\\n double b = x;\\n double c = -y-g/V/V*x*x;\\n //cout << a << \\\" \\\" << b << \\\" \\\" << c << \\\" ( \\\" << g << \\\" \\\" << V << \\\" \\\" << x << endl;\\n double D = b*b-4*a*c;\\n if( D < -EPS ){\\n \\n }else{\\n D = max(0.0,D);\\n D = sqrt(D);\\n double t1 = (-b+D)/(2*a);\\n double t2 = (-b-D)/(2*a);\\n trying(t1);\\n trying(t2);\\n }\\n }\\n \\n for(int i = 0 ; i < ps.size() ; i++){\\n double x = ps[i].x();\\n double y = ps[i].y();\\n if( x == 0 ) continue;\\n double a = -g/V/V*x*x;\\n double b = x;\\n double c = -y-g/V/V*x*x;\\n \\n \\n double D = b*b-4*a*c;\\n if( D < -EPS ){\\n continue;\\n }\\n \\n //printf(\\\"%.20lf\\\\n\\\",D); \\n if( D < EPS ) D = 0;\\n \\n \\n double t1 = (-b+D)/(2*a);\\n double t2 = (-b-D)/(2*a);\\n trying(t1);\\n trying(t2);\\n }\\n \\n cout << \\\"No\\\" << endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3300,\n \"score_of_the_acc\": -0.8115,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2308_1777434\",\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;\\ntemplate<class T>\\nusing Table = vector<vector<T>>;\\nconst ld eps=1e-9;\\n\\n//// < \\\"D:\\\\D_Download\\\\Visual Studio 2015\\\\Projects\\\\programing_contest_c++\\\\Debug\\\\a.txt\\\"\\n\\n\\n/* ??????????????¬ */\\n\\n#include <complex>\\n\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define ALL(x) (x).begin(),(x).end()\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// ????????\\\\???\\nPoint input_point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// ????????????????????????\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// ??????\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// ??????\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// ??´????????????\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// ????????????\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// CCW\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\\n\\treturn 0; // a,c,b???????????´???????????¶\\n}\\n\\n\\n/* ???????????? */\\n\\n// ??´?????¨??´??????????????????\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// ??´?????¨?????????????????????\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// ????????¨?????????????????????\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// ????????´????????????\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// ?????????????????????\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// ??????????¶?\\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// ????????¨???????????????\\n//???????????£????????¨???????????¨assert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//??????isis_ss?????????\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// ??´?????¨???????????¢\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n// ??´?????¨??´???????????¢\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// ??´?????¨??????????????¢\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// ????????¨???????????¢\\nld dist_sp(const Line& s, const 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\\n// ????????¨??????????????¢\\nld dist_ss(const Line& s, const 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\\n\\n//??´?????¨??´?????????????????????????????????\\nLine bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:??????\\n//c:????????§??????\\n//???????????´?????????????????¢?????????????±??????????\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* ??? */\\n\\n// ?????¨????????????\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n//???????????????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n//???lc??????rc??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint circle_in_circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// ?????¨??´????????????\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// ?????¨??????????????¢\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), ALL(nret));\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//??????????????????????????¢???\\nld two_circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* ????§???¢ */\\n\\ntypedef vector<Point> Polygon;\\n\\n// ??¢???\\nld area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n// ????§???¢????????¢??????\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// ??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//??????????????????2?????????\\nenum { OUT, ON, IN };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// ??????\\n// ???????????????????????¨????????????????????§??¨???\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n// ????????????\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon Q;\\n\\tPolygon R;\\n\\tREP(i, n) {\\n\\t\\tPoint A = ps[i], B = ps[(i + 1) % n];\\n\\t\\tLine m = Line(A, B);\\n\\t\\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tQ.push_back(is_ll(l, m));\\n\\t\\t\\tR.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ Q,R };\\n\\treturn polys;\\n}\\n\\n\\n/* ??¢??¬??????????????? */\\nvoid add_point(vector<Point> &ps, const Point p) {\\n\\tfor (Point q : ps) if (abs(q - p) < eps) return;\\n\\tps.push_back(p);\\n}\\n\\ntypedef int Weight;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tEdge(int src, int dst, Weight weight) :\\n\\t\\tsrc(src), dst(dst), weight(weight) { }\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\\n\\tg[from].push_back(Edge{ from, to, weight });\\n}\\n\\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\\n\\tint n = p.size(), m = s.size();\\n\\tGraph g(n);\\n\\tREP(i, m) {\\n\\t\\tvector<pair<ld, int>> vec;\\n\\t\\tREP(j, n) if (isis_sp(s[i], p[j]))\\n\\t\\t\\tvec.emplace_back(abs(s[i].a - p[j]), j);\\n\\t\\tsort(ALL(vec));\\n\\t\\tREP(j, vec.size() - 1) {\\n\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\\n\\t\\t}\\n\\t}\\n\\treturn g;\\n}\\nGraph sennbunn_arrangement(const vector<Line>&s) {\\n\\tvector<Point>crss;\\n\\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\\n\\t\\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\\n\\t\\t\\tif (isis_ss(s[i], s[j])) {\\n\\t\\t\\t\\tcrss.push_back(is_ll(s[i], s[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\\n\\t\\tcrss.push_back(s[i][0]);\\n\\t\\tcrss.push_back(s[i][1]);\\n\\t}\\n\\treturn segment_arrangement(s, crss);\\n}\\n\\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\\n//\\tint n = p.size(), m = c.size();\\n//\\tGraph g(n);\\n//\\tREP(i, m) {\\n//\\t\\tvector<pair<ld, int>> vec;\\n//\\t\\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\\n//\\t\\t\\tvec.emplace_back(arg(c[i].p - p[j]), j);\\n//\\t\\tsort(ALL(vec));\\n//\\t\\tREP(j, vec.size() - 1) {\\n//\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n//\\t\\t\\tld angle = vec[j + 1].first - vec[j].first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t\\tif (vec.size() >= 2) {\\n//\\t\\t\\tint from = vec.back().second, to = vec.front().first;\\n//\\t\\t\\tld angle = vec.front().first - vec.back().first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t}\\n//\\treturn g;\\n//}\\n\\n\\n\\nconst ld G= 9.8;\\n\\nstruct box {\\n\\tvector<ld>xs;\\n\\tvector<ld>ys;\\n};\\n\\n\\nint N, V, X, Y;\\nbool check(const ld theta, const box& b) {\\n\\n\\tconst ld vx = V*cos(theta);\\n\\tconst ld vy = V*sin(theta);\\n\\n\\tld y_max = -1e18;\\n\\tld y_min = 1e18;\\n\\n\\t//?????????????¢????\\n\\t{\\n\\t\\tconst ld toptime = vy / G;\\n\\t\\tconst ld top_x = toptime*vx;\\n\\t\\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\\n\\t\\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\\n\\t\\t\\ty_max = max(y_max, top_y);\\n\\t\\t}\\n\\t}\\n\\t//???????????????????¢????\\n\\t{\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tconst ld time = b.xs[x]/vx;\\n\\t\\t\\tconst ld ay = vy*time - time*time*G / 2;\\n\\t\\t\\ty_max = max(y_max, ay);\\n\\t\\t\\ty_min = min(y_min, ay);\\n\\t\\t}\\n\\t}\\n\\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\\n\\t\\t\\n\\t\\treturn true;\\n\\t}\\n\\telse {\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\\n\\tif (p.real() < eps)return;\\n\\tbool ok = true;\\n\\tld amin, amax;\\n\\n\\t//?????????????¨????\\n\\t{\\n\\t\\tconst ld tan = V*V / G / p.real();\\n\\t\\tconst ld theta = atan(tan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld max_y = vy*time - G*time*time / 2;\\n\\t\\tif (max_y < p.imag()) {\\n\\t\\t\\tok = false;\\n\\t\\t}\\n\\t\\tif (leftup) {\\n\\t\\t\\tamax = tan;\\n\\t\\t\\tamin = 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tamax = 1e18;\\n\\t\\t\\tamin = tan;\\n\\t\\t}\\n\\t}\\n\\tif (ok) {\\n\\t\\tint rep = 1000;\\n\\t\\twhile (rep--) {\\n\\t\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\t\\tconst ld theta = atan(amidtan);\\n\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\tconst ld time = p.real() / vx;\\n\\t\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\t\\tif (ay > p.imag()) {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\tconst ld theta = atan(amidtan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\ttans.push_back(amin);\\n\\t}\\n}\\n\\nint main() { cin >> N >> V >> X >> Y;\\n\\tvector<box>bs;\\n\\tvector<ld>tans;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint L, B, R, T; cin >> L >> B >> R >> T;\\n\\n\\t\\tR = min(R, X);\\n\\t\\tbox b;\\n\\t\\tb.xs.push_back(L);\\n\\t\\tb.xs.push_back(R);\\n\\t\\tb.ys.push_back(B);\\n\\t\\tb.ys.push_back(T);\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tfor (int y = 0; y < 2; ++y) {\\n\\t\\t\\t\\tPoint p(b.xs[x], b.ys[y]);\\n\\t\\t\\t\\tgettan(tans, p, (x + y) % 2);\\n\\t\\t\\t\\t//gettan(tans, p, (x + y+1) % 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (L >= X)continue;\\n\\t\\tbs.push_back(b);\\n\\t}\\n\\tconst ld down = Y;\\n\\tld up = 1e18;\\n\\tfor (int i = 0; i < bs.size(); ++i) {\\n\\t\\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\\n\\t\\t\\tif (bs[i].ys[0] > Y) {\\n\\n\\t\\t\\t\\tup = min(up, bs[i].ys[0]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\t{\\n\\t\\tPoint p(X,Y);\\n\\t\\tgettan(tans, p,true);\\n\\t}\\n\\t{\\n\\t\\tfor (int y = 1; y <= 300; ++y) {\\n\\t\\t\\tif (V*V / 2 >= y) {\\n\\t\\t\\t\\tld vy = sqrt(2 * y);\\n\\t\\t\\t\\tif (vy > V)break;\\n\\t\\t\\t\\tld vx = sqrt(V*V - vy*vy);\\n\\t\\t\\t\\tld tan = vy / vx;\\n\\t\\t\\t\\ttans.push_back(tan);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(tans.begin(), tans.end());\\n\\t{\\n\\t\\tvector<ld>ntans;\\n\\t\\tfor (int i = 0; i < tans.size(); ++i) {\\n\\t\\t\\tntans.push_back(tans[i]);\\n\\t\\t\\tif (i != tans.size() - 1) {\\n\\t\\t\\t\\tntans.push_back((tans[i] + tans[i + 1]) / 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ttans = ntans;\\n\\t}\\n\\tstring ans = \\\"No\\\";\\n\\tfor (auto t : tans) {\\n\\t\\tconst ld theta = atan(t);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = X / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\tif (down-eps <= ay&&ay <= up+eps) {\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tfor (int i = 0; i < bs.size(); ++i) {\\n\\t\\t\\t\\tauto b = bs[i];\\n\\n\\t\\t\\t\\tif (!check(theta, b)) {\\n\\t\\t\\t\\t\\tok = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (ok) {\\n\\n\\t\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\t\\t//cout << \\\"vx:\\\" << vx << \\\" vy:\\\" << vy << endl;\\n\\t\\t\\t\\tfor (int x = 0; x <=100; ++x) {\\n\\t\\t\\t\\t\\tconst ld t = x / vx;\\n\\t\\t\\t\\t\\t//cout << \\\"x:\\\" << x << endl;\\n\\t\\t\\t\\t\\t//cout << \\\"y:\\\" << vy*t - G*t*t / 2 << endl;\\n\\t\\t\\t\\t}\\t\\n\\t\\t\\t\\tans = \\\"Yes\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.8933,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2308_1777433\",\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;\\ntemplate<class T>\\nusing Table = vector<vector<T>>;\\nconst ld eps=1e-9;\\n\\n//// < \\\"D:\\\\D_Download\\\\Visual Studio 2015\\\\Projects\\\\programing_contest_c++\\\\Debug\\\\a.txt\\\"\\n\\n\\n/* ??????????????¬ */\\n\\n#include <complex>\\n\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define ALL(x) (x).begin(),(x).end()\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// ????????\\\\???\\nPoint input_point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// ????????????????????????\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// ??????\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// ??????\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// ??´????????????\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// ????????????\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// CCW\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\\n\\treturn 0; // a,c,b???????????´???????????¶\\n}\\n\\n\\n/* ???????????? */\\n\\n// ??´?????¨??´??????????????????\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// ??´?????¨?????????????????????\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// ????????¨?????????????????????\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// ????????´????????????\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// ?????????????????????\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// ??????????¶?\\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// ????????¨???????????????\\n//???????????£????????¨???????????¨assert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//??????isis_ss?????????\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// ??´?????¨???????????¢\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n// ??´?????¨??´???????????¢\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// ??´?????¨??????????????¢\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// ????????¨???????????¢\\nld dist_sp(const Line& s, const 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\\n// ????????¨??????????????¢\\nld dist_ss(const Line& s, const 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\\n\\n//??´?????¨??´?????????????????????????????????\\nLine bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:??????\\n//c:????????§??????\\n//???????????´?????????????????¢?????????????±??????????\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* ??? */\\n\\n// ?????¨????????????\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n//???????????????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n//???lc??????rc??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint circle_in_circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// ?????¨??´????????????\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// ?????¨??????????????¢\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), ALL(nret));\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//??????????????????????????¢???\\nld two_circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* ????§???¢ */\\n\\ntypedef vector<Point> Polygon;\\n\\n// ??¢???\\nld area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n// ????§???¢????????¢??????\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// ??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//??????????????????2?????????\\nenum { OUT, ON, IN };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// ??????\\n// ???????????????????????¨????????????????????§??¨???\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n// ????????????\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon Q;\\n\\tPolygon R;\\n\\tREP(i, n) {\\n\\t\\tPoint A = ps[i], B = ps[(i + 1) % n];\\n\\t\\tLine m = Line(A, B);\\n\\t\\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tQ.push_back(is_ll(l, m));\\n\\t\\t\\tR.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ Q,R };\\n\\treturn polys;\\n}\\n\\n\\n/* ??¢??¬??????????????? */\\nvoid add_point(vector<Point> &ps, const Point p) {\\n\\tfor (Point q : ps) if (abs(q - p) < eps) return;\\n\\tps.push_back(p);\\n}\\n\\ntypedef int Weight;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tEdge(int src, int dst, Weight weight) :\\n\\t\\tsrc(src), dst(dst), weight(weight) { }\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\\n\\tg[from].push_back(Edge{ from, to, weight });\\n}\\n\\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\\n\\tint n = p.size(), m = s.size();\\n\\tGraph g(n);\\n\\tREP(i, m) {\\n\\t\\tvector<pair<ld, int>> vec;\\n\\t\\tREP(j, n) if (isis_sp(s[i], p[j]))\\n\\t\\t\\tvec.emplace_back(abs(s[i].a - p[j]), j);\\n\\t\\tsort(ALL(vec));\\n\\t\\tREP(j, vec.size() - 1) {\\n\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\\n\\t\\t}\\n\\t}\\n\\treturn g;\\n}\\nGraph sennbunn_arrangement(const vector<Line>&s) {\\n\\tvector<Point>crss;\\n\\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\\n\\t\\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\\n\\t\\t\\tif (isis_ss(s[i], s[j])) {\\n\\t\\t\\t\\tcrss.push_back(is_ll(s[i], s[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\\n\\t\\tcrss.push_back(s[i][0]);\\n\\t\\tcrss.push_back(s[i][1]);\\n\\t}\\n\\treturn segment_arrangement(s, crss);\\n}\\n\\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\\n//\\tint n = p.size(), m = c.size();\\n//\\tGraph g(n);\\n//\\tREP(i, m) {\\n//\\t\\tvector<pair<ld, int>> vec;\\n//\\t\\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\\n//\\t\\t\\tvec.emplace_back(arg(c[i].p - p[j]), j);\\n//\\t\\tsort(ALL(vec));\\n//\\t\\tREP(j, vec.size() - 1) {\\n//\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n//\\t\\t\\tld angle = vec[j + 1].first - vec[j].first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t\\tif (vec.size() >= 2) {\\n//\\t\\t\\tint from = vec.back().second, to = vec.front().first;\\n//\\t\\t\\tld angle = vec.front().first - vec.back().first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t}\\n//\\treturn g;\\n//}\\n\\n\\n\\nconst ld G= 9.8;\\n\\nstruct box {\\n\\tvector<ld>xs;\\n\\tvector<ld>ys;\\n};\\n\\n\\nint N, V, X, Y;\\nbool check(const ld theta, const box& b) {\\n\\n\\tconst ld vx = V*cos(theta);\\n\\tconst ld vy = V*sin(theta);\\n\\n\\tld y_max = -1e18;\\n\\tld y_min = 1e18;\\n\\n\\t//?????????????¢????\\n\\t{\\n\\t\\tconst ld toptime = vy / G;\\n\\t\\tconst ld top_x = toptime*vx;\\n\\t\\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\\n\\t\\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\\n\\t\\t\\ty_max = max(y_max, top_y);\\n\\t\\t}\\n\\t}\\n\\t//???????????????????¢????\\n\\t{\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tconst ld time = b.xs[x]/vx;\\n\\t\\t\\tconst ld ay = vy*time - time*time*G / 2;\\n\\t\\t\\ty_max = max(y_max, ay);\\n\\t\\t\\ty_min = min(y_min, ay);\\n\\t\\t}\\n\\t}\\n\\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\\n\\t\\t\\n\\t\\treturn true;\\n\\t}\\n\\telse {\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\\n\\tif (p.real() < eps)return;\\n\\tbool ok = true;\\n\\tld amin, amax;\\n\\n\\t//?????????????¨????\\n\\t{\\n\\t\\tconst ld tan = V*V / G / p.real();\\n\\t\\tconst ld theta = atan(tan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld max_y = vy*time - G*time*time / 2;\\n\\t\\tif (max_y < p.imag()) {\\n\\t\\t\\tok = false;\\n\\t\\t}\\n\\t\\tif (leftup) {\\n\\t\\t\\tamax = tan;\\n\\t\\t\\tamin = 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tamax = 1e18;\\n\\t\\t\\tamin = tan;\\n\\t\\t}\\n\\t}\\n\\tif (ok) {\\n\\t\\tint rep = 1000;\\n\\t\\twhile (rep--) {\\n\\t\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\t\\tconst ld theta = atan(amidtan);\\n\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\tconst ld time = p.real() / vx;\\n\\t\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\t\\tif (ay > p.imag()) {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\tconst ld theta = atan(amidtan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\ttans.push_back(amin);\\n\\t}\\n}\\n\\nint main() { cin >> N >> V >> X >> Y;\\n\\tvector<box>bs;\\n\\tvector<ld>tans;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint L, B, R, T; cin >> L >> B >> R >> T;\\n\\n\\t\\tR = min(R, X);\\n\\t\\tbox b;\\n\\t\\tb.xs.push_back(L);\\n\\t\\tb.xs.push_back(R);\\n\\t\\tb.ys.push_back(B);\\n\\t\\tb.ys.push_back(T);\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tfor (int y = 0; y < 2; ++y) {\\n\\t\\t\\t\\tPoint p(b.xs[x], b.ys[y]);\\n\\t\\t\\t\\tgettan(tans, p, (x + y) % 2);\\n\\t\\t\\t\\t//gettan(tans, p, (x + y+1) % 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//if (L >= X)continue;\\n\\t\\tbs.push_back(b);\\n\\t}\\n\\tconst ld down = Y;\\n\\tld up = 1e18;\\n\\tfor (int i = 0; i < bs.size(); ++i) {\\n\\t\\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\\n\\t\\t\\tif (bs[i].ys[0] > Y) {\\n\\n\\t\\t\\t\\tup = min(up, bs[i].ys[0]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\t{\\n\\t\\tPoint p(X,Y);\\n\\t\\tgettan(tans, p,true);\\n\\t}\\n\\t{\\n\\t\\tfor (int y = 1; y <= 300; ++y) {\\n\\t\\t\\tif (V*V / 2 >= y) {\\n\\t\\t\\t\\tld vy = sqrt(2 * y);\\n\\t\\t\\t\\tif (vy > V)break;\\n\\t\\t\\t\\tld vx = sqrt(V*V - vy*vy);\\n\\t\\t\\t\\tld tan = vy / vx;\\n\\t\\t\\t\\ttans.push_back(tan);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(tans.begin(), tans.end());\\n\\t{\\n\\t\\tvector<ld>ntans;\\n\\t\\tfor (int i = 0; i < tans.size(); ++i) {\\n\\t\\t\\tntans.push_back(tans[i]);\\n\\t\\t\\tif (i != tans.size() - 1) {\\n\\t\\t\\t\\tntans.push_back((tans[i] + tans[i + 1]) / 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ttans = ntans;\\n\\t}\\n\\tstring ans = \\\"No\\\";\\n\\tfor (auto t : tans) {\\n\\t\\tconst ld theta = atan(t);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = X / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\tif (down-eps <= ay&&ay <= up+eps) {\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tfor (int i = 0; i < bs.size(); ++i) {\\n\\t\\t\\t\\tauto b = bs[i];\\n\\n\\t\\t\\t\\tif (!check(theta, b)) {\\n\\t\\t\\t\\t\\tok = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif (ok) {\\n\\n\\t\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\t\\t//cout << \\\"vx:\\\" << vx << \\\" vy:\\\" << vy << endl;\\n\\t\\t\\t\\tfor (int x = 0; x <=100; ++x) {\\n\\t\\t\\t\\t\\tconst ld t = x / vx;\\n\\t\\t\\t\\t\\t//cout << \\\"x:\\\" << x << endl;\\n\\t\\t\\t\\t\\t//cout << \\\"y:\\\" << vy*t - G*t*t / 2 << endl;\\n\\t\\t\\t\\t}\\t\\n\\t\\t\\t\\tans = \\\"Yes\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.2,\n \"time_ms\": 30,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.8979,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2308_1777230\",\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;\\ntemplate<class T>\\nusing Table = vector<vector<T>>;\\nconst ld eps=1e-9;\\n\\n//// < \\\"D:\\\\D_Download\\\\Visual Studio 2015\\\\Projects\\\\programing_contest_c++\\\\Debug\\\\a.txt\\\"\\n\\n\\n/* ??????????????¬ */\\n\\n#include <complex>\\n\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define ALL(x) (x).begin(),(x).end()\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// ????????\\\\???\\nPoint input_point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// ????????????????????????\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// ??????\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// ??????\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// ??´????????????\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// ????????????\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// CCW\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\\n\\treturn 0; // a,c,b???????????´???????????¶\\n}\\n\\n\\n/* ???????????? */\\n\\n// ??´?????¨??´??????????????????\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// ??´?????¨?????????????????????\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// ????????¨?????????????????????\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// ????????´????????????\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// ?????????????????????\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// ??????????¶?\\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// ????????¨???????????????\\n//???????????£????????¨???????????¨assert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//??????isis_ss?????????\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// ??´?????¨???????????¢\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n// ??´?????¨??´???????????¢\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// ??´?????¨??????????????¢\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// ????????¨???????????¢\\nld dist_sp(const Line& s, const 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\\n// ????????¨??????????????¢\\nld dist_ss(const Line& s, const 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\\n\\n//??´?????¨??´?????????????????????????????????\\nLine bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:??????\\n//c:????????§??????\\n//???????????´?????????????????¢?????????????±??????????\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* ??? */\\n\\n// ?????¨????????????\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n//???????????????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n//???lc??????rc??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint circle_in_circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// ?????¨??´????????????\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// ?????¨??????????????¢\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), ALL(nret));\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//??????????????????????????¢???\\nld two_circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* ????§???¢ */\\n\\ntypedef vector<Point> Polygon;\\n\\n// ??¢???\\nld area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n// ????§???¢????????¢??????\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// ??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//??????????????????2?????????\\nenum { OUT, ON, IN };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// ??????\\n// ???????????????????????¨????????????????????§??¨???\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n// ????????????\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon Q;\\n\\tPolygon R;\\n\\tREP(i, n) {\\n\\t\\tPoint A = ps[i], B = ps[(i + 1) % n];\\n\\t\\tLine m = Line(A, B);\\n\\t\\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tQ.push_back(is_ll(l, m));\\n\\t\\t\\tR.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ Q,R };\\n\\treturn polys;\\n}\\n\\n\\n/* ??¢??¬??????????????? */\\nvoid add_point(vector<Point> &ps, const Point p) {\\n\\tfor (Point q : ps) if (abs(q - p) < eps) return;\\n\\tps.push_back(p);\\n}\\n\\ntypedef int Weight;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tEdge(int src, int dst, Weight weight) :\\n\\t\\tsrc(src), dst(dst), weight(weight) { }\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\\n\\tg[from].push_back(Edge{ from, to, weight });\\n}\\n\\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\\n\\tint n = p.size(), m = s.size();\\n\\tGraph g(n);\\n\\tREP(i, m) {\\n\\t\\tvector<pair<ld, int>> vec;\\n\\t\\tREP(j, n) if (isis_sp(s[i], p[j]))\\n\\t\\t\\tvec.emplace_back(abs(s[i].a - p[j]), j);\\n\\t\\tsort(ALL(vec));\\n\\t\\tREP(j, vec.size() - 1) {\\n\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\\n\\t\\t}\\n\\t}\\n\\treturn g;\\n}\\nGraph sennbunn_arrangement(const vector<Line>&s) {\\n\\tvector<Point>crss;\\n\\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\\n\\t\\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\\n\\t\\t\\tif (isis_ss(s[i], s[j])) {\\n\\t\\t\\t\\tcrss.push_back(is_ll(s[i], s[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\\n\\t\\tcrss.push_back(s[i][0]);\\n\\t\\tcrss.push_back(s[i][1]);\\n\\t}\\n\\treturn segment_arrangement(s, crss);\\n}\\n\\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\\n//\\tint n = p.size(), m = c.size();\\n//\\tGraph g(n);\\n//\\tREP(i, m) {\\n//\\t\\tvector<pair<ld, int>> vec;\\n//\\t\\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\\n//\\t\\t\\tvec.emplace_back(arg(c[i].p - p[j]), j);\\n//\\t\\tsort(ALL(vec));\\n//\\t\\tREP(j, vec.size() - 1) {\\n//\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n//\\t\\t\\tld angle = vec[j + 1].first - vec[j].first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t\\tif (vec.size() >= 2) {\\n//\\t\\t\\tint from = vec.back().second, to = vec.front().first;\\n//\\t\\t\\tld angle = vec.front().first - vec.back().first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t}\\n//\\treturn g;\\n//}\\n\\n\\n\\nconst ld G= 9.8;\\n\\nstruct box {\\n\\tvector<ld>xs;\\n\\tvector<ld>ys;\\n};\\n\\n\\nint N, V, X, Y;\\nbool check(const ld theta, const box& b) {\\n\\n\\tconst ld vx = V*cos(theta);\\n\\tconst ld vy = V*sin(theta);\\n\\n\\tld y_max = -1e18;\\n\\tld y_min = 1e18;\\n\\n\\t//?????????????¢????\\n\\t{\\n\\t\\tconst ld toptime = vy / G;\\n\\t\\tconst ld top_x = toptime*vx;\\n\\t\\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\\n\\t\\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\\n\\t\\t\\ty_max = max(y_max, top_y);\\n\\t\\t}\\n\\t}\\n\\t//???????????????????¢????\\n\\t{\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tconst ld time = b.xs[x]/vx;\\n\\t\\t\\tconst ld ay = vy*time - time*time*G / 2;\\n\\t\\t\\ty_max = max(y_max, ay);\\n\\t\\t\\ty_min = min(y_min, ay);\\n\\t\\t}\\n\\t}\\n\\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\\n\\t\\t\\n\\t\\treturn true;\\n\\t}\\n\\telse {\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\\n\\tif (p.real() < eps)return;\\n\\tbool ok = true;\\n\\tld amin, amax;\\n\\n\\t//?????????????¨????\\n\\t{\\n\\t\\tconst ld tan = V*V / G / p.real();\\n\\t\\tconst ld theta = atan(tan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld max_y = vy*time - G*time*time / 2;\\n\\t\\tif (max_y < p.imag()) {\\n\\t\\t\\tok = false;\\n\\t\\t}\\n\\t\\tif (leftup) {\\n\\t\\t\\tamax = tan;\\n\\t\\t\\tamin = 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tamax = 1e18;\\n\\t\\t\\tamin = tan;\\n\\t\\t}\\n\\t}\\n\\tif (ok) {\\n\\t\\tint rep = 1000;\\n\\t\\twhile (rep--) {\\n\\t\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\t\\tconst ld theta = atan(amidtan);\\n\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\tconst ld time = p.real() / vx;\\n\\t\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\t\\tif (ay > p.imag()) {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\tconst ld theta = atan(amidtan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\ttans.push_back(amin);\\n\\t}\\n}\\n\\nint main() { cin >> N >> V >> X >> Y;\\n\\tvector<box>bs;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint L, B, R, T; cin >> L >> B >> R >> T;\\n\\t\\tbox b;\\n\\t\\tb.xs.push_back(L);\\n\\t\\tb.xs.push_back(R);\\n\\t\\tb.ys.push_back(B);\\n\\t\\tb.ys.push_back(T);\\n\\t\\tbs.push_back(b);\\n\\t}\\n\\tconst ld down = Y;\\n\\tld up = 1e18;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\\n\\t\\t\\tif (bs[i].ys[0] > Y) {\\n\\n\\t\\t\\t\\tup = min(up, bs[i].ys[0]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<ld>tans;\\n\\tfor (auto b : bs) {\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tfor (int y = 0; y < 2; ++y) {\\n\\t\\t\\t\\tPoint p(b.xs[x], b.ys[y]);\\n\\t\\t\\t\\tgettan(tans, p,(x+y)%2);\\n\\t\\t\\t\\t//gettan(tans, p, (x + y+1) % 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tPoint p(X,Y);\\n\\t\\tgettan(tans, p,true);\\n\\t}\\n\\t{\\n\\t\\tfor (int y = 1; y <= 300; ++y) {\\n\\t\\t\\tif (V*V / 2 >= y) {\\n\\t\\t\\t\\tld vy = sqrt(2 * y);\\n\\t\\t\\t\\tif (vy > V)break;\\n\\t\\t\\t\\tld vx = sqrt(V*V - vy*vy);\\n\\t\\t\\t\\tld tan = vy / vx;\\n\\t\\t\\t\\ttans.push_back(tan);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tsort(tans.begin(), tans.end());\\n\\t{\\n\\t\\tvector<ld>ntans;\\n\\t\\tfor (int i = 0; i < tans.size(); ++i) {\\n\\t\\t\\tntans.push_back(tans[i]);\\n\\t\\t\\tif (i != tans.size() - 1) {\\n\\t\\t\\t\\tntans.push_back((tans[i] + tans[i + 1]) / 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ttans = ntans;\\n\\t}\\n\\n\\tstring ans = \\\"No\\\";\\n\\tfor (auto t : tans) {\\n\\t\\tconst ld theta = atan(t);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = X / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\tif (down-eps <= ay&&ay <= up+eps) {\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tfor (auto b : bs) {\\n\\t\\t\\t\\tif (!check(theta, b)) {\\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\\tif (ok) {\\n\\n\\t\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\t\\t//cout << \\\"vx:\\\" << vx << \\\" vy:\\\" << vy << endl;\\n\\t\\t\\t\\tfor (int x = 0; x <=100; ++x) {\\n\\t\\t\\t\\t\\tconst ld t = x / vx;\\n\\t\\t\\t\\t\\t//cout << \\\"x:\\\" << x << endl;\\n\\t\\t\\t\\t\\t//cout << \\\"y:\\\" << vy*t - G*t*t / 2 << endl;\\n\\t\\t\\t\\t}\\t\\t\\t\\t\\tans = \\\"Yes\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.2,\n \"time_ms\": 30,\n \"memory_kb\": 3520,\n \"score_of_the_acc\": -0.8749,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2308_1777183\",\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;\\ntemplate<class T>\\nusing Table = vector<vector<T>>;\\nconst ld eps=1e-9;\\n\\n//// < \\\"D:\\\\D_Download\\\\Visual Studio 2015\\\\Projects\\\\programing_contest_c++\\\\Debug\\\\a.txt\\\"\\n\\n\\n/* ??????????????¬ */\\n\\n#include <complex>\\n\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define ALL(x) (x).begin(),(x).end()\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// ????????\\\\???\\nPoint input_point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// ????????????????????????\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// ??????\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// ??????\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// ??´????????????\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// ????????????\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// CCW\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\\n\\treturn 0; // a,c,b???????????´???????????¶\\n}\\n\\n\\n/* ???????????? */\\n\\n// ??´?????¨??´??????????????????\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// ??´?????¨?????????????????????\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// ????????¨?????????????????????\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// ????????´????????????\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// ?????????????????????\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// ??????????¶?\\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// ????????¨???????????????\\n//???????????£????????¨???????????¨assert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//??????isis_ss?????????\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// ??´?????¨???????????¢\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n// ??´?????¨??´???????????¢\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// ??´?????¨??????????????¢\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// ????????¨???????????¢\\nld dist_sp(const Line& s, const 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\\n// ????????¨??????????????¢\\nld dist_ss(const Line& s, const 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\\n\\n//??´?????¨??´?????????????????????????????????\\nLine bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:??????\\n//c:????????§??????\\n//???????????´?????????????????¢?????????????±??????????\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* ??? */\\n\\n// ?????¨????????????\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n//???????????????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n//???lc??????rc??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint circle_in_circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// ?????¨??´????????????\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// ?????¨??????????????¢\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), ALL(nret));\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//??????????????????????????¢???\\nld two_circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* ????§???¢ */\\n\\ntypedef vector<Point> Polygon;\\n\\n// ??¢???\\nld area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n// ????§???¢????????¢??????\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// ??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//??????????????????2?????????\\nenum { OUT, ON, IN };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// ??????\\n// ???????????????????????¨????????????????????§??¨???\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n// ????????????\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon Q;\\n\\tPolygon R;\\n\\tREP(i, n) {\\n\\t\\tPoint A = ps[i], B = ps[(i + 1) % n];\\n\\t\\tLine m = Line(A, B);\\n\\t\\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tQ.push_back(is_ll(l, m));\\n\\t\\t\\tR.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ Q,R };\\n\\treturn polys;\\n}\\n\\n\\n/* ??¢??¬??????????????? */\\nvoid add_point(vector<Point> &ps, const Point p) {\\n\\tfor (Point q : ps) if (abs(q - p) < eps) return;\\n\\tps.push_back(p);\\n}\\n\\ntypedef int Weight;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tEdge(int src, int dst, Weight weight) :\\n\\t\\tsrc(src), dst(dst), weight(weight) { }\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\\n\\tg[from].push_back(Edge{ from, to, weight });\\n}\\n\\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\\n\\tint n = p.size(), m = s.size();\\n\\tGraph g(n);\\n\\tREP(i, m) {\\n\\t\\tvector<pair<ld, int>> vec;\\n\\t\\tREP(j, n) if (isis_sp(s[i], p[j]))\\n\\t\\t\\tvec.emplace_back(abs(s[i].a - p[j]), j);\\n\\t\\tsort(ALL(vec));\\n\\t\\tREP(j, vec.size() - 1) {\\n\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\\n\\t\\t}\\n\\t}\\n\\treturn g;\\n}\\nGraph sennbunn_arrangement(const vector<Line>&s) {\\n\\tvector<Point>crss;\\n\\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\\n\\t\\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\\n\\t\\t\\tif (isis_ss(s[i], s[j])) {\\n\\t\\t\\t\\tcrss.push_back(is_ll(s[i], s[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\\n\\t\\tcrss.push_back(s[i][0]);\\n\\t\\tcrss.push_back(s[i][1]);\\n\\t}\\n\\treturn segment_arrangement(s, crss);\\n}\\n\\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\\n//\\tint n = p.size(), m = c.size();\\n//\\tGraph g(n);\\n//\\tREP(i, m) {\\n//\\t\\tvector<pair<ld, int>> vec;\\n//\\t\\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\\n//\\t\\t\\tvec.emplace_back(arg(c[i].p - p[j]), j);\\n//\\t\\tsort(ALL(vec));\\n//\\t\\tREP(j, vec.size() - 1) {\\n//\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n//\\t\\t\\tld angle = vec[j + 1].first - vec[j].first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t\\tif (vec.size() >= 2) {\\n//\\t\\t\\tint from = vec.back().second, to = vec.front().first;\\n//\\t\\t\\tld angle = vec.front().first - vec.back().first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t}\\n//\\treturn g;\\n//}\\n\\n\\n\\nconst ld G= 9.8;\\n\\nstruct box {\\n\\tvector<ld>xs;\\n\\tvector<ld>ys;\\n};\\n\\n\\nint N, V, X, Y;\\nbool check(const ld theta, const box& b) {\\n\\n\\tconst ld vx = V*cos(theta);\\n\\tconst ld vy = V*sin(theta);\\n\\n\\tld y_max = -1e18;\\n\\tld y_min = 1e18;\\n\\n\\t//?????????????¢????\\n\\t{\\n\\t\\tconst ld toptime = vy / G;\\n\\t\\tconst ld top_x = toptime*vx;\\n\\t\\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\\n\\t\\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\\n\\t\\t\\ty_max = max(y_max, top_y);\\n\\t\\t}\\n\\t}\\n\\t//???????????????????¢????\\n\\t{\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tconst ld time = b.xs[x]/vx;\\n\\t\\t\\tconst ld ay = vy*time - time*time*G / 2;\\n\\t\\t\\ty_max = max(y_max, ay);\\n\\t\\t\\ty_min = min(y_min, ay);\\n\\t\\t}\\n\\t}\\n\\tif (y_max- 1e-7 < b.ys[0] || b.ys[1] < y_min + 1e-7) {\\n\\t\\treturn true;\\n\\t}\\n\\telse {\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\\n\\tif (p.real() < eps)return;\\n\\tbool ok = true;\\n\\tld amin, amax;\\n\\n\\t//?????????????¨????\\n\\t{\\n\\t\\tconst ld tan = V*V / G / p.real();\\n\\t\\tconst ld theta = atan(tan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld max_y = vy*time - G*time*time / 2;\\n\\t\\tif (max_y < p.imag()) {\\n\\t\\t\\tok = false;\\n\\t\\t}\\n\\t\\tif (leftup) {\\n\\t\\t\\tamax = tan;\\n\\t\\t\\tamin = 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tamax = 1e18;\\n\\t\\t\\tamin = tan;\\n\\t\\t}\\n\\t}\\n\\tif (ok) {\\n\\t\\tint rep = 1000;\\n\\t\\twhile (rep--) {\\n\\t\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\t\\tconst ld theta = atan(amidtan);\\n\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\tconst ld time = p.real() / vx;\\n\\t\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\t\\tif (ay > p.imag()) {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\tconst ld theta = atan(amidtan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\ttans.push_back(amin);\\n\\t}\\n}\\n\\nint main() { cin >> N >> V >> X >> Y;\\n\\tvector<box>bs;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint L, B, R, T; cin >> L >> B >> R >> T;\\n\\t\\tbox b;\\n\\t\\tb.xs.push_back(L);\\n\\t\\tb.xs.push_back(R);\\n\\t\\tb.ys.push_back(B);\\n\\t\\tb.ys.push_back(T);\\n\\t\\tbs.push_back(b);\\n\\t}\\n\\tconst ld down = Y;\\n\\tld up = 1e18;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\\n\\t\\t\\tif (bs[i].ys[0] > Y) {\\n\\n\\t\\t\\t\\tup = min(up, bs[i].ys[0]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<ld>tans;\\n\\tfor (auto b : bs) {\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tfor (int y = 0; y < 2; ++y) {\\n\\t\\t\\t\\tPoint p(b.xs[x], b.ys[y]);\\n\\t\\t\\t\\tgettan(tans, p,(x+y)%2);\\n\\t\\t\\t\\t//gettan(tans, p, (x + y+1) % 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tPoint p(X,Y);\\n\\t\\tgettan(tans, p,true);\\n\\t}\\n\\tsort(tans.begin(), tans.end());\\n\\t{\\n\\t\\tvector<ld>ntans;\\n\\t\\tfor (int i = 0; i < tans.size(); ++i) {\\n\\t\\t\\tntans.push_back(tans[i]);\\n\\t\\t\\tif (i != tans.size() - 1) {\\n\\t\\t\\t\\tntans.push_back((tans[i] + tans[i + 1]) / 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//tans = ntans;\\n\\t}\\n\\n\\tstring ans = \\\"No\\\";\\n\\tfor (auto t : tans) {\\n\\t\\tconst ld theta = atan(t);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = X / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\tif (down-eps <= ay&&ay <= up+eps) {\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tfor (auto b : bs) {\\n\\t\\t\\t\\tif (!check(theta, b))ok = false;\\n\\t\\t\\t}\\n\\t\\t\\tif (ok) {\\n\\t\\t\\t\\tans = \\\"Yes\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.2,\n \"time_ms\": 40,\n \"memory_kb\": 3472,\n \"score_of_the_acc\": -0.8777,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2308_1777179\",\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;\\ntemplate<class T>\\nusing Table = vector<vector<T>>;\\nconst ld eps=1e-9;\\n\\n//// < \\\"D:\\\\D_Download\\\\Visual Studio 2015\\\\Projects\\\\programing_contest_c++\\\\Debug\\\\a.txt\\\"\\n\\n\\n/* ??????????????¬ */\\n\\n#include <complex>\\n\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define ALL(x) (x).begin(),(x).end()\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// ????????\\\\???\\nPoint input_point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// ????????????????????????\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// ??????\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// ??????\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// ??´????????????\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// ????????????\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// CCW\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\\n\\treturn 0; // a,c,b???????????´???????????¶\\n}\\n\\n\\n/* ???????????? */\\n\\n// ??´?????¨??´??????????????????\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// ??´?????¨?????????????????????\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// ????????¨?????????????????????\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// ????????´????????????\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// ?????????????????????\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// ??????????¶?\\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// ????????¨???????????????\\n//???????????£????????¨???????????¨assert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//??????isis_ss?????????\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// ??´?????¨???????????¢\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n// ??´?????¨??´???????????¢\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// ??´?????¨??????????????¢\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// ????????¨???????????¢\\nld dist_sp(const Line& s, const 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\\n// ????????¨??????????????¢\\nld dist_ss(const Line& s, const 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\\n\\n//??´?????¨??´?????????????????????????????????\\nLine bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:??????\\n//c:????????§??????\\n//???????????´?????????????????¢?????????????±??????????\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* ??? */\\n\\n// ?????¨????????????\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n//???????????????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n//???lc??????rc??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint circle_in_circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// ?????¨??´????????????\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// ?????¨??????????????¢\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), ALL(nret));\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//??????????????????????????¢???\\nld two_circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* ????§???¢ */\\n\\ntypedef vector<Point> Polygon;\\n\\n// ??¢???\\nld area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n// ????§???¢????????¢??????\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// ??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//??????????????????2?????????\\nenum { OUT, ON, IN };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// ??????\\n// ???????????????????????¨????????????????????§??¨???\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n// ????????????\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon Q;\\n\\tPolygon R;\\n\\tREP(i, n) {\\n\\t\\tPoint A = ps[i], B = ps[(i + 1) % n];\\n\\t\\tLine m = Line(A, B);\\n\\t\\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tQ.push_back(is_ll(l, m));\\n\\t\\t\\tR.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ Q,R };\\n\\treturn polys;\\n}\\n\\n\\n/* ??¢??¬??????????????? */\\nvoid add_point(vector<Point> &ps, const Point p) {\\n\\tfor (Point q : ps) if (abs(q - p) < eps) return;\\n\\tps.push_back(p);\\n}\\n\\ntypedef int Weight;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tEdge(int src, int dst, Weight weight) :\\n\\t\\tsrc(src), dst(dst), weight(weight) { }\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\\n\\tg[from].push_back(Edge{ from, to, weight });\\n}\\n\\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\\n\\tint n = p.size(), m = s.size();\\n\\tGraph g(n);\\n\\tREP(i, m) {\\n\\t\\tvector<pair<ld, int>> vec;\\n\\t\\tREP(j, n) if (isis_sp(s[i], p[j]))\\n\\t\\t\\tvec.emplace_back(abs(s[i].a - p[j]), j);\\n\\t\\tsort(ALL(vec));\\n\\t\\tREP(j, vec.size() - 1) {\\n\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\\n\\t\\t}\\n\\t}\\n\\treturn g;\\n}\\nGraph sennbunn_arrangement(const vector<Line>&s) {\\n\\tvector<Point>crss;\\n\\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\\n\\t\\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\\n\\t\\t\\tif (isis_ss(s[i], s[j])) {\\n\\t\\t\\t\\tcrss.push_back(is_ll(s[i], s[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\\n\\t\\tcrss.push_back(s[i][0]);\\n\\t\\tcrss.push_back(s[i][1]);\\n\\t}\\n\\treturn segment_arrangement(s, crss);\\n}\\n\\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\\n//\\tint n = p.size(), m = c.size();\\n//\\tGraph g(n);\\n//\\tREP(i, m) {\\n//\\t\\tvector<pair<ld, int>> vec;\\n//\\t\\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\\n//\\t\\t\\tvec.emplace_back(arg(c[i].p - p[j]), j);\\n//\\t\\tsort(ALL(vec));\\n//\\t\\tREP(j, vec.size() - 1) {\\n//\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n//\\t\\t\\tld angle = vec[j + 1].first - vec[j].first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t\\tif (vec.size() >= 2) {\\n//\\t\\t\\tint from = vec.back().second, to = vec.front().first;\\n//\\t\\t\\tld angle = vec.front().first - vec.back().first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t}\\n//\\treturn g;\\n//}\\n\\n\\n\\nconst ld G= 9.8;\\n\\nstruct box {\\n\\tvector<ld>xs;\\n\\tvector<ld>ys;\\n};\\n\\n\\nint N, V, X, Y;\\nbool check(const ld theta, const box& b) {\\n\\n\\tconst ld vx = V*cos(theta);\\n\\tconst ld vy = V*sin(theta);\\n\\n\\tld y_max = -1e18;\\n\\tld y_min = 1e18;\\n\\n\\t//?????????????¢????\\n\\t{\\n\\t\\tconst ld toptime = vy / G;\\n\\t\\tconst ld top_x = toptime*vx;\\n\\t\\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\\n\\t\\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\\n\\t\\t\\ty_max = max(y_max, top_y);\\n\\t\\t}\\n\\t}\\n\\t//???????????????????¢????\\n\\t{\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tconst ld time = b.xs[x]/vx;\\n\\t\\t\\tconst ld ay = vy*time - time*time*G / 2;\\n\\t\\t\\ty_max = max(y_max, ay);\\n\\t\\t\\ty_min = min(y_min, ay);\\n\\t\\t}\\n\\t}\\n\\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\\n\\t\\treturn true;\\n\\t}\\n\\telse {\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\\n\\tif (p.real() < eps)return;\\n\\tbool ok = true;\\n\\tld amin, amax;\\n\\n\\t//?????????????¨????\\n\\t{\\n\\t\\tconst ld tan = V*V / G / p.real();\\n\\t\\tconst ld theta = atan(tan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld max_y = vy*time - G*time*time / 2;\\n\\t\\tif (max_y < p.imag()) {\\n\\t\\t\\tok = false;\\n\\t\\t}\\n\\t\\tif (leftup) {\\n\\t\\t\\tamax = tan;\\n\\t\\t\\tamin = 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tamax = 1e18;\\n\\t\\t\\tamin = tan;\\n\\t\\t}\\n\\t}\\n\\tif (ok) {\\n\\t\\tint rep = 1000;\\n\\t\\twhile (rep--) {\\n\\t\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\t\\tconst ld theta = atan(amidtan);\\n\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\tconst ld time = p.real() / vx;\\n\\t\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\t\\tif (ay > p.imag()) {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\tconst ld theta = atan(amidtan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\ttans.push_back(amin);\\n\\t}\\n}\\n\\nint main() { cin >> N >> V >> X >> Y;\\n\\tvector<box>bs;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint L, B, R, T; cin >> L >> B >> R >> T;\\n\\t\\tbox b;\\n\\t\\tb.xs.push_back(L);\\n\\t\\tb.xs.push_back(R);\\n\\t\\tb.ys.push_back(B);\\n\\t\\tb.ys.push_back(T);\\n\\t\\tbs.push_back(b);\\n\\t}\\n\\tconst ld down = Y;\\n\\tld up = 1e18;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\\n\\t\\t\\tif (bs[i].ys[0] > Y) {\\n\\n\\t\\t\\t\\tup = min(up, bs[i].ys[0]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<ld>tans;\\n\\tfor (auto b : bs) {\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tfor (int y = 0; y < 2; ++y) {\\n\\t\\t\\t\\tPoint p(b.xs[x], b.ys[y]);\\n\\t\\t\\t\\tgettan(tans, p,(x+y)%2);\\n\\t\\t\\t\\tgettan(tans, p, (x + y+1) % 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tPoint p(X,Y);\\n\\t\\tgettan(tans, p,true);\\n\\t}\\n\\tsort(tans.begin(), tans.end());\\n\\t{\\n\\t\\tvector<ld>ntans;\\n\\t\\tfor (int i = 0; i < tans.size(); ++i) {\\n\\t\\t\\tntans.push_back(tans[i]);\\n\\t\\t\\tif (i != tans.size() - 1) {\\n\\t\\t\\t\\tntans.push_back((tans[i] + tans[i + 1]) / 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ttans = ntans;\\n\\t}\\n\\n\\tstring ans = \\\"No\\\";\\n\\tfor (auto t : tans) {\\n\\t\\tconst ld theta = atan(t);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = X / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\tif (down-eps <= ay&&ay <= up+eps) {\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tfor (auto b : bs) {\\n\\t\\t\\t\\tif (!check(theta, b))ok = false;\\n\\t\\t\\t}\\n\\t\\t\\tif (ok) {\\n\\t\\t\\t\\tans = \\\"Yes\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.2,\n \"time_ms\": 70,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.9461,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2308_1777166\",\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;\\ntemplate<class T>\\nusing Table = vector<vector<T>>;\\nconst ld eps=1e-9;\\n\\n//// < \\\"D:\\\\D_Download\\\\Visual Studio 2015\\\\Projects\\\\programing_contest_c++\\\\Debug\\\\a.txt\\\"\\n\\n\\n/* ??????????????¬ */\\n\\n#include <complex>\\n\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define ALL(x) (x).begin(),(x).end()\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// ????????\\\\???\\nPoint input_point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// ????????????????????????\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// ??????\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// ??????\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// ??´????????????\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// ????????????\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// CCW\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\\n\\treturn 0; // a,c,b???????????´???????????¶\\n}\\n\\n\\n/* ???????????? */\\n\\n// ??´?????¨??´??????????????????\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// ??´?????¨?????????????????????\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// ????????¨?????????????????????\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// ????????´????????????\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// ?????????????????????\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// ??????????¶?\\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// ????????¨???????????????\\n//???????????£????????¨???????????¨assert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//??????isis_ss?????????\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// ??´?????¨???????????¢\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n// ??´?????¨??´???????????¢\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// ??´?????¨??????????????¢\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// ????????¨???????????¢\\nld dist_sp(const Line& s, const 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\\n// ????????¨??????????????¢\\nld dist_ss(const Line& s, const 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\\n\\n//??´?????¨??´?????????????????????????????????\\nLine bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:??????\\n//c:????????§??????\\n//???????????´?????????????????¢?????????????±??????????\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* ??? */\\n\\n// ?????¨????????????\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n//???????????????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n//???lc??????rc??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint circle_in_circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// ?????¨??´????????????\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// ?????¨??????????????¢\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), ALL(nret));\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//??????????????????????????¢???\\nld two_circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* ????§???¢ */\\n\\ntypedef vector<Point> Polygon;\\n\\n// ??¢???\\nld area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n// ????§???¢????????¢??????\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// ??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//??????????????????2?????????\\nenum { OUT, ON, IN };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// ??????\\n// ???????????????????????¨????????????????????§??¨???\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n// ????????????\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon Q;\\n\\tPolygon R;\\n\\tREP(i, n) {\\n\\t\\tPoint A = ps[i], B = ps[(i + 1) % n];\\n\\t\\tLine m = Line(A, B);\\n\\t\\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tQ.push_back(is_ll(l, m));\\n\\t\\t\\tR.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ Q,R };\\n\\treturn polys;\\n}\\n\\n\\n/* ??¢??¬??????????????? */\\nvoid add_point(vector<Point> &ps, const Point p) {\\n\\tfor (Point q : ps) if (abs(q - p) < eps) return;\\n\\tps.push_back(p);\\n}\\n\\ntypedef int Weight;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tEdge(int src, int dst, Weight weight) :\\n\\t\\tsrc(src), dst(dst), weight(weight) { }\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\\n\\tg[from].push_back(Edge{ from, to, weight });\\n}\\n\\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\\n\\tint n = p.size(), m = s.size();\\n\\tGraph g(n);\\n\\tREP(i, m) {\\n\\t\\tvector<pair<ld, int>> vec;\\n\\t\\tREP(j, n) if (isis_sp(s[i], p[j]))\\n\\t\\t\\tvec.emplace_back(abs(s[i].a - p[j]), j);\\n\\t\\tsort(ALL(vec));\\n\\t\\tREP(j, vec.size() - 1) {\\n\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\\n\\t\\t}\\n\\t}\\n\\treturn g;\\n}\\nGraph sennbunn_arrangement(const vector<Line>&s) {\\n\\tvector<Point>crss;\\n\\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\\n\\t\\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\\n\\t\\t\\tif (isis_ss(s[i], s[j])) {\\n\\t\\t\\t\\tcrss.push_back(is_ll(s[i], s[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\\n\\t\\tcrss.push_back(s[i][0]);\\n\\t\\tcrss.push_back(s[i][1]);\\n\\t}\\n\\treturn segment_arrangement(s, crss);\\n}\\n\\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\\n//\\tint n = p.size(), m = c.size();\\n//\\tGraph g(n);\\n//\\tREP(i, m) {\\n//\\t\\tvector<pair<ld, int>> vec;\\n//\\t\\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\\n//\\t\\t\\tvec.emplace_back(arg(c[i].p - p[j]), j);\\n//\\t\\tsort(ALL(vec));\\n//\\t\\tREP(j, vec.size() - 1) {\\n//\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n//\\t\\t\\tld angle = vec[j + 1].first - vec[j].first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t\\tif (vec.size() >= 2) {\\n//\\t\\t\\tint from = vec.back().second, to = vec.front().first;\\n//\\t\\t\\tld angle = vec.front().first - vec.back().first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t}\\n//\\treturn g;\\n//}\\n\\n\\n\\nconst ld G= 9.8;\\n\\nstruct box {\\n\\tvector<ld>xs;\\n\\tvector<ld>ys;\\n};\\n\\n\\nint N, V, X, Y;\\nbool check(const ld theta, const box& b) {\\n\\n\\tconst ld vx = V*cos(theta);\\n\\tconst ld vy = V*sin(theta);\\n\\n\\tld y_max = -1e18;\\n\\tld y_min = 1e18;\\n\\n\\t//?????????????¢????\\n\\t{\\n\\t\\tconst ld toptime = vy / G;\\n\\t\\tconst ld top_x = toptime*vx;\\n\\t\\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\\n\\t\\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\\n\\t\\t\\ty_max = max(y_max, top_y);\\n\\t\\t}\\n\\t}\\n\\t//???????????????????¢????\\n\\t{\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tconst ld time = b.xs[x]/vx;\\n\\t\\t\\tconst ld ay = vy*time - time*time*G / 2;\\n\\t\\t\\ty_max = max(y_max, ay);\\n\\t\\t\\ty_min = min(y_min, ay);\\n\\t\\t}\\n\\t}\\n\\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\\n\\t\\treturn true;\\n\\t}\\n\\telse {\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\\n\\tif (p.real() < eps)return;\\n\\tbool ok = true;\\n\\tld amin, amax;\\n\\n\\t//?????????????¨????\\n\\t{\\n\\t\\tconst ld tan = V*V / G / p.real();\\n\\t\\tconst ld theta = atan(tan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld max_y = vy*time - G*time*time / 2;\\n\\t\\tif (max_y < p.imag()) {\\n\\t\\t\\tok = false;\\n\\t\\t}\\n\\t\\tif (leftup) {\\n\\t\\t\\tamax = tan;\\n\\t\\t\\tamin = 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tamax = 1e18;\\n\\t\\t\\tamin = tan;\\n\\t\\t}\\n\\t}\\n\\tif (ok) {\\n\\t\\tint rep = 1000;\\n\\t\\twhile (rep--) {\\n\\t\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\t\\tconst ld theta = atan(amidtan);\\n\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\tconst ld time = p.real() / vx;\\n\\t\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\t\\tif (ay > p.imag()) {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\tconst ld theta = atan(amidtan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\ttans.push_back(amin);\\n\\t}\\n}\\n\\nint main() { cin >> N >> V >> X >> Y;\\n\\tvector<box>bs;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint L, B, R, T; cin >> L >> B >> R >> T;\\n\\t\\tbox b;\\n\\t\\tb.xs.push_back(L);\\n\\t\\tb.xs.push_back(R);\\n\\t\\tb.ys.push_back(B);\\n\\t\\tb.ys.push_back(T);\\n\\t\\tbs.push_back(b);\\n\\t}\\n\\tconst ld down = Y;\\n\\tld up = 1e18;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\\n\\t\\t\\tif (bs[i].ys[0] > Y) {\\n\\n\\t\\t\\t\\tup = min(up, bs[i].ys[0]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<ld>tans;\\n\\tfor (auto b : bs) {\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tfor (int y = 0; y < 2; ++y) {\\n\\t\\t\\t\\tPoint p(b.xs[x], b.ys[y]);\\n\\t\\t\\t\\tgettan(tans, p,(x+y)%2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tPoint p(X,Y);\\n\\t\\tgettan(tans, p,true);\\n\\t}\\n\\tsort(tans.begin(), tans.end());\\n\\t{\\n\\t\\tvector<ld>ntans;\\n\\t\\tfor (int i = 0; i < tans.size(); ++i) {\\n\\t\\t\\tntans.push_back(tans[i]);\\n\\t\\t\\tif (i != tans.size() - 1) {\\n\\t\\t\\t\\tntans.push_back((tans[i] + tans[i + 1]) / 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//tans = ntans;\\n\\t}\\n\\n\\tstring ans = \\\"No\\\";\\n\\tfor (auto t : tans) {\\n\\t\\tconst ld theta = atan(t);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = X / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\tif (down-eps <= ay&&ay <= up+eps) {\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tfor (auto b : bs) {\\n\\t\\t\\t\\tif (!check(theta, b))ok = false;\\n\\t\\t\\t}\\n\\t\\t\\tif (ok) {\\n\\t\\t\\t\\tans = \\\"Yes\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.2,\n \"time_ms\": 30,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.8687,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2308_1777164\",\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;\\ntemplate<class T>\\nusing Table = vector<vector<T>>;\\nconst ld eps=1e-9;\\n\\n//// < \\\"D:\\\\D_Download\\\\Visual Studio 2015\\\\Projects\\\\programing_contest_c++\\\\Debug\\\\a.txt\\\"\\n\\n\\n/* ??????????????¬ */\\n\\n#include <complex>\\n\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define ALL(x) (x).begin(),(x).end()\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// ????????\\\\???\\nPoint input_point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// ????????????????????????\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// ??????\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// ??????\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// ??´????????????\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// ????????????\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// CCW\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\\n\\treturn 0; // a,c,b???????????´???????????¶\\n}\\n\\n\\n/* ???????????? */\\n\\n// ??´?????¨??´??????????????????\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// ??´?????¨?????????????????????\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// ????????¨?????????????????????\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// ????????´????????????\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// ?????????????????????\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// ??????????¶?\\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// ????????¨???????????????\\n//???????????£????????¨???????????¨assert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//??????isis_ss?????????\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// ??´?????¨???????????¢\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n// ??´?????¨??´???????????¢\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// ??´?????¨??????????????¢\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// ????????¨???????????¢\\nld dist_sp(const Line& s, const 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\\n// ????????¨??????????????¢\\nld dist_ss(const Line& s, const 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\\n\\n//??´?????¨??´?????????????????????????????????\\nLine bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:??????\\n//c:????????§??????\\n//???????????´?????????????????¢?????????????±??????????\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* ??? */\\n\\n// ?????¨????????????\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n//???????????????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n//???lc??????rc??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint circle_in_circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// ?????¨??´????????????\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// ?????¨??????????????¢\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), ALL(nret));\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//??????????????????????????¢???\\nld two_circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* ????§???¢ */\\n\\ntypedef vector<Point> Polygon;\\n\\n// ??¢???\\nld area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n// ????§???¢????????¢??????\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// ??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//??????????????????2?????????\\nenum { OUT, ON, IN };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// ??????\\n// ???????????????????????¨????????????????????§??¨???\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n// ????????????\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon Q;\\n\\tPolygon R;\\n\\tREP(i, n) {\\n\\t\\tPoint A = ps[i], B = ps[(i + 1) % n];\\n\\t\\tLine m = Line(A, B);\\n\\t\\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tQ.push_back(is_ll(l, m));\\n\\t\\t\\tR.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ Q,R };\\n\\treturn polys;\\n}\\n\\n\\n/* ??¢??¬??????????????? */\\nvoid add_point(vector<Point> &ps, const Point p) {\\n\\tfor (Point q : ps) if (abs(q - p) < eps) return;\\n\\tps.push_back(p);\\n}\\n\\ntypedef int Weight;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tEdge(int src, int dst, Weight weight) :\\n\\t\\tsrc(src), dst(dst), weight(weight) { }\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\\n\\tg[from].push_back(Edge{ from, to, weight });\\n}\\n\\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\\n\\tint n = p.size(), m = s.size();\\n\\tGraph g(n);\\n\\tREP(i, m) {\\n\\t\\tvector<pair<ld, int>> vec;\\n\\t\\tREP(j, n) if (isis_sp(s[i], p[j]))\\n\\t\\t\\tvec.emplace_back(abs(s[i].a - p[j]), j);\\n\\t\\tsort(ALL(vec));\\n\\t\\tREP(j, vec.size() - 1) {\\n\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\\n\\t\\t}\\n\\t}\\n\\treturn g;\\n}\\nGraph sennbunn_arrangement(const vector<Line>&s) {\\n\\tvector<Point>crss;\\n\\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\\n\\t\\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\\n\\t\\t\\tif (isis_ss(s[i], s[j])) {\\n\\t\\t\\t\\tcrss.push_back(is_ll(s[i], s[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\\n\\t\\tcrss.push_back(s[i][0]);\\n\\t\\tcrss.push_back(s[i][1]);\\n\\t}\\n\\treturn segment_arrangement(s, crss);\\n}\\n\\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\\n//\\tint n = p.size(), m = c.size();\\n//\\tGraph g(n);\\n//\\tREP(i, m) {\\n//\\t\\tvector<pair<ld, int>> vec;\\n//\\t\\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\\n//\\t\\t\\tvec.emplace_back(arg(c[i].p - p[j]), j);\\n//\\t\\tsort(ALL(vec));\\n//\\t\\tREP(j, vec.size() - 1) {\\n//\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n//\\t\\t\\tld angle = vec[j + 1].first - vec[j].first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t\\tif (vec.size() >= 2) {\\n//\\t\\t\\tint from = vec.back().second, to = vec.front().first;\\n//\\t\\t\\tld angle = vec.front().first - vec.back().first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t}\\n//\\treturn g;\\n//}\\n\\n\\n\\nconst ld G= 9.8;\\n\\nstruct box {\\n\\tvector<ld>xs;\\n\\tvector<ld>ys;\\n};\\n\\n\\nint N, V, X, Y;\\nbool check(const ld theta, const box& b) {\\n\\n\\tconst ld vx = V*cos(theta);\\n\\tconst ld vy = V*sin(theta);\\n\\n\\tld y_max = -1e18;\\n\\tld y_min = 1e18;\\n\\n\\t//?????????????¢????\\n\\t{\\n\\t\\tconst ld toptime = vy / G;\\n\\t\\tconst ld top_x = toptime*vx;\\n\\t\\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\\n\\t\\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\\n\\t\\t\\ty_max = max(y_max, top_y);\\n\\t\\t}\\n\\t}\\n\\t//???????????????????¢????\\n\\t{\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tconst ld time = b.xs[x]/vx;\\n\\t\\t\\tconst ld ay = vy*time - time*time*G / 2;\\n\\t\\t\\ty_max = max(y_max, ay);\\n\\t\\t\\ty_min = min(y_min, ay);\\n\\t\\t}\\n\\t}\\n\\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\\n\\t\\treturn true;\\n\\t}\\n\\telse {\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\\n\\tif (p.real() < eps)return;\\n\\tbool ok = true;\\n\\tld amin, amax;\\n\\n\\t//?????????????¨????\\n\\t{\\n\\t\\tconst ld tan = V*V / G / p.real();\\n\\t\\tconst ld theta = atan(tan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld max_y = vy*time - G*time*time / 2;\\n\\t\\tif (max_y < p.imag()) {\\n\\t\\t\\tok = false;\\n\\t\\t}\\n\\t\\tif (leftup) {\\n\\t\\t\\tamax = tan;\\n\\t\\t\\tamin = 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tamax = 1e18;\\n\\t\\t\\tamin = tan;\\n\\t\\t}\\n\\t}\\n\\tif (ok) {\\n\\t\\tint rep = 1000;\\n\\t\\twhile (rep--) {\\n\\t\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\t\\tconst ld theta = atan(amidtan);\\n\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\tconst ld time = p.real() / vx;\\n\\t\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\t\\tif (ay > p.imag()) {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\tconst ld theta = atan(amidtan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\ttans.push_back(amin);\\n\\t}\\n}\\n\\nint main() { cin >> N >> V >> X >> Y;\\n\\tvector<box>bs;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint L, B, R, T; cin >> L >> B >> R >> T;\\n\\t\\tbox b;\\n\\t\\tb.xs.push_back(L);\\n\\t\\tb.xs.push_back(R);\\n\\t\\tb.ys.push_back(B);\\n\\t\\tb.ys.push_back(T);\\n\\t\\tbs.push_back(b);\\n\\t}\\n\\tconst ld down = Y;\\n\\tld up = 1e18;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\\n\\t\\t\\tup = min(up, bs[i].ys[0]);\\n\\t\\t}\\n\\t}\\n\\tvector<ld>tans;\\n\\tfor (auto b : bs) {\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tfor (int y = 0; y < 2; ++y) {\\n\\t\\t\\t\\tPoint p(b.xs[x], b.ys[y]);\\n\\t\\t\\t\\tgettan(tans, p,(x+y)%2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tPoint p(X,Y);\\n\\t\\tgettan(tans, p,true);\\n\\t}\\n\\tsort(tans.begin(), tans.end());\\n\\t{\\n\\t\\tvector<ld>ntans;\\n\\t\\tfor (int i = 0; i < tans.size(); ++i) {\\n\\t\\t\\tntans.push_back(tans[i]);\\n\\t\\t\\tif (i != tans.size() - 1) {\\n\\t\\t\\t\\tntans.push_back((tans[i] + tans[i + 1]) / 2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\ttans = ntans;\\n\\t}\\n\\n\\tstring ans = \\\"No\\\";\\n\\tfor (auto t : tans) {\\n\\t\\tconst ld theta = atan(t);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = X / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\tif (down-eps <= ay&&ay <= up+eps) {\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tfor (auto b : bs) {\\n\\t\\t\\t\\tif (!check(theta, b))ok = false;\\n\\t\\t\\t}\\n\\t\\t\\tif (ok) {\\n\\t\\t\\t\\tans = \\\"Yes\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 30,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.8579,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2308_1777161\",\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;\\ntemplate<class T>\\nusing Table = vector<vector<T>>;\\nconst ld eps=1e-9;\\n\\n//// < \\\"D:\\\\D_Download\\\\Visual Studio 2015\\\\Projects\\\\programing_contest_c++\\\\Debug\\\\a.txt\\\"\\n\\n\\n/* ??????????????¬ */\\n\\n#include <complex>\\n\\ntypedef long double ld;\\ntypedef complex<ld> Point;\\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\\n#define ALL(x) (x).begin(),(x).end()\\n\\n\\nconst ld pi = acos(-1.0);\\nconst ld dtop = pi / 180.;\\nconst ld ptod = 1. / dtop;\\n\\nnamespace std {\\n\\tbool operator<(const Point &lhs, const Point &rhs) {\\n\\t\\tif (lhs.real() < rhs.real() - eps) return true;\\n\\t\\tif (lhs.real() > rhs.real() + eps) return false;\\n\\t\\treturn lhs.imag() < rhs.imag();\\n\\t}\\n}\\n\\n// ????????\\\\???\\nPoint input_point() {\\n\\tld x, y;\\n\\tcin >> x >> y;\\n\\treturn Point(x, y);\\n}\\n\\n// ????????????????????????\\nbool eq(const ld a, const ld b) {\\n\\treturn (abs(a - b) < eps);\\n}\\n\\n// ??????\\nld dot(const Point& a, const Point& b) {\\n\\treturn real(conj(a) * b);\\n}\\n\\n// ??????\\nld cross(const Point& a, const Point& b) {\\n\\treturn imag(conj(a) * b);\\n}\\n\\n// ??´????????????\\nclass Line {\\npublic:\\n\\tPoint a, b;\\n\\tLine() : a(Point(0, 0)), b(Point(0, 0)) {}\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\tPoint operator[](const int _num)const {\\n\\t\\tif (_num == 0)return a;\\n\\t\\telse if (_num == 1)return b;\\n\\t\\telse {\\n\\t\\t\\tassert(false);\\n\\t\\t\\treturn Point();\\n\\t\\t}\\n\\t}\\n};\\n\\n// ????????????\\nclass Circle {\\npublic:\\n\\tPoint p;\\n\\tld r;\\n\\tCircle() : p(Point(0, 0)), r(0) {}\\n\\tCircle(Point p, ld r) : p(p), r(r) {}\\n};\\n\\n// CCW\\nint ccw(const Point& a, const Point &b, const Point &c) {\\n\\tconst Point nb(b - a);\\n\\tconst Point nc(c - a);\\n\\tif (cross(nb, nc) > eps) return 1; // a,b,c??????????¨???¨?????????????????¶\\n\\tif (cross(nb, nc) < -eps) return -1; // a,b,c???????¨???¨?????????????????¶\\n\\tif (dot(nb, nc) < 0) return 2; // c,a,b???????????´???????????¶\\n\\tif (norm(nb) < norm(nc)) return -2; // a,b,c???????????´???????????¶\\n\\treturn 0; // a,c,b???????????´???????????¶\\n}\\n\\n\\n/* ???????????? */\\n\\n// ??´?????¨??´??????????????????\\nbool isis_ll(const Line& l, const Line& m) {\\n\\treturn !eq(cross(l.b - l.a, m.b - m.a), 0);\\n}\\n\\n// ??´?????¨?????????????????????\\nbool isis_ls(const Line& l, const Line& s) {\\n\\treturn isis_ll(l, s) &&\\n\\t\\t(cross(l.b - l.a, s.a - l.a) * cross(l.b - l.a, s.b - l.a) < eps);\\n}\\n\\n// ????????¨?????????????????????\\nbool isis_ss(const Line& s, const Line& t) {\\n\\treturn ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\\n\\t\\tccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\n\\n// ????????´????????????\\nbool isis_lp(const Line& l, const Point& p) {\\n\\treturn (abs(cross(l.b - p, l.a - p)) < eps);\\n}\\n\\n// ?????????????????????\\nbool isis_sp(const Line& s, const Point& p) {\\n\\treturn (abs(s.a - p) + abs(s.b - p) - abs(s.b - s.a) < eps);\\n}\\n\\n// ??????????¶?\\nPoint proj(const Line &l, const 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(const Line &s, const 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// ??´?????¨??´????????????\\nvector<Point> is_ll2(const Line &s, const Line& t) {\\n\\tPoint sv = s.b - s.a, tv = t.b - t.a;\\n\\tif (cross(sv, tv) != 0)return vector<Point>(1, is_ll(s, t));\\n\\telse {\\n\\t\\tvector<Point>ans;\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tif (isis_sp(s, t[k]) && find(ans.begin(), ans.end(), t[k]) == ans.end())ans.push_back(t[k]);\\n\\t\\t\\tif (isis_sp(t, s[k]) && find(ans.begin(), ans.end(), s[k]) == ans.end())ans.push_back(s[k]);\\n\\t\\t}\\n\\t\\treturn ans;\\n\\t}\\n}\\n// ????????¨???????????????\\n//???????????£????????¨???????????¨assert(false)\\nPoint is_ss(const Line &s, const Line& t) {\\n\\tif (isis_ss(s, t)) {\\n\\t\\tfor (int k = 0; k < 2; ++k) {\\n\\t\\t\\tfor (int l = 0; l < 2; ++l) {\\n\\t\\t\\t\\tif (s[k] == t[l])return s[k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn is_ll(s, t);\\n\\t}\\n\\telse {\\n\\t\\t//??????isis_ss?????????\\n\\t\\tassert(false);\\n\\t\\treturn Point(0, 0);\\n\\t}\\n}\\n// ??´?????¨???????????¢\\nld dist_lp(const Line& l, const Point& p) {\\n\\treturn abs(p - proj(l, p));\\n}\\n\\n// ??´?????¨??´???????????¢\\nld dist_ll(const Line& l, const Line& m) {\\n\\treturn isis_ll(l, m) ? 0 : dist_lp(l, m.a);\\n}\\n\\n// ??´?????¨??????????????¢\\nld dist_ls(const Line& l, const Line& s) {\\n\\treturn isis_ls(l, s) ? 0 : min(dist_lp(l, s.a), dist_lp(l, s.b));\\n}\\n\\n// ????????¨???????????¢\\nld dist_sp(const Line& s, const 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\\n// ????????¨??????????????¢\\nld dist_ss(const Line& s, const 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\\n\\n//??´?????¨??´?????????????????????????????????\\nLine bisection(const Line &s, const Line &t) {\\n\\tconst Point laglanju(is_ll(s, t));\\n\\tconst Point avec = !(abs(laglanju - s[0])<eps) ? s[0] - laglanju : s[1] - laglanju;\\n\\tconst Point bvec = !(abs(laglanju - t[0])<eps) ? t[0] - laglanju : t[1] - laglanju;\\n\\n\\treturn Line(laglanju, laglanju + (abs(bvec)*avec + abs(avec)*bvec) / (abs(avec) + abs(bvec)));\\n}\\n\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nPoint inner_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i <static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (vertics[0] == vertics[1] || vertics[1] == vertics[2] || vertics[2] == vertics[0])return vertics[0];\\n\\tLine bi1(bisection(Line(vertics[0], vertics[1]), Line(vertics[0], vertics[2])));\\n\\tLine bi2(bisection(Line(vertics[1], vertics[2]), Line(vertics[1], vertics[0])));\\n\\tif (bi1[0] == bi2[0])return bi1[0];\\n\\telse {\\n\\t\\treturn is_ll(bi1, bi2);\\n\\t}\\n}\\n\\n//???????????´?????????????????????\\n//???????????´??????????????§???????????¨????¢?????????¨?????????\\nvector<Point> ex_center(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tfor (int i = 0; i < static_cast<int>(ls.size()); ++i) {\\n\\t\\tvertics.push_back(is_ll(ls[i], ls[(i + 1) % 3]));\\n\\t}\\n\\tif (abs(vertics[0] - vertics[1])<eps || abs(vertics[1] - vertics[2])<eps || (abs(vertics[2] - vertics[0])<eps))return vector<Point>();\\n\\tvector<Point>ecs;\\n\\tfor (int i = 0; i < 3; ++i) {\\n\\t\\tLine bi1(bisection(Line(vertics[i], vertics[i] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[i], vertics[(i + 1) % 3])));\\n\\t\\tLine bi2(bisection(Line(vertics[(i + 1) % 3], vertics[(i + 1) % 3] * 2.0l - vertics[(i + 2) % 3]), Line(vertics[(i + 1) % 3], vertics[i])));\\n\\t\\tecs.push_back(is_ll(bi1, bi2));\\n\\t}\\n\\treturn ecs;\\n}\\n\\n\\n//a,b:??????\\n//c:????????§??????\\n//???????????´?????????????????¢?????????????±??????????\\nvector<Point> same_dis(const vector<Line>&ls) {\\n\\tvector<Point>vertics;\\n\\tvertics.push_back(is_ll(ls[0], ls[2]));\\n\\tvertics.push_back(is_ll(ls[1], ls[2]));\\n\\n\\tif (abs(vertics[0] - vertics[1]) < eps)return vector<Point>{vertics[0]};\\n\\tLine bis(bisection(ls[0], ls[1]));\\n\\tvector<Point>ecs;\\n\\n\\tLine abi(bisection(Line(vertics[0], vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, abi));\\n\\n\\n\\tLine bbi(bisection(Line(vertics[0], 2.l*vertics[0] - vertics[1]), ls[0]));\\n\\tecs.push_back(is_ll(bis, bbi));\\n\\n\\treturn ecs;\\n}\\n/* ??? */\\n\\n// ?????¨????????????\\nvector<Point> is_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Point> res;\\n\\tld d = abs(c1.p - c2.p);\\n\\tld rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\\n\\tld dfr = c1.r * c1.r - rc * rc;\\n\\tif (abs(dfr) < eps) dfr = 0.0;\\n\\telse if (dfr < 0.0) return res; // no intersection\\n\\tld rs = sqrt(dfr);\\n\\tPoint diff = (c2.p - c1.p) / d;\\n\\tres.push_back(c1.p + diff * Point(rc, rs));\\n\\tif (dfr != 0.0) res.push_back(c1.p + diff * Point(rc, -rs));\\n\\treturn res;\\n}\\n\\n//???????????????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_circle(const Circle &cir, const Point& p) {\\n\\tld dis = abs(cir.p - p);\\n\\tif (dis > cir.r + eps)return 0;\\n\\telse if (dis < cir.r - eps)return 2;\\n\\telse return 1;\\n}\\n//???lc??????rc??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint circle_in_circle(const Circle &lc, const Circle&rc) {\\n\\tld dis = abs(lc.p - rc.p);\\n\\tif (dis < rc.r - lc.r - eps)return 2;\\n\\telse if (dis>rc.r - lc.r + eps)return 0;\\n\\telse return 1;\\n}\\n\\n// ?????¨??´????????????\\nvector<Point> is_lc(const Circle& c, const Line& l) {\\n\\tvector<Point> res;\\n\\tld d = dist_lp(l, c.p);\\n\\tif (d < c.r + eps) {\\n\\t\\tld len = (d > c.r) ? 0.0 : sqrt(c.r * c.r - d * d); //safety;\\n\\t\\tPoint nor = (l.a - l.b) / abs(l.a - l.b);\\n\\t\\tres.push_back(proj(l, c.p) + len * nor);\\n\\t\\tres.push_back(proj(l, c.p) - len * nor);\\n\\t}\\n\\treturn res;\\n}\\n\\n// ?????¨??????????????¢\\nvector<Point> is_sc(const Circle& c, const Line& l) {\\n\\tvector<Point> v = is_lc(c, l), res;\\n\\tfor (Point p : v)\\n\\t\\tif (isis_sp(l, p)) res.push_back(p);\\n\\treturn res;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cp(const Circle& c, const Point& p) {\\n\\tvector<Line> ret;\\n\\tPoint v = c.p - p;\\n\\tld d = abs(v);\\n\\tld l = sqrt(norm(v) - c.r * c.r);\\n\\tif (isnan(l)) { return ret; }\\n\\tPoint v1 = v * Point(l / d, c.r / d);\\n\\tPoint v2 = v * Point(l / d, -c.r / d);\\n\\tret.push_back(Line(p, p + v1));\\n\\tif (l < eps) return ret;\\n\\tret.push_back(Line(p, p + v2));\\n\\treturn ret;\\n}\\n\\n// ?????¨????????\\\\???\\nvector<Line> tangent_cc(const Circle& c1, const Circle& c2) {\\n\\tvector<Line> ret;\\n\\tif (abs(c1.p - c2.p) - (c1.r + c2.r) > -eps) {\\n\\t\\tPoint center = (c1.p * c2.r + c2.p * c1.r) / (c1.r + c2.r);\\n\\t\\tret = tangent_cp(c1, center);\\n\\t}\\n\\tif (abs(c1.r - c2.r) > eps) {\\n\\t\\tPoint out = (-c1.p * c2.r + c2.p * c1.r) / (c1.r - c2.r);\\n\\t\\tvector<Line> nret = tangent_cp(c1, out);\\n\\t\\tret.insert(ret.end(), ALL(nret));\\n\\t}\\n\\telse {\\n\\t\\tPoint v = c2.p - c1.p;\\n\\t\\tv /= abs(v);\\n\\t\\tPoint q1 = c1.p + v * Point(0, 1) * c1.r;\\n\\t\\tPoint q2 = c1.p + v * Point(0, -1) * c1.r;\\n\\t\\tret.push_back(Line(q1, q1 + v));\\n\\t\\tret.push_back(Line(q2, q2 + v));\\n\\t}\\n\\treturn ret;\\n}\\n//??????????????????????????¢???\\nld two_circle_area(const Circle&l, const Circle&r) {\\n\\tld dis = abs(l.p - r.p);\\n\\tif (dis > l.r + r.r)return 0;\\n\\telse if (dis + r.r < l.r) {\\n\\t\\treturn r.r*r.r*pi;\\n\\t}\\n\\telse if (dis + l.r < r.r) {\\n\\t\\treturn l.r*l.r*pi;\\n\\t}\\n\\telse {\\n\\t\\tld ans = (l.r)*(l.r)*acos((dis*dis + l.r*l.r - r.r*r.r) / (2 * dis*l.r)) +\\n\\t\\t\\t(r.r)*(r.r)*acos((dis*dis + r.r*r.r - l.r*l.r) / (2 * dis*r.r)) -\\n\\t\\t\\tsqrt(4 * dis*dis*l.r*l.r - (dis*dis + l.r*l.r - r.r*r.r)*(dis*dis + l.r*l.r - r.r*r.r)) / 2;\\n\\t\\treturn ans;\\n\\t}\\n\\n}\\n\\n/* ????§???¢ */\\n\\ntypedef vector<Point> Polygon;\\n\\n// ??¢???\\nld area(const Polygon &p) {\\n\\tld res = 0;\\n\\tint n = p.size();\\n\\tREP(j, n) res += cross(p[j], p[(j + 1) % n]);\\n\\treturn res / 2;\\n}\\n\\n// ????§???¢????????¢??????\\nbool is_counter_clockwise(const Polygon &poly) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n], c = poly[(i + 2) % n];\\n\\t\\tangle += arg((c - b) / (b - a));\\n\\t}\\n\\treturn angle > eps;\\n}\\n\\n// ??????????????????\\n// 0 => out\\n// 1 => on\\n// 2 => in\\nint is_in_polygon(const Polygon &poly, const Point& p) {\\n\\tld angle = 0;\\n\\tint n = poly.size();\\n\\tREP(i, n) {\\n\\t\\tPoint a = poly[i], b = poly[(i + 1) % n];\\n\\t\\tif (isis_sp(Line(a, b), p)) return 1;\\n\\t\\tangle += arg((b - p) / (a - p));\\n\\t}\\n\\treturn eq(angle, 0) ? 0 : 2;\\n}\\n//??????????????????2?????????\\nenum { OUT, ON, IN };\\nint convex_contains(const Polygon &P, const Point &p) {\\n\\tconst int n = P.size();\\n\\tPoint g = (P[0] + P[n / 3] + P[2 * n / 3]) / 3.0l; // inner-point\\n\\tint a = 0, b = n;\\n\\twhile (a + 1 < b) { // invariant: c is in fan g-P[a]-P[b]\\n\\t\\tint c = (a + b) / 2;\\n\\t\\tif (cross(P[a] - g, P[c] - g) > 0) { // angle < 180 deg\\n\\t\\t\\tif (cross(P[a] - g, p - g) > 0 && cross(P[c] - g, p - g) < 0) b = c;\\n\\t\\t\\telse a = c;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (cross(P[a] - g, p - g) < 0 && cross(P[c] - g, p - g) > 0) a = c;\\n\\t\\t\\telse b = c;\\n\\t\\t}\\n\\t}\\n\\tb %= n;\\n\\tif (cross(P[a] - p, P[b] - p) < 0) return 0;\\n\\tif (cross(P[a] - p, P[b] - p) > 0) return 2;\\n\\treturn 1;\\n}\\n\\n// ??????\\n// ???????????????????????¨????????????????????§??¨???\\nPolygon convex_hull(vector<Point> ps) {\\n\\tint n = ps.size();\\n\\tint k = 0;\\n\\tsort(ps.begin(), ps.end());\\n\\tPolygon ch(2 * n);\\n\\tfor (int i = 0; i < n; ch[k++] = ps[i++])\\n\\t\\twhile (k >= 2 && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tfor (int i = n - 2, t = k + 1; i >= 0; ch[k++] = ps[i--])\\n\\t\\twhile (k >= t && ccw(ch[k - 2], ch[k - 1], ps[i]) <= 0) --k;\\n\\tch.resize(k - 1);\\n\\treturn ch;\\n}\\n\\n\\n\\n// ????????????\\nvector<Polygon> convex_cut(const Polygon &ps, const Line& l) {\\n\\tint n = ps.size();\\n\\tPolygon Q;\\n\\tPolygon R;\\n\\tREP(i, n) {\\n\\t\\tPoint A = ps[i], B = ps[(i + 1) % n];\\n\\t\\tLine m = Line(A, B);\\n\\t\\tif (ccw(l.a, l.b, A) != -1) Q.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) != 1) R.push_back(A);\\n\\t\\tif (ccw(l.a, l.b, A) * ccw(l.a, l.b, B) < 0 && isis_ll(l, m)) {\\n\\t\\t\\tQ.push_back(is_ll(l, m));\\n\\t\\t\\tR.push_back(is_ll(l, m));\\n\\t\\t}\\n\\t}\\n\\tconst vector<Polygon>polys{ Q,R };\\n\\treturn polys;\\n}\\n\\n\\n/* ??¢??¬??????????????? */\\nvoid add_point(vector<Point> &ps, const Point p) {\\n\\tfor (Point q : ps) if (abs(q - p) < eps) return;\\n\\tps.push_back(p);\\n}\\n\\ntypedef int Weight;\\nstruct Edge {\\n\\tint src, dst;\\n\\tWeight weight;\\n\\tEdge(int src, int dst, Weight weight) :\\n\\t\\tsrc(src), dst(dst), weight(weight) { }\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\n\\nvoid add_edge(Graph &g, const int from, const int to, const Weight weight) {\\n\\tg[from].push_back(Edge{ from, to, weight });\\n}\\n\\nGraph segment_arrangement(const vector<Line> &s, const vector<Point> &p) {\\n\\tint n = p.size(), m = s.size();\\n\\tGraph g(n);\\n\\tREP(i, m) {\\n\\t\\tvector<pair<ld, int>> vec;\\n\\t\\tREP(j, n) if (isis_sp(s[i], p[j]))\\n\\t\\t\\tvec.emplace_back(abs(s[i].a - p[j]), j);\\n\\t\\tsort(ALL(vec));\\n\\t\\tREP(j, vec.size() - 1) {\\n\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(abs(p[from] - p[to])));\\n\\t\\t}\\n\\t}\\n\\treturn g;\\n}\\nGraph sennbunn_arrangement(const vector<Line>&s) {\\n\\tvector<Point>crss;\\n\\tfor (int i = 0; i < static_cast<int>(s.size()); ++i) {\\n\\t\\tfor (int j = i + 1; j < static_cast<int>(s.size()); ++j) {\\n\\t\\t\\tif (isis_ss(s[i], s[j])) {\\n\\t\\t\\t\\tcrss.push_back(is_ll(s[i], s[j]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i <static_cast<int>(s.size()); ++i) {\\n\\t\\tcrss.push_back(s[i][0]);\\n\\t\\tcrss.push_back(s[i][1]);\\n\\t}\\n\\treturn segment_arrangement(s, crss);\\n}\\n\\n//Graph circle_arrangement(const vector<Circle> &c, const vector<Point> &p) {\\n//\\tint n = p.size(), m = c.size();\\n//\\tGraph g(n);\\n//\\tREP(i, m) {\\n//\\t\\tvector<pair<ld, int>> vec;\\n//\\t\\tREP(j, n) if (abs(abs(c[i].p - p[j]) - c[i].r) < eps)\\n//\\t\\t\\tvec.emplace_back(arg(c[i].p - p[j]), j);\\n//\\t\\tsort(ALL(vec));\\n//\\t\\tREP(j, vec.size() - 1) {\\n//\\t\\t\\tint from = vec[j].second, to = vec[j + 1].second;\\n//\\t\\t\\tld angle = vec[j + 1].first - vec[j].first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t\\tif (vec.size() >= 2) {\\n//\\t\\t\\tint from = vec.back().second, to = vec.front().first;\\n//\\t\\t\\tld angle = vec.front().first - vec.back().first;\\n//\\t\\t\\tadd_edge(g, from, to, static_cast<Weight>(angle * c[i].r));\\n//\\t\\t}\\n//\\t}\\n//\\treturn g;\\n//}\\n\\n\\n\\nconst ld G= 9.8;\\n\\nstruct box {\\n\\tvector<ld>xs;\\n\\tvector<ld>ys;\\n};\\n\\n\\nint N, V, X, Y;\\nbool check(const ld theta, const box& b) {\\n\\n\\tconst ld vx = V*cos(theta);\\n\\tconst ld vy = V*sin(theta);\\n\\n\\tld y_max = -1e18;\\n\\tld y_min = 1e18;\\n\\n\\t//?????????????¢????\\n\\t{\\n\\t\\tconst ld toptime = vy / G;\\n\\t\\tconst ld top_x = toptime*vx;\\n\\t\\tconst ld top_y = vy*toptime - toptime*toptime*G / 2;\\n\\t\\tif (b.xs[0] < top_x&&top_x < b.xs[1]) {\\n\\t\\t\\ty_max = max(y_max, top_y);\\n\\t\\t}\\n\\t}\\n\\t//???????????????????¢????\\n\\t{\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tconst ld time = b.xs[x]/vx;\\n\\t\\t\\tconst ld ay = vy*time - time*time*G / 2;\\n\\t\\t\\ty_max = max(y_max, ay);\\n\\t\\t\\ty_min = min(y_min, ay);\\n\\t\\t}\\n\\t}\\n\\tif (y_max- eps < b.ys[0] || b.ys[1] < y_min + eps) {\\n\\t\\treturn true;\\n\\t}\\n\\telse {\\n\\t\\treturn false;\\n\\t}\\n}\\n\\nvoid gettan(vector<ld>&tans,const Point& p,int leftup) {\\n\\tif (p.real() < eps)return;\\n\\tbool ok = true;\\n\\tld amin, amax;\\n\\n\\t//?????????????¨????\\n\\t{\\n\\t\\tconst ld tan = V*V / G / p.real();\\n\\t\\tconst ld theta = atan(tan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld max_y = vy*time - G*time*time / 2;\\n\\t\\tif (max_y < p.imag()) {\\n\\t\\t\\tok = false;\\n\\t\\t}\\n\\t\\tif (leftup) {\\n\\t\\t\\tamax = tan;\\n\\t\\t\\tamin = 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tamax = 1e18;\\n\\t\\t\\tamin = tan;\\n\\t\\t}\\n\\t}\\n\\tif (ok) {\\n\\t\\tint rep = 1000;\\n\\t\\twhile (rep--) {\\n\\t\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\t\\tconst ld theta = atan(amidtan);\\n\\t\\t\\tconst ld vx = V*cos(theta);\\n\\t\\t\\tconst ld vy = V*sin(theta);\\n\\t\\t\\tconst ld time = p.real() / vx;\\n\\t\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\t\\tif (ay > p.imag()) {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tif (leftup) {\\n\\t\\t\\t\\t\\tamin = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tamax = amidtan;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tconst ld amidtan = (amin + amax) / 2;\\n\\t\\tconst ld theta = atan(amidtan);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = p.real() / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\ttans.push_back(amin);\\n\\t}\\n}\\n\\nint main() { cin >> N >> V >> X >> Y;\\n\\tvector<box>bs;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tint L, B, R, T; cin >> L >> B >> R >> T;\\n\\t\\tbox b;\\n\\t\\tb.xs.push_back(L);\\n\\t\\tb.xs.push_back(R);\\n\\t\\tb.ys.push_back(B);\\n\\t\\tb.ys.push_back(T);\\n\\t\\tbs.push_back(b);\\n\\t}\\n\\tconst ld down = Y;\\n\\tld up = 1e18;\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tif (bs[i].xs[0] < X&&X < bs[i].xs[1]) {\\n\\t\\t\\tup = min(up, bs[i].ys[0]);\\n\\t\\t}\\n\\t}\\n\\tvector<ld>tans;\\n\\tfor (auto b : bs) {\\n\\t\\tfor (int x = 0; x < 2; ++x) {\\n\\t\\t\\tfor (int y = 0; y < 2; ++y) {\\n\\t\\t\\t\\tPoint p(b.xs[x], b.ys[y]);\\n\\t\\t\\t\\tgettan(tans, p,(x+y)%2);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t{\\n\\t\\tPoint p(X,Y);\\n\\t\\tgettan(tans, p,true);\\n\\t}\\n\\n\\tstring ans = \\\"No\\\";\\n\\tfor (auto t : tans) {\\n\\t\\tconst ld theta = atan(t);\\n\\t\\tconst ld vx = V*cos(theta);\\n\\t\\tconst ld vy = V*sin(theta);\\n\\t\\tconst ld time = X / vx;\\n\\t\\tconst ld ay = vy*time - G*time*time / 2;\\n\\t\\tif (down-eps <= ay&&ay <= up+eps) {\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\tfor (auto b : bs) {\\n\\t\\t\\t\\tif (!check(theta, b))ok = false;\\n\\t\\t\\t}\\n\\t\\t\\tif (ok) {\\n\\t\\t\\t\\tans = \\\"Yes\\\";\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.16666666666666666,\n \"time_ms\": 30,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -0.8733,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2308_1563859\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cmath>\\n#include<algorithm>\\nusing namespace std;\\nconst double eps=1e-8;\\nconst int N=100;\\nconst int MAXN=1000000;\\nconst double pi=acos(-1);\\nconst double gg=9.8;\\nint n;\\ndouble v,x,y,l[N],b[N],r[N],t[N],B,A,rr[N];\\nint work(double x,double y)\\n{\\n\\tdouble yy=A * x * x + B * x;\\n\\t//if (fabs(yy-y) < eps) return 0;\\n\\tif (y > yy) return 1;\\n\\treturn -1;\\n}\\nbool check(double thi)\\n{\\n\\tA=-gg/(2 * v * v * cos(thi) * cos(thi));\\n\\tB=tan(thi);\\n\\tdouble MAX_top=-B*B/(4 *A);\\n\\tdouble mid=-B/(2 * A);\\n\\tfor(int i=1;i<=n;i++)\\n\\tif (l[i] < x+eps)\\n\\t{\\n\\t\\t//rr[i]=min(r[i],x);\\n\\t\\trr[i]=r[i];\\n\\t\\tif (work(l[i],t[i]) * work(rr[i],t[i]) <0) return 0;\\n\\t\\tif (work(l[i],b[i]) * work(rr[i],b[i]) <0) return 0;\\n\\t\\tif (work(l[i],t[i]) * work(l[i],b[i]) <0) return 0;\\n\\t\\tif (r[i]<x+ eps && work(r[i],t[i]) * work(r[i],b[i]) <0) return 0;\\n\\t\\tif (work(l[i],b[i])>0 && work(rr[i],b[i])>0 && MAX_top > b[i]-eps && (mid>l[i] && mid<rr[i])) return 0;\\n\\t}\\n\\tif (work(x,y) > 0) return 0;\\n\\tdouble tmp=A * x * x + B * x;\\n\\tfor(int i=1;i<=n;i++)\\n\\t\\tif (l[i]< x-eps && r[i]> x+eps)\\n\\t\\t{\\n\\t\\t\\tif (t[i] < tmp-eps && t[i]>y+eps) return 0;\\n\\t\\t\\tif (b[i] < tmp-eps && b[i]>y+eps) return 0;\\n\\t\\t}\\n\\treturn 1;\\n}\\nint main()\\n{\\n\\tcin>>n>>v>>x>>y;\\n\\tfor(int i=1;i<=n;i++)\\n\\t\\tscanf(\\\"%lf%lf%lf%lf\\\",&l[i],&b[i],&r[i],&t[i]);\\n\\tfor(int i=1;i<MAXN;i++)\\n\\t{\\n\\t\\tdouble thi=pi / 2 * i / MAXN;\\n\\t\\tif (check(thi))\\n\\t\\t{\\n\\t\\t\\tcout<<\\\"Yes\\\"<<endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\tcout<<\\\"No\\\"<<endl;\\n}\",\n \"accuracy\": 0.26666666666666666,\n \"time_ms\": 220,\n \"memory_kb\": 1356,\n \"score_of_the_acc\": -0.4468,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2308_1563855\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cmath>\\n#include<algorithm>\\nusing namespace std;\\nconst double eps=1e-8;\\nconst int N=100;\\nconst int MAXN=1000000;\\nconst double pi=acos(-1);\\nconst double gg=9.8;\\nint n;\\ndouble v,x,y,l[N],b[N],r[N],t[N],B,A,rr[N];\\nint work(double x,double y)\\n{\\n\\tdouble yy=A * x * x + B * x;\\n\\t//if (fabs(yy-y) < eps) return 0;\\n\\tif (y > yy) return 1;\\n\\treturn -1;\\n}\\nbool check(double thi)\\n{\\n\\tA=-gg/(2 * v * v * cos(thi) * cos(thi));\\n\\tB=tan(thi);\\n\\tdouble MAX_top=-B*B/(4 *A);\\n\\tfor(int i=1;i<=n;i++)\\n\\tif (l[i] < x+eps)\\n\\t{\\n\\t\\trr[i]=min(r[i],x);\\n\\t\\tif (work(l[i],t[i]) * work(rr[i],t[i]) <0) return 0;\\n\\t\\tif (work(l[i],b[i]) * work(rr[i],b[i]) <0) return 0;\\n\\t\\tif (work(l[i],t[i]) * work(l[i],b[i]) <0) return 0;\\n\\t\\tif (r[i]<x+ eps && work(r[i],t[i]) * work(r[i],b[i]) <0) return 0;\\n\\t\\tif (work(l[i],b[i])>0 && work(rr[i],b[i])>0 && MAX_top > b[i]-eps) return 0;\\n\\t}\\n\\tif (work(x,y) > 0) return 0;\\n\\tdouble tmp=A * x * x + B * x;\\n\\tfor(int i=1;i<=n;i++)\\n\\t\\tif (l[i]< x-eps && r[i]> x+eps)\\n\\t\\t{\\n\\t\\t\\tif (t[i] < tmp-eps && t[i]>y+eps) return 0;\\n\\t\\t\\tif (b[i] < tmp-eps && b[i]>y+eps) return 0;\\n\\t\\t}\\n\\treturn 1;\\n}\\nint main()\\n{\\n\\tcin>>n>>v>>x>>y;\\n\\tfor(int i=1;i<=n;i++)\\n\\t\\tscanf(\\\"%lf%lf%lf%lf\\\",&l[i],&b[i],&r[i],&t[i]);\\n\\tfor(int i=1;i<MAXN;i++)\\n\\t{\\n\\t\\tdouble thi=pi / 2 * i / MAXN;\\n\\t\\tif (check(thi))\\n\\t\\t{\\n\\t\\t\\tcout<<\\\"Yes\\\"<<endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\tcout<<\\\"No\\\"<<endl;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 70,\n \"memory_kb\": 1360,\n \"score_of_the_acc\": -0.1292,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2308_1563840\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cmath>\\n#include<algorithm>\\nusing namespace std;\\nconst double eps=1e-8;\\nconst int N=100;\\nconst int MAXN=1000000;\\nconst double pi=acos(-1);\\nconst double gg=9.8;\\nint n;\\ndouble v,x,y,l[N],b[N],r[N],t[N],B,A,rr[N];\\nint work(double x,double y)\\n{\\n\\tdouble yy=A * x * x + B * x;\\n\\t//if (fabs(yy-y) < eps) return 0;\\n\\tif (y > yy) return 1;\\n\\treturn -1;\\n}\\nbool check(double thi)\\n{\\n\\tA=-gg/(2 * v * v * cos(thi) * cos(thi));\\n\\tB=tan(thi);\\n\\tdouble MAX_top=-B*B/(4 *A);\\n\\tfor(int i=1;i<=n;i++)\\n\\tif (l[i] < x+eps)\\n\\t{\\n\\t\\trr[i]=min(r[i],x);\\n\\t\\tif (work(l[i],t[i]) * work(rr[i],t[i]) <0) return 0;\\n\\t\\tif (work(l[i],b[i]) * work(rr[i],b[i]) <0) return 0;\\n\\t\\tif (work(l[i],t[i]) * work(l[i],b[i]) <0) return 0;\\n\\t\\tif (r[i]<x+ eps && work(r[i],t[i]) * work(r[i],b[i]) <0) return 0;\\n\\t\\tif (work(l[i],b[i])>0 && work(r[i],b[i])>0 && MAX_top > b[i]-eps) return 0;\\n\\t}\\n\\tif (work(x,y) > 0) return 0;\\n\\tdouble tmp=A * x * x + B * x;\\n\\tfor(int i=1;i<=n;i++)\\n\\t\\tif (l[i]< x-eps && r[i]> x+eps)\\n\\t\\t{\\n\\t\\t\\tif (t[i] < tmp-eps && t[i]>y+eps) return 0;\\n\\t\\t\\tif (b[i] < tmp-eps && b[i]>y+eps) return 0;\\n\\t\\t}\\n\\treturn 1;\\n}\\nint main()\\n{\\n\\tcin>>n>>v>>x>>y;\\n\\tfor(int i=1;i<=n;i++)\\n\\t\\tscanf(\\\"%lf%lf%lf%lf\\\",&l[i],&b[i],&r[i],&t[i]);\\n\\tfor(int i=1;i<MAXN;i++)\\n\\t{\\n\\t\\tdouble thi=pi / 2 * i / MAXN;\\n\\t\\tif (check(thi))\\n\\t\\t{\\n\\t\\t\\tcout<<\\\"Yes\\\"<<endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\tcout<<\\\"No\\\"<<endl;\\n}\",\n \"accuracy\": 0.1,\n \"time_ms\": 70,\n \"memory_kb\": 1360,\n \"score_of_the_acc\": -0.1292,\n \"final_rank\": 19\n }\n]","isConversational":false}}},{"rowIdx":1294,"cells":{"group_id":{"kind":"string","value":"aoj_2315_cpp"},"problem_description":{"kind":"string","value":"問題文\n影の魔女 ELSAMARIA はすべてのものに対して祈りを続ける魔女である．影に捕まったあらゆる命はこの魔女の中に引きずり込まれてしまう．\n影は触手のように動き\n美樹さやか\nを引きずり込もうと狙っている．\n美樹さやか\nはこの魔女に捕まることなく攻撃するために，魔女にとって予測の難しいでたらめな動きをすることを考えた．具体的には，まず頭の中で\n1\nから\nN\nまでの整数を一様な確率で\nK\n個作り，その合計値の距離だけ今の位置から魔女の方向へジャンプする，ということを繰り返すのである．そして魔女の位置に到達した時に攻撃するのである．\nさやか\nと魔女はある一直線上にいるとし，最初魔女は座標\n0\n，\nさやか\nは座標\nS\nの位置にいるものとする．また魔女は動かないものとする．何度ジャンプした後に魔女に最初の攻撃を与えることができるだろうか．期待値を求めよ．\n入力形式\n入力は以下の形式で与えられる．\nS\\ N\\ K\nS\nは最初に\nさやか\nがいる座標である．\nN\nは\nさやか\nが頭の中で作る整数の範囲の上限，\nK\nは\nさやか\nが\n1\n回のジャンプに用いる整数の個数である．\n出力形式\nさやか\nが魔女の位置に到達するために必要なジャンプの回数の期待値を\n1\n行に出力せよ．もし何度ジャンプしても魔女の位置へ到達できない，もしくは期待値が有限値に収まらない場合は\n-1\nと出力せよ．\n小数点以下何桁でも出力して構わないが，相対誤差あるいは絶対誤差が\n10\n-6\n未満になっていなければならない．\n制約\n-10\n9\n≤ S ≤ 10\n9\n1 ≤ N ≤ 10\n1 ≤ K ≤ 10\n入力値は全て整数である．\n入出力例\n入力例 1\n6 6 1\n出力例1\n6.00000000\n入力例 2\n-100 7 5\n出力例 2\n43.60343043\n入力例 3\n756434182 9 10\n出力例 3\n15128783.80867078\nProblem Setter: Flat35"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2315_8371789","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvector<vector<long double> > matmul(int N, const vector<vector<long double> >& mat1, const vector<vector<long double> >& mat2) {\n\tvector<vector<long double> > res(N, vector<long double>(N));\n\tfor (int i = 0; i < N; i++) {\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tfor (int k = 0; k < N; k++) {\n\t\t\t\tres[i][j] += mat1[i][k] * mat2[k][j];\n\t\t\t}\n\t\t}\n\t}\n\treturn res;\n}\n\nvoid gaussian_elimination(int N, vector<vector<long double> >& mat) {\n\tint row = 0;\n\tfor (int i = 0; i < N; i++) {\n\t\tint opt = -1;\n\t\tlong double optmag = 0.0;\n\t\tfor (int j = row; j < N; j++) {\n\t\t\tif (optmag < abs(mat[j][i])) {\n\t\t\t\topt = j;\n\t\t\t\toptmag = abs(mat[j][i]);\n\t\t\t}\n\t\t}\n\t\tif (opt == -1) {\n\t\t\tcontinue;\n\t\t}\n\t\tswap(mat[row], mat[opt]);\n\t\tdouble submul = 1.0 / mat[row][i];\n\t\tfor (int j = i + 1; j <= N; j++) {\n\t\t\tmat[row][j] *= submul;\n\t\t}\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tif (j != row) {\n\t\t\t\tdouble mul = mat[j][i];\n\t\t\t\tfor (int k = i; k <= N; k++) {\n\t\t\t\t\tmat[j][k] -= mat[row][k] * mul;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\trow += 1;\n\t}\n}\n\nlong double solve(long long S, int N, int K) {\n\t// step #1. calculate probability of transition\n\tvector<long double> prob = { 1.0 };\n\tfor (int i = 1; i <= K; i++) {\n\t\tvector<long double> nprob(N * i + 1);\n\t\tlong double s = 0.0;\n\t\tfor (int j = 0; j <= N * i; j++) {\n\t\t\tnprob[j] = s / N;\n\t\t\ts += (j <= N * (i - 1) ? prob[j] : 0.0);\n\t\t\ts -= (j >= N ? prob[j - N] : 0.0);\n\t\t}\n\t\tprob = nprob;\n\t}\n\n\t// step #2. create matrix\n\tint Z = N * K;\n\tvector<vector<long double> > mat0(2 * Z, vector<long double>(2 * Z, 0.0L));\n\tfor (int i = 0; i < Z - 1; i++) {\n\t\tmat0[i + 1][i] = 1.0L;\n\t\tmat0[Z + i + 1][Z + i] = 1.0L;\n\t}\n\tfor (int i = 0; i < Z; i++) {\n\t\tmat0[0][i] = prob[i + 1];\n\t}\n\tfor (int i = 0; i < Z; i++) {\n\t\tmat0[Z][i] = prob[i + 1];\n\t\tmat0[Z][Z + i] = prob[i + 1];\n\t}\n\t\n\t// separate by cases\n\tvector<long double> p(Z), t(Z);\n\tif (S < Z) {\n\t\tp[S] = 1.0L;\n\t\tt[S] = 0.0L;\n\t}\n\telse {\n\t\t// step #3. matrix exponentation\n\t\tvector<vector<long double> > mat1(2 * Z, vector<long double>(2 * Z));\n\t\tfor (int i = 0; i < 2 * Z; i++) {\n\t\t\tmat1[i][i] = 1.0L;\n\t\t}\n\t\tvector<vector<long double> > mat2 = mat0;\n\t\tlong long rem = S - Z;\n\t\twhile (rem >= 1) {\n\t\t\tif (rem % 2 == 1) {\n\t\t\t\tmat1 = matmul(2 * Z, mat1, mat2);\n\t\t\t}\n\t\t\tmat2 = matmul(2 * Z, mat2, mat2);\n\t\t\trem /= 2;\n\t\t}\n\t\t\n\t\t// step #4. calculate answer\n\t\tvector<long double> x(2 * Z);\n\t\tfor (int i = 0; i < 2 * Z; i++) {\n\t\t\tx[i] = mat1[i][0];\n\t\t}\n\t\tfor (int i = 0; i < Z; i++) {\n\t\t\tfor (int j = Z; j <= Z + i; j++) {\n\t\t\t\tp[i] += x[j - Z] * prob[j - i];\n\t\t\t\tt[i] += x[j - Z + Z] * prob[j - i];\n\t\t\t}\n\t\t\tt[i] += p[i];\n\t\t}\n\t}\n\n\t// step #5. compute systems of linear equation\n\tvector<vector<long double> > mat3(Z - 1, vector<long double>(Z));\n\tfor (int i = 1; i < Z; i++) {\n\t\tfor (int j = 1; j <= Z; j++) {\n\t\t\tint pos = abs(i - j);\n\t\t\tif (pos != 0) {\n\t\t\t\tmat3[i - 1][pos - 1] -= prob[j];\n\t\t\t}\n\t\t}\n\t\tmat3[i - 1][i - 1] += 1.0;\n\t\tmat3[i - 1][Z - 1] += 1.0;\n\t}\n\tgaussian_elimination(Z - 1, mat3);\n\tvector<long double> e(Z);\n\tfor (int i = 1; i < Z; i++) {\n\t\te[i] = mat3[i - 1][Z - 1];\n\t}\n\n\t// step #6. calculate answer\n\tlong double ans = 0.0;\n\tfor (int i = 0; i < Z; i++) {\n\t\tans += t[i];\n\t}\n\tfor (int i = 1; i < Z; i++) {\n\t\tans += p[i] * e[i];\n\t}\n\n\treturn ans;\n}\n\nint main() {\n\tlong long S; int N, K;\n\tcin >> S >> N >> K;\n\tS = abs(S);\n\tif (N == 1) {\n\t\tcout << (S % K == 0 ? S / K : -1) << endl;\n\t}\n\telse {\n\t\tlong double ans = solve(S, N, K);\n\t\tcout.precision(15);\n\t\tcout << fixed << ans << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":660,"memory_kb":5652,"score_of_the_acc":-0.6153,"final_rank":11},{"submission_id":"aoj_2315_7242759","code_snippet":"#include <iostream>\n#include <cmath>\n#include <algorithm>\nusing namespace std;\n\nint S, N, K;\ndouble D[19][109], E[109];\ndouble Prob1[150009];\ndouble Expc1[150009];\ndouble Prob2[7009][109];\ndouble Expc2[7009][109];\ndouble ProbList[109], ExpcList[109], ExpcSecond[109];\n\nvoid GetFirstAns(int BASE) {\n\tfor (int i = 0; i <= BASE + 200; i++) Prob1[i] = 0.0;\n\tfor (int i = 0; i <= BASE + 200; i++) Expc1[i] = 0.0;\n\tProb1[0] = 1.0;\n\tfor (int i = 1; i <= BASE + 200; i++) {\n\t\tfor (int j = 1; j <= N * K; j++) {\n\t\t\tint pre = i - j; if (pre < 0 || pre >= BASE) continue;\n\t\t\tProb1[i] += (Prob1[pre] * E[j]);\n\t\t\tExpc1[i] += (Prob1[pre] * E[j]) * (Expc1[pre] + 1.0);\n\t\t}\n\t\tif (Prob1[i] != 0.0) Expc1[i] /= Prob1[i];\n\t}\n}\n\nvoid GetSecondAns() {\n\tfor (int i = 0; i <= 7000; i++) {\n\t\tfor (int j = 0; j <= N * K; j++) Prob2[i][j] = 0.0;\n\t\tfor (int j = 0; j <= N * K; j++) Expc2[i][j] = 0.0;\n\t}\n\t\n\t// Forward DP\n\tfor (int i = 1; i <= N * K; i++) Prob2[0][i] = ProbList[i];\n\tfor (int i = 0; i < 7000; i++) {\n\t\tfor (int j = 1; j <= N * K; j++) {\n\t\t\tfor (int k = 1; k <= N * K; k++) {\n\t\t\t\tint to = abs(j - k);\n\t\t\t\tProb2[i + 1][to] += (Prob2[i][j] * E[k]);\n\t\t\t}\n\t\t}\n\t}\n\t\n\t// Reverse DP\n\tfor (int i = 6999; i >= 0; i--) {\n\t\tfor (int j = 1; j <= N * K; j++) {\n\t\t\tfor (int k = 1; k <= N * K; k++) {\n\t\t\t\tint to = abs(j - k);\n\t\t\t\tExpc2[i][j] += (1.0 * (Expc2[i + 1][to] + 1.0) * E[k]);\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\t// Input\n\tcin >> S >> N >> K; S = abs(S);\n\tif (N == 1) {\n\t\tif (S % K == 0) cout << S/ K << endl;\n\t\telse cout << \"-1\" << endl;\n\t\treturn 0;\n\t}\n\t\n\t// Prepare\n\tD[0][0] = 1.0;\n\tfor (int i = 0; i < K; i++) {\n\t\tfor (int j = 0; j < N * K; j++) {\n\t\t\tfor (int k = 1; k <= N; k++) D[i+1][j+k] += 1.0 * D[i][j] / N;\n\t\t}\n\t}\n\tfor (int i = 1; i <= N * K; i++) E[i] = D[K][i];\n\t\n\t// Get First Answer\n\tif (S <= N * K) {\n\t\tProbList[S] = 1.0;\n\t\tExpcList[S] = 0.;\n\t}\n\telse {\n\t\tdouble BASE_Expc = 1.0 / (0.5 * (N + 1) * K);\n\t\tint OFFSET = min(100000, S - N * K);\n\t\tGetFirstAns(OFFSET);\n\t\tfor (int i = 0; i <= N * K; i++) {\n\t\t\tProbList[N * K - i] = Prob1[OFFSET + i];\n\t\t\tExpcList[N * K - i] = Expc1[OFFSET + i] + 1.0 * ((S - N * K) - OFFSET) * BASE_Expc;\n\t\t}\n\t}\n\t\n\t// Get Second Answer\n\tGetSecondAns();\n\tfor (int i = 1; i <= N * K; i++) {\n\t\tExpcSecond[i] = Expc2[0][i];\n\t\t//cout << i << \" \" << ProbList[i] << \" \" << ExpcSecond[i] << endl;\n\t}\n\t\n\t// Get Final Answer\n\tdouble Answer = 0.0;\n\tfor (int i = 1; i <= N * K; i++) Answer += (ExpcList[i] + ExpcSecond[i]) * ProbList[i];\n\tprintf(\"%.12lf\\n\", Answer);\n\treturn 0;\n}","accuracy":1,"time_ms":170,"memory_kb":17084,"score_of_the_acc":-1.1056,"final_rank":12},{"submission_id":"aoj_2315_6079635","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\n#define double long double\n\n// N変数連立方程式(Ax=bの形)を解く\n//\n// 引数のAは拡大係数行列. (Ax=bでAとbをそのまま並べてつなげたもの)\n// すなわち\n// A[i][0] * x_0 + A[i][1] * x_1 + ... A[i][n - 1] * x_{n-1} = A[i][n]\n// (0 <= i < n)\n//\n//\n// 関数が終わったときにAの左側は単位行列になる\n// Note: 誤差に注意\n//\n// Verify:\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/1328/review/4927454/okuraofvegetable/C++17\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/2171/review/6045411/okuraofvegetable/C++17\n\ndouble myabs(double a) {\n if (a < 0.0) return -a;\n return a;\n}\n\nvector<double> solve_equation(vector<vector<double>> &A) {\n assert(A[0].size() == A.size() + 1);\n for (int i = 0; i < A.size(); i++) {\n if (myabs(A[i][i]) < eps) {\n for (int j = i + 1; j < A.size(); j++) {\n if (abs(A[j][i]) > eps) {\n swap(A[i], A[j]);\n break;\n }\n }\n }\n double r = A[i][i];\n if (myabs(r) < eps) {\n // dmp(r);\n return vector<double>();\n }\n for (int j = i; j <= A.size(); j++) { A[i][j] /= r; }\n for (int j = i + 1; j < A.size(); j++) {\n double s = A[j][i];\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * s; }\n }\n }\n for (int i = A.size() - 1; i > 0; i--) {\n for (int j = 0; j < i; j++) {\n double r = A[j][i];\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * r; }\n }\n }\n vector<double> sol;\n for (int i = 0; i < A.size(); i++) sol.push_back(A[i][A.size()]);\n return sol;\n}\n\n// Matrix class\n//\n// constructor of T : T(1),T(0) must be unit of T\n//\n// Verified: DDCC B\n// https://atcoder.jp/contests/ddcc2020-final/submissions/9941022\n//\n// Verified: determinant\n// https://judge.yosupo.jp/submission/45201\n//\n\ntemplate <class T>\nstruct Matrix {\n int H, W;\n vector<vector<T>> elem;\n Matrix(int H, int W, T val = T(0)) : H(H), W(W) {\n elem.resize(H);\n for (int i = 0; i < H; i++) elem[i].assign(W, val);\n }\n Matrix(const vector<vector<T>> &m)\n : H(m.size()), W(m.size() ? m[0].size() : 0) {\n elem.resize(H);\n for (int i = 0; i < H; i++) elem[i].resize(W);\n for (int i = 0; i < H; i++) elem[i] = m[i];\n }\n vector<T> &operator[](int h) { return elem[h]; }\n static Matrix identity(int N) {\n Matrix a(N, N);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (i == j)\n a.elem[i][i] = T(1);\n else\n a.elem[i][j] = T(0);\n }\n }\n return a;\n }\n Matrix operator+(const Matrix &m) const {\n assert(H == m.H && W == m.W);\n Matrix a(H, W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n a.elem[i][j] = this->elem[i][j] + m.elem[i][j];\n }\n }\n return a;\n }\n Matrix operator-(const Matrix &m) const {\n assert(H == m.H && W == m.W);\n Matrix a(H, W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n a.elem[i][j] = this->elem[i][j] - m.elem[i][j];\n }\n }\n return a;\n }\n Matrix operator*(const Matrix &m) const {\n assert(W == m.H);\n Matrix a(H, m.W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < m.W; j++) {\n for (int k = 0; k < W; k++) {\n a.elem[i][j] = a.elem[i][j] + (this->elem[i][k] * m.elem[k][j]);\n }\n }\n }\n return a;\n }\n Matrix &operator+=(const Matrix &m) { return *this = *this + m; }\n Matrix &operator-=(const Matrix &m) { return *this = *this - m; }\n Matrix &operator*=(const Matrix &m) { return *this = *this * m; }\n Matrix pow(long long x) const {\n Matrix a = identity(H);\n Matrix b = *this;\n while (x) {\n if (x & 1) a *= b;\n b *= b;\n x >>= 1;\n }\n return a;\n }\n\n T determinant() {\n Matrix m(*this);\n assert(m.W == m.H);\n T ret(1);\n for (int i = 0; i < m.H; i++) {\n int idx = -1;\n for (int j = i; j < m.H; j++) {\n if (m[j][i] != T(0)) idx = j;\n }\n if (idx == -1) return T(0);\n if (i != idx) {\n ret *= T(-1);\n swap(m[i], m[idx]);\n }\n ret *= m[i][i];\n T div = m[i][i];\n for (int j = i; j < m.W; j++) m[i][j] /= div;\n for (int j = i + 1; j < m.H; j++) {\n T a = m[j][i];\n for (int k = i; k < m.W; k++) m[j][k] -= m[i][k] * a;\n }\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const Matrix &x) {\n for (int i = 0; i < x.H; i++) {\n for (int j = 0; j < x.W; j++) {\n os << x.elem[i][j];\n if (j + 1 < x.W) cout << ' ';\n }\n if (i + 1 < x.H) cout << endl;\n }\n return os;\n }\n friend istream &operator>>(istream &is, Matrix &x) {\n for (auto &v : x.elem) is >> v;\n return is;\n }\n};\n\nvoid solve() {\n int S, N, K;\n cin >> S >> N >> K;\n if (S < 0) S *= -1;\n\n if (N == 1) {\n if (S % K == 0)\n cout << S / K << endl;\n else\n cout << -1 << endl;\n return;\n }\n\n auto dp = vect(K + 1, vect(N * K + 1, (double)0.0));\n dp[0][0] = 1.0;\n for (int i = 0; i < K; i++) {\n for (int j = 0; j <= N * K; j++) {\n for (int k = 1; k <= N; k++) {\n if (j + k <= N * K) dp[i + 1][j + k] += dp[i][j] * (1.0 / (double)N);\n }\n }\n }\n\n auto A = vect(N * K, vect(N * K + 1, (double)0.0));\n\n A[0][0] = 1.0;\n for (int i = 1; i < N * K; i++) {\n for (int j = 1; j <= N * K; j++) { A[i][abs(i - j)] += dp[K][j]; }\n A[i][i] -= 1.0;\n A[i][N * K] = -1.0;\n }\n\n // for (auto a : A) dmp(a);\n\n auto sol = solve_equation(A);\n // dmp(sol);\n if (sol.empty()) {\n cout << -1 << endl;\n return;\n }\n\n Matrix<double> M(N * K + 1, N * K + 1);\n Matrix<double> v(N * K + 1, 1);\n if (S >= N * K) {\n for (int i = 0; i < N * K; i++) { M[0][i] = dp[K][i + 1]; }\n M[0][N * K] = 1.0;\n for (int i = 1; i < N * K; i++) { M[i][i - 1] = 1.0; }\n M[N * K][N * K] = 1.0;\n M = M.pow(S - N * K + 1);\n\n for (int i = 0; i < N * K; i++) { v[N * K - 1 - i][0] = sol[i]; }\n v[N * K][0] = 1.0;\n }\n\n#undef double\n if (S < N * K) {\n cout << (double)sol[S] << endl;\n } else {\n cout << (double)(M * v)[0][0] << 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":100,"memory_kb":4080,"score_of_the_acc":-0.106,"final_rank":8},{"submission_id":"aoj_2315_6079634","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\n#define double __float128\n\n// N変数連立方程式(Ax=bの形)を解く\n//\n// 引数のAは拡大係数行列. (Ax=bでAとbをそのまま並べてつなげたもの)\n// すなわち\n// A[i][0] * x_0 + A[i][1] * x_1 + ... A[i][n - 1] * x_{n-1} = A[i][n]\n// (0 <= i < n)\n//\n//\n// 関数が終わったときにAの左側は単位行列になる\n// Note: 誤差に注意\n//\n// Verify:\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/1328/review/4927454/okuraofvegetable/C++17\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/2171/review/6045411/okuraofvegetable/C++17\n\ndouble abs(double a) {\n if (a < 0.0) return -a;\n return a;\n}\n\nvector<double> solve_equation(vector<vector<double>> &A) {\n assert(A[0].size() == A.size() + 1);\n for (int i = 0; i < A.size(); i++) {\n if (abs(A[i][i]) < eps) {\n for (int j = i + 1; j < A.size(); j++) {\n if (abs(A[j][i]) > eps) {\n swap(A[i], A[j]);\n break;\n }\n }\n }\n double r = A[i][i];\n if (abs(r) < eps) {\n // dmp(r);\n return vector<double>();\n }\n for (int j = i; j <= A.size(); j++) { A[i][j] /= r; }\n for (int j = i + 1; j < A.size(); j++) {\n double s = A[j][i];\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * s; }\n }\n }\n for (int i = A.size() - 1; i > 0; i--) {\n for (int j = 0; j < i; j++) {\n double r = A[j][i];\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * r; }\n }\n }\n vector<double> sol;\n for (int i = 0; i < A.size(); i++) sol.push_back(A[i][A.size()]);\n return sol;\n}\n\n// Matrix class\n//\n// constructor of T : T(1),T(0) must be unit of T\n//\n// Verified: DDCC B\n// https://atcoder.jp/contests/ddcc2020-final/submissions/9941022\n//\n// Verified: determinant\n// https://judge.yosupo.jp/submission/45201\n//\n\ntemplate <class T>\nstruct Matrix {\n int H, W;\n vector<vector<T>> elem;\n Matrix(int H, int W, T val = T(0)) : H(H), W(W) {\n elem.resize(H);\n for (int i = 0; i < H; i++) elem[i].assign(W, val);\n }\n Matrix(const vector<vector<T>> &m)\n : H(m.size()), W(m.size() ? m[0].size() : 0) {\n elem.resize(H);\n for (int i = 0; i < H; i++) elem[i].resize(W);\n for (int i = 0; i < H; i++) elem[i] = m[i];\n }\n vector<T> &operator[](int h) { return elem[h]; }\n static Matrix identity(int N) {\n Matrix a(N, N);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (i == j)\n a.elem[i][i] = T(1);\n else\n a.elem[i][j] = T(0);\n }\n }\n return a;\n }\n Matrix operator+(const Matrix &m) const {\n assert(H == m.H && W == m.W);\n Matrix a(H, W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n a.elem[i][j] = this->elem[i][j] + m.elem[i][j];\n }\n }\n return a;\n }\n Matrix operator-(const Matrix &m) const {\n assert(H == m.H && W == m.W);\n Matrix a(H, W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n a.elem[i][j] = this->elem[i][j] - m.elem[i][j];\n }\n }\n return a;\n }\n Matrix operator*(const Matrix &m) const {\n assert(W == m.H);\n Matrix a(H, m.W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < m.W; j++) {\n for (int k = 0; k < W; k++) {\n a.elem[i][j] = a.elem[i][j] + (this->elem[i][k] * m.elem[k][j]);\n }\n }\n }\n return a;\n }\n Matrix &operator+=(const Matrix &m) { return *this = *this + m; }\n Matrix &operator-=(const Matrix &m) { return *this = *this - m; }\n Matrix &operator*=(const Matrix &m) { return *this = *this * m; }\n Matrix pow(long long x) const {\n Matrix a = identity(H);\n Matrix b = *this;\n while (x) {\n if (x & 1) a *= b;\n b *= b;\n x >>= 1;\n }\n return a;\n }\n\n T determinant() {\n Matrix m(*this);\n assert(m.W == m.H);\n T ret(1);\n for (int i = 0; i < m.H; i++) {\n int idx = -1;\n for (int j = i; j < m.H; j++) {\n if (m[j][i] != T(0)) idx = j;\n }\n if (idx == -1) return T(0);\n if (i != idx) {\n ret *= T(-1);\n swap(m[i], m[idx]);\n }\n ret *= m[i][i];\n T div = m[i][i];\n for (int j = i; j < m.W; j++) m[i][j] /= div;\n for (int j = i + 1; j < m.H; j++) {\n T a = m[j][i];\n for (int k = i; k < m.W; k++) m[j][k] -= m[i][k] * a;\n }\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const Matrix &x) {\n for (int i = 0; i < x.H; i++) {\n for (int j = 0; j < x.W; j++) {\n os << x.elem[i][j];\n if (j + 1 < x.W) cout << ' ';\n }\n if (i + 1 < x.H) cout << endl;\n }\n return os;\n }\n friend istream &operator>>(istream &is, Matrix &x) {\n for (auto &v : x.elem) is >> v;\n return is;\n }\n};\n\nvoid solve() {\n int S, N, K;\n cin >> S >> N >> K;\n if (S < 0) S *= -1;\n\n auto dp = vect(K + 1, vect(N * K + 1, (double)0.0));\n dp[0][0] = 1.0;\n for (int i = 0; i < K; i++) {\n for (int j = 0; j <= N * K; j++) {\n for (int k = 1; k <= N; k++) {\n if (j + k <= N * K) dp[i + 1][j + k] += dp[i][j] * (1.0 / (double)N);\n }\n }\n }\n\n auto A = vect(N * K, vect(N * K + 1, (double)0.0));\n\n A[0][0] = 1.0;\n for (int i = 1; i < N * K; i++) {\n for (int j = 1; j <= N * K; j++) { A[i][abs(i - j)] += dp[K][j]; }\n A[i][i] -= 1.0;\n A[i][N * K] = -1.0;\n }\n\n // for (auto a : A) dmp(a);\n\n auto sol = solve_equation(A);\n // dmp(sol);\n if (sol.empty()) {\n cout << -1 << endl;\n return;\n }\n\n Matrix<double> M(N * K + 1, N * K + 1);\n Matrix<double> v(N * K + 1, 1);\n if (S >= N * K) {\n for (int i = 0; i < N * K; i++) { M[0][i] = dp[K][i + 1]; }\n M[0][N * K] = 1.0;\n for (int i = 1; i < N * K; i++) { M[i][i - 1] = 1.0; }\n M[N * K][N * K] = 1.0;\n M = M.pow(S - N * K + 1);\n\n for (int i = 0; i < N * K; i++) { v[N * K - 1 - i][0] = sol[i]; }\n v[N * K][0] = 1.0;\n }\n\n#undef double\n if (S < N * K) {\n cout << (double)sol[S] << endl;\n } else {\n cout << (double)(M * v)[0][0] << 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":0.1935483870967742,"time_ms":1440,"memory_kb":4148,"score_of_the_acc":-1.0547,"final_rank":18},{"submission_id":"aoj_2315_6079630","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\n#define double long double\n\n// N変数連立方程式(Ax=bの形)を解く\n//\n// 引数のAは拡大係数行列. (Ax=bでAとbをそのまま並べてつなげたもの)\n// すなわち\n// A[i][0] * x_0 + A[i][1] * x_1 + ... A[i][n - 1] * x_{n-1} = A[i][n]\n// (0 <= i < n)\n//\n//\n// 関数が終わったときにAの左側は単位行列になる\n// Note: 誤差に注意\n//\n// Verify:\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/1328/review/4927454/okuraofvegetable/C++17\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/2171/review/6045411/okuraofvegetable/C++17\n\nvector<double> solve_equation(vector<vector<double>> &A) {\n assert(A[0].size() == A.size() + 1);\n for (int i = 0; i < A.size(); i++) {\n if (abs(A[i][i]) < eps) {\n for (int j = i + 1; j < A.size(); j++) {\n if (abs(A[j][i]) > eps) {\n swap(A[i], A[j]);\n break;\n }\n }\n }\n double r = A[i][i];\n if (abs(r) < eps) {\n dmp(r);\n return vector<double>();\n }\n for (int j = i; j <= A.size(); j++) { A[i][j] /= r; }\n for (int j = i + 1; j < A.size(); j++) {\n double s = A[j][i];\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * s; }\n }\n }\n for (int i = A.size() - 1; i > 0; i--) {\n for (int j = 0; j < i; j++) {\n double r = A[j][i];\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * r; }\n }\n }\n vector<double> sol;\n for (int i = 0; i < A.size(); i++) sol.push_back(A[i][A.size()]);\n return sol;\n}\n\n// Matrix class\n//\n// constructor of T : T(1),T(0) must be unit of T\n//\n// Verified: DDCC B\n// https://atcoder.jp/contests/ddcc2020-final/submissions/9941022\n//\n// Verified: determinant\n// https://judge.yosupo.jp/submission/45201\n//\n\ntemplate <class T>\nstruct Matrix {\n int H, W;\n vector<vector<T>> elem;\n Matrix(int H, int W, T val = T(0)) : H(H), W(W) {\n elem.resize(H);\n for (int i = 0; i < H; i++) elem[i].assign(W, val);\n }\n Matrix(const vector<vector<T>> &m)\n : H(m.size()), W(m.size() ? m[0].size() : 0) {\n elem.resize(H);\n for (int i = 0; i < H; i++) elem[i].resize(W);\n for (int i = 0; i < H; i++) elem[i] = m[i];\n }\n vector<T> &operator[](int h) { return elem[h]; }\n static Matrix identity(int N) {\n Matrix a(N, N);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (i == j)\n a.elem[i][i] = T(1);\n else\n a.elem[i][j] = T(0);\n }\n }\n return a;\n }\n Matrix operator+(const Matrix &m) const {\n assert(H == m.H && W == m.W);\n Matrix a(H, W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n a.elem[i][j] = this->elem[i][j] + m.elem[i][j];\n }\n }\n return a;\n }\n Matrix operator-(const Matrix &m) const {\n assert(H == m.H && W == m.W);\n Matrix a(H, W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n a.elem[i][j] = this->elem[i][j] - m.elem[i][j];\n }\n }\n return a;\n }\n Matrix operator*(const Matrix &m) const {\n assert(W == m.H);\n Matrix a(H, m.W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < m.W; j++) {\n for (int k = 0; k < W; k++) {\n a.elem[i][j] = a.elem[i][j] + (this->elem[i][k] * m.elem[k][j]);\n }\n }\n }\n return a;\n }\n Matrix &operator+=(const Matrix &m) { return *this = *this + m; }\n Matrix &operator-=(const Matrix &m) { return *this = *this - m; }\n Matrix &operator*=(const Matrix &m) { return *this = *this * m; }\n Matrix pow(long long x) const {\n Matrix a = identity(H);\n Matrix b = *this;\n while (x) {\n if (x & 1) a *= b;\n b *= b;\n x >>= 1;\n }\n return a;\n }\n\n T determinant() {\n Matrix m(*this);\n assert(m.W == m.H);\n T ret(1);\n for (int i = 0; i < m.H; i++) {\n int idx = -1;\n for (int j = i; j < m.H; j++) {\n if (m[j][i] != T(0)) idx = j;\n }\n if (idx == -1) return T(0);\n if (i != idx) {\n ret *= T(-1);\n swap(m[i], m[idx]);\n }\n ret *= m[i][i];\n T div = m[i][i];\n for (int j = i; j < m.W; j++) m[i][j] /= div;\n for (int j = i + 1; j < m.H; j++) {\n T a = m[j][i];\n for (int k = i; k < m.W; k++) m[j][k] -= m[i][k] * a;\n }\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const Matrix &x) {\n for (int i = 0; i < x.H; i++) {\n for (int j = 0; j < x.W; j++) {\n os << x.elem[i][j];\n if (j + 1 < x.W) cout << ' ';\n }\n if (i + 1 < x.H) cout << endl;\n }\n return os;\n }\n friend istream &operator>>(istream &is, Matrix &x) {\n for (auto &v : x.elem) is >> v;\n return is;\n }\n};\n\nvoid solve() {\n int S, N, K;\n cin >> S >> N >> K;\n if (S < 0) S *= -1;\n\n auto dp = vect(K + 1, vect(N * K + 1, 0.0));\n dp[0][0] = 1.0;\n for (int i = 0; i < K; i++) {\n for (int j = 0; j <= N * K; j++) {\n for (int k = 1; k <= N; k++) {\n if (j + k <= N * K) dp[i + 1][j + k] += dp[i][j] * (1.0 / N);\n }\n }\n }\n\n auto A = vect(N * K, vect(N * K + 1, (double)0.0));\n\n A[0][0] = 1.0;\n for (int i = 1; i < N * K; i++) {\n for (int j = 1; j <= N * K; j++) { A[i][abs(i - j)] += dp[K][j]; }\n A[i][i] -= 1.0;\n A[i][N * K] = -1.0;\n }\n\n // for (auto a : A) dmp(a);\n\n auto sol = solve_equation(A);\n // dmp(sol);\n if (sol.empty()) {\n cout << -1 << endl;\n return;\n }\n\n if (S < N * K) {\n cout << sol[S] << endl;\n return;\n }\n\n Matrix<double> M(N * K + 1, N * K + 1);\n for (int i = 0; i < N * K; i++) { M[0][i] = dp[K][i + 1]; }\n M[0][N * K] = 1.0;\n for (int i = 1; i < N * K; i++) { M[i][i - 1] = 1.0; }\n M[N * K][N * K] = 1.0;\n M = M.pow(S - N * K + 1);\n\n Matrix<double> v(N * K + 1, 1);\n for (int i = 0; i < N * K; i++) { v[N * K - 1 - i][0] = sol[i]; }\n v[N * K][0] = 1.0;\n cout << (M * v)[0][0] << 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":0.1935483870967742,"time_ms":100,"memory_kb":4204,"score_of_the_acc":-0.1151,"final_rank":17},{"submission_id":"aoj_2315_6079625","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\n// N変数連立方程式(Ax=bの形)を解く\n//\n// 引数のAは拡大係数行列. (Ax=bでAとbをそのまま並べてつなげたもの)\n// すなわち\n// A[i][0] * x_0 + A[i][1] * x_1 + ... A[i][n - 1] * x_{n-1} = A[i][n]\n// (0 <= i < n)\n//\n//\n// 関数が終わったときにAの左側は単位行列になる\n// Note: 誤差に注意\n//\n// Verify:\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/1328/review/4927454/okuraofvegetable/C++17\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/2171/review/6045411/okuraofvegetable/C++17\n\nvector<double> solve_equation(vector<vector<double>> &A) {\n assert(A[0].size() == A.size() + 1);\n for (int i = 0; i < A.size(); i++) {\n if (abs(A[i][i]) < eps) {\n for (int j = i + 1; j < A.size(); j++) {\n if (abs(A[j][i]) > eps) {\n swap(A[i], A[j]);\n break;\n }\n }\n }\n double r = A[i][i];\n if (abs(r) < eps) {\n dmp(r);\n return vector<double>();\n }\n for (int j = i; j <= A.size(); j++) { A[i][j] /= r; }\n for (int j = i + 1; j < A.size(); j++) {\n double s = A[j][i];\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * s; }\n }\n }\n for (int i = A.size() - 1; i > 0; i--) {\n for (int j = 0; j < i; j++) {\n double r = A[j][i];\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * r; }\n }\n }\n vector<double> sol;\n for (int i = 0; i < A.size(); i++) sol.push_back(A[i][A.size()]);\n return sol;\n}\n\n// Matrix class\n//\n// constructor of T : T(1),T(0) must be unit of T\n//\n// Verified: DDCC B\n// https://atcoder.jp/contests/ddcc2020-final/submissions/9941022\n//\n// Verified: determinant\n// https://judge.yosupo.jp/submission/45201\n//\n\ntemplate <class T>\nstruct Matrix {\n int H, W;\n vector<vector<T>> elem;\n Matrix(int H, int W, T val = T(0)) : H(H), W(W) {\n elem.resize(H);\n for (int i = 0; i < H; i++) elem[i].assign(W, val);\n }\n Matrix(const vector<vector<T>> &m)\n : H(m.size()), W(m.size() ? m[0].size() : 0) {\n elem.resize(H);\n for (int i = 0; i < H; i++) elem[i].resize(W);\n for (int i = 0; i < H; i++) elem[i] = m[i];\n }\n vector<T> &operator[](int h) { return elem[h]; }\n static Matrix identity(int N) {\n Matrix a(N, N);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (i == j)\n a.elem[i][i] = T(1);\n else\n a.elem[i][j] = T(0);\n }\n }\n return a;\n }\n Matrix operator+(const Matrix &m) const {\n assert(H == m.H && W == m.W);\n Matrix a(H, W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n a.elem[i][j] = this->elem[i][j] + m.elem[i][j];\n }\n }\n return a;\n }\n Matrix operator-(const Matrix &m) const {\n assert(H == m.H && W == m.W);\n Matrix a(H, W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n a.elem[i][j] = this->elem[i][j] - m.elem[i][j];\n }\n }\n return a;\n }\n Matrix operator*(const Matrix &m) const {\n assert(W == m.H);\n Matrix a(H, m.W);\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < m.W; j++) {\n for (int k = 0; k < W; k++) {\n a.elem[i][j] = a.elem[i][j] + (this->elem[i][k] * m.elem[k][j]);\n }\n }\n }\n return a;\n }\n Matrix &operator+=(const Matrix &m) { return *this = *this + m; }\n Matrix &operator-=(const Matrix &m) { return *this = *this - m; }\n Matrix &operator*=(const Matrix &m) { return *this = *this * m; }\n Matrix pow(long long x) const {\n Matrix a = identity(H);\n Matrix b = *this;\n while (x) {\n if (x & 1) a *= b;\n b *= b;\n x >>= 1;\n }\n return a;\n }\n\n T determinant() {\n Matrix m(*this);\n assert(m.W == m.H);\n T ret(1);\n for (int i = 0; i < m.H; i++) {\n int idx = -1;\n for (int j = i; j < m.H; j++) {\n if (m[j][i] != T(0)) idx = j;\n }\n if (idx == -1) return T(0);\n if (i != idx) {\n ret *= T(-1);\n swap(m[i], m[idx]);\n }\n ret *= m[i][i];\n T div = m[i][i];\n for (int j = i; j < m.W; j++) m[i][j] /= div;\n for (int j = i + 1; j < m.H; j++) {\n T a = m[j][i];\n for (int k = i; k < m.W; k++) m[j][k] -= m[i][k] * a;\n }\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const Matrix &x) {\n for (int i = 0; i < x.H; i++) {\n for (int j = 0; j < x.W; j++) {\n os << x.elem[i][j];\n if (j + 1 < x.W) cout << ' ';\n }\n if (i + 1 < x.H) cout << endl;\n }\n return os;\n }\n friend istream &operator>>(istream &is, Matrix &x) {\n for (auto &v : x.elem) is >> v;\n return is;\n }\n};\n\nvoid solve() {\n int S, N, K;\n cin >> S >> N >> K;\n if (S < 0) S *= -1;\n\n auto dp = vect(K + 1, vect(N * K + 1, 0.0));\n dp[0][0] = 1.0;\n for (int i = 0; i < K; i++) {\n for (int j = 0; j <= N * K; j++) {\n for (int k = 1; k <= N; k++) {\n if (j + k <= N * K) dp[i + 1][j + k] += dp[i][j] * (1.0 / N);\n }\n }\n }\n\n auto A = vect(N * K, vect(N * K + 1, 0.0));\n\n A[0][0] = 1.0;\n for (int i = 1; i < N * K; i++) {\n for (int j = 1; j <= N * K; j++) { A[i][abs(i - j)] += dp[K][j]; }\n A[i][i] -= 1.0;\n A[i][N * K] = -1.0;\n }\n\n // for (auto a : A) dmp(a);\n\n auto sol = solve_equation(A);\n // dmp(sol);\n if (sol.empty()) {\n cout << -1 << endl;\n return;\n }\n\n if (S < N * K) {\n cout << sol[S] << endl;\n return;\n }\n\n Matrix<double> M(N * K + 1, N * K + 1);\n for (int i = 0; i < N * K; i++) { M[0][i] = dp[K][i + 1]; }\n M[0][N * K] = 1.0;\n for (int i = 1; i < N * K; i++) { M[i][i - 1] = 1.0; }\n M[N * K][N * K] = 1.0;\n M = M.pow(S - N * K + 1);\n\n Matrix<double> v(N * K + 1, 1);\n for (int i = 0; i < N * K; i++) { v[N * K - 1 - i][0] = sol[i]; }\n v[N * K][0] = 1.0;\n cout << (M * v)[0][0] << 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":0.1935483870967742,"time_ms":30,"memory_kb":3836,"score_of_the_acc":-0.0389,"final_rank":16},{"submission_id":"aoj_2315_5958475","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=105,INF=1<<29;\n\nconst double eps=1e-8;\ntypedef vector<double> vec;\ntypedef vector<vec> mat;\n\nvec gauss_jordan(const mat& A,const vec &b){\n int n=A.size();\n mat B(n,vec(n+1));\n \n for(int i=0;i<n;i++) for(int j=0;j<n;j++) B[i][j]=A[i][j];\n \n for(int i=0;i<n;i++) B[i][n]=b[i];\n \n for(int i=0;i<n;i++){\n int pivot=i;\n for(int j=i;j<n;j++){\n if(abs(B[j][i])>abs(B[pivot][i])) pivot=j;\n }\n swap(B[i],B[pivot]);\n \n if(abs(B[i][i])<eps) return vec();\n \n for(int j=i+1;j<=n;j++) B[i][j]/=B[i][i];\n for(int j=0;j<n;j++){\n if(i!=j){\n for(int k=i+1;k<=n;k++) B[j][k]-=B[j][i]*B[i][k];\n }\n }\n }\n \n vec x(n);\n \n for(int i=0;i<n;i++) x[i]=B[i][n];\n return x;\n}\n\nmat mul(mat &A, mat&B){\n mat C(A.size(),vec(B[0].size()));\n for(int i=0;i<A.size();i++){\n for(int k=0;k<B.size();k++){\n for(int j=0;j<B[0].size();j++){\n C[i][j]+=A[i][k]*B[k][j];\n }\n }\n }\n return C;\n}\n\nmat pow(mat A,ll n){\n mat B(A.size(),vec(A.size()));\n for(int i=0;i<A.size();i++){\n B[i][i]=1;\n }\n \n while(n>0){\n if(n&1) B=mul(B,A);\n A=mul(A,A);\n n/=2;\n }\n return B;\n}\n\n\ndouble dp[MAX][MAX];\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int S,N,K;cin>>S>>N>>K;\n S=abs(S);\n if(S==0){\n cout<<0<<endl;\n return 0;\n }\n if(N==1){\n if(S%K==0) cout<<S/K<<endl;\n else cout<<-1<<endl;\n return 0;\n }\n \n dp[0][0]=1;\n for(int i=0;i<K;i++){\n for(int j=0;j<=i*N;j++){\n for(int k=1;k<=N;k++){\n dp[i+1][j+k]+=dp[i][j]/N;\n }\n }\n }\n \n mat A(N*K+1,vec(N*K+1));\n vec B(N*K+1,1);\n A[0][0]=1;\n B[0]=0;\n \n for(int i=1;i<=N*K;i++){\n A[i][i]=1;\n for(int j=1;j<=N*K;j++){\n A[i][abs(i-j)]-=dp[K][j];\n }\n }\n \n auto C=gauss_jordan(A,B);\n \n if(S<=N*K){\n cout<<fixed<<setprecision(25)<<C[S]<<endl;\n return 0;\n }\n \n mat D(N*K+1,vec(N*K+1));\n for(int j=0;j<N*K;j++) D[0][j]=dp[K][j+1];\n D[0][N*K]=1;\n for(int i=1;i<N*K;i++){\n D[i][i-1]=1;\n }\n D[N*K][N*K]=1;\n \n D=pow(D,S-1);\n \n mat E(N*K+1,vec(1));\n for(int i=0;i<N*K;i++) E[i][0]=C[N*K-i];\n E[N*K][0]=1;\n \n auto F=mul(D,E);\n \n cout<<fixed<<setprecision(25)<<F[N*K-1][0]<<endl;\n \n \n}","accuracy":1,"time_ms":20,"memory_kb":3936,"score_of_the_acc":-0.0392,"final_rank":5},{"submission_id":"aoj_2315_5875615","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nvector<vector<double>> matrix_multiplication(vector<vector<double>> &A, vector<vector<double>> &B){\n int N = A.size();\n vector<vector<double>> C(N, vector<double>(N, 0));\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[i][k] += A[i][j] * B[j][k];\n }\n }\n }\n return C;\n}\nvector<vector<double>> matrix_exponentiation(vector<vector<double>> &A, int x){\n int N = A.size();\n vector<vector<double>> B(N, vector<double>(N, 0));\n for (int i = 0; i < N; i++){\n B[i][i] = 1;\n }\n while (x > 0){\n if (x % 2 == 1){\n B = matrix_multiplication(B, A);\n }\n A = matrix_multiplication(A, A);\n x /= 2;\n }\n return B;\n}\nint main(){\n cout << fixed << setprecision(20);\n int S, N, K;\n cin >> S >> N >> K;\n if (N == 1){\n if (S % K != 0){\n cout << -1 << endl;\n } else {\n cout << abs(S) / K << endl;\n }\n } else {\n vector<vector<double>> dp(K + 1, vector<double>(N * K + 1, 0));\n dp[0][0] = 1;\n for (int i = 0; i < K; i++){\n for (int j = i; j <= i * N; j++){\n for (int k = 1; k <= N; k++){\n dp[i + 1][j + k] += dp[i][j] / N;\n }\n }\n }\n vector<vector<double>> A(N * K, vector<double>(N * K + 1, 0));\n for (int i = 0; i < N * K; i++){\n A[i][i] = 1;\n if (i > 0){\n A[i][N * K] = 1;\n for (int j = K; j <= N * K; j++){\n int i2 = abs(i - j);\n A[i][i2] -= dp[K][j];\n }\n }\n }\n for (int i = 0; i < N * K; i++){\n int p = i;\n for (int j = i + 1; j < N * K; j++){\n if (abs(A[j][i]) > abs(A[p][i])){\n p = j;\n }\n }\n swap(A[i], A[p]);\n for (int j = N * K; j >= i; j--){\n A[i][j] /= A[i][i];\n }\n for (int j = 0; j < N * K; j++){\n if (j != i){\n for (int k = N * K; k >= i; k--){\n A[j][k] -= A[j][i] * A[i][k];\n }\n }\n }\n }\n vector<double> B(N * K);\n for (int i = 0; i < N * K; i++){\n B[i] = A[i][N * K];\n }\n S = abs(S);\n if (S < N * K){\n cout << B[S] << endl;\n } else {\n vector<vector<double>> M(N * K + 1, vector<double>(N * K + 1, 0));\n for (int i = K; i <= N * K; i++){\n M[i - 1][0] = dp[K][i];\n }\n M[N * K][0] = 1;\n for (int i = 1; i < N * K; i++){\n M[i - 1][i] = 1;\n }\n M[N * K][N * K] = 1;\n M = matrix_exponentiation(M, S - N * K + 1);\n double ans = 0;\n for (int i = 0; i < N * K; i++){\n ans += M[i][0] * B[N * K - 1 - i];\n }\n ans += M[N * K][0];\n cout << ans << endl;\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3772,"score_of_the_acc":-0.0272,"final_rank":4},{"submission_id":"aoj_2315_5875592","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nvector<vector<double>> matrix_multiplication(vector<vector<double>> &A, vector<vector<double>> &B){\n int N = A.size();\n vector<vector<double>> C(N, vector<double>(N, 0));\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[i][k] += A[i][j] * B[j][k];\n }\n }\n }\n return C;\n}\nvector<vector<double>> matrix_exponentiation(vector<vector<double>> &A, int x){\n int N = A.size();\n vector<vector<double>> B(N, vector<double>(N, 0));\n for (int i = 0; i < N; i++){\n B[i][i] = 1;\n }\n while (x > 0){\n if (x % 2 == 1){\n B = matrix_multiplication(B, A);\n }\n A = matrix_multiplication(A, A);\n x /= 2;\n }\n return B;\n}\nint main(){\n cout << fixed << setprecision(5);\n int S, N, K;\n cin >> S >> N >> K;\n vector<vector<double>> dp(K + 1, vector<double>(N * K + 1, 0));\n dp[0][0] = 1;\n for (int i = 0; i < K; i++){\n for (int j = i; j <= i * N; j++){\n for (int k = 1; k <= N; k++){\n dp[i + 1][j + k] += dp[i][j] / N;\n }\n }\n }\n vector<vector<double>> A(N * K, vector<double>(N * K + 1, 0));\n for (int i = 0; i < N * K; i++){\n A[i][i] = 1;\n if (i > 0){\n A[i][N * K] = 1;\n for (int j = K; j <= N * K; j++){\n int i2 = abs(i - j);\n A[i][i2] -= dp[K][j];\n }\n }\n }\n for (int i = 0; i < N * K; i++){\n int p = i;\n for (int j = i + 1; j < N * K; j++){\n if (abs(A[j][i]) > abs(A[p][i])){\n p = j;\n }\n }\n swap(A[i], A[p]);\n for (int j = N * K; j >= i; j--){\n A[i][j] /= A[i][i];\n }\n for (int j = 0; j < N * K; j++){\n if (j != i){\n for (int k = N * K; k >= i; k--){\n A[j][k] -= A[j][i] * A[i][k];\n }\n }\n }\n }\n vector<double> B(N * K);\n for (int i = 0; i < N * K; i++){\n B[i] = A[i][N * K];\n }\n S = abs(S);\n if (S < N * K){\n cout << B[S] << endl;\n } else {\n vector<vector<double>> M(N * K + 1, vector<double>(N * K + 1, 0));\n for (int i = K; i <= N * K; i++){\n M[i - 1][0] = dp[K][i];\n }\n M[N * K][0] = 1;\n for (int i = 1; i < N * K; i++){\n M[i - 1][i] = 1;\n }\n M[N * K][N * K] = 1;\n M = matrix_exponentiation(M, S - N * K + 1);\n double ans = 0;\n for (int i = 0; i < N * K; i++){\n ans += M[i][0] * B[N * K - 1 - i];\n }\n ans += M[N * K][0];\n cout << ans << endl;\n }\n}","accuracy":0.1935483870967742,"time_ms":20,"memory_kb":3864,"score_of_the_acc":-0.0339,"final_rank":15},{"submission_id":"aoj_2315_5868209","code_snippet":"/*\tauthor: Kite_kuma\n\tcreated: 2021.09.10 16:11:11 */\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 geometry_light\n\nusing Real = long double;\nusing R = Real;\nusing Point = std::complex<Real>;\nusing Vec = Point;\nconst Real EPS = 1e-10, PI = acos(-1);\n\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\n/*\n\t-1: a < b\n\t0 : a == b\n\t1 : a > b\n*/\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\n\nnamespace std {\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\n} // namespace std\n\nstd::istream &operator>>(std::istream &is, Point &p) {\n\tReal a, b;\n\tis >> a >> b;\n\tp = Point(a, b);\n\treturn is;\n}\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \" \" << p.imag(); }\n\n// rotate point 'p' for counter clockwise direction\nconst Point rotate(const Real &theta, const Point &p) {\n\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\n\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\n\n// get angle a-b-c (<pi)\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\n\tconst Point v(a - b), w(c - b);\n\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\n\treturn std::min(theta, 2 * PI - theta);\n}\n\nnamespace std {\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\n} // namespace std\n\nstruct Line {\n\tPoint a, b;\n\n\tLine() = default;\n\n\tLine(Point a, Point b) : a(a), b(b) {}\n\n\tLine(Real A, Real B, Real C) // Ax + By = C\n\t{\n\t\tif(eq(A, 0))\n\t\t\ta = Point(0, C / B), b = Point(1, C / B);\n\t\telse if(eq(B, 0))\n\t\t\tb = Point(C / A, 0), b = Point(C / A, 1);\n\t\telse\n\t\t\ta = Point(0, C / B), b = Point(C / A, 0);\n\t}\n\n\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \" -- \" << p.b; }\n\n\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\n};\n\nstruct Segment : Line {\n\tSegment() = default;\n\n\tSegment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n\tPoint p;\n\tReal r;\n\n\tCircle() = default;\n\n\tCircle(Point p, Real r) : p(p), r(r) {}\n};\n\nusing Points = std::vector<Point>;\nusing Polygon = std::vector<Point>;\nusing Segments = std::vector<Segment>;\nusing Lines = std::vector<Line>;\nusing Circles = std::vector<Circle>;\n\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\nconst int ccw(const Point &a, Point b, Point c) {\n\tb = b - a, c = c - a;\n\tif(cross(b, c) > EPS) return +1;\t\t// \"COUNTER_CLOCKWISE\"\n\tif(cross(b, c) < -EPS) return -1;\t\t// \"CLOCKWISE\"\n\tif(dot(b, c) < -EPS) return +2;\t\t\t// \"ONLINE_BACK\"\n\tif(norm(b) + EPS < norm(c)) return -2;\t// \"ONLINE_FRONT\"\n\treturn 0;\t\t\t\t\t\t\t\t// \"ON_SEGMENT\"\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\nPoint projection(const Line &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n\treturn l.a + (l.a - l.b) * t;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\n\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\n\nint intersect(const Line &l, const Line &m) {\n\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\n\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\n}\n\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\n\nint intersect(const Line &l, const Segment &s) {\n\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\n\treturn 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\nint intersect(const Circle &c, const Line &l) {\n\tReal d = c.r - distance(l, c.p);\n\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\n}\n\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\nint intersect(const Segment &s, const Segment &t) {\n\tif(eq(s.a, s.b)) return intersect(t, s.a);\n\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\n\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\n\t\treturn -1;\n\treturn int(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\tconst Point h = projection(l, c.p);\n\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\n\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\n\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\n\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\n\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\n}\n\nReal distance(const Point &a, const Point &b);\n\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\n\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\n\tint com = compare(r1 + r2, d);\n\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\n\t// if(c1.r < c2.r) swap(c1, c2);\n\t// Real d = abs(c1.p - c2.p);\n\t// if(compare(c1.r + c2.r, d) == -1) return 4;\n\t// if(eq(c1.r + c2.r, d)) return 3;\n\t// if(compare(c1.r - c2.r, d) == -1) return 2;\n\t// return int(eq(c1.r - c2.r, d));\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\n\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\n\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\n\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\n\nReal distance(const Segment &s, const Point &p) {\n\tPoint r = projection(s, p);\n\treturn intersect(s, r) ? distance(r, p) : std::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\tif(intersect(a, b)) return 0;\n\treturn std::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\tif(intersect(l, s)) return 0;\n\treturn std::min(distance(l, s.a), distance(l, s.b));\n}\n\nPoint crosspoint(const Line &l, const Line &m) {\n\tReal A = cross(l.b - l.a, m.b - m.a);\n\tReal B = cross(l.b - l.a, l.b - m.a);\n\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\n\treturn 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) { return crosspoint(Line(l), Line(m)); }\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\n\tPoint pr = projection(l, c.p);\n\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\n\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\n\treturn make_pair(pr - v, pr + v);\n\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\n\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\n\t// return {pr - e * base, pr + e * base};\n}\n\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\n\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\n\tauto ret = crosspoint(c, Line(l.a, l.b));\n\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\n\t\tret.second = ret.first;\n\telse\n\t\tret.first = ret.second;\n\treturn ret;\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\n\tReal d = abs(c1.p - c2.p);\n\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\n\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n\treturn make_pair(p1, p2);\n}\n\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\n// \"点 p を通る円 c の接線\"の接点2つ\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\n\treturn 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\tLines ret;\n\tif(c1.r < c2.r) std::swap(c1, c2);\n\tReal g = norm(c1.p - c2.p);\n\tif(eq(g, 0)) return ret;\n\tVec u = (c2.p - c1.p) / Real(sqrt(g));\n\tVec v = rotate(PI * 0.5, u);\n\tfor(int s : {-1, 1}) {\n\t\tReal h = (c1.r + s * c2.r) / sqrt(g);\n\t\tif(eq(1 - h * h, 0)) {\n\t\t\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\n\t\t} else if(1 - h * h > 0) {\n\t\t\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\n\t\t\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\n\t\t\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\n\t\t}\n\t}\n\treturn ret;\n}\n\n#pragma endregion\n\n#pragma region matrix\n\ntemplate <typename T>\nstruct Matrix {\n\tstd::vector<std::vector<T>> A;\n\n private:\n\tstatic Matrix I(size_t n) {\n\t\tMatrix mat(n);\n\t\tfor(int i = 0; i < n; i++) mat[i][i] = 1;\n\t\treturn mat;\n\t}\n\n public:\n\tMatrix() = default;\n\n\tMatrix(std::vector<std::vector<T>> &vvec) { A = vvec; }\n\n\tMatrix(size_t n, size_t m) : A(n, std::vector<T>(m, 0)) {}\n\n\tMatrix(size_t n, size_t m, T init) : A(n, std::vector<T>(m, init)) {}\n\n\tMatrix(size_t n, std::vector<T> &vec) : A(n, vec) {}\n\n\tMatrix(size_t n) : A(n, std::vector<T>(n, 0)) {}\n\n\tint height() const { return A.size(); }\n\n\tint width() const { return A[0].size(); }\n\n\tinline const std::vector<T> &operator[](int k) const { return A[k]; }\n\n\tinline std::vector<T> &operator[](int k) { return A[k]; }\n\n\tMatrix &operator+=(const Matrix &B) {\n\t\tsize_t n = height(), m = width();\n\t\tassert(n == B.height() && m == B.width());\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++) (*this)[i][j] += B[i][j];\n\t\treturn *this;\n\t}\n\n\tMatrix &operator-=(const Matrix &B) {\n\t\tsize_t n = height(), m = width();\n\t\tassert(n == B.height() && m == B.width());\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++) (*this)[i][j] -= B[i][j];\n\t\treturn *this;\n\t}\n\n\tMatrix &operator*=(const Matrix &B) {\n\t\tsize_t n = height(), m = B.width(), p = width();\n\t\tassert(p == B.height());\n\t\tstd::vector<std::vector<T>> C(n, std::vector<T>(m, 0));\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\tfor(int k = 0; k < p; k++) C[i][j] += (*this)[i][k] * B[k][j];\n\t\tA.swap(C);\n\t\treturn (*this);\n\t}\n\n\tMatrix &operator^=(long long k) {\n\t\tMatrix B = Matrix::I(height());\n\t\twhile(k > 0) {\n\t\t\tif(k & 1) B *= (*this);\n\t\t\t*this *= *this;\n\t\t\tk >>= 1;\n\t\t}\n\t\tA.swap(B.A);\n\t\treturn *this;\n\t}\n\n\tbool operator==(const Matrix &B) {\n\t\tsize_t n = height(), m = width();\n\t\tif(n != B.height() or m != B.width()) return false;\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\tif((*this)[i][j] != B[i][j]) return false;\n\t\treturn true;\n\t}\n\n\tMatrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }\n\n\tMatrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }\n\n\tMatrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }\n\n\tMatrix operator^(const long long k) const { return (Matrix(*this) ^= k); }\n\n\tMatrix &operator+=(const T &t) {\n\t\tint n = height(), m = width();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++) (*this)[i][j] += t;\n\t\treturn *this;\n\t}\n\n\tMatrix &operator-=(const T &t) {\n\t\tint n = height(), m = width();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++) (*this)[i][j] -= t;\n\t\treturn *this;\n\t}\n\n\tMatrix &operator*=(const T &t) {\n\t\tint n = height(), m = width();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++) (*this)[i][j] *= t;\n\t\treturn *this;\n\t}\n\n\tMatrix &operator/=(const T &t) {\n\t\tint n = height(), m = width();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++) (*this)[i][j] /= t;\n\t\treturn *this;\n\t}\n\n\tMatrix operator+(const T &t) const { return (Matrix(*this) += t); }\n\n\tMatrix operator-(const T &t) const { return (Matrix(*this) -= t); }\n\n\tMatrix operator*(const T &t) const { return (Matrix(*this) *= t); }\n\n\tMatrix operator/(const T &t) const { return (Matrix(*this) /= t); }\n\n\tfriend std::ostream &operator<<(std::ostream &os, Matrix &p) {\n\t\tsize_t n = p.height(), m = p.width();\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tos << '[';\n\t\t\tfor(int j = 0; j < m; j++) os << p[i][j] << (j == m - 1 ? \"]\\n\" : \",\");\n\t\t}\n\t\treturn (os);\n\t}\n\n\tT determinant() {\n\t\tMatrix B(*this);\n\t\tsize_t n = height(), m = width();\n\t\tassert(n == m);\n\t\tT ret = 1;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint idx = -1;\n\t\t\tfor(int j = i; j < n; j++)\n\t\t\t\tif(B[j][i] != 0) idx = j;\n\t\t\tif(idx == -1) return 0;\n\t\t\tif(i != idx) {\n\t\t\t\tret *= -1;\n\t\t\t\tswap(B[i], B[idx]);\n\t\t\t}\n\t\t\tret *= B[i][i];\n\t\t\tT vv = B[i][i];\n\t\t\tfor(int j = 0; j < n; j++) B[i][j] /= vv;\n\t\t\tfor(int j = i + 1; j < n; j++) {\n\t\t\t\tT a = B[j][i];\n\t\t\t\tfor(int k = 0; k < n; k++) {\n\t\t\t\t\tB[j][k] -= B[i][k] * a;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n};\n\n#pragma endregion\n\nld solve(ll s) {\n\ts = abs(s);\n\tint n, k;\n\tcin >> n >> k;\n\tif(!s) return 0;\n\tif(n == 1) {\n\t\tif(s % k != 0) return -1;\n\t\treturn s / k;\n\t}\n\n\tint jump_max = n * k;\n\n\tV<ld> jump_prob(jump_max + 1);\n\tjump_prob[0] = 1.;\n\n\trep(k) {\n\t\tauto tmp = jump_prob;\n\t\ttmp.assign(jump_max + 1, 0);\n\t\trep(from, jump_max + 1) {\n\t\t\trep(leap_len, 1, n + 1) {\n\t\t\t\tif(from + leap_len <= jump_max) {\n\t\t\t\t\ttmp[from + leap_len] += jump_prob[from] / n;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tswap(tmp, jump_prob);\n\t}\n\n\tVV<ld> mat(jump_max, V<ld>(jump_max));\n\n\trep(from, 1, jump_max) {\n\t\trep(leap_len, 1, jump_max + 1) {\n\t\t\tint to = abs(from - leap_len);\n\t\t\tif(to) {\n\t\t\t\tauto &tmp = mat[from][to];\n\t\t\t\ttmp += jump_prob[leap_len];\n\t\t\t}\n\t\t}\n\t}\n\n\trep(i, 1, jump_max) rep(j, 1, jump_max) { mat[i][j] = bool(i == j) - mat[i][j]; }\n\n\tmat.erase(mat.begin());\n\tfoa(t, mat) t.erase(t.begin());\n\n\tV<ld> res(jump_max - 1, 1.);\n\n\tint len = jump_max - 1;\n\n\tld EPS = 1e-5;\n\tauto nonzero = [&](ld a) { return abs(a) > EPS; };\n\n\tauto mult_row = [&](int row_idx, ld mult) {\n\t\trep(j, len) { mat[row_idx][j] *= mult; }\n\t\tres[row_idx] *= mult;\n\t\treturn;\n\t};\n\n\tauto make_one = [&](int row_idx, int col_idx) {\n\t\tassert(mat[row_idx][col_idx] != 0);\n\t\tmult_row(row_idx, 1. / mat[row_idx][col_idx]);\n\t\tmat[row_idx][col_idx] = 1;\n\t\treturn;\n\t};\n\n\tauto add_mult = [&](int row_from, int row_to, ld mult) {\n\t\trep(j, len) { mat[row_to][j] += mat[row_from][j] * mult; }\n\t\tres[row_to] += res[row_from] * mult;\n\t\treturn;\n\t};\n\n\tauto swap_row = [&](int i, int j) {\n\t\tswap(mat[i], mat[j]);\n\t\tswap(res[i], res[j]);\n\t\treturn;\n\t};\n\n\tauto find_nonzero = [&](int col_idx, int row_start) {\n\t\trep(i, row_start, len) {\n\t\t\tif(nonzero(mat[i][col_idx])) return i;\n\t\t}\n\t\treturn -1;\n\t};\n\n\tdebug(len);\n\trep(col, len) {\n\t\tauto idx = find_nonzero(col, col);\n\t\tif(idx < 0) {\n\t\t\tcontinue;\n\t\t}\n\t\tif(idx != col) swap_row(idx, col);\n\t\tmake_one(col, col);\n\t\trep(row, len) {\n\t\t\tif(col != row) {\n\t\t\t\tadd_mult(col, row, -mat[row][col]);\n\t\t\t}\n\t\t}\n\t}\n\n\tdebug(res);\n\n\tres.insert(res.begin(), 0.);\n\tres.insert(res.begin(), 1.);\n\n\tif(s < n * k) return res[s + 1];\n\tMatrix<ld> a(n * k + 1);\n\n\trep(i, 1, n * k) { a[i][i + 1] = 1; }\n\ta[0][0] = 1;\n\ta[n * k][0] = 1;\n\trep(i, 1, n * k + 1) { a[n * k][i] = jump_prob[n * k - i + 1]; }\n\n\tdebug(jump_prob);\n\tMatrix<ld> b(n * k + 1, 1);\n\trep(i, n * k + 1) b[i][0] = res[i];\n\n\tdebug(a.A, b.A, s);\n\n\ta ^= s;\n\n\tdebug(a.A);\n\ta *= b;\n\n\tdebug(a.A);\n\n\treturn a[1][0];\n\n\t// return;\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\tld res = solve((ll)n);\n\t\tif(res < -0.5)\n\t\t\tcout << \"-1\" << dl;\n\t\telse\n\t\t\tcout << res << dl;\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3760,"score_of_the_acc":-0.0756,"final_rank":6},{"submission_id":"aoj_2315_5454161","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<unordered_set>\n#include<utility>\n#include<cassert>\n#include<complex>\n#include<numeric>\n#include<array>\nusing namespace std;\n\n//#define int long long\ntypedef long long ll;\n\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconstexpr ll mod = 1000000007;\nconst ll INF = mod * mod;\ntypedef pair<int, int>P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\n#define all(v) (v).begin(),(v).end()\ntypedef pair<ll, ll> LP;\ntypedef long double ld;\ntypedef pair<ld, ld> LDP;\nconst ld eps = 1e-12;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 1;\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\ntypedef long double 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//no verify\nint rankMat(mat a) {\n\tconst int n = a.size(), m = a[0].size();\n\tint r = 0;\n\tfor (int i = 0; r < n && i < m; ++i) {\n\t\tint pivot = r;\n\t\tfor (int j = r + 1; j < n; ++j)\n\t\t\tif (abs(a[j][i]) > abs(a[pivot][i]))pivot = j;\n\t\tswap(a[pivot], a[r]);\n\t\tif (is_zero(a[r][i]))continue;\n\t\tfor (int k = m - 1; k >= i; --k)\n\t\t\ta[r][k] = a[r][k] / a[r][i];\n\t\tfor (int j = r + 1; j < n; ++j) {\n\t\t\tfor (int k = m - 1; k >= i; --k) {\n\t\t\t\ta[j][k] = fma(-a[r][k], a[j][i], a[j][k]);\n\t\t\t}\n\t\t}\n\t\t++r;\n\t}\n\treturn r;\n}\nmat scalar(int sz, Data k) {\n\tmat ret(sz, Array(sz, 0));\n\trep(i, sz)ret[i][i] = k;\n\treturn ret;\n}\n//行列累乗\nmat operator^(const mat& lhs, const ll n) {\n\tif (n == 0)return scalar(lhs.size(), 1);\n\tmat ret = (lhs * lhs) ^ (n / 2);\n\tif (n % 2) {\n\t\tret = ret * lhs;\n\t}\n\treturn ret;\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\tfor (int j = i + 1; j < n; ++j) {\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] / a[i][i];\n\t\t\t}\n\t\t}\n\t}\n\treturn D;\n}\n\npair<mat, vector<int>> LUPDecomposition(mat a) {\n\tint n = a.size();\n\tvector<int> perm(n);\n\tiota(begin(perm), end(perm), 0);\n\trep(i, n) {\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\tswap(a[pivot], a[i]);\n\t\tswap(perm[pivot], perm[i]);\n\t\tfor (int j = i + 1; j < n; ++j) {\n\t\t\ta[j][i] /= a[i][i];\n\t\t\tfor (int k = i + 1; k < n; ++k) {\n\t\t\t\ta[j][k] -= a[i][k] * a[j][i];\n\t\t\t}\n\t\t}\n\t}\n\treturn make_pair(a, perm);\n}\nArray LUPBackSubstitution(mat& LU, vector<int>& perm, Array a) {\n\tint n = LU.size();\n\tArray tmp(n);\n\trep(i, n)tmp[i] = a[perm[i]];\n\tswap(tmp, a);\n\trep(i, n) {\n\t\trep(j, i) {\n\t\t\ta[i] -= a[j] * LU[i][j];\n\t\t}\n\t}\n\tfor (int i = n - 1; i >= 0; --i) {\n\t\tfor (int j = i + 1; j < n; ++j) {\n\t\t\ta[i] -= a[j] * LU[i][j];\n\t\t}\n\t\ta[i] /= LU[i][i];\n\t}\n\treturn a;\n}\n\n//Ax=bのxを返す\nArray calc(mat A, Array b) {\n\tpair<mat, vector<int>> p = LUPDecomposition(A);\n\treturn LUPBackSubstitution(p.first, p.second, b);\n}\n\nld dp[11][101];\nvoid solve() {\n\tint x; cin >> x;\n\tint n, k; cin >> k >> n;\n\tif (k == 1) {\n\t\tx = abs(x);\n\t\tif (x % n == 0) {\n\t\t\tcout << x / n << \"\\n\";\n\t\t}\n\t\telse {\n\t\t\tcout << -1 << \"\\n\";\n\t\t}\n\t\treturn;\n\t}\n\tdp[0][0] = 1;\n\trep(i, n) {\n\t\trep(j, 10 * i + 1) {\n\t\t\trep1(t, k) {\n\t\t\t\tdp[i + 1][j + t] += dp[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tld b = 1; rep(i, n)b *= k;\n\trep(i, 101)dp[n][i] /= b;\n\t//for (int c = n; c <= n * k; c++)cout << dp[n][c] << \"\\n\";\n\tmat A(n * k, vector<ld>(n * k));\n\tvector<ld> ori(n * k, 1);\n\trep1(i, n * k) {\n\t\tA[i - 1][i - 1] += 1;\n\t\tfor (int c = n; c <= n * k; c++) {\n\t\t\tint t = i - c;\n\t\t\tt = abs(t);\n\t\t\tif (t > 0) {\n\t\t\t\tA[i - 1][t - 1] -= dp[n][c];\n\t\t\t}\n\t\t}\n\t}\n\tvector<ld> z = calc(A, ori);\n\tz.insert(z.begin(), 0);\n\tx = abs(x);\n\tif (x < z.size()) {\n\t\tcout << z[x] << \"\\n\"; return;\n\t}\n\tmat B(n * k + 1, vector<ld>(n * k + 1));\n\trep1(i, n * k - 1) {\n\t\tB[i][i - 1] = 1;\n\t}\n\tfor (int c = n; c <= n * k; c++) {\n\t\tB[0][c - 1] = dp[n][c];\n\t}\n\tB[0][n * k] = 1;\n\tB[n * k][n * k] = 1;\n\tB = B ^ (int)(x - z.size() + 1);\n\treverse(all(z));\n\tz[n * k] = 1;\n\tld ans = 0;\n\trep(i, n * k + 1) {\n\t\tans += B[0][i] * z[i];\n\t}\n\n\tcout << ans << \"\\n\";\n}\n\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcout << fixed << setprecision(12);\n\t//init_f();\n\t//init();\n\t//expr();\n\t//int t; cin >> t;rep(i,t)\n\t//while(cin>>n,n)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":8644,"score_of_the_acc":-0.4255,"final_rank":10},{"submission_id":"aoj_2315_5144211","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <string>\n#include <algorithm>\n#include <utility>\n#include <complex>\n#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\n#define chmin(x, y) (x) = min((x), (y))\n#define chmax(x, y) (x) = max((x), (y))\n#define all(x) (x).begin(),(x).end()\n#define inf 1e18\n\nusing namespace std;\n\ntypedef long long llint;\ntypedef long long ll;\ntypedef pair<llint, llint> P;\n\nstruct Matrix{\n\tint h, w;\n\tvector<double> mat;\n\tMatrix(){\n\t\th = w = 0;\n\t}\n\tMatrix(int h, int w){\n\t\tthis->h = h, this->w = w;\n\t\tmat.resize(h*w);\n\t}\n\tdouble& at(int i, int j){\n\t\treturn mat[w*(i-1)+(j-1)];\n\t}\n\tstatic Matrix ident(int size){\n\t\tMatrix ret(size, size);\n\t\tfor(int i = 1; i <= size; i++) ret.at(i, i) = 1;\n\t\treturn ret;\n\t}\n\tMatrix operator*(Matrix& ope){\n\t\tMatrix ret(h, ope.w);\n\t\tfor(int i = 1; i <= h; i++){\n\t\t\tfor(int j = 1; j <= ope.w; j++){\n\t\t\t\tfor(int k = 1; k <= w; k++){\n\t\t\t\t\tret.at(i, j) += at(i, k) * ope.at(k, j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\tMatrix pow(llint n){\n\t\tif(n == 0) return ident(h);\n\t\tif(n % 2){\n\t\t\treturn pow(n-1) * (*this);\n\t\t}\n\t\telse{\n\t\t\tMatrix tmp = pow(n/2);\n\t\t\treturn tmp * tmp;\n\t\t}\n\t}\n\tvoid print(){\n\t\tfor(int i = 1; i <= h; i++){\n\t\t\tfor(int j = 1; j <= w; j++){\n\t\t\t\tcout << at(i, j) << \" \";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n};\n\nll s, n, k;\ndouble p[105];\nll dp[15][105];\ndouble a[105][105];\nMatrix mat;\n\n\nvoid swap(double mat[105][105], int i, int j, int n)\n{\n\tfor(int k = 0; k <= n+1; k++){\n\t\tdouble t = mat[i][k];\n\t\tmat[i][k] = mat[j][k];\n\t\tmat[j][k] = t;\n\t}\n}\n\nvoid GaussianElimination(double mat[105][105], int n)\n{\n\tfor(int i = 0; i <= n; i++){\n\t\tdouble max_val = 0; int max_j;\n\t\tfor(int j = i; j <= n; j++){\n\t\t\tif(fabs(mat[j][i]) > max_val){\n\t\t\t\tmax_val = fabs(mat[j][i]);\n\t\t\t\tmax_j = j;\n\t\t\t}\n\t\t}\n\t\tassert(fabs(max_val) > 1e-9);\n\t\tswap(mat, i, max_j, n);\n\t\t\n\t\tdouble div = mat[i][i];\n\t\tfor(int j = 0; j <= n+1; j++){\n\t\t\tmat[i][j] /= div;\n\t\t}\n\t\tfor(int j = 0; j <= n; j++){\n\t\t\tdouble coe = mat[j][i];\n\t\t\tif(i == j) continue;\n\t\t\tfor(int k = 0; k <= n+1; k++){\n\t\t\t\tmat[j][k] -= coe * mat[i][k];\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main(void)\n{\n\tcin >> s >> n >> k;\n\ts = abs(s); ll m = n*k;\n\t\n\tif(n == 1){\n\t\tif(s % k){\n\t\t\tcout << -1 << endl;\n\t\t\treturn 0;\n\t\t}\n\t\ts /= k, k = 1;\n\t}\n\t\n\tdp[0][0] = 1;\n\trep(i, 0, k-1){\n\t\trep(j, 0, m){\n\t\t\trep(l, 1, n){\n\t\t\t\tif(j+l <= m) dp[i+1][j+l] += dp[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tll mul = 1;\n\trep(i, 1, k) mul *= n;\n\trep(j, 1, m) p[j] = (double)dp[k][j] / (double)mul;\n\t\n\trep(i, 1, m){\n\t\ta[i][i] += 1;\n\t\trep(j, 1, m) a[i][abs(i-j)] -= p[j];\n\t\ta[i][m+1] = 1;\n\t}\n\ta[0][0] = 1;\n\t\n\tGaussianElimination(a, m);\n\t\n\tmat = Matrix(m+2, m+2);\n\trep(i, 1, m) mat.at(1, i) = p[i];\n\tmat.at(1, m+2) = 1;\n\trep(i, 1, m) mat.at(i+1, i) = 1;\n\tmat.at(m+2, m+2) = 1;\n\t\n\tif(s <= m){\n\t\tprintf(\"%.11f\\n\", a[s][m+1]);\n\t\treturn 0;\n\t}\n\t\t\n\tMatrix pmat = mat.pow(s-m), vec(m+2, 1);\n\trep(i, 0, m) vec.at(i+1, 1) = a[m-i][m+1];\n\tvec.at(m+2, 1) = 1;\n\t\n\tvec = pmat * vec;\n\tprintf(\"%.11f\\n\", vec.at(1, 1));\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3492,"score_of_the_acc":-0.0138,"final_rank":3},{"submission_id":"aoj_2315_5144210","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <string>\n#include <algorithm>\n#include <utility>\n#include <complex>\n#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\n#define chmin(x, y) (x) = min((x), (y))\n#define chmax(x, y) (x) = max((x), (y))\n#define all(x) (x).begin(),(x).end()\n#define inf 1e18\n\nusing namespace std;\n\ntypedef long long llint;\ntypedef long long ll;\ntypedef pair<llint, llint> P;\n\nstruct Matrix{\n\tint h, w;\n\tvector<double> mat;\n\tMatrix(){\n\t\th = w = 0;\n\t}\n\tMatrix(int h, int w){\n\t\tthis->h = h, this->w = w;\n\t\tmat.resize(h*w);\n\t}\n\tdouble& at(int i, int j){\n\t\treturn mat[w*(i-1)+(j-1)];\n\t}\n\tstatic Matrix ident(int size){\n\t\tMatrix ret(size, size);\n\t\tfor(int i = 1; i <= size; i++) ret.at(i, i) = 1;\n\t\treturn ret;\n\t}\n\tMatrix operator*(Matrix& ope){\n\t\tMatrix ret(h, ope.w);\n\t\tfor(int i = 1; i <= h; i++){\n\t\t\tfor(int j = 1; j <= ope.w; j++){\n\t\t\t\tfor(int k = 1; k <= w; k++){\n\t\t\t\t\tret.at(i, j) += at(i, k) * ope.at(k, j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\tMatrix pow(llint n){\n\t\tif(n == 0) return ident(h);\n\t\tif(n % 2){\n\t\t\treturn pow(n-1) * (*this);\n\t\t}\n\t\telse{\n\t\t\tMatrix tmp = pow(n/2);\n\t\t\treturn tmp * tmp;\n\t\t}\n\t}\n\tvoid print(){\n\t\tfor(int i = 1; i <= h; i++){\n\t\t\tfor(int j = 1; j <= w; j++){\n\t\t\t\tcout << at(i, j) << \" \";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n};\n\nll s, n, k;\ndouble p[105];\nll dp[15][105];\ndouble a[105][105];\nMatrix mat;\n\n\nvoid swap(double mat[105][105], int i, int j, int n)\n{\n\tfor(int k = 0; k <= n+1; k++){\n\t\tdouble t = mat[i][k];\n\t\tmat[i][k] = mat[j][k];\n\t\tmat[j][k] = t;\n\t}\n}\n\nvoid GaussianElimination(double mat[105][105], int n)\n{\n\tfor(int i = 0; i <= n; i++){\n\t\tdouble max_val = 0; int max_j;\n\t\tfor(int j = i; j <= n; j++){\n\t\t\tif(fabs(mat[j][i]) > max_val){\n\t\t\t\tmax_val = fabs(mat[j][i]);\n\t\t\t\tmax_j = j;\n\t\t\t}\n\t\t}\n\t\tassert(fabs(max_val) > 1e-9);\n\t\tswap(mat, i, max_j, n);\n\t\t\n\t\tdouble div = mat[i][i];\n\t\tfor(int j = 0; j <= n+1; j++){\n\t\t\tmat[i][j] /= div;\n\t\t}\n\t\tfor(int j = 0; j <= n; j++){\n\t\t\tdouble coe = mat[j][i];\n\t\t\tif(i == j) continue;\n\t\t\tfor(int k = 0; k <= n+1; k++){\n\t\t\t\tmat[j][k] -= coe * mat[i][k];\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main(void)\n{\n\tcin >> s >> n >> k;\n\ts = abs(s); ll m = n*k;\n\t\n\tif(n == 1){\n\t\tif(s % k){\n\t\t\tcout << -1 << endl;\n\t\t\treturn 0;\n\t\t}\n\t\ts /= k, k = 1;\n\t}\n\t\n\tdp[0][0] = 1;\n\trep(i, 0, k-1){\n\t\trep(j, 0, m){\n\t\t\trep(l, 1, n){\n\t\t\t\tif(j+l <= m) dp[i+1][j+l] += dp[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tll mul = 1;\n\trep(i, 1, k) mul *= n;\n\trep(j, 1, m) p[j] = (double)dp[k][j] / (double)mul;\n\t\n\trep(i, 1, m){\n\t\ta[i][i] += 1;\n\t\trep(j, 1, m) a[i][abs(i-j)] -= p[j];\n\t\ta[i][m+1] = 1;\n\t}\n\ta[0][0] = 1;\n\t\n\t/*rep(i, 0, m){\n\t\trep(j, 0, m+1){\n\t\t\tcout << a[i][j] << \" \";\n\t\t}\n\t\tcout << endl;\n\t}*/\n\t\n\tGaussianElimination(a, m);\n\t\n\tmat = Matrix(m+2, m+2);\n\trep(i, 1, m) mat.at(1, i) = p[i];\n\tmat.at(1, m+2) = 1;\n\trep(i, 1, m) mat.at(i+1, i) = 1;\n\tmat.at(m+2, m+2) = 1;\n\t\n\tif(s <= m){\n\t\tprintf(\"%.11f\\n\", a[s][m+1]);\n\t\treturn 0;\n\t}\n\t\t\n\tMatrix pmat = mat.pow(s-m), vec(m+2, 1);\n\trep(i, 0, m) vec.at(i+1, 1) = a[m-i][m+1];\n\tvec.at(m+2, 1) = 1;\n\t\n\tvec = pmat * vec;\n\tprintf(\"%.11f\\n\", vec.at(1, 1));\n\t\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3432,"score_of_the_acc":-0.0094,"final_rank":1},{"submission_id":"aoj_2315_5144181","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <string>\n#include <algorithm>\n#include <utility>\n#include <complex>\n#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\n#define chmin(x, y) (x) = min((x), (y))\n#define chmax(x, y) (x) = max((x), (y))\n#define all(x) (x).begin(),(x).end()\n#define inf 1e18\n#define double long double\n\nusing namespace std;\n\ntypedef long long llint;\ntypedef long long ll;\ntypedef pair<llint, llint> P;\n\nstruct Matrix{\n\tint h, w;\n\tvector<double> mat;\n\tMatrix(){\n\t\th = w = 0;\n\t}\n\tMatrix(int h, int w){\n\t\tthis->h = h, this->w = w;\n\t\tmat.resize(h*w);\n\t}\n\tdouble& at(int i, int j){\n\t\treturn mat[w*(i-1)+(j-1)];\n\t}\n\tstatic Matrix ident(int size){\n\t\tMatrix ret(size, size);\n\t\tfor(int i = 1; i <= size; i++) ret.at(i, i) = 1;\n\t\treturn ret;\n\t}\n\tMatrix operator*(Matrix& ope){\n\t\tMatrix ret(h, ope.w);\n\t\tfor(int i = 1; i <= h; i++){\n\t\t\tfor(int j = 1; j <= ope.w; j++){\n\t\t\t\tfor(int k = 1; k <= w; k++){\n\t\t\t\t\tret.at(i, j) += at(i, k) * ope.at(k, j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\tMatrix pow(llint n){\n\t\tif(n == 0) return ident(h);\n\t\tif(n % 2){\n\t\t\treturn pow(n-1) * (*this);\n\t\t}\n\t\telse{\n\t\t\tMatrix tmp = pow(n/2);\n\t\t\treturn tmp * tmp;\n\t\t}\n\t}\n\tvoid print(){\n\t\tfor(int i = 1; i <= h; i++){\n\t\t\tfor(int j = 1; j <= w; j++){\n\t\t\t\tcout << at(i, j) << \" \";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n};\n\nll s, n, k;\ndouble p[105];\nll dp[15][105];\ndouble a[105][105];\nMatrix mat;\n\n\nvoid swap(double mat[105][105], int i, int j, int n)\n{\n\tfor(int k = 0; k <= n+1; k++){\n\t\tdouble t = mat[i][k];\n\t\tmat[i][k] = mat[j][k];\n\t\tmat[j][k] = t;\n\t}\n}\n\nvoid GaussianElimination(double mat[105][105], int n)\n{\n\tfor(int i = 0; i <= n; i++){\n\t\tdouble max_val = 0; int max_j;\n\t\tfor(int j = i; j <= n; j++){\n\t\t\tif(fabs(mat[j][i]) > max_val){\n\t\t\t\tmax_val = fabs(mat[j][i]);\n\t\t\t\tmax_j = j;\n\t\t\t}\n\t\t}\n\t\tassert(fabs(max_val) > 1e-9);\n\t\tswap(mat, i, max_j, n);\n\t\t\n\t\tdouble div = mat[i][i];\n\t\tfor(int j = 0; j <= n+1; j++){\n\t\t\tmat[i][j] /= div;\n\t\t}\n\t\tfor(int j = 0; j <= n; j++){\n\t\t\tdouble coe = mat[j][i];\n\t\t\tif(i == j) continue;\n\t\t\tfor(int k = 0; k <= n+1; k++){\n\t\t\t\tmat[j][k] -= coe * mat[i][k];\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main(void)\n{\n\tcin >> s >> n >> k;\n\ts = abs(s);\n\tif((n == 1 || k == 1) && s % (n*k)){\n\t\tcout << -1 << endl;\n\t\treturn 0;\n\t}\n\tll m = n*k;\n\t\n\tdp[0][0] = 1;\n\trep(i, 0, k-1){\n\t\trep(j, 0, m){\n\t\t\trep(l, 1, n){\n\t\t\t\tif(j+l <= m) dp[i+1][j+l] += dp[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tll mul = 1;\n\trep(i, 1, k) mul *= n;\n\trep(j, 1, m) p[j] = (double)dp[k][j] / (double)mul;\n\t\n\trep(i, 1, m){\n\t\ta[i][i] += 1;\n\t\trep(j, 1, m) a[i][abs(i-j)] -= p[j];\n\t\ta[i][m+1] = 1;\n\t}\n\ta[0][0] = 1;\n\t\n\tGaussianElimination(a, m);\n\t\n\tmat = Matrix(m+2, m+2);\n\trep(i, 1, m) mat.at(1, i) = p[i];\n\tmat.at(1, m+2) = 1;\n\trep(i, 1, m) mat.at(i+1, i) = 1;\n\tmat.at(m+2, m+2) = 1;\n\t\n\tif(s <= m){\n\t\tprintf(\"%.11Lf\\n\", a[s][m+1]);\n\t\treturn 0;\n\t}\n\t\t\n\tMatrix pmat = mat.pow(s-m), vec(m+2, 1);\n\trep(i, 0, m) vec.at(i+1, 1) = a[m-i][m+1];\n\tvec.at(m+2, 1) = 1;\n\t\n\tvec = pmat * vec;\n\tprintf(\"%.11Lf\\n\", vec.at(1, 1));\n\t\n\treturn 0;\n}","accuracy":0.0967741935483871,"time_ms":80,"memory_kb":3400,"score_of_the_acc":-0.0423,"final_rank":20},{"submission_id":"aoj_2315_5144178","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cmath>\n#include <ctime>\n#include <cstdlib>\n#include <cassert>\n#include <vector>\n#include <list>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <bitset>\n#include <string>\n#include <algorithm>\n#include <utility>\n#include <complex>\n#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\n#define chmin(x, y) (x) = min((x), (y))\n#define chmax(x, y) (x) = max((x), (y))\n#define all(x) (x).begin(),(x).end()\n#define inf 1e18\n\nusing namespace std;\n\ntypedef long long llint;\ntypedef long long ll;\ntypedef pair<llint, llint> P;\n\nstruct Matrix{\n\tint h, w;\n\tvector<double> mat;\n\tMatrix(){\n\t\th = w = 0;\n\t}\n\tMatrix(int h, int w){\n\t\tthis->h = h, this->w = w;\n\t\tmat.resize(h*w);\n\t}\n\tdouble& at(int i, int j){\n\t\treturn mat[w*(i-1)+(j-1)];\n\t}\n\tstatic Matrix ident(int size){\n\t\tMatrix ret(size, size);\n\t\tfor(int i = 1; i <= size; i++) ret.at(i, i) = 1;\n\t\treturn ret;\n\t}\n\tMatrix operator*(Matrix& ope){\n\t\tMatrix ret(h, ope.w);\n\t\tfor(int i = 1; i <= h; i++){\n\t\t\tfor(int j = 1; j <= ope.w; j++){\n\t\t\t\tfor(int k = 1; k <= w; k++){\n\t\t\t\t\tret.at(i, j) += at(i, k) * ope.at(k, j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\tMatrix pow(llint n){\n\t\tif(n == 0) return ident(h);\n\t\tif(n % 2){\n\t\t\treturn pow(n-1) * (*this);\n\t\t}\n\t\telse{\n\t\t\tMatrix tmp = pow(n/2);\n\t\t\treturn tmp * tmp;\n\t\t}\n\t}\n\tvoid print(){\n\t\tfor(int i = 1; i <= h; i++){\n\t\t\tfor(int j = 1; j <= w; j++){\n\t\t\t\tcout << at(i, j) << \" \";\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n};\n\nll s, n, k;\ndouble p[105];\nll dp[15][105];\ndouble a[105][105];\nMatrix mat;\n\n\nvoid swap(double mat[105][105], int i, int j, int n)\n{\n\tfor(int k = 0; k <= n+1; k++){\n\t\tdouble t = mat[i][k];\n\t\tmat[i][k] = mat[j][k];\n\t\tmat[j][k] = t;\n\t}\n}\n\nvoid GaussianElimination(double mat[105][105], int n)\n{\n\tfor(int i = 0; i <= n; i++){\n\t\tdouble max_val = 0; int max_j;\n\t\tfor(int j = i; j <= n; j++){\n\t\t\tif(fabs(mat[j][i]) > max_val){\n\t\t\t\tmax_val = fabs(mat[j][i]);\n\t\t\t\tmax_j = j;\n\t\t\t}\n\t\t}\n\t\tassert(fabs(max_val) > 1e-9);\n\t\tswap(mat, i, max_j, n);\n\t\t\n\t\tdouble div = mat[i][i];\n\t\tfor(int j = 0; j <= n+1; j++){\n\t\t\tmat[i][j] /= div;\n\t\t}\n\t\tfor(int j = 0; j <= n; j++){\n\t\t\tdouble coe = mat[j][i];\n\t\t\tif(i == j) continue;\n\t\t\tfor(int k = 0; k <= n+1; k++){\n\t\t\t\tmat[j][k] -= coe * mat[i][k];\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main(void)\n{\n\tcin >> s >> n >> k;\n\ts = abs(s);\n\tif((n == 1 || k == 1) && s % (n*k)){\n\t\tcout << -1 << endl;\n\t\treturn 0;\n\t}\n\tll m = n*k;\n\t\n\tdp[0][0] = 1;\n\trep(i, 0, k-1){\n\t\trep(j, 0, m){\n\t\t\trep(l, 1, n){\n\t\t\t\tif(j+l <= m) dp[i+1][j+l] += dp[i][j];\n\t\t\t}\n\t\t}\n\t}\n\tll mul = 1;\n\trep(i, 1, k) mul *= n;\n\trep(j, 1, m) p[j] = (double)dp[k][j] / (double)mul;\n\t\n\trep(i, 1, m){\n\t\ta[i][i] += 1;\n\t\trep(j, 1, m) a[i][abs(i-j)] -= p[j];\n\t\ta[i][m+1] = 1;\n\t}\n\ta[0][0] = 1;\n\t\n\tGaussianElimination(a, m);\n\t\n\tmat = Matrix(m+2, m+2);\n\trep(i, 1, m) mat.at(1, i) = p[i];\n\tmat.at(1, m+2) = 1;\n\trep(i, 1, m) mat.at(i+1, i) = 1;\n\tmat.at(m+2, m+2) = 1;\n\t\n\tif(s <= m){\n\t\tprintf(\"%.11f\\n\", a[s][m+1]);\n\t\treturn 0;\n\t}\n\t\t\n\tMatrix pmat = mat.pow(s-m), vec(m+2, 1);\n\trep(i, 0, m) vec.at(i+1, 1) = a[m-i][m+1];\n\tvec.at(m+2, 1) = 1;\n\t\n\tvec = pmat * vec;\n\tprintf(\"%.11f\\n\", vec.at(1, 1));\n\t\n\treturn 0;\n}","accuracy":0.0967741935483871,"time_ms":20,"memory_kb":3416,"score_of_the_acc":-0.0012,"final_rank":19},{"submission_id":"aoj_2315_3623248","code_snippet":"// #define _GLIBCXX_DEBUG // for STL debug (optional)\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\nusing namespace std;\n\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define int long long int\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \ntypedef pair<int, int> pii;\ntypedef long long ll;\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst ll INF = 1001001001001001LL;\nconst ll MOD = 1000000007LL;\n\n// 行列ライブラリ\n// Verified: TopCoder SRM 704 Div.2 (ModEquationEasy)\n// 行列の積 と 累乗(繰り返し二乗法)\n\n// Matrix Library Begin (C++11)\n\ntemplate <typename T>\nusing Matrix = vector< vector<T> >;\n\ntemplate <typename T>\nvoid init_mat(Matrix<T> &A, int h, int w) {\n A.resize(h, vector<T>(w, 0));\n}\n\ntemplate <typename T>\nMatrix<T> calc_mat(Matrix<T> A, Matrix<T> B) {\n Matrix<T> C(A.size(), vector<T>(B[0].size()));\n for(int i=0; i<A.size(); i++) {\n for(int k=0; k<B.size(); k++) {\n for(int j=0; j<B[0].size(); j++) {\n C[i][j] += A[i][k] * B[k][j]; // modなし\n // C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD; // modあり\n }\n }\n }\n return C;\n}\n\ntemplate <typename T>\nMatrix<T> mat_pow(Matrix<T> A, ll n) {\n Matrix<T> B(A.size(), vector<T>(A.size()));\n for(int i=0; i<A.size(); i++) B[i][i] = 1;\n while(n > 0) {\n if(n & 1) B = calc_mat(B, A);\n A = calc_mat(A, A);\n n >>= 1;\n }\n return B;\n}\n\n// calculate vector x which satisfies Ax = b\n// (A is N*N Matrix, b, x is N-dim vector)\n\ntemplate <typename T>\nusing Matrix = vector< vector<T> >;\nconstexpr long double EPS = 1e-8;\n\ntemplate <typename T>\nvector<long double> gauss_jordan(const Matrix<T> &A, const vector<T> &b) {\n int N = A.size();\n // B = [A b]\n Matrix<long double> B(N, vector<long double>(N+1));\n for(int i=0; i<N; i++) {\n for(int j=0; j<=N; j++) {\n if(j < N) B[i][j] = A[i][j];\n else B[i][j] = b[i];\n }\n }\n\n for(int i=0; i<N; i++) {\n int pivot = i;\n for(int j=i+1; j<N; j++) {\n if(abs(B[j][i]) > abs(B[pivot][i])) pivot = j;\n }\n if(abs(B[pivot][i]) < EPS) continue;\n swap(B[i], B[pivot]);\n\n // pivot is zero -> No solution or Not unique\n // assert(abs(B[i][i]) >= EPS);\n for(int j=i+1; j<=N; j++) B[i][j] /= B[i][i];\n for(int j=0; j<N; j++) {\n if(i != j) {\n for(int k=i+1; k<=N; k++) B[j][k] -= B[j][i] * B[i][k];\n }\n }\n }\n vector<long double> x(N);\n for(int i=0; i<N; i++) x[i] = B[i][N];\n return x;\n}\n\nlong double d[11][110], dice[110], dp[110];\nsigned main() {\n int S, N, K; cin >> S >> N >> K;\n S = abs(S);\n\n if(N == 1 and S % K != 0) {\n cout << -1 << endl;\n return 0;\n }\n\n d[0][0] = 1.0;\n for(int i=0; i<K; i++) {\n for(int j=i*N; j>=0; j--) {\n for(int k=N; k>=1; k--) {\n d[i+1][j+k] += d[i][j] / N;\n }\n }\n }\n\n int M = N*K;\n long double sum = 0.0;\n for(int i=0; i<=M; i++) {\n dice[i] = d[K][i];\n sum += d[K][i];\n }\n \n Matrix<long double> mat;\n vector<long double> b(M+1);\n init_mat(mat, M+1, M+1);\n for(int i=0; i<=M; i++) {\n mat[i][i] = 1.0;\n if(i > 0) {\n for(int j=0; j<=M; j++) {\n long double p = dice[j];\n int idx = abs(i - j);\n mat[i][idx] -= p;\n }\n b[i] = 1.0;\n }\n }\n auto res = gauss_jordan(mat, b);\n\n if(S <= M) {\n printf(\"%.12Lf\\n\", (long double)res[S]);\n }\n else {\n long double ten = 1.0;\n \n int rem = S - M;\n Matrix<long double> tab;\n init_mat(tab, M+1, M+1);\n for(int i=0; i<M; i++) {\n tab[0][i] = dice[i+1];\n if(i+1 < M) tab[i+1][i] = 1.0;\n }\n tab[0][M] = 1.0;\n tab[M][M] = 1.0;\n\n Matrix<long double> vec;\n init_mat(vec, M+1, 1);\n for(int i=0; i<M; i++) {\n vec[i][0] = res[M-i] * ten;\n }\n vec[M][0] = ten;\n\n tab = mat_pow(tab, rem);\n vec = calc_mat(tab, vec);\n printf(\"%.12Lf\\n\", (long double)vec[0][0]);\n }\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":4104,"score_of_the_acc":-0.1219,"final_rank":9},{"submission_id":"aoj_2315_3530765","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n\nnamespace ProconLib{\n \n template<typename T>\n struct Detail{\n static constexpr T EPS = T(1e-15);\n static bool isZero(T v){\n return abs(v)<=EPS;\n }\n };\n\n template<typename T>\n class Vector{\n int N;\n std::vector<T> dat;\n public:\n Vector(int n):N(n),dat(n){}\n Vector(int n,T x):N(n),dat(n,x){}\n Vector(std::vector<T> vec):N(vec.size()),dat(vec){}\n Vector(const std::vector<T>& vec):N(vec.size()),dat(vec){}\n Vector(const Vector& vec){dat=vec.dat;}\n int size(){return N;}\n T& operator[](int pos){return dat[pos];};\n const T& operator[](int pos) const{return dat[pos];};\n T& at(int pos){return dat.at(pos);}\n const T& at(int pos) const {return dat.at(pos);}\n };\n \n template<typename T>\n class Matrix{\n int r,c;\n std::vector<Vector<T>> dat;\n public:\n Matrix(int r,int c):r(r),c(c),dat(r,Vector<T>(c)){}\n Matrix(int r,int c,T x):r(r),c(c),dat(r,Vector<T>(c,x)){}\n\n Vector<T>& operator[](int pos){return dat[pos];};\n const Vector<T>& operator[](int pos) const{return dat[pos];};\n Vector<T>& at(int pos){return dat.at(pos);}\n const Vector<T>& at(int pos) const {return dat.at(pos);}\n int rowSize() const {return r;}\n int colSize() const {return c;}\n };\n template<typename T>\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs);\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs);\n template<typename T>\n Matrix<T> operator+(const Matrix<T>& mat);\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& mat);\n template<typename T>\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs);\n template<typename T>\n Matrix<T> Identity(int n);\n template<typename T>\n Matrix<T> pow(const Matrix<T>& mat,int k);\n template<typename T,typename Detail=Detail<T>>\n Matrix<T> gaussianElimination(Matrix<T> mat);\n template<typename T>\n int rank(const Matrix<T>& mat);\n template<typename T>\n Matrix<T> inv(const Matrix<T>& mat);\n \n template<typename T>\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs){\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\n int r=lhs.rowSize(),c=lhs.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++){\n for(int j=0;j<c;j++){\n res[i][j]=lhs[i]+rhs[i];\n }\n }\n return res;\n }\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs){\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\n int r=lhs.rowSize(),c=lhs.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++){\n for(int j=0;j<c;j++){\n res[i][j]=lhs[i]-rhs[i];\n }\n }\n return res;\n }\n template<typename T>\n Matrix<T> operator+(const Matrix<T>& mat){\n int r=mat.rowSize(),c=mat.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\n return res;\n }\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& mat){\n int r=mat.rowSize(),c=mat.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\n return res;\n }\n \n template<typename T>\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs){\n assert(lhs.colSize()==rhs.rowSize());\n int r=lhs.rowSize(),c=rhs.colSize(),l=lhs.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++){\n for(int k=0;k<l;k++){\n for(int j=0;j<c;j++){\n res[i][j]+=lhs[i][k]*rhs[k][j];\n }\n }\n }\n return res;\n }\n\n template<typename T>\n Matrix<T> Identity(int n){\n assert(n>=0);\n Matrix<T> res(n,n);\n for(int i=0;i<n;i++){\n res[i][i]=1;\n }\n return res;\n }\n\n template<typename T>\n Matrix<T> pow(const Matrix<T>& mat,int k){\n assert(mat.rowSize()==mat.colSize());\n Matrix<T> x=mat;\n Matrix<T> res=Identity<T>(mat.rowSize());\n while(k){\n if(k&1) res=res*x;\n x=x*x;\n k>>=1;\n }\n return res;\n }\n \n template<typename T,typename Detail=Detail<T>>\n Matrix<T> gaussianElimination(Matrix<T> mat){\n int m=mat.rowSize(),n=mat.colSize();\n int row=0;\n for(int j=0;j<n;j++){\n if(row==m) break;\n int tar=-1;\n T v=Detail::EPS;\n for(int i=row;i<m;i++){\n if(!Detail::isZero(mat[i][j]) && abs(v)<abs(mat[i][j])){\n tar=i;\n v=mat[i][j];\n }\n }\n if(tar==-1) continue;\n if(row!=tar){ \n auto tmp=mat[row];\n mat[row]=mat[tar];\n mat[tar]=tmp;\n }\n for(int i=row+1;i<m;i++){\n if(!Detail::isZero(mat[i][j])){\n T r=mat[i][j]/mat[row][j];\n for(int k=j;k<n;k++){\n mat[i][k]-=r*mat[row][k];\n }\n }\n }\n row++;\n }\n return mat;\n }\n\n template<typename T,typename Detail=Detail<T>>\n int rank(const Matrix<T>& mat){\n auto tmp=gaussialElimination(mat);\n int m=tmp.rowSize(),n=tmp.colSize();\n int i=0,j=0;\n while(i<m && j<n){\n if(Detail::isZero(tmp[i][j])) j++;\n else i++,j++;\n }\n return i;\n }\n\n template<typename T>\n Matrix<T> inv(const Matrix<T>& mat){\n assert(mat.rowSize()==mat.colSize());\n int n=mat.rowSize();\n Matrix<T> tmp(n,2*n);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n tmp[i][j]=mat[i][j];\n tmp[i][j+n]=0;\n }\n tmp[i][i+n]=1;\n }\n mat=gaussianElimination(mat);\n Matrix<T> res(n);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n res[i][j]=mat[i][j+n]/=mat[i][i];\n }\n }\n return res;\n }\n \n template<typename T>\n void debug(Matrix<T> mat){\n int m=mat.rowSize(),n=mat.colSize();\n std::cerr<<\"###Matrix_Debug###\"<<std::endl;\n for(int i=0;i<m;i++){\n for(int j=0;j<n;j++){\n std::cerr<<mat[i][j]<<\" \";\n }\n std::cerr<<std::endl;\n }\n }\n}\n\nusing namespace ProconLib;\n\nint main(){\n int s,n,k;\n cin>>s>>n>>k;\n if(n==1){\n cout<<(s%k==0 ? abs(s)/k : -1)<<endl;\n return 0;\n }\n \n int sz=n*k+1;\n \n vector<vector<double>> dp(k+1,vector<double>(sz));\n dp[0][0]=1;\n for(int i=0;i<k;i++){\n for(int j=0;j<sz;j++){\n for(int k=1;k<=n;k++){\n if(j+k<sz) dp[i+1][j+k]+=dp[i][j]/n;\n }\n }\n }\n \n Matrix<double> B(sz,sz+1);\n {\n B[0][0]=1;\n B[0][sz]=0;\n for(int i=1;i<sz;i++){\n B[i][i]=-1;\n for(int j=0;j<sz;j++){\n // i to j\n int d=i-j;\n if(0<=d && d<sz){\n B[i][j]+=dp[k][d];\n B[i][sz]-=dp[k][d];\n }\n d=i+j;\n if(j!=0 && 0<=d && d<sz){\n B[i][j]+=dp[k][d];\n B[i][sz]-=dp[k][d];\n }\n }\n }\n }\n B=gaussianElimination(B);\n Vector<double> vec(sz+1);\n for(int i=sz-1;i>=0;i--){\n for(int j=0;j<i;j++){\n B[j][sz]-=B[j][i]/B[i][i]*B[i][sz];\n B[j][i]=0;\n }\n }\n for(int i=0;i<sz;i++){\n vec[sz-i-1]=B[i][sz]/B[i][i];\n }\n vec[sz]=1;\n\n Matrix<double> A(sz+1,sz+1);\n for(int i=1;i<sz;i++){\n A[i][i-1]=1;\n }\n A[sz][sz]=1;\n for(int i=0;i<sz;i++){\n int d=i+1;\n if(d<sz) A[0][i]=dp[k][d];\n if(d<sz) A[0][sz]+=dp[k][d];\n }\n A=pow(A,abs(s));\n double res=0;\n for(int i=0;i<=sz;i++){\n res+=A[sz-1][i]*vec[i];\n }\n cout<<fixed<<setprecision(10);\n cout<<res<<endl;\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3548,"score_of_the_acc":-0.0108,"final_rank":2},{"submission_id":"aoj_2315_3530762","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n\nnamespace ProconLib{\n \n template<typename T>\n struct Detail{\n static constexpr T EPS = T(1e-15);\n static bool isZero(T v){\n return abs(v)<=EPS;\n }\n };\n\n template<typename T>\n class Vector{\n int N;\n std::vector<T> dat;\n public:\n Vector(int n):N(n),dat(n){}\n Vector(int n,T x):N(n),dat(n,x){}\n Vector(std::vector<T> vec):N(vec.size()),dat(vec){}\n Vector(const std::vector<T>& vec):N(vec.size()),dat(vec){}\n Vector(const Vector& vec){dat=vec.dat;}\n int size(){return N;}\n T& operator[](int pos){return dat[pos];};\n const T& operator[](int pos) const{return dat[pos];};\n T& at(int pos){return dat.at(pos);}\n const T& at(int pos) const {return dat.at(pos);}\n };\n \n template<typename T>\n class Matrix{\n int r,c;\n std::vector<Vector<T>> dat;\n public:\n Matrix(int r,int c):r(r),c(c),dat(r,Vector<T>(c)){}\n Matrix(int r,int c,T x):r(r),c(c),dat(r,Vector<T>(c,x)){}\n\n Vector<T>& operator[](int pos){return dat[pos];};\n const Vector<T>& operator[](int pos) const{return dat[pos];};\n Vector<T>& at(int pos){return dat.at(pos);}\n const Vector<T>& at(int pos) const {return dat.at(pos);}\n int rowSize() const {return r;}\n int colSize() const {return c;}\n };\n template<typename T>\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs);\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs);\n template<typename T>\n Matrix<T> operator+(const Matrix<T>& mat);\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& mat);\n template<typename T>\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs);\n template<typename T>\n Matrix<T> Identity(int n);\n template<typename T>\n Matrix<T> pow(const Matrix<T>& mat,int k);\n template<typename T,typename Detail=Detail<T>>\n Matrix<T> gaussianElimination(Matrix<T> mat);\n template<typename T>\n int rank(const Matrix<T>& mat);\n template<typename T>\n Matrix<T> inv(const Matrix<T>& mat);\n \n template<typename T>\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs){\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\n int r=lhs.rowSize(),c=lhs.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++){\n for(int j=0;j<c;j++){\n res[i][j]=lhs[i]+rhs[i];\n }\n }\n return res;\n }\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs){\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\n int r=lhs.rowSize(),c=lhs.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++){\n for(int j=0;j<c;j++){\n res[i][j]=lhs[i]-rhs[i];\n }\n }\n return res;\n }\n template<typename T>\n Matrix<T> operator+(const Matrix<T>& mat){\n int r=mat.rowSize(),c=mat.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\n return res;\n }\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& mat){\n int r=mat.rowSize(),c=mat.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\n return res;\n }\n \n template<typename T>\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs){\n assert(lhs.colSize()==rhs.rowSize());\n int r=lhs.rowSize(),c=rhs.colSize(),l=lhs.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++){\n for(int k=0;k<l;k++){\n for(int j=0;j<c;j++){\n res[i][j]+=lhs[i][k]*rhs[k][j];\n }\n }\n }\n return res;\n }\n\n template<typename T>\n Matrix<T> Identity(int n){\n assert(n>=0);\n Matrix<T> res(n,n);\n for(int i=0;i<n;i++){\n res[i][i]=1;\n }\n return res;\n }\n\n template<typename T>\n Matrix<T> pow(const Matrix<T>& mat,int k){\n assert(mat.rowSize()==mat.colSize());\n Matrix<T> x=mat;\n Matrix<T> res=Identity<T>(mat.rowSize());\n while(k){\n if(k&1) res=res*x;\n x=x*x;\n k>>=1;\n }\n return res;\n }\n \n template<typename T,typename Detail=Detail<T>>\n Matrix<T> gaussianElimination(Matrix<T> mat){\n int m=mat.rowSize(),n=mat.colSize();\n int row=0;\n for(int j=0;j<n;j++){\n if(row==m) break;\n int tar=-1;\n T v=Detail::EPS;\n for(int i=row;i<m;i++){\n if(!Detail::isZero(mat[i][j]) && abs(v)<abs(mat[i][j])){\n tar=i;\n v=mat[i][j];\n }\n }\n if(tar==-1) continue;\n if(row!=tar){ \n auto tmp=mat[row];\n mat[row]=mat[tar];\n mat[tar]=tmp;\n }\n for(int i=row+1;i<m;i++){\n if(!Detail::isZero(mat[i][j])){\n T r=mat[i][j]/mat[row][j];\n for(int k=j;k<n;k++){\n mat[i][k]-=r*mat[row][k];\n }\n }\n }\n row++;\n }\n return mat;\n }\n\n template<typename T,typename Detail=Detail<T>>\n int rank(const Matrix<T>& mat){\n auto tmp=gaussialElimination(mat);\n int m=tmp.rowSize(),n=tmp.colSize();\n int i=0,j=0;\n while(i<m && j<n){\n if(Detail::isZero(tmp[i][j])) j++;\n else i++,j++;\n }\n return i;\n }\n\n template<typename T>\n Matrix<T> inv(const Matrix<T>& mat){\n assert(mat.rowSize()==mat.colSize());\n int n=mat.rowSize();\n Matrix<T> tmp(n,2*n);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n tmp[i][j]=mat[i][j];\n tmp[i][j+n]=0;\n }\n tmp[i][i+n]=1;\n }\n mat=gaussianElimination(mat);\n Matrix<T> res(n);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n res[i][j]=mat[i][j+n]/=mat[i][i];\n }\n }\n return res;\n }\n \n template<typename T>\n void debug(Matrix<T> mat){\n int m=mat.rowSize(),n=mat.colSize();\n std::cerr<<\"###Matrix_Debug###\"<<std::endl;\n for(int i=0;i<m;i++){\n for(int j=0;j<n;j++){\n std::cerr<<mat[i][j]<<\" \";\n }\n std::cerr<<std::endl;\n }\n }\n}\n\nusing namespace ProconLib;\n\nint main(){\n int s,n,k;\n cin>>s>>n>>k;\n if(n==1 && s%k!=0){\n cout<<-1<<endl;\n return 0;\n }\n int sz=n*k+1;\n \n vector<vector<double>> dp(k+1,vector<double>(sz));\n dp[0][0]=1;\n for(int i=0;i<k;i++){\n for(int j=0;j<sz;j++){\n for(int k=1;k<=n;k++){\n if(j+k<sz) dp[i+1][j+k]+=dp[i][j]/n;\n }\n }\n }\n \n Matrix<double> B(sz,sz+1);\n {\n B[0][0]=1;\n B[0][sz]=0;\n for(int i=1;i<sz;i++){\n B[i][i]=-1;\n for(int j=0;j<sz;j++){\n // i to j\n int d=i-j;\n if(0<=d && d<sz){\n B[i][j]+=dp[k][d];\n B[i][sz]-=dp[k][d];\n }\n d=i+j;\n if(j!=0 && 0<=d && d<sz){\n B[i][j]+=dp[k][d];\n B[i][sz]-=dp[k][d];\n }\n }\n }\n }\n B=gaussianElimination(B);\n Vector<double> vec(sz+1);\n for(int i=sz-1;i>=0;i--){\n for(int j=0;j<i;j++){\n B[j][sz]-=B[j][i]/B[i][i]*B[i][sz];\n B[j][i]=0;\n }\n }\n for(int i=0;i<sz;i++){\n vec[sz-i-1]=B[i][sz]/B[i][i];\n }\n vec[sz]=1;\n\n Matrix<double> A(sz+1,sz+1);\n for(int i=1;i<sz;i++){\n A[i][i-1]=1;\n }\n A[sz][sz]=1;\n for(int i=0;i<sz;i++){\n int d=i+1;\n if(d<sz) A[0][i]=dp[k][d];\n if(d<sz) A[0][sz]+=dp[k][d];\n }\n A=pow(A,abs(s));\n double res=0;\n for(int i=0;i<=sz;i++){\n res+=A[sz-1][i]*vec[i];\n }\n cout<<fixed<<setprecision(10);\n cout<<res<<endl;\n\n return 0;\n}","accuracy":0.1935483870967742,"time_ms":20,"memory_kb":3488,"score_of_the_acc":-0.0064,"final_rank":14},{"submission_id":"aoj_2315_3530756","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n\nnamespace ProconLib{\n \n template<typename T>\n struct Detail{\n static constexpr T EPS = T(1e-9);\n static bool isZero(T v){\n return abs(v)<=EPS;\n }\n };\n\n template<typename T>\n class Vector{\n int N;\n std::vector<T> dat;\n public:\n Vector(int n):N(n),dat(n){}\n Vector(int n,T x):N(n),dat(n,x){}\n Vector(std::vector<T> vec):N(vec.size()),dat(vec){}\n Vector(const std::vector<T>& vec):N(vec.size()),dat(vec){}\n Vector(const Vector& vec){dat=vec.dat;}\n int size(){return N;}\n T& operator[](int pos){return dat[pos];};\n const T& operator[](int pos) const{return dat[pos];};\n T& at(int pos){return dat.at(pos);}\n const T& at(int pos) const {return dat.at(pos);}\n };\n \n template<typename T>\n class Matrix{\n int r,c;\n std::vector<Vector<T>> dat;\n public:\n Matrix(int r,int c):r(r),c(c),dat(r,Vector<T>(c)){}\n Matrix(int r,int c,T x):r(r),c(c),dat(r,Vector<T>(c,x)){}\n\n Vector<T>& operator[](int pos){return dat[pos];};\n const Vector<T>& operator[](int pos) const{return dat[pos];};\n Vector<T>& at(int pos){return dat.at(pos);}\n const Vector<T>& at(int pos) const {return dat.at(pos);}\n int rowSize() const {return r;}\n int colSize() const {return c;}\n };\n template<typename T>\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs);\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs);\n template<typename T>\n Matrix<T> operator+(const Matrix<T>& mat);\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& mat);\n template<typename T>\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs);\n template<typename T>\n Matrix<T> Identity(int n);\n template<typename T>\n Matrix<T> pow(const Matrix<T>& mat,int k);\n template<typename T,typename Detail=Detail<T>>\n Matrix<T> gaussianElimination(Matrix<T> mat);\n template<typename T>\n int rank(const Matrix<T>& mat);\n template<typename T>\n Matrix<T> inv(const Matrix<T>& mat);\n \n template<typename T>\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs){\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\n int r=lhs.rowSize(),c=lhs.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++){\n for(int j=0;j<c;j++){\n res[i][j]=lhs[i]+rhs[i];\n }\n }\n return res;\n }\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs){\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\n int r=lhs.rowSize(),c=lhs.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++){\n for(int j=0;j<c;j++){\n res[i][j]=lhs[i]-rhs[i];\n }\n }\n return res;\n }\n template<typename T>\n Matrix<T> operator+(const Matrix<T>& mat){\n int r=mat.rowSize(),c=mat.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\n return res;\n }\n template<typename T>\n Matrix<T> operator-(const Matrix<T>& mat){\n int r=mat.rowSize(),c=mat.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\n return res;\n }\n \n template<typename T>\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs){\n assert(lhs.colSize()==rhs.rowSize());\n int r=lhs.rowSize(),c=rhs.colSize(),l=lhs.colSize();\n Matrix<T> res(r,c);\n for(int i=0;i<r;i++){\n for(int k=0;k<l;k++){\n for(int j=0;j<c;j++){\n res[i][j]+=lhs[i][k]*rhs[k][j];\n }\n }\n }\n return res;\n }\n\n template<typename T>\n Matrix<T> Identity(int n){\n assert(n>=0);\n Matrix<T> res(n,n);\n for(int i=0;i<n;i++){\n res[i][i]=1;\n }\n return res;\n }\n\n template<typename T>\n Matrix<T> pow(const Matrix<T>& mat,int k){\n assert(mat.rowSize()==mat.colSize());\n Matrix<T> x=mat;\n Matrix<T> res=Identity<T>(mat.rowSize());\n while(k){\n if(k&1) res=res*x;\n x=x*x;\n k>>=1;\n }\n return res;\n }\n \n template<typename T,typename Detail=Detail<T>>\n Matrix<T> gaussianElimination(Matrix<T> mat){\n int m=mat.rowSize(),n=mat.colSize();\n int row=0;\n for(int j=0;j<n;j++){\n if(row==m) break;\n int tar=-1;\n T v=Detail::EPS;\n for(int i=row;i<m;i++){\n if(!Detail::isZero(mat[i][j]) && abs(v)<abs(mat[i][j])){\n tar=i;\n v=mat[i][j];\n }\n }\n if(tar==-1) continue;\n if(row!=tar){ \n auto tmp=mat[row];\n mat[row]=mat[tar];\n mat[tar]=tmp;\n }\n for(int i=row+1;i<m;i++){\n if(!Detail::isZero(mat[i][j])){\n T r=mat[i][j]/mat[row][j];\n for(int k=j;k<n;k++){\n mat[i][k]-=r*mat[row][k];\n }\n }\n }\n row++;\n }\n return mat;\n }\n\n template<typename T,typename Detail=Detail<T>>\n int rank(const Matrix<T>& mat){\n auto tmp=gaussialElimination(mat);\n int m=tmp.rowSize(),n=tmp.colSize();\n int i=0,j=0;\n while(i<m && j<n){\n if(Detail::isZero(tmp[i][j])) j++;\n else i++,j++;\n }\n return i;\n }\n\n template<typename T>\n Matrix<T> inv(const Matrix<T>& mat){\n assert(mat.rowSize()==mat.colSize());\n int n=mat.rowSize();\n Matrix<T> tmp(n,2*n);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n tmp[i][j]=mat[i][j];\n tmp[i][j+n]=0;\n }\n tmp[i][i+n]=1;\n }\n mat=gaussianElimination(mat);\n Matrix<T> res(n);\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n res[i][j]=mat[i][j+n]/=mat[i][i];\n }\n }\n return res;\n }\n \n template<typename T>\n void debug(Matrix<T> mat){\n int m=mat.rowSize(),n=mat.colSize();\n std::cerr<<\"###Matrix_Debug###\"<<std::endl;\n for(int i=0;i<m;i++){\n for(int j=0;j<n;j++){\n std::cerr<<mat[i][j]<<\" \";\n }\n std::cerr<<std::endl;\n }\n }\n}\n\nusing namespace ProconLib;\n\nint main(){\n int s,n,k;\n cin>>s>>n>>k;\n if(n==1 && s%k!=0){\n cout<<-1<<endl;\n return 0;\n }\n int sz=n*k+1;\n \n vector<vector<double>> dp(k+1,vector<double>(sz));\n dp[0][0]=1;\n for(int i=0;i<k;i++){\n for(int j=0;j<sz;j++){\n for(int k=1;k<=n;k++){\n if(j+k<sz) dp[i+1][j+k]+=dp[i][j]/n;\n }\n }\n }\n \n Matrix<double> B(sz,sz+1);\n {\n B[0][0]=1;\n B[0][sz]=0;\n for(int i=1;i<sz;i++){\n B[i][i]=-1;\n for(int j=0;j<sz;j++){\n // i to j\n int d=i-j;\n if(0<=d && d<sz){\n B[i][j]+=dp[k][d];\n B[i][sz]-=dp[k][d];\n }\n d=i+j;\n if(j!=0 && 0<=d && d<sz){\n B[i][j]+=dp[k][d];\n B[i][sz]-=dp[k][d];\n }\n }\n }\n }\n B=gaussianElimination(B);\n Vector<double> vec(sz+1);\n for(int i=sz-1;i>=0;i--){\n for(int j=0;j<i;j++){\n B[j][sz]-=B[j][i]/B[i][i]*B[i][sz];\n B[j][i]=0;\n }\n }\n for(int i=0;i<sz;i++){\n vec[sz-i-1]=B[i][sz]/B[i][i];\n }\n vec[sz]=1;\n\n Matrix<double> A(sz+1,sz+1);\n for(int i=1;i<sz;i++){\n A[i][i-1]=1;\n }\n A[sz][sz]=1;\n for(int i=0;i<sz;i++){\n int d=i+1;\n if(d<sz) A[0][i]=dp[k][d];\n if(d<sz) A[0][sz]+=dp[k][d];\n }\n A=pow(A,abs(s));\n double res=0;\n for(int i=0;i<=sz;i++){\n res+=A[sz-1][i]*vec[i];\n }\n cout<<fixed<<setprecision(10);\n cout<<res<<endl;\n\n return 0;\n}","accuracy":0.1935483870967742,"time_ms":20,"memory_kb":3436,"score_of_the_acc":-0.0026,"final_rank":13},{"submission_id":"aoj_2315_3315116","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ld = long double;\n\ntemplate<class T>\nclass matrix {\n\tvector<vector<T>> dat;\npublic:\n\tmatrix(int row) : dat(row, vector<T>(1)) {}\n\tmatrix(int row, int col) : dat(row, vector<T>(col)) {}\n\tmatrix(int row, int col, const T& id) : dat(row, vector<T>(col, id)) {}\n\tmatrix(const vector<vector<T>>& v) : dat(v) {}\n\tmatrix(const vector<T>& v) : dat(v.size(), vector<T>(1)) {\n\t\tfor (int i = 0; i < (int)v.size(); ++i) dat[i][0] = v[i];\n\t}\n\texplicit operator vector<vector<T>>() const { return dat; }\n\tint row_size() const { return dat.size(); }\n\tint col_size() const { return dat[0].size(); }\n\tmatrix<T>& operator+=(const matrix<T>& that) {\n\t\tint row = row_size(), col = col_size();\n\t\tassert(row_size() == that.row_size() && col_size() == that.col_size());\n\t\tfor (int i = 0; i < row; ++i) for (int j = 0; j < col; ++j) dat[i][j] += that[i][j];\n\t\treturn *this;\n\t}\n\tmatrix<T>& operator-=(const matrix<T>& that) {\n\t\tint row = row_size(), col = col_size();\n\t\tassert(row_size() == that.row_size() && col_size() == that.col_size());\n\t\tfor (int i = 0; i < row; ++i) for (int j = 0; j < col; ++j) dat[i][j] -= that[i][j];\n\t\treturn *this;\n\t}\n\tmatrix<T>& operator*=(const T& that) {\n\t\tint row = row_size(), col = col_size();\n\t\tfor (int i = 0; i < row; ++i) for (int j = 0; j < col; ++j) dat[i][j] *= that;\n\t\treturn *this;\n\t}\n\tmatrix<T>& operator/=(const T& that) {\n\t\tint row = row_size(), col = col_size();\n\t\tfor (int i = 0; i < row; ++i) for (int j = 0; j < col; ++j) dat[i][j] /= that;\n\t\treturn *this;\n\t}\n\tmatrix<T> operator*(const matrix<T>& that) const {\n\t\tint x = row_size(), y = col_size(), z = that.col_size();\n\t\tassert(col_size() == that.row_size());\n\t\tmatrix<T> res(x, z);\n\t\tfor (int i = 0; i < x; ++i) {\n\t\t\tfor (int j = 0; j < y; ++j) {\n\t\t\t\tfor (int k = 0; k < z; ++k) {\n\t\t\t\t\tres[i][k] += dat[i][j] * that[j][k];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\tmatrix<T>& operator*=(const matrix<T>& that) { return *this = *this * that; }\n\n\tvector<T>& operator[](size_t i) & { return dat[i]; }\n\tconst vector<T>& operator[](size_t i) const& { return dat[i]; }\n\tvector<T> operator[](size_t i) const&& { return move(dat[i]); }\n\n\tT& get(int i, int j) & {\n\t\tassert(0 <= i && i < row_size());\n\t\tassert(0 <= j && j < col_size());\n\t\treturn dat[i][j];\n\t}\n\tconst T& get(int i, int j) const& {\n\t\tassert(0 <= i && i < row_size());\n\t\tassert(0 <= j && j < col_size());\n\t\treturn dat[i][j];\n\t}\n\tT get(int i, int j) const&& {\n\t\tassert(0 <= i && i < row_size());\n\t\tassert(0 <= j && j < col_size());\n\t\treturn move(dat[i][j]);\n\t}\n\tmatrix<T> transpose() const {\n\t\tint row = row_size(), col = col_size();\n\t\tmatrix<T> res(col, row);\n\t\tfor (int i = 0; i < row; ++i) for (int j = 0; j < col; ++j) res[j][i] = dat[i][j];\n\t\treturn res;\n\t}\n};\n\ntemplate <class T> matrix<T> operator+(const matrix<T>& a, const matrix<T>& b) { return matrix<T>(a) += b; }\ntemplate <class T> matrix<T> operator-(const matrix<T>& a, const matrix<T>& b) { return matrix<T>(a) -= b; }\ntemplate <class T> matrix<T> operator*(const matrix<T>& a, const T& b) { return matrix<T>(a) *= b; }\ntemplate <class T> matrix<T> operator*(const T& a, const matrix<T>& b) { return matrix<T>(b) *= a; }\ntemplate <class T> matrix<T> operator/(const matrix<T>& a, const T& b) { return matrix<T>(a) /= b; }\n\ntemplate <class T> matrix<T> identity_matrix(int n) {\n\tmatrix<T> a(n, n);\n\tfor (int i = 0; i < n; i++) a[i][i] = T(1);\n\treturn a;\n}\n\ntemplate <class T> matrix<T> pow(const matrix<T>& a, long long b) {\n\tconst int n = a.row_size();\n\tassert(a.row_size() == a.col_size() && 0 <= b);\n\tmatrix<T> res = identity_matrix<T>(n), x(a);\n\twhile (true) {\n\t\tif (b & 1LL) res *= x;\n\t\tif (!(b >>= 1LL)) break;\n\t\tx *= x;\n\t}\n\treturn res;\n}\n\nconst ld eps = 1e-10;\n\ntemplate <typename T>\nbool is_zero(T val) {\n\treturn val == T(0);\n}\n\ntemplate <>\nbool is_zero(ld val) {\n\treturn std::abs(val) < eps;\n}\n\ntemplate <typename T>\nvector<T> gauss_jordan(const matrix<T>& A, const vector<T>& b) {\n\tconst int n = A.row_size();\n\tmatrix<T> B(n, n + 1);\n\tfor (int i = 0; i < n; ++i) {\n\t\tfor (int j = 0; j < n; ++j) B[i][j] = A[i][j];\n\t\tB[i][n] = b[i];\n\t}\n\tfor (int i = 0; i < n; ++i) {\n\t\tint pivot = i;\n\t\tfor (int j = i; j < n; ++j) {\n\t\t\tif (std::abs(B[j][i]) > std::abs(B[pivot][i])) pivot = j;\n\t\t}\n\t\tif (i != pivot) swap(B[i], B[pivot]);\n\t\tif (is_zero(B[i][i])) return vector<T>(); // no solution\n\t\tfor (int j = i + 1; j <= n; ++j) B[i][j] /= B[i][i];\n\t\tfor (int j = 0; j < n; ++j) {\n\t\t\tif (i == j) continue;\n\t\t\tfor (int k = i + 1; k <= n; ++k) B[j][k] -= B[j][i] * B[i][k];\n\t\t}\n\t}\n\tvector<T> x(n);\n\tfor (int i = 0; i < n; ++i) x[i] = B[i][n];\n\treturn x;\n}\n\nint main()\n{\n\tcout << fixed << setprecision(8);\n\tint S, N, K;\n\tcin >> S >> N >> K; S = abs(S);\n\tif (S == 0) {\n\t\tcout << 0 << endl;\n\t\treturn 0;\n\t}\n\tif (N == 1) {\n\t\tcout << (S % K == 0 ? S / K : -1) << endl;\n\t\treturn 0;\n\t}\n\tvector<ld> dp = { 1 };\n\tfor (int i = 0; i < K; i++) {\n\t\tvector<ld> tmp((i + 1) * N + 1);\n\t\tfor (int j = 0; j <= i * N; j++) {\n\t\t\tfor (int k = 1; k <= N; k++) {\n\t\t\t\ttmp[j + k] += dp[j] / N;\n\t\t\t}\n\t\t}\n\t\tdp.swap(tmp);\n\t}\n\tint M = N * K;\n\tmatrix<ld> mat(M, M);\n\tvector<ld> b(M);\n\tmat[0][0] = 1;\n\tb[0] = 0;\n\tfor (int i = 1; i < M; i++) {\n\t\tmat[i][i] = -1;\n\t\tld kei = i * 2 <= M ? 1 / (1 - dp[i * 2]) : 1;\n\t\tb[i] -= kei;\n\t\tfor (int j = 0; j <= M; j++) {\n\t\t\tint p = abs(i - j);\n\t\t\tif (p == i) continue;\n\t\t\tmat[i][p] += dp[j] * kei;\n\t\t}\n\t}\n\tauto vec = gauss_jordan(mat, b);\n\tassert(!vec.empty());\n\tvec.push_back(1);\n\tmatrix<ld> kei(M + 1, M + 1);\n\tfor (int i = 0; i < M - 1; i++) {\n\t\tkei[i][i + 1] = 1;\n\t}\n\tfor (int i = 0; i < M; i++) {\n\t\tkei[M - 1][i] = dp[M - i];\n\t}\n\tkei[M - 1][M] = 1;\n\tkei[M][M] = 1;\n\tkei = pow(kei, S);\n\tld res = 0;\n\tfor (int i = 0; i <= M; i++) {\n\t\tres += kei[0][i] * vec[i];\n\t}\n\tcout << res << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":110,"memory_kb":3796,"score_of_the_acc":-0.0923,"final_rank":7}],"string":"[\n {\n \"submission_id\": \"aoj_2315_8371789\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvector<vector<long double> > matmul(int N, const vector<vector<long double> >& mat1, const vector<vector<long double> >& mat2) {\\n\\tvector<vector<long double> > res(N, vector<long double>(N));\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tfor (int k = 0; k < N; k++) {\\n\\t\\t\\t\\tres[i][j] += mat1[i][k] * mat2[k][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\nvoid gaussian_elimination(int N, vector<vector<long double> >& mat) {\\n\\tint row = 0;\\n\\tfor (int i = 0; i < N; i++) {\\n\\t\\tint opt = -1;\\n\\t\\tlong double optmag = 0.0;\\n\\t\\tfor (int j = row; j < N; j++) {\\n\\t\\t\\tif (optmag < abs(mat[j][i])) {\\n\\t\\t\\t\\topt = j;\\n\\t\\t\\t\\toptmag = abs(mat[j][i]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (opt == -1) {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tswap(mat[row], mat[opt]);\\n\\t\\tdouble submul = 1.0 / mat[row][i];\\n\\t\\tfor (int j = i + 1; j <= N; j++) {\\n\\t\\t\\tmat[row][j] *= submul;\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < N; j++) {\\n\\t\\t\\tif (j != row) {\\n\\t\\t\\t\\tdouble mul = mat[j][i];\\n\\t\\t\\t\\tfor (int k = i; k <= N; k++) {\\n\\t\\t\\t\\t\\tmat[j][k] -= mat[row][k] * mul;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\trow += 1;\\n\\t}\\n}\\n\\nlong double solve(long long S, int N, int K) {\\n\\t// step #1. calculate probability of transition\\n\\tvector<long double> prob = { 1.0 };\\n\\tfor (int i = 1; i <= K; i++) {\\n\\t\\tvector<long double> nprob(N * i + 1);\\n\\t\\tlong double s = 0.0;\\n\\t\\tfor (int j = 0; j <= N * i; j++) {\\n\\t\\t\\tnprob[j] = s / N;\\n\\t\\t\\ts += (j <= N * (i - 1) ? prob[j] : 0.0);\\n\\t\\t\\ts -= (j >= N ? prob[j - N] : 0.0);\\n\\t\\t}\\n\\t\\tprob = nprob;\\n\\t}\\n\\n\\t// step #2. create matrix\\n\\tint Z = N * K;\\n\\tvector<vector<long double> > mat0(2 * Z, vector<long double>(2 * Z, 0.0L));\\n\\tfor (int i = 0; i < Z - 1; i++) {\\n\\t\\tmat0[i + 1][i] = 1.0L;\\n\\t\\tmat0[Z + i + 1][Z + i] = 1.0L;\\n\\t}\\n\\tfor (int i = 0; i < Z; i++) {\\n\\t\\tmat0[0][i] = prob[i + 1];\\n\\t}\\n\\tfor (int i = 0; i < Z; i++) {\\n\\t\\tmat0[Z][i] = prob[i + 1];\\n\\t\\tmat0[Z][Z + i] = prob[i + 1];\\n\\t}\\n\\t\\n\\t// separate by cases\\n\\tvector<long double> p(Z), t(Z);\\n\\tif (S < Z) {\\n\\t\\tp[S] = 1.0L;\\n\\t\\tt[S] = 0.0L;\\n\\t}\\n\\telse {\\n\\t\\t// step #3. matrix exponentation\\n\\t\\tvector<vector<long double> > mat1(2 * Z, vector<long double>(2 * Z));\\n\\t\\tfor (int i = 0; i < 2 * Z; i++) {\\n\\t\\t\\tmat1[i][i] = 1.0L;\\n\\t\\t}\\n\\t\\tvector<vector<long double> > mat2 = mat0;\\n\\t\\tlong long rem = S - Z;\\n\\t\\twhile (rem >= 1) {\\n\\t\\t\\tif (rem % 2 == 1) {\\n\\t\\t\\t\\tmat1 = matmul(2 * Z, mat1, mat2);\\n\\t\\t\\t}\\n\\t\\t\\tmat2 = matmul(2 * Z, mat2, mat2);\\n\\t\\t\\trem /= 2;\\n\\t\\t}\\n\\t\\t\\n\\t\\t// step #4. calculate answer\\n\\t\\tvector<long double> x(2 * Z);\\n\\t\\tfor (int i = 0; i < 2 * Z; i++) {\\n\\t\\t\\tx[i] = mat1[i][0];\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < Z; i++) {\\n\\t\\t\\tfor (int j = Z; j <= Z + i; j++) {\\n\\t\\t\\t\\tp[i] += x[j - Z] * prob[j - i];\\n\\t\\t\\t\\tt[i] += x[j - Z + Z] * prob[j - i];\\n\\t\\t\\t}\\n\\t\\t\\tt[i] += p[i];\\n\\t\\t}\\n\\t}\\n\\n\\t// step #5. compute systems of linear equation\\n\\tvector<vector<long double> > mat3(Z - 1, vector<long double>(Z));\\n\\tfor (int i = 1; i < Z; i++) {\\n\\t\\tfor (int j = 1; j <= Z; j++) {\\n\\t\\t\\tint pos = abs(i - j);\\n\\t\\t\\tif (pos != 0) {\\n\\t\\t\\t\\tmat3[i - 1][pos - 1] -= prob[j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tmat3[i - 1][i - 1] += 1.0;\\n\\t\\tmat3[i - 1][Z - 1] += 1.0;\\n\\t}\\n\\tgaussian_elimination(Z - 1, mat3);\\n\\tvector<long double> e(Z);\\n\\tfor (int i = 1; i < Z; i++) {\\n\\t\\te[i] = mat3[i - 1][Z - 1];\\n\\t}\\n\\n\\t// step #6. calculate answer\\n\\tlong double ans = 0.0;\\n\\tfor (int i = 0; i < Z; i++) {\\n\\t\\tans += t[i];\\n\\t}\\n\\tfor (int i = 1; i < Z; i++) {\\n\\t\\tans += p[i] * e[i];\\n\\t}\\n\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\tlong long S; int N, K;\\n\\tcin >> S >> N >> K;\\n\\tS = abs(S);\\n\\tif (N == 1) {\\n\\t\\tcout << (S % K == 0 ? S / K : -1) << endl;\\n\\t}\\n\\telse {\\n\\t\\tlong double ans = solve(S, N, K);\\n\\t\\tcout.precision(15);\\n\\t\\tcout << fixed << ans << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 5652,\n \"score_of_the_acc\": -0.6153,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2315_7242759\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\n#include <algorithm>\\nusing namespace std;\\n\\nint S, N, K;\\ndouble D[19][109], E[109];\\ndouble Prob1[150009];\\ndouble Expc1[150009];\\ndouble Prob2[7009][109];\\ndouble Expc2[7009][109];\\ndouble ProbList[109], ExpcList[109], ExpcSecond[109];\\n\\nvoid GetFirstAns(int BASE) {\\n\\tfor (int i = 0; i <= BASE + 200; i++) Prob1[i] = 0.0;\\n\\tfor (int i = 0; i <= BASE + 200; i++) Expc1[i] = 0.0;\\n\\tProb1[0] = 1.0;\\n\\tfor (int i = 1; i <= BASE + 200; i++) {\\n\\t\\tfor (int j = 1; j <= N * K; j++) {\\n\\t\\t\\tint pre = i - j; if (pre < 0 || pre >= BASE) continue;\\n\\t\\t\\tProb1[i] += (Prob1[pre] * E[j]);\\n\\t\\t\\tExpc1[i] += (Prob1[pre] * E[j]) * (Expc1[pre] + 1.0);\\n\\t\\t}\\n\\t\\tif (Prob1[i] != 0.0) Expc1[i] /= Prob1[i];\\n\\t}\\n}\\n\\nvoid GetSecondAns() {\\n\\tfor (int i = 0; i <= 7000; i++) {\\n\\t\\tfor (int j = 0; j <= N * K; j++) Prob2[i][j] = 0.0;\\n\\t\\tfor (int j = 0; j <= N * K; j++) Expc2[i][j] = 0.0;\\n\\t}\\n\\t\\n\\t// Forward DP\\n\\tfor (int i = 1; i <= N * K; i++) Prob2[0][i] = ProbList[i];\\n\\tfor (int i = 0; i < 7000; i++) {\\n\\t\\tfor (int j = 1; j <= N * K; j++) {\\n\\t\\t\\tfor (int k = 1; k <= N * K; k++) {\\n\\t\\t\\t\\tint to = abs(j - k);\\n\\t\\t\\t\\tProb2[i + 1][to] += (Prob2[i][j] * E[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\t// Reverse DP\\n\\tfor (int i = 6999; i >= 0; i--) {\\n\\t\\tfor (int j = 1; j <= N * K; j++) {\\n\\t\\t\\tfor (int k = 1; k <= N * K; k++) {\\n\\t\\t\\t\\tint to = abs(j - k);\\n\\t\\t\\t\\tExpc2[i][j] += (1.0 * (Expc2[i + 1][to] + 1.0) * E[k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main() {\\n\\t// Input\\n\\tcin >> S >> N >> K; S = abs(S);\\n\\tif (N == 1) {\\n\\t\\tif (S % K == 0) cout << S/ K << endl;\\n\\t\\telse cout << \\\"-1\\\" << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\t// Prepare\\n\\tD[0][0] = 1.0;\\n\\tfor (int i = 0; i < K; i++) {\\n\\t\\tfor (int j = 0; j < N * K; j++) {\\n\\t\\t\\tfor (int k = 1; k <= N; k++) D[i+1][j+k] += 1.0 * D[i][j] / N;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 1; i <= N * K; i++) E[i] = D[K][i];\\n\\t\\n\\t// Get First Answer\\n\\tif (S <= N * K) {\\n\\t\\tProbList[S] = 1.0;\\n\\t\\tExpcList[S] = 0.;\\n\\t}\\n\\telse {\\n\\t\\tdouble BASE_Expc = 1.0 / (0.5 * (N + 1) * K);\\n\\t\\tint OFFSET = min(100000, S - N * K);\\n\\t\\tGetFirstAns(OFFSET);\\n\\t\\tfor (int i = 0; i <= N * K; i++) {\\n\\t\\t\\tProbList[N * K - i] = Prob1[OFFSET + i];\\n\\t\\t\\tExpcList[N * K - i] = Expc1[OFFSET + i] + 1.0 * ((S - N * K) - OFFSET) * BASE_Expc;\\n\\t\\t}\\n\\t}\\n\\t\\n\\t// Get Second Answer\\n\\tGetSecondAns();\\n\\tfor (int i = 1; i <= N * K; i++) {\\n\\t\\tExpcSecond[i] = Expc2[0][i];\\n\\t\\t//cout << i << \\\" \\\" << ProbList[i] << \\\" \\\" << ExpcSecond[i] << endl;\\n\\t}\\n\\t\\n\\t// Get Final Answer\\n\\tdouble Answer = 0.0;\\n\\tfor (int i = 1; i <= N * K; i++) Answer += (ExpcList[i] + ExpcSecond[i]) * ProbList[i];\\n\\tprintf(\\\"%.12lf\\\\n\\\", Answer);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 17084,\n \"score_of_the_acc\": -1.1056,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2315_6079635\",\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\\n#define double long double\\n\\n// N変数連立方程式(Ax=bの形)を解く\\n//\\n// 引数のAは拡大係数行列. (Ax=bでAとbをそのまま並べてつなげたもの)\\n// すなわち\\n// A[i][0] * x_0 + A[i][1] * x_1 + ... A[i][n - 1] * x_{n-1} = A[i][n]\\n// (0 <= i < n)\\n//\\n//\\n// 関数が終わったときにAの左側は単位行列になる\\n// Note: 誤差に注意\\n//\\n// Verify:\\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/1328/review/4927454/okuraofvegetable/C++17\\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/2171/review/6045411/okuraofvegetable/C++17\\n\\ndouble myabs(double a) {\\n if (a < 0.0) return -a;\\n return a;\\n}\\n\\nvector<double> solve_equation(vector<vector<double>> &A) {\\n assert(A[0].size() == A.size() + 1);\\n for (int i = 0; i < A.size(); i++) {\\n if (myabs(A[i][i]) < eps) {\\n for (int j = i + 1; j < A.size(); j++) {\\n if (abs(A[j][i]) > eps) {\\n swap(A[i], A[j]);\\n break;\\n }\\n }\\n }\\n double r = A[i][i];\\n if (myabs(r) < eps) {\\n // dmp(r);\\n return vector<double>();\\n }\\n for (int j = i; j <= A.size(); j++) { A[i][j] /= r; }\\n for (int j = i + 1; j < A.size(); j++) {\\n double s = A[j][i];\\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * s; }\\n }\\n }\\n for (int i = A.size() - 1; i > 0; i--) {\\n for (int j = 0; j < i; j++) {\\n double r = A[j][i];\\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * r; }\\n }\\n }\\n vector<double> sol;\\n for (int i = 0; i < A.size(); i++) sol.push_back(A[i][A.size()]);\\n return sol;\\n}\\n\\n// Matrix class\\n//\\n// constructor of T : T(1),T(0) must be unit of T\\n//\\n// Verified: DDCC B\\n// https://atcoder.jp/contests/ddcc2020-final/submissions/9941022\\n//\\n// Verified: determinant\\n// https://judge.yosupo.jp/submission/45201\\n//\\n\\ntemplate <class T>\\nstruct Matrix {\\n int H, W;\\n vector<vector<T>> elem;\\n Matrix(int H, int W, T val = T(0)) : H(H), W(W) {\\n elem.resize(H);\\n for (int i = 0; i < H; i++) elem[i].assign(W, val);\\n }\\n Matrix(const vector<vector<T>> &m)\\n : H(m.size()), W(m.size() ? m[0].size() : 0) {\\n elem.resize(H);\\n for (int i = 0; i < H; i++) elem[i].resize(W);\\n for (int i = 0; i < H; i++) elem[i] = m[i];\\n }\\n vector<T> &operator[](int h) { return elem[h]; }\\n static Matrix identity(int N) {\\n Matrix a(N, N);\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if (i == j)\\n a.elem[i][i] = T(1);\\n else\\n a.elem[i][j] = T(0);\\n }\\n }\\n return a;\\n }\\n Matrix operator+(const Matrix &m) const {\\n assert(H == m.H && W == m.W);\\n Matrix a(H, W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < W; j++) {\\n a.elem[i][j] = this->elem[i][j] + m.elem[i][j];\\n }\\n }\\n return a;\\n }\\n Matrix operator-(const Matrix &m) const {\\n assert(H == m.H && W == m.W);\\n Matrix a(H, W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < W; j++) {\\n a.elem[i][j] = this->elem[i][j] - m.elem[i][j];\\n }\\n }\\n return a;\\n }\\n Matrix operator*(const Matrix &m) const {\\n assert(W == m.H);\\n Matrix a(H, m.W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < m.W; j++) {\\n for (int k = 0; k < W; k++) {\\n a.elem[i][j] = a.elem[i][j] + (this->elem[i][k] * m.elem[k][j]);\\n }\\n }\\n }\\n return a;\\n }\\n Matrix &operator+=(const Matrix &m) { return *this = *this + m; }\\n Matrix &operator-=(const Matrix &m) { return *this = *this - m; }\\n Matrix &operator*=(const Matrix &m) { return *this = *this * m; }\\n Matrix pow(long long x) const {\\n Matrix a = identity(H);\\n Matrix b = *this;\\n while (x) {\\n if (x & 1) a *= b;\\n b *= b;\\n x >>= 1;\\n }\\n return a;\\n }\\n\\n T determinant() {\\n Matrix m(*this);\\n assert(m.W == m.H);\\n T ret(1);\\n for (int i = 0; i < m.H; i++) {\\n int idx = -1;\\n for (int j = i; j < m.H; j++) {\\n if (m[j][i] != T(0)) idx = j;\\n }\\n if (idx == -1) return T(0);\\n if (i != idx) {\\n ret *= T(-1);\\n swap(m[i], m[idx]);\\n }\\n ret *= m[i][i];\\n T div = m[i][i];\\n for (int j = i; j < m.W; j++) m[i][j] /= div;\\n for (int j = i + 1; j < m.H; j++) {\\n T a = m[j][i];\\n for (int k = i; k < m.W; k++) m[j][k] -= m[i][k] * a;\\n }\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const Matrix &x) {\\n for (int i = 0; i < x.H; i++) {\\n for (int j = 0; j < x.W; j++) {\\n os << x.elem[i][j];\\n if (j + 1 < x.W) cout << ' ';\\n }\\n if (i + 1 < x.H) cout << endl;\\n }\\n return os;\\n }\\n friend istream &operator>>(istream &is, Matrix &x) {\\n for (auto &v : x.elem) is >> v;\\n return is;\\n }\\n};\\n\\nvoid solve() {\\n int S, N, K;\\n cin >> S >> N >> K;\\n if (S < 0) S *= -1;\\n\\n if (N == 1) {\\n if (S % K == 0)\\n cout << S / K << endl;\\n else\\n cout << -1 << endl;\\n return;\\n }\\n\\n auto dp = vect(K + 1, vect(N * K + 1, (double)0.0));\\n dp[0][0] = 1.0;\\n for (int i = 0; i < K; i++) {\\n for (int j = 0; j <= N * K; j++) {\\n for (int k = 1; k <= N; k++) {\\n if (j + k <= N * K) dp[i + 1][j + k] += dp[i][j] * (1.0 / (double)N);\\n }\\n }\\n }\\n\\n auto A = vect(N * K, vect(N * K + 1, (double)0.0));\\n\\n A[0][0] = 1.0;\\n for (int i = 1; i < N * K; i++) {\\n for (int j = 1; j <= N * K; j++) { A[i][abs(i - j)] += dp[K][j]; }\\n A[i][i] -= 1.0;\\n A[i][N * K] = -1.0;\\n }\\n\\n // for (auto a : A) dmp(a);\\n\\n auto sol = solve_equation(A);\\n // dmp(sol);\\n if (sol.empty()) {\\n cout << -1 << endl;\\n return;\\n }\\n\\n Matrix<double> M(N * K + 1, N * K + 1);\\n Matrix<double> v(N * K + 1, 1);\\n if (S >= N * K) {\\n for (int i = 0; i < N * K; i++) { M[0][i] = dp[K][i + 1]; }\\n M[0][N * K] = 1.0;\\n for (int i = 1; i < N * K; i++) { M[i][i - 1] = 1.0; }\\n M[N * K][N * K] = 1.0;\\n M = M.pow(S - N * K + 1);\\n\\n for (int i = 0; i < N * K; i++) { v[N * K - 1 - i][0] = sol[i]; }\\n v[N * K][0] = 1.0;\\n }\\n\\n#undef double\\n if (S < N * K) {\\n cout << (double)sol[S] << endl;\\n } else {\\n cout << (double)(M * v)[0][0] << 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\": 100,\n \"memory_kb\": 4080,\n \"score_of_the_acc\": -0.106,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2315_6079634\",\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\\n#define double __float128\\n\\n// N変数連立方程式(Ax=bの形)を解く\\n//\\n// 引数のAは拡大係数行列. (Ax=bでAとbをそのまま並べてつなげたもの)\\n// すなわち\\n// A[i][0] * x_0 + A[i][1] * x_1 + ... A[i][n - 1] * x_{n-1} = A[i][n]\\n// (0 <= i < n)\\n//\\n//\\n// 関数が終わったときにAの左側は単位行列になる\\n// Note: 誤差に注意\\n//\\n// Verify:\\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/1328/review/4927454/okuraofvegetable/C++17\\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/2171/review/6045411/okuraofvegetable/C++17\\n\\ndouble abs(double a) {\\n if (a < 0.0) return -a;\\n return a;\\n}\\n\\nvector<double> solve_equation(vector<vector<double>> &A) {\\n assert(A[0].size() == A.size() + 1);\\n for (int i = 0; i < A.size(); i++) {\\n if (abs(A[i][i]) < eps) {\\n for (int j = i + 1; j < A.size(); j++) {\\n if (abs(A[j][i]) > eps) {\\n swap(A[i], A[j]);\\n break;\\n }\\n }\\n }\\n double r = A[i][i];\\n if (abs(r) < eps) {\\n // dmp(r);\\n return vector<double>();\\n }\\n for (int j = i; j <= A.size(); j++) { A[i][j] /= r; }\\n for (int j = i + 1; j < A.size(); j++) {\\n double s = A[j][i];\\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * s; }\\n }\\n }\\n for (int i = A.size() - 1; i > 0; i--) {\\n for (int j = 0; j < i; j++) {\\n double r = A[j][i];\\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * r; }\\n }\\n }\\n vector<double> sol;\\n for (int i = 0; i < A.size(); i++) sol.push_back(A[i][A.size()]);\\n return sol;\\n}\\n\\n// Matrix class\\n//\\n// constructor of T : T(1),T(0) must be unit of T\\n//\\n// Verified: DDCC B\\n// https://atcoder.jp/contests/ddcc2020-final/submissions/9941022\\n//\\n// Verified: determinant\\n// https://judge.yosupo.jp/submission/45201\\n//\\n\\ntemplate <class T>\\nstruct Matrix {\\n int H, W;\\n vector<vector<T>> elem;\\n Matrix(int H, int W, T val = T(0)) : H(H), W(W) {\\n elem.resize(H);\\n for (int i = 0; i < H; i++) elem[i].assign(W, val);\\n }\\n Matrix(const vector<vector<T>> &m)\\n : H(m.size()), W(m.size() ? m[0].size() : 0) {\\n elem.resize(H);\\n for (int i = 0; i < H; i++) elem[i].resize(W);\\n for (int i = 0; i < H; i++) elem[i] = m[i];\\n }\\n vector<T> &operator[](int h) { return elem[h]; }\\n static Matrix identity(int N) {\\n Matrix a(N, N);\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if (i == j)\\n a.elem[i][i] = T(1);\\n else\\n a.elem[i][j] = T(0);\\n }\\n }\\n return a;\\n }\\n Matrix operator+(const Matrix &m) const {\\n assert(H == m.H && W == m.W);\\n Matrix a(H, W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < W; j++) {\\n a.elem[i][j] = this->elem[i][j] + m.elem[i][j];\\n }\\n }\\n return a;\\n }\\n Matrix operator-(const Matrix &m) const {\\n assert(H == m.H && W == m.W);\\n Matrix a(H, W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < W; j++) {\\n a.elem[i][j] = this->elem[i][j] - m.elem[i][j];\\n }\\n }\\n return a;\\n }\\n Matrix operator*(const Matrix &m) const {\\n assert(W == m.H);\\n Matrix a(H, m.W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < m.W; j++) {\\n for (int k = 0; k < W; k++) {\\n a.elem[i][j] = a.elem[i][j] + (this->elem[i][k] * m.elem[k][j]);\\n }\\n }\\n }\\n return a;\\n }\\n Matrix &operator+=(const Matrix &m) { return *this = *this + m; }\\n Matrix &operator-=(const Matrix &m) { return *this = *this - m; }\\n Matrix &operator*=(const Matrix &m) { return *this = *this * m; }\\n Matrix pow(long long x) const {\\n Matrix a = identity(H);\\n Matrix b = *this;\\n while (x) {\\n if (x & 1) a *= b;\\n b *= b;\\n x >>= 1;\\n }\\n return a;\\n }\\n\\n T determinant() {\\n Matrix m(*this);\\n assert(m.W == m.H);\\n T ret(1);\\n for (int i = 0; i < m.H; i++) {\\n int idx = -1;\\n for (int j = i; j < m.H; j++) {\\n if (m[j][i] != T(0)) idx = j;\\n }\\n if (idx == -1) return T(0);\\n if (i != idx) {\\n ret *= T(-1);\\n swap(m[i], m[idx]);\\n }\\n ret *= m[i][i];\\n T div = m[i][i];\\n for (int j = i; j < m.W; j++) m[i][j] /= div;\\n for (int j = i + 1; j < m.H; j++) {\\n T a = m[j][i];\\n for (int k = i; k < m.W; k++) m[j][k] -= m[i][k] * a;\\n }\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const Matrix &x) {\\n for (int i = 0; i < x.H; i++) {\\n for (int j = 0; j < x.W; j++) {\\n os << x.elem[i][j];\\n if (j + 1 < x.W) cout << ' ';\\n }\\n if (i + 1 < x.H) cout << endl;\\n }\\n return os;\\n }\\n friend istream &operator>>(istream &is, Matrix &x) {\\n for (auto &v : x.elem) is >> v;\\n return is;\\n }\\n};\\n\\nvoid solve() {\\n int S, N, K;\\n cin >> S >> N >> K;\\n if (S < 0) S *= -1;\\n\\n auto dp = vect(K + 1, vect(N * K + 1, (double)0.0));\\n dp[0][0] = 1.0;\\n for (int i = 0; i < K; i++) {\\n for (int j = 0; j <= N * K; j++) {\\n for (int k = 1; k <= N; k++) {\\n if (j + k <= N * K) dp[i + 1][j + k] += dp[i][j] * (1.0 / (double)N);\\n }\\n }\\n }\\n\\n auto A = vect(N * K, vect(N * K + 1, (double)0.0));\\n\\n A[0][0] = 1.0;\\n for (int i = 1; i < N * K; i++) {\\n for (int j = 1; j <= N * K; j++) { A[i][abs(i - j)] += dp[K][j]; }\\n A[i][i] -= 1.0;\\n A[i][N * K] = -1.0;\\n }\\n\\n // for (auto a : A) dmp(a);\\n\\n auto sol = solve_equation(A);\\n // dmp(sol);\\n if (sol.empty()) {\\n cout << -1 << endl;\\n return;\\n }\\n\\n Matrix<double> M(N * K + 1, N * K + 1);\\n Matrix<double> v(N * K + 1, 1);\\n if (S >= N * K) {\\n for (int i = 0; i < N * K; i++) { M[0][i] = dp[K][i + 1]; }\\n M[0][N * K] = 1.0;\\n for (int i = 1; i < N * K; i++) { M[i][i - 1] = 1.0; }\\n M[N * K][N * K] = 1.0;\\n M = M.pow(S - N * K + 1);\\n\\n for (int i = 0; i < N * K; i++) { v[N * K - 1 - i][0] = sol[i]; }\\n v[N * K][0] = 1.0;\\n }\\n\\n#undef double\\n if (S < N * K) {\\n cout << (double)sol[S] << endl;\\n } else {\\n cout << (double)(M * v)[0][0] << 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\": 0.1935483870967742,\n \"time_ms\": 1440,\n \"memory_kb\": 4148,\n \"score_of_the_acc\": -1.0547,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2315_6079630\",\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\\n#define double long double\\n\\n// N変数連立方程式(Ax=bの形)を解く\\n//\\n// 引数のAは拡大係数行列. (Ax=bでAとbをそのまま並べてつなげたもの)\\n// すなわち\\n// A[i][0] * x_0 + A[i][1] * x_1 + ... A[i][n - 1] * x_{n-1} = A[i][n]\\n// (0 <= i < n)\\n//\\n//\\n// 関数が終わったときにAの左側は単位行列になる\\n// Note: 誤差に注意\\n//\\n// Verify:\\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/1328/review/4927454/okuraofvegetable/C++17\\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/2171/review/6045411/okuraofvegetable/C++17\\n\\nvector<double> solve_equation(vector<vector<double>> &A) {\\n assert(A[0].size() == A.size() + 1);\\n for (int i = 0; i < A.size(); i++) {\\n if (abs(A[i][i]) < eps) {\\n for (int j = i + 1; j < A.size(); j++) {\\n if (abs(A[j][i]) > eps) {\\n swap(A[i], A[j]);\\n break;\\n }\\n }\\n }\\n double r = A[i][i];\\n if (abs(r) < eps) {\\n dmp(r);\\n return vector<double>();\\n }\\n for (int j = i; j <= A.size(); j++) { A[i][j] /= r; }\\n for (int j = i + 1; j < A.size(); j++) {\\n double s = A[j][i];\\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * s; }\\n }\\n }\\n for (int i = A.size() - 1; i > 0; i--) {\\n for (int j = 0; j < i; j++) {\\n double r = A[j][i];\\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * r; }\\n }\\n }\\n vector<double> sol;\\n for (int i = 0; i < A.size(); i++) sol.push_back(A[i][A.size()]);\\n return sol;\\n}\\n\\n// Matrix class\\n//\\n// constructor of T : T(1),T(0) must be unit of T\\n//\\n// Verified: DDCC B\\n// https://atcoder.jp/contests/ddcc2020-final/submissions/9941022\\n//\\n// Verified: determinant\\n// https://judge.yosupo.jp/submission/45201\\n//\\n\\ntemplate <class T>\\nstruct Matrix {\\n int H, W;\\n vector<vector<T>> elem;\\n Matrix(int H, int W, T val = T(0)) : H(H), W(W) {\\n elem.resize(H);\\n for (int i = 0; i < H; i++) elem[i].assign(W, val);\\n }\\n Matrix(const vector<vector<T>> &m)\\n : H(m.size()), W(m.size() ? m[0].size() : 0) {\\n elem.resize(H);\\n for (int i = 0; i < H; i++) elem[i].resize(W);\\n for (int i = 0; i < H; i++) elem[i] = m[i];\\n }\\n vector<T> &operator[](int h) { return elem[h]; }\\n static Matrix identity(int N) {\\n Matrix a(N, N);\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if (i == j)\\n a.elem[i][i] = T(1);\\n else\\n a.elem[i][j] = T(0);\\n }\\n }\\n return a;\\n }\\n Matrix operator+(const Matrix &m) const {\\n assert(H == m.H && W == m.W);\\n Matrix a(H, W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < W; j++) {\\n a.elem[i][j] = this->elem[i][j] + m.elem[i][j];\\n }\\n }\\n return a;\\n }\\n Matrix operator-(const Matrix &m) const {\\n assert(H == m.H && W == m.W);\\n Matrix a(H, W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < W; j++) {\\n a.elem[i][j] = this->elem[i][j] - m.elem[i][j];\\n }\\n }\\n return a;\\n }\\n Matrix operator*(const Matrix &m) const {\\n assert(W == m.H);\\n Matrix a(H, m.W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < m.W; j++) {\\n for (int k = 0; k < W; k++) {\\n a.elem[i][j] = a.elem[i][j] + (this->elem[i][k] * m.elem[k][j]);\\n }\\n }\\n }\\n return a;\\n }\\n Matrix &operator+=(const Matrix &m) { return *this = *this + m; }\\n Matrix &operator-=(const Matrix &m) { return *this = *this - m; }\\n Matrix &operator*=(const Matrix &m) { return *this = *this * m; }\\n Matrix pow(long long x) const {\\n Matrix a = identity(H);\\n Matrix b = *this;\\n while (x) {\\n if (x & 1) a *= b;\\n b *= b;\\n x >>= 1;\\n }\\n return a;\\n }\\n\\n T determinant() {\\n Matrix m(*this);\\n assert(m.W == m.H);\\n T ret(1);\\n for (int i = 0; i < m.H; i++) {\\n int idx = -1;\\n for (int j = i; j < m.H; j++) {\\n if (m[j][i] != T(0)) idx = j;\\n }\\n if (idx == -1) return T(0);\\n if (i != idx) {\\n ret *= T(-1);\\n swap(m[i], m[idx]);\\n }\\n ret *= m[i][i];\\n T div = m[i][i];\\n for (int j = i; j < m.W; j++) m[i][j] /= div;\\n for (int j = i + 1; j < m.H; j++) {\\n T a = m[j][i];\\n for (int k = i; k < m.W; k++) m[j][k] -= m[i][k] * a;\\n }\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const Matrix &x) {\\n for (int i = 0; i < x.H; i++) {\\n for (int j = 0; j < x.W; j++) {\\n os << x.elem[i][j];\\n if (j + 1 < x.W) cout << ' ';\\n }\\n if (i + 1 < x.H) cout << endl;\\n }\\n return os;\\n }\\n friend istream &operator>>(istream &is, Matrix &x) {\\n for (auto &v : x.elem) is >> v;\\n return is;\\n }\\n};\\n\\nvoid solve() {\\n int S, N, K;\\n cin >> S >> N >> K;\\n if (S < 0) S *= -1;\\n\\n auto dp = vect(K + 1, vect(N * K + 1, 0.0));\\n dp[0][0] = 1.0;\\n for (int i = 0; i < K; i++) {\\n for (int j = 0; j <= N * K; j++) {\\n for (int k = 1; k <= N; k++) {\\n if (j + k <= N * K) dp[i + 1][j + k] += dp[i][j] * (1.0 / N);\\n }\\n }\\n }\\n\\n auto A = vect(N * K, vect(N * K + 1, (double)0.0));\\n\\n A[0][0] = 1.0;\\n for (int i = 1; i < N * K; i++) {\\n for (int j = 1; j <= N * K; j++) { A[i][abs(i - j)] += dp[K][j]; }\\n A[i][i] -= 1.0;\\n A[i][N * K] = -1.0;\\n }\\n\\n // for (auto a : A) dmp(a);\\n\\n auto sol = solve_equation(A);\\n // dmp(sol);\\n if (sol.empty()) {\\n cout << -1 << endl;\\n return;\\n }\\n\\n if (S < N * K) {\\n cout << sol[S] << endl;\\n return;\\n }\\n\\n Matrix<double> M(N * K + 1, N * K + 1);\\n for (int i = 0; i < N * K; i++) { M[0][i] = dp[K][i + 1]; }\\n M[0][N * K] = 1.0;\\n for (int i = 1; i < N * K; i++) { M[i][i - 1] = 1.0; }\\n M[N * K][N * K] = 1.0;\\n M = M.pow(S - N * K + 1);\\n\\n Matrix<double> v(N * K + 1, 1);\\n for (int i = 0; i < N * K; i++) { v[N * K - 1 - i][0] = sol[i]; }\\n v[N * K][0] = 1.0;\\n cout << (M * v)[0][0] << 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\": 0.1935483870967742,\n \"time_ms\": 100,\n \"memory_kb\": 4204,\n \"score_of_the_acc\": -0.1151,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2315_6079625\",\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\\n// N変数連立方程式(Ax=bの形)を解く\\n//\\n// 引数のAは拡大係数行列. (Ax=bでAとbをそのまま並べてつなげたもの)\\n// すなわち\\n// A[i][0] * x_0 + A[i][1] * x_1 + ... A[i][n - 1] * x_{n-1} = A[i][n]\\n// (0 <= i < n)\\n//\\n//\\n// 関数が終わったときにAの左側は単位行列になる\\n// Note: 誤差に注意\\n//\\n// Verify:\\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/1328/review/4927454/okuraofvegetable/C++17\\n// https://onlinejudge.u-aizu.ac.jp/solutions/problem/2171/review/6045411/okuraofvegetable/C++17\\n\\nvector<double> solve_equation(vector<vector<double>> &A) {\\n assert(A[0].size() == A.size() + 1);\\n for (int i = 0; i < A.size(); i++) {\\n if (abs(A[i][i]) < eps) {\\n for (int j = i + 1; j < A.size(); j++) {\\n if (abs(A[j][i]) > eps) {\\n swap(A[i], A[j]);\\n break;\\n }\\n }\\n }\\n double r = A[i][i];\\n if (abs(r) < eps) {\\n dmp(r);\\n return vector<double>();\\n }\\n for (int j = i; j <= A.size(); j++) { A[i][j] /= r; }\\n for (int j = i + 1; j < A.size(); j++) {\\n double s = A[j][i];\\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * s; }\\n }\\n }\\n for (int i = A.size() - 1; i > 0; i--) {\\n for (int j = 0; j < i; j++) {\\n double r = A[j][i];\\n for (int k = i; k <= A.size(); k++) { A[j][k] -= A[i][k] * r; }\\n }\\n }\\n vector<double> sol;\\n for (int i = 0; i < A.size(); i++) sol.push_back(A[i][A.size()]);\\n return sol;\\n}\\n\\n// Matrix class\\n//\\n// constructor of T : T(1),T(0) must be unit of T\\n//\\n// Verified: DDCC B\\n// https://atcoder.jp/contests/ddcc2020-final/submissions/9941022\\n//\\n// Verified: determinant\\n// https://judge.yosupo.jp/submission/45201\\n//\\n\\ntemplate <class T>\\nstruct Matrix {\\n int H, W;\\n vector<vector<T>> elem;\\n Matrix(int H, int W, T val = T(0)) : H(H), W(W) {\\n elem.resize(H);\\n for (int i = 0; i < H; i++) elem[i].assign(W, val);\\n }\\n Matrix(const vector<vector<T>> &m)\\n : H(m.size()), W(m.size() ? m[0].size() : 0) {\\n elem.resize(H);\\n for (int i = 0; i < H; i++) elem[i].resize(W);\\n for (int i = 0; i < H; i++) elem[i] = m[i];\\n }\\n vector<T> &operator[](int h) { return elem[h]; }\\n static Matrix identity(int N) {\\n Matrix a(N, N);\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if (i == j)\\n a.elem[i][i] = T(1);\\n else\\n a.elem[i][j] = T(0);\\n }\\n }\\n return a;\\n }\\n Matrix operator+(const Matrix &m) const {\\n assert(H == m.H && W == m.W);\\n Matrix a(H, W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < W; j++) {\\n a.elem[i][j] = this->elem[i][j] + m.elem[i][j];\\n }\\n }\\n return a;\\n }\\n Matrix operator-(const Matrix &m) const {\\n assert(H == m.H && W == m.W);\\n Matrix a(H, W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < W; j++) {\\n a.elem[i][j] = this->elem[i][j] - m.elem[i][j];\\n }\\n }\\n return a;\\n }\\n Matrix operator*(const Matrix &m) const {\\n assert(W == m.H);\\n Matrix a(H, m.W);\\n for (int i = 0; i < H; i++) {\\n for (int j = 0; j < m.W; j++) {\\n for (int k = 0; k < W; k++) {\\n a.elem[i][j] = a.elem[i][j] + (this->elem[i][k] * m.elem[k][j]);\\n }\\n }\\n }\\n return a;\\n }\\n Matrix &operator+=(const Matrix &m) { return *this = *this + m; }\\n Matrix &operator-=(const Matrix &m) { return *this = *this - m; }\\n Matrix &operator*=(const Matrix &m) { return *this = *this * m; }\\n Matrix pow(long long x) const {\\n Matrix a = identity(H);\\n Matrix b = *this;\\n while (x) {\\n if (x & 1) a *= b;\\n b *= b;\\n x >>= 1;\\n }\\n return a;\\n }\\n\\n T determinant() {\\n Matrix m(*this);\\n assert(m.W == m.H);\\n T ret(1);\\n for (int i = 0; i < m.H; i++) {\\n int idx = -1;\\n for (int j = i; j < m.H; j++) {\\n if (m[j][i] != T(0)) idx = j;\\n }\\n if (idx == -1) return T(0);\\n if (i != idx) {\\n ret *= T(-1);\\n swap(m[i], m[idx]);\\n }\\n ret *= m[i][i];\\n T div = m[i][i];\\n for (int j = i; j < m.W; j++) m[i][j] /= div;\\n for (int j = i + 1; j < m.H; j++) {\\n T a = m[j][i];\\n for (int k = i; k < m.W; k++) m[j][k] -= m[i][k] * a;\\n }\\n }\\n return ret;\\n }\\n\\n friend ostream &operator<<(ostream &os, const Matrix &x) {\\n for (int i = 0; i < x.H; i++) {\\n for (int j = 0; j < x.W; j++) {\\n os << x.elem[i][j];\\n if (j + 1 < x.W) cout << ' ';\\n }\\n if (i + 1 < x.H) cout << endl;\\n }\\n return os;\\n }\\n friend istream &operator>>(istream &is, Matrix &x) {\\n for (auto &v : x.elem) is >> v;\\n return is;\\n }\\n};\\n\\nvoid solve() {\\n int S, N, K;\\n cin >> S >> N >> K;\\n if (S < 0) S *= -1;\\n\\n auto dp = vect(K + 1, vect(N * K + 1, 0.0));\\n dp[0][0] = 1.0;\\n for (int i = 0; i < K; i++) {\\n for (int j = 0; j <= N * K; j++) {\\n for (int k = 1; k <= N; k++) {\\n if (j + k <= N * K) dp[i + 1][j + k] += dp[i][j] * (1.0 / N);\\n }\\n }\\n }\\n\\n auto A = vect(N * K, vect(N * K + 1, 0.0));\\n\\n A[0][0] = 1.0;\\n for (int i = 1; i < N * K; i++) {\\n for (int j = 1; j <= N * K; j++) { A[i][abs(i - j)] += dp[K][j]; }\\n A[i][i] -= 1.0;\\n A[i][N * K] = -1.0;\\n }\\n\\n // for (auto a : A) dmp(a);\\n\\n auto sol = solve_equation(A);\\n // dmp(sol);\\n if (sol.empty()) {\\n cout << -1 << endl;\\n return;\\n }\\n\\n if (S < N * K) {\\n cout << sol[S] << endl;\\n return;\\n }\\n\\n Matrix<double> M(N * K + 1, N * K + 1);\\n for (int i = 0; i < N * K; i++) { M[0][i] = dp[K][i + 1]; }\\n M[0][N * K] = 1.0;\\n for (int i = 1; i < N * K; i++) { M[i][i - 1] = 1.0; }\\n M[N * K][N * K] = 1.0;\\n M = M.pow(S - N * K + 1);\\n\\n Matrix<double> v(N * K + 1, 1);\\n for (int i = 0; i < N * K; i++) { v[N * K - 1 - i][0] = sol[i]; }\\n v[N * K][0] = 1.0;\\n cout << (M * v)[0][0] << 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\": 0.1935483870967742,\n \"time_ms\": 30,\n \"memory_kb\": 3836,\n \"score_of_the_acc\": -0.0389,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2315_5958475\",\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=105,INF=1<<29;\\n\\nconst double eps=1e-8;\\ntypedef vector<double> vec;\\ntypedef vector<vec> mat;\\n\\nvec gauss_jordan(const mat& A,const vec &b){\\n int n=A.size();\\n mat B(n,vec(n+1));\\n \\n for(int i=0;i<n;i++) for(int j=0;j<n;j++) B[i][j]=A[i][j];\\n \\n for(int i=0;i<n;i++) B[i][n]=b[i];\\n \\n for(int i=0;i<n;i++){\\n int pivot=i;\\n for(int j=i;j<n;j++){\\n if(abs(B[j][i])>abs(B[pivot][i])) pivot=j;\\n }\\n swap(B[i],B[pivot]);\\n \\n if(abs(B[i][i])<eps) return vec();\\n \\n for(int j=i+1;j<=n;j++) B[i][j]/=B[i][i];\\n for(int j=0;j<n;j++){\\n if(i!=j){\\n for(int k=i+1;k<=n;k++) B[j][k]-=B[j][i]*B[i][k];\\n }\\n }\\n }\\n \\n vec x(n);\\n \\n for(int i=0;i<n;i++) x[i]=B[i][n];\\n return x;\\n}\\n\\nmat mul(mat &A, mat&B){\\n mat C(A.size(),vec(B[0].size()));\\n for(int i=0;i<A.size();i++){\\n for(int k=0;k<B.size();k++){\\n for(int j=0;j<B[0].size();j++){\\n C[i][j]+=A[i][k]*B[k][j];\\n }\\n }\\n }\\n return C;\\n}\\n\\nmat pow(mat A,ll n){\\n mat B(A.size(),vec(A.size()));\\n for(int i=0;i<A.size();i++){\\n B[i][i]=1;\\n }\\n \\n while(n>0){\\n if(n&1) B=mul(B,A);\\n A=mul(A,A);\\n n/=2;\\n }\\n return B;\\n}\\n\\n\\ndouble dp[MAX][MAX];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n int S,N,K;cin>>S>>N>>K;\\n S=abs(S);\\n if(S==0){\\n cout<<0<<endl;\\n return 0;\\n }\\n if(N==1){\\n if(S%K==0) cout<<S/K<<endl;\\n else cout<<-1<<endl;\\n return 0;\\n }\\n \\n dp[0][0]=1;\\n for(int i=0;i<K;i++){\\n for(int j=0;j<=i*N;j++){\\n for(int k=1;k<=N;k++){\\n dp[i+1][j+k]+=dp[i][j]/N;\\n }\\n }\\n }\\n \\n mat A(N*K+1,vec(N*K+1));\\n vec B(N*K+1,1);\\n A[0][0]=1;\\n B[0]=0;\\n \\n for(int i=1;i<=N*K;i++){\\n A[i][i]=1;\\n for(int j=1;j<=N*K;j++){\\n A[i][abs(i-j)]-=dp[K][j];\\n }\\n }\\n \\n auto C=gauss_jordan(A,B);\\n \\n if(S<=N*K){\\n cout<<fixed<<setprecision(25)<<C[S]<<endl;\\n return 0;\\n }\\n \\n mat D(N*K+1,vec(N*K+1));\\n for(int j=0;j<N*K;j++) D[0][j]=dp[K][j+1];\\n D[0][N*K]=1;\\n for(int i=1;i<N*K;i++){\\n D[i][i-1]=1;\\n }\\n D[N*K][N*K]=1;\\n \\n D=pow(D,S-1);\\n \\n mat E(N*K+1,vec(1));\\n for(int i=0;i<N*K;i++) E[i][0]=C[N*K-i];\\n E[N*K][0]=1;\\n \\n auto F=mul(D,E);\\n \\n cout<<fixed<<setprecision(25)<<F[N*K-1][0]<<endl;\\n \\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3936,\n \"score_of_the_acc\": -0.0392,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2315_5875615\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nvector<vector<double>> matrix_multiplication(vector<vector<double>> &A, vector<vector<double>> &B){\\n int N = A.size();\\n vector<vector<double>> C(N, vector<double>(N, 0));\\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[i][k] += A[i][j] * B[j][k];\\n }\\n }\\n }\\n return C;\\n}\\nvector<vector<double>> matrix_exponentiation(vector<vector<double>> &A, int x){\\n int N = A.size();\\n vector<vector<double>> B(N, vector<double>(N, 0));\\n for (int i = 0; i < N; i++){\\n B[i][i] = 1;\\n }\\n while (x > 0){\\n if (x % 2 == 1){\\n B = matrix_multiplication(B, A);\\n }\\n A = matrix_multiplication(A, A);\\n x /= 2;\\n }\\n return B;\\n}\\nint main(){\\n cout << fixed << setprecision(20);\\n int S, N, K;\\n cin >> S >> N >> K;\\n if (N == 1){\\n if (S % K != 0){\\n cout << -1 << endl;\\n } else {\\n cout << abs(S) / K << endl;\\n }\\n } else {\\n vector<vector<double>> dp(K + 1, vector<double>(N * K + 1, 0));\\n dp[0][0] = 1;\\n for (int i = 0; i < K; i++){\\n for (int j = i; j <= i * N; j++){\\n for (int k = 1; k <= N; k++){\\n dp[i + 1][j + k] += dp[i][j] / N;\\n }\\n }\\n }\\n vector<vector<double>> A(N * K, vector<double>(N * K + 1, 0));\\n for (int i = 0; i < N * K; i++){\\n A[i][i] = 1;\\n if (i > 0){\\n A[i][N * K] = 1;\\n for (int j = K; j <= N * K; j++){\\n int i2 = abs(i - j);\\n A[i][i2] -= dp[K][j];\\n }\\n }\\n }\\n for (int i = 0; i < N * K; i++){\\n int p = i;\\n for (int j = i + 1; j < N * K; j++){\\n if (abs(A[j][i]) > abs(A[p][i])){\\n p = j;\\n }\\n }\\n swap(A[i], A[p]);\\n for (int j = N * K; j >= i; j--){\\n A[i][j] /= A[i][i];\\n }\\n for (int j = 0; j < N * K; j++){\\n if (j != i){\\n for (int k = N * K; k >= i; k--){\\n A[j][k] -= A[j][i] * A[i][k];\\n }\\n }\\n }\\n }\\n vector<double> B(N * K);\\n for (int i = 0; i < N * K; i++){\\n B[i] = A[i][N * K];\\n }\\n S = abs(S);\\n if (S < N * K){\\n cout << B[S] << endl;\\n } else {\\n vector<vector<double>> M(N * K + 1, vector<double>(N * K + 1, 0));\\n for (int i = K; i <= N * K; i++){\\n M[i - 1][0] = dp[K][i];\\n }\\n M[N * K][0] = 1;\\n for (int i = 1; i < N * K; i++){\\n M[i - 1][i] = 1;\\n }\\n M[N * K][N * K] = 1;\\n M = matrix_exponentiation(M, S - N * K + 1);\\n double ans = 0;\\n for (int i = 0; i < N * K; i++){\\n ans += M[i][0] * B[N * K - 1 - i];\\n }\\n ans += M[N * K][0];\\n cout << ans << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3772,\n \"score_of_the_acc\": -0.0272,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2315_5875592\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nvector<vector<double>> matrix_multiplication(vector<vector<double>> &A, vector<vector<double>> &B){\\n int N = A.size();\\n vector<vector<double>> C(N, vector<double>(N, 0));\\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[i][k] += A[i][j] * B[j][k];\\n }\\n }\\n }\\n return C;\\n}\\nvector<vector<double>> matrix_exponentiation(vector<vector<double>> &A, int x){\\n int N = A.size();\\n vector<vector<double>> B(N, vector<double>(N, 0));\\n for (int i = 0; i < N; i++){\\n B[i][i] = 1;\\n }\\n while (x > 0){\\n if (x % 2 == 1){\\n B = matrix_multiplication(B, A);\\n }\\n A = matrix_multiplication(A, A);\\n x /= 2;\\n }\\n return B;\\n}\\nint main(){\\n cout << fixed << setprecision(5);\\n int S, N, K;\\n cin >> S >> N >> K;\\n vector<vector<double>> dp(K + 1, vector<double>(N * K + 1, 0));\\n dp[0][0] = 1;\\n for (int i = 0; i < K; i++){\\n for (int j = i; j <= i * N; j++){\\n for (int k = 1; k <= N; k++){\\n dp[i + 1][j + k] += dp[i][j] / N;\\n }\\n }\\n }\\n vector<vector<double>> A(N * K, vector<double>(N * K + 1, 0));\\n for (int i = 0; i < N * K; i++){\\n A[i][i] = 1;\\n if (i > 0){\\n A[i][N * K] = 1;\\n for (int j = K; j <= N * K; j++){\\n int i2 = abs(i - j);\\n A[i][i2] -= dp[K][j];\\n }\\n }\\n }\\n for (int i = 0; i < N * K; i++){\\n int p = i;\\n for (int j = i + 1; j < N * K; j++){\\n if (abs(A[j][i]) > abs(A[p][i])){\\n p = j;\\n }\\n }\\n swap(A[i], A[p]);\\n for (int j = N * K; j >= i; j--){\\n A[i][j] /= A[i][i];\\n }\\n for (int j = 0; j < N * K; j++){\\n if (j != i){\\n for (int k = N * K; k >= i; k--){\\n A[j][k] -= A[j][i] * A[i][k];\\n }\\n }\\n }\\n }\\n vector<double> B(N * K);\\n for (int i = 0; i < N * K; i++){\\n B[i] = A[i][N * K];\\n }\\n S = abs(S);\\n if (S < N * K){\\n cout << B[S] << endl;\\n } else {\\n vector<vector<double>> M(N * K + 1, vector<double>(N * K + 1, 0));\\n for (int i = K; i <= N * K; i++){\\n M[i - 1][0] = dp[K][i];\\n }\\n M[N * K][0] = 1;\\n for (int i = 1; i < N * K; i++){\\n M[i - 1][i] = 1;\\n }\\n M[N * K][N * K] = 1;\\n M = matrix_exponentiation(M, S - N * K + 1);\\n double ans = 0;\\n for (int i = 0; i < N * K; i++){\\n ans += M[i][0] * B[N * K - 1 - i];\\n }\\n ans += M[N * K][0];\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 0.1935483870967742,\n \"time_ms\": 20,\n \"memory_kb\": 3864,\n \"score_of_the_acc\": -0.0339,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2315_5868209\",\n \"code_snippet\": \"/*\\tauthor: Kite_kuma\\n\\tcreated: 2021.09.10 16:11:11 */\\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 geometry_light\\n\\nusing Real = long double;\\nusing R = Real;\\nusing Point = std::complex<Real>;\\nusing Vec = Point;\\nconst Real EPS = 1e-10, PI = acos(-1);\\n\\ninline bool eq(const Real &a, const Real &b) { return fabs(b - a) < EPS; }\\ninline bool eq(const Point &a, const Point &b) { return fabs(b - a) < EPS; }\\n/*\\n\\t-1: a < b\\n\\t0 : a == b\\n\\t1 : a > b\\n*/\\ninline int compare(const Real &a, const Real &b) { return eq(a, b) ? 0 : a < b ? -1 : 1; }\\ninline int sign(const Real &a) { return fabs(a) < EPS ? 0 : a < 0 ? -1 : 1; }\\n\\nnamespace std {\\nconst Point operator*(const Point &p, const Real &d) { return Point(real(p) * d, imag(p) * d); }\\n} // namespace std\\n\\nstd::istream &operator>>(std::istream &is, Point &p) {\\n\\tReal a, b;\\n\\tis >> a >> b;\\n\\tp = Point(a, b);\\n\\treturn is;\\n}\\nstd::ostream &operator<<(std::ostream &os, Point &p) { return os << std::fixed << std::setprecision(10) << p.real() << \\\" \\\" << p.imag(); }\\n\\n// rotate point 'p' for counter clockwise direction\\nconst Point rotate(const Real &theta, const Point &p) {\\n\\treturn Point(cos(theta) * p.real() - sin(theta) * p.imag(), sin(theta) * p.real() + cos(theta) * p.imag());\\n}\\n\\nconst Real radian_to_degree(const Real &r) { return (r * 180.0 / PI); }\\n\\nconst Real degree_to_radian(const Real &d) { return (d * PI / 180.0); }\\n\\n// get angle a-b-c (<pi)\\nconst Real get_angle(const Point &a, const Point &b, const Point &c) {\\n\\tconst Point v(a - b), w(c - b);\\n\\tReal theta = fabs(atan2(w.imag(), w.real()) - atan2(v.imag(), v.real()));\\n\\treturn std::min(theta, 2 * PI - theta);\\n}\\n\\nnamespace std {\\nbool operator<(const Point &a, const Point &b) { return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag(); }\\n} // namespace std\\n\\nstruct Line {\\n\\tPoint a, b;\\n\\n\\tLine() = default;\\n\\n\\tLine(Point a, Point b) : a(a), b(b) {}\\n\\n\\tLine(Real A, Real B, Real C) // Ax + By = C\\n\\t{\\n\\t\\tif(eq(A, 0))\\n\\t\\t\\ta = Point(0, C / B), b = Point(1, C / B);\\n\\t\\telse if(eq(B, 0))\\n\\t\\t\\tb = Point(C / A, 0), b = Point(C / A, 1);\\n\\t\\telse\\n\\t\\t\\ta = Point(0, C / B), b = Point(C / A, 0);\\n\\t}\\n\\n\\tfriend std::ostream &operator<<(std::ostream &os, Line &p) { return os << p.a << \\\" -- \\\" << p.b; }\\n\\n\\tfriend std::istream &operator>>(std::istream &is, Line &a) { return is >> a.a >> a.b; }\\n};\\n\\nstruct Segment : Line {\\n\\tSegment() = default;\\n\\n\\tSegment(Point a, Point b) : Line(a, b) {}\\n};\\n\\nstruct Circle {\\n\\tPoint p;\\n\\tReal r;\\n\\n\\tCircle() = default;\\n\\n\\tCircle(Point p, Real r) : p(p), r(r) {}\\n};\\n\\nusing Points = std::vector<Point>;\\nusing Polygon = std::vector<Point>;\\nusing Segments = std::vector<Segment>;\\nusing Lines = std::vector<Line>;\\nusing Circles = std::vector<Circle>;\\n\\nconst Real cross(const Point &a, const Point &b) { return real(a) * imag(b) - imag(a) * real(b); }\\nconst Real dot(const Point &a, const Point &b) { return real(a) * real(b) + imag(a) * imag(b); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\\nconst int ccw(const Point &a, Point b, Point c) {\\n\\tb = b - a, c = c - a;\\n\\tif(cross(b, c) > EPS) return +1;\\t\\t// \\\"COUNTER_CLOCKWISE\\\"\\n\\tif(cross(b, c) < -EPS) return -1;\\t\\t// \\\"CLOCKWISE\\\"\\n\\tif(dot(b, c) < -EPS) return +2;\\t\\t\\t// \\\"ONLINE_BACK\\\"\\n\\tif(norm(b) + EPS < norm(c)) return -2;\\t// \\\"ONLINE_FRONT\\\"\\n\\treturn 0;\\t\\t\\t\\t\\t\\t\\t\\t// \\\"ON_SEGMENT\\\"\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool parallel(const Line &a, const Line &b) { return eq(cross(a.b - a.a, b.b - b.a), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\\nbool orthogonal(const Line &a, const Line &b) { return eq(dot(a.a - a.b, b.a - b.b), 0.0); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\\nPoint projection(const Line &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\nPoint projection(const Segment &l, const Point &p) {\\n\\tdouble t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n\\treturn l.a + (l.a - l.b) * t;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\\nPoint reflection(const Line &l, const Point &p) { return projection(l, p) * 2.0 - p; }\\n\\nint intersect(const Line &l, const Point &p) { return int(abs(ccw(l.a, l.b, p)) != 1); }\\n\\nint intersect(const Line &l, const Line &m) {\\n\\tif(intersect(l, m.a) && intersect(l, m.b)) return -1;\\n\\treturn int(abs(cross(l.b - l.a, m.b - m.a)) > EPS);\\n}\\n\\nint intersect(const Segment &s, const Point &p) { return int(ccw(s.a, s.b, p) == 0); }\\n\\nint intersect(const Line &l, const Segment &s) {\\n\\tif(intersect(l, s.a) && intersect(l, s.b)) return -1;\\n\\treturn 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\\nint intersect(const Circle &c, const Line &l) {\\n\\tReal d = c.r - distance(l, c.p);\\n\\treturn fabs(d) < EPS ? 1 : d > 0. ? 2 : 0;\\n}\\n\\nint intersect(const Circle &c, const Point &p) { return int(abs(abs(p - c.p) - c.r) < EPS); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\\nint intersect(const Segment &s, const Segment &t) {\\n\\tif(eq(s.a, s.b)) return intersect(t, s.a);\\n\\tif(intersect(Line(s), t.a) && intersect(Line(s), t.b) &&\\n\\t std::max(std::min(s.a, s.b), std::min(t.a, t.b)) < std::min(std::max(s.a, s.b), std::max(t.a, t.b)))\\n\\t\\treturn -1;\\n\\treturn int(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\\tconst Point h = projection(l, c.p);\\n\\tif(norm(h - c.p) - c.r * c.r > EPS) return 0;\\n\\tauto d1 = abs(c.p - l.a), d2 = abs(c.p - l.b);\\n\\tif(compare(d1, c.r) == -1 && compare(d2, c.r) == -1) return 0;\\n\\tif(d1 < c.r - EPS && d2 > c.r - EPS || d1 > c.r - EPS && d2 < c.r - EPS) return 1;\\n\\treturn dot(l.a - h, l.b - h) < 0 ? 2 : 0;\\n}\\n\\nReal distance(const Point &a, const Point &b);\\n\\nint number_of_common_tangents(const Circle &c1, const Circle &c2) {\\n\\tReal r1 = std::min(c1.r, c2.r), r2 = std::max(c1.r, c2.r), d = distance(c1.p, c2.p);\\n\\tint com = compare(r1 + r2, d);\\n\\treturn com == 1 ? compare(d + r1, r2) + 1 : 3 - com;\\n\\t// if(c1.r < c2.r) swap(c1, c2);\\n\\t// Real d = abs(c1.p - c2.p);\\n\\t// if(compare(c1.r + c2.r, d) == -1) return 4;\\n\\t// if(eq(c1.r + c2.r, d)) return 3;\\n\\t// if(compare(c1.r - c2.r, d) == -1) return 2;\\n\\t// return int(eq(c1.r - c2.r, d));\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A&lang=jp\\nint intersect(const Circle &c1, const Circle &c2) { return 2 - abs(2 - number_of_common_tangents(c1, c2)); }\\n\\nReal distance(const Point &a, const Point &b) { return abs(a - b); }\\n\\nReal distance(const Line &l, const Point &p) { return abs(p - projection(l, p)); }\\n\\nReal distance(const Line &l, const Line &m) { return intersect(l, m) ? 0 : distance(l, m.a); }\\n\\nReal distance(const Segment &s, const Point &p) {\\n\\tPoint r = projection(s, p);\\n\\treturn intersect(s, r) ? distance(r, p) : std::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\\tif(intersect(a, b)) return 0;\\n\\treturn std::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\\tif(intersect(l, s)) return 0;\\n\\treturn std::min(distance(l, s.a), distance(l, s.b));\\n}\\n\\nPoint crosspoint(const Line &l, const Line &m) {\\n\\tReal A = cross(l.b - l.a, m.b - m.a);\\n\\tReal B = cross(l.b - l.a, l.b - m.a);\\n\\tif(eq(abs(A), 0.0) && eq(abs(B), 0.0)) return m.a;\\n\\treturn 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) { return crosspoint(Line(l), Line(m)); }\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_D\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Line l) {\\n\\tPoint pr = projection(l, c.p);\\n\\tif(eq(distance(l, c.p), c.r)) return {pr, pr};\\n\\tVec v = (l.b - l.a) / abs(l.b - l.a) * sqrt(c.r * c.r - norm(pr - c.p));\\n\\treturn make_pair(pr - v, pr + v);\\n\\t// Vec e = (l.b - l.a) / abs(l.b - l.a);\\n\\t// double base = sqrt(c.r * c.r - norm(pr - c.p));\\n\\t// return {pr - e * base, pr + e * base};\\n}\\n\\nstd::pair<Point, Point> crosspoint(const Circle &c, const Segment &l) {\\n\\tif(intersect(c, l) == 2) return crosspoint(c, Line(l.a, l.b));\\n\\tauto ret = crosspoint(c, Line(l.a, l.b));\\n\\tif(dot(l.a - ret.first, l.b - ret.first) < EPS)\\n\\t\\tret.second = ret.first;\\n\\telse\\n\\t\\tret.first = ret.second;\\n\\treturn ret;\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_E\\nstd::pair<Point, Point> crosspoint(const Circle &c1, const Circle &c2) {\\n\\tReal d = abs(c1.p - c2.p);\\n\\tReal a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d)); // cosine theorem\\n\\tReal t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\\n\\tPoint p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\\n\\tPoint p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\\n\\treturn make_pair(p1, p2);\\n}\\n\\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_F\\n// \\\"点 p を通る円 c の接線\\\"の接点2つ\\nstd::pair<Point, Point> tangent(const Circle &c1, const Point &p2) {\\n\\treturn 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\\tLines ret;\\n\\tif(c1.r < c2.r) std::swap(c1, c2);\\n\\tReal g = norm(c1.p - c2.p);\\n\\tif(eq(g, 0)) return ret;\\n\\tVec u = (c2.p - c1.p) / Real(sqrt(g));\\n\\tVec v = rotate(PI * 0.5, u);\\n\\tfor(int s : {-1, 1}) {\\n\\t\\tReal h = (c1.r + s * c2.r) / sqrt(g);\\n\\t\\tif(eq(1 - h * h, 0)) {\\n\\t\\t\\tret.emplace_back(c1.p + u * c1.r, c1.p + (u + v) * c1.r);\\n\\t\\t} else if(1 - h * h > 0) {\\n\\t\\t\\tPoint uu = u * h, vv = v * sqrt(1 - h * h);\\n\\t\\t\\tret.emplace_back(c1.p + (uu + vv) * c1.r, c2.p - (uu + vv) * c2.r * s);\\n\\t\\t\\tret.emplace_back(c1.p + (uu - vv) * c1.r, c2.p - (uu - vv) * c2.r * s);\\n\\t\\t}\\n\\t}\\n\\treturn ret;\\n}\\n\\n#pragma endregion\\n\\n#pragma region matrix\\n\\ntemplate <typename T>\\nstruct Matrix {\\n\\tstd::vector<std::vector<T>> A;\\n\\n private:\\n\\tstatic Matrix I(size_t n) {\\n\\t\\tMatrix mat(n);\\n\\t\\tfor(int i = 0; i < n; i++) mat[i][i] = 1;\\n\\t\\treturn mat;\\n\\t}\\n\\n public:\\n\\tMatrix() = default;\\n\\n\\tMatrix(std::vector<std::vector<T>> &vvec) { A = vvec; }\\n\\n\\tMatrix(size_t n, size_t m) : A(n, std::vector<T>(m, 0)) {}\\n\\n\\tMatrix(size_t n, size_t m, T init) : A(n, std::vector<T>(m, init)) {}\\n\\n\\tMatrix(size_t n, std::vector<T> &vec) : A(n, vec) {}\\n\\n\\tMatrix(size_t n) : A(n, std::vector<T>(n, 0)) {}\\n\\n\\tint height() const { return A.size(); }\\n\\n\\tint width() const { return A[0].size(); }\\n\\n\\tinline const std::vector<T> &operator[](int k) const { return A[k]; }\\n\\n\\tinline std::vector<T> &operator[](int k) { return A[k]; }\\n\\n\\tMatrix &operator+=(const Matrix &B) {\\n\\t\\tsize_t n = height(), m = width();\\n\\t\\tassert(n == B.height() && m == B.width());\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < m; j++) (*this)[i][j] += B[i][j];\\n\\t\\treturn *this;\\n\\t}\\n\\n\\tMatrix &operator-=(const Matrix &B) {\\n\\t\\tsize_t n = height(), m = width();\\n\\t\\tassert(n == B.height() && m == B.width());\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < m; j++) (*this)[i][j] -= B[i][j];\\n\\t\\treturn *this;\\n\\t}\\n\\n\\tMatrix &operator*=(const Matrix &B) {\\n\\t\\tsize_t n = height(), m = B.width(), p = width();\\n\\t\\tassert(p == B.height());\\n\\t\\tstd::vector<std::vector<T>> C(n, std::vector<T>(m, 0));\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < m; j++)\\n\\t\\t\\t\\tfor(int k = 0; k < p; k++) C[i][j] += (*this)[i][k] * B[k][j];\\n\\t\\tA.swap(C);\\n\\t\\treturn (*this);\\n\\t}\\n\\n\\tMatrix &operator^=(long long k) {\\n\\t\\tMatrix B = Matrix::I(height());\\n\\t\\twhile(k > 0) {\\n\\t\\t\\tif(k & 1) B *= (*this);\\n\\t\\t\\t*this *= *this;\\n\\t\\t\\tk >>= 1;\\n\\t\\t}\\n\\t\\tA.swap(B.A);\\n\\t\\treturn *this;\\n\\t}\\n\\n\\tbool operator==(const Matrix &B) {\\n\\t\\tsize_t n = height(), m = width();\\n\\t\\tif(n != B.height() or m != B.width()) return false;\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < m; j++)\\n\\t\\t\\t\\tif((*this)[i][j] != B[i][j]) return false;\\n\\t\\treturn true;\\n\\t}\\n\\n\\tMatrix operator+(const Matrix &B) const { return (Matrix(*this) += B); }\\n\\n\\tMatrix operator-(const Matrix &B) const { return (Matrix(*this) -= B); }\\n\\n\\tMatrix operator*(const Matrix &B) const { return (Matrix(*this) *= B); }\\n\\n\\tMatrix operator^(const long long k) const { return (Matrix(*this) ^= k); }\\n\\n\\tMatrix &operator+=(const T &t) {\\n\\t\\tint n = height(), m = width();\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < m; j++) (*this)[i][j] += t;\\n\\t\\treturn *this;\\n\\t}\\n\\n\\tMatrix &operator-=(const T &t) {\\n\\t\\tint n = height(), m = width();\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < m; j++) (*this)[i][j] -= t;\\n\\t\\treturn *this;\\n\\t}\\n\\n\\tMatrix &operator*=(const T &t) {\\n\\t\\tint n = height(), m = width();\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < m; j++) (*this)[i][j] *= t;\\n\\t\\treturn *this;\\n\\t}\\n\\n\\tMatrix &operator/=(const T &t) {\\n\\t\\tint n = height(), m = width();\\n\\t\\tfor(int i = 0; i < n; i++)\\n\\t\\t\\tfor(int j = 0; j < m; j++) (*this)[i][j] /= t;\\n\\t\\treturn *this;\\n\\t}\\n\\n\\tMatrix operator+(const T &t) const { return (Matrix(*this) += t); }\\n\\n\\tMatrix operator-(const T &t) const { return (Matrix(*this) -= t); }\\n\\n\\tMatrix operator*(const T &t) const { return (Matrix(*this) *= t); }\\n\\n\\tMatrix operator/(const T &t) const { return (Matrix(*this) /= t); }\\n\\n\\tfriend std::ostream &operator<<(std::ostream &os, Matrix &p) {\\n\\t\\tsize_t n = p.height(), m = p.width();\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tos << '[';\\n\\t\\t\\tfor(int j = 0; j < m; j++) os << p[i][j] << (j == m - 1 ? \\\"]\\\\n\\\" : \\\",\\\");\\n\\t\\t}\\n\\t\\treturn (os);\\n\\t}\\n\\n\\tT determinant() {\\n\\t\\tMatrix B(*this);\\n\\t\\tsize_t n = height(), m = width();\\n\\t\\tassert(n == m);\\n\\t\\tT ret = 1;\\n\\t\\tfor(int i = 0; i < n; i++) {\\n\\t\\t\\tint idx = -1;\\n\\t\\t\\tfor(int j = i; j < n; j++)\\n\\t\\t\\t\\tif(B[j][i] != 0) idx = j;\\n\\t\\t\\tif(idx == -1) return 0;\\n\\t\\t\\tif(i != idx) {\\n\\t\\t\\t\\tret *= -1;\\n\\t\\t\\t\\tswap(B[i], B[idx]);\\n\\t\\t\\t}\\n\\t\\t\\tret *= B[i][i];\\n\\t\\t\\tT vv = B[i][i];\\n\\t\\t\\tfor(int j = 0; j < n; j++) B[i][j] /= vv;\\n\\t\\t\\tfor(int j = i + 1; j < n; j++) {\\n\\t\\t\\t\\tT a = B[j][i];\\n\\t\\t\\t\\tfor(int k = 0; k < n; k++) {\\n\\t\\t\\t\\t\\tB[j][k] -= B[i][k] * a;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n};\\n\\n#pragma endregion\\n\\nld solve(ll s) {\\n\\ts = abs(s);\\n\\tint n, k;\\n\\tcin >> n >> k;\\n\\tif(!s) return 0;\\n\\tif(n == 1) {\\n\\t\\tif(s % k != 0) return -1;\\n\\t\\treturn s / k;\\n\\t}\\n\\n\\tint jump_max = n * k;\\n\\n\\tV<ld> jump_prob(jump_max + 1);\\n\\tjump_prob[0] = 1.;\\n\\n\\trep(k) {\\n\\t\\tauto tmp = jump_prob;\\n\\t\\ttmp.assign(jump_max + 1, 0);\\n\\t\\trep(from, jump_max + 1) {\\n\\t\\t\\trep(leap_len, 1, n + 1) {\\n\\t\\t\\t\\tif(from + leap_len <= jump_max) {\\n\\t\\t\\t\\t\\ttmp[from + leap_len] += jump_prob[from] / n;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tswap(tmp, jump_prob);\\n\\t}\\n\\n\\tVV<ld> mat(jump_max, V<ld>(jump_max));\\n\\n\\trep(from, 1, jump_max) {\\n\\t\\trep(leap_len, 1, jump_max + 1) {\\n\\t\\t\\tint to = abs(from - leap_len);\\n\\t\\t\\tif(to) {\\n\\t\\t\\t\\tauto &tmp = mat[from][to];\\n\\t\\t\\t\\ttmp += jump_prob[leap_len];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\trep(i, 1, jump_max) rep(j, 1, jump_max) { mat[i][j] = bool(i == j) - mat[i][j]; }\\n\\n\\tmat.erase(mat.begin());\\n\\tfoa(t, mat) t.erase(t.begin());\\n\\n\\tV<ld> res(jump_max - 1, 1.);\\n\\n\\tint len = jump_max - 1;\\n\\n\\tld EPS = 1e-5;\\n\\tauto nonzero = [&](ld a) { return abs(a) > EPS; };\\n\\n\\tauto mult_row = [&](int row_idx, ld mult) {\\n\\t\\trep(j, len) { mat[row_idx][j] *= mult; }\\n\\t\\tres[row_idx] *= mult;\\n\\t\\treturn;\\n\\t};\\n\\n\\tauto make_one = [&](int row_idx, int col_idx) {\\n\\t\\tassert(mat[row_idx][col_idx] != 0);\\n\\t\\tmult_row(row_idx, 1. / mat[row_idx][col_idx]);\\n\\t\\tmat[row_idx][col_idx] = 1;\\n\\t\\treturn;\\n\\t};\\n\\n\\tauto add_mult = [&](int row_from, int row_to, ld mult) {\\n\\t\\trep(j, len) { mat[row_to][j] += mat[row_from][j] * mult; }\\n\\t\\tres[row_to] += res[row_from] * mult;\\n\\t\\treturn;\\n\\t};\\n\\n\\tauto swap_row = [&](int i, int j) {\\n\\t\\tswap(mat[i], mat[j]);\\n\\t\\tswap(res[i], res[j]);\\n\\t\\treturn;\\n\\t};\\n\\n\\tauto find_nonzero = [&](int col_idx, int row_start) {\\n\\t\\trep(i, row_start, len) {\\n\\t\\t\\tif(nonzero(mat[i][col_idx])) return i;\\n\\t\\t}\\n\\t\\treturn -1;\\n\\t};\\n\\n\\tdebug(len);\\n\\trep(col, len) {\\n\\t\\tauto idx = find_nonzero(col, col);\\n\\t\\tif(idx < 0) {\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tif(idx != col) swap_row(idx, col);\\n\\t\\tmake_one(col, col);\\n\\t\\trep(row, len) {\\n\\t\\t\\tif(col != row) {\\n\\t\\t\\t\\tadd_mult(col, row, -mat[row][col]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tdebug(res);\\n\\n\\tres.insert(res.begin(), 0.);\\n\\tres.insert(res.begin(), 1.);\\n\\n\\tif(s < n * k) return res[s + 1];\\n\\tMatrix<ld> a(n * k + 1);\\n\\n\\trep(i, 1, n * k) { a[i][i + 1] = 1; }\\n\\ta[0][0] = 1;\\n\\ta[n * k][0] = 1;\\n\\trep(i, 1, n * k + 1) { a[n * k][i] = jump_prob[n * k - i + 1]; }\\n\\n\\tdebug(jump_prob);\\n\\tMatrix<ld> b(n * k + 1, 1);\\n\\trep(i, n * k + 1) b[i][0] = res[i];\\n\\n\\tdebug(a.A, b.A, s);\\n\\n\\ta ^= s;\\n\\n\\tdebug(a.A);\\n\\ta *= b;\\n\\n\\tdebug(a.A);\\n\\n\\treturn a[1][0];\\n\\n\\t// return;\\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\\tld res = solve((ll)n);\\n\\t\\tif(res < -0.5)\\n\\t\\t\\tcout << \\\"-1\\\" << dl;\\n\\t\\telse\\n\\t\\t\\tcout << res << dl;\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3760,\n \"score_of_the_acc\": -0.0756,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2315_5454161\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<unordered_set>\\n#include<utility>\\n#include<cassert>\\n#include<complex>\\n#include<numeric>\\n#include<array>\\nusing namespace std;\\n\\n//#define int long long\\ntypedef long long ll;\\n\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconstexpr ll mod = 1000000007;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int>P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\n#define all(v) (v).begin(),(v).end()\\ntypedef pair<ll, ll> LP;\\ntypedef long double ld;\\ntypedef pair<ld, ld> LDP;\\nconst ld eps = 1e-12;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 1;\\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\\ntypedef long double 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//no verify\\nint rankMat(mat a) {\\n\\tconst int n = a.size(), m = a[0].size();\\n\\tint r = 0;\\n\\tfor (int i = 0; r < n && i < m; ++i) {\\n\\t\\tint pivot = r;\\n\\t\\tfor (int j = r + 1; j < n; ++j)\\n\\t\\t\\tif (abs(a[j][i]) > abs(a[pivot][i]))pivot = j;\\n\\t\\tswap(a[pivot], a[r]);\\n\\t\\tif (is_zero(a[r][i]))continue;\\n\\t\\tfor (int k = m - 1; k >= i; --k)\\n\\t\\t\\ta[r][k] = a[r][k] / a[r][i];\\n\\t\\tfor (int j = r + 1; j < n; ++j) {\\n\\t\\t\\tfor (int k = m - 1; k >= i; --k) {\\n\\t\\t\\t\\ta[j][k] = fma(-a[r][k], a[j][i], a[j][k]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t++r;\\n\\t}\\n\\treturn r;\\n}\\nmat scalar(int sz, Data k) {\\n\\tmat ret(sz, Array(sz, 0));\\n\\trep(i, sz)ret[i][i] = k;\\n\\treturn ret;\\n}\\n//行列累乗\\nmat operator^(const mat& lhs, const ll n) {\\n\\tif (n == 0)return scalar(lhs.size(), 1);\\n\\tmat ret = (lhs * lhs) ^ (n / 2);\\n\\tif (n % 2) {\\n\\t\\tret = ret * lhs;\\n\\t}\\n\\treturn ret;\\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\\tfor (int j = i + 1; j < n; ++j) {\\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] / a[i][i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn D;\\n}\\n\\npair<mat, vector<int>> LUPDecomposition(mat a) {\\n\\tint n = a.size();\\n\\tvector<int> perm(n);\\n\\tiota(begin(perm), end(perm), 0);\\n\\trep(i, n) {\\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\\tswap(a[pivot], a[i]);\\n\\t\\tswap(perm[pivot], perm[i]);\\n\\t\\tfor (int j = i + 1; j < n; ++j) {\\n\\t\\t\\ta[j][i] /= a[i][i];\\n\\t\\t\\tfor (int k = i + 1; k < n; ++k) {\\n\\t\\t\\t\\ta[j][k] -= a[i][k] * a[j][i];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn make_pair(a, perm);\\n}\\nArray LUPBackSubstitution(mat& LU, vector<int>& perm, Array a) {\\n\\tint n = LU.size();\\n\\tArray tmp(n);\\n\\trep(i, n)tmp[i] = a[perm[i]];\\n\\tswap(tmp, a);\\n\\trep(i, n) {\\n\\t\\trep(j, i) {\\n\\t\\t\\ta[i] -= a[j] * LU[i][j];\\n\\t\\t}\\n\\t}\\n\\tfor (int i = n - 1; i >= 0; --i) {\\n\\t\\tfor (int j = i + 1; j < n; ++j) {\\n\\t\\t\\ta[i] -= a[j] * LU[i][j];\\n\\t\\t}\\n\\t\\ta[i] /= LU[i][i];\\n\\t}\\n\\treturn a;\\n}\\n\\n//Ax=bのxを返す\\nArray calc(mat A, Array b) {\\n\\tpair<mat, vector<int>> p = LUPDecomposition(A);\\n\\treturn LUPBackSubstitution(p.first, p.second, b);\\n}\\n\\nld dp[11][101];\\nvoid solve() {\\n\\tint x; cin >> x;\\n\\tint n, k; cin >> k >> n;\\n\\tif (k == 1) {\\n\\t\\tx = abs(x);\\n\\t\\tif (x % n == 0) {\\n\\t\\t\\tcout << x / n << \\\"\\\\n\\\";\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout << -1 << \\\"\\\\n\\\";\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tdp[0][0] = 1;\\n\\trep(i, n) {\\n\\t\\trep(j, 10 * i + 1) {\\n\\t\\t\\trep1(t, k) {\\n\\t\\t\\t\\tdp[i + 1][j + t] += dp[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tld b = 1; rep(i, n)b *= k;\\n\\trep(i, 101)dp[n][i] /= b;\\n\\t//for (int c = n; c <= n * k; c++)cout << dp[n][c] << \\\"\\\\n\\\";\\n\\tmat A(n * k, vector<ld>(n * k));\\n\\tvector<ld> ori(n * k, 1);\\n\\trep1(i, n * k) {\\n\\t\\tA[i - 1][i - 1] += 1;\\n\\t\\tfor (int c = n; c <= n * k; c++) {\\n\\t\\t\\tint t = i - c;\\n\\t\\t\\tt = abs(t);\\n\\t\\t\\tif (t > 0) {\\n\\t\\t\\t\\tA[i - 1][t - 1] -= dp[n][c];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tvector<ld> z = calc(A, ori);\\n\\tz.insert(z.begin(), 0);\\n\\tx = abs(x);\\n\\tif (x < z.size()) {\\n\\t\\tcout << z[x] << \\\"\\\\n\\\"; return;\\n\\t}\\n\\tmat B(n * k + 1, vector<ld>(n * k + 1));\\n\\trep1(i, n * k - 1) {\\n\\t\\tB[i][i - 1] = 1;\\n\\t}\\n\\tfor (int c = n; c <= n * k; c++) {\\n\\t\\tB[0][c - 1] = dp[n][c];\\n\\t}\\n\\tB[0][n * k] = 1;\\n\\tB[n * k][n * k] = 1;\\n\\tB = B ^ (int)(x - z.size() + 1);\\n\\treverse(all(z));\\n\\tz[n * k] = 1;\\n\\tld ans = 0;\\n\\trep(i, n * k + 1) {\\n\\t\\tans += B[0][i] * z[i];\\n\\t}\\n\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\n\\nsigned main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tcout << fixed << setprecision(12);\\n\\t//init_f();\\n\\t//init();\\n\\t//expr();\\n\\t//int t; cin >> t;rep(i,t)\\n\\t//while(cin>>n,n)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 8644,\n \"score_of_the_acc\": -0.4255,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2315_5144211\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <ctime>\\n#include <cstdlib>\\n#include <cassert>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <string>\\n#include <algorithm>\\n#include <utility>\\n#include <complex>\\n#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\\n#define chmin(x, y) (x) = min((x), (y))\\n#define chmax(x, y) (x) = max((x), (y))\\n#define all(x) (x).begin(),(x).end()\\n#define inf 1e18\\n\\nusing namespace std;\\n\\ntypedef long long llint;\\ntypedef long long ll;\\ntypedef pair<llint, llint> P;\\n\\nstruct Matrix{\\n\\tint h, w;\\n\\tvector<double> mat;\\n\\tMatrix(){\\n\\t\\th = w = 0;\\n\\t}\\n\\tMatrix(int h, int w){\\n\\t\\tthis->h = h, this->w = w;\\n\\t\\tmat.resize(h*w);\\n\\t}\\n\\tdouble& at(int i, int j){\\n\\t\\treturn mat[w*(i-1)+(j-1)];\\n\\t}\\n\\tstatic Matrix ident(int size){\\n\\t\\tMatrix ret(size, size);\\n\\t\\tfor(int i = 1; i <= size; i++) ret.at(i, i) = 1;\\n\\t\\treturn ret;\\n\\t}\\n\\tMatrix operator*(Matrix& ope){\\n\\t\\tMatrix ret(h, ope.w);\\n\\t\\tfor(int i = 1; i <= h; i++){\\n\\t\\t\\tfor(int j = 1; j <= ope.w; j++){\\n\\t\\t\\t\\tfor(int k = 1; k <= w; k++){\\n\\t\\t\\t\\t\\tret.at(i, j) += at(i, k) * ope.at(k, j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tMatrix pow(llint n){\\n\\t\\tif(n == 0) return ident(h);\\n\\t\\tif(n % 2){\\n\\t\\t\\treturn pow(n-1) * (*this);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tMatrix tmp = pow(n/2);\\n\\t\\t\\treturn tmp * tmp;\\n\\t\\t}\\n\\t}\\n\\tvoid print(){\\n\\t\\tfor(int i = 1; i <= h; i++){\\n\\t\\t\\tfor(int j = 1; j <= w; j++){\\n\\t\\t\\t\\tcout << at(i, j) << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t}\\n};\\n\\nll s, n, k;\\ndouble p[105];\\nll dp[15][105];\\ndouble a[105][105];\\nMatrix mat;\\n\\n\\nvoid swap(double mat[105][105], int i, int j, int n)\\n{\\n\\tfor(int k = 0; k <= n+1; k++){\\n\\t\\tdouble t = mat[i][k];\\n\\t\\tmat[i][k] = mat[j][k];\\n\\t\\tmat[j][k] = t;\\n\\t}\\n}\\n\\nvoid GaussianElimination(double mat[105][105], int n)\\n{\\n\\tfor(int i = 0; i <= n; i++){\\n\\t\\tdouble max_val = 0; int max_j;\\n\\t\\tfor(int j = i; j <= n; j++){\\n\\t\\t\\tif(fabs(mat[j][i]) > max_val){\\n\\t\\t\\t\\tmax_val = fabs(mat[j][i]);\\n\\t\\t\\t\\tmax_j = j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tassert(fabs(max_val) > 1e-9);\\n\\t\\tswap(mat, i, max_j, n);\\n\\t\\t\\n\\t\\tdouble div = mat[i][i];\\n\\t\\tfor(int j = 0; j <= n+1; j++){\\n\\t\\t\\tmat[i][j] /= div;\\n\\t\\t}\\n\\t\\tfor(int j = 0; j <= n; j++){\\n\\t\\t\\tdouble coe = mat[j][i];\\n\\t\\t\\tif(i == j) continue;\\n\\t\\t\\tfor(int k = 0; k <= n+1; k++){\\n\\t\\t\\t\\tmat[j][k] -= coe * mat[i][k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(void)\\n{\\n\\tcin >> s >> n >> k;\\n\\ts = abs(s); ll m = n*k;\\n\\t\\n\\tif(n == 1){\\n\\t\\tif(s % k){\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\ts /= k, k = 1;\\n\\t}\\n\\t\\n\\tdp[0][0] = 1;\\n\\trep(i, 0, k-1){\\n\\t\\trep(j, 0, m){\\n\\t\\t\\trep(l, 1, n){\\n\\t\\t\\t\\tif(j+l <= m) dp[i+1][j+l] += dp[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tll mul = 1;\\n\\trep(i, 1, k) mul *= n;\\n\\trep(j, 1, m) p[j] = (double)dp[k][j] / (double)mul;\\n\\t\\n\\trep(i, 1, m){\\n\\t\\ta[i][i] += 1;\\n\\t\\trep(j, 1, m) a[i][abs(i-j)] -= p[j];\\n\\t\\ta[i][m+1] = 1;\\n\\t}\\n\\ta[0][0] = 1;\\n\\t\\n\\tGaussianElimination(a, m);\\n\\t\\n\\tmat = Matrix(m+2, m+2);\\n\\trep(i, 1, m) mat.at(1, i) = p[i];\\n\\tmat.at(1, m+2) = 1;\\n\\trep(i, 1, m) mat.at(i+1, i) = 1;\\n\\tmat.at(m+2, m+2) = 1;\\n\\t\\n\\tif(s <= m){\\n\\t\\tprintf(\\\"%.11f\\\\n\\\", a[s][m+1]);\\n\\t\\treturn 0;\\n\\t}\\n\\t\\t\\n\\tMatrix pmat = mat.pow(s-m), vec(m+2, 1);\\n\\trep(i, 0, m) vec.at(i+1, 1) = a[m-i][m+1];\\n\\tvec.at(m+2, 1) = 1;\\n\\t\\n\\tvec = pmat * vec;\\n\\tprintf(\\\"%.11f\\\\n\\\", vec.at(1, 1));\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.0138,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2315_5144210\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <ctime>\\n#include <cstdlib>\\n#include <cassert>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <string>\\n#include <algorithm>\\n#include <utility>\\n#include <complex>\\n#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\\n#define chmin(x, y) (x) = min((x), (y))\\n#define chmax(x, y) (x) = max((x), (y))\\n#define all(x) (x).begin(),(x).end()\\n#define inf 1e18\\n\\nusing namespace std;\\n\\ntypedef long long llint;\\ntypedef long long ll;\\ntypedef pair<llint, llint> P;\\n\\nstruct Matrix{\\n\\tint h, w;\\n\\tvector<double> mat;\\n\\tMatrix(){\\n\\t\\th = w = 0;\\n\\t}\\n\\tMatrix(int h, int w){\\n\\t\\tthis->h = h, this->w = w;\\n\\t\\tmat.resize(h*w);\\n\\t}\\n\\tdouble& at(int i, int j){\\n\\t\\treturn mat[w*(i-1)+(j-1)];\\n\\t}\\n\\tstatic Matrix ident(int size){\\n\\t\\tMatrix ret(size, size);\\n\\t\\tfor(int i = 1; i <= size; i++) ret.at(i, i) = 1;\\n\\t\\treturn ret;\\n\\t}\\n\\tMatrix operator*(Matrix& ope){\\n\\t\\tMatrix ret(h, ope.w);\\n\\t\\tfor(int i = 1; i <= h; i++){\\n\\t\\t\\tfor(int j = 1; j <= ope.w; j++){\\n\\t\\t\\t\\tfor(int k = 1; k <= w; k++){\\n\\t\\t\\t\\t\\tret.at(i, j) += at(i, k) * ope.at(k, j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tMatrix pow(llint n){\\n\\t\\tif(n == 0) return ident(h);\\n\\t\\tif(n % 2){\\n\\t\\t\\treturn pow(n-1) * (*this);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tMatrix tmp = pow(n/2);\\n\\t\\t\\treturn tmp * tmp;\\n\\t\\t}\\n\\t}\\n\\tvoid print(){\\n\\t\\tfor(int i = 1; i <= h; i++){\\n\\t\\t\\tfor(int j = 1; j <= w; j++){\\n\\t\\t\\t\\tcout << at(i, j) << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t}\\n};\\n\\nll s, n, k;\\ndouble p[105];\\nll dp[15][105];\\ndouble a[105][105];\\nMatrix mat;\\n\\n\\nvoid swap(double mat[105][105], int i, int j, int n)\\n{\\n\\tfor(int k = 0; k <= n+1; k++){\\n\\t\\tdouble t = mat[i][k];\\n\\t\\tmat[i][k] = mat[j][k];\\n\\t\\tmat[j][k] = t;\\n\\t}\\n}\\n\\nvoid GaussianElimination(double mat[105][105], int n)\\n{\\n\\tfor(int i = 0; i <= n; i++){\\n\\t\\tdouble max_val = 0; int max_j;\\n\\t\\tfor(int j = i; j <= n; j++){\\n\\t\\t\\tif(fabs(mat[j][i]) > max_val){\\n\\t\\t\\t\\tmax_val = fabs(mat[j][i]);\\n\\t\\t\\t\\tmax_j = j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tassert(fabs(max_val) > 1e-9);\\n\\t\\tswap(mat, i, max_j, n);\\n\\t\\t\\n\\t\\tdouble div = mat[i][i];\\n\\t\\tfor(int j = 0; j <= n+1; j++){\\n\\t\\t\\tmat[i][j] /= div;\\n\\t\\t}\\n\\t\\tfor(int j = 0; j <= n; j++){\\n\\t\\t\\tdouble coe = mat[j][i];\\n\\t\\t\\tif(i == j) continue;\\n\\t\\t\\tfor(int k = 0; k <= n+1; k++){\\n\\t\\t\\t\\tmat[j][k] -= coe * mat[i][k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(void)\\n{\\n\\tcin >> s >> n >> k;\\n\\ts = abs(s); ll m = n*k;\\n\\t\\n\\tif(n == 1){\\n\\t\\tif(s % k){\\n\\t\\t\\tcout << -1 << endl;\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\ts /= k, k = 1;\\n\\t}\\n\\t\\n\\tdp[0][0] = 1;\\n\\trep(i, 0, k-1){\\n\\t\\trep(j, 0, m){\\n\\t\\t\\trep(l, 1, n){\\n\\t\\t\\t\\tif(j+l <= m) dp[i+1][j+l] += dp[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tll mul = 1;\\n\\trep(i, 1, k) mul *= n;\\n\\trep(j, 1, m) p[j] = (double)dp[k][j] / (double)mul;\\n\\t\\n\\trep(i, 1, m){\\n\\t\\ta[i][i] += 1;\\n\\t\\trep(j, 1, m) a[i][abs(i-j)] -= p[j];\\n\\t\\ta[i][m+1] = 1;\\n\\t}\\n\\ta[0][0] = 1;\\n\\t\\n\\t/*rep(i, 0, m){\\n\\t\\trep(j, 0, m+1){\\n\\t\\t\\tcout << a[i][j] << \\\" \\\";\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}*/\\n\\t\\n\\tGaussianElimination(a, m);\\n\\t\\n\\tmat = Matrix(m+2, m+2);\\n\\trep(i, 1, m) mat.at(1, i) = p[i];\\n\\tmat.at(1, m+2) = 1;\\n\\trep(i, 1, m) mat.at(i+1, i) = 1;\\n\\tmat.at(m+2, m+2) = 1;\\n\\t\\n\\tif(s <= m){\\n\\t\\tprintf(\\\"%.11f\\\\n\\\", a[s][m+1]);\\n\\t\\treturn 0;\\n\\t}\\n\\t\\t\\n\\tMatrix pmat = mat.pow(s-m), vec(m+2, 1);\\n\\trep(i, 0, m) vec.at(i+1, 1) = a[m-i][m+1];\\n\\tvec.at(m+2, 1) = 1;\\n\\t\\n\\tvec = pmat * vec;\\n\\tprintf(\\\"%.11f\\\\n\\\", vec.at(1, 1));\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.0094,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2315_5144181\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <ctime>\\n#include <cstdlib>\\n#include <cassert>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <string>\\n#include <algorithm>\\n#include <utility>\\n#include <complex>\\n#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\\n#define chmin(x, y) (x) = min((x), (y))\\n#define chmax(x, y) (x) = max((x), (y))\\n#define all(x) (x).begin(),(x).end()\\n#define inf 1e18\\n#define double long double\\n\\nusing namespace std;\\n\\ntypedef long long llint;\\ntypedef long long ll;\\ntypedef pair<llint, llint> P;\\n\\nstruct Matrix{\\n\\tint h, w;\\n\\tvector<double> mat;\\n\\tMatrix(){\\n\\t\\th = w = 0;\\n\\t}\\n\\tMatrix(int h, int w){\\n\\t\\tthis->h = h, this->w = w;\\n\\t\\tmat.resize(h*w);\\n\\t}\\n\\tdouble& at(int i, int j){\\n\\t\\treturn mat[w*(i-1)+(j-1)];\\n\\t}\\n\\tstatic Matrix ident(int size){\\n\\t\\tMatrix ret(size, size);\\n\\t\\tfor(int i = 1; i <= size; i++) ret.at(i, i) = 1;\\n\\t\\treturn ret;\\n\\t}\\n\\tMatrix operator*(Matrix& ope){\\n\\t\\tMatrix ret(h, ope.w);\\n\\t\\tfor(int i = 1; i <= h; i++){\\n\\t\\t\\tfor(int j = 1; j <= ope.w; j++){\\n\\t\\t\\t\\tfor(int k = 1; k <= w; k++){\\n\\t\\t\\t\\t\\tret.at(i, j) += at(i, k) * ope.at(k, j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tMatrix pow(llint n){\\n\\t\\tif(n == 0) return ident(h);\\n\\t\\tif(n % 2){\\n\\t\\t\\treturn pow(n-1) * (*this);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tMatrix tmp = pow(n/2);\\n\\t\\t\\treturn tmp * tmp;\\n\\t\\t}\\n\\t}\\n\\tvoid print(){\\n\\t\\tfor(int i = 1; i <= h; i++){\\n\\t\\t\\tfor(int j = 1; j <= w; j++){\\n\\t\\t\\t\\tcout << at(i, j) << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t}\\n};\\n\\nll s, n, k;\\ndouble p[105];\\nll dp[15][105];\\ndouble a[105][105];\\nMatrix mat;\\n\\n\\nvoid swap(double mat[105][105], int i, int j, int n)\\n{\\n\\tfor(int k = 0; k <= n+1; k++){\\n\\t\\tdouble t = mat[i][k];\\n\\t\\tmat[i][k] = mat[j][k];\\n\\t\\tmat[j][k] = t;\\n\\t}\\n}\\n\\nvoid GaussianElimination(double mat[105][105], int n)\\n{\\n\\tfor(int i = 0; i <= n; i++){\\n\\t\\tdouble max_val = 0; int max_j;\\n\\t\\tfor(int j = i; j <= n; j++){\\n\\t\\t\\tif(fabs(mat[j][i]) > max_val){\\n\\t\\t\\t\\tmax_val = fabs(mat[j][i]);\\n\\t\\t\\t\\tmax_j = j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tassert(fabs(max_val) > 1e-9);\\n\\t\\tswap(mat, i, max_j, n);\\n\\t\\t\\n\\t\\tdouble div = mat[i][i];\\n\\t\\tfor(int j = 0; j <= n+1; j++){\\n\\t\\t\\tmat[i][j] /= div;\\n\\t\\t}\\n\\t\\tfor(int j = 0; j <= n; j++){\\n\\t\\t\\tdouble coe = mat[j][i];\\n\\t\\t\\tif(i == j) continue;\\n\\t\\t\\tfor(int k = 0; k <= n+1; k++){\\n\\t\\t\\t\\tmat[j][k] -= coe * mat[i][k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(void)\\n{\\n\\tcin >> s >> n >> k;\\n\\ts = abs(s);\\n\\tif((n == 1 || k == 1) && s % (n*k)){\\n\\t\\tcout << -1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tll m = n*k;\\n\\t\\n\\tdp[0][0] = 1;\\n\\trep(i, 0, k-1){\\n\\t\\trep(j, 0, m){\\n\\t\\t\\trep(l, 1, n){\\n\\t\\t\\t\\tif(j+l <= m) dp[i+1][j+l] += dp[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tll mul = 1;\\n\\trep(i, 1, k) mul *= n;\\n\\trep(j, 1, m) p[j] = (double)dp[k][j] / (double)mul;\\n\\t\\n\\trep(i, 1, m){\\n\\t\\ta[i][i] += 1;\\n\\t\\trep(j, 1, m) a[i][abs(i-j)] -= p[j];\\n\\t\\ta[i][m+1] = 1;\\n\\t}\\n\\ta[0][0] = 1;\\n\\t\\n\\tGaussianElimination(a, m);\\n\\t\\n\\tmat = Matrix(m+2, m+2);\\n\\trep(i, 1, m) mat.at(1, i) = p[i];\\n\\tmat.at(1, m+2) = 1;\\n\\trep(i, 1, m) mat.at(i+1, i) = 1;\\n\\tmat.at(m+2, m+2) = 1;\\n\\t\\n\\tif(s <= m){\\n\\t\\tprintf(\\\"%.11Lf\\\\n\\\", a[s][m+1]);\\n\\t\\treturn 0;\\n\\t}\\n\\t\\t\\n\\tMatrix pmat = mat.pow(s-m), vec(m+2, 1);\\n\\trep(i, 0, m) vec.at(i+1, 1) = a[m-i][m+1];\\n\\tvec.at(m+2, 1) = 1;\\n\\t\\n\\tvec = pmat * vec;\\n\\tprintf(\\\"%.11Lf\\\\n\\\", vec.at(1, 1));\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.0967741935483871,\n \"time_ms\": 80,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.0423,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2315_5144178\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cmath>\\n#include <ctime>\\n#include <cstdlib>\\n#include <cassert>\\n#include <vector>\\n#include <list>\\n#include <stack>\\n#include <queue>\\n#include <deque>\\n#include <map>\\n#include <set>\\n#include <bitset>\\n#include <string>\\n#include <algorithm>\\n#include <utility>\\n#include <complex>\\n#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)\\n#define chmin(x, y) (x) = min((x), (y))\\n#define chmax(x, y) (x) = max((x), (y))\\n#define all(x) (x).begin(),(x).end()\\n#define inf 1e18\\n\\nusing namespace std;\\n\\ntypedef long long llint;\\ntypedef long long ll;\\ntypedef pair<llint, llint> P;\\n\\nstruct Matrix{\\n\\tint h, w;\\n\\tvector<double> mat;\\n\\tMatrix(){\\n\\t\\th = w = 0;\\n\\t}\\n\\tMatrix(int h, int w){\\n\\t\\tthis->h = h, this->w = w;\\n\\t\\tmat.resize(h*w);\\n\\t}\\n\\tdouble& at(int i, int j){\\n\\t\\treturn mat[w*(i-1)+(j-1)];\\n\\t}\\n\\tstatic Matrix ident(int size){\\n\\t\\tMatrix ret(size, size);\\n\\t\\tfor(int i = 1; i <= size; i++) ret.at(i, i) = 1;\\n\\t\\treturn ret;\\n\\t}\\n\\tMatrix operator*(Matrix& ope){\\n\\t\\tMatrix ret(h, ope.w);\\n\\t\\tfor(int i = 1; i <= h; i++){\\n\\t\\t\\tfor(int j = 1; j <= ope.w; j++){\\n\\t\\t\\t\\tfor(int k = 1; k <= w; k++){\\n\\t\\t\\t\\t\\tret.at(i, j) += at(i, k) * ope.at(k, j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn ret;\\n\\t}\\n\\tMatrix pow(llint n){\\n\\t\\tif(n == 0) return ident(h);\\n\\t\\tif(n % 2){\\n\\t\\t\\treturn pow(n-1) * (*this);\\n\\t\\t}\\n\\t\\telse{\\n\\t\\t\\tMatrix tmp = pow(n/2);\\n\\t\\t\\treturn tmp * tmp;\\n\\t\\t}\\n\\t}\\n\\tvoid print(){\\n\\t\\tfor(int i = 1; i <= h; i++){\\n\\t\\t\\tfor(int j = 1; j <= w; j++){\\n\\t\\t\\t\\tcout << at(i, j) << \\\" \\\";\\n\\t\\t\\t}\\n\\t\\t\\tcout << endl;\\n\\t\\t}\\n\\t}\\n};\\n\\nll s, n, k;\\ndouble p[105];\\nll dp[15][105];\\ndouble a[105][105];\\nMatrix mat;\\n\\n\\nvoid swap(double mat[105][105], int i, int j, int n)\\n{\\n\\tfor(int k = 0; k <= n+1; k++){\\n\\t\\tdouble t = mat[i][k];\\n\\t\\tmat[i][k] = mat[j][k];\\n\\t\\tmat[j][k] = t;\\n\\t}\\n}\\n\\nvoid GaussianElimination(double mat[105][105], int n)\\n{\\n\\tfor(int i = 0; i <= n; i++){\\n\\t\\tdouble max_val = 0; int max_j;\\n\\t\\tfor(int j = i; j <= n; j++){\\n\\t\\t\\tif(fabs(mat[j][i]) > max_val){\\n\\t\\t\\t\\tmax_val = fabs(mat[j][i]);\\n\\t\\t\\t\\tmax_j = j;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tassert(fabs(max_val) > 1e-9);\\n\\t\\tswap(mat, i, max_j, n);\\n\\t\\t\\n\\t\\tdouble div = mat[i][i];\\n\\t\\tfor(int j = 0; j <= n+1; j++){\\n\\t\\t\\tmat[i][j] /= div;\\n\\t\\t}\\n\\t\\tfor(int j = 0; j <= n; j++){\\n\\t\\t\\tdouble coe = mat[j][i];\\n\\t\\t\\tif(i == j) continue;\\n\\t\\t\\tfor(int k = 0; k <= n+1; k++){\\n\\t\\t\\t\\tmat[j][k] -= coe * mat[i][k];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nint main(void)\\n{\\n\\tcin >> s >> n >> k;\\n\\ts = abs(s);\\n\\tif((n == 1 || k == 1) && s % (n*k)){\\n\\t\\tcout << -1 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tll m = n*k;\\n\\t\\n\\tdp[0][0] = 1;\\n\\trep(i, 0, k-1){\\n\\t\\trep(j, 0, m){\\n\\t\\t\\trep(l, 1, n){\\n\\t\\t\\t\\tif(j+l <= m) dp[i+1][j+l] += dp[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tll mul = 1;\\n\\trep(i, 1, k) mul *= n;\\n\\trep(j, 1, m) p[j] = (double)dp[k][j] / (double)mul;\\n\\t\\n\\trep(i, 1, m){\\n\\t\\ta[i][i] += 1;\\n\\t\\trep(j, 1, m) a[i][abs(i-j)] -= p[j];\\n\\t\\ta[i][m+1] = 1;\\n\\t}\\n\\ta[0][0] = 1;\\n\\t\\n\\tGaussianElimination(a, m);\\n\\t\\n\\tmat = Matrix(m+2, m+2);\\n\\trep(i, 1, m) mat.at(1, i) = p[i];\\n\\tmat.at(1, m+2) = 1;\\n\\trep(i, 1, m) mat.at(i+1, i) = 1;\\n\\tmat.at(m+2, m+2) = 1;\\n\\t\\n\\tif(s <= m){\\n\\t\\tprintf(\\\"%.11f\\\\n\\\", a[s][m+1]);\\n\\t\\treturn 0;\\n\\t}\\n\\t\\t\\n\\tMatrix pmat = mat.pow(s-m), vec(m+2, 1);\\n\\trep(i, 0, m) vec.at(i+1, 1) = a[m-i][m+1];\\n\\tvec.at(m+2, 1) = 1;\\n\\t\\n\\tvec = pmat * vec;\\n\\tprintf(\\\"%.11f\\\\n\\\", vec.at(1, 1));\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.0967741935483871,\n \"time_ms\": 20,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.0012,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2315_3623248\",\n \"code_snippet\": \"// #define _GLIBCXX_DEBUG // for STL debug (optional)\\n#include <iostream>\\n#include <iomanip>\\n#include <cstdio>\\n#include <string>\\n#include <cstring>\\n#include <deque>\\n#include <list>\\n#include <queue>\\n#include <stack>\\n#include <vector>\\n#include <utility>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <complex>\\n#include <cmath>\\n#include <limits>\\n#include <cfloat>\\n#include <climits>\\n#include <ctime>\\n#include <cassert>\\n#include <numeric>\\n#include <fstream>\\n#include <functional>\\n#include <bitset>\\nusing namespace std;\\n\\n#define debug(...) fprintf(stderr, __VA_ARGS__)\\n#define int long long int\\n \\ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\\n \\ntypedef pair<int, int> pii;\\ntypedef long long ll;\\n \\nint dx[] = {0, 0, 1, -1};\\nint dy[] = {1, -1, 0, 0};\\nconst ll INF = 1001001001001001LL;\\nconst ll MOD = 1000000007LL;\\n\\n// 行列ライブラリ\\n// Verified: TopCoder SRM 704 Div.2 (ModEquationEasy)\\n// 行列の積 と 累乗(繰り返し二乗法)\\n\\n// Matrix Library Begin (C++11)\\n\\ntemplate <typename T>\\nusing Matrix = vector< vector<T> >;\\n\\ntemplate <typename T>\\nvoid init_mat(Matrix<T> &A, int h, int w) {\\n A.resize(h, vector<T>(w, 0));\\n}\\n\\ntemplate <typename T>\\nMatrix<T> calc_mat(Matrix<T> A, Matrix<T> B) {\\n Matrix<T> C(A.size(), vector<T>(B[0].size()));\\n for(int i=0; i<A.size(); i++) {\\n for(int k=0; k<B.size(); k++) {\\n for(int j=0; j<B[0].size(); j++) {\\n C[i][j] += A[i][k] * B[k][j]; // modなし\\n // C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD; // modあり\\n }\\n }\\n }\\n return C;\\n}\\n\\ntemplate <typename T>\\nMatrix<T> mat_pow(Matrix<T> A, ll n) {\\n Matrix<T> B(A.size(), vector<T>(A.size()));\\n for(int i=0; i<A.size(); i++) B[i][i] = 1;\\n while(n > 0) {\\n if(n & 1) B = calc_mat(B, A);\\n A = calc_mat(A, A);\\n n >>= 1;\\n }\\n return B;\\n}\\n\\n// calculate vector x which satisfies Ax = b\\n// (A is N*N Matrix, b, x is N-dim vector)\\n\\ntemplate <typename T>\\nusing Matrix = vector< vector<T> >;\\nconstexpr long double EPS = 1e-8;\\n\\ntemplate <typename T>\\nvector<long double> gauss_jordan(const Matrix<T> &A, const vector<T> &b) {\\n int N = A.size();\\n // B = [A b]\\n Matrix<long double> B(N, vector<long double>(N+1));\\n for(int i=0; i<N; i++) {\\n for(int j=0; j<=N; j++) {\\n if(j < N) B[i][j] = A[i][j];\\n else B[i][j] = b[i];\\n }\\n }\\n\\n for(int i=0; i<N; i++) {\\n int pivot = i;\\n for(int j=i+1; j<N; j++) {\\n if(abs(B[j][i]) > abs(B[pivot][i])) pivot = j;\\n }\\n if(abs(B[pivot][i]) < EPS) continue;\\n swap(B[i], B[pivot]);\\n\\n // pivot is zero -> No solution or Not unique\\n // assert(abs(B[i][i]) >= EPS);\\n for(int j=i+1; j<=N; j++) B[i][j] /= B[i][i];\\n for(int j=0; j<N; j++) {\\n if(i != j) {\\n for(int k=i+1; k<=N; k++) B[j][k] -= B[j][i] * B[i][k];\\n }\\n }\\n }\\n vector<long double> x(N);\\n for(int i=0; i<N; i++) x[i] = B[i][N];\\n return x;\\n}\\n\\nlong double d[11][110], dice[110], dp[110];\\nsigned main() {\\n int S, N, K; cin >> S >> N >> K;\\n S = abs(S);\\n\\n if(N == 1 and S % K != 0) {\\n cout << -1 << endl;\\n return 0;\\n }\\n\\n d[0][0] = 1.0;\\n for(int i=0; i<K; i++) {\\n for(int j=i*N; j>=0; j--) {\\n for(int k=N; k>=1; k--) {\\n d[i+1][j+k] += d[i][j] / N;\\n }\\n }\\n }\\n\\n int M = N*K;\\n long double sum = 0.0;\\n for(int i=0; i<=M; i++) {\\n dice[i] = d[K][i];\\n sum += d[K][i];\\n }\\n \\n Matrix<long double> mat;\\n vector<long double> b(M+1);\\n init_mat(mat, M+1, M+1);\\n for(int i=0; i<=M; i++) {\\n mat[i][i] = 1.0;\\n if(i > 0) {\\n for(int j=0; j<=M; j++) {\\n long double p = dice[j];\\n int idx = abs(i - j);\\n mat[i][idx] -= p;\\n }\\n b[i] = 1.0;\\n }\\n }\\n auto res = gauss_jordan(mat, b);\\n\\n if(S <= M) {\\n printf(\\\"%.12Lf\\\\n\\\", (long double)res[S]);\\n }\\n else {\\n long double ten = 1.0;\\n \\n int rem = S - M;\\n Matrix<long double> tab;\\n init_mat(tab, M+1, M+1);\\n for(int i=0; i<M; i++) {\\n tab[0][i] = dice[i+1];\\n if(i+1 < M) tab[i+1][i] = 1.0;\\n }\\n tab[0][M] = 1.0;\\n tab[M][M] = 1.0;\\n\\n Matrix<long double> vec;\\n init_mat(vec, M+1, 1);\\n for(int i=0; i<M; i++) {\\n vec[i][0] = res[M-i] * ten;\\n }\\n vec[M][0] = ten;\\n\\n tab = mat_pow(tab, rem);\\n vec = calc_mat(tab, vec);\\n printf(\\\"%.12Lf\\\\n\\\", (long double)vec[0][0]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 4104,\n \"score_of_the_acc\": -0.1219,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2315_3530765\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n\\nnamespace ProconLib{\\n \\n template<typename T>\\n struct Detail{\\n static constexpr T EPS = T(1e-15);\\n static bool isZero(T v){\\n return abs(v)<=EPS;\\n }\\n };\\n\\n template<typename T>\\n class Vector{\\n int N;\\n std::vector<T> dat;\\n public:\\n Vector(int n):N(n),dat(n){}\\n Vector(int n,T x):N(n),dat(n,x){}\\n Vector(std::vector<T> vec):N(vec.size()),dat(vec){}\\n Vector(const std::vector<T>& vec):N(vec.size()),dat(vec){}\\n Vector(const Vector& vec){dat=vec.dat;}\\n int size(){return N;}\\n T& operator[](int pos){return dat[pos];};\\n const T& operator[](int pos) const{return dat[pos];};\\n T& at(int pos){return dat.at(pos);}\\n const T& at(int pos) const {return dat.at(pos);}\\n };\\n \\n template<typename T>\\n class Matrix{\\n int r,c;\\n std::vector<Vector<T>> dat;\\n public:\\n Matrix(int r,int c):r(r),c(c),dat(r,Vector<T>(c)){}\\n Matrix(int r,int c,T x):r(r),c(c),dat(r,Vector<T>(c,x)){}\\n\\n Vector<T>& operator[](int pos){return dat[pos];};\\n const Vector<T>& operator[](int pos) const{return dat[pos];};\\n Vector<T>& at(int pos){return dat.at(pos);}\\n const Vector<T>& at(int pos) const {return dat.at(pos);}\\n int rowSize() const {return r;}\\n int colSize() const {return c;}\\n };\\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs);\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs);\\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& mat);\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& mat);\\n template<typename T>\\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs);\\n template<typename T>\\n Matrix<T> Identity(int n);\\n template<typename T>\\n Matrix<T> pow(const Matrix<T>& mat,int k);\\n template<typename T,typename Detail=Detail<T>>\\n Matrix<T> gaussianElimination(Matrix<T> mat);\\n template<typename T>\\n int rank(const Matrix<T>& mat);\\n template<typename T>\\n Matrix<T> inv(const Matrix<T>& mat);\\n \\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs){\\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\\n int r=lhs.rowSize(),c=lhs.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++){\\n for(int j=0;j<c;j++){\\n res[i][j]=lhs[i]+rhs[i];\\n }\\n }\\n return res;\\n }\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs){\\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\\n int r=lhs.rowSize(),c=lhs.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++){\\n for(int j=0;j<c;j++){\\n res[i][j]=lhs[i]-rhs[i];\\n }\\n }\\n return res;\\n }\\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& mat){\\n int r=mat.rowSize(),c=mat.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\\n return res;\\n }\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& mat){\\n int r=mat.rowSize(),c=mat.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\\n return res;\\n }\\n \\n template<typename T>\\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs){\\n assert(lhs.colSize()==rhs.rowSize());\\n int r=lhs.rowSize(),c=rhs.colSize(),l=lhs.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++){\\n for(int k=0;k<l;k++){\\n for(int j=0;j<c;j++){\\n res[i][j]+=lhs[i][k]*rhs[k][j];\\n }\\n }\\n }\\n return res;\\n }\\n\\n template<typename T>\\n Matrix<T> Identity(int n){\\n assert(n>=0);\\n Matrix<T> res(n,n);\\n for(int i=0;i<n;i++){\\n res[i][i]=1;\\n }\\n return res;\\n }\\n\\n template<typename T>\\n Matrix<T> pow(const Matrix<T>& mat,int k){\\n assert(mat.rowSize()==mat.colSize());\\n Matrix<T> x=mat;\\n Matrix<T> res=Identity<T>(mat.rowSize());\\n while(k){\\n if(k&1) res=res*x;\\n x=x*x;\\n k>>=1;\\n }\\n return res;\\n }\\n \\n template<typename T,typename Detail=Detail<T>>\\n Matrix<T> gaussianElimination(Matrix<T> mat){\\n int m=mat.rowSize(),n=mat.colSize();\\n int row=0;\\n for(int j=0;j<n;j++){\\n if(row==m) break;\\n int tar=-1;\\n T v=Detail::EPS;\\n for(int i=row;i<m;i++){\\n if(!Detail::isZero(mat[i][j]) && abs(v)<abs(mat[i][j])){\\n tar=i;\\n v=mat[i][j];\\n }\\n }\\n if(tar==-1) continue;\\n if(row!=tar){ \\n auto tmp=mat[row];\\n mat[row]=mat[tar];\\n mat[tar]=tmp;\\n }\\n for(int i=row+1;i<m;i++){\\n if(!Detail::isZero(mat[i][j])){\\n T r=mat[i][j]/mat[row][j];\\n for(int k=j;k<n;k++){\\n mat[i][k]-=r*mat[row][k];\\n }\\n }\\n }\\n row++;\\n }\\n return mat;\\n }\\n\\n template<typename T,typename Detail=Detail<T>>\\n int rank(const Matrix<T>& mat){\\n auto tmp=gaussialElimination(mat);\\n int m=tmp.rowSize(),n=tmp.colSize();\\n int i=0,j=0;\\n while(i<m && j<n){\\n if(Detail::isZero(tmp[i][j])) j++;\\n else i++,j++;\\n }\\n return i;\\n }\\n\\n template<typename T>\\n Matrix<T> inv(const Matrix<T>& mat){\\n assert(mat.rowSize()==mat.colSize());\\n int n=mat.rowSize();\\n Matrix<T> tmp(n,2*n);\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n tmp[i][j]=mat[i][j];\\n tmp[i][j+n]=0;\\n }\\n tmp[i][i+n]=1;\\n }\\n mat=gaussianElimination(mat);\\n Matrix<T> res(n);\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n res[i][j]=mat[i][j+n]/=mat[i][i];\\n }\\n }\\n return res;\\n }\\n \\n template<typename T>\\n void debug(Matrix<T> mat){\\n int m=mat.rowSize(),n=mat.colSize();\\n std::cerr<<\\\"###Matrix_Debug###\\\"<<std::endl;\\n for(int i=0;i<m;i++){\\n for(int j=0;j<n;j++){\\n std::cerr<<mat[i][j]<<\\\" \\\";\\n }\\n std::cerr<<std::endl;\\n }\\n }\\n}\\n\\nusing namespace ProconLib;\\n\\nint main(){\\n int s,n,k;\\n cin>>s>>n>>k;\\n if(n==1){\\n cout<<(s%k==0 ? abs(s)/k : -1)<<endl;\\n return 0;\\n }\\n \\n int sz=n*k+1;\\n \\n vector<vector<double>> dp(k+1,vector<double>(sz));\\n dp[0][0]=1;\\n for(int i=0;i<k;i++){\\n for(int j=0;j<sz;j++){\\n for(int k=1;k<=n;k++){\\n if(j+k<sz) dp[i+1][j+k]+=dp[i][j]/n;\\n }\\n }\\n }\\n \\n Matrix<double> B(sz,sz+1);\\n {\\n B[0][0]=1;\\n B[0][sz]=0;\\n for(int i=1;i<sz;i++){\\n B[i][i]=-1;\\n for(int j=0;j<sz;j++){\\n // i to j\\n int d=i-j;\\n if(0<=d && d<sz){\\n B[i][j]+=dp[k][d];\\n B[i][sz]-=dp[k][d];\\n }\\n d=i+j;\\n if(j!=0 && 0<=d && d<sz){\\n B[i][j]+=dp[k][d];\\n B[i][sz]-=dp[k][d];\\n }\\n }\\n }\\n }\\n B=gaussianElimination(B);\\n Vector<double> vec(sz+1);\\n for(int i=sz-1;i>=0;i--){\\n for(int j=0;j<i;j++){\\n B[j][sz]-=B[j][i]/B[i][i]*B[i][sz];\\n B[j][i]=0;\\n }\\n }\\n for(int i=0;i<sz;i++){\\n vec[sz-i-1]=B[i][sz]/B[i][i];\\n }\\n vec[sz]=1;\\n\\n Matrix<double> A(sz+1,sz+1);\\n for(int i=1;i<sz;i++){\\n A[i][i-1]=1;\\n }\\n A[sz][sz]=1;\\n for(int i=0;i<sz;i++){\\n int d=i+1;\\n if(d<sz) A[0][i]=dp[k][d];\\n if(d<sz) A[0][sz]+=dp[k][d];\\n }\\n A=pow(A,abs(s));\\n double res=0;\\n for(int i=0;i<=sz;i++){\\n res+=A[sz-1][i]*vec[i];\\n }\\n cout<<fixed<<setprecision(10);\\n cout<<res<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.0108,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2315_3530762\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n\\nnamespace ProconLib{\\n \\n template<typename T>\\n struct Detail{\\n static constexpr T EPS = T(1e-15);\\n static bool isZero(T v){\\n return abs(v)<=EPS;\\n }\\n };\\n\\n template<typename T>\\n class Vector{\\n int N;\\n std::vector<T> dat;\\n public:\\n Vector(int n):N(n),dat(n){}\\n Vector(int n,T x):N(n),dat(n,x){}\\n Vector(std::vector<T> vec):N(vec.size()),dat(vec){}\\n Vector(const std::vector<T>& vec):N(vec.size()),dat(vec){}\\n Vector(const Vector& vec){dat=vec.dat;}\\n int size(){return N;}\\n T& operator[](int pos){return dat[pos];};\\n const T& operator[](int pos) const{return dat[pos];};\\n T& at(int pos){return dat.at(pos);}\\n const T& at(int pos) const {return dat.at(pos);}\\n };\\n \\n template<typename T>\\n class Matrix{\\n int r,c;\\n std::vector<Vector<T>> dat;\\n public:\\n Matrix(int r,int c):r(r),c(c),dat(r,Vector<T>(c)){}\\n Matrix(int r,int c,T x):r(r),c(c),dat(r,Vector<T>(c,x)){}\\n\\n Vector<T>& operator[](int pos){return dat[pos];};\\n const Vector<T>& operator[](int pos) const{return dat[pos];};\\n Vector<T>& at(int pos){return dat.at(pos);}\\n const Vector<T>& at(int pos) const {return dat.at(pos);}\\n int rowSize() const {return r;}\\n int colSize() const {return c;}\\n };\\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs);\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs);\\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& mat);\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& mat);\\n template<typename T>\\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs);\\n template<typename T>\\n Matrix<T> Identity(int n);\\n template<typename T>\\n Matrix<T> pow(const Matrix<T>& mat,int k);\\n template<typename T,typename Detail=Detail<T>>\\n Matrix<T> gaussianElimination(Matrix<T> mat);\\n template<typename T>\\n int rank(const Matrix<T>& mat);\\n template<typename T>\\n Matrix<T> inv(const Matrix<T>& mat);\\n \\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs){\\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\\n int r=lhs.rowSize(),c=lhs.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++){\\n for(int j=0;j<c;j++){\\n res[i][j]=lhs[i]+rhs[i];\\n }\\n }\\n return res;\\n }\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs){\\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\\n int r=lhs.rowSize(),c=lhs.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++){\\n for(int j=0;j<c;j++){\\n res[i][j]=lhs[i]-rhs[i];\\n }\\n }\\n return res;\\n }\\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& mat){\\n int r=mat.rowSize(),c=mat.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\\n return res;\\n }\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& mat){\\n int r=mat.rowSize(),c=mat.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\\n return res;\\n }\\n \\n template<typename T>\\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs){\\n assert(lhs.colSize()==rhs.rowSize());\\n int r=lhs.rowSize(),c=rhs.colSize(),l=lhs.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++){\\n for(int k=0;k<l;k++){\\n for(int j=0;j<c;j++){\\n res[i][j]+=lhs[i][k]*rhs[k][j];\\n }\\n }\\n }\\n return res;\\n }\\n\\n template<typename T>\\n Matrix<T> Identity(int n){\\n assert(n>=0);\\n Matrix<T> res(n,n);\\n for(int i=0;i<n;i++){\\n res[i][i]=1;\\n }\\n return res;\\n }\\n\\n template<typename T>\\n Matrix<T> pow(const Matrix<T>& mat,int k){\\n assert(mat.rowSize()==mat.colSize());\\n Matrix<T> x=mat;\\n Matrix<T> res=Identity<T>(mat.rowSize());\\n while(k){\\n if(k&1) res=res*x;\\n x=x*x;\\n k>>=1;\\n }\\n return res;\\n }\\n \\n template<typename T,typename Detail=Detail<T>>\\n Matrix<T> gaussianElimination(Matrix<T> mat){\\n int m=mat.rowSize(),n=mat.colSize();\\n int row=0;\\n for(int j=0;j<n;j++){\\n if(row==m) break;\\n int tar=-1;\\n T v=Detail::EPS;\\n for(int i=row;i<m;i++){\\n if(!Detail::isZero(mat[i][j]) && abs(v)<abs(mat[i][j])){\\n tar=i;\\n v=mat[i][j];\\n }\\n }\\n if(tar==-1) continue;\\n if(row!=tar){ \\n auto tmp=mat[row];\\n mat[row]=mat[tar];\\n mat[tar]=tmp;\\n }\\n for(int i=row+1;i<m;i++){\\n if(!Detail::isZero(mat[i][j])){\\n T r=mat[i][j]/mat[row][j];\\n for(int k=j;k<n;k++){\\n mat[i][k]-=r*mat[row][k];\\n }\\n }\\n }\\n row++;\\n }\\n return mat;\\n }\\n\\n template<typename T,typename Detail=Detail<T>>\\n int rank(const Matrix<T>& mat){\\n auto tmp=gaussialElimination(mat);\\n int m=tmp.rowSize(),n=tmp.colSize();\\n int i=0,j=0;\\n while(i<m && j<n){\\n if(Detail::isZero(tmp[i][j])) j++;\\n else i++,j++;\\n }\\n return i;\\n }\\n\\n template<typename T>\\n Matrix<T> inv(const Matrix<T>& mat){\\n assert(mat.rowSize()==mat.colSize());\\n int n=mat.rowSize();\\n Matrix<T> tmp(n,2*n);\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n tmp[i][j]=mat[i][j];\\n tmp[i][j+n]=0;\\n }\\n tmp[i][i+n]=1;\\n }\\n mat=gaussianElimination(mat);\\n Matrix<T> res(n);\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n res[i][j]=mat[i][j+n]/=mat[i][i];\\n }\\n }\\n return res;\\n }\\n \\n template<typename T>\\n void debug(Matrix<T> mat){\\n int m=mat.rowSize(),n=mat.colSize();\\n std::cerr<<\\\"###Matrix_Debug###\\\"<<std::endl;\\n for(int i=0;i<m;i++){\\n for(int j=0;j<n;j++){\\n std::cerr<<mat[i][j]<<\\\" \\\";\\n }\\n std::cerr<<std::endl;\\n }\\n }\\n}\\n\\nusing namespace ProconLib;\\n\\nint main(){\\n int s,n,k;\\n cin>>s>>n>>k;\\n if(n==1 && s%k!=0){\\n cout<<-1<<endl;\\n return 0;\\n }\\n int sz=n*k+1;\\n \\n vector<vector<double>> dp(k+1,vector<double>(sz));\\n dp[0][0]=1;\\n for(int i=0;i<k;i++){\\n for(int j=0;j<sz;j++){\\n for(int k=1;k<=n;k++){\\n if(j+k<sz) dp[i+1][j+k]+=dp[i][j]/n;\\n }\\n }\\n }\\n \\n Matrix<double> B(sz,sz+1);\\n {\\n B[0][0]=1;\\n B[0][sz]=0;\\n for(int i=1;i<sz;i++){\\n B[i][i]=-1;\\n for(int j=0;j<sz;j++){\\n // i to j\\n int d=i-j;\\n if(0<=d && d<sz){\\n B[i][j]+=dp[k][d];\\n B[i][sz]-=dp[k][d];\\n }\\n d=i+j;\\n if(j!=0 && 0<=d && d<sz){\\n B[i][j]+=dp[k][d];\\n B[i][sz]-=dp[k][d];\\n }\\n }\\n }\\n }\\n B=gaussianElimination(B);\\n Vector<double> vec(sz+1);\\n for(int i=sz-1;i>=0;i--){\\n for(int j=0;j<i;j++){\\n B[j][sz]-=B[j][i]/B[i][i]*B[i][sz];\\n B[j][i]=0;\\n }\\n }\\n for(int i=0;i<sz;i++){\\n vec[sz-i-1]=B[i][sz]/B[i][i];\\n }\\n vec[sz]=1;\\n\\n Matrix<double> A(sz+1,sz+1);\\n for(int i=1;i<sz;i++){\\n A[i][i-1]=1;\\n }\\n A[sz][sz]=1;\\n for(int i=0;i<sz;i++){\\n int d=i+1;\\n if(d<sz) A[0][i]=dp[k][d];\\n if(d<sz) A[0][sz]+=dp[k][d];\\n }\\n A=pow(A,abs(s));\\n double res=0;\\n for(int i=0;i<=sz;i++){\\n res+=A[sz-1][i]*vec[i];\\n }\\n cout<<fixed<<setprecision(10);\\n cout<<res<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.1935483870967742,\n \"time_ms\": 20,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.0064,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2315_3530756\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n\\nnamespace ProconLib{\\n \\n template<typename T>\\n struct Detail{\\n static constexpr T EPS = T(1e-9);\\n static bool isZero(T v){\\n return abs(v)<=EPS;\\n }\\n };\\n\\n template<typename T>\\n class Vector{\\n int N;\\n std::vector<T> dat;\\n public:\\n Vector(int n):N(n),dat(n){}\\n Vector(int n,T x):N(n),dat(n,x){}\\n Vector(std::vector<T> vec):N(vec.size()),dat(vec){}\\n Vector(const std::vector<T>& vec):N(vec.size()),dat(vec){}\\n Vector(const Vector& vec){dat=vec.dat;}\\n int size(){return N;}\\n T& operator[](int pos){return dat[pos];};\\n const T& operator[](int pos) const{return dat[pos];};\\n T& at(int pos){return dat.at(pos);}\\n const T& at(int pos) const {return dat.at(pos);}\\n };\\n \\n template<typename T>\\n class Matrix{\\n int r,c;\\n std::vector<Vector<T>> dat;\\n public:\\n Matrix(int r,int c):r(r),c(c),dat(r,Vector<T>(c)){}\\n Matrix(int r,int c,T x):r(r),c(c),dat(r,Vector<T>(c,x)){}\\n\\n Vector<T>& operator[](int pos){return dat[pos];};\\n const Vector<T>& operator[](int pos) const{return dat[pos];};\\n Vector<T>& at(int pos){return dat.at(pos);}\\n const Vector<T>& at(int pos) const {return dat.at(pos);}\\n int rowSize() const {return r;}\\n int colSize() const {return c;}\\n };\\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs);\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs);\\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& mat);\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& mat);\\n template<typename T>\\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs);\\n template<typename T>\\n Matrix<T> Identity(int n);\\n template<typename T>\\n Matrix<T> pow(const Matrix<T>& mat,int k);\\n template<typename T,typename Detail=Detail<T>>\\n Matrix<T> gaussianElimination(Matrix<T> mat);\\n template<typename T>\\n int rank(const Matrix<T>& mat);\\n template<typename T>\\n Matrix<T> inv(const Matrix<T>& mat);\\n \\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& lhs,const Matrix<T>& rhs){\\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\\n int r=lhs.rowSize(),c=lhs.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++){\\n for(int j=0;j<c;j++){\\n res[i][j]=lhs[i]+rhs[i];\\n }\\n }\\n return res;\\n }\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& lhs,const Matrix<T>& rhs){\\n assert(lhs.rowSize()==rhs.rowSize() && lhs.colSize()==rhs.colSize());\\n int r=lhs.rowSize(),c=lhs.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++){\\n for(int j=0;j<c;j++){\\n res[i][j]=lhs[i]-rhs[i];\\n }\\n }\\n return res;\\n }\\n template<typename T>\\n Matrix<T> operator+(const Matrix<T>& mat){\\n int r=mat.rowSize(),c=mat.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\\n return res;\\n }\\n template<typename T>\\n Matrix<T> operator-(const Matrix<T>& mat){\\n int r=mat.rowSize(),c=mat.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++)for(int j=0;j<c;j++) res[i][j]=-mat[i][j];\\n return res;\\n }\\n \\n template<typename T>\\n Matrix<T> operator*(const Matrix<T>& lhs,const Matrix<T> &rhs){\\n assert(lhs.colSize()==rhs.rowSize());\\n int r=lhs.rowSize(),c=rhs.colSize(),l=lhs.colSize();\\n Matrix<T> res(r,c);\\n for(int i=0;i<r;i++){\\n for(int k=0;k<l;k++){\\n for(int j=0;j<c;j++){\\n res[i][j]+=lhs[i][k]*rhs[k][j];\\n }\\n }\\n }\\n return res;\\n }\\n\\n template<typename T>\\n Matrix<T> Identity(int n){\\n assert(n>=0);\\n Matrix<T> res(n,n);\\n for(int i=0;i<n;i++){\\n res[i][i]=1;\\n }\\n return res;\\n }\\n\\n template<typename T>\\n Matrix<T> pow(const Matrix<T>& mat,int k){\\n assert(mat.rowSize()==mat.colSize());\\n Matrix<T> x=mat;\\n Matrix<T> res=Identity<T>(mat.rowSize());\\n while(k){\\n if(k&1) res=res*x;\\n x=x*x;\\n k>>=1;\\n }\\n return res;\\n }\\n \\n template<typename T,typename Detail=Detail<T>>\\n Matrix<T> gaussianElimination(Matrix<T> mat){\\n int m=mat.rowSize(),n=mat.colSize();\\n int row=0;\\n for(int j=0;j<n;j++){\\n if(row==m) break;\\n int tar=-1;\\n T v=Detail::EPS;\\n for(int i=row;i<m;i++){\\n if(!Detail::isZero(mat[i][j]) && abs(v)<abs(mat[i][j])){\\n tar=i;\\n v=mat[i][j];\\n }\\n }\\n if(tar==-1) continue;\\n if(row!=tar){ \\n auto tmp=mat[row];\\n mat[row]=mat[tar];\\n mat[tar]=tmp;\\n }\\n for(int i=row+1;i<m;i++){\\n if(!Detail::isZero(mat[i][j])){\\n T r=mat[i][j]/mat[row][j];\\n for(int k=j;k<n;k++){\\n mat[i][k]-=r*mat[row][k];\\n }\\n }\\n }\\n row++;\\n }\\n return mat;\\n }\\n\\n template<typename T,typename Detail=Detail<T>>\\n int rank(const Matrix<T>& mat){\\n auto tmp=gaussialElimination(mat);\\n int m=tmp.rowSize(),n=tmp.colSize();\\n int i=0,j=0;\\n while(i<m && j<n){\\n if(Detail::isZero(tmp[i][j])) j++;\\n else i++,j++;\\n }\\n return i;\\n }\\n\\n template<typename T>\\n Matrix<T> inv(const Matrix<T>& mat){\\n assert(mat.rowSize()==mat.colSize());\\n int n=mat.rowSize();\\n Matrix<T> tmp(n,2*n);\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n tmp[i][j]=mat[i][j];\\n tmp[i][j+n]=0;\\n }\\n tmp[i][i+n]=1;\\n }\\n mat=gaussianElimination(mat);\\n Matrix<T> res(n);\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n;j++){\\n res[i][j]=mat[i][j+n]/=mat[i][i];\\n }\\n }\\n return res;\\n }\\n \\n template<typename T>\\n void debug(Matrix<T> mat){\\n int m=mat.rowSize(),n=mat.colSize();\\n std::cerr<<\\\"###Matrix_Debug###\\\"<<std::endl;\\n for(int i=0;i<m;i++){\\n for(int j=0;j<n;j++){\\n std::cerr<<mat[i][j]<<\\\" \\\";\\n }\\n std::cerr<<std::endl;\\n }\\n }\\n}\\n\\nusing namespace ProconLib;\\n\\nint main(){\\n int s,n,k;\\n cin>>s>>n>>k;\\n if(n==1 && s%k!=0){\\n cout<<-1<<endl;\\n return 0;\\n }\\n int sz=n*k+1;\\n \\n vector<vector<double>> dp(k+1,vector<double>(sz));\\n dp[0][0]=1;\\n for(int i=0;i<k;i++){\\n for(int j=0;j<sz;j++){\\n for(int k=1;k<=n;k++){\\n if(j+k<sz) dp[i+1][j+k]+=dp[i][j]/n;\\n }\\n }\\n }\\n \\n Matrix<double> B(sz,sz+1);\\n {\\n B[0][0]=1;\\n B[0][sz]=0;\\n for(int i=1;i<sz;i++){\\n B[i][i]=-1;\\n for(int j=0;j<sz;j++){\\n // i to j\\n int d=i-j;\\n if(0<=d && d<sz){\\n B[i][j]+=dp[k][d];\\n B[i][sz]-=dp[k][d];\\n }\\n d=i+j;\\n if(j!=0 && 0<=d && d<sz){\\n B[i][j]+=dp[k][d];\\n B[i][sz]-=dp[k][d];\\n }\\n }\\n }\\n }\\n B=gaussianElimination(B);\\n Vector<double> vec(sz+1);\\n for(int i=sz-1;i>=0;i--){\\n for(int j=0;j<i;j++){\\n B[j][sz]-=B[j][i]/B[i][i]*B[i][sz];\\n B[j][i]=0;\\n }\\n }\\n for(int i=0;i<sz;i++){\\n vec[sz-i-1]=B[i][sz]/B[i][i];\\n }\\n vec[sz]=1;\\n\\n Matrix<double> A(sz+1,sz+1);\\n for(int i=1;i<sz;i++){\\n A[i][i-1]=1;\\n }\\n A[sz][sz]=1;\\n for(int i=0;i<sz;i++){\\n int d=i+1;\\n if(d<sz) A[0][i]=dp[k][d];\\n if(d<sz) A[0][sz]+=dp[k][d];\\n }\\n A=pow(A,abs(s));\\n double res=0;\\n for(int i=0;i<=sz;i++){\\n res+=A[sz-1][i]*vec[i];\\n }\\n cout<<fixed<<setprecision(10);\\n cout<<res<<endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 0.1935483870967742,\n \"time_ms\": 20,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.0026,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2315_3315116\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ld = long double;\\n\\ntemplate<class T>\\nclass matrix {\\n\\tvector<vector<T>> dat;\\npublic:\\n\\tmatrix(int row) : dat(row, vector<T>(1)) {}\\n\\tmatrix(int row, int col) : dat(row, vector<T>(col)) {}\\n\\tmatrix(int row, int col, const T& id) : dat(row, vector<T>(col, id)) {}\\n\\tmatrix(const vector<vector<T>>& v) : dat(v) {}\\n\\tmatrix(const vector<T>& v) : dat(v.size(), vector<T>(1)) {\\n\\t\\tfor (int i = 0; i < (int)v.size(); ++i) dat[i][0] = v[i];\\n\\t}\\n\\texplicit operator vector<vector<T>>() const { return dat; }\\n\\tint row_size() const { return dat.size(); }\\n\\tint col_size() const { return dat[0].size(); }\\n\\tmatrix<T>& operator+=(const matrix<T>& that) {\\n\\t\\tint row = row_size(), col = col_size();\\n\\t\\tassert(row_size() == that.row_size() && col_size() == that.col_size());\\n\\t\\tfor (int i = 0; i < row; ++i) for (int j = 0; j < col; ++j) dat[i][j] += that[i][j];\\n\\t\\treturn *this;\\n\\t}\\n\\tmatrix<T>& operator-=(const matrix<T>& that) {\\n\\t\\tint row = row_size(), col = col_size();\\n\\t\\tassert(row_size() == that.row_size() && col_size() == that.col_size());\\n\\t\\tfor (int i = 0; i < row; ++i) for (int j = 0; j < col; ++j) dat[i][j] -= that[i][j];\\n\\t\\treturn *this;\\n\\t}\\n\\tmatrix<T>& operator*=(const T& that) {\\n\\t\\tint row = row_size(), col = col_size();\\n\\t\\tfor (int i = 0; i < row; ++i) for (int j = 0; j < col; ++j) dat[i][j] *= that;\\n\\t\\treturn *this;\\n\\t}\\n\\tmatrix<T>& operator/=(const T& that) {\\n\\t\\tint row = row_size(), col = col_size();\\n\\t\\tfor (int i = 0; i < row; ++i) for (int j = 0; j < col; ++j) dat[i][j] /= that;\\n\\t\\treturn *this;\\n\\t}\\n\\tmatrix<T> operator*(const matrix<T>& that) const {\\n\\t\\tint x = row_size(), y = col_size(), z = that.col_size();\\n\\t\\tassert(col_size() == that.row_size());\\n\\t\\tmatrix<T> res(x, z);\\n\\t\\tfor (int i = 0; i < x; ++i) {\\n\\t\\t\\tfor (int j = 0; j < y; ++j) {\\n\\t\\t\\t\\tfor (int k = 0; k < z; ++k) {\\n\\t\\t\\t\\t\\tres[i][k] += dat[i][j] * that[j][k];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn res;\\n\\t}\\n\\tmatrix<T>& operator*=(const matrix<T>& that) { return *this = *this * that; }\\n\\n\\tvector<T>& operator[](size_t i) & { return dat[i]; }\\n\\tconst vector<T>& operator[](size_t i) const& { return dat[i]; }\\n\\tvector<T> operator[](size_t i) const&& { return move(dat[i]); }\\n\\n\\tT& get(int i, int j) & {\\n\\t\\tassert(0 <= i && i < row_size());\\n\\t\\tassert(0 <= j && j < col_size());\\n\\t\\treturn dat[i][j];\\n\\t}\\n\\tconst T& get(int i, int j) const& {\\n\\t\\tassert(0 <= i && i < row_size());\\n\\t\\tassert(0 <= j && j < col_size());\\n\\t\\treturn dat[i][j];\\n\\t}\\n\\tT get(int i, int j) const&& {\\n\\t\\tassert(0 <= i && i < row_size());\\n\\t\\tassert(0 <= j && j < col_size());\\n\\t\\treturn move(dat[i][j]);\\n\\t}\\n\\tmatrix<T> transpose() const {\\n\\t\\tint row = row_size(), col = col_size();\\n\\t\\tmatrix<T> res(col, row);\\n\\t\\tfor (int i = 0; i < row; ++i) for (int j = 0; j < col; ++j) res[j][i] = dat[i][j];\\n\\t\\treturn res;\\n\\t}\\n};\\n\\ntemplate <class T> matrix<T> operator+(const matrix<T>& a, const matrix<T>& b) { return matrix<T>(a) += b; }\\ntemplate <class T> matrix<T> operator-(const matrix<T>& a, const matrix<T>& b) { return matrix<T>(a) -= b; }\\ntemplate <class T> matrix<T> operator*(const matrix<T>& a, const T& b) { return matrix<T>(a) *= b; }\\ntemplate <class T> matrix<T> operator*(const T& a, const matrix<T>& b) { return matrix<T>(b) *= a; }\\ntemplate <class T> matrix<T> operator/(const matrix<T>& a, const T& b) { return matrix<T>(a) /= b; }\\n\\ntemplate <class T> matrix<T> identity_matrix(int n) {\\n\\tmatrix<T> a(n, n);\\n\\tfor (int i = 0; i < n; i++) a[i][i] = T(1);\\n\\treturn a;\\n}\\n\\ntemplate <class T> matrix<T> pow(const matrix<T>& a, long long b) {\\n\\tconst int n = a.row_size();\\n\\tassert(a.row_size() == a.col_size() && 0 <= b);\\n\\tmatrix<T> res = identity_matrix<T>(n), x(a);\\n\\twhile (true) {\\n\\t\\tif (b & 1LL) res *= x;\\n\\t\\tif (!(b >>= 1LL)) break;\\n\\t\\tx *= x;\\n\\t}\\n\\treturn res;\\n}\\n\\nconst ld eps = 1e-10;\\n\\ntemplate <typename T>\\nbool is_zero(T val) {\\n\\treturn val == T(0);\\n}\\n\\ntemplate <>\\nbool is_zero(ld val) {\\n\\treturn std::abs(val) < eps;\\n}\\n\\ntemplate <typename T>\\nvector<T> gauss_jordan(const matrix<T>& A, const vector<T>& b) {\\n\\tconst int n = A.row_size();\\n\\tmatrix<T> B(n, n + 1);\\n\\tfor (int i = 0; i < n; ++i) {\\n\\t\\tfor (int j = 0; j < n; ++j) B[i][j] = A[i][j];\\n\\t\\tB[i][n] = b[i];\\n\\t}\\n\\tfor (int i = 0; i < n; ++i) {\\n\\t\\tint pivot = i;\\n\\t\\tfor (int j = i; j < n; ++j) {\\n\\t\\t\\tif (std::abs(B[j][i]) > std::abs(B[pivot][i])) pivot = j;\\n\\t\\t}\\n\\t\\tif (i != pivot) swap(B[i], B[pivot]);\\n\\t\\tif (is_zero(B[i][i])) return vector<T>(); // no solution\\n\\t\\tfor (int j = i + 1; j <= n; ++j) B[i][j] /= B[i][i];\\n\\t\\tfor (int j = 0; j < n; ++j) {\\n\\t\\t\\tif (i == j) continue;\\n\\t\\t\\tfor (int k = i + 1; k <= n; ++k) B[j][k] -= B[j][i] * B[i][k];\\n\\t\\t}\\n\\t}\\n\\tvector<T> x(n);\\n\\tfor (int i = 0; i < n; ++i) x[i] = B[i][n];\\n\\treturn x;\\n}\\n\\nint main()\\n{\\n\\tcout << fixed << setprecision(8);\\n\\tint S, N, K;\\n\\tcin >> S >> N >> K; S = abs(S);\\n\\tif (S == 0) {\\n\\t\\tcout << 0 << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tif (N == 1) {\\n\\t\\tcout << (S % K == 0 ? S / K : -1) << endl;\\n\\t\\treturn 0;\\n\\t}\\n\\tvector<ld> dp = { 1 };\\n\\tfor (int i = 0; i < K; i++) {\\n\\t\\tvector<ld> tmp((i + 1) * N + 1);\\n\\t\\tfor (int j = 0; j <= i * N; j++) {\\n\\t\\t\\tfor (int k = 1; k <= N; k++) {\\n\\t\\t\\t\\ttmp[j + k] += dp[j] / N;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tdp.swap(tmp);\\n\\t}\\n\\tint M = N * K;\\n\\tmatrix<ld> mat(M, M);\\n\\tvector<ld> b(M);\\n\\tmat[0][0] = 1;\\n\\tb[0] = 0;\\n\\tfor (int i = 1; i < M; i++) {\\n\\t\\tmat[i][i] = -1;\\n\\t\\tld kei = i * 2 <= M ? 1 / (1 - dp[i * 2]) : 1;\\n\\t\\tb[i] -= kei;\\n\\t\\tfor (int j = 0; j <= M; j++) {\\n\\t\\t\\tint p = abs(i - j);\\n\\t\\t\\tif (p == i) continue;\\n\\t\\t\\tmat[i][p] += dp[j] * kei;\\n\\t\\t}\\n\\t}\\n\\tauto vec = gauss_jordan(mat, b);\\n\\tassert(!vec.empty());\\n\\tvec.push_back(1);\\n\\tmatrix<ld> kei(M + 1, M + 1);\\n\\tfor (int i = 0; i < M - 1; i++) {\\n\\t\\tkei[i][i + 1] = 1;\\n\\t}\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tkei[M - 1][i] = dp[M - i];\\n\\t}\\n\\tkei[M - 1][M] = 1;\\n\\tkei[M][M] = 1;\\n\\tkei = pow(kei, S);\\n\\tld res = 0;\\n\\tfor (int i = 0; i <= M; i++) {\\n\\t\\tres += kei[0][i] * vec[i];\\n\\t}\\n\\tcout << res << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3796,\n \"score_of_the_acc\": -0.0923,\n \"final_rank\": 7\n }\n]","isConversational":false}}},{"rowIdx":1295,"cells":{"group_id":{"kind":"string","value":"aoj_2313_cpp"},"problem_description":{"kind":"string","value":"問題文\nハコの魔女 H.N.ELLY はとある動画サイトの熱狂的なファンである．ハコの魔女の強さはその時々のその動画サイトからの転送速度に応じて変化するのではないかと\n美樹さやか\nは考えた．そこで動画サイトからハコの魔女の持つコンピュータまでの過去の転送速度 (=単位時間あたりのデータの転送量) を調べたい．\n初期のインターネットのネットワークの構造とそれ以降のネットワークの構造の変化を表すクエリが与えられるので，各変化について変化した直後の動画サイトからハコの魔女の持つコンピュータまでの転送速度を求めよ．\nインターネットは複数の転送装置からなるものと見なし，各々をつなぐ回線は双方向に情報を送ることができ，その転送速度の最大は\n1\nであるとする．また，ネットワークは常に動画サイトからハコの魔女へ送られるデータの転送速度を最大化するように運ぶものとする．\n入力形式\n入力は以下の形式で与えられる．\nN\\ E\\ Q\\\\\nF_1\\ T_1\\\\\nF_2\\ T_2\\\\\n…\\\\\nF_E\\ T_E\\\\\nM_1\\ A_1\\ B_1\\\\\nM_2\\ A_2\\ B_2\\\\\n...\\\\\nM_Q\\ A_Q\\ B_Q\\\\\nN\nは動画サイトとハコの魔女の持つコンピュータを含めた転送装置の数である．番号が\n1\nである転送装置は動画サイトであり，番号が\nN\nである転送装置はハコの魔女の持つコンピュータである．\nE\nは初期状態で接続されている転送装置の組み合わせの数であり，\nQ\nはインターネットが変化した回数である．初期のインターネットは\nF_i\nと\nT_i\nが転送速度\n1\nで双方向に接続されていることを表す．\nネットワークの変化は時系列順に与えられ，\nj\n番目の変化は\nM_j\nが\n1\nであれば\nA_j,\\ B_j\n間がつながれたことを表し，\nM_j\nが\n2\nであれば\nA_j,\\ B_j\n間の接続が切れたことを表す．\n出力形式\n各変化の直後における，動画サイトからハコの魔女の持つコンピュータまでの転送速度を出力せよ．\n制約\n2 \\leq N \\leq 500\n0 \\leq E \\leq 20,000\n1 \\leq Q \\leq 1,000\n1 \\leq F_i \\leq N,\\ 1 \\leq T_i \\leq N,\\ F_i \\neq T_i \\ (1 \\leq i \\leq E)\nすべての\n\\{F_i, T_i\\}\nのペアは異なる．\n1 \\leq M_j \\leq 2,\\ 1 \\leq A_j \\leq N\\ ,\\ 1 \\leq B_j \\leq N\\ ,\\ A_j \\neq B_j (1 \\leq j \\leq Q)\nネットワークのどの段階においても次のことが成り立つ : どの\n2\nつの転送装置の間も高々\n1\nつの回線でしか繋がれていない．\n2\nつの転送装置の間が既に繋がれている状態でそれらの間を接続するようなクエリが来たり，\n2\nつの転送装置の間が回線で繋がれていない状態でそれらの間の接続を切るようなクエリが来ることはない．\n入出力例\n入力例 1\n2 1 2\n1 2\n2 1 2\n1 2 1\n出力例1\n0\n1\n最初の変化の後，ハコの魔女のコンピュータと動画サイトは繋がらなくなっているので転送速度は\n0\nである．\n2\n度目の変化の後は両者は直接繋がっており，転送速度は\n1\nになる．\n入力例 2\n3 0 4\n1 2 3\n1 2 1\n1 3 1\n2 2 3\n出力例 2\n0\n1\n2\n1\n入力例 3\n6 4 8\n1 2\n1 3\n4 6\n5 6\n1 2 4\n1 3 5\n1 2 5\n1 3 4\n2 2 4\n2 3 5\n1 2 4\n2 2 1\n出力例 3\n1\n2\n2\n2\n2\n2\n2\n1\n入力例 4\n12 38 6\n1 2\n1 3\n1 4\n1 5\n2 3\n2 4\n2 5\n2 6\n2 7\n2 8\n2 12\n3 4\n3 5\n3 6\n3 7\n3 8\n4 5\n4 6\n4 7\n4 8\n5 6\n5 7\n5 8\n6 7\n6 8\n6 9\n6 10\n6 12\n7 8\n7 9\n7 10\n8 9\n8 10\n9 10\n9 11\n9 12\n10 11\n11 12\n2 6 12\n2 9 12\n1 9 12\n1 6 12\n2 6 12\n1 6 12\n出力例 4\n3\n2\n3\n4\n3\n4\nProblem Setter: Flat35"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2313_9805512","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nstruct MaxFlow {\n struct Edge {\n int to, rev;\n ll cap;\n };\n int V;\n vector<vector<Edge>> G;\n vector<int> itr, level;\n using P = pair<int, int>;\n vector<P> es;\n\n public:\n MaxFlow() {}\n MaxFlow(int V) : V(V) {\n G.assign(V, vector<Edge>());\n }\n int add_vertex() {\n G.push_back(vector<Edge>());\n return V++;\n }\n int add_edge(int from, int to, ll cap) {\n int fid = SZ(G[from]), tid = SZ(G[to]);\n if (from == to)\n tid++;\n es.push_back({from, fid});\n G[from].push_back({to, tid, cap});\n G[to].push_back({from, fid, 0});\n return es.size()-1;\n }\n struct Type {\n int from, to;\n ll cap, recap;\n };\n Type get_edge(int i) {\n auto [from, pos] = es[i];\n auto e = G[from][pos];\n auto re = G[e.to][e.rev];\n return Type{from, e.to, e.cap, re.cap};\n }\n void bfs(int s) {\n level.assign(V, -1);\n queue<int> q;\n level[s] = 0;\n q.push(s);\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto &e : G[v]) {\n if (e.cap > 0 && level[e.to] < 0) {\n level[e.to] = level[v] + 1;\n q.push(e.to);\n }\n }\n }\n }\n ll dfs(int v, int t, ll f) {\n if (v == t)\n return f;\n for (int &i = itr[v]; i < (int)G[v].size(); i++) {\n Edge &e = G[v][i];\n if (e.cap > 0 && level[v] < level[e.to]) {\n ll d = dfs(e.to, t, min(f, e.cap));\n if (d > 0) {\n e.cap -= d, G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n ll run(int s, int t, ll flow_limit = INF) {\n ll ret = 0, f;\n while (ret < flow_limit && (bfs(s), level[t] >= 0)) {\n itr.assign(V, 0);\n while ((f = dfs(s, t, flow_limit - ret)) > 0)\n ret += f;\n }\n return ret;\n }\n vector<int> cut() {\n vector<int> ret(V);\n rep(v, 0, V) if (level[v] < 0) ret[v] = 1;\n return ret;\n }\n void erase_edge(int i) {\n auto& e = G[es[i].first][es[i].second];\n auto& re = G[e.to][e.rev];\n e.cap = re.cap = 0;\n }\n};\n\n/**\n * @brief Maximum Flow\n */\n\nint main() {\n int N, M, Q;\n cin >> N >> M >> Q;\n MaxFlow G(N);\n map<pair<int,int>,int> mp;\n rep(i,0,M) {\n int A, B;\n cin >> A >> B;\n A--, B--;\n mp[{A,B}] = G.add_edge(A,B,1);\n mp[{B,A}] = G.add_edge(B,A,1);\n }\n int ANS = G.run(0,N-1);\n rep(i,0,Q) {\n int T, A, B;\n cin >> T >> A >> B;\n A--, B--;\n if (T == 1) {\n mp[{A,B}] = G.add_edge(A,B,1);\n mp[{B,A}] = G.add_edge(B,A,1);\n ANS += G.run(0,N-1);\n }\n else {\n int id1 = mp[{A,B}], id2 = mp[{B,A}];\n if (G.get_edge(id1).cap == 0 && G.get_edge(id2).cap == 1) {\n G.erase_edge(id1);\n G.erase_edge(id2);\n if (G.run(A,B,1) == 0) {\n ANS--;\n G.run(A,0,1);\n G.run(N-1,B,1);\n }\n }\n else if (G.get_edge(id2).cap == 0 && G.get_edge(id1).cap == 1) {\n G.erase_edge(id1);\n G.erase_edge(id2);\n if (G.run(B,A,1) == 0) {\n ANS--;\n G.run(B,0,1);\n G.run(N-1,A,1);\n }\n }\n else {\n G.erase_edge(id1);\n G.erase_edge(id2);\n }\n }\n cout << ANS << endl;\n }\n}","accuracy":1,"time_ms":700,"memory_kb":7500,"score_of_the_acc":-1.1846,"final_rank":9},{"submission_id":"aoj_2313_9805493","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nstruct MaxFlow {\n struct Edge {\n int to, rev;\n ll cap;\n };\n int V;\n vector<vector<Edge>> G;\n vector<int> itr, level;\n using P = pair<int, int>;\n vector<P> es;\n\n public:\n MaxFlow() {}\n MaxFlow(int V) : V(V) {\n G.assign(V, vector<Edge>());\n }\n int add_vertex() {\n G.push_back(vector<Edge>());\n return V++;\n }\n int add_edge(int from, int to, ll cap) {\n int fid = SZ(G[from]), tid = SZ(G[to]);\n if (from == to)\n tid++;\n es.push_back({from, fid});\n G[from].push_back({to, tid, cap});\n G[to].push_back({from, fid, 0});\n return es.size()-1;\n }\n struct Type {\n int from, to;\n ll cap, recap;\n };\n Type get_edge(int i) {\n auto [from, pos] = es[i];\n auto e = G[from][pos];\n auto re = G[e.to][e.rev];\n return Type{from, e.to, e.cap, re.cap};\n }\n void bfs(int s) {\n level.assign(V, -1);\n queue<int> q;\n level[s] = 0;\n q.push(s);\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto &e : G[v]) {\n if (e.cap > 0 && level[e.to] < 0) {\n level[e.to] = level[v] + 1;\n q.push(e.to);\n }\n }\n }\n }\n ll dfs(int v, int t, ll f) {\n if (v == t)\n return f;\n for (int &i = itr[v]; i < (int)G[v].size(); i++) {\n Edge &e = G[v][i];\n if (e.cap > 0 && level[v] < level[e.to]) {\n ll d = dfs(e.to, t, min(f, e.cap));\n if (d > 0) {\n e.cap -= d, G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n ll run(int s, int t, ll flow_limit = INF) {\n ll ret = 0, f;\n while (ret < flow_limit && (bfs(s), level[t] >= 0)) {\n itr.assign(V, 0);\n while ((f = dfs(s, t, flow_limit - ret)) > 0)\n ret += f;\n }\n return ret;\n }\n vector<int> cut() {\n vector<int> ret(V);\n rep(v, 0, V) if (level[v] < 0) ret[v] = 1;\n return ret;\n }\n void erase_edge(int i) {\n auto& e = G[es[i].first][es[i].second];\n auto& re = G[e.to][e.rev];\n e.cap = re.cap = 0;\n }\n};\n\n/**\n * @brief Maximum Flow\n */\n\nint main() {\n int N, M, Q;\n cin >> N >> M >> Q;\n MaxFlow G(N);\n map<pair<int,int>,int> mp;\n rep(i,0,M) {\n int A, B;\n cin >> A >> B;\n A--, B--;\n mp[{A,B}] = G.add_edge(A,B,1);\n mp[{B,A}] = G.add_edge(B,A,1);\n }\n int ANS = G.run(0,N-1);\n rep(i,0,Q) {\n int T, A, B;\n cin >> T >> A >> B;\n A--, B--;\n if (T == 1) {\n mp[{A,B}] = G.add_edge(A,B,1);\n mp[{B,A}] = G.add_edge(B,A,1);\n ANS += G.run(0,N-1);\n }\n else {\n int id1 = mp[{A,B}], id2 = mp[{B,A}];\n if (G.get_edge(id1).cap == 0 && G.get_edge(id2).cap == 1) {\n G.erase_edge(id1);\n G.erase_edge(id2);\n if (G.run(A,B) == 0) {\n ANS--;\n G.run(A,0,1);\n G.run(N-1,B,1);\n }\n }\n else if (G.get_edge(id2).cap == 0 && G.get_edge(id1).cap == 1) {\n G.erase_edge(id1);\n G.erase_edge(id2);\n if (G.run(B,A) == 0) {\n ANS--;\n G.run(B,0,1);\n G.run(N-1,A,1);\n }\n }\n else {\n G.erase_edge(id1);\n G.erase_edge(id2);\n }\n }\n cout << ANS << endl;\n }\n}","accuracy":0.2413793103448276,"time_ms":10,"memory_kb":3628,"score_of_the_acc":0,"final_rank":13},{"submission_id":"aoj_2313_9376324","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct Dinic {\npublic:\n const long long inf = 1e18;\n vector<int> dist; //sからの距離\n vector<int> iter; //どこまで調べたか\n\n struct edge {\n int to, rev; long long cap;\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\n };\n\n int n;\n vector<vector<edge>> to;\n\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\n int su = (int)to[u].size(), sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap });\n to[v].push_back({ u, su, cap });\n }\n\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\n long long nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n queue<int> q;\n q.push(s);\n dist[s] = 0;\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto nv : to[v]) {\n if (nv.cap > 0 && dist[nv.to] < 0) {\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n }\n\n long long maxflow(int s, int t, int f) {//s:始点, t:終点\n long long res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n\n iter.assign(n, 0);\n while (flow = dfs(s, t, f)) {\n res += flow;\n f -= flow;\n }\n if (f == 0) return res;\n };\n return res;\n }\n};\n\n\nint main()\n{\n std::cin.tie(nullptr);\n std::ios_base::sync_with_stdio(false);\n int n, e, q;\n cin >> n >> e >> q;\n\n Dinic dn(n);\n vii<pair<int, int>> vec(n, vi<pair<int, int>>(n, { -1, -1 }));\n \n rep(i, e) {\n int f, t;\n cin >> f >> t;\n f--, t--;\n if (f > t) swap(f, t);\n dn.addedge(f, t, 1);\n vec[f][t] = { dn.to[t].back().rev, dn.to[f].back().rev };\n }\n\n vi<int> ans;\n int flow = dn.maxflow(0, n - 1, n);\n rep(i, q) {\n int m, a, b;\n cin >> m >> a >> b;\n a--, b--;\n if (a > b) swap(a, b);\n if (m == 1) {\n if (vec[a][b].first == -1 ) {\n dn.addedge(a, b, 1);\n vec[a][b] = {dn.to[b].back().rev, dn.to[a].back().rev};\n }\n else {\n dn.to[a][vec[a][b].first].cap = 1;\n dn.to[b][vec[a][b].second].cap = 1;\n }\n flow += dn.maxflow(0, n - 1, n);\n }\n else {\n if (dn.to[a][vec[a][b].first].cap == 0) {\n int tf = dn.maxflow(a, b, 1);\n if (tf == 0) {\n dn.maxflow(n - 1, b, 1);\n dn.maxflow(a, 0, 1);\n flow--;\n }\n }\n else if (dn.to[b][vec[a][b].second].cap == 0) {\n int tf = dn.maxflow(b, a, 1);\n if (tf == 0) {\n dn.maxflow(n - 1, a, 1);\n dn.maxflow(b, 0, 1);\n flow--;\n }\n }\n \n dn.to[a][vec[a][b].first].cap = 0;\n dn.to[b][vec[a][b].second].cap = 0;\n }\n\n ans.push_back(flow);\n }\n\n for (auto elem : ans) cout << elem << endl;\n return 0;\n}","accuracy":1,"time_ms":270,"memory_kb":6308,"score_of_the_acc":-0.7066,"final_rank":6},{"submission_id":"aoj_2313_9376314","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct Dinic {\npublic:\n const long long inf = 1e18;\n vector<int> dist; //sからの距離\n vector<int> iter; //どこまで調べたか\n\n struct edge {\n int to, rev; long long cap;\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\n };\n\n int n;\n vector<vector<edge>> to;\n\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\n int su = (int)to[u].size(), sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap });\n to[v].push_back({ u, su, cap });\n }\n\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\n long long nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n queue<int> q;\n q.push(s);\n dist[s] = 0;\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto nv : to[v]) {\n if (nv.cap > 0 && dist[nv.to] < 0) {\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n }\n\n long long maxflow(int s, int t, int f) {//s:始点, t:終点\n long long res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n\n iter.assign(n, 0);\n while (flow = dfs(s, t, f)) {\n res += flow;\n f -= flow;\n }\n if (f == 0) return res;\n };\n return res;\n }\n};\n\n\nint main()\n{\n std::cin.tie(nullptr);\n std::ios_base::sync_with_stdio(false);\n int n, e, q;\n cin >> n >> e >> q;\n\n Dinic dn(n);\n map<pair<int, int>, pair<int, int>> mp;\n rep(i, e) {\n int f, t;\n cin >> f >> t;\n f--, t--;\n if (f > t) swap(f, t);\n dn.addedge(f, t, 1);\n mp[{f, t}] = { dn.to[t].back().rev, dn.to[f].back().rev };\n }\n\n vi<int> ans;\n int flow = dn.maxflow(0, n - 1, n);\n rep(i, q) {\n int m, a, b;\n cin >> m >> a >> b;\n a--, b--;\n if (a > b) swap(a, b);\n if (m == 1) {\n if (!mp.count({ a, b })) {\n dn.addedge(a, b, 1);\n mp[{a, b}] = { dn.to[b].back().rev, dn.to[a].back().rev };\n }\n else {\n dn.to[a][mp[{a, b}].first].cap = 1;\n dn.to[b][mp[{a, b}].second].cap = 1;\n }\n flow += dn.maxflow(0, n - 1, n);\n }\n else {\n if (dn.to[a][mp[{a, b}].first].cap == 0) {\n int tf = dn.maxflow(a, b, 1);\n if (tf == 0) {\n dn.maxflow(n - 1, b, 1);\n dn.maxflow(a, 0, 1);\n flow--;\n }\n }\n else if (dn.to[b][mp[{a, b}].second].cap == 0) {\n int tf = dn.maxflow(b, a, 1);\n if (tf == 0) {\n dn.maxflow(n - 1, a, 1);\n dn.maxflow(b, 0, 1);\n flow--;\n }\n }\n \n dn.to[a][mp[{a, b}].first].cap = 0;\n dn.to[b][mp[{a, b}].second].cap = 0; \n }\n\n ans.push_back(flow);\n }\n\n for (auto elem : ans) cout << elem << endl;\n return 0;\n}","accuracy":1,"time_ms":270,"memory_kb":5576,"score_of_the_acc":-0.5506,"final_rank":5},{"submission_id":"aoj_2313_9375839","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\n\nstruct Dinic {\nprivate:\n long long inf = 1e18;\n vector<int> dist; //sからの距離\n vector<int> iter; //どこまで調べたか\npublic:\n struct edge {\n int to, rev; long long cap;\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\n };\n\n int n;\n vector<vector<edge>> to;\n\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\n int su = (int)to[u].size(), sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap });\n to[v].push_back({ u, su, cap });\n }\n\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\n long long nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n queue<int> q;\n q.push(s);\n dist[s] = 0;\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto nv : to[v]) {\n if (nv.cap > 0 && dist[nv.to] < 0) {\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n }\n\n long long maxflow(int s, int t) {//s:始点, t:終点\n long long res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n\n iter.assign(n, 0);\n while (flow = dfs(s, t, inf)) res += flow;\n };\n return res;\n }\n};\n\n\nint main()\n{\n std::cin.tie(nullptr);\n std::ios_base::sync_with_stdio(false);\n int n, e, q;\n cin >> n >> e >> q;\n\n set<pair<int, int>> st;\n rep(i, e) {\n int f, t;\n cin >> f >> t;\n f--, t--;\n if (f > t) swap(f, t);\n st.insert({ f, t });\n }\n\n vi<int> ans;\n Dinic dn(n);\n for (auto elem : st) dn.addedge(elem.first, elem.second, 1);\n int flow = dn.maxflow(0, n - 1);\n rep(i, q) {\n int m, a, b;\n cin >> m >> a >> b;\n a--, b--;\n if (a > b) swap(a, b);\n if (m == 1) {\n st.insert({ a, b });\n dn.addedge(a, b, 1);\n flow += dn.maxflow(0, n - 1);\n }\n else {\n st.erase({ a, b });\n Dinic nxt(n);\n swap(dn, nxt);\n for (auto elem : st) dn.addedge(elem.first, elem.second, 1);\n flow = dn.maxflow(0, n - 1);\n }\n\n ans.push_back(flow);\n }\n\n for (auto elem : ans) cout << elem << endl;\n return 0;\n}","accuracy":1,"time_ms":1930,"memory_kb":6168,"score_of_the_acc":-1.5413,"final_rank":11},{"submission_id":"aoj_2313_9223435","code_snippet":"#include <bits/stdc++.h>\n\nstruct Flow {\n int n;\n int cur_flow;\n std::vector<std::vector<bool>> ord, rev, exist;\n std::vector<bool> used;\n Flow(int n): n(n), cur_flow(0), ord(n, std::vector<bool>(n)), rev(n, std::vector<bool>(n)), exist(n, std::vector<bool>(n)), used(n) {}\n void add_edge(int u, int v) {\n assert(!exist[u][v]);\n assert(!exist[v][u]);\n exist[u][v] = exist[v][u] = true;\n ord[u][v] = ord[v][u] = true;\n rev[u][v] = rev[v][u] = false;\n }\n\n // {n - 1} -> u -> v -> 1\n void get_path(int u, int v) {\n assert(rev[u][v]);\n rev[u][v] = false;\n ord[v][u] = true;\n auto dfs = [&](auto self, int u, int sink) -> bool {\n if (u == sink) return true;\n used[u] = true;\n for (int v = 0; v < n; v++) {\n if (exist[u][v] && rev[u][v] && !used[v]) {\n if (self(self, v, sink)) {\n rev[u][v] = false;\n ord[v][u] = true;\n return true;\n }\n }\n }\n return false;\n };\n used.assign(n, false);\n dfs(dfs, n - 1, u);\n used.assign(n, false);\n dfs(dfs, v, 0);\n }\n\n void delete_edge(int u, int v) {\n assert(exist[u][v]);\n assert(exist[v][u]);\n if ((ord[u][v] && ord[v][u]) || (rev[u][v] && rev[v][u])) {\n exist[u][v] = exist[v][u] = false;\n ord[u][v] = ord[v][u] = false;\n rev[u][v] = rev[v][u] = false;\n return;\n }\n // {n - 1} -> 0;\n (rev[u][v] ? get_path(u, v) : get_path(v, u));\n exist[u][v] = exist[v][u] = false;\n ord[u][v] = ord[v][u] = false;\n cur_flow--;\n }\n int flow() {\n int res = 0;\n while (true) {\n used.assign(n, false);\n int delta = dfs(0);\n if (delta == 0) break;\n res += delta;\n }\n return cur_flow += res;\n }\n int dfs(int u) {\n if (u == n - 1) return 1;\n used[u] = true;\n for (int v = 0; v < n; v++) {\n if (used[v]) continue;\n if (!exist[u][v]) continue;\n if (ord[u][v] || rev[u][v]) {\n if (dfs(v)) {\n if (ord[u][v]) {\n ord[u][v] = false;\n rev[v][u] = true;\n } else {\n rev[u][v] = false;\n ord[v][u] = true;\n }\n return 1;\n }\n }\n }\n return 0;\n }\n};\n\nint main() {\n int n, m, q;\n std::cin >> n >> m >> q;\n Flow flow(n);\n for (int i = 0; i < m; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n flow.add_edge(u, v);\n }\n while (q--) {\n int m, u, v;\n std::cin >> m >> u >> v;\n u--; v--;\n if (m == 1) {\n flow.add_edge(u, v);\n } else {\n flow.delete_edge(u, v);\n }\n std::cout << flow.flow() << '\\n';\n }\n}","accuracy":1,"time_ms":400,"memory_kb":3632,"score_of_the_acc":-0.204,"final_rank":1},{"submission_id":"aoj_2313_8738830","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\nstruct E {\n bool f{}, r{};\n E() = default;\n E(bool f, bool r) : f{f}, r{r} {}\n void flow() {\n f ^= 1;\n r ^= 1;\n }\n friend std::ostream& operator<<(std::ostream& os, const E& e) {\n if (!e.f and !e.r) os << 0;\n else if (e.f) os << 1;\n else os << 2;\n return os;\n }\n};\n\nconst int N{510};\nE g[N][N];\n\nint n, m, q;\n\nint through(int u, int v) {\n if (g[v][u].r) return 2;\n else if (g[u][v].f) return 1;\n else return 0;\n}\n\nbool dfsflow(int v, int t, std::vector<bool>& vis) {\n vis[v] = true;\n if (v == t) return true;\n for (int i{} ; i < n ; i++) if (!vis[i]) {\n int e{through(v, i)};\n if (e == 0) continue;\n if (!dfsflow(i, t, vis)) continue;\n if (e == 1) g[v][i].flow();\n else g[i][v].flow();\n return true;\n }\n return false;\n}\n\nbool dfselim(int v, int t, std::vector<bool>& vis) {\n vis[v] = true;\n if (v == t) return true;\n for (int i{} ; i < n ; i++) if (!vis[i]) {\n int e{through(v, i)};\n // std::cout << '(' << v << ',' << i << ')' << \" is \" << e << std::endl;\n if (e != 2) continue;\n if (!dfselim(i, t, vis)) continue;\n g[i][v].flow();\n return true;\n }\n return false;\n}\n\nbool flow(int s, int t) {\n std::vector<bool> vis(n);\n return dfsflow(s, t, vis);\n}\n\nbool elim(int s, int t) {\n // std::cerr << \"eliminate \" << s << ' ' << t << std::endl;\n std::vector<bool> vis(n);\n return dfselim(s, t, vis);\n}\n\nint main() {\n SetFastIO();\n\n std::cin >> n >> m >> q;\n for (int i{} ; i < n ; i++) for (int j{} ; j < n ; j++) g[i][j] = E{};\n for (int _{} ; _ < m ; _++) {\n int f, t; std::cin >> f >> t;\n f--; t--;\n g[f][t].f = true;\n g[t][f].f = true;\n }\n\n int ans{};\n while (flow(0, n - 1)) ans++;\n\n for (int _{} ; _ < q ; _++) {\n int t, a, b; std::cin >> t >> a >> b;\n // std::cout << t << ' ' << a << ' ' << b << std::endl;\n a--; b--;\n if (t == 1) {\n assert(!g[a][b].f and !g[b][a].f);\n assert(!g[a][b].r and !g[b][a].r);\n g[a][b].f = true;\n g[b][a].f = true;\n ans += flow(0, n - 1);\n }\n else if (t == 2) {\n if (g[a][b].f and g[b][a].f) {\n // std::cerr << \"type \" << 1 << std::endl;\n ;\n }\n else if (g[a][b].r and g[b][a].r) {\n // std::cerr << \"type \" << 2 << std::endl;\n g[a][b].flow();\n g[b][a].flow();\n }\n else if (g[a][b].r) {\n if (!flow(a, b)) {\n assert(elim(n - 1, b));\n g[a][b].flow();\n assert(elim(a, 0));\n ans--;\n }\n else {\n g[a][b].flow();\n }\n }\n else if (g[b][a].r) {\n // std::cerr << \"type \" << 4 << std::endl;\n if (!flow(b, a)) {\n assert(elim(n - 1, a));\n g[b][a].flow();\n assert(elim(b, 0));\n ans--;\n }\n else {\n g[b][a].flow();\n }\n }\n else {\n assert(!\"aaa\");\n }\n assert(g[a][b].f and g[b][a].f);\n assert(!g[a][b].r and !g[a][b].r);\n g[a][b].f = g[b][a].f = false;\n }\n else {\n assert(false);\n }\n std::cout << ans << std::endl;\n }\n}","accuracy":1,"time_ms":340,"memory_kb":3916,"score_of_the_acc":-0.2333,"final_rank":2},{"submission_id":"aoj_2313_8738734","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\nstruct E {\n bool exist;\n bool f, revf;\n E() : exist{false}, f{false}, revf{false} {}\n void on() {\n assert(!exist);\n exist = f = true;\n }\n void off() {\n assert(exist);\n exist = f = revf = false;\n }\n void flip() {\n f ^= 1;\n revf ^= 1;\n }\n bool flowed() const {\n return exist and !f;\n }\n};\n\nenum state {\n uv,\n vu,\n cannot, \n};\n\nint main() {\n SetFastIO();\n\n int n, m, q; std::cin >> n >> m >> q;\n std::vector g(n, std::vector<E>(n));\n \n for (int _{} ; _ < m ; _++) {\n int a, b; std::cin >> a >> b;\n a--; b--;\n g[a][b].on();\n g[b][a].on();\n }\n\n auto can{[&](int u, int v) -> state {\n if (g[v][u].exist and g[v][u].revf) return vu;\n else if (g[u][v].exist and g[u][v].f) return uv;\n else return cannot;\n }};\n\n auto flow{[&](int s, int t) -> bool {\n std::vector<bool> vis(n); \n auto dfs{[&](auto dfs, int v) -> bool {\n vis[v] = true;\n if (v == t) return true;\n for (int x{} ; x < n ; x++) if (!vis[x]) {\n auto e{can(v, x)}; \n if (e == cannot) continue;\n if (dfs(dfs, x)) {\n if (e == uv) g[v][x].flip();\n else if (e == vu) g[x][v].flip();\n return true;\n }\n }\n return false;\n }};\n return dfs(dfs, s);\n }};\n\n int ans{};\n while (flow(0, n - 1)) ans++;\n\n for (int _{} ; _ < q ; _++) {\n int t, a, b; std::cin >> t >> a >> b;\n a--; b--;\n if (t == 1) {\n g[a][b].on();\n g[b][a].on();\n ans += flow(0, n - 1);\n }\n else if (t == 2) {\n assert(g[a][b].exist and g[b][a].exist);\n if (!g[a][b].flowed() and !g[b][a].flowed()) {\n ;\n }\n else if (g[a][b].flowed() and g[b][a].flowed()) {\n ;\n }\n else if (g[a][b].flowed()) {\n if (!flow(a, b)) {\n ans--;\n flow(n - 1, b);\n g[a][b].flip();\n flow(a, 0);\n }\n } \n else if (g[b][a].flowed()) {\n if (!flow(b, a)) {\n ans--;\n flow(n - 1, a);\n g[b][a].flip();\n flow(b, 0);\n }\n }\n else {\n assert(false);\n }\n g[a][b].off();\n g[b][a].off();\n }\n else {\n assert(false);\n }\n std::cout << ans << '\\n';\n }\n}","accuracy":0.15517241379310345,"time_ms":210,"memory_kb":3700,"score_of_the_acc":-0.1195,"final_rank":17},{"submission_id":"aoj_2313_8738729","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\nstruct E {\n bool exist;\n bool f, revf;\n E() : exist{false}, f{false}, revf{false} {}\n void on() {\n assert(!exist);\n exist = f = true;\n }\n void off() {\n assert(exist);\n exist = f = revf = false;\n }\n void flip() {\n f ^= 1;\n revf ^= 1;\n }\n bool flowed() const {\n return exist and !f;\n }\n};\n\nenum state {\n uv,\n vu,\n cannot, \n};\n\nint main() {\n SetFastIO();\n\n int n, m, q; std::cin >> n >> m >> q;\n std::vector g(n, std::vector<E>(n));\n \n for (int _{} ; _ < m ; _++) {\n int a, b; std::cin >> a >> b;\n a--; b--;\n g[a][b].on();\n g[b][a].on();\n }\n\n auto can{[&](int u, int v) -> state {\n if (g[v][u].exist and g[v][u].revf) return vu;\n else if (g[u][v].exist and g[u][v].f) return uv;\n else return cannot;\n }};\n\n auto flow{[&](int s, int t) -> bool {\n std::vector<bool> vis(n); \n auto dfs{[&](auto dfs, int v) -> bool {\n vis[v] = true;\n if (v == t) return true;\n for (int x{} ; x < n ; x++) if (!vis[x]) {\n auto e{can(v, x)}; \n if (e == cannot) continue;\n if (dfs(dfs, x)) {\n if (e == uv) g[v][x].flip();\n else if (e == vu) g[x][v].flip();\n return true;\n }\n }\n return false;\n }};\n return dfs(dfs, s);\n }};\n\n int ans{};\n while (flow(0, n - 1)) ans++;\n\n for (int _{} ; _ < q ; _++) {\n int t, a, b; std::cin >> t >> a >> b;\n a--; b--;\n if (t == 1) {\n g[a][b].on();\n g[b][a].on();\n ans += flow(0, n - 1);\n }\n else if (t == 2) {\n assert(g[a][b].exist and g[b][a].exist);\n if (!g[a][b].flowed() and !g[b][a].flowed()) {\n ;\n }\n else if (g[a][b].flowed() and g[b][a].flowed()) {\n ;\n }\n else if (g[a][b].flowed()) {\n if (!flow(a, b)) {\n ans--;\n assert(flow(n - 1, b));\n assert(g[a][b].flowed());\n g[a][b].flip();\n assert(flow(a, 0));\n }\n } \n else if (g[b][a].flowed()) {\n if (!flow(b, a)) {\n ans--;\n assert(flow(n - 1, a));\n assert(g[b][a].flowed());\n g[b][a].flip();\n assert(flow(b, 0));\n }\n }\n else {\n assert(false);\n }\n g[a][b].off();\n g[b][a].off();\n }\n else {\n assert(false);\n }\n std::cout << ans << '\\n';\n }\n}","accuracy":0.15517241379310345,"time_ms":210,"memory_kb":3760,"score_of_the_acc":-0.1323,"final_rank":18},{"submission_id":"aoj_2313_8738718","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\nstruct E {\n bool exist;\n bool f, revf;\n E() : exist{false}, f{false}, revf{false} {}\n void on() {\n assert(!exist);\n exist = f = true;\n }\n void off() {\n assert(exist);\n exist = f = revf = false;\n }\n void flip() {\n f ^= 1;\n revf ^= 1;\n }\n bool flowed() const {\n return exist and !f;\n }\n};\n\nenum state {\n uv,\n vu,\n cannot, \n};\n\nint main() {\n SetFastIO();\n\n int n, m, q; std::cin >> n >> m >> q;\n std::vector g(n, std::vector<E>(n));\n \n for (int _{} ; _ < m ; _++) {\n int a, b; std::cin >> a >> b;\n a--; b--;\n g[a][b].on();\n g[b][a].on();\n }\n\n auto can{[&](int u, int v) -> state {\n if (g[v][u].exist and g[v][u].revf) return vu;\n else if (g[u][v].exist and g[u][v].f) return uv;\n else return cannot;\n }};\n\n auto flow{[&](int s, int t) -> bool {\n std::vector<bool> vis(n); \n auto dfs{[&](auto dfs, int v) -> bool {\n vis[v] = true;\n if (v == t) return true;\n for (int x{} ; x < n ; x++) if (!vis[x]) {\n auto e{can(v, x)}; \n if (e == cannot) continue;\n if (dfs(dfs, x)) {\n if (e == uv) g[v][x].flip();\n else if (e == vu) g[x][v].flip();\n return true;\n }\n }\n return false;\n }};\n return dfs(dfs, s);\n }};\n\n int ans{};\n while (flow(0, n - 1)) ans++;\n\n for (int _{} ; _ < q ; _++) {\n int t, a, b; std::cin >> t >> a >> b;\n a--; b--;\n if (t == 1) {\n g[a][b].on();\n g[b][a].on();\n ans += flow(0, n - 1);\n }\n else if (t == 2) {\n assert(g[a][b].exist and g[b][a].exist);\n if (!g[a][b].flowed() and !g[b][a].flowed()) {\n ;\n }\n else if (g[a][b].flowed() and g[b][a].flowed()) {\n ;\n }\n else if (g[a][b].flowed()) {\n if (!flow(a, b)) {\n ans--;\n assert(flow(n - 1, b));\n g[a][b].flip();\n assert(flow(a, 0));\n }\n } \n else if (g[b][a].flowed()) {\n if (!flow(b, a)) {\n ans--;\n assert(flow(n - 1, a));\n g[b][a].flip();\n assert(flow(b, 0));\n }\n }\n else {\n assert(false);\n }\n g[a][b].off();\n g[b][a].off();\n }\n else {\n assert(false);\n }\n std::cout << ans << '\\n';\n }\n}","accuracy":0.15517241379310345,"time_ms":200,"memory_kb":3704,"score_of_the_acc":-0.1152,"final_rank":16},{"submission_id":"aoj_2313_8738712","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\nstruct E {\n bool exist;\n bool f, revf;\n E() : exist{false}, f{false}, revf{false} {}\n void on() {\n assert(!exist);\n exist = f = true;\n }\n void off() {\n assert(exist);\n exist = f = revf = false;\n }\n void flip() {\n f ^= 1;\n revf ^= 1;\n }\n bool flowed() const {\n return exist and !f;\n }\n};\n\nenum state {\n uv,\n vu,\n cannot, \n};\n\nint main() {\n SetFastIO();\n\n int n, m, q; std::cin >> n >> m >> q;\n std::vector g(n, std::vector<E>(n));\n \n for (int _{} ; _ < m ; _++) {\n int a, b; std::cin >> a >> b;\n a--; b--;\n g[a][b].on();\n g[b][a].on();\n }\n\n auto can{[&](int u, int v) -> state {\n if (g[u][v].exist and g[u][v].f) return uv;\n else if (g[v][u].exist and g[v][u].revf) return vu;\n else return cannot;\n }};\n\n auto flow{[&](int s, int t) -> bool {\n std::vector<bool> vis(n); \n auto dfs{[&](auto dfs, int v) -> bool {\n vis[v] = true;\n if (v == t) return true;\n for (int x{} ; x < n ; x++) if (!vis[x]) {\n auto e{can(v, x)}; \n if (e == cannot) continue;\n if (dfs(dfs, x)) {\n if (e == uv) g[v][x].flip();\n else if (e == vu) g[x][v].flip();\n return true;\n }\n }\n return false;\n }};\n return dfs(dfs, s);\n }};\n\n int ans{};\n while (flow(0, n - 1)) ans++;\n\n for (int _{} ; _ < q ; _++) {\n int t, a, b; std::cin >> t >> a >> b;\n a--; b--;\n if (t == 1) {\n g[a][b].on();\n g[b][a].on();\n ans += flow(0, n - 1);\n }\n else if (t == 2) {\n assert(g[a][b].exist and g[b][a].exist);\n if (!g[a][b].flowed() and !g[b][a].flowed()) {\n ;\n }\n else if (g[a][b].flowed() and g[b][a].flowed()) {\n ;\n }\n else if (g[a][b].flowed()) {\n if (!flow(a, b)) {\n ans--;\n assert(flow(n - 1, b));\n g[a][b].flip();\n assert(flow(a, 0));\n }\n } \n else if (g[b][a].flowed()) {\n if (!flow(b, a)) {\n ans--;\n assert(flow(n - 1, a));\n g[b][a].flip();\n assert(flow(b, 0));\n }\n }\n else {\n assert(false);\n }\n g[a][b].off();\n g[b][a].off();\n }\n else {\n assert(false);\n }\n std::cout << ans << '\\n';\n }\n}","accuracy":0.15517241379310345,"time_ms":240,"memory_kb":3740,"score_of_the_acc":-0.1437,"final_rank":20},{"submission_id":"aoj_2313_8738223","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\nstruct E {\n bool exist;\n bool f, revf;\n E() : exist{false}, f{false}, revf{false} {}\n void on() {\n assert(!exist);\n exist = f = true;\n }\n void off() {\n assert(exist);\n exist = f = revf = false;\n }\n void flip() {\n f ^= 1;\n revf ^= 1;\n }\n bool flowed() const {\n return exist and !f;\n }\n};\n\nenum state {\n uv,\n vu,\n cannot, \n};\n\nint main() {\n SetFastIO();\n\n int n, m, q; std::cin >> n >> m >> q;\n std::vector g(n, std::vector<E>(n));\n \n for (int _{} ; _ < m ; _++) {\n int a, b; std::cin >> a >> b;\n a--; b--;\n g[a][b].on();\n g[b][a].on();\n }\n\n auto can{[&](int u, int v) -> state {\n if (g[u][v].exist and g[u][v].f) return uv;\n else if (g[v][u].exist and g[v][u].revf) return vu;\n else return cannot;\n }};\n\n auto flow{[&](int s, int t) -> bool {\n std::vector<bool> vis(n); \n auto dfs{[&](auto dfs, int v) -> bool {\n vis[v] = true;\n if (v == t) return true;\n for (int x{} ; x < n ; x++) if (!vis[x]) {\n auto e{can(v, x)}; \n if (e == cannot) continue;\n if (dfs(dfs, x)) {\n if (e == uv) g[v][x].flip();\n else if (e == vu) g[x][v].flip();\n return true;\n }\n }\n return false;\n }};\n return dfs(dfs, s);\n }};\n\n int ans{};\n while (flow(0, n - 1)) ans++;\n\n for (int _{} ; _ < q ; _++) {\n int t, a, b; std::cin >> t >> a >> b;\n a--; b--;\n if (t == 1) {\n g[a][b].on();\n g[b][a].on();\n ans += flow(0, n - 1);\n }\n else if (t == 2) {\n assert(g[a][b].exist and g[b][a].exist);\n if (!(g[a][b].flowed() ^ g[b][a].flowed())) {\n ;\n }\n else if (g[a][b].flowed()) {\n if (!flow(a, b)) {\n ans--;\n assert(flow(n - 1, b));\n g[a][b].flip();\n assert(flow(a, 0));\n }\n } \n else if (g[b][a].flowed()) {\n if (!flow(b, a)) {\n ans--;\n assert(flow(n - 1, a));\n g[b][a].flip();\n assert(flow(b, 0));\n }\n }\n else {\n assert(false);\n }\n g[a][b].off();\n g[b][a].off();\n }\n else {\n assert(false);\n }\n std::cout << ans << '\\n';\n }\n}","accuracy":0.15517241379310345,"time_ms":240,"memory_kb":3704,"score_of_the_acc":-0.136,"final_rank":19},{"submission_id":"aoj_2313_8363602","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\nusing ll = long long;\nusing ld = long double;\n\nbool is_end = false;\n\n/*\n目的：max flow を求める\n特徴：max_flow を呼び出したのちに、add_edge が可能\n(max_flow は「前回の状態からどれだけ流せるか」を返すので、flow を流す場所 s, t を変えるとおかしな結果になる)\n*/\ntemplate<class flow_t = long long>\nstruct FordFulkerson\n{\n\t\n\tint siz;\n\tvector<vector<flow_t>> graph;\n\tvector<bool> used;\n\t\n\tFordFulkerson(int n) : siz(n), graph(n, vector<flow_t>(n, 0)), used(siz, false) { }\n\t\n\tvoid add_edge(int from, int to, flow_t cap)\n\t{\n\t\tassert(from < siz && to < siz);\n\t\tgraph[from][to] += cap;\n\t}\n\t\n\tflow_t dfs(int v, int target, flow_t flow)\n\t{\n\t\tif (v == target) {return flow;}\n\t\tused[v] = true;\n\t\t\n\t\tfor (int to = 0; to < siz; ++to)\n\t\t{\n\t\t\tflow_t cap = graph[v][to];\n\t\t\tif (cap > 0 && !used[to])\n\t\t\t{\n\t\t\t\tflow_t f = dfs(to, target, min(flow, cap));\n\t\t\t\tif (f > 0)\n\t\t\t\t{\n\t\t\t\t\tgraph[v][to] -= f;\n\t\t\t\t\tgraph[to][v] += f;\n\t\t\t\t\treturn f;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n\t// max flow on s -> t\n\tflow_t max_flow(int s, int t)\n\t{\n\t\tflow_t flow = 0;\n\t\tflow_t INF = 1e9; // INF の上限値に注意\n\t\twhile (true)\n\t\t{\n\t\t\tused.assign(siz, false);\n\t\t\tflow_t f = dfs(s, t, INF);\n\t\t\tflow += f;\n\t\t\t\n\t\t\tif (f == 0) {return flow;}\n\t\t}\n\t\t// 絶対に到達しないはず\n\t\treturn 0;\n\t}\n\t\n\tflow_t dfs2(int v, int target, flow_t flow)\n\t{\n\t\tif (v == target) {return flow;}\n\t\tused[v] = true;\n\t\t\n\t\tfor (int to = 0; to < siz; ++to)\n\t\t{\n\t\t\tflow_t cap = graph[v][to];\n\t\t\tif (graph[v][to] - graph[to][v] > 0 && !used[to])\n\t\t\t{\n\t\t\t\tflow_t f = dfs2(to, target, min(flow, cap));\n\t\t\t\tif (f > 0)\n\t\t\t\t{\n\t\t\t\t\tgraph[v][to] -= f;\n\t\t\t\t\tgraph[to][v] += f;\n\t\t\t\t\treturn f;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n\tflow_t limit_flow(int s, int t, int limit)\n\t{\n\t\tflow_t flow = 0;\n\t\twhile (true)\n\t\t{\n\t\t\tused.assign(siz, false);\n\t\t\tflow_t f = dfs(s, t, limit);\n\t\t\tflow += f;\n\t\t\tlimit -= f;\n\t\t\t\n\t\t\tif (f == 0) {return flow;}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n\tvoid loosen(int s, int t)\n\t{\n\t\tused.assign(siz, false);\n\t\t\n\t\tvector<vector<bool>> isneed(siz, vector<bool>(siz, false));\n\t\tqueue<int> que;\n\t\tque.emplace(s);\n\t\tused[s] = true;\n\t\t\n\t\twhile (!que.empty())\n\t\t{\n\t\t\tint v = que.front();\n\t\t\tque.pop();\n\t\t\t\n\t\t\tfor (int nv = 0; nv < siz; ++nv)\n\t\t\t{\n\t\t\t\tif (graph[v][nv] < graph[nv][v])\n\t\t\t\t{\n\t\t\t\t\tisneed[v][nv] = isneed[nv][v] = true;\n\t\t\t\t\tif (used[nv]) {continue;}\n\t\t\t\t\tused[nv] = true;\n\t\t\t\t\tque.emplace(nv);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < siz; ++i)\n\t\t{\n\t\t\tfor (int j = i; j < siz; ++j)\n\t\t\t{\n\t\t\t\tif (isneed[i][j]) continue;\n\t\t\t\tint mid = (graph[i][j] + graph[j][i]) / 2;\n\t\t\t\tgraph[i][j] = graph[j][i] = mid;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn;\n\t}\n\t\n};\n\nvoid output(FordFulkerson<int> &g)\n{\n\tint n = g.siz;\n\t\n\tcout << \"cap\" << endl;\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\tcout << g.graph[i][j] << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\tcout << \"flow\" << endl;\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\tint f = (g.graph[j][i]) / 2;\n\t\t\tcout << f << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\tcout << endl;\n\t\n\treturn;\n}\n\nvoid calc()\n{\n\tint N, E, Q; cin >> N >> E >> Q;\n\tFordFulkerson<int> g(N);\n\t\n\tfor (int i = 0; i < E; ++i)\n\t{\n\t\tint f, t; cin >> f >> t;\n\t\tf--, t--;\n\t\tg.add_edge(f, t, 1);\n\t\tg.add_edge(t ,f, 1);\n\t}\n\t\n\tint S = 0, T = N-1;\n\tint sum = g.max_flow(S, T);\n\t\n\tfor (int q = 0; q < Q; ++q)\n\t{\n\t\tint m, a, b; cin >> m >> a >> b;\n\t\ta--, b--;\n\t\t\n\t\tif (m == 1)\n\t\t{\n\t\t\t// connect (a, b)\n\t\t\tg.add_edge(a, b, 1);\n\t\t\tg.add_edge(b, a, 1);\n\t\t\tsum += g.max_flow(S, T);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tassert(g.graph[a][b] + g.graph[b][a] > 0);\n\t\t\t// cut (a, b)\n\t\t\tif (g.graph[a][b] == 0)\n\t\t\t{\n\t\t\t\t// S -> a -> b -> T flow exists\n\t\t\t\tg.graph[a][b] = g.graph[b][a] = 0;\n\t\t\t\tint f = g.limit_flow(a, b, 1);\n\t\t\t\t\n\t\t\t\tif (f == 0)\n\t\t\t\t{\n\t\t\t\t\tsum -= 1;\n\t\t\t\t\tf = g.limit_flow(T, b, 1);\n\t\t\t\t\tassert(T == b || f == 1);\n\t\t\t\t\tf = g.limit_flow(a, S, 1);\n\t\t\t\t\tassert(S == a || f == 1);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (g.graph[b][a] == 0)\n\t\t\t{\n\t\t\t\t// S -> b -> a -> T flow exists\n\t\t\t\tg.graph[a][b] = g.graph[b][a] = 0;\n\t\t\t\tint f = g.limit_flow(b, a, 1);\n\t\t\t\t\n\t\t\t\tif (f == 0)\n\t\t\t\t{\n\t\t\t\t\tsum -= 1;\n\t\t\t\t\tf = g.limit_flow(T, a, 1);\n\t\t\t\t\tassert(T == a || f == 1);\n\t\t\t\t\tf = g.limit_flow(b, S, 1);\n\t\t\t\t\tassert(S == b || f == 1);\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\t;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tg.graph[a][b] = g.graph[b][a] = 0;\n\t\t\t}\n\t\t\t\n\t\t}\n\t\t\n\t\tcout << sum << endl;\n\t\t// g.loosen(S, T);\n\t\t\n\t\t// cout << m << \" \" << a << \" \" << b << endl;\n\t\t// output(g);\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":1,"time_ms":600,"memory_kb":4456,"score_of_the_acc":-0.4838,"final_rank":3},{"submission_id":"aoj_2313_8363551","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\nusing ll = long long;\nusing ld = long double;\n\nbool is_end = false;\n\n/*\n目的：max flow を求める\n特徴：max_flow を呼び出したのちに、add_edge が可能\n(max_flow は「前回の状態からどれだけ流せるか」を返すので、flow を流す場所 s, t を変えるとおかしな結果になる)\n*/\ntemplate<class flow_t = long long>\nstruct FordFulkerson\n{\n\t\n\tint siz;\n\tvector<vector<flow_t>> graph;\n\tvector<bool> used;\n\t\n\tFordFulkerson(int n) : siz(n), graph(n, vector<flow_t>(n, 0)), used(siz, false) { }\n\t\n\tvoid add_edge(int from, int to, flow_t cap)\n\t{\n\t\tassert(from < siz && to < siz);\n\t\tgraph[from][to] += cap;\n\t}\n\t\n\tflow_t dfs(int v, int target, flow_t flow)\n\t{\n\t\tif (v == target) {return flow;}\n\t\tused[v] = true;\n\t\t\n\t\tfor (int to = 0; to < siz; ++to)\n\t\t{\n\t\t\tflow_t cap = graph[v][to];\n\t\t\tif (cap > 0 && !used[to])\n\t\t\t{\n\t\t\t\tflow_t f = dfs(to, target, min(flow, cap));\n\t\t\t\tif (f > 0)\n\t\t\t\t{\n\t\t\t\t\tgraph[v][to] -= f;\n\t\t\t\t\tgraph[to][v] += f;\n\t\t\t\t\treturn f;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n\t// max flow on s -> t\n\tflow_t max_flow(int s, int t)\n\t{\n\t\tflow_t flow = 0;\n\t\tflow_t INF = 1e9; // INF の上限値に注意\n\t\twhile (true)\n\t\t{\n\t\t\tused.assign(siz, false);\n\t\t\tflow_t f = dfs(s, t, INF);\n\t\t\tflow += f;\n\t\t\t\n\t\t\tif (f == 0) {return flow;}\n\t\t}\n\t\t// 絶対に到達しないはず\n\t\treturn 0;\n\t}\n\t\n\tflow_t dfs2(int v, int target, flow_t flow)\n\t{\n\t\tif (v == target) {return flow;}\n\t\tused[v] = true;\n\t\t\n\t\tfor (int to = 0; to < siz; ++to)\n\t\t{\n\t\t\tflow_t cap = graph[v][to];\n\t\t\tif (graph[v][to] - graph[to][v] > 0 && !used[to])\n\t\t\t{\n\t\t\t\tflow_t f = dfs2(to, target, min(flow, cap));\n\t\t\t\tif (f > 0)\n\t\t\t\t{\n\t\t\t\t\tgraph[v][to] -= f;\n\t\t\t\t\tgraph[to][v] += f;\n\t\t\t\t\treturn f;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n\tflow_t limit_flow(int s, int t, int limit)\n\t{\n\t\tflow_t flow = 0;\n\t\twhile (true)\n\t\t{\n\t\t\tused.assign(siz, false);\n\t\t\tflow_t f = dfs2(s, t, limit);\n\t\t\tflow += f;\n\t\t\tlimit -= f;\n\t\t\t\n\t\t\tif (f == 0) {return flow;}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n\tvoid loosen(int s, int t)\n\t{\n\t\tused.assign(siz, false);\n\t\t\n\t\tvector<vector<bool>> isneed(siz, vector<bool>(siz, false));\n\t\tqueue<int> que;\n\t\tque.emplace(s);\n\t\tused[s] = true;\n\t\t\n\t\twhile (!que.empty())\n\t\t{\n\t\t\tint v = que.front();\n\t\t\tque.pop();\n\t\t\t\n\t\t\tfor (int nv = 0; nv < siz; ++nv)\n\t\t\t{\n\t\t\t\tif (graph[v][nv] < graph[nv][v])\n\t\t\t\t{\n\t\t\t\t\tisneed[v][nv] = isneed[nv][v] = true;\n\t\t\t\t\tif (used[nv]) {continue;}\n\t\t\t\t\tused[nv] = true;\n\t\t\t\t\tque.emplace(nv);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor (int i = 0; i < siz; ++i)\n\t\t{\n\t\t\tfor (int j = i; j < siz; ++j)\n\t\t\t{\n\t\t\t\tif (isneed[i][j]) continue;\n\t\t\t\tint mid = (graph[i][j] + graph[j][i]) / 2;\n\t\t\t\tgraph[i][j] = graph[j][i] = mid;\n\t\t\t}\n\t\t}\n\t\t\n\t\treturn;\n\t}\n\t\n};\n\nvoid output(FordFulkerson<int> &g)\n{\n\tint n = g.siz;\n\t\n\tcout << \"cap\" << endl;\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\tcout << g.graph[i][j] << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\tcout << \"flow\" << endl;\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\tint f = (g.graph[j][i]) / 2;\n\t\t\tcout << f << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\tcout << endl;\n\t\n\treturn;\n}\n\nvoid calc()\n{\n\tint N, E, Q; cin >> N >> E >> Q;\n\tFordFulkerson<int> g(N);\n\t\n\tfor (int i = 0; i < E; ++i)\n\t{\n\t\tint f, t; cin >> f >> t;\n\t\tf--, t--;\n\t\tg.add_edge(f, t, 1);\n\t\tg.add_edge(t ,f, 1);\n\t}\n\t\n\tint S = 0, T = N-1;\n\tint sum = g.max_flow(S, T);\n\t\n\tfor (int q = 0; q < Q; ++q)\n\t{\n\t\tint m, a, b; cin >> m >> a >> b;\n\t\ta--, b--;\n\t\t\n\t\tif (m == 1)\n\t\t{\n\t\t\t// connect (a, b)\n\t\t\tg.add_edge(a, b, 1);\n\t\t\tg.add_edge(b, a, 1);\n\t\t\tsum += g.max_flow(S, T);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tassert(g.graph[a][b] + g.graph[b][a] > 0);\n\t\t\t// cut (a, b)\n\t\t\tif (g.graph[a][b] == 0)\n\t\t\t{\n\t\t\t\t// S -> a -> b -> T flow exists\n\t\t\t\tint f = g.limit_flow(T, b, 1);\n\t\t\t\tassert(T == b || f == 1);\n\t\t\t\tf = g.limit_flow(a, S, 1);\n\t\t\t\tassert(S == a || f == 1);\n\t\t\t\t\n\t\t\t\tg.graph[b][a] -= 1;\n\t\t\t\tg.graph[a][b] += 1;\n\t\t\t\tsum -= 1;\n\t\t\t}\n\t\t\tif (g.graph[b][a] == 0)\n\t\t\t{\n\t\t\t\t// S -> b -> a -> T flow exists\n\t\t\t\tint f = g.limit_flow(T, a, 1);\n\t\t\t\tassert(T == a || f == 1);\n\t\t\t\tf = g.limit_flow(b, S, 1);\n\t\t\t\tassert(S == b || f == 1);\n\t\t\t\t\n\t\t\t\tg.graph[a][b] -= 1;\n\t\t\t\tg.graph[b][a] += 1;\n\t\t\t\tsum -= 1;\n\t\t\t}\n\t\t\tg.graph[a][b] = g.graph[b][a] = 0;\n\t\t\tsum += g.max_flow(S, T);\n\t\t}\n\t\t\n\t\tcout << sum << endl;\n\t\tg.loosen(S, T);\n\t\t\n\t\t// cout << m << \" \" << a << \" \" << b << endl;\n\t\t// output(g);\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":1,"time_ms":1410,"memory_kb":4520,"score_of_the_acc":-0.9193,"final_rank":8},{"submission_id":"aoj_2313_8363366","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\nusing ll = long long;\nusing ld = long double;\n\nbool is_end = false;\n\n/*\n目的：max flow を求める\n特徴：max_flow を呼び出したのちに、add_edge が可能\n(max_flow は「前回の状態からどれだけ流せるか」を返すので、flow を流す場所 s, t を変えるとおかしな結果になる)\n*/\ntemplate<class flow_t = long long>\nstruct FordFulkerson\n{\n\t\n\tint siz;\n\tvector<vector<flow_t>> graph;\n\tvector<bool> used;\n\t\n\tFordFulkerson(int n) : siz(n), graph(n, vector<flow_t>(n, 0)), used(siz, false) { }\n\t\n\tvoid add_edge(int from, int to, flow_t cap)\n\t{\n\t\tassert(from < siz && to < siz);\n\t\tgraph[from][to] += cap;\n\t}\n\t\n\tflow_t dfs(int v, int target, flow_t flow)\n\t{\n\t\tif (v == target) {return flow;}\n\t\tused[v] = true;\n\t\t\n\t\tfor (int to = 0; to < siz; ++to)\n\t\t{\n\t\t\tflow_t cap = graph[v][to];\n\t\t\tif (cap > 0 && !used[to])\n\t\t\t{\n\t\t\t\tflow_t f = dfs(to, target, min(flow, cap));\n\t\t\t\tif (f > 0)\n\t\t\t\t{\n\t\t\t\t\tgraph[v][to] -= f;\n\t\t\t\t\tgraph[to][v] += f;\n\t\t\t\t\treturn f;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n\t// max flow on s -> t\n\tflow_t max_flow(int s, int t)\n\t{\n\t\tflow_t flow = 0;\n\t\tflow_t INF = 1e9; // INF の上限値に注意\n\t\twhile (true)\n\t\t{\n\t\t\tused.assign(siz, false);\n\t\t\tflow_t f = dfs(s, t, INF);\n\t\t\tflow += f;\n\t\t\t\n\t\t\tif (f == 0) {return flow;}\n\t\t}\n\t\t// 絶対に到達しないはず\n\t\treturn 0;\n\t}\n\t\n\tflow_t dfs2(int v, int target, flow_t flow)\n\t{\n\t\tif (v == target) {return flow;}\n\t\tused[v] = true;\n\t\t\n\t\tfor (int to = 0; to < siz; ++to)\n\t\t{\n\t\t\tflow_t cap = graph[v][to];\n\t\t\tif (graph[v][to] - graph[to][v] > 0 && !used[to])\n\t\t\t{\n\t\t\t\tflow_t f = dfs2(to, target, min(flow, cap));\n\t\t\t\tif (f > 0)\n\t\t\t\t{\n\t\t\t\t\tgraph[v][to] -= f;\n\t\t\t\t\tgraph[to][v] += f;\n\t\t\t\t\treturn f;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n\tflow_t limit_flow(int s, int t, int limit)\n\t{\n\t\tflow_t flow = 0;\n\t\twhile (true)\n\t\t{\n\t\t\tused.assign(siz, false);\n\t\t\tflow_t f = dfs2(s, t, limit);\n\t\t\tflow += f;\n\t\t\tlimit -= f;\n\t\t\t\n\t\t\tif (f == 0) {return flow;}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n};\n\nvoid output(FordFulkerson<int> &g)\n{\n\tint n = g.siz;\n\t\n\tcout << \"cap\" << endl;\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\tcout << g.graph[i][j] << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\tcout << \"flow\" << endl;\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\tint f = (g.graph[j][i]) / 2;\n\t\t\tcout << f << \" \";\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\tcout << endl;\n\t\n\treturn;\n}\n\nvoid calc()\n{\n\tint N, E, Q; cin >> N >> E >> Q;\n\tFordFulkerson<int> g(N);\n\t\n\tfor (int i = 0; i < E; ++i)\n\t{\n\t\tint f, t; cin >> f >> t;\n\t\tf--, t--;\n\t\tg.add_edge(f, t, 1);\n\t\tg.add_edge(t ,f, 1);\n\t}\n\t\n\tint S = 0, T = N-1;\n\tint sum = g.max_flow(S, T);\n\t\n\tfor (int q = 0; q < Q; ++q)\n\t{\n\t\tint m, a, b; cin >> m >> a >> b;\n\t\ta--, b--;\n\t\t\n\t\tif (m == 1)\n\t\t{\n\t\t\t// connect (a, b)\n\t\t\tg.add_edge(a, b, 1);\n\t\t\tg.add_edge(b, a, 1);\n\t\t\tsum += g.max_flow(S, T);\n\t\t}\n\t\telse\n\t\t{\n\t\t\tassert(g.graph[a][b] + g.graph[b][a] > 0);\n\t\t\t// cut (a, b)\n\t\t\tif (g.graph[a][b] == 0)\n\t\t\t{\n\t\t\t\t// S -> a -> b -> T flow exists\n\t\t\t\tint f = g.limit_flow(T, b, 1);\n\t\t\t\tassert(T == b || f == 1);\n\t\t\t\tf = g.limit_flow(a, S, 1);\n\t\t\t\tassert(S == a || f == 1);\n\t\t\t\t\n\t\t\t\tg.graph[b][a] -= 1;\n\t\t\t\tg.graph[a][b] += 1;\n\t\t\t\tsum -= 1;\n\t\t\t}\n\t\t\tif (g.graph[b][a] == 0)\n\t\t\t{\n\t\t\t\t// S -> b -> a -> T flow exists\n\t\t\t\tint f = g.limit_flow(T, a, 1);\n\t\t\t\tassert(T == a || f == 1);\n\t\t\t\tf = g.limit_flow(b, S, 1);\n\t\t\t\tassert(S == b || f == 1);\n\t\t\t\t\n\t\t\t\tg.graph[a][b] -= 1;\n\t\t\t\tg.graph[b][a] += 1;\n\t\t\t\tsum -= 1;\n\t\t\t}\n\t\t\tg.graph[a][b] = g.graph[b][a] = 0;\n\t\t\tsum += g.max_flow(S, T);\n\t\t}\n\t\t\n\t\tcout << sum << endl;\n\t}\n\t\n\t\n\treturn;\n}\n\nint main()\n{\n\tcalc();\n\t\n\treturn 0;\n}","accuracy":0.3275862068965517,"time_ms":110,"memory_kb":4460,"score_of_the_acc":-0.2294,"final_rank":12},{"submission_id":"aoj_2313_8356546","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\nusing ll = long long;\nusing ld = long double;\n\nbool is_end = false;\n\n/*\n目的：max flow を求める\n特徴：max_flow を呼び出したのちに、add_edge が可能\n(max_flow は「前回の状態からどれだけ流せるか」を返すので、flow を流す場所 s, t を変えるとおかしな結果になる)\n*/\ntemplate<class flow_t = long long>\nstruct FordFulkerson\n{\n\t\n\tint siz;\n\tvector<vector<flow_t>> graph;\n\tvector<bool> used;\n\t\n\tFordFulkerson(int n) : siz(n), graph(n, vector<flow_t>(n, 0)), used(siz, false) { }\n\t\n\tvoid add_edge(int from, int to, flow_t cap)\n\t{\n\t\tassert(from < siz && to < siz);\n\t\tgraph[from][to] += cap;\n\t}\n\t\n\tflow_t dfs(int v, int target, flow_t flow)\n\t{\n\t\tif (v == target) {return flow;}\n\t\tused[v] = true;\n\t\t\n\t\tfor (int to = 0; to < siz; ++to)\n\t\t{\n\t\t\tflow_t cap = graph[v][to];\n\t\t\tif (cap > 0 && !used[to])\n\t\t\t{\n\t\t\t\tflow_t f = dfs(to, target, min(flow, cap));\n\t\t\t\tif (f > 0)\n\t\t\t\t{\n\t\t\t\t\tgraph[v][to] -= f;\n\t\t\t\t\tgraph[to][v] += f;\n\t\t\t\t\treturn f;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n\t// max flow on s -> t\n\tflow_t max_flow(int s, int t)\n\t{\n\t\tflow_t flow = 0;\n\t\tflow_t INF = 1e9; // INF の上限値に注意\n\t\twhile (true)\n\t\t{\n\t\t\tused.assign(siz, false);\n\t\t\tflow_t f = dfs(s, t, INF);\n\t\t\tflow += f;\n\t\t\t\n\t\t\tif (f == 0) {return flow;}\n\t\t}\n\t\t// 絶対に到達しないはず\n\t\treturn 0;\n\t}\n\t\n\tflow_t limit_flow(int s, int t, int limit)\n\t{\n\t\tflow_t flow = 0;\n\t\tflow_t INF = 1e9;\n\t\twhile (true)\n\t\t{\n\t\t\tused.assign(siz, false);\n\t\t\tflow_t f = dfs(s, t, limit);\n\t\t\tflow += f;\n\t\t\tlimit -= f;\n\t\t\t\n\t\t\tif (f == 0) {return flow;}\n\t\t}\n\t\treturn 0;\n\t}\n\t\n};\n\nvoid calc()\n{\n\tint N, E, Q; cin >> N >> E >> Q;\n\tFordFulkerson<int> g(N);\n\t\n\tfor (int i = 0; i < E; ++i)\n\t{\n\t\tint f, t; cin >> f >> t;\n\t\tf--, t--;\n\t\tg.add_edge(f, t, 1);\n\t\tg.add_edge(t ,f, 1);\n\t}\n\t\n\tint S = 0, T = N-1;\n\tint sum = g.max_flow(S, T);\n\t\n\tfor (int q = 0; q < Q; ++q)\n\t{\n\t\tint m, a, b; cin >> m >> a >> b;\n\t\ta--, b--;\n\t\t\n\t\tif (m == 1)\n\t\t{\n\t\t\t// connect (a, b)\n\t\t\tg.add_edge(a, b, 1);\n\t\t\tg.add_edge(b, a, 1);\n\t\t\tsum += g.max_flow(S, T);\n\t\t}\n\t\telse\n\t\t{\n\t\t\t// cut (a, b)\n\t\t\tif (g.graph[a][b] == 0)\n\t\t\t{\n\t\t\t\t// S -> a -> b -> T flow exists\n\t\t\t\tint f = g.limit_flow(T, b, 1);\n\t\t\t\tassert(f == 1);\n\t\t\t\tf = g.limit_flow(a, S, 1);\n\t\t\t\tassert(f == 1);\n\t\t\t\t\n\t\t\t\tg.graph[b][a] -= 1;\n\t\t\t\tg.graph[a][b] += 1;\n\t\t\t\tsum -= 1;\n\t\t\t}\n\t\t\tif (g.graph[b][a] == 0)\n\t\t\t{\n\t\t\t\t// S -> b -> a -> T flow exists\n\t\t\t\tint f = g.limit_flow(T, a, 1);\n\t\t\t\tassert(f == 1);\n\t\t\t\tf = g.limit_flow(b, S, 1);\n\t\t\t\tassert(f == 1);\n\t\t\t\t\n\t\t\t\tg.graph[a][b] -= 1;\n\t\t\t\tg.graph[b][a] += 1;\n\t\t\t\tsum -= 1;\n\t\t\t}\n\t\t\tg.graph[a][b] = g.graph[b][a] = 0;\n\t\t\tsum += g.max_flow(S, T);\n\t\t}\n\t\t\n\t\tcout << sum << endl;\n\t}\n\t\n\t\n\treturn;\n}\n\nint main()\n{\n\tcalc();\n\t\n\treturn 0;\n}","accuracy":0.2413793103448276,"time_ms":100,"memory_kb":4352,"score_of_the_acc":-0.2012,"final_rank":15},{"submission_id":"aoj_2313_8018309","code_snippet":"#include <algorithm>\n#include <limits>\n#include <queue>\n#include <vector>\n\nnamespace luz {\n\n class MaxFlowGraph {\n using usize = std::size_t;\n using Cap = long long;\n\n struct Edge {\n usize to, rev;\n Cap cap;\n };\n\n usize n;\n std::vector< Cap > min_cost;\n std::vector< usize > iter;\n std::vector< std::vector< Edge > > g;\n\n bool build_augment_path(usize s, usize t) {\n min_cost.assign(n, -1);\n std::queue< usize > que;\n\n min_cost[s] = 0;\n que.push(s);\n\n while (not que.empty() and min_cost[t] == -1) {\n usize v = que.front();\n que.pop();\n\n for (const auto &e: g[v]) {\n if (e.cap > 0 and min_cost[e.to] == -1) {\n min_cost[e.to] = min_cost[v] + 1;\n que.push(e.to);\n }\n }\n }\n\n return min_cost[t] != -1;\n }\n\n Cap find_augment_path(usize v, usize t, Cap flow_limit) {\n if (v == t) return flow_limit;\n\n for (usize &i = iter[v]; i < g[v].size(); i++) {\n Edge &e = g[v][i];\n\n if (e.cap > 0 and min_cost[v] + 1 == min_cost[e.to]) {\n Cap d = find_augment_path(e.to, t, std::min(flow_limit, e.cap));\n\n if (d > 0) {\n e.cap -= d;\n g[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n\n return 0;\n }\n\n public:\n const Cap INF = std::numeric_limits< Cap >::max();\n\n explicit MaxFlowGraph(usize n): n(n), g(n) {}\n\n usize add_directed_edge(usize from, usize to, Cap cap) {\n // assert(from < n and to < n and from != to);\n usize idx = g[from].size();\n g[from].emplace_back(Edge { to, g[to].size(), cap });\n g[to].emplace_back(Edge { from, idx, 0 });\n return idx;\n }\n\n // 1. O(n^2 m) in general\n // 2. other case: see docs \"dinic-time-complexity.pdf\"\n Cap max_flow(usize s, usize t, Cap flow_limit) {\n // assert(s < n and t < n and s != t);\n Cap flow = 0, add = 0;\n\n while (build_augment_path(s, t) and flow < flow_limit) {\n iter.assign(n, 0);\n\n do {\n add = find_augment_path(s, t, flow_limit - add);\n flow += add;\n } while (add > 0);\n }\n\n return flow;\n }\n\n Cap max_flow(usize s, usize t) {\n return max_flow(s, t, INF);\n }\n\n Cap link(usize s, usize t, usize from, usize idx, Cap f){\n g[from][idx].cap += f;\n return max_flow(s, t, f);\n }\n\n Cap cut(usize s, usize t, usize from, usize idx){\n auto &e = g[from][idx];\n usize to = e.to;\n Cap rem = g[to][e.rev].cap;\n\n if(rem == 0) return e.cap = 0;\n e.cap = g[to][e.rev].cap = 0;\n\n Cap cap = rem - max_flow(from, to, rem);\n if (from != s and cap != 0) max_flow(from, s, cap);\n if (t != to and cap != 0) max_flow(t, to, cap);\n return -cap;\n }\n\n };\n\n} // namespace luz\n\n#include <iostream>\n#include <map>\n\nint main() {\n using usize = std::size_t;\n\n usize n, e, q;\n std::cin >> n >> e >> q;\n \n luz::MaxFlowGraph g(n);\n std::vector< std::map< usize, usize > > eidxs(n);\n while (e--) {\n usize u, v;\n std::cin >> u >> v;\n u--; v--;\n eidxs[u][v] = g.add_directed_edge(u, v, 1);\n eidxs[v][u] = g.add_directed_edge(v, u, 1);\n }\n\n std::vector< usize > qs(q), us(q), vs(q);\n for (usize i = 0; i < q; i++) {\n usize u, v;\n std::cin >> qs[i] >> u >> v;\n u--; v--;\n\n us[i] = u;\n vs[i] = v;\n\n if (eidxs[u].count(v)) continue;\n eidxs[u][v] = g.add_directed_edge(u, v, 0);\n eidxs[v][u] = g.add_directed_edge(v, u, 0);\n }\n\n usize s = 0, t = n - 1;\n int flow = g.max_flow(s, t);\n for (usize i = 0; i < q; i++) {\n usize u = us[i], v = vs[i];\n \n if (qs[i] == 1) {\n flow += g.link(s, t, u, eidxs[u][v], 1);\n flow += g.link(s, t, v, eidxs[v][u], 1);\n }\n \n if (qs[i] == 2) {\n flow += g.cut(s, t, u, eidxs[u][v]);\n flow += g.cut(s, t, v, eidxs[v][u]);\n }\n\n std::cout << flow << std::endl;\n }\n}","accuracy":1,"time_ms":720,"memory_kb":8320,"score_of_the_acc":-1.3698,"final_rank":10},{"submission_id":"aoj_2313_7740916","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n//#pragma GCC optimize(\"Ofast\")\n\n#define rep(i,n) for(ll i=0;i<n;i++)\n#define repl(i,l,r) for(ll i=(l);i<(r);i++)\n#define per(i,n) for(ll i=(n)-1;i>=0;i--)\n#define perl(i,r,l) for(ll i=r-1;i>=l;i--)\n#define fi first\n#define se second\n#define pb push_back\n#define ins insert\n#define pqueue(x) priority_queue<x,vector<x>,greater<x>>\n#define all(x) (x).begin(),(x).end()\n#define CST(x) cout<<fixed<<setprecision(x)\n#define vtpl(x,y,z) vector<tuple<x,y,z>>\n#define rev(x) reverse(x);\nusing ll=long long;\nusing vl=vector<ll>;\nusing vvl=vector<vector<ll>>;\nusing pl=pair<ll,ll>;\nusing vpl=vector<pl>;\nusing vvpl=vector<vpl>;\nconst ll MOD=1000000007;\nconst ll MOD9=998244353;\nconst int inf=1e9+10;\nconst ll INF=4e18;\nconst ll dy[9]={1,0,-1,0,1,1,-1,-1,0};\nconst ll dx[9]={0,1,0,-1,1,-1,1,-1,0};\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\nstruct fordfulkerson{\n ll n;\n vector<vector<ll>> g;\n vector<bool> used;\n fordfulkerson(ll _n):n(_n){\n g.resize(n,vector<ll>(n));used.resize(n);\n }\n ll dfs(ll v,ll t,ll f){\n if(v==t)return f;\n used[v]=true;\n for(ll i=0;i<used.size();i++){\n if(!used[i]&&g[v][i]){\n ll d=dfs(i,t,min(f,g[v][i]));\n if(d>0){\n g[v][i]-=d;g[i][v]+=d;\n return d;\n }\n }\n }\n return 0;\n }\n ll max_flow(ll s,ll t,ll limit=INF){\n ll ans=0;\n while(1){\n used.assign(n,false);\n int f=dfs(s,t,limit);\n ans+=f;\n limit-=f;\n if(f==0||limit==0)return ans;\n }\n\n }\n};\nint main(){\n ll n;cin >> n;\n fordfulkerson f(n);\n ll m;cin >> m;\n ll q;cin >> q;\n rep(_,m){\n ll a,b;cin >>a >> b;a--;b--;\n f.g[a][b]=1;f.g[b][a]=1;\n }\n ll ans=f.max_flow(0,n-1);\n rep(_,q){\n ll t,a,b;cin >> t >> a >> b;a--;b--;\n if(t==1){\n f.g[a][b]=1;f.g[b][a]=1;\n }\n else{\n if(f.g[a][b]==0){\n int d=f.max_flow(a,b,1);\n if(d==0){\n f.max_flow(n-1,0,1);\n f.max_flow(a,b,1);\n ans--;\n }\n }\n else if(f.g[b][a]==0){\n int d=f.max_flow(b,a,1);\n if(d==0){\n f.max_flow(n-1,0,1);\n f.max_flow(b,a,1);\n ans--;\n }\n }\n f.g[a][b]=0;f.g[b][a]=0;\n }\n ans+=f.max_flow(0,n-1);\n cout << ans << endl;\n /*rep(i,n){\n rep(j,n)cout << f.g[i][j] <<\" \";cout << endl;\n }*/\n }\n}","accuracy":1,"time_ms":660,"memory_kb":5452,"score_of_the_acc":-0.7273,"final_rank":7},{"submission_id":"aoj_2313_7119714","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\n//constexpr long long int MOD = 1000000007;\nconstexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-8;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nstruct Flow {\n\tvector<vector<pair<int, int>>>edge;\n\tint ans = 0;\n\tFlow(int sz) {\n\t\tedge.resize(sz);\n\t}\n\tbool Go(int from, int to) {\n\t\tvector<int>bef(edge.size(), -1);\n\t\tqueue<int>Q;\n\t\tQ.push(from);\n\t\twhile (!Q.empty()) {\n\t\t\tint cn = Q.front();\n\t\t\tQ.pop();\n\t\t\tfor (auto i : edge[cn]) {\n\t\t\t\tif (bef[i.first] == -1 && i.second == 1) {\n\t\t\t\t\tbef[i.first] = cn;\n\t\t\t\t\tQ.push(i.first);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (bef[to] == -1)return false;\n\t\tint p = to;\n\t\twhile (p != from) {\n\t\t\tint nx = 1;\n\t\t\tfor (int i = 0; i < edge[p].size(); i++) {\n\t\t\t\tif (edge[p][i].first == bef[p]) {\n\t\t\t\t\tnx ^= edge[p][i].second;\n\t\t\t\t\tedge[p][i].second = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < edge[bef[p]].size(); i++) {\n\t\t\t\tif (edge[bef[p]][i].first == p) {\n\t\t\t\t\tedge[bef[p]][i].second =nx;\n\t\t\t\t}\n\t\t\t}\n\t\t\tp = bef[p];\n\t\t}\n\t\treturn true;\n\t}\n\tvoid DelGo(int from,int to) {\n\t\tif (from == to)return;\n\t\tvector<int>bef(edge.size(), -1);\n\t\tqueue<int>Q;\n\t\tQ.push(from);\n\t\twhile (!Q.empty()) {\n\t\t\tint cn = Q.front();\n\t\t\tQ.pop();\n\t\t\tfor (auto i : edge[cn]) {\n\t\t\t\tif (bef[i.first] == -1 && i.second == 1) {\n\t\t\t\t\tfor (int j = 0; j < edge[i.first].size(); j++) {\n\t\t\t\t\t\tif (edge[i.first][j].first == cn && edge[i.first][j].second == 0) {\n\t\t\t\t\t\t\tbef[i.first] = cn;\n\t\t\t\t\t\t\tQ.push(i.first);\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 p = to;\n\t\twhile (p != from) {\n\t\t\tfor (int i = 0; i < edge[p].size(); i++) {\n\t\t\t\tif (edge[p][i].first == bef[p]) {\n\t\t\t\t\tedge[p][i].second = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < edge[bef[p]].size(); i++) {\n\t\t\t\tif (edge[bef[p]][i].first == p) {\n\t\t\t\t\tedge[bef[p]][i].second = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tp = bef[p];\n\t\t}\n\t}\n\tint AddEdge(int u, int v) {\n\t\tedge[u].push_back({ v,1 });\n\t\tedge[v].push_back({ u,1 });\n\t\tif (Go(0, edge.size() - 1))ans++;\n\t\treturn ans;\n\t}\n\tvoid Init(vector<int>u, vector<int>v) {\n\t\tfor (int i = 0; i < u.size(); i++) {\n\t\t\tedge[u[i]].push_back({ v[i],1 });\n\t\t\tedge[v[i]].push_back({ u[i],1 });\n\t\t}\n\t\twhile (Go(0, edge.size() - 1)) {\n\t\t\tans++;\n\t\t}\n\t}\n\tint DeleteEdge(int u, int v) {\n\t\t{\n\t\t\tfor (int i = 0; i < edge[u].size(); i++) {\n\t\t\t\tif (edge[u][i].first == v && edge[u][i].second == 0) {\n\t\t\t\t\tans--;\n\t\t\t\t\tDelGo(edge.size() - 1, v);\n\t\t\t\t\tDelGo(v, u);\n\t\t\t\t\tDelGo(u, 0);\n\t\t\t\t\tfor (int j = 0; j < edge[u].size(); j++) {\n\t\t\t\t\t\tif (edge[u][j].first == v) {\n\t\t\t\t\t\t\tswap(edge[u][j], edge[u].back());\n\t\t\t\t\t\t\tedge[u].pop_back();\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\tfor (int j = 0; j < edge[v].size(); j++) {\n\t\t\t\t\t\tif (edge[v][j].first == u) {\n\t\t\t\t\t\t\tswap(edge[v][j], edge[v].back());\n\t\t\t\t\t\t\tedge[v].pop_back();\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}\n\t\t\t}\n\t\t}\n\t\t{\n\t\t\tfor (int i = 0; i < edge[v].size(); i++) {\n\t\t\t\tif (edge[v][i].first == u && edge[v][i].second == 0) {\n\t\t\t\t\tans--;\n\t\t\t\t\tDelGo(edge.size() - 1, u);\n\t\t\t\t\tDelGo(u, v);\n\t\t\t\t\tDelGo(v, 0);\n\t\t\t\t\tfor (int j = 0; j < edge[u].size(); j++) {\n\t\t\t\t\t\tif (edge[u][j].first == v) {\n\t\t\t\t\t\t\tswap(edge[u][j], edge[u].back());\n\t\t\t\t\t\t\tedge[u].pop_back();\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\tfor (int j = 0; j < edge[v].size(); j++) {\n\t\t\t\t\t\tif (edge[v][j].first == u) {\n\t\t\t\t\t\t\tswap(edge[v][j], edge[v].back());\n\t\t\t\t\t\t\tedge[v].pop_back();\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}\n\t\t\t}\n\t\t}\n\t\tfor (int j = 0; j < edge[u].size(); j++) {\n\t\t\tif (edge[u][j].first == v) {\n\t\t\t\tswap(edge[u][j], edge[u].back());\n\t\t\t\tedge[u].pop_back();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tfor (int j = 0; j < edge[v].size(); j++) {\n\t\t\tif (edge[v][j].first == u) {\n\t\t\t\tswap(edge[v][j], edge[v].back());\n\t\t\t\tedge[v].pop_back();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t//\tcout << \"##################\" << endl;\n\t//\tDEBUG();\n\t//\tcout << \"----------------\" << endl;\n\t\tif (Go(0, edge.size() - 1))ans++;\n\t\treturn ans;\n\t}\n\tvoid DEBUG() {\n\t\tfor (int i = 0; i < edge.size(); i++) {\n\t\t\tfor (auto j : edge[i]) {\n\t\t\t\tcout << i << \" \" << j.first << \" \" << j.second << endl;\n\t\t\t}\n\t\t}\n\t}\n};\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tcin >> N >> M >> K;\n\tvector<int>u;\n\tvector<int>v;\n\tfor (int i = 0; i < M; i++) {\n\t\tcin >> L >> R;\n\t\tL--, R--;\n\t\tu.push_back(L);\n\t\tv.push_back(R);\n\t}\n\tFlow f(N);\n\tf.Init(u, v);\n\twhile (K--) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c;\n\t\tb--, c--;\n\t\tif (a == 1) {\n\t\t\tcout << f.AddEdge(b, c) << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << f.DeleteEdge(b, c) << endl;\n\t\t}\n\t//\tf.DEBUG();\n\t}\n}","accuracy":1,"time_ms":760,"memory_kb":4168,"score_of_the_acc":-0.5057,"final_rank":4},{"submission_id":"aoj_2313_7106160","code_snippet":"#define MOD_TYPE 2\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#if 1\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\n\n#if 0\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tag_and_trait.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\n#include <ext/rope>\nusing namespace __gnu_pbds;\nusing namespace __gnu_cxx;\ntemplate <typename T>\nusing extset =\n tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\n#endif\n\n#if 0\n#include <boost/multiprecision/cpp_dec_float.hpp>\n#include <boost/multiprecision/cpp_int.hpp>\nusing Int = boost::multiprecision::cpp_int;\nusing lld = boost::multiprecision::cpp_dec_float_100;\n#endif\n\n#pragma region Macros\n\nusing ll = long long int;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pld = pair<ld, ld>;\ntemplate <typename T>\nusing smaller_queue = priority_queue<T, vector<T>, greater<T>>;\n\nconstexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);\nconstexpr int INF = (int)1e9 + 10;\nconstexpr ll LINF = (ll)4e18;\nconst double PI = acos(-1.0);\nconstexpr double EPS = 1e-11;\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\n\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\n#define rep(i, n) REP(i, 0, n)\n#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)\n#define repi(i, n) REPI(i, 0, n)\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << \"\\n\"\n#define Yes(n) cout << ((n) ? \"Yes\" : \"No\") << \"\\n\"\n#define all(v) v.begin(), v.end()\n#define NP(v) next_permutation(all(v))\n#define dbg(x) cerr << #x << \":\" << x << \"\\n\";\n#define UNIQUE(v) v.erase(unique(all(v)), v.end())\n\nstruct io_init {\n io_init() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << setprecision(30) << setiosflags(ios::fixed);\n };\n} io_init;\ntemplate <typename T>\ninline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\ninline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ninline ll floor(ll a, ll b) {\n if (b < 0) a *= -1, b *= -1;\n if (a >= 0) return a / b;\n return -((-a + b - 1) / b);\n}\ninline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }\ntemplate <typename A, size_t N, typename T>\ninline void Fill(A (&array)[N], const T &val) {\n fill((T *)array, (T *)(array + N), val);\n}\ntemplate <typename T>\nvector<T> compress(vector<T> &v) {\n vector<T> val = v;\n sort(all(val)), val.erase(unique(all(val)), val.end());\n for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();\n return val;\n}\ntemplate <typename T, typename U>\nconstexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {\n is >> p.first >> p.second;\n return is;\n}\ntemplate <typename T, typename U>\nconstexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <typename T>\nconstexpr istream &operator>>(istream &is, vector<T> &v) noexcept {\n for (int i = 0; i < v.size(); i++) is >> v[i];\n return is;\n}\ntemplate <typename T>\nconstexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {\n for (int i = 0; i < v.size(); i++)\n os << v[i] << (i + 1 == v.size() ? \"\" : \" \");\n return os;\n}\ntemplate <typename T>\nconstexpr void operator--(vector<T> &v, int) noexcept {\n for (int i = 0; i < v.size(); i++) v[i]--;\n}\n\nrandom_device seed_gen;\nmt19937_64 engine(seed_gen());\n\n#pragma endregion\n\n// --------------------------------------\n\nconst int MAX_V = 500;\nset<int> G[MAX_V];\n\nvector<vector<int>> paths;\nset<pii> used_edge;\nmap<pii, int> mp;\n\nbool used[MAX_V];\nbool dfs(int u, int sink, vector<int> &path) {\n if (u == sink) {\n path.push_back(u);\n return true;\n }\n used[u] = true;\n for (auto v : G[u]) {\n if (used[v]) continue;\n bool f = dfs(v, sink, path);\n if (f) {\n path.push_back(u);\n // 残余グラフを押し戻す場合は双方向に張り直す\n if (used_edge.count({u, v})) {\n G[v].insert(u);\n used_edge.erase({u, v});\n used_edge.erase({v, u});\n } else {\n G[u].erase(v);\n G[v].insert(u);\n used_edge.insert({u, v});\n used_edge.insert({v, u});\n }\n return true;\n }\n }\n return false;\n}\n\nint n;\nint ans = 0;\n\nvoid calc() {\n while (1) {\n fill(used, used + MAX_V, false);\n vector<int> path;\n bool f = dfs(0, n - 1, path);\n if (not f) return;\n reverse(all(path));\n rep(i, path.size() - 1) { mp[{path[i], path[i + 1]}] = paths.size(); }\n paths.push_back(path);\n ans++;\n }\n}\n\nvoid add(int u, int v) {\n assert(not G[u].count(v));\n assert(not G[v].count(u));\n assert(not used_edge.count({u, v}));\n assert(not used_edge.count({v, u}));\n G[u].insert(v);\n G[v].insert(u);\n calc();\n}\n\nvoid del(int u, int v) {\n if (used_edge.count({u, v})) { // 流した\n int pi;\n if (G[u].count(v)) // 残余グラフに u->v がある ＝ v->u で使った\n pi = mp[{v, u}];\n else\n pi = mp[{u, v}];\n rep(i, paths[pi].size() - 1) {\n int u = paths[pi][i];\n int v = paths[pi][i + 1];\n G[u].insert(v);\n used_edge.erase({u, v});\n used_edge.erase({v, u});\n }\n ans--;\n }\n G[u].erase(v);\n G[v].erase(u);\n calc();\n}\n\nvoid solve() {\n int m, q;\n cin >> n >> m >> q;\n rep(i, m) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n G[u].insert(v);\n G[v].insert(u);\n }\n calc();\n rep(i, q) {\n int m, u, v;\n cin >> m >> u >> v;\n u--, v--;\n if (m == 1)\n add(u, v);\n else\n del(u, v);\n cout << ans << \"\\n\";\n }\n}\n\nint main() { solve(); }","accuracy":0.2413793103448276,"time_ms":30,"memory_kb":3700,"score_of_the_acc":-0.0258,"final_rank":14}],"string":"[\n {\n \"submission_id\": \"aoj_2313_9805512\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nstruct MaxFlow {\\n struct Edge {\\n int to, rev;\\n ll cap;\\n };\\n int V;\\n vector<vector<Edge>> G;\\n vector<int> itr, level;\\n using P = pair<int, int>;\\n vector<P> es;\\n\\n public:\\n MaxFlow() {}\\n MaxFlow(int V) : V(V) {\\n G.assign(V, vector<Edge>());\\n }\\n int add_vertex() {\\n G.push_back(vector<Edge>());\\n return V++;\\n }\\n int add_edge(int from, int to, ll cap) {\\n int fid = SZ(G[from]), tid = SZ(G[to]);\\n if (from == to)\\n tid++;\\n es.push_back({from, fid});\\n G[from].push_back({to, tid, cap});\\n G[to].push_back({from, fid, 0});\\n return es.size()-1;\\n }\\n struct Type {\\n int from, to;\\n ll cap, recap;\\n };\\n Type get_edge(int i) {\\n auto [from, pos] = es[i];\\n auto e = G[from][pos];\\n auto re = G[e.to][e.rev];\\n return Type{from, e.to, e.cap, re.cap};\\n }\\n void bfs(int s) {\\n level.assign(V, -1);\\n queue<int> q;\\n level[s] = 0;\\n q.push(s);\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto &e : G[v]) {\\n if (e.cap > 0 && level[e.to] < 0) {\\n level[e.to] = level[v] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n ll dfs(int v, int t, ll f) {\\n if (v == t)\\n return f;\\n for (int &i = itr[v]; i < (int)G[v].size(); i++) {\\n Edge &e = G[v][i];\\n if (e.cap > 0 && level[v] < level[e.to]) {\\n ll d = dfs(e.to, t, min(f, e.cap));\\n if (d > 0) {\\n e.cap -= d, G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n ll run(int s, int t, ll flow_limit = INF) {\\n ll ret = 0, f;\\n while (ret < flow_limit && (bfs(s), level[t] >= 0)) {\\n itr.assign(V, 0);\\n while ((f = dfs(s, t, flow_limit - ret)) > 0)\\n ret += f;\\n }\\n return ret;\\n }\\n vector<int> cut() {\\n vector<int> ret(V);\\n rep(v, 0, V) if (level[v] < 0) ret[v] = 1;\\n return ret;\\n }\\n void erase_edge(int i) {\\n auto& e = G[es[i].first][es[i].second];\\n auto& re = G[e.to][e.rev];\\n e.cap = re.cap = 0;\\n }\\n};\\n\\n/**\\n * @brief Maximum Flow\\n */\\n\\nint main() {\\n int N, M, Q;\\n cin >> N >> M >> Q;\\n MaxFlow G(N);\\n map<pair<int,int>,int> mp;\\n rep(i,0,M) {\\n int A, B;\\n cin >> A >> B;\\n A--, B--;\\n mp[{A,B}] = G.add_edge(A,B,1);\\n mp[{B,A}] = G.add_edge(B,A,1);\\n }\\n int ANS = G.run(0,N-1);\\n rep(i,0,Q) {\\n int T, A, B;\\n cin >> T >> A >> B;\\n A--, B--;\\n if (T == 1) {\\n mp[{A,B}] = G.add_edge(A,B,1);\\n mp[{B,A}] = G.add_edge(B,A,1);\\n ANS += G.run(0,N-1);\\n }\\n else {\\n int id1 = mp[{A,B}], id2 = mp[{B,A}];\\n if (G.get_edge(id1).cap == 0 && G.get_edge(id2).cap == 1) {\\n G.erase_edge(id1);\\n G.erase_edge(id2);\\n if (G.run(A,B,1) == 0) {\\n ANS--;\\n G.run(A,0,1);\\n G.run(N-1,B,1);\\n }\\n }\\n else if (G.get_edge(id2).cap == 0 && G.get_edge(id1).cap == 1) {\\n G.erase_edge(id1);\\n G.erase_edge(id2);\\n if (G.run(B,A,1) == 0) {\\n ANS--;\\n G.run(B,0,1);\\n G.run(N-1,A,1);\\n }\\n }\\n else {\\n G.erase_edge(id1);\\n G.erase_edge(id2);\\n }\\n }\\n cout << ANS << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 7500,\n \"score_of_the_acc\": -1.1846,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2313_9805493\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nstruct MaxFlow {\\n struct Edge {\\n int to, rev;\\n ll cap;\\n };\\n int V;\\n vector<vector<Edge>> G;\\n vector<int> itr, level;\\n using P = pair<int, int>;\\n vector<P> es;\\n\\n public:\\n MaxFlow() {}\\n MaxFlow(int V) : V(V) {\\n G.assign(V, vector<Edge>());\\n }\\n int add_vertex() {\\n G.push_back(vector<Edge>());\\n return V++;\\n }\\n int add_edge(int from, int to, ll cap) {\\n int fid = SZ(G[from]), tid = SZ(G[to]);\\n if (from == to)\\n tid++;\\n es.push_back({from, fid});\\n G[from].push_back({to, tid, cap});\\n G[to].push_back({from, fid, 0});\\n return es.size()-1;\\n }\\n struct Type {\\n int from, to;\\n ll cap, recap;\\n };\\n Type get_edge(int i) {\\n auto [from, pos] = es[i];\\n auto e = G[from][pos];\\n auto re = G[e.to][e.rev];\\n return Type{from, e.to, e.cap, re.cap};\\n }\\n void bfs(int s) {\\n level.assign(V, -1);\\n queue<int> q;\\n level[s] = 0;\\n q.push(s);\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto &e : G[v]) {\\n if (e.cap > 0 && level[e.to] < 0) {\\n level[e.to] = level[v] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n ll dfs(int v, int t, ll f) {\\n if (v == t)\\n return f;\\n for (int &i = itr[v]; i < (int)G[v].size(); i++) {\\n Edge &e = G[v][i];\\n if (e.cap > 0 && level[v] < level[e.to]) {\\n ll d = dfs(e.to, t, min(f, e.cap));\\n if (d > 0) {\\n e.cap -= d, G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n ll run(int s, int t, ll flow_limit = INF) {\\n ll ret = 0, f;\\n while (ret < flow_limit && (bfs(s), level[t] >= 0)) {\\n itr.assign(V, 0);\\n while ((f = dfs(s, t, flow_limit - ret)) > 0)\\n ret += f;\\n }\\n return ret;\\n }\\n vector<int> cut() {\\n vector<int> ret(V);\\n rep(v, 0, V) if (level[v] < 0) ret[v] = 1;\\n return ret;\\n }\\n void erase_edge(int i) {\\n auto& e = G[es[i].first][es[i].second];\\n auto& re = G[e.to][e.rev];\\n e.cap = re.cap = 0;\\n }\\n};\\n\\n/**\\n * @brief Maximum Flow\\n */\\n\\nint main() {\\n int N, M, Q;\\n cin >> N >> M >> Q;\\n MaxFlow G(N);\\n map<pair<int,int>,int> mp;\\n rep(i,0,M) {\\n int A, B;\\n cin >> A >> B;\\n A--, B--;\\n mp[{A,B}] = G.add_edge(A,B,1);\\n mp[{B,A}] = G.add_edge(B,A,1);\\n }\\n int ANS = G.run(0,N-1);\\n rep(i,0,Q) {\\n int T, A, B;\\n cin >> T >> A >> B;\\n A--, B--;\\n if (T == 1) {\\n mp[{A,B}] = G.add_edge(A,B,1);\\n mp[{B,A}] = G.add_edge(B,A,1);\\n ANS += G.run(0,N-1);\\n }\\n else {\\n int id1 = mp[{A,B}], id2 = mp[{B,A}];\\n if (G.get_edge(id1).cap == 0 && G.get_edge(id2).cap == 1) {\\n G.erase_edge(id1);\\n G.erase_edge(id2);\\n if (G.run(A,B) == 0) {\\n ANS--;\\n G.run(A,0,1);\\n G.run(N-1,B,1);\\n }\\n }\\n else if (G.get_edge(id2).cap == 0 && G.get_edge(id1).cap == 1) {\\n G.erase_edge(id1);\\n G.erase_edge(id2);\\n if (G.run(B,A) == 0) {\\n ANS--;\\n G.run(B,0,1);\\n G.run(N-1,A,1);\\n }\\n }\\n else {\\n G.erase_edge(id1);\\n G.erase_edge(id2);\\n }\\n }\\n cout << ANS << endl;\\n }\\n}\",\n \"accuracy\": 0.2413793103448276,\n \"time_ms\": 10,\n \"memory_kb\": 3628,\n \"score_of_the_acc\": 0,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2313_9376324\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\n\\nstruct Dinic {\\npublic:\\n const long long inf = 1e18;\\n vector<int> dist; //sからの距離\\n vector<int> iter; //どこまで調べたか\\n\\n struct edge {\\n int to, rev; long long cap;\\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n\\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\\n int su = (int)to[u].size(), sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap });\\n to[v].push_back({ u, su, cap });\\n }\\n\\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\\n long long nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n queue<int> q;\\n q.push(s);\\n dist[s] = 0;\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto nv : to[v]) {\\n if (nv.cap > 0 && dist[nv.to] < 0) {\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n }\\n\\n long long maxflow(int s, int t, int f) {//s:始点, t:終点\\n long long res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n\\n iter.assign(n, 0);\\n while (flow = dfs(s, t, f)) {\\n res += flow;\\n f -= flow;\\n }\\n if (f == 0) return res;\\n };\\n return res;\\n }\\n};\\n\\n\\nint main()\\n{\\n std::cin.tie(nullptr);\\n std::ios_base::sync_with_stdio(false);\\n int n, e, q;\\n cin >> n >> e >> q;\\n\\n Dinic dn(n);\\n vii<pair<int, int>> vec(n, vi<pair<int, int>>(n, { -1, -1 }));\\n \\n rep(i, e) {\\n int f, t;\\n cin >> f >> t;\\n f--, t--;\\n if (f > t) swap(f, t);\\n dn.addedge(f, t, 1);\\n vec[f][t] = { dn.to[t].back().rev, dn.to[f].back().rev };\\n }\\n\\n vi<int> ans;\\n int flow = dn.maxflow(0, n - 1, n);\\n rep(i, q) {\\n int m, a, b;\\n cin >> m >> a >> b;\\n a--, b--;\\n if (a > b) swap(a, b);\\n if (m == 1) {\\n if (vec[a][b].first == -1 ) {\\n dn.addedge(a, b, 1);\\n vec[a][b] = {dn.to[b].back().rev, dn.to[a].back().rev};\\n }\\n else {\\n dn.to[a][vec[a][b].first].cap = 1;\\n dn.to[b][vec[a][b].second].cap = 1;\\n }\\n flow += dn.maxflow(0, n - 1, n);\\n }\\n else {\\n if (dn.to[a][vec[a][b].first].cap == 0) {\\n int tf = dn.maxflow(a, b, 1);\\n if (tf == 0) {\\n dn.maxflow(n - 1, b, 1);\\n dn.maxflow(a, 0, 1);\\n flow--;\\n }\\n }\\n else if (dn.to[b][vec[a][b].second].cap == 0) {\\n int tf = dn.maxflow(b, a, 1);\\n if (tf == 0) {\\n dn.maxflow(n - 1, a, 1);\\n dn.maxflow(b, 0, 1);\\n flow--;\\n }\\n }\\n \\n dn.to[a][vec[a][b].first].cap = 0;\\n dn.to[b][vec[a][b].second].cap = 0;\\n }\\n\\n ans.push_back(flow);\\n }\\n\\n for (auto elem : ans) cout << elem << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 6308,\n \"score_of_the_acc\": -0.7066,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2313_9376314\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\n\\nstruct Dinic {\\npublic:\\n const long long inf = 1e18;\\n vector<int> dist; //sからの距離\\n vector<int> iter; //どこまで調べたか\\n\\n struct edge {\\n int to, rev; long long cap;\\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n\\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\\n int su = (int)to[u].size(), sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap });\\n to[v].push_back({ u, su, cap });\\n }\\n\\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\\n long long nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n queue<int> q;\\n q.push(s);\\n dist[s] = 0;\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto nv : to[v]) {\\n if (nv.cap > 0 && dist[nv.to] < 0) {\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n }\\n\\n long long maxflow(int s, int t, int f) {//s:始点, t:終点\\n long long res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n\\n iter.assign(n, 0);\\n while (flow = dfs(s, t, f)) {\\n res += flow;\\n f -= flow;\\n }\\n if (f == 0) return res;\\n };\\n return res;\\n }\\n};\\n\\n\\nint main()\\n{\\n std::cin.tie(nullptr);\\n std::ios_base::sync_with_stdio(false);\\n int n, e, q;\\n cin >> n >> e >> q;\\n\\n Dinic dn(n);\\n map<pair<int, int>, pair<int, int>> mp;\\n rep(i, e) {\\n int f, t;\\n cin >> f >> t;\\n f--, t--;\\n if (f > t) swap(f, t);\\n dn.addedge(f, t, 1);\\n mp[{f, t}] = { dn.to[t].back().rev, dn.to[f].back().rev };\\n }\\n\\n vi<int> ans;\\n int flow = dn.maxflow(0, n - 1, n);\\n rep(i, q) {\\n int m, a, b;\\n cin >> m >> a >> b;\\n a--, b--;\\n if (a > b) swap(a, b);\\n if (m == 1) {\\n if (!mp.count({ a, b })) {\\n dn.addedge(a, b, 1);\\n mp[{a, b}] = { dn.to[b].back().rev, dn.to[a].back().rev };\\n }\\n else {\\n dn.to[a][mp[{a, b}].first].cap = 1;\\n dn.to[b][mp[{a, b}].second].cap = 1;\\n }\\n flow += dn.maxflow(0, n - 1, n);\\n }\\n else {\\n if (dn.to[a][mp[{a, b}].first].cap == 0) {\\n int tf = dn.maxflow(a, b, 1);\\n if (tf == 0) {\\n dn.maxflow(n - 1, b, 1);\\n dn.maxflow(a, 0, 1);\\n flow--;\\n }\\n }\\n else if (dn.to[b][mp[{a, b}].second].cap == 0) {\\n int tf = dn.maxflow(b, a, 1);\\n if (tf == 0) {\\n dn.maxflow(n - 1, a, 1);\\n dn.maxflow(b, 0, 1);\\n flow--;\\n }\\n }\\n \\n dn.to[a][mp[{a, b}].first].cap = 0;\\n dn.to[b][mp[{a, b}].second].cap = 0; \\n }\\n\\n ans.push_back(flow);\\n }\\n\\n for (auto elem : ans) cout << elem << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 5576,\n \"score_of_the_acc\": -0.5506,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2313_9375839\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\n\\nstruct Dinic {\\nprivate:\\n long long inf = 1e18;\\n vector<int> dist; //sからの距離\\n vector<int> iter; //どこまで調べたか\\npublic:\\n struct edge {\\n int to, rev; long long cap;\\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n\\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\\n int su = (int)to[u].size(), sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap });\\n to[v].push_back({ u, su, cap });\\n }\\n\\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\\n long long nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n queue<int> q;\\n q.push(s);\\n dist[s] = 0;\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto nv : to[v]) {\\n if (nv.cap > 0 && dist[nv.to] < 0) {\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n }\\n\\n long long maxflow(int s, int t) {//s:始点, t:終点\\n long long res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n\\n iter.assign(n, 0);\\n while (flow = dfs(s, t, inf)) res += flow;\\n };\\n return res;\\n }\\n};\\n\\n\\nint main()\\n{\\n std::cin.tie(nullptr);\\n std::ios_base::sync_with_stdio(false);\\n int n, e, q;\\n cin >> n >> e >> q;\\n\\n set<pair<int, int>> st;\\n rep(i, e) {\\n int f, t;\\n cin >> f >> t;\\n f--, t--;\\n if (f > t) swap(f, t);\\n st.insert({ f, t });\\n }\\n\\n vi<int> ans;\\n Dinic dn(n);\\n for (auto elem : st) dn.addedge(elem.first, elem.second, 1);\\n int flow = dn.maxflow(0, n - 1);\\n rep(i, q) {\\n int m, a, b;\\n cin >> m >> a >> b;\\n a--, b--;\\n if (a > b) swap(a, b);\\n if (m == 1) {\\n st.insert({ a, b });\\n dn.addedge(a, b, 1);\\n flow += dn.maxflow(0, n - 1);\\n }\\n else {\\n st.erase({ a, b });\\n Dinic nxt(n);\\n swap(dn, nxt);\\n for (auto elem : st) dn.addedge(elem.first, elem.second, 1);\\n flow = dn.maxflow(0, n - 1);\\n }\\n\\n ans.push_back(flow);\\n }\\n\\n for (auto elem : ans) cout << elem << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1930,\n \"memory_kb\": 6168,\n \"score_of_the_acc\": -1.5413,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2313_9223435\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nstruct Flow {\\n int n;\\n int cur_flow;\\n std::vector<std::vector<bool>> ord, rev, exist;\\n std::vector<bool> used;\\n Flow(int n): n(n), cur_flow(0), ord(n, std::vector<bool>(n)), rev(n, std::vector<bool>(n)), exist(n, std::vector<bool>(n)), used(n) {}\\n void add_edge(int u, int v) {\\n assert(!exist[u][v]);\\n assert(!exist[v][u]);\\n exist[u][v] = exist[v][u] = true;\\n ord[u][v] = ord[v][u] = true;\\n rev[u][v] = rev[v][u] = false;\\n }\\n\\n // {n - 1} -> u -> v -> 1\\n void get_path(int u, int v) {\\n assert(rev[u][v]);\\n rev[u][v] = false;\\n ord[v][u] = true;\\n auto dfs = [&](auto self, int u, int sink) -> bool {\\n if (u == sink) return true;\\n used[u] = true;\\n for (int v = 0; v < n; v++) {\\n if (exist[u][v] && rev[u][v] && !used[v]) {\\n if (self(self, v, sink)) {\\n rev[u][v] = false;\\n ord[v][u] = true;\\n return true;\\n }\\n }\\n }\\n return false;\\n };\\n used.assign(n, false);\\n dfs(dfs, n - 1, u);\\n used.assign(n, false);\\n dfs(dfs, v, 0);\\n }\\n\\n void delete_edge(int u, int v) {\\n assert(exist[u][v]);\\n assert(exist[v][u]);\\n if ((ord[u][v] && ord[v][u]) || (rev[u][v] && rev[v][u])) {\\n exist[u][v] = exist[v][u] = false;\\n ord[u][v] = ord[v][u] = false;\\n rev[u][v] = rev[v][u] = false;\\n return;\\n }\\n // {n - 1} -> 0;\\n (rev[u][v] ? get_path(u, v) : get_path(v, u));\\n exist[u][v] = exist[v][u] = false;\\n ord[u][v] = ord[v][u] = false;\\n cur_flow--;\\n }\\n int flow() {\\n int res = 0;\\n while (true) {\\n used.assign(n, false);\\n int delta = dfs(0);\\n if (delta == 0) break;\\n res += delta;\\n }\\n return cur_flow += res;\\n }\\n int dfs(int u) {\\n if (u == n - 1) return 1;\\n used[u] = true;\\n for (int v = 0; v < n; v++) {\\n if (used[v]) continue;\\n if (!exist[u][v]) continue;\\n if (ord[u][v] || rev[u][v]) {\\n if (dfs(v)) {\\n if (ord[u][v]) {\\n ord[u][v] = false;\\n rev[v][u] = true;\\n } else {\\n rev[u][v] = false;\\n ord[v][u] = true;\\n }\\n return 1;\\n }\\n }\\n }\\n return 0;\\n }\\n};\\n\\nint main() {\\n int n, m, q;\\n std::cin >> n >> m >> q;\\n Flow flow(n);\\n for (int i = 0; i < m; i++) {\\n int u, v;\\n std::cin >> u >> v;\\n u--; v--;\\n flow.add_edge(u, v);\\n }\\n while (q--) {\\n int m, u, v;\\n std::cin >> m >> u >> v;\\n u--; v--;\\n if (m == 1) {\\n flow.add_edge(u, v);\\n } else {\\n flow.delete_edge(u, v);\\n }\\n std::cout << flow.flow() << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 3632,\n \"score_of_the_acc\": -0.204,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2313_8738830\",\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\\nstruct E {\\n bool f{}, r{};\\n E() = default;\\n E(bool f, bool r) : f{f}, r{r} {}\\n void flow() {\\n f ^= 1;\\n r ^= 1;\\n }\\n friend std::ostream& operator<<(std::ostream& os, const E& e) {\\n if (!e.f and !e.r) os << 0;\\n else if (e.f) os << 1;\\n else os << 2;\\n return os;\\n }\\n};\\n\\nconst int N{510};\\nE g[N][N];\\n\\nint n, m, q;\\n\\nint through(int u, int v) {\\n if (g[v][u].r) return 2;\\n else if (g[u][v].f) return 1;\\n else return 0;\\n}\\n\\nbool dfsflow(int v, int t, std::vector<bool>& vis) {\\n vis[v] = true;\\n if (v == t) return true;\\n for (int i{} ; i < n ; i++) if (!vis[i]) {\\n int e{through(v, i)};\\n if (e == 0) continue;\\n if (!dfsflow(i, t, vis)) continue;\\n if (e == 1) g[v][i].flow();\\n else g[i][v].flow();\\n return true;\\n }\\n return false;\\n}\\n\\nbool dfselim(int v, int t, std::vector<bool>& vis) {\\n vis[v] = true;\\n if (v == t) return true;\\n for (int i{} ; i < n ; i++) if (!vis[i]) {\\n int e{through(v, i)};\\n // std::cout << '(' << v << ',' << i << ')' << \\\" is \\\" << e << std::endl;\\n if (e != 2) continue;\\n if (!dfselim(i, t, vis)) continue;\\n g[i][v].flow();\\n return true;\\n }\\n return false;\\n}\\n\\nbool flow(int s, int t) {\\n std::vector<bool> vis(n);\\n return dfsflow(s, t, vis);\\n}\\n\\nbool elim(int s, int t) {\\n // std::cerr << \\\"eliminate \\\" << s << ' ' << t << std::endl;\\n std::vector<bool> vis(n);\\n return dfselim(s, t, vis);\\n}\\n\\nint main() {\\n SetFastIO();\\n\\n std::cin >> n >> m >> q;\\n for (int i{} ; i < n ; i++) for (int j{} ; j < n ; j++) g[i][j] = E{};\\n for (int _{} ; _ < m ; _++) {\\n int f, t; std::cin >> f >> t;\\n f--; t--;\\n g[f][t].f = true;\\n g[t][f].f = true;\\n }\\n\\n int ans{};\\n while (flow(0, n - 1)) ans++;\\n\\n for (int _{} ; _ < q ; _++) {\\n int t, a, b; std::cin >> t >> a >> b;\\n // std::cout << t << ' ' << a << ' ' << b << std::endl;\\n a--; b--;\\n if (t == 1) {\\n assert(!g[a][b].f and !g[b][a].f);\\n assert(!g[a][b].r and !g[b][a].r);\\n g[a][b].f = true;\\n g[b][a].f = true;\\n ans += flow(0, n - 1);\\n }\\n else if (t == 2) {\\n if (g[a][b].f and g[b][a].f) {\\n // std::cerr << \\\"type \\\" << 1 << std::endl;\\n ;\\n }\\n else if (g[a][b].r and g[b][a].r) {\\n // std::cerr << \\\"type \\\" << 2 << std::endl;\\n g[a][b].flow();\\n g[b][a].flow();\\n }\\n else if (g[a][b].r) {\\n if (!flow(a, b)) {\\n assert(elim(n - 1, b));\\n g[a][b].flow();\\n assert(elim(a, 0));\\n ans--;\\n }\\n else {\\n g[a][b].flow();\\n }\\n }\\n else if (g[b][a].r) {\\n // std::cerr << \\\"type \\\" << 4 << std::endl;\\n if (!flow(b, a)) {\\n assert(elim(n - 1, a));\\n g[b][a].flow();\\n assert(elim(b, 0));\\n ans--;\\n }\\n else {\\n g[b][a].flow();\\n }\\n }\\n else {\\n assert(!\\\"aaa\\\");\\n }\\n assert(g[a][b].f and g[b][a].f);\\n assert(!g[a][b].r and !g[a][b].r);\\n g[a][b].f = g[b][a].f = false;\\n }\\n else {\\n assert(false);\\n }\\n std::cout << ans << std::endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 3916,\n \"score_of_the_acc\": -0.2333,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2313_8738734\",\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\\nstruct E {\\n bool exist;\\n bool f, revf;\\n E() : exist{false}, f{false}, revf{false} {}\\n void on() {\\n assert(!exist);\\n exist = f = true;\\n }\\n void off() {\\n assert(exist);\\n exist = f = revf = false;\\n }\\n void flip() {\\n f ^= 1;\\n revf ^= 1;\\n }\\n bool flowed() const {\\n return exist and !f;\\n }\\n};\\n\\nenum state {\\n uv,\\n vu,\\n cannot, \\n};\\n\\nint main() {\\n SetFastIO();\\n\\n int n, m, q; std::cin >> n >> m >> q;\\n std::vector g(n, std::vector<E>(n));\\n \\n for (int _{} ; _ < m ; _++) {\\n int a, b; std::cin >> a >> b;\\n a--; b--;\\n g[a][b].on();\\n g[b][a].on();\\n }\\n\\n auto can{[&](int u, int v) -> state {\\n if (g[v][u].exist and g[v][u].revf) return vu;\\n else if (g[u][v].exist and g[u][v].f) return uv;\\n else return cannot;\\n }};\\n\\n auto flow{[&](int s, int t) -> bool {\\n std::vector<bool> vis(n); \\n auto dfs{[&](auto dfs, int v) -> bool {\\n vis[v] = true;\\n if (v == t) return true;\\n for (int x{} ; x < n ; x++) if (!vis[x]) {\\n auto e{can(v, x)}; \\n if (e == cannot) continue;\\n if (dfs(dfs, x)) {\\n if (e == uv) g[v][x].flip();\\n else if (e == vu) g[x][v].flip();\\n return true;\\n }\\n }\\n return false;\\n }};\\n return dfs(dfs, s);\\n }};\\n\\n int ans{};\\n while (flow(0, n - 1)) ans++;\\n\\n for (int _{} ; _ < q ; _++) {\\n int t, a, b; std::cin >> t >> a >> b;\\n a--; b--;\\n if (t == 1) {\\n g[a][b].on();\\n g[b][a].on();\\n ans += flow(0, n - 1);\\n }\\n else if (t == 2) {\\n assert(g[a][b].exist and g[b][a].exist);\\n if (!g[a][b].flowed() and !g[b][a].flowed()) {\\n ;\\n }\\n else if (g[a][b].flowed() and g[b][a].flowed()) {\\n ;\\n }\\n else if (g[a][b].flowed()) {\\n if (!flow(a, b)) {\\n ans--;\\n flow(n - 1, b);\\n g[a][b].flip();\\n flow(a, 0);\\n }\\n } \\n else if (g[b][a].flowed()) {\\n if (!flow(b, a)) {\\n ans--;\\n flow(n - 1, a);\\n g[b][a].flip();\\n flow(b, 0);\\n }\\n }\\n else {\\n assert(false);\\n }\\n g[a][b].off();\\n g[b][a].off();\\n }\\n else {\\n assert(false);\\n }\\n std::cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 0.15517241379310345,\n \"time_ms\": 210,\n \"memory_kb\": 3700,\n \"score_of_the_acc\": -0.1195,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2313_8738729\",\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\\nstruct E {\\n bool exist;\\n bool f, revf;\\n E() : exist{false}, f{false}, revf{false} {}\\n void on() {\\n assert(!exist);\\n exist = f = true;\\n }\\n void off() {\\n assert(exist);\\n exist = f = revf = false;\\n }\\n void flip() {\\n f ^= 1;\\n revf ^= 1;\\n }\\n bool flowed() const {\\n return exist and !f;\\n }\\n};\\n\\nenum state {\\n uv,\\n vu,\\n cannot, \\n};\\n\\nint main() {\\n SetFastIO();\\n\\n int n, m, q; std::cin >> n >> m >> q;\\n std::vector g(n, std::vector<E>(n));\\n \\n for (int _{} ; _ < m ; _++) {\\n int a, b; std::cin >> a >> b;\\n a--; b--;\\n g[a][b].on();\\n g[b][a].on();\\n }\\n\\n auto can{[&](int u, int v) -> state {\\n if (g[v][u].exist and g[v][u].revf) return vu;\\n else if (g[u][v].exist and g[u][v].f) return uv;\\n else return cannot;\\n }};\\n\\n auto flow{[&](int s, int t) -> bool {\\n std::vector<bool> vis(n); \\n auto dfs{[&](auto dfs, int v) -> bool {\\n vis[v] = true;\\n if (v == t) return true;\\n for (int x{} ; x < n ; x++) if (!vis[x]) {\\n auto e{can(v, x)}; \\n if (e == cannot) continue;\\n if (dfs(dfs, x)) {\\n if (e == uv) g[v][x].flip();\\n else if (e == vu) g[x][v].flip();\\n return true;\\n }\\n }\\n return false;\\n }};\\n return dfs(dfs, s);\\n }};\\n\\n int ans{};\\n while (flow(0, n - 1)) ans++;\\n\\n for (int _{} ; _ < q ; _++) {\\n int t, a, b; std::cin >> t >> a >> b;\\n a--; b--;\\n if (t == 1) {\\n g[a][b].on();\\n g[b][a].on();\\n ans += flow(0, n - 1);\\n }\\n else if (t == 2) {\\n assert(g[a][b].exist and g[b][a].exist);\\n if (!g[a][b].flowed() and !g[b][a].flowed()) {\\n ;\\n }\\n else if (g[a][b].flowed() and g[b][a].flowed()) {\\n ;\\n }\\n else if (g[a][b].flowed()) {\\n if (!flow(a, b)) {\\n ans--;\\n assert(flow(n - 1, b));\\n assert(g[a][b].flowed());\\n g[a][b].flip();\\n assert(flow(a, 0));\\n }\\n } \\n else if (g[b][a].flowed()) {\\n if (!flow(b, a)) {\\n ans--;\\n assert(flow(n - 1, a));\\n assert(g[b][a].flowed());\\n g[b][a].flip();\\n assert(flow(b, 0));\\n }\\n }\\n else {\\n assert(false);\\n }\\n g[a][b].off();\\n g[b][a].off();\\n }\\n else {\\n assert(false);\\n }\\n std::cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 0.15517241379310345,\n \"time_ms\": 210,\n \"memory_kb\": 3760,\n \"score_of_the_acc\": -0.1323,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2313_8738718\",\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\\nstruct E {\\n bool exist;\\n bool f, revf;\\n E() : exist{false}, f{false}, revf{false} {}\\n void on() {\\n assert(!exist);\\n exist = f = true;\\n }\\n void off() {\\n assert(exist);\\n exist = f = revf = false;\\n }\\n void flip() {\\n f ^= 1;\\n revf ^= 1;\\n }\\n bool flowed() const {\\n return exist and !f;\\n }\\n};\\n\\nenum state {\\n uv,\\n vu,\\n cannot, \\n};\\n\\nint main() {\\n SetFastIO();\\n\\n int n, m, q; std::cin >> n >> m >> q;\\n std::vector g(n, std::vector<E>(n));\\n \\n for (int _{} ; _ < m ; _++) {\\n int a, b; std::cin >> a >> b;\\n a--; b--;\\n g[a][b].on();\\n g[b][a].on();\\n }\\n\\n auto can{[&](int u, int v) -> state {\\n if (g[v][u].exist and g[v][u].revf) return vu;\\n else if (g[u][v].exist and g[u][v].f) return uv;\\n else return cannot;\\n }};\\n\\n auto flow{[&](int s, int t) -> bool {\\n std::vector<bool> vis(n); \\n auto dfs{[&](auto dfs, int v) -> bool {\\n vis[v] = true;\\n if (v == t) return true;\\n for (int x{} ; x < n ; x++) if (!vis[x]) {\\n auto e{can(v, x)}; \\n if (e == cannot) continue;\\n if (dfs(dfs, x)) {\\n if (e == uv) g[v][x].flip();\\n else if (e == vu) g[x][v].flip();\\n return true;\\n }\\n }\\n return false;\\n }};\\n return dfs(dfs, s);\\n }};\\n\\n int ans{};\\n while (flow(0, n - 1)) ans++;\\n\\n for (int _{} ; _ < q ; _++) {\\n int t, a, b; std::cin >> t >> a >> b;\\n a--; b--;\\n if (t == 1) {\\n g[a][b].on();\\n g[b][a].on();\\n ans += flow(0, n - 1);\\n }\\n else if (t == 2) {\\n assert(g[a][b].exist and g[b][a].exist);\\n if (!g[a][b].flowed() and !g[b][a].flowed()) {\\n ;\\n }\\n else if (g[a][b].flowed() and g[b][a].flowed()) {\\n ;\\n }\\n else if (g[a][b].flowed()) {\\n if (!flow(a, b)) {\\n ans--;\\n assert(flow(n - 1, b));\\n g[a][b].flip();\\n assert(flow(a, 0));\\n }\\n } \\n else if (g[b][a].flowed()) {\\n if (!flow(b, a)) {\\n ans--;\\n assert(flow(n - 1, a));\\n g[b][a].flip();\\n assert(flow(b, 0));\\n }\\n }\\n else {\\n assert(false);\\n }\\n g[a][b].off();\\n g[b][a].off();\\n }\\n else {\\n assert(false);\\n }\\n std::cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 0.15517241379310345,\n \"time_ms\": 200,\n \"memory_kb\": 3704,\n \"score_of_the_acc\": -0.1152,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2313_8738712\",\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\\nstruct E {\\n bool exist;\\n bool f, revf;\\n E() : exist{false}, f{false}, revf{false} {}\\n void on() {\\n assert(!exist);\\n exist = f = true;\\n }\\n void off() {\\n assert(exist);\\n exist = f = revf = false;\\n }\\n void flip() {\\n f ^= 1;\\n revf ^= 1;\\n }\\n bool flowed() const {\\n return exist and !f;\\n }\\n};\\n\\nenum state {\\n uv,\\n vu,\\n cannot, \\n};\\n\\nint main() {\\n SetFastIO();\\n\\n int n, m, q; std::cin >> n >> m >> q;\\n std::vector g(n, std::vector<E>(n));\\n \\n for (int _{} ; _ < m ; _++) {\\n int a, b; std::cin >> a >> b;\\n a--; b--;\\n g[a][b].on();\\n g[b][a].on();\\n }\\n\\n auto can{[&](int u, int v) -> state {\\n if (g[u][v].exist and g[u][v].f) return uv;\\n else if (g[v][u].exist and g[v][u].revf) return vu;\\n else return cannot;\\n }};\\n\\n auto flow{[&](int s, int t) -> bool {\\n std::vector<bool> vis(n); \\n auto dfs{[&](auto dfs, int v) -> bool {\\n vis[v] = true;\\n if (v == t) return true;\\n for (int x{} ; x < n ; x++) if (!vis[x]) {\\n auto e{can(v, x)}; \\n if (e == cannot) continue;\\n if (dfs(dfs, x)) {\\n if (e == uv) g[v][x].flip();\\n else if (e == vu) g[x][v].flip();\\n return true;\\n }\\n }\\n return false;\\n }};\\n return dfs(dfs, s);\\n }};\\n\\n int ans{};\\n while (flow(0, n - 1)) ans++;\\n\\n for (int _{} ; _ < q ; _++) {\\n int t, a, b; std::cin >> t >> a >> b;\\n a--; b--;\\n if (t == 1) {\\n g[a][b].on();\\n g[b][a].on();\\n ans += flow(0, n - 1);\\n }\\n else if (t == 2) {\\n assert(g[a][b].exist and g[b][a].exist);\\n if (!g[a][b].flowed() and !g[b][a].flowed()) {\\n ;\\n }\\n else if (g[a][b].flowed() and g[b][a].flowed()) {\\n ;\\n }\\n else if (g[a][b].flowed()) {\\n if (!flow(a, b)) {\\n ans--;\\n assert(flow(n - 1, b));\\n g[a][b].flip();\\n assert(flow(a, 0));\\n }\\n } \\n else if (g[b][a].flowed()) {\\n if (!flow(b, a)) {\\n ans--;\\n assert(flow(n - 1, a));\\n g[b][a].flip();\\n assert(flow(b, 0));\\n }\\n }\\n else {\\n assert(false);\\n }\\n g[a][b].off();\\n g[b][a].off();\\n }\\n else {\\n assert(false);\\n }\\n std::cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 0.15517241379310345,\n \"time_ms\": 240,\n \"memory_kb\": 3740,\n \"score_of_the_acc\": -0.1437,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2313_8738223\",\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\\nstruct E {\\n bool exist;\\n bool f, revf;\\n E() : exist{false}, f{false}, revf{false} {}\\n void on() {\\n assert(!exist);\\n exist = f = true;\\n }\\n void off() {\\n assert(exist);\\n exist = f = revf = false;\\n }\\n void flip() {\\n f ^= 1;\\n revf ^= 1;\\n }\\n bool flowed() const {\\n return exist and !f;\\n }\\n};\\n\\nenum state {\\n uv,\\n vu,\\n cannot, \\n};\\n\\nint main() {\\n SetFastIO();\\n\\n int n, m, q; std::cin >> n >> m >> q;\\n std::vector g(n, std::vector<E>(n));\\n \\n for (int _{} ; _ < m ; _++) {\\n int a, b; std::cin >> a >> b;\\n a--; b--;\\n g[a][b].on();\\n g[b][a].on();\\n }\\n\\n auto can{[&](int u, int v) -> state {\\n if (g[u][v].exist and g[u][v].f) return uv;\\n else if (g[v][u].exist and g[v][u].revf) return vu;\\n else return cannot;\\n }};\\n\\n auto flow{[&](int s, int t) -> bool {\\n std::vector<bool> vis(n); \\n auto dfs{[&](auto dfs, int v) -> bool {\\n vis[v] = true;\\n if (v == t) return true;\\n for (int x{} ; x < n ; x++) if (!vis[x]) {\\n auto e{can(v, x)}; \\n if (e == cannot) continue;\\n if (dfs(dfs, x)) {\\n if (e == uv) g[v][x].flip();\\n else if (e == vu) g[x][v].flip();\\n return true;\\n }\\n }\\n return false;\\n }};\\n return dfs(dfs, s);\\n }};\\n\\n int ans{};\\n while (flow(0, n - 1)) ans++;\\n\\n for (int _{} ; _ < q ; _++) {\\n int t, a, b; std::cin >> t >> a >> b;\\n a--; b--;\\n if (t == 1) {\\n g[a][b].on();\\n g[b][a].on();\\n ans += flow(0, n - 1);\\n }\\n else if (t == 2) {\\n assert(g[a][b].exist and g[b][a].exist);\\n if (!(g[a][b].flowed() ^ g[b][a].flowed())) {\\n ;\\n }\\n else if (g[a][b].flowed()) {\\n if (!flow(a, b)) {\\n ans--;\\n assert(flow(n - 1, b));\\n g[a][b].flip();\\n assert(flow(a, 0));\\n }\\n } \\n else if (g[b][a].flowed()) {\\n if (!flow(b, a)) {\\n ans--;\\n assert(flow(n - 1, a));\\n g[b][a].flip();\\n assert(flow(b, 0));\\n }\\n }\\n else {\\n assert(false);\\n }\\n g[a][b].off();\\n g[b][a].off();\\n }\\n else {\\n assert(false);\\n }\\n std::cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 0.15517241379310345,\n \"time_ms\": 240,\n \"memory_kb\": 3704,\n \"score_of_the_acc\": -0.136,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2313_8363602\",\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\\nusing ll = long long;\\nusing ld = long double;\\n\\nbool is_end = false;\\n\\n/*\\n目的：max flow を求める\\n特徴：max_flow を呼び出したのちに、add_edge が可能\\n(max_flow は「前回の状態からどれだけ流せるか」を返すので、flow を流す場所 s, t を変えるとおかしな結果になる)\\n*/\\ntemplate<class flow_t = long long>\\nstruct FordFulkerson\\n{\\n\\t\\n\\tint siz;\\n\\tvector<vector<flow_t>> graph;\\n\\tvector<bool> used;\\n\\t\\n\\tFordFulkerson(int n) : siz(n), graph(n, vector<flow_t>(n, 0)), used(siz, false) { }\\n\\t\\n\\tvoid add_edge(int from, int to, flow_t cap)\\n\\t{\\n\\t\\tassert(from < siz && to < siz);\\n\\t\\tgraph[from][to] += cap;\\n\\t}\\n\\t\\n\\tflow_t dfs(int v, int target, flow_t flow)\\n\\t{\\n\\t\\tif (v == target) {return flow;}\\n\\t\\tused[v] = true;\\n\\t\\t\\n\\t\\tfor (int to = 0; to < siz; ++to)\\n\\t\\t{\\n\\t\\t\\tflow_t cap = graph[v][to];\\n\\t\\t\\tif (cap > 0 && !used[to])\\n\\t\\t\\t{\\n\\t\\t\\t\\tflow_t f = dfs(to, target, min(flow, cap));\\n\\t\\t\\t\\tif (f > 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tgraph[v][to] -= f;\\n\\t\\t\\t\\t\\tgraph[to][v] += f;\\n\\t\\t\\t\\t\\treturn f;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\t// max flow on s -> t\\n\\tflow_t max_flow(int s, int t)\\n\\t{\\n\\t\\tflow_t flow = 0;\\n\\t\\tflow_t INF = 1e9; // INF の上限値に注意\\n\\t\\twhile (true)\\n\\t\\t{\\n\\t\\t\\tused.assign(siz, false);\\n\\t\\t\\tflow_t f = dfs(s, t, INF);\\n\\t\\t\\tflow += f;\\n\\t\\t\\t\\n\\t\\t\\tif (f == 0) {return flow;}\\n\\t\\t}\\n\\t\\t// 絶対に到達しないはず\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tflow_t dfs2(int v, int target, flow_t flow)\\n\\t{\\n\\t\\tif (v == target) {return flow;}\\n\\t\\tused[v] = true;\\n\\t\\t\\n\\t\\tfor (int to = 0; to < siz; ++to)\\n\\t\\t{\\n\\t\\t\\tflow_t cap = graph[v][to];\\n\\t\\t\\tif (graph[v][to] - graph[to][v] > 0 && !used[to])\\n\\t\\t\\t{\\n\\t\\t\\t\\tflow_t f = dfs2(to, target, min(flow, cap));\\n\\t\\t\\t\\tif (f > 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tgraph[v][to] -= f;\\n\\t\\t\\t\\t\\tgraph[to][v] += f;\\n\\t\\t\\t\\t\\treturn f;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tflow_t limit_flow(int s, int t, int limit)\\n\\t{\\n\\t\\tflow_t flow = 0;\\n\\t\\twhile (true)\\n\\t\\t{\\n\\t\\t\\tused.assign(siz, false);\\n\\t\\t\\tflow_t f = dfs(s, t, limit);\\n\\t\\t\\tflow += f;\\n\\t\\t\\tlimit -= f;\\n\\t\\t\\t\\n\\t\\t\\tif (f == 0) {return flow;}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tvoid loosen(int s, int t)\\n\\t{\\n\\t\\tused.assign(siz, false);\\n\\t\\t\\n\\t\\tvector<vector<bool>> isneed(siz, vector<bool>(siz, false));\\n\\t\\tqueue<int> que;\\n\\t\\tque.emplace(s);\\n\\t\\tused[s] = true;\\n\\t\\t\\n\\t\\twhile (!que.empty())\\n\\t\\t{\\n\\t\\t\\tint v = que.front();\\n\\t\\t\\tque.pop();\\n\\t\\t\\t\\n\\t\\t\\tfor (int nv = 0; nv < siz; ++nv)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (graph[v][nv] < graph[nv][v])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tisneed[v][nv] = isneed[nv][v] = true;\\n\\t\\t\\t\\t\\tif (used[nv]) {continue;}\\n\\t\\t\\t\\t\\tused[nv] = true;\\n\\t\\t\\t\\t\\tque.emplace(nv);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor (int i = 0; i < siz; ++i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = i; j < siz; ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (isneed[i][j]) continue;\\n\\t\\t\\t\\tint mid = (graph[i][j] + graph[j][i]) / 2;\\n\\t\\t\\t\\tgraph[i][j] = graph[j][i] = mid;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn;\\n\\t}\\n\\t\\n};\\n\\nvoid output(FordFulkerson<int> &g)\\n{\\n\\tint n = g.siz;\\n\\t\\n\\tcout << \\\"cap\\\" << endl;\\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\\tcout << g.graph[i][j] << \\\" \\\";\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\t\\n\\tcout << \\\"flow\\\" << endl;\\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\\tint f = (g.graph[j][i]) / 2;\\n\\t\\t\\tcout << f << \\\" \\\";\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\t\\n\\tcout << endl;\\n\\t\\n\\treturn;\\n}\\n\\nvoid calc()\\n{\\n\\tint N, E, Q; cin >> N >> E >> Q;\\n\\tFordFulkerson<int> g(N);\\n\\t\\n\\tfor (int i = 0; i < E; ++i)\\n\\t{\\n\\t\\tint f, t; cin >> f >> t;\\n\\t\\tf--, t--;\\n\\t\\tg.add_edge(f, t, 1);\\n\\t\\tg.add_edge(t ,f, 1);\\n\\t}\\n\\t\\n\\tint S = 0, T = N-1;\\n\\tint sum = g.max_flow(S, T);\\n\\t\\n\\tfor (int q = 0; q < Q; ++q)\\n\\t{\\n\\t\\tint m, a, b; cin >> m >> a >> b;\\n\\t\\ta--, b--;\\n\\t\\t\\n\\t\\tif (m == 1)\\n\\t\\t{\\n\\t\\t\\t// connect (a, b)\\n\\t\\t\\tg.add_edge(a, b, 1);\\n\\t\\t\\tg.add_edge(b, a, 1);\\n\\t\\t\\tsum += g.max_flow(S, T);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tassert(g.graph[a][b] + g.graph[b][a] > 0);\\n\\t\\t\\t// cut (a, b)\\n\\t\\t\\tif (g.graph[a][b] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// S -> a -> b -> T flow exists\\n\\t\\t\\t\\tg.graph[a][b] = g.graph[b][a] = 0;\\n\\t\\t\\t\\tint f = g.limit_flow(a, b, 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (f == 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tsum -= 1;\\n\\t\\t\\t\\t\\tf = g.limit_flow(T, b, 1);\\n\\t\\t\\t\\t\\tassert(T == b || f == 1);\\n\\t\\t\\t\\t\\tf = g.limit_flow(a, S, 1);\\n\\t\\t\\t\\t\\tassert(S == a || f == 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if (g.graph[b][a] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// S -> b -> a -> T flow exists\\n\\t\\t\\t\\tg.graph[a][b] = g.graph[b][a] = 0;\\n\\t\\t\\t\\tint f = g.limit_flow(b, a, 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tif (f == 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tsum -= 1;\\n\\t\\t\\t\\t\\tf = g.limit_flow(T, a, 1);\\n\\t\\t\\t\\t\\tassert(T == a || f == 1);\\n\\t\\t\\t\\t\\tf = g.limit_flow(b, S, 1);\\n\\t\\t\\t\\t\\tassert(S == b || f == 1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tg.graph[a][b] = g.graph[b][a] = 0;\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t}\\n\\t\\t\\n\\t\\tcout << sum << endl;\\n\\t\\t// g.loosen(S, T);\\n\\t\\t\\n\\t\\t// cout << m << \\\" \\\" << a << \\\" \\\" << b << endl;\\n\\t\\t// output(g);\\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\": 1,\n \"time_ms\": 600,\n \"memory_kb\": 4456,\n \"score_of_the_acc\": -0.4838,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2313_8363551\",\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\\nusing ll = long long;\\nusing ld = long double;\\n\\nbool is_end = false;\\n\\n/*\\n目的：max flow を求める\\n特徴：max_flow を呼び出したのちに、add_edge が可能\\n(max_flow は「前回の状態からどれだけ流せるか」を返すので、flow を流す場所 s, t を変えるとおかしな結果になる)\\n*/\\ntemplate<class flow_t = long long>\\nstruct FordFulkerson\\n{\\n\\t\\n\\tint siz;\\n\\tvector<vector<flow_t>> graph;\\n\\tvector<bool> used;\\n\\t\\n\\tFordFulkerson(int n) : siz(n), graph(n, vector<flow_t>(n, 0)), used(siz, false) { }\\n\\t\\n\\tvoid add_edge(int from, int to, flow_t cap)\\n\\t{\\n\\t\\tassert(from < siz && to < siz);\\n\\t\\tgraph[from][to] += cap;\\n\\t}\\n\\t\\n\\tflow_t dfs(int v, int target, flow_t flow)\\n\\t{\\n\\t\\tif (v == target) {return flow;}\\n\\t\\tused[v] = true;\\n\\t\\t\\n\\t\\tfor (int to = 0; to < siz; ++to)\\n\\t\\t{\\n\\t\\t\\tflow_t cap = graph[v][to];\\n\\t\\t\\tif (cap > 0 && !used[to])\\n\\t\\t\\t{\\n\\t\\t\\t\\tflow_t f = dfs(to, target, min(flow, cap));\\n\\t\\t\\t\\tif (f > 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tgraph[v][to] -= f;\\n\\t\\t\\t\\t\\tgraph[to][v] += f;\\n\\t\\t\\t\\t\\treturn f;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\t// max flow on s -> t\\n\\tflow_t max_flow(int s, int t)\\n\\t{\\n\\t\\tflow_t flow = 0;\\n\\t\\tflow_t INF = 1e9; // INF の上限値に注意\\n\\t\\twhile (true)\\n\\t\\t{\\n\\t\\t\\tused.assign(siz, false);\\n\\t\\t\\tflow_t f = dfs(s, t, INF);\\n\\t\\t\\tflow += f;\\n\\t\\t\\t\\n\\t\\t\\tif (f == 0) {return flow;}\\n\\t\\t}\\n\\t\\t// 絶対に到達しないはず\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tflow_t dfs2(int v, int target, flow_t flow)\\n\\t{\\n\\t\\tif (v == target) {return flow;}\\n\\t\\tused[v] = true;\\n\\t\\t\\n\\t\\tfor (int to = 0; to < siz; ++to)\\n\\t\\t{\\n\\t\\t\\tflow_t cap = graph[v][to];\\n\\t\\t\\tif (graph[v][to] - graph[to][v] > 0 && !used[to])\\n\\t\\t\\t{\\n\\t\\t\\t\\tflow_t f = dfs2(to, target, min(flow, cap));\\n\\t\\t\\t\\tif (f > 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tgraph[v][to] -= f;\\n\\t\\t\\t\\t\\tgraph[to][v] += f;\\n\\t\\t\\t\\t\\treturn f;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tflow_t limit_flow(int s, int t, int limit)\\n\\t{\\n\\t\\tflow_t flow = 0;\\n\\t\\twhile (true)\\n\\t\\t{\\n\\t\\t\\tused.assign(siz, false);\\n\\t\\t\\tflow_t f = dfs2(s, t, limit);\\n\\t\\t\\tflow += f;\\n\\t\\t\\tlimit -= f;\\n\\t\\t\\t\\n\\t\\t\\tif (f == 0) {return flow;}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tvoid loosen(int s, int t)\\n\\t{\\n\\t\\tused.assign(siz, false);\\n\\t\\t\\n\\t\\tvector<vector<bool>> isneed(siz, vector<bool>(siz, false));\\n\\t\\tqueue<int> que;\\n\\t\\tque.emplace(s);\\n\\t\\tused[s] = true;\\n\\t\\t\\n\\t\\twhile (!que.empty())\\n\\t\\t{\\n\\t\\t\\tint v = que.front();\\n\\t\\t\\tque.pop();\\n\\t\\t\\t\\n\\t\\t\\tfor (int nv = 0; nv < siz; ++nv)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (graph[v][nv] < graph[nv][v])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tisneed[v][nv] = isneed[nv][v] = true;\\n\\t\\t\\t\\t\\tif (used[nv]) {continue;}\\n\\t\\t\\t\\t\\tused[nv] = true;\\n\\t\\t\\t\\t\\tque.emplace(nv);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\tfor (int i = 0; i < siz; ++i)\\n\\t\\t{\\n\\t\\t\\tfor (int j = i; j < siz; ++j)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (isneed[i][j]) continue;\\n\\t\\t\\t\\tint mid = (graph[i][j] + graph[j][i]) / 2;\\n\\t\\t\\t\\tgraph[i][j] = graph[j][i] = mid;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t\\n\\t\\treturn;\\n\\t}\\n\\t\\n};\\n\\nvoid output(FordFulkerson<int> &g)\\n{\\n\\tint n = g.siz;\\n\\t\\n\\tcout << \\\"cap\\\" << endl;\\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\\tcout << g.graph[i][j] << \\\" \\\";\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\t\\n\\tcout << \\\"flow\\\" << endl;\\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\\tint f = (g.graph[j][i]) / 2;\\n\\t\\t\\tcout << f << \\\" \\\";\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\t\\n\\tcout << endl;\\n\\t\\n\\treturn;\\n}\\n\\nvoid calc()\\n{\\n\\tint N, E, Q; cin >> N >> E >> Q;\\n\\tFordFulkerson<int> g(N);\\n\\t\\n\\tfor (int i = 0; i < E; ++i)\\n\\t{\\n\\t\\tint f, t; cin >> f >> t;\\n\\t\\tf--, t--;\\n\\t\\tg.add_edge(f, t, 1);\\n\\t\\tg.add_edge(t ,f, 1);\\n\\t}\\n\\t\\n\\tint S = 0, T = N-1;\\n\\tint sum = g.max_flow(S, T);\\n\\t\\n\\tfor (int q = 0; q < Q; ++q)\\n\\t{\\n\\t\\tint m, a, b; cin >> m >> a >> b;\\n\\t\\ta--, b--;\\n\\t\\t\\n\\t\\tif (m == 1)\\n\\t\\t{\\n\\t\\t\\t// connect (a, b)\\n\\t\\t\\tg.add_edge(a, b, 1);\\n\\t\\t\\tg.add_edge(b, a, 1);\\n\\t\\t\\tsum += g.max_flow(S, T);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tassert(g.graph[a][b] + g.graph[b][a] > 0);\\n\\t\\t\\t// cut (a, b)\\n\\t\\t\\tif (g.graph[a][b] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// S -> a -> b -> T flow exists\\n\\t\\t\\t\\tint f = g.limit_flow(T, b, 1);\\n\\t\\t\\t\\tassert(T == b || f == 1);\\n\\t\\t\\t\\tf = g.limit_flow(a, S, 1);\\n\\t\\t\\t\\tassert(S == a || f == 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tg.graph[b][a] -= 1;\\n\\t\\t\\t\\tg.graph[a][b] += 1;\\n\\t\\t\\t\\tsum -= 1;\\n\\t\\t\\t}\\n\\t\\t\\tif (g.graph[b][a] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// S -> b -> a -> T flow exists\\n\\t\\t\\t\\tint f = g.limit_flow(T, a, 1);\\n\\t\\t\\t\\tassert(T == a || f == 1);\\n\\t\\t\\t\\tf = g.limit_flow(b, S, 1);\\n\\t\\t\\t\\tassert(S == b || f == 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tg.graph[a][b] -= 1;\\n\\t\\t\\t\\tg.graph[b][a] += 1;\\n\\t\\t\\t\\tsum -= 1;\\n\\t\\t\\t}\\n\\t\\t\\tg.graph[a][b] = g.graph[b][a] = 0;\\n\\t\\t\\tsum += g.max_flow(S, T);\\n\\t\\t}\\n\\t\\t\\n\\t\\tcout << sum << endl;\\n\\t\\tg.loosen(S, T);\\n\\t\\t\\n\\t\\t// cout << m << \\\" \\\" << a << \\\" \\\" << b << endl;\\n\\t\\t// output(g);\\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\": 1,\n \"time_ms\": 1410,\n \"memory_kb\": 4520,\n \"score_of_the_acc\": -0.9193,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2313_8363366\",\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\\nusing ll = long long;\\nusing ld = long double;\\n\\nbool is_end = false;\\n\\n/*\\n目的：max flow を求める\\n特徴：max_flow を呼び出したのちに、add_edge が可能\\n(max_flow は「前回の状態からどれだけ流せるか」を返すので、flow を流す場所 s, t を変えるとおかしな結果になる)\\n*/\\ntemplate<class flow_t = long long>\\nstruct FordFulkerson\\n{\\n\\t\\n\\tint siz;\\n\\tvector<vector<flow_t>> graph;\\n\\tvector<bool> used;\\n\\t\\n\\tFordFulkerson(int n) : siz(n), graph(n, vector<flow_t>(n, 0)), used(siz, false) { }\\n\\t\\n\\tvoid add_edge(int from, int to, flow_t cap)\\n\\t{\\n\\t\\tassert(from < siz && to < siz);\\n\\t\\tgraph[from][to] += cap;\\n\\t}\\n\\t\\n\\tflow_t dfs(int v, int target, flow_t flow)\\n\\t{\\n\\t\\tif (v == target) {return flow;}\\n\\t\\tused[v] = true;\\n\\t\\t\\n\\t\\tfor (int to = 0; to < siz; ++to)\\n\\t\\t{\\n\\t\\t\\tflow_t cap = graph[v][to];\\n\\t\\t\\tif (cap > 0 && !used[to])\\n\\t\\t\\t{\\n\\t\\t\\t\\tflow_t f = dfs(to, target, min(flow, cap));\\n\\t\\t\\t\\tif (f > 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tgraph[v][to] -= f;\\n\\t\\t\\t\\t\\tgraph[to][v] += f;\\n\\t\\t\\t\\t\\treturn f;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\t// max flow on s -> t\\n\\tflow_t max_flow(int s, int t)\\n\\t{\\n\\t\\tflow_t flow = 0;\\n\\t\\tflow_t INF = 1e9; // INF の上限値に注意\\n\\t\\twhile (true)\\n\\t\\t{\\n\\t\\t\\tused.assign(siz, false);\\n\\t\\t\\tflow_t f = dfs(s, t, INF);\\n\\t\\t\\tflow += f;\\n\\t\\t\\t\\n\\t\\t\\tif (f == 0) {return flow;}\\n\\t\\t}\\n\\t\\t// 絶対に到達しないはず\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tflow_t dfs2(int v, int target, flow_t flow)\\n\\t{\\n\\t\\tif (v == target) {return flow;}\\n\\t\\tused[v] = true;\\n\\t\\t\\n\\t\\tfor (int to = 0; to < siz; ++to)\\n\\t\\t{\\n\\t\\t\\tflow_t cap = graph[v][to];\\n\\t\\t\\tif (graph[v][to] - graph[to][v] > 0 && !used[to])\\n\\t\\t\\t{\\n\\t\\t\\t\\tflow_t f = dfs2(to, target, min(flow, cap));\\n\\t\\t\\t\\tif (f > 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tgraph[v][to] -= f;\\n\\t\\t\\t\\t\\tgraph[to][v] += f;\\n\\t\\t\\t\\t\\treturn f;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tflow_t limit_flow(int s, int t, int limit)\\n\\t{\\n\\t\\tflow_t flow = 0;\\n\\t\\twhile (true)\\n\\t\\t{\\n\\t\\t\\tused.assign(siz, false);\\n\\t\\t\\tflow_t f = dfs2(s, t, limit);\\n\\t\\t\\tflow += f;\\n\\t\\t\\tlimit -= f;\\n\\t\\t\\t\\n\\t\\t\\tif (f == 0) {return flow;}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n};\\n\\nvoid output(FordFulkerson<int> &g)\\n{\\n\\tint n = g.siz;\\n\\t\\n\\tcout << \\\"cap\\\" << endl;\\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\\tcout << g.graph[i][j] << \\\" \\\";\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\t\\n\\tcout << \\\"flow\\\" << endl;\\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\\tint f = (g.graph[j][i]) / 2;\\n\\t\\t\\tcout << f << \\\" \\\";\\n\\t\\t}\\n\\t\\tcout << endl;\\n\\t}\\n\\t\\n\\tcout << endl;\\n\\t\\n\\treturn;\\n}\\n\\nvoid calc()\\n{\\n\\tint N, E, Q; cin >> N >> E >> Q;\\n\\tFordFulkerson<int> g(N);\\n\\t\\n\\tfor (int i = 0; i < E; ++i)\\n\\t{\\n\\t\\tint f, t; cin >> f >> t;\\n\\t\\tf--, t--;\\n\\t\\tg.add_edge(f, t, 1);\\n\\t\\tg.add_edge(t ,f, 1);\\n\\t}\\n\\t\\n\\tint S = 0, T = N-1;\\n\\tint sum = g.max_flow(S, T);\\n\\t\\n\\tfor (int q = 0; q < Q; ++q)\\n\\t{\\n\\t\\tint m, a, b; cin >> m >> a >> b;\\n\\t\\ta--, b--;\\n\\t\\t\\n\\t\\tif (m == 1)\\n\\t\\t{\\n\\t\\t\\t// connect (a, b)\\n\\t\\t\\tg.add_edge(a, b, 1);\\n\\t\\t\\tg.add_edge(b, a, 1);\\n\\t\\t\\tsum += g.max_flow(S, T);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tassert(g.graph[a][b] + g.graph[b][a] > 0);\\n\\t\\t\\t// cut (a, b)\\n\\t\\t\\tif (g.graph[a][b] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// S -> a -> b -> T flow exists\\n\\t\\t\\t\\tint f = g.limit_flow(T, b, 1);\\n\\t\\t\\t\\tassert(T == b || f == 1);\\n\\t\\t\\t\\tf = g.limit_flow(a, S, 1);\\n\\t\\t\\t\\tassert(S == a || f == 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tg.graph[b][a] -= 1;\\n\\t\\t\\t\\tg.graph[a][b] += 1;\\n\\t\\t\\t\\tsum -= 1;\\n\\t\\t\\t}\\n\\t\\t\\tif (g.graph[b][a] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// S -> b -> a -> T flow exists\\n\\t\\t\\t\\tint f = g.limit_flow(T, a, 1);\\n\\t\\t\\t\\tassert(T == a || f == 1);\\n\\t\\t\\t\\tf = g.limit_flow(b, S, 1);\\n\\t\\t\\t\\tassert(S == b || f == 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tg.graph[a][b] -= 1;\\n\\t\\t\\t\\tg.graph[b][a] += 1;\\n\\t\\t\\t\\tsum -= 1;\\n\\t\\t\\t}\\n\\t\\t\\tg.graph[a][b] = g.graph[b][a] = 0;\\n\\t\\t\\tsum += g.max_flow(S, T);\\n\\t\\t}\\n\\t\\t\\n\\t\\tcout << sum << endl;\\n\\t}\\n\\t\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\tcalc();\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.3275862068965517,\n \"time_ms\": 110,\n \"memory_kb\": 4460,\n \"score_of_the_acc\": -0.2294,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2313_8356546\",\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\\nusing ll = long long;\\nusing ld = long double;\\n\\nbool is_end = false;\\n\\n/*\\n目的：max flow を求める\\n特徴：max_flow を呼び出したのちに、add_edge が可能\\n(max_flow は「前回の状態からどれだけ流せるか」を返すので、flow を流す場所 s, t を変えるとおかしな結果になる)\\n*/\\ntemplate<class flow_t = long long>\\nstruct FordFulkerson\\n{\\n\\t\\n\\tint siz;\\n\\tvector<vector<flow_t>> graph;\\n\\tvector<bool> used;\\n\\t\\n\\tFordFulkerson(int n) : siz(n), graph(n, vector<flow_t>(n, 0)), used(siz, false) { }\\n\\t\\n\\tvoid add_edge(int from, int to, flow_t cap)\\n\\t{\\n\\t\\tassert(from < siz && to < siz);\\n\\t\\tgraph[from][to] += cap;\\n\\t}\\n\\t\\n\\tflow_t dfs(int v, int target, flow_t flow)\\n\\t{\\n\\t\\tif (v == target) {return flow;}\\n\\t\\tused[v] = true;\\n\\t\\t\\n\\t\\tfor (int to = 0; to < siz; ++to)\\n\\t\\t{\\n\\t\\t\\tflow_t cap = graph[v][to];\\n\\t\\t\\tif (cap > 0 && !used[to])\\n\\t\\t\\t{\\n\\t\\t\\t\\tflow_t f = dfs(to, target, min(flow, cap));\\n\\t\\t\\t\\tif (f > 0)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tgraph[v][to] -= f;\\n\\t\\t\\t\\t\\tgraph[to][v] += f;\\n\\t\\t\\t\\t\\treturn f;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\t// max flow on s -> t\\n\\tflow_t max_flow(int s, int t)\\n\\t{\\n\\t\\tflow_t flow = 0;\\n\\t\\tflow_t INF = 1e9; // INF の上限値に注意\\n\\t\\twhile (true)\\n\\t\\t{\\n\\t\\t\\tused.assign(siz, false);\\n\\t\\t\\tflow_t f = dfs(s, t, INF);\\n\\t\\t\\tflow += f;\\n\\t\\t\\t\\n\\t\\t\\tif (f == 0) {return flow;}\\n\\t\\t}\\n\\t\\t// 絶対に到達しないはず\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tflow_t limit_flow(int s, int t, int limit)\\n\\t{\\n\\t\\tflow_t flow = 0;\\n\\t\\tflow_t INF = 1e9;\\n\\t\\twhile (true)\\n\\t\\t{\\n\\t\\t\\tused.assign(siz, false);\\n\\t\\t\\tflow_t f = dfs(s, t, limit);\\n\\t\\t\\tflow += f;\\n\\t\\t\\tlimit -= f;\\n\\t\\t\\t\\n\\t\\t\\tif (f == 0) {return flow;}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n};\\n\\nvoid calc()\\n{\\n\\tint N, E, Q; cin >> N >> E >> Q;\\n\\tFordFulkerson<int> g(N);\\n\\t\\n\\tfor (int i = 0; i < E; ++i)\\n\\t{\\n\\t\\tint f, t; cin >> f >> t;\\n\\t\\tf--, t--;\\n\\t\\tg.add_edge(f, t, 1);\\n\\t\\tg.add_edge(t ,f, 1);\\n\\t}\\n\\t\\n\\tint S = 0, T = N-1;\\n\\tint sum = g.max_flow(S, T);\\n\\t\\n\\tfor (int q = 0; q < Q; ++q)\\n\\t{\\n\\t\\tint m, a, b; cin >> m >> a >> b;\\n\\t\\ta--, b--;\\n\\t\\t\\n\\t\\tif (m == 1)\\n\\t\\t{\\n\\t\\t\\t// connect (a, b)\\n\\t\\t\\tg.add_edge(a, b, 1);\\n\\t\\t\\tg.add_edge(b, a, 1);\\n\\t\\t\\tsum += g.max_flow(S, T);\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\t// cut (a, b)\\n\\t\\t\\tif (g.graph[a][b] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// S -> a -> b -> T flow exists\\n\\t\\t\\t\\tint f = g.limit_flow(T, b, 1);\\n\\t\\t\\t\\tassert(f == 1);\\n\\t\\t\\t\\tf = g.limit_flow(a, S, 1);\\n\\t\\t\\t\\tassert(f == 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tg.graph[b][a] -= 1;\\n\\t\\t\\t\\tg.graph[a][b] += 1;\\n\\t\\t\\t\\tsum -= 1;\\n\\t\\t\\t}\\n\\t\\t\\tif (g.graph[b][a] == 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\t// S -> b -> a -> T flow exists\\n\\t\\t\\t\\tint f = g.limit_flow(T, a, 1);\\n\\t\\t\\t\\tassert(f == 1);\\n\\t\\t\\t\\tf = g.limit_flow(b, S, 1);\\n\\t\\t\\t\\tassert(f == 1);\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tg.graph[a][b] -= 1;\\n\\t\\t\\t\\tg.graph[b][a] += 1;\\n\\t\\t\\t\\tsum -= 1;\\n\\t\\t\\t}\\n\\t\\t\\tg.graph[a][b] = g.graph[b][a] = 0;\\n\\t\\t\\tsum += g.max_flow(S, T);\\n\\t\\t}\\n\\t\\t\\n\\t\\tcout << sum << endl;\\n\\t}\\n\\t\\n\\t\\n\\treturn;\\n}\\n\\nint main()\\n{\\n\\tcalc();\\n\\t\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.2413793103448276,\n \"time_ms\": 100,\n \"memory_kb\": 4352,\n \"score_of_the_acc\": -0.2012,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2313_8018309\",\n \"code_snippet\": \"#include <algorithm>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\nnamespace luz {\\n\\n class MaxFlowGraph {\\n using usize = std::size_t;\\n using Cap = long long;\\n\\n struct Edge {\\n usize to, rev;\\n Cap cap;\\n };\\n\\n usize n;\\n std::vector< Cap > min_cost;\\n std::vector< usize > iter;\\n std::vector< std::vector< Edge > > g;\\n\\n bool build_augment_path(usize s, usize t) {\\n min_cost.assign(n, -1);\\n std::queue< usize > que;\\n\\n min_cost[s] = 0;\\n que.push(s);\\n\\n while (not que.empty() and min_cost[t] == -1) {\\n usize v = que.front();\\n que.pop();\\n\\n for (const auto &e: g[v]) {\\n if (e.cap > 0 and min_cost[e.to] == -1) {\\n min_cost[e.to] = min_cost[v] + 1;\\n que.push(e.to);\\n }\\n }\\n }\\n\\n return min_cost[t] != -1;\\n }\\n\\n Cap find_augment_path(usize v, usize t, Cap flow_limit) {\\n if (v == t) return flow_limit;\\n\\n for (usize &i = iter[v]; i < g[v].size(); i++) {\\n Edge &e = g[v][i];\\n\\n if (e.cap > 0 and min_cost[v] + 1 == min_cost[e.to]) {\\n Cap d = find_augment_path(e.to, t, std::min(flow_limit, e.cap));\\n\\n if (d > 0) {\\n e.cap -= d;\\n g[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n\\n return 0;\\n }\\n\\n public:\\n const Cap INF = std::numeric_limits< Cap >::max();\\n\\n explicit MaxFlowGraph(usize n): n(n), g(n) {}\\n\\n usize add_directed_edge(usize from, usize to, Cap cap) {\\n // assert(from < n and to < n and from != to);\\n usize idx = g[from].size();\\n g[from].emplace_back(Edge { to, g[to].size(), cap });\\n g[to].emplace_back(Edge { from, idx, 0 });\\n return idx;\\n }\\n\\n // 1. O(n^2 m) in general\\n // 2. other case: see docs \\\"dinic-time-complexity.pdf\\\"\\n Cap max_flow(usize s, usize t, Cap flow_limit) {\\n // assert(s < n and t < n and s != t);\\n Cap flow = 0, add = 0;\\n\\n while (build_augment_path(s, t) and flow < flow_limit) {\\n iter.assign(n, 0);\\n\\n do {\\n add = find_augment_path(s, t, flow_limit - add);\\n flow += add;\\n } while (add > 0);\\n }\\n\\n return flow;\\n }\\n\\n Cap max_flow(usize s, usize t) {\\n return max_flow(s, t, INF);\\n }\\n\\n Cap link(usize s, usize t, usize from, usize idx, Cap f){\\n g[from][idx].cap += f;\\n return max_flow(s, t, f);\\n }\\n\\n Cap cut(usize s, usize t, usize from, usize idx){\\n auto &e = g[from][idx];\\n usize to = e.to;\\n Cap rem = g[to][e.rev].cap;\\n\\n if(rem == 0) return e.cap = 0;\\n e.cap = g[to][e.rev].cap = 0;\\n\\n Cap cap = rem - max_flow(from, to, rem);\\n if (from != s and cap != 0) max_flow(from, s, cap);\\n if (t != to and cap != 0) max_flow(t, to, cap);\\n return -cap;\\n }\\n\\n };\\n\\n} // namespace luz\\n\\n#include <iostream>\\n#include <map>\\n\\nint main() {\\n using usize = std::size_t;\\n\\n usize n, e, q;\\n std::cin >> n >> e >> q;\\n \\n luz::MaxFlowGraph g(n);\\n std::vector< std::map< usize, usize > > eidxs(n);\\n while (e--) {\\n usize u, v;\\n std::cin >> u >> v;\\n u--; v--;\\n eidxs[u][v] = g.add_directed_edge(u, v, 1);\\n eidxs[v][u] = g.add_directed_edge(v, u, 1);\\n }\\n\\n std::vector< usize > qs(q), us(q), vs(q);\\n for (usize i = 0; i < q; i++) {\\n usize u, v;\\n std::cin >> qs[i] >> u >> v;\\n u--; v--;\\n\\n us[i] = u;\\n vs[i] = v;\\n\\n if (eidxs[u].count(v)) continue;\\n eidxs[u][v] = g.add_directed_edge(u, v, 0);\\n eidxs[v][u] = g.add_directed_edge(v, u, 0);\\n }\\n\\n usize s = 0, t = n - 1;\\n int flow = g.max_flow(s, t);\\n for (usize i = 0; i < q; i++) {\\n usize u = us[i], v = vs[i];\\n \\n if (qs[i] == 1) {\\n flow += g.link(s, t, u, eidxs[u][v], 1);\\n flow += g.link(s, t, v, eidxs[v][u], 1);\\n }\\n \\n if (qs[i] == 2) {\\n flow += g.cut(s, t, u, eidxs[u][v]);\\n flow += g.cut(s, t, v, eidxs[v][u]);\\n }\\n\\n std::cout << flow << std::endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 720,\n \"memory_kb\": 8320,\n \"score_of_the_acc\": -1.3698,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2313_7740916\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n//#pragma GCC optimize(\\\"Ofast\\\")\\n\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n#define repl(i,l,r) for(ll i=(l);i<(r);i++)\\n#define per(i,n) for(ll i=(n)-1;i>=0;i--)\\n#define perl(i,r,l) for(ll i=r-1;i>=l;i--)\\n#define fi first\\n#define se second\\n#define pb push_back\\n#define ins insert\\n#define pqueue(x) priority_queue<x,vector<x>,greater<x>>\\n#define all(x) (x).begin(),(x).end()\\n#define CST(x) cout<<fixed<<setprecision(x)\\n#define vtpl(x,y,z) vector<tuple<x,y,z>>\\n#define rev(x) reverse(x);\\nusing ll=long long;\\nusing vl=vector<ll>;\\nusing vvl=vector<vector<ll>>;\\nusing pl=pair<ll,ll>;\\nusing vpl=vector<pl>;\\nusing vvpl=vector<vpl>;\\nconst ll MOD=1000000007;\\nconst ll MOD9=998244353;\\nconst int inf=1e9+10;\\nconst ll INF=4e18;\\nconst ll dy[9]={1,0,-1,0,1,1,-1,-1,0};\\nconst ll dx[9]={0,1,0,-1,1,-1,1,-1,0};\\ntemplate<class T> inline bool chmin(T& a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<class T> inline bool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\nstruct fordfulkerson{\\n ll n;\\n vector<vector<ll>> g;\\n vector<bool> used;\\n fordfulkerson(ll _n):n(_n){\\n g.resize(n,vector<ll>(n));used.resize(n);\\n }\\n ll dfs(ll v,ll t,ll f){\\n if(v==t)return f;\\n used[v]=true;\\n for(ll i=0;i<used.size();i++){\\n if(!used[i]&&g[v][i]){\\n ll d=dfs(i,t,min(f,g[v][i]));\\n if(d>0){\\n g[v][i]-=d;g[i][v]+=d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n ll max_flow(ll s,ll t,ll limit=INF){\\n ll ans=0;\\n while(1){\\n used.assign(n,false);\\n int f=dfs(s,t,limit);\\n ans+=f;\\n limit-=f;\\n if(f==0||limit==0)return ans;\\n }\\n\\n }\\n};\\nint main(){\\n ll n;cin >> n;\\n fordfulkerson f(n);\\n ll m;cin >> m;\\n ll q;cin >> q;\\n rep(_,m){\\n ll a,b;cin >>a >> b;a--;b--;\\n f.g[a][b]=1;f.g[b][a]=1;\\n }\\n ll ans=f.max_flow(0,n-1);\\n rep(_,q){\\n ll t,a,b;cin >> t >> a >> b;a--;b--;\\n if(t==1){\\n f.g[a][b]=1;f.g[b][a]=1;\\n }\\n else{\\n if(f.g[a][b]==0){\\n int d=f.max_flow(a,b,1);\\n if(d==0){\\n f.max_flow(n-1,0,1);\\n f.max_flow(a,b,1);\\n ans--;\\n }\\n }\\n else if(f.g[b][a]==0){\\n int d=f.max_flow(b,a,1);\\n if(d==0){\\n f.max_flow(n-1,0,1);\\n f.max_flow(b,a,1);\\n ans--;\\n }\\n }\\n f.g[a][b]=0;f.g[b][a]=0;\\n }\\n ans+=f.max_flow(0,n-1);\\n cout << ans << endl;\\n /*rep(i,n){\\n rep(j,n)cout << f.g[i][j] <<\\\" \\\";cout << endl;\\n }*/\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 5452,\n \"score_of_the_acc\": -0.7273,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2313_7119714\",\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\\n//constexpr long long int MOD = 1000000007;\\nconstexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-8;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\nstruct Flow {\\n\\tvector<vector<pair<int, int>>>edge;\\n\\tint ans = 0;\\n\\tFlow(int sz) {\\n\\t\\tedge.resize(sz);\\n\\t}\\n\\tbool Go(int from, int to) {\\n\\t\\tvector<int>bef(edge.size(), -1);\\n\\t\\tqueue<int>Q;\\n\\t\\tQ.push(from);\\n\\t\\twhile (!Q.empty()) {\\n\\t\\t\\tint cn = Q.front();\\n\\t\\t\\tQ.pop();\\n\\t\\t\\tfor (auto i : edge[cn]) {\\n\\t\\t\\t\\tif (bef[i.first] == -1 && i.second == 1) {\\n\\t\\t\\t\\t\\tbef[i.first] = cn;\\n\\t\\t\\t\\t\\tQ.push(i.first);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (bef[to] == -1)return false;\\n\\t\\tint p = to;\\n\\t\\twhile (p != from) {\\n\\t\\t\\tint nx = 1;\\n\\t\\t\\tfor (int i = 0; i < edge[p].size(); i++) {\\n\\t\\t\\t\\tif (edge[p][i].first == bef[p]) {\\n\\t\\t\\t\\t\\tnx ^= edge[p][i].second;\\n\\t\\t\\t\\t\\tedge[p][i].second = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 0; i < edge[bef[p]].size(); i++) {\\n\\t\\t\\t\\tif (edge[bef[p]][i].first == p) {\\n\\t\\t\\t\\t\\tedge[bef[p]][i].second =nx;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tp = bef[p];\\n\\t\\t}\\n\\t\\treturn true;\\n\\t}\\n\\tvoid DelGo(int from,int to) {\\n\\t\\tif (from == to)return;\\n\\t\\tvector<int>bef(edge.size(), -1);\\n\\t\\tqueue<int>Q;\\n\\t\\tQ.push(from);\\n\\t\\twhile (!Q.empty()) {\\n\\t\\t\\tint cn = Q.front();\\n\\t\\t\\tQ.pop();\\n\\t\\t\\tfor (auto i : edge[cn]) {\\n\\t\\t\\t\\tif (bef[i.first] == -1 && i.second == 1) {\\n\\t\\t\\t\\t\\tfor (int j = 0; j < edge[i.first].size(); j++) {\\n\\t\\t\\t\\t\\t\\tif (edge[i.first][j].first == cn && edge[i.first][j].second == 0) {\\n\\t\\t\\t\\t\\t\\t\\tbef[i.first] = cn;\\n\\t\\t\\t\\t\\t\\t\\tQ.push(i.first);\\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 p = to;\\n\\t\\twhile (p != from) {\\n\\t\\t\\tfor (int i = 0; i < edge[p].size(); i++) {\\n\\t\\t\\t\\tif (edge[p][i].first == bef[p]) {\\n\\t\\t\\t\\t\\tedge[p][i].second = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 0; i < edge[bef[p]].size(); i++) {\\n\\t\\t\\t\\tif (edge[bef[p]][i].first == p) {\\n\\t\\t\\t\\t\\tedge[bef[p]][i].second = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tp = bef[p];\\n\\t\\t}\\n\\t}\\n\\tint AddEdge(int u, int v) {\\n\\t\\tedge[u].push_back({ v,1 });\\n\\t\\tedge[v].push_back({ u,1 });\\n\\t\\tif (Go(0, edge.size() - 1))ans++;\\n\\t\\treturn ans;\\n\\t}\\n\\tvoid Init(vector<int>u, vector<int>v) {\\n\\t\\tfor (int i = 0; i < u.size(); i++) {\\n\\t\\t\\tedge[u[i]].push_back({ v[i],1 });\\n\\t\\t\\tedge[v[i]].push_back({ u[i],1 });\\n\\t\\t}\\n\\t\\twhile (Go(0, edge.size() - 1)) {\\n\\t\\t\\tans++;\\n\\t\\t}\\n\\t}\\n\\tint DeleteEdge(int u, int v) {\\n\\t\\t{\\n\\t\\t\\tfor (int i = 0; i < edge[u].size(); i++) {\\n\\t\\t\\t\\tif (edge[u][i].first == v && edge[u][i].second == 0) {\\n\\t\\t\\t\\t\\tans--;\\n\\t\\t\\t\\t\\tDelGo(edge.size() - 1, v);\\n\\t\\t\\t\\t\\tDelGo(v, u);\\n\\t\\t\\t\\t\\tDelGo(u, 0);\\n\\t\\t\\t\\t\\tfor (int j = 0; j < edge[u].size(); j++) {\\n\\t\\t\\t\\t\\t\\tif (edge[u][j].first == v) {\\n\\t\\t\\t\\t\\t\\t\\tswap(edge[u][j], edge[u].back());\\n\\t\\t\\t\\t\\t\\t\\tedge[u].pop_back();\\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\\tfor (int j = 0; j < edge[v].size(); j++) {\\n\\t\\t\\t\\t\\t\\tif (edge[v][j].first == u) {\\n\\t\\t\\t\\t\\t\\t\\tswap(edge[v][j], edge[v].back());\\n\\t\\t\\t\\t\\t\\t\\tedge[v].pop_back();\\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}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t{\\n\\t\\t\\tfor (int i = 0; i < edge[v].size(); i++) {\\n\\t\\t\\t\\tif (edge[v][i].first == u && edge[v][i].second == 0) {\\n\\t\\t\\t\\t\\tans--;\\n\\t\\t\\t\\t\\tDelGo(edge.size() - 1, u);\\n\\t\\t\\t\\t\\tDelGo(u, v);\\n\\t\\t\\t\\t\\tDelGo(v, 0);\\n\\t\\t\\t\\t\\tfor (int j = 0; j < edge[u].size(); j++) {\\n\\t\\t\\t\\t\\t\\tif (edge[u][j].first == v) {\\n\\t\\t\\t\\t\\t\\t\\tswap(edge[u][j], edge[u].back());\\n\\t\\t\\t\\t\\t\\t\\tedge[u].pop_back();\\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\\tfor (int j = 0; j < edge[v].size(); j++) {\\n\\t\\t\\t\\t\\t\\tif (edge[v][j].first == u) {\\n\\t\\t\\t\\t\\t\\t\\tswap(edge[v][j], edge[v].back());\\n\\t\\t\\t\\t\\t\\t\\tedge[v].pop_back();\\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}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < edge[u].size(); j++) {\\n\\t\\t\\tif (edge[u][j].first == v) {\\n\\t\\t\\t\\tswap(edge[u][j], edge[u].back());\\n\\t\\t\\t\\tedge[u].pop_back();\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tfor (int j = 0; j < edge[v].size(); j++) {\\n\\t\\t\\tif (edge[v][j].first == u) {\\n\\t\\t\\t\\tswap(edge[v][j], edge[v].back());\\n\\t\\t\\t\\tedge[v].pop_back();\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t//\\tcout << \\\"##################\\\" << endl;\\n\\t//\\tDEBUG();\\n\\t//\\tcout << \\\"----------------\\\" << endl;\\n\\t\\tif (Go(0, edge.size() - 1))ans++;\\n\\t\\treturn ans;\\n\\t}\\n\\tvoid DEBUG() {\\n\\t\\tfor (int i = 0; i < edge.size(); i++) {\\n\\t\\t\\tfor (auto j : edge[i]) {\\n\\t\\t\\t\\tcout << i << \\\" \\\" << j.first << \\\" \\\" << j.second << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tcin >> N >> M >> K;\\n\\tvector<int>u;\\n\\tvector<int>v;\\n\\tfor (int i = 0; i < M; i++) {\\n\\t\\tcin >> L >> R;\\n\\t\\tL--, R--;\\n\\t\\tu.push_back(L);\\n\\t\\tv.push_back(R);\\n\\t}\\n\\tFlow f(N);\\n\\tf.Init(u, v);\\n\\twhile (K--) {\\n\\t\\tint a, b, c;\\n\\t\\tcin >> a >> b >> c;\\n\\t\\tb--, c--;\\n\\t\\tif (a == 1) {\\n\\t\\t\\tcout << f.AddEdge(b, c) << endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout << f.DeleteEdge(b, c) << endl;\\n\\t\\t}\\n\\t//\\tf.DEBUG();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 4168,\n \"score_of_the_acc\": -0.5057,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2313_7106160\",\n \"code_snippet\": \"#define MOD_TYPE 2\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#if 1\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n\\n#if 0\\n#include <ext/pb_ds/assoc_container.hpp>\\n#include <ext/pb_ds/tag_and_trait.hpp>\\n#include <ext/pb_ds/tree_policy.hpp>\\n#include <ext/rope>\\nusing namespace __gnu_pbds;\\nusing namespace __gnu_cxx;\\ntemplate <typename T>\\nusing extset =\\n tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\\n#endif\\n\\n#if 0\\n#include <boost/multiprecision/cpp_dec_float.hpp>\\n#include <boost/multiprecision/cpp_int.hpp>\\nusing Int = boost::multiprecision::cpp_int;\\nusing lld = boost::multiprecision::cpp_dec_float_100;\\n#endif\\n\\n#pragma region Macros\\n\\nusing ll = long long int;\\nusing ld = long double;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\nusing pld = pair<ld, ld>;\\ntemplate <typename T>\\nusing smaller_queue = priority_queue<T, vector<T>, greater<T>>;\\n\\nconstexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);\\nconstexpr int INF = (int)1e9 + 10;\\nconstexpr ll LINF = (ll)4e18;\\nconst double PI = acos(-1.0);\\nconstexpr double EPS = 1e-11;\\nconstexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};\\nconstexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};\\n\\n#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)\\n#define rep(i, n) REP(i, 0, n)\\n#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)\\n#define repi(i, n) REPI(i, 0, n)\\n#define YES(n) cout << ((n) ? \\\"YES\\\" : \\\"NO\\\") << \\\"\\\\n\\\"\\n#define Yes(n) cout << ((n) ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"\\n#define all(v) v.begin(), v.end()\\n#define NP(v) next_permutation(all(v))\\n#define dbg(x) cerr << #x << \\\":\\\" << x << \\\"\\\\n\\\";\\n#define UNIQUE(v) v.erase(unique(all(v)), v.end())\\n\\nstruct io_init {\\n io_init() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << setprecision(30) << setiosflags(ios::fixed);\\n };\\n} io_init;\\ntemplate <typename T>\\ninline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\ninline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ninline ll floor(ll a, ll b) {\\n if (b < 0) a *= -1, b *= -1;\\n if (a >= 0) return a / b;\\n return -((-a + b - 1) / b);\\n}\\ninline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }\\ntemplate <typename A, size_t N, typename T>\\ninline void Fill(A (&array)[N], const T &val) {\\n fill((T *)array, (T *)(array + N), val);\\n}\\ntemplate <typename T>\\nvector<T> compress(vector<T> &v) {\\n vector<T> val = v;\\n sort(all(val)), val.erase(unique(all(val)), val.end());\\n for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();\\n return val;\\n}\\ntemplate <typename T, typename U>\\nconstexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {\\n is >> p.first >> p.second;\\n return is;\\n}\\ntemplate <typename T, typename U>\\nconstexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\ntemplate <typename T>\\nconstexpr istream &operator>>(istream &is, vector<T> &v) noexcept {\\n for (int i = 0; i < v.size(); i++) is >> v[i];\\n return is;\\n}\\ntemplate <typename T>\\nconstexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {\\n for (int i = 0; i < v.size(); i++)\\n os << v[i] << (i + 1 == v.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\ntemplate <typename T>\\nconstexpr void operator--(vector<T> &v, int) noexcept {\\n for (int i = 0; i < v.size(); i++) v[i]--;\\n}\\n\\nrandom_device seed_gen;\\nmt19937_64 engine(seed_gen());\\n\\n#pragma endregion\\n\\n// --------------------------------------\\n\\nconst int MAX_V = 500;\\nset<int> G[MAX_V];\\n\\nvector<vector<int>> paths;\\nset<pii> used_edge;\\nmap<pii, int> mp;\\n\\nbool used[MAX_V];\\nbool dfs(int u, int sink, vector<int> &path) {\\n if (u == sink) {\\n path.push_back(u);\\n return true;\\n }\\n used[u] = true;\\n for (auto v : G[u]) {\\n if (used[v]) continue;\\n bool f = dfs(v, sink, path);\\n if (f) {\\n path.push_back(u);\\n // 残余グラフを押し戻す場合は双方向に張り直す\\n if (used_edge.count({u, v})) {\\n G[v].insert(u);\\n used_edge.erase({u, v});\\n used_edge.erase({v, u});\\n } else {\\n G[u].erase(v);\\n G[v].insert(u);\\n used_edge.insert({u, v});\\n used_edge.insert({v, u});\\n }\\n return true;\\n }\\n }\\n return false;\\n}\\n\\nint n;\\nint ans = 0;\\n\\nvoid calc() {\\n while (1) {\\n fill(used, used + MAX_V, false);\\n vector<int> path;\\n bool f = dfs(0, n - 1, path);\\n if (not f) return;\\n reverse(all(path));\\n rep(i, path.size() - 1) { mp[{path[i], path[i + 1]}] = paths.size(); }\\n paths.push_back(path);\\n ans++;\\n }\\n}\\n\\nvoid add(int u, int v) {\\n assert(not G[u].count(v));\\n assert(not G[v].count(u));\\n assert(not used_edge.count({u, v}));\\n assert(not used_edge.count({v, u}));\\n G[u].insert(v);\\n G[v].insert(u);\\n calc();\\n}\\n\\nvoid del(int u, int v) {\\n if (used_edge.count({u, v})) { // 流した\\n int pi;\\n if (G[u].count(v)) // 残余グラフに u->v がある ＝ v->u で使った\\n pi = mp[{v, u}];\\n else\\n pi = mp[{u, v}];\\n rep(i, paths[pi].size() - 1) {\\n int u = paths[pi][i];\\n int v = paths[pi][i + 1];\\n G[u].insert(v);\\n used_edge.erase({u, v});\\n used_edge.erase({v, u});\\n }\\n ans--;\\n }\\n G[u].erase(v);\\n G[v].erase(u);\\n calc();\\n}\\n\\nvoid solve() {\\n int m, q;\\n cin >> n >> m >> q;\\n rep(i, m) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n G[u].insert(v);\\n G[v].insert(u);\\n }\\n calc();\\n rep(i, q) {\\n int m, u, v;\\n cin >> m >> u >> v;\\n u--, v--;\\n if (m == 1)\\n add(u, v);\\n else\\n del(u, v);\\n cout << ans << \\\"\\\\n\\\";\\n }\\n}\\n\\nint main() { solve(); }\",\n \"accuracy\": 0.2413793103448276,\n \"time_ms\": 30,\n \"memory_kb\": 3700,\n \"score_of_the_acc\": -0.0258,\n \"final_rank\": 14\n }\n]","isConversational":false}}},{"rowIdx":1296,"cells":{"group_id":{"kind":"string","value":"aoj_2314_cpp"},"problem_description":{"kind":"string","value":"問題文\n落書きの魔女 ALBERTINE は\nW\n列\nH\n行の正方形のセルからなる長方形の結界の入り口に落書きをしている．この世界では落書きは必ずセルを白色か黒色で塗ることによって成り立つ．\nすでに使い魔 ANJA の手によって落書きの一部が描かれているのだが，落書きの魔女は残りすべてのセルを塗り落書きを完成させたい．落書きの魔女にはあるこだわりがある．そのこだわりとは次のようなものである．\n2\nつの異なるセルが辺を共有するとき，\n2\nつのセルは隣接していると呼ぶことにする．完成された落書きにおいては，任意の\n2\nつの黒いセルについて，片方からもう片方への隣接した黒いセルをたどるパスがちょうど\n1\nつだけ存在していなければならない．\nどの\n2\nつの白色のセルも隣接してはならない．\nまた，落書きの魔女は黒色が好きなので，こだわりを満たした状態でなおかつ最も黒色のセルが多い落書きを完成させたい．果たして落書きの魔女は最大で何個のセルが黒色に塗られたこだわりの落書きを描くことができるだろうか．\n入力形式\n入力は以下の形式で与えられる．\nH\\ W\\\\\nc_{11} c_{12} ... c_{1W}\\\\\nc_{21} c_{22} ... c_{2W}\\\\\n...\\\\\nc_{H1} c_{H2} ... c_{HW}\\\\\nH\nは結界の入り口の縦幅，\nW\nは結界の入り口の横幅を表す．\nc_{ij}\nは各セルの状態を表す文字であり，上から\ni\n行目，左から\nj\n列目のセルの状態を表す．セルに黒色が塗られている場合は\nc_{ij}\nは\n'#'\nとなり，白色が塗られている場合は\n'.'\n，まだ色が塗られていない場合はそうでない場合は\n'?'\nとなる．\n出力形式\n魔女のこだわりを満たした状態でとりうる黒色のセルの個数の最大値を\n1\n行で出力せよ．\nもしどのように塗っても魔女のこだわりを満たすように出来ない場合，\n-1\nと出力せよ．\n制約\n1 ≤ H ≤ 11\n1 ≤ W ≤ 11\nc_{ij}\nは\n'#'\n,\n'.'\n,\n'?'\nのいずれかである．\n入出力例\n入力例 1\n3 4\n.##.\n#??#\n.#?#\n出力例1\n8\n入力例 2\n5 5\n##?##\n#???#\n?????\n#???#\n##?##\n出力例 2\n19\n入力例 3\n9 2\n##\n..\n??\n??\n??\n??\n??\n??\n??\n出力例 3\n-1\n入力例 4\n7 9\n??#####??\n?#?????#?\n?#?????#?\n?#??#??#?\n?#???#?#?\n??#####??\n???????#?\n出力例 4\n44\n入力例 5\n11 11\n???????????\n???####????\n???#???#???\n???#???#???\n???#???#???\n???####????\n???#???#???\n???#???#???\n???#???#???\n???####????\n???????????\n出力例 5\n86\nProblem Setter: Flat35"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2314_10712143","code_snippet":"// AOJ #2314 Scribbling witch\n// 2025.5.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MAX = 11;\n\nint h, w;\nchar B[MAX][MAX+1];\nmap<ll,int> memo[MAX][MAX];\nchar mapto[16];\nint nxt(ll, int, int, char);\n\ninline int Get(ll s, int i) {\n int v = (s >> (i*4)) & 0xF;\n return (v<<28)>>28;\n}\ninline void Set(ll &s, int v, int i) {\n s &= ~((ll)0xF << (i*4));\n s |= (ll)(v&0xF) << (i*4);\n}\n\nint calc(ll st, int x, int y) {\n if (x==w) return calc(st, 0, y+1);\n if (y==h) {\n for(int i=0;i<w;i++) if (Get(st,i)>0) return -1;\n return 0;\n }\n auto &mp = memo[y][x];\n if (mp.count(st)) return mp[st];\n\n int ans = -1;\n char c0 = B[y][x];\n if (c0=='#' || c0=='?') ans = max(ans, nxt(st, x, y, '#'));\n if (c0=='.' || c0=='?') ans = max(ans, nxt(st, x, y, '.'));\n return mp[st] = ans;\n}\n\n\nint nxt(ll st, int x, int y, char c) {\n int pc = Get(st,x);\n int lc = x>0 ? Get(st,x-1) : -1;\n int add = 0;\n if (c=='#') {\n add = 1;\n if (lc>=0 && lc==pc) return -1;\n if (lc>=0) {\n Set(st, lc, x);\n if (pc>=0) {\n for(int i=0;i<w;i++) if (Get(st,i)==pc) Set(st, lc, i);\n }\n } else if (pc==-1) Set(st, 7, x);\n else Set(st, pc, x);\n } else {\n if ((y>0 && pc==-1) || (x>0 && lc==-1)) return -1;\n Set(st, -1, x);\n if (pc!=-1) {\n bool ok=false;\n for(int i=0;i<w;i++) if (Get(st,i)==pc){ ok=true; break; }\n if (!ok) return -1;\n }\n }\n memset(mapto, -1, sizeof(mapto));\n int mcnt=0;\n for(int i=0;i<w;i++){\n int v = Get(st,i);\n if (v!=-1) {\n if (mapto[v]==-1) mapto[v]=mcnt++;\n Set(st, mapto[v], i);\n }\n }\n int sub = calc(st, x+1, y);\n return sub<0 ? -1 : sub+add;\n}\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n cin >> h >> w;\n for(int y=0;y<h;y++) cin >> B[y];\n if (w==1) {\n if (h==1) {\n cout << (B[0][0]=='.' ? 0 : 1) << endl;\n return 0;\n }\n int ans = -1;\n for(int L=0;L<=1;L++){\n for(int R=max(L,h-2); R<=h-1; R++){\n if (L>R) continue;\n bool ok = true;\n for(int i=L;i<=R;i++){\n if (B[i][0]=='.') ok=false;\n }\n for(int i=0;i<L;i++){\n if (B[i][0]=='#') ok=false;\n }\n for(int i=R+1;i<h;i++){\n if (B[i][0]=='#') ok=false;\n }\n if (!ok) continue;\n ans = max(ans, R-L+1);\n }\n }\n cout << ans << endl;\n return 0;\n }\n for(int y=0;y<h;y++){\n for(int x=0;x<w;x++){\n memo[y][x].clear();\n }\n }\n int ans = calc(-1LL, 0, 0);\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":21376,"score_of_the_acc":-0.2193,"final_rank":5},{"submission_id":"aoj_2314_10543179","code_snippet":"// AOJ #2314 Scribbling witch\n// 2025.5.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MAX = 11;\n\nint h, w;\nchar B[MAX][MAX+1];\nmap<ll,int> memo[MAX][MAX];\nchar mapto[16];\nint nxt(ll, int, int, char);\n\ninline int Get(ll s, int i) {\n int v = (s >> (i*4)) & 0xF;\n return (v<<28)>>28;\n}\ninline void Set(ll &s, int v, int i) {\n s &= ~((ll)0xF << (i*4));\n s |= (ll)(v&0xF) << (i*4);\n}\n\nint calc(ll st, int x, int y) {\n if (x==w) return calc(st, 0, y+1);\n if (y==h) {\n for(int i=0;i<w;i++) if (Get(st,i)>0) return -1;\n return 0;\n }\n auto &mp = memo[y][x];\n if (mp.count(st)) return mp[st];\n\n int ans = -1;\n char c0 = B[y][x];\n if (c0=='#' || c0=='?') ans = max(ans, nxt(st, x, y, '#'));\n if (c0=='.' || c0=='?') ans = max(ans, nxt(st, x, y, '.'));\n return mp[st] = ans;\n}\n\n\nint nxt(ll st, int x, int y, char c) {\n int pc = Get(st,x);\n int lc = x>0 ? Get(st,x-1) : -1;\n int add = 0;\n if (c=='#') {\n add = 1;\n if (lc>=0 && lc==pc) return -1;\n if (lc>=0) {\n Set(st, lc, x);\n if (pc>=0) {\n for(int i=0;i<w;i++) if (Get(st,i)==pc) Set(st, lc, i);\n }\n } else if (pc==-1) Set(st, 7, x);\n else Set(st, pc, x);\n } else {\n if ((y>0 && pc==-1) || (x>0 && lc==-1)) return -1;\n Set(st, -1, x);\n if (pc!=-1) {\n bool ok=false;\n for(int i=0;i<w;i++) if (Get(st,i)==pc){ ok=true; break; }\n if (!ok) return -1;\n }\n }\n memset(mapto, -1, sizeof(mapto));\n int mcnt=0;\n for(int i=0;i<w;i++){\n int v = Get(st,i);\n if (v!=-1) {\n if (mapto[v]==-1) mapto[v]=mcnt++;\n Set(st, mapto[v], i);\n }\n }\n int sub = calc(st, x+1, y);\n return sub<0 ? -1 : sub+add;\n}\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n cin >> h >> w;\n for(int y=0;y<h;y++) cin >> B[y];\n if (w==1) {\n if (h==1) {\n cout << (B[0][0]=='.' ? 0 : 1) << endl;\n return 0;\n }\n int ans = -1;\n for(int L=0;L<=1;L++){\n for(int R=max(L,h-2); R<=h-1; R++){\n if (L>R) continue;\n bool ok = true;\n for(int i=L;i<=R;i++){\n if (B[i][0]=='.') ok=false;\n }\n for(int i=0;i<L;i++){\n if (B[i][0]=='#') ok=false;\n }\n for(int i=R+1;i<h;i++){\n if (B[i][0]=='#') ok=false;\n }\n if (!ok) continue;\n ans = max(ans, R-L+1);\n }\n }\n cout << ans << endl;\n return 0;\n }\n for(int y=0;y<h;y++){\n for(int x=0;x<w;x++){\n memo[y][x].clear();\n }\n }\n int ans = calc(-1LL, 0, 0);\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":21292,"score_of_the_acc":-0.2185,"final_rank":4},{"submission_id":"aoj_2314_9166708","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int h,w; cin >> h >> w;\n vector<string> s(h);\n for (int i = 0; i < h; ++i) {\n cin >> s[i];\n }\n map<vector<int>, int> dp;\n // そもそもw=1は除いておいた方が連結性確認の面で楽？\n if (w == 1) {\n for (int i = 1; i+1 < h; ++i) {\n if (s[i][0] == '.') {\n cout << -1 << endl;\n return 0;\n }\n }\n set<int> st;\n if (s[0][0] == '.') st.insert(0);\n if (s.back()[0] == '.') st.insert(h-1);\n cout << h - st.size() << endl;\n return 0;\n }\n {\n // 1列目の置き方を列挙する\n vector<int> v(w);\n auto dfs = [&](auto dfs, int i, int id, int cnt) -> void {\n if (i == w) {\n dp[v] = cnt;\n return;\n }\n if (v[i-1] == 0) {\n if (s[0][i] == '.') return;\n v[i] = id + 1;\n dfs(dfs, i+1, id+1, cnt+1);\n }\n else {\n v[i] = 0;\n if (s[0][i] != '#') dfs(dfs, i+1, id, cnt);\n v[i] = id;\n if (s[0][i] != '.') dfs(dfs, i+1, id, cnt+1);\n }\n };\n v[0] = 1;\n if (s[0][0] != '.') dfs(dfs, 1, 1, 1);\n v[0] = 0;\n if (s[0][0] != '#') dfs(dfs, 1, 0, 0);\n }\n for (int i = 1; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n map<vector<int>, int> ndp;\n bool B = (s[i][j] != '.');\n bool W = (s[i][j] != '#');\n if (B) {\n for (auto &pp : dp) {\n auto p = pp.first;\n // ループを作ってはいけない\n if (j and p[j-1] and p[j-1] == p[j]) continue;\n // 接する面が白のみの場合、新規連結成分\n if (p[j] == 0 and (j == 0 or p[j-1] == 0)) {\n int mx = 0;\n for (int k = 0; k < w; ++k) {\n mx = max(mx, p[k]);\n }\n p[j] = mx+1;\n ndp[p] = max(ndp[p], pp.second+1);\n } else {\n if (j == 0 or p[j-1] == 0) {\n // そのまま\n ndp[p] = max(ndp[p], pp.second+1);\n } else if (p[j] == 0) {\n p[j] = p[j-1];\n ndp[p] = max(ndp[p], pp.second+1);\n } else {\n int a = p[j], b = p[j-1];\n if (a > b) swap(a, b);\n // 2つをマージする\n p[j] = a;\n for (int k = 0; k < w; ++k) {\n if (p[k] == b) p[k] = a;\n else if (p[k] > b) p[k] -= 1;\n }\n ndp[p] = max(ndp[p], pp.second+1);\n }\n }\n }\n }\n if (W) {\n for (auto &pp : dp) {\n auto p = pp.first;\n // 白は連結してはいけない\n if (p[j] == 0 or (j and p[j-1] == 0)) continue;\n // 白によって連結成分が孤立してしまってもダメ\n int cnt = 0;\n for (int k = 0; k < w; ++k) {\n cnt += (p[j] == p[k]);\n }\n if (cnt != 1) {\n p[j] = 0;\n ndp[p] = max(ndp[p], pp.second);\n }\n }\n }\n swap(dp, ndp);\n\n// cout << i << \" \" << j << endl;\n// for (auto &pp : dp) {\n// auto p = pp.first;\n// for (int k : p) {\n// cout << k << \" \";\n// }\n// cout << endl;\n// }\n }\n }\n int res = -1;\n for (auto &pp : dp) {\n auto p = pp.first;\n bool ok = true;\n for (int i = 0; i < w; ++i) {\n if (p[i] > 1) ok = false;\n }\n if (ok) res = max(res, pp.second);\n }\n cout << res << endl;\n}","accuracy":1,"time_ms":320,"memory_kb":6100,"score_of_the_acc":-0.2881,"final_rank":7},{"submission_id":"aoj_2314_8402578","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstring to_string(const vector<int>& arr) {\n\tstring res = \"[\";\n\tfor (int i = 0; i < int(arr.size()); i++) {\n\t\tif (i != 0) {\n\t\t\tres += \", \";\n\t\t}\n\t\tres += to_string(arr[i]);\n\t}\n\tres += \"]\";\n\treturn res;\n}\n\nvoid regularize(int n, vector<int>& v) {\n\tint cnt = 0;\n\tvector<int> tbl(n + 1, -1);\n\tfor (int i = 0; i < n; i++) {\n\t\tif (v[i] != -1 && tbl[v[i]] == -1) {\n\t\t\ttbl[v[i]] = cnt++;\n\t\t}\n\t}\n\tfor (int i = 0; i < n; i++) {\n\t\tif (v[i] != -1) {\n\t\t\tv[i] = tbl[v[i]];\n\t\t}\n\t}\n}\n\nint solve_one(int N, const vector<int>& X) {\n\tif (N == 1) {\n\t\treturn (X[0] != 0);\n\t}\n\tif (N == 2) {\n\t\tint res = (X[0] != 0) + (X[1] != 0);\n\t\treturn (res >= 1 ? res : -1);\n\t}\n\tfor (int i = 1; i < N - 1; i++) {\n\t\tif (X[i] == 0) {\n\t\t\treturn -1;\n\t\t}\n\t}\n\treturn (N - 2) + (X[0] != 0) + (X[N - 1] != 0);\n}\n\nint solve(int H, int W, const vector<vector<int> >& A) {\n\tif (H < W) {\n\t\tvector<vector<int> > B(W, vector<int>(H));\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tB[j][i] = A[i][j];\n\t\t\t}\n\t\t}\n\t\treturn solve(W, H, B);\n\t}\n\tif (W == 1) {\n\t\tvector<int> X(H);\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tX[i] = A[i][0];\n\t\t}\n\t\treturn solve_one(H, X);\n\t}\n\tconst int INF = 1012345678;\n\tvector<vector<map<vector<int>, int> > > dp(H, vector<map<vector<int>, int> >(W));\n\tvector<string> Z(H, string(W, '?'));\n\tauto calc = [&](auto& self, int x, int y, const vector<int>& v) -> int {\n\t\tif (x == H && y == 0) {\n\t\t\tif (*max_element(v.begin(), v.end()) >= 1) {\n\t\t\t\treturn -INF;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tif (dp[x][y].find(v) != dp[x][y].end()) {\n\t\t\treturn dp[x][y][v];\n\t\t}\n\t\tint nx = x, ny = y + 1;\n\t\tif (ny == W) {\n\t\t\tnx += 1;\n\t\t\tny = 0;\n\t\t}\n\t\tint res = -INF;\n\t\tif (A[x][y] != 1 && (y == 0 || v[y - 1] != -1) && v[y] != -1) {\n\t\t\t// place white\n\t\t\tvector<int> nv = v;\n\t\t\tnv[y] = -1;\n\t\t\tif (find(nv.begin(), nv.end(), v[y]) != nv.end()) {\n\t\t\t\tZ[x][y] = '.';\n\t\t\t\tint subres = self(self, nx, ny, nv);\n\t\t\t\tres = max(res, subres);\n\t\t\t}\n\t\t}\n\t\tif (A[x][y] != 0 && (y == 0 || v[y] == -1 || v[y - 1] != v[y])) {\n\t\t\t// place black\n\t\t\tvector<int> nv = v;\n\t\t\tif ((y != 0 && v[y - 1] != -1) && v[y] != -1) {\n\t\t\t\tfor (int i = 0; i < W; i++) {\n\t\t\t\t\tif (v[i] == v[y]) {\n\t\t\t\t\t\tnv[i] = v[y - 1];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if ((y != 0 && v[y - 1] != -1) || v[y] != -1) {\n\t\t\t\tnv[y] = (v[y - 1] != -1 ? v[y - 1] : v[y]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tnv[y] = W;\n\t\t\t}\n\t\t\tregularize(W, nv);\n\t\t\tZ[x][y] = '#';\n\t\t\tint subres = self(self, nx, ny, nv);\n\t\t\tres = max(res, subres + 1);\n\t\t}\n\t\tdp[x][y][v] = res;\n\t\treturn res;\n\t};\n\tint ans = -1;\n\tfor (int i = 0; i < (1 << W); i++) {\n\t\tvector<int> v(W, -1);\n\t\tint cnt = -1, pre = -2, black = 0;\n\t\tbool flag = true;\n\t\tfor (int j = 0; j < W; j++) {\n\t\t\tif ((i >> j) & 1) {\n\t\t\t\tif (A[0][j] == 0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t\tif (pre != j - 1) {\n\t\t\t\t\tcnt += 1;\n\t\t\t\t}\n\t\t\t\tv[j] = cnt;\n\t\t\t\tpre = j;\n\t\t\t\tZ[0][j] = '#';\n\t\t\t\tblack += 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tZ[0][j] = '.';\n\t\t\t\tif (A[0][j] == 1 || (j >= 1 && v[j - 1] == -1)) {\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (flag) {\n\t\t\tint res = calc(calc, 1, 0, v);\n\t\t\tans = max(ans, res + black);\n\t\t}\n\t}\n\treturn ans;\n}\n\nbool check(int H, int W, const vector<vector<int> >& A) {\n\tvector<vector<bool> > vis(H, vector<bool>(W, false));\n\tauto check = [&](int x, int y) -> bool {\n\t\treturn 0 <= x && x < H && 0 <= y && y < W && !vis[x][y] && A[x][y] == 1;\n\t};\n\tauto dfs = [&](auto& self, int x, int y) -> void {\n\t\tvis[x][y] = true;\n\t\tif (check(x, y - 1)) self(self, x, y - 1);\n\t\tif (check(x, y + 1)) self(self, x, y + 1);\n\t\tif (check(x - 1, y)) self(self, x - 1, y);\n\t\tif (check(x + 1, y)) self(self, x + 1, y);\n\t};\n\tint cnt = 0;\n\tfor (int i = 0; i < H; i++) {\n\t\tfor (int j = 0; j < W; j++) {\n\t\t\tif (A[i][j] == 1 && !vis[i][j]) {\n\t\t\t\tdfs(dfs, i, j);\n\t\t\t\tcnt += 1;\n\t\t\t}\n\t\t}\n\t}\n\tif (cnt >= 2) {\n\t\treturn false;\n\t}\n\tint f = 0;\n\tfor (int i = 0; i < H; i++) {\n\t\tfor (int j = 0; j < W; j++) {\n\t\t\tif (A[i][j] == 1) {\n\t\t\t\tif (i >= 1 && A[i - 1][j] == 1) f -= 1;\n\t\t\t\tif (j >= 1 && A[i][j - 1] == 1) f -= 1;\n\t\t\t\tf += 1;\n\t\t\t}\n\t\t\tif (A[i][j] == 0) {\n\t\t\t\tif (i >= 1 && A[i - 1][j] == 0) return false;\n\t\t\t\tif (j >= 1 && A[i][j - 1] == 0) return false;\n\t\t\t}\n\t\t}\n\t}\n\treturn cnt == 0 || f == 1;\n}\n\nbool testcase_check(int H, int W) {\n\tfor (int i = 0; i < 1 << (H * W); i++) {\n\t\tvector<vector<int> > A(H, vector<int>(W));\n\t\tfor (int j = 0; j < H * W; j++) {\n\t\t\tA[j / W][j % W] = ((i >> j) & 1);\n\t\t}\n\t\tbool res1 = (solve(H, W, A) != -1);\n\t\tbool res2 = check(H, W, A);\n\t\tif (res1 != res2) {\n\t\t\tvector<string> res(H);\n\t\t\tfor (int i = 0; i < H; i++) {\n\t\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\t\tres[i] += (A[i][j] == 0 ? '.' : '#');\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << \"H = \" << H << \", W = \" << W << \":\" << endl;\n\t\t\tfor (int i = 0; i < H; i++) {\n\t\t\t\tcout << res[i] << endl;\n\t\t\t}\n\t\t\tcout << \"Returns: \" << (res1 ? \"true\" : \"false\") << endl;\n\t\t\tcout << \"Answer: \" << (res2 ? \"true\" : \"false\") << endl;\n\t\t\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nint main() {\n\t/*\n\tfor (int H = 1; H <= 5; H++) {\n\t\tfor (int W = 1; W <= H; W++) {\n\t\t\tif (testcase_check(H, W)) {\n\t\t\t\tcout << \"H = \" << H << \", W = \" << W << \": success!\" << endl;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n\t*/\n\tint H, W;\n\tcin >> H >> W;\n\tvector<vector<int> > A(H, vector<int>(W, -1));\n\tfor (int i = 0; i < H; i++) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int j = 0; j < W; j++) {\n\t\t\tif (s[j] == '.') A[i][j] = 0;\n\t\t\tif (s[j] == '#') A[i][j] = 1;\n\t\t}\n\t}\n\tint ans = solve(H, W, A);\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":200,"memory_kb":43856,"score_of_the_acc":-0.5184,"final_rank":9},{"submission_id":"aoj_2314_8402506","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvoid regularize(int n, vector<int>& v) {\n\tint cnt = 0;\n\tvector<int> tbl(n + 1, -1);\n\tfor (int i = 0; i < n; i++) {\n\t\tif (v[i] != -1 && tbl[v[i]] == -1) {\n\t\t\ttbl[v[i]] = cnt++;\n\t\t}\n\t}\n\tfor (int i = 0; i < n; i++) {\n\t\tif (v[i] != -1) {\n\t\t\tv[i] = tbl[v[i]];\n\t\t}\n\t}\n}\n\nint solve_one(int N, const vector<int>& X) {\n\tif (N == 1) {\n\t\treturn (X[0] != 0);\n\t}\n\tfor (int i = 1; i < N - 1; i++) {\n\t\tif (X[i] == 0) {\n\t\t\treturn -1;\n\t\t}\n\t}\n\treturn (N - 2) + (X[0] != 0) + (X[N - 1] != 0);\n}\n\nstring to_string(const vector<int>& arr) {\n\tstring res = \"[\";\n\tfor (int i = 0; i < int(arr.size()); i++) {\n\t\tif (i != 0) {\n\t\t\tres += \", \";\n\t\t}\n\t\tres += to_string(arr[i]);\n\t}\n\tres += \"]\";\n\treturn res;\n}\n\nint solve(int H, int W, const vector<vector<int> >& A) {\n\tif (H < W) {\n\t\tvector<vector<int> > B(W, vector<int>(H));\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tB[j][i] = A[i][j];\n\t\t\t}\n\t\t}\n\t\treturn solve(W, H, B);\n\t}\n\tif (W == 1) {\n\t\tvector<int> X(H);\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tX[i] = A[i][0];\n\t\t}\n\t\treturn solve_one(H, X);\n\t}\n\tconst int INF = 1012345678;\n\tvector<vector<map<vector<int>, int> > > dp(H, vector<map<vector<int>, int> >(W));\n\tvector<string> Z(H, string(W, '?'));\n\tauto calc = [&](auto& self, int x, int y, const vector<int>& v) -> int {\n\t\tif (x == H && y == 0) {\n\t\t\tif (*max_element(v.begin(), v.end()) >= 1) {\n\t\t\t\treturn -INF;\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t\tif (dp[x][y].find(v) != dp[x][y].end()) {\n\t\t\treturn dp[x][y][v];\n\t\t}\n\t\tint nx = x, ny = y + 1;\n\t\tif (ny == W) {\n\t\t\tnx += 1;\n\t\t\tny = 0;\n\t\t}\n\t\tint res = -INF;\n\t\tif (A[x][y] != 1 && (y == 0 || v[y - 1] != -1) && v[y] != -1) {\n\t\t\t// place white\n\t\t\tvector<int> nv = v;\n\t\t\tnv[y] = -1;\n\t\t\tif (find(nv.begin(), nv.end(), v[y]) != nv.end()) {\n\t\t\t\tZ[x][y] = '.';\n\t\t\t\tint subres = self(self, nx, ny, nv);\n\t\t\t\tres = max(res, subres);\n\t\t\t}\n\t\t}\n\t\tif (A[x][y] != 0 && (y == 0 || v[y] == -1 || v[y - 1] != v[y])) {\n\t\t\t// place black\n\t\t\tvector<int> nv = v;\n\t\t\tif ((y != 0 && v[y - 1] != -1) && v[y] != -1) {\n\t\t\t\tfor (int i = 0; i < W; i++) {\n\t\t\t\t\tif (v[i] == v[y]) {\n\t\t\t\t\t\tnv[i] = v[y - 1];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if ((y != 0 && v[y - 1] != -1) || v[y] != -1) {\n\t\t\t\tnv[y] = (v[y - 1] != -1 ? v[y - 1] : v[y]);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tnv[y] = W;\n\t\t\t}\n\t\t\tregularize(W, nv);\n\t\t\tZ[x][y] = '#';\n\t\t\tint subres = self(self, nx, ny, nv);\n\t\t\tres = max(res, subres + 1);\n\t\t}\n\t\tdp[x][y][v] = res;\n\t\treturn res;\n\t};\n\tint ans = -1;\n\tfor (int i = 0; i < (1 << W); i++) {\n\t\tvector<int> v(W, -1);\n\t\tint cnt = -1, pre = -2, black = 0;\n\t\tbool flag = true;\n\t\tfor (int j = 0; j < W; j++) {\n\t\t\tif ((i >> j) & 1) {\n\t\t\t\tif (A[0][j] == 0) {\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t\tif (pre != j - 1) {\n\t\t\t\t\tcnt += 1;\n\t\t\t\t}\n\t\t\t\tv[j] = cnt;\n\t\t\t\tpre = j;\n\t\t\t\tZ[0][j] = '#';\n\t\t\t\tblack += 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tZ[0][j] = '.';\n\t\t\t\tif (A[0][j] == 1 || (j >= 1 && v[j - 1] == -1)) {\n\t\t\t\t\tflag = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (flag) {\n\t\t\tint res = calc(calc, 1, 0, v);\n\t\t\tans = max(ans, res + black);\n\t\t}\n\t}\n\treturn ans;\n}\n\nint main() {\n\tint H, W;\n\tcin >> H >> W;\n\tvector<vector<int> > A(H, vector<int>(W, -1));\n\tfor (int i = 0; i < H; i++) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tfor (int j = 0; j < W; j++) {\n\t\t\tif (s[j] == '.') A[i][j] = 0;\n\t\t\tif (s[j] == '#') A[i][j] = 1;\n\t\t}\n\t}\n\tint ans = solve(H, W, A);\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":0.6320754716981132,"time_ms":210,"memory_kb":43976,"score_of_the_acc":-0.5284,"final_rank":13},{"submission_id":"aoj_2314_7124649","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) ll(x.size())\nconst int mod=998244353,MAX=300005,INF=1<<30;\n\n#define int short\n\nint H,W;\n\nvector<int> used;\nvector<vector<int>> conne;\nvector<int> nex;\n\nvector<int> X;\n\nll pat=0;\n\nvoid DFS(int rem){\n if(rem==0){\n pat++;\n used.push_back(nex.back());\n conne.push_back(X);\n return;\n }\n int s=-1;\n for(int j=0;;j++){\n if(rem&(1<<j)){\n s=(1<<j);\n break;\n }\n }\n for(int mask=rem;;mask=(mask-1)&rem){\n if(mask&s){\n int ng=0;\n for(int j=0;j<W;j++){\n if(mask&(1<<j)){\n if(rem&(1<<(j+1))){\n if(!(mask&(1<<(j+1)))) ng++;\n }\n if(j&&(rem&(1<<(j-1)))){\n if(!(mask&(1<<(j-1)))) ng++;\n }\n }\n }\n if(ng<=1){\n X.push_back(mask);\n DFS(rem-mask);\n X.pop_back();\n }\n }\n \n if(mask==0) break;\n }\n}\n\nint dp[12][12][233000];\n\nvector<int> divide[233000];\n\nsigned main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n cin>>H>>W;\n vector<string> S(H);\n for(int i=0;i<H;i++) cin>>S[i];\n \n if(W==1){\n int ans=-1;\n {\n bool ok=true;\n for(int i=0;i<H-1;i++){\n ok&=(S[i][0]!='.');\n }\n ok&=(S[H-1][0]!='#');\n if(ok){\n if(ans<H-1) ans=H-1;\n }//chmax(ans,H-1);\n }\n {\n bool ok=true;\n for(int i=1;i<H;i++){\n ok&=(S[i][0]!='.');\n }\n ok&=(S[0][0]!='#');\n if(ok){\n if(ans<H-1) ans=H-1;\n }//chmax(ans,H-1);\n }\n {\n bool ok=true;\n for(int i=1;i<H-1;i++){\n ok&=(S[i][0]!='.');\n }\n ok&=(S[0][0]!='#');\n ok&=(S[H-1][0]!='#');\n //if(H!=2&&ok) chmax(ans,H-2);\n if(H!=2&&ok){\n if(ans<H-2) ans=H-2;\n }//chmax(ans,H-1);\n }\n {\n bool ok=true;\n for(int i=0;i<H;i++){\n ok&=(S[i][0]!='.');\n }\n if(ok){\n if(ans<H) ans=H;\n }//chmax(ans,H-1);\n }\n \n cout<<ans<<endl;\n \n return 0;\n }\n \n for(int bit=0;bit<(1<<W);bit++){\n //cout<<bit<<endl;\n int ng=0;\n for(int j=0;j+1<W;j++){\n int cn=0;\n if(bit&(1<<j)) cn++;\n if(bit&(1<<(j+1))) cn++;\n if(cn==0) ng++;\n }\n if(ng<=1){\n nex.push_back(bit);\n DFS(bit);\n \n vector<int> Y;\n int j=0;\n while(j<W){\n if(bit&(1<<j)){\n int k=j;\n int mas=0;\n while(bit&(1<<k)){\n mas|=(1<<k);\n k++;\n }\n Y.push_back(mas);\n j=k;\n }else{\n j++;\n }\n }\n \n divide[bit]=Y;\n \n //cout<<bitset<10>(bit)<<endl;\n }\n }\n \n //cout<<si(conne)<<\" \"<<si(used)<<endl;\n //cout<<pat<<endl;\n \n for(ll j=0;j<si(conne);j++){\n sort(all(conne[j]));\n //cout<<bitset<10>(used[j])<<endl;\n }\n \n for(int i=0;i<=H;i++) for(int w=0;w<=W;w++) for(ll j=0;j<si(conne);j++) dp[i][w][j]=-100;\n \n map<vector<int>,ll> MA;\n \n for(ll t=0;t<si(conne);t++){\n MA[conne[t]]=t;\n bool ok=true;\n for(int j=0;j<W;j++){\n if(S[0][j]=='#'){\n if(!(used[t]&(1<<j))) ok=false;\n }\n if(S[0][j]=='.'){\n if(used[t]&(1<<j)) ok=false;\n }\n }\n for(int j=0;j+1<W;j++){\n int cn=0;\n if(!(used[t]&(1<<j))) cn++;\n if(!(used[t]&(1<<(j+1)))) cn++;\n if(cn==2) ok=false;\n }\n if(ok){\n if(divide[used[t]]==conne[t]){\n dp[1][0][t]=__builtin_popcount(used[t]);\n //cout<<bitset<11>(used[t])<<endl;\n }\n }\n }\n \n for(int i=1;i<H;i++){\n for(int j=0;j<W;j++){\n for(ll k=0;k<si(conne);k++){\n if(dp[i][j][k]<0) continue;\n \n int mask=used[k];\n \n if(mask&(1<<j)){\n if(j==0||(!(mask&(1<<(j-1))))){\n if(S[i][j]!='.'){\n if(dp[i][j+1][k]<dp[i][j][k]+1) dp[i][j+1][k]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][k],dp[i][j][k]+1);\n }\n }else{\n bool ok=true;\n for(int a:conne[k]){\n if((a&(1<<(j-1)))&&(a&(1<<j))) ok=false;\n }\n if(ok){\n vector<int> to;\n int ss=0;\n for(int a:conne[k]){\n if(a&(1<<(j-1))){\n ss|=a;\n }else if(a&(1<<j)){\n ss|=a;\n }else{\n to.push_back(a);\n }\n }\n to.push_back(ss);\n sort(all(to));\n if(S[i][j]!='.'){\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\n }\n }\n }\n \n int z=-1;\n for(int a:conne[k]){\n if(a&(1<<j)) z=a;\n }\n int hi=-1;\n for(int l=W-1;l>=0;l--){\n if(z&(1<<l)){\n hi=l;\n break;\n }\n }\n int x=(1<<j)-1;\n \n if((hi!=j)||(z&x)){\n vector<int> to=conne[k];\n for(int &a:to){\n if(a&(1<<j)) a-=(1<<j);\n }\n //cout<<used[k]<<\" \"<<used[MA[to]]<<endl;\n sort(all(to));\n //cout<<used[k]<<\" \"<<used[MA[to]]<<endl;\n if(S[i][j]!='#'&&(j==0||(used[k]&(1<<(j-1))))) chmax(dp[i][j+1][MA[to]],dp[i][j][k]);\n }\n }else{\n if(j==0||(!(mask&(1<<(j-1))))){\n vector<int> to=conne[k];\n to.push_back((1<<j));\n sort(all(to));\n assert(MA.count(to));\n if(S[i][j]!='.'){\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\n }\n assert(MA.count(to));\n //cout<<used[k]<<\" \"<<used[MA[to]]<<endl;\n //for(int a:to) cout<<a<<\" \";\n //cout<<endl;\n }else{\n vector<int> to=conne[k];\n for(int &a:to){\n if(a&(1<<(j-1))) a|=(1<<j);\n }\n sort(all(to));\n if(S[i][j]!='.'){\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\n }\n }\n }\n }\n }\n \n for(ll k=0;k<si(conne);k++) dp[i+1][0][k]=dp[i][W][k];\n }\n \n int ans=-1;\n \n for(ll k=0;k<si(conne);k++){\n if(si(conne[k])==1){\n //for(int a:conne[k]) cout<<a<<\" \";\n //cout<<\" : \";\n //cout<<dp[H][0][k]<<endl;\n chmax(ans,dp[H][0][k]);\n }\n }\n \n cout<<ans<<endl;\n}","accuracy":1,"time_ms":240,"memory_kb":113200,"score_of_the_acc":-1.1741,"final_rank":12},{"submission_id":"aoj_2314_7124645","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) ll(x.size())\nconst int mod=998244353,MAX=300005,INF=1<<30;\n\n#define int short\n\nint H,W;\n\nvector<int> used;\nvector<vector<int>> conne;\nvector<int> nex;\n\nvector<int> X;\n\nll pat=0;\n\nvoid DFS(int rem){\n if(rem==0){\n pat++;\n used.push_back(nex.back());\n conne.push_back(X);\n return;\n }\n int s=-1;\n for(int j=0;;j++){\n if(rem&(1<<j)){\n s=(1<<j);\n break;\n }\n }\n for(int mask=rem;;mask=(mask-1)&rem){\n if(mask&s){\n int ng=0;\n for(int j=0;j<W;j++){\n if(mask&(1<<j)){\n if(rem&(1<<(j+1))){\n if(!(mask&(1<<(j+1)))) ng++;\n }\n if(j&&(rem&(1<<(j-1)))){\n if(!(mask&(1<<(j-1)))) ng++;\n }\n }\n }\n if(ng<=1){\n X.push_back(mask);\n DFS(rem-mask);\n X.pop_back();\n }\n }\n \n if(mask==0) break;\n }\n}\n\nint dp[12][12][233000];\n\nvector<int> divide[233000];\n\nsigned main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n cin>>H>>W;\n vector<string> S(H);\n for(int i=0;i<H;i++) cin>>S[i];\n \n if(W==1){\n int ans=-1;\n {\n bool ok=true;\n for(int i=0;i<H-1;i++){\n ok&=(S[i][0]!='.');\n }\n ok&=(S[H-1][0]!='#');\n if(ok){\n if(ans<H-1) ans=H-1;\n }//chmax(ans,H-1);\n }\n {\n bool ok=true;\n for(int i=1;i<H;i++){\n ok&=(S[i][0]!='.');\n }\n ok&=(S[0][0]!='#');\n if(ok){\n if(ans<H-1) ans=H-1;\n }//chmax(ans,H-1);\n }\n {\n bool ok=true;\n for(int i=1;i<H-1;i++){\n ok&=(S[i][0]!='.');\n }\n ok&=(S[0][0]!='#');\n ok&=(S[H-1][0]!='#');\n //if(H!=2&&ok) chmax(ans,H-2);\n if(H!=2&&ok){\n if(ans<H-2) ans=H-2;\n }//chmax(ans,H-1);\n }\n {\n bool ok=true;\n for(int i=0;i<H;i++){\n ok&=(S[i][0]!='.');\n }\n if(ok){\n if(ans<H) ans=H;\n }//chmax(ans,H-1);\n }\n \n cout<<ans<<endl;\n \n return 0;\n }\n \n for(int bit=0;bit<(1<<W);bit++){\n //cout<<bit<<endl;\n int ng=0;\n for(int j=0;j+1<W;j++){\n int cn=0;\n if(bit&(1<<j)) cn++;\n if(bit&(1<<(j+1))) cn++;\n if(cn==0) ng++;\n }\n if(ng<=1){\n nex.push_back(bit);\n DFS(bit);\n \n vector<int> Y;\n int j=0;\n while(j<W){\n if(bit&(1<<j)){\n int k=j;\n int mas=0;\n while(bit&(1<<k)){\n mas|=(1<<k);\n k++;\n }\n Y.push_back(mas);\n j=k;\n }else{\n j++;\n }\n }\n \n divide[bit]=Y;\n \n //cout<<bitset<10>(bit)<<endl;\n }\n }\n \n //cout<<si(conne)<<\" \"<<si(used)<<endl;\n //cout<<pat<<endl;\n \n for(ll j=0;j<si(conne);j++){\n sort(all(conne[j]));\n //cout<<bitset<10>(used[j])<<endl;\n }\n \n for(int i=0;i<=H;i++) for(int w=0;w<=W;w++) for(ll j=0;j<si(conne);j++) dp[i][w][j]=-100;\n \n map<vector<int>,ll> MA;\n \n for(ll t=0;t<si(conne);t++){\n MA[conne[t]]=t;\n bool ok=true;\n for(int j=0;j<W;j++){\n if(S[0][j]=='#'){\n if(!(used[t]&(1<<j))) ok=false;\n }\n if(S[0][j]=='.'){\n if(used[t]&(1<<j)) ok=false;\n }\n }\n if(ok){\n if(divide[used[t]]==conne[t]){\n dp[1][0][t]=__builtin_popcount(used[t]);\n //cout<<used[t]<<endl;\n }\n }\n }\n \n for(int i=1;i<H;i++){\n for(int j=0;j<W;j++){\n for(ll k=0;k<si(conne);k++){\n if(dp[i][j][k]<0) continue;\n \n int mask=used[k];\n \n if(mask&(1<<j)){\n if(j==0||(!(mask&(1<<(j-1))))){\n if(S[i][j]!='.'){\n if(dp[i][j+1][k]<dp[i][j][k]+1) dp[i][j+1][k]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][k],dp[i][j][k]+1);\n }\n }else{\n bool ok=true;\n for(int a:conne[k]){\n if((a&(1<<(j-1)))&&(a&(1<<j))) ok=false;\n }\n if(ok){\n vector<int> to;\n int ss=0;\n for(int a:conne[k]){\n if(a&(1<<(j-1))){\n ss|=a;\n }else if(a&(1<<j)){\n ss|=a;\n }else{\n to.push_back(a);\n }\n }\n to.push_back(ss);\n sort(all(to));\n if(S[i][j]!='.'){\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\n }\n }\n }\n \n int z=-1;\n for(int a:conne[k]){\n if(a&(1<<j)) z=a;\n }\n int hi=-1;\n for(int l=W-1;l>=0;l--){\n if(z&(1<<l)){\n hi=l;\n break;\n }\n }\n int x=(1<<j)-1;\n \n if((hi!=j)||(z&x)){\n vector<int> to=conne[k];\n for(int &a:to){\n if(a&(1<<j)) a-=(1<<j);\n }\n //cout<<used[k]<<\" \"<<used[MA[to]]<<endl;\n sort(all(to));\n //cout<<used[k]<<\" \"<<used[MA[to]]<<endl;\n if(S[i][j]!='#'&&(j==0||(used[k]&(1<<(j-1))))) chmax(dp[i][j+1][MA[to]],dp[i][j][k]);\n }\n }else{\n if(j==0||(!(mask&(1<<(j-1))))){\n vector<int> to=conne[k];\n to.push_back((1<<j));\n sort(all(to));\n assert(MA.count(to));\n if(S[i][j]!='.'){\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\n }\n assert(MA.count(to));\n //cout<<used[k]<<\" \"<<used[MA[to]]<<endl;\n //for(int a:to) cout<<a<<\" \";\n //cout<<endl;\n }else{\n vector<int> to=conne[k];\n for(int &a:to){\n if(a&(1<<(j-1))) a|=(1<<j);\n }\n sort(all(to));\n if(S[i][j]!='.'){\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\n }\n }\n }\n }\n }\n \n for(ll k=0;k<si(conne);k++) dp[i+1][0][k]=dp[i][W][k];\n }\n \n int ans=-1;\n \n for(ll k=0;k<si(conne);k++){\n if(si(conne[k])==1){\n //for(int a:conne[k]) cout<<a<<\" \";\n //cout<<\" : \";\n //cout<<dp[H][0][k]<<endl;\n chmax(ans,dp[H][0][k]);\n }\n }\n \n cout<<ans<<endl;\n}","accuracy":0.49056603773584906,"time_ms":250,"memory_kb":113052,"score_of_the_acc":-1.1817,"final_rank":15},{"submission_id":"aoj_2314_7124632","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define mp make_pair\n#define si(x) int(x.size())\nconst int mod=998244353,MAX=300005,INF=1<<30;\n\n#define int short\n\nint H,W;\n\nvector<int> used;\nvector<vector<int>> conne;\nvector<int> nex;\n\nvector<int> X;\n\nll pat=0;\n\nvoid DFS(int rem){\n if(rem==0){\n pat++;\n used.push_back(nex.back());\n conne.push_back(X);\n return;\n }\n int s=-1;\n for(int j=0;;j++){\n if(rem&(1<<j)){\n s=(1<<j);\n break;\n }\n }\n for(int mask=rem;;mask=(mask-1)&rem){\n if(mask&s){\n int ng=0;\n for(int j=0;j<W;j++){\n if(mask&(1<<j)){\n if(rem&(1<<(j+1))){\n if(!(mask&(1<<(j+1)))) ng++;\n }\n if(j&&(rem&(1<<(j-1)))){\n if(!(mask&(1<<(j-1)))) ng++;\n }\n }\n }\n if(ng<=1){\n X.push_back(mask);\n DFS(rem-mask);\n X.pop_back();\n }\n }\n \n if(mask==0) break;\n }\n}\n\nint dp[12][12][233000];\n\nvector<int> divide[233000];\n\nsigned main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n cin>>H>>W;\n vector<string> S(H);\n for(int i=0;i<H;i++) cin>>S[i];\n \n if(W==1){\n int ans=-1;\n {\n bool ok=true;\n for(int i=0;i<H-1;i++){\n ok&=(S[i][0]!='.');\n }\n ok&=(S[H-1][0]!='#');\n if(ok){\n if(ans<H-1) ans=H-1;\n }//chmax(ans,H-1);\n }\n {\n bool ok=true;\n for(int i=1;i<H;i++){\n ok&=(S[i][0]!='.');\n }\n ok&=(S[0][0]!='#');\n if(ok){\n if(ans<H-1) ans=H-1;\n }//chmax(ans,H-1);\n }\n {\n bool ok=true;\n for(int i=1;i<H-1;i++){\n ok&=(S[i][0]!='.');\n }\n ok&=(S[0][0]!='#');\n ok&=(S[H-1][0]!='#');\n //if(H!=2&&ok) chmax(ans,H-2);\n if(H!=2&&ok){\n if(ans<H-2) ans=H-2;\n }//chmax(ans,H-1);\n }\n {\n bool ok=true;\n for(int i=0;i<H;i++){\n ok&=(S[i][0]!='.');\n }\n if(ok){\n if(ans<H) ans=H;\n }//chmax(ans,H-1);\n }\n \n cout<<ans<<endl;\n \n return 0;\n }\n \n for(int bit=0;bit<(1<<W);bit++){\n int ng=0;\n for(int j=0;j+1<W;j++){\n int cn=0;\n if(bit&(1<<j)) cn++;\n if(bit&(1<<(j+1))) cn++;\n if(cn==0) ng++;\n }\n if(ng<=1){\n nex.push_back(bit);\n DFS(bit);\n \n vector<int> Y;\n int j=0;\n while(j<W){\n if(bit&(1<<j)){\n int k=j;\n int mas=0;\n while(bit&(1<<k)){\n mas|=(1<<k);\n k++;\n }\n Y.push_back(mas);\n j=k;\n }else{\n j++;\n }\n }\n \n divide[bit]=Y;\n }\n }\n \n //cout<<pat<<endl;\n \n for(int j=0;j<si(conne);j++){\n sort(all(conne[j]));\n }\n \n for(int i=0;i<=H;i++) for(int w=0;w<=W;w++) for(int j=0;j<si(conne);j++) dp[i][w][j]=-100;\n \n map<vector<int>,int> MA;\n \n for(int t=0;t<si(conne);t++){\n MA[conne[t]]=t;\n bool ok=true;\n for(int j=0;j<W;j++){\n if(S[0][j]=='#'){\n if(!(used[t]&(1<<j))) ok=false;\n }\n if(S[0][j]=='.'){\n if(used[t]&(1<<j)) ok=false;\n }\n }\n if(ok){\n if(divide[used[t]]==conne[t]){\n dp[1][0][t]=__builtin_popcount(used[t]);\n }\n }\n }\n \n for(int i=1;i<H;i++){\n for(int j=0;j<W;j++){\n for(int k=0;k<si(conne);k++){\n if(dp[i][j][k]<0) continue;\n \n int mask=used[k];\n \n if(mask&(1<<j)){\n if(j==0||(!(mask&(1<<(j-1))))){\n if(S[i][j]!='.'){\n if(dp[i][j+1][k]<dp[i][j][k]+1) dp[i][j+1][k]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][k],dp[i][j][k]+1);\n }\n }else{\n bool ok=true;\n for(int a:conne[k]){\n if((a&(1<<(j-1)))&&(a&(1<<j))) ok=false;\n }\n if(ok){\n vector<int> to;\n int ss=0;\n for(int a:conne[k]){\n if(a&(1<<(j-1))){\n ss|=a;\n }else if(a&(1<<j)){\n ss|=a;\n }else{\n to.push_back(a);\n }\n }\n to.push_back(ss);\n sort(all(to));\n if(S[i][j]!='.'){\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\n }\n }\n }\n \n int z=-1;\n for(int a:conne[k]){\n if(a&(1<<j)) z=a;\n }\n int hi=-1;\n for(int l=W-1;l>=0;l--){\n if(z&(1<<l)){\n hi=l;\n break;\n }\n }\n int x=(1<<j)-1;\n \n if((hi!=j)||(z&x)){\n vector<int> to=conne[k];\n for(int &a:to){\n if(a&(1<<j)) a-=(1<<j);\n }\n //cout<<used[k]<<\" \"<<used[MA[to]]<<endl;\n sort(all(to));\n //cout<<used[k]<<\" \"<<used[MA[to]]<<endl;\n if(S[i][j]!='#'&&(j==0||(used[k]&(1<<(j-1))))) chmax(dp[i][j+1][MA[to]],dp[i][j][k]);\n }\n }else{\n if(j==0||(!(mask&(1<<(j-1))))){\n vector<int> to=conne[k];\n to.push_back((1<<j));\n sort(all(to));\n assert(MA.count(to));\n if(S[i][j]!='.'){\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\n }\n assert(MA.count(to));\n //cout<<used[k]<<\" \"<<used[MA[to]]<<endl;\n //for(int a:to) cout<<a<<\" \";\n //cout<<endl;\n }else{\n vector<int> to=conne[k];\n for(int &a:to){\n if(a&(1<<(j-1))) a|=(1<<j);\n }\n sort(all(to));\n if(S[i][j]!='.'){\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\n }\n }\n }\n }\n }\n \n for(int k=0;k<si(conne);k++) dp[i+1][0][k]=dp[i][W][k];\n }\n \n int ans=-1;\n \n for(int k=0;k<si(conne);k++){\n if(si(conne[k])==1){\n //for(int a:conne[k]) cout<<a<<\" \";\n //cout<<\" : \";\n //cout<<dp[H][0][k]<<endl;\n chmax(ans,dp[H][0][k]);\n }\n }\n \n cout<<ans<<endl;\n}","accuracy":0.20754716981132076,"time_ms":20,"memory_kb":71476,"score_of_the_acc":-0.6046,"final_rank":18},{"submission_id":"aoj_2314_6002770","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-8;\nconst ld pi = acosl(-1.0);\n\nll mod_pow(ll x, ll n, ll m = mod) {\n\tif (n < 0) {\n\t\tll res = mod_pow(x, -n, m);\n\t\treturn mod_pow(res, m - 2, m);\n\t}\n\tif (abs(x) >= m)x %= m;\n\tif (x < 0)x += m;\n\tll res = 1;\n\twhile (n) {\n\t\tif (n & 1)res = res * x % m;\n\t\tx = x * x % m; n >>= 1;\n\t}\n\treturn res;\n}\nstruct modint {\n\tll n;\n\tmodint() :n(0) { ; }\n\tmodint(ll m) :n(m) {\n\t\tif (n >= mod)n %= mod;\n\t\telse if (n < 0)n = (n % mod + mod) % mod;\n\t}\n\toperator int() { return n; }\n};\nbool operator==(modint a, modint b) { return a.n == b.n; }\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\nmodint operator+(modint a, modint b) { return a += b; }\nmodint operator-(modint a, modint b) { return a -= b; }\nmodint operator*(modint a, modint b) { return a *= b; }\nmodint operator^(modint a, ll n) {\n\tif (n == 0)return modint(1);\n\tmodint res = (a * a) ^ (n / 2);\n\tif (n % 2)res = res * a;\n\treturn res;\n}\n\nll inv(ll a, ll p) {\n\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\n}\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\nconst int max_n = 1 << 2;\nmodint fact[max_n], factinv[max_n];\nvoid init_f() {\n\tfact[0] = modint(1);\n\tfor (int i = 0; i < max_n - 1; i++) {\n\t\tfact[i + 1] = fact[i] * modint(i + 1);\n\t}\n\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\n\tfor (int i = max_n - 2; i >= 0; i--) {\n\t\tfactinv[i] = factinv[i + 1] * modint(i + 1);\n\t}\n}\nmodint comb(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[b] * factinv[a - b];\n}\nmodint combP(int a, int b) {\n\tif (a < 0 || b < 0 || a < b)return 0;\n\treturn fact[a] * factinv[a - b];\n}\n\nvoid solve() {\n\tint h, w; cin >> h >> w;\n\tvector<string> s(h);\n\trep(i, h)cin >> s[i];\n\tif (w == 1) {\n\t\tint ans = -1;\n\t\trep(i, (1 << h)) {\n\t\t\tbool valid = true;\n\t\t\tvector<bool> c(h);\n\t\t\trep(j, h) {\n\t\t\t\tint b = i & (1 << j);\n\t\t\t\tc[j] = b;\n\t\t\t\tif (b && s[j][0] == '.')valid = false;\n\t\t\t\tif (!b && s[j][0] == '#')valid = false;\n\t\t\t}\n\t\t\trep(j, h - 1) {\n\t\t\t\tif (!c[j] && !c[j + 1])valid = false;\n\t\t\t}\n\t\t\trep(j, h)if (c[j]) {\n\t\t\t\twhile (j + 1 < h && c[j + 1])j++;\n\t\t\t\tj++; j++;\n\t\t\t\tfor (; j < h; j++) {\n\t\t\t\t\tif (c[j])valid = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!valid)continue;\n\t\t\tint cnt = 0;\n\t\t\trep(j, h)if (c[j])cnt++;\n\t\t\tans = max(ans, cnt);\n\t\t}\n\t\tcout << ans << \"\\n\";\n\t\treturn;\n\t}\n\tvector<vector<int>> ch(1 << w);\n\trep(j, (1 << w)) {\n\t\trep(i, w)if (j & (1 << i))ch[j].push_back(i);\n\t}\n\tvector<int> trans(w);\n\tvector<int> nv;\n\n\tmap<vector<int>, int> dp;\n\tdp[{}] = 0;\n\trep(i, h)rep(j, w) {\n\t\tmap<vector<int>, int> ndp;\n\t\tfor (auto p : dp) {\n\t\t\tfill(all(trans), -1);\n\t\t\trep(i,p.first.size())for (int c : ch[p.first[i]]) {\n\t\t\t\ttrans[c] = i;\n\t\t\t}\n\t\t\t//white,black\n\t\t\trep(ad, 2) {\n\t\t\t\tif (ad == 0 && s[i][j] == '#')continue;\n\t\t\t\tif (ad == 1 && s[i][j] == '.')continue;\n\t\t\t\tbool valid = true;\n\n\t\t\t\t//white and white\n\t\t\t\tif (ad == 0) {\n\t\t\t\t\tif (i > 0 && trans[j]<0)valid = false;\n\t\t\t\t\tif (j > 0 && trans[j - 1]<0)valid = false;\n\t\t\t\t}\n\t\t\t\t//only one and die\n\t\t\t\tif (ad == 0) {\n\t\t\t\t\tif (trans[j] >= 0) {\n\t\t\t\t\t\tif (p.first[trans[j]] == (1 << j))valid = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t//black cycle\n\t\t\t\tif (ad == 1) {\n\t\t\t\t\tif (i > 0 && j > 0 && trans[j] >= 0 && trans[j - 1] >= 0 && trans[j] == trans[j - 1]) {\n\t\t\t\t\t\tvalid = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (!valid)continue;\n\t\t\t\tnv.clear();\n\t\t\t\tif (ad == 0) {\n\t\t\t\t\tnv = p.first;\n\t\t\t\t\tif (trans[j] >= 0) {\n\t\t\t\t\t\tnv[trans[j]] ^= (1 << j);\n\t\t\t\t\t}\n\t\t\t\t\tsort(all(nv));\n\t\t\t\t\tif (nv.size() && nv[0] == 0)nv.erase(nv.begin());\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tnv = p.first;\n\t\t\t\t\tif (trans[j] < 0 && (j==0||trans[j - 1] < 0)) {\n\t\t\t\t\t\tnv.push_back(1 << j);\n\t\t\t\t\t}\n\t\t\t\t\telse if (trans[j] < 0) {\n\t\t\t\t\t\tnv[trans[j - 1]] |= (1 << j);\n\t\t\t\t\t}\n\t\t\t\t\telse if ((j==0||trans[j - 1] < 0)) {\n\t\t\t\t\t\t//\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tint a = trans[j];\n\t\t\t\t\t\tint b = trans[j - 1];\n\t\t\t\t\t\tnv[a] |= nv[b];\n\t\t\t\t\t\tnv.erase(nv.begin() + b);\n\t\t\t\t\t}\n\t\t\t\t\tsort(all(nv));\n\t\t\t\t}\n\t\t\t\tint val = p.second + ad;\n\t\t\t\tif (ndp.find(nv) != ndp.end()) {\n\t\t\t\t\tndp[nv] = max(ndp[nv], val);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tndp[nv] = val;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tswap(dp, ndp);\n\t}\n\tint ans = -1;\n\tfor (auto p : dp) {\n\t\tif (p.first.size() <= 1)ans = max(ans, p.second);\n\t}\n\tcout << ans << \"\\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\t//while(cin>>n>>q,n)\n\tsolve();\n\treturn 0;\n}","accuracy":1,"time_ms":80,"memory_kb":4224,"score_of_the_acc":-0.057,"final_rank":1},{"submission_id":"aoj_2314_4107018","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//INSERT ABOVE HERE\nstruct UnionFind{\n vector<int> ps;\n UnionFind(int n):ps(n){iota(ps.begin(),ps.end(),0);}\n int find(int x){\n if(ps[x]==x) return x;\n return ps[x]=find(ps[x]);\n }\n int same(int x,int y){\n return find(x)==find(y);\n }\n void unite(int x,int y){\n x=find(x);y=find(y);\n if(x==y) return;\n if(x<y) swap(x,y);\n ps[y]=x;\n }\n};\n\nsigned main(){\n int h,w;\n cin>>h>>w;\n vector<string> st(h);\n for(int i=0;i<h;i++) cin>>st[i];\n\n if(h==1&&w==1){\n if(st[0][0]=='.') cout<<0<<endl;\n else cout<<1<<endl;\n return 0;\n }\n\n if(w==1){\n vector<string> vs(w);\n for(int j=0;j<w;j++){\n vs[j]=string(h,'%');\n for(int i=0;i<h;i++) vs[j][i]=st[i][j];\n }\n swap(h,w);\n st=vs;\n }\n\n vector<int> bs(h,0),ws(h,0);\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n bs[i]|=(st[i][j]=='#')<<j;\n ws[i]|=(st[i][j]=='.')<<j;\n }\n }\n\n int sz=1<<w;\n vector<int> cand;\n for(int bit=0;bit<sz;bit++){\n vector<int> vs(w);\n for(int j=0;j<w;j++)\n vs[j]=(bit>>j)&1;\n int flg=1;\n for(int j=0;j+1<w;j++)\n flg&=vs[j]||vs[j+1];\n if(flg) cand.emplace_back(bit);\n }\n\n map<vector<int>, int> dp;\n for(int bit:cand){\n if(( bit&bs[0])!=bs[0]) continue;\n if((~bit&ws[0])!=ws[0]) continue;\n\n vector<int> vs(w);\n for(int j=0;j<w;j++)\n vs[j]=(bit>>j)&1;\n\n UnionFind uf(w);\n for(int j=0;j+1<w;j++)\n if(vs[j]&&vs[j+1]) uf.unite(j,j+1);\n\n for(int j=0;j<w;j++) uf.find(j);\n vector<int> ps=uf.ps;\n for(int j=0;j<w;j++)\n if(!vs[j]) ps[j]=-1;\n\n dp[ps]=__builtin_popcount(bit);\n }\n\n for(int i=1;i<h;i++){\n map<vector<int>, int> nx;\n for(auto p:dp){\n vector<int> ps=p.first;\n for(int bit:cand){\n if(( bit&bs[i])!=bs[i]) continue;\n if((~bit&ws[i])!=ws[i]) continue;\n\n vector<int> vs(w);\n for(int j=0;j<w;j++)\n vs[j]=(bit>>j)&1;\n\n // cout<<i<<\" \"<<p.second<<\":\"<<bit<<endl;\n int ng=0;\n for(int j=0;j<w;j++)\n if(ps[j]<0&&!vs[j]) ng=1;\n if(ng) continue;\n\n UnionFind uf(w*2);\n for(int j=0;j+1<w;j++)\n if(vs[j]&&vs[j+1]) uf.unite(w+j,w+j+1);\n\n for(int j=0;j<w;j++)\n for(int k=0;k<w;k++)\n if(~ps[j]&&ps[j]==ps[k])\n uf.unite(j,k);\n\n for(int j=0;j<w;j++){\n if(ps[j]<0||!vs[j]) continue;\n if(uf.same(j,w+j)) ng=1;\n uf.unite(j,w+j);\n }\n if(ng) continue;\n\n for(int j=0;j<w*2;j++) uf.find(j);\n vector<int> qs=uf.ps;\n for(int j=0;j<w;j++)\n if(~ps[j]&&qs[j]<w) ng=1;\n if(ng) continue;\n\n vector<int> rs(w);\n for(int j=0;j<w;j++) rs[j]=qs[w+j]-w;\n for(int j=0;j<w;j++) if(!vs[j]) rs[j]=-1;\n nx[rs];\n chmax(nx[rs],p.second+__builtin_popcount(bit));\n }\n }\n swap(dp,nx);\n }\n\n int ans=-1;\n for(auto p:dp){\n vector<int> ps=p.first;\n set<int> ss;\n for(int j=0;j<w;j++)\n if(~ps[j]) ss.emplace(ps[j]);\n if(ss.size()==1)\n chmax(ans,p.second);\n }\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":610,"memory_kb":3840,"score_of_the_acc":-0.5268,"final_rank":10},{"submission_id":"aoj_2314_3697117","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 15\n#define UNDEFINED 0\n#define WHITE 1\n\nstruct Info{\n\tInfo(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tint row,col;\n};\n\nint H,W;\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nint boss[NUM],height[NUM];\nbool check[NUM][NUM],FLG;\nchar table[NUM][NUM];\nmap<ll,int> dp[NUM][NUM];\nvector<Info> G[NUM][NUM];\n\n\n//自分のボスのindexを取得しつつ、経路圧縮を行う関数\nint get_boss(int id){\n\tif(boss[id] == id)return id; //自分が代表なら、自分の値を返す\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]); //代表でないなら、自分が所属する組織の代表を返しつつ、経路圧縮\n\t}\n}\n\nint is_same(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\t//既に同じグループなら何もしない\n\tif(boss_x == boss_y)return;\n\n\t//高さが高い方に吸収する\n\tif(height[x] > height[y]){\n\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[x] < height[y]){\n\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[x] == height[y]\n\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\nll get_code(ll array[NUM]){\n\n\tll ret = 0;\n\n\tfor(int i = 0; i < W; i++){\n\n\t\tret = 10*ret+array[i];\n\t}\n\n\treturn ret;\n}\n\nbool is_ok(ll array[NUM]){\n\n\t//白マスが連続していないか調べる\n\tfor(int col = 0; col < W-1; col++){\n\n\t\tif(array[col] == WHITE && array[col+1] == WHITE){\n\n\t\t\treturn false;\n\t\t}\n\t}\n\n\t//任意の2つの黒セル間には1本だけ経路がある→グループは1つでなければならない\n\tfor(int col = 0; col < W; col++){\n\t\tif(array[col] >= 3){\n\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\nvoid rename(ll array[NUM]){\n\n\tll check[100];\n\n\tfor(int i = 0; i < 100; i++){\n\n\t\tcheck[i] = -1;\n\t}\n\n\tll next_id = 2;\n\n\tfor(int i = 0; i < W; i++){\n\t\tif(array[i] == UNDEFINED || array[i] == WHITE)continue;\n\n\t\tif(check[array[i]] == -1){\n\t\t\tcheck[array[i]] = next_id++;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < W; i++){\n\t\tif(array[i] == UNDEFINED || array[i] == WHITE)continue;\n\t\tarray[i] = check[array[i]];\n\t}\n}\n\nint recursive(int row,int col,ll array[NUM],int last_group){\n\n\tif(row == H){\n\n\t\tif(is_ok(array)){\n\n\t\t\treturn 0;\n\n\t\t}else{\n\n\t\t\treturn -BIG_NUM;\n\t\t}\n\t}\n\n\tll tmp_code = get_code(array);\n\n\tauto at = dp[row][col].find(tmp_code); //dpは、この状態から見て、これから未来に得られる最大値を持つ\n\tif(at != dp[row][col].end()){\n\n\t\treturn dp[row][col][tmp_code];\n\t}\n\n\tint next_row,next_col,next_last_group = last_group;\n\tll next_array[2][NUM];\n\n\t//次のrowとcolを設定\n\tif(col == W-1){\n\n\t\tnext_row = row+1;\n\t\tnext_col = 0;\n\n\t}else{\n\n\t\tnext_row = row;\n\t\tnext_col = col+1;\n\t}\n\n\tfor(int i = 0; i < 2; i++){\n\t\tfor(int a = 0; a < W; a++){\n\t\t\tnext_array[i][a] = array[a];\n\t\t}\n\t}\n\tint ret = -BIG_NUM;\n\n\t//今回のマスを黒にする\n\tif(table[row][col] == '#' || table[row][col] == '?'){\n\n\t\tif(col > 0 && next_array[0][col-1] != WHITE && //左が黒\n\t\t\t\tnext_array[0][col] != WHITE && next_array[0][col] != UNDEFINED && //上が黒\n\t\t\t\tnext_array[0][col-1] == next_array[0][col]){ //左と右が同じグループ\n\n\t\t\t//Do nothing:閉路ができてしまうので黒で塗れない\n\n\t\t}else{\n\n\t\t\tif(col == 0 || next_array[0][col-1] == WHITE){ //左端、または左が白→左方に黒はない\n\n\t\t\t\tswitch(next_array[0][col]){\n\t\t\t\tcase UNDEFINED: //左にも上にも黒はない\n\t\t\t\tcase WHITE:\n\t\t\t\t\tnext_array[0][col] = next_last_group++; //新しいグループを作る\n\t\t\t\t\tbreak;\n\t\t\t\tdefault: //上のマスが黒\n\t\t\t\t\t//Do nothing:上のマスと同じグループにする\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\trename(next_array[0]);\n\n\t\t\t\tret = max(ret,recursive(next_row,next_col,next_array[0],next_last_group)+1);\n\n\t\t\t}else{ //col >= 1 && array[col-1] == BLACK\n\n\t\t\t\tswitch(next_array[0][col]){\n\t\t\t\tcase UNDEFINED:\n\t\t\t\tcase WHITE:\n\t\t\t\t\tnext_array[0][col] = next_array[0][col-1]; //左のgroupと同じにする\n\t\t\t\t\tbreak;\n\t\t\t\tdefault: //上のマスが黒:上のマスと左のマスは異なるグループであるはず\n\n\t\t\t\t\tint new_id = next_array[0][col]; //★今回のマスの番号を新しいIDとして使用★\n\t\t\t\t\tint old_id = next_array[0][col-1];\n\n\t\t\t\t\tfor(int a = 0; a < W; a++){ //同じIDが飛んで存在する場合あり\n\t\t\t\t\t\tif(next_array[0][a] == old_id){\n\n\t\t\t\t\t\t\tnext_array[0][a] = new_id;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\trename(next_array[0]);\n\n\t\t\t\tret = max(ret,recursive(next_row,next_col,next_array[0],next_last_group)+1);\n\n\t\t\t}\n\t\t}\n\t}\n\n\tnext_last_group = last_group;\n\n\t//今回のマスを白にする\n\tif(table[row][col] == '.' || table[row][col] == '?'){\n\n\t\t if(next_array[1][col] == WHITE || (col > 0 && next_array[1][col-1] == WHITE)){ //上か左が白\n\n\t\t\t //Do nothing:白が連続するので不可\n\n\t\t }else{ //上にも左にも白はない\n\n\t\t\t if(next_array[1][col] != UNDEFINED){ //上のマスが黒\n\n\t\t\t\tint count = 0;\n\n\t\t\t\tfor(int a = 0; a < W; a++){\n\t\t\t\t\tif(next_array[1][a] == array[col]){\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(count == 1){\n\t\t\t\t\t//Do nothing:上のマスが孤立するので不可\n\t\t\t\t}else{\n\n\t\t\t\t\t//上のマスが黒で、左に白がない\n\n\t\t\t\t\tnext_array[1][col] = WHITE;\n\n\t\t\t\t\trename(next_array[1]);\n\n\t\t\t\t\tret = max(ret,recursive(next_row,next_col,next_array[1],next_last_group));\n\t\t\t\t}\n\n\t\t\t }else{\n\n\t\t\t\t //上のマスがUNDFINEDで、左に白がない\n\n\t\t\t\t next_array[1][col] = WHITE;\n\n\t\t\t\t rename(next_array[1]);\n\n\t\t\t\t ret = max(ret,recursive(next_row,next_col,next_array[1],next_last_group));\n\t\t\t }\n\t\t }\n\t}\n\n\treturn dp[row][col][tmp_code] = ret;\n}\n\nvoid dfs(int row,int col,int pre_row,int pre_col){\n\n\tif(!FLG)return;\n\n\tint next_row,next_col;\n\n\tfor(int i = 0; i < G[row][col].size(); i++){\n\n\t\tnext_row = G[row][col][i].row;\n\t\tnext_col = G[row][col][i].col;\n\n\t\tif(next_row == pre_row && next_col == pre_col)continue;\n\n\t\tif(check[next_row][next_col]){ //有向に遷移しているので、一度訪れた頂点をまた訪れたら閉路あり\n\n\t\t\tFLG = false;\n\t\t\treturn;\n\t\t}\n\t\tcheck[next_row][next_col] = true;\n\n\t\tdfs(next_row,next_col,row,col);\n\t}\n}\n\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tscanf(\"%s\",table[row]);\n\t}\n\n\t//ややこしいので例外処理\n\tif(H == 1 || W == 1){\n\n\t\tif(H == 1 && W == 1){\n\n\t\t\tswitch(table[0][0]){\n\t\t\tcase '.':\n\t\t\t\tprintf(\"0\\n\");\n\t\t\t\tbreak;\n\t\t\tcase '#':\n\t\t\t\tprintf(\"1\\n\");\n\t\t\t\tbreak;\n\t\t\tcase '?':\n\t\t\t\tprintf(\"1\\n\");\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\treturn 0;\n\n\t\t}else if(H == 1){\n\n\t\t\t//白ますが連続していたら不可\n\t\t\tfor(int col = 0; col < W-1; col++){\n\t\t\t\tif(table[0][col] == '.' && table[0][col+1] == '.'){\n\t\t\t\t\tprintf(\"-1\\n\");\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint ans = 0;\n\n\t\t\t//とりあえず?のところを前部黒にして、連結しているか調べる\n\t\t\tfor(int col = 0; col < W; col++){\n\t\t\t\tif(table[0][col] == '?'){\n\t\t\t\t\ttable[0][col] = '#';\n\t\t\t\t\tans++;\n\t\t\t\t}else if(table[0][col] == '#'){\n\t\t\t\t\tans++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < W; i++){\n\n\t\t\t\tboss[i] = i;\n\t\t\t\theight[i] = 0;\n\t\t\t}\n\n\t\t\tfor(int col = 0; col < W-1; col++){\n\t\t\t\tif(table[0][col] == '#' && table[0][col+1] == '#'){\n\t\t\t\t\tunite(col,col+1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint num_group = 0;\n\n\t\t\tfor(int col = 0; col < W; col++){\n\t\t\t\tif(table[0][col] == '#'){\n\t\t\t\t\tif(get_boss(col) == col){\n\t\t\t\t\t\tnum_group++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(num_group >= 2){\n\n\t\t\t\tprintf(\"-1\\n\");\n\n\t\t\t}else{\n\n\t\t\t\tprintf(\"%d\\n\",ans);\n\t\t\t}\n\n\t\t\treturn 0;\n\n\t\t}else{ //W == 1\n\n\n\t\t\t//白ますが連続していたら不可\n\t\t\tfor(int row = 0; row < H-1; row++){\n\t\t\t\tif(table[row][0] == '.' && table[row+1][0] == '.'){\n\t\t\t\t\tprintf(\"-1\\n\");\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint ans = 0;\n\n\t\t\t//とりあえず?のところを前部黒にして、連結しているか調べる\n\t\t\tfor(int row = 0; row < H; row++){\n\t\t\t\tif(table[row][0] == '?'){\n\t\t\t\t\ttable[row][0] = '#';\n\t\t\t\t\tans++;\n\t\t\t\t}else if(table[row][0] == '#'){\n\t\t\t\t\tans++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < H; i++){\n\n\t\t\t\tboss[i] = i;\n\t\t\t\theight[i] = 0;\n\t\t\t}\n\n\t\t\tfor(int row = 0; row < H-1; row++){\n\t\t\t\tif(table[row][0] == '#' && table[row+1][0] == '#'){\n\t\t\t\t\tunite(row,row+1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint num_group = 0;\n\n\t\t\tfor(int row = 0; row < H; row++){\n\t\t\t\tif(table[row][0] == '#'){\n\t\t\t\t\tif(get_boss(row) == row){\n\t\t\t\t\t\tnum_group++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(num_group >= 2){\n\n\t\t\t\tprintf(\"-1\\n\");\n\n\t\t\t}else{\n\n\t\t\t\tprintf(\"%d\\n\",ans);\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tint adj_row,adj_col;\n\n\t//最初から閉路ができてないか調べる(dfsで調べるため、エッジを作る)\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(table[row][col] != '#')continue;\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\tadj_row = row+diff_row[i];\n\t\t\t\tadj_col = col+diff_col[i];\n\n\t\t\t\tif(rangeCheck(adj_row,adj_col) == false || table[adj_row][adj_col] != '#')continue;\n\n\t\t\t\tG[row][col].push_back(Info(adj_row,adj_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(table[row][col] != '#')continue;\n\n\t\t\tfor(int a = 0; a < H; a++){\n\t\t\t\tfor(int b = 0; b < W; b++){\n\t\t\t\t\tcheck[a][b] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcheck[row][col] = true;\n\t\t\tFLG= true;\n\n\t\t\tdfs(row,col,-1,-1);\n\n\t\t\tif(!FLG){\n\n\t\t\t\tprintf(\"-1\\n\");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tll first_array[NUM];\n\n\tfor(int i = 0; i < W; i++){\n\n\t\tfirst_array[i] = UNDEFINED;\n\t}\n\n\tint ret = recursive(0,0,first_array,2);\n\n\tif(ret < 0){\n\n\t\tprintf(\"-1\\n\");\n\t}else{\n\n\t\tprintf(\"%d\\n\",ret);\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":120,"memory_kb":21092,"score_of_the_acc":-0.2435,"final_rank":6},{"submission_id":"aoj_2314_3696868","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 15\n#define UNDEFINED 0\n#define WHITE 1\n\nstruct Info{\n\tInfo(int arg_row,int arg_col){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t}\n\tint row,col;\n};\n\nint H,W;\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\nint boss[NUM],height[NUM];\nbool check[NUM][NUM],FLG;\nchar table[NUM][NUM];\nmap<ll,int> dp[NUM][NUM];\nvector<Info> G[NUM][NUM];\n\n\n//自分のボスのindexを取得しつつ、経路圧縮を行う関数\nint get_boss(int id){\n\tif(boss[id] == id)return id; //自分が代表なら、自分の値を返す\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]); //代表でないなら、自分が所属する組織の代表を返しつつ、経路圧縮\n\t}\n}\n\nint is_same(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\t//既に同じグループなら何もしない\n\tif(boss_x == boss_y)return;\n\n\t//高さが高い方に吸収する\n\tif(height[x] > height[y]){\n\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[x] < height[y]){\n\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[x] == height[y]\n\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nbool rangeCheck(int row,int col){\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\nll get_code(int array[NUM]){\n\n\tll ret = 0;\n\n\tfor(int i = 0; i < W; i++){\n\n\t\tret = 10*ret+array[i];\n\t}\n\n\treturn ret;\n}\n\nbool is_ok(int array[NUM]){\n\n\t//白マスが連続していないか調べる\n\tfor(int col = 0; col < W-1; col++){\n\n\t\tif(array[col] == WHITE && array[col+1] == WHITE){\n\n\t\t\treturn false;\n\t\t}\n\t}\n\n\treturn true;\n}\n\n\nint recursive(int row,int col,int array[NUM],int last_group){\n\n\tif(row == H){\n\n\t\tif(is_ok(array)){\n\n\t\t\treturn 0;\n\n\t\t}else{\n\n\t\t\treturn -BIG_NUM;\n\t\t}\n\t}\n\n\tll tmp_code = get_code(array);\n\n\tauto at = dp[row][col].find(tmp_code);\n\tif(at != dp[row][col].end()){\n\n\t\treturn dp[row][col][tmp_code];\n\t}\n\n\tint next_row,next_col,next_array[2][NUM],next_last_group = last_group;\n\n\t//次のrowとcolを設定\n\tif(col == W-1){\n\n\t\tnext_row = row+1;\n\t\tnext_col = 0;\n\n\t}else{\n\n\t\tnext_row = row;\n\t\tnext_col = col+1;\n\t}\n\n\tfor(int i = 0; i < 2; i++){\n\t\tfor(int a = 0; a < W; a++){\n\t\t\tnext_array[i][a] = array[a];\n\t\t}\n\t}\n\tint ret = -BIG_NUM;\n\n\t//今回のマスを黒にする\n\tif(table[row][col] == '#' || table[row][col] == '?'){\n\n\t\tif(col > 0 && next_array[0][col-1] != WHITE && //左が黒\n\t\t\t\tnext_array[0][col] != WHITE && next_array[0][col] != UNDEFINED && //上が黒\n\t\t\t\tnext_array[0][col-1] == next_array[0][col]){ //左と右が同じグループ\n\n\t\t\t//Do nothing:閉路ができてしまうので黒で塗れない\n\n\t\t}else{\n\n\t\t\tif(col == 0 || next_array[0][col-1] == WHITE){ //左端、または左が白→左方に黒はない\n\n\t\t\t\tswitch(next_array[0][col]){\n\t\t\t\tcase UNDEFINED: //左にも上にも黒はない\n\t\t\t\tcase WHITE:\n\t\t\t\t\tnext_array[0][col] = next_last_group++; //新しいグループを作る\n\t\t\t\t\tbreak;\n\t\t\t\tdefault: //上のマスが黒\n\t\t\t\t\t//Do nothing:上のマスと同じグループにする\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tret = max(ret,recursive(next_row,next_col,next_array[0],next_last_group)+1);\n\n\t\t\t}else{ //col >= 1 && array[col-1] == BLACK\n\n\t\t\t\tswitch(next_array[0][col]){\n\t\t\t\tcase UNDEFINED:\n\t\t\t\tcase WHITE:\n\t\t\t\t\tnext_array[0][col] = next_array[0][col-1]; //左のgroupと同じにする\n\t\t\t\t\tbreak;\n\t\t\t\tdefault: //上のマスが黒:上のマスと左のマスは異なるグループであるはず\n\n\t\t\t\t\tint new_id = next_array[0][col]; //★今回のマスの番号を新しいIDとして使用★\n\t\t\t\t\tint old_id = next_array[0][col-1];\n\n\t\t\t\t\tfor(int a = 0; a < W; a++){ //同じIDが飛んで存在する場合あり\n\t\t\t\t\t\tif(next_array[0][a] == old_id){\n\n\t\t\t\t\t\t\tnext_array[0][a] = new_id;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tret = max(ret,recursive(next_row,next_col,next_array[0],next_last_group)+1);\n\n\t\t\t}\n\t\t}\n\t}\n\n\tnext_last_group = last_group;\n\n\t//今回のマスを白にする\n\tif(table[row][col] == '.' || table[row][col] == '?'){\n\n\t\t if(next_array[1][col] == WHITE || (col > 0 && next_array[1][col-1] == WHITE)){ //上か左が白\n\n\t\t\t //Do nothing:白が連続するので不可\n\n\t\t }else{ //上にも左にも白はない\n\n\t\t\t if(next_array[1][col] != UNDEFINED){ //上のマスが黒\n\n\t\t\t\tint count = 0;\n\n\t\t\t\tfor(int a = 0; a < W; a++){\n\t\t\t\t\tif(next_array[1][a] == array[col]){\n\t\t\t\t\t\tcount++;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif(count == 1){\n\t\t\t\t\t//Do nothing:上のマスが孤立するので不可\n\t\t\t\t}else{\n\n\t\t\t\t\t//上のマスが黒で、左に白がない\n\n\t\t\t\t\tnext_array[1][col] = WHITE;\n\t\t\t\t\tret = max(ret,recursive(next_row,next_col,next_array[1],next_last_group));\n\t\t\t\t}\n\n\t\t\t }else{\n\n\t\t\t\t //上のマスがUNDFINEDで、左に白がない\n\n\t\t\t\t next_array[1][col] = WHITE;\n\t\t\t\t ret = max(ret,recursive(next_row,next_col,next_array[1],next_last_group));\n\t\t\t }\n\t\t }\n\t}\n\n\treturn dp[row][col][tmp_code] = ret;\n}\n\nvoid dfs(int row,int col,int pre_row,int pre_col){\n\n\tif(!FLG)return;\n\n\tint next_row,next_col;\n\n\tfor(int i = 0; i < G[row][col].size(); i++){\n\n\t\tnext_row = G[row][col][i].row;\n\t\tnext_col = G[row][col][i].col;\n\n\t\tif(next_row == pre_row && next_col == pre_col)continue;\n\n\t\tif(check[next_row][next_col]){ //有向に遷移しているので、一度訪れた頂点をまた訪れたら閉路あり\n\n\t\t\tFLG = false;\n\t\t\treturn;\n\t\t}\n\t\tcheck[next_row][next_col] = true;\n\n\t\tdfs(next_row,next_col,row,col);\n\t}\n}\n\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tscanf(\"%s\",table[row]);\n\t}\n\n\t//ややこしいので例外処理\n\tif(H == 1 || W == 1){\n\n\t\tif(H == 1 && W == 1){\n\n\t\t\tswitch(table[0][0]){\n\t\t\tcase '.':\n\t\t\t\tprintf(\"0\\n\");\n\t\t\t\tbreak;\n\t\t\tcase '#':\n\t\t\t\tprintf(\"1\\n\");\n\t\t\t\tbreak;\n\t\t\tcase '?':\n\t\t\t\tprintf(\"1\\n\");\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\treturn 0;\n\n\t\t}else if(H == 1){\n\n\t\t\t//白ますが連続していたら不可\n\t\t\tfor(int col = 0; col < W-1; col++){\n\t\t\t\tif(table[0][col] == '.' && table[0][col+1] == '.'){\n\t\t\t\t\tprintf(\"-1\\n\");\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint ans = 0;\n\n\t\t\t//とりあえず?のところを前部黒にして、連結しているか調べる\n\t\t\tfor(int col = 0; col < W; col++){\n\t\t\t\tif(table[0][col] == '?'){\n\t\t\t\t\ttable[0][col] = '#';\n\t\t\t\t\tans++;\n\t\t\t\t}else if(table[0][col] == '#'){\n\t\t\t\t\tans++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < W; i++){\n\n\t\t\t\tboss[i] = i;\n\t\t\t\theight[i] = 0;\n\t\t\t}\n\n\t\t\tfor(int col = 0; col < W-1; col++){\n\t\t\t\tif(table[0][col] == '#' && table[0][col+1] == '#'){\n\t\t\t\t\tunite(col,col+1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint num_group = 0;\n\n\t\t\tfor(int col = 0; col < W; col++){\n\t\t\t\tif(table[0][col] == '#'){\n\t\t\t\t\tif(get_boss(col) == col){\n\t\t\t\t\t\tnum_group++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(num_group >= 2){\n\n\t\t\t\tprintf(\"-1\\n\");\n\n\t\t\t}else{\n\n\t\t\t\tprintf(\"%d\\n\",ans);\n\t\t\t}\n\n\t\t\treturn 0;\n\n\t\t}else{ //W == 1\n\n\n\t\t\t//白ますが連続していたら不可\n\t\t\tfor(int row = 0; row < H-1; row++){\n\t\t\t\tif(table[row][0] == '.' && table[row+1][0] == '.'){\n\t\t\t\t\tprintf(\"-1\\n\");\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint ans = 0;\n\n\t\t\t//とりあえず?のところを前部黒にして、連結しているか調べる\n\t\t\tfor(int row = 0; row < H; row++){\n\t\t\t\tif(table[row][0] == '?'){\n\t\t\t\t\ttable[row][0] = '#';\n\t\t\t\t\tans++;\n\t\t\t\t}else if(table[row][0] == '#'){\n\t\t\t\t\tans++;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tfor(int i = 0; i < H; i++){\n\n\t\t\t\tboss[i] = i;\n\t\t\t\theight[i] = 0;\n\t\t\t}\n\n\t\t\tfor(int row = 0; row < H-1; row++){\n\t\t\t\tif(table[row][0] == '#' && table[row+1][0] == '#'){\n\t\t\t\t\tunite(row,row+1);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint num_group = 0;\n\n\t\t\tfor(int row = 0; row < H; row++){\n\t\t\t\tif(table[row][0] == '#'){\n\t\t\t\t\tif(get_boss(row) == row){\n\t\t\t\t\t\tnum_group++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(num_group >= 2){\n\n\t\t\t\tprintf(\"-1\\n\");\n\n\t\t\t}else{\n\n\t\t\t\tprintf(\"%d\\n\",ans);\n\t\t\t}\n\t\t\treturn 0;\n\t\t}\n\t}\n\n\tint adj_row,adj_col;\n\n\t//最初から閉路ができてないか調べる(dfsで調べるため、エッジを作る)\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(table[row][col] != '#')continue;\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\tadj_row = row+diff_row[i];\n\t\t\t\tadj_col = col+diff_col[i];\n\n\t\t\t\tif(rangeCheck(adj_row,adj_col) == false || table[adj_row][adj_col] != '#')continue;\n\n\t\t\t\tG[row][col].push_back(Info(adj_row,adj_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(table[row][col] != '#')continue;\n\n\t\t\tfor(int a = 0; a < H; a++){\n\t\t\t\tfor(int b = 0; b < W; b++){\n\t\t\t\t\tcheck[a][b] = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tcheck[row][col] = true;\n\t\t\tFLG= true;\n\n\t\t\tdfs(row,col,-1,-1);\n\n\t\t\tif(!FLG){\n\n\t\t\t\tprintf(\"-1\\n\");\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t}\n\t}\n\n\tint first_array[NUM];\n\n\tfor(int i = 0; i < W; i++){\n\n\t\tfirst_array[i] = UNDEFINED;\n\t}\n\n\tint ret = recursive(0,0,first_array,2);\n\n\tif(ret < 0){\n\n\t\tprintf(\"-1\\n\");\n\t}else{\n\n\t\tprintf(\"%d\\n\",ret);\n\t}\n\n\treturn 0;\n}","accuracy":0.19811320754716982,"time_ms":1140,"memory_kb":115700,"score_of_the_acc":-2,"final_rank":19},{"submission_id":"aoj_2314_3626649","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\nusing ll = long long;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\nstruct UnionFind{\n vector<int> par;\n UnionFind(int n):par(n,-1){}\n int find(int x){\n if(par[x]<0)return x;\n return par[x]=find(par[x]);\n }\n bool unite(int x,int y){\n x=find(x);\n y=find(y);\n if(x>y)swap(x,y);\n if(x==y)return false;\n else{\n par[x]+=par[y];\n par[y]=x;\n }\n return true;\n }\n\n bool same(int x,int y){\n return find(x)==find(y);\n }\n int size(int x){\n return -par[find(x)];\n }\n};\nint main(){\n int h,w;\n cin>>h>>w;\n string s[h];\n rep(i,h)cin>>s[i];\n map<ll,int> dp[h];\n int all=1<<w;\n rep(i,all){\n int a[w];\n rep(j,w){\n if(s[0][j]=='.')a[j]=0;\n if(s[0][j]=='#')a[j]=1;\n if(s[0][j]=='?')a[j]=(i>>j)&1;\n }\n UnionFind uf(w+1);\n bool ok=true;\n rep(j,w-1){\n if(a[j]&&a[j+1])uf.unite(j,j+1);\n if(!a[j]&&!a[j+1])ok=false;\n }\n if(!ok)continue;\n ll res=0;\n int cnt=0;\n rep(j,w){\n res*=12;\n if(a[j])res+=(uf.find(j)+1),cnt++;\n }\n dp[0][res]=max(dp[0][res],cnt);\n }\n rep(i,h-1){\n rep(mask,all){\n int a[w];\n bool can=true;\n rep(j,w){\n if(s[i+1][j]=='.')a[j]=0;\n if(s[i+1][j]=='#')a[j]=1;\n if(s[i+1][j]=='?')a[j]=(mask>>j)&1;\n }\n rep(j,w-1){\n if(!a[j]&&!a[j+1])can=false;\n }\n if(!can)continue;\n for(auto p : dp[i]){\n int b[w];\n ll cur=p.first;\n rep(j,w){\n b[w-j-1]=12+cur%12;\n cur/=12;\n }\n bool ok=true;\n UnionFind uf(26);\n rep(j,w-1){\n if(a[j]&&a[j+1])uf.unite(j,j+1);\n }\n rep(j,w){\n if(a[j]&&b[j]>12){\n if(!uf.unite(j,b[j]))ok=false;\n }\n if(!a[j]&&b[j]==12)ok=false;\n }\n if(i!=h-2||w!=1)rep(j,w)if(uf.find(b[j])>12)ok=false;\n if(!ok)continue;\n ll res=0;\n int cnt=p.second;\n rep(j,w){\n res*=12;\n if(a[j]){\n res+=(uf.find(j)+1),cnt++;\n }\n }\n dp[i+1][res]=max(dp[i+1][res],cnt);\n }\n }\n }\n int ans=-1;\n for(auto p : dp[h-1]){\n ll cur=p.first;\n bool ok=true;\n set<int> st;\n while(cur){\n if(cur%12)st.insert(cur%12);\n cur/=12;\n }\n if(st.size()==1||st.size()==0)ans=max(ans,p.second);\n }\n\n cout<<ans<<endl;\n \n return 0;\n}","accuracy":1,"time_ms":560,"memory_kb":4444,"score_of_the_acc":-0.4875,"final_rank":8},{"submission_id":"aoj_2314_3626636","code_snippet":"#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<iomanip>\n#include<math.h>\n#include<complex>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<map>\n#include<set>\n#include<bitset>\n#include<functional>\n#include<assert.h>\n#include<numeric>\nusing namespace std;\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\n#define rep(i,n) REP(i,0,n)\nusing ll = long long;\nconst int inf=1e9+7;\nconst ll longinf=1LL<<60 ;\nconst ll mod=1e9+7 ;\n\nstruct UnionFind{\n vector<int> par;\n UnionFind(int n):par(n,-1){}\n int find(int x){\n if(par[x]<0)return x;\n return par[x]=find(par[x]);\n }\n bool unite(int x,int y){\n x=find(x);\n y=find(y);\n if(x>y)swap(x,y);\n if(x==y)return false;\n else{\n par[x]+=par[y];\n par[y]=x;\n }\n return true;\n }\n\n bool same(int x,int y){\n return find(x)==find(y);\n }\n int size(int x){\n return -par[find(x)];\n }\n};\nint main(){\n int h,w;\n cin>>h>>w;\n string s[h];\n rep(i,h)cin>>s[i];\n map<ll,int> dp[h];\n int all=1<<w;\n rep(i,all){\n int a[w];\n rep(j,w){\n if(s[0][j]=='.')a[j]=0;\n if(s[0][j]=='#')a[j]=1;\n if(s[0][j]=='?')a[j]=(i>>j)&1;\n }\n UnionFind uf(w+1);\n bool ok=true;\n rep(j,w-1){\n if(a[j]&&a[j+1])uf.unite(j,j+1);\n if(!a[j]&&!a[j+1])ok=false;\n }\n if(!ok)continue;\n ll res=0;\n int cnt=0;\n rep(j,w){\n res*=12;\n if(a[j])res+=(uf.find(j)+1),cnt++;\n }\n dp[0][res]=max(dp[0][res],cnt);\n }\n rep(i,h-1){\n rep(mask,all){\n int a[w];\n bool can=true;\n rep(j,w){\n if(s[i+1][j]=='.')a[j]=0;\n if(s[i+1][j]=='#')a[j]=1;\n if(s[i+1][j]=='?')a[j]=(mask>>j)&1;\n }\n rep(j,w-1){\n if(!a[j]&&!a[j+1])can=false;\n }\n if(!can)continue;\n for(auto p : dp[i]){\n int b[w];\n ll cur=p.first;\n rep(j,w){\n b[w-j-1]=12+cur%12;\n cur/=12;\n }\n bool ok=true;\n UnionFind uf(26);\n rep(j,w-1){\n if(a[j]&&a[j+1])uf.unite(j,j+1);\n }\n rep(j,w){\n if(a[j]&&b[j]>12){\n if(!uf.unite(j,b[j]))ok=false;\n }\n if(!a[j]&&b[j]==12)ok=false;\n }\n if(i!=h-2)rep(j,w)if(uf.find(b[j])>12)ok=false;\n if(!ok)continue;\n ll res=0;\n int cnt=p.second;\n rep(j,w){\n res*=12;\n if(a[j]){\n res+=(uf.find(j)+1),cnt++;\n }\n }\n dp[i+1][res]=max(dp[i+1][res],cnt);\n }\n }\n }\n int ans=-1;\n for(auto p : dp[h-1])ans=max(ans,p.second);\n cout<<ans<<endl;\n \n return 0;\n}","accuracy":0.4811320754716981,"time_ms":570,"memory_kb":4256,"score_of_the_acc":-0.4948,"final_rank":16},{"submission_id":"aoj_2314_3351555","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nclass UnionFind{\n vector<int> par;\n vector<int> rank;\n public:\n UnionFind(int n):rank(n),par(n){\n iota(par.begin(),par.end(),0);\n }\n int find(int x){\n if(par[x]==x) return x;\n else return par[x]=find(par[x]);\n }\n void unite(int x,int y){\n x=find(x),y=find(y);\n if(rank[x]<rank[y]) par[x]=y;\n else{\n if(rank[x]==rank[y]) rank[x]++;\n par[y]=x;\n }\n }\n bool isSame(int x,int y){\n return find(x)==find(y);\n }\n};\nint main(){\n int h,w;\n cin>>h>>w;\n vector<string> c(h);\n for(int i=0;i<h;i++) cin>>c[i];\n \n vector<int> vec;\n for(int bit=0;bit<(1<<w);bit++){\n bool isok=true;\n for(int i=0;i+1<w;i++){\n isok = isok && (((bit>>i)&1) || ((bit>>(i+1))&1));\n }\n if(isok) vec.push_back(bit);\n }\n auto isValid=[&](int bit,int row){\n bool isok=true;\n for(int i=0;i<w;i++){\n if(c[row][i]=='#'){\n isok= isok && ((bit>>i)&1);\n }\n else if(c[row][i]=='.'){\n isok= isok && (!((bit>>i)&1));\n }\n }\n return isok;\n };\n map<vector<int>,int> dp;\n map<vector<int>,int> dpX;\n for(auto bit:vec){\n if(!isValid(bit,0)) continue;\n vector<int> st(w);\n int idx=1;\n for(int i=0;i<w;i++){\n if((bit>>i)&1){\n for(;i<w;i++){\n if(!((bit>>i)&1)) break;\n st[i]=idx;\n }\n idx++;\n }\n }\n\n dp[st]=__builtin_popcount(bit);\n }\n dpX=dp;\n for(int i=1;i<h;i++){\n if(i+1==h) dpX=dp;\n map<vector<int>,int> next;\n for(auto bit:vec){\n if(!isValid(bit,i)) continue;\n for(auto &e:dp){\n vector<int> st=e.first;\n int cnt=e.second;\n bool isok=true;\n int v=*max_element(st.begin(),st.end());\n vector<int> hasChil(v);\n for(int i=0;i<w;i++){\n isok = isok && !(st[i]==0 && ((bit>>i)&1)==0);\n if(st[i]!=0){\n hasChil[st[i]-1]=true;\n }\n }\n if(accumulate(hasChil.begin(),hasChil.end(),0)!=v) continue;\n UnionFind u(v+w);\n for(int i=0;i<w;i++){\n if(!((bit>>i)&1)) continue;\n if(st[i]!=0){\n if(u.isSame(st[i]-1,v+i)){\n isok=false;\n break; \n }\n u.unite(st[i]-1,v+i);\n }\n if(((bit>>(i+1))&1)){\n u.unite(v+i,v+i+1);\n }\n }\n if(!isok) continue;\n for(int i=0;i<v;i++){\n for(int j=0;j<=w;j++){\n if(j==w){\n isok=false;\n break;\n }\n if(u.isSame(i,v+j)) break;\n }\n }\n if(!isok) continue;\n int idx=1;\n vector<int> to(w);\n \n for(int i=0;i<w;i++){\n if(!((bit>>i)&1)) continue;\n for(int j=0;j<i;j++){\n if(u.isSame(v+i,v+j)){\n to[i]=to[j];\n break;\n }\n }\n if(to[i]==0) to[i]=idx++;\n }\n next[to]=max(next[to],cnt+__builtin_popcount(bit));\n }\n }\n dp=next;\n }\n int res=-1;\n for(int i=0;i<=w;i++){\n if(i==w && w==1){\n for(auto &e:dpX){\n if(*max_element(e.first.begin(),e.first.end())>1) continue;;\n res=max(res,e.second);\n } \n break;\n }\n if(i==w) break;\n if(c[h-1][i]=='#') break;\n }\n \n for(auto &e:dp){\n if(*max_element(e.first.begin(),e.first.end())>1) continue;;\n res=max(res,e.second);\n }\n cout<<res<<endl;\n return 0;\n}","accuracy":1,"time_ms":770,"memory_kb":4096,"score_of_the_acc":-0.6719,"final_rank":11},{"submission_id":"aoj_2314_3351551","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nclass UnionFind{\n vector<int> par;\n vector<int> rank;\n public:\n UnionFind(int n):rank(n),par(n){\n iota(par.begin(),par.end(),0);\n }\n int find(int x){\n if(par[x]==x) return x;\n else return par[x]=find(par[x]);\n }\n void unite(int x,int y){\n x=find(x),y=find(y);\n if(rank[x]<rank[y]) par[x]=y;\n else{\n if(rank[x]==rank[y]) rank[x]++;\n par[y]=x;\n }\n }\n bool isSame(int x,int y){\n return find(x)==find(y);\n }\n};\nint main(){\n int h,w;\n cin>>h>>w;\n vector<string> c(h);\n for(int i=0;i<h;i++) cin>>c[i];\n if(h==2){\n \n }\n vector<int> vec;\n for(int bit=0;bit<(1<<w);bit++){\n bool isok=true;\n for(int i=0;i+1<w;i++){\n isok = isok && (((bit>>i)&1) || ((bit>>(i+1))&1));\n }\n if(isok) vec.push_back(bit);\n }\n auto isValid=[&](int bit,int row){\n bool isok=true;\n for(int i=0;i<w;i++){\n if(c[row][i]=='#'){\n isok= isok && ((bit>>i)&1);\n }\n else if(c[row][i]=='.'){\n isok= isok && (!((bit>>i)&1));\n }\n }\n return isok;\n };\n map<vector<int>,int> dp;\n map<vector<int>,int> dpX;\n for(auto bit:vec){\n if(!isValid(bit,0)) continue;\n vector<int> st(w);\n int idx=1;\n for(int i=0;i<w;i++){\n if((bit>>i)&1){\n for(;i<w;i++){\n if(!((bit>>i)&1)) break;\n st[i]=idx;\n }\n idx++;\n }\n }\n dp[st]=__builtin_popcount(bit);\n }\n for(int i=1;i<h;i++){\n if(i+1==h) dpX=dp;\n map<vector<int>,int> next;\n for(auto bit:vec){\n if(!isValid(bit,i)) continue;\n for(auto &e:dp){\n vector<int> st=e.first;\n int cnt=e.second;\n bool isok=true;\n int v=*max_element(st.begin(),st.end());\n vector<int> hasChil(v);\n for(int i=0;i<w;i++){\n isok = isok && !(st[i]==0 && ((bit>>i)&1)==0);\n if(st[i]!=0){\n hasChil[st[i]-1]=true;\n }\n }\n if(accumulate(hasChil.begin(),hasChil.end(),0)!=v) continue;\n UnionFind u(v+w);\n for(int i=0;i<w;i++){\n if(!((bit>>i)&1)) continue;\n if(st[i]!=0){\n if(u.isSame(st[i]-1,v+i)){\n isok=false;\n break; \n }\n u.unite(st[i]-1,v+i);\n }\n if(((bit>>(i+1))&1)){\n u.unite(v+i,v+i+1);\n }\n }\n if(!isok) continue;\n for(int i=0;i<v;i++){\n for(int j=0;j<=w;j++){\n if(j==w){\n isok=false;\n break;\n }\n if(u.isSame(i,v+j)) break;\n }\n }\n if(!isok) continue;\n int idx=1;\n vector<int> to(w);\n \n for(int i=0;i<w;i++){\n if(!((bit>>i)&1)) continue;\n for(int j=0;j<i;j++){\n if(u.isSame(v+i,v+j)){\n to[i]=to[j];\n break;\n }\n }\n if(to[i]==0) to[i]=idx++;\n }\n next[to]=max(next[to],cnt+__builtin_popcount(bit));\n }\n }\n dp=next;\n }\n int res=-1;\n for(int i=0;i<=w;i++){\n if(i==w && w==1){\n for(auto &e:dpX){\n if(*max_element(e.first.begin(),e.first.end())!=1) continue;;\n res=max(res,e.second);\n } \n break;\n }\n if(c[h-1][i]=='#') break;\n }\n \n for(auto &e:dp){\n if(*max_element(e.first.begin(),e.first.end())!=1) continue;;\n res=max(res,e.second);\n }\n cout<<res<<endl;\n return 0;\n}","accuracy":0.6132075471698113,"time_ms":790,"memory_kb":4080,"score_of_the_acc":-0.6896,"final_rank":14},{"submission_id":"aoj_2314_2897859","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <cstring>\n#include <map>\nusing namespace std;\n\nint H, W;\nchar board[15][15];\nusing Board = map<string, map<int, int> >;\nvoid chmax(int &A, int B) { A = max(A, B); }\n\nstring get_uni(string s, int x, int mode) {\n vector<int> v(10), checked(10); iota(v.begin(), v.end(), 0);\n if(mode == 1) {\n if(x != 0 && isdigit(s[x]) && isdigit(s[x-1])) {\n int a = s[x] - '0', b = s[x-1] - '0';\n v[a] = b;\n }\n else {\n bool exist_num = false;\n if(x != 0 && isdigit(s[x-1])) {\n exist_num = true;\n s[x] = s[x-1];\n }\n if(isdigit(s[x])) {\n exist_num = true;\n }\n\n if(!exist_num) {\n s[x] = '8';\n }\n }\n }\n\n string ret = \"\";\n int id = 0;\n for(int i=0; i<W; i++) {\n if(isdigit(s[i])) {\n int val = v[ s[i] - '0' ];\n if(!checked[val]) checked[val] = ++id;\n ret += (char)('0' + checked[val]);\n }\n else {\n ret += s[i];\n }\n }\n return ret;\n}\n\nbool valid(string s) {\n int pre = -1;\n for(auto c : s) {\n if(isdigit(c)) {\n if(pre == -1) pre = c - '0';\n else if(pre != c - '0') return false;\n }\n }\n return true;\n}\n\nstring to_bin(int N) {\n string ret = \"\";\n for(int i=0; i<W; i++, N>>=1) {\n int c = (N & 1);\n ret += (char)('0' + c);\n }\n return ret;\n}\n\nint main() {\n scanf(\"%d%d\", &H, &W);\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n scanf(\" %c\", &board[i][j]);\n }\n }\n\n string emp_str(W, '.');\n Board cur, nxt;\n cur[emp_str][0] = 0;\n\n for(int pos=0; pos<H*W; pos++) {\n int row = pos / W, col = pos % W;\n char c = board[row][col];\n for(auto x : cur) {\n string uni = x.first;\n for(auto y : cur[uni]) {\n int bit = y.first, pre = y.second;\n int base = bit - ((bit >> col & 1) << col);\n\n // paint (black)\n if(c == '#' || c == '?') {\n if(col == 0 || (uni[col] != uni[col-1] || !isdigit(uni[col]))) {\n string tmp = uni;\n\n tmp = get_uni(tmp, col, 1); \n int nbit = base | (1 << col);\n chmax(nxt[tmp][nbit], pre + 1);\n }\n }\n\n // paint (white)\n if(c == '.' || c == '?') {\n bool ok = true;\n if(row != 0 && !(bit >> col & 1)) ok = false;\n if(col != 0 && !(bit >> (col - 1) & 1)) ok = false;\n\n char target = uni[col];\n int cnt = 0;\n for(int i=0; i<W; i++) cnt += (uni[i] == target);\n if(isdigit(target) && cnt == 1 && W != 1) ok = false;\n\n if(ok) {\n string tmp = uni;\n tmp[col] = '.';\n tmp = get_uni(tmp, col, 0);\n\n int nbit = base;\n chmax(nxt[tmp][nbit], pre);\n }\n }\n }\n }\n cur.clear();\n swap(cur, nxt);\n }\n\n int ans = -1;\n for(auto x : cur) {\n string uni = x.first;\n if(!valid(uni)) continue;\n \n for(auto y : cur[uni]) {\n int val = y.second;\n chmax(ans, val);\n }\n }\n printf(\"%d\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":4188,"score_of_the_acc":-0.2085,"final_rank":2},{"submission_id":"aoj_2314_2897858","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <cstring>\n#include <map>\nusing namespace std;\n\nint H, W;\nchar board[15][15];\nusing Board = map<string, map<int, int> >;\nvoid chmax(int &A, int B) { A = max(A, B); }\n\nstring get_uni(string s, int x, int mode) {\n vector<int> v(10), checked(10); iota(v.begin(), v.end(), 0);\n if(mode == 1) {\n if(x != 0 && isdigit(s[x]) && isdigit(s[x-1])) {\n int a = s[x] - '0', b = s[x-1] - '0';\n v[a] = b;\n }\n else {\n bool exist_num = false;\n if(x != 0 && isdigit(s[x-1])) {\n exist_num = true;\n s[x] = s[x-1];\n }\n if(isdigit(s[x])) {\n exist_num = true;\n }\n\n if(!exist_num) {\n s[x] = '8';\n }\n }\n }\n\n string ret = \"\";\n int id = 0;\n for(int i=0; i<W; i++) {\n if(isdigit(s[i])) {\n int val = v[ s[i] - '0' ];\n if(!checked[val]) checked[val] = ++id;\n ret += (char)('0' + checked[val]);\n }\n else {\n ret += s[i];\n }\n }\n return ret;\n}\n\nbool valid(string s) {\n int pre = -1;\n for(auto c : s) {\n if(isdigit(c)) {\n if(pre == -1) pre = c - '0';\n else if(pre != c - '0') return false;\n }\n }\n return true;\n}\n\nstring to_bin(int N) {\n string ret = \"\";\n for(int i=0; i<W; i++, N>>=1) {\n int c = (N & 1);\n ret += (char)('0' + c);\n }\n return ret;\n}\n\nint main() {\n scanf(\"%d%d\", &H, &W);\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n scanf(\" %c\", &board[i][j]);\n }\n }\n\n string emp_str(W, '.');\n Board cur, nxt;\n cur[emp_str][0] = 0;\n\n for(int pos=0; pos<H*W; pos++) {\n int row = pos / W, col = pos % W;\n char c = board[row][col];\n for(auto x : cur) {\n string uni = x.first;\n for(auto y : cur[uni]) {\n int bit = y.first, pre = y.second;\n // printf(\"row = %d, col = %d, dp[%s][%s] = %d\\n\", row+1, col+1, uni.c_str(), to_bin(bit).c_str(), pre);\n\n int base = bit - ((bit >> col & 1) << col);\n\n // paint (black)\n if(c == '#' || c == '?') {\n // printf(\"cond 1: row = %d, col = %d\\n\", row+1, col+1);\n if(col == 0 || (uni[col] != uni[col-1] || !isdigit(uni[col]))) {\n string tmp = uni;\n\n // printf(\"tmp = %s, \", tmp.c_str());\n tmp = get_uni(tmp, col, 1);\n // printf(\"nxt = %s\\n\", tmp.c_str());\n \n int nbit = base | (1 << col);\n chmax(nxt[tmp][nbit], pre + 1);\n }\n }\n\n // paint (white)\n if(c == '.' || c == '?') {\n // printf(\"cond 2: row = %d, col = %d\\n\", row+1, col+1);\n\n bool ok = true;\n if(row != 0 && !(bit >> col & 1)) ok = false;\n if(col != 0 && !(bit >> (col - 1) & 1)) ok = false;\n\n char target = uni[col];\n int cnt = 0;\n for(int i=0; i<W; i++) cnt += (uni[i] == target);\n if(isdigit(target) && cnt == 1 && W != 1) ok = false;\n\n if(ok) {\n string tmp = uni;\n tmp[col] = '.';\n tmp = get_uni(tmp, col, 0);\n\n int nbit = base;\n chmax(nxt[tmp][nbit], pre);\n }\n }\n }\n }\n cur.clear();\n swap(cur, nxt);\n }\n\n int ans = -1;\n for(auto x : cur) {\n string uni = x.first;\n if(!valid(uni)) continue;\n \n for(auto y : cur[uni]) {\n int val = y.second;\n chmax(ans, val);\n }\n }\n printf(\"%d\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":4200,"score_of_the_acc":-0.2086,"final_rank":3},{"submission_id":"aoj_2314_2897385","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\n\nint H, W;\nchar board[15][15];\nint dp[2][180000][51];\n\nvoid chmax(int &A, int B) {\n A = max(A, B);\n}\n\nint B;\nint merge(int A, int i) {\n while(A >= B) A -= B;\n \n int b = A % 3;\n A = A - (A % 3);\n if(b == 1 && i != 0) {\n b = i = 2;\n }\n A = (A + b) * 3 + i;\n return A;\n}\nint get_head(int A) {\n return A / B;\n}\nint get_tail(int A) {\n return A % 3;\n}\nvoid thr_eval(int val, int &cnt_black, int &cnt_white, int &cnt_adj_b) {\n if(val == 0) {\n cnt_white++;\n }\n if(val == 1) {\n cnt_black++;\n }\n if(val == 2) {\n cnt_black++;\n cnt_adj_b++;\n }\n}\n\nint main() {\n scanf(\"%d%d\", &H, &W);\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n scanf(\" %c\", &board[i][j]);\n }\n }\n\n int P = H*W, Q = 50;\n B = 1;\n for(int i=0; i<W-1; i++) B *= 3;\n\n memset(dp, -1, sizeof(dp));\n dp[0][0][0] = 0;\n for(int pos=0; pos<P; pos++) {\n int row = pos / W, col = pos % W;\n int cur = pos % 2, nxt = 1 - cur;\n for(int bit=0; bit<(3*B); bit++) {\n for(int diff=0; diff<Q; diff++) {\n if(dp[cur][bit][diff] < 0) continue;\n\n int val = dp[cur][bit][diff];\n\n int cnt_black = 0, cnt_white = 0, cnt_adj_b = 0;\n // 真上\n if(row != 0) {\n int val = get_head(bit);\n thr_eval(val, cnt_black, cnt_white, cnt_adj_b);\n }\n // 左隣\n if(col != 0) {\n int val = get_tail(bit);\n thr_eval(val, cnt_black, cnt_white, cnt_adj_b);\n }\n\n char c = board[row][col];\n if(c == '#' || c == '?') {\n int n_diff = diff + 1 - cnt_black;\n int n_self = (cnt_black ? 2 : 1);\n if(n_diff > 0) {\n int nbit = merge(bit, n_self);\n chmax(dp[nxt][nbit][n_diff], val + 1);\n // printf(\"dp[%d][%d][%d] = %d\\n\", nxt, nbit, n_diff, val + 1);\n }\n }\n if(c == '.' || c == '?') {\n if(row != 0) {\n if(get_head(bit) == 1 && val != 1) continue;\n }\n if(row == H-1 && col != 0) {\n if(get_tail(bit) == 1 && val != 1) continue;\n }\n\n if(cnt_white == 0) {\n int nbit = merge(bit, 0);\n chmax(dp[nxt][nbit][diff], val);\n // printf(\"dp[%d][%d][%d] = %d\\n\", nxt, nbit, diff, val);\n }\n }\n\n dp[cur][bit][diff] = -1;\n }\n }\n }\n\n int ans = -1;\n for(int bit=0; bit<3*B; bit++) {\n if(dp[P%2][bit][1] < 0) continue;\n chmax(ans, dp[P%2][bit][1]);\n }\n printf(\"%d\\n\", ans);\n return 0;\n}","accuracy":0.2169811320754717,"time_ms":680,"memory_kb":74476,"score_of_the_acc":-1.2208,"final_rank":17},{"submission_id":"aoj_2314_2897381","code_snippet":"#include <cstdio>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\n\nint H, W;\nchar board[15][15];\nint dp[2][180000][51];\n\nvoid chmax(int &A, int B) {\n A = max(A, B);\n}\n\nint B;\nint merge(int A, int i) {\n while(A >= B) A -= B;\n \n int b = A % 3;\n A = A - (A % 3);\n if(b == 1 && i != 0) {\n b = i = 2;\n }\n A = (A + b) * 3 + i;\n return A;\n}\nint get_head(int A) {\n return A / B;\n}\nint get_tail(int A) {\n return A % 3;\n}\nvoid thr_eval(int val, int &cnt_black, int &cnt_white, int &cnt_adj_b) {\n if(val == 0) {\n cnt_white++;\n }\n if(val == 1) {\n cnt_black++;\n }\n if(val == 2) {\n cnt_black++;\n cnt_adj_b++;\n }\n}\n\nint main() {\n scanf(\"%d%d\", &H, &W);\n for(int i=0; i<H; i++) {\n for(int j=0; j<W; j++) {\n scanf(\" %c\", &board[i][j]);\n }\n }\n\n int P = H*W, Q = 50;\n B = 1;\n for(int i=0; i<W-1; i++) B *= 3;\n\n memset(dp, -1, sizeof(dp));\n dp[0][0][0] = 0;\n for(int pos=0; pos<P; pos++) {\n int row = pos / W, col = pos % W;\n int cur = pos % 2, nxt = 1 - cur;\n for(int bit=0; bit<(3*B); bit++) {\n for(int diff=0; diff<Q; diff++) {\n if(dp[cur][bit][diff] < 0) continue;\n\n int val = dp[cur][bit][diff];\n\n int cnt_black = 0, cnt_white = 0, cnt_adj_b = 0;\n // 真上\n if(row != 0) {\n int val = get_head(bit);\n thr_eval(val, cnt_black, cnt_white, cnt_adj_b);\n }\n // 左隣\n if(col != 0) {\n int val = get_tail(bit);\n thr_eval(val, cnt_black, cnt_white, cnt_adj_b);\n }\n\n char c = board[row][col];\n if(c == '#' || c == '?') {\n int n_diff = diff + 1 - cnt_black;\n int n_self = (cnt_black ? 2 : 1);\n if(n_diff > 0) {\n int nbit = merge(bit, n_self);\n chmax(dp[nxt][nbit][n_diff], val + 1);\n }\n }\n if(c == '.' || c == '?') {\n if(row != 0) {\n if(get_head(bit) == 1) continue;\n }\n if(row == H-1 && col != 0) {\n if(get_tail(bit) == 1) continue;\n }\n\n if(cnt_white == 0) {\n int nbit = merge(bit, 0);\n chmax(dp[nxt][nbit][diff], val);\n }\n }\n\n dp[cur][bit][diff] = -1;\n }\n }\n }\n\n int ans = -1;\n for(int bit=0; bit<3*B; bit++) {\n if(dp[P%2][bit][1] < 0) continue;\n chmax(ans, dp[P%2][bit][1]);\n }\n printf(\"%d\\n\", ans);\n return 0;\n}","accuracy":0.05660377358490566,"time_ms":20,"memory_kb":74476,"score_of_the_acc":-0.6315,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_2314_10712143\",\n \"code_snippet\": \"// AOJ #2314 Scribbling witch\\n// 2025.5.30\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int MAX = 11;\\n\\nint h, w;\\nchar B[MAX][MAX+1];\\nmap<ll,int> memo[MAX][MAX];\\nchar mapto[16];\\nint nxt(ll, int, int, char);\\n\\ninline int Get(ll s, int i) {\\n int v = (s >> (i*4)) & 0xF;\\n return (v<<28)>>28;\\n}\\ninline void Set(ll &s, int v, int i) {\\n s &= ~((ll)0xF << (i*4));\\n s |= (ll)(v&0xF) << (i*4);\\n}\\n\\nint calc(ll st, int x, int y) {\\n if (x==w) return calc(st, 0, y+1);\\n if (y==h) {\\n for(int i=0;i<w;i++) if (Get(st,i)>0) return -1;\\n return 0;\\n }\\n auto &mp = memo[y][x];\\n if (mp.count(st)) return mp[st];\\n\\n int ans = -1;\\n char c0 = B[y][x];\\n if (c0=='#' || c0=='?') ans = max(ans, nxt(st, x, y, '#'));\\n if (c0=='.' || c0=='?') ans = max(ans, nxt(st, x, y, '.'));\\n return mp[st] = ans;\\n}\\n\\n\\nint nxt(ll st, int x, int y, char c) {\\n int pc = Get(st,x);\\n int lc = x>0 ? Get(st,x-1) : -1;\\n int add = 0;\\n if (c=='#') {\\n add = 1;\\n if (lc>=0 && lc==pc) return -1;\\n if (lc>=0) {\\n Set(st, lc, x);\\n if (pc>=0) {\\n for(int i=0;i<w;i++) if (Get(st,i)==pc) Set(st, lc, i);\\n }\\n } else if (pc==-1) Set(st, 7, x);\\n else Set(st, pc, x);\\n } else {\\n if ((y>0 && pc==-1) || (x>0 && lc==-1)) return -1;\\n Set(st, -1, x);\\n if (pc!=-1) {\\n bool ok=false;\\n for(int i=0;i<w;i++) if (Get(st,i)==pc){ ok=true; break; }\\n if (!ok) return -1;\\n }\\n }\\n memset(mapto, -1, sizeof(mapto));\\n int mcnt=0;\\n for(int i=0;i<w;i++){\\n int v = Get(st,i);\\n if (v!=-1) {\\n if (mapto[v]==-1) mapto[v]=mcnt++;\\n Set(st, mapto[v], i);\\n }\\n }\\n int sub = calc(st, x+1, y);\\n return sub<0 ? -1 : sub+add;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n cin >> h >> w;\\n for(int y=0;y<h;y++) cin >> B[y];\\n if (w==1) {\\n if (h==1) {\\n cout << (B[0][0]=='.' ? 0 : 1) << endl;\\n return 0;\\n }\\n int ans = -1;\\n for(int L=0;L<=1;L++){\\n for(int R=max(L,h-2); R<=h-1; R++){\\n if (L>R) continue;\\n bool ok = true;\\n for(int i=L;i<=R;i++){\\n if (B[i][0]=='.') ok=false;\\n }\\n for(int i=0;i<L;i++){\\n if (B[i][0]=='#') ok=false;\\n }\\n for(int i=R+1;i<h;i++){\\n if (B[i][0]=='#') ok=false;\\n }\\n if (!ok) continue;\\n ans = max(ans, R-L+1);\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n }\\n for(int y=0;y<h;y++){\\n for(int x=0;x<w;x++){\\n memo[y][x].clear();\\n }\\n }\\n int ans = calc(-1LL, 0, 0);\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 21376,\n \"score_of_the_acc\": -0.2193,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2314_10543179\",\n \"code_snippet\": \"// AOJ #2314 Scribbling witch\\n// 2025.5.30\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nconst int MAX = 11;\\n\\nint h, w;\\nchar B[MAX][MAX+1];\\nmap<ll,int> memo[MAX][MAX];\\nchar mapto[16];\\nint nxt(ll, int, int, char);\\n\\ninline int Get(ll s, int i) {\\n int v = (s >> (i*4)) & 0xF;\\n return (v<<28)>>28;\\n}\\ninline void Set(ll &s, int v, int i) {\\n s &= ~((ll)0xF << (i*4));\\n s |= (ll)(v&0xF) << (i*4);\\n}\\n\\nint calc(ll st, int x, int y) {\\n if (x==w) return calc(st, 0, y+1);\\n if (y==h) {\\n for(int i=0;i<w;i++) if (Get(st,i)>0) return -1;\\n return 0;\\n }\\n auto &mp = memo[y][x];\\n if (mp.count(st)) return mp[st];\\n\\n int ans = -1;\\n char c0 = B[y][x];\\n if (c0=='#' || c0=='?') ans = max(ans, nxt(st, x, y, '#'));\\n if (c0=='.' || c0=='?') ans = max(ans, nxt(st, x, y, '.'));\\n return mp[st] = ans;\\n}\\n\\n\\nint nxt(ll st, int x, int y, char c) {\\n int pc = Get(st,x);\\n int lc = x>0 ? Get(st,x-1) : -1;\\n int add = 0;\\n if (c=='#') {\\n add = 1;\\n if (lc>=0 && lc==pc) return -1;\\n if (lc>=0) {\\n Set(st, lc, x);\\n if (pc>=0) {\\n for(int i=0;i<w;i++) if (Get(st,i)==pc) Set(st, lc, i);\\n }\\n } else if (pc==-1) Set(st, 7, x);\\n else Set(st, pc, x);\\n } else {\\n if ((y>0 && pc==-1) || (x>0 && lc==-1)) return -1;\\n Set(st, -1, x);\\n if (pc!=-1) {\\n bool ok=false;\\n for(int i=0;i<w;i++) if (Get(st,i)==pc){ ok=true; break; }\\n if (!ok) return -1;\\n }\\n }\\n memset(mapto, -1, sizeof(mapto));\\n int mcnt=0;\\n for(int i=0;i<w;i++){\\n int v = Get(st,i);\\n if (v!=-1) {\\n if (mapto[v]==-1) mapto[v]=mcnt++;\\n Set(st, mapto[v], i);\\n }\\n }\\n int sub = calc(st, x+1, y);\\n return sub<0 ? -1 : sub+add;\\n}\\n\\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n\\n cin >> h >> w;\\n for(int y=0;y<h;y++) cin >> B[y];\\n if (w==1) {\\n if (h==1) {\\n cout << (B[0][0]=='.' ? 0 : 1) << endl;\\n return 0;\\n }\\n int ans = -1;\\n for(int L=0;L<=1;L++){\\n for(int R=max(L,h-2); R<=h-1; R++){\\n if (L>R) continue;\\n bool ok = true;\\n for(int i=L;i<=R;i++){\\n if (B[i][0]=='.') ok=false;\\n }\\n for(int i=0;i<L;i++){\\n if (B[i][0]=='#') ok=false;\\n }\\n for(int i=R+1;i<h;i++){\\n if (B[i][0]=='#') ok=false;\\n }\\n if (!ok) continue;\\n ans = max(ans, R-L+1);\\n }\\n }\\n cout << ans << endl;\\n return 0;\\n }\\n for(int y=0;y<h;y++){\\n for(int x=0;x<w;x++){\\n memo[y][x].clear();\\n }\\n }\\n int ans = calc(-1LL, 0, 0);\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 21292,\n \"score_of_the_acc\": -0.2185,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2314_9166708\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n\\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\\nll myRand(ll B) {\\n return (ull)rng() % B;\\n}\\ninline double time() {\\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int h,w; cin >> h >> w;\\n vector<string> s(h);\\n for (int i = 0; i < h; ++i) {\\n cin >> s[i];\\n }\\n map<vector<int>, int> dp;\\n // そもそもw=1は除いておいた方が連結性確認の面で楽？\\n if (w == 1) {\\n for (int i = 1; i+1 < h; ++i) {\\n if (s[i][0] == '.') {\\n cout << -1 << endl;\\n return 0;\\n }\\n }\\n set<int> st;\\n if (s[0][0] == '.') st.insert(0);\\n if (s.back()[0] == '.') st.insert(h-1);\\n cout << h - st.size() << endl;\\n return 0;\\n }\\n {\\n // 1列目の置き方を列挙する\\n vector<int> v(w);\\n auto dfs = [&](auto dfs, int i, int id, int cnt) -> void {\\n if (i == w) {\\n dp[v] = cnt;\\n return;\\n }\\n if (v[i-1] == 0) {\\n if (s[0][i] == '.') return;\\n v[i] = id + 1;\\n dfs(dfs, i+1, id+1, cnt+1);\\n }\\n else {\\n v[i] = 0;\\n if (s[0][i] != '#') dfs(dfs, i+1, id, cnt);\\n v[i] = id;\\n if (s[0][i] != '.') dfs(dfs, i+1, id, cnt+1);\\n }\\n };\\n v[0] = 1;\\n if (s[0][0] != '.') dfs(dfs, 1, 1, 1);\\n v[0] = 0;\\n if (s[0][0] != '#') dfs(dfs, 1, 0, 0);\\n }\\n for (int i = 1; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n map<vector<int>, int> ndp;\\n bool B = (s[i][j] != '.');\\n bool W = (s[i][j] != '#');\\n if (B) {\\n for (auto &pp : dp) {\\n auto p = pp.first;\\n // ループを作ってはいけない\\n if (j and p[j-1] and p[j-1] == p[j]) continue;\\n // 接する面が白のみの場合、新規連結成分\\n if (p[j] == 0 and (j == 0 or p[j-1] == 0)) {\\n int mx = 0;\\n for (int k = 0; k < w; ++k) {\\n mx = max(mx, p[k]);\\n }\\n p[j] = mx+1;\\n ndp[p] = max(ndp[p], pp.second+1);\\n } else {\\n if (j == 0 or p[j-1] == 0) {\\n // そのまま\\n ndp[p] = max(ndp[p], pp.second+1);\\n } else if (p[j] == 0) {\\n p[j] = p[j-1];\\n ndp[p] = max(ndp[p], pp.second+1);\\n } else {\\n int a = p[j], b = p[j-1];\\n if (a > b) swap(a, b);\\n // 2つをマージする\\n p[j] = a;\\n for (int k = 0; k < w; ++k) {\\n if (p[k] == b) p[k] = a;\\n else if (p[k] > b) p[k] -= 1;\\n }\\n ndp[p] = max(ndp[p], pp.second+1);\\n }\\n }\\n }\\n }\\n if (W) {\\n for (auto &pp : dp) {\\n auto p = pp.first;\\n // 白は連結してはいけない\\n if (p[j] == 0 or (j and p[j-1] == 0)) continue;\\n // 白によって連結成分が孤立してしまってもダメ\\n int cnt = 0;\\n for (int k = 0; k < w; ++k) {\\n cnt += (p[j] == p[k]);\\n }\\n if (cnt != 1) {\\n p[j] = 0;\\n ndp[p] = max(ndp[p], pp.second);\\n }\\n }\\n }\\n swap(dp, ndp);\\n\\n// cout << i << \\\" \\\" << j << endl;\\n// for (auto &pp : dp) {\\n// auto p = pp.first;\\n// for (int k : p) {\\n// cout << k << \\\" \\\";\\n// }\\n// cout << endl;\\n// }\\n }\\n }\\n int res = -1;\\n for (auto &pp : dp) {\\n auto p = pp.first;\\n bool ok = true;\\n for (int i = 0; i < w; ++i) {\\n if (p[i] > 1) ok = false;\\n }\\n if (ok) res = max(res, pp.second);\\n }\\n cout << res << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 320,\n \"memory_kb\": 6100,\n \"score_of_the_acc\": -0.2881,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2314_8402578\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstring to_string(const vector<int>& arr) {\\n\\tstring res = \\\"[\\\";\\n\\tfor (int i = 0; i < int(arr.size()); i++) {\\n\\t\\tif (i != 0) {\\n\\t\\t\\tres += \\\", \\\";\\n\\t\\t}\\n\\t\\tres += to_string(arr[i]);\\n\\t}\\n\\tres += \\\"]\\\";\\n\\treturn res;\\n}\\n\\nvoid regularize(int n, vector<int>& v) {\\n\\tint cnt = 0;\\n\\tvector<int> tbl(n + 1, -1);\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tif (v[i] != -1 && tbl[v[i]] == -1) {\\n\\t\\t\\ttbl[v[i]] = cnt++;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tif (v[i] != -1) {\\n\\t\\t\\tv[i] = tbl[v[i]];\\n\\t\\t}\\n\\t}\\n}\\n\\nint solve_one(int N, const vector<int>& X) {\\n\\tif (N == 1) {\\n\\t\\treturn (X[0] != 0);\\n\\t}\\n\\tif (N == 2) {\\n\\t\\tint res = (X[0] != 0) + (X[1] != 0);\\n\\t\\treturn (res >= 1 ? res : -1);\\n\\t}\\n\\tfor (int i = 1; i < N - 1; i++) {\\n\\t\\tif (X[i] == 0) {\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t}\\n\\treturn (N - 2) + (X[0] != 0) + (X[N - 1] != 0);\\n}\\n\\nint solve(int H, int W, const vector<vector<int> >& A) {\\n\\tif (H < W) {\\n\\t\\tvector<vector<int> > B(W, vector<int>(H));\\n\\t\\tfor (int i = 0; i < H; i++) {\\n\\t\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\t\\tB[j][i] = A[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn solve(W, H, B);\\n\\t}\\n\\tif (W == 1) {\\n\\t\\tvector<int> X(H);\\n\\t\\tfor (int i = 0; i < H; i++) {\\n\\t\\t\\tX[i] = A[i][0];\\n\\t\\t}\\n\\t\\treturn solve_one(H, X);\\n\\t}\\n\\tconst int INF = 1012345678;\\n\\tvector<vector<map<vector<int>, int> > > dp(H, vector<map<vector<int>, int> >(W));\\n\\tvector<string> Z(H, string(W, '?'));\\n\\tauto calc = [&](auto& self, int x, int y, const vector<int>& v) -> int {\\n\\t\\tif (x == H && y == 0) {\\n\\t\\t\\tif (*max_element(v.begin(), v.end()) >= 1) {\\n\\t\\t\\t\\treturn -INF;\\n\\t\\t\\t}\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tif (dp[x][y].find(v) != dp[x][y].end()) {\\n\\t\\t\\treturn dp[x][y][v];\\n\\t\\t}\\n\\t\\tint nx = x, ny = y + 1;\\n\\t\\tif (ny == W) {\\n\\t\\t\\tnx += 1;\\n\\t\\t\\tny = 0;\\n\\t\\t}\\n\\t\\tint res = -INF;\\n\\t\\tif (A[x][y] != 1 && (y == 0 || v[y - 1] != -1) && v[y] != -1) {\\n\\t\\t\\t// place white\\n\\t\\t\\tvector<int> nv = v;\\n\\t\\t\\tnv[y] = -1;\\n\\t\\t\\tif (find(nv.begin(), nv.end(), v[y]) != nv.end()) {\\n\\t\\t\\t\\tZ[x][y] = '.';\\n\\t\\t\\t\\tint subres = self(self, nx, ny, nv);\\n\\t\\t\\t\\tres = max(res, subres);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (A[x][y] != 0 && (y == 0 || v[y] == -1 || v[y - 1] != v[y])) {\\n\\t\\t\\t// place black\\n\\t\\t\\tvector<int> nv = v;\\n\\t\\t\\tif ((y != 0 && v[y - 1] != -1) && v[y] != -1) {\\n\\t\\t\\t\\tfor (int i = 0; i < W; i++) {\\n\\t\\t\\t\\t\\tif (v[i] == v[y]) {\\n\\t\\t\\t\\t\\t\\tnv[i] = v[y - 1];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if ((y != 0 && v[y - 1] != -1) || v[y] != -1) {\\n\\t\\t\\t\\tnv[y] = (v[y - 1] != -1 ? v[y - 1] : v[y]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tnv[y] = W;\\n\\t\\t\\t}\\n\\t\\t\\tregularize(W, nv);\\n\\t\\t\\tZ[x][y] = '#';\\n\\t\\t\\tint subres = self(self, nx, ny, nv);\\n\\t\\t\\tres = max(res, subres + 1);\\n\\t\\t}\\n\\t\\tdp[x][y][v] = res;\\n\\t\\treturn res;\\n\\t};\\n\\tint ans = -1;\\n\\tfor (int i = 0; i < (1 << W); i++) {\\n\\t\\tvector<int> v(W, -1);\\n\\t\\tint cnt = -1, pre = -2, black = 0;\\n\\t\\tbool flag = true;\\n\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\tif ((i >> j) & 1) {\\n\\t\\t\\t\\tif (A[0][j] == 0) {\\n\\t\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (pre != j - 1) {\\n\\t\\t\\t\\t\\tcnt += 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tv[j] = cnt;\\n\\t\\t\\t\\tpre = j;\\n\\t\\t\\t\\tZ[0][j] = '#';\\n\\t\\t\\t\\tblack += 1;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tZ[0][j] = '.';\\n\\t\\t\\t\\tif (A[0][j] == 1 || (j >= 1 && v[j - 1] == -1)) {\\n\\t\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (flag) {\\n\\t\\t\\tint res = calc(calc, 1, 0, v);\\n\\t\\t\\tans = max(ans, res + black);\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nbool check(int H, int W, const vector<vector<int> >& A) {\\n\\tvector<vector<bool> > vis(H, vector<bool>(W, false));\\n\\tauto check = [&](int x, int y) -> bool {\\n\\t\\treturn 0 <= x && x < H && 0 <= y && y < W && !vis[x][y] && A[x][y] == 1;\\n\\t};\\n\\tauto dfs = [&](auto& self, int x, int y) -> void {\\n\\t\\tvis[x][y] = true;\\n\\t\\tif (check(x, y - 1)) self(self, x, y - 1);\\n\\t\\tif (check(x, y + 1)) self(self, x, y + 1);\\n\\t\\tif (check(x - 1, y)) self(self, x - 1, y);\\n\\t\\tif (check(x + 1, y)) self(self, x + 1, y);\\n\\t};\\n\\tint cnt = 0;\\n\\tfor (int i = 0; i < H; i++) {\\n\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\tif (A[i][j] == 1 && !vis[i][j]) {\\n\\t\\t\\t\\tdfs(dfs, i, j);\\n\\t\\t\\t\\tcnt += 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (cnt >= 2) {\\n\\t\\treturn false;\\n\\t}\\n\\tint f = 0;\\n\\tfor (int i = 0; i < H; i++) {\\n\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\tif (A[i][j] == 1) {\\n\\t\\t\\t\\tif (i >= 1 && A[i - 1][j] == 1) f -= 1;\\n\\t\\t\\t\\tif (j >= 1 && A[i][j - 1] == 1) f -= 1;\\n\\t\\t\\t\\tf += 1;\\n\\t\\t\\t}\\n\\t\\t\\tif (A[i][j] == 0) {\\n\\t\\t\\t\\tif (i >= 1 && A[i - 1][j] == 0) return false;\\n\\t\\t\\t\\tif (j >= 1 && A[i][j - 1] == 0) return false;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn cnt == 0 || f == 1;\\n}\\n\\nbool testcase_check(int H, int W) {\\n\\tfor (int i = 0; i < 1 << (H * W); i++) {\\n\\t\\tvector<vector<int> > A(H, vector<int>(W));\\n\\t\\tfor (int j = 0; j < H * W; j++) {\\n\\t\\t\\tA[j / W][j % W] = ((i >> j) & 1);\\n\\t\\t}\\n\\t\\tbool res1 = (solve(H, W, A) != -1);\\n\\t\\tbool res2 = check(H, W, A);\\n\\t\\tif (res1 != res2) {\\n\\t\\t\\tvector<string> res(H);\\n\\t\\t\\tfor (int i = 0; i < H; i++) {\\n\\t\\t\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\t\\t\\tres[i] += (A[i][j] == 0 ? '.' : '#');\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tcout << \\\"H = \\\" << H << \\\", W = \\\" << W << \\\":\\\" << endl;\\n\\t\\t\\tfor (int i = 0; i < H; i++) {\\n\\t\\t\\t\\tcout << res[i] << endl;\\n\\t\\t\\t}\\n\\t\\t\\tcout << \\\"Returns: \\\" << (res1 ? \\\"true\\\" : \\\"false\\\") << endl;\\n\\t\\t\\tcout << \\\"Answer: \\\" << (res2 ? \\\"true\\\" : \\\"false\\\") << endl;\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\\nint main() {\\n\\t/*\\n\\tfor (int H = 1; H <= 5; H++) {\\n\\t\\tfor (int W = 1; W <= H; W++) {\\n\\t\\t\\tif (testcase_check(H, W)) {\\n\\t\\t\\t\\tcout << \\\"H = \\\" << H << \\\", W = \\\" << W << \\\": success!\\\" << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n\\t*/\\n\\tint H, W;\\n\\tcin >> H >> W;\\n\\tvector<vector<int> > A(H, vector<int>(W, -1));\\n\\tfor (int i = 0; i < H; i++) {\\n\\t\\tstring s;\\n\\t\\tcin >> s;\\n\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\tif (s[j] == '.') A[i][j] = 0;\\n\\t\\t\\tif (s[j] == '#') A[i][j] = 1;\\n\\t\\t}\\n\\t}\\n\\tint ans = solve(H, W, A);\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 43856,\n \"score_of_the_acc\": -0.5184,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2314_8402506\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvoid regularize(int n, vector<int>& v) {\\n\\tint cnt = 0;\\n\\tvector<int> tbl(n + 1, -1);\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tif (v[i] != -1 && tbl[v[i]] == -1) {\\n\\t\\t\\ttbl[v[i]] = cnt++;\\n\\t\\t}\\n\\t}\\n\\tfor (int i = 0; i < n; i++) {\\n\\t\\tif (v[i] != -1) {\\n\\t\\t\\tv[i] = tbl[v[i]];\\n\\t\\t}\\n\\t}\\n}\\n\\nint solve_one(int N, const vector<int>& X) {\\n\\tif (N == 1) {\\n\\t\\treturn (X[0] != 0);\\n\\t}\\n\\tfor (int i = 1; i < N - 1; i++) {\\n\\t\\tif (X[i] == 0) {\\n\\t\\t\\treturn -1;\\n\\t\\t}\\n\\t}\\n\\treturn (N - 2) + (X[0] != 0) + (X[N - 1] != 0);\\n}\\n\\nstring to_string(const vector<int>& arr) {\\n\\tstring res = \\\"[\\\";\\n\\tfor (int i = 0; i < int(arr.size()); i++) {\\n\\t\\tif (i != 0) {\\n\\t\\t\\tres += \\\", \\\";\\n\\t\\t}\\n\\t\\tres += to_string(arr[i]);\\n\\t}\\n\\tres += \\\"]\\\";\\n\\treturn res;\\n}\\n\\nint solve(int H, int W, const vector<vector<int> >& A) {\\n\\tif (H < W) {\\n\\t\\tvector<vector<int> > B(W, vector<int>(H));\\n\\t\\tfor (int i = 0; i < H; i++) {\\n\\t\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\t\\tB[j][i] = A[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn solve(W, H, B);\\n\\t}\\n\\tif (W == 1) {\\n\\t\\tvector<int> X(H);\\n\\t\\tfor (int i = 0; i < H; i++) {\\n\\t\\t\\tX[i] = A[i][0];\\n\\t\\t}\\n\\t\\treturn solve_one(H, X);\\n\\t}\\n\\tconst int INF = 1012345678;\\n\\tvector<vector<map<vector<int>, int> > > dp(H, vector<map<vector<int>, int> >(W));\\n\\tvector<string> Z(H, string(W, '?'));\\n\\tauto calc = [&](auto& self, int x, int y, const vector<int>& v) -> int {\\n\\t\\tif (x == H && y == 0) {\\n\\t\\t\\tif (*max_element(v.begin(), v.end()) >= 1) {\\n\\t\\t\\t\\treturn -INF;\\n\\t\\t\\t}\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tif (dp[x][y].find(v) != dp[x][y].end()) {\\n\\t\\t\\treturn dp[x][y][v];\\n\\t\\t}\\n\\t\\tint nx = x, ny = y + 1;\\n\\t\\tif (ny == W) {\\n\\t\\t\\tnx += 1;\\n\\t\\t\\tny = 0;\\n\\t\\t}\\n\\t\\tint res = -INF;\\n\\t\\tif (A[x][y] != 1 && (y == 0 || v[y - 1] != -1) && v[y] != -1) {\\n\\t\\t\\t// place white\\n\\t\\t\\tvector<int> nv = v;\\n\\t\\t\\tnv[y] = -1;\\n\\t\\t\\tif (find(nv.begin(), nv.end(), v[y]) != nv.end()) {\\n\\t\\t\\t\\tZ[x][y] = '.';\\n\\t\\t\\t\\tint subres = self(self, nx, ny, nv);\\n\\t\\t\\t\\tres = max(res, subres);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (A[x][y] != 0 && (y == 0 || v[y] == -1 || v[y - 1] != v[y])) {\\n\\t\\t\\t// place black\\n\\t\\t\\tvector<int> nv = v;\\n\\t\\t\\tif ((y != 0 && v[y - 1] != -1) && v[y] != -1) {\\n\\t\\t\\t\\tfor (int i = 0; i < W; i++) {\\n\\t\\t\\t\\t\\tif (v[i] == v[y]) {\\n\\t\\t\\t\\t\\t\\tnv[i] = v[y - 1];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse if ((y != 0 && v[y - 1] != -1) || v[y] != -1) {\\n\\t\\t\\t\\tnv[y] = (v[y - 1] != -1 ? v[y - 1] : v[y]);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tnv[y] = W;\\n\\t\\t\\t}\\n\\t\\t\\tregularize(W, nv);\\n\\t\\t\\tZ[x][y] = '#';\\n\\t\\t\\tint subres = self(self, nx, ny, nv);\\n\\t\\t\\tres = max(res, subres + 1);\\n\\t\\t}\\n\\t\\tdp[x][y][v] = res;\\n\\t\\treturn res;\\n\\t};\\n\\tint ans = -1;\\n\\tfor (int i = 0; i < (1 << W); i++) {\\n\\t\\tvector<int> v(W, -1);\\n\\t\\tint cnt = -1, pre = -2, black = 0;\\n\\t\\tbool flag = true;\\n\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\tif ((i >> j) & 1) {\\n\\t\\t\\t\\tif (A[0][j] == 0) {\\n\\t\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (pre != j - 1) {\\n\\t\\t\\t\\t\\tcnt += 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tv[j] = cnt;\\n\\t\\t\\t\\tpre = j;\\n\\t\\t\\t\\tZ[0][j] = '#';\\n\\t\\t\\t\\tblack += 1;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tZ[0][j] = '.';\\n\\t\\t\\t\\tif (A[0][j] == 1 || (j >= 1 && v[j - 1] == -1)) {\\n\\t\\t\\t\\t\\tflag = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (flag) {\\n\\t\\t\\tint res = calc(calc, 1, 0, v);\\n\\t\\t\\tans = max(ans, res + black);\\n\\t\\t}\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\tint H, W;\\n\\tcin >> H >> W;\\n\\tvector<vector<int> > A(H, vector<int>(W, -1));\\n\\tfor (int i = 0; i < H; i++) {\\n\\t\\tstring s;\\n\\t\\tcin >> s;\\n\\t\\tfor (int j = 0; j < W; j++) {\\n\\t\\t\\tif (s[j] == '.') A[i][j] = 0;\\n\\t\\t\\tif (s[j] == '#') A[i][j] = 1;\\n\\t\\t}\\n\\t}\\n\\tint ans = solve(H, W, A);\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.6320754716981132,\n \"time_ms\": 210,\n \"memory_kb\": 43976,\n \"score_of_the_acc\": -0.5284,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2314_7124649\",\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) ll(x.size())\\nconst int mod=998244353,MAX=300005,INF=1<<30;\\n\\n#define int short\\n\\nint H,W;\\n\\nvector<int> used;\\nvector<vector<int>> conne;\\nvector<int> nex;\\n\\nvector<int> X;\\n\\nll pat=0;\\n\\nvoid DFS(int rem){\\n if(rem==0){\\n pat++;\\n used.push_back(nex.back());\\n conne.push_back(X);\\n return;\\n }\\n int s=-1;\\n for(int j=0;;j++){\\n if(rem&(1<<j)){\\n s=(1<<j);\\n break;\\n }\\n }\\n for(int mask=rem;;mask=(mask-1)&rem){\\n if(mask&s){\\n int ng=0;\\n for(int j=0;j<W;j++){\\n if(mask&(1<<j)){\\n if(rem&(1<<(j+1))){\\n if(!(mask&(1<<(j+1)))) ng++;\\n }\\n if(j&&(rem&(1<<(j-1)))){\\n if(!(mask&(1<<(j-1)))) ng++;\\n }\\n }\\n }\\n if(ng<=1){\\n X.push_back(mask);\\n DFS(rem-mask);\\n X.pop_back();\\n }\\n }\\n \\n if(mask==0) break;\\n }\\n}\\n\\nint dp[12][12][233000];\\n\\nvector<int> divide[233000];\\n\\nsigned main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n cin>>H>>W;\\n vector<string> S(H);\\n for(int i=0;i<H;i++) cin>>S[i];\\n \\n if(W==1){\\n int ans=-1;\\n {\\n bool ok=true;\\n for(int i=0;i<H-1;i++){\\n ok&=(S[i][0]!='.');\\n }\\n ok&=(S[H-1][0]!='#');\\n if(ok){\\n if(ans<H-1) ans=H-1;\\n }//chmax(ans,H-1);\\n }\\n {\\n bool ok=true;\\n for(int i=1;i<H;i++){\\n ok&=(S[i][0]!='.');\\n }\\n ok&=(S[0][0]!='#');\\n if(ok){\\n if(ans<H-1) ans=H-1;\\n }//chmax(ans,H-1);\\n }\\n {\\n bool ok=true;\\n for(int i=1;i<H-1;i++){\\n ok&=(S[i][0]!='.');\\n }\\n ok&=(S[0][0]!='#');\\n ok&=(S[H-1][0]!='#');\\n //if(H!=2&&ok) chmax(ans,H-2);\\n if(H!=2&&ok){\\n if(ans<H-2) ans=H-2;\\n }//chmax(ans,H-1);\\n }\\n {\\n bool ok=true;\\n for(int i=0;i<H;i++){\\n ok&=(S[i][0]!='.');\\n }\\n if(ok){\\n if(ans<H) ans=H;\\n }//chmax(ans,H-1);\\n }\\n \\n cout<<ans<<endl;\\n \\n return 0;\\n }\\n \\n for(int bit=0;bit<(1<<W);bit++){\\n //cout<<bit<<endl;\\n int ng=0;\\n for(int j=0;j+1<W;j++){\\n int cn=0;\\n if(bit&(1<<j)) cn++;\\n if(bit&(1<<(j+1))) cn++;\\n if(cn==0) ng++;\\n }\\n if(ng<=1){\\n nex.push_back(bit);\\n DFS(bit);\\n \\n vector<int> Y;\\n int j=0;\\n while(j<W){\\n if(bit&(1<<j)){\\n int k=j;\\n int mas=0;\\n while(bit&(1<<k)){\\n mas|=(1<<k);\\n k++;\\n }\\n Y.push_back(mas);\\n j=k;\\n }else{\\n j++;\\n }\\n }\\n \\n divide[bit]=Y;\\n \\n //cout<<bitset<10>(bit)<<endl;\\n }\\n }\\n \\n //cout<<si(conne)<<\\\" \\\"<<si(used)<<endl;\\n //cout<<pat<<endl;\\n \\n for(ll j=0;j<si(conne);j++){\\n sort(all(conne[j]));\\n //cout<<bitset<10>(used[j])<<endl;\\n }\\n \\n for(int i=0;i<=H;i++) for(int w=0;w<=W;w++) for(ll j=0;j<si(conne);j++) dp[i][w][j]=-100;\\n \\n map<vector<int>,ll> MA;\\n \\n for(ll t=0;t<si(conne);t++){\\n MA[conne[t]]=t;\\n bool ok=true;\\n for(int j=0;j<W;j++){\\n if(S[0][j]=='#'){\\n if(!(used[t]&(1<<j))) ok=false;\\n }\\n if(S[0][j]=='.'){\\n if(used[t]&(1<<j)) ok=false;\\n }\\n }\\n for(int j=0;j+1<W;j++){\\n int cn=0;\\n if(!(used[t]&(1<<j))) cn++;\\n if(!(used[t]&(1<<(j+1)))) cn++;\\n if(cn==2) ok=false;\\n }\\n if(ok){\\n if(divide[used[t]]==conne[t]){\\n dp[1][0][t]=__builtin_popcount(used[t]);\\n //cout<<bitset<11>(used[t])<<endl;\\n }\\n }\\n }\\n \\n for(int i=1;i<H;i++){\\n for(int j=0;j<W;j++){\\n for(ll k=0;k<si(conne);k++){\\n if(dp[i][j][k]<0) continue;\\n \\n int mask=used[k];\\n \\n if(mask&(1<<j)){\\n if(j==0||(!(mask&(1<<(j-1))))){\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][k]<dp[i][j][k]+1) dp[i][j+1][k]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][k],dp[i][j][k]+1);\\n }\\n }else{\\n bool ok=true;\\n for(int a:conne[k]){\\n if((a&(1<<(j-1)))&&(a&(1<<j))) ok=false;\\n }\\n if(ok){\\n vector<int> to;\\n int ss=0;\\n for(int a:conne[k]){\\n if(a&(1<<(j-1))){\\n ss|=a;\\n }else if(a&(1<<j)){\\n ss|=a;\\n }else{\\n to.push_back(a);\\n }\\n }\\n to.push_back(ss);\\n sort(all(to));\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\\n }\\n }\\n }\\n \\n int z=-1;\\n for(int a:conne[k]){\\n if(a&(1<<j)) z=a;\\n }\\n int hi=-1;\\n for(int l=W-1;l>=0;l--){\\n if(z&(1<<l)){\\n hi=l;\\n break;\\n }\\n }\\n int x=(1<<j)-1;\\n \\n if((hi!=j)||(z&x)){\\n vector<int> to=conne[k];\\n for(int &a:to){\\n if(a&(1<<j)) a-=(1<<j);\\n }\\n //cout<<used[k]<<\\\" \\\"<<used[MA[to]]<<endl;\\n sort(all(to));\\n //cout<<used[k]<<\\\" \\\"<<used[MA[to]]<<endl;\\n if(S[i][j]!='#'&&(j==0||(used[k]&(1<<(j-1))))) chmax(dp[i][j+1][MA[to]],dp[i][j][k]);\\n }\\n }else{\\n if(j==0||(!(mask&(1<<(j-1))))){\\n vector<int> to=conne[k];\\n to.push_back((1<<j));\\n sort(all(to));\\n assert(MA.count(to));\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\\n }\\n assert(MA.count(to));\\n //cout<<used[k]<<\\\" \\\"<<used[MA[to]]<<endl;\\n //for(int a:to) cout<<a<<\\\" \\\";\\n //cout<<endl;\\n }else{\\n vector<int> to=conne[k];\\n for(int &a:to){\\n if(a&(1<<(j-1))) a|=(1<<j);\\n }\\n sort(all(to));\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\\n }\\n }\\n }\\n }\\n }\\n \\n for(ll k=0;k<si(conne);k++) dp[i+1][0][k]=dp[i][W][k];\\n }\\n \\n int ans=-1;\\n \\n for(ll k=0;k<si(conne);k++){\\n if(si(conne[k])==1){\\n //for(int a:conne[k]) cout<<a<<\\\" \\\";\\n //cout<<\\\" : \\\";\\n //cout<<dp[H][0][k]<<endl;\\n chmax(ans,dp[H][0][k]);\\n }\\n }\\n \\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 113200,\n \"score_of_the_acc\": -1.1741,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2314_7124645\",\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) ll(x.size())\\nconst int mod=998244353,MAX=300005,INF=1<<30;\\n\\n#define int short\\n\\nint H,W;\\n\\nvector<int> used;\\nvector<vector<int>> conne;\\nvector<int> nex;\\n\\nvector<int> X;\\n\\nll pat=0;\\n\\nvoid DFS(int rem){\\n if(rem==0){\\n pat++;\\n used.push_back(nex.back());\\n conne.push_back(X);\\n return;\\n }\\n int s=-1;\\n for(int j=0;;j++){\\n if(rem&(1<<j)){\\n s=(1<<j);\\n break;\\n }\\n }\\n for(int mask=rem;;mask=(mask-1)&rem){\\n if(mask&s){\\n int ng=0;\\n for(int j=0;j<W;j++){\\n if(mask&(1<<j)){\\n if(rem&(1<<(j+1))){\\n if(!(mask&(1<<(j+1)))) ng++;\\n }\\n if(j&&(rem&(1<<(j-1)))){\\n if(!(mask&(1<<(j-1)))) ng++;\\n }\\n }\\n }\\n if(ng<=1){\\n X.push_back(mask);\\n DFS(rem-mask);\\n X.pop_back();\\n }\\n }\\n \\n if(mask==0) break;\\n }\\n}\\n\\nint dp[12][12][233000];\\n\\nvector<int> divide[233000];\\n\\nsigned main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n cin>>H>>W;\\n vector<string> S(H);\\n for(int i=0;i<H;i++) cin>>S[i];\\n \\n if(W==1){\\n int ans=-1;\\n {\\n bool ok=true;\\n for(int i=0;i<H-1;i++){\\n ok&=(S[i][0]!='.');\\n }\\n ok&=(S[H-1][0]!='#');\\n if(ok){\\n if(ans<H-1) ans=H-1;\\n }//chmax(ans,H-1);\\n }\\n {\\n bool ok=true;\\n for(int i=1;i<H;i++){\\n ok&=(S[i][0]!='.');\\n }\\n ok&=(S[0][0]!='#');\\n if(ok){\\n if(ans<H-1) ans=H-1;\\n }//chmax(ans,H-1);\\n }\\n {\\n bool ok=true;\\n for(int i=1;i<H-1;i++){\\n ok&=(S[i][0]!='.');\\n }\\n ok&=(S[0][0]!='#');\\n ok&=(S[H-1][0]!='#');\\n //if(H!=2&&ok) chmax(ans,H-2);\\n if(H!=2&&ok){\\n if(ans<H-2) ans=H-2;\\n }//chmax(ans,H-1);\\n }\\n {\\n bool ok=true;\\n for(int i=0;i<H;i++){\\n ok&=(S[i][0]!='.');\\n }\\n if(ok){\\n if(ans<H) ans=H;\\n }//chmax(ans,H-1);\\n }\\n \\n cout<<ans<<endl;\\n \\n return 0;\\n }\\n \\n for(int bit=0;bit<(1<<W);bit++){\\n //cout<<bit<<endl;\\n int ng=0;\\n for(int j=0;j+1<W;j++){\\n int cn=0;\\n if(bit&(1<<j)) cn++;\\n if(bit&(1<<(j+1))) cn++;\\n if(cn==0) ng++;\\n }\\n if(ng<=1){\\n nex.push_back(bit);\\n DFS(bit);\\n \\n vector<int> Y;\\n int j=0;\\n while(j<W){\\n if(bit&(1<<j)){\\n int k=j;\\n int mas=0;\\n while(bit&(1<<k)){\\n mas|=(1<<k);\\n k++;\\n }\\n Y.push_back(mas);\\n j=k;\\n }else{\\n j++;\\n }\\n }\\n \\n divide[bit]=Y;\\n \\n //cout<<bitset<10>(bit)<<endl;\\n }\\n }\\n \\n //cout<<si(conne)<<\\\" \\\"<<si(used)<<endl;\\n //cout<<pat<<endl;\\n \\n for(ll j=0;j<si(conne);j++){\\n sort(all(conne[j]));\\n //cout<<bitset<10>(used[j])<<endl;\\n }\\n \\n for(int i=0;i<=H;i++) for(int w=0;w<=W;w++) for(ll j=0;j<si(conne);j++) dp[i][w][j]=-100;\\n \\n map<vector<int>,ll> MA;\\n \\n for(ll t=0;t<si(conne);t++){\\n MA[conne[t]]=t;\\n bool ok=true;\\n for(int j=0;j<W;j++){\\n if(S[0][j]=='#'){\\n if(!(used[t]&(1<<j))) ok=false;\\n }\\n if(S[0][j]=='.'){\\n if(used[t]&(1<<j)) ok=false;\\n }\\n }\\n if(ok){\\n if(divide[used[t]]==conne[t]){\\n dp[1][0][t]=__builtin_popcount(used[t]);\\n //cout<<used[t]<<endl;\\n }\\n }\\n }\\n \\n for(int i=1;i<H;i++){\\n for(int j=0;j<W;j++){\\n for(ll k=0;k<si(conne);k++){\\n if(dp[i][j][k]<0) continue;\\n \\n int mask=used[k];\\n \\n if(mask&(1<<j)){\\n if(j==0||(!(mask&(1<<(j-1))))){\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][k]<dp[i][j][k]+1) dp[i][j+1][k]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][k],dp[i][j][k]+1);\\n }\\n }else{\\n bool ok=true;\\n for(int a:conne[k]){\\n if((a&(1<<(j-1)))&&(a&(1<<j))) ok=false;\\n }\\n if(ok){\\n vector<int> to;\\n int ss=0;\\n for(int a:conne[k]){\\n if(a&(1<<(j-1))){\\n ss|=a;\\n }else if(a&(1<<j)){\\n ss|=a;\\n }else{\\n to.push_back(a);\\n }\\n }\\n to.push_back(ss);\\n sort(all(to));\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\\n }\\n }\\n }\\n \\n int z=-1;\\n for(int a:conne[k]){\\n if(a&(1<<j)) z=a;\\n }\\n int hi=-1;\\n for(int l=W-1;l>=0;l--){\\n if(z&(1<<l)){\\n hi=l;\\n break;\\n }\\n }\\n int x=(1<<j)-1;\\n \\n if((hi!=j)||(z&x)){\\n vector<int> to=conne[k];\\n for(int &a:to){\\n if(a&(1<<j)) a-=(1<<j);\\n }\\n //cout<<used[k]<<\\\" \\\"<<used[MA[to]]<<endl;\\n sort(all(to));\\n //cout<<used[k]<<\\\" \\\"<<used[MA[to]]<<endl;\\n if(S[i][j]!='#'&&(j==0||(used[k]&(1<<(j-1))))) chmax(dp[i][j+1][MA[to]],dp[i][j][k]);\\n }\\n }else{\\n if(j==0||(!(mask&(1<<(j-1))))){\\n vector<int> to=conne[k];\\n to.push_back((1<<j));\\n sort(all(to));\\n assert(MA.count(to));\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\\n }\\n assert(MA.count(to));\\n //cout<<used[k]<<\\\" \\\"<<used[MA[to]]<<endl;\\n //for(int a:to) cout<<a<<\\\" \\\";\\n //cout<<endl;\\n }else{\\n vector<int> to=conne[k];\\n for(int &a:to){\\n if(a&(1<<(j-1))) a|=(1<<j);\\n }\\n sort(all(to));\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\\n }\\n }\\n }\\n }\\n }\\n \\n for(ll k=0;k<si(conne);k++) dp[i+1][0][k]=dp[i][W][k];\\n }\\n \\n int ans=-1;\\n \\n for(ll k=0;k<si(conne);k++){\\n if(si(conne[k])==1){\\n //for(int a:conne[k]) cout<<a<<\\\" \\\";\\n //cout<<\\\" : \\\";\\n //cout<<dp[H][0][k]<<endl;\\n chmax(ans,dp[H][0][k]);\\n }\\n }\\n \\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.49056603773584906,\n \"time_ms\": 250,\n \"memory_kb\": 113052,\n \"score_of_the_acc\": -1.1817,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2314_7124632\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }\\n#define all(x) (x).begin(),(x).end()\\n#define fi first\\n#define se second\\n#define mp make_pair\\n#define si(x) int(x.size())\\nconst int mod=998244353,MAX=300005,INF=1<<30;\\n\\n#define int short\\n\\nint H,W;\\n\\nvector<int> used;\\nvector<vector<int>> conne;\\nvector<int> nex;\\n\\nvector<int> X;\\n\\nll pat=0;\\n\\nvoid DFS(int rem){\\n if(rem==0){\\n pat++;\\n used.push_back(nex.back());\\n conne.push_back(X);\\n return;\\n }\\n int s=-1;\\n for(int j=0;;j++){\\n if(rem&(1<<j)){\\n s=(1<<j);\\n break;\\n }\\n }\\n for(int mask=rem;;mask=(mask-1)&rem){\\n if(mask&s){\\n int ng=0;\\n for(int j=0;j<W;j++){\\n if(mask&(1<<j)){\\n if(rem&(1<<(j+1))){\\n if(!(mask&(1<<(j+1)))) ng++;\\n }\\n if(j&&(rem&(1<<(j-1)))){\\n if(!(mask&(1<<(j-1)))) ng++;\\n }\\n }\\n }\\n if(ng<=1){\\n X.push_back(mask);\\n DFS(rem-mask);\\n X.pop_back();\\n }\\n }\\n \\n if(mask==0) break;\\n }\\n}\\n\\nint dp[12][12][233000];\\n\\nvector<int> divide[233000];\\n\\nsigned main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n cin>>H>>W;\\n vector<string> S(H);\\n for(int i=0;i<H;i++) cin>>S[i];\\n \\n if(W==1){\\n int ans=-1;\\n {\\n bool ok=true;\\n for(int i=0;i<H-1;i++){\\n ok&=(S[i][0]!='.');\\n }\\n ok&=(S[H-1][0]!='#');\\n if(ok){\\n if(ans<H-1) ans=H-1;\\n }//chmax(ans,H-1);\\n }\\n {\\n bool ok=true;\\n for(int i=1;i<H;i++){\\n ok&=(S[i][0]!='.');\\n }\\n ok&=(S[0][0]!='#');\\n if(ok){\\n if(ans<H-1) ans=H-1;\\n }//chmax(ans,H-1);\\n }\\n {\\n bool ok=true;\\n for(int i=1;i<H-1;i++){\\n ok&=(S[i][0]!='.');\\n }\\n ok&=(S[0][0]!='#');\\n ok&=(S[H-1][0]!='#');\\n //if(H!=2&&ok) chmax(ans,H-2);\\n if(H!=2&&ok){\\n if(ans<H-2) ans=H-2;\\n }//chmax(ans,H-1);\\n }\\n {\\n bool ok=true;\\n for(int i=0;i<H;i++){\\n ok&=(S[i][0]!='.');\\n }\\n if(ok){\\n if(ans<H) ans=H;\\n }//chmax(ans,H-1);\\n }\\n \\n cout<<ans<<endl;\\n \\n return 0;\\n }\\n \\n for(int bit=0;bit<(1<<W);bit++){\\n int ng=0;\\n for(int j=0;j+1<W;j++){\\n int cn=0;\\n if(bit&(1<<j)) cn++;\\n if(bit&(1<<(j+1))) cn++;\\n if(cn==0) ng++;\\n }\\n if(ng<=1){\\n nex.push_back(bit);\\n DFS(bit);\\n \\n vector<int> Y;\\n int j=0;\\n while(j<W){\\n if(bit&(1<<j)){\\n int k=j;\\n int mas=0;\\n while(bit&(1<<k)){\\n mas|=(1<<k);\\n k++;\\n }\\n Y.push_back(mas);\\n j=k;\\n }else{\\n j++;\\n }\\n }\\n \\n divide[bit]=Y;\\n }\\n }\\n \\n //cout<<pat<<endl;\\n \\n for(int j=0;j<si(conne);j++){\\n sort(all(conne[j]));\\n }\\n \\n for(int i=0;i<=H;i++) for(int w=0;w<=W;w++) for(int j=0;j<si(conne);j++) dp[i][w][j]=-100;\\n \\n map<vector<int>,int> MA;\\n \\n for(int t=0;t<si(conne);t++){\\n MA[conne[t]]=t;\\n bool ok=true;\\n for(int j=0;j<W;j++){\\n if(S[0][j]=='#'){\\n if(!(used[t]&(1<<j))) ok=false;\\n }\\n if(S[0][j]=='.'){\\n if(used[t]&(1<<j)) ok=false;\\n }\\n }\\n if(ok){\\n if(divide[used[t]]==conne[t]){\\n dp[1][0][t]=__builtin_popcount(used[t]);\\n }\\n }\\n }\\n \\n for(int i=1;i<H;i++){\\n for(int j=0;j<W;j++){\\n for(int k=0;k<si(conne);k++){\\n if(dp[i][j][k]<0) continue;\\n \\n int mask=used[k];\\n \\n if(mask&(1<<j)){\\n if(j==0||(!(mask&(1<<(j-1))))){\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][k]<dp[i][j][k]+1) dp[i][j+1][k]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][k],dp[i][j][k]+1);\\n }\\n }else{\\n bool ok=true;\\n for(int a:conne[k]){\\n if((a&(1<<(j-1)))&&(a&(1<<j))) ok=false;\\n }\\n if(ok){\\n vector<int> to;\\n int ss=0;\\n for(int a:conne[k]){\\n if(a&(1<<(j-1))){\\n ss|=a;\\n }else if(a&(1<<j)){\\n ss|=a;\\n }else{\\n to.push_back(a);\\n }\\n }\\n to.push_back(ss);\\n sort(all(to));\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\\n }\\n }\\n }\\n \\n int z=-1;\\n for(int a:conne[k]){\\n if(a&(1<<j)) z=a;\\n }\\n int hi=-1;\\n for(int l=W-1;l>=0;l--){\\n if(z&(1<<l)){\\n hi=l;\\n break;\\n }\\n }\\n int x=(1<<j)-1;\\n \\n if((hi!=j)||(z&x)){\\n vector<int> to=conne[k];\\n for(int &a:to){\\n if(a&(1<<j)) a-=(1<<j);\\n }\\n //cout<<used[k]<<\\\" \\\"<<used[MA[to]]<<endl;\\n sort(all(to));\\n //cout<<used[k]<<\\\" \\\"<<used[MA[to]]<<endl;\\n if(S[i][j]!='#'&&(j==0||(used[k]&(1<<(j-1))))) chmax(dp[i][j+1][MA[to]],dp[i][j][k]);\\n }\\n }else{\\n if(j==0||(!(mask&(1<<(j-1))))){\\n vector<int> to=conne[k];\\n to.push_back((1<<j));\\n sort(all(to));\\n assert(MA.count(to));\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\\n }\\n assert(MA.count(to));\\n //cout<<used[k]<<\\\" \\\"<<used[MA[to]]<<endl;\\n //for(int a:to) cout<<a<<\\\" \\\";\\n //cout<<endl;\\n }else{\\n vector<int> to=conne[k];\\n for(int &a:to){\\n if(a&(1<<(j-1))) a|=(1<<j);\\n }\\n sort(all(to));\\n if(S[i][j]!='.'){\\n if(dp[i][j+1][MA[to]]<dp[i][j][k]+1) dp[i][j+1][MA[to]]=dp[i][j][k]+1;\\n //chmax(dp[i][j+1][MA[to]],dp[i][j][k]+1);\\n }\\n }\\n }\\n }\\n }\\n \\n for(int k=0;k<si(conne);k++) dp[i+1][0][k]=dp[i][W][k];\\n }\\n \\n int ans=-1;\\n \\n for(int k=0;k<si(conne);k++){\\n if(si(conne[k])==1){\\n //for(int a:conne[k]) cout<<a<<\\\" \\\";\\n //cout<<\\\" : \\\";\\n //cout<<dp[H][0][k]<<endl;\\n chmax(ans,dp[H][0][k]);\\n }\\n }\\n \\n cout<<ans<<endl;\\n}\",\n \"accuracy\": 0.20754716981132076,\n \"time_ms\": 20,\n \"memory_kb\": 71476,\n \"score_of_the_acc\": -0.6046,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2314_6002770\",\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-8;\\nconst ld pi = acosl(-1.0);\\n\\nll mod_pow(ll x, ll n, ll m = mod) {\\n\\tif (n < 0) {\\n\\t\\tll res = mod_pow(x, -n, m);\\n\\t\\treturn mod_pow(res, m - 2, m);\\n\\t}\\n\\tif (abs(x) >= m)x %= m;\\n\\tif (x < 0)x += m;\\n\\tll res = 1;\\n\\twhile (n) {\\n\\t\\tif (n & 1)res = res * x % m;\\n\\t\\tx = x * x % m; n >>= 1;\\n\\t}\\n\\treturn res;\\n}\\nstruct modint {\\n\\tll n;\\n\\tmodint() :n(0) { ; }\\n\\tmodint(ll m) :n(m) {\\n\\t\\tif (n >= mod)n %= mod;\\n\\t\\telse if (n < 0)n = (n % mod + mod) % mod;\\n\\t}\\n\\toperator int() { return n; }\\n};\\nbool operator==(modint a, modint b) { return a.n == b.n; }\\nmodint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }\\nmodint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }\\nmodint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }\\nmodint operator+(modint a, modint b) { return a += b; }\\nmodint operator-(modint a, modint b) { return a -= b; }\\nmodint operator*(modint a, modint b) { return a *= b; }\\nmodint operator^(modint a, ll n) {\\n\\tif (n == 0)return modint(1);\\n\\tmodint res = (a * a) ^ (n / 2);\\n\\tif (n % 2)res = res * a;\\n\\treturn res;\\n}\\n\\nll inv(ll a, ll p) {\\n\\treturn (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);\\n}\\nmodint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }\\nmodint operator/=(modint& a, modint b) { a = a / b; return a; }\\nconst int max_n = 1 << 2;\\nmodint fact[max_n], factinv[max_n];\\nvoid init_f() {\\n\\tfact[0] = modint(1);\\n\\tfor (int i = 0; i < max_n - 1; i++) {\\n\\t\\tfact[i + 1] = fact[i] * modint(i + 1);\\n\\t}\\n\\tfactinv[max_n - 1] = modint(1) / fact[max_n - 1];\\n\\tfor (int i = max_n - 2; i >= 0; i--) {\\n\\t\\tfactinv[i] = factinv[i + 1] * modint(i + 1);\\n\\t}\\n}\\nmodint comb(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[b] * factinv[a - b];\\n}\\nmodint combP(int a, int b) {\\n\\tif (a < 0 || b < 0 || a < b)return 0;\\n\\treturn fact[a] * factinv[a - b];\\n}\\n\\nvoid solve() {\\n\\tint h, w; cin >> h >> w;\\n\\tvector<string> s(h);\\n\\trep(i, h)cin >> s[i];\\n\\tif (w == 1) {\\n\\t\\tint ans = -1;\\n\\t\\trep(i, (1 << h)) {\\n\\t\\t\\tbool valid = true;\\n\\t\\t\\tvector<bool> c(h);\\n\\t\\t\\trep(j, h) {\\n\\t\\t\\t\\tint b = i & (1 << j);\\n\\t\\t\\t\\tc[j] = b;\\n\\t\\t\\t\\tif (b && s[j][0] == '.')valid = false;\\n\\t\\t\\t\\tif (!b && s[j][0] == '#')valid = false;\\n\\t\\t\\t}\\n\\t\\t\\trep(j, h - 1) {\\n\\t\\t\\t\\tif (!c[j] && !c[j + 1])valid = false;\\n\\t\\t\\t}\\n\\t\\t\\trep(j, h)if (c[j]) {\\n\\t\\t\\t\\twhile (j + 1 < h && c[j + 1])j++;\\n\\t\\t\\t\\tj++; j++;\\n\\t\\t\\t\\tfor (; j < h; j++) {\\n\\t\\t\\t\\t\\tif (c[j])valid = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!valid)continue;\\n\\t\\t\\tint cnt = 0;\\n\\t\\t\\trep(j, h)if (c[j])cnt++;\\n\\t\\t\\tans = max(ans, cnt);\\n\\t\\t}\\n\\t\\tcout << ans << \\\"\\\\n\\\";\\n\\t\\treturn;\\n\\t}\\n\\tvector<vector<int>> ch(1 << w);\\n\\trep(j, (1 << w)) {\\n\\t\\trep(i, w)if (j & (1 << i))ch[j].push_back(i);\\n\\t}\\n\\tvector<int> trans(w);\\n\\tvector<int> nv;\\n\\n\\tmap<vector<int>, int> dp;\\n\\tdp[{}] = 0;\\n\\trep(i, h)rep(j, w) {\\n\\t\\tmap<vector<int>, int> ndp;\\n\\t\\tfor (auto p : dp) {\\n\\t\\t\\tfill(all(trans), -1);\\n\\t\\t\\trep(i,p.first.size())for (int c : ch[p.first[i]]) {\\n\\t\\t\\t\\ttrans[c] = i;\\n\\t\\t\\t}\\n\\t\\t\\t//white,black\\n\\t\\t\\trep(ad, 2) {\\n\\t\\t\\t\\tif (ad == 0 && s[i][j] == '#')continue;\\n\\t\\t\\t\\tif (ad == 1 && s[i][j] == '.')continue;\\n\\t\\t\\t\\tbool valid = true;\\n\\n\\t\\t\\t\\t//white and white\\n\\t\\t\\t\\tif (ad == 0) {\\n\\t\\t\\t\\t\\tif (i > 0 && trans[j]<0)valid = false;\\n\\t\\t\\t\\t\\tif (j > 0 && trans[j - 1]<0)valid = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//only one and die\\n\\t\\t\\t\\tif (ad == 0) {\\n\\t\\t\\t\\t\\tif (trans[j] >= 0) {\\n\\t\\t\\t\\t\\t\\tif (p.first[trans[j]] == (1 << j))valid = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\t//black cycle\\n\\t\\t\\t\\tif (ad == 1) {\\n\\t\\t\\t\\t\\tif (i > 0 && j > 0 && trans[j] >= 0 && trans[j - 1] >= 0 && trans[j] == trans[j - 1]) {\\n\\t\\t\\t\\t\\t\\tvalid = false;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (!valid)continue;\\n\\t\\t\\t\\tnv.clear();\\n\\t\\t\\t\\tif (ad == 0) {\\n\\t\\t\\t\\t\\tnv = p.first;\\n\\t\\t\\t\\t\\tif (trans[j] >= 0) {\\n\\t\\t\\t\\t\\t\\tnv[trans[j]] ^= (1 << j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tsort(all(nv));\\n\\t\\t\\t\\t\\tif (nv.size() && nv[0] == 0)nv.erase(nv.begin());\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tnv = p.first;\\n\\t\\t\\t\\t\\tif (trans[j] < 0 && (j==0||trans[j - 1] < 0)) {\\n\\t\\t\\t\\t\\t\\tnv.push_back(1 << j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (trans[j] < 0) {\\n\\t\\t\\t\\t\\t\\tnv[trans[j - 1]] |= (1 << j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if ((j==0||trans[j - 1] < 0)) {\\n\\t\\t\\t\\t\\t\\t//\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\t\\tint a = trans[j];\\n\\t\\t\\t\\t\\t\\tint b = trans[j - 1];\\n\\t\\t\\t\\t\\t\\tnv[a] |= nv[b];\\n\\t\\t\\t\\t\\t\\tnv.erase(nv.begin() + b);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tsort(all(nv));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint val = p.second + ad;\\n\\t\\t\\t\\tif (ndp.find(nv) != ndp.end()) {\\n\\t\\t\\t\\t\\tndp[nv] = max(ndp[nv], val);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\tndp[nv] = val;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswap(dp, ndp);\\n\\t}\\n\\tint ans = -1;\\n\\tfor (auto p : dp) {\\n\\t\\tif (p.first.size() <= 1)ans = max(ans, p.second);\\n\\t}\\n\\tcout << ans << \\\"\\\\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\\t//while(cin>>n>>q,n)\\n\\tsolve();\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 4224,\n \"score_of_the_acc\": -0.057,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2314_4107018\",\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//INSERT ABOVE HERE\\nstruct UnionFind{\\n vector<int> ps;\\n UnionFind(int n):ps(n){iota(ps.begin(),ps.end(),0);}\\n int find(int x){\\n if(ps[x]==x) return x;\\n return ps[x]=find(ps[x]);\\n }\\n int same(int x,int y){\\n return find(x)==find(y);\\n }\\n void unite(int x,int y){\\n x=find(x);y=find(y);\\n if(x==y) return;\\n if(x<y) swap(x,y);\\n ps[y]=x;\\n }\\n};\\n\\nsigned main(){\\n int h,w;\\n cin>>h>>w;\\n vector<string> st(h);\\n for(int i=0;i<h;i++) cin>>st[i];\\n\\n if(h==1&&w==1){\\n if(st[0][0]=='.') cout<<0<<endl;\\n else cout<<1<<endl;\\n return 0;\\n }\\n\\n if(w==1){\\n vector<string> vs(w);\\n for(int j=0;j<w;j++){\\n vs[j]=string(h,'%');\\n for(int i=0;i<h;i++) vs[j][i]=st[i][j];\\n }\\n swap(h,w);\\n st=vs;\\n }\\n\\n vector<int> bs(h,0),ws(h,0);\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n bs[i]|=(st[i][j]=='#')<<j;\\n ws[i]|=(st[i][j]=='.')<<j;\\n }\\n }\\n\\n int sz=1<<w;\\n vector<int> cand;\\n for(int bit=0;bit<sz;bit++){\\n vector<int> vs(w);\\n for(int j=0;j<w;j++)\\n vs[j]=(bit>>j)&1;\\n int flg=1;\\n for(int j=0;j+1<w;j++)\\n flg&=vs[j]||vs[j+1];\\n if(flg) cand.emplace_back(bit);\\n }\\n\\n map<vector<int>, int> dp;\\n for(int bit:cand){\\n if(( bit&bs[0])!=bs[0]) continue;\\n if((~bit&ws[0])!=ws[0]) continue;\\n\\n vector<int> vs(w);\\n for(int j=0;j<w;j++)\\n vs[j]=(bit>>j)&1;\\n\\n UnionFind uf(w);\\n for(int j=0;j+1<w;j++)\\n if(vs[j]&&vs[j+1]) uf.unite(j,j+1);\\n\\n for(int j=0;j<w;j++) uf.find(j);\\n vector<int> ps=uf.ps;\\n for(int j=0;j<w;j++)\\n if(!vs[j]) ps[j]=-1;\\n\\n dp[ps]=__builtin_popcount(bit);\\n }\\n\\n for(int i=1;i<h;i++){\\n map<vector<int>, int> nx;\\n for(auto p:dp){\\n vector<int> ps=p.first;\\n for(int bit:cand){\\n if(( bit&bs[i])!=bs[i]) continue;\\n if((~bit&ws[i])!=ws[i]) continue;\\n\\n vector<int> vs(w);\\n for(int j=0;j<w;j++)\\n vs[j]=(bit>>j)&1;\\n\\n // cout<<i<<\\\" \\\"<<p.second<<\\\":\\\"<<bit<<endl;\\n int ng=0;\\n for(int j=0;j<w;j++)\\n if(ps[j]<0&&!vs[j]) ng=1;\\n if(ng) continue;\\n\\n UnionFind uf(w*2);\\n for(int j=0;j+1<w;j++)\\n if(vs[j]&&vs[j+1]) uf.unite(w+j,w+j+1);\\n\\n for(int j=0;j<w;j++)\\n for(int k=0;k<w;k++)\\n if(~ps[j]&&ps[j]==ps[k])\\n uf.unite(j,k);\\n\\n for(int j=0;j<w;j++){\\n if(ps[j]<0||!vs[j]) continue;\\n if(uf.same(j,w+j)) ng=1;\\n uf.unite(j,w+j);\\n }\\n if(ng) continue;\\n\\n for(int j=0;j<w*2;j++) uf.find(j);\\n vector<int> qs=uf.ps;\\n for(int j=0;j<w;j++)\\n if(~ps[j]&&qs[j]<w) ng=1;\\n if(ng) continue;\\n\\n vector<int> rs(w);\\n for(int j=0;j<w;j++) rs[j]=qs[w+j]-w;\\n for(int j=0;j<w;j++) if(!vs[j]) rs[j]=-1;\\n nx[rs];\\n chmax(nx[rs],p.second+__builtin_popcount(bit));\\n }\\n }\\n swap(dp,nx);\\n }\\n\\n int ans=-1;\\n for(auto p:dp){\\n vector<int> ps=p.first;\\n set<int> ss;\\n for(int j=0;j<w;j++)\\n if(~ps[j]) ss.emplace(ps[j]);\\n if(ss.size()==1)\\n chmax(ans,p.second);\\n }\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -0.5268,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2314_3697117\",\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 15\\n#define UNDEFINED 0\\n#define WHITE 1\\n\\nstruct Info{\\n\\tInfo(int arg_row,int arg_col){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t}\\n\\tint row,col;\\n};\\n\\nint H,W;\\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\\nint boss[NUM],height[NUM];\\nbool check[NUM][NUM],FLG;\\nchar table[NUM][NUM];\\nmap<ll,int> dp[NUM][NUM];\\nvector<Info> G[NUM][NUM];\\n\\n\\n//自分のボスのindexを取得しつつ、経路圧縮を行う関数\\nint get_boss(int id){\\n\\tif(boss[id] == id)return id; //自分が代表なら、自分の値を返す\\n\\telse{\\n\\t\\treturn boss[id] = get_boss(boss[id]); //代表でないなら、自分が所属する組織の代表を返しつつ、経路圧縮\\n\\t}\\n}\\n\\nint is_same(int x,int y){\\n\\treturn get_boss(x) == get_boss(y);\\n}\\n\\nvoid unite(int x,int y){\\n\\tint boss_x = get_boss(x);\\n\\tint boss_y = get_boss(y);\\n\\n\\t//既に同じグループなら何もしない\\n\\tif(boss_x == boss_y)return;\\n\\n\\t//高さが高い方に吸収する\\n\\tif(height[x] > height[y]){\\n\\n\\t\\tboss[boss_y] = boss_x;\\n\\n\\t}else if(height[x] < height[y]){\\n\\n\\t\\tboss[boss_x] = boss_y;\\n\\n\\t}else{ //height[x] == height[y]\\n\\n\\t\\tboss[boss_y] = boss_x;\\n\\t\\theight[x]++;\\n\\t}\\n}\\n\\n\\nbool rangeCheck(int row,int col){\\n\\n\\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\\n}\\n\\nll get_code(ll array[NUM]){\\n\\n\\tll ret = 0;\\n\\n\\tfor(int i = 0; i < W; i++){\\n\\n\\t\\tret = 10*ret+array[i];\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nbool is_ok(ll array[NUM]){\\n\\n\\t//白マスが連続していないか調べる\\n\\tfor(int col = 0; col < W-1; col++){\\n\\n\\t\\tif(array[col] == WHITE && array[col+1] == WHITE){\\n\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\n\\t//任意の2つの黒セル間には1本だけ経路がある→グループは1つでなければならない\\n\\tfor(int col = 0; col < W; col++){\\n\\t\\tif(array[col] >= 3){\\n\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\n\\treturn true;\\n}\\n\\nvoid rename(ll array[NUM]){\\n\\n\\tll check[100];\\n\\n\\tfor(int i = 0; i < 100; i++){\\n\\n\\t\\tcheck[i] = -1;\\n\\t}\\n\\n\\tll next_id = 2;\\n\\n\\tfor(int i = 0; i < W; i++){\\n\\t\\tif(array[i] == UNDEFINED || array[i] == WHITE)continue;\\n\\n\\t\\tif(check[array[i]] == -1){\\n\\t\\t\\tcheck[array[i]] = next_id++;\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < W; i++){\\n\\t\\tif(array[i] == UNDEFINED || array[i] == WHITE)continue;\\n\\t\\tarray[i] = check[array[i]];\\n\\t}\\n}\\n\\nint recursive(int row,int col,ll array[NUM],int last_group){\\n\\n\\tif(row == H){\\n\\n\\t\\tif(is_ok(array)){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\treturn -BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tll tmp_code = get_code(array);\\n\\n\\tauto at = dp[row][col].find(tmp_code); //dpは、この状態から見て、これから未来に得られる最大値を持つ\\n\\tif(at != dp[row][col].end()){\\n\\n\\t\\treturn dp[row][col][tmp_code];\\n\\t}\\n\\n\\tint next_row,next_col,next_last_group = last_group;\\n\\tll next_array[2][NUM];\\n\\n\\t//次のrowとcolを設定\\n\\tif(col == W-1){\\n\\n\\t\\tnext_row = row+1;\\n\\t\\tnext_col = 0;\\n\\n\\t}else{\\n\\n\\t\\tnext_row = row;\\n\\t\\tnext_col = col+1;\\n\\t}\\n\\n\\tfor(int i = 0; i < 2; i++){\\n\\t\\tfor(int a = 0; a < W; a++){\\n\\t\\t\\tnext_array[i][a] = array[a];\\n\\t\\t}\\n\\t}\\n\\tint ret = -BIG_NUM;\\n\\n\\t//今回のマスを黒にする\\n\\tif(table[row][col] == '#' || table[row][col] == '?'){\\n\\n\\t\\tif(col > 0 && next_array[0][col-1] != WHITE && //左が黒\\n\\t\\t\\t\\tnext_array[0][col] != WHITE && next_array[0][col] != UNDEFINED && //上が黒\\n\\t\\t\\t\\tnext_array[0][col-1] == next_array[0][col]){ //左と右が同じグループ\\n\\n\\t\\t\\t//Do nothing:閉路ができてしまうので黒で塗れない\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tif(col == 0 || next_array[0][col-1] == WHITE){ //左端、または左が白→左方に黒はない\\n\\n\\t\\t\\t\\tswitch(next_array[0][col]){\\n\\t\\t\\t\\tcase UNDEFINED: //左にも上にも黒はない\\n\\t\\t\\t\\tcase WHITE:\\n\\t\\t\\t\\t\\tnext_array[0][col] = next_last_group++; //新しいグループを作る\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tdefault: //上のマスが黒\\n\\t\\t\\t\\t\\t//Do nothing:上のマスと同じグループにする\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\trename(next_array[0]);\\n\\n\\t\\t\\t\\tret = max(ret,recursive(next_row,next_col,next_array[0],next_last_group)+1);\\n\\n\\t\\t\\t}else{ //col >= 1 && array[col-1] == BLACK\\n\\n\\t\\t\\t\\tswitch(next_array[0][col]){\\n\\t\\t\\t\\tcase UNDEFINED:\\n\\t\\t\\t\\tcase WHITE:\\n\\t\\t\\t\\t\\tnext_array[0][col] = next_array[0][col-1]; //左のgroupと同じにする\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tdefault: //上のマスが黒:上のマスと左のマスは異なるグループであるはず\\n\\n\\t\\t\\t\\t\\tint new_id = next_array[0][col]; //★今回のマスの番号を新しいIDとして使用★\\n\\t\\t\\t\\t\\tint old_id = next_array[0][col-1];\\n\\n\\t\\t\\t\\t\\tfor(int a = 0; a < W; a++){ //同じIDが飛んで存在する場合あり\\n\\t\\t\\t\\t\\t\\tif(next_array[0][a] == old_id){\\n\\n\\t\\t\\t\\t\\t\\t\\tnext_array[0][a] = new_id;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\trename(next_array[0]);\\n\\n\\t\\t\\t\\tret = max(ret,recursive(next_row,next_col,next_array[0],next_last_group)+1);\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tnext_last_group = last_group;\\n\\n\\t//今回のマスを白にする\\n\\tif(table[row][col] == '.' || table[row][col] == '?'){\\n\\n\\t\\t if(next_array[1][col] == WHITE || (col > 0 && next_array[1][col-1] == WHITE)){ //上か左が白\\n\\n\\t\\t\\t //Do nothing:白が連続するので不可\\n\\n\\t\\t }else{ //上にも左にも白はない\\n\\n\\t\\t\\t if(next_array[1][col] != UNDEFINED){ //上のマスが黒\\n\\n\\t\\t\\t\\tint count = 0;\\n\\n\\t\\t\\t\\tfor(int a = 0; a < W; a++){\\n\\t\\t\\t\\t\\tif(next_array[1][a] == array[col]){\\n\\t\\t\\t\\t\\t\\tcount++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(count == 1){\\n\\t\\t\\t\\t\\t//Do nothing:上のマスが孤立するので不可\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t//上のマスが黒で、左に白がない\\n\\n\\t\\t\\t\\t\\tnext_array[1][col] = WHITE;\\n\\n\\t\\t\\t\\t\\trename(next_array[1]);\\n\\n\\t\\t\\t\\t\\tret = max(ret,recursive(next_row,next_col,next_array[1],next_last_group));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t }else{\\n\\n\\t\\t\\t\\t //上のマスがUNDFINEDで、左に白がない\\n\\n\\t\\t\\t\\t next_array[1][col] = WHITE;\\n\\n\\t\\t\\t\\t rename(next_array[1]);\\n\\n\\t\\t\\t\\t ret = max(ret,recursive(next_row,next_col,next_array[1],next_last_group));\\n\\t\\t\\t }\\n\\t\\t }\\n\\t}\\n\\n\\treturn dp[row][col][tmp_code] = ret;\\n}\\n\\nvoid dfs(int row,int col,int pre_row,int pre_col){\\n\\n\\tif(!FLG)return;\\n\\n\\tint next_row,next_col;\\n\\n\\tfor(int i = 0; i < G[row][col].size(); i++){\\n\\n\\t\\tnext_row = G[row][col][i].row;\\n\\t\\tnext_col = G[row][col][i].col;\\n\\n\\t\\tif(next_row == pre_row && next_col == pre_col)continue;\\n\\n\\t\\tif(check[next_row][next_col]){ //有向に遷移しているので、一度訪れた頂点をまた訪れたら閉路あり\\n\\n\\t\\t\\tFLG = false;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tcheck[next_row][next_col] = true;\\n\\n\\t\\tdfs(next_row,next_col,row,col);\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&H,&W);\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\n\\t\\tscanf(\\\"%s\\\",table[row]);\\n\\t}\\n\\n\\t//ややこしいので例外処理\\n\\tif(H == 1 || W == 1){\\n\\n\\t\\tif(H == 1 && W == 1){\\n\\n\\t\\t\\tswitch(table[0][0]){\\n\\t\\t\\tcase '.':\\n\\t\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '#':\\n\\t\\t\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '?':\\n\\t\\t\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else if(H == 1){\\n\\n\\t\\t\\t//白ますが連続していたら不可\\n\\t\\t\\tfor(int col = 0; col < W-1; col++){\\n\\t\\t\\t\\tif(table[0][col] == '.' && table[0][col+1] == '.'){\\n\\t\\t\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint ans = 0;\\n\\n\\t\\t\\t//とりあえず?のところを前部黒にして、連結しているか調べる\\n\\t\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\t\\tif(table[0][col] == '?'){\\n\\t\\t\\t\\t\\ttable[0][col] = '#';\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}else if(table[0][col] == '#'){\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i = 0; i < W; i++){\\n\\n\\t\\t\\t\\tboss[i] = i;\\n\\t\\t\\t\\theight[i] = 0;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int col = 0; col < W-1; col++){\\n\\t\\t\\t\\tif(table[0][col] == '#' && table[0][col+1] == '#'){\\n\\t\\t\\t\\t\\tunite(col,col+1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint num_group = 0;\\n\\n\\t\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\t\\tif(table[0][col] == '#'){\\n\\t\\t\\t\\t\\tif(get_boss(col) == col){\\n\\t\\t\\t\\t\\t\\tnum_group++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(num_group >= 2){\\n\\n\\t\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //W == 1\\n\\n\\n\\t\\t\\t//白ますが連続していたら不可\\n\\t\\t\\tfor(int row = 0; row < H-1; row++){\\n\\t\\t\\t\\tif(table[row][0] == '.' && table[row+1][0] == '.'){\\n\\t\\t\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint ans = 0;\\n\\n\\t\\t\\t//とりあえず?のところを前部黒にして、連結しているか調べる\\n\\t\\t\\tfor(int row = 0; row < H; row++){\\n\\t\\t\\t\\tif(table[row][0] == '?'){\\n\\t\\t\\t\\t\\ttable[row][0] = '#';\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}else if(table[row][0] == '#'){\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i = 0; i < H; i++){\\n\\n\\t\\t\\t\\tboss[i] = i;\\n\\t\\t\\t\\theight[i] = 0;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int row = 0; row < H-1; row++){\\n\\t\\t\\t\\tif(table[row][0] == '#' && table[row+1][0] == '#'){\\n\\t\\t\\t\\t\\tunite(row,row+1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint num_group = 0;\\n\\n\\t\\t\\tfor(int row = 0; row < H; row++){\\n\\t\\t\\t\\tif(table[row][0] == '#'){\\n\\t\\t\\t\\t\\tif(get_boss(row) == row){\\n\\t\\t\\t\\t\\t\\tnum_group++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(num_group >= 2){\\n\\n\\t\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t\\t\\t}\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\tint adj_row,adj_col;\\n\\n\\t//最初から閉路ができてないか調べる(dfsで調べるため、エッジを作る)\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tif(table[row][col] != '#')continue;\\n\\n\\t\\t\\tfor(int i = 0; i < 4; i++){\\n\\n\\t\\t\\t\\tadj_row = row+diff_row[i];\\n\\t\\t\\t\\tadj_col = col+diff_col[i];\\n\\n\\t\\t\\t\\tif(rangeCheck(adj_row,adj_col) == false || table[adj_row][adj_col] != '#')continue;\\n\\n\\t\\t\\t\\tG[row][col].push_back(Info(adj_row,adj_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(table[row][col] != '#')continue;\\n\\n\\t\\t\\tfor(int a = 0; a < H; a++){\\n\\t\\t\\t\\tfor(int b = 0; b < W; b++){\\n\\t\\t\\t\\t\\tcheck[a][b] = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tcheck[row][col] = true;\\n\\t\\t\\tFLG= true;\\n\\n\\t\\t\\tdfs(row,col,-1,-1);\\n\\n\\t\\t\\tif(!FLG){\\n\\n\\t\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tll first_array[NUM];\\n\\n\\tfor(int i = 0; i < W; i++){\\n\\n\\t\\tfirst_array[i] = UNDEFINED;\\n\\t}\\n\\n\\tint ret = recursive(0,0,first_array,2);\\n\\n\\tif(ret < 0){\\n\\n\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t}else{\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",ret);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 21092,\n \"score_of_the_acc\": -0.2435,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2314_3696868\",\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 15\\n#define UNDEFINED 0\\n#define WHITE 1\\n\\nstruct Info{\\n\\tInfo(int arg_row,int arg_col){\\n\\t\\trow = arg_row;\\n\\t\\tcol = arg_col;\\n\\t}\\n\\tint row,col;\\n};\\n\\nint H,W;\\nint diff_row[4] = {-1,0,0,1},diff_col[4] = {0,-1,1,0};\\nint boss[NUM],height[NUM];\\nbool check[NUM][NUM],FLG;\\nchar table[NUM][NUM];\\nmap<ll,int> dp[NUM][NUM];\\nvector<Info> G[NUM][NUM];\\n\\n\\n//自分のボスのindexを取得しつつ、経路圧縮を行う関数\\nint get_boss(int id){\\n\\tif(boss[id] == id)return id; //自分が代表なら、自分の値を返す\\n\\telse{\\n\\t\\treturn boss[id] = get_boss(boss[id]); //代表でないなら、自分が所属する組織の代表を返しつつ、経路圧縮\\n\\t}\\n}\\n\\nint is_same(int x,int y){\\n\\treturn get_boss(x) == get_boss(y);\\n}\\n\\nvoid unite(int x,int y){\\n\\tint boss_x = get_boss(x);\\n\\tint boss_y = get_boss(y);\\n\\n\\t//既に同じグループなら何もしない\\n\\tif(boss_x == boss_y)return;\\n\\n\\t//高さが高い方に吸収する\\n\\tif(height[x] > height[y]){\\n\\n\\t\\tboss[boss_y] = boss_x;\\n\\n\\t}else if(height[x] < height[y]){\\n\\n\\t\\tboss[boss_x] = boss_y;\\n\\n\\t}else{ //height[x] == height[y]\\n\\n\\t\\tboss[boss_y] = boss_x;\\n\\t\\theight[x]++;\\n\\t}\\n}\\n\\n\\nbool rangeCheck(int row,int col){\\n\\n\\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\\n}\\n\\nll get_code(int array[NUM]){\\n\\n\\tll ret = 0;\\n\\n\\tfor(int i = 0; i < W; i++){\\n\\n\\t\\tret = 10*ret+array[i];\\n\\t}\\n\\n\\treturn ret;\\n}\\n\\nbool is_ok(int array[NUM]){\\n\\n\\t//白マスが連続していないか調べる\\n\\tfor(int col = 0; col < W-1; col++){\\n\\n\\t\\tif(array[col] == WHITE && array[col+1] == WHITE){\\n\\n\\t\\t\\treturn false;\\n\\t\\t}\\n\\t}\\n\\n\\treturn true;\\n}\\n\\n\\nint recursive(int row,int col,int array[NUM],int last_group){\\n\\n\\tif(row == H){\\n\\n\\t\\tif(is_ok(array)){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\treturn -BIG_NUM;\\n\\t\\t}\\n\\t}\\n\\n\\tll tmp_code = get_code(array);\\n\\n\\tauto at = dp[row][col].find(tmp_code);\\n\\tif(at != dp[row][col].end()){\\n\\n\\t\\treturn dp[row][col][tmp_code];\\n\\t}\\n\\n\\tint next_row,next_col,next_array[2][NUM],next_last_group = last_group;\\n\\n\\t//次のrowとcolを設定\\n\\tif(col == W-1){\\n\\n\\t\\tnext_row = row+1;\\n\\t\\tnext_col = 0;\\n\\n\\t}else{\\n\\n\\t\\tnext_row = row;\\n\\t\\tnext_col = col+1;\\n\\t}\\n\\n\\tfor(int i = 0; i < 2; i++){\\n\\t\\tfor(int a = 0; a < W; a++){\\n\\t\\t\\tnext_array[i][a] = array[a];\\n\\t\\t}\\n\\t}\\n\\tint ret = -BIG_NUM;\\n\\n\\t//今回のマスを黒にする\\n\\tif(table[row][col] == '#' || table[row][col] == '?'){\\n\\n\\t\\tif(col > 0 && next_array[0][col-1] != WHITE && //左が黒\\n\\t\\t\\t\\tnext_array[0][col] != WHITE && next_array[0][col] != UNDEFINED && //上が黒\\n\\t\\t\\t\\tnext_array[0][col-1] == next_array[0][col]){ //左と右が同じグループ\\n\\n\\t\\t\\t//Do nothing:閉路ができてしまうので黒で塗れない\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tif(col == 0 || next_array[0][col-1] == WHITE){ //左端、または左が白→左方に黒はない\\n\\n\\t\\t\\t\\tswitch(next_array[0][col]){\\n\\t\\t\\t\\tcase UNDEFINED: //左にも上にも黒はない\\n\\t\\t\\t\\tcase WHITE:\\n\\t\\t\\t\\t\\tnext_array[0][col] = next_last_group++; //新しいグループを作る\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tdefault: //上のマスが黒\\n\\t\\t\\t\\t\\t//Do nothing:上のマスと同じグループにする\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tret = max(ret,recursive(next_row,next_col,next_array[0],next_last_group)+1);\\n\\n\\t\\t\\t}else{ //col >= 1 && array[col-1] == BLACK\\n\\n\\t\\t\\t\\tswitch(next_array[0][col]){\\n\\t\\t\\t\\tcase UNDEFINED:\\n\\t\\t\\t\\tcase WHITE:\\n\\t\\t\\t\\t\\tnext_array[0][col] = next_array[0][col-1]; //左のgroupと同じにする\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\tdefault: //上のマスが黒:上のマスと左のマスは異なるグループであるはず\\n\\n\\t\\t\\t\\t\\tint new_id = next_array[0][col]; //★今回のマスの番号を新しいIDとして使用★\\n\\t\\t\\t\\t\\tint old_id = next_array[0][col-1];\\n\\n\\t\\t\\t\\t\\tfor(int a = 0; a < W; a++){ //同じIDが飛んで存在する場合あり\\n\\t\\t\\t\\t\\t\\tif(next_array[0][a] == old_id){\\n\\n\\t\\t\\t\\t\\t\\t\\tnext_array[0][a] = new_id;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tret = max(ret,recursive(next_row,next_col,next_array[0],next_last_group)+1);\\n\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tnext_last_group = last_group;\\n\\n\\t//今回のマスを白にする\\n\\tif(table[row][col] == '.' || table[row][col] == '?'){\\n\\n\\t\\t if(next_array[1][col] == WHITE || (col > 0 && next_array[1][col-1] == WHITE)){ //上か左が白\\n\\n\\t\\t\\t //Do nothing:白が連続するので不可\\n\\n\\t\\t }else{ //上にも左にも白はない\\n\\n\\t\\t\\t if(next_array[1][col] != UNDEFINED){ //上のマスが黒\\n\\n\\t\\t\\t\\tint count = 0;\\n\\n\\t\\t\\t\\tfor(int a = 0; a < W; a++){\\n\\t\\t\\t\\t\\tif(next_array[1][a] == array[col]){\\n\\t\\t\\t\\t\\t\\tcount++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(count == 1){\\n\\t\\t\\t\\t\\t//Do nothing:上のマスが孤立するので不可\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t//上のマスが黒で、左に白がない\\n\\n\\t\\t\\t\\t\\tnext_array[1][col] = WHITE;\\n\\t\\t\\t\\t\\tret = max(ret,recursive(next_row,next_col,next_array[1],next_last_group));\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t }else{\\n\\n\\t\\t\\t\\t //上のマスがUNDFINEDで、左に白がない\\n\\n\\t\\t\\t\\t next_array[1][col] = WHITE;\\n\\t\\t\\t\\t ret = max(ret,recursive(next_row,next_col,next_array[1],next_last_group));\\n\\t\\t\\t }\\n\\t\\t }\\n\\t}\\n\\n\\treturn dp[row][col][tmp_code] = ret;\\n}\\n\\nvoid dfs(int row,int col,int pre_row,int pre_col){\\n\\n\\tif(!FLG)return;\\n\\n\\tint next_row,next_col;\\n\\n\\tfor(int i = 0; i < G[row][col].size(); i++){\\n\\n\\t\\tnext_row = G[row][col][i].row;\\n\\t\\tnext_col = G[row][col][i].col;\\n\\n\\t\\tif(next_row == pre_row && next_col == pre_col)continue;\\n\\n\\t\\tif(check[next_row][next_col]){ //有向に遷移しているので、一度訪れた頂点をまた訪れたら閉路あり\\n\\n\\t\\t\\tFLG = false;\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tcheck[next_row][next_col] = true;\\n\\n\\t\\tdfs(next_row,next_col,row,col);\\n\\t}\\n}\\n\\n\\nint main(){\\n\\n\\tscanf(\\\"%d %d\\\",&H,&W);\\n\\n\\tfor(int row = 0; row < H; row++){\\n\\n\\t\\tscanf(\\\"%s\\\",table[row]);\\n\\t}\\n\\n\\t//ややこしいので例外処理\\n\\tif(H == 1 || W == 1){\\n\\n\\t\\tif(H == 1 && W == 1){\\n\\n\\t\\t\\tswitch(table[0][0]){\\n\\t\\t\\tcase '.':\\n\\t\\t\\t\\tprintf(\\\"0\\\\n\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '#':\\n\\t\\t\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\tcase '?':\\n\\t\\t\\t\\tprintf(\\\"1\\\\n\\\");\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else if(H == 1){\\n\\n\\t\\t\\t//白ますが連続していたら不可\\n\\t\\t\\tfor(int col = 0; col < W-1; col++){\\n\\t\\t\\t\\tif(table[0][col] == '.' && table[0][col+1] == '.'){\\n\\t\\t\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint ans = 0;\\n\\n\\t\\t\\t//とりあえず?のところを前部黒にして、連結しているか調べる\\n\\t\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\t\\tif(table[0][col] == '?'){\\n\\t\\t\\t\\t\\ttable[0][col] = '#';\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}else if(table[0][col] == '#'){\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i = 0; i < W; i++){\\n\\n\\t\\t\\t\\tboss[i] = i;\\n\\t\\t\\t\\theight[i] = 0;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int col = 0; col < W-1; col++){\\n\\t\\t\\t\\tif(table[0][col] == '#' && table[0][col+1] == '#'){\\n\\t\\t\\t\\t\\tunite(col,col+1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint num_group = 0;\\n\\n\\t\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\t\\tif(table[0][col] == '#'){\\n\\t\\t\\t\\t\\tif(get_boss(col) == col){\\n\\t\\t\\t\\t\\t\\tnum_group++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(num_group >= 2){\\n\\n\\t\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t\\t\\t}\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //W == 1\\n\\n\\n\\t\\t\\t//白ますが連続していたら不可\\n\\t\\t\\tfor(int row = 0; row < H-1; row++){\\n\\t\\t\\t\\tif(table[row][0] == '.' && table[row+1][0] == '.'){\\n\\t\\t\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t\\t\\t\\t\\treturn 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint ans = 0;\\n\\n\\t\\t\\t//とりあえず?のところを前部黒にして、連結しているか調べる\\n\\t\\t\\tfor(int row = 0; row < H; row++){\\n\\t\\t\\t\\tif(table[row][0] == '?'){\\n\\t\\t\\t\\t\\ttable[row][0] = '#';\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}else if(table[row][0] == '#'){\\n\\t\\t\\t\\t\\tans++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int i = 0; i < H; i++){\\n\\n\\t\\t\\t\\tboss[i] = i;\\n\\t\\t\\t\\theight[i] = 0;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int row = 0; row < H-1; row++){\\n\\t\\t\\t\\tif(table[row][0] == '#' && table[row+1][0] == '#'){\\n\\t\\t\\t\\t\\tunite(row,row+1);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint num_group = 0;\\n\\n\\t\\t\\tfor(int row = 0; row < H; row++){\\n\\t\\t\\t\\tif(table[row][0] == '#'){\\n\\t\\t\\t\\t\\tif(get_boss(row) == row){\\n\\t\\t\\t\\t\\t\\tnum_group++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(num_group >= 2){\\n\\n\\t\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tprintf(\\\"%d\\\\n\\\",ans);\\n\\t\\t\\t}\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t}\\n\\n\\tint adj_row,adj_col;\\n\\n\\t//最初から閉路ができてないか調べる(dfsで調べるため、エッジを作る)\\n\\tfor(int row = 0; row < H; row++){\\n\\t\\tfor(int col = 0; col < W; col++){\\n\\t\\t\\tif(table[row][col] != '#')continue;\\n\\n\\t\\t\\tfor(int i = 0; i < 4; i++){\\n\\n\\t\\t\\t\\tadj_row = row+diff_row[i];\\n\\t\\t\\t\\tadj_col = col+diff_col[i];\\n\\n\\t\\t\\t\\tif(rangeCheck(adj_row,adj_col) == false || table[adj_row][adj_col] != '#')continue;\\n\\n\\t\\t\\t\\tG[row][col].push_back(Info(adj_row,adj_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(table[row][col] != '#')continue;\\n\\n\\t\\t\\tfor(int a = 0; a < H; a++){\\n\\t\\t\\t\\tfor(int b = 0; b < W; b++){\\n\\t\\t\\t\\t\\tcheck[a][b] = false;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tcheck[row][col] = true;\\n\\t\\t\\tFLG= true;\\n\\n\\t\\t\\tdfs(row,col,-1,-1);\\n\\n\\t\\t\\tif(!FLG){\\n\\n\\t\\t\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t\\t\\t\\treturn 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tint first_array[NUM];\\n\\n\\tfor(int i = 0; i < W; i++){\\n\\n\\t\\tfirst_array[i] = UNDEFINED;\\n\\t}\\n\\n\\tint ret = recursive(0,0,first_array,2);\\n\\n\\tif(ret < 0){\\n\\n\\t\\tprintf(\\\"-1\\\\n\\\");\\n\\t}else{\\n\\n\\t\\tprintf(\\\"%d\\\\n\\\",ret);\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 0.19811320754716982,\n \"time_ms\": 1140,\n \"memory_kb\": 115700,\n \"score_of_the_acc\": -2,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2314_3626649\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<functional>\\n#include<assert.h>\\n#include<numeric>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\\n#define rep(i,n) REP(i,0,n)\\nusing ll = long long;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\nstruct UnionFind{\\n vector<int> par;\\n UnionFind(int n):par(n,-1){}\\n int find(int x){\\n if(par[x]<0)return x;\\n return par[x]=find(par[x]);\\n }\\n bool unite(int x,int y){\\n x=find(x);\\n y=find(y);\\n if(x>y)swap(x,y);\\n if(x==y)return false;\\n else{\\n par[x]+=par[y];\\n par[y]=x;\\n }\\n return true;\\n }\\n\\n bool same(int x,int y){\\n return find(x)==find(y);\\n }\\n int size(int x){\\n return -par[find(x)];\\n }\\n};\\nint main(){\\n int h,w;\\n cin>>h>>w;\\n string s[h];\\n rep(i,h)cin>>s[i];\\n map<ll,int> dp[h];\\n int all=1<<w;\\n rep(i,all){\\n int a[w];\\n rep(j,w){\\n if(s[0][j]=='.')a[j]=0;\\n if(s[0][j]=='#')a[j]=1;\\n if(s[0][j]=='?')a[j]=(i>>j)&1;\\n }\\n UnionFind uf(w+1);\\n bool ok=true;\\n rep(j,w-1){\\n if(a[j]&&a[j+1])uf.unite(j,j+1);\\n if(!a[j]&&!a[j+1])ok=false;\\n }\\n if(!ok)continue;\\n ll res=0;\\n int cnt=0;\\n rep(j,w){\\n res*=12;\\n if(a[j])res+=(uf.find(j)+1),cnt++;\\n }\\n dp[0][res]=max(dp[0][res],cnt);\\n }\\n rep(i,h-1){\\n rep(mask,all){\\n int a[w];\\n bool can=true;\\n rep(j,w){\\n if(s[i+1][j]=='.')a[j]=0;\\n if(s[i+1][j]=='#')a[j]=1;\\n if(s[i+1][j]=='?')a[j]=(mask>>j)&1;\\n }\\n rep(j,w-1){\\n if(!a[j]&&!a[j+1])can=false;\\n }\\n if(!can)continue;\\n for(auto p : dp[i]){\\n int b[w];\\n ll cur=p.first;\\n rep(j,w){\\n b[w-j-1]=12+cur%12;\\n cur/=12;\\n }\\n bool ok=true;\\n UnionFind uf(26);\\n rep(j,w-1){\\n if(a[j]&&a[j+1])uf.unite(j,j+1);\\n }\\n rep(j,w){\\n if(a[j]&&b[j]>12){\\n if(!uf.unite(j,b[j]))ok=false;\\n }\\n if(!a[j]&&b[j]==12)ok=false;\\n }\\n if(i!=h-2||w!=1)rep(j,w)if(uf.find(b[j])>12)ok=false;\\n if(!ok)continue;\\n ll res=0;\\n int cnt=p.second;\\n rep(j,w){\\n res*=12;\\n if(a[j]){\\n res+=(uf.find(j)+1),cnt++;\\n }\\n }\\n dp[i+1][res]=max(dp[i+1][res],cnt);\\n }\\n }\\n }\\n int ans=-1;\\n for(auto p : dp[h-1]){\\n ll cur=p.first;\\n bool ok=true;\\n set<int> st;\\n while(cur){\\n if(cur%12)st.insert(cur%12);\\n cur/=12;\\n }\\n if(st.size()==1||st.size()==0)ans=max(ans,p.second);\\n }\\n\\n cout<<ans<<endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 4444,\n \"score_of_the_acc\": -0.4875,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2314_3626636\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<algorithm>\\n#include<vector>\\n#include<iomanip>\\n#include<math.h>\\n#include<complex>\\n#include<queue>\\n#include<deque>\\n#include<stack>\\n#include<map>\\n#include<set>\\n#include<bitset>\\n#include<functional>\\n#include<assert.h>\\n#include<numeric>\\nusing namespace std;\\n#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )\\n#define rep(i,n) REP(i,0,n)\\nusing ll = long long;\\nconst int inf=1e9+7;\\nconst ll longinf=1LL<<60 ;\\nconst ll mod=1e9+7 ;\\n\\nstruct UnionFind{\\n vector<int> par;\\n UnionFind(int n):par(n,-1){}\\n int find(int x){\\n if(par[x]<0)return x;\\n return par[x]=find(par[x]);\\n }\\n bool unite(int x,int y){\\n x=find(x);\\n y=find(y);\\n if(x>y)swap(x,y);\\n if(x==y)return false;\\n else{\\n par[x]+=par[y];\\n par[y]=x;\\n }\\n return true;\\n }\\n\\n bool same(int x,int y){\\n return find(x)==find(y);\\n }\\n int size(int x){\\n return -par[find(x)];\\n }\\n};\\nint main(){\\n int h,w;\\n cin>>h>>w;\\n string s[h];\\n rep(i,h)cin>>s[i];\\n map<ll,int> dp[h];\\n int all=1<<w;\\n rep(i,all){\\n int a[w];\\n rep(j,w){\\n if(s[0][j]=='.')a[j]=0;\\n if(s[0][j]=='#')a[j]=1;\\n if(s[0][j]=='?')a[j]=(i>>j)&1;\\n }\\n UnionFind uf(w+1);\\n bool ok=true;\\n rep(j,w-1){\\n if(a[j]&&a[j+1])uf.unite(j,j+1);\\n if(!a[j]&&!a[j+1])ok=false;\\n }\\n if(!ok)continue;\\n ll res=0;\\n int cnt=0;\\n rep(j,w){\\n res*=12;\\n if(a[j])res+=(uf.find(j)+1),cnt++;\\n }\\n dp[0][res]=max(dp[0][res],cnt);\\n }\\n rep(i,h-1){\\n rep(mask,all){\\n int a[w];\\n bool can=true;\\n rep(j,w){\\n if(s[i+1][j]=='.')a[j]=0;\\n if(s[i+1][j]=='#')a[j]=1;\\n if(s[i+1][j]=='?')a[j]=(mask>>j)&1;\\n }\\n rep(j,w-1){\\n if(!a[j]&&!a[j+1])can=false;\\n }\\n if(!can)continue;\\n for(auto p : dp[i]){\\n int b[w];\\n ll cur=p.first;\\n rep(j,w){\\n b[w-j-1]=12+cur%12;\\n cur/=12;\\n }\\n bool ok=true;\\n UnionFind uf(26);\\n rep(j,w-1){\\n if(a[j]&&a[j+1])uf.unite(j,j+1);\\n }\\n rep(j,w){\\n if(a[j]&&b[j]>12){\\n if(!uf.unite(j,b[j]))ok=false;\\n }\\n if(!a[j]&&b[j]==12)ok=false;\\n }\\n if(i!=h-2)rep(j,w)if(uf.find(b[j])>12)ok=false;\\n if(!ok)continue;\\n ll res=0;\\n int cnt=p.second;\\n rep(j,w){\\n res*=12;\\n if(a[j]){\\n res+=(uf.find(j)+1),cnt++;\\n }\\n }\\n dp[i+1][res]=max(dp[i+1][res],cnt);\\n }\\n }\\n }\\n int ans=-1;\\n for(auto p : dp[h-1])ans=max(ans,p.second);\\n cout<<ans<<endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 0.4811320754716981,\n \"time_ms\": 570,\n \"memory_kb\": 4256,\n \"score_of_the_acc\": -0.4948,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2314_3351555\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nclass UnionFind{\\n vector<int> par;\\n vector<int> rank;\\n public:\\n UnionFind(int n):rank(n),par(n){\\n iota(par.begin(),par.end(),0);\\n }\\n int find(int x){\\n if(par[x]==x) return x;\\n else return par[x]=find(par[x]);\\n }\\n void unite(int x,int y){\\n x=find(x),y=find(y);\\n if(rank[x]<rank[y]) par[x]=y;\\n else{\\n if(rank[x]==rank[y]) rank[x]++;\\n par[y]=x;\\n }\\n }\\n bool isSame(int x,int y){\\n return find(x)==find(y);\\n }\\n};\\nint main(){\\n int h,w;\\n cin>>h>>w;\\n vector<string> c(h);\\n for(int i=0;i<h;i++) cin>>c[i];\\n \\n vector<int> vec;\\n for(int bit=0;bit<(1<<w);bit++){\\n bool isok=true;\\n for(int i=0;i+1<w;i++){\\n isok = isok && (((bit>>i)&1) || ((bit>>(i+1))&1));\\n }\\n if(isok) vec.push_back(bit);\\n }\\n auto isValid=[&](int bit,int row){\\n bool isok=true;\\n for(int i=0;i<w;i++){\\n if(c[row][i]=='#'){\\n isok= isok && ((bit>>i)&1);\\n }\\n else if(c[row][i]=='.'){\\n isok= isok && (!((bit>>i)&1));\\n }\\n }\\n return isok;\\n };\\n map<vector<int>,int> dp;\\n map<vector<int>,int> dpX;\\n for(auto bit:vec){\\n if(!isValid(bit,0)) continue;\\n vector<int> st(w);\\n int idx=1;\\n for(int i=0;i<w;i++){\\n if((bit>>i)&1){\\n for(;i<w;i++){\\n if(!((bit>>i)&1)) break;\\n st[i]=idx;\\n }\\n idx++;\\n }\\n }\\n\\n dp[st]=__builtin_popcount(bit);\\n }\\n dpX=dp;\\n for(int i=1;i<h;i++){\\n if(i+1==h) dpX=dp;\\n map<vector<int>,int> next;\\n for(auto bit:vec){\\n if(!isValid(bit,i)) continue;\\n for(auto &e:dp){\\n vector<int> st=e.first;\\n int cnt=e.second;\\n bool isok=true;\\n int v=*max_element(st.begin(),st.end());\\n vector<int> hasChil(v);\\n for(int i=0;i<w;i++){\\n isok = isok && !(st[i]==0 && ((bit>>i)&1)==0);\\n if(st[i]!=0){\\n hasChil[st[i]-1]=true;\\n }\\n }\\n if(accumulate(hasChil.begin(),hasChil.end(),0)!=v) continue;\\n UnionFind u(v+w);\\n for(int i=0;i<w;i++){\\n if(!((bit>>i)&1)) continue;\\n if(st[i]!=0){\\n if(u.isSame(st[i]-1,v+i)){\\n isok=false;\\n break; \\n }\\n u.unite(st[i]-1,v+i);\\n }\\n if(((bit>>(i+1))&1)){\\n u.unite(v+i,v+i+1);\\n }\\n }\\n if(!isok) continue;\\n for(int i=0;i<v;i++){\\n for(int j=0;j<=w;j++){\\n if(j==w){\\n isok=false;\\n break;\\n }\\n if(u.isSame(i,v+j)) break;\\n }\\n }\\n if(!isok) continue;\\n int idx=1;\\n vector<int> to(w);\\n \\n for(int i=0;i<w;i++){\\n if(!((bit>>i)&1)) continue;\\n for(int j=0;j<i;j++){\\n if(u.isSame(v+i,v+j)){\\n to[i]=to[j];\\n break;\\n }\\n }\\n if(to[i]==0) to[i]=idx++;\\n }\\n next[to]=max(next[to],cnt+__builtin_popcount(bit));\\n }\\n }\\n dp=next;\\n }\\n int res=-1;\\n for(int i=0;i<=w;i++){\\n if(i==w && w==1){\\n for(auto &e:dpX){\\n if(*max_element(e.first.begin(),e.first.end())>1) continue;;\\n res=max(res,e.second);\\n } \\n break;\\n }\\n if(i==w) break;\\n if(c[h-1][i]=='#') break;\\n }\\n \\n for(auto &e:dp){\\n if(*max_element(e.first.begin(),e.first.end())>1) continue;;\\n res=max(res,e.second);\\n }\\n cout<<res<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.6719,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2314_3351551\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nclass UnionFind{\\n vector<int> par;\\n vector<int> rank;\\n public:\\n UnionFind(int n):rank(n),par(n){\\n iota(par.begin(),par.end(),0);\\n }\\n int find(int x){\\n if(par[x]==x) return x;\\n else return par[x]=find(par[x]);\\n }\\n void unite(int x,int y){\\n x=find(x),y=find(y);\\n if(rank[x]<rank[y]) par[x]=y;\\n else{\\n if(rank[x]==rank[y]) rank[x]++;\\n par[y]=x;\\n }\\n }\\n bool isSame(int x,int y){\\n return find(x)==find(y);\\n }\\n};\\nint main(){\\n int h,w;\\n cin>>h>>w;\\n vector<string> c(h);\\n for(int i=0;i<h;i++) cin>>c[i];\\n if(h==2){\\n \\n }\\n vector<int> vec;\\n for(int bit=0;bit<(1<<w);bit++){\\n bool isok=true;\\n for(int i=0;i+1<w;i++){\\n isok = isok && (((bit>>i)&1) || ((bit>>(i+1))&1));\\n }\\n if(isok) vec.push_back(bit);\\n }\\n auto isValid=[&](int bit,int row){\\n bool isok=true;\\n for(int i=0;i<w;i++){\\n if(c[row][i]=='#'){\\n isok= isok && ((bit>>i)&1);\\n }\\n else if(c[row][i]=='.'){\\n isok= isok && (!((bit>>i)&1));\\n }\\n }\\n return isok;\\n };\\n map<vector<int>,int> dp;\\n map<vector<int>,int> dpX;\\n for(auto bit:vec){\\n if(!isValid(bit,0)) continue;\\n vector<int> st(w);\\n int idx=1;\\n for(int i=0;i<w;i++){\\n if((bit>>i)&1){\\n for(;i<w;i++){\\n if(!((bit>>i)&1)) break;\\n st[i]=idx;\\n }\\n idx++;\\n }\\n }\\n dp[st]=__builtin_popcount(bit);\\n }\\n for(int i=1;i<h;i++){\\n if(i+1==h) dpX=dp;\\n map<vector<int>,int> next;\\n for(auto bit:vec){\\n if(!isValid(bit,i)) continue;\\n for(auto &e:dp){\\n vector<int> st=e.first;\\n int cnt=e.second;\\n bool isok=true;\\n int v=*max_element(st.begin(),st.end());\\n vector<int> hasChil(v);\\n for(int i=0;i<w;i++){\\n isok = isok && !(st[i]==0 && ((bit>>i)&1)==0);\\n if(st[i]!=0){\\n hasChil[st[i]-1]=true;\\n }\\n }\\n if(accumulate(hasChil.begin(),hasChil.end(),0)!=v) continue;\\n UnionFind u(v+w);\\n for(int i=0;i<w;i++){\\n if(!((bit>>i)&1)) continue;\\n if(st[i]!=0){\\n if(u.isSame(st[i]-1,v+i)){\\n isok=false;\\n break; \\n }\\n u.unite(st[i]-1,v+i);\\n }\\n if(((bit>>(i+1))&1)){\\n u.unite(v+i,v+i+1);\\n }\\n }\\n if(!isok) continue;\\n for(int i=0;i<v;i++){\\n for(int j=0;j<=w;j++){\\n if(j==w){\\n isok=false;\\n break;\\n }\\n if(u.isSame(i,v+j)) break;\\n }\\n }\\n if(!isok) continue;\\n int idx=1;\\n vector<int> to(w);\\n \\n for(int i=0;i<w;i++){\\n if(!((bit>>i)&1)) continue;\\n for(int j=0;j<i;j++){\\n if(u.isSame(v+i,v+j)){\\n to[i]=to[j];\\n break;\\n }\\n }\\n if(to[i]==0) to[i]=idx++;\\n }\\n next[to]=max(next[to],cnt+__builtin_popcount(bit));\\n }\\n }\\n dp=next;\\n }\\n int res=-1;\\n for(int i=0;i<=w;i++){\\n if(i==w && w==1){\\n for(auto &e:dpX){\\n if(*max_element(e.first.begin(),e.first.end())!=1) continue;;\\n res=max(res,e.second);\\n } \\n break;\\n }\\n if(c[h-1][i]=='#') break;\\n }\\n \\n for(auto &e:dp){\\n if(*max_element(e.first.begin(),e.first.end())!=1) continue;;\\n res=max(res,e.second);\\n }\\n cout<<res<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.6132075471698113,\n \"time_ms\": 790,\n \"memory_kb\": 4080,\n \"score_of_the_acc\": -0.6896,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2314_2897859\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <cstring>\\n#include <map>\\nusing namespace std;\\n\\nint H, W;\\nchar board[15][15];\\nusing Board = map<string, map<int, int> >;\\nvoid chmax(int &A, int B) { A = max(A, B); }\\n\\nstring get_uni(string s, int x, int mode) {\\n vector<int> v(10), checked(10); iota(v.begin(), v.end(), 0);\\n if(mode == 1) {\\n if(x != 0 && isdigit(s[x]) && isdigit(s[x-1])) {\\n int a = s[x] - '0', b = s[x-1] - '0';\\n v[a] = b;\\n }\\n else {\\n bool exist_num = false;\\n if(x != 0 && isdigit(s[x-1])) {\\n exist_num = true;\\n s[x] = s[x-1];\\n }\\n if(isdigit(s[x])) {\\n exist_num = true;\\n }\\n\\n if(!exist_num) {\\n s[x] = '8';\\n }\\n }\\n }\\n\\n string ret = \\\"\\\";\\n int id = 0;\\n for(int i=0; i<W; i++) {\\n if(isdigit(s[i])) {\\n int val = v[ s[i] - '0' ];\\n if(!checked[val]) checked[val] = ++id;\\n ret += (char)('0' + checked[val]);\\n }\\n else {\\n ret += s[i];\\n }\\n }\\n return ret;\\n}\\n\\nbool valid(string s) {\\n int pre = -1;\\n for(auto c : s) {\\n if(isdigit(c)) {\\n if(pre == -1) pre = c - '0';\\n else if(pre != c - '0') return false;\\n }\\n }\\n return true;\\n}\\n\\nstring to_bin(int N) {\\n string ret = \\\"\\\";\\n for(int i=0; i<W; i++, N>>=1) {\\n int c = (N & 1);\\n ret += (char)('0' + c);\\n }\\n return ret;\\n}\\n\\nint main() {\\n scanf(\\\"%d%d\\\", &H, &W);\\n for(int i=0; i<H; i++) {\\n for(int j=0; j<W; j++) {\\n scanf(\\\" %c\\\", &board[i][j]);\\n }\\n }\\n\\n string emp_str(W, '.');\\n Board cur, nxt;\\n cur[emp_str][0] = 0;\\n\\n for(int pos=0; pos<H*W; pos++) {\\n int row = pos / W, col = pos % W;\\n char c = board[row][col];\\n for(auto x : cur) {\\n string uni = x.first;\\n for(auto y : cur[uni]) {\\n int bit = y.first, pre = y.second;\\n int base = bit - ((bit >> col & 1) << col);\\n\\n // paint (black)\\n if(c == '#' || c == '?') {\\n if(col == 0 || (uni[col] != uni[col-1] || !isdigit(uni[col]))) {\\n string tmp = uni;\\n\\n tmp = get_uni(tmp, col, 1); \\n int nbit = base | (1 << col);\\n chmax(nxt[tmp][nbit], pre + 1);\\n }\\n }\\n\\n // paint (white)\\n if(c == '.' || c == '?') {\\n bool ok = true;\\n if(row != 0 && !(bit >> col & 1)) ok = false;\\n if(col != 0 && !(bit >> (col - 1) & 1)) ok = false;\\n\\n char target = uni[col];\\n int cnt = 0;\\n for(int i=0; i<W; i++) cnt += (uni[i] == target);\\n if(isdigit(target) && cnt == 1 && W != 1) ok = false;\\n\\n if(ok) {\\n string tmp = uni;\\n tmp[col] = '.';\\n tmp = get_uni(tmp, col, 0);\\n\\n int nbit = base;\\n chmax(nxt[tmp][nbit], pre);\\n }\\n }\\n }\\n }\\n cur.clear();\\n swap(cur, nxt);\\n }\\n\\n int ans = -1;\\n for(auto x : cur) {\\n string uni = x.first;\\n if(!valid(uni)) continue;\\n \\n for(auto y : cur[uni]) {\\n int val = y.second;\\n chmax(ans, val);\\n }\\n }\\n printf(\\\"%d\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 4188,\n \"score_of_the_acc\": -0.2085,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2314_2897858\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <cstring>\\n#include <map>\\nusing namespace std;\\n\\nint H, W;\\nchar board[15][15];\\nusing Board = map<string, map<int, int> >;\\nvoid chmax(int &A, int B) { A = max(A, B); }\\n\\nstring get_uni(string s, int x, int mode) {\\n vector<int> v(10), checked(10); iota(v.begin(), v.end(), 0);\\n if(mode == 1) {\\n if(x != 0 && isdigit(s[x]) && isdigit(s[x-1])) {\\n int a = s[x] - '0', b = s[x-1] - '0';\\n v[a] = b;\\n }\\n else {\\n bool exist_num = false;\\n if(x != 0 && isdigit(s[x-1])) {\\n exist_num = true;\\n s[x] = s[x-1];\\n }\\n if(isdigit(s[x])) {\\n exist_num = true;\\n }\\n\\n if(!exist_num) {\\n s[x] = '8';\\n }\\n }\\n }\\n\\n string ret = \\\"\\\";\\n int id = 0;\\n for(int i=0; i<W; i++) {\\n if(isdigit(s[i])) {\\n int val = v[ s[i] - '0' ];\\n if(!checked[val]) checked[val] = ++id;\\n ret += (char)('0' + checked[val]);\\n }\\n else {\\n ret += s[i];\\n }\\n }\\n return ret;\\n}\\n\\nbool valid(string s) {\\n int pre = -1;\\n for(auto c : s) {\\n if(isdigit(c)) {\\n if(pre == -1) pre = c - '0';\\n else if(pre != c - '0') return false;\\n }\\n }\\n return true;\\n}\\n\\nstring to_bin(int N) {\\n string ret = \\\"\\\";\\n for(int i=0; i<W; i++, N>>=1) {\\n int c = (N & 1);\\n ret += (char)('0' + c);\\n }\\n return ret;\\n}\\n\\nint main() {\\n scanf(\\\"%d%d\\\", &H, &W);\\n for(int i=0; i<H; i++) {\\n for(int j=0; j<W; j++) {\\n scanf(\\\" %c\\\", &board[i][j]);\\n }\\n }\\n\\n string emp_str(W, '.');\\n Board cur, nxt;\\n cur[emp_str][0] = 0;\\n\\n for(int pos=0; pos<H*W; pos++) {\\n int row = pos / W, col = pos % W;\\n char c = board[row][col];\\n for(auto x : cur) {\\n string uni = x.first;\\n for(auto y : cur[uni]) {\\n int bit = y.first, pre = y.second;\\n // printf(\\\"row = %d, col = %d, dp[%s][%s] = %d\\\\n\\\", row+1, col+1, uni.c_str(), to_bin(bit).c_str(), pre);\\n\\n int base = bit - ((bit >> col & 1) << col);\\n\\n // paint (black)\\n if(c == '#' || c == '?') {\\n // printf(\\\"cond 1: row = %d, col = %d\\\\n\\\", row+1, col+1);\\n if(col == 0 || (uni[col] != uni[col-1] || !isdigit(uni[col]))) {\\n string tmp = uni;\\n\\n // printf(\\\"tmp = %s, \\\", tmp.c_str());\\n tmp = get_uni(tmp, col, 1);\\n // printf(\\\"nxt = %s\\\\n\\\", tmp.c_str());\\n \\n int nbit = base | (1 << col);\\n chmax(nxt[tmp][nbit], pre + 1);\\n }\\n }\\n\\n // paint (white)\\n if(c == '.' || c == '?') {\\n // printf(\\\"cond 2: row = %d, col = %d\\\\n\\\", row+1, col+1);\\n\\n bool ok = true;\\n if(row != 0 && !(bit >> col & 1)) ok = false;\\n if(col != 0 && !(bit >> (col - 1) & 1)) ok = false;\\n\\n char target = uni[col];\\n int cnt = 0;\\n for(int i=0; i<W; i++) cnt += (uni[i] == target);\\n if(isdigit(target) && cnt == 1 && W != 1) ok = false;\\n\\n if(ok) {\\n string tmp = uni;\\n tmp[col] = '.';\\n tmp = get_uni(tmp, col, 0);\\n\\n int nbit = base;\\n chmax(nxt[tmp][nbit], pre);\\n }\\n }\\n }\\n }\\n cur.clear();\\n swap(cur, nxt);\\n }\\n\\n int ans = -1;\\n for(auto x : cur) {\\n string uni = x.first;\\n if(!valid(uni)) continue;\\n \\n for(auto y : cur[uni]) {\\n int val = y.second;\\n chmax(ans, val);\\n }\\n }\\n printf(\\\"%d\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 4200,\n \"score_of_the_acc\": -0.2086,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2314_2897385\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <cstring>\\nusing namespace std;\\n\\nint H, W;\\nchar board[15][15];\\nint dp[2][180000][51];\\n\\nvoid chmax(int &A, int B) {\\n A = max(A, B);\\n}\\n\\nint B;\\nint merge(int A, int i) {\\n while(A >= B) A -= B;\\n \\n int b = A % 3;\\n A = A - (A % 3);\\n if(b == 1 && i != 0) {\\n b = i = 2;\\n }\\n A = (A + b) * 3 + i;\\n return A;\\n}\\nint get_head(int A) {\\n return A / B;\\n}\\nint get_tail(int A) {\\n return A % 3;\\n}\\nvoid thr_eval(int val, int &cnt_black, int &cnt_white, int &cnt_adj_b) {\\n if(val == 0) {\\n cnt_white++;\\n }\\n if(val == 1) {\\n cnt_black++;\\n }\\n if(val == 2) {\\n cnt_black++;\\n cnt_adj_b++;\\n }\\n}\\n\\nint main() {\\n scanf(\\\"%d%d\\\", &H, &W);\\n for(int i=0; i<H; i++) {\\n for(int j=0; j<W; j++) {\\n scanf(\\\" %c\\\", &board[i][j]);\\n }\\n }\\n\\n int P = H*W, Q = 50;\\n B = 1;\\n for(int i=0; i<W-1; i++) B *= 3;\\n\\n memset(dp, -1, sizeof(dp));\\n dp[0][0][0] = 0;\\n for(int pos=0; pos<P; pos++) {\\n int row = pos / W, col = pos % W;\\n int cur = pos % 2, nxt = 1 - cur;\\n for(int bit=0; bit<(3*B); bit++) {\\n for(int diff=0; diff<Q; diff++) {\\n if(dp[cur][bit][diff] < 0) continue;\\n\\n int val = dp[cur][bit][diff];\\n\\n int cnt_black = 0, cnt_white = 0, cnt_adj_b = 0;\\n // 真上\\n if(row != 0) {\\n int val = get_head(bit);\\n thr_eval(val, cnt_black, cnt_white, cnt_adj_b);\\n }\\n // 左隣\\n if(col != 0) {\\n int val = get_tail(bit);\\n thr_eval(val, cnt_black, cnt_white, cnt_adj_b);\\n }\\n\\n char c = board[row][col];\\n if(c == '#' || c == '?') {\\n int n_diff = diff + 1 - cnt_black;\\n int n_self = (cnt_black ? 2 : 1);\\n if(n_diff > 0) {\\n int nbit = merge(bit, n_self);\\n chmax(dp[nxt][nbit][n_diff], val + 1);\\n // printf(\\\"dp[%d][%d][%d] = %d\\\\n\\\", nxt, nbit, n_diff, val + 1);\\n }\\n }\\n if(c == '.' || c == '?') {\\n if(row != 0) {\\n if(get_head(bit) == 1 && val != 1) continue;\\n }\\n if(row == H-1 && col != 0) {\\n if(get_tail(bit) == 1 && val != 1) continue;\\n }\\n\\n if(cnt_white == 0) {\\n int nbit = merge(bit, 0);\\n chmax(dp[nxt][nbit][diff], val);\\n // printf(\\\"dp[%d][%d][%d] = %d\\\\n\\\", nxt, nbit, diff, val);\\n }\\n }\\n\\n dp[cur][bit][diff] = -1;\\n }\\n }\\n }\\n\\n int ans = -1;\\n for(int bit=0; bit<3*B; bit++) {\\n if(dp[P%2][bit][1] < 0) continue;\\n chmax(ans, dp[P%2][bit][1]);\\n }\\n printf(\\\"%d\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 0.2169811320754717,\n \"time_ms\": 680,\n \"memory_kb\": 74476,\n \"score_of_the_acc\": -1.2208,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2314_2897381\",\n \"code_snippet\": \"#include <cstdio>\\n#include <algorithm>\\n#include <cstring>\\nusing namespace std;\\n\\nint H, W;\\nchar board[15][15];\\nint dp[2][180000][51];\\n\\nvoid chmax(int &A, int B) {\\n A = max(A, B);\\n}\\n\\nint B;\\nint merge(int A, int i) {\\n while(A >= B) A -= B;\\n \\n int b = A % 3;\\n A = A - (A % 3);\\n if(b == 1 && i != 0) {\\n b = i = 2;\\n }\\n A = (A + b) * 3 + i;\\n return A;\\n}\\nint get_head(int A) {\\n return A / B;\\n}\\nint get_tail(int A) {\\n return A % 3;\\n}\\nvoid thr_eval(int val, int &cnt_black, int &cnt_white, int &cnt_adj_b) {\\n if(val == 0) {\\n cnt_white++;\\n }\\n if(val == 1) {\\n cnt_black++;\\n }\\n if(val == 2) {\\n cnt_black++;\\n cnt_adj_b++;\\n }\\n}\\n\\nint main() {\\n scanf(\\\"%d%d\\\", &H, &W);\\n for(int i=0; i<H; i++) {\\n for(int j=0; j<W; j++) {\\n scanf(\\\" %c\\\", &board[i][j]);\\n }\\n }\\n\\n int P = H*W, Q = 50;\\n B = 1;\\n for(int i=0; i<W-1; i++) B *= 3;\\n\\n memset(dp, -1, sizeof(dp));\\n dp[0][0][0] = 0;\\n for(int pos=0; pos<P; pos++) {\\n int row = pos / W, col = pos % W;\\n int cur = pos % 2, nxt = 1 - cur;\\n for(int bit=0; bit<(3*B); bit++) {\\n for(int diff=0; diff<Q; diff++) {\\n if(dp[cur][bit][diff] < 0) continue;\\n\\n int val = dp[cur][bit][diff];\\n\\n int cnt_black = 0, cnt_white = 0, cnt_adj_b = 0;\\n // 真上\\n if(row != 0) {\\n int val = get_head(bit);\\n thr_eval(val, cnt_black, cnt_white, cnt_adj_b);\\n }\\n // 左隣\\n if(col != 0) {\\n int val = get_tail(bit);\\n thr_eval(val, cnt_black, cnt_white, cnt_adj_b);\\n }\\n\\n char c = board[row][col];\\n if(c == '#' || c == '?') {\\n int n_diff = diff + 1 - cnt_black;\\n int n_self = (cnt_black ? 2 : 1);\\n if(n_diff > 0) {\\n int nbit = merge(bit, n_self);\\n chmax(dp[nxt][nbit][n_diff], val + 1);\\n }\\n }\\n if(c == '.' || c == '?') {\\n if(row != 0) {\\n if(get_head(bit) == 1) continue;\\n }\\n if(row == H-1 && col != 0) {\\n if(get_tail(bit) == 1) continue;\\n }\\n\\n if(cnt_white == 0) {\\n int nbit = merge(bit, 0);\\n chmax(dp[nxt][nbit][diff], val);\\n }\\n }\\n\\n dp[cur][bit][diff] = -1;\\n }\\n }\\n }\\n\\n int ans = -1;\\n for(int bit=0; bit<3*B; bit++) {\\n if(dp[P%2][bit][1] < 0) continue;\\n chmax(ans, dp[P%2][bit][1]);\\n }\\n printf(\\\"%d\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 0.05660377358490566,\n \"time_ms\": 20,\n \"memory_kb\": 74476,\n \"score_of_the_acc\": -0.6315,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1297,"cells":{"group_id":{"kind":"string","value":"aoj_2318_cpp"},"problem_description":{"kind":"string","value":"問題文\nキュゥべえ\nはワルプルギスの夜に向けて魔女の合成に明け暮れている．ワルプルギスの夜のために，特別な\nグリーフシード\n(魔女の卵) を使って手に入れやすい魔女をうまく合成し目的である舞台装置の魔女を創り上げなければならないからである．\nキュゥべえ\nは手に入れやすい種類の魔女の\nグリーフシード\nから魔女の素となるものを取り出し，空の特別な\nグリーフシード\nに入れることで，その\nグリーフシード\nに魔女を宿らせることができる．また，この世界には，ある組み合わせで複数の魔女を合成すると新たな\n1\nつの魔女を生み出すことができるという合成法則がいくつかある．そこで，いくつかの特別な\nグリーフシード\nを使い，それらの中にある魔女の素となるものを合成し，\n1\nつの特別な\nグリーフシード\nに新たな魔女を宿らせることができる．また，合成した結果空となった特別な\nグリーフシード\nは再利用することができる．例えば，\n3\n個の特別な\nグリーフシード\nに入った魔女を合成すると，それらの\n3\n個の\nグリーフシード\nは，新たな魔女が宿った\n1\n個の特別な\nグリーフシード\nと\n2\n個の空の特別な\nグリーフシード\nとなる．しかし，同じ種類の魔女を同時に複数の\nグリーフシード\nに入れることは出来ない．\nキュゥべえ\nは魔女の特別な\nグリーフシード\nへの寄宿と魔女の合成を繰り返すことにより舞台装置の魔女を創りだしたい．舞台装置の魔女を創りだすにはいくつの特別な\nグリーフシード\nが必要か求めよ．\n入力形式\n入力は以下のような形式で与えられる．\nN\\ E\\ T\\\\\nW_1\\ W_2\\ …\\ W_N\\\\\nG_1\\ C_1\\ S_{1,1}\\ S_{1,2}\\ …\\ S_{1,C_1}\\\\\nG_2\\ C_2\\ S_{2,1}\\ S_{2,2}\\ …\\ S_{2,C_2}\\\\\n…\\\\\nG_E\\ C_E\\ S_{E,1}\\ S_{E,2}\\ …\\ S_{E,C_E}\\\\\nN\nは魔女の種類の個数，\nE\nは合成法則の個数，\nT\nは舞台装置の魔女の番号である．\nW_i\nは\ni\n番目の魔女が手に入れやすい魔女であるかどうかを表し，\n1\nならば手に入れやすい魔女であり，\n0\nならば手に入れやすい魔女ではない．\n続く\nE\n行に合成法則が次のように表される：「番号が\nS_{i,1}\\ S_{i,2}\\ …\\ S_{i,C_i}\nの魔女を合成することによって\nG_i\nの番号の魔女が得られる．」\n出力形式\n舞台装置の魔女を創りだすのに最低限必要な特別な\nグリーフシード\nの個数を出力せよ．創りだすことができない場合は\n-1\nを出力せよ．\n制約\n1 \\lt N \\leq 300\n0 \\leq E \\leq 1000\n1 \\leq T \\leq N\n0 \\leq W_i \\leq 1\\ (1 \\leq i \\leq N)\n1 \\leq G_i \\leq N\\ (1 \\leq i \\leq E)\n2 \\leq C_i \\leq 10\\ (1 \\leq i \\leq E)\n1 \\leq S_{i,j} \\leq N\\ (1 \\leq i \\leq E,\\ 1 \\leq j \\leq C_i)\n\\{G_i, S_{i,1}\\ S_{i,2}\\ …\\ S_{i,C_i}\\}\nは全て異なる．\n入力中に同一の合成法則が\n2\n回以上現れることはない．\n入出力例\n入力例 1\n3 1 3\n1 1 0\n3 2 1 2\n出力例1\n2\n入力例 2\n5 0 1\n1 1 1 1 1\n出力例 2\n1\n入力例 3\n18 5 1\n0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1\n1 4 2 3 4 5\n2 2 6 7\n3 3 8 9 10\n4 4 11 12 13 14\n5 4 15 16 17 18\n出力例 3\n5\n入力例 4\n6 4 6\n1 1 1 0 0 0\n4 2 1 2\n5 2 2 3\n6 2 4 5\n6 3 1 2 4\n出力例 4\n3\n入力例 5\n13 9 13\n1 1 0 1 1 0 1 1 0 1 1 0 0\n3 2 1 2\n6 2 4 5\n9 2 7 8\n12 2 10 11\n6 2 2 3\n9 2 5 6\n12 2 8 9\n3 2 11 12\n13 4 3 6 9 12\n出力例 5\n5\n入力例 6\n4 4 4\n1 1 0 0\n1 2 2 3\n2 2 3 1\n3 2 1 2\n3 3 1 2 4\n出力例 6\n-1\nProblem Setter: Flat35"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2318_9799752","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate <typename T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <typename T, typename U> T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <typename T, typename U> T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate <typename T> int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate <typename T> int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate <typename T> int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate <typename T> void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate <typename T1, typename T2, typename... T3>\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n/**\n * @brief template\n */\n\nint main() {\n int N, E, T;\n cin >> N >> E >> T;\n T--;\n vector<int> W(N);\n rep(i,0,N) cin >> W[i];\n vector<int> G(E);\n vector<vector<int>> S(E);\n rep(i,0,E) {\n cin >> G[i];\n G[i]--;\n int C;\n cin >> C;\n S[i].resize(C);\n rep(j,0,C) cin >> S[i][j], S[i][j]--;\n }\n vector<int> DP(N,inf);\n rep(i,0,N) if (W[i] == 1) DP[i] = 1;\n rep(_,0,4000) {\n rep(i,0,E) {\n vector<int> V;\n rep(j,0,S[i].size()) V.push_back(DP[S[i][j]]);\n sort(ALL(V));\n reverse(ALL(V));\n int MAX = -inf;\n rep(j,0,S[i].size()) chmax(MAX, V[j]+j);\n chmin(DP[G[i]],MAX);\n }\n }\n cout << (DP[T] == inf ? -1 : DP[T]) << endl;\n}","accuracy":1,"time_ms":400,"memory_kb":3492,"score_of_the_acc":-1.1559,"final_rank":20},{"submission_id":"aoj_2318_9579000","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#include <cmath>\n#include <algorithm>\n#define INF 2000000000\n\nusing namespace std;\n\nstruct WitchCraft {\n int result_witch;\n int ingredient_count;\n vector<int> ingredients;\n};\n\nint witch_count, rule_count, target_witch;\nint powers[11], bit_population[1024];\nint pending_dependencies[1000], synthesis_matrix[1000][300];\nint min_seeds_needed[300];\nint dp_table[1024];\nvector<int> dependency_graph[1000];\nWitchCraft synthesis_rules[1000];\n\nvoid initialize_powers() {\n for (int i = 0; i < 11; ++i) {\n powers[i] = 1 << i;\n }\n}\n\nvoid precompute_bit_populations() {\n for (int mask = 0; mask < powers[10]; ++mask) {\n int count = 0;\n for (int i = 0; i < 10; ++i) {\n if (mask & (1 << i)) {\n ++count;\n }\n }\n bit_population[mask] = count;\n }\n}\n\nvoid input_data() {\n cin >> witch_count >> rule_count >> target_witch;\n \n for (int i = 0; i < rule_count; ++i) {\n pending_dependencies[i] = 0;\n fill(synthesis_matrix[i], synthesis_matrix[i] + witch_count, 0);\n }\n\n fill(min_seeds_needed, min_seeds_needed + witch_count, INF);\n\n for (int i = 0; i < witch_count; ++i) {\n int availability;\n cin >> availability;\n if (availability == 1) {\n min_seeds_needed[i] = 1;\n }\n }\n\n for (int i = 0; i < rule_count; ++i) {\n cin >> synthesis_rules[i].result_witch >> synthesis_rules[i].ingredient_count;\n --synthesis_rules[i].result_witch;\n for (int j = 0; j < synthesis_rules[i].ingredient_count; ++j) {\n int ingredient;\n cin >> ingredient;\n --ingredient;\n synthesis_rules[i].ingredients.push_back(ingredient);\n if (min_seeds_needed[ingredient] == INF) {\n dependency_graph[ingredient].push_back(i);\n ++pending_dependencies[i];\n synthesis_matrix[i][ingredient] = 1;\n }\n }\n }\n}\n\nvoid process_syntheses() {\n queue<int> ready_synthesis;\n \n for (int i = 0; i < rule_count; ++i) {\n if (pending_dependencies[i] == 0) {\n ready_synthesis.push(i);\n }\n }\n\n while (!ready_synthesis.empty()) {\n int current_rule = ready_synthesis.front();\n ready_synthesis.pop();\n\n int num_ingredients = synthesis_rules[current_rule].ingredient_count;\n fill(dp_table, dp_table + powers[num_ingredients], INF);\n dp_table[0] = 0;\n\n for (int mask = 0; mask < powers[num_ingredients] - 1; ++mask) {\n for (int bit = 0; bit < num_ingredients; ++bit) {\n if (!(mask & (1 << bit))) {\n int next_mask = mask | (1 << bit);\n int reusable_seeds = dp_table[mask] - bit_population[mask];\n dp_table[next_mask] = min(dp_table[next_mask], dp_table[mask] + max(0, min_seeds_needed[synthesis_rules[current_rule].ingredients[bit]] - reusable_seeds));\n }\n }\n }\n\n bool updated = false;\n int &result_witch_seeds = min_seeds_needed[synthesis_rules[current_rule].result_witch];\n if (result_witch_seeds > dp_table[powers[num_ingredients] - 1]) {\n result_witch_seeds = dp_table[powers[num_ingredients] - 1];\n updated = true;\n }\n\n for (int dep : dependency_graph[synthesis_rules[current_rule].result_witch]) {\n if (synthesis_matrix[dep][synthesis_rules[current_rule].result_witch] == 1) {\n synthesis_matrix[dep][synthesis_rules[current_rule].result_witch] = 0;\n if (--pending_dependencies[dep] == 0) {\n ready_synthesis.push(dep);\n }\n } else if (updated && pending_dependencies[dep] == 0) {\n ready_synthesis.push(dep);\n }\n }\n }\n}\n\nvoid output_result() {\n if (min_seeds_needed[target_witch - 1] == INF) {\n cout << \"-1\\n\";\n } else {\n cout << min_seeds_needed[target_witch - 1] << \"\\n\";\n }\n}\n\nint main() {\n initialize_powers();\n precompute_bit_populations();\n input_data();\n process_syntheses();\n output_result();\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4664,"score_of_the_acc":-0.7527,"final_rank":17},{"submission_id":"aoj_2318_9578991","code_snippet":"#include <bits/stdc++.h>\ntypedef long long ll;\ntypedef unsigned long long ull;\n#define MAX_COST 2000000000\n#define MODULO 1000000007\n#define EPSILON 1e-9\nusing namespace std;\n\nstruct Synthesis {\n int final_witch;\n int num_ingredients;\n vector<int> ingredients;\n};\n\nint num_witches, num_synthesis_rules, target_witch;\nint powers_of_two[11], bit_count[1024];\nint dependency_count[1000], synthesis_dependency[1000][300];\nint min_grief_seeds[300];\nint dp[1024];\nvector<int> dependency_graph[1000];\nSynthesis syntheses[1000];\n\nint main() {\n for (int i = 0; i < 11; i++) {\n powers_of_two[i] = pow(2, i);\n }\n\n // Precompute the number of bits set for each possible state\n for (int state = 0; state < powers_of_two[10]; state++) {\n int bit_sum = 0;\n for (int bit = 0; bit < 10; bit++) {\n if (state & (1 << bit)) {\n bit_sum++;\n }\n }\n bit_count[state] = bit_sum;\n }\n\n // Input number of witches, synthesis rules, and the target witch\n scanf(\"%d %d %d\", &num_witches, &num_synthesis_rules, &target_witch);\n\n // Initialize dependency arrays\n for (int i = 0; i < num_synthesis_rules; i++) {\n dependency_count[i] = 0;\n for (int j = 0; j < num_witches; j++) {\n synthesis_dependency[i][j] = 0;\n }\n }\n\n // Set the initial minimum grief seeds required for each witch to a large number\n for (int i = 0; i < num_witches; i++) {\n min_grief_seeds[i] = MAX_COST;\n }\n\n // Input initial availability of witches\n int availability;\n for (int i = 0; i < num_witches; i++) {\n scanf(\"%d\", &availability);\n if (availability == 1) {\n min_grief_seeds[i] = 1;\n }\n }\n\n // Input synthesis rules\n for (int i = 0; i < num_synthesis_rules; i++) {\n scanf(\"%d %d\", &syntheses[i].final_witch, &syntheses[i].num_ingredients);\n syntheses[i].final_witch--;\n\n for (int j = 0; j < syntheses[i].num_ingredients; j++) {\n scanf(\"%d\", &availability);\n availability--;\n syntheses[i].ingredients.push_back(availability);\n if (min_grief_seeds[availability] == MAX_COST) {\n dependency_graph[availability].push_back(i);\n dependency_count[i]++;\n synthesis_dependency[i][availability] = 1;\n }\n }\n }\n\n // Start with synthesis rules that have no dependencies\n queue<int> ready_to_synthesize;\n for (int i = 0; i < num_synthesis_rules; i++) {\n if (dependency_count[i] == 0) {\n ready_to_synthesize.push(i);\n }\n }\n\n while (!ready_to_synthesize.empty()) {\n int current_rule = ready_to_synthesize.front();\n ready_to_synthesize.pop();\n\n int num_ingredients = syntheses[current_rule].num_ingredients;\n for (int state = 0; state < powers_of_two[num_ingredients]; state++) {\n dp[state] = MAX_COST;\n }\n dp[0] = 0;\n\n for (int state = 0; state < powers_of_two[num_ingredients] - 1; state++) {\n for (int ingredient = 0; ingredient < num_ingredients; ingredient++) {\n if (state & (1 << ingredient)) {\n continue;\n }\n int next_state = state + powers_of_two[ingredient];\n int available_grief_seeds = dp[state] - bit_count[state];\n dp[next_state] = min(dp[next_state], dp[state] + max(0, min_grief_seeds[syntheses[current_rule].ingredients[ingredient]] - available_grief_seeds));\n }\n }\n\n bool updated = false;\n if (min_grief_seeds[syntheses[current_rule].final_witch] > dp[powers_of_two[num_ingredients] - 1]) {\n min_grief_seeds[syntheses[current_rule].final_witch] = dp[powers_of_two[num_ingredients] - 1];\n updated = true;\n }\n\n for (int i = 0; i < dependency_graph[syntheses[current_rule].final_witch].size(); i++) {\n int next_rule = dependency_graph[syntheses[current_rule].final_witch][i];\n if (synthesis_dependency[next_rule][syntheses[current_rule].final_witch] == 1) {\n synthesis_dependency[next_rule][syntheses[current_rule].final_witch] = 0;\n dependency_count[next_rule]--;\n if (dependency_count[next_rule] == 0) {\n ready_to_synthesize.push(next_rule);\n }\n } else {\n if (!updated) continue;\n if (dependency_count[next_rule] == 0) {\n ready_to_synthesize.push(next_rule);\n }\n }\n }\n }\n\n target_witch--;\n if (min_grief_seeds[target_witch] == MAX_COST) {\n printf(\"-1\\n\");\n } else {\n printf(\"%d\\n\", min_grief_seeds[target_witch]);\n }\n\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":5224,"score_of_the_acc":-1.0256,"final_rank":19},{"submission_id":"aoj_2318_7110954","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, e, t;\n cin >> n >> e >> t;\n vector<int> w(n);\n for (int i = 0; i < n; i++) {\n cin >> w[i];\n }\n const int inf = 1e9;\n vector<int> ans(n, inf);\n for (int i = 0; i < n; i++) {\n if (w[i]) {\n ans[i] = 1;\n }\n }\n vector<int> g(e);\n vector<vector<int>> s(e);\n for (int i = 0; i < e; i++) {\n cin >> g[i];\n g[i]--;\n int c;\n cin >> c;\n for (int j = 0; j < c; j++) {\n int x;\n cin >> x;\n x--;\n s[i].emplace_back(x);\n }\n }\n for (int z = 0; z < e; z++) {\n for (int i = 0; i < e; i++) {\n vector<int> a;\n for (int x: s[i]) {\n a.emplace_back(ans[x]);\n }\n sort(a.rbegin(), a.rend());\n int b = 1;\n for (int j = 0; j < (int) a.size(); j++) {\n b = max(b, a[j] + j);\n }\n ans[g[i]] = min(ans[g[i]], b);\n }\n }\n t--;\n cout << (ans[t] == inf ? -1 : ans[t]) << '\\n';\n}","accuracy":1,"time_ms":110,"memory_kb":3488,"score_of_the_acc":-0.4104,"final_rank":16},{"submission_id":"aoj_2318_6706476","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 int N, E, T;\n cin >> N >> E >> T;\n --T;\n vector<int> W(N);\n for (auto& x : W) cin >> x;\n vector<vector<int>> S(E);\n vector<int> G(E);\n rep(i,0,E) {\n int C;\n cin >> G[i] >> C;\n --G[i];\n S[i].resize(C);\n for (auto& x : S[i]) cin >> x, --x;\n }\n vector<int> dist(N, 1e9);\n using P = pair<int, int>;\n priority_queue<P, vector<P>, greater<>> pq;\n rep(i,0,N) if (W[i]) {\n dist[i] = 1;\n pq.push({i, 1});\n }\n vector<bool> visited(N);\n while (!pq.empty()) {\n int d, i;\n tie(d, i) = pq.top();\n pq.pop();\n if (d > dist[i]) continue;\n rep(j,0,E) {\n if (visited[G[j]]) continue;\n vector<int> cost;\n for (int k : S[j]) cost.push_back(dist[k]);\n sort(all(cost));\n reverse(all(cost));\n int m = 0;\n rep(k,0,cost.size()) chmax(m, k+cost[k]);\n if (m < dist[G[j]]) {\n dist[G[j]] = m;\n pq.push({m, G[j]});\n }\n }\n }\n cout << (dist[T] < 1e9 ? dist[T] : -1) << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3452,"score_of_the_acc":-0.1621,"final_rank":8},{"submission_id":"aoj_2318_6333207","code_snippet":"#include \"bits/stdc++.h\"\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#define int long long\n\nvoid solve()\n{\n int n, e, t;\n cin >> n >> e >> t;\n t--;\n vector<int> dp(n, 1e18);\n vector<vector<int>> vertexs[400];\n REP(i, n)\n {\n int a;\n cin >> a;\n if (a == 1)\n dp[i] = 1;\n }\n REP(i, e)\n {\n int target;\n int a;\n cin >> target;\n cin >> a;\n target--;\n vector<int> gogo;\n REP(q, a)\n {\n int b;\n cin >> b;\n b--;\n gogo.push_back(b);\n }\n vertexs[target].push_back(gogo);\n }\n\n REP(i, n)\n {\n REP(q, n)\n {\n for (auto x : vertexs[q])\n {\n vector<int> tmps;\n REP(q, x.size())\n {\n tmps.push_back(dp[x[q]]);\n }\n sort(ALL(tmps));\n reverse(ALL(tmps));\n int target = 0;\n REP(q, tmps.size())\n {\n target = max(target, tmps[q] + q);\n }\n dp[q] = min(dp[q], target);\n }\n }\n }\n if (dp[t] == 1e18)\n dp[t] = -1;\n cout << dp[t] << 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":40,"memory_kb":3504,"score_of_the_acc":-0.2387,"final_rank":14},{"submission_id":"aoj_2318_6044117","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define eps 1e-9\n#define INF 2000000000 // 2e9\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\n#define all(x) (x).begin(), (x).end()\n#define sq(x) ((x) * (x))\n\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\n\n#define popcount __builtin_popcount\n#define next __next\n#define prev __prev\n\n#ifndef LOCAL\n#define dmp(...) ;\n#else\n#define dmp(...) \\\n cerr << \"[ \" << #__VA_ARGS__ << \" ] : \" << dump_str(__VA_ARGS__) << endl\n#endif\n\n// ---------------- Utility ------------------\n\ntemplate <class T>\nbool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a >= b) return false;\n a = b;\n return true;\n}\n\ntemplate <class T>\nusing MaxHeap = priority_queue<T>;\n\ntemplate <class T>\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\n\ntemplate <class T>\nvector<T> vect(int len, T elem) {\n return vector<T>(len, elem);\n}\n\n// ----------------- Input -------------------\n\ntemplate <class T, class U>\nistream &operator>>(istream &is, pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\n\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &vec) {\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\n return is;\n}\n\n// ----------------- Output ------------------\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n return os << p.first << ',' << p.second;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (const T &e : v) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const deque<T> &d) {\n for (const T &e : d) os << e << \" \";\n return os;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const set<T> &s) {\n os << \"{ \";\n for (const T &e : s) os << e << \" \";\n return os << \"}\";\n}\n\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const map<T, U> &m) {\n os << \"{ \";\n for (const auto &[key, val] : m) os << \"( \" << key << \" -> \" << val << \" ) \";\n return os << \"}\";\n}\n\ntemplate <class TupleTy, size_t... I>\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\n (..., (os << (I == 0 ? \"\" : \",\") << std::get<I>(t)));\n}\n\ntemplate <class... Args>\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\n os << \"(\";\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\n return os << \")\";\n}\n\nvoid dump_str_rec(ostringstream &) {}\n\ntemplate <class Head, class... Tail>\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\n oss << \", \" << head;\n dump_str_rec(oss, forward<Tail>(tail)...);\n}\n\ntemplate <class T, class... U>\nstring dump_str(T &&arg, U &&... args) {\n ostringstream oss;\n oss << arg;\n dump_str_rec(oss, forward<U>(args)...);\n return oss.str();\n}\n\n// --------------- Fast I/O ------------------\n\nvoid fastio() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n cout << fixed << setprecision(20);\n}\n\n// ------------------ ACL --------------------\n\n// #include <atcoder/modint>\n// constexpr int MOD = 998244353;\n// constexpr int MOD = 1000000007;\n// using mint = atcoder::static_modint<MOD>;\n// ostream &operator<<(ostream &os, const mint &v) {\n// return os << v.val();\n// }\n\n// ------------ End of template --------------\n\n#define endl \"\\n\"\nusing ll = long long;\nusing pii = pair<int, int>;\n\nconst bool multitest = false;\n\nvoid solve() {\n int N, E, T;\n cin >> N >> E >> T;\n T--;\n vector<int> dp(N, INF);\n for (int i = 0; i < N; i++) {\n int w;\n cin >> w;\n if (w == 1) dp[i] = 1;\n }\n\n vector<int> g(E);\n vector<vector<int>> S(E);\n for (int i = 0; i < E; i++) {\n cin >> g[i];\n g[i]--;\n int C;\n cin >> C;\n S[i].resize(C);\n for (int j = 0; j < C; j++) {\n cin >> S[i][j];\n S[i][j]--;\n }\n }\n\n for (int _ = 0; _ < N; _++) {\n for (int i = 0; i < E; i++) {\n vector<int> cs;\n bool ready = true;\n for (int j : S[i]) {\n if (dp[j] == INF) {\n ready = false;\n break;\n }\n cs.push_back(dp[j]);\n }\n if (!ready) continue;\n sort(all(cs), greater<int>());\n dmp(cs);\n int need = 0;\n for (int j = 0; j < cs.size(); j++) chmax(need, j + cs[j]);\n chmin(dp[g[i]], need);\n }\n }\n\n if (dp[T] == INF)\n cout << -1 << endl;\n else\n cout << dp[T] << endl;\n return;\n}\n\nint main() {\n fastio();\n if (!multitest) {\n solve();\n } else {\n cerr << \"[Warning] Multi testcase mode on\" << endl;\n int t;\n cin >> t;\n while (t--) solve();\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3484,"score_of_the_acc":-0.1777,"final_rank":11},{"submission_id":"aoj_2318_6022950","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;\n\nstruct FastIO {\n FastIO() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n }\n} fastiofastio;\n\nconst ll 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 main() {\n int N, E, T;\n cin >> N >> E >> T;\n T--;\n vector<int> W(N);\n for (int i = 0; i < N; i++)\n cin >> W[i];\n vector<vector<int>> S(E);\n vector<int> G(E), C(E);\n for (int i = 0; i < E; i++) {\n cin >> G[i] >> C[i];\n G[i]--;\n S[i].resize(C[i]);\n for (int j = 0; j < C[i]; j++) {\n cin >> S[i][j];\n S[i][j]--;\n }\n }\n vector<int> need(N, 1 << 25);\n for (int i = 0; i < N; i++) {\n if (W[i])\n need[i] = 1;\n }\n while (1) {\n bool update = 0;\n for (int i = 0; i < E; i++) {\n vector<int> vec;\n for (int j = 0; j < C[i]; j++) {\n vec.push_back(need[S[i][j]]);\n }\n sort(ALL(vec), greater<int>());\n int ma = 0;\n for (int j = 0; j < C[i]; j++)\n ma = max(ma, j + vec[j]);\n if (need[G[i]] > ma) {\n need[G[i]] = ma;\n update = 1;\n break;\n }\n }\n if (!update)\n break;\n }\n if (need[T] != 1 << 25)\n cout << need[T] << endl;\n else\n cout << -1 << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3460,"score_of_the_acc":-0.166,"final_rank":9},{"submission_id":"aoj_2318_5882811","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;\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nint main(){\n int n,e,t; cin >> n >> e >> t; t--;\n vl dp(n,inf);\n vb vi(n,false);\n rep(i,n){\n int w; cin >> w;\n if(w == 1) dp[i] = 1, vi[i] = true;\n }\n vector<vvl> G(n);\n rep(i,e){\n int g,c; cin >> g >> c; g--;\n vl v(c);\n rep(j,c) cin >> v[j], v[j]--;\n G[g].push_back(v);\n }\n rep(z,2020){\n rep(u,n){\n for(auto v : G[u]){\n vl costs;\n for(auto x : v){\n costs.push_back(dp[x]);\n }\n sort(rall(costs));\n ll s = 0;\n rep(i,costs.size()) chmax(s,costs[i]+i);\n chmin(dp[u],s);\n }\n }\n }\n ll ans = dp[t];\n if(ans == inf) ans = -1;\n cout << ans << endl;\n}","accuracy":1,"time_ms":250,"memory_kb":3456,"score_of_the_acc":-0.7538,"final_rank":18},{"submission_id":"aoj_2318_5676171","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N, E, T;\n cin >> N >> E >> T;\n T--;\n vector<int> W(N);\n for (auto&& w : W) {\n cin >> w;\n }\n vector<int> G(E), C(E);\n vector<vector<int>> S(E);\n for (int i = 0; i < E; i++) {\n cin >> G[i] >> C[i];\n G[i]--;\n S[i].resize(C[i]);\n for (auto&& s : S[i]) {\n cin >> s;\n s--;\n }\n }\n\n const int INF = 1e7;\n vector<int> cost(N, INF);\n vector<bool> seen(N, false);\n priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> que;\n for (int i = 0; i < N; i++) {\n if (W[i]) {\n que.push({0, i});\n cost[i] = 1;\n }\n }\n while (!que.empty()) {\n auto [c, now] = que.top();\n que.pop();\n if (seen[now])\n continue;\n seen[now] = true;\n for (int i = 0; i < E; i++) {\n int g = G[i], c = C[i];\n auto& s = S[i];\n if (seen[g])\n continue;\n vector<int> V(c);\n for (int j = 0; j < c; j++) {\n V[j] = cost[s[j]];\n }\n sort(begin(V), end(V), greater{});\n int c_nxt = 0;\n for (int j = 0; j < c; j++) {\n c_nxt = max(c_nxt, V[j] + j);\n }\n if (cost[g] > c_nxt) {\n cost[g] = c_nxt;\n que.push({c_nxt, g});\n }\n }\n }\n cout << (cost[T] >= INF ? -1 : cost[T]) << endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3504,"score_of_the_acc":-0.1618,"final_rank":7},{"submission_id":"aoj_2318_5380837","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 10000000;\nint main(){\n int N, E, T;\n cin >> N >> E >> T;\n T--;\n vector<int> W(N);\n for (int i = 0; i < N; i++){\n cin >> W[i];\n }\n vector<int> G(E), C(E);\n vector<vector<int>> S(E);\n for (int i = 0; i < E; i++){\n cin >> G[i] >> C[i];\n G[i]--;\n S[i] = vector<int>(C[i]);\n for (int j = 0; j < C[i]; j++){\n cin >> S[i][j];\n S[i][j]--;\n }\n }\n vector<int> d(N, INF);\n for (int i = 0; i < N; i++){\n if (W[i] == 1){\n d[i] = 1;\n }\n }\n for (int i = 0; i < N; i++){\n for (int j = 0; j < E; j++){\n vector<int> cnt(C[j]);\n for (int k = 0; k < C[j]; k++){\n cnt[k] = d[S[j][k]];\n }\n sort(cnt.begin(), cnt.end(), greater<int>());\n int mx = 0;\n for (int k = 0; k < C[j]; k++){\n mx = max(mx, cnt[k] + k);\n }\n d[G[j]] = min(d[G[j]], mx);\n }\n }\n if (d[T] == INF){\n cout << -1 << endl;\n } else {\n cout << d[T] << endl;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3172,"score_of_the_acc":-0.0256,"final_rank":1},{"submission_id":"aoj_2318_5304541","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=305,INF=1<<30;\n\nint dp[MAX];\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n int N,M,X;cin>>N>>M>>X;\n X--;\n for(int i=0;i<N;i++){\n int x;cin>>x;\n dp[i]=INF;\n if(x==1) dp[i]=1;\n }\n \n vector<int> target(M);\n vector<vector<int>> need(M);\n \n for(int i=0;i<M;i++){\n cin>>target[i];\n target[i]--;\n \n int k;cin>>k;\n need[i].resize(k);\n for(int j=0;j<k;j++){\n cin>>need[i][j];\n need[i][j]--;\n }\n }\n \n for(int q=0;q<N;q++){\n for(int i=0;i<M;i++){\n vector<int> A;\n for(int a:need[i]) A.push_back(dp[a]);\n sort(all(A));\n reverse(all(A));\n if(A.front()==INF) continue;\n \n int ma=0;\n for(int j=0;j<si(A);j++){\n chmax(ma,A[j]+j);\n }\n chmin(dp[target[i]],ma);\n }\n }\n \n if(dp[X]==INF) dp[X]=-1;\n \n cout<<dp[X]<<endl;\n}","accuracy":1,"time_ms":30,"memory_kb":3532,"score_of_the_acc":-0.2267,"final_rank":13},{"submission_id":"aoj_2318_5269555","code_snippet":"//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i=0; i<n; ++i)\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\nusing ll = int64_t;\nusing ull = uint64_t;\nusing ld = long double;\nusing P = pair<int, int>;\nusing vs = vector<string>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using PQG = priority_queue<T, vector<T>, greater<T>>;\nconst int INF = 0xccccccc;\nconst ll LINF = 0xcccccccccccccccLL;\ntemplate<typename T1, typename T2>\ninline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}\ntemplate<typename T1, typename T2>\ninline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}\ntemplate<typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}\ntemplate<typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}\n\n\n\n//head\n\n\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, e, t;\n cin >> n >> e >> t;\n vi dp(n+1);\n rep(i, n) {\n int w;\n cin >> w;\n if(w) dp[i+1] = 1;\n else dp[i+1] = INF;\n }\n vi g(e), c(e);\n vvi s(e);\n rep(i, e) {\n cin >> g[i] >> c[i];\n s[i].resize(c[i]);\n rep(j, c[i]) cin >> s[i][j];\n }\n PQ<int> q;\n rep(i, n-1) rep(j, e) {\n rep(k, c[j]) q.emplace(dp[s[j][k]]);\n int u = 0;\n int now = c[j];\n while(!q.empty()) {\n chmax(now, q.top()+(u++));\n q.pop();\n }\n chmin(dp[g[j]], now);\n }\n if(dp[t] == INF) puts(\"-1\");\n else cout << dp[t] << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3492,"score_of_the_acc":-0.1816,"final_rank":12},{"submission_id":"aoj_2318_4956557","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint n,m,r,a,b,d[350],e[1000],inf=1e8,cnt;\nvector<int> v[1000],u;\nint main(void){\n cin>>n>>m>>r;\n for(int i=0;i<n;i++){\n cin>>d[i];\n if(d[i]==0)d[i]=inf;\n }\n for(int i=0;i<m;i++){\n cin>>e[i]>>a;\n e[i]--;\n for(int j=0;j<a;j++){\n cin>>b;\n b--;\n v[i].push_back(b);\n }\n }\n for(int i=0;i<m;i++){\n for(int j=0;j<m;j++){\n u={};\n for(int x:v[j]){\n u.push_back(d[x]);\n\n }\n sort(u.begin(),u.end());\n reverse(u.begin(),u.end());\n cnt=0;\n for(int k=0;k<u.size();k++){\n //cout<<u[k]<<endl;\n cnt=max(cnt,u[k]+k);\n }\n d[e[j]]=min(d[e[j]],cnt);\n }\n }\n r--;\n if(d[r]==inf)cout<<-1<<endl;\n else cout<<d[r]<<endl;\n}","accuracy":1,"time_ms":50,"memory_kb":3488,"score_of_the_acc":-0.2566,"final_rank":15},{"submission_id":"aoj_2318_4925833","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\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n\n int n, e, t; cin >> n >> e >> t;\n t--;\n vi w(n, INF);\n REP(i, n) {\n int now; cin >> now;\n if(now) w[i] = 1;\n }\n\n vector<vector<vector<int>>> g(n);\n\n REP(i, e) {\n int a; cin >> a;\n a--;\n int c; cin >> c;\n vi v;\n REP(j, c) {\n int s; cin >> s;\n s--;\n v.push_back(s);\n }\n g[a].emplace_back(v);\n }\n\n REP(i, n-1) {\n REP(j, n) {\n for(auto &v: g[j]) {\n int sz = SZ(v);\n vi v2(sz);\n bool ok = true;\n REP(k, sz) {\n if(v[k] == INF) {\n ok = false;\n break;\n }\n v2[k] = w[v[k]];\n }\n if(!ok) continue;\n sort(v2.rbegin(), v2.rend());\n int cost = 0;\n REP(k, sz) {\n chmax(cost, v2[k] + k);\n }\n chmin(w[j], cost);\n }\n }\n }\n\n cout << (w[t] == INF ? -1 : w[t]) << endl;\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3520,"score_of_the_acc":-0.1696,"final_rank":10},{"submission_id":"aoj_2318_4818076","code_snippet":"#include<iostream>\n#include<cstdio>\n#include<cstring>\n#include<string>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<deque>\n#include<iomanip>\n#include<tuple>\n#include<cassert>\n#include<set>\nusing namespace std;\ntypedef long long int LL;\ntypedef pair<int,int> P;\ntypedef pair<LL,int> LP;\nconst int INF=1<<30;\nconst LL MAX=1e9+7;\n\nvoid array_show(int *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%d%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(LL *array,int array_n,char middle=' '){\n for(int i=0;i<array_n;i++)printf(\"%lld%c\",array[i],(i!=array_n-1?middle:'\\n'));\n}\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%d%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\n if(vec_n==-1)vec_n=vec_s.size();\n for(int i=0;i<vec_n;i++)printf(\"%lld%c\",vec_s[i],(i!=vec_n-1?middle:'\\n'));\n}\n\n\n\nint main(){\n int n,m,p;\n int i,j,k;\n int a,b,c;\n cin>>n>>m>>p;\n p--;\n vector<int> vs(n,INF),mak(m);\n vector<vector<int>> comp(m);\n for(i=0;i<n;i++){\n cin>>a;\n if(a)vs[i]=1;\n }\n for(i=0;i<m;i++){\n cin>>a>>j;\n mak[i]=a-1;\n while(j--){\n cin>>b;\n comp[i].push_back(b-1);\n }\n }\n vector<int> v1;\n for(i=0;i<n;i++){\n for(j=0;j<m;j++){\n v1.clear();\n for(auto num:comp[j])v1.push_back(vs[num]);\n sort(v1.rbegin(),v1.rend());\n a=vs[mak[j]],b=0;\n for(k=0;k<v1.size();k++){\n b=max(b,v1[k]+k);\n }\n vs[mak[j]]=min(a,b);\n }\n }\n a=vs[p];\n if(a>=INF)a=-1;\n cout<<a<<endl;\n}","accuracy":1,"time_ms":10,"memory_kb":3248,"score_of_the_acc":-0.037,"final_rank":2},{"submission_id":"aoj_2318_4274349","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1e+8;\n\nsigned main(){\n\tint n,e,t,w[310],g[1010],c[1010],s[1010][12];\n\tcin >> n >> e >> t; t--;\n\tint d[310];\n\tfor(int i = 0;i < n;i++){\n\t\tcin >> w[i];\n\t\td[i] = (w[i] ? 1 : INF);\n\t}\n\tfor(int i = 0;i < e;i++){\n\t\tcin >> g[i] >> c[i]; g[i]--;\n\t\tfor(int j = 0;j < c[i];j++){\n\t\t\tcin >> s[i][j]; s[i][j]--;\n\t\t}\n\t}\n\tfor(int i = 0;i < n;i++){\n\t\tfor(int j = 0;j < e;j++){\n\t\t\tint ma = 0;\n\t\t\tvector<int> vec;\n\t\t\tfor(int k = 0;k < c[j];k++) vec.push_back(d[s[j][k]]);\n\t\t\tsort(vec.begin(),vec.end(),greater<int>());\n\t\t\tfor(int k = 0;k < c[j];k++) ma = max(ma,vec[k] + k);\n\t\t\td[g[j]] = min(d[g[j]],ma);\n\t\t}\n\t}\n\tif(d[t] != INF) cout << d[t] << endl;\n\telse cout << -1 << endl;\n}","accuracy":1,"time_ms":40,"memory_kb":3216,"score_of_the_acc":-0.0984,"final_rank":4},{"submission_id":"aoj_2318_3821677","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF=1e8;\nvector<int> cost;\nstruct synthesize{\n int goal;\n vector<int> start;\n synthesize(int g, vector<int> s):\n goal(g), start(s) {}\n void update(){\n int tot=0;\n for(int ii : start) tot=max(tot, cost[ii]);\n if(tot==INF) return;\n\n int c=start.size(), use=tot;\n priority_queue<int> pq;\n for(int ii : start) pq.push(cost[ii]);\n while(!pq.empty()){\n int v=pq.top(); pq.pop();\n if(use<v){\n tot++;\n use++;\n }\n use--;\n }\n cost[goal]=min(tot, cost[goal]);\n }\n}; \n\nint main(){\n\tint n, e, t; cin >> n >> e >> t;\n cost.assign(n+1, INF);\n for(int i=1; i<=n; i++){\n int tmp; cin >> tmp;\n if(tmp==1) cost[i]=1;\n }\n vector<synthesize> vec;\n for(int i=0; i<e; i++){\n int g, c; cin >> g >> c;\n vector<int> s(c);\n for(int j=0; j<c; j++) cin >> s[j];\n vec.push_back(synthesize(g, s));\n }\n\n for(int i=0; i<n; i++){\n for(int j=0; j<e; j++){\n vec[j].update();\n }\n }\n\n cout << (cost[t] != INF ? cost[t] : -1) << endl; \n}","accuracy":1,"time_ms":40,"memory_kb":3236,"score_of_the_acc":-0.1081,"final_rank":5},{"submission_id":"aoj_2318_3759045","code_snippet":"#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <functional>\nusing namespace std;\nconst int inf = 1012345678;\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\tint N, E, T;\n\tcin >> N >> E >> T; --T;\n\tvector<int> W(N);\n\tfor (int i = 0; i < N; ++i) cin >> W[i];\n\tvector<int> G(E);\n\tvector<vector<int> > S(E);\n\tfor (int i = 0; i < E; ++i) {\n\t\tint num;\n\t\tcin >> G[i] >> num; --G[i];\n\t\tS[i].resize(num);\n\t\tfor (int j = 0; j < num; ++j) {\n\t\t\tcin >> S[i][j]; --S[i][j];\n\t\t}\n\t}\n\tvector<int> ans(N, inf);\n\tfor (int i = 0; i < N; ++i) {\n\t\tif (W[i] == 1) ans[i] = 1;\n\t}\n\twhile (true) {\n\t\t// at most N loops\n\t\tvector<int> nxt = ans;\n\t\tfor (int i = 0; i < E; ++i) {\n\t\t\tvector<int> d;\n\t\t\tfor (int j : S[i]) {\n\t\t\t\td.push_back(ans[j]);\n\t\t\t}\n\t\t\tsort(d.begin(), d.end(), greater<int>());\n\t\t\tif (d[0] == inf) continue;\n\t\t\tint sub = 0;\n\t\t\tfor (int j = 0; j < d.size(); ++j) {\n\t\t\t\tsub = max(sub, d[j] + j);\n\t\t\t}\n\t\t\tnxt[G[i]] = min(nxt[G[i]], sub);\n\t\t}\n\t\tif (ans == nxt) break;\n\t\tans = nxt;\n\t}\n\tcout << (ans[T] != inf ? ans[T] : -1) << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3272,"score_of_the_acc":-0.0487,"final_rank":3},{"submission_id":"aoj_2318_3635262","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define all(v) (v).begin(),(v).end()\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\nint N,E,T;\nint W[300];\nint G[1000],C[1000],S[1000][10];\n\nint F[300];\n\nsigned main(){\n cin>>N>>E>>T;\n rep(i,N)cin>>W[i];\n rep(i,E){\n cin>>G[i]>>C[i];\n G[i]--;\n rep(j,C[i]){\n cin>>S[i][j];\n S[i][j]--;\n }\n }\n\n fill_n(F,N,1001001001);\n rep(i,N)if(W[i])F[i]=1;\n\n for(int i=0;i<N;i++){\n for(int j=0;j<E;j++){\n vint v;\n rep(k,C[j])v.pb(F[S[j][k]]);\n sort(all(v));\n reverse(all(v));\n int w=0;\n rep(k,C[j]){\n if(w-k<v[k]){\n w=k+v[k];\n }\n }\n chmin(F[G[j]],w);\n }\n }\n T--;\n if(F[T]==1001001001)cout<<-1<<endl;\n else cout<<F[T]<<endl;\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":3240,"score_of_the_acc":-0.1357,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_2318_9799752\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\\n#define ALL(v) (v).begin(), (v).end()\\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\\n#define SZ(v) (int)v.size()\\n#define MIN(v) *min_element(ALL(v))\\n#define MAX(v) *max_element(ALL(v))\\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\\n\\nusing uint = unsigned int;\\nusing ll = long long int;\\nusing ull = unsigned long long;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nconst int inf = 0x3fffffff;\\nconst ll INF = 0x1fffffffffffffff;\\n\\ntemplate <typename T> inline bool chmax(T &a, T b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T> inline bool chmin(T &a, T b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <typename T, typename U> T ceil(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <typename T, typename U> T floor(T x, U y) {\\n assert(y != 0);\\n if (y < 0)\\n x = -x, y = -y;\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\ntemplate <typename T> int popcnt(T x) {\\n return __builtin_popcountll(x);\\n}\\ntemplate <typename T> int topbit(T x) {\\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\\n}\\ntemplate <typename T> int lowbit(T x) {\\n return (x == 0 ? -1 : __builtin_ctzll(x));\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n os << \\\"P(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\\n os << \\\"{\\\";\\n for (int i = 0; i < vec.size(); i++) {\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\", \\\");\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n os << \\\"{\\\";\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << \\\"(\\\" << itr->first << \\\", \\\" << itr->second << \\\")\\\";\\n itr++;\\n if (itr != map_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {\\n os << \\\"{\\\";\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end())\\n os << \\\", \\\";\\n itr--;\\n }\\n os << \\\"}\\\";\\n return os;\\n}\\n#ifdef LOCAL\\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\\n#else\\n#define show(...) true\\n#endif\\ntemplate <typename T> void _show(int i, T name) {\\n cerr << '\\\\n';\\n}\\ntemplate <typename T1, typename T2, typename... T3>\\nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\\n for (; a[i] != ',' && a[i] != '\\\\0'; i++)\\n cerr << a[i];\\n cerr << \\\":\\\" << b << \\\" \\\";\\n _show(i + 1, a, c...);\\n}\\n\\n/**\\n * @brief template\\n */\\n\\nint main() {\\n int N, E, T;\\n cin >> N >> E >> T;\\n T--;\\n vector<int> W(N);\\n rep(i,0,N) cin >> W[i];\\n vector<int> G(E);\\n vector<vector<int>> S(E);\\n rep(i,0,E) {\\n cin >> G[i];\\n G[i]--;\\n int C;\\n cin >> C;\\n S[i].resize(C);\\n rep(j,0,C) cin >> S[i][j], S[i][j]--;\\n }\\n vector<int> DP(N,inf);\\n rep(i,0,N) if (W[i] == 1) DP[i] = 1;\\n rep(_,0,4000) {\\n rep(i,0,E) {\\n vector<int> V;\\n rep(j,0,S[i].size()) V.push_back(DP[S[i][j]]);\\n sort(ALL(V));\\n reverse(ALL(V));\\n int MAX = -inf;\\n rep(j,0,S[i].size()) chmax(MAX, V[j]+j);\\n chmin(DP[G[i]],MAX);\\n }\\n }\\n cout << (DP[T] == inf ? -1 : DP[T]) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 400,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -1.1559,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_2318_9579000\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#include <cmath>\\n#include <algorithm>\\n#define INF 2000000000\\n\\nusing namespace std;\\n\\nstruct WitchCraft {\\n int result_witch;\\n int ingredient_count;\\n vector<int> ingredients;\\n};\\n\\nint witch_count, rule_count, target_witch;\\nint powers[11], bit_population[1024];\\nint pending_dependencies[1000], synthesis_matrix[1000][300];\\nint min_seeds_needed[300];\\nint dp_table[1024];\\nvector<int> dependency_graph[1000];\\nWitchCraft synthesis_rules[1000];\\n\\nvoid initialize_powers() {\\n for (int i = 0; i < 11; ++i) {\\n powers[i] = 1 << i;\\n }\\n}\\n\\nvoid precompute_bit_populations() {\\n for (int mask = 0; mask < powers[10]; ++mask) {\\n int count = 0;\\n for (int i = 0; i < 10; ++i) {\\n if (mask & (1 << i)) {\\n ++count;\\n }\\n }\\n bit_population[mask] = count;\\n }\\n}\\n\\nvoid input_data() {\\n cin >> witch_count >> rule_count >> target_witch;\\n \\n for (int i = 0; i < rule_count; ++i) {\\n pending_dependencies[i] = 0;\\n fill(synthesis_matrix[i], synthesis_matrix[i] + witch_count, 0);\\n }\\n\\n fill(min_seeds_needed, min_seeds_needed + witch_count, INF);\\n\\n for (int i = 0; i < witch_count; ++i) {\\n int availability;\\n cin >> availability;\\n if (availability == 1) {\\n min_seeds_needed[i] = 1;\\n }\\n }\\n\\n for (int i = 0; i < rule_count; ++i) {\\n cin >> synthesis_rules[i].result_witch >> synthesis_rules[i].ingredient_count;\\n --synthesis_rules[i].result_witch;\\n for (int j = 0; j < synthesis_rules[i].ingredient_count; ++j) {\\n int ingredient;\\n cin >> ingredient;\\n --ingredient;\\n synthesis_rules[i].ingredients.push_back(ingredient);\\n if (min_seeds_needed[ingredient] == INF) {\\n dependency_graph[ingredient].push_back(i);\\n ++pending_dependencies[i];\\n synthesis_matrix[i][ingredient] = 1;\\n }\\n }\\n }\\n}\\n\\nvoid process_syntheses() {\\n queue<int> ready_synthesis;\\n \\n for (int i = 0; i < rule_count; ++i) {\\n if (pending_dependencies[i] == 0) {\\n ready_synthesis.push(i);\\n }\\n }\\n\\n while (!ready_synthesis.empty()) {\\n int current_rule = ready_synthesis.front();\\n ready_synthesis.pop();\\n\\n int num_ingredients = synthesis_rules[current_rule].ingredient_count;\\n fill(dp_table, dp_table + powers[num_ingredients], INF);\\n dp_table[0] = 0;\\n\\n for (int mask = 0; mask < powers[num_ingredients] - 1; ++mask) {\\n for (int bit = 0; bit < num_ingredients; ++bit) {\\n if (!(mask & (1 << bit))) {\\n int next_mask = mask | (1 << bit);\\n int reusable_seeds = dp_table[mask] - bit_population[mask];\\n dp_table[next_mask] = min(dp_table[next_mask], dp_table[mask] + max(0, min_seeds_needed[synthesis_rules[current_rule].ingredients[bit]] - reusable_seeds));\\n }\\n }\\n }\\n\\n bool updated = false;\\n int &result_witch_seeds = min_seeds_needed[synthesis_rules[current_rule].result_witch];\\n if (result_witch_seeds > dp_table[powers[num_ingredients] - 1]) {\\n result_witch_seeds = dp_table[powers[num_ingredients] - 1];\\n updated = true;\\n }\\n\\n for (int dep : dependency_graph[synthesis_rules[current_rule].result_witch]) {\\n if (synthesis_matrix[dep][synthesis_rules[current_rule].result_witch] == 1) {\\n synthesis_matrix[dep][synthesis_rules[current_rule].result_witch] = 0;\\n if (--pending_dependencies[dep] == 0) {\\n ready_synthesis.push(dep);\\n }\\n } else if (updated && pending_dependencies[dep] == 0) {\\n ready_synthesis.push(dep);\\n }\\n }\\n }\\n}\\n\\nvoid output_result() {\\n if (min_seeds_needed[target_witch - 1] == INF) {\\n cout << \\\"-1\\\\n\\\";\\n } else {\\n cout << min_seeds_needed[target_witch - 1] << \\\"\\\\n\\\";\\n }\\n}\\n\\nint main() {\\n initialize_powers();\\n precompute_bit_populations();\\n input_data();\\n process_syntheses();\\n output_result();\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4664,\n \"score_of_the_acc\": -0.7527,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2318_9578991\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\n#define MAX_COST 2000000000\\n#define MODULO 1000000007\\n#define EPSILON 1e-9\\nusing namespace std;\\n\\nstruct Synthesis {\\n int final_witch;\\n int num_ingredients;\\n vector<int> ingredients;\\n};\\n\\nint num_witches, num_synthesis_rules, target_witch;\\nint powers_of_two[11], bit_count[1024];\\nint dependency_count[1000], synthesis_dependency[1000][300];\\nint min_grief_seeds[300];\\nint dp[1024];\\nvector<int> dependency_graph[1000];\\nSynthesis syntheses[1000];\\n\\nint main() {\\n for (int i = 0; i < 11; i++) {\\n powers_of_two[i] = pow(2, i);\\n }\\n\\n // Precompute the number of bits set for each possible state\\n for (int state = 0; state < powers_of_two[10]; state++) {\\n int bit_sum = 0;\\n for (int bit = 0; bit < 10; bit++) {\\n if (state & (1 << bit)) {\\n bit_sum++;\\n }\\n }\\n bit_count[state] = bit_sum;\\n }\\n\\n // Input number of witches, synthesis rules, and the target witch\\n scanf(\\\"%d %d %d\\\", &num_witches, &num_synthesis_rules, &target_witch);\\n\\n // Initialize dependency arrays\\n for (int i = 0; i < num_synthesis_rules; i++) {\\n dependency_count[i] = 0;\\n for (int j = 0; j < num_witches; j++) {\\n synthesis_dependency[i][j] = 0;\\n }\\n }\\n\\n // Set the initial minimum grief seeds required for each witch to a large number\\n for (int i = 0; i < num_witches; i++) {\\n min_grief_seeds[i] = MAX_COST;\\n }\\n\\n // Input initial availability of witches\\n int availability;\\n for (int i = 0; i < num_witches; i++) {\\n scanf(\\\"%d\\\", &availability);\\n if (availability == 1) {\\n min_grief_seeds[i] = 1;\\n }\\n }\\n\\n // Input synthesis rules\\n for (int i = 0; i < num_synthesis_rules; i++) {\\n scanf(\\\"%d %d\\\", &syntheses[i].final_witch, &syntheses[i].num_ingredients);\\n syntheses[i].final_witch--;\\n\\n for (int j = 0; j < syntheses[i].num_ingredients; j++) {\\n scanf(\\\"%d\\\", &availability);\\n availability--;\\n syntheses[i].ingredients.push_back(availability);\\n if (min_grief_seeds[availability] == MAX_COST) {\\n dependency_graph[availability].push_back(i);\\n dependency_count[i]++;\\n synthesis_dependency[i][availability] = 1;\\n }\\n }\\n }\\n\\n // Start with synthesis rules that have no dependencies\\n queue<int> ready_to_synthesize;\\n for (int i = 0; i < num_synthesis_rules; i++) {\\n if (dependency_count[i] == 0) {\\n ready_to_synthesize.push(i);\\n }\\n }\\n\\n while (!ready_to_synthesize.empty()) {\\n int current_rule = ready_to_synthesize.front();\\n ready_to_synthesize.pop();\\n\\n int num_ingredients = syntheses[current_rule].num_ingredients;\\n for (int state = 0; state < powers_of_two[num_ingredients]; state++) {\\n dp[state] = MAX_COST;\\n }\\n dp[0] = 0;\\n\\n for (int state = 0; state < powers_of_two[num_ingredients] - 1; state++) {\\n for (int ingredient = 0; ingredient < num_ingredients; ingredient++) {\\n if (state & (1 << ingredient)) {\\n continue;\\n }\\n int next_state = state + powers_of_two[ingredient];\\n int available_grief_seeds = dp[state] - bit_count[state];\\n dp[next_state] = min(dp[next_state], dp[state] + max(0, min_grief_seeds[syntheses[current_rule].ingredients[ingredient]] - available_grief_seeds));\\n }\\n }\\n\\n bool updated = false;\\n if (min_grief_seeds[syntheses[current_rule].final_witch] > dp[powers_of_two[num_ingredients] - 1]) {\\n min_grief_seeds[syntheses[current_rule].final_witch] = dp[powers_of_two[num_ingredients] - 1];\\n updated = true;\\n }\\n\\n for (int i = 0; i < dependency_graph[syntheses[current_rule].final_witch].size(); i++) {\\n int next_rule = dependency_graph[syntheses[current_rule].final_witch][i];\\n if (synthesis_dependency[next_rule][syntheses[current_rule].final_witch] == 1) {\\n synthesis_dependency[next_rule][syntheses[current_rule].final_witch] = 0;\\n dependency_count[next_rule]--;\\n if (dependency_count[next_rule] == 0) {\\n ready_to_synthesize.push(next_rule);\\n }\\n } else {\\n if (!updated) continue;\\n if (dependency_count[next_rule] == 0) {\\n ready_to_synthesize.push(next_rule);\\n }\\n }\\n }\\n }\\n\\n target_witch--;\\n if (min_grief_seeds[target_witch] == MAX_COST) {\\n printf(\\\"-1\\\\n\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", min_grief_seeds[target_witch]);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5224,\n \"score_of_the_acc\": -1.0256,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2318_7110954\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int n, e, t;\\n cin >> n >> e >> t;\\n vector<int> w(n);\\n for (int i = 0; i < n; i++) {\\n cin >> w[i];\\n }\\n const int inf = 1e9;\\n vector<int> ans(n, inf);\\n for (int i = 0; i < n; i++) {\\n if (w[i]) {\\n ans[i] = 1;\\n }\\n }\\n vector<int> g(e);\\n vector<vector<int>> s(e);\\n for (int i = 0; i < e; i++) {\\n cin >> g[i];\\n g[i]--;\\n int c;\\n cin >> c;\\n for (int j = 0; j < c; j++) {\\n int x;\\n cin >> x;\\n x--;\\n s[i].emplace_back(x);\\n }\\n }\\n for (int z = 0; z < e; z++) {\\n for (int i = 0; i < e; i++) {\\n vector<int> a;\\n for (int x: s[i]) {\\n a.emplace_back(ans[x]);\\n }\\n sort(a.rbegin(), a.rend());\\n int b = 1;\\n for (int j = 0; j < (int) a.size(); j++) {\\n b = max(b, a[j] + j);\\n }\\n ans[g[i]] = min(ans[g[i]], b);\\n }\\n }\\n t--;\\n cout << (ans[t] == inf ? -1 : ans[t]) << '\\\\n';\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.4104,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2318_6706476\",\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 int N, E, T;\\n cin >> N >> E >> T;\\n --T;\\n vector<int> W(N);\\n for (auto& x : W) cin >> x;\\n vector<vector<int>> S(E);\\n vector<int> G(E);\\n rep(i,0,E) {\\n int C;\\n cin >> G[i] >> C;\\n --G[i];\\n S[i].resize(C);\\n for (auto& x : S[i]) cin >> x, --x;\\n }\\n vector<int> dist(N, 1e9);\\n using P = pair<int, int>;\\n priority_queue<P, vector<P>, greater<>> pq;\\n rep(i,0,N) if (W[i]) {\\n dist[i] = 1;\\n pq.push({i, 1});\\n }\\n vector<bool> visited(N);\\n while (!pq.empty()) {\\n int d, i;\\n tie(d, i) = pq.top();\\n pq.pop();\\n if (d > dist[i]) continue;\\n rep(j,0,E) {\\n if (visited[G[j]]) continue;\\n vector<int> cost;\\n for (int k : S[j]) cost.push_back(dist[k]);\\n sort(all(cost));\\n reverse(all(cost));\\n int m = 0;\\n rep(k,0,cost.size()) chmax(m, k+cost[k]);\\n if (m < dist[G[j]]) {\\n dist[G[j]] = m;\\n pq.push({m, G[j]});\\n }\\n }\\n }\\n cout << (dist[T] < 1e9 ? dist[T] : -1) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -0.1621,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2318_6333207\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\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#define int long long\\n\\nvoid solve()\\n{\\n int n, e, t;\\n cin >> n >> e >> t;\\n t--;\\n vector<int> dp(n, 1e18);\\n vector<vector<int>> vertexs[400];\\n REP(i, n)\\n {\\n int a;\\n cin >> a;\\n if (a == 1)\\n dp[i] = 1;\\n }\\n REP(i, e)\\n {\\n int target;\\n int a;\\n cin >> target;\\n cin >> a;\\n target--;\\n vector<int> gogo;\\n REP(q, a)\\n {\\n int b;\\n cin >> b;\\n b--;\\n gogo.push_back(b);\\n }\\n vertexs[target].push_back(gogo);\\n }\\n\\n REP(i, n)\\n {\\n REP(q, n)\\n {\\n for (auto x : vertexs[q])\\n {\\n vector<int> tmps;\\n REP(q, x.size())\\n {\\n tmps.push_back(dp[x[q]]);\\n }\\n sort(ALL(tmps));\\n reverse(ALL(tmps));\\n int target = 0;\\n REP(q, tmps.size())\\n {\\n target = max(target, tmps[q] + q);\\n }\\n dp[q] = min(dp[q], target);\\n }\\n }\\n }\\n if (dp[t] == 1e18)\\n dp[t] = -1;\\n cout << dp[t] << 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\": 40,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.2387,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2318_6044117\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define eps 1e-9\\n#define INF 2000000000 // 2e9\\n#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)\\n#define all(x) (x).begin(), (x).end()\\n#define sq(x) ((x) * (x))\\n\\n#define rep(i, x) for (int i = 0; i < (int)(x); i++)\\n#define drep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)\\n\\n#define popcount __builtin_popcount\\n#define next __next\\n#define prev __prev\\n\\n#ifndef LOCAL\\n#define dmp(...) ;\\n#else\\n#define dmp(...) \\\\\\n cerr << \\\"[ \\\" << #__VA_ARGS__ << \\\" ] : \\\" << dump_str(__VA_ARGS__) << endl\\n#endif\\n\\n// ---------------- Utility ------------------\\n\\ntemplate <class T>\\nbool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate <class T>\\nusing MaxHeap = priority_queue<T>;\\n\\ntemplate <class T>\\nusing MinHeap = priority_queue<T, vector<T>, greater<T>>;\\n\\ntemplate <class T>\\nvector<T> vect(int len, T elem) {\\n return vector<T>(len, elem);\\n}\\n\\n// ----------------- Input -------------------\\n\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, pair<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\n\\ntemplate <class T>\\nistream &operator>>(istream &is, vector<T> &vec) {\\n for (int i = 0; i < vec.size(); i++) is >> vec[i];\\n return is;\\n}\\n\\n// ----------------- Output ------------------\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const pair<T, U> &p) {\\n return os << p.first << ',' << p.second;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (const T &e : v) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const deque<T> &d) {\\n for (const T &e : d) os << e << \\\" \\\";\\n return os;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const set<T> &s) {\\n os << \\\"{ \\\";\\n for (const T &e : s) os << e << \\\" \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const map<T, U> &m) {\\n os << \\\"{ \\\";\\n for (const auto &[key, val] : m) os << \\\"( \\\" << key << \\\" -> \\\" << val << \\\" ) \\\";\\n return os << \\\"}\\\";\\n}\\n\\ntemplate <class TupleTy, size_t... I>\\nvoid dump_tuple(ostream &os, const TupleTy t, std::index_sequence<I...>) {\\n (..., (os << (I == 0 ? \\\"\\\" : \\\",\\\") << std::get<I>(t)));\\n}\\n\\ntemplate <class... Args>\\nostream &operator<<(ostream &os, const tuple<Args...> &t) {\\n os << \\\"(\\\";\\n dump_tuple(os, t, std::make_index_sequence<sizeof...(Args)>());\\n return os << \\\")\\\";\\n}\\n\\nvoid dump_str_rec(ostringstream &) {}\\n\\ntemplate <class Head, class... Tail>\\nvoid dump_str_rec(ostringstream &oss, Head &&head, Tail &&... tail) {\\n oss << \\\", \\\" << head;\\n dump_str_rec(oss, forward<Tail>(tail)...);\\n}\\n\\ntemplate <class T, class... U>\\nstring dump_str(T &&arg, U &&... args) {\\n ostringstream oss;\\n oss << arg;\\n dump_str_rec(oss, forward<U>(args)...);\\n return oss.str();\\n}\\n\\n// --------------- Fast I/O ------------------\\n\\nvoid fastio() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n cout << fixed << setprecision(20);\\n}\\n\\n// ------------------ ACL --------------------\\n\\n// #include <atcoder/modint>\\n// constexpr int MOD = 998244353;\\n// constexpr int MOD = 1000000007;\\n// using mint = atcoder::static_modint<MOD>;\\n// ostream &operator<<(ostream &os, const mint &v) {\\n// return os << v.val();\\n// }\\n\\n// ------------ End of template --------------\\n\\n#define endl \\\"\\\\n\\\"\\nusing ll = long long;\\nusing pii = pair<int, int>;\\n\\nconst bool multitest = false;\\n\\nvoid solve() {\\n int N, E, T;\\n cin >> N >> E >> T;\\n T--;\\n vector<int> dp(N, INF);\\n for (int i = 0; i < N; i++) {\\n int w;\\n cin >> w;\\n if (w == 1) dp[i] = 1;\\n }\\n\\n vector<int> g(E);\\n vector<vector<int>> S(E);\\n for (int i = 0; i < E; i++) {\\n cin >> g[i];\\n g[i]--;\\n int C;\\n cin >> C;\\n S[i].resize(C);\\n for (int j = 0; j < C; j++) {\\n cin >> S[i][j];\\n S[i][j]--;\\n }\\n }\\n\\n for (int _ = 0; _ < N; _++) {\\n for (int i = 0; i < E; i++) {\\n vector<int> cs;\\n bool ready = true;\\n for (int j : S[i]) {\\n if (dp[j] == INF) {\\n ready = false;\\n break;\\n }\\n cs.push_back(dp[j]);\\n }\\n if (!ready) continue;\\n sort(all(cs), greater<int>());\\n dmp(cs);\\n int need = 0;\\n for (int j = 0; j < cs.size(); j++) chmax(need, j + cs[j]);\\n chmin(dp[g[i]], need);\\n }\\n }\\n\\n if (dp[T] == INF)\\n cout << -1 << endl;\\n else\\n cout << dp[T] << endl;\\n return;\\n}\\n\\nint main() {\\n fastio();\\n if (!multitest) {\\n solve();\\n } else {\\n cerr << \\\"[Warning] Multi testcase mode on\\\" << endl;\\n int t;\\n cin >> t;\\n while (t--) solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.1777,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2318_6022950\",\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;\\n\\nstruct FastIO {\\n FastIO() {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n }\\n} fastiofastio;\\n\\nconst ll 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 main() {\\n int N, E, T;\\n cin >> N >> E >> T;\\n T--;\\n vector<int> W(N);\\n for (int i = 0; i < N; i++)\\n cin >> W[i];\\n vector<vector<int>> S(E);\\n vector<int> G(E), C(E);\\n for (int i = 0; i < E; i++) {\\n cin >> G[i] >> C[i];\\n G[i]--;\\n S[i].resize(C[i]);\\n for (int j = 0; j < C[i]; j++) {\\n cin >> S[i][j];\\n S[i][j]--;\\n }\\n }\\n vector<int> need(N, 1 << 25);\\n for (int i = 0; i < N; i++) {\\n if (W[i])\\n need[i] = 1;\\n }\\n while (1) {\\n bool update = 0;\\n for (int i = 0; i < E; i++) {\\n vector<int> vec;\\n for (int j = 0; j < C[i]; j++) {\\n vec.push_back(need[S[i][j]]);\\n }\\n sort(ALL(vec), greater<int>());\\n int ma = 0;\\n for (int j = 0; j < C[i]; j++)\\n ma = max(ma, j + vec[j]);\\n if (need[G[i]] > ma) {\\n need[G[i]] = ma;\\n update = 1;\\n break;\\n }\\n }\\n if (!update)\\n break;\\n }\\n if (need[T] != 1 << 25)\\n cout << need[T] << endl;\\n else\\n cout << -1 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.166,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2318_5882811\",\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;\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nint main(){\\n int n,e,t; cin >> n >> e >> t; t--;\\n vl dp(n,inf);\\n vb vi(n,false);\\n rep(i,n){\\n int w; cin >> w;\\n if(w == 1) dp[i] = 1, vi[i] = true;\\n }\\n vector<vvl> G(n);\\n rep(i,e){\\n int g,c; cin >> g >> c; g--;\\n vl v(c);\\n rep(j,c) cin >> v[j], v[j]--;\\n G[g].push_back(v);\\n }\\n rep(z,2020){\\n rep(u,n){\\n for(auto v : G[u]){\\n vl costs;\\n for(auto x : v){\\n costs.push_back(dp[x]);\\n }\\n sort(rall(costs));\\n ll s = 0;\\n rep(i,costs.size()) chmax(s,costs[i]+i);\\n chmin(dp[u],s);\\n }\\n }\\n }\\n ll ans = dp[t];\\n if(ans == inf) ans = -1;\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.7538,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2318_5676171\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int N, E, T;\\n cin >> N >> E >> T;\\n T--;\\n vector<int> W(N);\\n for (auto&& w : W) {\\n cin >> w;\\n }\\n vector<int> G(E), C(E);\\n vector<vector<int>> S(E);\\n for (int i = 0; i < E; i++) {\\n cin >> G[i] >> C[i];\\n G[i]--;\\n S[i].resize(C[i]);\\n for (auto&& s : S[i]) {\\n cin >> s;\\n s--;\\n }\\n }\\n\\n const int INF = 1e7;\\n vector<int> cost(N, INF);\\n vector<bool> seen(N, false);\\n priority_queue<pair<int, int>, vector<pair<int, int>>, greater<>> que;\\n for (int i = 0; i < N; i++) {\\n if (W[i]) {\\n que.push({0, i});\\n cost[i] = 1;\\n }\\n }\\n while (!que.empty()) {\\n auto [c, now] = que.top();\\n que.pop();\\n if (seen[now])\\n continue;\\n seen[now] = true;\\n for (int i = 0; i < E; i++) {\\n int g = G[i], c = C[i];\\n auto& s = S[i];\\n if (seen[g])\\n continue;\\n vector<int> V(c);\\n for (int j = 0; j < c; j++) {\\n V[j] = cost[s[j]];\\n }\\n sort(begin(V), end(V), greater{});\\n int c_nxt = 0;\\n for (int j = 0; j < c; j++) {\\n c_nxt = max(c_nxt, V[j] + j);\\n }\\n if (cost[g] > c_nxt) {\\n cost[g] = c_nxt;\\n que.push({c_nxt, g});\\n }\\n }\\n }\\n cout << (cost[T] >= INF ? -1 : cost[T]) << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.1618,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2318_5380837\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 10000000;\\nint main(){\\n int N, E, T;\\n cin >> N >> E >> T;\\n T--;\\n vector<int> W(N);\\n for (int i = 0; i < N; i++){\\n cin >> W[i];\\n }\\n vector<int> G(E), C(E);\\n vector<vector<int>> S(E);\\n for (int i = 0; i < E; i++){\\n cin >> G[i] >> C[i];\\n G[i]--;\\n S[i] = vector<int>(C[i]);\\n for (int j = 0; j < C[i]; j++){\\n cin >> S[i][j];\\n S[i][j]--;\\n }\\n }\\n vector<int> d(N, INF);\\n for (int i = 0; i < N; i++){\\n if (W[i] == 1){\\n d[i] = 1;\\n }\\n }\\n for (int i = 0; i < N; i++){\\n for (int j = 0; j < E; j++){\\n vector<int> cnt(C[j]);\\n for (int k = 0; k < C[j]; k++){\\n cnt[k] = d[S[j][k]];\\n }\\n sort(cnt.begin(), cnt.end(), greater<int>());\\n int mx = 0;\\n for (int k = 0; k < C[j]; k++){\\n mx = max(mx, cnt[k] + k);\\n }\\n d[G[j]] = min(d[G[j]], mx);\\n }\\n }\\n if (d[T] == INF){\\n cout << -1 << endl;\\n } else {\\n cout << d[T] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.0256,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2318_5304541\",\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=305,INF=1<<30;\\n\\nint dp[MAX];\\n\\nint main(){\\n \\n std::ifstream in(\\\"text.txt\\\");\\n std::cin.rdbuf(in.rdbuf());\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n \\n int N,M,X;cin>>N>>M>>X;\\n X--;\\n for(int i=0;i<N;i++){\\n int x;cin>>x;\\n dp[i]=INF;\\n if(x==1) dp[i]=1;\\n }\\n \\n vector<int> target(M);\\n vector<vector<int>> need(M);\\n \\n for(int i=0;i<M;i++){\\n cin>>target[i];\\n target[i]--;\\n \\n int k;cin>>k;\\n need[i].resize(k);\\n for(int j=0;j<k;j++){\\n cin>>need[i][j];\\n need[i][j]--;\\n }\\n }\\n \\n for(int q=0;q<N;q++){\\n for(int i=0;i<M;i++){\\n vector<int> A;\\n for(int a:need[i]) A.push_back(dp[a]);\\n sort(all(A));\\n reverse(all(A));\\n if(A.front()==INF) continue;\\n \\n int ma=0;\\n for(int j=0;j<si(A);j++){\\n chmax(ma,A[j]+j);\\n }\\n chmin(dp[target[i]],ma);\\n }\\n }\\n \\n if(dp[X]==INF) dp[X]=-1;\\n \\n cout<<dp[X]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.2267,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2318_5269555\",\n \"code_snippet\": \"//#define _GLIBCXX_DEBUG\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(int i=0; i<n; ++i)\\n#define all(v) v.begin(), v.end()\\n#define rall(v) v.rbegin(), v.rend()\\nusing ll = int64_t;\\nusing ull = uint64_t;\\nusing ld = long double;\\nusing P = pair<int, int>;\\nusing vs = vector<string>;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\ntemplate<class T> using PQ = priority_queue<T>;\\ntemplate<class T> using PQG = priority_queue<T, vector<T>, greater<T>>;\\nconst int INF = 0xccccccc;\\nconst ll LINF = 0xcccccccccccccccLL;\\ntemplate<typename T1, typename T2>\\ninline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}\\ntemplate<typename T1, typename T2>\\ninline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}\\ntemplate<typename T1, typename T2>\\nistream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}\\ntemplate<typename T1, typename T2>\\nostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}\\n\\n\\n\\n//head\\n\\n\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n int n, e, t;\\n cin >> n >> e >> t;\\n vi dp(n+1);\\n rep(i, n) {\\n int w;\\n cin >> w;\\n if(w) dp[i+1] = 1;\\n else dp[i+1] = INF;\\n }\\n vi g(e), c(e);\\n vvi s(e);\\n rep(i, e) {\\n cin >> g[i] >> c[i];\\n s[i].resize(c[i]);\\n rep(j, c[i]) cin >> s[i][j];\\n }\\n PQ<int> q;\\n rep(i, n-1) rep(j, e) {\\n rep(k, c[j]) q.emplace(dp[s[j][k]]);\\n int u = 0;\\n int now = c[j];\\n while(!q.empty()) {\\n chmax(now, q.top()+(u++));\\n q.pop();\\n }\\n chmin(dp[g[j]], now);\\n }\\n if(dp[t] == INF) puts(\\\"-1\\\");\\n else cout << dp[t] << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.1816,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2318_4956557\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\nint n,m,r,a,b,d[350],e[1000],inf=1e8,cnt;\\nvector<int> v[1000],u;\\nint main(void){\\n cin>>n>>m>>r;\\n for(int i=0;i<n;i++){\\n cin>>d[i];\\n if(d[i]==0)d[i]=inf;\\n }\\n for(int i=0;i<m;i++){\\n cin>>e[i]>>a;\\n e[i]--;\\n for(int j=0;j<a;j++){\\n cin>>b;\\n b--;\\n v[i].push_back(b);\\n }\\n }\\n for(int i=0;i<m;i++){\\n for(int j=0;j<m;j++){\\n u={};\\n for(int x:v[j]){\\n u.push_back(d[x]);\\n\\n }\\n sort(u.begin(),u.end());\\n reverse(u.begin(),u.end());\\n cnt=0;\\n for(int k=0;k<u.size();k++){\\n //cout<<u[k]<<endl;\\n cnt=max(cnt,u[k]+k);\\n }\\n d[e[j]]=min(d[e[j]],cnt);\\n }\\n }\\n r--;\\n if(d[r]==inf)cout<<-1<<endl;\\n else cout<<d[r]<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.2566,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2318_4925833\",\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\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(10);\\n\\n int n, e, t; cin >> n >> e >> t;\\n t--;\\n vi w(n, INF);\\n REP(i, n) {\\n int now; cin >> now;\\n if(now) w[i] = 1;\\n }\\n\\n vector<vector<vector<int>>> g(n);\\n\\n REP(i, e) {\\n int a; cin >> a;\\n a--;\\n int c; cin >> c;\\n vi v;\\n REP(j, c) {\\n int s; cin >> s;\\n s--;\\n v.push_back(s);\\n }\\n g[a].emplace_back(v);\\n }\\n\\n REP(i, n-1) {\\n REP(j, n) {\\n for(auto &v: g[j]) {\\n int sz = SZ(v);\\n vi v2(sz);\\n bool ok = true;\\n REP(k, sz) {\\n if(v[k] == INF) {\\n ok = false;\\n break;\\n }\\n v2[k] = w[v[k]];\\n }\\n if(!ok) continue;\\n sort(v2.rbegin(), v2.rend());\\n int cost = 0;\\n REP(k, sz) {\\n chmax(cost, v2[k] + k);\\n }\\n chmin(w[j], cost);\\n }\\n }\\n }\\n\\n cout << (w[t] == INF ? -1 : w[t]) << endl;\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3520,\n \"score_of_the_acc\": -0.1696,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2318_4818076\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstdio>\\n#include<cstring>\\n#include<string>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<map>\\n#include<queue>\\n#include<deque>\\n#include<iomanip>\\n#include<tuple>\\n#include<cassert>\\n#include<set>\\nusing namespace std;\\ntypedef long long int LL;\\ntypedef pair<int,int> P;\\ntypedef pair<LL,int> LP;\\nconst int INF=1<<30;\\nconst LL MAX=1e9+7;\\n\\nvoid array_show(int *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%d%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(LL *array,int array_n,char middle=' '){\\n for(int i=0;i<array_n;i++)printf(\\\"%lld%c\\\",array[i],(i!=array_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<int> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%d%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\nvoid array_show(vector<LL> &vec_s,int vec_n=-1,char middle=' '){\\n if(vec_n==-1)vec_n=vec_s.size();\\n for(int i=0;i<vec_n;i++)printf(\\\"%lld%c\\\",vec_s[i],(i!=vec_n-1?middle:'\\\\n'));\\n}\\n\\n\\n\\nint main(){\\n int n,m,p;\\n int i,j,k;\\n int a,b,c;\\n cin>>n>>m>>p;\\n p--;\\n vector<int> vs(n,INF),mak(m);\\n vector<vector<int>> comp(m);\\n for(i=0;i<n;i++){\\n cin>>a;\\n if(a)vs[i]=1;\\n }\\n for(i=0;i<m;i++){\\n cin>>a>>j;\\n mak[i]=a-1;\\n while(j--){\\n cin>>b;\\n comp[i].push_back(b-1);\\n }\\n }\\n vector<int> v1;\\n for(i=0;i<n;i++){\\n for(j=0;j<m;j++){\\n v1.clear();\\n for(auto num:comp[j])v1.push_back(vs[num]);\\n sort(v1.rbegin(),v1.rend());\\n a=vs[mak[j]],b=0;\\n for(k=0;k<v1.size();k++){\\n b=max(b,v1[k]+k);\\n }\\n vs[mak[j]]=min(a,b);\\n }\\n }\\n a=vs[p];\\n if(a>=INF)a=-1;\\n cout<<a<<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3248,\n \"score_of_the_acc\": -0.037,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2318_4274349\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int INF = 1e+8;\\n\\nsigned main(){\\n\\tint n,e,t,w[310],g[1010],c[1010],s[1010][12];\\n\\tcin >> n >> e >> t; t--;\\n\\tint d[310];\\n\\tfor(int i = 0;i < n;i++){\\n\\t\\tcin >> w[i];\\n\\t\\td[i] = (w[i] ? 1 : INF);\\n\\t}\\n\\tfor(int i = 0;i < e;i++){\\n\\t\\tcin >> g[i] >> c[i]; g[i]--;\\n\\t\\tfor(int j = 0;j < c[i];j++){\\n\\t\\t\\tcin >> s[i][j]; s[i][j]--;\\n\\t\\t}\\n\\t}\\n\\tfor(int i = 0;i < n;i++){\\n\\t\\tfor(int j = 0;j < e;j++){\\n\\t\\t\\tint ma = 0;\\n\\t\\t\\tvector<int> vec;\\n\\t\\t\\tfor(int k = 0;k < c[j];k++) vec.push_back(d[s[j][k]]);\\n\\t\\t\\tsort(vec.begin(),vec.end(),greater<int>());\\n\\t\\t\\tfor(int k = 0;k < c[j];k++) ma = max(ma,vec[k] + k);\\n\\t\\t\\td[g[j]] = min(d[g[j]],ma);\\n\\t\\t}\\n\\t}\\n\\tif(d[t] != INF) cout << d[t] << endl;\\n\\telse cout << -1 << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3216,\n \"score_of_the_acc\": -0.0984,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2318_3821677\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst int INF=1e8;\\nvector<int> cost;\\nstruct synthesize{\\n int goal;\\n vector<int> start;\\n synthesize(int g, vector<int> s):\\n goal(g), start(s) {}\\n void update(){\\n int tot=0;\\n for(int ii : start) tot=max(tot, cost[ii]);\\n if(tot==INF) return;\\n\\n int c=start.size(), use=tot;\\n priority_queue<int> pq;\\n for(int ii : start) pq.push(cost[ii]);\\n while(!pq.empty()){\\n int v=pq.top(); pq.pop();\\n if(use<v){\\n tot++;\\n use++;\\n }\\n use--;\\n }\\n cost[goal]=min(tot, cost[goal]);\\n }\\n}; \\n\\nint main(){\\n\\tint n, e, t; cin >> n >> e >> t;\\n cost.assign(n+1, INF);\\n for(int i=1; i<=n; i++){\\n int tmp; cin >> tmp;\\n if(tmp==1) cost[i]=1;\\n }\\n vector<synthesize> vec;\\n for(int i=0; i<e; i++){\\n int g, c; cin >> g >> c;\\n vector<int> s(c);\\n for(int j=0; j<c; j++) cin >> s[j];\\n vec.push_back(synthesize(g, s));\\n }\\n\\n for(int i=0; i<n; i++){\\n for(int j=0; j<e; j++){\\n vec[j].update();\\n }\\n }\\n\\n cout << (cost[t] != INF ? cost[t] : -1) << endl; \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3236,\n \"score_of_the_acc\": -0.1081,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2318_3759045\",\n \"code_snippet\": \"#include <vector>\\n#include <iostream>\\n#include <algorithm>\\n#include <functional>\\nusing namespace std;\\nconst int inf = 1012345678;\\nint main() {\\n\\tcin.tie(0);\\n\\tios_base::sync_with_stdio(false);\\n\\tint N, E, T;\\n\\tcin >> N >> E >> T; --T;\\n\\tvector<int> W(N);\\n\\tfor (int i = 0; i < N; ++i) cin >> W[i];\\n\\tvector<int> G(E);\\n\\tvector<vector<int> > S(E);\\n\\tfor (int i = 0; i < E; ++i) {\\n\\t\\tint num;\\n\\t\\tcin >> G[i] >> num; --G[i];\\n\\t\\tS[i].resize(num);\\n\\t\\tfor (int j = 0; j < num; ++j) {\\n\\t\\t\\tcin >> S[i][j]; --S[i][j];\\n\\t\\t}\\n\\t}\\n\\tvector<int> ans(N, inf);\\n\\tfor (int i = 0; i < N; ++i) {\\n\\t\\tif (W[i] == 1) ans[i] = 1;\\n\\t}\\n\\twhile (true) {\\n\\t\\t// at most N loops\\n\\t\\tvector<int> nxt = ans;\\n\\t\\tfor (int i = 0; i < E; ++i) {\\n\\t\\t\\tvector<int> d;\\n\\t\\t\\tfor (int j : S[i]) {\\n\\t\\t\\t\\td.push_back(ans[j]);\\n\\t\\t\\t}\\n\\t\\t\\tsort(d.begin(), d.end(), greater<int>());\\n\\t\\t\\tif (d[0] == inf) continue;\\n\\t\\t\\tint sub = 0;\\n\\t\\t\\tfor (int j = 0; j < d.size(); ++j) {\\n\\t\\t\\t\\tsub = max(sub, d[j] + j);\\n\\t\\t\\t}\\n\\t\\t\\tnxt[G[i]] = min(nxt[G[i]], sub);\\n\\t\\t}\\n\\t\\tif (ans == nxt) break;\\n\\t\\tans = nxt;\\n\\t}\\n\\tcout << (ans[T] != inf ? ans[T] : -1) << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3272,\n \"score_of_the_acc\": -0.0487,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2318_3635262\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define all(v) (v).begin(),(v).end()\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\n#define pb push_back\\n#define fi first\\n#define se second\\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\\n\\nint N,E,T;\\nint W[300];\\nint G[1000],C[1000],S[1000][10];\\n\\nint F[300];\\n\\nsigned main(){\\n cin>>N>>E>>T;\\n rep(i,N)cin>>W[i];\\n rep(i,E){\\n cin>>G[i]>>C[i];\\n G[i]--;\\n rep(j,C[i]){\\n cin>>S[i][j];\\n S[i][j]--;\\n }\\n }\\n\\n fill_n(F,N,1001001001);\\n rep(i,N)if(W[i])F[i]=1;\\n\\n for(int i=0;i<N;i++){\\n for(int j=0;j<E;j++){\\n vint v;\\n rep(k,C[j])v.pb(F[S[j][k]]);\\n sort(all(v));\\n reverse(all(v));\\n int w=0;\\n rep(k,C[j]){\\n if(w-k<v[k]){\\n w=k+v[k];\\n }\\n }\\n chmin(F[G[j]],w);\\n }\\n }\\n T--;\\n if(F[T]==1001001001)cout<<-1<<endl;\\n else cout<<F[T]<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3240,\n \"score_of_the_acc\": -0.1357,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":1298,"cells":{"group_id":{"kind":"string","value":"aoj_2317_cpp"},"problem_description":{"kind":"string","value":"問題文\n委員長の魔女 PATRICIA は，蜘蛛のような糸を吐き結界の中で暮らしている．使い魔の MATHIEU は，委員長の魔女が吐いた糸を引っぱり自在に空を飛んでいる．糸は空間上の線分とみなすことにする．\n暁美ほむら\nは委員長の魔女に対して攻撃を仕掛けようとし，爆弾と間違えて花火玉を投げ込んでしまった．その結果，それぞれの糸について，魔女から距離\np_1, ..., p_M\nの位置にある部分が切れるだけとなってしまった．花火玉を投げる前，それぞれの糸について，糸の\n2\nつの端点と魔女はこの順番で同一直線上に並んでおり，端点のどちらか一方を使い魔が引っ張っていた．爆発で糸は切れ，使い魔が持っていた部分とそこから一つ置きの部分を残して糸の一部は消えてしまった．\nほむら\nは次の戦略を考えるために，残った糸についての情報が知りたいと思っている．残った糸の長さの合計値を求めよ．\n入力形式\n入力は以下の形式で与えられる．\nN\\ M\\\\\ns_1\\ t_1\\\\\n...\\\\\ns_N\\ t_N\\\\\np_1\\\\\n...\\\\\np_M\\\\\nN\nは空間上の糸の個数，\nM\nは花火玉によって発生した糸の切断の箇所の個数である．\ns_i, t_i\nは糸の情報であり，\ns_i\nは使い間が引っ張っていた側の端点，\nt_i\nはそうでない側の端点の魔女からの距離である．\np_i\nは花火玉によって切断された位置の情報である．\n出力形式\n花火玉を投げた後，残った糸の長さの合計値を1行に出力せよ．\n制約\n1 ≤ N ≤ 10\n5\n1 ≤ M ≤ 10\n5\n1 ≤ s_i ≤ 10^9\n1 ≤ t_i ≤ 10^9\n1 ≤ p_i ≤ 10^9\n入力値は全て整数である．\ns_1, ..., s_N, t_1, ..., t_N, p_1, ..., p_M\nは全て相異なる．\n入出力例\n入力例 1\n2 3\n1 8\n20 5\n3\n7\n15\n出力例1\n10\n爆発の後，\n1\nつ目のひもは端点の魔女からの距離がそれぞれ\n(1,3), (7,8)\nの\n2\nつのひもに，\n2\nつ目のひもは\n(20, 15), (7, 5)\nの\n2\nつのひもに分かれる．結果，残ったひもの長さの合計は\n2+1+5+2 = 10\nとなる．\n入力例 2\n1 1\n100 1\n70\n出力例 2\n30\n入力例 3\n6 8\n1 10\n11 23\n99 2\n56 58\n66 78\n88 49\n5\n15\n25\n35\n45\n55\n65\n75\n出力例 3\n99\nProblem Setter: Flat35"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2317_5550696","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1100000000;\nint main(){\n int N, M;\n cin >> N >> M;\n vector<int> s(N), t(N);\n for (int i = 0; i < N; i++){\n cin >> s[i] >> t[i];\n }\n vector<int> p(M);\n for (int i = 0; i < M; i++){\n cin >> p[i];\n }\n p.push_back(-1);\n p.push_back(INF);\n M += 2;\n sort(p.begin(), p.end());\n vector<int> d(M - 1);\n for (int i = 0; i < M - 1; i++){\n d[i] = p[i + 1] - p[i];\n }\n vector<vector<int>> S(2, vector<int>(M));\n for (int i = 0; i < 2; i++){\n S[i][0] = 0;\n for (int j = 0; j < M - 1; j++){\n S[i][j + 1] = S[i][j];\n if (j % 2 == i){\n S[i][j + 1] += d[j];\n }\n }\n }\n long long ans = 0;\n for (int i = 0; i < N; i++){\n if (s[i] < t[i]){\n int L = lower_bound(p.begin(), p.end(), s[i]) - p.begin();\n int R = lower_bound(p.begin(), p.end(), t[i]) - p.begin() - 1;\n ans += S[(L + 1) % 2][R] - S[(L + 1) % 2][L];\n ans += p[L] - s[i];\n if ((R - L) % 2 != 0){\n ans += t[i] - p[R];\n }\n }\n if (s[i] > t[i]){\n int L = lower_bound(p.begin(), p.end(), t[i]) - p.begin();\n int R = lower_bound(p.begin(), p.end(), s[i]) - p.begin() - 1;\n ans += S[R % 2][R] - S[R % 2][L];\n ans += s[i] - p[R];\n if ((R - L) % 2 != 0){\n ans += p[L] - t[i];\n }\n }\n }\n cout << ans << endl;\n}","accuracy":1,"time_ms":80,"memory_kb":5740,"score_of_the_acc":-0.3513,"final_rank":5},{"submission_id":"aoj_2317_2910875","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100001\n\nll start[NUM],tail[NUM];\nll cut_pos[NUM];\nll ruiseki_odd[NUM],ruiseki_even[NUM];\n\nint main(){\n\n\tint N,M;\n\tscanf(\"%d %d\",&N,&M);\n\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%lld %lld\",&start[i],&tail[i]);\n\t}\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%lld\",&cut_pos[i]);\n\t}\n\tsort(cut_pos,cut_pos+M);\n\n\t//偶奇に分けた累積和テーブルを作成\n\tfor(int i = 0; i < M; i++){\n\t\truiseki_odd[i] = 0;\n\t\truiseki_even[i] = 0;\n\t}\n\t//ruiseki_odd[i:奇数] = cut_pos[i:奇数]-cut_pos[i-1]の累積和\n\tfor(int i = 1; i < M; i += 2){\n\t\truiseki_odd[i] = cut_pos[i]-cut_pos[i-1];\n\t\tif(i > 1){\n\t\t\truiseki_odd[i] += ruiseki_odd[i-2];\n\t\t}\n\t}\n\t//ruiseki_even[i:偶数] = cut_pos[i:偶数]-cut_pos[i-1]の累積和\n\tfor(int i = 2; i < M; i += 2){\n\t\truiseki_even[i] = cut_pos[i]-cut_pos[i-1];\n\t\truiseki_even[i] += ruiseki_even[i-2];\n\t}\n\n\tll ans = 0;\n\tint left,right,m;\n\tint max_index,min_index;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tif(start[i] > tail[i]){\n\n\t\t\tif(cut_pos[0] >= start[i] || cut_pos[M-1] <= tail[i]){ //糸が分断されない場合\n\t\t\t\tans += start[i]-tail[i];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t//start[i]以下の、最大の切断点を探す\n\t\t\tleft = 0,right = M-1,m = (left+right)/2;\n\t\t\twhile(left <= right){\n\t\t\t\tif(cut_pos[m] <= start[i]){\n\t\t\t\t\tmax_index = m;\n\t\t\t\t\tleft = m+1;\n\t\t\t\t}else{\n\t\t\t\t\tright = m-1;\n\t\t\t\t}\n\t\t\t\tm = (left+right)/2;\n\t\t\t}\n\t\t\t//tail[i]以上の、最小の切断点を探す\n\t\t\tleft = 0,right = M-1, m = (left+right)/2;\n\t\t\twhile(left <= right){\n\t\t\t\tif(cut_pos[m] >= tail[i]){\n\t\t\t\t\tmin_index = m;\n\t\t\t\t\tright = m-1;\n\t\t\t\t}else{\n\t\t\t\t\tleft = m+1;\n\t\t\t\t}\n\t\t\t\tm = (left+right)/2;\n\t\t\t}\n\t\t\tif(min_index > max_index){ //切断区間内にstartとtailが挟まっている場合\n\t\t\t\tans += start[i]-tail[i];\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tans += start[i]-cut_pos[max_index]; //一番使い魔側の区間を足す\n\n\t\t\tif(max_index%2 == 0){ //最初の切れ目が偶数の場合:ruiseki_odd\n\n\t\t\t\tif(min_index%2 == 0){ //tailが無効区間\n\n\t\t\t\t\tans += ruiseki_odd[max(0,max_index-1)]-ruiseki_odd[max(0,min_index-1)];\n\n\t\t\t\t}else{ //tailが有効区間\n\n\t\t\t\t\tans += ruiseki_odd[max(0,max_index-1)]-ruiseki_odd[min_index]+cut_pos[min_index]-tail[i];\n\t\t\t\t}\n\n\t\t\t}else{ //max_index%2 == 1\n\n\t\t\t\tif(min_index%2 == 1){ //tailが無効区間\n\n\t\t\t\t\tans += ruiseki_even[max(0,max_index-1)]-ruiseki_even[max(0,min_index-1)];\n\n\t\t\t\t}else{ //tailが有効区間\n\n\t\t\t\t\tans += ruiseki_even[max(0,max_index-1)]-ruiseki_even[min_index];\n\t\t\t\t\tif(min_index > 0){\n\t\t\t\t\t\tans += cut_pos[min_index]-tail[i];\n\t\t\t\t\t}else if(min_index != max_index && min_index == 0 && tail[i] < cut_pos[0]){\n\t\t\t\t\t\tans += cut_pos[0]-tail[i];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}else{ //start[i] < tail[i]\n\n\t\t\tif(cut_pos[0] >= tail[i] || cut_pos[M-1] <= start[i]){\n\t\t\t\tans += tail[i]-start[i];\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t//start[i]以上の、最小の切断点を探す\n\t\t\tleft = 0,right = M-1,m = (left+right)/2;\n\t\t\twhile(left <= right){\n\t\t\t\tif(cut_pos[m] >= start[i]){\n\t\t\t\t\tmin_index = m;\n\t\t\t\t\tright = m-1;\n\t\t\t\t}else{\n\t\t\t\t\tleft = m+1;\n\t\t\t\t}\n\t\t\t\tm = (left+right)/2;\n\t\t\t}\n\t\t\t//tail[i]以下の、最大の切断点を探す\n\t\t\tleft = 0,right = M-1,m = (left+right)/2;\n\t\t\twhile(left <= right){\n\t\t\t\tif(cut_pos[m] <= tail[i]){\n\t\t\t\t\tmax_index = m;\n\t\t\t\t\tleft = m+1;\n\t\t\t\t}else{\n\t\t\t\t\tright = m-1;\n\t\t\t\t}\n\t\t\t\tm = (left+right)/2;\n\t\t\t}\n\n\t\t\tif(min_index > max_index){ //切断区間内にstartとtailが挟まっている場合\n\t\t\t\tans += tail[i]-start[i];\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tans += cut_pos[min_index]-start[i];\n\n\t\t\tif(min_index%2 == 1){ //最初の切れ目が奇数の場合;ruiseki_odd\n\n\t\t\t\tif(max_index%2 == 1){ //tailが無効区間\n\n\t\t\t\t\tans += ruiseki_odd[max_index]-ruiseki_odd[min_index];\n\t\t\t\t}else{\n\t\t\t\t\tans += ruiseki_odd[max(0,max_index-1)]-ruiseki_odd[min_index]+tail[i]-cut_pos[max_index];\n\t\t\t\t}\n\n\t\t\t}else{ //min_index%2 == 0:最初の切れ間が偶数:ruiseki_even\n\n\t\t\t\tif(max_index%2 == 0){ //tailが無効区間\n\n\t\t\t\t\tans += ruiseki_even[max_index]-ruiseki_even[min_index];\n\t\t\t\t}else{\n\t\t\t\t\tans += ruiseki_even[max(0,max_index-1)]-ruiseki_even[min_index]+tail[i]-cut_pos[max_index];\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}","accuracy":1,"time_ms":40,"memory_kb":7180,"score_of_the_acc":-0.3128,"final_rank":3},{"submission_id":"aoj_2317_2898458","code_snippet":"#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <utility>\nusing namespace std;\nusing ll = long long int;\nconst ll INF = 1LL << 30;\n\nll N, M;\n\nll solve(vector<ll> cuts, vector< pair<ll, ll> > strands) {\n ll ret = 0;\n\n vector<ll> even, odd;\n even.push_back(0); odd.push_back(0);\n for(size_t i=1; i<cuts.size(); i++) {\n ll mo = i % 2, diff = cuts[i] - cuts[i-1];\n (mo ? odd : even).push_back( (mo ? odd : even).back() + diff );\n (mo ? even : odd).push_back( (mo ? even : odd).back() ); // zero\n }\n\n for(auto e : strands) {\n ll l = e.first, r = e.second, sum = 0;\n sum += r - l;\n ll il = lower_bound(cuts.begin(), cuts.end(), l) - cuts.begin();\n ll ir = lower_bound(cuts.begin(), cuts.end(), r) - cuts.begin() - 1;\n\n if(ir - il >= 0) {\n if(il % 2 == 0) {\n sum -= odd [ir] - odd [il];\n }\n if(il % 2 == 1) {\n sum -= even[ir] - even[il];\n }\n\n if( (ir - il) % 2 == 0 ) {\n ll bound = cuts[ir];\n if(l < bound && bound < r) sum -= r - bound;\n }\n }\n\n // printf(\"[%lld, %lld], il = %lld, ir = %lld, len = %lld\\n\", l, r, il, ir, sum);\n ret += sum;\n }\n return ret;\n}\n\nint main() {\n scanf(\"%lld%lld\", &N, &M);\n vector< pair<ll, ll> > strands, rev_strands;\n for(int i=0; i<N; i++) {\n ll l, r; scanf(\"%lld%lld\", &l, &r);\n if(l < r) strands.push_back(make_pair(l, r));\n else rev_strands.push_back(make_pair(INF - l, INF - r));\n }\n\n vector<ll> cuts(M);\n for(int i=0; i<M; i++) {\n scanf(\"%lld\", &cuts[i]);\n }\n\n ll ans = 0;\n sort(cuts.begin(), cuts.end());\n ans += solve(cuts, strands);\n reverse(cuts.begin(), cuts.end());\n for(auto &c : cuts) {\n c = INF - c;\n }\n ans += solve(cuts, rev_strands);\n printf(\"%lld\\n\", ans);\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":9184,"score_of_the_acc":-0.3949,"final_rank":6},{"submission_id":"aoj_2317_1966574","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\ntypedef vector<int>vint;\ntypedef pair<int,int>pint;\ntypedef vector<pint>vpint;\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\n#define all(v) (v).begin(),(v).end()\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\n#define pb push_back\n#define fi first\n#define se second\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\n\nint N,M;\nint S[111111],T[111111];\nint P[222222];\n\nint sum[222222];\nsigned main(){\n cin>>N>>M;\n rep(i,N){\n cin>>S[i]>>T[i];\n if(S[i]>T[i])S[i]*=-1,T[i]*=-1;\n }\n rep(i,M)cin>>P[i],P[i+M]=-P[i];\n M*=2;\n sort(P,P+M);\n\n for(int i=1;i<M;i++){\n sum[i]=P[i]-P[i-1]+(i>1?sum[i-2]:0);\n }\n\n int ans=0;\n rep(i,N){\n if(T[i]<P[0]){\n ans+=T[i]-S[i];\n continue;\n }\n if(P[M-1]<S[i]){\n ans+=T[i]-S[i];\n continue;\n }\n int t=upper_bound(P,P+M,T[i])-P-1;\n int s=upper_bound(P,P+M,S[i])-P;\n if(s%2!=t%2){\n ans+=sum[t-1]-sum[s]+T[i]-P[t]+P[s]-S[i];\n }\n else{\n ans+=sum[t]-sum[s]+P[s]-S[i];\n }\n }\n\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":6048,"score_of_the_acc":-0.5103,"final_rank":13},{"submission_id":"aoj_2317_1898585","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\nstruct INIT{INIT(){ios::sync_with_stdio(false);cin.tie(0);}}init;\ntypedef long long LL;\ntypedef tuple<LL,LL> T;\ntypedef vector<LL> VL;\ntypedef vector<T> VT;\n#define rep(i,n) for(auto i=(n)*0;i<n;i++)\n#define range(it,v) for(auto &it:v)\n\n\nLL getlen(set<LL>& event,VL& point,VT& seg,LL prev){\n priority_queue<LL,vector<LL>,greater<LL>> on,off;\n int n=point.size();\n int m=seg.size();\n int i=0,j=0;\n LL res=0;\n range(it,event){\n\t\n\tres+=((LL)on.size())*(it-prev);\n\tprev=it;\n\t//\tcout<<it<<\" \"<<res<<endl;\n\tif(i<n&&point[i]==it){\n\t swap(on,off);\n\t i++;\n\t}\n\telse {\n\t if(on.empty()==false&&on.top()==it){\n\t\ton.pop();\n\t }\n\t else if(off.empty()==false&&off.top()==it){\n\t\toff.pop();\n\t }\n\t else{\n\t\tLL s,t;\n\t\ttie(s,t)=seg[j++];\n\t\ton.push(t);\n\t }\n\t}\n }\n return res;\n}\nint main(){\n int N,M;\n cin>>N>>M;\n VT st;\n set<LL> e;\n rep(i,N){\n\tint s,t;\n\tcin>>s>>t;\n\tif(s<t){\n\t st.push_back(T(s,t));\n\t e.insert(t);\n\t e.insert(s);\n\t}\n\telse {\n\t st.push_back(T(-s,-t));\n\t e.insert(-t);\n\t e.insert(-s);\n\t}\n }\n sort(st.begin(),st.end());\n VL point;\n rep(i,M){\n\tLL it;\n\tcin>>it;\n\tpoint.push_back(it);\n\tpoint.push_back(-it);\n\te.insert(it);\n\te.insert(-it);\n }\n sort(point.begin(),point.end());\n cout<<getlen(e,point,st,-11*4*51*4*1919)<<endl;\n \n return 0;\n}","accuracy":1,"time_ms":250,"memory_kb":25740,"score_of_the_acc":-1.5854,"final_rank":16},{"submission_id":"aoj_2317_1895883","code_snippet":"#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n//#include<cctype>\n#include<climits>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n//#include<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n//#include<numeric>\n#include<utility>\n//#include<memory>\n#include<functional>\n#include<cassert>\n#include<set>\n#include<stack>\n#include<random>\n\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef pair<int, int> pii;\n\nconst int MAXN = 100100;\nint S[MAXN], T[MAXN];\nint P[MAXN];\nint N, M;\nll sumEven[MAXN], sumOdd[MAXN];\n\nll calc(int i) {\n int is = lower_bound(P, P+M, S[i]) - P;\n int it = lower_bound(P, P+M, T[i]) - P; it--;\n if (is == M || it == -1) return T[i] - S[i];\n ll ret = 0;\n if ((it-is)%2 == 0) {\n if (is%2) {\n ret = (sumOdd[it+2] - sumOdd[is]) - (sumEven[it+1] - sumEven[is+1]) - S[i];\n } else {\n ret = (sumEven[it+2] - sumEven[is]) - (sumOdd[it+1] - sumOdd[is+1]) - S[i];\n }\n } else {\n if (is%2) {\n ret = (sumOdd[it+1] - sumOdd[is]) - (sumEven[it+2] - sumEven[is+1]) + T[i] - S[i];\n } else {\n ret = (sumEven[it+1] - sumEven[is]) - (sumOdd[it+2] - sumOdd[is+1]) + T[i] - S[i];\n }\n }\n return ret;\n}\n\nll solve() {\n memset(sumEven, 0, sizeof(sumEven));\n memset(sumOdd, 0, sizeof(sumOdd));\n for (int i = 0; i < M; i += 2) {\n sumEven[i+1] = sumEven[i];\n sumEven[i+2] = sumEven[i] + P[i];\n }\n for (int i = 1; i < M; i += 2) {\n sumOdd[i+2] = sumOdd[i] + P[i];\n sumOdd[i+1] = sumOdd[i+2];\n }\n ll ans = 0;\n for (int i = 0; i < N; i++) if (S[i] < T[i]) {\n ll tmp = calc(i);\n ans += tmp;\n }\n return ans;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> N >> M;\n for (int i = 0; i < N; i++)\n cin >> S[i] >> T[i];\n for (int i = 0; i < M; i++) \n cin >> P[i];\n sort(P, P+M);\n ll ans = solve();\n reverse(P, P+M);\n for (int i = 0; i < M; i++)\n P[i] *= -1;\n for (int i = 0; i < N; i++) {\n S[i] *= -1;\n T[i] *= -1;\n }\n ans += solve();\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":5912,"score_of_the_acc":-0.2608,"final_rank":2},{"submission_id":"aoj_2317_1887064","code_snippet":"#include <iostream>\n#include <vector>\n#include <queue>\n#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))\ntypedef long long ll;\nusing namespace std;\n\nconst int open_tag = 1;\nconst int close_tag = 2;\nconst int toggle_tag = 3;\nunion event_t {\n struct { int tag; int t; } common;\n struct { int tag; int l, i; } open; // [l, r)\n struct { int tag; int r, i; } close; // [l, r)\n struct { int tag; int p; } toggle;\n};\nbool operator < (event_t a, event_t b) { return a.common.t > b.common.t; } // weak struct ordering\nint main() {\n // init\n int n, m; cin >> n >> m;\n priority_queue<event_t> que;\n repeat (i,n) {\n int s, t; cin >> s >> t;\n event_t el = { open_tag };\n event_t er = { close_tag };\n if (s < t) {\n el.open .l = s;\n er.close.r = t;\n } else {\n el.open .l = - s;\n er.close.r = - t;\n }\n el.open .i = i;\n er.close.i = i;\n que.push(el);\n que.push(er);\n }\n repeat (i,m) {\n int p; cin >> p;\n event_t e = { toggle_tag };\n e.toggle.p = p;\n que.push(e);\n e.toggle.p = - p;\n que.push(e);\n }\n // run\n ll ans = 0;\n int prv = 0;\n int on = 0;\n int off = 0;\n vector<int> ix(n, -1);\n vector<int> acc { 0 };\n while (not que.empty()) {\n event_t e = que.top(); que.pop();\n ans += on *(ll) (e.common.t - prv);\n prv = e.common.t;\n if (e.common.tag == open_tag) {\n on += 1;\n ix[e.open.i] = acc.size() - 1;\n acc.push_back(acc.back());\n } else if (e.common.tag == close_tag) {\n ((acc.back() - acc[ix[e.close.i]]) % 2 == 0 ? on : off) -= 1;\n } else if (e.common.tag == toggle_tag) {\n swap(on, off);\n acc.back() += 1;\n }\n }\n // output\n cout << ans << endl;\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":9124,"score_of_the_acc":-0.6363,"final_rank":14},{"submission_id":"aoj_2317_1885440","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)\n#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)\n#define pb push_back\n#define all(x) (x).begin(), (x).end()\n#define fi first\n#define se second\n#define mt make_tuple\n#define mp make_pair\ntemplate<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }\ntemplate<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\nusing ll = long long; using ld = long double; using vll = vector<ll>; using vvll = vector<vll>; using vld = vector<ld>; \nusing vi = vector<int>; using vvi = vector<vi>;\nvll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }\nusing P = pair<ll, ll>;\n\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << \"(\" << v.first << \", \" << v.second << \")\"; return o; }\ntemplate<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};\ntemplate<class Ch, class Tr, class Tuple, size_t... Is>\nvoid print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? \"\" : \", \") << get<Is>(t)), 0)...}; }\ntemplate<class Ch, class Tr, class... Args> \nauto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << \"(\"; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << \")\"; }\nostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << \" \"; cout << endl; } return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const unordered_map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << \"]\"; return o; }\nvoid printbits(ll mask, ll n) { rep(i, n) { cout << !!(mask & (1ll << i)); } cout << endl; }\n#define ldout fixed << setprecision(40) \n\nstatic const double EPS = 1e-14;\nstatic const long long INF = 1e18;\nstatic const long long mo = 1e9+7;\n\n// ?´???????????¨????\n// ?§????O(n)\n// ?????¨???O(1)\nconst function<bool(ll)> f1_default = [](ll x) { return 1; };\nclass Sum1d {\npublic:\n vll data;\n vll sumdata;\n Sum1d(vll& d, function<bool(ll)> f = f1_default) {\n int n = d.size();\n data = d;\n sumdata = vll(n+1, 0);\n rep(i, n) if(f(i)) sumdata[i+1] = data[i];\n rep(i, n) sumdata[i+1] += sumdata[i];\n }\n // [i, j)????°???????????????? (????????????)\n ll sum(int i, int j) {\n if (i >= j)\n return 0;\n return sumdata[j]-sumdata[i];\n }\n // [i, i+ilen)????°???????????????? (????????????)\n ll suml(int i, int len) {\n return this->sum(i, i+len);\n }\n void print(void) {\n rep(i, sumdata.size()) cout << sumdata[i] << \" \"; cout << endl;\n }\n};\nint main(void) {\n cin.tie(0); ios::sync_with_stdio(false);\n ll n, m; cin >> n >> m;\n vll s(n), t(n), p(m); \n rep(i, s.size()) \n cin >> s[i] >> t[i]; \n rep(i, p.size()) \n cin >> p[i];\n\n sort(all(p));\n\n vll pd_even(m), pd_odd(m);\n pd_even[0] = p[0];\n repi(i, 1, m) {\n (i % 2 == 0 ? pd_even[i] : pd_odd[i]) = p[i]-p[i-1];\n (i % 2 == 1 ? pd_even[i] : pd_odd[i]) = 0;\n }\n\n Sum1d s_even(pd_even), s_odd(pd_odd);\n\n ll ret = 0;\n rep(i, s.size()) {\n ll is = lower_bound(all(p), s[i]) - p.begin();\n ll it = lower_bound(all(p), t[i]) - p.begin();\n if (is == it) {\n ret += abs(t[i] - s[i]);\n continue;\n }\n\n if (is < it) {\n ret += abs(p[is] - s[i]);\n if (it % 2 == is % 2) {\n ret += abs(p[it-1] - t[i]);\n }\n ret += (is % 2 == 0 ? s_even : s_odd).sum(is+1, it);\n } else {\n ret += abs(p[is-1] - s[i]);\n if (it % 2 == is % 2) {\n ret += abs(p[it] - t[i]);\n }\n ret += (is % 2 == 0 ? s_even : s_odd).sum(it+1, is);\n }\n }\n cout << ret << endl;\n\n \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":9960,"score_of_the_acc":-0.4267,"final_rank":9},{"submission_id":"aoj_2317_1885438","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)\n#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)\n#define pb push_back\n#define all(x) (x).begin(), (x).end()\n#define fi first\n#define se second\n#define mt make_tuple\n#define mp make_pair\ntemplate<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }\ntemplate<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\nusing ll = long long; using ld = long double; using vll = vector<ll>; using vvll = vector<vll>; using vld = vector<ld>; \nusing vi = vector<int>; using vvi = vector<vi>;\nvll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }\nusing P = pair<ll, ll>;\n\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << \"(\" << v.first << \", \" << v.second << \")\"; return o; }\ntemplate<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};\ntemplate<class Ch, class Tr, class Tuple, size_t... Is>\nvoid print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? \"\" : \", \") << get<Is>(t)), 0)...}; }\ntemplate<class Ch, class Tr, class... Args> \nauto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << \"(\"; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << \")\"; }\nostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << \" \"; cout << endl; } return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \", \" : \"\"); o << \"]\"; return o; }\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const unordered_map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << \"]\"; return o; }\nvoid printbits(ll mask, ll n) { rep(i, n) { cout << !!(mask & (1ll << i)); } cout << endl; }\n#define ldout fixed << setprecision(40) \n\nstatic const double EPS = 1e-14;\nstatic const long long INF = 1e18;\nstatic const long long mo = 1e9+7;\n\n// ?´???????????¨????\n// ?§????O(n)\n// ?????¨???O(1)\nconst function<bool(ll)> f1_default = [](ll x) { return 1; };\nclass Sum1d {\npublic:\n vll data;\n vll sumdata;\n Sum1d(vll& d, function<bool(ll)> f = f1_default) {\n int n = d.size();\n data = d;\n sumdata = vll(n+1, 0);\n rep(i, n) if(f(i)) sumdata[i+1] = data[i];\n rep(i, n) sumdata[i+1] += sumdata[i];\n }\n // [i, j)????°???????????????? (????????????)\n ll sum(int i, int j) {\n if (i >= j)\n return 0;\n return sumdata[j]-sumdata[i];\n }\n // [i, i+ilen)????°???????????????? (????????????)\n ll suml(int i, int len) {\n return this->sum(i, i+len);\n }\n void print(void) {\n rep(i, sumdata.size()) cout << sumdata[i] << \" \"; cout << endl;\n }\n};\nint main(void) {\n cin.tie(0); ios::sync_with_stdio(false);\n ll n, m; cin >> n >> m;\n vll s(n), t(n), p(m); rep(i, s.size()) cin >> s[i] >> t[i]; rep(i, p.size()) cin >> p[i];\n sort(all(p));\n\n vll pd_even(m), pd_odd(m);\n pd_even[0] = p[0];\n repi(i, 1, m) {\n if (i % 2 == 0) {\n pd_even[i] = p[i]-p[i-1];\n pd_odd[i] = 0;\n } else {\n pd_even[i] = 0;\n pd_odd[i] = p[i]-p[i-1];\n }\n }\n /*\n cout << pd_even << endl;\n cout << pd_odd << endl;\n */\n\n Sum1d s_even(pd_even), s_odd(pd_odd);\n /*\n s_even.print();\n s_odd.print();\n cout << s_even.sum(1, 4) << endl;\n */\n\n ll ret = 0;\n rep(i, s.size()) {\n ll is = lower_bound(all(p), s[i]) - p.begin();\n ll it = lower_bound(all(p), t[i]) - p.begin();\n /*\n cout << is << \" \" << it << endl;\n */\n if (is == it) {\n ret += abs(t[i] - s[i]);\n continue;\n }\n\n if (is < it) {\n// cout << \"#Forward\" << endl;\n ret += abs(p[is] - s[i]);\n// cout << abs(p[is] - s[i]) << endl;\n if (it % 2 == is % 2) {\n ret += abs(p[it-1] - t[i]);\n// cout << p[it-1] << \" \" << t[i] << \"#detail\" << endl;\n// cout << abs(p[it-1] - t[i]) << endl;\n }\n ret += (is % 2 == 0 ? s_even : s_odd).sum(is+1, it);\n// cout <<(is % 2 == 0 ? s_even : s_odd).sum(is+1, it) << endl;\n } else {\n// cout << \"#Inverse\" << endl;\n ret += abs(p[is-1] - s[i]);\n// cout << abs(p[is-1] - s[i]) << endl;\n if (it % 2 == is % 2) {\n ret += abs(p[it] - t[i]);\n// cout << abs(p[it] - t[i]) << endl;\n }\n ret += (is % 2 == 0 ? s_even : s_odd).sum(it+1, is);\n// cout << (is % 2 == 0 ? s_even : s_odd).sum(it+1, is) << endl;\n }\n }\n cout << ret << endl;\n\n \n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":9960,"score_of_the_acc":-0.4511,"final_rank":11},{"submission_id":"aoj_2317_1879645","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\n\nint main()\n{\n int N, M, s, t, p;\n cin >> N >> M;\n vector<pii> v[2];\n for (int i = 0; i < N; i++) {\n cin >> s >> t;\n int j = i+1;\n if (s < t) {\n v[0].push_back(pii(s, j));\n v[0].push_back(pii(t, j));\n } else {\n v[1].push_back(pii(s, -j));\n v[1].push_back(pii(t, -j));\n }\n }\n for (int i = 0; i < M; i++) {\n cin >> p;\n v[0].push_back(pii(p, 0));\n v[1].push_back(pii(p, 0));\n }\n\n sort(v[0].begin(), v[0].end());\n sort(v[1].rbegin(), v[1].rend());\n\n ll res = 0;\n for (int i = 0; i < 2; i++) {\n vector<int> use(N, -1);\n int cut = 0, even = 0, odd = 0;\n for (int j = 0; j < (int)v[i].size(); j++) {\n int k = (i == 0 ? +1 : -1);\n int x = v[i][j].second * k;\n if (j > 0) {\n ll cost = k * (ll)(v[i][j].first - v[i][j-1].first) * even;\n res += cost;\n }\n \n if (x != 0) {\n x--;\n if (use[x] == -1) {\n use[x] = cut;\n even++;\n } else {\n if ((cut - use[x]) % 2 == 0) {\n even--;\n } else {\n odd--;\n }\n }\n } else {\n cut++;\n swap(even, odd);\n }\n }\n }\n cout << res << endl;\n return 0;\n}","accuracy":1,"time_ms":110,"memory_kb":6440,"score_of_the_acc":-0.4532,"final_rank":12},{"submission_id":"aoj_2317_1879631","code_snippet":"#include<bits/stdc++.h>\n#define N 100005\nusing namespace std;\nlong long n,m,s[N],t[N],p[N],d[N],ans;\n\nint bynary_search(int x){\n int l=0,r=m;\n while(l<r){\n int mid=(l+r)/2;\n if(x<=p[mid])r=mid;\n else l=mid+1;\n }\n return l;\n}\n\nint main(){\n cin>>n>>m;\n for(int i=0;i<n;i++)cin>>s[i]>>t[i];\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n d[0]=p[0],d[1]=p[1]-p[0];\n ans=0;\n for(int i=2;i<m;i++)d[i]=d[i-2]+p[i]-p[i-1];\n for(int i=0;i<n;i++){\n int r1=bynary_search(s[i]);\n int r2=bynary_search(t[i]);\n if(r1==r2)ans+=max(s[i],t[i])-min(s[i],t[i]);\n else if(abs(r1-r2)==1){\n if(s[i]<t[i])ans+=p[r1]-s[i];\n else ans+=s[i]-p[r1-1];\n }\n else if(s[i]<t[i]){\n if(r2%2==r1%2)ans+=p[r1]-s[i]+d[r2-2]-d[r1]+t[i]-p[r2-1];\n else ans+=p[r1]-s[i]+d[r2-1]-d[r1];\n }else{\n if(r2%2==r1%2)ans+=s[i]-p[r1-1]+d[r1-2]-d[r2]+p[r2]-t[i];\n else ans+=s[i]-p[r1-1]+d[r1-2]-d[r2-1];\n }\n }\n cout<<ans<<endl;\n return 0;\n}","accuracy":1,"time_ms":140,"memory_kb":4300,"score_of_the_acc":-0.4387,"final_rank":10},{"submission_id":"aoj_2317_1879630","code_snippet":"#include<bits/stdc++.h>\n#define N 10005\nusing namespace std;\nlong long n,m,s[N],t[N],p[N],d[N],ans;\n\nint bynary_search(int x){\n int l=0,r=m;\n while(l<r){\n int mid=(l+r)/2;\n if(x<=p[mid])r=mid;\n else l=mid+1;\n }\n return l;\n}\n\nint main(){\n cin>>n>>m;\n for(int i=0;i<n;i++)cin>>s[i]>>t[i];\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n d[0]=p[0],d[1]=p[1]-p[0];\n ans=0;\n for(int i=2;i<m;i++)d[i]=d[i-2]+p[i]-p[i-1];\n for(int i=0;i<n;i++){\n int r1=bynary_search(s[i]);\n int r2=bynary_search(t[i]);\n if(r1==r2)ans+=max(s[i],t[i])-min(s[i],t[i]);\n else if(abs(r1-r2)==1){\n if(s[i]<t[i])ans+=p[r1]-s[i];\n else ans+=s[i]-p[r1-1];\n }\n else if(s[i]<t[i]){\n if(r2%2==r1%2)ans+=p[r1]-s[i]+d[r2-2]-d[r1]+t[i]-p[r2-1];\n else ans+=p[r1]-s[i]+d[r2-1]-d[r1];\n }else{\n if(r2%2==r1%2)ans+=s[i]-p[r1-1]+d[r1-2]-d[r2]+p[r2]-t[i];\n else ans+=s[i]-p[r1-1]+d[r1-2]-d[r2-1];\n }\n }\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.19047619047619047,"time_ms":10,"memory_kb":1488,"score_of_the_acc":-0.0064,"final_rank":18},{"submission_id":"aoj_2317_1879629","code_snippet":"#include<bits/stdc++.h>\n#define N 10005\nusing namespace std;\nint n,m,s[N],t[N],p[N],d[N],ans;\n\nint bynary_search(int x){\n int l=0,r=m;\n while(l<r){\n int mid=(l+r)/2;\n if(x<=p[mid])r=mid;\n else l=mid+1;\n }\n return l;\n}\n\nint main(){\n cin>>n>>m;\n for(int i=0;i<n;i++)cin>>s[i]>>t[i];\n for(int i=0;i<m;i++)cin>>p[i];\n sort(p,p+m);\n d[0]=p[0],d[1]=p[1]-p[0];\n ans=0;\n for(int i=2;i<m;i++)d[i]=d[i-2]+p[i]-p[i-1];\n for(int i=0;i<n;i++){\n int r1=bynary_search(s[i]);\n int r2=bynary_search(t[i]);\n if(r1==r2)ans+=max(s[i],t[i])-min(s[i],t[i]);\n else if(abs(r1-r2)==1){\n if(s[i]<t[i])ans+=p[r1]-s[i];\n else ans+=s[i]-p[r1-1];\n }\n else if(s[i]<t[i]){\n if(r2%2==r1%2)ans+=p[r1]-s[i]+d[r2-2]-d[r1]+t[i]-p[r2-1];\n else ans+=p[r1]-s[i]+d[r2-1]-d[r1];\n }else{\n if(r2%2==r1%2)ans+=s[i]-p[r1-1]+d[r1-2]-d[r2]+p[r2]-t[i];\n else ans+=s[i]-p[r1-1]+d[r1-2]-d[r2-1];\n }\n }\n cout<<ans<<endl;\n return 0;\n}","accuracy":0.09523809523809523,"time_ms":10,"memory_kb":1332,"score_of_the_acc":0,"final_rank":19},{"submission_id":"aoj_2317_1857100","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef pair<ll, ll> P;\n\n#define EACH(i,a) for (auto& i : a)\n#define FOR(i,a,b) for (ll i=(a);i<(b);i++)\n#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)\n#define REP(i,n) for (ll i=0;i<(n);i++)\n#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)\n#define debug(x) cout<<#x<<\": \"<<x<<endl\n#define pb push_back\n#define ALL(a) (a).begin(),(a).end()\n\nconst ll linf = 1e18;\nconst int inf = 1e9;\nconst double eps = 1e-12;\nconst double pi = acos(-1);\n\ntemplate<typename T>\nistream& operator>>(istream& is, vector<T>& vec) {\n\tEACH(x,vec) is >> x;\n\treturn is;\n}\n/*\ntemplate<class... T>\nostream& operator<<(ostream& os, tuple<T...>& t) {\n\tfor (size_t i = 0; i < tuple_size< tuple<T...> >::value; ++i) {\n\t\tif (i) os << \" \";\n\t\tos << get<0>(t);\n\t}\n\treturn os;\n}\n*/\ntemplate<typename T>\nostream& operator<<(ostream& os, vector<T>& vec) {\n\tREP(i,vec.size()) {\n\t\tif (i) os << \" \";\n\t\tos << vec[i];\n\t}\n\treturn os;\n}\ntemplate<typename T>\nostream& operator<<(ostream& os, vector< vector<T> >& vec) {\n\tREP(i,vec.size()) {\n\t\tif (i) os << endl;\n\t\tos << vec[i];\n\t}\n\treturn os;\n}\n\nint main() {\n\tstd::ios::sync_with_stdio(false);\n\tstd::cin.tie(0);\n\tll N, M; cin >> N >> M;\n\tvector<P> v;\n\tREP(i, N) {\n\t\tll s, t; cin >> s >> t;\n\t\tv.pb({s, t});\n\t}\n\tvector<ll> p(M); cin >> p; p.pb(0); p.pb(linf);\n\tsort(p.begin(), p.end());\n\tvector<ll> sOdd(p.size(), 0), sEven(p.size(), 0);\n\tREP(i, (int)p.size()-1) {\n\t\tsOdd[i+1] += sOdd[i];\n\t\tsEven[i+1] +=+ sEven[i];\n\t\tif (i % 2 == 0) {\n\t\t\tsEven[i+1] += p[i+1]-p[i];\n\t\t}\n\t\telse {\n\t\t\tsOdd[i+1] += p[i+1]-p[i];\n\t\t}\n\t}\n\tll ans = 0;\n\tREP(i, N) {\n\t\tll s, t; tie(s, t) = v[i];\n\t\tbool f = false;\n\t\tif (s > t) {\n\t\t\tf = true;\n\t\t\tint temp = s; s = t; t = temp;\n\t\t}\n\t\tint sid = (upper_bound(ALL(p), s)-p.begin())-1;\n\t\tint tid = (lower_bound(ALL(p), t)-p.begin())-1;\n\t\t// [sid, tid)\n\t\t// cout << s << \" \" << t << \" \" << sid << \" \" << tid << endl;\n\t\t// ll ba = ans;\n\t\tif (tid > sid+1) {\n\t\t\tif ((!f && (sid % 2 == 0)) || (f && (tid%2 == 0))) {\n\t\t\t\tans += sEven[tid] - sEven[sid+1];\n\t\t\t}\n\t\t\telse {\n\t\t\t\tans += sOdd[tid] - sOdd[sid+1];\n\t\t\t}\n\t\t}\n\t\tif (sid == tid) { // [s, t)\n\t\t\tans += t-s;\n\t\t}\n\t\telse {\n\t\t\tif ((tid-sid)%2 == 0 || !f) {\n\t\t\t\tans += p[sid+1]-s;\n\t\t\t}\n\t\t\tif ((tid-sid)%2 == 0 || f) {\n\t\t\t\tans += t-p[tid];\n\t\t\t}\n\t\t}\n\t\t// cout << ans-ba << endl;\n\t}\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":50,"memory_kb":6848,"score_of_the_acc":-0.3236,"final_rank":4},{"submission_id":"aoj_2317_1833064","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <climits>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#include <cassert>\n#include <functional>\n\nusing namespace std;\n\n#define LOG(...) printf(__VA_ARGS__)\n//#define LOG(...)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\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 SORT(c) sort((c).begin(),(c).end())\n#define RSORT(c) sort((c).rbegin(),(c).rend())\n#define CLR(a) memset((a), 0 ,sizeof(a))\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\nconst int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };\n\nstruct UnionFind {\n\tvector<int> v;\n\tUnionFind(int n) : v(n) { for (int i = 0; i < n; i++) v[i] = i; }\n\tint find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }\n\tvoid unite(int x, int y) { v[find(x)] = find(y); }\n};\n\nint main() {\n\tint n, m;\n\tcin >> n >> m;\n\tvector<pair<ll, char>> vpii;\n\tvector<ll> hanabi;\n\tmap<ll, bool> mib;\n\tREP(i, n) {\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tif (a < b) {\n\t\t\tvpii.push_back({ a, 'b' });\n\t\t\tvpii.push_back({ b, 'e' });\n\t\t}else{\n\t\t\tvpii.push_back({ a, 'e' });\n\t\t\tvpii.push_back({ b, 'b' });\n\t\t}\n\t}\n\n\tREP(i, m) {\n\t\tint a;\n\t\tcin >> a;\n\t\tvpii.push_back({ a,'f' });\n\t\thanabi.push_back(a);\n\t}\n\tSORT(hanabi);\n\tREP(i, n) {\n\t\tif (vpii[i * 2].first < vpii[i * 2 + 1].first) {\n\t\t\tmib[vpii[i * 2 + 1].first] =\n\t\t\t\t(bool)((lower_bound(ALL(hanabi), vpii[i * 2 + 1].first) -\n\t\t\t\t\t\tlower_bound(ALL(hanabi), vpii[i * 2].first)+1) % 2);\n\t\t\tmib[vpii[i * 2].first] = true;\n\t\t}\n\t\telse {\n\t\t\tmib[vpii[i * 2+1].first] =\n\t\t\t\t(bool)((lower_bound(ALL(hanabi), vpii[i * 2].first) -\n\t\t\t\t\t\tlower_bound(ALL(hanabi), vpii[i * 2+1].first)+1) % 2);\n\t\t\tmib[vpii[i * 2].first] = true;\n\t\t}\n\t}\n\tSORT(vpii);\n\tll ans = 0;\n\tll ex = 0;\n\tll vo = 0;\n\tif (vpii[0].second == 'b')\n\t\tif (mib[vpii[0].first]) {\n\t\t\tex++;\n\t\t}\n\t\telse {\n\t\t\tvo++;\n\t\t}\n\tFOR(i, 1, vpii.size()) {\n\t\tans += ex*(vpii[i].first - vpii[i - 1].first);\n\t\tif (vpii[i].second == 'b')\n\t\t\tif (mib[vpii[i].first]) {\n\t\t\t\tex++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvo++;\n\t\t\t}\n\t\tif (vpii[i].second == 'e') {\n\t\t\tif (mib[vpii[i].first]) {\n\t\t\t\tex--;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvo--;\n\t\t\t\t\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tif (vpii[i].second == 'f') {\n\t\t\tswap(ex,vo);\n\t\t}\n\t}\n\tcout << ans << endl;\n}","accuracy":1,"time_ms":280,"memory_kb":20792,"score_of_the_acc":-1.4558,"final_rank":15},{"submission_id":"aoj_2317_1833047","code_snippet":"#include <algorithm>\n#include <cmath>\n#include <climits>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#include <cassert>\n#include <functional>\n\nusing namespace std;\n\n#define LOG(...) printf(__VA_ARGS__)\n//#define LOG(...)\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\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 SORT(c) sort((c).begin(),(c).end())\n#define RSORT(c) sort((c).rbegin(),(c).rend())\n#define CLR(a) memset((a), 0 ,sizeof(a))\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef vector<bool> vb;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vb> vvb;\ntypedef vector<vi> vvi;\ntypedef vector<vll> vvll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\nconst int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };\n\nstruct UnionFind {\n\tvector<int> v;\n\tUnionFind(int n) : v(n) { for (int i = 0; i < n; i++) v[i] = i; }\n\tint find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }\n\tvoid unite(int x, int y) { v[find(x)] = find(y); }\n};\n\nint main() {\n\tint n, m;\n\tcin >> n >> m;\n\tvector<pair<int, char>> vpii;\n\tvector<int> hanabi;\n\tmap<int, bool> mib;\n\tREP(i, n) {\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tif (a < b) {\n\t\t\tvpii.push_back({ a, 'b' });\n\t\t\tvpii.push_back({ b, 'e' });\n\t\t}else{\n\t\t\tvpii.push_back({ a, 'e' });\n\t\t\tvpii.push_back({ b, 'b' });\n\t\t}\n\t}\n\tREP(i, m) {\n\t\tint a;\n\t\tcin >> a;\n\t\tvpii.push_back({ a,'f' });\n\t\thanabi.push_back(a);\n\t}\n\tSORT(hanabi);\n\tREP(i, n) {\n\t\tif (vpii[i * 2].first < vpii[i * 2 + 1].first) {\n\t\t\tmib[vpii[i * 2 + 1].first] =\n\t\t\t\t(bool)((lower_bound(ALL(hanabi), vpii[i * 2 + 1].first) -\n\t\t\t\t\t\tlower_bound(ALL(hanabi), vpii[i * 2].first)+1) % 2);\n\t\t\tmib[vpii[i * 2].first] = true;\n\t\t}\n\t\telse {\n\t\t\tmib[vpii[i * 2+1].first] =\n\t\t\t\t(bool)((lower_bound(ALL(hanabi), vpii[i * 2].first) -\n\t\t\t\t\t\tlower_bound(ALL(hanabi), vpii[i * 2+1].first)+1) % 2);\n\t\t\tmib[vpii[i * 2].first] = true;\n\t\t}\n\t}\n\tSORT(vpii);\n\tll ans = 0;\n\tint ex = 0;\n\tint vo = 0;\n\tif (vpii[0].second == 'b')\n\t\tif (mib[vpii[0].first]) {\n\t\t\tex++;\n\t\t}\n\t\telse {\n\t\t\tvo++;\n\t\t}\n\tFOR(i, 1, vpii.size()) {\n\t\tans += ex*(vpii[i].first - vpii[i - 1].first);\n\t\tif (vpii[i].second == 'b')\n\t\t\tif (mib[vpii[i].first]) {\n\t\t\t\tex++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvo++;\n\t\t\t}\n\t\tif (vpii[i].second == 'e') {\n\t\t\tif (mib[vpii[i].first]) {\n\t\t\t\tex--;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvo--;\n\t\t\t\t\n\t\t\t\t\n\t\t\t}\n\t\t}\n\t\tif (vpii[i].second == 'f') {\n\t\t\tswap(ex,vo);\n\t\t}\n\t}\n\tcout << ans << endl;\n}","accuracy":0.5476190476190477,"time_ms":230,"memory_kb":15032,"score_of_the_acc":-1.0979,"final_rank":17},{"submission_id":"aoj_2317_1829741","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n \n \nint N, M;\nint s[100000], t[100000];\nint sum[2][100003];\n \nint main()\n{\n \n scanf(\"%d %d\", &N, &M);\n for(int i = 0; i < N; i++) {\n scanf(\"%d %d\", &s[i], &t[i]);\n }\n vector< int > P(M);\n for(int i = 0; i < M; i++) {\n scanf(\"%d\", &P[i]);\n }\n sort(P.begin(), P.end());\n \n long long ret = 0;\n for(int i = 0; i < N; i++) {\n auto p = lower_bound(P.begin(), P.end(), s[i]);\n auto q = lower_bound(P.begin(), P.end(), t[i]);\n if(p == q) {\n ret += abs(t[i] - s[i]);\n } else {\n s[i] > t[i] ? --p : --q;\n \n if((p - q) % 2 != 0) {\n ret += abs(*p - s[i]);\n ret += abs(*q - t[i]);\n if(abs(p - q) == 1) continue;\n s[i] < t[i] ? (++p, --q) : (--p, ++q);\n auto mm = min(p - P.begin(), q - P.begin());\n sum[mm & 1][mm]++;\n sum[mm & 1][max(p - P.begin(), q - P.begin())]--;\n } else {\n ret += abs(*p - s[i]);\n if(abs(p - q) == 0) continue;\n s[i] < t[i] ? ++p : --p;\n auto mm = min(p - P.begin(), q - P.begin());\n sum[mm & 1][mm]++;\n sum[mm & 1][max(p - P.begin(), q - P.begin())]--;\n }\n }\n }\n for(int i = 1; i < M; i++) {\n sum[0][i] += sum[0][i - 1];\n sum[1][i] += sum[1][i - 1];\n }\n for(int i = 0; i < M - 1; i++) {\n ret += 1LL * sum[i & 1][i] * (P[i + 1] - P[i]);\n }\n printf(\"%lld\\n\", ret);\n}","accuracy":1,"time_ms":40,"memory_kb":4820,"score_of_the_acc":-0.2161,"final_rank":1},{"submission_id":"aoj_2317_1816952","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(a) a.begin(), a.end()\n#define MS(m,v) memset(m,v,sizeof(m))\n#define D10 fixed<<setprecision(10)\ntypedef long long ll;\ntypedef long double ld;\ntypedef vector<ll> vi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\nconst int MOD = 1000000007;\nconst int INF = MOD + 1;\nconst ld EPS = 1e-12;\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); }\n\n/*--------------------template--------------------*/\n\nint main()\n{\n\tint n, m;\n\tcin >> n >> m;\n\tvector<pii> v;\n\tREP(i, n)\n\t{\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tv.emplace_back(a, b);\n\t}\n\tvi p(m);\n\tREP(i, m) cin >> p[i];\n\tsort(ALL(p));\n\tvi os, es;\n\tes.push_back(0), es.push_back(p[0]);\n\tos.push_back(0);\n\tif(m > 1) os.push_back(p[1] - p[0]);\n\telse os.push_back(0);\n\tFOR(i, 2, m)\n\t{\n\t\tif (i % 2) os.push_back(os.back() + p[i] - p[i - 1]);\n\t\telse es.push_back(es.back() + p[i] - p[i - 1]);\n\t}\n\tll ans = 0;\n\tREP(i, n) \n\t{\n\t\tint a = v[i].first, b = v[i].second;\n\t\tll tmp = 0;\n\t\tif (a < b)\n\t\t{\n\t\t\tint l = upper_bound(ALL(p), a) - p.begin();\n\t\t\tint r = lower_bound(ALL(p), b) - p.begin() - 1;\t\t\t\n\t\t\tif (l > r)\n\t\t\t{\n\t\t\t\ttmp += b - a;\n\t\t\t}\n\t\t\telse if (l % 2)\n\t\t\t{\n\t\t\t\tif (r % 2)\n\t\t\t\t{\n\t\t\t\t\ttmp += os[r / 2 + 1] - os[l / 2 + 1];\n\t\t\t\t\ttmp += p[l] - a;\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\ttmp += os[(r-1) / 2 + 1] - os[l / 2 + 1];\n\t\t\t\t\ttmp += p[l] - a;\n\t\t\t\t\ttmp += b - p[r];\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (r % 2)\n\t\t\t\t{\n\t\t\t\t\ttmp = es[r / 2 + 1] - es[l / 2 + 1];\n\t\t\t\t\ttmp += p[l] - a;\n\t\t\t\t\ttmp += b - p[r];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\ttmp += es[r / 2 + 1] - es[l / 2 + 1];\n\t\t\t\t\ttmp += p[l] - a;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tint l = upper_bound(ALL(p), b) - p.begin();\n\t\t\tint r = lower_bound(ALL(p), a) - p.begin() - 1;\n\t\t\tif (l > r)\n\t\t\t{\n\t\t\t\ttmp += a - b;\n\t\t\t}\n\t\t\telse if (r % 2)\n\t\t\t{\n\t\t\t\tif (l % 2)\n\t\t\t\t{\n\t\t\t\t\ttmp += es[r / 2 + 1] - es[l / 2 + 1];\n\t\t\t\t\ttmp += a - p[r];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\ttmp += es[(r - 1) / 2 + 1] - es[l / 2 + 1];\n\t\t\t\t\ttmp += p[l] - b;\n\t\t\t\t\ttmp += a - p[r];\n\t\t\t\t}\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t\tif (l % 2)\n\t\t\t\t{\n\t\t\t\t\ttmp = os[(r-1) / 2 + 1] - os[l / 2 + 1];\n\t\t\t\t\ttmp += p[l] - b;\n\t\t\t\t\ttmp += a - p[r];\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\ttmp += os[r / 2] - os[l / 2];\n\t\t\t\t\ttmp += a - p[r];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t//cout << tmp << endl;\n\t\tans += tmp;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":100,"memory_kb":5748,"score_of_the_acc":-0.4004,"final_rank":7},{"submission_id":"aoj_2317_1815309","code_snippet":"#include <iostream>\n#include <vector>\n#include <set>\n#include <algorithm>\n\nusing namespace std;\n\nstruct sec{\n int s,t;\n};\n\nstruct event{\n int type;//0:cut +1:begin(on) +2:begin(off) +3:end(on) +4:end(off)\n int x;\n event(int type, int x){\n this->type=type,this->x=x;\n }\n};\n\nint main(){\n int N,M;\n cin>>N>>M;\n sec S[N];\n int C[M];\n for(auto&s:S) scanf(\"%d %d\",&s.s,&s.t);\n for(auto&c:C) scanf(\"%d\",&c);\n\n vector<event> E;\n for(auto&c:C) E.emplace_back(event(0,c));\n sort(C,C+M);\n long long sum=0;\n\n for(auto&s:S){\n auto lo=lower_bound(C,C+M,min(s.s,s.t));\n auto up=upper_bound(C,C+M,max(s.s,s.t));\n if(lo==up){\n sum+=abs(s.s-s.t);\n continue;\n }\n if(s.s<s.t){\n sum+=*lo-s.s;\n E.emplace_back(event(2,*lo));\n if((up-lo)%2==0){\n sum+=s.t-*(up-1);\n E.emplace_back(event(4,*(up-1)));\n }else{\n E.emplace_back(event(3,*(up-1)));\n }\n }else{\n sum+=s.s-*(up-1);\n E.emplace_back(event(4,*(up-1)));\n if((up-lo)%2){\n E.emplace_back(event(1,*lo));\n }else{\n E.emplace_back(event(2,*lo));\n sum+=*lo-s.t;\n }\n }\n }\n sort(E.begin(),E.end(),[](const event& a, const event& b){return a.x==b.x?a.type<b.type:a.x<b.x;});\n\n int on_n=0,off_n=0;\n for(auto e=E.begin();e!=E.end();e++){\n // cout << e->x << \" \" << e->type << endl;\n switch(e->type){\n case 0:\n if(on_n)sum+=(long long int)on_n*(e->x - (e-1)->x);\n swap(on_n,off_n);\n break;\n case 1:\n on_n++;\n break;\n case 2:\n off_n++;\n break;\n case 3:\n off_n--;\n break;\n case 4:\n on_n--;\n break;\n }\n }\n cout << sum << endl;\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":8292,"score_of_the_acc":-0.4071,"final_rank":8},{"submission_id":"aoj_2317_1815171","code_snippet":"#include <iostream>\n#include <vector>\n#include <set>\n#include <algorithm>\n\nusing namespace std;\n\nstruct event{\n int x;\n int type; //0:cut +:?§???? -:??????\n event(int type, int x){\n this->type=type; this->x=x;\n }\n};\n\nstruct section{\n int s, t;\n bool on;\n};\n\nint main(){\n int N,M;\n cin>>N>>M;\n vector<event> E1,E2;\n section S[N+1];\n for(int i=1;i<=N;i++){\n cin>>S[i].s>>S[i].t;\n if(S[i].s<S[i].t){\n E1.push_back(event(i,S[i].s));\n E1.push_back(event(-i,S[i].t));\n }else{\n E2.push_back(event(i,S[i].s));\n E2.push_back(event(-i,S[i].t));\n }\n }\n for(int i=0;i<M;i++){\n int x;\n cin>>x;\n E1.push_back(event(0,x));\n E2.push_back(event(0,x));\n }\n sort(E1.begin(),E1.end(),[](const event& a, const event& b){return a.x==b.x?a.type>b.type:a.x<b.x;});\n sort(E2.begin(),E2.end(),[](const event& a, const event& b){return a.x==b.x?a.type>b.type:a.x>b.x;});\n int sum=0;\n set<int> I;\n for(auto& i:S)i.on=true;\n for(auto& e:E1){\n if(e.type>0){\n I.insert(e.type);\n }else if(e.type<0){\n if(S[-e.type].on)sum+=S[-e.type].t-S[-e.type].s;\n I.erase(-e.type);\n }else{\n for(auto& i:I){\n if(S[i].on){\n S[i].on=false;\n sum+=e.x-S[i].s;\n S[i].s=e.x;\n }else{\n S[i].on=true;\n S[i].s=e.x;\n }\n }\n }\n }\n for(auto& i:I){\n if(S[i].on)sum+=S[i].t-S[i].s;\n }\n I.clear();\n\n for(auto& e:E2){\n if(e.type>0){\n I.insert(e.type);\n }else if(e.type<0){\n if(S[-e.type].on)sum+=-S[-e.type].t+S[-e.type].s;\n I.erase(-e.type);\n }else{\n for(auto& i:I){\n if(S[i].on){\n S[i].on=false;\n sum+=-e.x+S[i].s;\n S[i].s=e.x;\n }else{\n S[i].on=true;\n S[i].s=e.x;\n }\n }\n }\n }\n for(auto& i:I){\n if(S[i].on)sum+=-S[i].t+S[i].s;\n }\n I.clear();\n cout << sum << endl;\n}","accuracy":0.09523809523809523,"time_ms":420,"memory_kb":3412,"score_of_the_acc":-1.0852,"final_rank":20}],"string":"[\n {\n \"submission_id\": \"aoj_2317_5550696\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 1100000000;\\nint main(){\\n int N, M;\\n cin >> N >> M;\\n vector<int> s(N), t(N);\\n for (int i = 0; i < N; i++){\\n cin >> s[i] >> t[i];\\n }\\n vector<int> p(M);\\n for (int i = 0; i < M; i++){\\n cin >> p[i];\\n }\\n p.push_back(-1);\\n p.push_back(INF);\\n M += 2;\\n sort(p.begin(), p.end());\\n vector<int> d(M - 1);\\n for (int i = 0; i < M - 1; i++){\\n d[i] = p[i + 1] - p[i];\\n }\\n vector<vector<int>> S(2, vector<int>(M));\\n for (int i = 0; i < 2; i++){\\n S[i][0] = 0;\\n for (int j = 0; j < M - 1; j++){\\n S[i][j + 1] = S[i][j];\\n if (j % 2 == i){\\n S[i][j + 1] += d[j];\\n }\\n }\\n }\\n long long ans = 0;\\n for (int i = 0; i < N; i++){\\n if (s[i] < t[i]){\\n int L = lower_bound(p.begin(), p.end(), s[i]) - p.begin();\\n int R = lower_bound(p.begin(), p.end(), t[i]) - p.begin() - 1;\\n ans += S[(L + 1) % 2][R] - S[(L + 1) % 2][L];\\n ans += p[L] - s[i];\\n if ((R - L) % 2 != 0){\\n ans += t[i] - p[R];\\n }\\n }\\n if (s[i] > t[i]){\\n int L = lower_bound(p.begin(), p.end(), t[i]) - p.begin();\\n int R = lower_bound(p.begin(), p.end(), s[i]) - p.begin() - 1;\\n ans += S[R % 2][R] - S[R % 2][L];\\n ans += s[i] - p[R];\\n if ((R - L) % 2 != 0){\\n ans += p[L] - t[i];\\n }\\n }\\n }\\n cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 5740,\n \"score_of_the_acc\": -0.3513,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2317_2910875\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define NUM 100001\\n\\nll start[NUM],tail[NUM];\\nll cut_pos[NUM];\\nll ruiseki_odd[NUM],ruiseki_even[NUM];\\n\\nint main(){\\n\\n\\tint N,M;\\n\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\t\\tscanf(\\\"%lld %lld\\\",&start[i],&tail[i]);\\n\\t}\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tscanf(\\\"%lld\\\",&cut_pos[i]);\\n\\t}\\n\\tsort(cut_pos,cut_pos+M);\\n\\n\\t//偶奇に分けた累積和テーブルを作成\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\truiseki_odd[i] = 0;\\n\\t\\truiseki_even[i] = 0;\\n\\t}\\n\\t//ruiseki_odd[i:奇数] = cut_pos[i:奇数]-cut_pos[i-1]の累積和\\n\\tfor(int i = 1; i < M; i += 2){\\n\\t\\truiseki_odd[i] = cut_pos[i]-cut_pos[i-1];\\n\\t\\tif(i > 1){\\n\\t\\t\\truiseki_odd[i] += ruiseki_odd[i-2];\\n\\t\\t}\\n\\t}\\n\\t//ruiseki_even[i:偶数] = cut_pos[i:偶数]-cut_pos[i-1]の累積和\\n\\tfor(int i = 2; i < M; i += 2){\\n\\t\\truiseki_even[i] = cut_pos[i]-cut_pos[i-1];\\n\\t\\truiseki_even[i] += ruiseki_even[i-2];\\n\\t}\\n\\n\\tll ans = 0;\\n\\tint left,right,m;\\n\\tint max_index,min_index;\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tif(start[i] > tail[i]){\\n\\n\\t\\t\\tif(cut_pos[0] >= start[i] || cut_pos[M-1] <= tail[i]){ //糸が分断されない場合\\n\\t\\t\\t\\tans += start[i]-tail[i];\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t//start[i]以下の、最大の切断点を探す\\n\\t\\t\\tleft = 0,right = M-1,m = (left+right)/2;\\n\\t\\t\\twhile(left <= right){\\n\\t\\t\\t\\tif(cut_pos[m] <= start[i]){\\n\\t\\t\\t\\t\\tmax_index = m;\\n\\t\\t\\t\\t\\tleft = m+1;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tright = m-1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tm = (left+right)/2;\\n\\t\\t\\t}\\n\\t\\t\\t//tail[i]以上の、最小の切断点を探す\\n\\t\\t\\tleft = 0,right = M-1, m = (left+right)/2;\\n\\t\\t\\twhile(left <= right){\\n\\t\\t\\t\\tif(cut_pos[m] >= tail[i]){\\n\\t\\t\\t\\t\\tmin_index = m;\\n\\t\\t\\t\\t\\tright = m-1;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tleft = m+1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tm = (left+right)/2;\\n\\t\\t\\t}\\n\\t\\t\\tif(min_index > max_index){ //切断区間内にstartとtailが挟まっている場合\\n\\t\\t\\t\\tans += start[i]-tail[i];\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tans += start[i]-cut_pos[max_index]; //一番使い魔側の区間を足す\\n\\n\\t\\t\\tif(max_index%2 == 0){ //最初の切れ目が偶数の場合:ruiseki_odd\\n\\n\\t\\t\\t\\tif(min_index%2 == 0){ //tailが無効区間\\n\\n\\t\\t\\t\\t\\tans += ruiseki_odd[max(0,max_index-1)]-ruiseki_odd[max(0,min_index-1)];\\n\\n\\t\\t\\t\\t}else{ //tailが有効区間\\n\\n\\t\\t\\t\\t\\tans += ruiseki_odd[max(0,max_index-1)]-ruiseki_odd[min_index]+cut_pos[min_index]-tail[i];\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{ //max_index%2 == 1\\n\\n\\t\\t\\t\\tif(min_index%2 == 1){ //tailが無効区間\\n\\n\\t\\t\\t\\t\\tans += ruiseki_even[max(0,max_index-1)]-ruiseki_even[max(0,min_index-1)];\\n\\n\\t\\t\\t\\t}else{ //tailが有効区間\\n\\n\\t\\t\\t\\t\\tans += ruiseki_even[max(0,max_index-1)]-ruiseki_even[min_index];\\n\\t\\t\\t\\t\\tif(min_index > 0){\\n\\t\\t\\t\\t\\t\\tans += cut_pos[min_index]-tail[i];\\n\\t\\t\\t\\t\\t}else if(min_index != max_index && min_index == 0 && tail[i] < cut_pos[0]){\\n\\t\\t\\t\\t\\t\\tans += cut_pos[0]-tail[i];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //start[i] < tail[i]\\n\\n\\t\\t\\tif(cut_pos[0] >= tail[i] || cut_pos[M-1] <= start[i]){\\n\\t\\t\\t\\tans += tail[i]-start[i];\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\t\\t\\t//start[i]以上の、最小の切断点を探す\\n\\t\\t\\tleft = 0,right = M-1,m = (left+right)/2;\\n\\t\\t\\twhile(left <= right){\\n\\t\\t\\t\\tif(cut_pos[m] >= start[i]){\\n\\t\\t\\t\\t\\tmin_index = m;\\n\\t\\t\\t\\t\\tright = m-1;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tleft = m+1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tm = (left+right)/2;\\n\\t\\t\\t}\\n\\t\\t\\t//tail[i]以下の、最大の切断点を探す\\n\\t\\t\\tleft = 0,right = M-1,m = (left+right)/2;\\n\\t\\t\\twhile(left <= right){\\n\\t\\t\\t\\tif(cut_pos[m] <= tail[i]){\\n\\t\\t\\t\\t\\tmax_index = m;\\n\\t\\t\\t\\t\\tleft = m+1;\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tright = m-1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tm = (left+right)/2;\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(min_index > max_index){ //切断区間内にstartとtailが挟まっている場合\\n\\t\\t\\t\\tans += tail[i]-start[i];\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tans += cut_pos[min_index]-start[i];\\n\\n\\t\\t\\tif(min_index%2 == 1){ //最初の切れ目が奇数の場合;ruiseki_odd\\n\\n\\t\\t\\t\\tif(max_index%2 == 1){ //tailが無効区間\\n\\n\\t\\t\\t\\t\\tans += ruiseki_odd[max_index]-ruiseki_odd[min_index];\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tans += ruiseki_odd[max(0,max_index-1)]-ruiseki_odd[min_index]+tail[i]-cut_pos[max_index];\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t}else{ //min_index%2 == 0:最初の切れ間が偶数:ruiseki_even\\n\\n\\t\\t\\t\\tif(max_index%2 == 0){ //tailが無効区間\\n\\n\\t\\t\\t\\t\\tans += ruiseki_even[max_index]-ruiseki_even[min_index];\\n\\t\\t\\t\\t}else{\\n\\t\\t\\t\\t\\tans += ruiseki_even[max(0,max_index-1)]-ruiseki_even[min_index]+tail[i]-cut_pos[max_index];\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tprintf(\\\"%lld\\\\n\\\",ans);\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7180,\n \"score_of_the_acc\": -0.3128,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2317_2898458\",\n \"code_snippet\": \"#include <cstdio>\\n#include <vector>\\n#include <algorithm>\\n#include <utility>\\nusing namespace std;\\nusing ll = long long int;\\nconst ll INF = 1LL << 30;\\n\\nll N, M;\\n\\nll solve(vector<ll> cuts, vector< pair<ll, ll> > strands) {\\n ll ret = 0;\\n\\n vector<ll> even, odd;\\n even.push_back(0); odd.push_back(0);\\n for(size_t i=1; i<cuts.size(); i++) {\\n ll mo = i % 2, diff = cuts[i] - cuts[i-1];\\n (mo ? odd : even).push_back( (mo ? odd : even).back() + diff );\\n (mo ? even : odd).push_back( (mo ? even : odd).back() ); // zero\\n }\\n\\n for(auto e : strands) {\\n ll l = e.first, r = e.second, sum = 0;\\n sum += r - l;\\n ll il = lower_bound(cuts.begin(), cuts.end(), l) - cuts.begin();\\n ll ir = lower_bound(cuts.begin(), cuts.end(), r) - cuts.begin() - 1;\\n\\n if(ir - il >= 0) {\\n if(il % 2 == 0) {\\n sum -= odd [ir] - odd [il];\\n }\\n if(il % 2 == 1) {\\n sum -= even[ir] - even[il];\\n }\\n\\n if( (ir - il) % 2 == 0 ) {\\n ll bound = cuts[ir];\\n if(l < bound && bound < r) sum -= r - bound;\\n }\\n }\\n\\n // printf(\\\"[%lld, %lld], il = %lld, ir = %lld, len = %lld\\\\n\\\", l, r, il, ir, sum);\\n ret += sum;\\n }\\n return ret;\\n}\\n\\nint main() {\\n scanf(\\\"%lld%lld\\\", &N, &M);\\n vector< pair<ll, ll> > strands, rev_strands;\\n for(int i=0; i<N; i++) {\\n ll l, r; scanf(\\\"%lld%lld\\\", &l, &r);\\n if(l < r) strands.push_back(make_pair(l, r));\\n else rev_strands.push_back(make_pair(INF - l, INF - r));\\n }\\n\\n vector<ll> cuts(M);\\n for(int i=0; i<M; i++) {\\n scanf(\\\"%lld\\\", &cuts[i]);\\n }\\n\\n ll ans = 0;\\n sort(cuts.begin(), cuts.end());\\n ans += solve(cuts, strands);\\n reverse(cuts.begin(), cuts.end());\\n for(auto &c : cuts) {\\n c = INF - c;\\n }\\n ans += solve(cuts, rev_strands);\\n printf(\\\"%lld\\\\n\\\", ans);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 9184,\n \"score_of_the_acc\": -0.3949,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2317_1966574\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\ntypedef vector<int>vint;\\ntypedef pair<int,int>pint;\\ntypedef vector<pint>vpint;\\n#define rep(i,n) for(int i=0;i<(n);i++)\\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\\n#define all(v) (v).begin(),(v).end()\\n#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)\\n#define pb push_back\\n#define fi first\\n#define se second\\ntemplate<typename A,typename B>inline void chmin(A &a,B b){if(a>b)a=b;}\\ntemplate<typename A,typename B>inline void chmax(A &a,B b){if(a<b)a=b;}\\n\\nint N,M;\\nint S[111111],T[111111];\\nint P[222222];\\n\\nint sum[222222];\\nsigned main(){\\n cin>>N>>M;\\n rep(i,N){\\n cin>>S[i]>>T[i];\\n if(S[i]>T[i])S[i]*=-1,T[i]*=-1;\\n }\\n rep(i,M)cin>>P[i],P[i+M]=-P[i];\\n M*=2;\\n sort(P,P+M);\\n\\n for(int i=1;i<M;i++){\\n sum[i]=P[i]-P[i-1]+(i>1?sum[i-2]:0);\\n }\\n\\n int ans=0;\\n rep(i,N){\\n if(T[i]<P[0]){\\n ans+=T[i]-S[i];\\n continue;\\n }\\n if(P[M-1]<S[i]){\\n ans+=T[i]-S[i];\\n continue;\\n }\\n int t=upper_bound(P,P+M,T[i])-P-1;\\n int s=upper_bound(P,P+M,S[i])-P;\\n if(s%2!=t%2){\\n ans+=sum[t-1]-sum[s]+T[i]-P[t]+P[s]-S[i];\\n }\\n else{\\n ans+=sum[t]-sum[s]+P[s]-S[i];\\n }\\n }\\n\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 6048,\n \"score_of_the_acc\": -0.5103,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_2317_1898585\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\nstruct INIT{INIT(){ios::sync_with_stdio(false);cin.tie(0);}}init;\\ntypedef long long LL;\\ntypedef tuple<LL,LL> T;\\ntypedef vector<LL> VL;\\ntypedef vector<T> VT;\\n#define rep(i,n) for(auto i=(n)*0;i<n;i++)\\n#define range(it,v) for(auto &it:v)\\n\\n\\nLL getlen(set<LL>& event,VL& point,VT& seg,LL prev){\\n priority_queue<LL,vector<LL>,greater<LL>> on,off;\\n int n=point.size();\\n int m=seg.size();\\n int i=0,j=0;\\n LL res=0;\\n range(it,event){\\n\\t\\n\\tres+=((LL)on.size())*(it-prev);\\n\\tprev=it;\\n\\t//\\tcout<<it<<\\\" \\\"<<res<<endl;\\n\\tif(i<n&&point[i]==it){\\n\\t swap(on,off);\\n\\t i++;\\n\\t}\\n\\telse {\\n\\t if(on.empty()==false&&on.top()==it){\\n\\t\\ton.pop();\\n\\t }\\n\\t else if(off.empty()==false&&off.top()==it){\\n\\t\\toff.pop();\\n\\t }\\n\\t else{\\n\\t\\tLL s,t;\\n\\t\\ttie(s,t)=seg[j++];\\n\\t\\ton.push(t);\\n\\t }\\n\\t}\\n }\\n return res;\\n}\\nint main(){\\n int N,M;\\n cin>>N>>M;\\n VT st;\\n set<LL> e;\\n rep(i,N){\\n\\tint s,t;\\n\\tcin>>s>>t;\\n\\tif(s<t){\\n\\t st.push_back(T(s,t));\\n\\t e.insert(t);\\n\\t e.insert(s);\\n\\t}\\n\\telse {\\n\\t st.push_back(T(-s,-t));\\n\\t e.insert(-t);\\n\\t e.insert(-s);\\n\\t}\\n }\\n sort(st.begin(),st.end());\\n VL point;\\n rep(i,M){\\n\\tLL it;\\n\\tcin>>it;\\n\\tpoint.push_back(it);\\n\\tpoint.push_back(-it);\\n\\te.insert(it);\\n\\te.insert(-it);\\n }\\n sort(point.begin(),point.end());\\n cout<<getlen(e,point,st,-11*4*51*4*1919)<<endl;\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 25740,\n \"score_of_the_acc\": -1.5854,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2317_1895883\",\n \"code_snippet\": \"#include<cstdio>\\n#include<cstdlib>\\n#include<cstring>\\n#include<cmath>\\n//#include<cctype>\\n#include<climits>\\n#include<iostream>\\n#include<string>\\n#include<vector>\\n#include<map>\\n//#include<list>\\n#include<queue>\\n#include<deque>\\n#include<algorithm>\\n//#include<numeric>\\n#include<utility>\\n//#include<memory>\\n#include<functional>\\n#include<cassert>\\n#include<set>\\n#include<stack>\\n#include<random>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\ntypedef pair<int, int> pii;\\n\\nconst int MAXN = 100100;\\nint S[MAXN], T[MAXN];\\nint P[MAXN];\\nint N, M;\\nll sumEven[MAXN], sumOdd[MAXN];\\n\\nll calc(int i) {\\n int is = lower_bound(P, P+M, S[i]) - P;\\n int it = lower_bound(P, P+M, T[i]) - P; it--;\\n if (is == M || it == -1) return T[i] - S[i];\\n ll ret = 0;\\n if ((it-is)%2 == 0) {\\n if (is%2) {\\n ret = (sumOdd[it+2] - sumOdd[is]) - (sumEven[it+1] - sumEven[is+1]) - S[i];\\n } else {\\n ret = (sumEven[it+2] - sumEven[is]) - (sumOdd[it+1] - sumOdd[is+1]) - S[i];\\n }\\n } else {\\n if (is%2) {\\n ret = (sumOdd[it+1] - sumOdd[is]) - (sumEven[it+2] - sumEven[is+1]) + T[i] - S[i];\\n } else {\\n ret = (sumEven[it+1] - sumEven[is]) - (sumOdd[it+2] - sumOdd[is+1]) + T[i] - S[i];\\n }\\n }\\n return ret;\\n}\\n\\nll solve() {\\n memset(sumEven, 0, sizeof(sumEven));\\n memset(sumOdd, 0, sizeof(sumOdd));\\n for (int i = 0; i < M; i += 2) {\\n sumEven[i+1] = sumEven[i];\\n sumEven[i+2] = sumEven[i] + P[i];\\n }\\n for (int i = 1; i < M; i += 2) {\\n sumOdd[i+2] = sumOdd[i] + P[i];\\n sumOdd[i+1] = sumOdd[i+2];\\n }\\n ll ans = 0;\\n for (int i = 0; i < N; i++) if (S[i] < T[i]) {\\n ll tmp = calc(i);\\n ans += tmp;\\n }\\n return ans;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cin >> N >> M;\\n for (int i = 0; i < N; i++)\\n cin >> S[i] >> T[i];\\n for (int i = 0; i < M; i++) \\n cin >> P[i];\\n sort(P, P+M);\\n ll ans = solve();\\n reverse(P, P+M);\\n for (int i = 0; i < M; i++)\\n P[i] *= -1;\\n for (int i = 0; i < N; i++) {\\n S[i] *= -1;\\n T[i] *= -1;\\n }\\n ans += solve();\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 5912,\n \"score_of_the_acc\": -0.2608,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_2317_1887064\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <queue>\\n#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))\\ntypedef long long ll;\\nusing namespace std;\\n\\nconst int open_tag = 1;\\nconst int close_tag = 2;\\nconst int toggle_tag = 3;\\nunion event_t {\\n struct { int tag; int t; } common;\\n struct { int tag; int l, i; } open; // [l, r)\\n struct { int tag; int r, i; } close; // [l, r)\\n struct { int tag; int p; } toggle;\\n};\\nbool operator < (event_t a, event_t b) { return a.common.t > b.common.t; } // weak struct ordering\\nint main() {\\n // init\\n int n, m; cin >> n >> m;\\n priority_queue<event_t> que;\\n repeat (i,n) {\\n int s, t; cin >> s >> t;\\n event_t el = { open_tag };\\n event_t er = { close_tag };\\n if (s < t) {\\n el.open .l = s;\\n er.close.r = t;\\n } else {\\n el.open .l = - s;\\n er.close.r = - t;\\n }\\n el.open .i = i;\\n er.close.i = i;\\n que.push(el);\\n que.push(er);\\n }\\n repeat (i,m) {\\n int p; cin >> p;\\n event_t e = { toggle_tag };\\n e.toggle.p = p;\\n que.push(e);\\n e.toggle.p = - p;\\n que.push(e);\\n }\\n // run\\n ll ans = 0;\\n int prv = 0;\\n int on = 0;\\n int off = 0;\\n vector<int> ix(n, -1);\\n vector<int> acc { 0 };\\n while (not que.empty()) {\\n event_t e = que.top(); que.pop();\\n ans += on *(ll) (e.common.t - prv);\\n prv = e.common.t;\\n if (e.common.tag == open_tag) {\\n on += 1;\\n ix[e.open.i] = acc.size() - 1;\\n acc.push_back(acc.back());\\n } else if (e.common.tag == close_tag) {\\n ((acc.back() - acc[ix[e.close.i]]) % 2 == 0 ? on : off) -= 1;\\n } else if (e.common.tag == toggle_tag) {\\n swap(on, off);\\n acc.back() += 1;\\n }\\n }\\n // output\\n cout << ans << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 9124,\n \"score_of_the_acc\": -0.6363,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_2317_1885440\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)\\n#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)\\n#define pb push_back\\n#define all(x) (x).begin(), (x).end()\\n#define fi first\\n#define se second\\n#define mt make_tuple\\n#define mp make_pair\\ntemplate<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }\\ntemplate<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\nusing ll = long long; using ld = long double; using vll = vector<ll>; using vvll = vector<vll>; using vld = vector<ld>; \\nusing vi = vector<int>; using vvi = vector<vi>;\\nvll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }\\nusing P = pair<ll, ll>;\\n\\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << \\\"(\\\" << v.first << \\\", \\\" << v.second << \\\")\\\"; return o; }\\ntemplate<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};\\ntemplate<class Ch, class Tr, class Tuple, size_t... Is>\\nvoid print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? \\\"\\\" : \\\", \\\") << get<Is>(t)), 0)...}; }\\ntemplate<class Ch, class Tr, class... Args> \\nauto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << \\\"(\\\"; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << \\\")\\\"; }\\nostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << \\\" \\\"; cout << endl; } return o; }\\ntemplate <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const unordered_map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << \\\"]\\\"; return o; }\\nvoid printbits(ll mask, ll n) { rep(i, n) { cout << !!(mask & (1ll << i)); } cout << endl; }\\n#define ldout fixed << setprecision(40) \\n\\nstatic const double EPS = 1e-14;\\nstatic const long long INF = 1e18;\\nstatic const long long mo = 1e9+7;\\n\\n// ?´???????????¨????\\n// ?§????O(n)\\n// ?????¨???O(1)\\nconst function<bool(ll)> f1_default = [](ll x) { return 1; };\\nclass Sum1d {\\npublic:\\n vll data;\\n vll sumdata;\\n Sum1d(vll& d, function<bool(ll)> f = f1_default) {\\n int n = d.size();\\n data = d;\\n sumdata = vll(n+1, 0);\\n rep(i, n) if(f(i)) sumdata[i+1] = data[i];\\n rep(i, n) sumdata[i+1] += sumdata[i];\\n }\\n // [i, j)????°???????????????? (????????????)\\n ll sum(int i, int j) {\\n if (i >= j)\\n return 0;\\n return sumdata[j]-sumdata[i];\\n }\\n // [i, i+ilen)????°???????????????? (????????????)\\n ll suml(int i, int len) {\\n return this->sum(i, i+len);\\n }\\n void print(void) {\\n rep(i, sumdata.size()) cout << sumdata[i] << \\\" \\\"; cout << endl;\\n }\\n};\\nint main(void) {\\n cin.tie(0); ios::sync_with_stdio(false);\\n ll n, m; cin >> n >> m;\\n vll s(n), t(n), p(m); \\n rep(i, s.size()) \\n cin >> s[i] >> t[i]; \\n rep(i, p.size()) \\n cin >> p[i];\\n\\n sort(all(p));\\n\\n vll pd_even(m), pd_odd(m);\\n pd_even[0] = p[0];\\n repi(i, 1, m) {\\n (i % 2 == 0 ? pd_even[i] : pd_odd[i]) = p[i]-p[i-1];\\n (i % 2 == 1 ? pd_even[i] : pd_odd[i]) = 0;\\n }\\n\\n Sum1d s_even(pd_even), s_odd(pd_odd);\\n\\n ll ret = 0;\\n rep(i, s.size()) {\\n ll is = lower_bound(all(p), s[i]) - p.begin();\\n ll it = lower_bound(all(p), t[i]) - p.begin();\\n if (is == it) {\\n ret += abs(t[i] - s[i]);\\n continue;\\n }\\n\\n if (is < it) {\\n ret += abs(p[is] - s[i]);\\n if (it % 2 == is % 2) {\\n ret += abs(p[it-1] - t[i]);\\n }\\n ret += (is % 2 == 0 ? s_even : s_odd).sum(is+1, it);\\n } else {\\n ret += abs(p[is-1] - s[i]);\\n if (it % 2 == is % 2) {\\n ret += abs(p[it] - t[i]);\\n }\\n ret += (is % 2 == 0 ? s_even : s_odd).sum(it+1, is);\\n }\\n }\\n cout << ret << endl;\\n\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 9960,\n \"score_of_the_acc\": -0.4267,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2317_1885438\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)\\n#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)\\n#define pb push_back\\n#define all(x) (x).begin(), (x).end()\\n#define fi first\\n#define se second\\n#define mt make_tuple\\n#define mp make_pair\\ntemplate<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }\\ntemplate<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\\n\\nusing ll = long long; using ld = long double; using vll = vector<ll>; using vvll = vector<vll>; using vld = vector<ld>; \\nusing vi = vector<int>; using vvi = vector<vi>;\\nvll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }\\nusing P = pair<ll, ll>;\\n\\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << \\\"(\\\" << v.first << \\\", \\\" << v.second << \\\")\\\"; return o; }\\ntemplate<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};\\ntemplate<class Ch, class Tr, class Tuple, size_t... Is>\\nvoid print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? \\\"\\\" : \\\", \\\") << get<Is>(t)), 0)...}; }\\ntemplate<class Ch, class Tr, class... Args> \\nauto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << \\\"(\\\"; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << \\\")\\\"; }\\nostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << \\\" \\\"; cout << endl; } return o; }\\ntemplate <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? \\\", \\\" : \\\"\\\"); o << \\\"]\\\"; return o; }\\ntemplate <typename T, typename U> ostream &operator<<(ostream &o, const unordered_map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << \\\"]\\\"; return o; }\\nvoid printbits(ll mask, ll n) { rep(i, n) { cout << !!(mask & (1ll << i)); } cout << endl; }\\n#define ldout fixed << setprecision(40) \\n\\nstatic const double EPS = 1e-14;\\nstatic const long long INF = 1e18;\\nstatic const long long mo = 1e9+7;\\n\\n// ?´???????????¨????\\n// ?§????O(n)\\n// ?????¨???O(1)\\nconst function<bool(ll)> f1_default = [](ll x) { return 1; };\\nclass Sum1d {\\npublic:\\n vll data;\\n vll sumdata;\\n Sum1d(vll& d, function<bool(ll)> f = f1_default) {\\n int n = d.size();\\n data = d;\\n sumdata = vll(n+1, 0);\\n rep(i, n) if(f(i)) sumdata[i+1] = data[i];\\n rep(i, n) sumdata[i+1] += sumdata[i];\\n }\\n // [i, j)????°???????????????? (????????????)\\n ll sum(int i, int j) {\\n if (i >= j)\\n return 0;\\n return sumdata[j]-sumdata[i];\\n }\\n // [i, i+ilen)????°???????????????? (????????????)\\n ll suml(int i, int len) {\\n return this->sum(i, i+len);\\n }\\n void print(void) {\\n rep(i, sumdata.size()) cout << sumdata[i] << \\\" \\\"; cout << endl;\\n }\\n};\\nint main(void) {\\n cin.tie(0); ios::sync_with_stdio(false);\\n ll n, m; cin >> n >> m;\\n vll s(n), t(n), p(m); rep(i, s.size()) cin >> s[i] >> t[i]; rep(i, p.size()) cin >> p[i];\\n sort(all(p));\\n\\n vll pd_even(m), pd_odd(m);\\n pd_even[0] = p[0];\\n repi(i, 1, m) {\\n if (i % 2 == 0) {\\n pd_even[i] = p[i]-p[i-1];\\n pd_odd[i] = 0;\\n } else {\\n pd_even[i] = 0;\\n pd_odd[i] = p[i]-p[i-1];\\n }\\n }\\n /*\\n cout << pd_even << endl;\\n cout << pd_odd << endl;\\n */\\n\\n Sum1d s_even(pd_even), s_odd(pd_odd);\\n /*\\n s_even.print();\\n s_odd.print();\\n cout << s_even.sum(1, 4) << endl;\\n */\\n\\n ll ret = 0;\\n rep(i, s.size()) {\\n ll is = lower_bound(all(p), s[i]) - p.begin();\\n ll it = lower_bound(all(p), t[i]) - p.begin();\\n /*\\n cout << is << \\\" \\\" << it << endl;\\n */\\n if (is == it) {\\n ret += abs(t[i] - s[i]);\\n continue;\\n }\\n\\n if (is < it) {\\n// cout << \\\"#Forward\\\" << endl;\\n ret += abs(p[is] - s[i]);\\n// cout << abs(p[is] - s[i]) << endl;\\n if (it % 2 == is % 2) {\\n ret += abs(p[it-1] - t[i]);\\n// cout << p[it-1] << \\\" \\\" << t[i] << \\\"#detail\\\" << endl;\\n// cout << abs(p[it-1] - t[i]) << endl;\\n }\\n ret += (is % 2 == 0 ? s_even : s_odd).sum(is+1, it);\\n// cout <<(is % 2 == 0 ? s_even : s_odd).sum(is+1, it) << endl;\\n } else {\\n// cout << \\\"#Inverse\\\" << endl;\\n ret += abs(p[is-1] - s[i]);\\n// cout << abs(p[is-1] - s[i]) << endl;\\n if (it % 2 == is % 2) {\\n ret += abs(p[it] - t[i]);\\n// cout << abs(p[it] - t[i]) << endl;\\n }\\n ret += (is % 2 == 0 ? s_even : s_odd).sum(it+1, is);\\n// cout << (is % 2 == 0 ? s_even : s_odd).sum(it+1, is) << endl;\\n }\\n }\\n cout << ret << endl;\\n\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 9960,\n \"score_of_the_acc\": -0.4511,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2317_1879645\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef pair<int, int> pii;\\n\\nint main()\\n{\\n int N, M, s, t, p;\\n cin >> N >> M;\\n vector<pii> v[2];\\n for (int i = 0; i < N; i++) {\\n cin >> s >> t;\\n int j = i+1;\\n if (s < t) {\\n v[0].push_back(pii(s, j));\\n v[0].push_back(pii(t, j));\\n } else {\\n v[1].push_back(pii(s, -j));\\n v[1].push_back(pii(t, -j));\\n }\\n }\\n for (int i = 0; i < M; i++) {\\n cin >> p;\\n v[0].push_back(pii(p, 0));\\n v[1].push_back(pii(p, 0));\\n }\\n\\n sort(v[0].begin(), v[0].end());\\n sort(v[1].rbegin(), v[1].rend());\\n\\n ll res = 0;\\n for (int i = 0; i < 2; i++) {\\n vector<int> use(N, -1);\\n int cut = 0, even = 0, odd = 0;\\n for (int j = 0; j < (int)v[i].size(); j++) {\\n int k = (i == 0 ? +1 : -1);\\n int x = v[i][j].second * k;\\n if (j > 0) {\\n ll cost = k * (ll)(v[i][j].first - v[i][j-1].first) * even;\\n res += cost;\\n }\\n \\n if (x != 0) {\\n x--;\\n if (use[x] == -1) {\\n use[x] = cut;\\n even++;\\n } else {\\n if ((cut - use[x]) % 2 == 0) {\\n even--;\\n } else {\\n odd--;\\n }\\n }\\n } else {\\n cut++;\\n swap(even, odd);\\n }\\n }\\n }\\n cout << res << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 6440,\n \"score_of_the_acc\": -0.4532,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2317_1879631\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define N 100005\\nusing namespace std;\\nlong long n,m,s[N],t[N],p[N],d[N],ans;\\n\\nint bynary_search(int x){\\n int l=0,r=m;\\n while(l<r){\\n int mid=(l+r)/2;\\n if(x<=p[mid])r=mid;\\n else l=mid+1;\\n }\\n return l;\\n}\\n\\nint main(){\\n cin>>n>>m;\\n for(int i=0;i<n;i++)cin>>s[i]>>t[i];\\n for(int i=0;i<m;i++)cin>>p[i];\\n sort(p,p+m);\\n d[0]=p[0],d[1]=p[1]-p[0];\\n ans=0;\\n for(int i=2;i<m;i++)d[i]=d[i-2]+p[i]-p[i-1];\\n for(int i=0;i<n;i++){\\n int r1=bynary_search(s[i]);\\n int r2=bynary_search(t[i]);\\n if(r1==r2)ans+=max(s[i],t[i])-min(s[i],t[i]);\\n else if(abs(r1-r2)==1){\\n if(s[i]<t[i])ans+=p[r1]-s[i];\\n else ans+=s[i]-p[r1-1];\\n }\\n else if(s[i]<t[i]){\\n if(r2%2==r1%2)ans+=p[r1]-s[i]+d[r2-2]-d[r1]+t[i]-p[r2-1];\\n else ans+=p[r1]-s[i]+d[r2-1]-d[r1];\\n }else{\\n if(r2%2==r1%2)ans+=s[i]-p[r1-1]+d[r1-2]-d[r2]+p[r2]-t[i];\\n else ans+=s[i]-p[r1-1]+d[r1-2]-d[r2-1];\\n }\\n }\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 4300,\n \"score_of_the_acc\": -0.4387,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2317_1879630\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define N 10005\\nusing namespace std;\\nlong long n,m,s[N],t[N],p[N],d[N],ans;\\n\\nint bynary_search(int x){\\n int l=0,r=m;\\n while(l<r){\\n int mid=(l+r)/2;\\n if(x<=p[mid])r=mid;\\n else l=mid+1;\\n }\\n return l;\\n}\\n\\nint main(){\\n cin>>n>>m;\\n for(int i=0;i<n;i++)cin>>s[i]>>t[i];\\n for(int i=0;i<m;i++)cin>>p[i];\\n sort(p,p+m);\\n d[0]=p[0],d[1]=p[1]-p[0];\\n ans=0;\\n for(int i=2;i<m;i++)d[i]=d[i-2]+p[i]-p[i-1];\\n for(int i=0;i<n;i++){\\n int r1=bynary_search(s[i]);\\n int r2=bynary_search(t[i]);\\n if(r1==r2)ans+=max(s[i],t[i])-min(s[i],t[i]);\\n else if(abs(r1-r2)==1){\\n if(s[i]<t[i])ans+=p[r1]-s[i];\\n else ans+=s[i]-p[r1-1];\\n }\\n else if(s[i]<t[i]){\\n if(r2%2==r1%2)ans+=p[r1]-s[i]+d[r2-2]-d[r1]+t[i]-p[r2-1];\\n else ans+=p[r1]-s[i]+d[r2-1]-d[r1];\\n }else{\\n if(r2%2==r1%2)ans+=s[i]-p[r1-1]+d[r1-2]-d[r2]+p[r2]-t[i];\\n else ans+=s[i]-p[r1-1]+d[r1-2]-d[r2-1];\\n }\\n }\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.19047619047619047,\n \"time_ms\": 10,\n \"memory_kb\": 1488,\n \"score_of_the_acc\": -0.0064,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_2317_1879629\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define N 10005\\nusing namespace std;\\nint n,m,s[N],t[N],p[N],d[N],ans;\\n\\nint bynary_search(int x){\\n int l=0,r=m;\\n while(l<r){\\n int mid=(l+r)/2;\\n if(x<=p[mid])r=mid;\\n else l=mid+1;\\n }\\n return l;\\n}\\n\\nint main(){\\n cin>>n>>m;\\n for(int i=0;i<n;i++)cin>>s[i]>>t[i];\\n for(int i=0;i<m;i++)cin>>p[i];\\n sort(p,p+m);\\n d[0]=p[0],d[1]=p[1]-p[0];\\n ans=0;\\n for(int i=2;i<m;i++)d[i]=d[i-2]+p[i]-p[i-1];\\n for(int i=0;i<n;i++){\\n int r1=bynary_search(s[i]);\\n int r2=bynary_search(t[i]);\\n if(r1==r2)ans+=max(s[i],t[i])-min(s[i],t[i]);\\n else if(abs(r1-r2)==1){\\n if(s[i]<t[i])ans+=p[r1]-s[i];\\n else ans+=s[i]-p[r1-1];\\n }\\n else if(s[i]<t[i]){\\n if(r2%2==r1%2)ans+=p[r1]-s[i]+d[r2-2]-d[r1]+t[i]-p[r2-1];\\n else ans+=p[r1]-s[i]+d[r2-1]-d[r1];\\n }else{\\n if(r2%2==r1%2)ans+=s[i]-p[r1-1]+d[r1-2]-d[r2]+p[r2]-t[i];\\n else ans+=s[i]-p[r1-1]+d[r1-2]-d[r2-1];\\n }\\n }\\n cout<<ans<<endl;\\n return 0;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 10,\n \"memory_kb\": 1332,\n \"score_of_the_acc\": 0,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_2317_1857100\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\ntypedef pair<ll, ll> P;\\n\\n#define EACH(i,a) for (auto& i : a)\\n#define FOR(i,a,b) for (ll i=(a);i<(b);i++)\\n#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)\\n#define REP(i,n) for (ll i=0;i<(n);i++)\\n#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)\\n#define debug(x) cout<<#x<<\\\": \\\"<<x<<endl\\n#define pb push_back\\n#define ALL(a) (a).begin(),(a).end()\\n\\nconst ll linf = 1e18;\\nconst int inf = 1e9;\\nconst double eps = 1e-12;\\nconst double pi = acos(-1);\\n\\ntemplate<typename T>\\nistream& operator>>(istream& is, vector<T>& vec) {\\n\\tEACH(x,vec) is >> x;\\n\\treturn is;\\n}\\n/*\\ntemplate<class... T>\\nostream& operator<<(ostream& os, tuple<T...>& t) {\\n\\tfor (size_t i = 0; i < tuple_size< tuple<T...> >::value; ++i) {\\n\\t\\tif (i) os << \\\" \\\";\\n\\t\\tos << get<0>(t);\\n\\t}\\n\\treturn os;\\n}\\n*/\\ntemplate<typename T>\\nostream& operator<<(ostream& os, vector<T>& vec) {\\n\\tREP(i,vec.size()) {\\n\\t\\tif (i) os << \\\" \\\";\\n\\t\\tos << vec[i];\\n\\t}\\n\\treturn os;\\n}\\ntemplate<typename T>\\nostream& operator<<(ostream& os, vector< vector<T> >& vec) {\\n\\tREP(i,vec.size()) {\\n\\t\\tif (i) os << endl;\\n\\t\\tos << vec[i];\\n\\t}\\n\\treturn os;\\n}\\n\\nint main() {\\n\\tstd::ios::sync_with_stdio(false);\\n\\tstd::cin.tie(0);\\n\\tll N, M; cin >> N >> M;\\n\\tvector<P> v;\\n\\tREP(i, N) {\\n\\t\\tll s, t; cin >> s >> t;\\n\\t\\tv.pb({s, t});\\n\\t}\\n\\tvector<ll> p(M); cin >> p; p.pb(0); p.pb(linf);\\n\\tsort(p.begin(), p.end());\\n\\tvector<ll> sOdd(p.size(), 0), sEven(p.size(), 0);\\n\\tREP(i, (int)p.size()-1) {\\n\\t\\tsOdd[i+1] += sOdd[i];\\n\\t\\tsEven[i+1] +=+ sEven[i];\\n\\t\\tif (i % 2 == 0) {\\n\\t\\t\\tsEven[i+1] += p[i+1]-p[i];\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tsOdd[i+1] += p[i+1]-p[i];\\n\\t\\t}\\n\\t}\\n\\tll ans = 0;\\n\\tREP(i, N) {\\n\\t\\tll s, t; tie(s, t) = v[i];\\n\\t\\tbool f = false;\\n\\t\\tif (s > t) {\\n\\t\\t\\tf = true;\\n\\t\\t\\tint temp = s; s = t; t = temp;\\n\\t\\t}\\n\\t\\tint sid = (upper_bound(ALL(p), s)-p.begin())-1;\\n\\t\\tint tid = (lower_bound(ALL(p), t)-p.begin())-1;\\n\\t\\t// [sid, tid)\\n\\t\\t// cout << s << \\\" \\\" << t << \\\" \\\" << sid << \\\" \\\" << tid << endl;\\n\\t\\t// ll ba = ans;\\n\\t\\tif (tid > sid+1) {\\n\\t\\t\\tif ((!f && (sid % 2 == 0)) || (f && (tid%2 == 0))) {\\n\\t\\t\\t\\tans += sEven[tid] - sEven[sid+1];\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tans += sOdd[tid] - sOdd[sid+1];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (sid == tid) { // [s, t)\\n\\t\\t\\tans += t-s;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif ((tid-sid)%2 == 0 || !f) {\\n\\t\\t\\t\\tans += p[sid+1]-s;\\n\\t\\t\\t}\\n\\t\\t\\tif ((tid-sid)%2 == 0 || f) {\\n\\t\\t\\t\\tans += t-p[tid];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// cout << ans-ba << endl;\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 6848,\n \"score_of_the_acc\": -0.3236,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2317_1833064\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <climits>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <fstream>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <vector>\\n#include <cassert>\\n#include <functional>\\n\\nusing namespace std;\\n\\n#define LOG(...) printf(__VA_ARGS__)\\n//#define LOG(...)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\\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 SORT(c) sort((c).begin(),(c).end())\\n#define RSORT(c) sort((c).rbegin(),(c).rend())\\n#define CLR(a) memset((a), 0 ,sizeof(a))\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<bool> vb;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\ntypedef vector<vb> vvb;\\ntypedef vector<vi> vvi;\\ntypedef vector<vll> vvll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n\\nconst int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };\\n\\nstruct UnionFind {\\n\\tvector<int> v;\\n\\tUnionFind(int n) : v(n) { for (int i = 0; i < n; i++) v[i] = i; }\\n\\tint find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }\\n\\tvoid unite(int x, int y) { v[find(x)] = find(y); }\\n};\\n\\nint main() {\\n\\tint n, m;\\n\\tcin >> n >> m;\\n\\tvector<pair<ll, char>> vpii;\\n\\tvector<ll> hanabi;\\n\\tmap<ll, bool> mib;\\n\\tREP(i, n) {\\n\\t\\tint a, b;\\n\\t\\tcin >> a >> b;\\n\\t\\tif (a < b) {\\n\\t\\t\\tvpii.push_back({ a, 'b' });\\n\\t\\t\\tvpii.push_back({ b, 'e' });\\n\\t\\t}else{\\n\\t\\t\\tvpii.push_back({ a, 'e' });\\n\\t\\t\\tvpii.push_back({ b, 'b' });\\n\\t\\t}\\n\\t}\\n\\n\\tREP(i, m) {\\n\\t\\tint a;\\n\\t\\tcin >> a;\\n\\t\\tvpii.push_back({ a,'f' });\\n\\t\\thanabi.push_back(a);\\n\\t}\\n\\tSORT(hanabi);\\n\\tREP(i, n) {\\n\\t\\tif (vpii[i * 2].first < vpii[i * 2 + 1].first) {\\n\\t\\t\\tmib[vpii[i * 2 + 1].first] =\\n\\t\\t\\t\\t(bool)((lower_bound(ALL(hanabi), vpii[i * 2 + 1].first) -\\n\\t\\t\\t\\t\\t\\tlower_bound(ALL(hanabi), vpii[i * 2].first)+1) % 2);\\n\\t\\t\\tmib[vpii[i * 2].first] = true;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tmib[vpii[i * 2+1].first] =\\n\\t\\t\\t\\t(bool)((lower_bound(ALL(hanabi), vpii[i * 2].first) -\\n\\t\\t\\t\\t\\t\\tlower_bound(ALL(hanabi), vpii[i * 2+1].first)+1) % 2);\\n\\t\\t\\tmib[vpii[i * 2].first] = true;\\n\\t\\t}\\n\\t}\\n\\tSORT(vpii);\\n\\tll ans = 0;\\n\\tll ex = 0;\\n\\tll vo = 0;\\n\\tif (vpii[0].second == 'b')\\n\\t\\tif (mib[vpii[0].first]) {\\n\\t\\t\\tex++;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tvo++;\\n\\t\\t}\\n\\tFOR(i, 1, vpii.size()) {\\n\\t\\tans += ex*(vpii[i].first - vpii[i - 1].first);\\n\\t\\tif (vpii[i].second == 'b')\\n\\t\\t\\tif (mib[vpii[i].first]) {\\n\\t\\t\\t\\tex++;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tvo++;\\n\\t\\t\\t}\\n\\t\\tif (vpii[i].second == 'e') {\\n\\t\\t\\tif (mib[vpii[i].first]) {\\n\\t\\t\\t\\tex--;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tvo--;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (vpii[i].second == 'f') {\\n\\t\\t\\tswap(ex,vo);\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 280,\n \"memory_kb\": 20792,\n \"score_of_the_acc\": -1.4558,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_2317_1833047\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cmath>\\n#include <climits>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <fstream>\\n#include <iostream>\\n#include <list>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <vector>\\n#include <cassert>\\n#include <functional>\\n\\nusing namespace std;\\n\\n#define LOG(...) printf(__VA_ARGS__)\\n//#define LOG(...)\\n#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)\\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\\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 SORT(c) sort((c).begin(),(c).end())\\n#define RSORT(c) sort((c).rbegin(),(c).rend())\\n#define CLR(a) memset((a), 0 ,sizeof(a))\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef vector<bool> vb;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vll;\\ntypedef vector<vb> vvb;\\ntypedef vector<vi> vvi;\\ntypedef vector<vll> vvll;\\ntypedef pair<int, int> pii;\\ntypedef pair<ll, ll> pll;\\n\\nconst int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };\\n\\nstruct UnionFind {\\n\\tvector<int> v;\\n\\tUnionFind(int n) : v(n) { for (int i = 0; i < n; i++) v[i] = i; }\\n\\tint find(int x) { return v[x] == x ? x : v[x] = find(v[x]); }\\n\\tvoid unite(int x, int y) { v[find(x)] = find(y); }\\n};\\n\\nint main() {\\n\\tint n, m;\\n\\tcin >> n >> m;\\n\\tvector<pair<int, char>> vpii;\\n\\tvector<int> hanabi;\\n\\tmap<int, bool> mib;\\n\\tREP(i, n) {\\n\\t\\tint a, b;\\n\\t\\tcin >> a >> b;\\n\\t\\tif (a < b) {\\n\\t\\t\\tvpii.push_back({ a, 'b' });\\n\\t\\t\\tvpii.push_back({ b, 'e' });\\n\\t\\t}else{\\n\\t\\t\\tvpii.push_back({ a, 'e' });\\n\\t\\t\\tvpii.push_back({ b, 'b' });\\n\\t\\t}\\n\\t}\\n\\tREP(i, m) {\\n\\t\\tint a;\\n\\t\\tcin >> a;\\n\\t\\tvpii.push_back({ a,'f' });\\n\\t\\thanabi.push_back(a);\\n\\t}\\n\\tSORT(hanabi);\\n\\tREP(i, n) {\\n\\t\\tif (vpii[i * 2].first < vpii[i * 2 + 1].first) {\\n\\t\\t\\tmib[vpii[i * 2 + 1].first] =\\n\\t\\t\\t\\t(bool)((lower_bound(ALL(hanabi), vpii[i * 2 + 1].first) -\\n\\t\\t\\t\\t\\t\\tlower_bound(ALL(hanabi), vpii[i * 2].first)+1) % 2);\\n\\t\\t\\tmib[vpii[i * 2].first] = true;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tmib[vpii[i * 2+1].first] =\\n\\t\\t\\t\\t(bool)((lower_bound(ALL(hanabi), vpii[i * 2].first) -\\n\\t\\t\\t\\t\\t\\tlower_bound(ALL(hanabi), vpii[i * 2+1].first)+1) % 2);\\n\\t\\t\\tmib[vpii[i * 2].first] = true;\\n\\t\\t}\\n\\t}\\n\\tSORT(vpii);\\n\\tll ans = 0;\\n\\tint ex = 0;\\n\\tint vo = 0;\\n\\tif (vpii[0].second == 'b')\\n\\t\\tif (mib[vpii[0].first]) {\\n\\t\\t\\tex++;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tvo++;\\n\\t\\t}\\n\\tFOR(i, 1, vpii.size()) {\\n\\t\\tans += ex*(vpii[i].first - vpii[i - 1].first);\\n\\t\\tif (vpii[i].second == 'b')\\n\\t\\t\\tif (mib[vpii[i].first]) {\\n\\t\\t\\t\\tex++;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tvo++;\\n\\t\\t\\t}\\n\\t\\tif (vpii[i].second == 'e') {\\n\\t\\t\\tif (mib[vpii[i].first]) {\\n\\t\\t\\t\\tex--;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tvo--;\\n\\t\\t\\t\\t\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (vpii[i].second == 'f') {\\n\\t\\t\\tswap(ex,vo);\\n\\t\\t}\\n\\t}\\n\\tcout << ans << endl;\\n}\",\n \"accuracy\": 0.5476190476190477,\n \"time_ms\": 230,\n \"memory_kb\": 15032,\n \"score_of_the_acc\": -1.0979,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_2317_1829741\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n \\n \\nint N, M;\\nint s[100000], t[100000];\\nint sum[2][100003];\\n \\nint main()\\n{\\n \\n scanf(\\\"%d %d\\\", &N, &M);\\n for(int i = 0; i < N; i++) {\\n scanf(\\\"%d %d\\\", &s[i], &t[i]);\\n }\\n vector< int > P(M);\\n for(int i = 0; i < M; i++) {\\n scanf(\\\"%d\\\", &P[i]);\\n }\\n sort(P.begin(), P.end());\\n \\n long long ret = 0;\\n for(int i = 0; i < N; i++) {\\n auto p = lower_bound(P.begin(), P.end(), s[i]);\\n auto q = lower_bound(P.begin(), P.end(), t[i]);\\n if(p == q) {\\n ret += abs(t[i] - s[i]);\\n } else {\\n s[i] > t[i] ? --p : --q;\\n \\n if((p - q) % 2 != 0) {\\n ret += abs(*p - s[i]);\\n ret += abs(*q - t[i]);\\n if(abs(p - q) == 1) continue;\\n s[i] < t[i] ? (++p, --q) : (--p, ++q);\\n auto mm = min(p - P.begin(), q - P.begin());\\n sum[mm & 1][mm]++;\\n sum[mm & 1][max(p - P.begin(), q - P.begin())]--;\\n } else {\\n ret += abs(*p - s[i]);\\n if(abs(p - q) == 0) continue;\\n s[i] < t[i] ? ++p : --p;\\n auto mm = min(p - P.begin(), q - P.begin());\\n sum[mm & 1][mm]++;\\n sum[mm & 1][max(p - P.begin(), q - P.begin())]--;\\n }\\n }\\n }\\n for(int i = 1; i < M; i++) {\\n sum[0][i] += sum[0][i - 1];\\n sum[1][i] += sum[1][i - 1];\\n }\\n for(int i = 0; i < M - 1; i++) {\\n ret += 1LL * sum[i & 1][i] * (P[i + 1] - P[i]);\\n }\\n printf(\\\"%lld\\\\n\\\", ret);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 4820,\n \"score_of_the_acc\": -0.2161,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2317_1816952\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(a) a.begin(), a.end()\\n#define MS(m,v) memset(m,v,sizeof(m))\\n#define D10 fixed<<setprecision(10)\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef vector<ll> vi;\\ntypedef vector<string> vs;\\ntypedef pair<int, int> pii;\\nconst int MOD = 1000000007;\\nconst int INF = MOD + 1;\\nconst ld EPS = 1e-12;\\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); }\\n\\n/*--------------------template--------------------*/\\n\\nint main()\\n{\\n\\tint n, m;\\n\\tcin >> n >> m;\\n\\tvector<pii> v;\\n\\tREP(i, n)\\n\\t{\\n\\t\\tint a, b;\\n\\t\\tcin >> a >> b;\\n\\t\\tv.emplace_back(a, b);\\n\\t}\\n\\tvi p(m);\\n\\tREP(i, m) cin >> p[i];\\n\\tsort(ALL(p));\\n\\tvi os, es;\\n\\tes.push_back(0), es.push_back(p[0]);\\n\\tos.push_back(0);\\n\\tif(m > 1) os.push_back(p[1] - p[0]);\\n\\telse os.push_back(0);\\n\\tFOR(i, 2, m)\\n\\t{\\n\\t\\tif (i % 2) os.push_back(os.back() + p[i] - p[i - 1]);\\n\\t\\telse es.push_back(es.back() + p[i] - p[i - 1]);\\n\\t}\\n\\tll ans = 0;\\n\\tREP(i, n) \\n\\t{\\n\\t\\tint a = v[i].first, b = v[i].second;\\n\\t\\tll tmp = 0;\\n\\t\\tif (a < b)\\n\\t\\t{\\n\\t\\t\\tint l = upper_bound(ALL(p), a) - p.begin();\\n\\t\\t\\tint r = lower_bound(ALL(p), b) - p.begin() - 1;\\t\\t\\t\\n\\t\\t\\tif (l > r)\\n\\t\\t\\t{\\n\\t\\t\\t\\ttmp += b - a;\\n\\t\\t\\t}\\n\\t\\t\\telse if (l % 2)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (r % 2)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttmp += os[r / 2 + 1] - os[l / 2 + 1];\\n\\t\\t\\t\\t\\ttmp += p[l] - a;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttmp += os[(r-1) / 2 + 1] - os[l / 2 + 1];\\n\\t\\t\\t\\t\\ttmp += p[l] - a;\\n\\t\\t\\t\\t\\ttmp += b - p[r];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (r % 2)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttmp = es[r / 2 + 1] - es[l / 2 + 1];\\n\\t\\t\\t\\t\\ttmp += p[l] - a;\\n\\t\\t\\t\\t\\ttmp += b - p[r];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttmp += es[r / 2 + 1] - es[l / 2 + 1];\\n\\t\\t\\t\\t\\ttmp += p[l] - a;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tint l = upper_bound(ALL(p), b) - p.begin();\\n\\t\\t\\tint r = lower_bound(ALL(p), a) - p.begin() - 1;\\n\\t\\t\\tif (l > r)\\n\\t\\t\\t{\\n\\t\\t\\t\\ttmp += a - b;\\n\\t\\t\\t}\\n\\t\\t\\telse if (r % 2)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (l % 2)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttmp += es[r / 2 + 1] - es[l / 2 + 1];\\n\\t\\t\\t\\t\\ttmp += a - p[r];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttmp += es[(r - 1) / 2 + 1] - es[l / 2 + 1];\\n\\t\\t\\t\\t\\ttmp += p[l] - b;\\n\\t\\t\\t\\t\\ttmp += a - p[r];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\telse\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (l % 2)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttmp = os[(r-1) / 2 + 1] - os[l / 2 + 1];\\n\\t\\t\\t\\t\\ttmp += p[l] - b;\\n\\t\\t\\t\\t\\ttmp += a - p[r];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\ttmp += os[r / 2] - os[l / 2];\\n\\t\\t\\t\\t\\ttmp += a - p[r];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t//cout << tmp << endl;\\n\\t\\tans += tmp;\\n\\t}\\n\\tcout << ans << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 5748,\n \"score_of_the_acc\": -0.4004,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2317_1815309\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <set>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nstruct sec{\\n int s,t;\\n};\\n\\nstruct event{\\n int type;//0:cut +1:begin(on) +2:begin(off) +3:end(on) +4:end(off)\\n int x;\\n event(int type, int x){\\n this->type=type,this->x=x;\\n }\\n};\\n\\nint main(){\\n int N,M;\\n cin>>N>>M;\\n sec S[N];\\n int C[M];\\n for(auto&s:S) scanf(\\\"%d %d\\\",&s.s,&s.t);\\n for(auto&c:C) scanf(\\\"%d\\\",&c);\\n\\n vector<event> E;\\n for(auto&c:C) E.emplace_back(event(0,c));\\n sort(C,C+M);\\n long long sum=0;\\n\\n for(auto&s:S){\\n auto lo=lower_bound(C,C+M,min(s.s,s.t));\\n auto up=upper_bound(C,C+M,max(s.s,s.t));\\n if(lo==up){\\n sum+=abs(s.s-s.t);\\n continue;\\n }\\n if(s.s<s.t){\\n sum+=*lo-s.s;\\n E.emplace_back(event(2,*lo));\\n if((up-lo)%2==0){\\n sum+=s.t-*(up-1);\\n E.emplace_back(event(4,*(up-1)));\\n }else{\\n E.emplace_back(event(3,*(up-1)));\\n }\\n }else{\\n sum+=s.s-*(up-1);\\n E.emplace_back(event(4,*(up-1)));\\n if((up-lo)%2){\\n E.emplace_back(event(1,*lo));\\n }else{\\n E.emplace_back(event(2,*lo));\\n sum+=*lo-s.t;\\n }\\n }\\n }\\n sort(E.begin(),E.end(),[](const event& a, const event& b){return a.x==b.x?a.type<b.type:a.x<b.x;});\\n\\n int on_n=0,off_n=0;\\n for(auto e=E.begin();e!=E.end();e++){\\n // cout << e->x << \\\" \\\" << e->type << endl;\\n switch(e->type){\\n case 0:\\n if(on_n)sum+=(long long int)on_n*(e->x - (e-1)->x);\\n swap(on_n,off_n);\\n break;\\n case 1:\\n on_n++;\\n break;\\n case 2:\\n off_n++;\\n break;\\n case 3:\\n off_n--;\\n break;\\n case 4:\\n on_n--;\\n break;\\n }\\n }\\n cout << sum << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 8292,\n \"score_of_the_acc\": -0.4071,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2317_1815171\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <set>\\n#include <algorithm>\\n\\nusing namespace std;\\n\\nstruct event{\\n int x;\\n int type; //0:cut +:?§???? -:??????\\n event(int type, int x){\\n this->type=type; this->x=x;\\n }\\n};\\n\\nstruct section{\\n int s, t;\\n bool on;\\n};\\n\\nint main(){\\n int N,M;\\n cin>>N>>M;\\n vector<event> E1,E2;\\n section S[N+1];\\n for(int i=1;i<=N;i++){\\n cin>>S[i].s>>S[i].t;\\n if(S[i].s<S[i].t){\\n E1.push_back(event(i,S[i].s));\\n E1.push_back(event(-i,S[i].t));\\n }else{\\n E2.push_back(event(i,S[i].s));\\n E2.push_back(event(-i,S[i].t));\\n }\\n }\\n for(int i=0;i<M;i++){\\n int x;\\n cin>>x;\\n E1.push_back(event(0,x));\\n E2.push_back(event(0,x));\\n }\\n sort(E1.begin(),E1.end(),[](const event& a, const event& b){return a.x==b.x?a.type>b.type:a.x<b.x;});\\n sort(E2.begin(),E2.end(),[](const event& a, const event& b){return a.x==b.x?a.type>b.type:a.x>b.x;});\\n int sum=0;\\n set<int> I;\\n for(auto& i:S)i.on=true;\\n for(auto& e:E1){\\n if(e.type>0){\\n I.insert(e.type);\\n }else if(e.type<0){\\n if(S[-e.type].on)sum+=S[-e.type].t-S[-e.type].s;\\n I.erase(-e.type);\\n }else{\\n for(auto& i:I){\\n if(S[i].on){\\n S[i].on=false;\\n sum+=e.x-S[i].s;\\n S[i].s=e.x;\\n }else{\\n S[i].on=true;\\n S[i].s=e.x;\\n }\\n }\\n }\\n }\\n for(auto& i:I){\\n if(S[i].on)sum+=S[i].t-S[i].s;\\n }\\n I.clear();\\n\\n for(auto& e:E2){\\n if(e.type>0){\\n I.insert(e.type);\\n }else if(e.type<0){\\n if(S[-e.type].on)sum+=-S[-e.type].t+S[-e.type].s;\\n I.erase(-e.type);\\n }else{\\n for(auto& i:I){\\n if(S[i].on){\\n S[i].on=false;\\n sum+=-e.x+S[i].s;\\n S[i].s=e.x;\\n }else{\\n S[i].on=true;\\n S[i].s=e.x;\\n }\\n }\\n }\\n }\\n for(auto& i:I){\\n if(S[i].on)sum+=-S[i].t+S[i].s;\\n }\\n I.clear();\\n cout << sum << endl;\\n}\",\n \"accuracy\": 0.09523809523809523,\n \"time_ms\": 420,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -1.0852,\n \"final_rank\": 20\n }\n]","isConversational":false}}},{"rowIdx":1299,"cells":{"group_id":{"kind":"string","value":"aoj_2319_cpp"},"problem_description":{"kind":"string","value":"問題文\nキュゥべえ\nはなかなか契約を結んでくれない\n鹿目まどか\nにしびれを切らせて，ソウルジェムゲームと称して\n佐倉杏子\nと\n美樹さやか\nのソウルジェムの中身 (魂) を\nW\n列\nH\n段のロッカーの中に隠してしまった．そこで，\nまどか\nは\n杏子\nと\nさやか\nを助け出したい．しかし，契約を結ばずに助けるにはロッカーボックスの壁を操作して\n2\n人のソウルジェムの中身を，指定されたロッカーボックスに正しく移さなければならない．ロッカーはロッカーボックスが\nW\n列\nH\n段に並ぶことで構成され，隣り合うロッカーボックスは壁で仕切られている．\nまどか\nは，\n1\n回の操作でいずれかの隣りあった\n2\nつのロッカーボックスの壁を取り除くか取り付けることができる．ただし，ロッカーボックスの壁を開けるには制約があり，各ロッカーボックスから隣接する上下左右の壁のうち，高々\n2\n枚までの壁しか同時に開けておくことはできない．ロッカーボックスには上の段から下の段に向かって重力が働いている．ソウルジェムの中身は液体と同じような動きをし，隣りあった\n2\nつのロッカーボックスの壁が取り除かれている時，同じ高さであれば互いに同じ量になり，違う高さであれば低い方へ移動する．すべての操作が終わった時に指定された\n2\nつのロッカーボックスに正しい組み合わせでソウルジェムの中身がすべて入っていれば\nまどか\nの勝利となる．また，一部のロッカーボックスは穢れており，その中へソウルジェムの中身が入ってしまうと大変なことになってしまうので，そのロッカーボックスはソウルジェムの中身の移動のために使うことはできない．\n最小で何度の操作を行えば\nまどか\nは\n2\n人を救いだすことができるかを求めよ．\n入力形式\n入力は以下の形式で与えられる．\nH\\ W\\\\\ns_{11}\\ s_{12}\\ … s_{1W}\\\\\ns_{21}\\ s_{22}\\ … s_{2W}\\\\\n…\\\\\ns_{H1}\\ s_{H2}\\ … s_{HW}\\\\\nH\nはロッカーの段数，\nW\nはロッカーの列数である．\ns_{ij}\nは上から\ni\n段目の左から\nj\n列目のロッカーボックスの状態を表す．\n杏子\nのソウルジェムの中身が入っているときは\n'K'\nであり，\nさやか\nのソウルジェムの中身が入っているときは\n'S'\n，\n杏子\nのソウルジェムの中身を移すべきロッカーボックスであるときは\n'k'\n，\nさやか\nのソウルジェムの中身を移すべきロッカーボックスであるときは\n's'\n，穢れたロッカーボックスであるときは\n'#'\n，それ以外のロッカーボックスであるときは\n'.'\nである．\n出力形式\n2\n人を救い出すために必要な操作の最小回数を出力せよ．どのように操作しても救い出すことが出来ない場合は\nCONTRACT\nと出力せよ．\n制約\n1 ≤ H ≤ 10\n1 ≤ W ≤ 10\ns_{ij}\nは\n'#'\n,\n'.'\n,\n'S'\n,\n'K'\n,\n's'\n,\n'k'\nのいずれかである．\ns_{ij}\\ =\\\n'S'\nであるような\ni, j\nがちょうど 1 つだけ存在する．\ns_{ij}\\ =\\\n'K'\nであるような\ni, j\nがちょうど 1 つだけ存在する．\ns_{ij}\\ =\\\n's'\nであるような\ni, j\nがちょうど 1 つだけ存在する．\ns_{ij}\\ =\\\n'k'\nであるような\ni, j\nがちょうど 1 つだけ存在する．\n入出力例\n入力例 1\n4 4\n.S..\nK...\n....\n..sk\n出力例1\n9\n入力例 2\n5 5\n.S.K.\n..#..\n.###.\n..#..\n.k.s.\n出力例 2\nCONTRACT\n入力例 3\n8 5\nS....\n####K\n##...\n#..##\n#..##\n##k##\n#...#\n#.s.#\n出力例 3\n19\n入力例 4\n8 5\nS....\n####K\n##...\n##.##\n##.##\n##k##\n#...#\n#.s.#\n出力例 4\nCONTRACT\n入力例 5\n10 10\n..........\n##......##\n#K......S#\n..........\n..........\n.#..##..#.\n..##..##..\n..........\n..........\n....s.k...\n出力例 5\n22\n入力例 6\n3 3\nS.s\nK..\n..k\n出力例 6\nCONTRACT\nProblem Setter: Flat35"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_2319_5955599","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing uint = unsigned int;\nusing ull = unsigned long long;\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 per(i,n) for(int i=int(n)-1;i>=0;i--)\n#define per1(i,n) for(int i=int(n);i>0;i--)\n#define all(c) c.begin(),c.end()\n#define si(x) int(x.size())\n#define pb push_back\n#define eb emplace_back\n#define fs first\n#define sc second\ntemplate<class T> using V = vector<T>;\ntemplate<class T> using VV = vector<vector<T>>;\ntemplate<class T,class U> bool chmax(T& x, U y){\n\tif(x<y){ x=y; return true; }\n\treturn false;\n}\ntemplate<class T,class U> bool chmin(T& x, U y){\n\tif(y<x){ x=y; return true; }\n\treturn false;\n}\ntemplate<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}\ntemplate<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}\ntemplate<class T>\nV<T> Vec(size_t a) {\n return V<T>(a);\n}\ntemplate<class T, class... Ts>\nauto Vec(size_t a, Ts... ts) {\n return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));\n}\ntemplate<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){\n\treturn o<<\"(\"<<p.fs<<\",\"<<p.sc<<\")\";\n}\ntemplate<class T> ostream& operator<<(ostream& o,const vector<T> &vc){\n\to<<\"{\";\n\tfor(const T& v:vc) o<<v<<\",\";\n\to<<\"}\";\n\treturn o;\n}\nconstexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }\n\n#ifdef LOCAL\n#define show(x) cerr << \"LINE\" << __LINE__ << \" : \" << #x << \" = \" << (x) << endl\nvoid dmpr(ostream& os){os<<endl;}\ntemplate<class T,class... Args>\nvoid dmpr(ostream&os,const T&t,const Args&... args){\n\tos<<t<<\" ~ \";\n\tdmpr(os,args...);\n}\n#define shows(...) cerr << \"LINE\" << __LINE__ << \" : \";dmpr(cerr,##__VA_ARGS__)\n#define dump(x) cerr << \"LINE\" << __LINE__ << \" : \" << #x << \" = {\"; \\\n\tfor(auto v: x) cerr << v << \",\"; cerr << \"}\" << endl;\n#else\n#define show(x) void(0)\n#define dump(x) void(0)\n#define shows(...) void(0)\n#endif\n\ntemplate<class D> D divFloor(D a, D b){\n\treturn a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);\n}\ntemplate<class D> D divCeil(D a, D b) {\n\treturn a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);\n}\n\nint dp[11][11][11][2][2];\n// h, aw, bw, (S(a) \\cap b != empty?), (S(b) \\cap a != empty?), \n// aw == W : a doesn't exist in this raw\n\nbool can[10][10][10];\nbool in(int i,int x,int y){\n\tif(x>y) swap(x,y);\n\treturn x<=i && i<=y;\n}\n\nconst int inf = 1e9;\nint solve(){\n\tint H,W; cin >> H >> W;\n\tV<string> s(H); rep(i,H) cin >> s[i];\n\tint ax,ay,bx,by,Ax,Ay,Bx,By;\t// a -> A\n\trep(i,H) rep(j,W){\n\t\tif(s[i][j] == 'S') ax=i,ay=j;\n\t\tif(s[i][j] == 's') Ax=i,Ay=j;\n\t\tif(s[i][j] == 'K') bx=i,by=j;\n\t\tif(s[i][j] == 'k') Bx=i,By=j;\n\t}\n\tif(ax >= Ax || bx >= Bx) return -1;\n\n\trep(i,H){\n\t\trep(x,W) rep(y,W){\n\t\t\tcan[i][x][y] = true;\n\t\t\tfor(int j=min(x,y);j<=max(x,y);j++) if(s[i][j] == '#') can[i][x][y] = false;\n\t\t}\n\t}\n\n\trep(i,H+1) rep(a,W+1) rep(b,W+1) rep(x,2) rep(y,2) dp[i][a][b][x][y] = inf;\n\tif(ax > bx){\n\t\tswap(ax,bx);swap(ay,by);swap(Ax,Bx);swap(Ay,By);\n\t}\n\tif(ax < bx){\n\t\tdp[ax][ay][W][0][0] = 0;\n\t}else{\n\t\tdp[ax][ay][by][0][0] = 0;\n\t}\n\t#define UPDATE \\\n\t\t/*shows(h+1,naw,nbw,nsa,nsb,dp[h][aw][bw][sa][sb] + cost);*/ \\\n\t\tchmin(dp[h+1][naw][nbw][nsa][nsb], dp[h][aw][bw][sa][sb] + cost);\n\n\tfor(int h=ax;h<H;h++) rep(aw,W+1) rep(bw,W+1) rep(sa,2) rep(sb,2) if(dp[h][aw][bw][sa][sb] != inf){\n\t\tbool aend = (h == Ax);\n\t\tbool bend = (h == Bx);\n\t\tif(aw != W && bw != W){\n\t\t\trep(Aw,W) rep(Bw,W) if(can[h][aw][Aw] && can[h][bw][Bw]){\n\t\t\t\tif(aend && !(aw == Aw && aw == Ay)) continue;\n\t\t\t\tif(bend && !(bw == Bw && bw == By)) continue;\n\n\t\t\t\tint cost = abs(aw-Aw) + (aend?0:1) + abs(bw-Bw) + (bend?0:1);\t\t// red + blue\n\t\t\t\tV<int> edge(W-1);\n\t\t\t\tfor(int w=min(aw,Aw);w<max(aw,Aw);w++) edge[w] |= 1;\n\t\t\t\tfor(int w=min(bw,Bw);w<max(bw,Bw);w++) edge[w] |= 2;\n\t\t\t\tint lime = 0; rep(w,W-1) if(edge[w] == 3) lime++;\n\t\t\t\tif(!aend && !bend && Aw == Bw) lime++;\n\t\t\t\tcost -= lime;\t\t//\t- lime\n\t\t\t\tV<int> deg(W);\n\t\t\t\trep(w,W){\n\t\t\t\t\tif(w != 0 && edge[w-1]) deg[w]++;\t// left\n\t\t\t\t\tif(w != W-1 && edge[w]) deg[w]++;\t// right\n\t\t\t\t\tif((w == aw && h != ax) or (w == bw && h != bx)) deg[w]++;\t// up\n\t\t\t\t\tif((w == Aw && !aend) or (w == Bw && !bend)) deg[w]++;\t// down\n\t\t\t\t\tif((w == Aw && aend) or (w == Bw && bend)) deg[w]++;\t// terminal +1 cost\n\t\t\t\t}\n\t\t\t\tint green = 0; rep(w,W) green += max(deg[w]-2,0);\n\t\t\t\tcost += green;\n\n\t\t\t\tint naw = (aend ? W : Aw), nbw = (bend ? W : Bw);\n\t\t\t\tint nsa = sa | !in(aw,bw,Bw);\n\t\t\t\tint nsb = sb | !in(bw,aw,Aw);\n\t\t\t\tif(h == ax && h == bx && nsa == 0 && nsb == 0){\n\t\t\t\t\t// first raw dead\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tUPDATE\n\t\t\t}\n\t\t}else if(aw != W){\n\t\t\trep(Aw,W) if(can[h][aw][Aw]){\n\t\t\t\tif(aend && !(aw == Aw && aw == Ay)) continue;\n\n\t\t\t\tint cost = abs(aw-Aw) + (aend?0:1);\t\t// red\n\n\t\t\t\tint naw = (aend ? W : Aw);\n\t\t\t\tint nbw = (h+1 == bx ? by : W);\n\t\t\t\tint nsa = 1;\n\t\t\t\tint nsb = sb;\n\t\t\t\tUPDATE\n\t\t\t}\n\t\t}else if(bw != W){\n\t\t\trep(Bw,W) if(can[h][bw][Bw]){\n\t\t\t\tif(bend && !(bw == Bw && bw == By)) continue;\n\n\t\t\t\tint cost = abs(bw-Bw) + (bend?0:1);\t\t// red\n\n\t\t\t\tint nbw = (bend ? W : Bw);\n\t\t\t\tint naw = (h+1 == ax ? ay : W);\n\t\t\t\tint nsb = 1;\n\t\t\t\tint nsa = sa;\n\t\t\t\tUPDATE\n\t\t\t}\n\t\t}else{\n\t\t\tint naw = (h+1 == ax ? ay : W);\n\t\t\tint nbw = (h+1 == bx ? by : W);\n\t\t\tint nsa = sa, nsb = sb; int cost = 0;\n\t\t\tUPDATE\n\t\t}\n\t}\n\tint res = dp[H][W][W][1][1];\n\tif(res == inf) return -1;\n\treturn res;\n}\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\t\t//DON'T USE scanf/printf/puts !!\n\tcout << fixed << setprecision(20);\n\n\tint ans = solve();\n\tif(ans == -1) cout << \"CONTRACT\" << endl;\n\telse cout << ans << endl;\n}","accuracy":1,"time_ms":20,"memory_kb":3464,"score_of_the_acc":-1,"final_rank":3},{"submission_id":"aoj_2319_3443155","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\nint H,W;\nint M = 10000;\nint s,S,k,K;\nvector<int> dist;\n\n\n\n\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\n queue<int> que;\n for(int i=0;i<H*W;i++){\n dist[i] = 10000;\n }\n que.push(S);\n dist[S] = dis;\n while(!que.empty()){\n int p = que.front();\n //cout << \"p:\" << p << endl;\n que.pop();\n //cout << \"next_p:\" << que.front() << endl;\n if(p==s-W){\n int d = dist[p]+1;\n if(p%W!=0 and g[s-1]=='a')d++;\n if(p%W!=W-1 and g[s+1]=='a')d++;\n if(p/W<H and g[s+W]=='a')d++;\n if(d<M){\n M=d;\n }\n continue;\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<s/W-1)next.push_back(p+W);\n for(int i=0;i<next.size();i++){\n int d = dist[p]+1;\n switch(g[next[i]]){\n case('.'):\n if(dist[next[i]] > d){\n dist[next[i]] = d;\n que.push(next[i]);\n }\n break;\n case('a'):\n d++;\n case('K'):\n d++;\n //cout << sfound <<endl;\n if(sfound==1){\n if(d<M)M=d;\n return;\n }\n for(int j=0;j<H*W;j++){\n if(g[j]=='a' and dist[j]>d){\n dist[j] = d;\n que.push(j);\n }\n if(g[j]=='K' and dist[j]>d and g[next[i]]!='K'){\n dist[j] = d-1;\n que.push(j);\n }\n if(g[j]=='K' and dist[j]>d and g[next[i]]=='K'){\n dist[j] = d;\n que.push(j);\n }\n }\n break;\n }\n }\n }\n}\n\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\n if(p/W >= s/W or M<=dis)return;\n if(g[p]=='a' or g[p]=='S'){\n g[p] = 'b';\n if(out==1)M = dis;\n if(out==0){\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\n }\n }\n if(g[p]=='.'){\n g[p] = 'b';\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\n }\n}\n/*\nvoid bfs_k1(vector<char> g){\n int d=0;\n queue<int> Q;\n Q.push(K);\n Q.push(-1);\n while(!Q.empty()){\n int p=Q.front();\n Q.pop();\n if(p==-1)d++;\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<k/W-1)next.push_back(p+W);\n for(int i=0;i<next.size();i++){\n if(g[next[i]]=='.')Q.push(next[i]);\n if(next[i]==k-W){\n limdis=d+8;\n break;\n }\n }\n }\n}\n*/\n\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\n //if(dis>limdis)return;\n if(p!=K)g[p]='a';\n if(g[p+W]=='k'){\n dis++;\n for(int i=0;i<H*W;i++){\n if(g[i]=='l')g[i]='.';\n }\n if(Sfound==0){\n bfs_s2(g,dis,sfound);\n //cout << sfound <<Sfound <<endl;\n }\n else if(sfound==1)dfs_s2(S,g,dis+4,0);\n return;\n }\n dis++;\n if(p/W<k/W-1){\n switch(g[p+W]){\n case('S'):\n dfs_k1(p+W,g,dis,sfound,1);\n break;\n case('s'):\n sfound = 1;\n case('.'):\n dfs_k1(p+W,g,dis,sfound,Sfound);\n break;\n }\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n int P=p+W;\n while(P<H*W){\n if(g[P]=='.')g[P]='l';\n else break;\n P += W;\n }\n for(int i=0;i<next.size();i++){\n switch(g[next[i]]){\n case('S'):\n dfs_k1(next[i],g,dis,sfound,1);\n break;\n case('s'):\n sfound = 1;\n case('.'):\n dfs_k1(next[i],g,dis,sfound,Sfound);\n break;\n }\n }\n}\n\n\n\n\nint main(){\n cin >> H >> W;\n vector<char> g;\n g.resize(H*W);\n dist.resize(H*W);\n for(int i=0;i<H*W;i++){\n cin >> g[i];\n if(g[i]=='k')k=i;\n if(g[i]=='K')K=i;\n if(g[i]=='s')s=i;\n if(g[i]=='S')S=i;\n }\n dfs_k1(K,g,0,0,0);\n\n g[k]='s';\n g[s]='k';\n g[S]='K';\n g[K]='S';\n int koukan;\n koukan = s;\n s=k;\n k=koukan;\n koukan=S;\n S=K;\n K=koukan;\n\n //cout << \"---------------------------\"<<endl;\n dfs_k1(K,g,0,0,0);\n\n\n if(M==10000)cout << \"CONTRACT\"<<endl;\n else cout << M <<endl;\n}","accuracy":1,"time_ms":850,"memory_kb":3172,"score_of_the_acc":-1.9038,"final_rank":4},{"submission_id":"aoj_2319_3443152","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\nint H,W;\nint M = 10000;\nint s,S,k,K;\nvector<int> dist;\n\n\n\n\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\n queue<int> que;\n for(int i=0;i<H*W;i++){\n dist[i] = 10000;\n }\n que.push(S);\n dist[S] = dis;\n while(!que.empty()){\n int p = que.front();\n //cout << \"p:\" << p << endl;\n que.pop();\n //cout << \"next_p:\" << que.front() << endl;\n if(p==s-W){\n int d = dist[p]+1;\n if(p%W!=0 and g[s-1]=='a')d++;\n if(p%W!=W-1 and g[s+1]=='a')d++;\n if(p/W<H and g[s+W]=='a')d++;\n if(d<M){\n M=d;\n }\n continue;\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<s/W-1)next.push_back(p+W);\n for(int i=0;i<next.size();i++){\n int d = dist[p]+1;\n switch(g[next[i]]){\n case('.'):\n if(dist[next[i]] > d){\n dist[next[i]] = d;\n que.push(next[i]);\n }\n break;\n case('a'):\n d++;\n case('K'):\n d++;\n //cout << sfound <<endl;\n if(sfound==1){\n if(d<M)M=d;\n return;\n }\n for(int j=0;j<H*W;j++){\n if(g[j]=='a' and dist[j]>d){\n dist[j] = d;\n que.push(j);\n }\n if(g[j]=='K' and dist[j]>d){\n dist[j] = d-1;\n que.push(j);\n }\n }\n break;\n }\n }\n }\n}\n\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\n if(p/W >= s/W or M<=dis)return;\n if(g[p]=='a' or g[p]=='S'){\n g[p] = 'b';\n if(out==1)M = dis;\n if(out==0){\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\n }\n }\n if(g[p]=='.'){\n g[p] = 'b';\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\n }\n}\n/*\nvoid bfs_k1(vector<char> g){\n int d=0;\n queue<int> Q;\n Q.push(K);\n Q.push(-1);\n while(!Q.empty()){\n int p=Q.front();\n Q.pop();\n if(p==-1)d++;\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<k/W-1)next.push_back(p+W);\n for(int i=0;i<next.size();i++){\n if(g[next[i]]=='.')Q.push(next[i]);\n if(next[i]==k-W){\n limdis=d+8;\n break;\n }\n }\n }\n}\n*/\n\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\n //if(dis>limdis)return;\n if(p!=K)g[p]='a';\n if(g[p+W]=='k'){\n dis++;\n for(int i=0;i<H*W;i++){\n if(g[i]=='l')g[i]='.';\n }\n if(Sfound==0){\n bfs_s2(g,dis,sfound);\n //cout << sfound <<Sfound <<endl;\n }\n else if(sfound==1)dfs_s2(S,g,dis+4,0);\n return;\n }\n dis++;\n if(p/W<k/W-1){\n switch(g[p+W]){\n case('S'):\n dfs_k1(p+W,g,dis,sfound,1);\n break;\n case('s'):\n sfound = 1;\n case('.'):\n dfs_k1(p+W,g,dis,sfound,Sfound);\n break;\n }\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n int P=p+W;\n while(P<H*W){\n if(g[P]=='.')g[P]='l';\n else break;\n P += W;\n }\n for(int i=0;i<next.size();i++){\n switch(g[next[i]]){\n case('S'):\n dfs_k1(next[i],g,dis,sfound,1);\n break;\n case('s'):\n sfound = 1;\n case('.'):\n dfs_k1(next[i],g,dis,sfound,Sfound);\n break;\n }\n }\n}\n\n\n\n\nint main(){\n cin >> H >> W;\n vector<char> g;\n g.resize(H*W);\n dist.resize(H*W);\n for(int i=0;i<H*W;i++){\n cin >> g[i];\n if(g[i]=='k')k=i;\n if(g[i]=='K')K=i;\n if(g[i]=='s')s=i;\n if(g[i]=='S')S=i;\n }\n dfs_k1(K,g,0,0,0);\n\n g[k]='s';\n g[s]='k';\n g[S]='K';\n g[K]='S';\n int koukan;\n koukan = s;\n s=k;\n k=koukan;\n koukan=S;\n S=K;\n K=koukan;\n\n //cout << \"---------------------------\"<<endl;\n dfs_k1(K,g,0,0,0);\n\n\n if(M==10000)cout << \"CONTRACT\"<<endl;\n else cout << M <<endl;\n}","accuracy":0.8269230769230769,"time_ms":860,"memory_kb":3176,"score_of_the_acc":-1.9169,"final_rank":5},{"submission_id":"aoj_2319_3443144","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\nint H,W;\nint M = 10000;\nint s,S,k,K;\nvector<int> dist;\n\n\n\n\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\n queue<int> que;\n for(int i=0;i<H*W;i++){\n dist[i] = 10000;\n }\n que.push(S);\n dist[S] = dis;\n while(!que.empty()){\n int p = que.front();\n //cout << \"p:\" << p << endl;\n que.pop();\n //cout << \"next_p:\" << que.front() << endl;\n if(p==s-W){\n int d = dist[p]+1;\n if(p%W!=0 and g[s-1]=='a')d++;\n if(p%W!=W-1 and g[s+1]=='a')d++;\n if(p/W<H and g[s+W]=='a')d++;\n if(d<M){\n M=d;\n }\n continue;\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<s/W-1)next.push_back(p+W);\n for(int i=0;i<next.size();i++){\n int d = dist[p]+1;\n switch(g[next[i]]){\n case('.'):\n if(dist[next[i]] > d){\n dist[next[i]] = d;\n que.push(next[i]);\n }\n break;\n case('a'):\n d++;\n case('K'):\n d++;\n //cout << sfound <<endl;\n if(sfound==1){\n if(d<M)M=d;\n return;\n }\n for(int j=0;j<H*W;j++){\n if(g[j]=='a' and dist[j]>d){\n dist[j] = d;\n que.push(j);\n }\n if(g[j]=='K' and dist[j]>d){\n dist[j] = d;\n que.push(j);\n }\n }\n break;\n }\n }\n }\n}\n\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\n if(p/W >= s/W or M<=dis)return;\n if(g[p]=='a' or g[p]=='S'){\n g[p] = 'b';\n if(out==1)M = dis;\n if(out==0){\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\n }\n }\n if(g[p]=='.'){\n g[p] = 'b';\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\n }\n}\n/*\nvoid bfs_k1(vector<char> g){\n int d=0;\n queue<int> Q;\n Q.push(K);\n Q.push(-1);\n while(!Q.empty()){\n int p=Q.front();\n Q.pop();\n if(p==-1)d++;\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<k/W-1)next.push_back(p+W);\n for(int i=0;i<next.size();i++){\n if(g[next[i]]=='.')Q.push(next[i]);\n if(next[i]==k-W){\n limdis=d+8;\n break;\n }\n }\n }\n}\n*/\n\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\n //if(dis>limdis)return;\n if(p!=K)g[p]='a';\n if(g[p+W]=='k'){\n dis++;\n for(int i=0;i<H*W;i++){\n if(g[i]=='l')g[i]='.';\n }\n if(Sfound==0){\n bfs_s2(g,dis,sfound);\n //cout << sfound <<Sfound <<endl;\n }\n else if(sfound==1)dfs_s2(S,g,dis+4,0);\n return;\n }\n dis++;\n if(p/W<k/W-1){\n switch(g[p+W]){\n case('S'):\n dfs_k1(p+W,g,dis,sfound,1);\n break;\n case('s'):\n sfound = 1;\n case('.'):\n dfs_k1(p+W,g,dis,sfound,Sfound);\n break;\n }\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n int P=p+W;\n while(P<H*W){\n if(g[P]=='.')g[P]='l';\n else break;\n P += W;\n }\n for(int i=0;i<next.size();i++){\n switch(g[next[i]]){\n case('S'):\n dfs_k1(next[i],g,dis,sfound,1);\n break;\n case('s'):\n sfound = 1;\n case('.'):\n dfs_k1(next[i],g,dis,sfound,Sfound);\n break;\n }\n }\n}\n\n\n\n\nint main(){\n cin >> H >> W;\n vector<char> g;\n g.resize(H*W);\n dist.resize(H*W);\n for(int i=0;i<H*W;i++){\n cin >> g[i];\n if(g[i]=='k')k=i;\n if(g[i]=='K')K=i;\n if(g[i]=='s')s=i;\n if(g[i]=='S')S=i;\n }\n dfs_k1(K,g,0,0,0);\n\n g[k]='s';\n g[s]='k';\n g[S]='K';\n g[K]='S';\n int koukan;\n koukan = s;\n s=k;\n k=koukan;\n koukan=S;\n S=K;\n K=koukan;\n\n //cout << \"---------------------------\"<<endl;\n dfs_k1(K,g,0,0,0);\n\n\n if(M==10000)cout << \"CONTRACT\"<<endl;\n else cout << M <<endl;\n}","accuracy":0.5576923076923077,"time_ms":860,"memory_kb":3164,"score_of_the_acc":-1.9134,"final_rank":9},{"submission_id":"aoj_2319_3397149","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\nint H,W;\nint M = 10000;\nint s,S,k,K;\nqueue<int> que;\nvector<int> dist;\n\n\n\n\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\n for(int i=0;i<H*W;i++){\n dist[i] = 10000;\n }\n que.push(S);\n dist[S] = dis;\n while(!que.empty()){\n int p = que.front();\n que.pop();\n if(g[p+W]=='s'){\n if(dist[p]+1<M){\n M=dist[p]+1;\n }\n continue;\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<s/W-1)next.push_back(p+W);\n for(int i=0;i<next.size();i++){\n int d = dist[p]+1;\n switch(g[next[i]]){\n case('.'):\n if(dist[next[i]] > d){\n dist[next[i]] = d;\n que.push(next[i]);\n }\n break;\n case('a'):\n d++;\n case('K'):\n d++;\n if(sfound==1){\n if(d<M)M=d;\n return;\n }\n for(int j=0;j<H*W;j++){\n if(g[j]=='a' and dist[j]>d){\n dist[j] = d;\n que.push(j);\n }\n if(g[j]=='K' and dist[j]>d){\n dist[j] = d;\n que.push(j);\n }\n }\n break;\n }\n }\n }\n /*\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n cout << dist[i*W+j] << \" \";\n }\n cout << endl;\n }\n */\n}\n\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\n if(p/W >= s/W or M<=dis)return;\n if(g[p]=='a' or g[p]=='S'){\n g[p] = 'b';\n if(out==1)M = dis;\n if(out==0){\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\n }\n }\n if(g[p]=='.'){\n g[p] = 'b';\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\n }\n}\n\n\n\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\n if(p!=K)g[p]='a';\n if(g[p+W]=='k'){\n dis++;\n if(Sfound==0)bfs_s2(g,dis,sfound);\n else if(sfound==1)dfs_s2(S,g,dis+4,0);\n return;\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<k/W-1)next.push_back(p+W);\n dis++;\n for(int i=0;i<next.size();i++){\n switch(g[next[i]]){\n case('S'):\n dfs_k1(next[i],g,dis,sfound,1);\n break;\n case('s'):\n sfound = 1;\n case('.'):\n dfs_k1(next[i],g,dis,sfound,Sfound);\n break;\n }\n }\n}\n\n\n\nint main(){\n cin >> H >> W;\n vector<char> g;\n g.resize(H*W);\n dist.resize(H*W);\n for(int i=0;i<H*W;i++){\n cin >> g[i];\n if(g[i]=='k')k=i;\n if(g[i]=='K')K=i;\n if(g[i]=='s')s=i;\n if(g[i]=='S')S=i;\n }\n\n dfs_k1(K,g,0,0,0);\n\n g[k]='s';\n g[s]='k';\n g[S]='K';\n g[K]='S';\n int koukan;\n koukan = s;\n s=k;\n k=koukan;\n koukan=S;\n S=K;\n K=koukan;\n\n\n dfs_k1(K,g,0,0,0);\n\n\n if(M==10000)cout << \"CONTRACT\"<<endl;\n else cout << M <<endl;\n}","accuracy":0.4423076923076923,"time_ms":90,"memory_kb":3172,"score_of_the_acc":-0.999,"final_rank":10},{"submission_id":"aoj_2319_3397130","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\nint H,W;\nint M = 10000;\nint s,S,k,K;\nqueue<int> que;\nvector<int> dist;\n\n\n\n\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\n for(int i=0;i<H*W;i++){\n dist[i] = 10000;\n }\n que.push(S);\n dist[S] = dis;\n while(!que.empty()){\n int p = que.front();\n que.pop();\n if(g[p+W]=='s'){\n if(dist[p]+1<M){\n M=dist[p]+1;\n }\n continue;\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<k/W-1)next.push_back(p+W);\n for(int i=0;i<next.size();i++){\n int d = dist[p]+1;\n switch(g[next[i]]){\n case('.'):\n if(dist[next[i]] > d){\n dist[next[i]] = d;\n que.push(next[i]);\n }\n break;\n case('a'):\n d++;\n case('K'):\n d++;\n if(sfound==1){\n if(d<M)M=d;\n return;\n }\n for(int j=0;j<H*W;j++){\n if(g[j]=='a' and dist[j]>d){\n dist[j] = d;\n que.push(j);\n }\n if(g[j]=='K' and dist[j]>d){\n dist[j] = d;\n que.push(j);\n }\n }\n break;\n }\n }\n }\n}\n\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\n if(p/W >= s/W or M<=dis)return;\n if(g[p]=='a' or g[p]=='S'){\n g[p] = 'b';\n if(out==1)M = dis;\n if(out==0){\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\n }\n }\n if(g[p]=='.'){\n g[p] = 'b';\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\n }\n}\n\n\n\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\n if(p!=K)g[p]='a';\n if(g[p+W]=='k'){\n dis++;\n if(Sfound==0)bfs_s2(g,dis,sfound);\n else if(sfound==1)dfs_s2(S,g,dis+4,0);\n return;\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<k/W-1)next.push_back(p+W);\n dis++;\n for(int i=0;i<next.size();i++){\n switch(g[next[i]]){\n case('S'):\n dfs_k1(next[i],g,dis,sfound,1);\n break;\n case('s'):\n sfound = 1;\n case('.'):\n dfs_k1(next[i],g,dis,sfound,Sfound);\n break;\n }\n }\n}\n\n\n\nint main(){\n cin >> H >> W;\n vector<char> g;\n g.resize(H*W);\n dist.resize(H*W);\n for(int i=0;i<H*W;i++){\n cin >> g[i];\n if(g[i]=='k')k=i;\n if(g[i]=='K')K=i;\n if(g[i]=='s')s=i;\n if(g[i]=='S')S=i;\n }\n\n dfs_k1(K,g,0,0,0);\n\n g[k]='s';\n g[s]='k';\n g[S]='K';\n g[K]='S';\n int koukan;\n koukan = s;\n s=k;\n k=koukan;\n koukan=S;\n S=K;\n K=koukan;\n\n\n dfs_k1(K,g,0,0,0);\n\n\n if(M==10000)cout << \"CONTRACT\"<<endl;\n else cout << M <<endl;\n}","accuracy":0.38461538461538464,"time_ms":90,"memory_kb":3172,"score_of_the_acc":-0.999,"final_rank":11},{"submission_id":"aoj_2319_3393745","code_snippet":"#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\nint H,W;\nint M = 10000;\nint s,S,k,K;\nqueue<int> que;\nvector<int> dist;\n\n\n\n\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\n for(int i=0;i<H*W;i++){\n dist[i] = 10000;\n }\n que.push(S);\n dist[S] = dis;\n while(!que.empty()){\n int p = que.front();\n que.pop();\n if(g[p+W]=='s'){\n if(dist[p]+1<M){\n M=dist[p]+1;\n }\n continue;\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<k/W-1)next.push_back(p+W);\n for(int i=0;i<next.size();i++){\n int d = dist[p]+1;\n switch(g[next[i]]){\n case('.'):\n if(dist[next[i]] > d){\n dist[next[i]] = d;\n que.push(next[i]);\n }\n break;\n case('a'):\n d++;\n case('K'):\n d++;\n if(sfound==1){\n if(d<M)M=d;\n return;\n }\n for(int j=0;j<H*W;j++){\n if(g[j]=='a' and dist[j]>d){\n dist[j] = d;\n que.push(j);\n }\n if(g[j]=='K' and dist[j]>d){\n dist[j] = d;\n que.push(j);\n }\n }\n break;\n }\n }\n }\n}\n\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\n if(p/W >= s/W or M<=dis)return;\n if(g[p]=='a' or g[p]=='S'){\n g[p] = 'b';\n if(out==1)M = dis;\n if(out==0){\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\n }\n }\n if(g[p]=='.'){\n g[p] = 'b';\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\n }\n}\n\n\n\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\n if(p!=K)g[p]='a';\n if(g[p+W]=='k'){\n dis++;\n if(Sfound==0)bfs_s2(g,dis,sfound);\n else if(sfound==1){\n dfs_s2(S,g,dis+4,0);\n }\n return;\n }\n vector<int> next;\n if(p%W!=0)next.push_back(p-1);\n if(p%W!=W-1)next.push_back(p+1);\n if(p/W<k/W-1)next.push_back(p+W);\n dis++;\n for(int i=0;i<next.size();i++){\n switch(g[next[i]]){\n case('S'):\n Sfound = 1;\n dfs_k1(next[i],g,dis,sfound,Sfound);\n break;\n case('s'):\n sfound = 1;\n case('.'):\n dfs_k1(next[i],g,dis,sfound,Sfound);\n break;\n }\n }\n}\n\n\n\nint main(){\n cin >> H >> W;\n vector<char> g;\n g.resize(H*W);\n dist.resize(H*W);\n for(int i=0;i<H*W;i++){\n cin >> g[i];\n if(g[i]=='k')k=i;\n if(g[i]=='K')K=i;\n if(g[i]=='s')s=i;\n if(g[i]=='S')S=i;\n }\n\n dfs_k1(K,g,0,0,0);\n\n g[k]='s';\n g[s]='k';\n g[S]='K';\n g[K]='S';\n int koukan;\n koukan = s;\n s=k;\n k=koukan;\n koukan=S;\n S=K;\n K=koukan;\n\n\n dfs_k1(K,g,0,0,0);\n\n\n if(M==10000)cout << \"CONTRACT\"<<endl;\n else cout << M <<endl;\n}","accuracy":0.3076923076923077,"time_ms":70,"memory_kb":3172,"score_of_the_acc":-0.9752,"final_rank":12},{"submission_id":"aoj_2319_1173977","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[12][12];\nint dp[12][12][12][12][4];\nint H,W;\nint sr,sc,kr,kc,SR,SC,KR,KC;\ninline int ABS(int a){return max(a,-a);}\ninline void upd(int a,int b,int c,int d,int e){\n\tif(a>=sr){\n\t\tif(a>=kr)return;\n\t\tif(a+1<KR)dp[a+1][11][11][b][e|2]=min(dp[a+1][11][11][b][e|2],dp[a][b][c][d][e]);\n\t\telse if(a+1==KR)dp[a+1][11][KC][b][e|2]=min(dp[a+1][11][KC][b][e|2],dp[a][b][c][d][e]);\n\t\telse{\n\t\t\tfor(int y=0;y<W;y++){\n\t\t\t\tbool d2=false;\n\t\t\t\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\n\t\t\t\tif(str[a+1][y]=='#')d2=true;\n\t\t\t\tif(a+1==kr&&kc!=y)d2=true;\n\t\t\t\tif(d2)continue;\n\t\t\t\tint x=b;\n\t\t\t\tint ks=0;\n\t\t\t\tint vt=0;\n\t\t\t\tfor(int z=min(y,c);z<max(y,c);z++){\n\t\t\t\t\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\n\t\t\t\t\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\n\t\t\t\t\tif(!iL&&!iR)ks++;\n\t\t\t\t\telse if(!(iL&&iR)){\n\t\t\t\t\t\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\n\t\t\t\t\t//\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\n\t\t\t\t\t\telse ks+=2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(d!=11&&a>KR&&a<=sr&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\n\t\t\t\t\tif(a-1==SR&&c==SC)ks--;\n\t\t\t\t\telse if(a-1==sr&&c==sc)ks--;\n\t\t\t\t\telse ks-=2;\n\t\t\t\t}\n\t\t\t\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\n\t\t\t\telse ks++;\n\t\t\t\tif(d!=11&&a>KR&&a<=sr&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\t\tint te=e;\n\t\t\t\tif(c<min(b,x)||max(b,x)<c)te|=2;\n\t\t\t\tif(b<min(c,y)||max(c,y)<b)te|=1;\n\t\t\t\tdp[a+1][11][y][b][te]=min(dp[a+1][11][y][b][te],dp[a][b][c][d][e]+ks);\n\t\t\t}\n\t\t}\n\t\treturn;\n\t}\n\tfor(int x=0;x<W;x++){\n\t\tbool d1=false;\n\t\tfor(int z=min(x,b);z<=max(x,b);z++)if(str[a][z]=='#')d1=true;\n\t\tif(str[a+1][x]=='#')d1=true;\n\t\tif(a+1==sr&&sc!=x)d1=true;\n\t\t\n\t\tif(d1)continue;\n\t\tif(a<KR){\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tif(a+1==KR)dp[a+1][x][KC][b][e|1]=min(dp[a+1][x][KC][b][e|1],dp[a][b][c][d][e]+ks);\n\t\t\telse dp[a+1][x][11][b][e|1]=min(dp[a+1][x][11][b][e|1],dp[a][b][c][d][e]+ks);\n\t\t\tcontinue;\n\t\t}\n\t\tif(a>=kr){\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tif(a==kr&&min(b,x)<=c&&c<=max(b,x))ks++;\n\t\t\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\n\t\t\t\tif(a-1==SR&&c==SC)ks--;\n\t\t\t\telse if(a-1==sr&&c==sc)ks--;\n\t\t\t\telse ks-=2;\n\t\t\t}\n\t\t\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\tint te=e|1;\n\t\t\tif(a==kr&&(c<min(b,x)||max(b,x)<c))te|=2;\n\t\t\tdp[a+1][x][11][b][te]=min(dp[a+1][x][11][b][te],dp[a][b][c][d][e]+ks);\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int y=0;y<W;y++){\n\t\t\tbool d2=false;\n\t\t\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\n\t\t\tif(str[a+1][y]=='#')d2=true;\n\t\t\tif(a+1==kr&&kc!=y)d2=true;\n\t\t\tif(a==SR&&a==KR&&min(b,x)<=c&&c<=max(b,x)&&min(c,y)<=b&&b<=max(c,y))continue;\n\t\t\tif(d2)continue;\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tint vt=0;\n\t\t\tfor(int z=min(y,c);z<max(y,c);z++){\n\t\t\t\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\n\t\t\t\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\n\t\t\t\tif(!iL&&!iR)ks++;\n\t\t\t\telse if(!(iL&&iR)){\n\t\t\t\t\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\n\t\t\t//\t\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\n\t\t\t\t\telse ks+=2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\n\t\t\t\tif(a-1==SR&&c==SC)ks--;\n\t\t\t\telse if(a-1==sr&&c==sc)ks--;\n\t\t\t\telse ks-=2;\n\t\t\t}\n\t\t\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\n\t\t\telse ks++;\n\t\t\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\tint te=e;\n\t\t\tif(c<min(b,x)||max(b,x)<c)te|=2;\n\t\t\tif(b<min(c,y)||max(c,y)<b)te|=1;\n\t\t//\tif(a==sr)te|=2;\n\t\t//\tif(a==kr)te|=1;\n\t\t//\tprintf(\"%d %d %d %d %d -> %d %d %d %d %d: %d\\n\",a,b,c,d,e,a+1,x,y,b,te,ks);\n\t\t\tdp[a+1][x][y][b][te]=min(dp[a+1][x][y][b][te],dp[a][b][c][d][e]+ks);\n\t\t}\n\t}\n}\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tH=a;W=b;\n\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\tfor(int i=0;i<12;i++)for(int j=0;j<12;j++)for(int k=0;k<12;k++)for(int l=0;l<12;l++)\n\t\tdp[i][j][k][l][0]=dp[i][j][k][l][1]=dp[i][j][k][l][2]=dp[i][j][k][l][3]=99999999;\n\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\n\t\tif(str[i][j]=='s'){sr=i;sc=j;}\n\t\tif(str[i][j]=='k'){kr=i;kc=j;}\n\t\tif(str[i][j]=='S'){SR=i;SC=j;}\n\t\tif(str[i][j]=='K'){KR=i;KC=j;}\n\t}\n\tif(SR>KR){\n\t\tswap(SR,KR);\n\t\tswap(SC,KC);\n\t\tswap(sr,kr);\n\t\tswap(sc,kc);\n\t}\n\tif(SR==KR){\n\t\tdp[SR][SC][KC][11][0]=0;\n\t}else if(SR<KR){\n\t\tdp[SR][SC][11][11][1]=0;\n\t}else{\n\t\tdp[SR][SC][11][11][2]=0;\n\t}\n\tint ret=99999999;\n\tfor(int i=0;i<a;i++){\n\t\tfor(int j=0;j<12;j++){\n\t\t\tfor(int k=0;k<12;k++){\n\t\t\t\tfor(int l=0;l<12;l++){\n\t\t\t\t\tfor(int m=0;m<4;m++){\n\t\t\t\t\t\tif(dp[i][j][k][l][m]>999999)continue;\n\t\t\t\t\t\t//printf(\"%d %d %d %d %d: %d\\n\",i,j,k,l,m,dp[i][j][k][l][m]);\n\t\t\t\t\t\tint t=0;\n\t\t\t\t\t\tif(j==11)t|=2;\n\t\t\t\t\t\tif(k==11)t|=1;\n\t\t\t\t\t\tif(j<W&&k<W&&k!=j)t|=3;\n\t\t\t\t\t\tif(i>=max(sr,kr)&&(m|t)==3)ret=min(ret,dp[i][j][k][l][m]);\n\t\t\t\t\t\telse upd(i,j,k,l,m);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(SR>=sr||KR>=kr)ret=999999999;\n\tif(ret>999999)printf(\"CONTRACT\\n\");\n\telse printf(\"%d\\n\",ret);\n}","accuracy":1,"time_ms":40,"memory_kb":1356,"score_of_the_acc":-0.4153,"final_rank":1},{"submission_id":"aoj_2319_1173958","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[12][12];\nint dp[12][12][12][12][4];\nint H,W;\nint sr,sc,kr,kc,SR,SC,KR,KC;\ninline int ABS(int a){return max(a,-a);}\ninline void upd(int a,int b,int c,int d,int e){\n\tif(a>=sr){\n\t\tif(a>=kr)return;\n\t\tif(a+1<KR)dp[a+1][11][11][b][e|2]=min(dp[a+1][11][11][b][e|2],dp[a][b][c][d][e]);\n\t\telse if(a+1==KR)dp[a+1][11][KC][b][e|2]=min(dp[a+1][11][KC][b][e|2],dp[a][b][c][d][e]);\n\t\telse{\n\t\t\tfor(int y=0;y<W;y++){\n\t\t\t\tbool d2=false;\n\t\t\t\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\n\t\t\t\tif(str[a+1][y]=='#')d2=true;\n\t\t\t\tif(a+1==kr&&kc!=y)d2=true;\n\t\t\t\tif(d2)continue;\n\t\t\t\tint x=b;\n\t\t\t\tint ks=0;\n\t\t\t\tint vt=0;\n\t\t\t\tfor(int z=min(y,c);z<max(y,c);z++){\n\t\t\t\t\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\n\t\t\t\t\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\n\t\t\t\t\tif(!iL&&!iR)ks++;\n\t\t\t\t\telse if(!(iL&&iR)){\n\t\t\t\t\t\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\n\t\t\t\t\t\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\n\t\t\t\t\t\telse ks+=2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\n\t\t\t\t\tif(a-1==SR&&c==SC)ks--;\n\t\t\t\t\telse if(a-1==sr&&c==sc)ks--;\n\t\t\t\t\telse ks-=2;\n\t\t\t\t}\n\t\t\t\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\n\t\t\t\telse ks++;\n\t\t\t\tif(d!=11&&a>KR&&a<=sr&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\t\tint te=e;\n\t\t\t\tif(c<min(b,x)||max(b,x)<c)te|=2;\n\t\t\t\tif(b<min(c,y)||max(c,y)<b)te|=1;\n\t\t\t\tdp[a+1][11][y][b][te]=min(dp[a+1][11][y][b][te],dp[a][b][c][d][e]+ks);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int x=0;x<W;x++){\n\t\tbool d1=false;\n\t\tfor(int z=min(x,b);z<=max(x,b);z++)if(str[a][z]=='#')d1=true;\n\t\tif(str[a+1][x]=='#')d1=true;\n\t\tif(a+1==sr&&sc!=x)d1=true;\n\t\t\n\t\tif(d1)continue;\n\t\tif(a<KR){\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tif(a+1==KR)dp[a+1][x][KC][b][e|1]=min(dp[a+1][x][KC][b][e|1],dp[a][b][c][d][e]+ks);\n\t\t\telse dp[a+1][x][11][b][e|1]=min(dp[a+1][x][11][b][e|1],dp[a][b][c][d][e]+ks);\n\t\t\tcontinue;\n\t\t}\n\t\tif(a>=kr){\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tif(a==kr&&min(b,x)<=c&&c<=max(b,x))ks++;\n\t\t\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\n\t\t\t\tif(a-1==SR&&c==SC)ks--;\n\t\t\t\telse if(a-1==sr&&c==sc)ks--;\n\t\t\t\telse ks-=2;\n\t\t\t}\n\t\t\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\tint te=e|1;\n\t\t\tif(a==kr&&(c<min(b,x)||max(b,x)<c))te|=2;\n\t\t\tdp[a+1][x][11][b][te]=min(dp[a+1][x][11][b][te],dp[a][b][c][d][e]+ks);\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int y=0;y<W;y++){\n\t\t\tbool d2=false;\n\t\t\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\n\t\t\tif(str[a+1][y]=='#')d2=true;\n\t\t\tif(a+1==kr&&kc!=y)d2=true;\n\t\t\tif(a==SR&&a==KR&&min(b,x)<=c&&c<=max(b,x)&&min(c,y)<=b&&b<=max(c,y))continue;\n\t\t\tif(d2)continue;\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tint vt=0;\n\t\t\tfor(int z=min(y,c);z<max(y,c);z++){\n\t\t\t\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\n\t\t\t\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\n\t\t\t\tif(!iL&&!iR)ks++;\n\t\t\t\telse if(!(iL&&iR)){\n\t\t\t\t\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\n\t\t\t\t\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\n\t\t\t\t\telse ks+=2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\n\t\t\t\tif(a-1==SR&&c==SC)ks--;\n\t\t\t\telse if(a-1==sr&&c==sc)ks--;\n\t\t\t\telse ks-=2;\n\t\t\t}\n\t\t\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\n\t\t\telse ks++;\n\t\t\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\tint te=e;\n\t\t\tif(c<min(b,x)||max(b,x)<c)te|=2;\n\t\t\tif(b<min(c,y)||max(c,y)<b)te|=1;\n\t\t//\tif(a==sr)te|=2;\n\t\t//\tif(a==kr)te|=1;\n\t\t//\tprintf(\"%d %d %d %d %d -> %d %d %d %d %d: %d\\n\",a,b,c,d,e,a+1,x,y,b,te,ks);\n\t\t\tdp[a+1][x][y][b][te]=min(dp[a+1][x][y][b][te],dp[a][b][c][d][e]+ks);\n\t\t}\n\t}\n}\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tH=a;W=b;\n\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\tfor(int i=0;i<12;i++)for(int j=0;j<12;j++)for(int k=0;k<12;k++)for(int l=0;l<12;l++)\n\t\tdp[i][j][k][l][0]=dp[i][j][k][l][1]=dp[i][j][k][l][2]=dp[i][j][k][l][3]=99999999;\n\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\n\t\tif(str[i][j]=='s'){sr=i;sc=j;}\n\t\tif(str[i][j]=='k'){kr=i;kc=j;}\n\t\tif(str[i][j]=='S'){SR=i;SC=j;}\n\t\tif(str[i][j]=='K'){KR=i;KC=j;}\n\t}\n\tif(SR>KR){\n\t\tswap(SR,KR);\n\t\tswap(SC,KC);\n\t\tswap(sr,kr);\n\t\tswap(sc,kc);\n\t}\n\tif(SR==KR){\n\t\tdp[SR][SC][KC][11][0]=0;\n\t}else if(SR<KR){\n\t\tdp[SR][SC][11][11][1]=0;\n\t}else{\n\t\tdp[SR][SC][11][11][2]=0;\n\t}\n\tint ret=99999999;\n\tfor(int i=0;i<a;i++){\n\t\tfor(int j=0;j<12;j++){\n\t\t\tfor(int k=0;k<12;k++){\n\t\t\t\tfor(int l=0;l<12;l++){\n\t\t\t\t\tfor(int m=0;m<4;m++){\n\t\t\t\t\t\tif(dp[i][j][k][l][m]>999999)continue;\n\t\t\t\t\t//\tprintf(\"%d %d %d %d %d: %d\\n\",i,j,k,l,m,dp[i][j][k][l][m]);\n\t\t\t\t\t\tint t=0;\n\t\t\t\t\t\tif(j==11)t|=2;\n\t\t\t\t\t\tif(k==11)t|=1;\n\t\t\t\t\t\tif(j<W&&k<W&&k!=j)t|=3;\n\t\t\t\t\t\tif(i>=max(sr,kr)&&(m|t)==3)ret=min(ret,dp[i][j][k][l][m]);\n\t\t\t\t\t\telse upd(i,j,k,l,m);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(SR>=sr||KR>=kr)ret=999999999;\n\tif(ret>999999)printf(\"CONTRACT\\n\");\n\telse printf(\"%d\\n\",ret);\n}","accuracy":0.5961538461538461,"time_ms":40,"memory_kb":1352,"score_of_the_acc":-0.4141,"final_rank":6},{"submission_id":"aoj_2319_1173956","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[12][12];\nint dp[12][12][12][12][4];\nint H,W;\nint sr,sc,kr,kc,SR,SC,KR,KC;\ninline int ABS(int a){return max(a,-a);}\ninline void upd(int a,int b,int c,int d,int e){\n\tif(a>=sr){\n\t\tif(a>=kr)return;\n\t\tif(a+1<KR)dp[a+1][11][11][b][e|2]=min(dp[a+1][11][11][b][e|2],dp[a][b][c][d][e]);\n\t\telse if(a+1==KR)dp[a+1][11][KC][b][e|2]=min(dp[a+1][11][KC][b][e|2],dp[a][b][c][d][e]);\n\t\telse{\n\t\t\tfor(int y=0;y<W;y++){\n\t\t\t\tbool d2=false;\n\t\t\t\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\n\t\t\t\tif(str[a+1][y]=='#')d2=true;\n\t\t\t\tif(a+1==kr&&kc!=y)d2=true;\n\t\t\t\tif(d2)continue;\n\t\t\t\tint x=b;\n\t\t\t\tint ks=0;\n\t\t\t\tint vt=0;\n\t\t\t\tfor(int z=min(y,c);z<max(y,c);z++){\n\t\t\t\t\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\n\t\t\t\t\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\n\t\t\t\t\tif(!iL&&!iR)ks++;\n\t\t\t\t\telse if(!(iL&&iR)){\n\t\t\t\t\t\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\n\t\t\t\t\t\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\n\t\t\t\t\t\telse ks+=2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\n\t\t\t\t\tif(a-1==SR&&c==SC)ks--;\n\t\t\t\t\telse ks-=2;\n\t\t\t\t}\n\t\t\t\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\n\t\t\t\telse ks++;\n\t\t\t\tif(d!=11&&a>KR&&a<=sr&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\t\tint te=e;\n\t\t\t\tif(c<min(b,x)||max(b,x)<c)te|=2;\n\t\t\t\tif(b<min(c,y)||max(c,y)<b)te|=1;\n\t\t\t\tdp[a+1][11][y][b][te]=min(dp[a+1][11][y][b][te],dp[a][b][c][d][e]+ks);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int x=0;x<W;x++){\n\t\tbool d1=false;\n\t\tfor(int z=min(x,b);z<=max(x,b);z++)if(str[a][z]=='#')d1=true;\n\t\tif(str[a+1][x]=='#')d1=true;\n\t\tif(a+1==sr&&sc!=x)d1=true;\n\t\t\n\t\tif(d1)continue;\n\t\tif(a<KR){\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tif(a+1==KR)dp[a+1][x][KC][b][e|1]=min(dp[a+1][x][KC][b][e|1],dp[a][b][c][d][e]+ks);\n\t\t\telse dp[a+1][x][11][b][e|1]=min(dp[a+1][x][11][b][e|1],dp[a][b][c][d][e]+ks);\n\t\t\tcontinue;\n\t\t}\n\t\tif(a>=kr){\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tif(a==kr&&min(b,x)<=c&&c<=max(b,x))ks++;\n\t\t\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\n\t\t\t\tif(a-1==SR&&c==SC)ks--;\n\t\t\t\telse ks-=2;\n\t\t\t}\n\t\t\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\tint te=e|1;\n\t\t\tif(a==kr&&(c<min(b,x)||max(b,x)<c))te|=2;\n\t\t\tdp[a+1][x][11][b][te]=min(dp[a+1][x][11][b][te],dp[a][b][c][d][e]+ks);\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int y=0;y<W;y++){\n\t\t\tbool d2=false;\n\t\t\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\n\t\t\tif(str[a+1][y]=='#')d2=true;\n\t\t\tif(a+1==kr&&kc!=y)d2=true;\n\t\t\tif(a==SR&&a==KR&&min(b,x)<=c&&c<=max(b,x)&&min(c,y)<=b&&b<=max(c,y))continue;\n\t\t\tif(d2)continue;\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tint vt=0;\n\t\t\tfor(int z=min(y,c);z<max(y,c);z++){\n\t\t\t\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\n\t\t\t\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\n\t\t\t\tif(!iL&&!iR)ks++;\n\t\t\t\telse if(!(iL&&iR)){\n\t\t\t\t\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\n\t\t\t\t\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\n\t\t\t\t\telse ks+=2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\n\t\t\t\tif(a-1==SR&&c==SC)ks--;\n\t\t\t\telse ks-=2;\n\t\t\t}\n\t\t\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\n\t\t\telse ks++;\n\t\t\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\tint te=e;\n\t\t\tif(c<min(b,x)||max(b,x)<c)te|=2;\n\t\t\tif(b<min(c,y)||max(c,y)<b)te|=1;\n\t\t//\tif(a==sr)te|=2;\n\t\t//\tif(a==kr)te|=1;\n\t\t//\tprintf(\"%d %d %d %d %d -> %d %d %d %d %d: %d\\n\",a,b,c,d,e,a+1,x,y,b,te,ks);\n\t\t\tdp[a+1][x][y][b][te]=min(dp[a+1][x][y][b][te],dp[a][b][c][d][e]+ks);\n\t\t}\n\t}\n}\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tH=a;W=b;\n\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\tfor(int i=0;i<12;i++)for(int j=0;j<12;j++)for(int k=0;k<12;k++)for(int l=0;l<12;l++)\n\t\tdp[i][j][k][l][0]=dp[i][j][k][l][1]=dp[i][j][k][l][2]=dp[i][j][k][l][3]=99999999;\n\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\n\t\tif(str[i][j]=='s'){sr=i;sc=j;}\n\t\tif(str[i][j]=='k'){kr=i;kc=j;}\n\t\tif(str[i][j]=='S'){SR=i;SC=j;}\n\t\tif(str[i][j]=='K'){KR=i;KC=j;}\n\t}\n\tif(SR>KR){\n\t\tswap(SR,KR);\n\t\tswap(SC,KC);\n\t\tswap(sr,kr);\n\t\tswap(sc,kc);\n\t}\n\tif(SR==KR){\n\t\tdp[SR][SC][KC][11][0]=0;\n\t}else if(SR<KR){\n\t\tdp[SR][SC][11][11][1]=0;\n\t}else{\n\t\tdp[SR][SC][11][11][2]=0;\n\t}\n\tint ret=99999999;\n\tfor(int i=0;i<a;i++){\n\t\tfor(int j=0;j<12;j++){\n\t\t\tfor(int k=0;k<12;k++){\n\t\t\t\tfor(int l=0;l<12;l++){\n\t\t\t\t\tfor(int m=0;m<4;m++){\n\t\t\t\t\t\tif(dp[i][j][k][l][m]>999999)continue;\n\t\t\t\t\t//\tprintf(\"%d %d %d %d %d: %d\\n\",i,j,k,l,m,dp[i][j][k][l][m]);\n\t\t\t\t\t\tint t=0;\n\t\t\t\t\t\tif(j==11)t|=2;\n\t\t\t\t\t\tif(k==11)t|=1;\n\t\t\t\t\t\tif(j<W&&k<W&&k!=j)t|=3;\n\t\t\t\t\t\tif(i>=max(sr,kr)&&(m|t)==3)ret=min(ret,dp[i][j][k][l][m]);\n\t\t\t\t\t\telse upd(i,j,k,l,m);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(SR>=sr||KR>=kr)ret=999999999;\n\tif(ret>999999)printf(\"CONTRACT\\n\");\n\telse printf(\"%d\\n\",ret);\n}","accuracy":0.5961538461538461,"time_ms":40,"memory_kb":1356,"score_of_the_acc":-0.4153,"final_rank":7},{"submission_id":"aoj_2319_1173932","code_snippet":"#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nchar str[12][12];\nint dp[12][12][12][12][4];\nint H,W;\nint sr,sc,kr,kc,SR,SC,KR,KC;\ninline int ABS(int a){return max(a,-a);}\ninline void upd(int a,int b,int c,int d,int e){\n\tif(a>=sr){\n\t\tif(a>=kr)return;\n\t\tif(a+1<KR)dp[a+1][11][11][b][e|2]=min(dp[a+1][11][11][b][e|2],dp[a][b][c][d][e]);\n\t\telse if(a+1==KR)dp[a+1][11][KC][b][e|2]=min(dp[a+1][11][KC][b][e|2],dp[a][b][c][d][e]);\n\t\telse{\n\t\t\tfor(int y=0;y<W;y++){\n\t\t\t\tbool d2=false;\n\t\t\t\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\n\t\t\t\tif(str[a+1][y]=='#')d2=true;\n\t\t\t\tif(a+1==kr&&kc!=y)d2=true;\n\t\t\t\tif(d2)continue;\n\t\t\t\tint x=b;\n\t\t\t\tint ks=0;\n\t\t\t\tint vt=0;\n\t\t\t\tfor(int z=min(y,c);z<max(y,c);z++){\n\t\t\t\t\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\n\t\t\t\t\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\n\t\t\t\t\tif(!iL&&!iR)ks++;\n\t\t\t\t\telse if(!(iL&&iR)){\n\t\t\t\t\t\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\n\t\t\t\t\t\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\n\t\t\t\t\t\telse ks+=2;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(d!=11&&a>KR&&a<=sr&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x))ks-=2;\n\t\t\t\tif(min(b,x)<=y&&y<=max(b,x))ks+=2;\n\t\t\t\telse ks++;\n\t\t\t\tif(d!=11&&a>KR&&a<=sr&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\t\tint te=e;\n\t\t\t\tif(c<min(b,x)||max(b,x)<c)te|=2;\n\t\t\t\tif(b<min(c,y)||max(c,y)<b)te|=1;\n\t\t\t\tdp[a+1][11][y][b][te]=min(dp[a+1][11][y][b][te],dp[a][b][c][d][e]+ks);\n\t\t\t}\n\t\t}\n\t}\n\tfor(int x=0;x<W;x++){\n\t\tbool d1=false;\n\t\tfor(int z=min(x,b);z<=max(x,b);z++)if(str[a][z]=='#')d1=true;\n\t\tif(str[a+1][x]=='#')d1=true;\n\t\tif(a+1==sr&&sc!=x)d1=true;\n\t\t\n\t\tif(d1)continue;\n\t\tif(a<KR){\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tif(a+1==KR)dp[a+1][x][KC][b][e|1]=min(dp[a+1][x][KC][b][e|1],dp[a][b][c][d][e]+ks);\n\t\t\telse dp[a+1][x][11][b][e|1]=min(dp[a+1][x][11][b][e|1],dp[a][b][c][d][e]+ks);\n\t\t\tcontinue;\n\t\t}\n\t\tif(a>=kr){\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tif(a==kr&&min(b,x)<=c&&c<=max(b,x))ks++;\n\t\t\tif(d!=11&&a>KR&&a<=kr&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x))ks-=2;\n\t\t\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\tint te=e|1;\n\t\t\tif(a==kr&&(c<min(b,x)||max(b,x)<c))te|=2;\n\t\t\tdp[a+1][x][11][b][te]=min(dp[a+1][x][11][b][te],dp[a][b][c][d][e]+ks);\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int y=0;y<W;y++){\n\t\t\tbool d2=false;\n\t\t\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\n\t\t\tif(str[a+1][y]=='#')d2=true;\n\t\t\tif(a+1==kr&&kc!=y)d2=true;\n\t\t\tif(a==SR&&a==KR&&min(b,x)<=c&&c<=max(b,x)&&min(c,y)<=b&&b<=max(c,y))continue;\n\t\t\tif(d2)continue;\n\t\t\tint ks=ABS(x-b)+1;\n\t\t\tint vt=0;\n\t\t\tfor(int z=min(y,c);z<max(y,c);z++){\n\t\t\t\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\n\t\t\t\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\n\t\t\t\tif(!iL&&!iR)ks++;\n\t\t\t\telse if(!(iL&&iR)){\n\t\t\t\t\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\n\t\t\t\t\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\n\t\t\t\t\telse ks+=2;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x))ks-=2;\n\t\t\tif(min(b,x)<=y&&y<=max(b,x))ks+=2;\n\t\t\telse ks++;\n\t\t\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\n\t\t\tint te=e;\n\t\t\tif(c<min(b,x)||max(b,x)<c)te|=2;\n\t\t\tif(b<min(c,y)||max(c,y)<b)te|=1;\n\t\t//\tif(a==sr)te|=2;\n\t\t//\tif(a==kr)te|=1;\n\t\t\tdp[a+1][x][y][b][te]=min(dp[a+1][x][y][b][te],dp[a][b][c][d][e]+ks);\n\t\t}\n\t}\n}\nint main(){\n\tint a,b;\n\tscanf(\"%d%d\",&a,&b);\n\tH=a;W=b;\n\tfor(int i=0;i<a;i++)scanf(\"%s\",str[i]);\n\tfor(int i=0;i<12;i++)for(int j=0;j<12;j++)for(int k=0;k<12;k++)for(int l=0;l<12;l++)\n\t\tdp[i][j][k][l][0]=dp[i][j][k][l][1]=dp[i][j][k][l][2]=dp[i][j][k][l][3]=99999999;\n\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\n\t\tif(str[i][j]=='s'){sr=i;sc=j;}\n\t\tif(str[i][j]=='k'){kr=i;kc=j;}\n\t\tif(str[i][j]=='S'){SR=i;SC=j;}\n\t\tif(str[i][j]=='K'){KR=i;KC=j;}\n\t}\n\tif(SR>KR){\n\t\tswap(SR,KR);\n\t\tswap(SC,KC);\n\t\tswap(sr,kr);\n\t\tswap(sc,kc);\n\t}\n\tif(SR==KR){\n\t\tdp[SR][SC][KC][11][0]=0;\n\t}else if(SR<KR){\n\t\tdp[SR][SC][11][11][1]=0;\n\t}else{\n\t\tdp[SR][SC][11][11][2]=0;\n\t}\n\tint ret=99999999;\n\tfor(int i=0;i<a;i++){\n\t\tfor(int j=0;j<12;j++){\n\t\t\tfor(int k=0;k<12;k++){\n\t\t\t\tfor(int l=0;l<12;l++){\n\t\t\t\t\tfor(int m=0;m<4;m++){\n\t\t\t\t\t\tif(dp[i][j][k][l][m]>999999)continue;\n\t\t\t//\t\t\tprintf(\"%d %d %d %d %d: %d\\n\",i,j,k,l,m,dp[i][j][k][l][m]);\n\t\t\t\t\t\tint t=0;\n\t\t\t\t\t\tif(j==11)t|=2;\n\t\t\t\t\t\tif(k==11)t|=1;\n\t\t\t\t\t\tif(j<W&&k<W&&k!=j)t|=3;\n\t\t\t\t\t\tif(i>=max(sr,kr)&&(m|t)==3)ret=min(ret,dp[i][j][k][l][m]);\n\t\t\t\t\t\telse upd(i,j,k,l,m);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tif(SR>=sr||KR>=kr)ret=999999999;\n\tif(ret>999999)printf(\"CONTRACT\\n\");\n\telse printf(\"%d\\n\",ret);\n}","accuracy":0.5576923076923077,"time_ms":40,"memory_kb":1356,"score_of_the_acc":-0.4153,"final_rank":8},{"submission_id":"aoj_2319_269262","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\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 Point {\n int state; // NG, OK\n int x;\n int y;\n int cost;\n Point() {;}\n Point(int state, int x, int y, int cost) : state(state), x(x), y(y), cost(cost) {;}\n bool operator<(const Point &rhs) const {\n return cost > rhs.cost;\n }\n};\n\nint h, w;\nint rsx, rsy, rex, rey;\nint bsx, bsy, bex, bey;\nchar field[20][20];\n\nvoid PrintField() {\n REP(y, h) {\n REP(x, w) {\n printf(\"%c\", field[y][x]);\n }\n puts(\"\");\n }\n}\n\nbool visit[2][20][20];\nint dist[2][20][20];\nint calc() {\n const int dx[3] = { 1, 0, -1 };\n const int dy[3] = { 0, 1, 0, };\n priority_queue<Point> que;\n int initialState = 0;\n if (field[bsy][bsx] != 'K') { initialState = 1; }\n que.push(Point(initialState, bsx, bsy, 0));\n MEMSET(visit, 0);\n MEMSET(dist, 0x0f);\n while (!que.empty()) {\n Point p = que.top();\n que.pop();\n if (visit[p.state][p.y][p.x]) { continue; }\n visit[p.state][p.y][p.x] = true;\n if (p.state == 1 && p.x == bex && p.y == bey) {\n if (field[p.y][p.x] == 'K') { p.cost++; }\n return p.cost;\n }\n if (p.y == bey) { continue; }\n REP(dir, 3) {\n int nx = p.x + dx[dir];\n int ny = p.y + dy[dir];\n if (nx < 0 || nx >= w || ny < 0 || ny >= h) { continue; }\n if (nx == rsx && ny == rsy) { continue; }\n if (field[ny][nx] == '#') { continue; }\n int nstate = p.state;\n if (dir == 1 && field[ny][nx] != 'K') {\n nstate = 1;\n }\n int ncost = p.cost;\n if (field[p.y][p.x] == 'K' && field[ny][nx] == 'K') {;}\n else if (field[p.y][p.x] == 'K' || field[ny][nx] == 'K') { ncost += 2; }\n else if (field[p.y][p.x] == '.' && field[ny][nx] == '.') { ncost++; }\n\n if (visit[nstate][ny][nx] == '#') { continue; }\n if (dist[nstate][ny][nx] <= ncost) { continue; }\n dist[nstate][ny][nx] = ncost;\n que.push(Point(nstate, nx, ny, ncost));\n }\n }\n return 1 << 30;\n}\n\nint Init(int x, int y, int dir, int movey) {\n int ret = 1 << 30;\n if (x < 0 || x >= w || y < 0 || y >= h) { return 1 << 30; }\n if (field[y][x] != '.') { return 1 << 30; }\n if (movey != 1 && dir != -1) {\n for (int ny = y; ny >= 0; ny--) {\n if ((x == bsx && ny == bsy) ||\n (x == bex && ny == bey) ||\n field[ny][x] == '#') { break; }\n if (field[ny][x] == 'K') { return 1 << 30; }\n }\n }\n field[y][x] = 'K';\n if (x == rex && y == rey) {\n ret = calc();\n } else if (y == rey) {;}\n else {\n const int dx[2] = { 1, -1 };\n REP(i, 2) {\n int nx = x + dx[i];\n ret = min(ret, Init(nx, y, i, 0) + 1);\n }\n ret = min(ret, Init(x, y + 1, dir, 1) + 1);\n }\n field[y][x] = '.';\n return ret;\n}\n\nint main() {\n while (scanf(\"%d %d\", &h, &w) > 0) {\n REP(y, h) {\n int v = scanf(\"%s\", field[y]);\n assert(v == 1);\n }\n REP(y, h) REP(x, w) {\n if (field[y][x] == 'K') { rsx = x; rsy = y; field[y][x] = '.'; }\n if (field[y][x] == 'S') { bsx = x; bsy = y; field[y][x] = '.'; }\n if (field[y][x] == 'k') { rex = x; rey = y; field[y][x] = '.'; }\n if (field[y][x] == 's') { bex = x; bey = y; field[y][x] = '.'; }\n }\n int ans = 1 << 30;\n if (rsy >= rey || bsy >= bey) {}\n else {\n ans = min(ans, Init(rsx, rsy, -1, 1));\n swap(rsx, bsx);\n swap(rsy, bsy);\n swap(rex, bex);\n swap(rey, bey);\n ans = min(ans, Init(rsx, rsy, -1, 1));\n }\n if (ans >= (1 << 30)) puts(\"CONTRACT\");\n else printf(\"%d\\n\", ans);\n }\n}","accuracy":1,"time_ms":550,"memory_kb":0,"score_of_the_acc":-0.631,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_2319_5955599\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\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 per(i,n) for(int i=int(n)-1;i>=0;i--)\\n#define per1(i,n) for(int i=int(n);i>0;i--)\\n#define all(c) c.begin(),c.end()\\n#define si(x) int(x.size())\\n#define pb push_back\\n#define eb emplace_back\\n#define fs first\\n#define sc second\\ntemplate<class T> using V = vector<T>;\\ntemplate<class T> using VV = vector<vector<T>>;\\ntemplate<class T,class U> bool chmax(T& x, U y){\\n\\tif(x<y){ x=y; return true; }\\n\\treturn false;\\n}\\ntemplate<class T,class U> bool chmin(T& x, U y){\\n\\tif(y<x){ x=y; return true; }\\n\\treturn false;\\n}\\ntemplate<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}\\ntemplate<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}\\ntemplate<class T>\\nV<T> Vec(size_t a) {\\n return V<T>(a);\\n}\\ntemplate<class T, class... Ts>\\nauto Vec(size_t a, Ts... ts) {\\n return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));\\n}\\ntemplate<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){\\n\\treturn o<<\\\"(\\\"<<p.fs<<\\\",\\\"<<p.sc<<\\\")\\\";\\n}\\ntemplate<class T> ostream& operator<<(ostream& o,const vector<T> &vc){\\n\\to<<\\\"{\\\";\\n\\tfor(const T& v:vc) o<<v<<\\\",\\\";\\n\\to<<\\\"}\\\";\\n\\treturn o;\\n}\\nconstexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }\\n\\n#ifdef LOCAL\\n#define show(x) cerr << \\\"LINE\\\" << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl\\nvoid dmpr(ostream& os){os<<endl;}\\ntemplate<class T,class... Args>\\nvoid dmpr(ostream&os,const T&t,const Args&... args){\\n\\tos<<t<<\\\" ~ \\\";\\n\\tdmpr(os,args...);\\n}\\n#define shows(...) cerr << \\\"LINE\\\" << __LINE__ << \\\" : \\\";dmpr(cerr,##__VA_ARGS__)\\n#define dump(x) cerr << \\\"LINE\\\" << __LINE__ << \\\" : \\\" << #x << \\\" = {\\\"; \\\\\\n\\tfor(auto v: x) cerr << v << \\\",\\\"; cerr << \\\"}\\\" << endl;\\n#else\\n#define show(x) void(0)\\n#define dump(x) void(0)\\n#define shows(...) void(0)\\n#endif\\n\\ntemplate<class D> D divFloor(D a, D b){\\n\\treturn a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);\\n}\\ntemplate<class D> D divCeil(D a, D b) {\\n\\treturn a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);\\n}\\n\\nint dp[11][11][11][2][2];\\n// h, aw, bw, (S(a) \\\\cap b != empty?), (S(b) \\\\cap a != empty?), \\n// aw == W : a doesn't exist in this raw\\n\\nbool can[10][10][10];\\nbool in(int i,int x,int y){\\n\\tif(x>y) swap(x,y);\\n\\treturn x<=i && i<=y;\\n}\\n\\nconst int inf = 1e9;\\nint solve(){\\n\\tint H,W; cin >> H >> W;\\n\\tV<string> s(H); rep(i,H) cin >> s[i];\\n\\tint ax,ay,bx,by,Ax,Ay,Bx,By;\\t// a -> A\\n\\trep(i,H) rep(j,W){\\n\\t\\tif(s[i][j] == 'S') ax=i,ay=j;\\n\\t\\tif(s[i][j] == 's') Ax=i,Ay=j;\\n\\t\\tif(s[i][j] == 'K') bx=i,by=j;\\n\\t\\tif(s[i][j] == 'k') Bx=i,By=j;\\n\\t}\\n\\tif(ax >= Ax || bx >= Bx) return -1;\\n\\n\\trep(i,H){\\n\\t\\trep(x,W) rep(y,W){\\n\\t\\t\\tcan[i][x][y] = true;\\n\\t\\t\\tfor(int j=min(x,y);j<=max(x,y);j++) if(s[i][j] == '#') can[i][x][y] = false;\\n\\t\\t}\\n\\t}\\n\\n\\trep(i,H+1) rep(a,W+1) rep(b,W+1) rep(x,2) rep(y,2) dp[i][a][b][x][y] = inf;\\n\\tif(ax > bx){\\n\\t\\tswap(ax,bx);swap(ay,by);swap(Ax,Bx);swap(Ay,By);\\n\\t}\\n\\tif(ax < bx){\\n\\t\\tdp[ax][ay][W][0][0] = 0;\\n\\t}else{\\n\\t\\tdp[ax][ay][by][0][0] = 0;\\n\\t}\\n\\t#define UPDATE \\\\\\n\\t\\t/*shows(h+1,naw,nbw,nsa,nsb,dp[h][aw][bw][sa][sb] + cost);*/ \\\\\\n\\t\\tchmin(dp[h+1][naw][nbw][nsa][nsb], dp[h][aw][bw][sa][sb] + cost);\\n\\n\\tfor(int h=ax;h<H;h++) rep(aw,W+1) rep(bw,W+1) rep(sa,2) rep(sb,2) if(dp[h][aw][bw][sa][sb] != inf){\\n\\t\\tbool aend = (h == Ax);\\n\\t\\tbool bend = (h == Bx);\\n\\t\\tif(aw != W && bw != W){\\n\\t\\t\\trep(Aw,W) rep(Bw,W) if(can[h][aw][Aw] && can[h][bw][Bw]){\\n\\t\\t\\t\\tif(aend && !(aw == Aw && aw == Ay)) continue;\\n\\t\\t\\t\\tif(bend && !(bw == Bw && bw == By)) continue;\\n\\n\\t\\t\\t\\tint cost = abs(aw-Aw) + (aend?0:1) + abs(bw-Bw) + (bend?0:1);\\t\\t// red + blue\\n\\t\\t\\t\\tV<int> edge(W-1);\\n\\t\\t\\t\\tfor(int w=min(aw,Aw);w<max(aw,Aw);w++) edge[w] |= 1;\\n\\t\\t\\t\\tfor(int w=min(bw,Bw);w<max(bw,Bw);w++) edge[w] |= 2;\\n\\t\\t\\t\\tint lime = 0; rep(w,W-1) if(edge[w] == 3) lime++;\\n\\t\\t\\t\\tif(!aend && !bend && Aw == Bw) lime++;\\n\\t\\t\\t\\tcost -= lime;\\t\\t//\\t- lime\\n\\t\\t\\t\\tV<int> deg(W);\\n\\t\\t\\t\\trep(w,W){\\n\\t\\t\\t\\t\\tif(w != 0 && edge[w-1]) deg[w]++;\\t// left\\n\\t\\t\\t\\t\\tif(w != W-1 && edge[w]) deg[w]++;\\t// right\\n\\t\\t\\t\\t\\tif((w == aw && h != ax) or (w == bw && h != bx)) deg[w]++;\\t// up\\n\\t\\t\\t\\t\\tif((w == Aw && !aend) or (w == Bw && !bend)) deg[w]++;\\t// down\\n\\t\\t\\t\\t\\tif((w == Aw && aend) or (w == Bw && bend)) deg[w]++;\\t// terminal +1 cost\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tint green = 0; rep(w,W) green += max(deg[w]-2,0);\\n\\t\\t\\t\\tcost += green;\\n\\n\\t\\t\\t\\tint naw = (aend ? W : Aw), nbw = (bend ? W : Bw);\\n\\t\\t\\t\\tint nsa = sa | !in(aw,bw,Bw);\\n\\t\\t\\t\\tint nsb = sb | !in(bw,aw,Aw);\\n\\t\\t\\t\\tif(h == ax && h == bx && nsa == 0 && nsb == 0){\\n\\t\\t\\t\\t\\t// first raw dead\\n\\t\\t\\t\\t\\tcontinue;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tUPDATE\\n\\t\\t\\t}\\n\\t\\t}else if(aw != W){\\n\\t\\t\\trep(Aw,W) if(can[h][aw][Aw]){\\n\\t\\t\\t\\tif(aend && !(aw == Aw && aw == Ay)) continue;\\n\\n\\t\\t\\t\\tint cost = abs(aw-Aw) + (aend?0:1);\\t\\t// red\\n\\n\\t\\t\\t\\tint naw = (aend ? W : Aw);\\n\\t\\t\\t\\tint nbw = (h+1 == bx ? by : W);\\n\\t\\t\\t\\tint nsa = 1;\\n\\t\\t\\t\\tint nsb = sb;\\n\\t\\t\\t\\tUPDATE\\n\\t\\t\\t}\\n\\t\\t}else if(bw != W){\\n\\t\\t\\trep(Bw,W) if(can[h][bw][Bw]){\\n\\t\\t\\t\\tif(bend && !(bw == Bw && bw == By)) continue;\\n\\n\\t\\t\\t\\tint cost = abs(bw-Bw) + (bend?0:1);\\t\\t// red\\n\\n\\t\\t\\t\\tint nbw = (bend ? W : Bw);\\n\\t\\t\\t\\tint naw = (h+1 == ax ? ay : W);\\n\\t\\t\\t\\tint nsb = 1;\\n\\t\\t\\t\\tint nsa = sa;\\n\\t\\t\\t\\tUPDATE\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tint naw = (h+1 == ax ? ay : W);\\n\\t\\t\\tint nbw = (h+1 == bx ? by : W);\\n\\t\\t\\tint nsa = sa, nsb = sb; int cost = 0;\\n\\t\\t\\tUPDATE\\n\\t\\t}\\n\\t}\\n\\tint res = dp[H][W][W][1][1];\\n\\tif(res == inf) return -1;\\n\\treturn res;\\n}\\n\\nint main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\t\\t//DON'T USE scanf/printf/puts !!\\n\\tcout << fixed << setprecision(20);\\n\\n\\tint ans = solve();\\n\\tif(ans == -1) cout << \\\"CONTRACT\\\" << endl;\\n\\telse cout << ans << endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3464,\n \"score_of_the_acc\": -1,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_2319_3443155\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\nusing namespace std;\\nint H,W;\\nint M = 10000;\\nint s,S,k,K;\\nvector<int> dist;\\n\\n\\n\\n\\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\\n queue<int> que;\\n for(int i=0;i<H*W;i++){\\n dist[i] = 10000;\\n }\\n que.push(S);\\n dist[S] = dis;\\n while(!que.empty()){\\n int p = que.front();\\n //cout << \\\"p:\\\" << p << endl;\\n que.pop();\\n //cout << \\\"next_p:\\\" << que.front() << endl;\\n if(p==s-W){\\n int d = dist[p]+1;\\n if(p%W!=0 and g[s-1]=='a')d++;\\n if(p%W!=W-1 and g[s+1]=='a')d++;\\n if(p/W<H and g[s+W]=='a')d++;\\n if(d<M){\\n M=d;\\n }\\n continue;\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<s/W-1)next.push_back(p+W);\\n for(int i=0;i<next.size();i++){\\n int d = dist[p]+1;\\n switch(g[next[i]]){\\n case('.'):\\n if(dist[next[i]] > d){\\n dist[next[i]] = d;\\n que.push(next[i]);\\n }\\n break;\\n case('a'):\\n d++;\\n case('K'):\\n d++;\\n //cout << sfound <<endl;\\n if(sfound==1){\\n if(d<M)M=d;\\n return;\\n }\\n for(int j=0;j<H*W;j++){\\n if(g[j]=='a' and dist[j]>d){\\n dist[j] = d;\\n que.push(j);\\n }\\n if(g[j]=='K' and dist[j]>d and g[next[i]]!='K'){\\n dist[j] = d-1;\\n que.push(j);\\n }\\n if(g[j]=='K' and dist[j]>d and g[next[i]]=='K'){\\n dist[j] = d;\\n que.push(j);\\n }\\n }\\n break;\\n }\\n }\\n }\\n}\\n\\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\\n if(p/W >= s/W or M<=dis)return;\\n if(g[p]=='a' or g[p]=='S'){\\n g[p] = 'b';\\n if(out==1)M = dis;\\n if(out==0){\\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\\n }\\n }\\n if(g[p]=='.'){\\n g[p] = 'b';\\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\\n }\\n}\\n/*\\nvoid bfs_k1(vector<char> g){\\n int d=0;\\n queue<int> Q;\\n Q.push(K);\\n Q.push(-1);\\n while(!Q.empty()){\\n int p=Q.front();\\n Q.pop();\\n if(p==-1)d++;\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<k/W-1)next.push_back(p+W);\\n for(int i=0;i<next.size();i++){\\n if(g[next[i]]=='.')Q.push(next[i]);\\n if(next[i]==k-W){\\n limdis=d+8;\\n break;\\n }\\n }\\n }\\n}\\n*/\\n\\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\\n //if(dis>limdis)return;\\n if(p!=K)g[p]='a';\\n if(g[p+W]=='k'){\\n dis++;\\n for(int i=0;i<H*W;i++){\\n if(g[i]=='l')g[i]='.';\\n }\\n if(Sfound==0){\\n bfs_s2(g,dis,sfound);\\n //cout << sfound <<Sfound <<endl;\\n }\\n else if(sfound==1)dfs_s2(S,g,dis+4,0);\\n return;\\n }\\n dis++;\\n if(p/W<k/W-1){\\n switch(g[p+W]){\\n case('S'):\\n dfs_k1(p+W,g,dis,sfound,1);\\n break;\\n case('s'):\\n sfound = 1;\\n case('.'):\\n dfs_k1(p+W,g,dis,sfound,Sfound);\\n break;\\n }\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n int P=p+W;\\n while(P<H*W){\\n if(g[P]=='.')g[P]='l';\\n else break;\\n P += W;\\n }\\n for(int i=0;i<next.size();i++){\\n switch(g[next[i]]){\\n case('S'):\\n dfs_k1(next[i],g,dis,sfound,1);\\n break;\\n case('s'):\\n sfound = 1;\\n case('.'):\\n dfs_k1(next[i],g,dis,sfound,Sfound);\\n break;\\n }\\n }\\n}\\n\\n\\n\\n\\nint main(){\\n cin >> H >> W;\\n vector<char> g;\\n g.resize(H*W);\\n dist.resize(H*W);\\n for(int i=0;i<H*W;i++){\\n cin >> g[i];\\n if(g[i]=='k')k=i;\\n if(g[i]=='K')K=i;\\n if(g[i]=='s')s=i;\\n if(g[i]=='S')S=i;\\n }\\n dfs_k1(K,g,0,0,0);\\n\\n g[k]='s';\\n g[s]='k';\\n g[S]='K';\\n g[K]='S';\\n int koukan;\\n koukan = s;\\n s=k;\\n k=koukan;\\n koukan=S;\\n S=K;\\n K=koukan;\\n\\n //cout << \\\"---------------------------\\\"<<endl;\\n dfs_k1(K,g,0,0,0);\\n\\n\\n if(M==10000)cout << \\\"CONTRACT\\\"<<endl;\\n else cout << M <<endl;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -1.9038,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_2319_3443152\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\nusing namespace std;\\nint H,W;\\nint M = 10000;\\nint s,S,k,K;\\nvector<int> dist;\\n\\n\\n\\n\\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\\n queue<int> que;\\n for(int i=0;i<H*W;i++){\\n dist[i] = 10000;\\n }\\n que.push(S);\\n dist[S] = dis;\\n while(!que.empty()){\\n int p = que.front();\\n //cout << \\\"p:\\\" << p << endl;\\n que.pop();\\n //cout << \\\"next_p:\\\" << que.front() << endl;\\n if(p==s-W){\\n int d = dist[p]+1;\\n if(p%W!=0 and g[s-1]=='a')d++;\\n if(p%W!=W-1 and g[s+1]=='a')d++;\\n if(p/W<H and g[s+W]=='a')d++;\\n if(d<M){\\n M=d;\\n }\\n continue;\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<s/W-1)next.push_back(p+W);\\n for(int i=0;i<next.size();i++){\\n int d = dist[p]+1;\\n switch(g[next[i]]){\\n case('.'):\\n if(dist[next[i]] > d){\\n dist[next[i]] = d;\\n que.push(next[i]);\\n }\\n break;\\n case('a'):\\n d++;\\n case('K'):\\n d++;\\n //cout << sfound <<endl;\\n if(sfound==1){\\n if(d<M)M=d;\\n return;\\n }\\n for(int j=0;j<H*W;j++){\\n if(g[j]=='a' and dist[j]>d){\\n dist[j] = d;\\n que.push(j);\\n }\\n if(g[j]=='K' and dist[j]>d){\\n dist[j] = d-1;\\n que.push(j);\\n }\\n }\\n break;\\n }\\n }\\n }\\n}\\n\\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\\n if(p/W >= s/W or M<=dis)return;\\n if(g[p]=='a' or g[p]=='S'){\\n g[p] = 'b';\\n if(out==1)M = dis;\\n if(out==0){\\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\\n }\\n }\\n if(g[p]=='.'){\\n g[p] = 'b';\\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\\n }\\n}\\n/*\\nvoid bfs_k1(vector<char> g){\\n int d=0;\\n queue<int> Q;\\n Q.push(K);\\n Q.push(-1);\\n while(!Q.empty()){\\n int p=Q.front();\\n Q.pop();\\n if(p==-1)d++;\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<k/W-1)next.push_back(p+W);\\n for(int i=0;i<next.size();i++){\\n if(g[next[i]]=='.')Q.push(next[i]);\\n if(next[i]==k-W){\\n limdis=d+8;\\n break;\\n }\\n }\\n }\\n}\\n*/\\n\\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\\n //if(dis>limdis)return;\\n if(p!=K)g[p]='a';\\n if(g[p+W]=='k'){\\n dis++;\\n for(int i=0;i<H*W;i++){\\n if(g[i]=='l')g[i]='.';\\n }\\n if(Sfound==0){\\n bfs_s2(g,dis,sfound);\\n //cout << sfound <<Sfound <<endl;\\n }\\n else if(sfound==1)dfs_s2(S,g,dis+4,0);\\n return;\\n }\\n dis++;\\n if(p/W<k/W-1){\\n switch(g[p+W]){\\n case('S'):\\n dfs_k1(p+W,g,dis,sfound,1);\\n break;\\n case('s'):\\n sfound = 1;\\n case('.'):\\n dfs_k1(p+W,g,dis,sfound,Sfound);\\n break;\\n }\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n int P=p+W;\\n while(P<H*W){\\n if(g[P]=='.')g[P]='l';\\n else break;\\n P += W;\\n }\\n for(int i=0;i<next.size();i++){\\n switch(g[next[i]]){\\n case('S'):\\n dfs_k1(next[i],g,dis,sfound,1);\\n break;\\n case('s'):\\n sfound = 1;\\n case('.'):\\n dfs_k1(next[i],g,dis,sfound,Sfound);\\n break;\\n }\\n }\\n}\\n\\n\\n\\n\\nint main(){\\n cin >> H >> W;\\n vector<char> g;\\n g.resize(H*W);\\n dist.resize(H*W);\\n for(int i=0;i<H*W;i++){\\n cin >> g[i];\\n if(g[i]=='k')k=i;\\n if(g[i]=='K')K=i;\\n if(g[i]=='s')s=i;\\n if(g[i]=='S')S=i;\\n }\\n dfs_k1(K,g,0,0,0);\\n\\n g[k]='s';\\n g[s]='k';\\n g[S]='K';\\n g[K]='S';\\n int koukan;\\n koukan = s;\\n s=k;\\n k=koukan;\\n koukan=S;\\n S=K;\\n K=koukan;\\n\\n //cout << \\\"---------------------------\\\"<<endl;\\n dfs_k1(K,g,0,0,0);\\n\\n\\n if(M==10000)cout << \\\"CONTRACT\\\"<<endl;\\n else cout << M <<endl;\\n}\",\n \"accuracy\": 0.8269230769230769,\n \"time_ms\": 860,\n \"memory_kb\": 3176,\n \"score_of_the_acc\": -1.9169,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2319_3443144\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\nusing namespace std;\\nint H,W;\\nint M = 10000;\\nint s,S,k,K;\\nvector<int> dist;\\n\\n\\n\\n\\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\\n queue<int> que;\\n for(int i=0;i<H*W;i++){\\n dist[i] = 10000;\\n }\\n que.push(S);\\n dist[S] = dis;\\n while(!que.empty()){\\n int p = que.front();\\n //cout << \\\"p:\\\" << p << endl;\\n que.pop();\\n //cout << \\\"next_p:\\\" << que.front() << endl;\\n if(p==s-W){\\n int d = dist[p]+1;\\n if(p%W!=0 and g[s-1]=='a')d++;\\n if(p%W!=W-1 and g[s+1]=='a')d++;\\n if(p/W<H and g[s+W]=='a')d++;\\n if(d<M){\\n M=d;\\n }\\n continue;\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<s/W-1)next.push_back(p+W);\\n for(int i=0;i<next.size();i++){\\n int d = dist[p]+1;\\n switch(g[next[i]]){\\n case('.'):\\n if(dist[next[i]] > d){\\n dist[next[i]] = d;\\n que.push(next[i]);\\n }\\n break;\\n case('a'):\\n d++;\\n case('K'):\\n d++;\\n //cout << sfound <<endl;\\n if(sfound==1){\\n if(d<M)M=d;\\n return;\\n }\\n for(int j=0;j<H*W;j++){\\n if(g[j]=='a' and dist[j]>d){\\n dist[j] = d;\\n que.push(j);\\n }\\n if(g[j]=='K' and dist[j]>d){\\n dist[j] = d;\\n que.push(j);\\n }\\n }\\n break;\\n }\\n }\\n }\\n}\\n\\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\\n if(p/W >= s/W or M<=dis)return;\\n if(g[p]=='a' or g[p]=='S'){\\n g[p] = 'b';\\n if(out==1)M = dis;\\n if(out==0){\\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\\n }\\n }\\n if(g[p]=='.'){\\n g[p] = 'b';\\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\\n }\\n}\\n/*\\nvoid bfs_k1(vector<char> g){\\n int d=0;\\n queue<int> Q;\\n Q.push(K);\\n Q.push(-1);\\n while(!Q.empty()){\\n int p=Q.front();\\n Q.pop();\\n if(p==-1)d++;\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<k/W-1)next.push_back(p+W);\\n for(int i=0;i<next.size();i++){\\n if(g[next[i]]=='.')Q.push(next[i]);\\n if(next[i]==k-W){\\n limdis=d+8;\\n break;\\n }\\n }\\n }\\n}\\n*/\\n\\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\\n //if(dis>limdis)return;\\n if(p!=K)g[p]='a';\\n if(g[p+W]=='k'){\\n dis++;\\n for(int i=0;i<H*W;i++){\\n if(g[i]=='l')g[i]='.';\\n }\\n if(Sfound==0){\\n bfs_s2(g,dis,sfound);\\n //cout << sfound <<Sfound <<endl;\\n }\\n else if(sfound==1)dfs_s2(S,g,dis+4,0);\\n return;\\n }\\n dis++;\\n if(p/W<k/W-1){\\n switch(g[p+W]){\\n case('S'):\\n dfs_k1(p+W,g,dis,sfound,1);\\n break;\\n case('s'):\\n sfound = 1;\\n case('.'):\\n dfs_k1(p+W,g,dis,sfound,Sfound);\\n break;\\n }\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n int P=p+W;\\n while(P<H*W){\\n if(g[P]=='.')g[P]='l';\\n else break;\\n P += W;\\n }\\n for(int i=0;i<next.size();i++){\\n switch(g[next[i]]){\\n case('S'):\\n dfs_k1(next[i],g,dis,sfound,1);\\n break;\\n case('s'):\\n sfound = 1;\\n case('.'):\\n dfs_k1(next[i],g,dis,sfound,Sfound);\\n break;\\n }\\n }\\n}\\n\\n\\n\\n\\nint main(){\\n cin >> H >> W;\\n vector<char> g;\\n g.resize(H*W);\\n dist.resize(H*W);\\n for(int i=0;i<H*W;i++){\\n cin >> g[i];\\n if(g[i]=='k')k=i;\\n if(g[i]=='K')K=i;\\n if(g[i]=='s')s=i;\\n if(g[i]=='S')S=i;\\n }\\n dfs_k1(K,g,0,0,0);\\n\\n g[k]='s';\\n g[s]='k';\\n g[S]='K';\\n g[K]='S';\\n int koukan;\\n koukan = s;\\n s=k;\\n k=koukan;\\n koukan=S;\\n S=K;\\n K=koukan;\\n\\n //cout << \\\"---------------------------\\\"<<endl;\\n dfs_k1(K,g,0,0,0);\\n\\n\\n if(M==10000)cout << \\\"CONTRACT\\\"<<endl;\\n else cout << M <<endl;\\n}\",\n \"accuracy\": 0.5576923076923077,\n \"time_ms\": 860,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -1.9134,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_2319_3397149\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\nusing namespace std;\\nint H,W;\\nint M = 10000;\\nint s,S,k,K;\\nqueue<int> que;\\nvector<int> dist;\\n\\n\\n\\n\\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\\n for(int i=0;i<H*W;i++){\\n dist[i] = 10000;\\n }\\n que.push(S);\\n dist[S] = dis;\\n while(!que.empty()){\\n int p = que.front();\\n que.pop();\\n if(g[p+W]=='s'){\\n if(dist[p]+1<M){\\n M=dist[p]+1;\\n }\\n continue;\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<s/W-1)next.push_back(p+W);\\n for(int i=0;i<next.size();i++){\\n int d = dist[p]+1;\\n switch(g[next[i]]){\\n case('.'):\\n if(dist[next[i]] > d){\\n dist[next[i]] = d;\\n que.push(next[i]);\\n }\\n break;\\n case('a'):\\n d++;\\n case('K'):\\n d++;\\n if(sfound==1){\\n if(d<M)M=d;\\n return;\\n }\\n for(int j=0;j<H*W;j++){\\n if(g[j]=='a' and dist[j]>d){\\n dist[j] = d;\\n que.push(j);\\n }\\n if(g[j]=='K' and dist[j]>d){\\n dist[j] = d;\\n que.push(j);\\n }\\n }\\n break;\\n }\\n }\\n }\\n /*\\n for(int i=0;i<H;i++){\\n for(int j=0;j<W;j++){\\n cout << dist[i*W+j] << \\\" \\\";\\n }\\n cout << endl;\\n }\\n */\\n}\\n\\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\\n if(p/W >= s/W or M<=dis)return;\\n if(g[p]=='a' or g[p]=='S'){\\n g[p] = 'b';\\n if(out==1)M = dis;\\n if(out==0){\\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\\n }\\n }\\n if(g[p]=='.'){\\n g[p] = 'b';\\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\\n }\\n}\\n\\n\\n\\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\\n if(p!=K)g[p]='a';\\n if(g[p+W]=='k'){\\n dis++;\\n if(Sfound==0)bfs_s2(g,dis,sfound);\\n else if(sfound==1)dfs_s2(S,g,dis+4,0);\\n return;\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<k/W-1)next.push_back(p+W);\\n dis++;\\n for(int i=0;i<next.size();i++){\\n switch(g[next[i]]){\\n case('S'):\\n dfs_k1(next[i],g,dis,sfound,1);\\n break;\\n case('s'):\\n sfound = 1;\\n case('.'):\\n dfs_k1(next[i],g,dis,sfound,Sfound);\\n break;\\n }\\n }\\n}\\n\\n\\n\\nint main(){\\n cin >> H >> W;\\n vector<char> g;\\n g.resize(H*W);\\n dist.resize(H*W);\\n for(int i=0;i<H*W;i++){\\n cin >> g[i];\\n if(g[i]=='k')k=i;\\n if(g[i]=='K')K=i;\\n if(g[i]=='s')s=i;\\n if(g[i]=='S')S=i;\\n }\\n\\n dfs_k1(K,g,0,0,0);\\n\\n g[k]='s';\\n g[s]='k';\\n g[S]='K';\\n g[K]='S';\\n int koukan;\\n koukan = s;\\n s=k;\\n k=koukan;\\n koukan=S;\\n S=K;\\n K=koukan;\\n\\n\\n dfs_k1(K,g,0,0,0);\\n\\n\\n if(M==10000)cout << \\\"CONTRACT\\\"<<endl;\\n else cout << M <<endl;\\n}\",\n \"accuracy\": 0.4423076923076923,\n \"time_ms\": 90,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.999,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_2319_3397130\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\nusing namespace std;\\nint H,W;\\nint M = 10000;\\nint s,S,k,K;\\nqueue<int> que;\\nvector<int> dist;\\n\\n\\n\\n\\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\\n for(int i=0;i<H*W;i++){\\n dist[i] = 10000;\\n }\\n que.push(S);\\n dist[S] = dis;\\n while(!que.empty()){\\n int p = que.front();\\n que.pop();\\n if(g[p+W]=='s'){\\n if(dist[p]+1<M){\\n M=dist[p]+1;\\n }\\n continue;\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<k/W-1)next.push_back(p+W);\\n for(int i=0;i<next.size();i++){\\n int d = dist[p]+1;\\n switch(g[next[i]]){\\n case('.'):\\n if(dist[next[i]] > d){\\n dist[next[i]] = d;\\n que.push(next[i]);\\n }\\n break;\\n case('a'):\\n d++;\\n case('K'):\\n d++;\\n if(sfound==1){\\n if(d<M)M=d;\\n return;\\n }\\n for(int j=0;j<H*W;j++){\\n if(g[j]=='a' and dist[j]>d){\\n dist[j] = d;\\n que.push(j);\\n }\\n if(g[j]=='K' and dist[j]>d){\\n dist[j] = d;\\n que.push(j);\\n }\\n }\\n break;\\n }\\n }\\n }\\n}\\n\\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\\n if(p/W >= s/W or M<=dis)return;\\n if(g[p]=='a' or g[p]=='S'){\\n g[p] = 'b';\\n if(out==1)M = dis;\\n if(out==0){\\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\\n }\\n }\\n if(g[p]=='.'){\\n g[p] = 'b';\\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\\n }\\n}\\n\\n\\n\\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\\n if(p!=K)g[p]='a';\\n if(g[p+W]=='k'){\\n dis++;\\n if(Sfound==0)bfs_s2(g,dis,sfound);\\n else if(sfound==1)dfs_s2(S,g,dis+4,0);\\n return;\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<k/W-1)next.push_back(p+W);\\n dis++;\\n for(int i=0;i<next.size();i++){\\n switch(g[next[i]]){\\n case('S'):\\n dfs_k1(next[i],g,dis,sfound,1);\\n break;\\n case('s'):\\n sfound = 1;\\n case('.'):\\n dfs_k1(next[i],g,dis,sfound,Sfound);\\n break;\\n }\\n }\\n}\\n\\n\\n\\nint main(){\\n cin >> H >> W;\\n vector<char> g;\\n g.resize(H*W);\\n dist.resize(H*W);\\n for(int i=0;i<H*W;i++){\\n cin >> g[i];\\n if(g[i]=='k')k=i;\\n if(g[i]=='K')K=i;\\n if(g[i]=='s')s=i;\\n if(g[i]=='S')S=i;\\n }\\n\\n dfs_k1(K,g,0,0,0);\\n\\n g[k]='s';\\n g[s]='k';\\n g[S]='K';\\n g[K]='S';\\n int koukan;\\n koukan = s;\\n s=k;\\n k=koukan;\\n koukan=S;\\n S=K;\\n K=koukan;\\n\\n\\n dfs_k1(K,g,0,0,0);\\n\\n\\n if(M==10000)cout << \\\"CONTRACT\\\"<<endl;\\n else cout << M <<endl;\\n}\",\n \"accuracy\": 0.38461538461538464,\n \"time_ms\": 90,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.999,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_2319_3393745\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<queue>\\nusing namespace std;\\nint H,W;\\nint M = 10000;\\nint s,S,k,K;\\nqueue<int> que;\\nvector<int> dist;\\n\\n\\n\\n\\nvoid bfs_s2(vector<char> g,int dis,bool sfound){\\n for(int i=0;i<H*W;i++){\\n dist[i] = 10000;\\n }\\n que.push(S);\\n dist[S] = dis;\\n while(!que.empty()){\\n int p = que.front();\\n que.pop();\\n if(g[p+W]=='s'){\\n if(dist[p]+1<M){\\n M=dist[p]+1;\\n }\\n continue;\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<k/W-1)next.push_back(p+W);\\n for(int i=0;i<next.size();i++){\\n int d = dist[p]+1;\\n switch(g[next[i]]){\\n case('.'):\\n if(dist[next[i]] > d){\\n dist[next[i]] = d;\\n que.push(next[i]);\\n }\\n break;\\n case('a'):\\n d++;\\n case('K'):\\n d++;\\n if(sfound==1){\\n if(d<M)M=d;\\n return;\\n }\\n for(int j=0;j<H*W;j++){\\n if(g[j]=='a' and dist[j]>d){\\n dist[j] = d;\\n que.push(j);\\n }\\n if(g[j]=='K' and dist[j]>d){\\n dist[j] = d;\\n que.push(j);\\n }\\n }\\n break;\\n }\\n }\\n }\\n}\\n\\nvoid dfs_s2(int p,vector<char> g,int dis,bool out){\\n if(p/W >= s/W or M<=dis)return;\\n if(g[p]=='a' or g[p]=='S'){\\n g[p] = 'b';\\n if(out==1)M = dis;\\n if(out==0){\\n if(p%W!=0)dfs_s2(p-1,g,dis,0);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis,0);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis,0);\\n }\\n }\\n if(g[p]=='.'){\\n g[p] = 'b';\\n if(p%W!=0)dfs_s2(p-1,g,dis+1,1);\\n if(p%W!=W-1)dfs_s2(p+1,g,dis+1,1);\\n if(p/W<s/W-1)dfs_s2(p+W,g,dis+1,1);\\n }\\n}\\n\\n\\n\\nvoid dfs_k1(int p,vector<char> g,int dis,bool sfound,bool Sfound){\\n if(p!=K)g[p]='a';\\n if(g[p+W]=='k'){\\n dis++;\\n if(Sfound==0)bfs_s2(g,dis,sfound);\\n else if(sfound==1){\\n dfs_s2(S,g,dis+4,0);\\n }\\n return;\\n }\\n vector<int> next;\\n if(p%W!=0)next.push_back(p-1);\\n if(p%W!=W-1)next.push_back(p+1);\\n if(p/W<k/W-1)next.push_back(p+W);\\n dis++;\\n for(int i=0;i<next.size();i++){\\n switch(g[next[i]]){\\n case('S'):\\n Sfound = 1;\\n dfs_k1(next[i],g,dis,sfound,Sfound);\\n break;\\n case('s'):\\n sfound = 1;\\n case('.'):\\n dfs_k1(next[i],g,dis,sfound,Sfound);\\n break;\\n }\\n }\\n}\\n\\n\\n\\nint main(){\\n cin >> H >> W;\\n vector<char> g;\\n g.resize(H*W);\\n dist.resize(H*W);\\n for(int i=0;i<H*W;i++){\\n cin >> g[i];\\n if(g[i]=='k')k=i;\\n if(g[i]=='K')K=i;\\n if(g[i]=='s')s=i;\\n if(g[i]=='S')S=i;\\n }\\n\\n dfs_k1(K,g,0,0,0);\\n\\n g[k]='s';\\n g[s]='k';\\n g[S]='K';\\n g[K]='S';\\n int koukan;\\n koukan = s;\\n s=k;\\n k=koukan;\\n koukan=S;\\n S=K;\\n K=koukan;\\n\\n\\n dfs_k1(K,g,0,0,0);\\n\\n\\n if(M==10000)cout << \\\"CONTRACT\\\"<<endl;\\n else cout << M <<endl;\\n}\",\n \"accuracy\": 0.3076923076923077,\n \"time_ms\": 70,\n \"memory_kb\": 3172,\n \"score_of_the_acc\": -0.9752,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_2319_1173977\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[12][12];\\nint dp[12][12][12][12][4];\\nint H,W;\\nint sr,sc,kr,kc,SR,SC,KR,KC;\\ninline int ABS(int a){return max(a,-a);}\\ninline void upd(int a,int b,int c,int d,int e){\\n\\tif(a>=sr){\\n\\t\\tif(a>=kr)return;\\n\\t\\tif(a+1<KR)dp[a+1][11][11][b][e|2]=min(dp[a+1][11][11][b][e|2],dp[a][b][c][d][e]);\\n\\t\\telse if(a+1==KR)dp[a+1][11][KC][b][e|2]=min(dp[a+1][11][KC][b][e|2],dp[a][b][c][d][e]);\\n\\t\\telse{\\n\\t\\t\\tfor(int y=0;y<W;y++){\\n\\t\\t\\t\\tbool d2=false;\\n\\t\\t\\t\\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\\n\\t\\t\\t\\tif(str[a+1][y]=='#')d2=true;\\n\\t\\t\\t\\tif(a+1==kr&&kc!=y)d2=true;\\n\\t\\t\\t\\tif(d2)continue;\\n\\t\\t\\t\\tint x=b;\\n\\t\\t\\t\\tint ks=0;\\n\\t\\t\\t\\tint vt=0;\\n\\t\\t\\t\\tfor(int z=min(y,c);z<max(y,c);z++){\\n\\t\\t\\t\\t\\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\\n\\t\\t\\t\\t\\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\\n\\t\\t\\t\\t\\tif(!iL&&!iR)ks++;\\n\\t\\t\\t\\t\\telse if(!(iL&&iR)){\\n\\t\\t\\t\\t\\t\\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\\n\\t\\t\\t\\t\\t//\\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\\n\\t\\t\\t\\t\\t\\telse ks+=2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(d!=11&&a>KR&&a<=sr&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\\n\\t\\t\\t\\t\\tif(a-1==SR&&c==SC)ks--;\\n\\t\\t\\t\\t\\telse if(a-1==sr&&c==sc)ks--;\\n\\t\\t\\t\\t\\telse ks-=2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\\n\\t\\t\\t\\telse ks++;\\n\\t\\t\\t\\tif(d!=11&&a>KR&&a<=sr&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\t\\tint te=e;\\n\\t\\t\\t\\tif(c<min(b,x)||max(b,x)<c)te|=2;\\n\\t\\t\\t\\tif(b<min(c,y)||max(c,y)<b)te|=1;\\n\\t\\t\\t\\tdp[a+1][11][y][b][te]=min(dp[a+1][11][y][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\tfor(int x=0;x<W;x++){\\n\\t\\tbool d1=false;\\n\\t\\tfor(int z=min(x,b);z<=max(x,b);z++)if(str[a][z]=='#')d1=true;\\n\\t\\tif(str[a+1][x]=='#')d1=true;\\n\\t\\tif(a+1==sr&&sc!=x)d1=true;\\n\\t\\t\\n\\t\\tif(d1)continue;\\n\\t\\tif(a<KR){\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tif(a+1==KR)dp[a+1][x][KC][b][e|1]=min(dp[a+1][x][KC][b][e|1],dp[a][b][c][d][e]+ks);\\n\\t\\t\\telse dp[a+1][x][11][b][e|1]=min(dp[a+1][x][11][b][e|1],dp[a][b][c][d][e]+ks);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tif(a>=kr){\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tif(a==kr&&min(b,x)<=c&&c<=max(b,x))ks++;\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\\n\\t\\t\\t\\tif(a-1==SR&&c==SC)ks--;\\n\\t\\t\\t\\telse if(a-1==sr&&c==sc)ks--;\\n\\t\\t\\t\\telse ks-=2;\\n\\t\\t\\t}\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\tint te=e|1;\\n\\t\\t\\tif(a==kr&&(c<min(b,x)||max(b,x)<c))te|=2;\\n\\t\\t\\tdp[a+1][x][11][b][te]=min(dp[a+1][x][11][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tfor(int y=0;y<W;y++){\\n\\t\\t\\tbool d2=false;\\n\\t\\t\\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\\n\\t\\t\\tif(str[a+1][y]=='#')d2=true;\\n\\t\\t\\tif(a+1==kr&&kc!=y)d2=true;\\n\\t\\t\\tif(a==SR&&a==KR&&min(b,x)<=c&&c<=max(b,x)&&min(c,y)<=b&&b<=max(c,y))continue;\\n\\t\\t\\tif(d2)continue;\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tint vt=0;\\n\\t\\t\\tfor(int z=min(y,c);z<max(y,c);z++){\\n\\t\\t\\t\\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\\n\\t\\t\\t\\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\\n\\t\\t\\t\\tif(!iL&&!iR)ks++;\\n\\t\\t\\t\\telse if(!(iL&&iR)){\\n\\t\\t\\t\\t\\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\\n\\t\\t\\t//\\t\\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\\n\\t\\t\\t\\t\\telse ks+=2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\\n\\t\\t\\t\\tif(a-1==SR&&c==SC)ks--;\\n\\t\\t\\t\\telse if(a-1==sr&&c==sc)ks--;\\n\\t\\t\\t\\telse ks-=2;\\n\\t\\t\\t}\\n\\t\\t\\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\\n\\t\\t\\telse ks++;\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\tint te=e;\\n\\t\\t\\tif(c<min(b,x)||max(b,x)<c)te|=2;\\n\\t\\t\\tif(b<min(c,y)||max(c,y)<b)te|=1;\\n\\t\\t//\\tif(a==sr)te|=2;\\n\\t\\t//\\tif(a==kr)te|=1;\\n\\t\\t//\\tprintf(\\\"%d %d %d %d %d -> %d %d %d %d %d: %d\\\\n\\\",a,b,c,d,e,a+1,x,y,b,te,ks);\\n\\t\\t\\tdp[a+1][x][y][b][te]=min(dp[a+1][x][y][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t}\\n\\t}\\n}\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tH=a;W=b;\\n\\tfor(int i=0;i<a;i++)scanf(\\\"%s\\\",str[i]);\\n\\tfor(int i=0;i<12;i++)for(int j=0;j<12;j++)for(int k=0;k<12;k++)for(int l=0;l<12;l++)\\n\\t\\tdp[i][j][k][l][0]=dp[i][j][k][l][1]=dp[i][j][k][l][2]=dp[i][j][k][l][3]=99999999;\\n\\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\\n\\t\\tif(str[i][j]=='s'){sr=i;sc=j;}\\n\\t\\tif(str[i][j]=='k'){kr=i;kc=j;}\\n\\t\\tif(str[i][j]=='S'){SR=i;SC=j;}\\n\\t\\tif(str[i][j]=='K'){KR=i;KC=j;}\\n\\t}\\n\\tif(SR>KR){\\n\\t\\tswap(SR,KR);\\n\\t\\tswap(SC,KC);\\n\\t\\tswap(sr,kr);\\n\\t\\tswap(sc,kc);\\n\\t}\\n\\tif(SR==KR){\\n\\t\\tdp[SR][SC][KC][11][0]=0;\\n\\t}else if(SR<KR){\\n\\t\\tdp[SR][SC][11][11][1]=0;\\n\\t}else{\\n\\t\\tdp[SR][SC][11][11][2]=0;\\n\\t}\\n\\tint ret=99999999;\\n\\tfor(int i=0;i<a;i++){\\n\\t\\tfor(int j=0;j<12;j++){\\n\\t\\t\\tfor(int k=0;k<12;k++){\\n\\t\\t\\t\\tfor(int l=0;l<12;l++){\\n\\t\\t\\t\\t\\tfor(int m=0;m<4;m++){\\n\\t\\t\\t\\t\\t\\tif(dp[i][j][k][l][m]>999999)continue;\\n\\t\\t\\t\\t\\t\\t//printf(\\\"%d %d %d %d %d: %d\\\\n\\\",i,j,k,l,m,dp[i][j][k][l][m]);\\n\\t\\t\\t\\t\\t\\tint t=0;\\n\\t\\t\\t\\t\\t\\tif(j==11)t|=2;\\n\\t\\t\\t\\t\\t\\tif(k==11)t|=1;\\n\\t\\t\\t\\t\\t\\tif(j<W&&k<W&&k!=j)t|=3;\\n\\t\\t\\t\\t\\t\\tif(i>=max(sr,kr)&&(m|t)==3)ret=min(ret,dp[i][j][k][l][m]);\\n\\t\\t\\t\\t\\t\\telse upd(i,j,k,l,m);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(SR>=sr||KR>=kr)ret=999999999;\\n\\tif(ret>999999)printf(\\\"CONTRACT\\\\n\\\");\\n\\telse printf(\\\"%d\\\\n\\\",ret);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 1356,\n \"score_of_the_acc\": -0.4153,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_2319_1173958\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[12][12];\\nint dp[12][12][12][12][4];\\nint H,W;\\nint sr,sc,kr,kc,SR,SC,KR,KC;\\ninline int ABS(int a){return max(a,-a);}\\ninline void upd(int a,int b,int c,int d,int e){\\n\\tif(a>=sr){\\n\\t\\tif(a>=kr)return;\\n\\t\\tif(a+1<KR)dp[a+1][11][11][b][e|2]=min(dp[a+1][11][11][b][e|2],dp[a][b][c][d][e]);\\n\\t\\telse if(a+1==KR)dp[a+1][11][KC][b][e|2]=min(dp[a+1][11][KC][b][e|2],dp[a][b][c][d][e]);\\n\\t\\telse{\\n\\t\\t\\tfor(int y=0;y<W;y++){\\n\\t\\t\\t\\tbool d2=false;\\n\\t\\t\\t\\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\\n\\t\\t\\t\\tif(str[a+1][y]=='#')d2=true;\\n\\t\\t\\t\\tif(a+1==kr&&kc!=y)d2=true;\\n\\t\\t\\t\\tif(d2)continue;\\n\\t\\t\\t\\tint x=b;\\n\\t\\t\\t\\tint ks=0;\\n\\t\\t\\t\\tint vt=0;\\n\\t\\t\\t\\tfor(int z=min(y,c);z<max(y,c);z++){\\n\\t\\t\\t\\t\\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\\n\\t\\t\\t\\t\\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\\n\\t\\t\\t\\t\\tif(!iL&&!iR)ks++;\\n\\t\\t\\t\\t\\telse if(!(iL&&iR)){\\n\\t\\t\\t\\t\\t\\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\\n\\t\\t\\t\\t\\t\\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\\n\\t\\t\\t\\t\\t\\telse ks+=2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\\n\\t\\t\\t\\t\\tif(a-1==SR&&c==SC)ks--;\\n\\t\\t\\t\\t\\telse if(a-1==sr&&c==sc)ks--;\\n\\t\\t\\t\\t\\telse ks-=2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\\n\\t\\t\\t\\telse ks++;\\n\\t\\t\\t\\tif(d!=11&&a>KR&&a<=sr&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\t\\tint te=e;\\n\\t\\t\\t\\tif(c<min(b,x)||max(b,x)<c)te|=2;\\n\\t\\t\\t\\tif(b<min(c,y)||max(c,y)<b)te|=1;\\n\\t\\t\\t\\tdp[a+1][11][y][b][te]=min(dp[a+1][11][y][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int x=0;x<W;x++){\\n\\t\\tbool d1=false;\\n\\t\\tfor(int z=min(x,b);z<=max(x,b);z++)if(str[a][z]=='#')d1=true;\\n\\t\\tif(str[a+1][x]=='#')d1=true;\\n\\t\\tif(a+1==sr&&sc!=x)d1=true;\\n\\t\\t\\n\\t\\tif(d1)continue;\\n\\t\\tif(a<KR){\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tif(a+1==KR)dp[a+1][x][KC][b][e|1]=min(dp[a+1][x][KC][b][e|1],dp[a][b][c][d][e]+ks);\\n\\t\\t\\telse dp[a+1][x][11][b][e|1]=min(dp[a+1][x][11][b][e|1],dp[a][b][c][d][e]+ks);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tif(a>=kr){\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tif(a==kr&&min(b,x)<=c&&c<=max(b,x))ks++;\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\\n\\t\\t\\t\\tif(a-1==SR&&c==SC)ks--;\\n\\t\\t\\t\\telse if(a-1==sr&&c==sc)ks--;\\n\\t\\t\\t\\telse ks-=2;\\n\\t\\t\\t}\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\tint te=e|1;\\n\\t\\t\\tif(a==kr&&(c<min(b,x)||max(b,x)<c))te|=2;\\n\\t\\t\\tdp[a+1][x][11][b][te]=min(dp[a+1][x][11][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tfor(int y=0;y<W;y++){\\n\\t\\t\\tbool d2=false;\\n\\t\\t\\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\\n\\t\\t\\tif(str[a+1][y]=='#')d2=true;\\n\\t\\t\\tif(a+1==kr&&kc!=y)d2=true;\\n\\t\\t\\tif(a==SR&&a==KR&&min(b,x)<=c&&c<=max(b,x)&&min(c,y)<=b&&b<=max(c,y))continue;\\n\\t\\t\\tif(d2)continue;\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tint vt=0;\\n\\t\\t\\tfor(int z=min(y,c);z<max(y,c);z++){\\n\\t\\t\\t\\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\\n\\t\\t\\t\\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\\n\\t\\t\\t\\tif(!iL&&!iR)ks++;\\n\\t\\t\\t\\telse if(!(iL&&iR)){\\n\\t\\t\\t\\t\\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\\n\\t\\t\\t\\t\\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\\n\\t\\t\\t\\t\\telse ks+=2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\\n\\t\\t\\t\\tif(a-1==SR&&c==SC)ks--;\\n\\t\\t\\t\\telse if(a-1==sr&&c==sc)ks--;\\n\\t\\t\\t\\telse ks-=2;\\n\\t\\t\\t}\\n\\t\\t\\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\\n\\t\\t\\telse ks++;\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\tint te=e;\\n\\t\\t\\tif(c<min(b,x)||max(b,x)<c)te|=2;\\n\\t\\t\\tif(b<min(c,y)||max(c,y)<b)te|=1;\\n\\t\\t//\\tif(a==sr)te|=2;\\n\\t\\t//\\tif(a==kr)te|=1;\\n\\t\\t//\\tprintf(\\\"%d %d %d %d %d -> %d %d %d %d %d: %d\\\\n\\\",a,b,c,d,e,a+1,x,y,b,te,ks);\\n\\t\\t\\tdp[a+1][x][y][b][te]=min(dp[a+1][x][y][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t}\\n\\t}\\n}\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tH=a;W=b;\\n\\tfor(int i=0;i<a;i++)scanf(\\\"%s\\\",str[i]);\\n\\tfor(int i=0;i<12;i++)for(int j=0;j<12;j++)for(int k=0;k<12;k++)for(int l=0;l<12;l++)\\n\\t\\tdp[i][j][k][l][0]=dp[i][j][k][l][1]=dp[i][j][k][l][2]=dp[i][j][k][l][3]=99999999;\\n\\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\\n\\t\\tif(str[i][j]=='s'){sr=i;sc=j;}\\n\\t\\tif(str[i][j]=='k'){kr=i;kc=j;}\\n\\t\\tif(str[i][j]=='S'){SR=i;SC=j;}\\n\\t\\tif(str[i][j]=='K'){KR=i;KC=j;}\\n\\t}\\n\\tif(SR>KR){\\n\\t\\tswap(SR,KR);\\n\\t\\tswap(SC,KC);\\n\\t\\tswap(sr,kr);\\n\\t\\tswap(sc,kc);\\n\\t}\\n\\tif(SR==KR){\\n\\t\\tdp[SR][SC][KC][11][0]=0;\\n\\t}else if(SR<KR){\\n\\t\\tdp[SR][SC][11][11][1]=0;\\n\\t}else{\\n\\t\\tdp[SR][SC][11][11][2]=0;\\n\\t}\\n\\tint ret=99999999;\\n\\tfor(int i=0;i<a;i++){\\n\\t\\tfor(int j=0;j<12;j++){\\n\\t\\t\\tfor(int k=0;k<12;k++){\\n\\t\\t\\t\\tfor(int l=0;l<12;l++){\\n\\t\\t\\t\\t\\tfor(int m=0;m<4;m++){\\n\\t\\t\\t\\t\\t\\tif(dp[i][j][k][l][m]>999999)continue;\\n\\t\\t\\t\\t\\t//\\tprintf(\\\"%d %d %d %d %d: %d\\\\n\\\",i,j,k,l,m,dp[i][j][k][l][m]);\\n\\t\\t\\t\\t\\t\\tint t=0;\\n\\t\\t\\t\\t\\t\\tif(j==11)t|=2;\\n\\t\\t\\t\\t\\t\\tif(k==11)t|=1;\\n\\t\\t\\t\\t\\t\\tif(j<W&&k<W&&k!=j)t|=3;\\n\\t\\t\\t\\t\\t\\tif(i>=max(sr,kr)&&(m|t)==3)ret=min(ret,dp[i][j][k][l][m]);\\n\\t\\t\\t\\t\\t\\telse upd(i,j,k,l,m);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(SR>=sr||KR>=kr)ret=999999999;\\n\\tif(ret>999999)printf(\\\"CONTRACT\\\\n\\\");\\n\\telse printf(\\\"%d\\\\n\\\",ret);\\n}\",\n \"accuracy\": 0.5961538461538461,\n \"time_ms\": 40,\n \"memory_kb\": 1352,\n \"score_of_the_acc\": -0.4141,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_2319_1173956\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[12][12];\\nint dp[12][12][12][12][4];\\nint H,W;\\nint sr,sc,kr,kc,SR,SC,KR,KC;\\ninline int ABS(int a){return max(a,-a);}\\ninline void upd(int a,int b,int c,int d,int e){\\n\\tif(a>=sr){\\n\\t\\tif(a>=kr)return;\\n\\t\\tif(a+1<KR)dp[a+1][11][11][b][e|2]=min(dp[a+1][11][11][b][e|2],dp[a][b][c][d][e]);\\n\\t\\telse if(a+1==KR)dp[a+1][11][KC][b][e|2]=min(dp[a+1][11][KC][b][e|2],dp[a][b][c][d][e]);\\n\\t\\telse{\\n\\t\\t\\tfor(int y=0;y<W;y++){\\n\\t\\t\\t\\tbool d2=false;\\n\\t\\t\\t\\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\\n\\t\\t\\t\\tif(str[a+1][y]=='#')d2=true;\\n\\t\\t\\t\\tif(a+1==kr&&kc!=y)d2=true;\\n\\t\\t\\t\\tif(d2)continue;\\n\\t\\t\\t\\tint x=b;\\n\\t\\t\\t\\tint ks=0;\\n\\t\\t\\t\\tint vt=0;\\n\\t\\t\\t\\tfor(int z=min(y,c);z<max(y,c);z++){\\n\\t\\t\\t\\t\\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\\n\\t\\t\\t\\t\\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\\n\\t\\t\\t\\t\\tif(!iL&&!iR)ks++;\\n\\t\\t\\t\\t\\telse if(!(iL&&iR)){\\n\\t\\t\\t\\t\\t\\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\\n\\t\\t\\t\\t\\t\\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\\n\\t\\t\\t\\t\\t\\telse ks+=2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\\n\\t\\t\\t\\t\\tif(a-1==SR&&c==SC)ks--;\\n\\t\\t\\t\\t\\telse ks-=2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\\n\\t\\t\\t\\telse ks++;\\n\\t\\t\\t\\tif(d!=11&&a>KR&&a<=sr&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\t\\tint te=e;\\n\\t\\t\\t\\tif(c<min(b,x)||max(b,x)<c)te|=2;\\n\\t\\t\\t\\tif(b<min(c,y)||max(c,y)<b)te|=1;\\n\\t\\t\\t\\tdp[a+1][11][y][b][te]=min(dp[a+1][11][y][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int x=0;x<W;x++){\\n\\t\\tbool d1=false;\\n\\t\\tfor(int z=min(x,b);z<=max(x,b);z++)if(str[a][z]=='#')d1=true;\\n\\t\\tif(str[a+1][x]=='#')d1=true;\\n\\t\\tif(a+1==sr&&sc!=x)d1=true;\\n\\t\\t\\n\\t\\tif(d1)continue;\\n\\t\\tif(a<KR){\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tif(a+1==KR)dp[a+1][x][KC][b][e|1]=min(dp[a+1][x][KC][b][e|1],dp[a][b][c][d][e]+ks);\\n\\t\\t\\telse dp[a+1][x][11][b][e|1]=min(dp[a+1][x][11][b][e|1],dp[a][b][c][d][e]+ks);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tif(a>=kr){\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tif(a==kr&&min(b,x)<=c&&c<=max(b,x))ks++;\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\\n\\t\\t\\t\\tif(a-1==SR&&c==SC)ks--;\\n\\t\\t\\t\\telse ks-=2;\\n\\t\\t\\t}\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\tint te=e|1;\\n\\t\\t\\tif(a==kr&&(c<min(b,x)||max(b,x)<c))te|=2;\\n\\t\\t\\tdp[a+1][x][11][b][te]=min(dp[a+1][x][11][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tfor(int y=0;y<W;y++){\\n\\t\\t\\tbool d2=false;\\n\\t\\t\\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\\n\\t\\t\\tif(str[a+1][y]=='#')d2=true;\\n\\t\\t\\tif(a+1==kr&&kc!=y)d2=true;\\n\\t\\t\\tif(a==SR&&a==KR&&min(b,x)<=c&&c<=max(b,x)&&min(c,y)<=b&&b<=max(c,y))continue;\\n\\t\\t\\tif(d2)continue;\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tint vt=0;\\n\\t\\t\\tfor(int z=min(y,c);z<max(y,c);z++){\\n\\t\\t\\t\\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\\n\\t\\t\\t\\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\\n\\t\\t\\t\\tif(!iL&&!iR)ks++;\\n\\t\\t\\t\\telse if(!(iL&&iR)){\\n\\t\\t\\t\\t\\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\\n\\t\\t\\t\\t\\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\\n\\t\\t\\t\\t\\telse ks+=2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x)){\\n\\t\\t\\t\\tif(a-1==SR&&c==SC)ks--;\\n\\t\\t\\t\\telse ks-=2;\\n\\t\\t\\t}\\n\\t\\t\\tif((SR!=a||y!=SC)&&min(b,x)<=y&&y<=max(b,x))ks+=2;\\n\\t\\t\\telse ks++;\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\tint te=e;\\n\\t\\t\\tif(c<min(b,x)||max(b,x)<c)te|=2;\\n\\t\\t\\tif(b<min(c,y)||max(c,y)<b)te|=1;\\n\\t\\t//\\tif(a==sr)te|=2;\\n\\t\\t//\\tif(a==kr)te|=1;\\n\\t\\t//\\tprintf(\\\"%d %d %d %d %d -> %d %d %d %d %d: %d\\\\n\\\",a,b,c,d,e,a+1,x,y,b,te,ks);\\n\\t\\t\\tdp[a+1][x][y][b][te]=min(dp[a+1][x][y][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t}\\n\\t}\\n}\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tH=a;W=b;\\n\\tfor(int i=0;i<a;i++)scanf(\\\"%s\\\",str[i]);\\n\\tfor(int i=0;i<12;i++)for(int j=0;j<12;j++)for(int k=0;k<12;k++)for(int l=0;l<12;l++)\\n\\t\\tdp[i][j][k][l][0]=dp[i][j][k][l][1]=dp[i][j][k][l][2]=dp[i][j][k][l][3]=99999999;\\n\\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\\n\\t\\tif(str[i][j]=='s'){sr=i;sc=j;}\\n\\t\\tif(str[i][j]=='k'){kr=i;kc=j;}\\n\\t\\tif(str[i][j]=='S'){SR=i;SC=j;}\\n\\t\\tif(str[i][j]=='K'){KR=i;KC=j;}\\n\\t}\\n\\tif(SR>KR){\\n\\t\\tswap(SR,KR);\\n\\t\\tswap(SC,KC);\\n\\t\\tswap(sr,kr);\\n\\t\\tswap(sc,kc);\\n\\t}\\n\\tif(SR==KR){\\n\\t\\tdp[SR][SC][KC][11][0]=0;\\n\\t}else if(SR<KR){\\n\\t\\tdp[SR][SC][11][11][1]=0;\\n\\t}else{\\n\\t\\tdp[SR][SC][11][11][2]=0;\\n\\t}\\n\\tint ret=99999999;\\n\\tfor(int i=0;i<a;i++){\\n\\t\\tfor(int j=0;j<12;j++){\\n\\t\\t\\tfor(int k=0;k<12;k++){\\n\\t\\t\\t\\tfor(int l=0;l<12;l++){\\n\\t\\t\\t\\t\\tfor(int m=0;m<4;m++){\\n\\t\\t\\t\\t\\t\\tif(dp[i][j][k][l][m]>999999)continue;\\n\\t\\t\\t\\t\\t//\\tprintf(\\\"%d %d %d %d %d: %d\\\\n\\\",i,j,k,l,m,dp[i][j][k][l][m]);\\n\\t\\t\\t\\t\\t\\tint t=0;\\n\\t\\t\\t\\t\\t\\tif(j==11)t|=2;\\n\\t\\t\\t\\t\\t\\tif(k==11)t|=1;\\n\\t\\t\\t\\t\\t\\tif(j<W&&k<W&&k!=j)t|=3;\\n\\t\\t\\t\\t\\t\\tif(i>=max(sr,kr)&&(m|t)==3)ret=min(ret,dp[i][j][k][l][m]);\\n\\t\\t\\t\\t\\t\\telse upd(i,j,k,l,m);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(SR>=sr||KR>=kr)ret=999999999;\\n\\tif(ret>999999)printf(\\\"CONTRACT\\\\n\\\");\\n\\telse printf(\\\"%d\\\\n\\\",ret);\\n}\",\n \"accuracy\": 0.5961538461538461,\n \"time_ms\": 40,\n \"memory_kb\": 1356,\n \"score_of_the_acc\": -0.4153,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_2319_1173932\",\n \"code_snippet\": \"#include<stdio.h>\\n#include<algorithm>\\nusing namespace std;\\nchar str[12][12];\\nint dp[12][12][12][12][4];\\nint H,W;\\nint sr,sc,kr,kc,SR,SC,KR,KC;\\ninline int ABS(int a){return max(a,-a);}\\ninline void upd(int a,int b,int c,int d,int e){\\n\\tif(a>=sr){\\n\\t\\tif(a>=kr)return;\\n\\t\\tif(a+1<KR)dp[a+1][11][11][b][e|2]=min(dp[a+1][11][11][b][e|2],dp[a][b][c][d][e]);\\n\\t\\telse if(a+1==KR)dp[a+1][11][KC][b][e|2]=min(dp[a+1][11][KC][b][e|2],dp[a][b][c][d][e]);\\n\\t\\telse{\\n\\t\\t\\tfor(int y=0;y<W;y++){\\n\\t\\t\\t\\tbool d2=false;\\n\\t\\t\\t\\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\\n\\t\\t\\t\\tif(str[a+1][y]=='#')d2=true;\\n\\t\\t\\t\\tif(a+1==kr&&kc!=y)d2=true;\\n\\t\\t\\t\\tif(d2)continue;\\n\\t\\t\\t\\tint x=b;\\n\\t\\t\\t\\tint ks=0;\\n\\t\\t\\t\\tint vt=0;\\n\\t\\t\\t\\tfor(int z=min(y,c);z<max(y,c);z++){\\n\\t\\t\\t\\t\\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\\n\\t\\t\\t\\t\\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\\n\\t\\t\\t\\t\\tif(!iL&&!iR)ks++;\\n\\t\\t\\t\\t\\telse if(!(iL&&iR)){\\n\\t\\t\\t\\t\\t\\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\\n\\t\\t\\t\\t\\t\\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\\n\\t\\t\\t\\t\\t\\telse ks+=2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif(d!=11&&a>KR&&a<=sr&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x))ks-=2;\\n\\t\\t\\t\\tif(min(b,x)<=y&&y<=max(b,x))ks+=2;\\n\\t\\t\\t\\telse ks++;\\n\\t\\t\\t\\tif(d!=11&&a>KR&&a<=sr&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\t\\tint te=e;\\n\\t\\t\\t\\tif(c<min(b,x)||max(b,x)<c)te|=2;\\n\\t\\t\\t\\tif(b<min(c,y)||max(c,y)<b)te|=1;\\n\\t\\t\\t\\tdp[a+1][11][y][b][te]=min(dp[a+1][11][y][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(int x=0;x<W;x++){\\n\\t\\tbool d1=false;\\n\\t\\tfor(int z=min(x,b);z<=max(x,b);z++)if(str[a][z]=='#')d1=true;\\n\\t\\tif(str[a+1][x]=='#')d1=true;\\n\\t\\tif(a+1==sr&&sc!=x)d1=true;\\n\\t\\t\\n\\t\\tif(d1)continue;\\n\\t\\tif(a<KR){\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tif(a+1==KR)dp[a+1][x][KC][b][e|1]=min(dp[a+1][x][KC][b][e|1],dp[a][b][c][d][e]+ks);\\n\\t\\t\\telse dp[a+1][x][11][b][e|1]=min(dp[a+1][x][11][b][e|1],dp[a][b][c][d][e]+ks);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tif(a>=kr){\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tif(a==kr&&min(b,x)<=c&&c<=max(b,x))ks++;\\n\\t\\t\\tif(d!=11&&a>KR&&a<=kr&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x))ks-=2;\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\tint te=e|1;\\n\\t\\t\\tif(a==kr&&(c<min(b,x)||max(b,x)<c))te|=2;\\n\\t\\t\\tdp[a+1][x][11][b][te]=min(dp[a+1][x][11][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tfor(int y=0;y<W;y++){\\n\\t\\t\\tbool d2=false;\\n\\t\\t\\tfor(int z=min(y,c);z<=max(y,c);z++)if(str[a][z]=='#')d2=true;\\n\\t\\t\\tif(str[a+1][y]=='#')d2=true;\\n\\t\\t\\tif(a+1==kr&&kc!=y)d2=true;\\n\\t\\t\\tif(a==SR&&a==KR&&min(b,x)<=c&&c<=max(b,x)&&min(c,y)<=b&&b<=max(c,y))continue;\\n\\t\\t\\tif(d2)continue;\\n\\t\\t\\tint ks=ABS(x-b)+1;\\n\\t\\t\\tint vt=0;\\n\\t\\t\\tfor(int z=min(y,c);z<max(y,c);z++){\\n\\t\\t\\t\\tbool iL=(min(b,x)<=z)&&(z<=max(b,x));\\n\\t\\t\\t\\tbool iR=(min(b,x)<=z+1)&&(z+1<=max(b,x));\\n\\t\\t\\t\\tif(!iL&&!iR)ks++;\\n\\t\\t\\t\\telse if(!(iL&&iR)){\\n\\t\\t\\t\\t\\tif(!vt&&a==SR&&(z==SC||z+1==SC)){vt=1;ks++;}\\n\\t\\t\\t\\t\\telse if(!vt&&a==sr&&(z==sc||z+1==sc)){vt=1;ks++;}\\n\\t\\t\\t\\t\\telse ks+=2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,d)<=c&&c<=max(b,d)&&min(b,x)<=c&&c<=max(b,x))ks-=2;\\n\\t\\t\\tif(min(b,x)<=y&&y<=max(b,x))ks+=2;\\n\\t\\t\\telse ks++;\\n\\t\\t\\tif(d!=11&&a>KR&&min(b,x)<=c&&c<=max(b,x)&&!(min(b,d)<=c&&c<=max(b,d)))ks++;\\n\\t\\t\\tint te=e;\\n\\t\\t\\tif(c<min(b,x)||max(b,x)<c)te|=2;\\n\\t\\t\\tif(b<min(c,y)||max(c,y)<b)te|=1;\\n\\t\\t//\\tif(a==sr)te|=2;\\n\\t\\t//\\tif(a==kr)te|=1;\\n\\t\\t\\tdp[a+1][x][y][b][te]=min(dp[a+1][x][y][b][te],dp[a][b][c][d][e]+ks);\\n\\t\\t}\\n\\t}\\n}\\nint main(){\\n\\tint a,b;\\n\\tscanf(\\\"%d%d\\\",&a,&b);\\n\\tH=a;W=b;\\n\\tfor(int i=0;i<a;i++)scanf(\\\"%s\\\",str[i]);\\n\\tfor(int i=0;i<12;i++)for(int j=0;j<12;j++)for(int k=0;k<12;k++)for(int l=0;l<12;l++)\\n\\t\\tdp[i][j][k][l][0]=dp[i][j][k][l][1]=dp[i][j][k][l][2]=dp[i][j][k][l][3]=99999999;\\n\\tfor(int i=0;i<a;i++)for(int j=0;j<b;j++){\\n\\t\\tif(str[i][j]=='s'){sr=i;sc=j;}\\n\\t\\tif(str[i][j]=='k'){kr=i;kc=j;}\\n\\t\\tif(str[i][j]=='S'){SR=i;SC=j;}\\n\\t\\tif(str[i][j]=='K'){KR=i;KC=j;}\\n\\t}\\n\\tif(SR>KR){\\n\\t\\tswap(SR,KR);\\n\\t\\tswap(SC,KC);\\n\\t\\tswap(sr,kr);\\n\\t\\tswap(sc,kc);\\n\\t}\\n\\tif(SR==KR){\\n\\t\\tdp[SR][SC][KC][11][0]=0;\\n\\t}else if(SR<KR){\\n\\t\\tdp[SR][SC][11][11][1]=0;\\n\\t}else{\\n\\t\\tdp[SR][SC][11][11][2]=0;\\n\\t}\\n\\tint ret=99999999;\\n\\tfor(int i=0;i<a;i++){\\n\\t\\tfor(int j=0;j<12;j++){\\n\\t\\t\\tfor(int k=0;k<12;k++){\\n\\t\\t\\t\\tfor(int l=0;l<12;l++){\\n\\t\\t\\t\\t\\tfor(int m=0;m<4;m++){\\n\\t\\t\\t\\t\\t\\tif(dp[i][j][k][l][m]>999999)continue;\\n\\t\\t\\t//\\t\\t\\tprintf(\\\"%d %d %d %d %d: %d\\\\n\\\",i,j,k,l,m,dp[i][j][k][l][m]);\\n\\t\\t\\t\\t\\t\\tint t=0;\\n\\t\\t\\t\\t\\t\\tif(j==11)t|=2;\\n\\t\\t\\t\\t\\t\\tif(k==11)t|=1;\\n\\t\\t\\t\\t\\t\\tif(j<W&&k<W&&k!=j)t|=3;\\n\\t\\t\\t\\t\\t\\tif(i>=max(sr,kr)&&(m|t)==3)ret=min(ret,dp[i][j][k][l][m]);\\n\\t\\t\\t\\t\\t\\telse upd(i,j,k,l,m);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif(SR>=sr||KR>=kr)ret=999999999;\\n\\tif(ret>999999)printf(\\\"CONTRACT\\\\n\\\");\\n\\telse printf(\\\"%d\\\\n\\\",ret);\\n}\",\n \"accuracy\": 0.5576923076923077,\n \"time_ms\": 40,\n \"memory_kb\": 1356,\n \"score_of_the_acc\": -0.4153,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_2319_269262\",\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\\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 Point {\\n int state; // NG, OK\\n int x;\\n int y;\\n int cost;\\n Point() {;}\\n Point(int state, int x, int y, int cost) : state(state), x(x), y(y), cost(cost) {;}\\n bool operator<(const Point &rhs) const {\\n return cost > rhs.cost;\\n }\\n};\\n\\nint h, w;\\nint rsx, rsy, rex, rey;\\nint bsx, bsy, bex, bey;\\nchar field[20][20];\\n\\nvoid PrintField() {\\n REP(y, h) {\\n REP(x, w) {\\n printf(\\\"%c\\\", field[y][x]);\\n }\\n puts(\\\"\\\");\\n }\\n}\\n\\nbool visit[2][20][20];\\nint dist[2][20][20];\\nint calc() {\\n const int dx[3] = { 1, 0, -1 };\\n const int dy[3] = { 0, 1, 0, };\\n priority_queue<Point> que;\\n int initialState = 0;\\n if (field[bsy][bsx] != 'K') { initialState = 1; }\\n que.push(Point(initialState, bsx, bsy, 0));\\n MEMSET(visit, 0);\\n MEMSET(dist, 0x0f);\\n while (!que.empty()) {\\n Point p = que.top();\\n que.pop();\\n if (visit[p.state][p.y][p.x]) { continue; }\\n visit[p.state][p.y][p.x] = true;\\n if (p.state == 1 && p.x == bex && p.y == bey) {\\n if (field[p.y][p.x] == 'K') { p.cost++; }\\n return p.cost;\\n }\\n if (p.y == bey) { continue; }\\n REP(dir, 3) {\\n int nx = p.x + dx[dir];\\n int ny = p.y + dy[dir];\\n if (nx < 0 || nx >= w || ny < 0 || ny >= h) { continue; }\\n if (nx == rsx && ny == rsy) { continue; }\\n if (field[ny][nx] == '#') { continue; }\\n int nstate = p.state;\\n if (dir == 1 && field[ny][nx] != 'K') {\\n nstate = 1;\\n }\\n int ncost = p.cost;\\n if (field[p.y][p.x] == 'K' && field[ny][nx] == 'K') {;}\\n else if (field[p.y][p.x] == 'K' || field[ny][nx] == 'K') { ncost += 2; }\\n else if (field[p.y][p.x] == '.' && field[ny][nx] == '.') { ncost++; }\\n\\n if (visit[nstate][ny][nx] == '#') { continue; }\\n if (dist[nstate][ny][nx] <= ncost) { continue; }\\n dist[nstate][ny][nx] = ncost;\\n que.push(Point(nstate, nx, ny, ncost));\\n }\\n }\\n return 1 << 30;\\n}\\n\\nint Init(int x, int y, int dir, int movey) {\\n int ret = 1 << 30;\\n if (x < 0 || x >= w || y < 0 || y >= h) { return 1 << 30; }\\n if (field[y][x] != '.') { return 1 << 30; }\\n if (movey != 1 && dir != -1) {\\n for (int ny = y; ny >= 0; ny--) {\\n if ((x == bsx && ny == bsy) ||\\n (x == bex && ny == bey) ||\\n field[ny][x] == '#') { break; }\\n if (field[ny][x] == 'K') { return 1 << 30; }\\n }\\n }\\n field[y][x] = 'K';\\n if (x == rex && y == rey) {\\n ret = calc();\\n } else if (y == rey) {;}\\n else {\\n const int dx[2] = { 1, -1 };\\n REP(i, 2) {\\n int nx = x + dx[i];\\n ret = min(ret, Init(nx, y, i, 0) + 1);\\n }\\n ret = min(ret, Init(x, y + 1, dir, 1) + 1);\\n }\\n field[y][x] = '.';\\n return ret;\\n}\\n\\nint main() {\\n while (scanf(\\\"%d %d\\\", &h, &w) > 0) {\\n REP(y, h) {\\n int v = scanf(\\\"%s\\\", field[y]);\\n assert(v == 1);\\n }\\n REP(y, h) REP(x, w) {\\n if (field[y][x] == 'K') { rsx = x; rsy = y; field[y][x] = '.'; }\\n if (field[y][x] == 'S') { bsx = x; bsy = y; field[y][x] = '.'; }\\n if (field[y][x] == 'k') { rex = x; rey = y; field[y][x] = '.'; }\\n if (field[y][x] == 's') { bex = x; bey = y; field[y][x] = '.'; }\\n }\\n int ans = 1 << 30;\\n if (rsy >= rey || bsy >= bey) {}\\n else {\\n ans = min(ans, Init(rsx, rsy, -1, 1));\\n swap(rsx, bsx);\\n swap(rsy, bsy);\\n swap(rex, bex);\\n swap(rey, bey);\\n ans = min(ans, Init(rsx, rsy, -1, 1));\\n }\\n if (ans >= (1 << 30)) puts(\\\"CONTRACT\\\");\\n else printf(\\\"%d\\\\n\\\", ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 550,\n \"memory_kb\": 0,\n \"score_of_the_acc\": -0.631,\n \"final_rank\": 2\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":12,"numItemsPerPage":100,"numTotalItems":2103,"offset":1200,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3NTQ1MzM5MSwic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzc1NDU2OTkxLCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.C42EwPrSboPL4PG_qBd31rTqu0zul7xizIKQUY4v9Fy6739nZ_KzWoVsDe8gZ_SYjoqB02jrKc8lMF4zjjtTCA","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_2200_cpp | Problem D:
Mr. Rito Post Office
あなたは離島の郵便局に勤めるプログラマである．あなたの住んでいる地域は，複数の島々からなる．各島には一つ以上の港町がある．それらに加えて他の町や村があるかもしない．ある島から別の島に向かうためには船を使わなければならない．一つの島の中を回るには陸路が使えるが，海路を利用した方が速いこともある．
近年行われた郵便局の民営化をきっかけに，経費削減に向けて郵便配達員の人員整理が全国的に行われた．離島の郵便局もその例外ではなく，結果として郵便配達員は利藤さんただ一人となってしまった．その郵便局が集配を担当する地域は非常に広いため，一人で集配するのは大変な作業である．なので，どのようにすれば効率的に集配を行えるのか，利藤さんがあなたに助けを求めてきた．
あなたの仕事は，利藤さんがたどるべき町や村の集配順序が与えられたときに，最短巡回経路を求めるプログラムを書くことである．
利藤さんは，決して指定された順序以外で集配業務を行うことができない．しかし，ある町や村から別の町や村へ移動する際に，他の町や村を経由して移動することは許可されている．また，利藤さんは島々を巡るための一隻の船を持っている．
例えば，町A，町B，村Cという集配順序が与えられた場合，町Aから町Bへ向かう際にどの町や村を経由してもかまわない．このとき，村Cを経由しても構わないが，集配順序を守るためには，一度町Bに行って集配をおこなってから，改めて村Cを訪れて集配をおこなわなければならない．また，町Aから海路を用いて町Bに向かい，町Bから陸路を用いて村Cに向かった場合，船を町Bに置いたままになる．したがって，次に海路を使いたい場合は町Bに戻る必要がある．
一つの町や村において複数回集配をしなければならない場合もある．たとえば，町A，村B，町C，村Bという集配順序が与えられるかもしれない．このとき，町Aから村Bをたどらずに町Cに向かった場合は，町Cでいきなり集配をおこなうことはできない．最初の村Bでの集配が終わっていないからである．町Cで集配を済ませた後で村Bを訪れて集配しても，一回目の村Bの集配を終わらせたことにはならない．
利藤さんは，はじめに必ずある港町に船とともにいる．利藤さんはベテランであるため，移動時間以外の集配作業にかかる時間は無視してよい．また，最後の町または村での集配業務が完了するまでの時間だけが問題であり，船をもとの位置に戻して郵便局に帰るまでの時間は考慮しなくてよい．
Input
入力は複数のデータセットから構成される．各データセットの形式は次に示すとおりである．
N
M
x
1
y
1
t
1
sl
1
x
2
y
2
t
2
sl
2
...
x
M
y
M
t
M
sl
M
R
z
1
z
2
...
z
R
データセットの中の入力項目は，すべて非負の整数である．行中の入力項目の区切りは空白 1 個である．
最初の行は，陸路及び海路網の大きさを規定する．
N
(2 ≤
N
≤ 200) は，町または村の数である．
それぞれの町または村には，1 から
N
までの固有の番号を割り当てる．
M
(1 ≤
M
≤ 10000) は，陸路と海路の合計本数である．
2 行目から 1 +
M
行目は，陸路または海路の記述である．
x
i
と
y
i
(1 ≤
x
i
,
y
i
≤
N
) は両端の町または村の番号を表す．
t
i
(1 ≤
t
i
≤ 1000) はその陸路または海路の移動時間を表す．
sl
i
は ‘L’ または ‘S’ のいずれかであり，Lは陸路を，Sは海路をそれぞれ表す．
ある2つの町や村を直接結ぶ陸路または海路が2本以上存在することがある． それぞれの陸路または海路は双方向であり，すなわちどちらの向きにも移動できる．
M
+ 2 行目の
R
(1 ≤
R
≤
1000)は，利藤さんが担当する集配先の数を表す．
M
+ 3 行目には，集配先の町や村の番号
z
i
(1 ≤
z
i
≤
N
) が集配順に
R
個並んでいる．
初期状態では利藤さんと船はともに港町
z
1
に存在する． 初期状態から集配先の町や村へは，必ず何らかの方法で移動することができる．
入力の終わりは，空白で区切られた2つの0を含む1行で示される．
Output
入力の各データセットに対して，与えられた集配順序で利藤さんが町と村を巡回するために必要な最短移動時間を求め，1行に出力せよ．
Sample Input
3 3
1 2 5 L
1 2 7 S
2 3 11 S
3
1 2 3
5 5
1 2 15 L
2 3 10 L
4 5 7 L
1 3 30 S
3 4 100 S
5
1 3 5 4 1
0 0
Output for the Sample Input
18
269 | [
{
"submission_id": "aoj_2200_11057001",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF=0x3f3f3f3f;\nint main(){\n int n,m;\n while(scanf(\"%d%d\",&n,&m)!=EOF&&(n||m)){\n int d[2010][202];\n int l[202][202];\n int s[202][202];\n memset(d,0x3f,... |
aoj_2199_cpp | Problem C:
Differential Pulse Code Modulation
差分パルス符号変調は主に音声信号を圧縮する際に用いられる圧縮手法の一つである．
音声信号は計算機上では整数列(インパルス列)として扱われる．整数列は入力信号を一定時間間隔で標本化(サンプリング)し，振幅を記録したものである．一般にこの整数列は前後の値が近いという傾向がある．これを利用し，前後の値の差分を符号化し，圧縮率を向上させるのが差分パルス符号変調である．
本問題では差分の値をあらかじめ定められた値の集合から選ぶことを考える．この値の集合をコードブックと呼ぶことにする．復号化後の音声信号
y
n
は以下の式で定められる．
y
n
=
y
n
- 1
+
C
[
k
n
]
ここで
k
n
はプログラムによって出力される出力系列，
C
[
j
]
はコードブックの
j
番目の値である．ただし
y
n
は加算によって0未満の値となった場合は0に，255より大きい値となった場合は255にそれぞれ丸められる．また，
y
0
の値は128とする．
あなたの仕事は，入力信号とコードブックが与えられたときに，元の入力信号と復号化後の出力信号との差の二乗和が最小となるように出力系列を選んで，そのときの差の二乗和を出力するプログラムを書くことである．
例えば，コードブックとして
{4, 2, 1, 0, -1, -2, -4}
という値のセットを使って
131, 137
という列を圧縮する場合，
y
0
= 128
,
y
1
= 128 + 4 = 132
,
y
2
= 132 + 4 = 136
という列に圧縮すると
二乗和が
(131 - 132)^2 + (137 - 136)^2 = 2
と最小になる．
また，同じくコードブックとして
{4, 2, 1, 0, -1, -2, -4}
という値のセットを使って
131, 123
という列を圧縮する場合，
y
0
= 128
,
y
1
= 128 + 1 = 129
,
y
2
= 129 - 4 = 125
と，先程の例とは違って
131
により近づく
+2
を採用しない方が
(131 - 129) ^ 2 + (123 - 125) ^ 2 = 8
というより小さな二乗和が得られる．
上記 2つの例は sample input の最初の 2例である．
Input
入力は複数のデータセットから構成される．各データセットの形式は次に示すとおりである．
N
M
C
1
C
2
...
C
M
x
1
x
2
...
x
N
最初の行は，入力データセットの大きさを規定する．
N
は圧縮する入力信号の長さ(サンプル数)である．
M
はコードブックに含まれる値の個数である．
N
及び
M
は1 ≤
N
≤ 20000，1
≤
M
≤ 16を満たす．
これに続く
M
行は，コードブックの記述である．
C
i
はコードブックに含まれる
i
番目の値を表す．
C
i
は-255 ≤
C
i
≤ 255を満たす．
これに続く
N
行は，入力信号の記述である．
x
i
は入力信号を表す整数列の
i
番目の値である．
x
i
は0 ≤
x
i
≤ 255を満たす．
データセットの中の入力項目は，すべて整数である．入力の終りは，空白文字1個で区切られた2個のゼロのみからなる行で表される．
Output
入力の各データセットに対して， 元の入力信号と復号化後の出力信号との差の二乗和の最小値を一行で出力せよ．
Sample Input
2 7
4
2
1
0
-1
-2
-4
131
137
2 7
4
2
1
0
-1
-2
-4
131
123
10 7
-4
-2
-1
0
1
2
4
132
134
135
134
132
128
124
122
121
122
5 1
255
0
0
0
0
0
4 1
0
255
0
255
0
0 0
Output for the Sample Input
2
8
0
325125
65026 | [
{
"submission_id": "aoj_2199_11034201",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <cmath>\n#include <climits>\n\nusing namespace std;\n\nint main(){\n\n while(1){\n \n int N, M;\n cin >> N >> M;\n if (N==0 && M==0) break;\n\n vector<int> C(M);\n ... |
aoj_2201_cpp | Problem E:
Immortal Jewels
English text is not available in this practice contest.
ある時ある貴族が，ある貧乏な国のおてんばで勇敢なお姫様に惚れ込み結婚を申し込んだ．お姫様は貴族にある条件を出した．その条件とは「不死の宝石」と呼ばれている宝石を大量に持ってくることであった．不死の宝石は，ある山の特定の場所でしか取ることができない非常に希少な宝石である．しかも大変壊れやすいため，採取するには特別な方法が必要だった．
不死の宝石は円形をしており，二次元空間上に複数存在している．この宝石を取るには，ある特別な金属の棒でそれらを吸着する必要がある．金属の棒は無限の長さを持つ直線であり，太さは無視することができる．宝石は一つ一つ異なる強さの磁力を持っており，金属がその磁力に反応するほど十分に近ければ宝石は吸着される．具体的には，金属と宝石の表面との距離を
d
，宝石の磁力の強さを
m
としたとき，
0 ≤
d
≤
m
であれば宝石は金属に吸着される．逆に，金属の棒と宝石がその磁力よりも離れている場合は吸着できない．また，棒が少しでも宝石を貫通してしまった場合にも，その宝石が壊れてしまうため吸着できない．
例を見てみよう．下の図は二次元空間上に置かれた宝石の例である．宝石1から宝石6まであり，磁力はそれぞれ1, 0, 1, 1, 1, 2であるとする．
図 E-1: 宝石の配置例
上の図に加えて金属の棒を配置した例が下の図である．宝石を吸着した結果も表に示してある．この例の場合，宝石3は磁力の届く範囲より離れており，また宝石4は棒に貫通されているため吸着できないが，残りの4つは全て吸着することができる．
図 E-2: 金属の棒の配置例
宝石名
磁力
金属との距離
吸着できるか
宝石1
1
約0.21
できる
宝石2
0
0
できる
宝石3
1
約5.37
できない
宝石4
1
貫通している
できない
宝石5
1
約0.97
できる
宝石6
2
約0.53
できる
表 E-3: 吸着結果
貴族は全財産を注ぎ込み，特別な金属の棒を必死に探し求めた．しかしながら，この金属も非常に貴重であったため，結局たった一本しか入手することができなかった．したがって吸着のチャンスはただ一回しか無い．
あなたはある貴族に仕えるプログラマーである．あなたの仕事は，与えられた二次元上の宝石の配置に対して，金属の棒をうまく配置したときに，最大で何個の宝石を吸着することができるかを求めるプログラムを書くことである．
Input
入力は複数のデータセットから成り， 1つのデータセットは以下の形式で与えられる．
N
x
1
y
1
r
1
m
1
x
2
y
2
r
2
m
2
...
x
N
y
N
r
N
m
N
データセットの最初の行は宝石の数
N
(1 ≤
N
≤ 50) を表している．続く
N
行の各行には4つの整数
x
i
,
y
i
,
r
i
,
m
i
(-1000 ≤
x
i
,
y
i
≤ 1000, 1 ≤
r
i
≤ 100, 0 ≤
m
i
≤ 100) が記述されており，宝石の位置，大きさ，および磁力を表す．すなわち，宝石
i
は中心を(
x
i
,
y
i
)とし半径が
r
i
であるような円形をしており，その磁力は
m
i
である．宝石は互いに重なり合うことは無い．
入力の終わりは，0のみからなる行で表される．
Output
各データセットについて， 一度に吸着することができる宝石の最大数を1行に出力せよ．
Sample Input
6
-2 -2 1 1
2 2 2 0
5 7 1 1
8 0 3 1
13 4 1 1
16 1 1 2
3
0 0 2 1
10 0 2 1
0 10 2 1
3
0 0 2 1
10 0 2 1
0 6 2 1
3
0 0 2 1
10 0 2 1
0 4 2 1
1
0 0 1 1
0
Output for the Sample Input
4
2
3
3
1 | [
{
"submission_id": "aoj_2201_10848639",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <cmath>\n#include <algorithm>\n\nusing namespace std;\nconst int maxn = 100 + 5;\nconst double PI = acos(-1);\n\nstruct Point\n{\n double x, y;\n Point(){}\n Point(double x_,... |
aoj_2207_cpp | Problem D:
無矛盾な単位系
京、垓、{禾予}、穣、溝、澗、正、載、極、恒河沙、阿僧祇、那由他、不可思議、無量大数
分、厘、毛、糸、忽、微、繊、沙、塵、埃、渺、漠、模糊、逡巡、須臾、瞬息、弾指、刹那、六徳、虚空、清浄、阿頼耶、阿摩羅、涅槃寂静
これらが何か分かるだろうか。これらは全て10の累乗につけられた数詞である。
京 = 10
16
, 垓 = 10
20
, {禾予} = 10
24
, 穣 = 10
28
, 溝 = 10
32
, ...
分 = 10
-1
、厘 = 10
-2
、毛 = 10
-3
、糸 = 10
-4
、忽 = 10
-5
, ...
ではこれらが実用的に使われているのを見たことはあるだろうか？無いのではなかろうか？ 過去の先人達が熟考の末にこれらの命名を行ったにもかかわらず、これらの数詞が日の目を見られないとはなんと勿体無いことだろう。
この問題は、コンテスト参加者の皆様にこれらの数詞を知ってもらうために作られたものである。以下に問題の概要を示す。
1 km = 10
3
m
上記のような単位間の関係が入力として与えられる。この問題では、左辺における単位が右辺における単位の10の累乗倍となっているような単位間の関係だけが与えられる。
単位間の関係が矛盾しているとは、与えられた関係から以下の関係が同時に成り立つことをいう。
1 A = 10
x
B
1 A = 10
y
B
ただし、 x≠yであり、 AとBは任意の単位。
入力として与えられた単位間の関係が矛盾しているかどうか判定せよ。 なお、入力は簡易のため指数表記で与えられる。
Input
入力の一行目に、単位間の関係の個数を示す整数 N (1≤ N ≤ 100) が与えられる。
続くN行に、単位間の関係が含まれる。
単位間の関係は以下のフォーマットで与えられる。
"1 A = 10^x B"
A, B は単位を示す。AとBは相異なっており、それぞれ空白を含まないアルファベット小文字1〜16文字からなる。x は -100から100までの整数である。
"1 A = 10^x B" が定義されたとき、 "1 B = 10^-x A" も暗黙のうちに定義されているものとする。
任意の単位系のペアが2回以上定義されることはない。
すなわち、"1 kilobyte = 10^3 byte", "1 kilobyte = 10^1 byte" のような関係が、同時に入力に含まれることはない。
同様に、"1 kilobyte = 10^3 byte", "1 byte = 10^-3 kilobyte" のような関係が、同時に入力に含まれることはない。
Output
与えられた単位系が矛盾していなければ Yes を、 矛盾していれば No を出力せよ。
Notes on Test Cases
上記入力形式で複数のデータセットが与えられます。各データセットに対して上記出力形式で出力を行うプログラムを作成して下さい。
N が 0 のとき入力の終わりを示します。
Sample Input
3
1 km = 10^3 m
1 m = 10^2 cm
1 km = 10^5 cm
7
1 kilometre = 10^3 metre
1 megametre = 10^3 kilometre
1 metre = 10^-6 megametre
1 terametre = 10^3 gigametre
1 petametre = 10^3 terametre
1 gigametre = 10^-6 petametre
1 metre = 10^-15 petametre
4
1 a = 10^2 b
1 a = 10^3 c
1 b = 10^2 c
1 c = 10^1 d
4
1 acm = 10^2 icpc
1 icpc = 10^3 utpc
1 utpc = 10^4 topcoder
1 topcoder = 10^-1 acm
0
Output for Sample Input
Yes
Yes
No
No | [
{
"submission_id": "aoj_2207_8526509",
"code_snippet": "// #define _GLIBCXX_DEBUG 1\n#include <bits/stdc++.h>\n// #include <atcoder/all>\nusing namespace std;\n#define ll long long\n#define ull unsigned long long\n\n#define rep1(i, n) for (int i = 1; i <= n; i++)\n#define rep_0(i, n) for (int i = 0; i < n; ... |
aoj_2210_cpp | Problem G:
天体観測
2012年のある日のこと。
北の田舎町に住むあなたは、愛娘を連れて展望台で星見をすることにした。
この町は都会と違って街明かりが少なく、空気も澄んでいるので、晴れた日は満天の星空が広がっている。
天文にそこそこ詳しいあなたは季節ごとの有名な星や星座、それにまつわる神話ぐらいは知っているのだが、
なにせここは星降る町、名前のわからない星座もたくさん見えている。
この前の星見のときにそういった星々に関する娘の質問に答えられなかったあなたは、
星見の時刻にいったいどの星座が見えるのかを調べたいと思った。
特定の日時にどの星が見えるのかを知るには、星座早見盤というアイテムが有用である。
最近では携帯端末のGPSと連携した星座早見盤アプリも提供されている。
だが、あいにくあなたの手元には星座早見盤がなく、携帯は七年前の機種で、最新のアプリが動くわけがなかった。
詰んだと思ったあなたが最後の望みをかけてハードディスクを漁ったところ、
なんと2012年1月1日の午前零時時点での各星座を構成する星々の位置を記したファイルを発見した。
これがあれば任意の日時の星の位置がわかるはず！
あなたは急いでどの星座が見えるのかを出力するプログラムを書くことにした。
星々の情報は、観測者を中心とした天球上の座標群として与えられている。
座標は方位角と高度のペアで表されている。
方位角は真北を0度、真東を90度というように時計回りに測った0度以上360度未満の角度であり、
高度は地平線上を0度、天頂を90度度、天底を-90度とした-90度以上90度以下の角度である。
各天体は北極星と観測者を結ぶ直線を回転軸として、天球上を一定速度で反時計回りに回転している。
その回転速度は24時間あたり(1+1/365.24)×360度である。
北極星は真北方向の高度43.2度の点にある。
ある星座が見えるとは、その星座を構成するすべての星が地平線より上にあることをいう。
テストデータにおいて、当該時刻に地平線から高度±0.01度以内に星があることはないとしてよい。
なお、地軸のズレ、天体との距離などは考えなくてよい。
また、2012年は閏年であることに注意せよ。
Input
入力は以下のような形式で与えられる。
mon
/
day
hh
:
mm
n
name
1
m
1
a
11
h
11
a
12
h
12
...
a
1m
1
h
1m
1
name
2
m
2
a
21
h
21
...
一行目には星見をする2012年のある日時が24時制で与えられる。
二行目の
n
は見えるかどうか判定したい星座の数を表す。
残りの行はその
n
個の星座の2012年1月1日 00:00時点での位置情報である。
各星座の情報の先頭行には、星座名
name
i
と星座を構成する星の数
m
i
が与えられる。
続く
m
i
行に、各星の方位角
a
ij
と高度
h
ij
が与えられる。
これらの二つの数値は小数点以下三桁まで記述された浮動小数点数である。
入力の数値は、1 ≤
n
≤ 1000、1 ≤
m
i
≤ 1000、0.000 ≤
a
ij
< 360.000、-90.000 ≤
h
ij
≤ 90.000を満たす。
また、星座名はアルファベットの大文字小文字からなり、長さが50文字を超えることはない。
サンプルにあるとおり、「夏の大三角」や「北斗七星」など、88星座に入っていないものが与えられることもある。
なお、時刻は日没後の時刻とはかぎらないが、気にせず星が見えるものとしてよい。
Output
入力に与えられた順に、指定された日時に見える星座の一覧を出力せよ。
一つも星座が見えないようなテストデータはないと仮定してよい。
Notes on Test Cases
上記入力形式で複数のデータセットが与えられます。
入力の1行目にデータセットの数Tが与えられます。
各データセットに対して上記出力形式で出力を行うプログラムを作成して下さい。
Sample Input
3
7/7 18:30
3
Aquila 8
359.216 -32.936
358.624 -49.913
352.155 -43.404
346.852 -35.279
345.110 -36.796
342.448 -44.407
343.088 -38.981
336.070 -43.369
Cygnus 11
357.838 6.615
355.808 5.107
353.475 -18.553
348.868 -10.771
347.949 1.298
344.907 -4.637
342.909 1.163
338.483 -9.293
338.854 -1.786
338.515 1.304
331.752 -10.737
Lyra 4
5.063 -7.812
2.708 -13.386
1.327 -2.841
0.815 -14.109
9/3 02:40
3
SevenStars 7
40.483 50.729
48.968 50.637
50.421 42.796
44.855 40.960
43.493 35.637
42.111 31.430
44.997 25.256
SummerTriangle 3
342.909 1.163
345.110 -36.796
5.063 -7.812
WinterTriangle 3
165.368 51.176
207.400 51.262
184.960 31.381
7/7 19:00
91
Andromeda 25
300.224 10.559
313.114 22.235
304.593 17.311
305.145 18.508
299.557 18.169
295.825 15.561
296.928 16.703
290.573 13.699
304.020 24.766
300.872 24.287
296.636 24.636
304.470 32.153
303.783 32.893
298.697 32.261
306.181 35.986
296.619 37.096
301.005 41.728
319.394 10.944
323.303 16.879
313.853 10.187
313.295 13.504
317.463 18.294
315.012 16.124
315.502 17.165
316.369 19.322
Antila 5
150.199 5.822
143.663 11.282
144.808 2.868
138.069 2.334
136.680 -6.080
Apus 6
159.498 -45.403
165.358 -47.196
157.404 -51.717
166.529 -52.133
167.065 -52.812
162.765 -60.430
Aquarius 28
318.790 -48.408
321.209 -45.287
318.270 -46.509
310.269 -47.366
305.6
...(truncated) | [
{
"submission_id": "aoj_2210_3086590",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <iomanip>\nusing namespace std;\nconst double EPS = 1e-8;\nconst double INF = 1e18;\nconst double PI = acos(-1);\n\nbool epsleq(const double &a, const double &b){\... |
aoj_2209_cpp | Problem F:
UTF-8
UTF-8はマルチバイト文字を符号化する手法の一つである。
文字は計算機上ではバイト列として扱われる。英語だけであればラテンアルファベットおよび数字、記号を合わせても 1byteで表現できるが、残念ながら世界中で利用されている文字を1byteで表現することはできないため、複数のバイトを用いて文字を表す必要がある。
ここで例えば"あ"という文字に12354(0x3042)という2バイト列を割り当てたとき、そのままバイト列を並べると0x30,0x42と2文字なのか0x3042で1文字なのかが区別がつかない。
このため、マルチバイト文字符号化方式のUTF-8では始めの1バイト目で続くバイト列の長さが分かるようにすることにより、この問題を克服している。具体的なビットパターンは以下のようになる。
バイト長
ビットパターン
1
0xxxxxxx
2
110yyyyx 10xxxxxx
3
1110yyyy 10yxxxxx 10xxxxxx
4
11110yyy 10yyxxxx 10xxxxxx 10xxxxxx
ここでxは0/1の任意のビットとする。またyも0/1の任意のビットとなるがどれか一つは1である必要がある。また全ての文字は1,2,3,4バイト文字のいずれかであるとする。
ここでyのビットが少なくとも一つは1であるという制約は以下のような理由による。 例えば'/'(0x2f)をバイト列にエンコードする際に0x2fと1バイトで符号化するないしは0xc0 0xafと2バイトで符号化する方法の二つがあるが、このような曖昧性を許すとセキュリティ上の脅威のもととなる可能性があるためである。
以上の話を聞いたあなたはUTF-8がどの程度の自由度があるのかが気になった。具体的には与えられたバイト列の一部のビットが不明な時にUTF-8として可能なバイト列の組み合わせがどの程度あるかということである。
このとき可能なバイト列の組み合わせの個数を求め、1,000,000で割った余りを出力せよ。
Input
N
b
1
b
2
...
b
N
Nはバイト列の個数, b
i
はバイト列である。
1 ≤ N ≤ 1000 を満たしている。 b
i
は記号{0/1/x}が8個並んでいる。xはビットが不明であることを示している。
Output
可能なバイト列の組み合わせの個数を1,000,000で割った余りを出力せよ。
Notes on Test Cases
上記入力形式で複数のデータセットが与えられます。各データセットに対して上記出力形式で出力を行うプログラムを作成して下さい。
N が 0 のとき入力の終わりを示します。
Sample Input
1
xxxxxxxx
3
11100000
10x00000
10111111
3
11100000
10000000
10111111
4
xxxxxxxx
xxxxxxxx
xxxxxxxx
xxxxxxxx
0
Output for Sample Input
128
1
0
778240 | [
{
"submission_id": "aoj_2209_3699896",
"code_snippet": "#include <bits/stdc++.h>\n#define r(i,n) for(int i=0;i<n;i++)\n#define int long long\nusing namespace std;\ntypedef pair<int,int>P;\ntypedef pair<int,P>P2;\n#define F first\n#define S second\n\nint calc1(string s){\n\tif(s[0]=='1')return 0;\n\tint x=1;... |
aoj_2208_cpp | Problem E:
トーマス・ライトの憂鬱
昨日の夕方の話。 普段通り大学での講義が終わり、日課であるキャンパスでの猫への餌付けを済ませた後、家に帰り着くと、作業着を着た人たちが僕の家の扉を取り替える工事をしていた。 それだけなら特に僕の頭痛の種を増やすような出来事ではないのだが、取り外されて去っていく慣れ親しんだ鍵とレバーがついている茶色の扉が非常に平凡であるのに対して、今からまさに取り付けられようとしている黒色の扉が非常に奇妙なもので、ああこれはまたうちの親父が何かを思いついてしまったのだなと容易に想像がついてしまうのであった。 その偏屈親父が言うには、鍵は無くす可能性があるので信用することが出来ない。手元に鍵があったとしても、目を離している隙に鍵の複製が作られてしまったかもしれない。物にセキュリティーを頼る時代はもう終わりだ。これからはパスワードを家族の各人が覚え、そうすることによって世界征服を目論む悪の科学者から我輩の発明品を守るのだ、ということらしい。 新しく設置された扉には縦にN個ずつ、横にN個ずつの正方形をかたちどるように、縦にN+1本、横にN+1本の線が薄青色で引かれていた。 一行目の正方形の左にはA、二行目の正方形の左にはB、というように、ご丁寧に行番号が書かれている。 一列目の正方形の上には1、二列目の正方形の上には2、と、列番号はどうやら数字のようだ。 N
2
個の正方形には各々スイッチが一つずつ配置されており、OFFの状態だと真っ黒だが、ONの状態だと赤い丸が浮かび上がる、というセキュリティーを考えるならもう少しやりようがあるだろうというギミックが付いている。 そして全てのスイッチのON/OFFを正しく合わせたときのみ、扉が開く、という派手好きの親父が大満足な仕様となっているようだ。
さて、ここでの僕の問題は、このパスワードをきちんと覚えられる自信が無い、ということだ。 自分で言うのも何なのだが、僕は頭がそんなに悪くないつもりなので、パスワードの大体は覚えていられるだろうと思うのだが、機械という物は融通が効かないものだからほんのちょっと間違っただけで、寒空の下で夜を過ごすことになりかねない。 しかし、パスワードを書き写して持ち運べば、親父に見つかったときに小遣い抜きなどの理不尽な制裁が加えられることが予想される。 そこで僕はある作戦を思いついたんだ。 各行、各列の正方形に含まれる赤丸の個数をメモしてそれを持ち運ぼう。 一行目のN個の正方形に含まれる赤丸の個数、二行目のN個の....、 一列目のN個の正方形に含まれる赤丸の個数、二行目のN個の....、 という風に2N個の数字をメモしておけば、もし他の人に見られてもただの数字の羅列だ。何が何だかきっと分からないだろう。
やあわざわざここまで読んでくれた君。 ああそうだ、この作戦にはもしかしたら致命的な欠陥があるかもしれない。 複数のパスワードが、同じメモになってしまうかもしれないのだ。 そうなると、寒空(略)ということになりかねない。我が身の健康を揺るがす一大問題だ。 そこで君には、このメモの数字を入力すると、復元可能なパスワードが一つに定まるかどうかを判定するプログラムを書いてほしい。 一つに定まるなら、Yes、そうでないなら、Noと出力するだけのプログラムさ。簡単だろう？ もしかしたらメモをとった時に赤丸を数え間違ったかもしれない。その場合は復元できるパスワードが1つも存在しないかもしれないが、その時は迷わずNoと返してくれ。 ああそうそう、間違っても僕の家に勝手に入ろうとはしないでくれよ。親父の趣味の危ない機械や罠が並んでいるから、命の保証が出来ないからね。
Input
入力は次のような形式で与えられる。
N
1行目の和 2行目の和 ...
1列目の和 2列目の和 ...
ただし、N は 1 ≤ N ≤ 10000 を満たす整数である。
Output
問題文に従って、YesもしくはNoを出力せよ。
Notes on Test Cases
上記入力形式で複数のデータセットが与えられます。各データセットに対して上記出力形式で出力を行うプログラムを作成して下さい。
N が 0 のとき入力の終わりを示します。
Sample Input
2
1 2
2 1
3
2 1 2
2 1 2
10
0 1 1 2 5 5 5 8 8 9
0 1 3 3 3 6 6 6 7 9
0
Output for Sample Input
Yes
No
Yes | [
{
"submission_id": "aoj_2208_10852901",
"code_snippet": "#include <algorithm>\n#include <vector>\n#include <iostream>\nusing namespace std;\nint main() {\n\tint n,t;\n\tfor(;(cin>>n),n;){\n\t\tvector<int> r,l;\n\t\tbool ok=true;\n\t\tfor(int i=0;i<n;i++)(cin>>t),r.push_back(t);\n\t\tfor(int i=0;i<n;i++)(cin... |
aoj_2213_cpp | Problem J:
多項式の解の個数
きたまさ君は大学でさまざまな変換について研究している。最近、きたまさ君が興味を持っている変換は次のようなものである。 N+1個の整数 a
0
, ..., a
N
を固定し、整数 z を入力とする。また P を素数とする。
t = ( a
N
z
N
+ a
N-1
z
N-1
+ ... + a
2
z
2
+ a
1
z + a
0
) mod P
きたまさ君はこの変換によって t = 0 になってしまう z がいくつもあることに気がついた。 そこで、きたまさ君は友人でありスーパープログラマーでもあるあなたに、変換後に t = 0 になる z が 0〜P-1 にいくつあるかを計算してもらうことにした。
Input
入力は次の形式で与えられる。
N P
a
0
a
1
... a
N
入力の1行目には整数Nと素数Pがスペース文字で区切られて与えられる。これらは、問題文で与えられたとおりである。 0 ≤ N ≤ 100, 2 ≤ P ≤ 10
9
を満たす。
次の1行には a
0
〜a
N
がスペース文字で区切られて与えられる。これらは |a
i
| ≤ 10
9
を満たす整数である。また a
N
≠ 0 である。
Output
変換後に0になるような z (0 ≤ z < P) の個数を出力せよ。
Notes on Test Cases
上記入力形式で複数のデータセットが与えられます。各データセットに対して上記出力形式で出力を行うプログラムを作成して下さい。
N, P がともに 0 のとき入力の終わりを示します。
Sample Input
2 3
1 2 1
2 3
1 2 6
0 0
Output for Sample Input
1
1 | [
{
"submission_id": "aoj_2213_10806496",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n// min non-negative i such that n <= 2^i\nint ceil_pow2(int n) {\n int i = 0;\n while ((1U << i) < (unsigned int)(n)) i++;\n return i;\n}\n\n// min non-negative i such that (x & (1 << i)) != 0... |
aoj_2211_cpp | Problem H:
迷い猫、走った
洋菓子専門店ストレイキャッツではたくさんの猫が飼われている。猫の数があまりにも多いため、この店のスタッフである希は餌やりに困っていた。
いくつかの場所に餌を置いても、猫は貪欲なので最も近い餌に向かってしまい、一つの餌入れにたくさんの猫が集中してしまう。
あなたは希のために、できるだけ猫が集中しない餌の配置を求める問題を解くことにした。
問題を簡単にするため、猫は平面上の y>0 の部分にいて餌を置くまで動かないとする。
猫は N 個の集団に分かれていて、一箇所に何匹もいるかもしれない。
餌入れは y=0 上の M 点に固定してあり、この中からいくつか選んで餌を入れることになる。
餌を入れると、猫は(ユークリッド距離で)一番近い餌の入った餌入れに向かうが、同じ距離に二つあるときはx座標が小さいほうに向かうものとする。
この条件の下で、最も猫が集まっている餌入れの猫の数を最小化しなさい。
Input
入力は以下のような形式で与えられる。
N M
x
1
y
1
C
1
...
x
N
y
N
C
N
x
1
...
x
M
入力の1行目には、2つの整数 N, M がスペース文字で区切られて与えられる。これらは、問題文で指定したとおりである。0 ≤ N ≤ 1000 および 1 ≤ M ≤ 1000 を満たす。
続く N 行には、それぞれの猫の集団について1行に1つずつ、集団の位置の x, y 座標を表す整数の組
(-10000 ≤ x ≤ 10000, 0 < y ≤ 10000)と何匹集まっているかを表す整数C(1 ≤ C ≤ 100000)が与えられる。
その後のM行には、それぞれの餌入れについて1行に1つずつ、餌入れの位置のx座標を表す整数(-10000 ≤ x ≤ 10000)が与えられる。
同じ点に、二つ以上の餌入れが存在することはない。
Output
最も猫が集まっている餌入れの猫の数の最小値を出力せよ。
Notes on Test Cases
上記入力形式で複数のデータセットが与えられます。各データセットに対して上記出力形式で出力を行うプログラムを作成して下さい。
N, M がともに 0 のとき入力の終わりを示します。
Sample Input
3 3
-1 1 1
0 1 1
1 1 1
-3
0
3
5 5
7 3 5
-9 2 7
4 9 6
10 5 9
-9 7 9
0
-1
-2
-9
-8
0 0
Output for Sample Input
2
20 | [
{
"submission_id": "aoj_2211_10215478",
"code_snippet": "// AOJ #2211\n// Stray Cats, Run... 2025.2.13\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n \nstruct State { int i, j; };\n \nbool feasible(ll L, const vector<int>& xGroups, const vector<ll>& weights,\n const vector<ll>... |
aoj_2212_cpp | Problem I:
盗まれた宝石
パル王国の国宝である宝石が盗賊たちに盗まれた。 冒険者のあなたはその噂を聞きつけて盗賊のアジトに向かい、なんとか宝石を取り戻すことが出来た。
ところが、宝石をパル王国の城へ返しに出向いたところ、城の守衛兵から、 「我が王はまだあなたを完全に信用していない。その宝石が本物かどうか怪しいし、そもそも宝石を取り戻したというのがウソで、王の命を狙う盗賊の仲間なのではないか？と疑っておられる。」 といわれた。
あなたは、守衛兵から本当に信頼できる人物かどうか試すための試練を与えられた。試練の内容は、 「城の地下倉庫へ行き指定された場所に宝石を置け。そこに宝石が本物だったときに反応する魔法陣が書かれてある。ただしあなたが怪しい行動を起こさないようにするため、地下倉庫の入り口から指定された場所に向かうまで、守衛兵が言った移動パターンをとってはならない。」 というものだった。
例えば、下図にある地下倉庫の形状、禁止パターンに対し、図にかかれてあるような移動パターンを取ってはならない。移動パターンの一部(赤くハイライトされている)が、禁止パターンの中に含まれるからである。(また、この移動パターンの中の2,3番目の動き「↓↓」も禁止パターンの中に含まれる)
一方、 下図のような移動パターンは、移動パターンのどの部分も禁止パターンの中に含まれないので許される。
入力として、地下倉庫の形状、禁止パターンが与えられる。禁止パターンを取らずに、入り口から魔法陣へ移動するのに最低限必要な移動回数を求めよ。
Input
入力には、地下倉庫の形状と禁止パターンが含まれる。
地下倉庫の形状は、以下のように表される。 まず、二つの整数 N,M が与えられる。それぞれ地下倉庫の行数と列数を意味する。(1 ≤ N,M ≤ 50)
続いて、それぞれM個の文字からなる文字列がN行与えられる。 含まれる文字とその意味は以下の通りである。
文字
意味
S
地下倉庫の入り口。一つの地下倉庫につき必ず一つだけ含まれる。
G
魔法陣。一つの地下倉庫につき必ず一つだけ含まれる。
.
通路。(禁止パターンをとらなければ)通ることが出来る。
#
壁。壁の中を通ることはできない。
次に、禁止パターンが与えられる。禁止パターンは以下のように表される。 まず、一つの整数 P が与えられる。禁止パターンの数を意味する。(0 ≤ P ≤ 10)
続いて、禁止パターンを意味する文字列がP行にわたって与えられる。 禁止パターンに含まれる文字とその意味は以下の通りである。
文字
意味
U
↑の移動。
R
→の移動。
D
↓の移動。
L
←の移動。
禁止パターンの長さは1以上、10以下である。 ある禁止パターンが、別の禁止パターンの部分文字列となっていることもある。また、同一の禁止パターンが含まれることもある。
Output
最低限必要な移動回数を意味する整数を出力せよ。魔法陣へ辿りつけない場合は -1 を出力せよ。
Notes on Test Cases
上記入力形式で複数のデータセットが与えられます。各データセットに対して上記出力形式で出力を行うプログラムを作成して下さい。
n, m が 0 のとき入力の終わりを示します。
Sample Input
7 6
......
.####.
.####.
...S#.
...##.
...##.
.....G
3
LD
DD
LLL
7 8
S#......
.#.####.
.#.#G.#.
.#.##.#.
.#....#.
.######.
........
8
DDDD
DDDU
UUUU
UUUD
RRRR
RRRL
LLLL
LLLR
3 8
########
S......G
########
2
U
D
6 10
..........
.S........
..........
..........
........G.
..........
0
6 7
.......
...#...
...#.S.
...###.
.G.....
.......
2
LL
DD
0 0
Output for Sample Input
13
60
7
10
-1 | [
{
"submission_id": "aoj_2212_10853818",
"code_snippet": "#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cctype>\n#include<iostream>\n#include<algorithm>\n#include<queue>\n#include<set>\n#include<map>\n#define ULL unsigned long long\n#define LL long long\nusing namespace std;\nconst int MAX... |
aoj_2203_cpp | Problem G:
Magical Island 2
まだ魔法があたりまえのように存在した時代である．ある魔導士の一族は，魔力によって作られた正方形の形の島に住んでいた．
ある時，この島に危機が訪れた．帝国が大陸間弾道魔導ミサイルを開発し，この島を照準に合わせてきたのである．この世界の魔法は地属性，水属性，火属性，風属性などに分類でき，魔導ミサイルもその四つの属性のいずれかに属していた．島の四隅にはそれぞれ地の水晶，水の水晶，火の水晶，風の水晶が配置されていて，水晶に魔力を送り込むことで対応する属性の魔法攻撃を防ぐことがきでる．
魔導士達は帝国が開発した大陸間弾道魔導ミサイルによる攻撃をかろうじて退けることができた．しかし，帝国は新たに闇属性に属する大陸間弾道魔導ミサイルを開発し，再びこの島に攻撃を仕掛けてきた．闇属性に属する魔法はこの島に設置されている水晶で防ぐことはできない．そこで魔導士達は秘術としてこの島に伝えられる光属性の防御陣を用いてミサイルを防ぐ事にした．
この光属性の防御陣はある特定の形状をした魔法陣を大地に描くことにより発動する． 魔法陣は半径
R
の円周を
M
等分し
K
個おきに直線で結んだ図形である．魔法陣は任意の大きさで描くことができるが魔法の発動には方角が重要なので，一つの角が真北を向くように描かなければならない．防御陣の効果が及ぶ範囲は描かれた魔法陣の内部（境界を含む）と一致する．またこの魔法の詠唱に必要なエネルギーは描いた魔法陣の半径
R
と等しい．
図G-1は
M
= 4，
K
= 1 の場合である．灰色の部分が魔方陣の効果が及ぶ領域である． 図G-2は
M
= 6，
K
= 2 の場合である．図のように複数の図形が生じる場合は，それらの図形のいずれかに含まれていれば防御陣としての効果が及ぶ．
図G-1:
M
= 4 ，
K
= 1 の場合 小さい丸が集落を表す
図G-2:
M
= 6 ，
K
= 2 の場合
あなたの仕事は，集落の位置，および
M
と
K
の値が与えられたときに，全ての集落をカバーするために必要となるエネルギーの最低量を求めるプログラムを書くことである．
Input
入力は複数のデータセットからなる． 各データセットは以下の形式で与えられる．
N
M
K
x
1
y
1
x
2
y
2
...
x
N
y
N
最初の一行は 3 つの整数
N
,
M
,
K
からなる．
N
は集落の数を表す．
M
,
K
については問題文に記したとおりである． 2 ≤
N
≤ 50， 3 ≤
M
≤ 50， 1 ≤
K
≤ (
M
- 1) / 2を仮定してよい．
続く
N
行は集落の位置を表す． 各行は二つの整数
x
i
と
y
i
からなる．
x
i
と
y
i
は
i
番目の集落のx座標とy座標を表す． -1000 ≤
x
i
，
y
i
≤ 1000 を仮定して良い．y軸の正方向が北を指す.
入力の終わりはスペースで区切られた3個のゼロからなる．
Output
各データセットに対し，魔法陣の最小の半径
R
を1行に出力せよ． 出力する値は10
-6
以下の誤差を含んでいても構わない．値は小数点以下何桁表示しても構わない．
Sample Input
4 4 1
1 0
0 1
-1 0
0 -1
5 6 2
1 1
4 4
2 -4
-4 2
1 5
0 0 0
Output for the Sample Input
1.000000000
6.797434948 | [
{
"submission_id": "aoj_2203_8216177",
"code_snippet": "#include <algorithm>\n#include <assert.h>\n#include <bitset>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <iomanip>\n#include <iostrea... |
aoj_2216_cpp | Problem A:
Summer of KMC
Description
KMCはコミックマーケットと呼ばれる同人即売会で毎年CDを販売している。
コミックマーケットでCDを売ることになったFであったが、Fの人気により、KMCの売り場には人が殺到し、お釣りの計算が追いつかない状態となった。そこでFは金額を入力すると即座にお釣りを出力するプログラムを書くことにした。
KMCが釣り銭として用意しているのは、100円玉と500円玉と1000円札のみである。これらの硬貨・札は無限にあるものと考えて良い。お釣りは、硬貨・札の個数が最小になるように選ぶ。また、KMCが販売するCDの値段は100の倍数であり、購入者が支払う金額も100の倍数である。
Input
入力は複数のテストケースから成る。
各テストケースは2つの正整数A, Bから成る。AはCDの値段であり、Bは購入者が支払った金額である。A, Bは100の倍数であり、100000000を超えない。また、A ≦ B である。
入力は0 0で終わる。
Output
各テストケースに対して、お釣りとして差し出すべき 100円玉、500円玉、1000円札の個数・枚数を一行でこの順番に出力する。各数字の間にはスペースを1つ入れる。
Sample Input
500 1000
100 10000
400 700
600 5000
10000 10000
0 0
Output for Sample Input
0 1 0
4 1 9
3 0 0
4 0 4
0 0 0 | [
{
"submission_id": "aoj_2216_3702261",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <functional>\n#include <vector>\n#include <utility>\n#include <cstring>\n#include <iomanip>\n#include <numeric>\n#include <limits>\n#include <cmath>\n#include <cassert>\n\nusing nam... |
aoj_2214_cpp | Problem K:
ワープホール
20XX年、遠く離れた場所に対する効率的な物質転送方式が確立され、人類の宇宙への進出はますます加速されることになった。この転送方式は、より遠くに物質を転送しようとすると、原則的により大きな物質の転送が可能になる点で革新的であった。転送方式の詳細を次に記す。
まず転送対象となる物質は、スタート座標(1, 1)にて単位質量毎のパーティクルに分割される。各パーティクルには、各々異なる波動エネルギーが与えられなければならない。波動エネルギーは、
V
と
H
からなる任意の長さの文字列で表現され、パーティクルの宇宙空間における漂い方を規定する。
V
は座標上(+1, 0)の移動を意味し、
H
は(0, +1)の移動を意味する。例えば、
VHHV
という波動エネルギーが与えられたパーティクルは、(2, 1), (2, 2), (2, 3) という軌跡で宇宙を漂った後、座標(3, 3)に辿り着く。
また、宇宙空間には複数のワープホールが存在し、パーティクルの軌跡に影響を与える。ワープホールには入口と出口があり、パーティクルがワープホールの入口に移動した場合、必ず出口の座標にワープすることになる。i番目のワープホールの入口と出口の座標を(a
i
, b
i
), (c
i
, d
i
)とすると、a
i
≤ c
i
, b
i
≤ d
i
, (a
i
, b
i
) ≠ (c
i
, d
i
)の条件が満たされており、ワープホールの入口は、他のワープホールの入口と同じ座標や、(1, 1)には存在しないことが保証されている。ただし、複数の出口が同じ場所にあったり、あるワープホールの出口に別のワープホールの入口がある場合はある(この場合は連続でワープする)。
例えば、(1, 2)を入口とし、(3, 2)を出口とするワープホールが存在した場合、
HH
と波動エネルギーを与えられたパーティクルは、(1, 2)へ移動後、(3, 2)へワープし、 (3, 3)へと辿り着く。
パーティクルは波動エネルギーを与えられると一瞬でそれに従って移動する。全てのパーティクルが同時に目的地点へ辿り着くと、自動的に元の物質へと再構成される。
あなたは宇宙開発機構のプログラマである。転送の目的座標 (N, M) と K 個のワープホールの座標対が与えられるので、一度に転送可能な物質の最大質量を求めるプログラムを書いてほしい。答えは非常に大きい数になる可能性があるため、1,000,000,007で割った余りを出力せよ。
Input
N M K
a
1
b
1
c
1
d
1
...
a
K
b
K
c
K
d
K
1 ≤ N,M ≤ 10
5
, 0 ≤ K ≤ 10
3
を満たす。また、
任意の 1 ≤ i ≤ K に対して a
i
≤ c
i
, b
i
≤ d
i
, (a
i
, b
i
) ≠ (c
i
, d
i
) を満たす。
Output
最大質量を 1,000,000,007 で割ったあまりを1行で出力せよ。
Notes on Test Cases
上記入力形式で複数のデータセットが与えられます。各データセットに対して上記出力形式で出力を行うプログラムを作成して下さい。
N, M, K がすべて 0 のとき入力の終わりを示します。
Sample Input
4 4 1
2 2 3 3
1 4 1
1 2 1 3
5 5 2
2 2 3 4
3 3 5 3
5 5 3
4 4 5 5
2 2 3 3
3 3 4 4
100000 100000 1
2 2 99999 99999
1 1 0
0 0 0
Output for Sample Input
12
1
26
18
615667476
1 | [
{
"submission_id": "aoj_2214_10866029",
"code_snippet": "#include <bits/stdc++.h>\n\n#define rep(i, j, k) for (int i = j; i < k; ++i)\n#define irep(i, j, k) for (int i = j - 1; i >= k; --i)\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef pa... |
aoj_2217_cpp | Problem B:
Let's JUMPSTYLE
Description
踊りの好きなFは，とあるダンスホールでJUMPSTYLEと呼ばれるハードコアな踊りの練習をすることにした．
フロアはN×Nの格子状にタイルが敷き詰められている．
踊りの練習をサポートするため，各タイルには次のステップに飛び移るべきタイルの座標が書かれている．Fは日々の練習によって強靭な運動神経を持っており，フロア内の任意のタイルへ飛び移ることができる．
Fは，十分に長い時間この踊りを続けていけば，いつか定常状態に入り，同じルートをただループする状態になることに気付いた．Fはこのようなループがこのフロアにいくつ存在するのか疑問に思い，プログラマであるあなたに相談することにした．
Input
入力は複数のテストケースから成る．
各テストケースはフロアの1辺の長さNを含む1行で始まる．(1 ≦ N ≦ 100)
続くN行は，フロアの各タイルに書いてあるジャンプ先の座標を以下のように表している．
は，それぞれ座標(i, j)にあるタイルに書いてあるジャンプ先のx座標およびy座標を表す．座標は0-originであり，すべての座標の値は0以上N未満の整数である．
入力は0のみから成る行で終わる．
Output
各テストケースに対し，異なるループの個数を1行で出力する．
Sample Input
1
0 0
2
1 1 0 1
1 0 0 0
2
1 1 0 1
1 1 1 0
3
0 1 2 2 2 1
0 2 1 2 2 1
0 0 0 1 1 1
4
3 2 2 0 3 2 2 1
1 1 0 3 1 1 3 1
0 3 2 3 3 0 2 3
1 1 1 1 3 2 1 3
0
Output for Sample Input
1
2
1
2
3 | [
{
"submission_id": "aoj_2217_3778511",
"code_snippet": "#include <iostream>\n\nusing namespace std;\n\nint w[101][101],h[101][101];\nbool b[101][101];\n\nint dfs(int x,int y)\n{\n \n if(x == -1 || y == -1) return 0;\n if(b[x][y]){\n w[x][y] = -1;\n h[x][y] = -1;\n return 1;\n ... |
aoj_2219_cpp | Problem D:
THE BYDOLM@STER
Description
THE BYDOLM@STER(バイドルマスター)とは1rem社より2010/4/1にEXIDNAで発売が予定されている育成シミュレーションゲームである。一応断っておくが、今月初めにネットワーク接続サービスが停止した某アーケードゲームとはたぶん関係が無い。
このゲームはバイドルたちからプロデュースするユニット(編隊)のメンバーを選択し、メンバーたちとのレッスンやコミュニケーションを通じて、彼女(彼)らをバイドルの頂点、トップバイドルに育て上げるゲームである。
各バイドルには能力値としてボーカル、ダンス、ルックスの3つのパラメータを持ち、ユニットの能力値はユニットに属している全てのバイドルのパラメータの合計値となる。ユニットの3つの能力値のうち最大の物がユニットのランクとなる。
ユニットに人数制限は無く、メンバーの人数が1体でも、3体でも、100体でもユニットとして活動できる。もちろん同じバイドルを複数雇うこと出来るが、バイドルを雇うためには費用がかかるのでこれを考慮に入れなければならない。
プロデューサーであるあなたは最高のユニットを作るためにプログラムを書いて計算することにした。
Input
入力は複数のテストケースからなる。
各テストケースの1行目にはバイドルの数Nと使用可能な費用Mが与えられる。(1<=N,M<=300)
次の2*N行には各バイドルに関しての情報が書かれている。
バイドルの情報の1行目にはバイドルの名前。バイドルの名前はアルファベットと空白から成り、30文字を以下である。また同一名のバイドルは存在しない。
2行目には整数C、V、D、Lが与えられる。Cはそのバイドルを1体雇用するコスト、Vはボーカル、Dはダンス、Lはルックスの能力値を表す。(1<=C,V,D,L<=300)
入力はEOFで終わる。
Output
与えられた費用の中で作れるユニットのランクの最大値を答えよ。
ユニットが作れない場合は0を出力せよ。
Sample Input
3 10
Dobkeradops
7 5 23 10
PataPata
1 1 2 1
dop
5 3 11 14
2 300
Bydo System Alpha
7 11 4 7
Green Inferno
300 300 300 300
Output for Sample Input
29
462 | [
{
"submission_id": "aoj_2219_8860773",
"code_snippet": "#include <algorithm>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\... |
aoj_2218_cpp | Problem C:
K Poker
Description
時は200X年、K大学で活動する謎のサークルKはその大学の文化祭の最中にK東4Fで彼らが作成した新たなゲーム、Kポーカーを発表した。
このゲームは一見すると普通のポーカーであるが、カードに基本点という要素をつけてポーカーをより奥の深いゲームにしたものである。
カードの基本点はそれぞれのカードに書かれている絵柄によって決まり、手札の点数は手札にある5枚の基本点の合計に手札の役の倍率を掛けたものになる。
この基本点を導入した事により、例えばフルハウスなどの強い役を作ったとしても基本点が0であればブタと同様に扱われてしまい、ワンペアに負けることさえある。
それ以外のルールは通常のポーカーと同じである。
このKポーカーをPCに移植しようと思ったあなたは手札の点数を計算するプログラムを書く事にした。
なおこのゲームは18歳未満の人はプレイ出来ない。
Input
入力は複数のテストケースからなる。
各テストケースの最初の行にはチェックする手札の数Nが書かれている。
次の4行には13個の整数が並びカードの基本点が1-13の順に並んで書かれている。4行のスーツは上から順にスペード、クローバー、ハート、ダイヤの順に並んでいる。
次の行には9個の整数が並び、順にワンペア、ツーペア、スリーカード、ストレート、フラッシュ、フルハウス、フォーカード、ストレートフラッシュ、ロイヤルストレートフラッシュの倍率を表している。役の倍率は必ず昇順となっている。ブタ(役無し、ノーペア)の倍率は常に0である。
次のN行には手札を表す5個の長さ2の異なる文字列が並んでいる。1文字目はカードの数値を表し,A,2,3,4,5,6,7,8,9,T,J,Q,Kのいずれかである。2文字目はカードのスーツを表し、S,C,H,Dのいずれかである。各アルファベットはAはエース、Tは10、Jはジャック、Qはクイーン、Kはキング、Sはスペード、Cはクローバー、Hはハート、Dはダイヤを表す。
入力の数値は全て[0,10000]の範囲に収まっている。
入力はEOFで終わる。
Output
各手札の点数を1行ずつ出力せよ。
連続する2つのテストケースの間には空行を1つ入れること。
役については
wikipediaのポーカー
のページを参照のこと。
なお、ストレートはエースとキングをまたぐ場合があるが、手札が10,ジャック、クイーン、キング、エースの場合にのみストレートとみなされる。
Sample Input
3
0 1 0 1 0 0 0 0 0 1 0 0 0
1 0 0 0 0 0 1 0 0 1 0 0 2
0 1 1 0 1 1 1 0 0 0 0 5 5
3 1 1 1 0 1 0 0 1 0 3 0 2
1 1 2 4 5 10 20 50 100
7H 6H 2H 5H 3H
9S 9C 9H 8H 8D
KS KH QH JD TS
10
1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1
1 1 1 1 1 1 1 1 1 1 1 1 1
1 2 3 4 5 6 7 8 9
AS 3D 2C 5D 6H
6S 6C 7D 8H 9C
TS TD QC JD JC
KD KH KC AD 2C
3D 4H 6D 5H 7C
2S KS QS AS JS
TS TD JD JC TH
8H 8D TC 8C 8S
4S 5S 3S 7S 6S
KD QD JD TD AD
Output for Sample Input
25
0
14
0
5
10
15
20
25
30
35
40
45 | [
{
"submission_id": "aoj_2218_8139138",
"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_2221_cpp | Problem F:
KULASIS
Description
KULASISとは，全学共通科目に関する情報をWeb化し，学生・教員への支援やサービスの向上を目的に，高等教育研究開発推進機構で開発・運用しているシステムの名称です。 KULASISは2003年度のオンラインシラバス開発から始まり，Web掲示板・履修登録・成績関係（採点登録・学生からの採点確認）と順次システムを拡充してきました。
学生はパソコン・携帯電話から学内外を問わず，教務情報（休講・授業変更・レポート）の確認・履修登録・採点確認等の機能を利用することができます。ログイン件数は多い日には10,000件を超え，京都大学の教務情報システムとして浸透し，全学共通科目を履修するためには欠かせないものとなっています。このKULASISを全学共通科目のみにとどまらず，学部専門課程や大学院にも適用できるよう 開発を進めています。
http://www.z.k.kyoto-u.ac.jp/introduction_kulasis.html
京大生のQは後期のシラバスを組むためにKULASISにログインしていた．
どの科目を入れようとしているか悩んでいると，突然KULASISが眩い光を放ち，別のページへと遷移した．
遷移した先のページは下図のようなものであった．5x5のマスには科目名と評価(不可，可，良，優)が書かれており，格子上には
●
のボタンが16個配置されている．
いったいなにが起きたのか分からなかったQだったが，どうやら格子上にある
●
のボタンを押すと，その右上，右下，左上，左下にあるマスの科目の評価がそれぞれ 不可→可，可→良，良→優，優→不可 と入れ替わるようであった．
●
のボタンは何度でも押すことができる．
KULASISが何者かによって書き換えられてしまったのか自分が夢を見ているのかよく分からないが，これで成績を確定できるならば，出来るだけ良い成績を得たいとQは考えた．
単位を多く集めていることに自信があったQは，単位の数そのものよりも半年後の研究室配属に備えて
戦闘力
を最大にさせることにした．
戦闘力
とは各科目の評価を，不可→0点，可→60点，良→70点，優→80点と換算して合計した値のことで，これは研究室配属の際に自分がどの程度優位なのかを表すと(Qの学科では)思われている．
いま，KULASISの画面の表示されている科目とその評価が与えられるので，得ることが出来る
戦闘力
の最大値を出力するプログラムを記してほしい．
Input
入力の1行目にはテストケースの個数が与えられる．テストケースの数は100個以下であることが保障されている．
2行目以降は5x5の数字が並び，KULASISの画面に表示されている科目の評価が与えられ，1,2,3,4がそれぞれ不可，可，良，優に対応する．
0ならばそのコマには科目は登録されていない．
テストケース同士の間は空行で区切られている．
Output
各テストケースに対し，得ることの出来る
戦闘力
の最大値を出力せよ．
Sample Input
5
1 1 0 3 3
1 1 0 3 3
0 0 0 0 0
2 2 0 4 4
2 2 0 4 4
1 1 1 0 0
1 1 1 1 0
1 0 1 1 0
0 0 1 1 1
1 1 1 1 1
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
4 3 4 3 4
3 4 3 4 3
4 3 4 3 4
3 4 3 4 3
4 3 4 3 4
2 2 2 2 2
0 0 0 2 0
2 2 0 2 0
2 2 0 2 0
0 0 0 2 0
Output for Sample Input
1280
1420
0
1920
1020 | [
{
"submission_id": "aoj_2221_10850489",
"code_snippet": "#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nvector<int> reverse_hash(int x, int b, int l) {\n\tvector<int> ret(l);\n\tint mul = 1;\n\tfor (int i = 0; i < l; i++) {\n\t\tret[i] = x / mul % b;\n\t\tmul *= b;\n\t}\... |
aoj_2223_cpp | Problem B:
Kaeru Jump
There is a frog living in a big pond. He loves jumping between lotus leaves floating on the pond. Interestingly, these leaves have strange habits. First, a leaf will sink into the water after the frog jumps from it. Second, they are aligned regularly as if they are placed on the grid points as in the example below.
Figure 1: Example of floating leaves
Recently, He came up with a puzzle game using these habits. At the beginning of the game, he is on some leaf and faces to the upper, lower, left or right side. He can jump forward or to the left or right relative to his facing direction, but not backward or diagonally. For example, suppose he is facing to the left side, then he can jump to the left, upper and lower sides but not to the right side. In each jump, he will land on the nearest leaf on his jumping direction and face to that direction regardless of his previous state. The leaf he was on will vanish into the water after the jump. The goal of this puzzle is to jump from leaf to leaf until there is only one leaf remaining.
See the example shown in the figure below.
In this situation, he has three choices, namely, the leaves A, B and C. Note that he cannot jump to the leaf D since he cannot jump backward. Suppose that he choose the leaf B. After jumping there, the situation will change as shown in the following figure.
He can jump to either leaf E or F next.
After some struggles, he found this puzzle difficult, since there are a lot of leaves on the pond. Can you help him to find out a solution?
Input
H W
c
1,1
...
c
1,
W
.
.
.
c
H
,1
...
c
H
,
W
The first line of the input contains two positive integers
H
and
W
(1 ≤
H
,
W
≤ 10). The following
H
lines, which contain
W
characters each, describe the initial configuration of the leaves and the frog using following characters:
'.’ : water
‘o’ : a leaf
‘U’ : a frog facing upward (i.e. to the upper side) on a leaf
‘D’ : a frog facing downward (i.e. to the lower side) on a leaf
‘L’ : a frog facing leftward (i.e. to the left side) on a leaf
‘R’ : a frog facing rightward (i.e. to the right side) on a leaf
You can assume that there is only one frog in each input. You can also assume that the total number of leaves (including the leaf the frog is initially on) is at most 30.
Output
Output a line consists of the characters ‘U’ (up), ‘D’ (down), ‘L’ (left) and ‘R’ (right) that describes a series of movements. The output should not contain any other characters, such as spaces. You can assume that there exists only one solution for each input.
Sample Input 1
2 3
Uo.
.oo
Output for the Sample Input 1
RDR
Sample Input 2
10 10
.o....o...
o.oo......
..oo..oo..
..o.......
..oo..oo..
..o...o.o.
o..U.o....
oo......oo
oo........
oo..oo....
Output for the Sample Input 2
URRULULDDLUURDLLLURRDLDDDRRDR
Sample Input 3
10 1
D
.
.
.
.
.
.
.
.
o
Output for the Sample Input 3
D | [
{
"submission_id": "aoj_2223_10684773",
"code_snippet": "#include <vector>\n#include <list>\n#include <map>\n#include <set>\n#include <deque>\n#include <queue>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#incl... |
aoj_2224_cpp | Problem C:
Save your cats
Nicholas Y. Alford was a cat lover. He had a garden in a village and kept many cats in his garden. The cats were so cute that people in the village also loved them.
One day, an evil witch visited the village. She envied the cats for being loved by everyone. She drove magical piles in his garden and enclosed the cats with magical fences running between the piles. She said “Your cats are shut away in the fences until they become ugly old cats.” like a curse and went away.
Nicholas tried to break the fences with a hummer, but the fences are impregnable against his effort. He went to a church and asked a priest help. The priest looked for how to destroy the magical fences in books and found they could be destroyed by holy water. The Required amount of the holy water to destroy a fence was proportional to the length of the fence. The holy water was, however, fairly expensive. So he decided to buy exactly the minimum amount of the holy water required to save all his cats. How much holy water would be required?
Input
The input has the following format:
N M
x
1
y
1
.
.
.
x
N
y
N
p
1
q
1
.
.
.
p
M
q
M
The first line of the input contains two integers
N
(2 ≤
N
≤ 10000) and
M
(1 ≤
M
).
N
indicates the number of magical piles and
M
indicates the number of magical fences. The following
N
lines describe the coordinates of the piles. Each line contains two integers
x
i
and
y
i
(-10000 ≤
x
i
,
y
i
≤ 10000). The following
M
lines describe the both ends of the fences. Each line contains two integers
p
j
and
q
j
(1 ≤
p
j
,
q
j
≤
N
). It indicates a fence runs between the
p
j
-th pile and the
q
j
-th pile.
You can assume the following:
No Piles have the same coordinates.
A pile doesn’t lie on the middle of fence.
No Fences cross each other.
There is at least one cat in each enclosed area.
It is impossible to destroy a fence partially.
A unit of holy water is required to destroy a unit length of magical fence.
Output
Output a line containing the minimum amount of the holy water required to save all his cats. Your program may output an arbitrary number of digits after the decimal point. However, the absolute error should be 0.001 or less.
Sample Input 1
3 3
0 0
3 0
0 4
1 2
2 3
3 1
Output for the Sample Input 1
3.000
Sample Input 2
4 3
0 0
-100 0
100 0
0 100
1 2
1 3
1 4
Output for the Sample Input 2
0.000
Sample Input 3
6 7
2 0
6 0
8 2
6 3
0 5
1 7
1 2
2 3
3 4
4 1
5 1
5 4
5 6
Output for the Sample Input 3
7.236
Sample Input 4
6 6
0 0
0 1
1 0
30 0
0 40
30 40
1 2
2 3
3 1
4 5
5 6
6 4
Output for the Sample Input 4
31.000 | [
{
"submission_id": "aoj_2224_10848478",
"code_snippet": "#include <iostream>\n#include <cstring>\n#include <cstdio>\n#include <cmath>\n#include <vector>\nusing namespace std;\nconst int maxn=1e4+5;\ntypedef long long LL;\nstruct Point\n{\n int x;\n int y;\n};\n\nstruct edge\n{\n int to;\n doubl... |
aoj_2231_cpp | Problem J:
Cruel Bingo
Bingo is a party game played by many players and one game master. Each player is given a bingo card containing
N
2
different numbers in a
N
×
N
grid (typically
N
= 5). The master draws numbers from a lottery one by one during the game. Each time a number is drawn, a player marks a square with that number if it exists. The player’s goal is to have
N
marked squares in a single vertical, horizontal, or diagonal line and then call “Bingo!” The first player calling “Bingo!” wins the game.
In ultimately unfortunate cases, a card can have exactly
N
unmarked squares, or
N
(
N
-1) marked squares, but not a bingo pattern. Your task in this problem is to write a program counting how many such patterns are possible from a given initial pattern, which contains zero or more marked squares.
Input
The input is given in the following format:
N K
x
1
y
1
.
.
.
x
K
y
K
The input begins with a line containing two numbers
N
(1 ≤
N
≤ 32) and
K
(0 ≤
K
≤ 8), which represent the size of the bingo card and the number of marked squares in the initial pattern respectively.
Then
K
lines follow, each containing two numbers
x
i
and
y
i
to indicate the square at (
x
i
,
y
i
) is marked. The coordinate values are zero-based (i.e. 0 ≤
x
i
,
y
i
≤
N
- 1). No pair of marked squares coincides.
Output
Count the number of possible non-bingo patterns with exactly
N
unmarked squares that can be made from the given initial pattern, and print the number in modulo 10007 in a line (since it is supposed to be huge). Rotated and mirrored patterns should be regarded as different and counted each.
Sample Input 1
4 2
0 2
3 1
Output for the Sample Input 1
6
Sample Input 2
4 2
2 3
3 2
Output for the Sample Input 2
6
Sample Input 3
10 3
0 0
4 4
1 4
Output for the Sample Input 3
1127 | [
{
"submission_id": "aoj_2231_4303458",
"code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n//#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define MOD 10007\n\... |
aoj_2227_cpp | Problem F:
Bouldering
Bouldering is a style of rock climbing. Boulderers are to climb up the rock with bare hands without supporting ropes. Your friend supposed that it should be interesting and exciting, so he decided to come to bouldering gymnasium to practice bouldering. Since your friend has not tried bouldering yet, he chose beginner’s course. However, in the beginner’s course, he found that some of two stones have too distant space between them, which might result his accidentally failure of grabbing certain stone and falling off to the ground and die! He gradually becomes anxious and wonders whether the course is actually for the beginners. So, he asked you to write the program which simulates the way he climbs up and checks whether he can climb up to the goal successfully.
For the sake of convenience, we assume that a boulderer consists of 5 line segments, representing his body, his right arm, his left arm, his right leg, and his left leg.
One of his end of the body is connected to his arms on their end points. And the other end of the body is connected to his legs on their end points, too. The maximum length of his body, his arms, and his legs are
A
,
B
and
C
respectively. He climbs up the wall by changing the length of his body parts from 0 to their maximum length, and by twisting them in any angle (in other word, 360 degrees). Refer the following figure representing the possible body arrangements.
Figure 2: An example of possible body arrangements.
5 line segments representing his body, arms and legs. The length of his body, arms and legs are 8, 3 and 4 respectively. The picture describes his head as a filled circle for better understanding, which has no meaning in this problem.
A boulderer climbs up the wall by grabbing at least three different rocks on the wall with his hands and feet. In the initial state, he holds 4 rocks with his hands and feet. Then he changes one of the holding rocks by moving his arms and/or legs. This is counted as one movement. His goal is to grab a rock named “destination rock” with one of his body parts. The rocks are considered as points with negligible size. You are to write a program which calculates the minimum number of movements required to grab the destination rock.
Input
The input data looks like the following lines:
n
A B C
x
1
y
1
x
2
y
2
x
3
y
3
.
.
.
x
n
y
n
The first line contains
n
(5 ≤
n
≤ 30), which represents the number of rocks.
The second line contains three integers
A
,
B
,
C
(1 ≤
A
,
B
,
C
≤ 50), which represent the length of body, arms, and legs of the climber respectively.
The last
n
lines describes the location of the rocks. The
i
-th contains two integers
x
i
and
y
i
(0 ≤
x
i
,
y
i
≤ 100), representing the
x
and
y
-coordinates of the
i
-th rock.
In the initial state, the boulderer is grabbing the 1st rock with his right hand, 2nd with his left hand, 3rd with his right foot, and 4th with left foot.
You may assume that the first 4 rocks are close to each other so that he can grab them
...(truncated) | [
{
"submission_id": "aoj_2227_10852749",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nconst double eps = 1e-3;\n\nconst double pi =acos(-1.0);\n\nstruct Point\n{\n double x,y;\n Point() {... |
aoj_2225_cpp | Problem D:
Dungeon Wall
In 2337, people are bored at daily life and have crazy desire of having extraordinary experience. These days,“Dungeon Adventure” is one of the hottest attractions, where brave adventurers risk their lives to kill the evil monsters and save the world.
You are a manager of one of such dungeons. Recently you have been receiving a lot of complaints from soldiers who frequently enter your dungeon; they say your dungeon is too easy and they do not want to enter again. You are considering making your dungeon more difficult by increasing the distance between the entrance and the exit of your dungeon so that more monsters can approach the adventurers.
The shape of your dungeon is a rectangle whose width is
W
and whose height is
H
. The dungeon is a grid which consists of
W
×
H
square rooms of identical size 1 × 1. The southwest corner of the dungeon
has the coordinate (0; 0), and the northeast corner has (
W
,
H
). The outside of the dungeon is surrounded by walls, and there may be some more walls inside the dungeon in order to prevent adventurers from going directly to the exit. Each wall in the dungeon is parallel to either
x
-axis or
y
-axis, and both ends of each wall are at integer coordinates. An adventurer can move from one room to another room if they are adjacent vertically or horizontally and have no wall between.
You would like to add some walls to make the shortest path between the entrance and the exit longer. However, severe financial situation only allows you to build at most only one wall of a unit length. Note that a new wall must also follow the constraints stated above. Furthermore, you need to guarantee that there is at least one path from the entrance to the exit.
You are wondering where you should put a new wall to maximize the minimum number of steps between the entrance and the exit. Can you figure it out?
Input
W H N
sx
0
sy
0
dx
0
dy
0
sx
1
sy
1
dx
1
dy
1
.
.
.
ix iy
ox oy
The first line contains three integers:
W
,
H
and
N
(1 ≤
W
,
H
≤ 50, 0 ≤
N
≤ 1000). They are separated with a space.
The next
N
lines contain the specifications of
N
walls inside the dungeon. Each wall specification is a line containing four integers. The
i
-th specification contains
sx
i
,
sy
i
,
dx
i
and
dy
i
, separated with a space. These integers give the position of the
i
-th wall: it spans from (
sx
i
,
sy
i
) to (
dx
i
,
dy
i
).
The last two lines contain information about the locations of the entrance and the exit. The first line contains two integers
ix
and
iy
, and the second line contains two integers
ox
and
oy
. The entrance is located at the room whose south-west corner is (
ix
,
iy
), and the exit is located at the room whose southwest corner is (
ox
,
oy
).
Output
Print the maximum possible increase in the minimum number of required steps between the entrance and the exit just by adding one wall. If there is no good place to build a new wall, print zero.
Sample Input 1
3 4 4
1 0 1 1
1 3 1 4
1 2 2 2
2 1 2 3
0 0
1 0
Output
...(truncated) | [
{
"submission_id": "aoj_2225_10853847",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<math.h>\n#include<algorithm>\nusing namespace std;\n#define maxw 55\n#define maxn 1010\n\nint n;\nint w;\nint h;\nbool wall[maxw][maxw][4];\nint mp[maxw][maxw];\nint ix,iy;\nint ox,oy;\nint que[maxw*maxw... |
aoj_2226_cpp | Problem E:
Psychic Accelerator
In the west of Tokyo, there is a city named “Academy City.” There are many schools and laboratories to develop psychics in Academy City.
You are a psychic student of a school in Academy City. Your psychic ability is to give acceleration to a certain object.
You can use your psychic ability anytime and anywhere, but there are constraints. If the object remains stationary, you can give acceleration to the object in any direction. If the object is moving, you can give acceleration to the object only in 1) the direction the object is moving to, 2) the direction opposite to it, or 3) the direction perpendicular to it.
Today’s training menu is to move the object along a given course. For simplicity you can regard the course as consisting of line segments and circular arcs in a 2-dimensional space. The course has no branching. All segments and arcs are connected smoothly, i.e. there are no sharp corners.
In the beginning, the object is placed at the starting point of the first line segment. You have to move the object to the ending point of the last line segment along the course and stop the object at that point by controlling its acceleration properly. Before the training, a coach ordered you to simulate the minimum time to move the object from the starting point to the ending point.
Your task is to write a program which reads the shape of the course and the maximum acceleration
a
max
you can give to the object and calculates the minimum time to move the object from the starting point to the ending point.
The object follows basic physical laws. When the object is moving straight in some direction, with acceleration either forward or backward, the following equations hold:
v
=
v
0
+
at
and
s
=
v
0
t
+ (1/2)
at
2
where
v
,
s
,
v
0
,
a
, and
t
are the velocity, the distance from the starting point, the initial velocity (i.e. the velocity at the starting point), the acceleration, and the time the object has been moving in that direction, respectively. Note that they can be simplified as follows:
v
2
−
v
0
2
= 2
as
When the object is moving along an arc, with acceleration to the centroid, the following equations hold:
a
=
v
2
/
r
wher
v
,
a
, and
r
are the velocity, the acceleration, and the radius of the arc, respectively. Note that the object cannot change the velocity due to the criteria on your psychic ability.
Input
The input has the following format:
N a
max
x
a
,1
y
a
,1
x
b
,1
y
b
,1
x
a
,2
y
a
,2
x
b
,2
y
b
,2
.
.
.
N
is the number of line segments;
a
max
is the maximum acceleration you can give to the object; (
x
a,i
,
y
a,i
) and (
x
b,i
,
y
b,i
) are the starting point and the ending point of the
i
-th line segment, respectively. The given course may have crosses but you cannot change the direction there.
The input meets the following constraints: 0 <
N
≤ 40000, 1 ≤
a
max
≤ 100, and -100 ≤
x
a
i
,
y
a
i
,
x
b
i
,
y
b
i
≤ 100.
Output
Print the minimum time to move the object from the starting point to the ending poi
...(truncated) | [
{
"submission_id": "aoj_2226_10851598",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cctype>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <map>\n#include <algorithm>\n#include <iostream>\n#include <string>\n#include <set>\n#defin... |
aoj_2230_cpp | Problem I:
How to Create a Good Game
A video game company called ICPC (International Company for Playing and Competing) is now developing a new arcade game. The new game features a lot of branches. This makes the game enjoyable for everyone, since players can choose their routes in the game depending on their skills. Rookie players can choose an easy route to enjoy the game, and talented players can choose their favorite routes to get high scores.
In the game, there are many checkpoints connected by paths. Each path consists of several stages, and completing stages on a path leads players to the next checkpoint. The game ends when players reach a particular checkpoint. At some checkpoints, players can choose which way to go, so routes diverge at that time. Sometimes different routes join together at a checkpoint. The paths between checkpoints are directed, and there is no loop (otherwise, players can play the game forever). In other words, the structure of the game can be viewed as a DAG (directed acyclic graph), when considering paths between checkpoints as directed edges.
Recently, the development team completed the beta version of the game and received feedbacks from other teams. They were quite positive overall, but there are some comments that should be taken into consideration. Some testers pointed out that some routes were very short compared to the longest ones. Indeed, in the beta version, the number of stages in one play can vary drastically depending on the routes. Game designers complained many brilliant ideas of theirs were unused in the beta version because of the tight development schedule. They wanted to have more stages included in the final product.
However, it’s not easy to add more stages. this is an arcade game – if the playing time was too long, it would bring down the income of the game and owners of arcades would complain. So, the longest route of the final product can’t be longer than that of the beta version. Moreover, the producer of the game didn’t want to change the structure of paths (i.e., how the checkpoints connect to each other), since it would require rewriting the scenario, recording voices, creating new cutscenes, etc.
Considering all together, the producer decided to add as many new stages as possible, while keeping the maximum possible number of stages in one play and the structure of paths unchanged. How many new stages can be added to the game?
Input
N M
x
1
y
1
s
1
.
.
.
x
M
y
M
s
M
The first line of the input contains two positive integers
N
and
M
(2 ≤
N
≤ 100, 1 ≤
M
≤ 1000).
N
indicates the number of checkpoints, including the opening and ending of the game.
M
indicates the number of paths between checkpoints.
The following
M
lines describe the structure of paths in the beta version of the game. The
i
-th line contains three integers
x
i
,
y
i
and
s
i
(0 ≤
x
i
<
y
i
≤
N
- 1, 1 ≤
s
i
≤ 1000), which describe that there is a path from checkpoint
x
i
to
y
i
consists of si stages. As for indices of the check
...(truncated) | [
{
"submission_id": "aoj_2230_10850465",
"code_snippet": "#include<cstdio>\n#include<cstring>\n#include<cmath>\n#include<algorithm>\n#define add(a,b,c) (e[i]=b,pre[i]=last[a],last[a]=i,w[i]=c)\n#define prec 1e-6\n#define inf 1e9\nusing namespace std;\nstruct edge\n{ int u,v,w;\n edge(int u=0,int v=0,int... |
aoj_2229_cpp | Problem H:
Ropeway
On a small island, there are two towns Darkside and Sunnyside, with steep mountains between them. There’s a company Intertown Company of Package Conveyance; they own a ropeway car between Darkside and Sunnyside and are running a transportation business. They want maximize the revenue by loading as much package as possible on the ropeway car.
The ropeway car looks like the following. It’s
L
length long, and the center of it is hung from the rope. Let’s suppose the car to be a 1-dimensional line segment, and a package to be a point lying on the line. You can put packages at anywhere including the edge of the car, as long as the distance between the package and the center of the car is greater than or equal to R and the car doesn’t fall down.
The car will fall down when the following condition holds:
Here
N
is the number of packages;
m
i
the weight of the
i
-th package;
x
i
is the position of the
i
-th package relative to the center of the car.
You, a Darkside programmer, are hired as an engineer of the company. Your task is to write a program which reads a list of package and checks if all the packages can be loaded in the listed order without the car falling down at any point.
Input
The input has two lines, describing one test case. The first line contains four integers
N
,
L
,
M
,
R
. The second line contains
N
integers
m
0
,
m
1
, ...
m
N
-1
. The integers are separated by a space.
Output
If there is a way to load all the packages, output “Yes” in one line, without the quotes. Otherwise, output “No”.
Sample Input 1
3 3 2 1
1 1 4
Output for the Sample Input 1
Yes
Sample Input 2
3 3 2 1
1 4 1
Output for the Sample Input 2
No | [
{
"submission_id": "aoj_2229_1574246",
"code_snippet": "#include <cstdlib>\n#include <cctype>\n#include <cstring>\n#include <cstdio>\n#include <cmath>\n#include <algorithm>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <sstream>\n#include <map>\n#include <set>\n#include <queue>\n#incl... |
aoj_2232_cpp | Problem A: Ennichi
縁日に来たうさぎが, ある出店のゲームの景品がキャロットケーキであるのを見つけた. このゲームのルールは以下の通りである.
縦h マス× 横w マスの格子状のフィールドがあり, 各マスにつき高々1 個のブロックが置かれる. 各ブロックにはアルファベット大文字(‘A’ - ‘Z’) のいずれかで表される色がついている. 同色のブロックが縦または横に一直線上にn 個以上連続して並ぶと, それらのブロックは消滅する.
参加者は横に隣り合う2 つのマスを選んで, それらの状態を互いに入れ替える操作ができる. ブロックの入れ替え, 消滅, 落下によってブロックの有るマスの1 つ下のマスにブロックが無くなると, このブロックは落下する. このときふたたび同色のブロックがn 個以上並ぶと消滅する. ただし, ブロックの消滅は, 落下するブロックが存在する間は起こらず, すべてのブロックの落下が終了したタイミングで同時に起こる.
1 回の操作でフィールド上のすべてのブロックを消滅させると, このゲームは成功となり景品のケーキを得ることができる. うさぎは1 回分の参加費で確実にケーキを手に入れたく, それができない場合は参加したくない. ゲーム開始時のフィールドの状態から, うさぎがこのゲームに参加すべきであるか答えよ.
Input
入力の一行目にはh, w, n がスペースで区切られて与えられる.
2 ≤
h
,
w
,
n
≤ 30
続く
h
行にはフィールドの状態が上から順に与えられる. アルファベット大文字はブロックを, ‘.’ は空きマスを表す. 与えられるフィールドの状態には, 縦あるいは横に
n
個以上連続する同色のブロックはなく, 落下する状態にあるブロックもない. 1 個以上のブロックが存在する.
Output
うさぎがこのゲームに参加すべきであるなら”YES”を, そうでないなら”NO”を一行に出力せよ.
Sample Input 1
4 6 3
......
...Y..
...Y..
RRYRYY
Sample Output 2
YES
Sample Input 1
4 6 3
......
...Y..
...Y..
RRYRY.
Sample Output 2
NO | [
{
"submission_id": "aoj_2232_11059717",
"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_2234_cpp | Problem C: Usagitobi
m
×
n
マスの盤がある.
i
行
j
列のマスを(
i
,
j
) (0 ≤
i
<
m
, 0 ≤
j
<
n
) で表す.
うさぎは(
x
,
y
) にいるとき, ((
x
+
a
) mod
m
, (
y
+
b
) mod
n
) または((
x
+
c
) mod
m
, (
y
+
d
) mod
n
) へ跳ぶことができる.
いま, うさぎが(0, 0) にいる. 一度跳び立ったマスへ再び行くことはできないとするとき, うさぎは最大何回跳ぶことができるか.
Input
入力は一行に
m
,
n
,
a
,
b
,
c
,
d
がスペース区切りで与えられる. 1 ≤
m
,
n
,
a
,
b
,
c
,
d
≤ 100 000
Output
うさぎが跳べる最大回数を一行に出力せよ.
Sample Input 1
6 6 2 2 2 4
Sample Output 1
8 | [
{
"submission_id": "aoj_2234_7242501",
"code_snippet": "#include <iostream>\n#include <map>\n#include <vector>\nusing namespace std;\n\nlong long GCD(long long a, long long b) {\n\tif (b == 0) return a;\n\treturn GCD(b, a % b);\n}\n\nlong long GetAnswer(long long H, long long W, long long A, long long B, lo... |
aoj_2233_cpp | Problem B: Carrot Tour
うさぎがある国を旅行している. この国には1 から
n
の番号がついた
n
個の都市があり, うさぎは今都市1にいる. 都市
i
は座標平面上の1 点(
x
i
,
y
i
) とみなす.
うさぎは以下の条件をみたすように旅をする.
移動経路は折れ線であり, その各部分は異なる2 都市を結ぶ線分でなければならない.
移動経路の全長は
r
以下でなければならない. 経路のうち重なった部分も, 通った回数分数える.
移動する方向が変わるとき, 曲がる角度は
θ
以下でなければならない. 最初の移動方向に制限はない.
うさぎがある都市から別の都市へ移動をすると, 移動先の都市でニンジンを1 本もらえる. 同じ都市を複数回訪れることは可能であり, 訪れるたびにニンジンをもらえる. うさぎがこの旅で手に入れることのできるニンジンの本数の最大値を求めよ.
Input
入力の一行目には一つの整数
n
が, 二行目には二つの実数
r
,
θ
がスペースで区切られて与えられる.
1 ≤
n
≤ 20
0 <
r
< 10
4
0° <
θ
< 180°
続く
n
行には, 整数
x
i
,
y
i
がスペースで区切られて与えられる
-10 000 ≤
x
i
,
y
i
≤ 10 000
r
,
θ
を±10
−3
以内で変化させても答えは変わらない.
どの2 つの都市の位置も異なる.
Output
うさぎがこの旅で手に入れることのできるニンジンの本数の最大値を一行に出力せよ.
Sample Input 1
5
100.1 90.1
0 0
0 10
5 5
10 0
10 10
Sample Output 1
10 | [
{
"submission_id": "aoj_2233_10880835",
"code_snippet": "#define _USE_MATH_DEFINES\n#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint x[22], y[22];\ndouble r, theta;\n\nbool check_angle(int p, int i, int n) {\n\tdouble a1 = x[i] - x[p], a2 = y[i] - y[p];\n\tdouble b1 = x[n] - x[i],... |
aoj_2238_cpp | Problem G: Nurie
紙の上に円が
n
個書かれている. うさぎは
k
色の絵の具を持っていて, 次のルールに従って紙に色を塗っていく.
各領域をある1 色の絵の具で塗るか, 何も塗らない. ここで「領域」とは, 円弧の集合で囲まれた面積有限の部分を指す.
隣り合っている2 つの領域を同じ色の絵の具で塗ることはできない. ここで「隣り合っている」とは,境界の一部を共有する円弧があることを指す. 共有点が有限個である2 つの領域は, 隣り合っているとはみなされない.
隣り合っている2 つの領域の両方を塗らないままにすることは許される.
うさぎはできるだけ多くの領域を絵の具で塗りたい. 塗れる領域の個数の最大値を求めよ.
Input
1 行目:
n k
(1 ≤
n
≤ 20, 1 ≤
k
≤ 1 000 000 000)
2-(
n
+ 1) 行目:
x
i
y
i
r
i
, (−1 000 ≤
x
i
,
y
i
≤ 1 000, 1 ≤
r
i
≤ 1 000) (整数)
どの2 つの円も一致しない.
いずれか2 円の交点として得られる点集合は, 距離が10
−3
以下の異なる2 点を含まない.
Output
絵の具で塗れる領域の個数の最大値を一行に出力せよ.
Sample Input 1
2 1
10 0 10
20 0 10
Sample Output 1
2 | [
{
"submission_id": "aoj_2238_2266327",
"code_snippet": "#include<bits/stdc++.h>\n#define MAX 1024\n#define inf 1<<29\n#define linf (1e16)\n#define eps (1e-8)\n#define Eps (1e-15)\n#define mod 1000000007\n#define pi acos(-1.0)\n#define phi (1.0+sqrt(5.0))/2.0\n#define f first\n#define s second\n#define mp ma... |
aoj_2239_cpp | Problem H: Nearest Station
うさぎがある電車のチケットを
n
枚持っている. チケットにはそれぞれ0 から
n
− 1 までの番号がついていて,
k
番のチケットを使うと,
p
⋅
a
k
+
q
⋅
b
k
駅進むことができる.
うさぎは今いる駅から
m
駅進んだ駅にあるニンジン食べ放題の店に行きたいが, なるべく歩く距離を短くしたい. 駅は等間隔に並んでいる. チケットを電車の上り線で進むことのみに用いるとき, うさぎは最小何駅分の徒歩で店に着けるか.
Input
1 ≤
n
,
m
,
a
,
b
,
p
,
q
≤ 1 000 000 000 000 (整数)
Output
うさぎは最小何駅分の徒歩で店に着けるか, その数を一行に出力せよ.
Sample Input 1
6 200 2 3 4 5
Sample Output 1
1
Sample Input 2
6 1 2 3 4 5
Sample Output 2
1 | [
{
"submission_id": "aoj_2239_10866027",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing VS = vector<string>; using LL = long long;\nusing VI = vector<int>; using VVI = vector<VI>;\nusing PII = pair<int, int>; using PLL = pair<LL, LL>;\nusing VL = vector<LL>; using ... |
aoj_2236_cpp | Problem E: Rabbit Plays Games!
うさぎがとあるロールプレイングゲームで遊んでいる. 城に入る直前で, 敵に待ち伏せされていた！
うさぎが操作する主人公1 人と,
n
体の敵との戦闘となった. 各キャラクターには4 つの能力値, 体力
h
i
, 攻撃力
a
i
, 防御力
d
i
, 敏捷
s
i
が定められている.
i
= 0 は主人公の情報, 1 ≤
i
≤
n
は各敵の情報を表す.
戦闘はターン制である. 各ターン, 生き残っているキャラクターが, 敏捷の値が高い順に攻撃を行う. 敵は必ず主人公を攻撃する. 主人公は敵1 体を攻撃するが, どの敵を攻撃するかは毎ターンごとに主人公が選べる.攻撃力
a
のキャラクターが防御力
d
のキャラクターに攻撃するとき, max{
a
−
d
, 0} のダメージが与えられる. 受けたダメージの合計が体力の値以上になったキャラクターは直ちに戦闘不能になってしまう. 主人公が戦闘不能になったとき, あるいは敵がすべて戦闘不能になったとき, 戦闘は終了する.
Input
1 ≤
n
≤ 40 000
1 ≤
h
i
,
a
i
,
d
i
,
s
i
≤ 1 000 000 000 (整数)
s
i
はすべて異なる.
Output
主人公が必ず戦闘不能になってしまうとき, −1 を出力せよ. そうでないとき, 主人公が受けるダメージの合計の最小値を一行に出力せよ.
Sample Input 1
2
10 3 1 2
2 4 1 3
2 2 1 1
Sample Output 1
4
Sample Input 2
1
1 1 1 1
10000 10000 10000 10000
Sample Output 2
-1 | [
{
"submission_id": "aoj_2236_10511586",
"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_2237_cpp | Problem F: The Castle
待ち伏せていた敵を見事撃破したうさぎは, 主人公を敵の城内に進めることに成功した. 主人公が城の地下牢に捕らわれていたねこたちを解放したところ, 彼らのうちの何匹かが主人公の力になってくれることになった.
ねこたちの話では, 城の奥にいる魔王に辿りつくには1 番から
n
番の
n
個の部屋をこの順に通り抜けることになるが, 各部屋には1 体ずつ敵が待ち受けていて逐一倒していかなければならないという. 仲間になった
m
匹のねこそれぞれについて, 各部屋の敵それぞれに対する勝率が分かっており, 主人公はこのねこたちを1 匹ずつ城の奥へ向けて派遣する. 各部屋はそこにいる敵を倒してからでなければ通過できないので, あるねこがある部屋の敵にやられたら, 次のねこはその部屋の敵から戦っていくことになる.
派遣されたねこは敵にやられるまで進むが, 派遣したねこがどの部屋の敵にやられたかは毎回知ることができ, それによって次にどのねこを派遣するかを決めることができる. どのようにすれば, ねこたちが待ち受けるすべての敵を倒せる確率が最大になるだろうか.
Input
入力の一行目には
m
と
n
がスペースで区切られて与えられる. 1 ≤
m
,
n
≤ 16
つづく
m
行には, 猫が敵に勝つ確率を表す
n
個の実数が与えられる.
i
+ 1 行目の
j
個目の実数は,
j
番の部屋の敵に勝つ確率を表している. 確率は小数点以下3 桁まで.
Output
ねこたちが待ち受けるすべての敵を倒せる確率が最大になるようにうまく順番を決めていくとき, その確率を答えよ. 出力は誤差を含んでいてもよいが, 真の値との誤差は10
−9
以内にせよ.
Sample Input 1
2 3
0.900 0.500 0.100
0.500 0.500 0.500
Sample Output 1
0.372500000000 | [
{
"submission_id": "aoj_2237_10373053",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n// #include \"Src/Utility/BinarySearch.hpp\"\n// #include \"Src/Sequence/CompressedSequence.hpp\"\n// #includ... |
aoj_2235_cpp | Problem D: Graph Construction
n
匹のうさぎがいて, 0 番から
n
− 1 番の番号がついた小屋に1 匹ずつ住んでいる.
あるとき, 秘密の組織によって地下通路の建設工事が行われる, という情報がうさぎたちのもとへ入った. 地下通路を使えば, うさぎたちは他のうさぎたちの小屋へ遊びに行けるようになって嬉しい.
通路は両方向に進むことができ, また通路同士は交わらない. 諸事情により, 一度建設された通路が破壊されてしまうこともある. 通路の建設や破壊の工事は1 本ずつ行われ, 各工事中はうさぎは自分の小屋に留まっているものとする.
うさぎたちは, 工事のいくつかの段階において, あるうさぎとあるうさぎが遊べるかどうかを事前に知りたい. うさぎたちは仲良しなので, 遊びに行くときに他のうさぎの小屋を自由に通ることができる. プログラミングが好きなうさぎたちは, 昔似たような問題を解いたので簡単だろうと思って挑戦し出したが, なかなか効率の良いプログラムが書けない. うさぎの代わりにこの問題を解け.
Input
入力の一行目には
n
と
k
がスペース区切りで与えられる。2 ≤
n
≤ 40 000, 1 ≤
k
≤ 40 000
つづく
k
行には工事情報と質問が合わせて, 時間順に与えられる.
“1
u v
” — 小屋
u
と
v
を結ぶ通路が建設される. 小屋
u
と
v
を結ぶ通路がないときにのみ現れる.
“2
u v
” — 小屋
u
と
v
を結ぶ通路が破壊される. 小屋
u
と
v
を結ぶ通路があるときにのみ現れる.
“3
u v
” — 小屋
u
と
v
のうさぎが遊べるかどうか判定せよ.
0 ≤
u
<
v
<
n
Output
入力に現れる各質問について, 遊べるなら”YES”を, そうでないなら”NO”を1 行ずつ出力せよ.
Sample Input 1
4 10
1 0 1
1 0 2
3 1 2
2 0 1
1 2 3
3 0 1
1 0 1
2 0 2
1 1 3
3 0 2
Sample Output 1
YES
NO
YES | [
{
"submission_id": "aoj_2235_10456769",
"code_snippet": "// competitive-verifier: PROBLEM\n#include <iostream>\n#include <utility>\n#include <vector>\n#include <algorithm>\n#include <bit>\n#include <cassert>\n#include <map>\n#include <stack>\n/**\n * @brief Undo可能Union-Find\n * @details Implement (union by ... |
aoj_2240_cpp | Problem I: Lapin Noir
ここは, 地面が正六角形を敷き詰めたマス目になっている街である. 各マスは, 下の図のように2 つの整数で表される.
ねこは(0, 0) のマスへ行こうとしている. いたずら好きの黒うさぎはこのことを知って, ねこの邪魔をしようと考えた.
黒うさぎはねこがいるマスへ跳び, その周りの6 マスのうち1 つまたは隣り合う2 つをブロックすることができる. ねこは周りの6 マスのうち, ブロックされていないマスを1 つ選んで進む. ねこが動くたび黒うさぎはねこを追いかけ, またブロックを行うことができる. 黒うさぎが動くと元のブロックは解除される. 下の図はブロックの様子を示している.
この街にはねこの縄張りとなっているマス目がいくつかある. 縄張りは正六角形の周をなすマス目の集合
n
個の合併として表される. 黒うさぎはねこの縄張りに立ち入ることはできるが, ブロックすることはできない.つまり, ねこは縄張り内であれば自由に動ける.
ねこの出発点の候補が
k
個あり, マス(
x
i
,
y
i
) (1 ≤
i
≤
k
) である. それぞれについて, ねこが必ず目的地(0, 0) に辿り着けるか, あるいは黒うさぎがうまく妨害することによってねこが目的地に辿り着けないかを判定せよ.
Input
1 行目:1 ≤
n
≤ 40 000
2 ∼ (
n
+ 1) 行目: ねこの縄張りを表す正六角形の頂点
(
n
+ 2) 行目: 1 ≤
k
≤ 40 000
(
n
+ 3) ∼ (
n
+
k
+ 2) 行目: ねこの出発点
x
i
,
y
i
−1 000 000 000 ≤ (各座標) ≤ 1 000 000 000
ねこの縄張りを表す正六角形は, 6 頂点の位置が反時計回りに与えられる.
Output
出発地の候補それぞれについて, ねこが必ず目的地(0,0) に辿り着けるなら”YES”を, あるいは黒うさぎがうまく妨害した場合ねこが目的地に辿り着けないなら”NO”を, 一行ずつ出力せよ.
Sample Input 1
2
1 -1 3 -1 3 1 1 3 -1 3 -1 1
3 0 4 0 4 1 3 2 2 2 2 1
3
1 1
-1 -1
2 4
Sample Output 1
YES
NO
YES | [
{
"submission_id": "aoj_2240_4872355",
"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 40005\n\n... |
aoj_2241_cpp | Problem J: Usaneko Matrix
うさぎとねこが勝負をしている. ルールは以下の通りである.
まず2 匹はそれぞれ
n
行
n
列の正方形状に
n
2
個の整数を紙に書き, トランプを1 枚ずつ引く. 次に, 1 から 1 000 000 までの数が1 つずつ書かれた1 000 000 枚のカードを2 匹でシャッフルし, これを1 枚ずつ交互に引いていく. 2 匹はカードが引かれるたび, カードと同じ数が自分の紙に書かれていたらそれに印をつける. 「印がついた
n
個の数の組であって, 一直線上に並んでいるもの」の個数が, はじめに引いたトランプの数以上になることを勝利条件とする.
与えられた
m
枚目のカードまでで, うさぎとねこのどちらが勝つか答えよ. ただし勝敗は, あるカードが引かれて印をつけ終わった段階で2 匹のうち片方のみが勝利条件をみたしたときに決まるものとし, それ以外の場合は引き分けとする. いずれかが勝利条件をみたした後でもカードが引かれることはあるが, これは勝敗に影響しない.
Input
1 行目：“
n u v m
” (正方形のサイズ, うさぎのトランプの数, ねこのトランプの数, 引かれるカードの枚数) 2-(
N
+ 1) 行目：うさぎが紙に書く
n
2
個の数(
N
+ 2)-(2
N
+ 1) 行目：ねこが紙に書く
n
2
個の数(2
N
+ 2)-(2
N
+
M
+ 1) 行目：引かれるm 枚のカード
1 ≤
n
≤ 500
1 ≤
u
,
v
≤ 13
1 ≤
m
≤ 100 000
1 ≤ (書かれる数) ≤ 1 000 000
うさぎが紙に書く
n
2
個の数, ねこが紙に書く
n
2
個の数, 引かれる
m
枚のカードに書かれた数はそれぞれの中で異なる.
Output
うさぎが勝つ場合には”USAGI”を, ねこが勝つ場合には”NEKO”を, 引き分けならば”DRAW”, それぞれ
一行に出力せよ.
Sample Input 1
3 2 2 10
1 2 3
4 5 6
7 8 9
1 2 3
6 5 4
7 8 9
11
4
7
5
10
9
2
1
3
8
Sample Output 1
USAGI
Sample Input 2
3 2 1 10
1 2 3
4 5 6
7 8 9
1 2 3
6 5 4
7 8 9
11
4
7
5
10
9
2
1
3
8
Sample Output 2
DRAW | [
{
"submission_id": "aoj_2241_10850418",
"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 int long long\n#define FOR(i, m, n) for (int i = (m); i < (n); i++)\n#define all(x) x.begin(), x.end()\nusing pii = pair<int, int>;\n\nint A[5... |
aoj_2242_cpp | Problem A:
Era Name
As many of you know, we have two major calendar systems used in Japan today. One of them
is Gregorian calendar which is widely used across the world. It is also known as “Western
calendar” in Japan.
The other calendar system is era-based calendar, or so-called “Japanese calendar.” This system
comes from ancient Chinese systems. Recently in Japan it has been a common way to associate
dates with the Emperors. In the era-based system, we represent a year with an era name given
at the time a new Emperor assumes the throne. If the era name is “A”, the first regnal year
will be “A 1”, the second year will be “A 2”, and so forth.
Since we have two different calendar systems, it is often needed to convert the date in one
calendar system to the other. In this problem, you are asked to write a program that converts
western year to era-based year, given a database that contains association between several
western years and era-based years.
For the simplicity, you can assume the following:
A new era always begins on January 1st of the corresponding Gregorian year.
The first year of an era is described as 1.
There is no year in which more than one era switch takes place.
Please note that, however, the database you will see may be incomplete. In other words, some
era that existed in the history may be missing from your data. So you will also have to detect
the cases where you cannot determine exactly which era the given year belongs to.
Input
The input contains multiple test cases. Each test case has the following format:
N Q
EraName
1
EraBasedYear
1
WesternYear
1
.
.
.
EraName
N
EraBasedYear
N
WesternYear
N
Query
1
.
.
.
Query
Q
The first line of the input contains two positive integers
N
and
Q
(1 ≤
N
≤ 1000, 1 ≤
Q
≤ 1000).
N
is the number of database entries, and Q is the number of queries.
Each of the following N lines has three components: era name, era-based year number and the
corresponding western year (1 ≤
EraBasedYear
i
≤
WesternYear
i
≤ 10
9
). Each of era names
consist of at most 16 Roman alphabet characters. Then the last
Q
lines of the input specifies
queries (1 ≤
Query
i
≤ 10
9
), each of which is a western year to compute era-based representation.
The end of input is indicated by a line containing two zeros. This line is not part of any dataset
and hence should not be processed.
You can assume that all the western year in the input is positive integers, and that there is no
two entries that share the same era name.
Output
For each query, output in a line the era name and the era-based year number corresponding to
the western year given, separated with a single whitespace. In case you cannot determine the
era, output “
Unknown
” without quotes.
Sample Input
4 3
meiji 10 1877
taisho 6 1917
showa 62 1987
heisei 22 2010
1868
1917
1988
1 1
universalcentury 123 2168
2010
0 0
Output for the Sample Input
meiji 1
taisho 6
Unknown
Unknown | [
{
"submission_id": "aoj_2242_11059750",
"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_2245_cpp | Problem D:
Dice Room
You are playing a popular video game which is famous for its depthful story and interesting
puzzles. In the game you were locked in a mysterious house alone and there is no way to call for
help, so you have to escape on yours own. However, almost every room in the house has some
kind of puzzles and you cannot move to neighboring room without solving them.
One of the puzzles you encountered in the house is following. In a room, there was a device
which looked just like a dice and laid on a table in the center of the room. Direction was written
on the wall. It read:
"This cube is a remote controller and you can manipulate a remote room, Dice
Room, by it. The room has also a cubic shape whose surfaces are made up of 3x3
unit squares and some squares have a hole on them large enough for you to go though
it. You can rotate this cube so that in the middle of rotation at least one edge always
touch the table, that is, to 4 directions. Rotating this cube affects the remote room
in the same way and positions of holes on the room change. To get through the
room, you should have holes on at least one of lower three squares on the front and
back side of the room."
You can see current positions of holes by a monitor. Before going to Dice Room, you should
rotate the cube so that you can go though the room. But you know rotating a room takes some
time and you don’t have much time, so you should minimize the number of rotation. How many
rotations do you need to make it possible to get though Dice Room?
Input
The input consists of several datasets. Each dataset contains 6 tables of 3x3 characters which
describe the initial position of holes on each side. Each character is either '
*
' or '
.
'. A hole is
indicated by '
*
'. The order which six sides appears in is: front, right, back, left, top, bottom.
The order and orientation of them are described by this development view:
Figure 4: Dice Room
Figure 5: available dice rotations
There is a blank line after each dataset. The end of the input is indicated by a single '
#
'.
Output
Print the minimum number of rotations needed in a line for each dataset. You may assume all
datasets have a solution.
Sample Input
...
...
.*.
...
...
.*.
...
...
...
...
...
.*.
...
...
.*.
...
...
...
...
.*.
...
*..
...
..*
*.*
*.*
*.*
*.*
.*.
*.*
*..
.*.
..*
*.*
...
*.*
...
.*.
.*.
...
.**
*..
...
...
.*.
.*.
...
*..
..*
...
.**
...
*..
...
#
Output for the Sample Input
3
1
0 | [
{
"submission_id": "aoj_2245_4879027",
"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 \"uno... |
aoj_2243_cpp | Problem B:
Step Step Evolution
Japanese video game company has developed the music video game called Step Step Evolution.
The gameplay of Step Step Evolution is very simple. Players stand on the dance platform, and
step on panels on it according to a sequence of arrows shown in the front screen.
There are eight types of direction arrows in the Step Step Evolution: UP, UPPER RIGHT,
RIGHT, LOWER RIGHT, DOWN, LOWER LEFT, LEFT, and UPPER LEFT. These direction
arrows will scroll upward from the bottom of the screen. When the direction arrow overlaps the
stationary arrow nearby the top, then the player must step on the corresponding arrow panel
on the dance platform. The figure below shows how the dance platform looks like.
Figure 1: the dance platform for Step Step Evolution
In the game, you have to obey the following rule:
Except for the beginning of the play, you must not press the arrow panel which is not
correspond to the edit data.
The foot must stay upon the panel where it presses last time, and will not be moved until
it’s going to press the next arrow panel.
The left foot must not step on the panel which locates at right to the panel on which the
right foot rests. Conversely, the right foot must not step on the panel which locates at left
to the panel on which the left foot rests.
As for the third condition, the following figure shows the examples of the valid and invalid
footsteps.
Figure 2: the examples of valid and invalid footsteps
The first one (left foot for LEFT, right foot for DOWN) and the second one (left foot for LOWER
LEFT, right foot for UPPER LEFT) are valid footstep. The last one (left foot for RIGHT, right
foot for DOWN) is invalid footstep.
Note that, at the beginning of the play, the left foot and right foot can be placed anywhere at
the arrow panel. Also, you can start first step with left foot or right foot, whichever you want.
To play this game in a beautiful way, the play style called “ Natural footstep style” is commonly
known among talented players. “Natural footstep style” is the style in which players make steps
by the left foot and the right foot in turn. However, when a sequence of arrows is difficult,
players are sometimes forced to violate this style.
Now, your friend has created an edit data (the original sequence of direction arrows to be pushed)
for you. You are interested in how many times you have to violate “Natural footstep style” when
you optimally played with this edit data. In other words, what is the minimum number of times
you have to step on two consecutive arrows using the same foot?
Input
The input consists of several detasets. Each dataset is specified by one line containing a sequence
of direction arrows. Directions are described by numbers from 1 to 9, except for 5. The figure
below shows the correspondence between numbers and directions.
You may assume that the length of the sequence is between 1 and 100000, inclusive. Also, arrows
of the same direction won’t appear consecutively in the line
...(truncated) | [
{
"submission_id": "aoj_2243_11059884",
"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_2244_cpp | Problem C:
Dungeon Quest II
The cave, called "Mass of Darkness", had been a agitating point of the evil, but the devil king
and all of his soldiers were destroyed by the hero and the peace is there now.
One day, however, the hero was worrying about the rebirth of the devil king, so he decided to
ask security agency to patrol inside the cave.
The information of the cave is as follows:
The cave is represented as a two-dimensional field which consists of rectangular grid of
cells.
The cave has
R
×
C
cells where
R
is the number of rows and
C
is the number of columns.
Some of the cells in the cave contains a trap, and those who enter the trapping cell will
lose his hit points.
The type of traps varies widely: some of them reduce hit points seriously, and others give
less damage.
The following is how the security agent patrols:
The agent will start his patrol from upper left corner of the cave.
- There are no traps at the upper left corner of the cave.
The agent will patrol by tracing the steps which are specified by the hero.
- The steps will be provided such that the agent never go outside of the cave during
his patrol.
The agent will bring potions to regain his hit point during his patrol.
The agent can use potions just before entering the cell where he is going to step in.
The type of potions also varies widely: some of them recover hit points so much, and
others are less effective.
- Note that agent’s hit point can be recovered up to
HP
max
which means his maximum
hit point and is specified by the input data.
The agent can use more than one type of potion at once.
If the agent's hit point becomes less than or equal to 0, he will die.
Your task is to write a program to check whether the agent can finish his patrol without dying.
Input
The input is a sequence of datasets. Each dataset is given in the following format:
HP
init
HP
max
R C
a
1,1
a
1,2
...
a
1,
C
a
2,1
a
2,2
...
a
2,
C
.
.
.
a
R
,1
a
R
,2
...
a
R
,
C
T
[
A-Z
]
d
1
[
A-Z
]
d
2
.
.
.
[
A-Z
]
d
T
S
[
UDLR
]
n
1
[
UDLR
]
n
2
.
.
.
[
UDLR
]
n
S
P
p
1
p
2
.
.
.
p
P
The first line of a dataset contains two integers
HP
init
and
HP
max
(0 <
HP
init
≤
HP
max
≤ 1000),
meaning the agent's initial hit point and the agent’s maximum hit point respectively.
The next line consists of
R
and
C
(1 ≤
R
,
C
≤ 100). Then,
R
lines which made of
C
characters
representing the information of the cave follow. The character
a
i,j
means there are the trap of
type
a
i,j
in
i
-th row and
j
-th column, and the type of trap is denoted as an uppercase alphabetic
character [
A-Z
].
The next line contains an integer
T
, which means how many type of traps to be described.
The following
T
lines contains a uppercase character [
A-Z
] and an integer
d
i
(0 ≤
d
i
≤ 1000),
representing the type of trap and the amount of damage it gives.
The next line contains an integer
S
(0 ≤
S
≤ 1000) representing the number of sequences which
the hero specified as the agent's patrol route. The
...(truncated) | [
{
"submission_id": "aoj_2244_10849113",
"code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <algorithm>\n#include <queue>\nusing namespace std;\n#define MAXN 310\n#define MAXM 5010\n#define FI first\n#define SE second\n#define MP(x,y) make_pair(x,y)\nconst int INF =100000000... |
aoj_2250_cpp | Problem I:
Operator
The customer telephone support center of the computer sales company called JAG is now in-
credibly confused. There are too many customers who request the support, and they call the
support center all the time. So, the company wants to figure out how many operators needed
to handle this situation.
For simplicity, let us focus on the following simple simulation.
Let
N
be a number of customers. The
i
-th customer has id
i
, and is described by three numbers,
M
i
,
L
i
and
K
i
.
M
i
is the time required for phone support,
L
i
is the maximum stand by time
until an operator answers the call, and
K
i
is the interval time from hanging up to calling back.
Let us put these in other words: It takes
M
i
unit times for an operator to support
i
-th customer.
If the
i
-th customer is not answered by operators for
L
i
unit times, he hangs up the call.
K
i
unit times after hanging up, he calls back.
One operator can support only one customer simultaneously. When an operator finish a call, he
can immediately answer another call. If there are more than one customer waiting, an operator
will choose the customer with the smallest id.
At the beginning of the simulation, all customers call the support center at the same time. The
simulation succeeds if operators can finish answering all customers within
T
unit times.
Your mission is to calculate the minimum number of operators needed to end this simulation
successfully.
Input
The input contains multiple datasets. Each dataset has the following format:
N T
M
1
L
1
K
1
.
.
.
M
N
L
N
K
N
The first line of a dataset contains two positive integers,
N
and
T
(1 ≤
N
≤ 1000, 1 ≤
T
≤ 1000).
N
indicates the number of customers in the dataset, and
T
indicates the time limit of the
simulation.
The following
N
lines describe the information of customers. The
i
-th line contains three integers,
M
i
,
L
i
and
K
i
(1 ≤
M
i
≤
T
, 1 ≤
L
i
≤ 1000, 1 ≤
K
i
≤ 1000), describing
i
-th customer's
information.
M
i
indicates the time required for phone support, Li indicates the maximum stand
by time until an operator answers the call, and Ki indicates the is the interval time from hanging
up to calling back.
The end of input is indicated by a line containing two zeros. This line is not part of any dataset
and hence should not be processed.
Output
For each dataset, print the minimum number of operators needed to end the simulation successfully in a line.
Sample Input
3 300
100 50 150
100 50 150
100 50 150
3 300
100 50 150
100 50 150
200 50 150
9 18
3 1 1
3 1 1
3 1 1
4 100 1
5 100 1
5 100 1
10 5 3
10 5 3
1 7 1000
10 18
1 2 3
2 3 4
3 4 5
4 5 6
5 6 7
6 7 8
7 8 9
8 9 10
9 10 11
10 11 12
0 0
Output for the Sample Input
2
3
3
4 | [
{
"submission_id": "aoj_2250_10867556",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <queue>\n#define FI first\n#define SE second\nusing namespace std;\nconst double EPS = 1e-8;\nconst int MAXN = 1005;\nconst int INF = 11111111... |
aoj_2251_cpp | Problem J:
Merry Christmas
International Christmas Present Company (ICPC) is a company to employ Santa and deliver
presents on Christmas. Many parents request ICPC to deliver presents to their children at
specified time of December 24. Although same Santa can deliver two or more presents, because
it takes time to move between houses, two or more Santa might be needed to finish all the
requests on time.
Employing Santa needs much money, so the president of ICPC employed you, a great program-
mer, to optimize delivery schedule. Your task is to write a program to calculate the minimum
number of Santa necessary to finish the given requests on time. Because each Santa has been
well trained and can conceal himself in the town, you can put the initial position of each Santa
anywhere.
Input
The input consists of several datasets. Each dataset is formatted as follows.
N M L
u
1
v
1
d
1
u
2
v
2
d
2
.
.
.
u
M
v
M
d
M
p
1
t
1
p
2
t
2
.
.
.
p
L
t
L
The first line of a dataset contains three integer,
N
,
M
and
L
(1 ≤
N
≤ 100, 0 ≤
M
≤ 1000,
1 ≤
L
≤ 1000) each indicates the number of houses, roads and requests respectively.
The following
M
lines describe the road network. The
i
-th line contains three integers,
u
i
,
v
i
,
and
d
i
(0 ≤
u
i
<
v
i
≤
N
- 1, 1 ≤
d
i
≤ 100) which means that there is a road connecting houses
u
i
and
v
i
with
d
i
length. Each road is bidirectional. There is at most one road between same
pair of houses. Whole network might be disconnected.
The next
L
lines describe the requests. The
i
-th line contains two integers,
p
i
and
t
i
(0 ≤
p
i
≤
N
- 1, 0 ≤
t
i
≤ 10
8
) which means that there is a delivery request to house
p
i
on time
t
i
. There
is at most one request for same place and time. You can assume that time taken other than
movement can be neglectable, and every Santa has the same speed, one unit distance per unit
time.
The end of the input is indicated by a line containing three zeros separated by a space, and you
should not process this as a test case.
Output
Print the minimum number of Santa necessary to finish all the requests on time.
Sample Input
3 2 3
0 1 10
1 2 10
0 0
1 10
2 0
3 2 4
0 1 10
1 2 10
0 0
1 10
2 20
0 40
10 10 10
0 1 39
2 3 48
3 5 20
4 8 43
3 9 10
8 9 40
3 4 5
5 7 20
1 7 93
1 3 20
0 0
1 100000000
2 100
3 543
4 500
5 400
6 300
7 200
8 100
9 100
0 0 0
Output for the Sample Input
2
1
4 | [
{
"submission_id": "aoj_2251_10848566",
"code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<iostream>\n#include<algorithm>\n#include<queue>\nusing namespace std;\n\ntypedef int ll;\nconst int inf = 200000000;\n#define N 2100\nint lef[1005], pn;\nint tim, T[1005];\nvector<int> G[1005];\nbool mat... |
aoj_2253_cpp | ブレイブ・フォース・ストーリー
English text is not available in this practice contest.
「最果ての地，ナイン・アイランドには特別な力を持つものが生きていた．
ある者は火，ある者は氷，ある者は風，ある者は土を意のままに操ることができた．
人はこれらの術者をこう呼んだ．『Brave Force』と・・・．時は戦国時代．権力者たちはBrave Forceを私欲のために使わんとBrave Force狩りを始めた．
Brave Forceを巡る戦いが今始まろうとしている．」
以上は，あなたが今つくろうとしている戦略シミュレーションゲームのプロローグである．このプロローグは本問題には全く関係ない．
問題の説明に戻ろう．戦略シミュレーションの世界においては， 正6角形のマスがよく使われる．
これは， 正方形のマスに比べて方向による距離の違いが小さく， 敷き詰めも可能であるからである．
今回はこのようなマップ上でコマを動かすことを考える．コマは各ターンごとに隣接するマスに移動させることができる．
もちろんマップ上には多くの障害物があってそこには移動することができない．さて一定のターン数が経過するまでにたどり着くことが可能なマスの数はいくつあるだろうか．
Input
入力はそれぞれがマップの情報を表す1つ以上のデータセットからなる．
データセットの最初の行には， 2つの整数が含まれていて， 1番目がターン数
t
で， 2番目が障害物の数
n
である．
それに続く
n
行にはそれぞれ障害物のマスの座標を表す2つの整数が含まれていて， 1番目が x 座標で， 2番目が y 座標である． 障害物の座標は互いに異なっている．
そして最後の行にはスタート位置のマスの座標を表す2つの整数が含まれていて， 1番目が x 座標で， 2番目が y 座標である． このマスには障害物はない． またこのマスは到達できるマスに含められる．
マスに割り当てられた座標は下の図のようになっている．
図B-1 マスに割り当てられた座標
入力の終わりは"0 0"を含む行で表される．
いずれの座標も絶対値が30以下である． ターン数は1以上30以下である． 障害物の数は0以上300以下である．
図B-2 Sample Input の1つ目のデータセット
Output
各マップについて到達できるマスの数を表す整数を各行に出力せよ． それ以外の余計な文字を出力に含めてはいけない．
Sample Input
1 1
1 0
0 0
2 2
-2 1
2 0
2 2
2 0
-1 1
4 4
-2 1
1 -2
1 2
3 -3
-2 0
4 6
0 1
1 1
1 0
-1 0
-1 -1
0 -1
0 0
0 0
Output for the Sample Input
6
18
19
58
1 | [
{
"submission_id": "aoj_2253_10681617",
"code_snippet": "#include <bits/stdc++.h>\n#include <cstdint>\n#include <regex>\nusing namespace std;\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vl = vector<long long>;\nusing vs = vector<string>;\nusing vc = vector<char>;\nusing vb = vector<bool>;\nusin... |
aoj_2246_cpp | Problem E:
Alice and Bomb
Alice and Bob were in love with each other, but they hate each other now.
One day, Alice found a bag. It looks like a bag that Bob had used when they go on a date.
Suddenly Alice heard tick-tack sound. Alice intuitively thought that Bob is to kill her with a
bomb. Fortunately, the bomb has not exploded yet, and there may be a little time remained to
hide behind the buildings.
The appearance of the ACM city can be viewed as an infinite plane and each building forms a
polygon. Alice is considered as a point and the bomb blast may reach Alice if the line segment
which connects Alice and the bomb does not intersect an interior position of any building.
Assume that the speed of bomb blast is infinite; when the bomb explodes, its blast wave will
reach anywhere immediately, unless the bomb blast is interrupted by some buildings.
The figure below shows the example of the bomb explosion. Left figure shows the bomb and the
buildings(the polygons filled with black). Right figure shows the area(colored with gray) which
is under the effect of blast wave after the bomb explosion.
Figure 6: The example of the bomb explosion
Note that even if the line segment connecting Alice and the bomb touches a border of a building,
bomb blast still can blow off Alice. Since Alice wants to escape early, she wants to minimize the
length she runs in order to make herself hidden by the building.
Your task is to write a program which reads the positions of Alice, the bomb and the buildings
and calculate the minimum distance required for Alice to run and hide behind the building.
Input
The input contains multiple test cases. Each test case has the following format:
N
bx by
m
1
x
1,1
y
1,1
...
x
1,
m
1
y
1,
m
1
.
.
.
m
N
x
N
,1
y
N
,1
...
x
N
,
m
N
y
N
,
m
N
The first line of each test case contains an integer
N
(1 ≤
N
≤ 100), which denotes the number
of buildings. In the second line, there are two integers
bx
and
by
(-10000 ≤
bx
,
by
≤ 10000),
which means the location of the bomb. Then,
N
lines follows, indicating the information of the
buildings.
The information of building is given as a polygon which consists of points. For each line, it has
an integer
m
i
(3 ≤
m
i
≤ 100, ∑
N
i
=1
m
i
≤ 500) meaning the number of points the polygon has,
and then
m
i
pairs of integers
x
i,j
,
y
i,j
follow providing the x and y coordinate of the point.
You can assume that
the polygon does not have self-intersections.
any two polygons do not have a common point.
the set of points is given in the counter-clockwise order.
the initial positions of Alice and bomb will not by located inside the polygon.
there are no bomb on the any extended lines of the given polygon’s segment.
Alice is initially located at (0, 0). It is possible that Alice is located at the boundary of a
polygon.
N = 0 denotes the end of the input. You may not process this as a test case.
Output
For each test case, output one line which consists of the minimum distance required for Alice to
run and hide behin
...(truncated) | [
{
"submission_id": "aoj_2246_10829154",
"code_snippet": "#include<bits/stdc++.h>\n//#define Alex std::ios::sync_with_stdio(false),std::cin.tie(0),std::cout.tie(0);\n//#define int long long\n//#define double long double\n//#define L(i,a,b) for(int i = a;i <= b;i++)\n//#define R(i,a,b) for(int i = a;i >= b;i-... |
aoj_2254_cpp | 最短ルート
English text is not available in this practice contest.
あなたの所属する知的プログラミングサークル (通称 Intelligent Clever Programming Circle, ICPC)では，今大掃除の最中である．
部室には，歴代の先輩たちの残していったさまざまなアイテムが所狭しと放置されている．
あなたが棚を整理していると，奥に大量のレトロゲームが封印されているのを発見した．
その中のいくつかに見覚えがあったあなたは，久々にそのゲームを遊んでみることにした．
見つけたゲームの詳細は次の通りである．
このゲームには1番から
N
番までの
N
個のステージがあり，任意の順に攻略することができる．
また，1から
N
まで番号付けられた装備があり，それらの装備を使用することでステージの攻略時間を短縮することができる．
ゲームを始めた段階では装備は一つも持っていないが，
i
番のステージを攻略すると
i
番の装備を入手することができ，一度入手した後は何度でも使用できる．
装備は一ステージで一種類だけしか使用することができないが，異なるステージで同じ装備を使用することはできる．
あなたは昔このゲームをクリアしたことがあるので，各装備に対して，その装備を使用したときに各ステージを攻略するのにかかる時間をすべて把握している．
ただ普通にクリアするだけではつまらないので，あなたは全てのステージを攻略し終わるまでにかかる時間を最小にしようと考えた．
そのため，あなたはICPCでの経験を生かして，各情報を与えたときに全てのステージを攻略し終わるまでにかかる時間の最小値を計算するプログラムを書くことにした．
Input
入力は複数のデータセットからなる．
入力の終わりは1つのゼロからなる行によって与えられる．
各データセットは一つのゲームに関する情報を表し，その形式は以下の通りである．
N
t
10
t
11
...
t
1N
t
20
t
21
...
t
2N
...
t
N0
t
N1
...
t
NN
データセットの最初の行は1つの整数
N
からなり，ステージの数を表す．
続く
N
行は
N+1
個の整数からなり，ステージの攻略時間を表す．
t
i0
は
i
番のステージを装備なしで攻略するのにかかる時間である．
t
i j
(
j
> 0)は
i
番のステージを
j
番の装備で攻略するのにかかる時間である．
それぞれの値は次の制約を満たしている．
1 ≤
N
≤ 16
1 ≤
t
i j
≤ 100,000
Output
それぞれのデータセットに対して，全てのステージを攻略し終わるまでにかかる時間の最小値を表す整数を1行に出力せよ．出力行にはこの数値以外の文字を含んではならない．
Sample Input
3
100 100 100 100
100 1 100 100
100 1 1 100
3
100 100 1 100
200 102 100 102
100 100 1 100
7
100 100 60 60 70 70 70 90
100 50 100 55 45 45 55 44
100 50 60 100 51 50 55 30
100 70 10 20 1 10 10 40
200 90 10 30 10 10 10 30
150 200 12 1 11 11 1 30
10000 1200 1100 1100 1200 1200 1090 1
0
Output for the Sample Input
102
202
1301 | [
{
"submission_id": "aoj_2254_10853366",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N;\n while(cin >> N, N) {\n vector<vector<int>> t(N, vector<int>(N + 1));\n for(int i = 0; i < N; ++i) {\n for(int j = 0; j < N + 1; ++j) {\n ... |
aoj_2255_cpp | 6÷2(1+2)
English text is not available in this practice contest.
数学科の学生であるきたまさ君は，数学はとても得意なのだが算数はあまり得意ではない．
特に演算子の優先順位が苦手で，
カッコの中を先に計算するというのはわかるのだが， "+" と "*" のどちらを優先したら良いかとか複数の演算子が並んでいるときに左から計算したら良いのか右から計算したら良いのか覚えておらず，
その時の気分で好きな順番で計算をしている．例えば，"1*1-1+1"という数式を前から"((1*1)-1)+1"という順番で計算する場合もあれば，真ん中から"(1*(1-1))+1"という順番で計算する場合さえある．
また，分数や小数も苦手で，割り算では常に絶対値の小さい方に丸め，小数部を切り捨てて整数にしてしまう．
割る数がゼロであった場合には，きたまさ君はどこかで間違えたと思ってもう一度最初から計算しなおすことにしている．
きたまさ君はどんな順番で計算しても最終的な計算結果は同じになると主張しているので，あなたにはそれが間違いであると示すために，与えられた数式に対して
きたまさ君の計算結果が何通りあり得るかを求めるプログラムを書いて欲しい．
ただし，演算の順番が異なっていても，最終的な答えが同じならば一つと数えるものとし，
また，与えられる数式は，少なくとも一つはゼロ割が発生しない演算順序が存在し，いかなる演算順序で計算した場合でも，計算結果と途中で現れる数の絶対値は常に 10
9
以下であることが保証されている．
Input
入力はひとつ以上の行からなり，入力の各行は数式ひとつを含む．数式の文法は以下の BNF で与えられる．
<expr> ::= <num>
| "(" <expr> ")"
| <expr> "+" <expr>
| <expr> "-" <expr>
| <expr> "*" <expr>
| <expr> "/" <expr>
<num> ::= <digit> | <num> <digit>
<digit> ::= "0" | "1" | "2" | "3" | "4"
| "5" | "6" | "7" | "8" | "9"
すべての数式はこの構文規則に従う．また，入力行の長さは 200 文字を超えない．ひとつの数式が含む演算子 ( "+" , "-" , "*" , "/" ) の数は 10 個を超えない．
入力の終わりは "#" ひとつだけからなる行によって示される．
Output
それぞれの数式について，きたまさ君の計算結果が何通りあり得るかを出力せよ．出力は数式ひとつごとに 1 行とする．
Sample Input
6/2*(1+2)
1-1-1
(1-1-1)/2
#
Output for the Sample Input
2
2
1 | [
{
"submission_id": "aoj_2255_10685115",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nbool solve();\n\nusing ll = long long;\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define sz(x) (int)(x).size()\n#define all(x) x.begin(), x.end()\ntypedef pair<int, int> pii;\ntypedef vector<i... |
aoj_2249_cpp | Problem H:
Road Construction
King Mercer is the king of ACM kingdom. There are one capital and some cities in his kingdom.
Amazingly, there are no roads in the kingdom now. Recently, he planned to construct roads
between the capital and the cities, but it turned out that the construction cost of his plan is
much higher than expected.
In order to reduce the cost, he has decided to create a new construction plan by removing some
roads from the original plan. However, he believes that a new plan should satisfy the following
conditions:
For every pair of cities, there is a route (a set of roads) connecting them.
The minimum distance between the capital and each city does not change from his original
plan.
Many plans may meet the conditions above, but King Mercer wants to know the plan with
minimum cost. Your task is to write a program which reads his original plan and calculates the
cost of a new plan with the minimum cost.
Input
The input consists of several datasets. Each dataset is formatted as follows.
N M
u
1
v
1
d
1
c
1
.
.
.
u
M
v
M
d
M
c
M
The first line of each dataset begins with two integers,
N
and
M
(1 ≤
N
≤ 10000, 0 ≤
M
≤
20000).
N
and
M
indicate the number of cities and the number of roads in the original plan,
respectively.
The following
M
lines describe the road information in the original plan. The
i
-th line contains
four integers,
u
i
,
v
i
,
d
i
and
c
i
(1 ≤
u
i
,
v
i
≤
N
,
u
i
≠
v
i
, 1 ≤
d
i
≤ 1000, 1 ≤
c
i
≤ 1000).
u
i
,
v
i
,
d
i
and
c
i
indicate that there is a road which connects
u
i
-th city and
v
i
-th city, whose length is
d
i
and whose cost needed for construction is
c
i
.
Each road is bidirectional. No two roads connect the same pair of cities. The 1-st city is the
capital in the kingdom.
The end of the input is indicated by a line containing two zeros separated by a space. You
should not process the line as a dataset.
Output
For each dataset, print the minimum cost of a plan which satisfies the conditions in a line.
Sample Input
3 3
1 2 1 2
2 3 2 1
3 1 3 2
5 5
1 2 2 2
2 3 1 1
1 4 1 1
4 5 1 1
5 3 1 1
5 10
1 2 32 10
1 3 43 43
1 4 12 52
1 5 84 23
2 3 58 42
2 4 86 99
2 5 57 83
3 4 11 32
3 5 75 21
4 5 23 43
5 10
1 2 1 53
1 3 1 65
1 4 1 24
1 5 1 76
2 3 1 19
2 4 1 46
2 5 1 25
3 4 1 13
3 5 1 65
4 5 1 34
0 0
Output for the Sample Input
3
5
137
218 | [
{
"submission_id": "aoj_2249_11056492",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <cstring>\n#include <queue>\nusing namespace std;\nconst int INF=0x3f3f3f3f;\nconst int maxv=10002;\nstruct edge{int en,dis,cost;};\ntypedef pair<int,int> P;\nint main(){\n int sc... |
aoj_2256_cpp | ケーキ分割問題
English text is not available in this practice contest.
イコとピコはACM博士によって開発された人工知能を搭載した双子のロボットである．今日は二人の誕生日なので，博士は二人のためにたくさんのイチゴがのったケーキを用意した．
ケーキは横幅
W
×奥行き
H
の長方形の形をしている．
便宜上，ケーキは上から見たとき(0,0)，(
W
,0)，(
W
,
H
)，(0,
H
)を頂点とする長方形になるように置かれているとする．
また，二人に均等になるようにちょうど2
N
個のイチゴが乗っている．
せっかくなので，博士は二人にケーキを切らせることにした．
イコとピコは協力してケーキを切るため，イコが包丁の一端を辺(0,0)-(0,
H
)の間におき，ピコはもう一端を辺(
W
,0)-(
W
,
H
)の間において同時に下に下ろすという方法をとることにした．
もちろん包丁は直線状なので，選んだ2点を通る直線でケーキは2つに分かれる．(図E-1)
図E-1
博士は人工知能を完成させたことに満足し他の部分を適当に作ったために，二人の腕のパーツは不安定になってしまった．
そのため，辺(0,0)-(0,
H
)(または辺(
W
,0)-(
W
,
H
))上の狙った場所に置こうとしてもどうしてもずれてしまうのである．
二人はイチゴが好きなので，できれば
N
個ずつに分けたいと考えている．
そこで，
N
個ずつになるように切れない場合は2点を選びなおすことにした．
2
N
個のイチゴの配置によっては半分ずつに分けられなかったり，分けられたとしても，とても確率が低い場合も考えられる．
このような場合に何度も2点を選びなおすのは不毛なので，まず初めに
N
個ずつに分かれるように切れる確率を計算することにした．
二人の腕のパーツは不安定なので，動きを予想するのは難しい．
とりあえず，二人は「包丁を置く点は辺(0,0)-(0,
H
)(または辺(
W
,0)-(
W
,
H
))上に必ず乗り，置かれる確率はどの二点も等しい」という仮定を置くことにした．
また，イチゴの大きさを考慮するのも面倒なので，点とみなすことにした．
これは人工知能の性能を試すいい機会である．
博士と同じ研究所に勤めているあなたに，2
N
個のイチゴの位置を与えられたときに， 2人と同じ仮定を用いてイチゴが
N
個ずつに分かれる確率を計算するプログラムを作成する仕事が割り当てられた．
Input
入力は複数のデータセットからなる．入力の終わりは空白で区切られた3つのゼロからなる行によって与えられる．各データセットは1つのケーキに関する情報を表し，その形式は以下の通りである．
W
H
N
x
1
y
1
...
x
2N
y
2N
データセットの最初の行は3つの整数
W
,
H
,
N
からなり，それぞれケーキの横幅，奥行き，イチゴの個数/2を表す．
続く2
N
行は2個の整数からなり，それぞれイチゴのx座標とy座標を表す．
それぞれの値は次の制約を満たしている．
1 ≤
W
,
H
≤ 1,000
1 ≤
N
≤ 100
0 ≤
x
i
≤
W
0 ≤
y
i
≤
H
また，2つの異なるイチゴが同じ座標にあることはない．
Output
それぞれのデータセットに対して， 2人の仮定を用いた場合にイチゴが2等分される確率を表す実数を1行に出力せよ．
答えには 10
-8
を越える誤差があってはいけない．それ以外の余計な文字を出力してはならない．
Sample Input
2 2 1
0 1
2 1
3 3 1
1 1
2 1
0 0 0
Output for the Sample Input
0.5000000000
0.1666666667 | [
{
"submission_id": "aoj_2256_10848200",
"code_snippet": "#include <bits/stdc++.h>\n#define ll long long\n#define endl '\\n'\n#define ls rt << 1\n#define rs rt << 1 | 1\n#define maxn 200010\nusing namespace std;\n\nconst double eps = 1e-12;\nconst double pi = acos(-1.0);\nint sgn(double x)\n{\n if (fabs(x... |
aoj_2260_cpp | 問題 B : (iwi)
20XX 年の今，G○○gle 社の世界的な支配により，人々のコミュニケーションは限られており，
例えば，自由に人と情報をやりとりすることは基本的に許されていない．
特に，過去にプログラミングコンテストで名を馳せた強豪たちは，危険と判断され，
お互いバラバラにされ，密かに注意深く監視されているという．
自分も，そんな一人であった，ような気がする．
しかし実は，自分は記憶を失ってしまっているのだ．
自分が何と名乗っていたか，それすらも思い出せない．
'i' とか 'w' とか括弧とかを使っていた気がするが，
それっぽいものを書きだしてみても，しっくりこない．
そういえば，今思い出したことには，左右に線対称だった気がするのだ．
問題
'i', 'w', '(', ')' からなる文字列が与えられた時，
一部の文字を他の文字に置き換えて，'i', 'w', '(', ')' からなる左右に線対称な文字列にしたい．
文字の追加や削除は許さず，1 文字を別の 1 文字に変える操作のみを行うことにする．
少なくとも何文字置き換えなければならないかを出力するプログラムを作成せよ．
ここで用いる左右に線対称の定義は，以下とする．
以下の文字列は左右に線対称．
空文字列
"i"
"w"
文字列
x
が左右に線対称のとき，以下の文字列も左右に線対称．
"i"
x
"i"
"w"
x
"w"
"("
x
")"
")"
x
"("
以上のもののみが左右に線対称．
ここで，"i"
x
"i" とは "i" と
x
と "i" を連結したものを表す．
他のものも同様である．
入力
入力は 'i', 'w', '(', ')' からなる 1 つの文字列である．
出力
置き換えなければならない文字数を表す整数を出力せよ．
制約
入力の文字列の長さは 10 以下である．
入出力例
入出力例 1
入力例 1:
(iwi)
入力例 1 に対する出力例:
0
入力例 1 では文字列がはじめから左右に線対称である．
入出力例 2
入力例 2:
ii(((((ww
入力例 2 に対する出力例:
5
入力例 2 では例えば ww((i))ww 等に変更すればよい． | [
{
"submission_id": "aoj_2260_9264521",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i, n) for(ll i = 0; i < (n); i++)\n#define reps(i, l, r) for(ll i = (l); i < (r); i++)\n#define endl \"\\n\";\n#define all(a) (a).begin(), (a).e... |
aoj_2258_cpp | 全自動円形掃除機
English text is not available in this practice contest.
Automatic Cleaning Machine (ACM) 社は画期的な全自動円形掃除機 Intelligent Circular Perfect Cleaner(ICPC) を開発した．
なんとこの ICPC は人がいない日中に自動で動き出し，自分が通り過ぎた場所のゴミを掃除する機能を備えている．
全自動という特性を活かすためにも ICPC の集塵機の容積を大きくし，人手でゴミを捨てる回数を減らしたい．
しかしながら ICPC が大型化すればするほど ICPC が円形故に部屋の隅の掃除できない部分の面積も大きくなってしまう．(図G-1)
図G-1
また廊下の幅よりも大きくしてしまうと廊下を通ることができなくなってしまう．(図G-2)
図G-2
ACM 社は凄腕プログラマーのあなたに，部屋の見取り図とICPCの中心座標と半径からその部屋の中でICPCが掃除可能な面積を出力するプログラムの作成を依頼した．
Input
入力は複数のデータセットからなり，各データセットは以下の形式をしている．
n
x
y
r
x
1
y
1
x
2
y
2
...
x
n
y
n
データセットの1行目には４つの整数
n
,
x
,
y
,
r
が記されており，それぞれ部屋を構成する多角形の頂点数(3 ≤
n
≤ 20)，
ICPCの初期位置の中心座標 (-100 ≤
x
,
y
≤ 100)， ICPCの半径 (1 ≤
r
≤ 100)を表している．
続く
n
行には多角形の頂点の座標が反時計回りに記されており，以下の条件を満たす．
-100 ≤
x
i
,
y
i
≤ 100
全ての壁は，x軸かy軸に並行
ICPCの初期位置は必ず部屋の内側にあり，どの部屋の壁とも10
-3
以上離れている
任意の部屋の頂点同士の距離，任意の部屋の頂点と部屋の辺の距離，任意の部屋の辺同士の距離は 2
r
+10
-3
より大きいかもしくは 2
r
-10
-3
より小さい
四つのゼロのみからなる行が入力の終わりを表す．
Output
各データセットに対し，ICPCが掃除可能な領域の面積を1行に出力せよ．答えには10
-6
を超える誤差があってはならない．
Sample Input
4 5 5 1
0 0
10 0
10 10
0 10
8 5 5 1
0 0
9 0
9 1
10 1
10 9
9 9
9 10
0 10
12 25 5 1
0 0
10 0
10 4
20 4
20 0
40 0
40 10
20 10
20 5
10 5
10 10
0 10
0 0 0 0
Output for the Sample Input
99.1415926535897
96.7123889804
199.2321787 | [
{
"submission_id": "aoj_2258_2589625",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <complex>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\nconst int nrep = 50;\n\n/********************* Geometry Library *****************/\nconst double EPS = 1e-9;... |
aoj_2257_cpp | 桜詩 願はくは花の下にて春死なむ
English text is not available in this practice contest.
Nathan O. Davis は集積回路コースの学生である．
Nathan は足りない単位を補充するために，日本文化に関する授業を履修している．今日の課題は詩の作成である．
Nathan は勉強不足で日本語が不得手なため，プログラムに詩を自動生成させようと考えた．手始めに彼は，日本語の単語の接続辞書を入手した．
あとは単語の接続にしたがってランダムな文章を生成するだけである．
しかしながら，ランダムに生成された全ての文字列が詩として認められるわけではない．
詩には，いくつかの季語のうち1つが，一度だけ現れていなければならない．ある季語が2回以上出現することや，2種類以上の季語が1回ずつ出現することは許されない．
また，季語は単語の接続の境界をまたいで出現してもよい．
あなたの仕事は，入力で与えられた単語の接続辞書と季語のリストから，指定された長さの詩が何通りに作られるかを求めるプログラムを作成することである．
違う単語を繋げて詩となる同じ文字列が得られた場合，それらは重複して数え上げるものとする．答えは非常に大きくなりうるので， 1,000,000,007 で割った余りを出力せよ．
Input
入力は複数のテストケースを含んでいる．1つのテストケースは，以下の形式で与えられる．
N
M
K
from
1
to
1
from
2
to
2
:
from
N
to
N
seasonword
1
seasonword
2
:
seasonword
K
入力の最初の行には3つの整数
N
(1 ≤
N
≤ 250),
M
(1 ≤
M
≤ 500),
K
(1 ≤
K
≤ 30) が含まれ，それぞれ単語の接続辞書の大きさ，作成すべき詩の長さ，季語の数を表す．
続く
N
行は単語の接続辞書の情報を表す．
各行は2つの文字列
from
i
,
to
i
を含み，単語
from
i
の後に続けて単語
to
i
が出現してもよいということを表す．
to
i
の後に続けて
from
i
が出現してもよいということを表すものではないことに注意せよ．また，
from
i
で終わるような他の文字列の後に続けて
to
i
が出現してもよいということを表すものでもない．詩は，接続辞書に含まれるどの単語から始めてもよい．
続く
K
行は1つの文字列
seasonword
i
からなり，それぞれ季語を表す．
入力中に現れる文字列は全て小文字のアルファベットからなり，その長さは 1 以上 20 以下である．
接続辞書の各項目，および季語は互いに異なる．
すなわち，
i
≠
j
に対して
from
i
≠
from
j
または
to
i
≠
to
j
が成り立つ．
同様に，
i
≠
j
に対して
seasonword
i
≠
seasonword
j
が成り立つ．
入力の末尾には，入力の終了を表す 3 つの 0 がある．
Output
生成される異なる詩の数を 1,000,000,007 で割った余りを1行に出力せよ．
先に言及したように，違う単語を繋げて詩となる同じ文字列が得られた場合，それらは重複して数え上げるものとする．
厳密に言えば，2つの詩
s
,
t
があり，それぞれ単語の列 [
a
1
,
a
2
, ...,
a
n
], [
b
1
,
b
2
, ...,
b
m
] を順に連結して得られたものであるとき，
n
=
m
かつすべての 1 ≤
i
≤
n
に対して
a
i
=
b
i
であるとき，またそのときに限って，2つの詩
s
,
t
は同一の詩とみなされる．
Sample Input
4 64 2
negawakuha hananoshitanite
hananoshitanite harushinan
harushinan sonokisaragino
sonokisaragino mochizukinokoro
sakura
hana
2 15 2
naha naha
naha gachoon
sakura
hana
3 7 2
asakur a
a sakura
asa kura
sakura
hana
9 100 2
a a
a h
a n
h a
h h
h n
n a
n h
n n
sakura
hana
4 2 2
a a
a b
b a
b b
ab
b
4 7 4
i cpc
mi cp
ac mi
cp c
ac
wa
tle
re
0 0 0
Output for the Sample Input
1
1
3
715991824
1
1 | [
{
"submission_id": "aoj_2257_10867672",
"code_snippet": "#include <bits/stdc++.h>\n\n#define REP(i,n) for(int i=0;i<(int)(n);i++)\n#define ALL(x) (x).begin(),(x).end()\n\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\n\ntemplate <typename T> T &chmin(T &a, const T &b) { return a = m... |
aoj_2267_cpp | 問題 I : ビット演算
いよいよ G○○gle Code Jam の世界大会が始まろうとしている．
前では P○tr, t○mek, SnapDrag○n をはじめとする，
G○○gle の誇る最強のコーダー達が睨みを利かせている．
妙な動きを見せれば，命はないだろう．
目をつむり，コンテスト開始をじっと待つ．
…妙だ，コンテストが始まらない．
目を開けてみると…なんということだ．部屋の全ての人間が，倒れている．
いや違う，全てではない．一人の男，wata を除いてだ．
wata
「やっと話せるぞ． 久しぶりだな，(iwi)」
(iwi)
「…お前は何者だ？ 俺の知る wata は幼なじみ系美少女のはずが…」
wata
「まだそんな妄想に取り憑かれているのか!! 思い出せ!! 受け止めろ!! 彼はもうこの世界には居ないんだ!!」
はっ…!! 僕は全てを思い出していた．
僕は世界で最初にプログラミングコンテストで人を殺めたのだ．
そして，僕が殺したのは他でもなく，最も仲の良かった友人の一人，kita_masa であった．
kita_masa は自らをビット演算の達人と言い，
あらゆる関数はビット演算で記述できると言う，少し変わった奴だった．
そういえば今，ビット演算を用いて作成したい関数があるが，
kita_masa にそれをお願いすることはできない．
そこで，kita_masa の代わりになるプログラムを作成することにした．
問題
N
個の整数の組
(
x
i
,
y
i
)
が与えられる．
全ての組に対して
y
i
=
f
(
x
i
)
なる関数
f
を制約の下で作ることを考える．
関数
f
は，C 言語のソースコードとして以下のように表現できるものとする:
uint32_t f(uint32_t x) {
return 式;
}
ここで，uint32_t は 32 ビット符号無し整数を表す．
また，式は以下の BNF で表現できるものとする:
<expr> ::= "x"
| <num>
| "(~" <expr> ")"
| "(" <expr> <op2> <expr> ")"
<op2> ::= "&" | "|" | "^" | "+" | "-" | "*"
<num> は 32 ビット符号無し整数で表現できる非負の整数を
10 進数で自然に (leading-zero 等を持たず) 表現したものとする．
このような関数の式を出力するプログラムを作成せよ．
入力
入力の最初の行は 1 つの整数
N
を含む．
続く
N
行の
i
行目は 2 つの整数
x
i
,
y
i
を含む．
出力
条件を満たす式を出力せよ．
制約
1 ≤
N
≤ 8
0 ≤
x
i
,
y
i
< 256
式は必ず，上記の BNF に従う書式で出力せよ．例え C 言語の表現として妥当であったとしても，空白や改行の挿入や括弧の削除などはしてはならない．
出力は 100000 文字を越えてはならない．
条件を満たす関数
f
が常に存在するような入力が与えられる．
部分点
この問題の判定には，20 点分のテストケースのグループが設定されている．
このグループに含まれるテストケースの入力は以下を満たす．
'+', '-', '*' を用いないような正しい出力が存在する
入出力例
入力例1:
8
1 1
2 2
3 3
4 0
5 1
6 2
7 3
8 0
入力例 1 に対する出力の例:
(x&3)
入力例2:
8
1 0
2 0
3 2
4 0
5 4
6 4
7 6
8 0
入力例 2 に対する出力の例:
(x&(x-1))
良く知られる最右の 1 ビットをオフにする操作である． | [
{
"submission_id": "aoj_2267_8975919",
"code_snippet": "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0; i<(int)(n); ++i)\n\nusing namespace std;\n\ntypedef unsigned uint;\nstring num(uint n){\n stringstream ss;\n ss << n;\n return ss.str();\n}\nstring negative(string expr){\n return \"(~... |
aoj_2264_cpp | 問題 F : 全域木
今，G○○gle Code Jam の地区大会が始まろうとしている．
左の席に座っている男の ID は wata と言うらしい．
東京大学時代の記憶に，似たような ID の仲間が居た覚えがある．
しかし，僕の仲間は一人残さず美少女だったはずだ．
僕の記憶の中の wata は，マトロイドが好きだった．
特に，マトロイド交差が大好きで，
様々なマトロイド達を交差させることに一種の興奮すら覚えると言う少し変わった奴だった．
マトロイドの理論の力を使えば，
与えられたグラフ上で辺を共有しない複数の全域木を求めることはとても簡単な問題だと言っていた気がする．
しかし，特別なグラフに関しては，
マトロイドのアルゴリズムを直接に適用するよりも高速なアルゴリズムがあるのではないか？
問題
N
個の頂点からなる完全グラフにおいて，
辺を共有しない全域木を
K
個作成せよ．
完全グラフとは，全ての相異なる 2 頂点間に 1 本の辺を持つグラフである．
下図は，4 頂点の完全グラフの例である．
4 頂点の完全グラフ．
全域木とは，元のグラフの全ての頂点と一部の辺からなる木のことである．
木とは，連結かつ閉路を持たないグラフのことである．
下図は，4 頂点の完全グラフにおける，辺を共有しない 2 つの全域木である．
4 頂点の完全グラフの全域木の例．
4 頂点の完全グラフの全域木であり，前の例と辺を共有しないもの．
入力
入力は 1 行からなり，
2 つの整数
N
,
K
が書かれている．
出力
条件を満たす
K
個の全域木を作ることができない時，-1 とだけ出力せよ．
条件を満たす
K
個の全域木を作ることができる時，
K
個の全域木を改行で区切り出力せよ．
1 つの全域木は
N
- 1
行で表される．
その
i
行目には，その全域木の辺
i
が結ぶ 2 つの頂点を表す 2 つの整数をスペースで区切り出力する．
ここで，頂点は
1
から
N
までの整数で表すものとする．
制約
2 ≤
N
≤ 10000
1 ≤
K
≤ 100
部分点
この問題の判定には，20 点分のテストケースのグループが設定されている．
このグループに含まれるテストケースの入力は以下を満たす．
1 ≤
N
≤ 8
入出力例
入出力例 1
入力例 1:
4 2
入力例 1 に対する出力の例:
1 2
1 4
2 3
1 3
2 4
3 4
この入出力例は問題文中の図と対応している．
入出力例 2
入力例 2:
4 3
入力例 2 に対する出力の例:
-1 | [
{
"submission_id": "aoj_2264_8962765",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n,k;\n cin >> n >> k;\n if(k>n/2){\n cout << -1 << endl;\n return 0;\n }\n vector<vector<string>> ans(k);\n for(int i=0;i<n;i++){\n for(int j=i+1;j<n;j++){\n int i... |
aoj_2261_cpp | 問題 C : [[iwi]]
そうだ，僕のハンドルネームは (iwi) だ．
僕は確かに昔にプログラミングコンテストに参加していた．
そして，多くの仲間と楽しい時間を過ごした．
確か，仲間たちは全員，美少女だったような気がする．
プログラミングコンテストの世界は，僕のハーレムだったような気がする．
G○○gle は，僕のハーレムを奪ったのだ，そうに違いない．
昔の仲間の手がかりをつかむためにも，やはりプログラミングコンテストに出なければならない．
G○○gle Code Jam に参加登録することにしよう．
今度の ID には，丸括弧以外の括弧も検討に入れてみよう．
問題
'i', 'w', '(', ')', '{', '}', '[', ']' からなる文字列が与えられた時，
その部分列をとって，線対称な文字列を作りたい．
最大で何文字の文字列を作ることができるかを計算するプログラムを作成せよ．
与えられる文字列は，
"iwi" という文字列を一度含み，それ以外の部分には 'i' と 'w' を含まない．
より形式的には，与えられる文字列は
s
"iwi"
t
（
s
と "iwi" と
t
を連結したもの）という形で表すことができ，
s
と
t
は '(', ')', '{', '}', '[', ']' からなる文字列である．
s
や
t
が 0 文字である可能性もある．
作る文字列は，与えられる文字列の部分列をとって作る．
部分列とは，元の文字列からいくつかの文字を取り出し，それらを，
元の文字列に含まれる順番で繋げたものである．
取り出す文字たちは必ずしも元の文字列で連続していなくても良い．
また，作る文字列も，与えられる文字列と同様に，"iwi" という文字列を一度含み，
それ以外の部分には 'i' と 'w' は含まないようにしたい．
ここで用いる左右に線対称の定義は，以下とする．
以下の文字列は左右に線対称．
空文字列
"i"
"w"
文字列
x
が左右に線対称のとき，以下の文字列も左右に線対称．
"i"
x
"i"
"w"
x
"w"
"("
x
")"
")"
x
"("
"{"
x
"}"
"}"
x
"{"
"["
x
"]"
"]"
x
"["
以上のもののみが左右に線対称．
入力
入力は 'i', 'w', '(', ')', '{', '}', '[', ']' からなり上記の条件を満たす文字列である．
出力
上記の条件を満たし作ることのできる文字列の長さの最大値を出力せよ．
制約
入力の文字列の長さは 15 以下である．
入出力例
入出力例 1
入力例 1:
[[[iwi[[[
入力例 1 に対する出力例:
3
"iwi" という文字列しか作ることができない．
入出力例 2
入力例 2:
[{)iwi(]}
入力例 2 に対する出力例:
7
"[)iwi(]" や "{)iwi(}" など 7 文字の文字列を作ることができる． | [
{
"submission_id": "aoj_2261_4088642",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n \nbool check(string s){\n int n = s.size();\n bool ok = true;\n for(int i=0;i<n/2;i++){\n if(s[i] == '('){\n ok &= s[n-1-i] == ')';\n }\n else if(s[i] == ')'){\n ... |
aoj_2263_cpp | 問題 E : ファーストアクセプタンス
プログラミングコンテストでは，各問題に関して，
その問題を最初に正解した人の名前や正解時間が，
ファーストアクセプタンス（最初の正解）として解説等でしばしば言及される．
久しぶりにプログラミングコンテストに参加するとはいえ，予選で落ちるとは到底思えない．
ならば，最初のうちは，多少高いスコアを取ることを目指すよりも，
ファーストアクセプタンスを多く獲得し，存在をアピールしたほうが良いのではないか．
自分の実力を持ってすれば，各問題を見た瞬間に，
その問題を自分が何分で解くことができるかと，
その問題が開始後何分で自分以外の参加者によって最初に解かれるかがわかる．
これらの情報を用いて，
どの程度ファーストアクセプタンスを獲得できるかを計算するプログラムを作っておこう．
問題
N
問の問題から成るプログラミングコンテストを考える．
問題
i
を自分が解くには
A
i
秒の時間がかかり，
また，問題
i
は開始後
B
i
秒で自分以外の参加者によって最初に解かれるとする．
自分が問題を解く順番は自由に決められるが，
1 つの問題を解き始めたら，解き終えるまでその問題をやるものとする．
問題を解き終え次の問題に取りかかる際などの，
問題を解いている時間以外の時間は十分小さいと考え，無視して考えることにする．
また，全ての問題は終了までに 1 人以上の自分以外の参加者によって解かれるものと考える．
自分以外の参加者によって最初に解かれるよりも早く，
あるいは同時に問題
i
を自分が解きおえた時，
問題
i
のファーストアクセプタンスを獲得できる．
すなわち，問題
i
を自分が開始後
t
i
秒に解き終えたとしたとき，
t
i
≤
B
i
であれば，問題
i
のファーストアクセプタンスを獲得できる．
最大で何個の問題に関してファーストアクセプタンスが獲得できるかを計算するプログラムを作成せよ．
入力
入力の最初の行は 1 つの整数
N
を含む．
続く
N
行には，各問題に関する情報が与えられる．
これらの行のうちの
i
行目には 2 個の数字
A
i
,
B
i
が書かれている．
出力
最大で獲得することのできるファーストアクセプタンスの数を出力せよ．
制約
1 ≤
N
≤ 1000
1 ≤
A
i
≤ 10
6
(
1 ≤
i
≤
N
)
1 ≤
B
i
≤ 10
6
(
1 ≤
i
≤
N
)
部分点
この問題の判定には，20 点分のテストケースのグループが設定されている．
このグループに含まれるテストケースの入力は以下を満たす．
1 ≤
N
≤ 16
入出力例
入出力例 1
入力例 1:
3
3 5
5 9
10 20
入力例 1 に対する出力例:
3
入出力例 2
入力例 2:
3
3 2
5 15
10 12
入力例 2 に対する出力例:
2 | [
{
"submission_id": "aoj_2263_10222670",
"code_snippet": "#include <bits/stdc++.h> \nusing namespace std;\nusing ll=long long;\nusing dll=long double;\nusing pq=priority_queue<int,vector<int>,greater<int>>;\nusing graph=vector<vector<int>>;\n\n#define int ll\n#define db dll\n#define sbt(x) (x).begin(),(x)... |
aoj_2262_cpp | 問題 D : 停止問題
G○○gle Code Jam は G○○gle 社が年に 1 度開催するコンテストである．
優勝者は G○○gle への入社を許される，世界最高峰のコンテストだ．
しかし勿論，それ以外の参加者は帰らぬ者となる．
G○○gle Code Jam では自分の好きなプログラミング言語や処理系を使うことができる．
僕は Defunge という自らが開発したプログラミング言語で参加することにした．
この言語を使えば，計算困難な問題はおろか，判定不能な問題ですら解決できる気がしている．
問題
与えられるプログラムが停止するかを判定するプログラムを作成せよ．
与えられるプログラムは，以下で説明するプログラミング言語 Defunge で記述されている．
Defunge のプログラムの命令は 1 文字であり，1 次元の列ではなく 2 次元の格子状に並んでいる．
下図は，Defunge のプログラムの例である:
6>--v.
.^--_@
Defunge の言語仕様は以下のようになっている．
Defunge のプログラムは、左上のマスから右向きで開始する． （左上のマスの命令が最初に実行される．）
命令によって進む向きが上下左右に変更されることがある．
端に達したら反対側の端へジャンプする．
メモリは 0 から 15 までの 1 つの整数を記憶することができる．
メモリにははじめ 0 が記憶されている．
Defunge の命令は以下の通りである．
'<' … 実行の向きを左にする．
'>' … 実行の向きを右にする．
'^' … 実行の向きを上にする．
'v' … 実行の向きを下にする．
'_' … メモリの値が 0 ならば実行の向きを右に，そうでなければ左にする．
'|' … メモリの値が 0 ならば実行の向きを下に，そうでなければ上にする．
'?' … 実行の向きが上下左右のいずれかにランダムに等確率で変更される．
'.' … 何もしない．
'@' … プログラムの実行を停止する．
'0' - '9' … メモリの値を指定の数値にする．
'+' … メモリの値に 1 を加える，ただし値が 15 だった場合 0 にする．
'-' … メモリの値から 1 を引く，ただし値が 0 だった場合 15 にする．
入力
入力の最初の行は 2 つの整数 R, C を含む．
続く R 行はプログラムを表す。それぞれ C 文字の文字列を含む。
出力
プログラムが停止する可能性がある場合は YES と出力せよ．
そうでないとき，NO と出力せよ．
制約
1 ≤
R
≤ 20
1 ≤
C
≤ 20
入出力例
入出力例 1
入力例 1:
2 6
6>--v.
.^--_@
入力例 1 に対する出力:
YES
入出力例 2
入力例 2:
2 6
5>--v.
.^--_@
入力例 2 に対する出力:
NO
入出力例 3
入力例 3:
2 6
.>--v.
.^--?@
入力例 3 に対する出力:
YES
補足
Defunge は Befunge と類似している．
Befunge の理解は Defunge の理解を助けるかもしれないが，
異なる点も多いため，注意せよ．
http://ja.wikipedia.org/wiki/Befunge | [
{
"submission_id": "aoj_2262_9264727",
"code_snippet": "/* _ ____ */\n/* AC U /\"\\ u U /\"___| AC */\n/* \\/ _ \\/ \\| | u */\n/* AC / ___ \\ | |/__ AC */\n/* /_/ \\_\\ \\____| ... |
aoj_2266_cpp | 問題 H : キャッシュ戦略
今，G○○gle Code Jam の地区大会が始まろうとしている．
斜め右前の席に座っている男の ID は lyrically と言うらしい．
東京大学時代の記憶に，似たような ID の仲間が居た覚えがあるが，僕の仲間は一人残さず美少女だったはずだ．
僕の記憶の中の lyrically は，アルゴリズムの力や実装の力もさながら，
気合で問題に正解することにも定評があった．
例えば，計算量が多少悪いプログラムでも，上手な実装をすることで高速にし，
正解とするようなことも得意としていた．
プログラムを高速にする上で，非常に大切になってくるのが，
キャッシュメモリとの親和性である．
問題
ブロック毎に読み込みのコストが異なるメモリを考える．
起こる全てのメモリアクセスがあらかじめ分かった状態での，
フルアソシアティブのキャッシュメモリでの最善なキャッシュ戦略を求めたい．
以下，平易な言葉で説明する．
M
個の箱と，
N
個のボールがある．
ボールには
1
から
N
までの番号が付いており，
各ボール
i
には重さ
w
i
が決まっている．
また，長さ
K
の数列
a
1
,
a
2
, …,
a
K
が与えられる．
各
a
j
は
1 ≤
a
j
≤
N
を満たす整数である．
はじめは全ての箱は空である．
j
= 1, 2, …,
K
の順に，以下を行いたい．
ボール
a
j
が入っている箱があれば，何もしない．
この操作にかかるコストは 0 である．
ボール
a
j
が入っている箱がなければ，いずれかの箱にボール
a
j
を入れる．
ボールを箱に入れる際，もし既にその箱に入っているボールがあれば，そのボールは外に出す．
この操作にかかるコストは
w
a
j
である．（コストは，入れる箱や取り出すボール等にはよらない．）
コストの和の最小値を計算するプログラムを作成せよ．
入力
入力の最初の行は 3 つの整数
M
,
N
,
K
を含む．
続く
N
行の
i
行目には整数
w
i
が書かれている．
続く
K
行の
j
行目には整数
a
j
が書かれている．
出力
コストの和の最小値を出力せよ．
制約
1 ≤
M
≤ 10
1 ≤
N
≤ 10
4
1 ≤
K
≤ 10
4
1 ≤
w
i
≤ 10
4
1 ≤
a
j
≤
N
部分点
この問題の判定には，20 点分のテストケースのグループが設定されている．
このグループに含まれるテストケースの入力は以下を満たす．
1 ≤
M
≤ 3
1 ≤
N
≤ 10
1 ≤
K
≤ 10
3
入出力例
入力例 1
入力例 1:
3 3 6
10
20
30
1
2
3
1
2
3
入力例 1 に対する出力例:
60
入力例 2
入力例 2:
2 3 6
10
20
30
1
2
3
1
2
3
入力例 2 に対する出力例:
80 | [
{
"submission_id": "aoj_2266_10849099",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nconst int N = 10005;\nconst int M = N * 4;\n\nint n, m, k;\nint w[N];\nint a[N];\nint lst[N];\n\ntypedef int ftype;\nconst ftype INF = 0x3f3f3f3f;\nint head[N], to[M], nxt[M], to... |
aoj_2265_cpp | 問題 G : プログラミングコンテストチャレンジブック
今，G○○gle Code Jam の地区大会が始まろうとしている．
前の席に座っている男の ID は omeometo と言うらしい．
後ろの席に座っている男の ID は jellies と言うらしい．
東京大学時代の記憶に，似たような ID の仲間が居た覚えがあるが，僕の仲間は一人残さず美少女だったはずだ．
彼らは，机の上に蟻のイラストが掛かれた本を持っている．
あれはもしや…プログラミングコンテストのアルゴリズムを最初に網羅し，今では発売禁止となった伝説の本，
「プログラミングコンテストチャレンジブック」ではないか？
僕は，omeometo がトイレに行ったのを見計らい，少し拝借して，読んでみることにした．
プログラミングコンテストチャレンジブック
…しかし，僕は一瞬で本を読み終えてしまった．
拍子抜けだ．簡単すぎる．
少し古い本だからといって，こんな内容でよく売る気になったものだ．
例えば，最初の三角形の問題．これは，簡単すぎてお話にならない．自分だったら，こうする．
問題
N
本の直線状の棒がある．棒
i
の長さは
a
i
である．
あなたは，それらの棒から 6 本を選び，
それらの 3 本ずつで，2 個の三角形を作ろうと考えている．
3 本の棒はそれぞれ三角形の辺として用い，2 つの棒が触れる位置は棒の端点のみとする．
つまり，棒の一部を三角形の辺として使うことは許されず，必ず棒全体を辺としなければならない．
また，棒の太さは考えず，三角形は正の面積を持たなければならないものとする．
2 個の三角形の周長の和の最大値を求めよ．
ただし，2 個の三角形を作ることができない際には 0 を答えとせよ．
入力
入力の最初の行には整数
N
が書かれている．
続く
N
行の
i
行目には 1 つの整数
a
i
が書かれている．
出力
答えの整数を出力せよ．
制約
1 ≤
N
≤ 10
5
1 ≤
a
i
≤ 10
15
部分点
この問題の判定には，20 点分のテストケースのグループが設定されている．
このグループに含まれるテストケースの入力は以下を満たす．
1 ≤
N
≤ 100
入出力例
入力例:
6
1
1
1
1
1
1
入力例に対する出力:
6 | [
{
"submission_id": "aoj_2265_10042900",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\nbool check3(vector<int> a) {\n //for (int i: a) cout << i << ' '; cout << endl;\n\tsort(a.begin(), a.end());\n\treturn a[2] < a[1] + a[0];\n}\n\nbool check6(vector<int> a) {... |
aoj_2269_cpp | 問題 K : 巡回セールスマン問題
2011 年のあの頃，まだプログラミングコンテストはとても平和であり，
我々はルールを精読せずに気軽にコンテストに参加していた．
しかし，そこに G○○gle の陰謀は迫っていた．
ある日，G○○gle によって秘密裏に買収されていた T○pC○der のコンテストは，
人知れずうちにルールが改変されており，命がけのプログラミングコンテストとなっていた．
そして僕は，そこで，何も知らず，
まっ先に kita_masa のプログラムのオーバーフローを突いたのだ…．
(iwi)
「うう…ああ…」
wata
「今やるべきことは自分を攻めることではない．チャンスを無駄にする気か？」
…そういえば，今こいつは，部屋に居る全ての人間を一瞬にして倒していた．
どうなっているんだ？
wata
「まず，知っているかもしれないが， G○○gle は NP 完全問題を含む多くの計算困難と言われてきた問題に対する多項式時間の効率的なアルゴリズムを持っている．P vs NP 問題を解決したが，敢えてそれを秘匿することによってここまで成長したのだ．」
(iwi)
「もしやとは思っていたが，やはりか…． しかし，お前は今，G○○gle の人間を一瞬にして倒した．もしやお前も…？」
wata
「残念ながら違う．しかし…お前なら，分かるはずだろう？」
…なるほど!! そういうことか．
彼は大学時代，指数時間のアルゴリズムを高速にすることに興味を持っていた．
例え指数時間であっても，指数の底が極めて小さければ，
現実的なインスタンスに対して十分に高速な可能性がある．
wata
「そういうことだ．例えば，今僕は，巡回セールスマン問題の
O
*
(1.0001
n
)
時間のアルゴリズムを完成させようとしている．」
凄まじい，想像以上だ…．
wata
「完成させるにあたって，グラフアルゴリズムに詳しいお前の力が必要だ． 手を貸してくれるな？」
(iwi)
「ああ，勿論だ．まかせろ!!」
問題
グラフが与えられる．
グラフは
N
個の頂点を持ち，頂点には
1
から
N
の番号が付いている．
また，グラフは
M
個の辺を持ち，辺は有向 (一方通行) で，
それぞれ距離が決まっている．
頂点
1
から出発し，頂点
2, 3, …,
N
をこの順番に訪れ，頂点
1
へ戻る経路を考える．
ここで，「この順番に訪れる」というのは，経路に含まれる頂点の部分列に
2, 3, …,
N
が含まれるということである．
つまり，スタート地点の頂点
1
から頂点
2
への移動は，
直接の移動であっても，他の頂点を経由した移動であってもよく，
次の頂点
2
から頂点
3
への移動，
さらにその次の頂点
3
から頂点
4
への移動等に関しても同様である．
同じ頂点や同じ辺を 2 度通っても構わない．
グラフが与えられた時，
頂点
1
から出発し頂点
2, 3, …,
N
をこの順番に訪れ頂点
1
へ戻る経路のうち，
最短のものの長さを出力するプログラムを作成せよ．
経路の長さとは，経路に含まれる辺の距離の和である．
複数回含まれる辺に関しては，含まれる回数の分だけ距離を加えよ．
入力
入力の最初の行は 2 つの整数
N
,
M
を含む．
これは，グラフの頂点数と辺数を表す．
続く
M
行は，辺の情報を表す．
これらの行のうちの
i
行目は 3 つの整数
a
i
,
b
i
,
c
i
が書かれており，
辺
i
は頂点
a
i
から頂点
b
i
を結び，その距離は
c
i
であることを表す．
出力
条件を満たす経路のうち最短のものの長さを出力せよ．
ただし，条件を満たす経路が存在しない場合は，-1 を出力せよ．
制約
2 ≤
N
≤ 10
5
0 ≤
M
≤
N
+ 500
1 ≤
a
i
,
b
i
≤
N
，
a
i
≠
b
i
1 ≤
c
i
≤ 10
3
入出力例
入出力例 1
入力例 1:
5 5
1 2 10
2 3 20
3 4 30
4 5 40
5 1 50
入力例 1 に対する出力の例:
150
入出力例 2
入力例 2:
5 5
1 5 10
5 4 20
4 3 30
3 2 40
2 1 50
入力例 2 に対する出力の例:
600 | [
{
"submission_id": "aoj_2269_10342595",
"code_snippet": "// AOJ #2269 Traveling Salesman Problem\n// 2025.4.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 1e9;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int ... |
aoj_2270_cpp | 問題 L :
L
番目の数字
反乱を嗅ぎつけた多くの G○○gle のコーダーが我々を取り押さえにやってきた．
かなりの数だ．
その中には，東京大学時代に僕らを優しく指導してくれた先輩たちも多く見受けられる．
残念ながら，今では敵同士だ．
wata
「予想以上の数だ…」
(iwi)
「ああ，我々が超高速指数時間アルゴリズムを持っているからと言って，それは彼らにようやく並んだに過ぎない．この数では…」
？？
「心配要らない！君たち，アルゴリズムをこっちに渡すんだ！」
声がした窓の外を見ると，G○○gle の建物に向きあう集団がいた．
黒の生地に赤で I，緑で ○，黄色で M と書かれた T シャツ … 彼らは I○M か！？
そして奇妙なことに，彼らは，向かってくる G○○gle のコーダー達を，
キーボードに触れることなく倒していた．
どうなっている？
(iwi)
「…！ ついに Wats○n 2 は完成したのか！」
wata
「どういうことだ？」
2011 年，I○M は彼らの高い技術力を活用し，
自然言語で出題されたクイズに高速かつ正確に応答するシステムである Wats○n を完成させ，
クイズ番組にてクイズ王と呼ばれてきた人間たちに勝利した．
そして 20XX 年の今，Wats○n は，
プログラミングコンテストの問題に対し解答のプログラムを作成するシステムとして生まれ変わったのだ．
I○M の登場により，我々を取り囲む人数が減ってゆく．
wata
「チャンスだ！半分は任せられるか？」
(iwi)
「もちろんだ！」
僕は，妄想と決別したことにより，全てを思い出していた．
当然，当時の知識や経験は，今から見ればレベルが低すぎて役に立たない．
しかし，一番大切なものを思い出すことができた．
それは，プログラミングコンテストを愛する気持ちである．
問題を開く瞬間のワクワク感，サンプルが通った瞬間の盛り上がり，
ステータスが更新される瞬間の緊張，勝利の瞬間の喜び．
(iwi)
「必ず kita_masa の復讐を果たし，この狂った世界を終わらせる！」
そして，僕は自信の 1 題を繰り出す．
これは，東京大学時代の自分が愛した問題「
K
番目の数字」を独自のテクニックにより一般化かつ大規模化した問題である．
問題
グラフが与えられる．
N
個の頂点があり，頂点に
1
から
N
の番号が付いている．
これらの頂点は，
N
- 1
本の辺によりツリー状に接続されている．
各頂点
v
には数字
a
v
が定まっている．
下図は，与えられるグラフの例である．
各頂点には上部に頂点の番号が，下部にその頂点に定められた数字 (
a
v
) が書かれている．
与えられるグラフの例
次に，
Q
個の以下のようなクエリが与えられる．
各クエリ
q
には，頂点
v
q
,
w
q
と整数
l
q
が指定される．
頂点
v
q
から頂点
w
q
への経路に含まれる頂点の数字のうち
l
q
番目に小さいものを求めよ．
経路は単純なもののみを考える．単純な経路とは，同じ頂点を二度通らない経路のことである．グラフがツリー状であることから，単純な経路は一意である．
経路には両端点（すなわち頂点
v
q
,
w
q
）を含むものとする．
例えば，上図のグラフが与えられている時，
(
v
q
,
w
q
,
l
q
) = (1, 6, 3)
なるクエリ
q
に対する答えは 7 である．
これは，頂点 1 から頂点 6 への経路には頂点 1, 3, 4, 6 が含まれており，
それらに定まった数字 2, 5, 8, 7 の 3 番目めに小さな数字は 7 であることによる．
グラフとクエリを受け取り，結果を出力するプログラムを作成せよ．
入力
入力の最初の行は 2 つの整数
N
,
Q
を含む．
これは，頂点数とクエリの数を表す．
続く
N
行は，各頂点の持つ数字を表す．
これらの行のうちの
v
行目は 1 つの整数
x
v
が書かれており，
これは頂点
v
の持つ数字を表す．
続く
N
- 1
行は，辺の情報を表す．
これらの行のうちの
e
行目は 2 つの整数
a
e
,
b
e
が書かれており，
これらは辺
e
が結ぶ 2 つの頂点を表す．
続く
Q
行は，クエリの情報を表す．
これらの行のうちの
q
行目は 3 つの整数
v
q
,
w
q
,
l
q
が書かれており，
これらはクエリ
q
の情報を表す．
出力
出力は
Q
行からなる．
q
行目にクエリ
q
の答えを出力せよ．
入力に関する制約
1 ≤
N
,
Q
≤ 10
5
1 ≤
x
v
≤ 10
9
1 ≤
a
e
,
b
e
≤
N
1 ≤
v
q
,
w
q
≤
N
頂点
v
q
から頂点
w
q
への経路には
l
q
個以上の頂点が存在する．
入出力例
入力例:
6 11
2
4
5
8
9
7
1 3
2 3
3 4
4 5
4 6
1 6 1
1 6 2
1 6 3
1 6 4
1 2 1
1 2 2
1 2 3
2 5 1
2 5 2
2 5 3
2 5 4
入力例に対する出力:
2
5
7
8
2
4
5
4
5
8
9 | [
{
"submission_id": "aoj_2270_10978199",
"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\nusing ll = long long;\n#define r... |
aoj_2274_cpp | 問題 D
列の構成
問題文
1
から
N
までの相異なる整数が
N / 2
個書かれたカードがいくつか与えられるので，次の条件を満たすような長さ
N
の数列
seq
を
1
つ作って出力して欲しい．
seq
の各要素は
0
か
1
である．
すべてのカードについて以下が成り立つ： カードに書かれた数字を
card[1], ..., card[N/2]
とする．このときカードに書かれた部分の和:
seq[card[1]] + ... + seq[card[N/2]]
が
N / 8
以上かつ
3N / 8
以下になっている．
例えば，
N = 8
でカードが
2
枚渡され，カードに書かれている数字がそれぞれ
[1, 2, 7, 8]
，
[4, 5, 7, 8]
であったとする．このとき
seq=[0, 1, 0, 1, 0, 1, 0, 1]
や
seq=[0, 0, 0, 0, 1, 1, 1, 1]
とおくと条件を満たすようにできている．
入力形式
入力は次の形式で与えられる．
N
K
card
1
[1]
card
1
[2]
...
card
1
[N/2]
card
2
[1]
card
2
[2]
...
card
2
[N/2]
...
card
K
[1]
card
K
[2]
...
card
K
[N/2]
1
行目において
N
は構成するべき数列の長さ，
K
はカードの枚数である．
続く
K
行には各カードの情報が与えられる．
card
i
[1], ..., card
i
[N/2]
が
i
番目のカードに書かれている数字である．
出力形式
seq
の
i
番目の要素が
i
文字目に対応するように数列
seq
を
1
行に出力せよ．
なお，どの入力に対しても解は必ず少なくとも
1
つは存在する．
制約
8 ≤ N ≤ 1,000
,
1≤ K ≤ N / 2
N
は
8
の倍数
1 ≤ card
i
[1] < card
i
[2] < ... < card
i
[N/2] ≤ N
入出力例
入力例 1
8 2
1 2 7 8
4 5 7 8
出力例 1
01010101
入力例 2
8 3
2 3 4 6
3 4 5 8
3 4 6 8
出力例 2
01110011 | [
{
"submission_id": "aoj_2274_10809100",
"code_snippet": "#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<list>\n#include<queue>\n#include<deque>\n#include<algorithm>\n#include<numeric>\n#i... |
aoj_2276_cpp | 問題 F
ボ〜ル
問題文
2 次元平面上の原点にボールがあり，
x
軸の正方向との角度が反時計回りに見て
0
度
180
度までの間の方向に一様な確率で発射されようとしている (発射される方向は整数角であるとは限らない)．ボールの大きさは十分小さく，平面上では点であると見なすことにする．この問題における目的は，このボールをできるだけ高い確率で捕獲することである．
平面上に
N
個の場所
(x
i
, y
i
)
が与えられる．ボールを捕獲するために，あなたは
N
個の場所から
K
個の場所を選んで，それぞれの場所に人を配置することができる．人は
i
番目の与えられた場所に対して半径
r
i
以内の距離まで動いてボールを取ることが出来る．
人の配置をうまく選んでボールを捕獲できる確率を最大にするとき，その確率を出力せよ．
入力形式
入力は以下の形式で与えられる．
N
K
x
1
y
1
r
1
...
x
N
y
N
r
N
N
はボールを捕獲するために人を置くための場所の数であり，
K
はその中から使うことの出来る場所の数である．
(x
i
, y
i
)
は
i
番目の場所の座標であり，
r
i
はそこから動くことの出来る距離である．
出力形式
確率を小数表記で
1
行に出力せよ．小数点以下何桁でも出力して構わないが，相対誤差あるいは絶対誤差が
10
-6
未満になっていなければならない．
制約
1≤ N≤ 1,500, 1≤ K≤ N
|x
i
| ≤ 1,000, |y
i
| ≤ 1,000, 1 ≤ r
i
< (x
i
2
+ y
i
2
)
1/2
入力値はすべて整数である．
入出力例
入力例 1
2 1
10 10 10
-10 10 10
出力例 1
0.50
2
つ場所があり，そのうちのどちらかに人を配置できる．この場合，どちらに配置しても確率は
1/2
になる．
入力例 2
2 2
10 10 10
-10 10 10
出力例 2
1.0
入力例 3
5 3
-10 -10 5
10 10 2
-10 10 3
-10 0 4
10 0 2
出力例 3
0.3574057314330
入力例 4
4 2
1 1 1
2 2 2
3 3 3
4 4 4
出力例 4
0.50 | [
{
"submission_id": "aoj_2276_4339412",
"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... |
aoj_2268_cpp | 問題 J : 乱択平衡分二分探索木
ところで，G○○gle Code Jam の地区大会で右の席に座っていた男の
ID は rng_58 と言うらしい．
東京大学時代の記憶に，似たような ID の仲間が居た覚えがあるが，僕の仲間は一人残さず美少女だったはずだ．
彼女はいわゆる無表情不思議系キャラだったような気がする．
ということは，彼は知らない男だ．rng とは何の略だろう．
おそらく Random Number Generator に違いない．
乱択アルゴリズムを得意とするのだろう．
ところで，乱数を用いた平衡二分探索木である Treap は，
2011 年頃のプログラミングコンテストではしばしば用いられていたようだが，
20XX 年の今では，あまり使用されていない．
当時 Treap は実装が平易であるという理由により Splay 木や Scapegoat 木と並んでよく使われていた．
20XX 年の今，命をかけたプログラミングコンテストが日常的に行われるこの世界では，
実装が多少平易になるというような甘い根拠での選択は到底考えられない．
皆，少しでもプログラムが高速になるよう考えているし，
世界大会出場者ともなれば，Left-leaning 赤黒木程度なら十数秒で記述できるのが当然だ．
例えば，Treap が赤黒木よりも遅くなってしまうのは，
高さの定数倍が効いてくるからであると言われている．
ここは，落ち着いてそれを数値的に考察することにより，精神の安定を取り戻そう．
問題
キーを実数とする Treap に
N
個のランダムな要素を挿入した際に，
高さが
h
(
h
= 0, 1, …,
N
- 1
) となる確率を求めよ．
以下，より詳しく説明する．
Treap とは乱数を用いた平衡二分探索木である．
各ノードは，キーの他に，優先度という値を持つ．
ここでは，キーと優先度は
0
から
1
までの実数値とする．
Treap では，以下の 2 つの条件が常に保たれる．
キーに関する条件
各ノードに関して，左の子以下のノードは自分より小さなキーを持つ
各ノードに関して，右の子以下のノードは自分より大きなキーを持つ
優先度に関する条件
各ノードに関して，子のノードは自分より小さな優先度を持つ
下図は，Treap の例である．
各ノードの，上部にキーが，下部に優先度が書かれている．
7 つのノードからなる Treap の例．
挿入の操作は，以下のように行われる．
挿入するキー を
x
とおく．
挿入する新しいノードの優先度
p
を
0
から
1
までの一様分布よりランダムに決定する．
通常の二分探索木と同様に，まずは優先度を無視し新しいノードを挿入する．
優先度の条件を満たすように，新しいノードを上に持ち上げるような回転操作を必要なだけ繰り返す．
木の回転操作に関しては，補足の節に詳しく記述したので，参考にせよ．
下図は，先ほどの例にキーとして 0.5，優先度として 0.7 を持つ頂点を挿入した過程の例である．
まずは優先度が無視され，ノードが挿入される．
回転を行い新しいノードが上へ行く．
さらに回転を行うと，優先度の条件が満たされるので，挿入は終了する．
空の Treap に
N
個のキーを，
やはり
0
から
1
までの一様分布よりランダムに選び挿入してゆくとする．
最終的に高さが
h
となる確率を，
各
h
= 0, 1, …,
N
- 1
について求めよ．
なお，実数は十分な精度を持って扱われるとし，
例えば 2 つのノードの優先度が等しくなる確率は 0 としてよい．
また，高さとは，根のノードから各ノードに至るために通らなければならない辺の本数の最大値である．
入力
1 つの整数
N
が書かれている．
出力
出力は
N
行から成る．
i
行目に高さが
i
- 1
となる確率を出力せよ．
値は小数点以下何桁表示しても構わない．
制約
1 ≤
N
≤ 3 × 10
4
出力する値は
10
- 5
以下の誤差を含んでいても構わない．
入出力例
入力例 1:
1
入力例 1 に対する出力例:
1.0
入力例 2:
2
入力例 2 に対する出力例:
0.0000000000
1.0000000000
補足
木の回転操作には，右回転と左回転がある．
右回転とは，以下の 2 つの図の 1 つめの状態を 2 つめの状態にする操作であり，
左回転とは，以下の 2 つの図の 2 つめの状態を 1 つめの状態にする操作である．
右回転をする前，または左回転をした後
右回転をした後，または左回転をする前
Treap においては，持ち上げたいノードがその親ノードの左の子であった場合，
持ち上げたいノードを上図の P とするような右回転を適用し，
持ち上げたいノードがその親ノードの右の子であった場合，
持ち上げたいノードを上図の Q とするような左回転を適用する．
木の回転操作について，より詳しくは，例えば以下を参照せよ．
http://ja.wikipedia.org/wiki/%E6%9C%A8%E3%81%AE%E5%9B%9E%E8%BB%A2
Treap について，より詳しくは，例えば以下を参照せよ．
http://en.wikipedia.org/wiki/Treap
http://www.prefield.com/algorithm/container/treap.html | [
{
"submission_id": "aoj_2268_10307688",
"code_snippet": "// AOJ #2268 Randomized Self-Balancing Binary Search Tree\n// 2025.3.17\n\n#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename R>\nvoid fft(vector<complex<R>> &f, int dir) {\n int n = f.size();\n assert(n == (1 << static_cast<in... |
aoj_2278_cpp | 問題 H
あばれうなぎ
問題文
きつねのしえるはうなぎを食べるのが好きである．
2T+1
枚の鉄板が連続して並んでおり，順番に
-T, -T+1, ..., T
の番号が付いている．しえるはこれらの鉄板に熱を加え，生きたうなぎを焼こうとしている．うなぎを焼く手順は以下のようなものである．
まず，時刻
t=-1
のときに各鉄板にどれだけのエネルギーを加えるかを決め，実際にエネルギーを加える．各鉄板に加えるエネルギーの総和は
E
以下でなければならない．すなわち，
i
番の鉄板に加えるエネルギーを
E(i)
として，
E(i) ≥ 0, E(-T)+...+E(T) ≤ E
でなければならない．なお，エネルギーは整数でなくてもよい．
エネルギーを加えたあと，鉄板の熱さは
E(i) / C(i)
になる．ここで，
C(i)
は
i
番の鉄板の比熱である．
t = -0.5
のときにうなぎを
0
番の鉄板に載せる．
t = 0, 1, 2,..., T
のときに，うなぎは今自分がいる鉄板の熱さだけ加熱される．
t = 0.5, 1.5, 2.5,...,T-0.5
のとき，うなぎは自分の今いる鉄板にとどまるか，両隣の鉄板に移動することができる．
t = T+0.5
のときにうなぎを鉄板の上から回収する．
ところで生きたうなぎというのはとても活きがよくさらに頭も良いので，もしかすると自分にかかる熱さの総和が最小になるように動いたりするんではないかとしえるは不安になった．そうなると鉄板に適当に熱を加えただけではうなぎを十分に加熱できない恐れさえある．
そこであなたには，うなぎが常に最適に動くとして，うなぎに与えることのできる熱さの和の最大値を求めて欲しい．
入力形式
入力は以下の形式で与えられる．
T
E
C(-T)
C(-T+1)
...
C(T)
T
はうなぎを熱する時間，
E
は鉄板に与えることの出来るエネルギーの総和，
C(i)
は
i
番の鉄板の比熱である．
出力形式
1
行目にうなぎに与えられる熱さの和の最大値を出力せよ．小数点以下何桁でも出力して構わないが，相対誤差あるいは絶対誤差が
10
-6
未満になっていなければならない．
制約
1 ≤ T ≤ 10
5
1 ≤ E ≤ 10
5
1 ≤ C(i) ≤ 10
5
入力に含まれる値はすべて整数である．
入出力例
入力例 1
1 100
1 1 1
出力例 1
100.0
この場合は
0
番の鉄板にエネルギーを全て加えるのが最適である．
入力例 2
2 100
1 2 100 2 1
出力例 2
2.8301886792453
入力例 3
5 100000
99999 99999 99999 1 1000 1000 1000 1 99999 99999 99999
出力例 3
199.4680851063830
謝辞
この問題は Writer の二人がインド料理 RAJU 百万遍店とマクドナルド百万遍店において夏の暑さに辟易する中で作られた． | [
{
"submission_id": "aoj_2278_4376010",
"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\nin... |
aoj_2282_cpp | Problem B: B問題
R大学の2D好きの人たち (2DRespecters)は、A津大学で開催されるプログラミングの練習合宿に参加する。
この練習合宿では、参加者たちが自作のプログラミング問題を持ち寄り、練習に用いる。
2DRespectersも、いくつかの問題を作成することになった。
しかし、合宿の3日前になっても、まだ、B問題が完成していなかった。
最初のB問題の担当者が作成した問題は、担当者が問題の制約を難しくし過ぎてしまったため、C問題以降にまわされてしまったのだ。
そして、簡単すぎても、難しすぎてもいけない、微妙な難易度の調整が必要とされるB問題は、誰もが手を付けたがらなかった。
それ以来、B問題担当者の椅子は空席のままである。
合宿3日前になって、遂に、この問題を解決するために、2DRespecters期待のホープが立ち上がった。
だが、彼は、B問題を作成する気がない。
彼は、自分でB問題を作成したくないので、B問題の作成担当を他者に押し付ける手法を考え出したのだ。
彼の手法は、表面上、B問題の作成担当者を平等に決定する。
彼の手法は、以下の通りである。
問題作成のために要した作業時間が最も少ない人がB問題担当者になる。
作業時間が最も少ない人が複数人居た場合は、より問題難易度の小さい問題の担当者がB問題作成担当者になる。
作業時間が最も少ない人が複数人居て、その中で、問題難易度の最も小さい人が複数人いた場合は、ホープの彼がB問題作成担当者になる。
彼の手法は、一見、最も仕事をしていない人がB問題の作成を担当するため、2DRespectersのメンバー全員に快く受け入れられた。
しかし、彼の手法には、以下のような裏がある。
各個人の作業時間は、各個人が口頭で申請するため、嘘の申請をすることが可能である。
問題の作業可能時間を超える作業時間や負の作業時間を申請すると、嘘だとばれる。
ある問題の作成のための作業時間は、必ず問題難易度の整数倍になることが知られているため、これに反する作業時間を申請した場合も、嘘だとばれる。
嘘の申請をした人の嘘がばれた場合、その人が必ずB問題作成担当者になる。
申請は一人ずつ順番に行い、嘘がばれる場合は、申請の時点でばれる。
一人でも嘘の申請がばれた時点で、B問題作成担当者が決まり、それ以降の申請は行わない。
申請者は、自分より前の申請のみを考慮し、申請の時点で自分がB問題作成担当者にならないような最小の作業時間を申請するものとする。
申請の時点で、申請者がB問題作成担当者にならないような報告ができない場合は、嘘だとばれないような最大の作業時間を申請する。
各個人の担当する問題難易度のリストが申請順に与えられたとき、誰がB問題作成担当者になるかを求めるプログラムを作成せよ。
ホープの彼の申請順番は、一番最後である。
なお、本問題はフィクションであり、本問題の作成の経緯とは一切の関係がない。
Input
入力は、複数のデータセットからなり、データセットの終わりは、半角スペースで区切られた0が二つだけを含む行で表される。
データセットの総数は40以下である。
データセットの1行目では、整数
n
(
2 ≤ n ≤
100
1,000
)と整数
m
(
1 ≤ m ≤ 1,000
)が半角スペース区切りで与えられる。
データセットの2行目では、整数
a_1
,
a_2
, ...,
a_n
(
1 ≤ a_i ≤ 1,000
,
1 ≤ i ≤ n
)が半角スペース区切りで与えられる。
1行目の
n
と
m
は、それぞれ、申請者の数と問題の作業可能時間を表す。
2行目では、申請順に並べられた問題難易度のリストが与えられており、
a_i
は、問題の難易度を表す。
Output
それぞれのデータセットごとに、B問題作成担当者の申請順番を1行で出力せよ。
Sample Input
3 100
3 7 4
5 24
4 6 12 3 8
5 1
1 1 2 2 3
0 0
Output for Sample Input
2
4
5 | [
{
"submission_id": "aoj_2282_1960392",
"code_snippet": "#include <bits/stdc++.h>\n#define f first\n#define s second\nusing namespace std;\nint n,m,a[1001];\ntypedef pair <int,int> P;\ntypedef pair<P,int> PP;\n\nint solve(){\n PP t[1001];\n t[0]=PP(P((m/a[0])*a[0],a[0]),0);\n for(int i=1;i<n;i++){\n so... |
aoj_2280_cpp | 問題 J
Mod 3 Knights Out
問題文
ある日の夕方，コンテストの問題を解き終えた二人は今日の問題について話し合っていた．
A「くそー，あのライツアウトの問題，mod
2
じゃなくて mod
3
とか mod
7
とかだったら解法分かったのにー！」
B「じゃあ，mod
3
で別の方法で解く問題を作ればいいんですね．分かりました！」
こうして次のような問題が誕生した．
H × W
のチェス盤がある．チェス盤の各マスには
0
から
2
の整数が書かれている．このチェス盤にナイトを置いていく．ただし，各マスには多くても
1
体のナイトしか置けない．各マスについて，
(マスの数値+そこを攻撃するマスにいるナイトの数)=0 mod 3
が成り立つようなナイトの配置を
良い
配置と呼ぶ．攻撃するマスとはそのマスから縦方向に
±2
マスかつ横方向に
±1
マス，もしくは縦方向に
±1
マスかつ横方向に
±2
マスずれたマスのことである．
良いナイトの配置の数を求めよ．答えは大きくなる可能性があるので
1,000,000,007
で割った余りを答えよ．
入力形式
最初の行に
H
と
W
がスペース区切りで与えられる．
次の
H
行には、チェス盤のマス目に書かれている数値として
W
個の
0
，
1
，
2
のいずれかの整数がスペース区切りで与えられる．
出力形式
良いナイトの配置の数を
1,000,000,007
で割った余りを出力せよ．
制約
1 ≤ H ≤ 50
1 ≤ W ≤ 16
入出力例
入力例 1
5 5
0 2 0 2 0
2 0 0 0 2
0 0 0 0 0
2 0 0 0 2
0 2 0 2 0
出力例 1
5
入力例 2
3 3
2 2 2
2 0 2
2 2 2
出力例 2
8
入力例 3
7 7
2 2 2 2 2 2 2
2 1 1 2 1 1 2
2 0 1 0 1 0 2
2 2 0 2 0 2 2
2 0 1 0 1 0 2
2 1 1 2 1 1 2
2 2 2 2 2 2 2
出力例 3
96
入力例 4
7 3
2 2 2
1 0 1
0 1 0
1 1 1
0 1 0
1 0 1
2 2 2
出力例 4
8
入力例 5
6 6
0 2 0 1 0 2
2 0 1 2 2 2
0 2 2 0 0 0
2 0 2 0 2 0
0 2 2 1 0 2
0 0 0 2 0 2
出力例 5
1
入力例 6
16 16
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
出力例 6
1
謝辞
この問題は Tester と Writer が
アジア地区予選の問題
に関して話し合ったのをきっかけとして作られた。 | [
{
"submission_id": "aoj_2280_10433362",
"code_snippet": "// AOJ #2280 Mod 3 Knights Out\n// 2025.4.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MOD = 1000000007;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf)... |
aoj_2275_cpp | 問題 E
Fox Number
問題文
きつねのしえるは数字について考えるのが好きである．ある日，しえるはこの世にねこの数字というものがあることを知り，自分もそのような数字が欲しくなってしまった．そこで，次の性質を満たす数字をとりあえず Fox Number と呼ぶことにした．
[性質]: 整数
N
は
k (≥ 1)
個の素数
p
1
, ..., p
k
と正整数
e
1
, ..., e
k
で，
p
1
< ... < p
k
，
e
1
≥ ... ≥ e
k
を満たすものによって
N = p
1
e
1
× ... × p
k
e
k
と書けるとき，Fox Number であると呼ぶことにする．
ところでしえるはこの性質をその場の思いつきで決めてしまったのでこれがどういう性質を持っているのか全くわかっていない．そこで，この数字の性質を調べるために区間
[A-B, A+B]
に含まれる Fox Number の個数を出力して欲しい．
入力形式
1
行目に以下の
2
つの整数が与えられる．
A
B
出力形式
1
行目に，
A-B
以上
A+B
以下の Fox Number の個数を出力せよ．
制約
1 ≤ A ≤ 10
12
0 ≤ B ≤ 5 × 10
5
入出力例
入力例 1
18 2
出力例 1
4
16 = 2
4
, 17 = 17
1
, 19 = 19
1
, 20 = 2
2
× 5
1
は Fox Number である．一方で
18 = 2 × 3
2
は Fox Number ではない．合計して
4
つの Fox Number がある．
入力例 2
100 10
出力例 2
18
入力例 3
123456 789
出力例 3
1464 | [
{
"submission_id": "aoj_2275_4301948",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <numeric>\n#include <algorithm>\n#include <deque>\n#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n#include <iomanip>\n#include <map>\n#include <stack>\n#include <queue>\n#include <... |
aoj_2277_cpp | 問題 G
XOR 回路
問題文
計算機科学実験及演習 3
は CAD を用いて CPU を設計する授業である．CPU は多くの回路を組み合わせなければ動かず，その中の 1 つに
n
ビット入力の XOR 回路がある．ここで XOR 回路とは，入力ビット列
x
1
x
2
...x
n
に対して，
x
1
+ x
2
+ ... + x
n
\ (mod 2)
を出力する回路のことを言う．しかし完璧に動作する XOR 回路を設計するのは時間がかかるので，とりあえず
n
ビットのうち
k
ビットだけ使う XOR 回路 A を作ることにした．つまり，ある
i
1
, ... , i
k
が存在し，回路 A は
x
i
1
+ x
i
2
+ ... + x
i
k
\ (mod 2)
を出力する．
暫く後に今度は
k
ビット入力の XOR 回路が欲しくなった．何だ簡単ではないか．先ほどの回路 A を使えばよい．ただ残念なことに，回路 A がどの
k
ビットを使っていたのか忘れてしまった上に，回路 A の設計図も間違って削除してしまった．しかしコンパイル済みの回路 A は残っている．なので，入力
x
1
x
2
...x
n
を入れて回路 A を実行することで，その出力
x
i
1
+ x
i
2
+ ... + x
i
k
\ (mod 2)
を見ることは出来る．
出来るだけ作業の時間を短くしたいので，回路 A の実行回数には上限を設定することにしよう．どうすれば回路Aが依存しているビット
i
1
, ... , i
k
を見つけられるだろうか？
入出力
最初に
n
と
k
がスペース区切りで与えられる．以降，プログラムは回路 A に入力を与え，その出力を読むことが出来る．例えば C/C++ で回路 A にビット列
x
1
x
2
...x
n
を与えるには
printf("?
x
1
x
2
...x
n
\n"); fflush(stdout);
とする．ここで各
x
i
の間にスペースをいれてはならない．
次に，
scanf("%d", &v);
とすると
v
に対応する出力
x
i
1
+ x
i
2
+ ... + x
i
k
\ (mod 2)
が入る．
最終的に回路 A が依存するビット
i
1
,...,i
k
を出力するには
printf("!
i
1
i
2
...i
k
\n"); fflush(stdout);
とする．ここで各
i
j
の間はスペースを丁度 1 つずついれる．
制約
1 ≤ n ≤ 10,000
1 ≤ k ≤ min(10, n)
各データセットごとに，回路 A の実行回数の上限は 200 回であり，それを超えると誤答 (
Query Limit Exceeded
) と判定される．
入出力例
入力例 1
以下の例はプログラムの入出力の例である．左の列はプログラムの出力，右の列はプログラムへの入力を時系列順に示している．最初に
n k
が入力として与えられる．ここでは
n = 2, k = 1
である．次に回路 A に
00
という入力をいれると，回路 A は
0
を返した．次に回路 A に
01
という入力をいれると，回路 A は再び
0
を返した．このことから回路 A は
1
ビット目のみ利用していることが分かり，プログラムは
1
を解答として出力した．
プログラムの出力
プログラムへの入力
2 1
?00
0
?01
0
!1
入力例 2
以下の例では，
n = 2, k = 2
であり，直ちに回路 A が
1
ビット目と
2
ビット目の両方を利用していることが分かる．よってプログラムは
1
と
2
を解答として出力した．
プログラムの出力
プログラムへの入力
2 2
!1 2 | [
{
"submission_id": "aoj_2277_10851253",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n, k, qq[10005], ans[10005];\n\nint ask(int lf = 0, int rg = n - 1){\n cout << \"?\";\n for(int i = 0; i < n; i ++)\n cout << ((lf <= i && i <= rg) ? qq[i] : 0);\n cout << endl;\n\n... |
aoj_2283_cpp | Problem C: Seishun 18 Kippu
R大学のとある学生sirokurostoneはA津大学で行われる合宿に参加しようとしていた。
他のメンバーは新幹線を使用する予定なのだが、sirokurostoneは青春18切符を使って向かおうとしていた。
同じく青春18切符使いのとある2D好きな人物も合宿に参加しようとしていた。
どうせならと一緒に行こうと考えたsirokurostoneは途中の駅で2D好きな彼を拾って向かおうと考えた。
sirokurostoneはR大学を出る前に遅延状況を確認してすこしでも時間のかからないルートを通ってA津大学のある駅に着きたいと考えている。
sirokurostoneはルートが確定した後に2D好きな彼にもその情報を伝えるつもりである。
しかし、sirokurostoneは遅延状況を見てもどのルートを通れば早くA津大学のある駅に到着できるか分からず困っている。
そこで、あなたの仕事はsirokurostoneに代わって遅延状況からどれくらいでA津大学のある駅に着くのかを求めることである。
各駅間には、駅間の距離と遅延予想時間がある。
電車は動き始めてから40km/hを維持するものとする。
地点aと地点bの間の移動時間は、
距離/40+遅延予想時間
で求めることができる。
各駅での停車時間は無視してよいものとする。
Input
複数のデータセットの並びが入力として与えられる。
データセット数は50以下であることが保障されている。
各データセットは、次の形式をしている。
n
m
s
p
g
a
1
b
1
d
1
t
1
...
a
i
b
i
d
i
t
i
...
a
m
b
m
d
m
t
m
整数
n
(
3 ≤ n ≤ 500
)と
m
(
2 ≤ m ≤ 5000
)は、それぞれ駅の数、各駅間の線路の数の合計を表す。
s
、
p
、
g
は、それぞれsirokurostoneが乗る駅、2D好きな人物が乗る駅、A津大学がある駅の場所を示す文字列である。
s
、
p
、
g
はそれぞれ違う文字列である。
続く
m
行は、駅間情報を表す。
a
i
、
b
i
は、線路がつなぐ駅を示す文字列である。
a
i
と
b
i
は、双方向に行き来することができる。
a
i
と
b
i
が一致することはない。
整数
d
i
(
40 ≤ d
i
≤ 10000
)は、
a
i
と
b
i
の距離を表す。
d
i
は40の倍数であることが保証されている。
整数
t
i
(
0 ≤ t
i
≤ 20
)は、
a
i
と
b
i
の間の遅延予想時間を示す。
駅名を表す文字列は、全てアルファベットの小文字および大文字からなる20文字以下の文字列であらわされる。
駅と駅の間の線路は高々1本である。
入力の終わりは2つのゼロを含む行で表される。
Output
入力データセットごとに、A津大学がある駅への到達時間(単位:時間)を出力せよ。
sirokurostoneが乗る駅から2D好きな人が乗る駅までの経路と、2D好きな人物が乗る駅からA津大学がある駅の場所までの経路があることが保証されている。
Sample Input
4 4
A B G
A B 40 3
B C 80 0
A G 40 0
B G 80 0
5 6
Kusatsu Tokyo Aizu
Tokyo Nagoya 120 3
Kusatsu Nagoya 40 0
Kusatsu Kanazawa 40 0
Kanazawa Aizu 40 0
Tokyo Kanazawa 40 0
Tokyo Aizu 80 4
0 0
Output for Sample Input
5
4 | [
{
"submission_id": "aoj_2283_9847642",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <set>\n\nusing namespace std;\nusing ll = long long;\n\nconst ll INF = static_cast<ll>(1) << 62;\n\nvoid solve() {\n ll n, m; cin >> m;\n string s, t, f; cin >> s >> t >> f;\n ma... |
aoj_2284_cpp | Problem D: 伝説の剣
※ この問題には厨二成分が多く含まれます。胸焼けにご注意ください。
ついに復活を遂げた魔王は、再び世界を闇に包むために人間界に攻め入ろうとしていた。
魔王は、本格的な侵攻を始める前に、まず伝説の剣を破壊することにした。
前回の戦争において、魔王は伝説の剣を持つ勇者によって倒された。
魔王の体は闇の衣によって守られているため、生半可な攻撃では魔王を傷つけることはできない。
しかし、伝説の剣は、神々の加護により、魔王の闇の衣すら容易に貫いてしまう。
そのため、今回の戦争に勝利するためには、なんとしてもその伝説の剣を手に入れて破壊する必要がある。
調査の末、伝説の剣はとある遺跡の最奥に安置され、次代の勇者が現われるのを待っていることがわかった。
伝説の剣は、邪悪な者や盗賊によって奪われるのを防ぐために、周囲に点在する無数の宝珠によって封印されている。
魔王は、強力な魔力を持っているため、触れるだけで宝珠を破壊することができる。
ただし、宝珠による封印は多重構造になっており、表層から順に破壊していく必要がある。
例えば、第1の封印の宝珠を破壊する前に第2以降の封印の宝珠に触れたとしても、破壊することはできない。
また、複数の宝珠が同じ封印を構成していることもあるが、魔王はそのうちの一つに触れるだけで、同時にその封印を破壊することができる。
遺跡には神聖な力が満ちており、並の魔物では入ることすらままならない。
そこで、魔王自ら赴き伝説の剣を回収してくることになった。
いかに魔王といえど、長時間その力を受け続ければただではすまない。
魔王の右腕であるあなたの仕事は、念のため魔王が全ての封印を破壊し、伝説の剣の下に辿りつくまでの時間を求めることである。
Input
入力は、複数のデータセットからなり、入力の終わりはスペースで区切られたゼロ二つからなる行である。
データセットの総数は50以下である。
各データセットは、次の形式をしている。
w
h
s(1,1)
...
s(1,w)
s(2,1)
...
s(2,w)
...
s(h,1)
...
s(h,w)
w
と
h
は、それぞれ遺跡のフロアを表現する行列データの幅と高さを示す整数であり、それぞれ
1 ≤ w, h ≤ 100
であり、
2 ≤ w + h ≤ 100
と仮定して良い。
続く
h
行はそれぞれ、スペースで区切られた
w
個の文字から構成されており、文字
s(y,x)
は、座標
(y,x)
の地点の状態を示す。
その意味は、以下の通りである。
S：魔王が最初にいる地点。フロアに必ず1つだけ存在する。
G：伝説の剣の地点。必ず1つだけ存在する。
.：なにもない。
数字：宝珠がある地点。数字は構成する封印の番号を示す。数字は1以上の整数であり、間の数字に抜けはないとしてよい。
また、魔王は、遺跡のフロア内の上下左右の隣接する座標に移動することができ、その移動にかかる時間を1とする。
破壊できる宝珠は触れるだけで破壊できるため、宝珠の破壊には時間はかからない。
Output
各データセットに対して、魔王が全ての封印を破壊し、伝説に剣に辿りつくために必要な最短時間を出力せよ。
Sample Input
10 10
S . . . . . . . . .
. . . . . . . . . .
. . . . 1 . . . . .
. . . . . . . . . .
. . . . . . . . . .
. . . . . . . 3 . .
. . . . . . . . . .
. . . . . 4 . . . .
. . . . . . . . . .
2 . . . . . . . . G
10 10
S . . . . . 3 . . .
. . 3 . . . . . . .
. . . . 1 . . . . .
. . . . . . 4 . . .
. . 3 . . . 1 . . .
. . . . . . . 3 . .
. . . . . . . . . .
. . . . . 4 . . . .
. . . . . 5 . . . .
2 . . . . . . . . G
10 10
S . . . . . . . . 1
. . . . . 5 . . . .
. 4 . . . . . . . .
. . . . 8 . 9 . . .
. . . . 10 . . . . .
. . 7 . G . . . . .
. . . 11 . . . . . .
3 . . . . . . . . 6
. . . . . . . 2 . .
. . . . . . . . . .
0 0
Output for Sample Input
38
36
71 | [
{
"submission_id": "aoj_2284_7936801",
"code_snippet": "#include <algorithm>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <vector>\nusing namespace std;\n#define fr first\n#define sc second\ntypedef pair<int, int> P;\nP s, g;\ntypedef pair<P, P> Q;... |
aoj_2279_cpp | 問題 I
山
問題文
L 氏はある都市の市長である．L 氏の市長としての手腕はすさまじく時を止め一瞬にして都市中に鉄道網を引いたり，財政の赤字を一夜にして莫大な黒字にしたり，はては巨大な怪獣をどこからともなく呼んでパフォーマンスに使うこともした．
そんな L 氏は土地の隣り合った行または列同士を何度も入れ替えることででこぼこな土地を山形にするという遊びを最近発明した．土地は
H×W
個のブロックに区切られており，ブロック
(y,x)
では海面からの高さが
h
y,x
であると測定されている．入れ替え後のブロック
(y,x)
の高さを
h'
y,x
と書くことにする．この土地が山形であるとは，以下の図のように，あるブロック
(y^*,x^*)
があって，そこを山頂として山頂から離れるに従って高さが単調減少しているものをいう．
h'
y^*-1, x^*-2
<
h'
y^*-1, x^*-1
<
h'
y^*-1, x^*
>
h'
y^*-1, x^*+1
>
h'
y^*-1, x^*+2
∧
∧
∧
∧
∧
h'
y^*, x^*-2
<
h'
y^*, x^*-1
<
h'
y^*, x^*
>
h'
y^*, x^*+1
>
h'
y^*, x^*+2
∨
∨
∨
∨
∨
h'
y^*+1, x^*-2
<
h'
y^*+1, x^*-1
<
h'
y^*+1, x^*
>
h'
y^*+1, x^*+1
>
h'
y^*+1, x^*+2
ところで，L 氏はいくらがんばっても山形にできないような土地が存在する気がした．そこで，前もってコンピュータにその土地が山形にできるかどうかをチェックさせることにした．
入力形式
最初の行に
H
と
W
がスペース区切りで与えられる．
次の
H
行に土地の高さが与えられる．
各行は
W
個の数値からなり，それぞれ対応する場所の高さを表す．
出力形式
土地を山形にできるなら
"YES"
，できないなら
"NO"
を出力せよ．
制約
1 ≤ H,W ≤ 1,000
0 ≤ h
y,x
≤ 10
8
全ての
h
y,x
は相異なる．
入出力例
入力例 1
3 3
1 3 2
7 9 8
4 6 5
出力例 1
YES
入力例 2
以下の例では
2
番目の列と
3
番目の列を入れ替えることにより土地を山形にすることができる．
3 3
9 3 6
8 2 5
7 1 4
出力例 2
YES
入力例 3
1 1
100
出力例 3
YES
入力例 4
3 3
1 3 2
4 6 5
7 8 9
出力例 4
NO
謝辞
この問題は京都市の周りに山が多いことから作られた．よって京都市の周りの山に感謝の意を表する． | [
{
"submission_id": "aoj_2279_10215449",
"code_snippet": "// AOJ #2279\n// Mountain 2025.2.13\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n... |
aoj_2285_cpp | Problem E: アニペロ
猛暑が続いた、長かったようで短かったような夏がもうすぐ終わろうとしていた。
そんな8月下旬のある日、とある2D好きな人物とその先輩のslipは、アニペロサマーライブ、通称アニペロと呼ばれるイベントに参加していた。
アニペロとは、さまざまなアニメソングアーティストたちが集結する、日本国内最大のアニメソングライブイベントである。
今年のアニペロは、公式で公表されていたアーティストの他に、シークレットで超豪華歌手も出演し、大盛況の内に幕を閉じた。
アニペロには初参戦だった2D好きな彼は、ライブ後の余韻にひたりつつも、ひとつの疑問を抱えていた。
「アニペロに出演するアーティストはどのように決めているのだろうか？」
彼は、数あるアーティストの中から、出演アーティストの選出をするのに、次のような方法があるのではないかと、選出法を考えてみた。
まず、アニペロのアーティストには、シークレットアーティストとスタンダードアーティストの2種類の分類があるものとする。
シークレットアーティストとは、ライブに出演することを事前公表せず、ライブ本番になって突然現れるアーティストのことを指す。
スタンダードアーティストとは、ライブに出演することを事前に公表してよいアーティストのことを指す。
全てのアーティストは、次のステータスを持つ。
アーティスト名：文字列
アーティストを雇うための金額（以下、雇用金と呼ぶ）：自然数
このアーティストが出演することで、お客をどれほど満足させられるか（以下、満足度と呼ぶ）：自然数
今回、ライブに出演するアーティストを選ぶために、シークレットアーティスト候補
N
人、スタンダードアーティスト候補
M
人が、すでに用意されているものとする。さらに、ライブの主催者は、アーティストを雇用するために使用できる資金
LIMIT
を持っているものとする。
主催者は、次の条件を満たすように、アーティストを選出しなければならない。
N
人のシークレットアーティスト枠から、1人以上、2人以下を選出する(1人or2人なのは、シークレットがいなかったり多かったりすることを避けるためである)
M
人のスタンダードアーティスト枠から、
X
人以上のアーティストを選出する
アーティストを全て選出し終えたとき、雇用金の合計を、
LIMIT
以下にする
選出したアーティスト全員で得られる満足度の合計を最大化する
さて、ここまで選出法を考えた2D好きな彼は、この方法でプログラムを書いてみようと思った。しかし、彼は選出法を考えるのに気力を使ってしまい、プログラムを書く気力がなくなってしまったようなので、彼の代わりにプログラムを書いてあげてほしい。
あなたの仕事は、上記の選出法に従い、アーティストを選出したときのお客の最大満足度を出力するプログラムを作成することである。
Input
入力は、複数のデータセットからなる。データセットの総数は20以下である。
各データセットは、次の形をしている。
LIMIT
N
M
X
SEC_NAME
1
SEC_E
1
SEC_S
1
...
SEC_NAME
i
SEC_E
i
SEC_S
i
...
SEC_NAME
N
SEC_E
N
SEC_S
N
NAME
1
E
1
S
1
...
NAME
i
E
i
S
i
...
NAME
M
E
M
S
M
整数
LIMIT
(
4 ≤
LIMIT
≤ 1000
)、
N
(
2 ≤ N ≤ 100
)、
M
(
2 ≤ M ≤ 100
)、
X
(
2 ≤ X ≤ M
)は、
それぞれアーティストを雇用するのに使用できる資金、シークレットアーティスト候補の数、スタンダードアーティスト候補の数、スタンダードアーティストから選出しなければならない最低人数を表す。
SEC_NAME
i
、
NAME
i
、はそれぞれシークレットアーティスト候補、スタンダードアーティスト候補の名前を指す30文字以下の文字列である。
文字列には、アルファベット('A'-'Z', 'a'-'z')のみが使用される。
同じアーティスト名が2回以上出現することはない。
整数
SEC_E
i
、
E
i
(
1 ≤
SEC_E
i
,
E
i
≤ 10
)、
SEC_S
i
、
S
i
(
1 ≤
SEC_S
i
,
S
i
≤ 10
) は、それぞれシークレットアーティスト候補の雇用金、スタンダードアーティスト候補の雇用金、シークレットアーティスト候補が出演したときに得られる満足度、スタンダードアーティスト候補が出演したときに得られる満足度を表す。
入力の終了は、0が4つの行で示される。このデータについては処理する必要はない。
Output
選出法を適用してアーティストを選出したとき、お客の満足度の最大値を出力せよ。
アーティストの選出の仕方は、必ずあると仮定してよい。
Sample Input
100 2 2 2
A 5 6
B 7 8
C 1 2
D 3 4
27 2 3 3
A 8 10
B 8 10
C 6 7
D 5 4
E 8 9
27 2 3 2
A 8 10
B 8 10
C 6 7
D 5 4
E 8 9
44 3 6 5
YamatoNoHito 9 10
ZettoNoHito 9 10
TMR 10 10
SkillNoGroup 8 10
NanaSama 6 9
FRPSD 6 8
Magi3rdDeshi 5 7
Magi13thDeshi 2 2
MagicalItoh 4 6
0 0 0 0
Output for Sample Input
20
30
31
55 | [
{
"submission_id": "aoj_2285_9658651",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define N 110\n\nint limit, n, m, x;\nint e1[N], s1[N];\nint e2[N], s2[N];\nint dp[1010][N][N];\nint ep[1010];\n\nint main(){\n\twhile (1){\n\t\tcin >> limit >> n >> m >> x;\n\t\tif (limit == 0 && n == 0 ... |
aoj_2288_cpp | Problem H: Oh, My Goat!
太郎君は、次郎君に古文のノートを借りた。
明日の古文の宿題を写させてもらうためだ。
太郎君は、用心深い性格をしているため、万が一のことを考えて、近所のコンビニで次郎君のノートのコピーを取って自宅へ帰った。
太郎君は、自宅で宿題を始めようとしたときに、慌てた。
次郎君から借りたノートが鞄に入っていなかったからだ。
どうやら、コンビニに忘れてきてしまったようだ。
太郎君は、急いでコンビニに引き返した。
コピー機とその周辺を懸命に捜索したが、ノートを見つけることはできなかった。
困り果てた太郎君は、コンビニの店長に助けを求めた。
余談だが、店長は地球環境に優しい人で、白ヤギさんを飼っている。
店長は、地球環境に気を配る心遣いを持っているため、常日頃から、ペットの白ヤギさんに、餌としてコピー機周辺の客の忘れものを与えている。
店長によると、ノートは、今晩の白ヤギさんの晩御飯であり、白ヤギさんは現在食事中だそうである。
太郎君は白ヤギさんに頼みこみ、食べかけのノートを取り返すことはできたが、ノートはビリビリに破れぼろぼろである。
太郎君は、急いで自宅に引き返した。
自室の机とその周辺を懸命に捜索したが、ノートのコピーを見つけることはできなかった。
困り果てた太郎君は、お母さんに助けを求めた。
余談だが、太郎君のお母さんは地球環境に優しい人で、黒ヤギさんを飼っている。
太郎君のお母さんは、地球環境に気を配る心遣いを持っているため、常日頃から、ペットの黒ヤギさんに、餌として太郎君の宿題を与えている。
お母さんによると、ノートのコピーは、今晩の黒ヤギさんの晩御飯であり、黒ヤギさんは現在食事中だそうである。
太郎君は黒ヤギさんに頼みこみ、食べかけのノートを取り返すことはできたが、ノートのコピーはビリビリに破れぼろぼろである。
次郎君のノートとそのコピーをビリビリのぼろぼろにされてしまった太郎君は、ノートを可能な限り復元しようと考えた。
そこで、繋がりそうなノートの切れ端同士を繋ぎ合わせて、「繋ぎ合せたノート」を作成した。
同様に、繋がりそうなノートのコピーの切れ端同士を繋き合わせて、「繋ぎ合せたノートのコピー」を作成した。
太郎君は、あらゆる可能性を考えるために、繋がりそうな切れ端同士をつなぎ合わせた。
このため、1つの切れ目に2つ以上の切れ端が繋がれてしまった箇所もあった。
繋ぎ合わせ方の例を図1に示す。
図1は、7つの切れ端と6つの切れ目からなる。
図1
切れ端"haru"と"natsu"に続く切れ目には、切れ端"wa"が繋がり、文章が合流している。
切れ端"wa"に続く切れ目には、切れ端"ake"と"saron"が繋がり、文章が分岐している。
このような合流や切れ端があるため、図1は次のような4つの文章を表す。
haruwaakebono
haruwasaronpusu
natsuwaakebono
natsuwasaronpusu
ノートやノートのコピーは、白ヤギさんや黒ヤギさんが、食べてしまったため、復元できない部分があったり、彼らのご飯に混ざっていた関係のない書類の切れ端が混在していることもある。
太郎君の代わりに、「繋ぎ合わせたノート」と「繋ぎ合わせたノートのコピー」の2つを入力として受け取って、両方に共通して現れる文章の数を求めるプログラムを作成せよ。
Input
入力の1行目では、データセットの数
T
(
1 ≤ T ≤ 100
)が与えられる。
データセットは、「繋ぎ合せたノート」の情報と、「繋ぎ合せたノートのコピー」の情報から成る。
「繋ぎ合せたノート」の情報として、
1行目に
n
(
2 ≤ n ≤ 500
)と
m
(
1 ≤ m ≤ 600
)が与えられる。
n
は、切れ端と切れ端を繋ぎ合せる切れ目の数である。
続く
m
行で繋ぎ合せ方が与えられる。
各行は、切れ端の上端に繋がる切れ目の番号
a
、切れ端の下端につながる切れ目の番号
b
、切れ端を表す文字列
s
からなる。
ただし、
0 ≤ a < b < n
が満たされる。
s
は長さが1以上5以下の文字列で、アルファベットの小文字のみから成る。
「繋ぎ合せたノートのコピー」も「繋ぎ合せたノート」と同じ形式で与えられる。
なお、0番目の切れ目から繋ぎ合せ情報を辿り、
n-1
番目の切れ目に到達する過程で得られる文字列を連結したもののみを文章と呼ぶものとする。
また、それぞれの繋ぎ合せの中で同じ文章が2つ以上出現することはない。
Output
それぞれのデータセット毎に、答えの整数を1,000,000,007で割った余りを1行で出力せよ。
Sample Input
4
2 1
0 1 a
2 2
0 1 a
0 1 b
5 5
0 1 a
0 2 b
1 3 a
2 3 c
3 4 e
3 3
0 1 aa
0 2 bce
1 2 a
2 4
0 1 abc
0 1 def
0 1 ghi
0 1 jkl
2 4
0 1 ghi
0 1 jkl
0 1 mno
0 1 pqr
6 7
0 1 haru
0 1 natsu
1 2 wa
2 3 ake
2 4 saron
3 5 bono
4 5 pusu
5 4
0 1 haruw
1 2 aakeb
2 3 o
3 4 no
Output for Sample Input
1
1
2
1 | [
{
"submission_id": "aoj_2288_10339676",
"code_snippet": "// AOJ #2288 Oh, My Goat!\n// 2025.3.31\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MOD = 1000000007;\n\ntypedef vector<vector<pair<char,int>>> Automaton;\n\npair<Automaton, int> buildAutomaton(int n, int m, vec... |
aoj_2286_cpp | Problem F: Farey Sequence
slipは数字を眺めるのが好きである。
ファイルをダウンロードしているときの、残り時間を眺めているだけで、時間を潰せるほどである。
そんなslipが友人から面白い数列を教えられた。
その数列の定義は以下のとおりである。
一般項を
F
n
と表わす。
F
n
とは、
n
以下の分母を持つ0以上1以下のすべての約分された分数(既約分数)を小さな順から並べたものである。
ただし、整数0、1はそれぞれ分数0/1、1/1として扱われる。
つまり
F
3
は、
F
3
= (0/1, 1/3, 1/2, 2/3, 1/1)
のように表される。
F
5
であれば
F
5
= (0/1, 1/5, 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5, 1/1)
と表される。
slipはこの数列にすぐにのめり込んだ。
しかしこの数列を眺めていても、なかなか特徴がつかめなかった。
特徴をつかむためにまずは各項の項数がいくつあるのか調べようと思ったが、
増え方の規則がわからず、自力で理解することを断念した。
そこで、
勝手に友人と思っているあなたに、指定した項にどれだけの項数があるのかを聞くことにした。
あなたの仕事は、与えられた項における項数を求めることである。
Input
入力は以下の形式で与えられる。
t
n
1
...
n
i
...
n
t
t
(
1 ≤ t ≤ 10000
)はテストケースの数である。
n
i
(
1 ≤ n
i
≤ 1000000
)は与えられた項の番号である。
Output
各テストケースごとに、項数を1行に表示せよ。
Sample Input
2
3
5
Output for Sample Input
5
11 | [
{
"submission_id": "aoj_2286_11042230",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vector... |
aoj_2290_cpp | A: Attack the Moles
ICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．
今日の修行は，もぐらたたきを何回も行って，反射神経と記憶力を高めようというものである．出てくるもぐらを次々に叩き，出来るだけ多くのポイントを獲得したい．
もぐらが出てくる可能性のある場所は直線状に並んでいて，基準点からの距離によって座標が定まっている．うさぎはしばらく修行を続けるうちに，もぐらの出現する場所と時間が常に一緒であることに気が付いた．うさぎは，その情報をすべて記録し，コンピュータで解析を行うことにした．
もぐらを叩くには，もぐらの出現位置に手を動かした後，もぐらの出てくるタイミングにぴったり合わせてもぐらを叩かなければならない．もぐらをうまく叩けると，そのもぐらに応じてポイントを得ることが出来る．もぐらを叩く動作は一瞬で行うことが出来るが，手を移動させる速さには限界がある．うさぎはもぐらを叩くにあたって左右両方の手を用いることができる．左手と右手は独立に動かすことが可能であるが，左手は常に右手より座標が小さい位置に存在しなければならない．このような条件下で，最大でどれだけのポイントが得られるかを調べたい．
Input
N
V
X
Left
X
Right
X
1
T
1
P
1
...
X
N
T
N
P
N
N
は出てくるもぐらの数，
V
は手を移動させられる最大の速さ，
X
Left
,
X
Right
はそれぞれ，左手，右手の初期位置の座標である．
X
i
,
T
i
,
P
i
はそれぞれ，
i
番目のもぐらの，出現する位置の座標，ゲーム開始から出現までの時間，叩けた際に得られるポイントである．
1 ≤
N
≤ 3,000，1 ≤
V
≤ 10,000，1 ≤
X
Left
<
X
Right
≤ 100,000，1 ≤
X
1
≤
X
2
≤ ... ≤
X
N
≤ 100,000，1 ≤
T
i
≤ 100,000，1 ≤
P
i
≤ 100,000 を満たす．(
X
i
,
T
i
) として同一の組は複数回現れない．
Output
うさぎが得られる最大のポイントを 1 行に出力せよ．
Sample Input 1
3 10 150 250
100 20 123
201 10 67
202 10 45
Sample Output 1
190
Sample Input 2
1 7 20 90
55 5 73
Sample Output 2
73
Sample Input 3
10 2 1000 2000
400 300 1
600 200 1
700 800 1
700 500 1
900 600 1
1000 700 1
1300 900 1
1400 400 1
1500 1000 1
2000 100 1
Sample Output 3
10 | [
{
"submission_id": "aoj_2290_9372895",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\nt... |
aoj_2295_cpp | F: Power of Power
ICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．
今日の修行は，非常に大きな数の計算を行って，計算力をつけて意識を高めようというものである．大きい数が簡単に出てくる演算として，累乗が挙げられる．
N
個の非負整数
A
1
,
A
2
, ...,
A
N
がある．これらの並べ替え
B
1
,
B
2
, ...,
B
N
であって，
B
1
B
2
...
B
N
- 1
B
N
が最大になるものを求めたい．うさぎたちにとってはもちろん常識であるが，この計算は右上から順に行う．また，0
0
= 1 であると約束することにする．
最大条件を満たす
B
1
,
B
2
, ...,
B
N
は複数通りあるかもしれない．そのような場合は，そのうちで辞書順最小の列を選ぶことにしよう．
Input
N
A
1
...
A
N
1 ≤
N
≤ 100，0 ≤
A
i
≤ 1,000,000,000 を満たす．
Output
出力は
N
行からなる．
i
行目には
B
i
を出力せよ．
Sample Input 1
4
7
5
10
6
Sample Output 1
5
6
7
10
Sample Input 2
3
0
0
1000000000
Sample Output 2
1000000000
0
0 | [
{
"submission_id": "aoj_2295_2389243",
"code_snippet": "#include <bits/stdc++.h>\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 ALL(x) begin(x),end(x)\n\nusing namespace std;\nusing ld = long double;\n\nvector<int> solve2(const vector<int>& v) {\n int n = v.size();\... |
aoj_2292_cpp | C: Common Palindromes
ICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．
今日の修行は，文字列中にある回文を探すことによって，文章から隠れたメッセージを読解する能力を高めようというものである．回文はたくさんあるかもしれないので，探すついでに個数も数えてしまいたい．
2 つの文字列
S
,
T
が与えられるので，以下を満たす整数の組 (
i
,
j
,
k
,
l
) の個数を求めたい．
1 ≤
i
≤
j
≤ (
S
の長さ)．
1 ≤
k
≤
l
≤ (
T
の長さ)．
S
の
i
文字目から
j
文字目までを取り出した部分文字列は，
T
の
k
文字目から
l
文字目までを取り出した部分文字列と同一であり，さらにこれらは回文 (左から読んでも右から読んでも同じになる文字列) となっている．
Input
S
T
文字列
S
,
T
はともに長さが 1 以上 50,000 以下であり，アルファベット大文字からなる．
Output
条件を満たす整数の組 (
i
,
j
,
k
,
l
) の個数を 1 行に出力せよ．
Sample Input 1
ICPC
CPCPC
Sample Output 1
10
Sample Input 2
BABBAB
ABBA
Sample Output 2
14
Sample Input 3
MYON
USAGI
Sample Output 3
0 | [
{
"submission_id": "aoj_2292_9777583",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconst long long MOD = 10000000000000099;\nconst long long BASE = 1333;\nconst int MAXN = 5 * 100000;\n\nlong long POWER[MAXN + 1];\n\nlong long mul(long long a, long long b) {\n return ((__int128_t)a... |
aoj_2294_cpp | E: Entangled with Lottery
ICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．
今日の修行は，あみだくじを利用して，未来を読む力をつけて運気を高めようというものである．もちろん直感に頼るだけでなく，綿密な確率計算も欠かせない．
今回考えるあみだくじは，長さ
H
+ 1 センチメートルの縦棒
N
本からなる．うさぎは棒の上部を見て，
N
本のうち 1 本を選ぶことになる．棒の下部には，左から
P
本目の棒の場所にのみ「当たり」と書かれている．あみだくじにはいくつかの横棒が含まれる．横棒の配置に関して，以下の条件を考えよう．
各横棒は，
a
を 1 以上
H
以下の整数として，縦棒の上端から
a
センチメートルの高さにある．
各横棒は，隣り合った 2 本の縦棒のみを結ぶ．
同じ高さには複数の横棒は存在しない．
うさぎはこれらの条件を満たすように
M
本の横棒を引いた．あいにくうさぎは記憶力が良いので，当たりの位置や横棒の位置をすべて覚えてしまっており，あみだくじを楽しめない．そこで友達のねこにさらに横棒を追加してもらうことにした．
まず，うさぎは当たりを狙って
N
本の棒のうち 1 本を選ぶ．その後，ねこは以下の操作をちょうど
K
回行う．
横棒を追加しても上で指定された条件を満たすような場所のうち 1 箇所を無作為に選ぶ．ここで，どの場所も等確率で選ばれるものとする．選んだ場所に横棒を追加する．
そして，うさぎが選んだ棒が当たりであったかを判定する．棒の辿り方は通常のあみだくじと同様である (横棒に出会うたびに隣の縦棒に移る)．うさぎは，可能な限り当たりとなる確率を高くしたい．
Input
H
N
P
M
K
A
1
B
1
...
A
M
B
M
A
i
,
B
i
(1 ≤
i
≤
M
) はうさぎが引いた横棒のうち
i
番目のものが，縦棒の上端から
A
i
センチメートルの高さにあり，左から
B
i
本目の縦棒と左から
B
i
+ 1 本目の縦棒を結ぶことを表す整数である．
2 ≤
H
≤ 500，2 ≤
N
≤ 100，1 ≤
P
≤
N
，1 ≤
M
≤ 100，1 ≤
K
≤ 100，
M
+
K
≤
H
，1 ≤
A
1
<
A
2
< ... <
A
M
≤
H
，1 ≤
B
i
≤
N
- 1 を満たす．
Output
当たりとなる確率が最大となるようにうさぎが棒を選んだときの，当たりとなる確率を 1 行に出力せよ．10
-6
以下の絶対誤差が許容される．
Sample Input 1
9 4 3 2 1
2 1
7 3
Sample Output 1
0.571428571
Sample Input 2
9 4 3 2 3
2 1
7 3
Sample Output 2
0.375661376 | [
{
"submission_id": "aoj_2294_10189840",
"code_snippet": "// AOJ #2294\n// Entangled with Lottery 2025.2.4\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst double EPS = 1e-14;\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int H, N, P, M, K;\n cin >> H >> N >> P >> M >> K;\n\... |
aoj_2298_cpp | I: Starting Line
ICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．
今日の修行は，一直線上の道を走って，体力と判断力を養おうというものである．うさぎは今，スタートラインに立って長い長い道を見渡している．
道の途中にはいくつかニンジンが置かれており，うさぎはニンジンを食べると加速することができる．加速していないときのうさぎの走る速さは毎秒
U
メートルであるが，ニンジンを食べることで，最後のニンジンを食べてから
T
秒後までは速さが毎秒
V
メートルとなる．また，うさぎはニンジンを
K
個まで食べずに持っておくことができる．ニンジンを持っていても走る速さは変わらない．
ニンジンを持ったり食べたりするのに時間はかからないとして，ゴールまでの最短所要時間を求めたい．
Input
N
K
T
U
V
L
D
1
...
D
N
N
はニンジンの個数，
L
はスタートからゴールまでの距離 (メートル)，
D
i
(1 ≤
i
≤
N
) は
i
番目のニンジンが置かれている場所のスタートからの距離 (メートル) である．
1 ≤
N
≤ 200，1 ≤
K
≤
N
，1 ≤
T
≤ 10,000，1 ≤
U
<
V
≤ 10,000，2 ≤
L
≤ 10,000，0 <
D
1
<
D
2
< ... <
D
N
<
L
を満たす．入力の値はすべて整数である．
Output
最短所要時間 (秒) を 1 行に出力せよ．10
-6
以下の絶対誤差が許容される．
Sample Input 1
1 1 1 2 3 100
50
Sample Output 1
49.500000000
Sample Input 2
3 1 1 2 3 100
49
50
51
Sample Output 2
48.666666667 | [
{
"submission_id": "aoj_2298_7149956",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N, K, T, U, V, L;\n cin >> N >> K >> T >> U >> V >> L;\n vector<int> D(N), G(L + 1, -1), S(L + 1);\n for(int i = 0; i < N; i++){\n cin >> D[i];\n G[D[i]] = i;\n S[D[i]]++;... |
aoj_2293_cpp | D: Dangerous Tower
ICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．
今日の修行は，積み木を丁寧に積み上げることによって，決してミスタイピングをしないほどの手先の器用さを手に入れようというものである．せっかく積み木がたくさんあるので，高い塔を作ろう．
積み木は
N
個あり，
i
番目 (1 ≤
i
≤
N
) の積み木は 1 ×
A
i
×
B
i
の直方体の形をしている．長さ 1 の辺は奥行き方向に用いて，長さ
A
i
,
B
i
の辺を横方向と高さ方向に 1 つずつ割り当てることにした．積み木を積み上げるとき，上の段の積み木は下の段の積み木より横の長さが厳密に短くなければならない．積み木は好きな順番に使うことができ，また，使わない積み木があってもよい．このような制約下で，作ることが可能な最も高い塔を作りたい．
Input
N
A
1
B
1
...
A
N
B
N
1 ≤
N
≤ 1,000，1 ≤
A
i
，
B
i
≤ 1,000,000 を満たす．入力の値はすべて整数である．
Output
塔の高さの最大値を 1 行に出力せよ．
Sample Input 1
3
10 40
10 40
20 30
Sample Output 1
80
Sample Input 2
4
1 2
2 3
3 4
4 1
Sample Output 2
11 | [
{
"submission_id": "aoj_2293_10946082",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int INF = 1e9;\n\nusing pii = pair<int, int>;\n\nstruct edge {\n int to, cap, cost, rev;\n};\n\nusing edges = vector<edge>;\nusing graph = vector<edges>;\n\nvoid add_edge(graph& g, int fro... |
aoj_2291_cpp | B: Brilliant Stars
ICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．
今日の修行は，夜空に輝くたくさんの星たちを観測して，視力と集中力を鍛えようというものである．うさぎは独自のセンスで星の特徴を記録していくことができる．
うさぎは「星の観測日記」として記録した星の特徴をノートにつけていくことにした．ここで，「似ている」 2 つの星をともに記録することは避けたい．2 つの星が「似ている」かどうかは，すべてうさぎの判断で決まっている．「似ている」かどうかの関係はあまり複雑ではなく，以下の条件を満たす．
条件： 異なる 4 つの星 A, B, C, D があり，A と B，B と C，C と D がそれぞれ「似ている」とする．このとき，A と C が「似ている」か，B と D が「似ている」か，あるいはその両方が成り立つ．
うさぎは「似ている」 2 つの星を記録しないようになるべくたくさんの星を記録したい．また，そのようにする方法が何通りあるかも知りたい．
Input
N
M
X
1
Y
1
...
X
M
Y
M
N
は星の個数，
M
は「似ている」 2 つの星の組の個数である．星は 1 以上
N
以下の整数の番号により表され，
X
i
,
Y
i
(1 ≤
i
≤
M
) は星
X
i
と星
Y
i
が「似ている」ことを表す．
1 ≤
N
≤ 100,000，0 ≤
M
≤ 200,000，1 ≤
X
i
<
Y
i
≤
N
を満たす．(
X
i
,
Y
i
) として同一の組は複数回現れない．「似ている」かどうかの関係は，問題文で指定された条件を満たす．
Output
1 行目に，「似ている」 2 つの星を記録しないように記録できる星の個数の最大値を，2 行目に，その最大値を実現できる星の組み合わせの個数 (記録する順番のみを変えたものは同じと考える) を 1,000,000,009 で割った余りを出力せよ．
Sample Input 1
4 3
1 2
1 3
1 4
Sample Output 1
3
1
Sample Input 2
11 5
1 2
3 4
5 6
7 8
9 10
Sample Output 2
6
32
Sample Input 3
9 14
1 2
1 3
2 3
3 4
3 5
3 6
3 7
3 8
3 9
4 5
4 6
5 6
7 8
8 9
Sample Output 3
4
6 | [
{
"submission_id": "aoj_2291_10866253",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1ll << 60;\n#define REP(i, n) for(ll i=0; i <ll(n); i++)\ntemplate <class T> using V = vector<T>;\ntemplate <class A, class B>\nbool chmax(A &a, B b) { return a < b ... |
aoj_2296_cpp | G: Quest of Merchant
ICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．
今日の修行は，街を駆け回り交易を行うことで，商売の力を手にしようというものである．
今後の修行のためにも，できるだけ多くの資金を稼ぎたい．
この世界は，東西南北方向の道路が等間隔に並んでいて，碁盤状になっている．唯一存在する市場の位置を (0, 0)，街には
x
座標，
y
座標が定まっている (座標が整数値の点が交差点に対応する)．うさぎは道路に沿ってのみ移動することができ，隣接する交差点間を移動するのに 1 分を要する．いくつかの交差点には街がある．交易では，街で商品を買い，市場にて販売することによって価格の差の分の利益を得る．
うさぎの初期資金は十分にあり，お金が足りないから商品が購入できない，といったことはない．だが，それぞれの商品には重さがあり，うさぎは重さの合計が
W
までの商品しか同時に持ち運ぶことができない．よって，街に商品を仕入れに行ったり市場に戻ったりを繰り返すことになる．場合によっては，複数の街で商品を購入してから市場に戻ることになるかもしれない．
街での商品の購入や，市場での商品の販売は一瞬で行えるものとする．また，街にある商品が品切れになってしまうことは有り得ず，無限に購入することが可能である．
うさぎは，今回売買を行おうとしている各商品の名前，1 個あたりの重さおよび販売価格と，各街の
x
座標，
y
座標および販売商品の名前と価格を，データにまとめた．うさぎは今，市場がある (0, 0) の位置にいる．プログラムを使って，制限時間
T
分の間にどれだけ稼ぐことが可能か調べたい．
Input
N
M
W
T
S
1
V
1
P
1
...
S
M
V
M
P
M
L
1
X
1
Y
1
R
1,1
Q
1,1
...
R
1,
L
1
Q
1,
L
1
...
L
N
X
N
Y
N
R
N
,1
Q
N
,1
...
R
N
,
L
N
Q
N
,
L
N
N
は街の数，
M
は商品の種類数である．
S
i
,
V
i
,
P
i
(1 ≤
i
≤
M
) はそれぞれ，
i
番目の商品の名前，1 個あたりの重さ，1 個あたりの販売価格である．
街は 1 以上
N
以下の整数で表される．
L
j
,
X
j
,
Y
j
(1 ≤
j
≤
N
) はそれぞれ，街
j
で売られている商品の種類数，街
j
の
x
座標，
y
座標である．
R
j
,
k
,
Q
j
,
k
(1 ≤
j
≤
N
，1 ≤
k
≤
L
j
) はそれぞれ，街
j
で売られている
k
番目の商品の名前，価格である．
1 ≤
N
≤ 7，1 ≤
M
≤ 7，1 ≤
W
≤ 10,000，1 ≤
T
≤ 10,000，1 ≤
V
i
≤
W
，1 ≤
P
i
≤ 10,000，1 ≤
L
j
≤
M
，-10,000 ≤
X
j
≤ 10,000，-10,000 ≤
Y
j
≤ 10,000，1 ≤
Q
j
,
k
≤ 10,000 を満たす．商品の名前はアルファベット小文字からなる長さが 1 以上 7 以下の文字列である．その他の値はすべて整数である．
S
i
はすべて異なる．(
X
j
,
Y
j
) として同一の組は複数回現れず，(
X
j
,
Y
j
) = (0, 0) となることはない．
各
j
に対して
R
j
,
k
はすべて異なり，各
R
j
，
k
はいずれかの
S
i
に一致する．
Output
うさぎが得られる最大の利益を 1 行に出力せよ．
Sample Input 1
2 2 100 20
alfalfa 10 10
carrot 5 10
1 1 6
carrot 4
1 -3 0
alfalfa 5
Sample Output 1
170
Sample Input 2
2 3 100 20
vim 10 10
emacs 5 10
vstudio 65 100
2 1 6
emacs 4
vstudio 13
3 -3 0
vim 5
emacs 9
vstudio 62
Sample Output 2
183 | [
{
"submission_id": "aoj_2296_10366916",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n// #include \"Src/Utility/BinarySearch.hpp\"\n// #include \"Src/Sequence/CompressedSequence.hpp\"\n// #includ... |
aoj_2297_cpp | H: Rectangular Stamps
ICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．
今日の修行は，絵を描くことによって，創造力を高めようというものである．四角いスタンプを用いて，上手く模様を描こう．
大小さまざまなスタンプを使い，4 × 4 のマス目の紙に指定された赤・緑・青の通りの絵を完成させたい．スタンプは長方形であり，マス目にぴったり合わせて使う．スタンプの縦と横を入れ替えることはできない．
紙は最初色が塗られていない状態にある．紙にスタンプを押すと，押された部分がスタンプの色に変わり，下に隠れた色は全く見えなくなる．スタンプの色は付けるインクにより決定されるので，どのスタンプでも，好きな色を選ぶことが可能である．スタンプは紙から一部がはみ出た状態で押すことも可能であり，はみ出た部分は無視される．
1 つのスタンプを複数回使うことは可能である．同じスタンプを別の色に対して使ってもよい．スタンプを押すのはやや神経を使う作業なので，出来るだけスタンプを押す回数を少なくしたい．
Input
N
H
1
W
1
...
H
N
W
N
C
1,1
C
1,2
C
1,3
C
1,4
C
2,1
C
2,2
C
2,3
C
2,4
C
3,1
C
3,2
C
3,3
C
3,4
C
4,1
C
4,2
C
4,3
C
4,4
N
はスタンプの個数，
H
i
,
W
i
(1 ≤
i
≤
N
) はそれぞれ，
i
番目のスタンプの縦の長さ，横の長さを表す整数である．
C
i
,
j
(1 ≤
i
≤ 4，1 ≤
j
≤ 4) は，上から
i
行目，左から
j
列目のマスについて指定された絵の色を表す文字である．赤は
R
，緑は
G
，青は
B
で表される．
1 ≤
N
≤ 16，1 ≤
H
i
≤ 4，1 ≤
W
i
≤ 4 を満たす．(
H
i
,
W
i
) として同一の組は複数回現れない．
Output
絵を完成させるためにスタンプを押さなければならない最小の回数を 1 行に出力せよ．
Sample Input 1
2
4 4
1 1
RRRR
RRGR
RBRR
RRRR
Sample Output 1
3
Sample Input 2
1
2 3
RRGG
BRGG
BRRR
BRRR
Sample Output 2
5 | [
{
"submission_id": "aoj_2297_9995285",
"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 = 9... |
aoj_2299_cpp | J: Tiles are Colorful
ICPC で良い成績を収めるには修行が欠かせない．うさぎは ICPC で勝ちたいので，今日も修行をすることにした．
今日の修行は，流行りのパズルをすばやく解いて，瞬発力を鍛えようというものである．今日挑戦するのは，色とりどりのタイルが並んでいてそれらを上手く消していくパズルだ
初期状態では，グリッド上のいくつかのマスにタイルが置かれている．各タイルには色がついている．プレイヤーはゲーム開始後，以下の手順で示される操作を何回も行うことができる．
タイルが置かれていないマスを 1 つ選択し，そのマスを叩く．
叩いたマスから上に順に辿っていき，タイルが置かれているマスに至ったところでそのタイルに着目する．タイルが置かれているマスがないまま盤面の端に辿り着いたら何にも着目しない．
同様の操作を叩いたマスから下・左・右方向に対して行う．最大 4 枚のタイルが着目されることになる．
着目したタイルの中で同じ色のものがあれば，それらのタイルを盤面から取り除く．同じ色のタイルの組が 2 組あれば，それら両方を取り除く．
タイルを取り除いた枚数と同じ値の得点が入る．
着目をやめる．
たとえば，以下のような状況を考えよう．タイルが置かれていないマスはピリオドで，タイルの色はアルファベット大文字で表されている．
..A.......
.......B..
..........
..B.......
..A.CC....
ここで上から 2 行目，左から 3 列目のマスを叩く操作を考える．着目することになるタイルは
A
,
B
,
B
の 3 枚であるから，
B
の 2 枚が消えて盤面は以下のようになり，2 点を得る．
..A.......
..........
..........
..........
..A.CC....
このパズルはゆっくりしていると時間切れになってしまい，盤面の一部が見えなくなりどのくらい修行が足りなかったのかがわからなくなってしまう．
各色のタイルは 2 枚ずつ置かれているが，それらをすべて消せるとは限らないので，予めプログラムに得点の最大値を計算させておきたい．
Input
M
N
C
1,1
C
1,2
...
C
1,
N
C
2,1
C
2,2
...
C
2,
N
...
C
M
,1
C
M
,2
...
C
M
,
N
整数
M
,
N
は盤が 縦
M
× 横
N
のマス目であることを表す．
C
i
,
j
はアルファベット大文字またはピリオド (
.
) であり，上から
i
行目，左から
j
列目のマスについて，アルファベット大文字の場合は置かれているタイルの色を表し，ピリオドの場合はこのマスにタイルが置かれていないことを表す．
1 ≤
M
≤ 500，1 ≤
N
≤ 500 を満たす．各アルファベット大文字は入力中に 0 個または 2 個現れる．
Output
得点の最大値を 1 行に出力せよ．
Sample Input 1
5 10
..A.......
.......B..
..........
..B.......
..A.CC....
Sample Output 1
4
Sample Input 2
3 3
ABC
D.D
CBA
Sample Output 2
4
Sample Input 3
5 7
NUTUBOR
QT.SZRQ
SANAGIP
LMDGZBM
KLKIODP
Sample Output 3
34 | [
{
"submission_id": "aoj_2299_9394837",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <stack>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <string>\n#include <cctype>\n#include <cmath>\nusing namespace std;\nusing ll = long long;\nconst long long INF = (1LL<<60);\nconst... |
aoj_2300_cpp | Calender Colors
Taro is a member of a programming contest circle.
In this circle, the members manage their schedules in the system called
Great Web Calender
.
Taro has just added some of his friends to his calendar so that he can browse their schedule on his calendar.
Then he noticed that the system currently displays all the schedules in only one color, mixing the schedules for all his friends.
This is difficult to manage because it's hard to tell whose schedule each entry is.
But actually this calender system has the feature to change the color of schedule entries, based on the person who has the entries.
So Taro wants to use that feature to distinguish their plans by color.
Given the colors Taro can use and the number of members,
your task is to calculate the subset of colors to color all schedule entries.
The colors are given by "Lab color space".
In Lab color space,
the distance between two colors is defined by the square sum of the difference of each element.
Taro has to pick up the subset of colors that maximizes the sum of distances of all color pairs in the set.
Input
The input is like the following style.
N
M
L_{0}
a_{0}
b_{0}
L_{1}
a_{1}
b_{1}
...
L_{N-1}
a_{N-1}
b_{N-1}
The first line contains two integers
N
and
M
(
0 \leq M \leq N \leq 20
), where
N
is the number of colors in the input, and
M
is the number of friends Taro wants to select the colors for.
Each of the following
N
lines contains three decimal integers
L
(
0.0 \leq L \leq 100.0
),
a
(
-134.0 \leq a \leq 220.0
) and
b
(
-140.0 \leq b \leq 122.0
) which represents a single color in Lab color space.
Output
Output the maximal of the total distance.
The output should not contain an error greater than
10^{-5}
.
Sample Input 1
3 2
0 0 0
10 10 10
100 100 100
Output for the Sample Input 1
30000.00000000000000000000
Sample Input 2
5 3
12.0 15.0 9.0
10.0 -3.0 2.2
3.5 6.8 9.0
2.1 4.4 5.9
1.2 4.0 -5.4
Output for the Sample Input 2
1003.44000000000005456968
Sample Input 3
2 1
1.0 1.0 1.0
0.0 0.0 0.0
Output for the Sample Input 3
0.00000000000000000000 | [
{
"submission_id": "aoj_2300_11047158",
"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_2301_cpp | Sleeping Time
Miki is a high school student.
She has a part time job, so she cannot take enough sleep on weekdays.
She wants to take good sleep on holidays, but she doesn't know the best length of sleeping time for her.
She is now trying to figure that out with the following algorithm:
Begin with the numbers
K
,
R
and
L
.
She tries to sleep for
H=(R+L)/2
hours.
If she feels the time is longer than or equal to the optimal length, then update
L
with
H
. Otherwise, update
R
with
H
.
After repeating step 2 and 3 for
K
nights, she decides her optimal sleeping time to be
T' = (R+L)/2
.
If her feeling is always correct, the steps described above should give her a very accurate optimal sleeping time.
But unfortunately, she makes mistake in step 3 with the probability
P
.
Assume you know the optimal sleeping time
T
for Miki.
You have to calculate the probability
PP
that the absolute difference of
T'
and
T
is smaller or equal to
E
.
It is guaranteed that the answer remains unaffected by the change of
E
in
10^{-10}
.
Input
The input follows the format shown below
K
R
L
P
E
T
Where the integers
0 \leq K \leq 30
,
0 \leq R \leq L \leq 12
are the parameters for the algorithm described above.
The decimal numbers on the following three lines of the input gives the parameters for the estimation. You can assume
0 \leq P \leq 1
,
0 \leq E \leq 12
,
0 \leq T \leq 12
.
Output
Output
PP
in one line.
The output should not contain an error greater than
10^{-5}
.
Sample Input 1
3 0 2
0.10000000000
0.50000000000
1.00000000000
Output for the Sample Input 1
0.900000
Sample Input 2
3 0 2
0.10000000000
0.37499999977
1.00000000000
Output for the Sample Input 2
0.810000
Sample Input 3
3 0 2
0.10000000000
0.00000100000
0.37500000000
Output for the Sample Input 3
0.729000
Sample Input 4
3 0 2
0.20000000000
0.00000100000
0.37500000000
Output for the Sample Input 4
0.512000 | [
{
"submission_id": "aoj_2301_10958607",
"code_snippet": "#include<bits/stdc++.h>\ntemplate <class T>\ninline bool rd(T &ret) {\n char c; int sgn;\n if(c=getchar(),c==EOF) return 0;\n while(c!='-'&&(c<'0'||c>'9')) c=getchar();\n sgn=(c=='-')?-1:1;\n ret=(c=='-')?0:(c-'0');\n while(c=getchar... |
aoj_2302_cpp | On or Off
Saving electricity is very important!
You are in the office represented as
R \times C
grid that consists of walls and rooms.
It is guaranteed that, for any pair of rooms in the office, there exists exactly one route between the two rooms.
It takes 1 unit of time for you to move to the next room (that is, the grid adjacent to the current room).
Rooms are so dark that you need to switch on a light when you enter a room.
When you leave the room, you can either leave the light on, or
of course you can switch off the light. Each room keeps consuming electric power while the light is on.
Today you have a lot of tasks across the office.
Tasks are given as a list of coordinates, and they need to be done in the specified order.
To save electricity, you want to finish all the tasks with the minimal amount of electric power.
The problem is not so easy though, because you will consume electricity not only when light is on, but also when you switch on/off the light.
Luckily, you know the cost of power consumption per unit time and also the cost to switch on/off the light for all the rooms in the office.
Besides, you are so smart that you don't need any time to do the tasks themselves.
So please figure out the optimal strategy to minimize the amount of electric power consumed.
After you finished all the tasks, please DO NOT leave the light on at any room.
It's obviously wasting!
Input
The first line of the input contains three positive integers
R
(
0 \lt R \leq 50
),
C
(
0 \lt C \leq 50
) and
M
(
2 \leq M \leq 1000
).
The following
R
lines, which contain
C
characters each, describe the layout of the office.
'.' describes a room and '#' describes a wall.
This is followed by three matrices with
R
rows,
C
columns each.
Every elements of the matrices are positive integers.
The
(r, c)
element in the first matrix describes the power consumption per unit of time for the room at the coordinate
(r, c)
.
The
(r, c)
element in the second matrix and the third matrix describe the cost to turn on the light and the cost to turn off the light, respectively, in the room at the coordinate
(r, c)
.
Each of the last
M
lines contains two positive integers, which describe the coodinates of the room for you to do the task.
Note that you cannot do the
i
-th task if any of the
j
-th task (
0 \leq j \leq i
) is left undone.
Output
Print one integer that describes the minimal amount of electric power consumed when you finished all the tasks.
Sample Input 1
1 3 2
...
1 1 1
1 2 1
1 1 1
0 0
0 2
Output for the Sample Input 1
7
Sample Input 2
3 3 5
...
.##
..#
1 1 1
1 0 0
1 1 0
3 3 3
3 0 0
3 3 0
5 4 5
4 0 0
5 4 0
1 0
2 1
0 2
2 0
0 0
Output for the Sample Input 2
77
Sample Input 3
5 5 10
#.###
#....
###.#
..#.#
#....
0 12 0 0 0
0 4 3 2 10
0 0 0 99 0
11 13 0 2 0
0 1 1 2 1
0 4 0 0 0
0 13 8 2 4
0 0 0 16 0
1 1 0 2 0
0 2 3 1 99
0 2 0 0 0
0 12 2 12 2
0 0 0 3 0
4 14 0 16 0
0 2 14 2 90
0 1
3 0
4 4
1 4
1 1
4 4
1 1
4 3
3 0
1 4
Output for the Sample Input 3
777 | [
{
"submission_id": "aoj_2302_10858089",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\n\nconst int dx[]={1,0,0,-1};\nconst int dy[]={0,1,-1,0};\n\nconst int N = 55;\nqueue<in... |
aoj_2306_cpp | Rabbit Party
A rabbit Taro decided to hold a party and invite some friends as guests.
He has
n
rabbit friends, and
m
pairs of rabbits are also friends with each other.
Friendliness of each pair is expressed with a positive integer.
If two rabbits are not friends, their friendliness is assumed to be 0.
When a rabbit is invited to the party, his satisfaction score is defined as the minimal friendliness with any other guests.
The satisfaction of the party itself is defined as the sum of satisfaction score for all the guests.
To maximize satisfaction scores for the party, who should Taro invite?
Write a program to calculate the maximal possible satisfaction score for the party.
Input
The first line of the input contains two integers,
n
and
m
(
1 \leq n \leq 100
,
0 \leq m \leq 100
).
The rabbits are numbered from
1
to
n
.
Each of the following
m
lines has three integers,
u
,
v
and
f
.
u
and
v
(
1 \leq u, v \leq n
,
u \neq v
,
1 \leq f \leq 1,000,000
) stands for the rabbits' number, and
f
stands for their friendliness.
You may assume that the friendliness of a pair of rabbits will be given at most once.
Output
Output the maximal possible satisfaction score of the party in a line.
Sample Input 1
3 3
1 2 3
2 3 1
3 1 2
Output for the Sample Input 1
6
Sample Input 2
2 1
1 2 5
Output for the Sample Input 2
10
Sample Input 3
1 0
Output for the Sample Input 3
0
Sample Input 4
4 5
1 2 4
1 3 3
2 3 7
2 4 5
3 4 6
Output for the Sample Input 4
16 | [
{
"submission_id": "aoj_2306_10690753",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint N, M, ST, gans, ans, hg1, ohg1;\nint jiyou[120][120], val[200], oval[300];\nbool used[1000];\n\nint getans()\n{\n\tint i, res = 0, nc = 0;\n\tf... |
aoj_2303_cpp | Marathon Match
N
people run a marathon.
There are
M
resting places on the way.
For each resting place, the
i
-th runner takes a break with probability
P_i
percent.
When the
i
-th runner takes a break, he gets rest for
T_i
time.
The
i
-th runner runs at constant speed
V_i
, and
the distance of the marathon is
L
.
You are requested to compute the probability for each runner to win the first place.
If a runner arrives at the goal with another person at the same time, they are not considered to win the first place.
Input
A dataset is given in the following format:
N
M
L
P_1
T_1
V_1
P_2
T_2
V_2
...
P_N
T_N
V_N
The first line of a dataset contains three integers
N
(
1 \leq N \leq 100
),
M
(
0 \leq M \leq 50
) and
L
(
1 \leq L \leq 100,000
).
N
is the number of runners.
M
is the number of resting places.
L
is the distance of the marathon.
Each of the following
N
lines contains three integers
P_i
(
0 \leq P_i \leq 100
),
T_i
(
0 \leq T_i \leq 100
) and
V_i
(
0 \leq V_i \leq 100
) describing the
i
-th runner.
P_i
is the probability to take a break.
T_i
is the time of resting.
V_i
is the speed.
Output
For each runner, you should answer the probability of winning.
The
i
-th line in the output should be the probability that the
i
-th runner wins the marathon.
Each number in the output should not contain an error greater than
10^{-5}
.
Sample Input 1
2 2 50
30 50 1
30 50 2
Output for the Sample Input 1
0.28770000
0.71230000
Sample Input 2
2 1 100
100 100 10
0 100 1
Output for the Sample Input 2
0.00000000
1.00000000
Sample Input 3
3 1 100
50 1 1
50 1 1
50 1 1
Output for the Sample Input 3
0.12500000
0.12500000
0.12500000
Sample Input 4
2 2 50
30 0 1
30 50 2
Output for the Sample Input 4
0.51000000
0.49000000 | [
{
"submission_id": "aoj_2303_10853140",
"code_snippet": "#include<bits/stdc++.h>\ntemplate <class T>\ninline bool rd(T &ret) {\n char c; int sgn;\n if(c=getchar(),c==EOF) return 0;\n while(c!='-'&&(c<'0'||c>'9')) c=getchar();\n sgn=(c=='-')?-1:1;\n ret=(c=='-')?0:(c-'0');\n while(c=getchar... |
aoj_2307_cpp | Palindrome Generator
A palidrome craftsperson starts to work in the early morning,
with the clear air allowing him to polish up his palindromes.
On this morning, he is making his pieces to submit to the International Contest for Palindrome Craftspeople.
By the way, in order to make palindromes, he uses a special dictionary which contains a set of words and a set of ordered pairs of the words.
Any words and any ordered pairs of consecutive words in his palindromes must appear in the dictionary.
We already have his dictionary, so let's estimate how long a palindrome he can make.
Input
The first line in the data set consists of two integers
N
(
1 \leq N \leq 100
) and
M
(
0 \leq M \leq 1\,000
).
N
describes the number of words in the dictionary and
M
describes the number of ordered pairs of words.
The following
N
lines describe the words he can use.
The
i
-th line (
1
-based) contains the word
i
, which consists of only lower-case letters and whose length is between
1
and
10
, inclusive.
The following
M
lines describe the ordered pairs of consecutive words he can use.
The
j
-th line (
1
-based) contains two integers
X_j
and
Y_j
(
1 \leq X_j, Y_j \leq N
).
X_j
describes the (
1
-based) index of the former word in the palindrome and
Y_j
describes that of the latter word.
Output
Print the maximal length of the possible palindrome in a line.
If he can make no palidromes, print "0".
If he can make arbitrary long palindromes, print "-1".
Sample Input 1
2 2
ab
ba
1 1
1 2
Output for the Sample Input 1
4
Sample Input 2
2 2
ab
ba
1 1
2 2
Output for the Sample Input 2
0
Sample Input 3
2 2
ab
a
1 1
1 2
Output for the Sample Input 3
-1 | [
{
"submission_id": "aoj_2307_10836481",
"code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <set>\n#include <map>\n#include <cmath>\n#include <sstream>\n#include <iomanip>\n#include <queue>\n#include <ctime>\nusing namespace std;\nte... |
aoj_2311_cpp | 問題文
お菓子の魔女 CHARLOTTE は
巴マミ
とクッキーゲームを楽しんでいる．クッキーゲームは
8\times 8
の格子状に区切られたテーブルクロスの上にチーズクッキーとチョコレートクッキーを置いて行われる．各格子には高々
1
個のチョコレートクッキーまたはチーズクッキーしか置くことはできない．
お菓子の魔女はチーズクッキーを，
巴マミ
はチョコレートクッキーを交互に置いてゲームを行う．自分のクッキーを置いたあと，そのクッキーから上下左右斜めの各
8
方向について，置くクッキーとすでに置いていた自分のクッキーの間に相手のクッキーのみが直線に並んでいた場合に，その挟まれた相手のクッキーのすべてが自分のクッキーで置き換えられる．クッキーゲームのプレイヤーは自分のターンが回ってきた時，
1
つ自分のクッキーを置くことができる．ただし，相手のクッキーを少なくとも
1
つ以上自分のクッキーに置き換えられなければならない．そのような置き場がない場合，自分のターンをパスをしなければならない．
お菓子の魔女も
巴マミ
も考えるのが少々苦手である．そこで，回ってきたターン毎にそのターンの中で置き換えられるクッキーの数を最大化することを考えることにした．
巴マミ
のターンのときに置き換えられるクッキーの数を最大にするようなクッキーを置く場所の候補が複数ある場合は，より上の場所を，それでも複数ある場合はより左の場所を選択することにした．また同様に，お菓子の魔女のターンのときに候補が複数ある場合はより下の場所を，それでも複数ある場合はより右の場所を選択することにした．
テーブルクロスに置かれたクッキーの状態が与えられるので，巴マミからはじめ，彼女たちがそこからクッキーゲームを行い，共に新たなクッキーが置けなくなるまでゲームを続けた時のテーブルクロスの上に置かれたクッキーの状態を求めよ．
入力形式
入力は以下の形式で与えられる．
s_{11} s_{12} ... s_{18}\\
s_{21} s_{22} ... s_{28}\\
...\\
s_{81} s_{82} ... s_{88}\\
s_{ij}
はテーブルクロスに置かれたクッキーの初期状態を表す文字で，上から
i
行目，左から
j
列目の格子の状態を表す．チョコレートクッキーが置かれているとき
s_{ij}
は
'o'
であり，チーズクッキーが置かれているときは
'x'
, 何も置かれていないときは
'.'
となる．
出力形式
クッキーゲームが行われた後のテーブルクロスの上に置かれたクッキーの状態を，入力形式と同じ形式で出力せよ．
制約
s_{ij}
は
'o'
,
'x'
,
'.'
のいずれかである．
入出力例
入力例 1
ooox....
.x......
ooo.....
........
........
........
........
........
出力例1
ooooo...
.o......
ooo.....
...o....
....o...
........
........
........
入力例 2
........
........
........
...ox...
...xo...
........
........
........
出力例 2
xxxxxxxx
xxxooxxx
xxxxooxx
xxxxxxxx
ooxxooox
ooxoooox
oxooooox
ooooooox
入力例 3
........
........
..ooo...
..oxo...
..ooo...
........
........
........
出力例 3
........
........
..ooo...
..ooo...
..ooo...
.....o..
......o.
........
Problem Setter: Flat35 | [
{
"submission_id": "aoj_2311_3524913",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <bitset>\n#include <map>\n#include <tuple>\n#include <unordered_set>\n#include <unordered_map>\n#include <list... |
aoj_2305_cpp | Beautiful Currency
KM country has
N
kinds of coins and each coin has its value
a_i
.
The king of the country, Kita_masa, thought that the current currency system is poor,
and he decided to make it
beautiful
by changing the values of some (possibly no) coins.
A currency system is called beautiful
if each coin has an integer value and the (
i
+1)-th smallest value is divisible by the
i
-th smallest value for all
i
(
1 \leq i \leq N-1
).
For example, the set
{1, 5, 10, 50, 100, 500}
is considered as a beautiful system,
while the set
{1, 5, 10, 25, 50, 100}
is NOT,
because
25
is not divisible by
10
.
Since changing the currency system may confuse citizens,
the king, Kita_masa, wants to minimize the maximum value of the confusion ratios.
Here, the confusion ratio for the change in the
i
-th coin is defined as
|a_i - b_i| / a_i
,
where
a_i
and
b_i
is the value of
i
-th coin before and after the structure changes, respectively.
Note that Kita_masa can change the value of each existing coin,
but he cannot introduce new coins nor eliminate existing coins.
After the modification, the values of two or more coins may coincide.
Input
Each dataset contains two lines.
The first line contains a single integer,
N
,
and the second line contains
N
integers,
{a_i}
.
You may assume the following constraints:
1 \leq N \leq 20
1 \leq a_1 \lt a_2 \lt... \lt a_N \lt 10^5
Output
Output one number that represents the minimum of the maximum value of the confusion ratios.
The value may be printed with an arbitrary number of decimal digits,
but may not contain an absolute error greater than or equal to
10^{-8}
.
Sample Input 1
3
6 11 12
Output for the Sample Input 1
0.090909090909
Sample Input 2
3
6 11 24
Output for the Sample Input 2
0.090909090909
Sample Input 3
3
6 11 30
Output for the Sample Input 3
0.166666666667 | [
{
"submission_id": "aoj_2305_10867796",
"code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\ntypedef long long ll;\nconst double inf = 1e15;\nconst double eps = 1e-8;\nconst int N = 25;\nconst int M = 200005;\nint a[N], n;\ndouble ans, dp[N][... |
aoj_2309_cpp | Vector Compression
You are recording a result of a secret experiment, which consists of a large set of
N
-dimensional vectors.
Since the result may become very large, you are thinking of
compressing it. Fortunately you already have a good compression method
for vectors with small absolute values, all you have to do is to
preprocess the vectors and make them small.
You can record the set of vectors in any order you like.
Let's assume you process them in the order
v_1
,
v_2
,...,
v_M
.
Each vector
v_i
is recorded either
as is
, or as a difference vector.
When it is recorded as a difference,
you can arbitrarily pick up an already chosen vector
v_j (j<i)
and a real value
r
.
Then the actual vector value recorded is
(v_i - r v_j)
.
The values of
r
and
j
do not affect the compression ratio so much, so you don't have to care about them.
Given a set of vectors,
your task is to write a program that calculates the minimum sum of the squared length of the recorded vectors.
Input
The input is like the following style.
N
M
v_{1,1}
v_{1,2}
...
v_{1,N}
...
v_{M,1}
v_{M,2}
...
v_{M,N}
The first line contains two integers
N
and
M
(
1 \leq N, M \leq 100
),
where
N
is the dimension of each vector,
and
M
is the number of the vectors.
Each of the following
M
lines contains
N
floating point values
v_{i,j}
(
-1.0 \leq v_{i,j} \leq 1.0
)
which represents the
j
-th element value of the
i
-th vector.
Output
Output the minimum sum of the squared length of the recorded vectors.
The output should not contain an absolute error greater than
10^{-6}
.
Sample Input 1
2 3
1.0 1.0
-1.0 0.0
0.5 0.5
Output for the Sample Input 1
1.0
Sample Input 2
1 1
1.0
Output for the Sample Input 2
1.0
Sample Input 3
4 3
1.0 1.0 0.0 0.0
-1.0 0.0 -1.0 0.0
0.5 0.5 0.5 0.5
Output for the Sample Input 3
3.0 | [
{
"submission_id": "aoj_2309_9813617",
"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_2310_cpp | 〜魔女からこの世界を守るため
キュゥべえ
と共に戦う 5 人の魔法少女達の物語〜
問題 A
問題文
薔薇園の魔女 GERTRUD は幅
W
メートル，高さ
H
メートルの長方形の庭でバラを育てている．庭は一辺
1
メートルの正方形で区切られており，
W\times H
のブロックに分けられている．各ブロックはバラが育てられているか育てられていないかのどちらかである．
ただ驚くべきことに，この庭で育てられているバラはブロックを越えて絡み合い
1
つの生命体となっている．この生命体は辺を共有しているブロック間を越えて絡み合うことができ，どこかある
1
点を共有していれば同じ生命体となる．
巴マミ
は庭の左下の角から直線に必殺技「ティロ・フィナーレ」で巨大な銃を撃ち，その弾丸が通る直線上でその生命体を分割した時，生命体が出来る限り多くの分割数に分断されるようにすることによりダメージを与えたい．ティロ・フィナーレは最大でこの生物を何分割できるか求めよ．
入力形式
入力は以下の形式で与えられる．
H\ W\\
f_{11} f_{12} ... f_{1W}\\
f_{21} f_{22} ... f_{2W}\\
...\\
f_{H1} f_{H2} ... f_{HW}\\
H
は庭の高さ，
W
は庭の幅を表す．
f_{ij}
は庭の各ブロックを表す文字であり，上から
i
行目，左から
j
列目のブロックの状態を表す．ブロックにバラが育てられている場合は
f_{ij}
は
'#'
となり，そうでない場合は
'.'
となる．
出力形式
生命体を直線で分割する時に，最大でいくつの部分に分割できるかを1行で出力せよ．
制約
1 ≤ H ≤ 600
1 ≤ W ≤ 600
f_{ij}
は
'#'
,
'.'
のいずれかである．
少なくとも
1
つは
f_{ij} =
'#'
となるマス
f_{ij}
が存在する．
2
つのブロックが辺を共有するとき，それらは
隣接している
と呼ぶことにする．任意の
2
つの異なる
'#'
のブロック
f_A, f_B
に対して，
f_A
から隣接している
'#'
のブロックを辿っていって
f_B
に着くことができる．(すなわち，薔薇のブロックは連結である．)
入力中で
1
行目の行，
H
行目の行，
1
列目の列，または
W
列目の列にあるブロックを
盤面の端のブロック
と呼ぶことにする．任意の
'.'
のブロック
f_C
に対して，
f_C
から隣接している
'.'
のブロックを辿っていって，ある
'.'
の盤面の端のブロックに着くことができる．(すなわち，入力に"空洞"のブロックは存在しない．)
入出力例
入力例 1
3 5
##..#
#..##
####.
出力例1
4
このとき以下のように
4
つの部分に分割することができる．
入力例 2
3 3
#.#
###
#.#
出力例 2
3
入力例 3
10 9
.........
.........
####.....
#..#.##..
#..#..#..
#..##.###
#..##...#
##..##.##
###.#..#.
###.####.
出力例 3
6
入力例 4
10 11
###########
#.#.#.#.#.#
#.#.#.#.#.#
#.#.#.#.#.#
#.#.#.#.#.#
#.#.#.#.#.#
#.#.#.#.#.#
#.#.#.#.#.#
#.#.#.#.#.#
#.#.#.#.#.#
出力例 4
7
入力例 5
25 38
...........#...............#..........
...........###..........####..........
...........#####.......####...........
............###############...........
............###############...........
............##############............
.............#############............
............###############...........
...........#################..........
.......#...#################...#......
.......##.##################..##......
........####################.##.......
..........####################........
.........#####..########..#####.......
.......######....#####....######......
......########...#####..########.#....
....#######..#...#####..#..########...
..#########.....#######......#######..
...#######......#######........###....
..####.........#########........###...
...............#########..............
..............##########..............
..............##########..............
...............########...............
...............########...............
出力例 5
8
Problem Setter: Flat35 | [
{
"submission_id": "aoj_2310_10851592",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>&... |
aoj_2308_cpp | White Bird
Angry Birds is a mobile game of a big craze all over the world.
You were convinced that it was a waste of time to play the game, so you decided to create an automatic solver.
You are describing a routine that optimizes the white bird's strategy to defeat a pig (enemy) by hitting an egg bomb.
The white bird follows a parabolic trajectory from the initial position,
and it can vertically drop egg bombs on the way.
In order to make it easy to solve, the following conditions hold for the stages.
N
obstacles are put on the stage.
Each obstacle is a rectangle whose sides are parallel to the coordinate axes.
The pig is put on the point
(X, Y)
.
You can launch the white bird in any direction at an initial velocity
V
from the origin.
If the white bird collides with an obstacle, it becomes unable to drop egg bombs.
If the egg bomb collides with an obstacle, the egg bomb is vanished.
The acceleration of gravity is
9.8 {\rm m/s^2}
.
Gravity exerts a force on the objects in the decreasing direction of
y
-coordinate.
Input
A dataset follows the format shown below:
N
V
X
Y
L_1
B_1
R_1
T_1
...
L_N
B_N
R_N
T_N
All inputs are integer.
N
: the number of obstacles
V
: the initial speed of the white bird
X
,
Y
: the position of the pig
(
0 \leq N \leq 50
,
0 \leq V \leq 50
,
0 \leq X, Y \leq 300
,
X \neq 0
)
for
1 \leq i \leq N,
L_i
: the x-coordinate of the left side of the
i
-th obstacle
B_i
: the y-coordinate of the bottom side of the
i
-th obstacle
R_i
: the x-coordinate of the right side of the
i
-th obstacle
T_i
: the y-coordinate of the top side of the
i
-th obstacle
(
0 \leq L_i, B_i, R_i, T_i \leq 300
)
It is guaranteed that the answer remains unaffected by a change of
L_i
,
B_i
,
R_i
and
T_i
in
10^{-6}
.
Output
Yes/No
You should answer whether the white bird can drop an egg bomb toward the pig.
Sample Input 1
0 7 3 1
Output for the Sample Input 1
Yes
Sample Input 2
1 7 3 1
1 1 2 2
Output for the Sample Input 2
No
Sample Input 3
1 7 2 2
0 1 1 2
Output for the Sample Input 3
No | [
{
"submission_id": "aoj_2308_5846707",
"code_snippet": "/*\tauthor: Kite_kuma\n\tcreated: 2021.09.01 15:05: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(... |
aoj_2315_cpp | 問題文
影の魔女 ELSAMARIA はすべてのものに対して祈りを続ける魔女である．影に捕まったあらゆる命はこの魔女の中に引きずり込まれてしまう．
影は触手のように動き
美樹さやか
を引きずり込もうと狙っている．
美樹さやか
はこの魔女に捕まることなく攻撃するために，魔女にとって予測の難しいでたらめな動きをすることを考えた．具体的には，まず頭の中で
1
から
N
までの整数を一様な確率で
K
個作り，その合計値の距離だけ今の位置から魔女の方向へジャンプする，ということを繰り返すのである．そして魔女の位置に到達した時に攻撃するのである．
さやか
と魔女はある一直線上にいるとし，最初魔女は座標
0
，
さやか
は座標
S
の位置にいるものとする．また魔女は動かないものとする．何度ジャンプした後に魔女に最初の攻撃を与えることができるだろうか．期待値を求めよ．
入力形式
入力は以下の形式で与えられる．
S\ N\ K
S
は最初に
さやか
がいる座標である．
N
は
さやか
が頭の中で作る整数の範囲の上限，
K
は
さやか
が
1
回のジャンプに用いる整数の個数である．
出力形式
さやか
が魔女の位置に到達するために必要なジャンプの回数の期待値を
1
行に出力せよ．もし何度ジャンプしても魔女の位置へ到達できない，もしくは期待値が有限値に収まらない場合は
-1
と出力せよ．
小数点以下何桁でも出力して構わないが，相対誤差あるいは絶対誤差が
10
-6
未満になっていなければならない．
制約
-10
9
≤ S ≤ 10
9
1 ≤ N ≤ 10
1 ≤ K ≤ 10
入力値は全て整数である．
入出力例
入力例 1
6 6 1
出力例1
6.00000000
入力例 2
-100 7 5
出力例 2
43.60343043
入力例 3
756434182 9 10
出力例 3
15128783.80867078
Problem Setter: Flat35 | [
{
"submission_id": "aoj_2315_8371789",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nvector<vector<long double> > matmul(int N, const vector<vector<long double> >& mat1, const vector<vector<long double> >& mat2) {\n\tvector<vector<long double> > res(N, vector<long double>(N));\n\tfor (i... |
aoj_2313_cpp | 問題文
ハコの魔女 H.N.ELLY はとある動画サイトの熱狂的なファンである．ハコの魔女の強さはその時々のその動画サイトからの転送速度に応じて変化するのではないかと
美樹さやか
は考えた．そこで動画サイトからハコの魔女の持つコンピュータまでの過去の転送速度 (=単位時間あたりのデータの転送量) を調べたい．
初期のインターネットのネットワークの構造とそれ以降のネットワークの構造の変化を表すクエリが与えられるので，各変化について変化した直後の動画サイトからハコの魔女の持つコンピュータまでの転送速度を求めよ．
インターネットは複数の転送装置からなるものと見なし，各々をつなぐ回線は双方向に情報を送ることができ，その転送速度の最大は
1
であるとする．また，ネットワークは常に動画サイトからハコの魔女へ送られるデータの転送速度を最大化するように運ぶものとする．
入力形式
入力は以下の形式で与えられる．
N\ E\ Q\\
F_1\ T_1\\
F_2\ T_2\\
…\\
F_E\ T_E\\
M_1\ A_1\ B_1\\
M_2\ A_2\ B_2\\
...\\
M_Q\ A_Q\ B_Q\\
N
は動画サイトとハコの魔女の持つコンピュータを含めた転送装置の数である．番号が
1
である転送装置は動画サイトであり，番号が
N
である転送装置はハコの魔女の持つコンピュータである．
E
は初期状態で接続されている転送装置の組み合わせの数であり，
Q
はインターネットが変化した回数である．初期のインターネットは
F_i
と
T_i
が転送速度
1
で双方向に接続されていることを表す．
ネットワークの変化は時系列順に与えられ，
j
番目の変化は
M_j
が
1
であれば
A_j,\ B_j
間がつながれたことを表し，
M_j
が
2
であれば
A_j,\ B_j
間の接続が切れたことを表す．
出力形式
各変化の直後における，動画サイトからハコの魔女の持つコンピュータまでの転送速度を出力せよ．
制約
2 \leq N \leq 500
0 \leq E \leq 20,000
1 \leq Q \leq 1,000
1 \leq F_i \leq N,\ 1 \leq T_i \leq N,\ F_i \neq T_i \ (1 \leq i \leq E)
すべての
\{F_i, T_i\}
のペアは異なる．
1 \leq M_j \leq 2,\ 1 \leq A_j \leq N\ ,\ 1 \leq B_j \leq N\ ,\ A_j \neq B_j (1 \leq j \leq Q)
ネットワークのどの段階においても次のことが成り立つ : どの
2
つの転送装置の間も高々
1
つの回線でしか繋がれていない．
2
つの転送装置の間が既に繋がれている状態でそれらの間を接続するようなクエリが来たり，
2
つの転送装置の間が回線で繋がれていない状態でそれらの間の接続を切るようなクエリが来ることはない．
入出力例
入力例 1
2 1 2
1 2
2 1 2
1 2 1
出力例1
0
1
最初の変化の後，ハコの魔女のコンピュータと動画サイトは繋がらなくなっているので転送速度は
0
である．
2
度目の変化の後は両者は直接繋がっており，転送速度は
1
になる．
入力例 2
3 0 4
1 2 3
1 2 1
1 3 1
2 2 3
出力例 2
0
1
2
1
入力例 3
6 4 8
1 2
1 3
4 6
5 6
1 2 4
1 3 5
1 2 5
1 3 4
2 2 4
2 3 5
1 2 4
2 2 1
出力例 3
1
2
2
2
2
2
2
1
入力例 4
12 38 6
1 2
1 3
1 4
1 5
2 3
2 4
2 5
2 6
2 7
2 8
2 12
3 4
3 5
3 6
3 7
3 8
4 5
4 6
4 7
4 8
5 6
5 7
5 8
6 7
6 8
6 9
6 10
6 12
7 8
7 9
7 10
8 9
8 10
9 10
9 11
9 12
10 11
11 12
2 6 12
2 9 12
1 9 12
1 6 12
2 6 12
1 6 12
出力例 4
3
2
3
4
3
4
Problem Setter: Flat35 | [
{
"submission_id": "aoj_2313_9805512",
"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_2314_cpp | 問題文
落書きの魔女 ALBERTINE は
W
列
H
行の正方形のセルからなる長方形の結界の入り口に落書きをしている．この世界では落書きは必ずセルを白色か黒色で塗ることによって成り立つ．
すでに使い魔 ANJA の手によって落書きの一部が描かれているのだが，落書きの魔女は残りすべてのセルを塗り落書きを完成させたい．落書きの魔女にはあるこだわりがある．そのこだわりとは次のようなものである．
2
つの異なるセルが辺を共有するとき，
2
つのセルは隣接していると呼ぶことにする．完成された落書きにおいては，任意の
2
つの黒いセルについて，片方からもう片方への隣接した黒いセルをたどるパスがちょうど
1
つだけ存在していなければならない．
どの
2
つの白色のセルも隣接してはならない．
また，落書きの魔女は黒色が好きなので，こだわりを満たした状態でなおかつ最も黒色のセルが多い落書きを完成させたい．果たして落書きの魔女は最大で何個のセルが黒色に塗られたこだわりの落書きを描くことができるだろうか．
入力形式
入力は以下の形式で与えられる．
H\ W\\
c_{11} c_{12} ... c_{1W}\\
c_{21} c_{22} ... c_{2W}\\
...\\
c_{H1} c_{H2} ... c_{HW}\\
H
は結界の入り口の縦幅，
W
は結界の入り口の横幅を表す．
c_{ij}
は各セルの状態を表す文字であり，上から
i
行目，左から
j
列目のセルの状態を表す．セルに黒色が塗られている場合は
c_{ij}
は
'#'
となり，白色が塗られている場合は
'.'
，まだ色が塗られていない場合はそうでない場合は
'?'
となる．
出力形式
魔女のこだわりを満たした状態でとりうる黒色のセルの個数の最大値を
1
行で出力せよ．
もしどのように塗っても魔女のこだわりを満たすように出来ない場合，
-1
と出力せよ．
制約
1 ≤ H ≤ 11
1 ≤ W ≤ 11
c_{ij}
は
'#'
,
'.'
,
'?'
のいずれかである．
入出力例
入力例 1
3 4
.##.
#??#
.#?#
出力例1
8
入力例 2
5 5
##?##
#???#
?????
#???#
##?##
出力例 2
19
入力例 3
9 2
##
..
??
??
??
??
??
??
??
出力例 3
-1
入力例 4
7 9
??#####??
?#?????#?
?#?????#?
?#??#??#?
?#???#?#?
??#####??
???????#?
出力例 4
44
入力例 5
11 11
???????????
???####????
???#???#???
???#???#???
???#???#???
???####????
???#???#???
???#???#???
???#???#???
???####????
???????????
出力例 5
86
Problem Setter: Flat35 | [
{
"submission_id": "aoj_2314_10712143",
"code_snippet": "// AOJ #2314 Scribbling witch\n// 2025.5.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MAX = 11;\n\nint h, w;\nchar B[MAX][MAX+1];\nmap<ll,int> memo[MAX][MAX];\nchar mapto[16];\nint nxt(ll, int, int, char);\n\n... |
aoj_2318_cpp | 問題文
キュゥべえ
はワルプルギスの夜に向けて魔女の合成に明け暮れている．ワルプルギスの夜のために，特別な
グリーフシード
(魔女の卵) を使って手に入れやすい魔女をうまく合成し目的である舞台装置の魔女を創り上げなければならないからである．
キュゥべえ
は手に入れやすい種類の魔女の
グリーフシード
から魔女の素となるものを取り出し，空の特別な
グリーフシード
に入れることで，その
グリーフシード
に魔女を宿らせることができる．また，この世界には，ある組み合わせで複数の魔女を合成すると新たな
1
つの魔女を生み出すことができるという合成法則がいくつかある．そこで，いくつかの特別な
グリーフシード
を使い，それらの中にある魔女の素となるものを合成し，
1
つの特別な
グリーフシード
に新たな魔女を宿らせることができる．また，合成した結果空となった特別な
グリーフシード
は再利用することができる．例えば，
3
個の特別な
グリーフシード
に入った魔女を合成すると，それらの
3
個の
グリーフシード
は，新たな魔女が宿った
1
個の特別な
グリーフシード
と
2
個の空の特別な
グリーフシード
となる．しかし，同じ種類の魔女を同時に複数の
グリーフシード
に入れることは出来ない．
キュゥべえ
は魔女の特別な
グリーフシード
への寄宿と魔女の合成を繰り返すことにより舞台装置の魔女を創りだしたい．舞台装置の魔女を創りだすにはいくつの特別な
グリーフシード
が必要か求めよ．
入力形式
入力は以下のような形式で与えられる．
N\ E\ T\\
W_1\ W_2\ …\ W_N\\
G_1\ C_1\ S_{1,1}\ S_{1,2}\ …\ S_{1,C_1}\\
G_2\ C_2\ S_{2,1}\ S_{2,2}\ …\ S_{2,C_2}\\
…\\
G_E\ C_E\ S_{E,1}\ S_{E,2}\ …\ S_{E,C_E}\\
N
は魔女の種類の個数，
E
は合成法則の個数，
T
は舞台装置の魔女の番号である．
W_i
は
i
番目の魔女が手に入れやすい魔女であるかどうかを表し，
1
ならば手に入れやすい魔女であり，
0
ならば手に入れやすい魔女ではない．
続く
E
行に合成法則が次のように表される：「番号が
S_{i,1}\ S_{i,2}\ …\ S_{i,C_i}
の魔女を合成することによって
G_i
の番号の魔女が得られる．」
出力形式
舞台装置の魔女を創りだすのに最低限必要な特別な
グリーフシード
の個数を出力せよ．創りだすことができない場合は
-1
を出力せよ．
制約
1 \lt N \leq 300
0 \leq E \leq 1000
1 \leq T \leq N
0 \leq W_i \leq 1\ (1 \leq i \leq N)
1 \leq G_i \leq N\ (1 \leq i \leq E)
2 \leq C_i \leq 10\ (1 \leq i \leq E)
1 \leq S_{i,j} \leq N\ (1 \leq i \leq E,\ 1 \leq j \leq C_i)
\{G_i, S_{i,1}\ S_{i,2}\ …\ S_{i,C_i}\}
は全て異なる．
入力中に同一の合成法則が
2
回以上現れることはない．
入出力例
入力例 1
3 1 3
1 1 0
3 2 1 2
出力例1
2
入力例 2
5 0 1
1 1 1 1 1
出力例 2
1
入力例 3
18 5 1
0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1
1 4 2 3 4 5
2 2 6 7
3 3 8 9 10
4 4 11 12 13 14
5 4 15 16 17 18
出力例 3
5
入力例 4
6 4 6
1 1 1 0 0 0
4 2 1 2
5 2 2 3
6 2 4 5
6 3 1 2 4
出力例 4
3
入力例 5
13 9 13
1 1 0 1 1 0 1 1 0 1 1 0 0
3 2 1 2
6 2 4 5
9 2 7 8
12 2 10 11
6 2 2 3
9 2 5 6
12 2 8 9
3 2 11 12
13 4 3 6 9 12
出力例 5
5
入力例 6
4 4 4
1 1 0 0
1 2 2 3
2 2 3 1
3 2 1 2
3 3 1 2 4
出力例 6
-1
Problem Setter: Flat35 | [
{
"submission_id": "aoj_2318_9799752",
"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_2317_cpp | 問題文
委員長の魔女 PATRICIA は，蜘蛛のような糸を吐き結界の中で暮らしている．使い魔の MATHIEU は，委員長の魔女が吐いた糸を引っぱり自在に空を飛んでいる．糸は空間上の線分とみなすことにする．
暁美ほむら
は委員長の魔女に対して攻撃を仕掛けようとし，爆弾と間違えて花火玉を投げ込んでしまった．その結果，それぞれの糸について，魔女から距離
p_1, ..., p_M
の位置にある部分が切れるだけとなってしまった．花火玉を投げる前，それぞれの糸について，糸の
2
つの端点と魔女はこの順番で同一直線上に並んでおり，端点のどちらか一方を使い魔が引っ張っていた．爆発で糸は切れ，使い魔が持っていた部分とそこから一つ置きの部分を残して糸の一部は消えてしまった．
ほむら
は次の戦略を考えるために，残った糸についての情報が知りたいと思っている．残った糸の長さの合計値を求めよ．
入力形式
入力は以下の形式で与えられる．
N\ M\\
s_1\ t_1\\
...\\
s_N\ t_N\\
p_1\\
...\\
p_M\\
N
は空間上の糸の個数，
M
は花火玉によって発生した糸の切断の箇所の個数である．
s_i, t_i
は糸の情報であり，
s_i
は使い間が引っ張っていた側の端点，
t_i
はそうでない側の端点の魔女からの距離である．
p_i
は花火玉によって切断された位置の情報である．
出力形式
花火玉を投げた後，残った糸の長さの合計値を1行に出力せよ．
制約
1 ≤ N ≤ 10
5
1 ≤ M ≤ 10
5
1 ≤ s_i ≤ 10^9
1 ≤ t_i ≤ 10^9
1 ≤ p_i ≤ 10^9
入力値は全て整数である．
s_1, ..., s_N, t_1, ..., t_N, p_1, ..., p_M
は全て相異なる．
入出力例
入力例 1
2 3
1 8
20 5
3
7
15
出力例1
10
爆発の後，
1
つ目のひもは端点の魔女からの距離がそれぞれ
(1,3), (7,8)
の
2
つのひもに，
2
つ目のひもは
(20, 15), (7, 5)
の
2
つのひもに分かれる．結果，残ったひもの長さの合計は
2+1+5+2 = 10
となる．
入力例 2
1 1
100 1
70
出力例 2
30
入力例 3
6 8
1 10
11 23
99 2
56 58
66 78
88 49
5
15
25
35
45
55
65
75
出力例 3
99
Problem Setter: Flat35 | [
{
"submission_id": "aoj_2317_5550696",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1100000000;\nint main(){\n int N, M;\n cin >> N >> M;\n vector<int> s(N), t(N);\n for (int i = 0; i < N; i++){\n cin >> s[i] >> t[i];\n }\n vector<int> p(M);\n for (int i = 0; i ... |
aoj_2319_cpp | 問題文
キュゥべえ
はなかなか契約を結んでくれない
鹿目まどか
にしびれを切らせて，ソウルジェムゲームと称して
佐倉杏子
と
美樹さやか
のソウルジェムの中身 (魂) を
W
列
H
段のロッカーの中に隠してしまった．そこで，
まどか
は
杏子
と
さやか
を助け出したい．しかし，契約を結ばずに助けるにはロッカーボックスの壁を操作して
2
人のソウルジェムの中身を，指定されたロッカーボックスに正しく移さなければならない．ロッカーはロッカーボックスが
W
列
H
段に並ぶことで構成され，隣り合うロッカーボックスは壁で仕切られている．
まどか
は，
1
回の操作でいずれかの隣りあった
2
つのロッカーボックスの壁を取り除くか取り付けることができる．ただし，ロッカーボックスの壁を開けるには制約があり，各ロッカーボックスから隣接する上下左右の壁のうち，高々
2
枚までの壁しか同時に開けておくことはできない．ロッカーボックスには上の段から下の段に向かって重力が働いている．ソウルジェムの中身は液体と同じような動きをし，隣りあった
2
つのロッカーボックスの壁が取り除かれている時，同じ高さであれば互いに同じ量になり，違う高さであれば低い方へ移動する．すべての操作が終わった時に指定された
2
つのロッカーボックスに正しい組み合わせでソウルジェムの中身がすべて入っていれば
まどか
の勝利となる．また，一部のロッカーボックスは穢れており，その中へソウルジェムの中身が入ってしまうと大変なことになってしまうので，そのロッカーボックスはソウルジェムの中身の移動のために使うことはできない．
最小で何度の操作を行えば
まどか
は
2
人を救いだすことができるかを求めよ．
入力形式
入力は以下の形式で与えられる．
H\ W\\
s_{11}\ s_{12}\ … s_{1W}\\
s_{21}\ s_{22}\ … s_{2W}\\
…\\
s_{H1}\ s_{H2}\ … s_{HW}\\
H
はロッカーの段数，
W
はロッカーの列数である．
s_{ij}
は上から
i
段目の左から
j
列目のロッカーボックスの状態を表す．
杏子
のソウルジェムの中身が入っているときは
'K'
であり，
さやか
のソウルジェムの中身が入っているときは
'S'
，
杏子
のソウルジェムの中身を移すべきロッカーボックスであるときは
'k'
，
さやか
のソウルジェムの中身を移すべきロッカーボックスであるときは
's'
，穢れたロッカーボックスであるときは
'#'
，それ以外のロッカーボックスであるときは
'.'
である．
出力形式
2
人を救い出すために必要な操作の最小回数を出力せよ．どのように操作しても救い出すことが出来ない場合は
CONTRACT
と出力せよ．
制約
1 ≤ H ≤ 10
1 ≤ W ≤ 10
s_{ij}
は
'#'
,
'.'
,
'S'
,
'K'
,
's'
,
'k'
のいずれかである．
s_{ij}\ =\
'S'
であるような
i, j
がちょうど 1 つだけ存在する．
s_{ij}\ =\
'K'
であるような
i, j
がちょうど 1 つだけ存在する．
s_{ij}\ =\
's'
であるような
i, j
がちょうど 1 つだけ存在する．
s_{ij}\ =\
'k'
であるような
i, j
がちょうど 1 つだけ存在する．
入出力例
入力例 1
4 4
.S..
K...
....
..sk
出力例1
9
入力例 2
5 5
.S.K.
..#..
.###.
..#..
.k.s.
出力例 2
CONTRACT
入力例 3
8 5
S....
####K
##...
#..##
#..##
##k##
#...#
#.s.#
出力例 3
19
入力例 4
8 5
S....
####K
##...
##.##
##.##
##k##
#...#
#.s.#
出力例 4
CONTRACT
入力例 5
10 10
..........
##......##
#K......S#
..........
..........
.#..##..#.
..##..##..
..........
..........
....s.k...
出力例 5
22
入力例 6
3 3
S.s
K..
..k
出力例 6
CONTRACT
Problem Setter: Flat35 | [
{
"submission_id": "aoj_2319_5955599",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing uint = unsigned int;\nusing ull = unsigned long long;\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 per(i,n) for(int i=int... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.