{"problem_id":"p03446","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n\n#define MOD 1000000007\nLL powmod(LL a, LL n) {\n \/\/ if(a == 0) return 0;\n if (n == 0)\n return 1;\n if (n % 2)\n return (a * powmod(a, n - 1)) % MOD;\n LL c = powmod(a, n \/ 2);\n return (c * c) % MOD;\n}\nLL inv(LL a) { return powmod(a, MOD - 2); }\nLL fact[110000];\nLL invfact[110000];\n\nLL choose[210][210];\n\nLL ncr(LL n, LL r) { return choose[n][r]; }\nvoid init() {\n fact[0] = 1;\n invfact[0] = 1;\n LL inv2 = inv(2);\n for (LL i = 1; i < 110000; i++) {\n fact[i] = (i * fact[i - 1]) % MOD;\n invfact[i] = inv(fact[i]);\n }\n for (LL n = 0; n < 200; n++) {\n for (LL k = 0; k < 200; k++) {\n if (k > n) {\n choose[n][k] = 0;\n } else if (k == 0 || k == n) {\n choose[n][k] = 1;\n } else {\n choose[n][k] = choose[n - 1][k - 1] + choose[n - 1][k];\n choose[n][k] %= MOD;\n }\n }\n }\n}\n\nint main() {\n init();\n\n LL a, b, c, A, B, C;\n cin >> a >> b >> c >> A >> B >> C;\n if (A % a != 0 || B % b != 0 || C % c != 0) {\n cout << 0 << endl;\n return 0;\n }\n A \/= a;\n B \/= b;\n C \/= c;\n if (A == 1)\n a = 1;\n if (B == 1)\n b = 1;\n if (C == 1)\n c = 1;\n LL gridhv[110][110];\n\n LL vnum[110];\n\n LL hnum[110];\n\n for (LL v = B; v >= 0; v--) {\n for (LL w = C; w >= 0; w--) {\n LL n1 = B - v;\n LL n2 = C - w;\n LL mult = (ncr(B, v) * ncr(C, w)) % MOD;\n LL pie = 0;\n for (LL j1 = 0; j1 <= n1; j1++) {\n for (LL j2 = 0; j2 <= n2; j2++) {\n \/\/ restart\n LL cmult = (ncr(n1, j1) * ncr(n2, j2)) % MOD;\n LL add = 0;\n if (n1 - j1 == B && n2 - j2 == C) {\n add = powmod(a, B * C);\n } else if (n1 - j1 == B) {\n add = powmod(a, B * (n2 - j2) + C - (n2 - j2));\n } else if (n2 - j2 == C) {\n add = powmod(a, C * (n1 - j1) + B - (n1 - j1));\n } else {\n add = powmod(a, (n2 - j2) * (n1 - j1) + 1);\n }\n\n add = (add * cmult) % MOD;\n if ((j1 + j2) % 2)\n add *= -1;\n pie += add;\n pie %= MOD;\n }\n }\n pie = (pie * mult) % MOD;\n if (pie < 0)\n pie += MOD;\n\n \/\/ pick grid\n if (v != B) {\n pie = (pie * c) % MOD;\n }\n if (w != C) {\n pie = (pie * b) % MOD;\n }\n \/\/ cout << pie << \" \";\n gridhv[v][w] = pie;\n }\n \/\/ cout << endl;\n }\n \/\/ cout << endl;\n\n for (int z = 0; z < 2; z++) {\n for (LL v = B; v >= 0; v--) {\n LL n = B - v;\n LL mult = ncr(B, v);\n LL pie =\n (powmod(a, v) * powmod(((powmod(a, C) - a) * c) % MOD, B - v)) % MOD;\n LL p2 = (powmod(a, v) * powmod((powmod(a, C) - a), B - v)) % MOD;\n if (v == B) {\n pie = (pie - p2) % MOD;\n } else {\n pie = (pie - p2 * c) % MOD;\n }\n pie = (pie * mult) % MOD;\n if (pie < 0)\n pie += MOD;\n pie = (pie * b) % MOD;\n \/\/ cout << v << \" \" << pie << endl;\n vnum[v] = pie;\n }\n swap(b, c);\n swap(B, C);\n for (int j = 0; j < 110; j++) {\n swap(vnum[j], hnum[j]);\n }\n }\n \/\/ final stage\n\n LL ans = 0;\n for (LL v = B; v >= 0; v--) {\n for (LL w = C; w >= 0; w--) {\n if (v == B && w == C) {\n LL num = (b * powmod(c, B) + c * powmod(b, C) - b * c) % MOD;\n \/\/ cout << \"NUM \" << num << endl;\n num %= MOD;\n ans += gridhv[v][w] * powmod(num, A);\n ans %= MOD;\n } else {\n LL num = (powmod(c, v) + powmod(b, w) - 1) % MOD;\n ans += gridhv[v][w] * powmod(num, A);\n ans %= MOD;\n }\n }\n }\n for (LL v = B; v >= 0; v--) {\n LL num = powmod(c, v);\n ans += vnum[v] * powmod(num, A);\n ans %= MOD;\n }\n for (LL w = C; w >= 0; w--) {\n LL num = powmod(b, w);\n ans += hnum[w] * powmod(num, A);\n ans %= MOD;\n }\n ans %= MOD;\n if (ans < 0)\n ans += MOD;\n cout << ans << endl;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n\n#define MOD 1000000007\nLL powmod(LL a, LL n) {\n \/\/ if(a == 0) return 0;\n if (n == 0)\n return 1;\n if (n % 2)\n return (a * powmod(a, n - 1)) % MOD;\n LL c = powmod(a, n \/ 2);\n return (c * c) % MOD;\n}\nLL inv(LL a) { return powmod(a, MOD - 2); }\nLL fact[110000];\nLL invfact[110000];\n\nLL choose[210][210];\n\nLL ncr(LL n, LL r) { return choose[n][r]; }\n\nLL a, b, c, A, B, C;\n\nLL powa[110000];\n\nvoid init() {\n fact[0] = 1;\n invfact[0] = 1;\n powa[0] = 1;\n LL inv2 = inv(2);\n for (LL i = 1; i < 110000; i++) {\n fact[i] = (i * fact[i - 1]) % MOD;\n invfact[i] = inv(fact[i]);\n powa[i] = (a * powa[i - 1]) % MOD;\n }\n for (LL n = 0; n < 200; n++) {\n for (LL k = 0; k < 200; k++) {\n if (k > n) {\n choose[n][k] = 0;\n } else if (k == 0 || k == n) {\n choose[n][k] = 1;\n } else {\n choose[n][k] = choose[n - 1][k - 1] + choose[n - 1][k];\n choose[n][k] %= MOD;\n }\n }\n }\n}\n\nint main() {\n\n cin >> a >> b >> c >> A >> B >> C;\n if (A % a != 0 || B % b != 0 || C % c != 0) {\n cout << 0 << endl;\n return 0;\n }\n A \/= a;\n B \/= b;\n C \/= c;\n if (A == 1)\n a = 1;\n if (B == 1)\n b = 1;\n if (C == 1)\n c = 1;\n\n init();\n\n LL gridhv[110][110];\n\n LL vnum[110];\n\n LL hnum[110];\n\n for (LL v = B; v >= 0; v--) {\n for (LL w = C; w >= 0; w--) {\n LL n1 = B - v;\n LL n2 = C - w;\n LL mult = (ncr(B, v) * ncr(C, w)) % MOD;\n LL pie = 0;\n for (LL j1 = 0; j1 <= n1; j1++) {\n for (LL j2 = 0; j2 <= n2; j2++) {\n \/\/ restart\n LL cmult = (ncr(n1, j1) * ncr(n2, j2)) % MOD;\n LL add = 0;\n if (n1 - j1 == B && n2 - j2 == C) {\n add = powa[B * C];\n } else if (n1 - j1 == B) {\n add = powa[B * (n2 - j2) + C - (n2 - j2)];\n } else if (n2 - j2 == C) {\n add = powa[C * (n1 - j1) + B - (n1 - j1)];\n } else {\n add = powa[(n2 - j2) * (n1 - j1) + 1];\n }\n\n add = (add * cmult) % MOD;\n if ((j1 + j2) % 2)\n add *= -1;\n pie += add;\n pie %= MOD;\n }\n }\n pie = (pie * mult) % MOD;\n if (pie < 0)\n pie += MOD;\n\n \/\/ pick grid\n if (v != B) {\n pie = (pie * c) % MOD;\n }\n if (w != C) {\n pie = (pie * b) % MOD;\n }\n \/\/ cout << pie << \" \";\n gridhv[v][w] = pie;\n }\n \/\/ cout << endl;\n }\n \/\/ cout << endl;\n\n for (int z = 0; z < 2; z++) {\n for (LL v = B; v >= 0; v--) {\n LL n = B - v;\n LL mult = ncr(B, v);\n LL pie =\n (powmod(a, v) * powmod(((powmod(a, C) - a) * c) % MOD, B - v)) % MOD;\n LL p2 = (powmod(a, v) * powmod((powmod(a, C) - a), B - v)) % MOD;\n if (v == B) {\n pie = (pie - p2) % MOD;\n } else {\n pie = (pie - p2 * c) % MOD;\n }\n pie = (pie * mult) % MOD;\n if (pie < 0)\n pie += MOD;\n pie = (pie * b) % MOD;\n \/\/ cout << v << \" \" << pie << endl;\n vnum[v] = pie;\n }\n swap(b, c);\n swap(B, C);\n for (int j = 0; j < 110; j++) {\n swap(vnum[j], hnum[j]);\n }\n }\n \/\/ final stage\n\n LL ans = 0;\n for (LL v = B; v >= 0; v--) {\n for (LL w = C; w >= 0; w--) {\n if (v == B && w == C) {\n LL num = (b * powmod(c, B) + c * powmod(b, C) - b * c) % MOD;\n \/\/ cout << \"NUM \" << num << endl;\n num %= MOD;\n ans += gridhv[v][w] * powmod(num, A);\n ans %= MOD;\n } else {\n LL num = (powmod(c, v) + powmod(b, w) - 1) % MOD;\n ans += gridhv[v][w] * powmod(num, A);\n ans %= MOD;\n }\n }\n }\n for (LL v = B; v >= 0; v--) {\n LL num = powmod(c, v);\n ans += vnum[v] * powmod(num, A);\n ans %= MOD;\n }\n for (LL w = C; w >= 0; w--) {\n LL num = powmod(b, w);\n ans += hnum[w] * powmod(num, A);\n ans %= MOD;\n }\n ans %= MOD;\n if (ans < 0)\n ans += MOD;\n cout << ans << endl;\n}\n","change":"replace","i1":21,"i2":86,"j1":21,"j2":94,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03512","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <bits\/stdc++.h>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <string>\n#include <vector>\n\/\/ #include <boost\/multiprecision\/cpp_int.hpp>\n#include <functional>\n#define int long long\n#define inf 1000000007\n#define pa pair<int, int>\n#define ll long long\n#define pal pair<double, double>\n#define ppap pair<pa, int>\n#define PI 3.14159265358979323846\n#define paa pair<int, char>\n#define mp make_pair\n#define pb push_back\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nint dx[4] = {0, -1, 0, 1};\nint dy[4] = {1, 0, -1, 0};\nusing namespace std;\nclass pa3 {\npublic:\n int x, y, z;\n pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}\n bool operator<(const pa3 &p) const {\n if (x != p.x)\n return x < p.x;\n if (y != p.y)\n return y < p.y;\n return z < p.z;\n \/\/ return x != p.x ? x<p.x: y<p.y;\n }\n bool operator>(const pa3 &p) const {\n if (x != p.x)\n return x > p.x;\n if (y != p.y)\n return y > p.y;\n return z > p.z;\n \/\/ return x != p.x ? x<p.x: y<p.y;\n }\n bool operator==(const pa3 &p) const {\n return x == p.x && y == p.y && z == p.z;\n }\n bool operator!=(const pa3 &p) const {\n return !(x == p.x && y == p.y && z == p.z);\n }\n};\n\nclass pa4 {\npublic:\n int x;\n int y, z, w;\n pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}\n bool operator<(const pa4 &p) const {\n if (x != p.x)\n return x < p.x;\n if (y != p.y)\n return y < p.y;\n if (z != p.z)\n return z < p.z;\n return w < p.w;\n \/\/ return x != p.x ? x<p.x: y<p.y;\n }\n bool operator>(const pa4 &p) const {\n if (x != p.x)\n return x > p.x;\n if (y != p.y)\n return y > p.y;\n if (z != p.z)\n return z > p.z;\n return w > p.w;\n \/\/ return x != p.x ? x<p.x: y<p.y;\n }\n bool operator==(const pa4 &p) const {\n return x == p.x && y == p.y && z == p.z && w == p.w;\n }\n\n bool operator!=(const pa4 &p) const {\n return !(x == p.x && y == p.y && z == p.z && w == p.w);\n }\n};\nclass pa2 {\npublic:\n int x, y;\n pa2(int x = 0, int y = 0) : x(x), y(y) {}\n pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }\n pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }\n bool operator<(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }\n bool operator>(const pa2 &p) const { return x != p.x ? x > p.x : y > p.y; }\n bool operator==(const pa2 &p) const {\n return abs(x - p.x) == 0 && abs(y - p.y) == 0;\n }\n bool operator!=(const pa2 &p) const {\n return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);\n }\n};\n\n#define ppa pair<int, pas>\nclass Point {\npublic:\n double x, y;\n Point(double x = 0, double y = 0) : x(x), y(y) {}\n Point operator+(Point p) { return Point(x + p.x, y + p.y); }\n Point operator-(Point p) { return Point(x - p.x, y - p.y); }\n Point operator*(double a) { return Point(x * a, y * a); }\n Point operator\/(double a) { return Point(x \/ a, y \/ a); }\n double absv() { return sqrt(norm()); }\n double norm() { return x * x + y * y; }\n bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }\n bool operator==(const Point &p) const {\n return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;\n }\n};\ntypedef Point Vector;\n#define pl pair<int, pas>\nstruct Segment {\n Point p1, p2;\n};\ndouble dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }\ndouble cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }\n\nbool parareru(Point a, Point b, Point c, Point d) {\n \/\/\tif(abs(cross(a-b,d-c))<EPS)cout<<\"dd \"<<cross(a-b,d-c)<<endl;\n return abs(cross(a - b, d - c)) < EPS;\n}\ndouble distance_ls_p(Point a, Point b, Point c) {\n if (dot(b - a, c - a) < EPS)\n return (c - a).absv();\n if (dot(a - b, c - b) < EPS)\n return (c - b).absv();\n return abs(cross(b - a, c - a)) \/ (b - a).absv();\n}\nbool is_intersected_ls(Segment a, Segment b) {\n if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)\n return false;\n if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&\n parareru((a.p2), (a.p1), (a.p1), (b.p1))) {\n \/\/\t\tcout<<\"sss\"<<endl;\n if (dot(a.p1 - b.p1, a.p1 - b.p2) < EPS)\n return true;\n if (dot(a.p2 - b.p1, a.p2 - b.p2) < EPS)\n return true;\n if (dot(a.p1 - b.p1, a.p2 - b.p1) < EPS)\n return true;\n if (dot(a.p1 - b.p2, a.p2 - b.p2) < EPS)\n return true;\n return false;\n } else\n return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <\n EPS) &&\n (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <\n EPS);\n}\n\ndouble segment_dis(Segment a, Segment b) {\n if (is_intersected_ls(a, b))\n return 0;\n double r = distance_ls_p(a.p1, a.p2, b.p1);\n r = min(r, distance_ls_p(a.p1, a.p2, b.p2));\n r = min(r, distance_ls_p(b.p1, b.p2, a.p2));\n r = min(r, distance_ls_p(b.p1, b.p2, a.p1));\n return r;\n}\nPoint intersection_ls(Segment a, Segment b) {\n Point ba = b.p2 - b.p1;\n double d1 = abs(cross(ba, a.p1 - b.p1));\n double d2 = abs(cross(ba, a.p2 - b.p1));\n double t = d1 \/ (d1 + d2);\n\n return a.p1 + (a.p2 - a.p1) * t;\n}\n\nstring itos(int i) {\n ostringstream s;\n s << i;\n return s.str();\n}\n\nint gcd(int v, int b) {\n if (v > b)\n return gcd(b, v);\n if (v == b)\n return b;\n if (b % v == 0)\n return v;\n return gcd(v, b % v);\n}\n\ndouble distans(double x1, double y1, double x2, double y2) {\n double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);\n return sqrt(rr);\n}\nint mod;\nint pr[2010];\nint inv[2010];\n\nint beki(int wa, int rr, int warukazu) {\n if (rr == 0)\n return 1 % warukazu;\n if (rr == 1)\n return wa % warukazu;\n if (rr % 2 == 1)\n return (beki(wa, rr - 1, warukazu) * wa) % warukazu;\n int zx = beki(wa, rr \/ 2, warukazu);\n return (zx * zx) % warukazu;\n}\n\/*\ndouble bekid(double w,int r){\nif(r==0) return 1.0;\nif(r==1) return w;\nif(r%2) return bekid(w,r-1)*w;\ndouble f=bekid(w,r\/2);\nreturn f*f;\n}*\/\n\/*\n int comb(int nn,int rr){\n int r=pr[nn]*inv[rr];\n r%=mod;\n r*=inv[nn-rr];\n r%=mod;\n return r;\n }\n *\/\nvoid gya(int ert) {\n pr[0] = 1;\n for (int i = 1; i < ert; i++) {\n pr[i] = (pr[i - 1] * i) % mod;\n }\n for (int i = 0; i < ert; i++)\n inv[i] = beki(pr[i], mod - 2, mod);\n}\n\n\/\/ cin.tie(0);\n\/\/\tios::sync_with_stdio(false);\n\/\/ priority_queue<pa3,vector<pa3>,greater<pa3>> pq;\n\/\/ sort(ve.begin(),ve.end(),greater<int>());\n\/\/----------------kokomade tenpure------------\nint m[300], x[300];\nint n, ko, ans;\nvector<int> ve;\nvoid dfs(int r, int val) {\n\n if (r == ko) {\n\n int an = 0;\n for (int i = 0; i < n; i++)\n if (val % m[i] == 0)\n an += x[i];\n ans = max(an, ans);\n return;\n }\n\n if (ve[r] <= 17) {\n\n int g = 1;\n while (1) {\n dfs(r + 1, val * g);\n g *= ve[r];\n if (g > 300)\n break;\n }\n return;\n }\n\n int a1 = 0, a2 = 0;\n for (int i = 0; i < n; i++)\n if ((val * ve[r]) % m[i] == 0)\n a1 += x[i];\n for (int i = 0; i < n; i++)\n if ((val) % m[i] == 0)\n a2 += x[i];\n if (a1 > a2)\n dfs(r + 1, val * ve[r]);\n else\n dfs(r + 1, val);\n}\n\nsigned main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> n;\n for (int i = 0; i < n; i++)\n cin >> m[i] >> x[i];\n for (int i = 2; i <= 300; i++) {\n for (int j = 2; j < i; j++)\n if (i % j == 0) {\n goto lll;\n }\n ve.pb(i);\n lll:;\n }\n ko = ve.size();\n ans = 0;\n dfs(0, 1);\n\n cout << ans << endl;\n return 0;\n}","fail":"#include <algorithm>\n#include <bits\/stdc++.h>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <string>\n#include <vector>\n\/\/ #include <boost\/multiprecision\/cpp_int.hpp>\n#include <functional>\n#define int long long\n#define inf 1000000007\n#define pa pair<int, int>\n#define ll long long\n#define pal pair<double, double>\n#define ppap pair<pa, int>\n#define PI 3.14159265358979323846\n#define paa pair<int, char>\n#define mp make_pair\n#define pb push_back\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nint dx[4] = {0, -1, 0, 1};\nint dy[4] = {1, 0, -1, 0};\nusing namespace std;\nclass pa3 {\npublic:\n int x, y, z;\n pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}\n bool operator<(const pa3 &p) const {\n if (x != p.x)\n return x < p.x;\n if (y != p.y)\n return y < p.y;\n return z < p.z;\n \/\/ return x != p.x ? x<p.x: y<p.y;\n }\n bool operator>(const pa3 &p) const {\n if (x != p.x)\n return x > p.x;\n if (y != p.y)\n return y > p.y;\n return z > p.z;\n \/\/ return x != p.x ? x<p.x: y<p.y;\n }\n bool operator==(const pa3 &p) const {\n return x == p.x && y == p.y && z == p.z;\n }\n bool operator!=(const pa3 &p) const {\n return !(x == p.x && y == p.y && z == p.z);\n }\n};\n\nclass pa4 {\npublic:\n int x;\n int y, z, w;\n pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}\n bool operator<(const pa4 &p) const {\n if (x != p.x)\n return x < p.x;\n if (y != p.y)\n return y < p.y;\n if (z != p.z)\n return z < p.z;\n return w < p.w;\n \/\/ return x != p.x ? x<p.x: y<p.y;\n }\n bool operator>(const pa4 &p) const {\n if (x != p.x)\n return x > p.x;\n if (y != p.y)\n return y > p.y;\n if (z != p.z)\n return z > p.z;\n return w > p.w;\n \/\/ return x != p.x ? x<p.x: y<p.y;\n }\n bool operator==(const pa4 &p) const {\n return x == p.x && y == p.y && z == p.z && w == p.w;\n }\n\n bool operator!=(const pa4 &p) const {\n return !(x == p.x && y == p.y && z == p.z && w == p.w);\n }\n};\nclass pa2 {\npublic:\n int x, y;\n pa2(int x = 0, int y = 0) : x(x), y(y) {}\n pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }\n pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }\n bool operator<(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }\n bool operator>(const pa2 &p) const { return x != p.x ? x > p.x : y > p.y; }\n bool operator==(const pa2 &p) const {\n return abs(x - p.x) == 0 && abs(y - p.y) == 0;\n }\n bool operator!=(const pa2 &p) const {\n return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);\n }\n};\n\n#define ppa pair<int, pas>\nclass Point {\npublic:\n double x, y;\n Point(double x = 0, double y = 0) : x(x), y(y) {}\n Point operator+(Point p) { return Point(x + p.x, y + p.y); }\n Point operator-(Point p) { return Point(x - p.x, y - p.y); }\n Point operator*(double a) { return Point(x * a, y * a); }\n Point operator\/(double a) { return Point(x \/ a, y \/ a); }\n double absv() { return sqrt(norm()); }\n double norm() { return x * x + y * y; }\n bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }\n bool operator==(const Point &p) const {\n return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;\n }\n};\ntypedef Point Vector;\n#define pl pair<int, pas>\nstruct Segment {\n Point p1, p2;\n};\ndouble dot(Vector a, Vector b) { return a.x * b.x + a.y * b.y; }\ndouble cross(Vector a, Vector b) { return a.x * b.y - a.y * b.x; }\n\nbool parareru(Point a, Point b, Point c, Point d) {\n \/\/\tif(abs(cross(a-b,d-c))<EPS)cout<<\"dd \"<<cross(a-b,d-c)<<endl;\n return abs(cross(a - b, d - c)) < EPS;\n}\ndouble distance_ls_p(Point a, Point b, Point c) {\n if (dot(b - a, c - a) < EPS)\n return (c - a).absv();\n if (dot(a - b, c - b) < EPS)\n return (c - b).absv();\n return abs(cross(b - a, c - a)) \/ (b - a).absv();\n}\nbool is_intersected_ls(Segment a, Segment b) {\n if (a.p1 == b.p1 || a.p2 == b.p1 || a.p1 == b.p2 || a.p2 == b.p2)\n return false;\n if (parareru((a.p2), (a.p1), (a.p1), (b.p2)) &&\n parareru((a.p2), (a.p1), (a.p1), (b.p1))) {\n \/\/\t\tcout<<\"sss\"<<endl;\n if (dot(a.p1 - b.p1, a.p1 - b.p2) < EPS)\n return true;\n if (dot(a.p2 - b.p1, a.p2 - b.p2) < EPS)\n return true;\n if (dot(a.p1 - b.p1, a.p2 - b.p1) < EPS)\n return true;\n if (dot(a.p1 - b.p2, a.p2 - b.p2) < EPS)\n return true;\n return false;\n } else\n return (cross(a.p2 - a.p1, b.p1 - a.p1) * cross(a.p2 - a.p1, b.p2 - a.p1) <\n EPS) &&\n (cross(b.p2 - b.p1, a.p1 - b.p1) * cross(b.p2 - b.p1, a.p2 - b.p1) <\n EPS);\n}\n\ndouble segment_dis(Segment a, Segment b) {\n if (is_intersected_ls(a, b))\n return 0;\n double r = distance_ls_p(a.p1, a.p2, b.p1);\n r = min(r, distance_ls_p(a.p1, a.p2, b.p2));\n r = min(r, distance_ls_p(b.p1, b.p2, a.p2));\n r = min(r, distance_ls_p(b.p1, b.p2, a.p1));\n return r;\n}\nPoint intersection_ls(Segment a, Segment b) {\n Point ba = b.p2 - b.p1;\n double d1 = abs(cross(ba, a.p1 - b.p1));\n double d2 = abs(cross(ba, a.p2 - b.p1));\n double t = d1 \/ (d1 + d2);\n\n return a.p1 + (a.p2 - a.p1) * t;\n}\n\nstring itos(int i) {\n ostringstream s;\n s << i;\n return s.str();\n}\n\nint gcd(int v, int b) {\n if (v > b)\n return gcd(b, v);\n if (v == b)\n return b;\n if (b % v == 0)\n return v;\n return gcd(v, b % v);\n}\n\ndouble distans(double x1, double y1, double x2, double y2) {\n double rr = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);\n return sqrt(rr);\n}\nint mod;\nint pr[2010];\nint inv[2010];\n\nint beki(int wa, int rr, int warukazu) {\n if (rr == 0)\n return 1 % warukazu;\n if (rr == 1)\n return wa % warukazu;\n if (rr % 2 == 1)\n return (beki(wa, rr - 1, warukazu) * wa) % warukazu;\n int zx = beki(wa, rr \/ 2, warukazu);\n return (zx * zx) % warukazu;\n}\n\/*\ndouble bekid(double w,int r){\nif(r==0) return 1.0;\nif(r==1) return w;\nif(r%2) return bekid(w,r-1)*w;\ndouble f=bekid(w,r\/2);\nreturn f*f;\n}*\/\n\/*\n int comb(int nn,int rr){\n int r=pr[nn]*inv[rr];\n r%=mod;\n r*=inv[nn-rr];\n r%=mod;\n return r;\n }\n *\/\nvoid gya(int ert) {\n pr[0] = 1;\n for (int i = 1; i < ert; i++) {\n pr[i] = (pr[i - 1] * i) % mod;\n }\n for (int i = 0; i < ert; i++)\n inv[i] = beki(pr[i], mod - 2, mod);\n}\n\n\/\/ cin.tie(0);\n\/\/\tios::sync_with_stdio(false);\n\/\/ priority_queue<pa3,vector<pa3>,greater<pa3>> pq;\n\/\/ sort(ve.begin(),ve.end(),greater<int>());\n\/\/----------------kokomade tenpure------------\nint m[300], x[301];\nint n, ko, ans;\nvector<int> ve;\nvoid dfs(int r, int val, int a = 0) {\n\n if (r == ko) {\n\n int an = a;\n for (int i = 1; i < 301; i++)\n if (val % i == 0)\n an += x[i];\n ans = max(an, ans);\n \/\/\tcout<<val<<endl;\n return;\n }\n\n if (ve[r] <= 17) {\n \/\/\tif(ve[r]==17) cout<<val<<endl;\n int g = 1;\n while (1) {\n dfs(r + 1, val * g);\n g *= ve[r];\n if (g > 300)\n break;\n }\n return;\n }\n\n int a1 = 0, a2 = 0;\n for (int i = ve[r]; i <= 300; i += ve[r])\n if ((val * ve[r]) % i == 0)\n a1 += x[i];\n \/\/\tfor(int i=0;i<n;i++)if((val)%m[i]==0)a2+=x[i];\n if (a1 > a2)\n dfs(r + 1, val, a + a1);\n else\n dfs(r + 1, val, a);\n}\n\nsigned main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cin >> n;\n for (int i = 0; i < n; i++) {\n int mm, xx;\n cin >> mm >> xx;\n x[mm] = xx;\n }\n \/\/\tfor(int i=2;i<=300;i++)x[i]=100;\n for (int i = 2; i <= 300; i++) {\n for (int j = 2; j < i; j++)\n if (i % j == 0) {\n goto lll;\n }\n ve.pb(i);\n lll:;\n }\n ko = ve.size();\n ans = 0;\n dfs(0, 1);\n\n cout << ans << endl;\n return 0;\n}","change":"replace","i1":244,"i2":290,"j1":244,"j2":293,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03512","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n\n#define VARNAME(x) #x\n#define show(x) cerr << #x << \" = \" << x << endl\n\nusing namespace std;\nusing ll = long long;\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << \"sz:\" << v.size() << \"\\\\n[\";\n for (const auto &p : v) {\n os << p << \",\";\n }\n os << \"]\\\\n\";\n return os;\n}\n\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) {\n for (auto &e : v) {\n is >> e;\n }\n return is;\n}\n\ntemplate <typename S, typename T>\nostream &operator<<(ostream &os, const pair<S, T> &p) {\n os << \"(\" << p.first << \",\" << p.second << \")\";\n return os;\n}\n\nconstexpr ll MOD = (ll)1e9 + 7LL;\n\ntemplate <typename T> constexpr T INF = numeric_limits<T>::max() \/ 10;\n\nusing V7 = vector<vector<vector<vector<vector<vector<vector<ll>>>>>>>;\nusing V6 = vector<vector<vector<vector<vector<vector<ll>>>>>>;\nusing V5 = vector<vector<vector<vector<vector<ll>>>>>;\nusing V4 = vector<vector<vector<vector<ll>>>>;\nusing V3 = vector<vector<vector<ll>>>;\nusing V2 = vector<vector<ll>>;\nusing V1 = vector<ll>;\n\nstruct Data {\n vector<int> ind;\n ll x;\n};\n\nconstexpr int MAX = 300;\nconstexpr int SQRT = 18;\nconstexpr int LP = 7;\nconstexpr int prime[LP] = {2, 3, 5, 7, 11, 13, 17};\nconstexpr int maxind[LP] = {9, 6, 4, 3, 3, 3, 3};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int pnum = 0;\n auto isprime = [](const int n) {\n for (int i = 2; i * i <= n; i++) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n };\n map<int, int> mp;\n mp[1] = 0;\n for (int i = SQRT; i <= MAX; i++) {\n if (isprime(i)) {\n pnum++;\n mp[i] = pnum;\n }\n }\n\n vector<V7> value(\n pnum + 1, V7(maxind[0],\n V6(maxind[1],\n V5(maxind[2],\n V4(maxind[3],\n V3(maxind[4], V2(maxind[5], V1(maxind[6], 0))))))));\n for (int i = 0; i <= pnum; i++) {\n value[i][0][0][0][0][0][0][0] = 0;\n }\n\n int Q;\n cin >> Q;\n vector<vector<Data>> data(pnum + 1);\n for (int i = 0; i < Q; i++) {\n int m, x;\n cin >> m >> x;\n vector<int> num(LP, 0);\n for (int j = 0; j < LP; j++) {\n while (m % prime[j] == 0) {\n num[j]++;\n m \/= prime[j];\n }\n }\n data[m].push_back(Data{num, x});\n }\n\n auto div = [](const int n0, const int n1, const int n2, const int n3,\n const int n4, const int n5, const int n6,\n const vector<int> &ind) {\n return n0 >= ind[0] and n1 >= ind[1] and n2 >= ind[2] and n3 >= ind[3] and\n n4 >= ind[4] and n5 >= ind[5] and n6 >= ind[6];\n };\n ll maximum = 0;\n for (int i = 0; i <= pnum; i++) {\n for (int n0 = 0; n0 < maxind[0]; n0++) {\n for (int n1 = 0; n1 < maxind[1]; n1++) {\n for (int n2 = 0; n2 < maxind[2]; n2++) {\n for (int n3 = 0; n3 < maxind[3]; n3++) {\n for (int n4 = 0; n4 < maxind[4]; n4++) {\n for (int n5 = 0; n5 < maxind[5]; n5++) {\n for (int n6 = 0; n6 < maxind[6]; n6++) {\n for (const auto &d : data[i]) {\n const auto &ind = d.ind;\n if (div(n0, n1, n2, n3, n4, n5, n6, ind)) {\n value[i][n0][n1][n2][n3][n4][n5][n6] += d.x;\n }\n }\n if (i == 0) {\n maximum =\n max(maximum, value[0][n0][n1][n2][n3][n4][n5][n6]);\n } else {\n maximum =\n max(maximum, value[i][n0][n1][n2][n3][n4][n5][n6] +\n value[0][n0][n1][n2][n3][n4][n5][n6]);\n }\n }\n }\n }\n }\n }\n }\n }\n }\n cout << maximum << endl;\n\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n\n#define VARNAME(x) #x\n#define show(x) cerr << #x << \" = \" << x << endl\n\nusing namespace std;\nusing ll = long long;\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << \"sz:\" << v.size() << \"\\\\n[\";\n for (const auto &p : v) {\n os << p << \",\";\n }\n os << \"]\\\\n\";\n return os;\n}\n\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) {\n for (auto &e : v) {\n is >> e;\n }\n return is;\n}\n\ntemplate <typename S, typename T>\nostream &operator<<(ostream &os, const pair<S, T> &p) {\n os << \"(\" << p.first << \",\" << p.second << \")\";\n return os;\n}\n\nconstexpr ll MOD = (ll)1e9 + 7LL;\n\ntemplate <typename T> constexpr T INF = numeric_limits<T>::max() \/ 10;\n\nusing V7 = vector<vector<vector<vector<vector<vector<vector<ll>>>>>>>;\nusing V6 = vector<vector<vector<vector<vector<vector<ll>>>>>>;\nusing V5 = vector<vector<vector<vector<vector<ll>>>>>;\nusing V4 = vector<vector<vector<vector<ll>>>>;\nusing V3 = vector<vector<vector<ll>>>;\nusing V2 = vector<vector<ll>>;\nusing V1 = vector<ll>;\n\nstruct Data {\n vector<int> ind;\n ll x;\n};\n\nconstexpr int MAX = 300;\nconstexpr int SQRT = 18;\nconstexpr int LP = 7;\nconstexpr int prime[LP] = {2, 3, 5, 7, 11, 13, 17};\nconstexpr int maxind[LP] = {9, 6, 4, 3, 3, 3, 3};\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int pnum = 0;\n auto isprime = [](const int n) {\n for (int i = 2; i * i <= n; i++) {\n if (n % i == 0) {\n return false;\n }\n }\n return true;\n };\n map<int, int> mp;\n mp[1] = 0;\n for (int i = SQRT; i <= MAX; i++) {\n if (isprime(i)) {\n pnum++;\n mp[i] = pnum;\n }\n }\n\n vector<V7> value(\n pnum + 1, V7(maxind[0],\n V6(maxind[1],\n V5(maxind[2],\n V4(maxind[3],\n V3(maxind[4], V2(maxind[5], V1(maxind[6], 0))))))));\n\n int Q;\n cin >> Q;\n vector<vector<Data>> data(pnum + 1);\n for (int i = 0; i < Q; i++) {\n ll m, x;\n cin >> m >> x;\n vector<int> num(LP, 0);\n for (int j = 0; j < LP; j++) {\n while (m % prime[j] == 0) {\n num[j]++;\n m \/= prime[j];\n }\n }\n data[mp[m]].push_back(Data{num, x});\n }\n\n auto div = [](const int n0, const int n1, const int n2, const int n3,\n const int n4, const int n5, const int n6,\n const vector<int> &ind) {\n return n0 >= ind[0] and n1 >= ind[1] and n2 >= ind[2] and n3 >= ind[3] and\n n4 >= ind[4] and n5 >= ind[5] and n6 >= ind[6];\n };\n for (int i = 0; i <= pnum; i++) {\n for (int n0 = 0; n0 < maxind[0]; n0++) {\n for (int n1 = 0; n1 < maxind[1]; n1++) {\n for (int n2 = 0; n2 < maxind[2]; n2++) {\n for (int n3 = 0; n3 < maxind[3]; n3++) {\n for (int n4 = 0; n4 < maxind[4]; n4++) {\n for (int n5 = 0; n5 < maxind[5]; n5++) {\n for (int n6 = 0; n6 < maxind[6]; n6++) {\n for (const auto &d : data[i]) {\n const auto &ind = d.ind;\n if (div(n0, n1, n2, n3, n4, n5, n6, ind)) {\n value[i][n0][n1][n2][n3][n4][n5][n6] += d.x;\n }\n }\n }\n }\n }\n }\n }\n }\n }\n }\n\n ll maximum = 0;\n for (int n0 = 0; n0 < maxind[0]; n0++) {\n for (int n1 = 0; n1 < maxind[1]; n1++) {\n for (int n2 = 0; n2 < maxind[2]; n2++) {\n for (int n3 = 0; n3 < maxind[3]; n3++) {\n for (int n4 = 0; n4 < maxind[4]; n4++) {\n for (int n5 = 0; n5 < maxind[5]; n5++) {\n for (int n6 = 0; n6 < maxind[6]; n6++) {\n ll sum = value[0][n0][n1][n2][n3][n4][n5][n6];\n for (int i = 1; i <= pnum; i++) {\n sum += max(0LL, value[i][n0][n1][n2][n3][n4][n5][n6]);\n }\n maximum = max(maximum, sum);\n }\n }\n }\n }\n }\n }\n }\n cout << maximum << endl;\n\n return 0;\n}\n","change":"replace","i1":81,"i2":131,"j1":81,"j2":140,"error":"0","stderr":null,"stdout":10.0}
{"problem_id":"p03512","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int64 INF = 1LL << 59;\n\nunordered_map<int64, int> prime_factor(int64 n) {\n unordered_map<int64, int> ret;\n for (int64 i = 2; i * i <= n; i++) {\n while (n % i == 0) {\n ret[i]++;\n n \/= i;\n }\n }\n if (n != 1)\n ret[n] = 1;\n return (ret);\n}\n\nint Q;\npair<unordered_map<int64, int>, int> vv[300];\n\nint64 rec(vector<pair<int, int>> &conv, vector<int> &candidate, int idx,\n bool flag) {\n int64 ret = 0;\n\n if (candidate.empty()) {\n return (ret);\n }\n\n if (flag) {\n for (auto &j : candidate)\n ret += vv[j].second;\n }\n\n if (idx < conv.size()) {\n\n if (conv[idx].first >= 19 && flag) {\n\n vector<int> used(Q, 0);\n int64 calc = 0;\n for (int i = idx; i < conv.size(); i++) {\n int64 beet = 0;\n for (auto &j : candidate) {\n if (vv[j].first.count(conv[i].first)) {\n beet += vv[j].second;\n used[j] = true;\n }\n }\n calc += max(0LL, beet);\n }\n for (auto &j : candidate) {\n if (!used[j])\n calc += vv[j].second;\n }\n ret = max(ret, calc);\n\n } else {\n set<vector<int>> used;\n for (int i = 0; i <= conv[idx].second + 1; i++) {\n vector<int> nt;\n for (int j : candidate) {\n if (vv[j].first.count(conv[idx].first)) {\n if (vv[j].first[conv[idx].first] > i)\n continue;\n }\n nt.emplace_back(j);\n }\n if (used.count(nt))\n continue;\n used.emplace(nt);\n ret = max(ret, rec(conv, nt, idx + 1, flag | (i > 0)));\n }\n }\n }\n return (ret);\n}\n\nint main() {\n cin >> Q;\n map<int, int> mx;\n for (int i = 0; i < Q; i++) {\n int m, x;\n cin >> m >> x;\n auto latte = prime_factor(m);\n for (auto &p : latte) {\n mx[p.first] = max(mx[p.first], p.second);\n }\n vv[i] = {latte, x};\n }\n vector<pair<int, int>> convert(begin(mx), end(mx));\n vector<int> candidate(Q);\n iota(begin(candidate), end(candidate), 0);\n cout << rec(convert, candidate, 0, false) << endl;\n}","fail":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int64 INF = 1LL << 59;\n\nunordered_map<int64, int> prime_factor(int64 n) {\n unordered_map<int64, int> ret;\n for (int64 i = 2; i * i <= n; i++) {\n while (n % i == 0) {\n ret[i]++;\n n \/= i;\n }\n }\n if (n != 1)\n ret[n] = 1;\n return (ret);\n}\n\nint Q;\npair<unordered_map<int64, int>, int> vv[300];\n\nint64 rec(vector<pair<int, int>> &conv, vector<int> &candidate, int idx,\n bool flag) {\n int64 ret = 0;\n\n if (candidate.empty()) {\n return (ret);\n }\n\n if (flag) {\n for (auto &j : candidate)\n ret += vv[j].second;\n }\n\n if (idx < conv.size()) {\n\n if (conv[idx].first >= 17 && flag) {\n\n vector<int> used(Q, 0);\n int64 calc = 0;\n for (int i = idx; i < conv.size(); i++) {\n int64 beet = 0;\n if (conv[idx].first == 17) {\n int64 beet2 = 0;\n for (auto &j : candidate) {\n if (vv[j].first.count(conv[i].first)) {\n if (vv[j].first[conv[i].first] == 2)\n beet += vv[j].second;\n else\n beet2 += vv[j].second, beet += vv[j].second;\n used[j] = true;\n }\n }\n calc += max(0LL, max(beet, beet2));\n continue;\n }\n\n for (auto &j : candidate) {\n if (vv[j].first.count(conv[i].first)) {\n beet += vv[j].second;\n used[j] = true;\n }\n }\n calc += max(0LL, beet);\n }\n for (auto &j : candidate) {\n if (!used[j])\n calc += vv[j].second;\n }\n ret = max(ret, calc);\n\n } else {\n set<vector<int>> used;\n for (int i = 0; i <= conv[idx].second + 1; i++) {\n vector<int> nt;\n for (int j : candidate) {\n if (vv[j].first.count(conv[idx].first)) {\n if (vv[j].first[conv[idx].first] > i)\n continue;\n }\n nt.emplace_back(j);\n }\n if (used.count(nt))\n continue;\n used.emplace(nt);\n ret = max(ret, rec(conv, nt, idx + 1, flag | (i > 0)));\n }\n }\n }\n return (ret);\n}\n\nint main() {\n cin >> Q;\n map<int, int> mx;\n for (int i = 0; i < Q; i++) {\n int m, x;\n cin >> m >> x;\n auto latte = prime_factor(m);\n for (auto &p : latte) {\n mx[p.first] = max(mx[p.first], p.second);\n }\n vv[i] = {latte, x};\n }\n vector<pair<int, int>> convert(begin(mx), end(mx));\n vector<int> candidate(Q);\n iota(begin(candidate), end(candidate), 0);\n cout << rec(convert, candidate, 0, false) << endl;\n}","change":"replace","i1":38,"i2":44,"j1":38,"j2":59,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03513","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nlong long N, M, dpa[1 << 18], dpb[1 << 18], power[200], powerinv[200],\n power3[200], mod = 1000000007;\nbool used[16][16];\nint V3[16];\n\nvector<long long> solve(int pos) {\n vector<long long> dp((1 << N), 0);\n for (int i = 0; i < (1 << N); i++) {\n int bit[15];\n for (int j = 0; j < N; j++)\n bit[j] = (i \/ (1 << j)) % 2;\n if (bit[pos] == 0)\n continue;\n\n int cnt = 0;\n for (int j = 0; j < N; j++) {\n for (int k = j + 1; k < N; k++) {\n if (bit[j] == 1 && bit[k] == 1 && used[j][k] == true)\n cnt++;\n }\n }\n long long res = power[cnt];\n vector<int> V1;\n for (int j = 0; j < N; j++) {\n if (bit[j] == 1)\n V1.push_back(j);\n }\n\n for (int j = 0; j < (1 << V1.size()); j++) {\n int R = 0, T = 0;\n for (int k = 0; k < V1.size(); k++) {\n if ((j & (1 << k)) != 0)\n R += (1 << V1[k]);\n else {\n V3[T] = V1[k];\n T++;\n }\n }\n long long Y = dp[R];\n if (Y == 0)\n continue;\n for (int k = 0; k < T; k++) {\n for (int l = k + 1; l < T; l++) {\n if (used[V3[k]][V3[l]] == true) {\n Y *= 2;\n if (Y >= mod)\n Y -= mod;\n }\n }\n }\n res -= Y;\n if (res < 0)\n res += mod;\n }\n dp[i] = res;\n }\n return dp;\n}\n\nint main() {\n power[0] = 1;\n for (int i = 1; i < 200; i++)\n power[i] = (2LL * power[i - 1]) % mod;\n powerinv[0] = 1;\n for (int i = 1; i < 200; i++)\n powerinv[i] = (500000004LL * powerinv[i - 1]) % mod;\n power3[0] = 1;\n for (int i = 1; i < 200; i++)\n power3[i] = (3LL * power3[i - 1]) % mod;\n\n cin >> N >> M;\n for (int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n used[a][b] = true;\n used[b][a] = true;\n }\n\n vector<long long> A1 = solve(0);\n for (int i = 0; i < (1 << N); i++)\n dpa[i] = A1[i];\n vector<long long> A2 = solve(1);\n for (int i = 0; i < (1 << N); i++)\n dpb[i] = A2[i];\n\n long long ret = 0;\n for (int i = 7; i < power3[N]; i += 9) {\n int col[15];\n for (int j = 0; j < N; j++)\n col[j] = (i \/ power3[j]) % 3;\n int pa = 0, pb = 0;\n for (int j = 0; j < N; j++) {\n if (col[j] == 1)\n pa += (1 << j);\n if (col[j] == 2)\n pb += (1 << j);\n }\n\n if (dpa[pa] == 0 || dpb[pb] == 0)\n continue;\n long long E1 = dpa[pa] * dpb[pb] % mod;\n for (int j = 0; j < N; j++) {\n for (int k = 0; k < N; k++) {\n if (col[j] == 1 && col[k] == 2 && used[j][k] == true)\n E1 *= 0;\n if (col[j] == 0 && col[k] == 0 && j < k && used[j][k] == true) {\n E1 *= 2;\n E1 %= mod;\n }\n }\n }\n ret += E1;\n ret %= mod;\n }\n cout << (power[M] - ret + mod) % mod << endl;\n return 0;\n}","fail":"#include <iostream>\n#include <vector>\nusing namespace std;\n\nlong long N, M, dpa[1 << 18], dpb[1 << 18], power[200], powerinv[200],\n power3[200], mod = 1000000007;\nbool used[16][16];\nint V3[16];\n\nvector<long long> solve(int pos) {\n vector<long long> dp((1 << N), 0);\n for (int i = 0; i < (1 << N); i++) {\n int bit[15];\n for (int j = 0; j < N; j++)\n bit[j] = (i \/ (1 << j)) % 2;\n if (bit[pos] == 0)\n continue;\n\n int cnt = 0;\n for (int j = 0; j < N; j++) {\n for (int k = j + 1; k < N; k++) {\n if (bit[j] == 1 && bit[k] == 1 && used[j][k] == true)\n cnt++;\n }\n }\n long long res = power[cnt];\n int G = 0;\n vector<int> V1;\n for (int j = 0; j < N; j++) {\n if (bit[j] == 1) {\n if (j == pos)\n G = (1 << V1.size());\n V1.push_back(j);\n }\n }\n\n for (int j = 0; j < (1 << V1.size()); j++) {\n if ((j & G) == 0)\n continue;\n int R = 0, T = 0;\n for (int k = 0; k < V1.size(); k++) {\n if ((j & (1 << k)) != 0)\n R += (1 << V1[k]);\n else {\n V3[T] = V1[k];\n T++;\n }\n }\n long long Y = dp[R];\n if (Y == 0)\n continue;\n for (int k = 0; k < T; k++) {\n for (int l = k + 1; l < T; l++) {\n if (used[V3[k]][V3[l]] == true) {\n Y *= 2;\n if (Y >= mod)\n Y -= mod;\n }\n }\n }\n res -= Y;\n if (res < 0)\n res += mod;\n }\n dp[i] = res;\n }\n return dp;\n}\n\nint main() {\n power[0] = 1;\n for (int i = 1; i < 200; i++)\n power[i] = (2LL * power[i - 1]) % mod;\n powerinv[0] = 1;\n for (int i = 1; i < 200; i++)\n powerinv[i] = (500000004LL * powerinv[i - 1]) % mod;\n power3[0] = 1;\n for (int i = 1; i < 200; i++)\n power3[i] = (3LL * power3[i - 1]) % mod;\n\n cin >> N >> M;\n for (int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n used[a][b] = true;\n used[b][a] = true;\n }\n\n vector<long long> A1 = solve(0);\n for (int i = 0; i < (1 << N); i++)\n dpa[i] = A1[i];\n vector<long long> A2 = solve(1);\n for (int i = 0; i < (1 << N); i++)\n dpb[i] = A2[i];\n\n long long ret = 0;\n for (int i = 7; i < power3[N]; i += 9) {\n int col[15];\n for (int j = 0; j < N; j++)\n col[j] = (i \/ power3[j]) % 3;\n int pa = 0, pb = 0;\n for (int j = 0; j < N; j++) {\n if (col[j] == 1)\n pa += (1 << j);\n if (col[j] == 2)\n pb += (1 << j);\n }\n\n if (dpa[pa] == 0 || dpb[pb] == 0)\n continue;\n long long E1 = dpa[pa] * dpb[pb] % mod;\n for (int j = 0; j < N; j++) {\n for (int k = 0; k < N; k++) {\n if (col[j] == 1 && col[k] == 2 && used[j][k] == true)\n E1 *= 0;\n if (col[j] == 0 && col[k] == 0 && j < k && used[j][k] == true) {\n E1 *= 2;\n E1 %= mod;\n }\n }\n }\n ret += E1;\n ret %= mod;\n }\n cout << (power[M] - ret + mod) % mod << endl;\n return 0;\n}","change":"replace","i1":26,"i2":33,"j1":26,"j2":39,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03513","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n\nusing namespace std;\nlong long p, n, m, z;\nlong long t[100000], a[100000], b[1000], c[100000], d[100000], f[2][100000];\nint main() {\n p = 1000000007;\n cin >> n >> m;\n t[0] = 1;\n for (int i = 1; i <= 105; i++)\n t[i] = (t[i - 1] * 2) % p;\n for (int i = 1; i <= m; i++) {\n cin >> a[i] >> b[i];\n }\n for (int j = 1; j <= m; j++)\n for (int i = 1; i <= t[n] - 1; i++) {\n if ((1 & i >> a[j] - 1) && (1 & i >> b[j] - 1))\n c[i]++;\n if ((1 & i >> a[j] - 1) || (1 & i >> b[j] - 1))\n d[i]++;\n }\n for (int i = 1; i <= 2; i++)\n for (int j = 0; j <= t[n] - 1; j++) {\n if (!(j & i))\n continue;\n f[i][j] = t[c[j]];\n for (int k = j; k >= 1; k = (k - 1) & j) {\n f[i][j] = (f[i][j] + p - f[i][j - k] * t[c[k]]) % p;\n }\n }\n for (int i = 0; i <= t[n] - 1; i++)\n for (int j = 0; j <= t[n] - 1; j++) {\n if ((i & j) != 0 || c[i] + c[j] != c[i | j])\n continue;\n z = (z + (f[1][i] * f[2][j]) % p * t[m - d[i | j]]) % p;\n }\n cout << (t[m] - z + p) % p << endl;\n}","fail":"#include <bits\/stdc++.h>\n\nusing namespace std;\nlong long p, n, m, z;\nlong long t[1000], a[1000], b[1000], c[100000], d[100000], f[3][100000];\nint main() {\n p = 1000000007;\n cin >> n >> m;\n t[0] = 1;\n for (int i = 1; i <= 105; i++)\n t[i] = (t[i - 1] * 2) % p;\n for (int i = 1; i <= m; i++) {\n cin >> a[i] >> b[i];\n }\n for (int j = 1; j <= m; j++)\n for (int i = 1; i <= t[n] - 1; i++) {\n if ((1 & i >> a[j] - 1) && (1 & i >> b[j] - 1))\n c[i]++;\n if ((1 & i >> a[j] - 1) || (1 & i >> b[j] - 1))\n d[i]++;\n }\n for (int i = 1; i <= 2; i++)\n for (int j = 0; j <= t[n] - 1; j++) {\n if (!(j & i))\n continue;\n f[i][j] = t[c[j]];\n for (int k = j; k >= 1; k = (k - 1) & j) {\n f[i][j] = (f[i][j] + p - f[i][j - k] * t[c[k]]) % p;\n }\n }\n for (int i = 0; i <= t[n] - 1; i++)\n for (int j = 0; j <= t[n] - 1; j++) {\n if ((i & j) != 0 || c[i] + c[j] != c[i | j])\n continue;\n z = (z + (f[1][i] * f[2][j]) % p * t[m - d[i | j]]) % p;\n }\n cout << (t[m] - z + p) % p << endl;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"-11","stderr":null,"stdout":null}
{"problem_id":"p03513","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\nusing namespace std;\nusing lint = long long;\ntemplate <class T = int> using V = vector<T>;\ntemplate <class T = int> using VV = V<V<T>>;\n\ntemplate <unsigned P> struct ModInt {\n using M = ModInt;\n unsigned v;\n constexpr ModInt() : v(0) {}\n constexpr ModInt(unsigned _v, int) : v(_v) {}\n template <class Z> ModInt(const Z &a) : v((a < 0 ? P - -a % P : a) % P) {}\n static constexpr unsigned p() { return P; }\n M operator+() const { return *this; }\n M operator-() const { return {v ? P - v : 0, 0}; }\n explicit operator bool() const noexcept { return v; }\n bool operator!() const noexcept { return !(bool)*this; }\n M &operator*=(M r) {\n v = (uint64_t)v * r.v % P;\n return *this;\n }\n M &operator\/=(M r) { return *this *= r.inv(); }\n M &operator+=(M r) {\n if ((v += r.v) >= P)\n v -= P;\n return *this;\n }\n M &operator-=(M r) {\n if ((v += P - r.v) >= P)\n v -= P;\n return *this;\n }\n M inv() const {\n int a = v, b = P, x = 1, u = 0;\n while (b) {\n int q = a \/ b;\n swap(a -= q * b, b);\n swap(x -= q * u, u);\n }\n assert(a == 1);\n return x;\n }\n template <class Z> M pow(Z n) const {\n if (n < 0)\n return pow(-n).inv();\n M res = 1;\n for (M a = *this; n; a *= a, n >>= 1)\n if (n & 1)\n res *= a;\n return res;\n }\n friend M operator*(M l, M r) { return M(l) *= r; }\n friend M operator\/(M l, M r) { return M(l) \/= r; }\n friend M operator+(M l, M r) { return M(l) += r; }\n friend M operator-(M l, M r) { return M(l) -= r; }\n friend ostream &operator<<(ostream &os, M r) { return os << r.v; }\n friend bool operator==(M l, M r) { return l.v == r.v; }\n friend bool operator!=(M l, M r) { return !(l == r); }\n};\nusing Mint = ModInt<(unsigned)1e9 + 7>;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n, m;\n cin >> n >> m;\n V<bitset<15>> g(n);\n for (int _ = 0; _ < m; ++_) {\n int u, v;\n cin >> u >> v, --u, --v;\n g[u][v] = g[v][u] = 1;\n }\n\n auto fn = [&](int r) -> V<Mint> {\n V<Mint> dp(1 << n);\n for (int S = 0; S < 1 << n; ++S)\n if (S >> r & 1) {\n int c = 0;\n for (int u = 0; u < n; ++u)\n if (S >> u & 1) {\n for (int v = 0; v < n; ++v)\n if (~S >> v & 1) {\n c += g[u][v];\n }\n }\n dp[S] = Mint(2).pow(-c);\n for (int T = (S - 1) & S;; T = (T - 1) & S) {\n c = 0;\n for (int u = 0; u < n; ++u)\n if (S >> u & 1 and ~T >> u & 1) {\n for (int v = 0; v < n; ++v)\n if (~S >> v & 1) {\n c += g[u][v];\n }\n }\n dp[S] -= dp[T] * Mint(2).pow(-c);\n if (!T)\n break;\n }\n }\n return dp;\n };\n\n auto dp0 = fn(0);\n auto dp1 = fn(1);\n Mint res = 1;\n for (int S = 0; S < 1 << n; ++S) {\n int Sc = S ^ ~(~0U << n);\n for (int T = Sc;; T = (T - 1) & Sc) {\n int c = 0;\n for (int u = 0; u < n; ++u)\n if (S >> u & 1) {\n for (int v = 0; v < n; ++v)\n if (T >> v & 1) {\n c += g[u][v];\n }\n }\n if (!c) {\n res -= dp0[S] * dp1[T];\n }\n if (!T)\n break;\n }\n }\n res *= Mint(2).pow(m);\n cout << res << '\\\\n';\n}","fail":"#include <bits\/stdc++.h>\nusing namespace std;\nusing lint = long long;\ntemplate <class T = int> using V = vector<T>;\ntemplate <class T = int> using VV = V<V<T>>;\n\ntemplate <unsigned P> struct ModInt {\n using M = ModInt;\n unsigned v;\n constexpr ModInt() : v(0) {}\n constexpr ModInt(unsigned _v, int) : v(_v) {}\n template <class Z> ModInt(const Z &a) : v((a < 0 ? P - -a % P : a) % P) {}\n static constexpr unsigned p() { return P; }\n M operator+() const { return *this; }\n M operator-() const { return {v ? P - v : 0, 0}; }\n explicit operator bool() const noexcept { return v; }\n bool operator!() const noexcept { return !(bool)*this; }\n M &operator*=(M r) {\n v = (uint64_t)v * r.v % P;\n return *this;\n }\n M &operator\/=(M r) { return *this *= r.inv(); }\n M &operator+=(M r) {\n if ((v += r.v) >= P)\n v -= P;\n return *this;\n }\n M &operator-=(M r) {\n if ((v += P - r.v) >= P)\n v -= P;\n return *this;\n }\n M inv() const {\n int a = v, b = P, x = 1, u = 0;\n while (b) {\n int q = a \/ b;\n swap(a -= q * b, b);\n swap(x -= q * u, u);\n }\n assert(a == 1);\n return x;\n }\n template <class Z> M pow(Z n) const {\n if (n < 0)\n return pow(-n).inv();\n M res = 1;\n for (M a = *this; n; a *= a, n >>= 1)\n if (n & 1)\n res *= a;\n return res;\n }\n friend M operator*(M l, M r) { return M(l) *= r; }\n friend M operator\/(M l, M r) { return M(l) \/= r; }\n friend M operator+(M l, M r) { return M(l) += r; }\n friend M operator-(M l, M r) { return M(l) -= r; }\n friend ostream &operator<<(ostream &os, M r) { return os << r.v; }\n friend bool operator==(M l, M r) { return l.v == r.v; }\n friend bool operator!=(M l, M r) { return !(l == r); }\n};\nusing Mint = ModInt<(unsigned)1e9 + 7>;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n, m;\n cin >> n >> m;\n V<bitset<15>> g(n);\n for (int _ = 0; _ < m; ++_) {\n int u, v;\n cin >> u >> v, --u, --v;\n g[u][v] = g[v][u] = 1;\n }\n V<Mint> ipw(m + 1, 1);\n for (int i = 1; i <= m; ++i) {\n ipw[i] = ipw[i - 1] \/ 2;\n }\n\n auto fn = [&](int r) -> V<Mint> {\n V<Mint> dp(1 << n);\n for (int S = 0; S < 1 << n; ++S)\n if (S >> r & 1) {\n int c = 0;\n for (int u = 0; u < n; ++u)\n if (S >> u & 1) {\n for (int v = 0; v < n; ++v)\n if (~S >> v & 1) {\n c += g[u][v];\n }\n }\n dp[S] = ipw[c];\n V<> a(n);\n for (int u = 0; u < n; ++u)\n if (~S >> u & 1) {\n for (int v = 0; v < n; ++v)\n if (S >> v & 1) {\n a[v] += g[u][v];\n }\n }\n for (int T = (S - 1) & S;; T = (T - 1) & S) {\n c = 0;\n for (int v = 0; v < n; ++v)\n if ((S ^ T) >> v & 1) {\n c += a[v];\n }\n dp[S] -= dp[T] * ipw[c];\n if (!T)\n break;\n }\n }\n return dp;\n };\n\n auto dp0 = fn(0);\n auto dp1 = fn(1);\n Mint res = 1;\n for (int S = 0; S < 1 << n; ++S) {\n int nS = S;\n for (int u = 0; u < n; ++u)\n if (S >> u & 1) {\n for (int v = 0; v < n; ++v)\n if (g[u][v]) {\n nS |= 1 << v;\n }\n }\n for (int T = nS ^ ~(~0U << n);; T = (T - 1) & (nS ^ ~(~0U << n))) {\n res -= dp0[S] * dp1[T];\n if (!T)\n break;\n }\n }\n res *= Mint(2).pow(m);\n cout << res << '\\\\n';\n}","change":"replace","i1":72,"i2":120,"j1":72,"j2":126,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03513","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define ll long long\nusing namespace std;\nll n, m, i, j, x, y, k, mx, ans, f[2][100010], c[100010], d[100001], fac[10001],\n p = 1e9 + 7, du[201][201];\nint main() {\n scanf(\"%lld%lld\", &n, &m);\n fac[0] = 1;\n for (i = 1; i <= m; i++) {\n scanf(\"%lld%lld\", &x, &y);\n x--;\n y--;\n du[x][y]++;\n fac[i] = fac[i - 1] * 2 % p;\n }\n mx = 1 << m;\n for (i = 0; i < mx; i++)\n for (j = 0; j < n; j++)\n for (k = 0; k < n; k++)\n if (du[k][j]) {\n if ((i & (1 << j)) && (i & (1 << k)))\n c[i] += du[k][j];\n if ((i & (1 << j)) || (i & (1 << k)))\n d[i] += du[k][j];\n }\n for (k = 0; k < 2; k++)\n for (i = 0; i < mx; i++)\n if (i & (1 << k)) {\n f[k][i] = fac[c[i]];\n for (j = (i - 1) & i; j; j = (j - 1) & i)\n if (j & (1 << k))\n f[k][i] = (f[k][i] - f[k][j] * fac[c[i - j]] % p + p) % p;\n }\n ans = fac[m];\n \/\/ printf(\"%lld\\\\n\",ans);\n for (i = 0; i < mx; i++) {\n if (!(i & 1) || (i & 2))\n continue;\n for (j = mx - 1 - i; j; j = (j - 1) & (mx - 1 - i)) {\n if (!(j & (1 << 1)) || c[i] + c[j] < c[i + j])\n continue;\n ans = (ans - f[0][i] * f[1][j] % p * fac[m - d[i + j]] % p + p) % p;\n }\n }\n printf(\"%lld\", ans);\n}","fail":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#define For(i, a, b) for (i = a; i <= b; i++)\n#define Tubtet(i, k) for (k = (i - 1) & i; k; k = (k - 1) & i)\n#define Subset(i, k) for (k = i; k; k = (k - 1) & i)\nusing namespace std;\ninline int read() {\n int res = 0;\n bool bo = 0;\n char c;\n while (((c = getchar()) < '0' || c > '9') && c != '-')\n ;\n if (c == '-')\n bo = 1;\n else\n res = c - 48;\n while ((c = getchar()) >= '0' && c <= '9')\n res = (res << 3) + (res << 1) + (c - 48);\n return bo ? ~res + 1 : res;\n}\nconst int N = 17, M = 405, C = (1 << 15) + 5, PYZ = 1e9 + 7;\nint n, m, g[N][N], f[3][C], c[C], d[C], Cm, p[M], ans;\nint main() {\n int i, j, k, x, y;\n n = read();\n m = read();\n p[0] = 1;\n For(i, 1, m) x = read(), y = read(), g[x][y]++, p[i] = 2ll * p[i - 1] % PYZ;\n Cm = (1 << n) - 1;\n For(i, 0, Cm) For(j, 1, n) For(k, 1, n) if (g[j][k]) {\n if (((i >> j - 1) & 1) && ((i >> k - 1) & 1))\n c[i] += g[j][k];\n if (((i >> j - 1) & 1) || ((i >> k - 1) & 1))\n d[i] += g[j][k];\n }\n For(k, 1, 2) For(i, 0, Cm) {\n if (!((i >> k - 1) & 1))\n continue;\n f[k][i] = p[c[i]];\n Tubtet(i, j) {\n if (!((j >> k - 1) & 1))\n continue;\n f[k][i] = (f[k][i] - 1ll * f[k][j] * p[c[i - j]] % PYZ + PYZ) % PYZ;\n }\n }\n ans = p[m];\n For(i, 0, Cm) {\n if (!(i & 1) || ((i >> 1) & 1))\n continue;\n Subset(Cm - i, j) {\n if (!((j >> 1) & 1) || c[i] + c[j] < c[i + j])\n continue;\n ans =\n (ans - 1ll * f[1][i] * f[2][j] % PYZ * p[m - d[i + j]] % PYZ + PYZ) %\n PYZ;\n }\n }\n cout << ans << endl;\n return 0;\n}","change":"replace","i1":0,"i2":45,"j1":0,"j2":62,"error":"WA","stderr":null,"stdout":6.0}
{"problem_id":"p03513","language":"C++","original_status":"Time Limit Exceeded","pass":"\/**\n * author: tourist\n * created: 12.12.2019 19:24:11\n **\/\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntemplate <typename A, typename B> string to_string(pair<A, B> p);\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p);\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p);\n\nstring to_string(const string &s) { return '\"' + s + '\"'; }\n\nstring to_string(const char *s) { return to_string((string)s); }\n\nstring to_string(bool b) { return (b ? \"true\" : \"false\"); }\n\nstring to_string(vector<bool> v) {\n bool first = true;\n string res = \"{\";\n for (int i = 0; i < static_cast<int>(v.size()); i++) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(v[i]);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <size_t N> string to_string(bitset<N> v) {\n string res = \"\";\n for (size_t i = 0; i < N; i++) {\n res += static_cast<char>('0' + v[i]);\n }\n return res;\n}\n\ntemplate <typename A> string to_string(A v) {\n bool first = true;\n string res = \"{\";\n for (const auto &x : v) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(x);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <typename A, typename B> string to_string(pair<A, B> p) {\n return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";\n}\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" +\n to_string(get<2>(p)) + \")\";\n}\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" +\n to_string(get<2>(p)) + \", \" + to_string(get<3>(p)) + \")\";\n}\n\nvoid debug_out() { cerr << endl; }\n\ntemplate <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {\n cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\ntemplate <typename T> T inverse(T a, T m) {\n T u = 0, v = 1;\n while (a != 0) {\n T t = m \/ a;\n m -= t * a;\n swap(a, m);\n u -= t * v;\n swap(u, v);\n }\n assert(m == 1);\n return u;\n}\n\ntemplate <typename T> class Modular {\npublic:\n using Type = typename decay<decltype(T::value)>::type;\n\n constexpr Modular() : value() {}\n template <typename U> Modular(const U &x) { value = normalize(x); }\n\n template <typename U> static Type normalize(const U &x) {\n Type v;\n if (-mod() <= x && x < mod())\n v = static_cast<Type>(x);\n else\n v = static_cast<Type>(x % mod());\n if (v < 0)\n v += mod();\n return v;\n }\n\n const Type &operator()() const { return value; }\n template <typename U> explicit operator U() const {\n return static_cast<U>(value);\n }\n constexpr static Type mod() { return T::value; }\n\n Modular &operator+=(const Modular &other) {\n if ((value += other.value) >= mod())\n value -= mod();\n return *this;\n }\n Modular &operator-=(const Modular &other) {\n if ((value -= other.value) < 0)\n value += mod();\n return *this;\n }\n template <typename U> Modular &operator+=(const U &other) {\n return *this += Modular(other);\n }\n template <typename U> Modular &operator-=(const U &other) {\n return *this -= Modular(other);\n }\n Modular &operator++() { return *this += 1; }\n Modular &operator--() { return *this -= 1; }\n Modular operator++(int) {\n Modular result(*this);\n *this += 1;\n return result;\n }\n Modular operator--(int) {\n Modular result(*this);\n *this -= 1;\n return result;\n }\n Modular operator-() const { return Modular(-value); }\n\n template <typename U = T>\n typename enable_if<is_same<typename Modular<U>::Type, int>::value,\n Modular>::type &\n operator*=(const Modular &rhs) {\n#ifdef _WIN32\n uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);\n uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x),\n d, m;\n asm(\"divl %4; \\\\n\\\\t\" : \"=a\"(d), \"=d\"(m) : \"d\"(xh), \"a\"(xl), \"r\"(mod()));\n value = m;\n#else\n value = normalize(static_cast<int64_t>(value) *\n static_cast<int64_t>(rhs.value));\n#endif\n return *this;\n }\n template <typename U = T>\n typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value,\n Modular>::type &\n operator*=(const Modular &rhs) {\n int64_t q = static_cast<int64_t>(static_cast<long double>(value) *\n rhs.value \/ mod());\n value = normalize(value * rhs.value - q * mod());\n return *this;\n }\n template <typename U = T>\n typename enable_if<!is_integral<typename Modular<U>::Type>::value,\n Modular>::type &\n operator*=(const Modular &rhs) {\n value = normalize(value * rhs.value);\n return *this;\n }\n\n Modular &operator\/=(const Modular &other) {\n return *this *= Modular(inverse(other.value, mod()));\n }\n\n template <typename U> friend const Modular<U> &abs(const Modular<U> &v) {\n return v;\n }\n\n template <typename U>\n friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);\n\n template <typename U>\n friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);\n\n template <typename U>\n friend std::istream &operator>>(std::istream &stream, Modular<U> &number);\n\nprivate:\n Type value;\n};\n\ntemplate <typename T>\nbool operator==(const Modular<T> &lhs, const Modular<T> &rhs) {\n return lhs.value == rhs.value;\n}\ntemplate <typename T, typename U>\nbool operator==(const Modular<T> &lhs, U rhs) {\n return lhs == Modular<T>(rhs);\n}\ntemplate <typename T, typename U>\nbool operator==(U lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) == rhs;\n}\n\ntemplate <typename T>\nbool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) {\n return !(lhs == rhs);\n}\ntemplate <typename T, typename U>\nbool operator!=(const Modular<T> &lhs, U rhs) {\n return !(lhs == rhs);\n}\ntemplate <typename T, typename U>\nbool operator!=(U lhs, const Modular<T> &rhs) {\n return !(lhs == rhs);\n}\n\ntemplate <typename T>\nbool operator<(const Modular<T> &lhs, const Modular<T> &rhs) {\n return lhs.value < rhs.value;\n}\n\ntemplate <typename T>\nModular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) += rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator+(const Modular<T> &lhs, U rhs) {\n return Modular<T>(lhs) += rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator+(U lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) += rhs;\n}\n\ntemplate <typename T>\nModular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) -= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator-(const Modular<T> &lhs, U rhs) {\n return Modular<T>(lhs) -= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator-(U lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) -= rhs;\n}\n\ntemplate <typename T>\nModular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) *= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator*(const Modular<T> &lhs, U rhs) {\n return Modular<T>(lhs) *= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator*(U lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) *= rhs;\n}\n\ntemplate <typename T>\nModular<T> operator\/(const Modular<T> &lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) \/= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator\/(const Modular<T> &lhs, U rhs) {\n return Modular<T>(lhs) \/= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator\/(U lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) \/= rhs;\n}\n\ntemplate <typename T, typename U>\nModular<T> power(const Modular<T> &a, const U &b) {\n assert(b >= 0);\n Modular<T> x = a, res = 1;\n U p = b;\n while (p > 0) {\n if (p & 1)\n res *= x;\n x *= x;\n p >>= 1;\n }\n return res;\n}\n\ntemplate <typename T> bool IsZero(const Modular<T> &number) {\n return number() == 0;\n}\n\ntemplate <typename T> string to_string(const Modular<T> &number) {\n return to_string(number());\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {\n return stream << number();\n}\n\ntemplate <typename T>\nstd::istream &operator>>(std::istream &stream, Modular<T> &number) {\n typename common_type<typename Modular<T>::Type, int64_t>::type x;\n stream >> x;\n number.value = Modular<T>::normalize(x);\n return stream;\n}\n\n\/*\nusing ModType = int;\n\nstruct VarMod { static ModType value; };\nModType VarMod::value;\nModType& md = VarMod::value;\nusing Mint = Modular<VarMod>;\n*\/\n\nconstexpr int md = (int)1e9 + 7;\nusing Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, m;\n cin >> n >> m;\n vector<int> g(n);\n for (int i = 0; i < m; i++) {\n int x, y;\n cin >> x >> y;\n --x;\n --y;\n g[x] |= 1 << y;\n g[y] |= 1 << x;\n }\n Mint inv2 = 1 \/ Mint(2);\n vector<vector<Mint>> p(2, vector<Mint>(1 << n));\n for (int v = 0; v < 2; v++) {\n for (int t = 0; t < (1 << n); t++) {\n if (t & (1 << v)) {\n p[v][t] = 1;\n int u = t;\n while (u > 0) {\n u = (u - 1) & t;\n if (u & (1 << v)) {\n Mint cur = p[v][u];\n for (int i = 0; i < n; i++) {\n if (u & (1 << i)) {\n for (int j = 0; j < n; j++) {\n if (!(u & (1 << j)) && (t & (1 << j))) {\n if (g[i] & (1 << j)) {\n cur *= inv2;\n }\n }\n }\n }\n }\n p[v][t] -= cur;\n }\n }\n }\n }\n }\n debug(p);\n Mint ans = 1;\n for (int t = 1; t < (1 << n); t++) {\n if (t & 1) {\n int u = (1 << n) - 1 - t;\n while (u > 0) {\n if (u & 2) {\n bool ok = true;\n for (int i = 0; i < n; i++) {\n if (t & (1 << i)) {\n for (int j = 0; j < n; j++) {\n if (u & (1 << j)) {\n if (g[i] & (1 << j)) {\n ok = false;\n }\n }\n }\n }\n }\n if (ok) {\n Mint cur = p[0][t] * p[1][u];\n for (int i = 0; i < n; i++) {\n if ((t | u) & (1 << i)) {\n for (int j = 0; j < n; j++) {\n if (!((t | u) & (1 << j))) {\n if (g[i] & (1 << j)) {\n cur *= inv2;\n }\n }\n }\n }\n }\n ans -= cur;\n }\n }\n u = (u - 1) & ((1 << n) - 1 - t);\n }\n }\n }\n ans *= power(Mint(2), m);\n cout << ans << '\\\\n';\n return 0;\n}\n","fail":"\/**\n * author: tourist\n * created: 12.12.2019 19:24:11\n **\/\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntemplate <typename A, typename B> string to_string(pair<A, B> p);\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p);\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p);\n\nstring to_string(const string &s) { return '\"' + s + '\"'; }\n\nstring to_string(const char *s) { return to_string((string)s); }\n\nstring to_string(bool b) { return (b ? \"true\" : \"false\"); }\n\nstring to_string(vector<bool> v) {\n bool first = true;\n string res = \"{\";\n for (int i = 0; i < static_cast<int>(v.size()); i++) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(v[i]);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <size_t N> string to_string(bitset<N> v) {\n string res = \"\";\n for (size_t i = 0; i < N; i++) {\n res += static_cast<char>('0' + v[i]);\n }\n return res;\n}\n\ntemplate <typename A> string to_string(A v) {\n bool first = true;\n string res = \"{\";\n for (const auto &x : v) {\n if (!first) {\n res += \", \";\n }\n first = false;\n res += to_string(x);\n }\n res += \"}\";\n return res;\n}\n\ntemplate <typename A, typename B> string to_string(pair<A, B> p) {\n return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";\n}\n\ntemplate <typename A, typename B, typename C>\nstring to_string(tuple<A, B, C> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" +\n to_string(get<2>(p)) + \")\";\n}\n\ntemplate <typename A, typename B, typename C, typename D>\nstring to_string(tuple<A, B, C, D> p) {\n return \"(\" + to_string(get<0>(p)) + \", \" + to_string(get<1>(p)) + \", \" +\n to_string(get<2>(p)) + \", \" + to_string(get<3>(p)) + \")\";\n}\n\nvoid debug_out() { cerr << endl; }\n\ntemplate <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {\n cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n\n#ifdef LOCAL\n#define debug(...) cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\ntemplate <typename T> T inverse(T a, T m) {\n T u = 0, v = 1;\n while (a != 0) {\n T t = m \/ a;\n m -= t * a;\n swap(a, m);\n u -= t * v;\n swap(u, v);\n }\n assert(m == 1);\n return u;\n}\n\ntemplate <typename T> class Modular {\npublic:\n using Type = typename decay<decltype(T::value)>::type;\n\n constexpr Modular() : value() {}\n template <typename U> Modular(const U &x) { value = normalize(x); }\n\n template <typename U> static Type normalize(const U &x) {\n Type v;\n if (-mod() <= x && x < mod())\n v = static_cast<Type>(x);\n else\n v = static_cast<Type>(x % mod());\n if (v < 0)\n v += mod();\n return v;\n }\n\n const Type &operator()() const { return value; }\n template <typename U> explicit operator U() const {\n return static_cast<U>(value);\n }\n constexpr static Type mod() { return T::value; }\n\n Modular &operator+=(const Modular &other) {\n if ((value += other.value) >= mod())\n value -= mod();\n return *this;\n }\n Modular &operator-=(const Modular &other) {\n if ((value -= other.value) < 0)\n value += mod();\n return *this;\n }\n template <typename U> Modular &operator+=(const U &other) {\n return *this += Modular(other);\n }\n template <typename U> Modular &operator-=(const U &other) {\n return *this -= Modular(other);\n }\n Modular &operator++() { return *this += 1; }\n Modular &operator--() { return *this -= 1; }\n Modular operator++(int) {\n Modular result(*this);\n *this += 1;\n return result;\n }\n Modular operator--(int) {\n Modular result(*this);\n *this -= 1;\n return result;\n }\n Modular operator-() const { return Modular(-value); }\n\n template <typename U = T>\n typename enable_if<is_same<typename Modular<U>::Type, int>::value,\n Modular>::type &\n operator*=(const Modular &rhs) {\n#ifdef _WIN32\n uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);\n uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x),\n d, m;\n asm(\"divl %4; \\\\n\\\\t\" : \"=a\"(d), \"=d\"(m) : \"d\"(xh), \"a\"(xl), \"r\"(mod()));\n value = m;\n#else\n value = normalize(static_cast<int64_t>(value) *\n static_cast<int64_t>(rhs.value));\n#endif\n return *this;\n }\n template <typename U = T>\n typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value,\n Modular>::type &\n operator*=(const Modular &rhs) {\n int64_t q = static_cast<int64_t>(static_cast<long double>(value) *\n rhs.value \/ mod());\n value = normalize(value * rhs.value - q * mod());\n return *this;\n }\n template <typename U = T>\n typename enable_if<!is_integral<typename Modular<U>::Type>::value,\n Modular>::type &\n operator*=(const Modular &rhs) {\n value = normalize(value * rhs.value);\n return *this;\n }\n\n Modular &operator\/=(const Modular &other) {\n return *this *= Modular(inverse(other.value, mod()));\n }\n\n template <typename U> friend const Modular<U> &abs(const Modular<U> &v) {\n return v;\n }\n\n template <typename U>\n friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);\n\n template <typename U>\n friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);\n\n template <typename U>\n friend std::istream &operator>>(std::istream &stream, Modular<U> &number);\n\nprivate:\n Type value;\n};\n\ntemplate <typename T>\nbool operator==(const Modular<T> &lhs, const Modular<T> &rhs) {\n return lhs.value == rhs.value;\n}\ntemplate <typename T, typename U>\nbool operator==(const Modular<T> &lhs, U rhs) {\n return lhs == Modular<T>(rhs);\n}\ntemplate <typename T, typename U>\nbool operator==(U lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) == rhs;\n}\n\ntemplate <typename T>\nbool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) {\n return !(lhs == rhs);\n}\ntemplate <typename T, typename U>\nbool operator!=(const Modular<T> &lhs, U rhs) {\n return !(lhs == rhs);\n}\ntemplate <typename T, typename U>\nbool operator!=(U lhs, const Modular<T> &rhs) {\n return !(lhs == rhs);\n}\n\ntemplate <typename T>\nbool operator<(const Modular<T> &lhs, const Modular<T> &rhs) {\n return lhs.value < rhs.value;\n}\n\ntemplate <typename T>\nModular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) += rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator+(const Modular<T> &lhs, U rhs) {\n return Modular<T>(lhs) += rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator+(U lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) += rhs;\n}\n\ntemplate <typename T>\nModular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) -= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator-(const Modular<T> &lhs, U rhs) {\n return Modular<T>(lhs) -= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator-(U lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) -= rhs;\n}\n\ntemplate <typename T>\nModular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) *= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator*(const Modular<T> &lhs, U rhs) {\n return Modular<T>(lhs) *= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator*(U lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) *= rhs;\n}\n\ntemplate <typename T>\nModular<T> operator\/(const Modular<T> &lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) \/= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator\/(const Modular<T> &lhs, U rhs) {\n return Modular<T>(lhs) \/= rhs;\n}\ntemplate <typename T, typename U>\nModular<T> operator\/(U lhs, const Modular<T> &rhs) {\n return Modular<T>(lhs) \/= rhs;\n}\n\ntemplate <typename T, typename U>\nModular<T> power(const Modular<T> &a, const U &b) {\n assert(b >= 0);\n Modular<T> x = a, res = 1;\n U p = b;\n while (p > 0) {\n if (p & 1)\n res *= x;\n x *= x;\n p >>= 1;\n }\n return res;\n}\n\ntemplate <typename T> bool IsZero(const Modular<T> &number) {\n return number() == 0;\n}\n\ntemplate <typename T> string to_string(const Modular<T> &number) {\n return to_string(number());\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {\n return stream << number();\n}\n\ntemplate <typename T>\nstd::istream &operator>>(std::istream &stream, Modular<T> &number) {\n typename common_type<typename Modular<T>::Type, int64_t>::type x;\n stream >> x;\n number.value = Modular<T>::normalize(x);\n return stream;\n}\n\n\/*\nusing ModType = int;\n\nstruct VarMod { static ModType value; };\nModType VarMod::value;\nModType& md = VarMod::value;\nusing Mint = Modular<VarMod>;\n*\/\n\nconstexpr int md = (int)1e9 + 7;\nusing Mint = Modular<std::integral_constant<decay<decltype(md)>::type, md>>;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n, m;\n cin >> n >> m;\n vector<int> g(n);\n for (int i = 0; i < m; i++) {\n int x, y;\n cin >> x >> y;\n --x;\n --y;\n g[x] |= 1 << y;\n g[y] |= 1 << x;\n }\n vector<Mint> pinv2(n * n + 1);\n pinv2[0] = 1;\n for (int i = 1; i < (int)pinv2.size(); i++) {\n pinv2[i] = pinv2[i - 1] \/ 2;\n }\n vector<vector<Mint>> p(2, vector<Mint>(1 << n));\n for (int v = 0; v < 2; v++) {\n for (int t = 0; t < (1 << n); t++) {\n if (t & (1 << v)) {\n p[v][t] = 1;\n int u = t;\n while (u > 0) {\n u = (u - 1) & t;\n if (u & (1 << v)) {\n int c = 0;\n for (int i = 0; i < n; i++) {\n if (u & (1 << i)) {\n c += __builtin_popcount(t & ~u & g[i]);\n }\n }\n p[v][t] -= p[v][u] * pinv2[c];\n }\n }\n }\n }\n }\n Mint ans = 1;\n for (int t = 1; t < (1 << n); t++) {\n if (t & 1) {\n int u = (1 << n) - 1 - t;\n while (u > 0) {\n if (u & 2) {\n bool ok = true;\n for (int i = 0; i < n; i++) {\n if ((t & (1 << i)) && (u & g[i])) {\n ok = false;\n break;\n }\n }\n if (ok) {\n int c = 0;\n for (int i = 0; i < n; i++) {\n if ((t | u) & (1 << i)) {\n c += __builtin_popcount(~t & ~u & g[i]);\n }\n }\n ans -= p[0][t] * p[1][u] * pinv2[c];\n }\n }\n u = (u - 1) & ((1 << n) - 1 - t);\n }\n }\n }\n ans *= power(Mint(2), m);\n cout << ans << '\\\\n';\n return 0;\n}\n","change":"replace","i1":352,"i2":413,"j1":352,"j2":399,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03513","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)\n#define all(c) c.begin(), c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nusing namespace std;\ntemplate <class S, class T>\nostream &operator<<(ostream &o, const pair<S, T> &p) {\n return o << \"(\" << p.fs << \",\" << p.sc << \")\";\n}\ntemplate <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {\n o << \"sz = \" << vc.size() << endl << \"[\";\n for (const T &v : vc)\n o << v << \",\";\n o << \"]\";\n return o;\n}\n\ntemplate <unsigned int mod_> struct ModInt {\n using uint = unsigned int;\n using ll = long long;\n using ull = unsigned long long;\n\n constexpr static uint mod = mod_;\n\n uint v;\n ModInt() : v(0) {}\n ModInt(ll v) : v(normS(v % mod + mod)) {}\n explicit operator bool() const { return v != 0; }\n static uint normS(const uint &x) {\n return (x < mod) ? x : x - mod;\n } \/\/ [0 , 2*mod-1] -> [0 , mod-1]\n static ModInt make(const uint &x) {\n ModInt m;\n m.v = x;\n return m;\n }\n ModInt operator+(const ModInt &b) const { return make(normS(v + b.v)); }\n ModInt operator-(const ModInt &b) const { return make(normS(v + mod - b.v)); }\n ModInt operator-() const { return make(normS(mod - v)); }\n ModInt operator*(const ModInt &b) const { return make((ull)v * b.v % mod); }\n ModInt operator\/(const ModInt &b) const { return *this * b.inv(); }\n ModInt &operator+=(const ModInt &b) { return *this = *this + b; }\n ModInt &operator-=(const ModInt &b) { return *this = *this - b; }\n ModInt &operator*=(const ModInt &b) { return *this = *this * b; }\n ModInt &operator\/=(const ModInt &b) { return *this = *this \/ b; }\n ll extgcd(ll a, ll b, ll &x, ll &y) const {\n ll u[] = {a, 1, 0}, v[] = {b, 0, 1};\n while (*v) {\n ll t = *u \/ *v;\n rep(i, 3) swap(u[i] -= t * v[i], v[i]);\n }\n if (u[0] < 0)\n rep(i, 3) u[i] = -u[i];\n x = u[1], y = u[2];\n return u[0];\n }\n ModInt inv() const {\n ll x, y;\n extgcd(v, mod, x, y);\n return make(normS(x + mod));\n }\n bool operator==(const ModInt &b) const { return v == b.v; }\n bool operator!=(const ModInt &b) const { return v != b.v; }\n friend istream &operator>>(istream &o, ModInt &x) {\n ll tmp;\n o >> tmp;\n x = ModInt(tmp);\n return o;\n }\n friend ostream &operator<<(ostream &o, const ModInt &x) { return o << x.v; }\n};\nusing mint = ModInt<1000000007>;\n\nbool B(int x, int i) { return (x >> i) & 1; }\n\nint N, M;\nmint dp0[1 << 15], dp1[1 << 15];\nmint p2[10000];\nint x[10000], y[10000];\nint in[1 << 15];\nint _in(int S) {\n int res = 0;\n rep(i, M) if (B(S, x[i]) && B(S, y[i])) res++;\n return res;\n}\nint cut(int S, int T) { return in[S + T] - in[S] - in[T]; }\n\nint main() {\n p2[0] = 1;\n rep1(i, 9999) p2[i] = p2[i - 1] * 2;\n cin >> N >> M;\n rep(i, M) {\n cin >> x[i] >> y[i];\n x[i]--, y[i]--;\n }\n rep(S, 1 << N) in[S] = _in(S);\n rep(S, 1 << N) if (B(S, 0)) {\n dp0[S] = mint(1);\n for (int T = (S - 1) & S; T > 0; T = (T - 1) & S)\n if (B(T, 0)) {\n dp0[S] -= dp0[T] \/ p2[cut(T, S - T)];\n }\n }\n rep(S, 1 << N) if (B(S, 0)) { dp0[S] \/= p2[cut(S, (1 << N) - 1 - S)]; }\n\n rep(S, 1 << N) if (B(S, 1)) {\n dp1[S] = mint(1);\n for (int T = (S - 1) & S; T > 0; T = (T - 1) & S)\n if (B(T, 1)) {\n dp1[S] -= dp1[T] \/ p2[cut(T, S - T)];\n }\n }\n rep(S, 1 << N) if (B(S, 1)) { dp1[S] \/= p2[cut(S, (1 << N) - 1 - S)]; }\n\n mint ans = 1;\n rep(S, 1 << N) if (B(S, 0)) {\n int S2 = S;\n rep(i, M) {\n if (B(S, x[i]))\n S2 |= 1 << y[i];\n if (B(S, y[i]))\n S2 |= 1 << x[i];\n }\n int Tup = (1 << N) - 1 - S2;\n for (int T = Tup; T > 0; T = (T - 1) & Tup)\n if (B(T, 1)) {\n ans -= dp0[S] * dp1[T];\n }\n }\n ans *= p2[M];\n cout << ans << endl;\n}\n","fail":"#include <bits\/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)\n#define all(c) c.begin(), c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nusing namespace std;\ntemplate <class S, class T>\nostream &operator<<(ostream &o, const pair<S, T> &p) {\n return o << \"(\" << p.fs << \",\" << p.sc << \")\";\n}\ntemplate <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {\n o << \"sz = \" << vc.size() << endl << \"[\";\n for (const T &v : vc)\n o << v << \",\";\n o << \"]\";\n return o;\n}\n\ntemplate <unsigned int mod_> struct ModInt {\n using uint = unsigned int;\n using ll = long long;\n using ull = unsigned long long;\n\n constexpr static uint mod = mod_;\n\n uint v;\n ModInt() : v(0) {}\n ModInt(ll v) : v(normS(v % mod + mod)) {}\n explicit operator bool() const { return v != 0; }\n static uint normS(const uint &x) {\n return (x < mod) ? x : x - mod;\n } \/\/ [0 , 2*mod-1] -> [0 , mod-1]\n static ModInt make(const uint &x) {\n ModInt m;\n m.v = x;\n return m;\n }\n ModInt operator+(const ModInt &b) const { return make(normS(v + b.v)); }\n ModInt operator-(const ModInt &b) const { return make(normS(v + mod - b.v)); }\n ModInt operator-() const { return make(normS(mod - v)); }\n ModInt operator*(const ModInt &b) const { return make((ull)v * b.v % mod); }\n ModInt operator\/(const ModInt &b) const { return *this * b.inv(); }\n ModInt &operator+=(const ModInt &b) { return *this = *this + b; }\n ModInt &operator-=(const ModInt &b) { return *this = *this - b; }\n ModInt &operator*=(const ModInt &b) { return *this = *this * b; }\n ModInt &operator\/=(const ModInt &b) { return *this = *this \/ b; }\n ll extgcd(ll a, ll b, ll &x, ll &y) const {\n ll u[] = {a, 1, 0}, v[] = {b, 0, 1};\n while (*v) {\n ll t = *u \/ *v;\n rep(i, 3) swap(u[i] -= t * v[i], v[i]);\n }\n if (u[0] < 0)\n rep(i, 3) u[i] = -u[i];\n x = u[1], y = u[2];\n return u[0];\n }\n ModInt inv() const {\n ll x, y;\n extgcd(v, mod, x, y);\n return make(normS(x + mod));\n }\n bool operator==(const ModInt &b) const { return v == b.v; }\n bool operator!=(const ModInt &b) const { return v != b.v; }\n friend istream &operator>>(istream &o, ModInt &x) {\n ll tmp;\n o >> tmp;\n x = ModInt(tmp);\n return o;\n }\n friend ostream &operator<<(ostream &o, const ModInt &x) { return o << x.v; }\n};\nusing mint = ModInt<1000000007>;\n\nbool B(int x, int i) { return (x >> i) & 1; }\n\nint N, M;\nmint dp0[1 << 15], dp1[1 << 15];\nmint p2[10000];\nmint pinv2[10000];\nint x[10000], y[10000];\nint in[1 << 15];\nint _in(int S) {\n int res = 0;\n rep(i, M) if (B(S, x[i]) && B(S, y[i])) res++;\n return res;\n}\nint cut(int S, int T) { return in[S + T] - in[S] - in[T]; }\n\nint main() {\n p2[0] = 1;\n rep1(i, 9999) p2[i] = p2[i - 1] * 2;\n rep(i, 10000) pinv2[i] = mint(1) \/ p2[i];\n cin >> N >> M;\n rep(i, M) {\n cin >> x[i] >> y[i];\n x[i]--, y[i]--;\n }\n rep(S, 1 << N) in[S] = _in(S);\n rep(S, 1 << N) if (B(S, 0)) {\n dp0[S] = mint(1);\n for (int T = (S - 1) & S; T > 0; T = (T - 1) & S)\n if (B(T, 0)) {\n dp0[S] -= dp0[T] * pinv2[cut(T, S - T)];\n }\n }\n rep(S, 1 << N) if (B(S, 0)) { dp0[S] \/= p2[cut(S, (1 << N) - 1 - S)]; }\n\n rep(S, 1 << N) if (B(S, 1)) {\n dp1[S] = mint(1);\n for (int T = (S - 1) & S; T > 0; T = (T - 1) & S)\n if (B(T, 1)) {\n dp1[S] -= dp1[T] * pinv2[cut(T, S - T)];\n }\n }\n rep(S, 1 << N) if (B(S, 1)) { dp1[S] \/= p2[cut(S, (1 << N) - 1 - S)]; }\n\n mint ans = 1;\n rep(S, 1 << N) if (B(S, 0)) {\n int S2 = S;\n rep(i, M) {\n if (B(S, x[i]))\n S2 |= 1 << y[i];\n if (B(S, y[i]))\n S2 |= 1 << x[i];\n }\n int Tup = (1 << N) - 1 - S2;\n for (int T = Tup; T > 0; T = (T - 1) & Tup)\n if (B(T, 1)) {\n ans -= dp0[S] * dp1[T];\n }\n }\n ans *= p2[M];\n cout << ans << endl;\n}\n","change":"replace","i1":84,"i2":116,"j1":84,"j2":118,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03513","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n\ntemplate <class T> inline void read(T &res) {\n char ch;\n while (ch = getchar(), !isdigit(ch))\n ;\n res = ch ^ 48;\n while (ch = getchar(), isdigit(ch))\n res = res * 10 + ch - 48;\n}\n\nconst int N = 20;\nconst int M = 1005;\nconst int S = 1 << 15;\nconst int mod = 1e9 + 7;\nint ex[M], f1[S], f2[S], cnt1[S], cnt2[S], g[S];\nint n, m, id;\nbool vis[N][N];\n\ninline void add(int &x, int y) {\n x += y;\n x >= mod ? x -= mod : 0;\n}\n\ninline void dec(int &x, int y) {\n x -= y;\n x < 0 ? x += mod : 0;\n}\n\nint main() {\n read(n);\n read(m);\n read(id);\n ex[0] = 1;\n for (int i = 1, u, v; i <= m; ++i) {\n ex[i] = ex[i - 1];\n add(ex[i], ex[i - 1]);\n read(u);\n read(v);\n vis[u][v] = vis[v][u] = true;\n }\n const int C = (1 << n) - 1;\n for (int i = 1; i <= C; ++i)\n for (int j = 1; j <= n; ++j)\n if (1 << j - 1 & i)\n for (int k = j + 1; k <= n; ++k)\n if ((1 << k - 1 & i) && vis[j][k])\n ++cnt1[i];\n for (int i = 1; i <= C; ++i)\n for (int j = 1; j <= n; ++j)\n if (!(1 << j - 1 & i))\n for (int k = 1; k <= n; ++k)\n if ((1 << k - 1 & i) && vis[j][k])\n ++cnt2[i], g[i] |= 1 << j - 1;\n f1[1] = 1;\n for (int i = 2; i <= C; ++i)\n if (i & 1) {\n f1[i] = ex[cnt1[i]];\n for (int j = i - 1 & i; j; j = j - 1 & i)\n if (j & 1)\n dec(f1[i], 1ll * f1[j] * ex[cnt1[i ^ j]] % mod);\n }\n f2[2] = 1;\n for (int i = 3; i <= C; ++i)\n if (i >> 1 & 1) {\n f2[i] = ex[cnt1[i]];\n for (int j = i - 1 & i; j; j = j - 1 & i)\n if (j >> 1 & 1)\n dec(f2[i], 1ll * f2[j] * ex[cnt1[i ^ j]] % mod);\n }\n int ans = ex[m];\n for (int i = 1; i <= C; ++i)\n if (i & 1) {\n int ti = C ^ i ^ g[i];\n for (int j = ti; j; j = j - 1 & ti)\n if (j >> 1 & 1)\n dec(ans, 1ll * f1[i] * f2[j] % mod *\n ex[m - cnt1[i] - cnt1[j] - cnt2[i] - cnt2[j]] % mod);\n }\n printf(\"%d\\\\n\", ans);\n return 0;\n}","fail":"#include <bits\/stdc++.h>\n\ntemplate <class T> inline void read(T &res) {\n char ch;\n while (ch = getchar(), !isdigit(ch))\n ;\n res = ch ^ 48;\n while (ch = getchar(), isdigit(ch))\n res = res * 10 + ch - 48;\n}\n\nconst int N = 20;\nconst int M = 1005;\nconst int S = 1 << 15;\nconst int mod = 1e9 + 7;\nint ex[M], f1[S], f2[S], cnt1[S], cnt2[S], g[S];\nint n, m, id;\nbool vis[N][N];\n\ninline void add(int &x, int y) {\n x += y;\n x >= mod ? x -= mod : 0;\n}\n\ninline void dec(int &x, int y) {\n x -= y;\n x < 0 ? x += mod : 0;\n}\n\nint main() {\n read(n);\n read(m);\n ex[0] = 1;\n for (int i = 1, u, v; i <= m; ++i) {\n ex[i] = ex[i - 1];\n add(ex[i], ex[i - 1]);\n read(u);\n read(v);\n vis[u][v] = vis[v][u] = true;\n }\n const int C = (1 << n) - 1;\n for (int i = 1; i <= C; ++i)\n for (int j = 1; j <= n; ++j)\n if (1 << j - 1 & i)\n for (int k = j + 1; k <= n; ++k)\n if ((1 << k - 1 & i) && vis[j][k])\n ++cnt1[i];\n for (int i = 1; i <= C; ++i)\n for (int j = 1; j <= n; ++j)\n if (!(1 << j - 1 & i))\n for (int k = 1; k <= n; ++k)\n if ((1 << k - 1 & i) && vis[j][k])\n ++cnt2[i], g[i] |= 1 << j - 1;\n f1[1] = 1;\n for (int i = 2; i <= C; ++i)\n if (i & 1) {\n f1[i] = ex[cnt1[i]];\n for (int j = i - 1 & i; j; j = j - 1 & i)\n if (j & 1)\n dec(f1[i], 1ll * f1[j] * ex[cnt1[i ^ j]] % mod);\n }\n f2[2] = 1;\n for (int i = 3; i <= C; ++i)\n if (i >> 1 & 1) {\n f2[i] = ex[cnt1[i]];\n for (int j = i - 1 & i; j; j = j - 1 & i)\n if (j >> 1 & 1)\n dec(f2[i], 1ll * f2[j] * ex[cnt1[i ^ j]] % mod);\n }\n int ans = ex[m];\n for (int i = 1; i <= C; ++i)\n if (i & 1) {\n int ti = C ^ i ^ g[i];\n for (int j = ti; j; j = j - 1 & ti)\n if (j >> 1 & 1)\n dec(ans, 1ll * f1[i] * f2[j] % mod *\n ex[m - cnt1[i] - cnt1[j] - cnt2[i] - cnt2[j]] % mod);\n }\n printf(\"%d\\\\n\", ans);\n return 0;\n}","change":"delete","i1":32,"i2":33,"j1":32,"j2":32,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03513","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n#include <ext\/pb_ds\/assoc_container.hpp>\n#include <ext\/pb_ds\/tree_policy.hpp>\n\nusing namespace std;\nusing namespace __gnu_pbds;\n\n#define fi first\n#define se second\n#define mp make_pair\n#define pb push_back\n\ntypedef long long ll;\ntypedef pair<int, int> ii;\ntypedef vector<int> vi;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef tree<ii, null_type, less<ii>, rb_tree_tag,\n tree_order_statistics_node_update>\n pbds;\n\nvector<int> fact;\nvector<int> ifact;\nvector<int> inv;\nvector<int> pow2;\nconst int MOD = (1e9 + 7);\nint add(int a, int b) {\n a += b;\n while (a >= MOD)\n a -= MOD;\n return a;\n}\nvoid radd(int &a, int b) { a = add(a, b); }\nint mult(int a, int b) { return (a * 1LL * b) % MOD; }\nvoid rmult(int &a, int b) { a = mult(a, b); }\nint modpow(int a, int b) {\n int r = 1;\n while (b) {\n if (b & 1)\n r = mult(r, a);\n a = mult(a, a);\n b >>= 1;\n }\n return r;\n}\nint choose(int a, int b) {\n if (a < b)\n return 0;\n if (b == 0)\n return 1;\n if (a == b)\n return 1;\n return mult(fact[a], mult(ifact[b], ifact[a - b]));\n}\nint inverse(int a) { return modpow(a, MOD - 2); }\nvoid init(int _n) {\n fact.clear();\n ifact.clear();\n inv.clear();\n pow2.clear();\n fact.resize(_n + 1);\n ifact.resize(_n + 1);\n inv.resize(_n + 1);\n pow2.resize(_n + 1);\n pow2[0] = 1;\n ifact[0] = 1;\n fact[0] = 1;\n for (int i = 1; i <= _n; i++) {\n pow2[i] = add(pow2[i - 1], pow2[i - 1]);\n fact[i] = mult(fact[i - 1], i);\n \/\/ ifact[i]=mult(ifact[i-1],inv[i]);\n }\n ifact[_n] = inverse(fact[_n]);\n for (int i = _n - 1; i >= 1; i--) {\n ifact[i] = mult(ifact[i + 1], i + 1);\n }\n for (int i = 1; i <= _n; i++) {\n inv[i] = mult(fact[i - 1], ifact[i]);\n }\n}\n\nint adj[18][18];\nint dp[1700000];\nint reach[2][(1 << 16)];\nint n, m;\nint p3[18];\nint cntadj[15000000];\n\nint solve(int u, int bit) {\n if (!(bit & (1 << u)))\n return 0;\n if (reach[u][bit] != -1)\n return reach[u][bit];\n int res = 1;\n vi V;\n for (int i = 0; i < n; i++) {\n if (bit & (1 << i))\n V.pb(i);\n }\n if (bit > 0) {\n for (int j = bit;; j = (bit & (j - 1))) {\n if (j == bit)\n continue;\n int coeff = 1;\n vi VV[2];\n int bb = 0;\n for (int x : V) {\n if (j & (1 << x))\n bb += p3[x]; \/\/ VV[1].pb(x);\n else\n bb += p3[x] * 2; \/\/ VV[0].pb(x);\n }\n coeff = inverse(pow2[cntadj[bb]]);\n radd(res, MOD - mult(coeff, solve(u, j)));\n if (j == 0)\n break;\n }\n }\n return (reach[u][bit] = res);\n}\n\nint V[18];\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n init(1201);\n cin >> n >> m;\n for (int i = 0; i < m; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n adj[u][v] = adj[v][u] = 1;\n }\n p3[0] = 1;\n for (int i = 1; i <= 17; i++)\n p3[i] = p3[i - 1] * 3;\n for (int i = 0; i < 2; i++) {\n memset(reach, -1, sizeof(reach));\n reach[i][(1 << i)] = 1;\n }\n int ans = 0;\n for (int i = 1; i < p3[n]; i++) {\n int cur = i;\n int exv = -1;\n int firstv = -1;\n for (int j = 0; j < n; j++) {\n V[j] = cur % 3;\n cur \/= 3;\n if (V[j] != 0) {\n exv = j;\n firstv = V[j];\n }\n }\n cntadj[i] = cntadj[i - firstv * p3[exv]];\n for (int j = 0; j < n; j++) {\n if (V[j] != 0 && V[j] != firstv) {\n cntadj[i] += adj[exv][j];\n }\n }\n \/*\n if(!V[1].empty())\n {\n cntadj[i]=cntadj[i-p3[V[1][0]]];\n for(int v:V[2])\n {\n cntadj[i]+=adj[v][V[1][0]];\n }\n }\n else if(!V[2].empty())\n {\n cntadj[i]=cntadj[i-p3[V[2][0]]*2];\n for(int v:V[1])\n {\n cntadj[i]+=adj[v][V[2][0]];\n }\n }\n *\/\n \/*\n for(int x:V[1])\n {\n for(int y:V[2])\n {\n cntadj[i]+=adj[x][y];\n }\n }\n *\/\n \/\/ if(i%100000==0) cerr<<\"FINISH \"<<i<<' '<<p3[n]<<'\\\\n';\n }\n \/\/ cerr<<\"HALFWAY DONE\"<<endl;\n for (int i = 0; i < p3[n - 2]; i++) {\n vi V[3];\n V[1].pb(0);\n V[2].pb(1);\n int cur = i;\n int b2 = 0;\n int b1 = 0;\n for (int j = 2; j < n; j++) {\n V[cur % 3].pb(j);\n cur \/= 3;\n }\n for (int x : V[1])\n b1 |= (1 << x);\n for (int x : V[2])\n b2 |= (1 << x);\n int pos = 1;\n for (int x : V[1]) {\n for (int y : V[2]) {\n if (adj[x][y]) {\n pos = 0;\n break;\n }\n }\n }\n if (!pos)\n continue;\n int cnt_edge = 0;\n for (int x : V[0]) {\n for (int y : V[1])\n cnt_edge += adj[x][y];\n for (int y : V[2])\n cnt_edge += adj[x][y];\n }\n ans = add(ans, mult(pow2[m - cnt_edge], mult(solve(0, b1), solve(1, b2))));\n }\n ans = add(pow2[m], MOD - ans);\n cout << ans << '\\\\n';\n}\n","fail":"#include <bits\/stdc++.h>\n#include <ext\/pb_ds\/assoc_container.hpp>\n#include <ext\/pb_ds\/tree_policy.hpp>\n\nusing namespace std;\nusing namespace __gnu_pbds;\n\n#define fi first\n#define se second\n#define mp make_pair\n#define pb push_back\n\ntypedef long long ll;\ntypedef pair<int, int> ii;\ntypedef vector<int> vi;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef tree<ii, null_type, less<ii>, rb_tree_tag,\n tree_order_statistics_node_update>\n pbds;\n\nvector<int> fact;\nvector<int> ifact;\nvector<int> inv;\nvector<int> pow2;\nconst int MOD = (1e9 + 7);\nint add(int a, int b) {\n a += b;\n while (a >= MOD)\n a -= MOD;\n return a;\n}\nvoid radd(int &a, int b) { a = add(a, b); }\nint mult(int a, int b) { return (a * 1LL * b) % MOD; }\nvoid rmult(int &a, int b) { a = mult(a, b); }\nint modpow(int a, int b) {\n int r = 1;\n while (b) {\n if (b & 1)\n r = mult(r, a);\n a = mult(a, a);\n b >>= 1;\n }\n return r;\n}\nint choose(int a, int b) {\n if (a < b)\n return 0;\n if (b == 0)\n return 1;\n if (a == b)\n return 1;\n return mult(fact[a], mult(ifact[b], ifact[a - b]));\n}\nint inverse(int a) { return modpow(a, MOD - 2); }\nvoid init(int _n) {\n fact.clear();\n ifact.clear();\n inv.clear();\n pow2.clear();\n fact.resize(_n + 1);\n ifact.resize(_n + 1);\n inv.resize(_n + 1);\n pow2.resize(_n + 1);\n pow2[0] = 1;\n ifact[0] = 1;\n fact[0] = 1;\n for (int i = 1; i <= _n; i++) {\n pow2[i] = add(pow2[i - 1], pow2[i - 1]);\n fact[i] = mult(fact[i - 1], i);\n \/\/ ifact[i]=mult(ifact[i-1],inv[i]);\n }\n ifact[_n] = inverse(fact[_n]);\n for (int i = _n - 1; i >= 1; i--) {\n ifact[i] = mult(ifact[i + 1], i + 1);\n }\n for (int i = 1; i <= _n; i++) {\n inv[i] = mult(fact[i - 1], ifact[i]);\n }\n}\n\nint ipow2[1111];\n\nint adj[18][18];\nint dp[1700000];\nint reach[2][(1 << 16)];\nint n, m;\nint p3[18];\nint cntadj[15000000];\n\nint solve(int u, int bit) {\n if (!(bit & (1 << u)))\n return 0;\n if (reach[u][bit] != -1)\n return reach[u][bit];\n int res = 1;\n vi V;\n for (int i = 0; i < n; i++) {\n if (bit & (1 << i))\n V.pb(i);\n }\n if (bit > 0) {\n for (int j = bit;; j = (bit & (j - 1))) {\n if (j == bit)\n continue;\n int coeff = 1;\n int bb = 0;\n for (int x : V) {\n if (j & (1 << x))\n bb += p3[x]; \/\/ VV[1].pb(x);\n else\n bb += p3[x] * 2; \/\/ VV[0].pb(x);\n }\n coeff = ipow2[cntadj[bb]];\n radd(res, MOD - mult(coeff, solve(u, j)));\n if (j == 0)\n break;\n }\n }\n return (reach[u][bit] = res);\n}\n\nint V[18];\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n init(1201);\n for (int i = 0; i <= 1000; i++)\n ipow2[i] = inverse(pow2[i]);\n cin >> n >> m;\n for (int i = 0; i < m; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n adj[u][v] = adj[v][u] = 1;\n }\n p3[0] = 1;\n for (int i = 1; i <= 17; i++)\n p3[i] = p3[i - 1] * 3;\n for (int i = 0; i < 2; i++) {\n memset(reach, -1, sizeof(reach));\n reach[i][(1 << i)] = 1;\n }\n int ans = 0;\n for (int i = 1; i < p3[n]; i++) {\n int cur = i;\n int exv = -1;\n int firstv = -1;\n for (int j = 0; j < n; j++) {\n V[j] = cur % 3;\n cur \/= 3;\n if (V[j] != 0) {\n exv = j;\n firstv = V[j];\n }\n }\n cntadj[i] = cntadj[i - firstv * p3[exv]];\n for (int j = 0; j < n; j++) {\n if (V[j] != 0 && V[j] != firstv) {\n cntadj[i] += adj[exv][j];\n }\n }\n \/\/ if(i%100000==0) cerr<<\"FINISH \"<<i<<' '<<p3[n]<<'\\\\n';\n }\n \/\/ cerr<<\"HALFWAY DONE\"<<endl;\n for (int i = 0; i < p3[n - 2]; i++) {\n V[0] = 1;\n V[1] = 2;\n int cur = i;\n int b2 = 2;\n int b1 = 1;\n for (int j = 2; j < n; j++) {\n V[j] = cur % 3;\n if (V[j] == 1)\n b1 |= (1 << j);\n if (V[j] == 2)\n b2 |= (1 << j);\n cur \/= 3;\n }\n int bb = 0;\n for (int j = 0; j < n; j++) {\n if (b1 & (1 << j))\n bb += p3[j];\n if (b2 & (1 << j))\n bb += 2 * p3[j];\n }\n if (cntadj[bb] > 0)\n continue;\n bb = 0;\n for (int j = 0; j < n; j++) {\n if (b1 & (1 << j))\n bb += p3[j];\n else if (b2 & (1 << j))\n bb += p3[j];\n else\n bb += 2 * p3[j];\n }\n \/*\n for(int x:V[0])\n {\n for(int y:V[1]) cnt_edge+=adj[x][y];\n for(int y:V[2]) cnt_edge+=adj[x][y];\n }\n *\/\n int cnt_edge = cntadj[bb];\n ans = add(ans, mult(pow2[m - cnt_edge], mult(solve(0, b1), solve(1, b2))));\n }\n ans = add(pow2[m], MOD - ans);\n cout << ans << '\\\\n';\n}\n","change":"replace","i1":81,"i2":223,"j1":81,"j2":206,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03513","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n#define ll long long\n#define rg register\nusing namespace std;\nconst int MAXN = 35000;\nconst int Mod = 1e9 + 7;\nstruct gao {\n int u, v, Next;\n} Edge[MAXN];\nint Ans, Meet, n, m, Es = 1, First[MAXN], Ban[MAXN];\nint Vis[MAXN];\ninline void Link(rg int u, rg int v) {\n Edge[++Es] = (gao){u, v, First[u]}, First[u] = Es;\n}\ninline void Dfs(rg int Now, rg int Mark) {\n if (Mark == 2 && Vis[Now] == 1)\n Meet = 1;\n Vis[Now] = Mark;\n for (rg int i = First[Now]; i != -1; i = Edge[i].Next)\n if (Vis[Edge[i].v] != Vis[Now] && !Ban[i])\n Dfs(Edge[i].v, Mark);\n}\ninline void Check() {\n for (rg int i = 1; i <= n; i++)\n Vis[i] = 0;\n Meet = 0, Dfs(1, 1), Dfs(2, 2), Ans += Meet;\n}\ninline int Dfs(rg int Now) {\n if (Now > m * 2)\n return Check(), 0;\n Ban[Now] = 0, Ban[Now ^ 1] = 1, Dfs(Now + 2), Ban[Now] = 1, Ban[Now ^ 1] = 0,\n Dfs(Now + 2);\n}\nint main() {\n scanf(\"%d%d\", &n, &m);\n memset(First, -1, sizeof(First));\n for (rg int i = 1, u, v; i <= m; i++)\n scanf(\"%d%d\", &u, &v), Link(u, v), Link(v, u);\n Dfs(2), printf(\"%d\\\\n\", Ans);\n}\n","fail":"#include <bits\/stdc++.h>\n#define ll long long\n#define rg register\nusing namespace std;\nconst int MAXN = 35000;\nconst int Mod = 1e9 + 7;\nstruct gao {\n int A, B;\n} Edge[MAXN];\nint Ans, End, n, m, Two[MAXN] = {1}, A[MAXN], B[MAXN], F[3][MAXN];\nint main() {\n scanf(\"%d%d\", &n, &m), End = (1 << n) - 1;\n for (rg int i = 1; i <= m; i++)\n scanf(\"%d%d\", &Edge[i].A, &Edge[i].B);\n for (rg int i = 1; i <= m; i++)\n Two[i] = (Two[i - 1] << 1) % Mod;\n for (rg int i = 1; i <= End; i++)\n for (rg int j = 1; j <= m; j++) {\n if ((i & (1 << (Edge[j].A - 1))) && (i & (1 << (Edge[j].B - 1))))\n A[i]++;\n if ((i & (1 << (Edge[j].A - 1))) || (i & (1 << (Edge[j].B - 1))))\n B[i]++;\n }\n for (rg int S = 1; S <= End; S++) {\n F[1][S] = Two[A[S]] * (S & 1), F[2][S] = Two[A[S]] * (S >> 1 & 1);\n for (rg int T = (S - 1) & S; T; T = (T - 1) & S) {\n if (T & 1)\n F[1][S] = (F[1][S] - 1ll * F[1][T] * Two[A[S ^ T]]) % Mod;\n if (T & 2)\n F[2][S] = (F[2][S] - 1ll * F[2][T] * Two[A[S ^ T]]) % Mod;\n }\n }\n for (rg int S = 1; S <= End; S++)\n for (rg int T = (End ^ S); T; T = (T - 1) & (End ^ S)) {\n if (A[S] + A[T] != A[S | T] || ~S & 1 || ~T & 2)\n continue;\n Ans = (Ans - 1ll * F[1][S] * F[2][T] % Mod * Two[A[End ^ S ^ T]]) % Mod;\n }\n printf(\"%lld\\\\n\", (1ll * Ans + Two[m] + Mod) % Mod);\n}\n","change":"replace","i1":7,"i2":40,"j1":7,"j2":40,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03513","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <assert.h>\n#include <bitset>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <limits.h>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <string>\n#include <time.h>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#pragma warning(disable : 4996)\n#pragma comment(linker, \"\/STACK:336777216\")\nusing namespace std;\n\n#define mp make_pair\n#define all(x) (x).begin(), (x).end()\n#define ldb ldouble\n\ntypedef tuple<int, int, int> t3;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef double db;\ntypedef long double ldb;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<ll, int> pli;\ntypedef pair<db, db> pdd;\n\nint IT_MAX = 1 << 18;\nint MOD = 1000000007;\nconst int INF = 0x3f3f3f3f;\nconst ll LL_INF = 0x3f3f3f3f3f3f3f3f;\nconst db PI = acos(-1);\nconst db ERR = 1e-10;\n#define szz(x) (int)(x).size()\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define Se second\n#define Fi first\n\nconst int DEB = 0;\nconst int MX = DEB ? 1 << 5 : 1 << 15;\nconst int MM = 1000000007;\n\nint A[MX], B[MX];\n\nint G[15][15];\nint pw2[MX];\nint N, M;\n\nvoid solve(int c, int A[MX]) {\n for (int t = 0; t < MX; t++) {\n if (~t & c)\n continue;\n int cnt = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (t & 1 << i && t & 1 << j)\n cnt += G[i][j];\n }\n }\n A[t] = pw2[cnt];\n for (int u = t; u; u = (u - 1) & t) {\n if (~u & c || u == t)\n continue;\n int v = t ^ u, cnt = 0;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (v & 1 << i && v & 1 << j)\n cnt += G[i][j];\n }\n }\n A[t] = (A[t] - (ll)pw2[cnt] * A[u] % MM + MM) % MM;\n }\n }\n}\n\nint main() {\n pw2[0] = 1;\n for (int i = 1; i < MX; i++)\n pw2[i] = pw2[i - 1] * 2 % MM;\n scanf(\"%d%d\", &N, &M);\n for (int i = 1; i <= M; i++) {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n a--, b--;\n G[a][b] = 1;\n }\n if (G[0][1] || G[1][0])\n return !printf(\"%d\\\\n\", pw2[M]);\n solve(1, A);\n solve(2, B);\n\n ll ans = 0;\n for (int i = 0; i < MX; i++) {\n for (int j = i; j; j = (j - 1) & i) {\n int p = j, q = i ^ j, r = (MX - 1) ^ i;\n if (~p & 1 || ~q & 2)\n continue;\n int cnt = 0, tp = 1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (r & 1 << i && r & 1 << j)\n cnt += G[i][j];\n if (p & 1 << i && q & 1 << j && (G[i][j] || G[j][i]))\n tp = 0;\n }\n }\n ans = (ans + (ll)tp * pw2[cnt] * A[p] % MM * B[q]) % MM;\n }\n }\n printf(\"%lld\\\\n\", (pw2[M] - ans + MM) % MM);\n}\n","fail":"#include <algorithm>\n#include <assert.h>\n#include <bitset>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <limits.h>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <string>\n#include <time.h>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\n#pragma warning(disable : 4996)\n#pragma comment(linker, \"\/STACK:336777216\")\nusing namespace std;\n\n#define mp make_pair\n#define all(x) (x).begin(), (x).end()\n#define ldb ldouble\n\ntypedef tuple<int, int, int> t3;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef double db;\ntypedef long double ldb;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\ntypedef pair<ll, int> pli;\ntypedef pair<db, db> pdd;\n\nint IT_MAX = 1 << 18;\nint MOD = 1000000007;\nconst int INF = 0x3f3f3f3f;\nconst ll LL_INF = 0x3f3f3f3f3f3f3f3f;\nconst db PI = acos(-1);\nconst db ERR = 1e-10;\n#define szz(x) (int)(x).size()\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define Se second\n#define Fi first\n\nconst int DEB = 0;\nconst int MX = DEB ? 1 << 5 : 1 << 15;\nconst int MM = 1000000007;\n\nint A[MX], B[MX];\n\nint G[15][15];\nint tmp[MX];\nint pw2[MX];\nint N, M;\n\nvoid solve(int c, int A[MX]) {\n for (int t = 0; t < MX; t++) {\n if (~t & c)\n continue;\n int cnt = tmp[t];\n A[t] = pw2[cnt];\n for (int u = t; u; u = (u - 1) & t) {\n if (~u & c || u == t)\n continue;\n int v = t ^ u, cnt = tmp[v];\n A[t] = (A[t] - (ll)pw2[cnt] * A[u] % MM + MM) % MM;\n }\n }\n}\n\nint main() {\n pw2[0] = 1;\n for (int i = 1; i < MX; i++)\n pw2[i] = pw2[i - 1] * 2 % MM;\n scanf(\"%d%d\", &N, &M);\n for (int i = 1; i <= M; i++) {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n a--, b--;\n G[a][b] = 1;\n }\n if (G[0][1] || G[1][0])\n return !printf(\"%d\\\\n\", pw2[M]);\n for (int m = 1; m < MX; m++) {\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (m & 1 << i && m & 1 << j)\n tmp[m] += G[i][j];\n }\n }\n }\n solve(1, A);\n solve(2, B);\n\n ll ans = 0;\n for (int i = 0; i < MX; i++) {\n for (int j = i; j; j = (j - 1) & i) {\n int p = j, q = i ^ j, r = (MX - 1) ^ i;\n if (~p & 1 || ~q & 2)\n continue;\n int cnt = 0, tp = 1;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if (r & 1 << i && r & 1 << j)\n cnt += G[i][j];\n if (p & 1 << i && q & 1 << j && (G[i][j] || G[j][i]))\n tp = 0;\n }\n }\n ans = (ans + (ll)tp * pw2[cnt] * A[p] % MM * B[q]) % MM;\n }\n }\n printf(\"%lld\\\\n\", (pw2[M] - ans + MM) % MM);\n}\n","change":"replace","i1":58,"i2":101,"j1":58,"j2":98,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03513","language":"C++","original_status":"Time Limit Exceeded","pass":"\/\/ #pragma GCC target(\"avx\") \/\/ CPU \u51e6\u7406\u4e26\u5217\u5316\n\/\/ #pragma GCC optimize(\"O3\") \/\/ CPU \u51e6\u7406\u4e26\u5217\u5316\n\/\/ #pragma GCC optimize(\"unroll-loops\") \/\/ \u6761\u4ef6\u51e6\u7406\u306e\u547c\u3073\u51fa\u3057\u3092\u6e1b\u3089\u3059\n\/\/ #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =\n\/\/ malloc(size);void * stack_extend_origin_memory_;char *\n\/\/ stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long\n\/\/ long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm\n\/\/ volatile(\"mov %%rsp, %%rbx\\\\nmov %%rax,\n\/\/ %%rsp\":\"=b\"(stack_extend_origin_memory_):\"a\"((char*)stack_extend_memory_+(size)-1024));\n\/\/ #define END_STACK_EXTEND asm volatile(\"mov %%rax,\n\/\/ %%rsp\"::\"a\"(stack_extend_origin_memory_));free(stack_extend_memory_);\n\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <complex>\n#include <deque>\n#include <map>\n#include <math.h>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <string>\n#include <time.h>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\nusing namespace std;\nconst long long mod = 1000000007;\nconst long long inf = mod * mod;\nconst long long d2 = (mod + 1) \/ 2;\nconst double EPS = 1e-11;\nconst double INF = 1e+10;\nconst double PI = acos(-1.0);\nconst int C_SIZE = 11100000;\nconst int UF_SIZE = 3100000;\nnamespace {\nlong long fact[C_SIZE];\nlong long finv[C_SIZE];\nlong long inv[C_SIZE];\ninline long long Comb(int a, int b) {\n if (a < b || b < 0)\n return 0;\n return fact[a] * finv[b] % mod * finv[a - b] % mod;\n}\nvoid init_C(int n) {\n fact[0] = finv[0] = inv[1] = 1;\n for (int i = 2; i < n; i++) {\n inv[i] = (mod - (mod \/ i) * inv[mod % i] % mod) % mod;\n }\n for (int i = 1; i < n; i++) {\n fact[i] = fact[i - 1] * i % mod;\n finv[i] = finv[i - 1] * inv[i] % mod;\n }\n}\nlong long pw(long long a, long long b) {\n if (a < 0LL)\n return 0;\n if (b < 0LL)\n return 0;\n long long ret = 1;\n while (b) {\n if (b % 2)\n ret = ret * a % mod;\n a = a * a % mod;\n b \/= 2;\n }\n return ret;\n}\nlong long pw_mod(long long a, long long b, long long M) {\n if (a < 0LL)\n return 0;\n if (b < 0LL)\n return 0;\n long long ret = 1;\n while (b) {\n if (b % 2)\n ret = ret * a % M;\n a = a * a % M;\n b \/= 2;\n }\n return ret;\n}\nint pw_mod_int(int a, int b, int M) {\n if (a < 0)\n return 0;\n if (b < 0)\n return 0;\n int ret = 1;\n while (b) {\n if (b % 2)\n ret = (long long)ret * a % M;\n a = (long long)a * a % M;\n b \/= 2;\n }\n return ret;\n}\nint ABS(int a) { return max(a, -a); }\nlong long ABS(long long a) { return max(a, -a); }\ndouble ABS(double a) { return max(a, -a); }\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\nint UF[UF_SIZE];\nvoid init_UF(int n) {\n for (int i = 0; i < n; i++)\n UF[i] = -1;\n}\nint FIND(int a) {\n if (UF[a] < 0)\n return a;\n return UF[a] = FIND(UF[a]);\n}\nvoid UNION(int a, int b) {\n a = FIND(a);\n b = FIND(b);\n if (a == b)\n return;\n if (UF[a] > UF[b])\n swap(a, b);\n UF[a] += UF[b];\n UF[b] = a;\n}\n} \/\/ namespace\n\/\/ \u3053\u3053\u304b\u3089\u7de8\u96c6\u3057\u308d\nlong long dp[1 << 15];\nint p3[16];\nint n;\nint g[20][20];\nint C[16][1 << 15];\nlong long calc(int a) {\n if (~dp[a])\n return dp[a];\n long long ret = 1;\n int t = 0;\n if (!(a & 1))\n t = 1;\n int tmp = a;\n while (tmp) {\n if (tmp != a && (tmp & (1 << t))) {\n int cnt = 0;\n for (int i = 0; i < n; i++) {\n if (!(tmp & (1 << i)))\n continue;\n cnt += C[i][a - tmp];\n }\n ret = (ret + mod - calc(tmp) * pw(d2, cnt) % mod) % mod;\n }\n tmp = (tmp - 1) & a;\n }\n \/\/ printf(\"%d: %lld\\\\n\",a,ret);\n return dp[a] = ret;\n}\nint main() {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n n = a;\n for (int i = 0; i < b; i++) {\n int s, t;\n scanf(\"%d%d\", &s, &t);\n s--;\n t--;\n g[s][t] = g[t][s] = 1;\n }\n for (int i = 0; i < a; i++) {\n for (int j = 0; j < (1 << a); j++) {\n for (int k = 0; k < a; k++) {\n if (j & (1 << k)) {\n if (g[i][k])\n C[i][j]++;\n }\n }\n }\n }\n long long ret = 0;\n p3[0] = 1;\n for (int i = 0; i < (1 << a); i++)\n dp[i] = -1;\n for (int i = 1; i < 16; i++)\n p3[i] = p3[i - 1] * 3;\n for (int i = 0; i < p3[a]; i++) {\n int A = 0;\n int B = 0;\n for (int j = 0; j < a; j++) {\n if (i \/ p3[j] % 3 == 1)\n A += (1 << j);\n if (i \/ p3[j] % 3 == 2)\n B += (1 << j);\n }\n if (!(A & 1))\n continue;\n if (!(B & 2))\n continue;\n bool ok = true;\n int cnt = 0;\n for (int j = 0; j < a; j++) {\n if (!(A & (1 << j)))\n continue;\n if (C[j][B])\n ok = false;\n }\n if (!ok)\n continue;\n for (int j = 0; j < a; j++) {\n if (!(A & (1 << j)))\n continue;\n cnt += C[j][(1 << a) - 1 - A];\n }\n for (int j = 0; j < a; j++) {\n if (!(B & (1 << j)))\n continue;\n cnt += C[j][(1 << a) - 1 - B];\n }\n \/\/ printf(\"%d: %lld\\\\n\",i,pw(d2,cnt)*calc(A)%mod*calc(B)%mod);\n ret = (ret + pw(d2, cnt) * calc(A) % mod * calc(B)) % mod;\n }\n ret = (1 + mod - ret) % mod;\n ret = ret * pw(2, b) % mod;\n printf(\"%lld\\\\n\", ret);\n}","fail":"#pragma GCC target(\"avx\") \/\/ CPU \u51e6\u7406\u4e26\u5217\u5316\n#pragma GCC optimize(\"O3\") \/\/ CPU \u51e6\u7406\u4e26\u5217\u5316\n#pragma GCC optimize(\"unroll-loops\") \/\/ \u6761\u4ef6\u51e6\u7406\u306e\u547c\u3073\u51fa\u3057\u3092\u6e1b\u3089\u3059\n\/\/ #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =\n\/\/ malloc(size);void * stack_extend_origin_memory_;char *\n\/\/ stack_extend_dummy_memory_ = (char*)alloca((1+(int)(((long\n\/\/ long)stack_extend_memory_)&127))*16);*stack_extend_dummy_memory_ = 0;asm\n\/\/ volatile(\"mov %%rsp, %%rbx\\\\nmov %%rax,\n\/\/ %%rsp\":\"=b\"(stack_extend_origin_memory_):\"a\"((char*)stack_extend_memory_+(size)-1024));\n\/\/ #define END_STACK_EXTEND asm volatile(\"mov %%rax,\n\/\/ %%rsp\"::\"a\"(stack_extend_origin_memory_));free(stack_extend_memory_);\n\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <complex>\n#include <deque>\n#include <map>\n#include <math.h>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <string>\n#include <time.h>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\nusing namespace std;\nconst long long mod = 1000000007;\nconst long long inf = mod * mod;\nconst long long d2 = (mod + 1) \/ 2;\nconst double EPS = 1e-11;\nconst double INF = 1e+10;\nconst double PI = acos(-1.0);\nconst int C_SIZE = 11100000;\nconst int UF_SIZE = 3100000;\nnamespace {\nlong long fact[C_SIZE];\nlong long finv[C_SIZE];\nlong long inv[C_SIZE];\ninline long long Comb(int a, int b) {\n if (a < b || b < 0)\n return 0;\n return fact[a] * finv[b] % mod * finv[a - b] % mod;\n}\nvoid init_C(int n) {\n fact[0] = finv[0] = inv[1] = 1;\n for (int i = 2; i < n; i++) {\n inv[i] = (mod - (mod \/ i) * inv[mod % i] % mod) % mod;\n }\n for (int i = 1; i < n; i++) {\n fact[i] = fact[i - 1] * i % mod;\n finv[i] = finv[i - 1] * inv[i] % mod;\n }\n}\nlong long pw(long long a, long long b) {\n if (a < 0LL)\n return 0;\n if (b < 0LL)\n return 0;\n long long ret = 1;\n while (b) {\n if (b % 2)\n ret = ret * a % mod;\n a = a * a % mod;\n b \/= 2;\n }\n return ret;\n}\nlong long pw_mod(long long a, long long b, long long M) {\n if (a < 0LL)\n return 0;\n if (b < 0LL)\n return 0;\n long long ret = 1;\n while (b) {\n if (b % 2)\n ret = ret * a % M;\n a = a * a % M;\n b \/= 2;\n }\n return ret;\n}\nint pw_mod_int(int a, int b, int M) {\n if (a < 0)\n return 0;\n if (b < 0)\n return 0;\n int ret = 1;\n while (b) {\n if (b % 2)\n ret = (long long)ret * a % M;\n a = (long long)a * a % M;\n b \/= 2;\n }\n return ret;\n}\nint ABS(int a) { return max(a, -a); }\nlong long ABS(long long a) { return max(a, -a); }\ndouble ABS(double a) { return max(a, -a); }\nint sig(double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }\nint UF[UF_SIZE];\nvoid init_UF(int n) {\n for (int i = 0; i < n; i++)\n UF[i] = -1;\n}\nint FIND(int a) {\n if (UF[a] < 0)\n return a;\n return UF[a] = FIND(UF[a]);\n}\nvoid UNION(int a, int b) {\n a = FIND(a);\n b = FIND(b);\n if (a == b)\n return;\n if (UF[a] > UF[b])\n swap(a, b);\n UF[a] += UF[b];\n UF[b] = a;\n}\n} \/\/ namespace\n\/\/ \u3053\u3053\u304b\u3089\u7de8\u96c6\u3057\u308d\nlong long dp[1 << 15];\nint p3[16];\nint n;\nint g[20][20];\nint C[16][1 << 15];\nlong long calc(int a) {\n if (~dp[a])\n return dp[a];\n long long ret = 1;\n int t = 0;\n if (!(a & 1))\n t = 1;\n int tmp = a;\n while (tmp) {\n if (tmp != a && (tmp & (1 << t))) {\n int cnt = 0;\n for (int i = 0; i < n; i++) {\n if (!(tmp & (1 << i)))\n continue;\n cnt += C[i][a - tmp];\n }\n ret = (ret + mod - calc(tmp) * pw(d2, cnt) % mod) % mod;\n }\n tmp = (tmp - 1) & a;\n }\n \/\/ printf(\"%d: %lld\\\\n\",a,ret);\n return dp[a] = ret;\n}\nint main() {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n n = a;\n for (int i = 0; i < b; i++) {\n int s, t;\n scanf(\"%d%d\", &s, &t);\n s--;\n t--;\n g[s][t] = g[t][s] = 1;\n }\n for (int i = 0; i < a; i++) {\n for (int j = 0; j < (1 << a); j++) {\n for (int k = 0; k < a; k++) {\n if (j & (1 << k)) {\n if (g[i][k])\n C[i][j]++;\n }\n }\n }\n }\n long long ret = 0;\n p3[0] = 1;\n for (int i = 0; i < (1 << a); i++)\n dp[i] = -1;\n for (int i = 1; i < 16; i++)\n p3[i] = p3[i - 1] * 3;\n for (int i = 0; i < p3[a]; i++) {\n int A = 0;\n int B = 0;\n for (int j = 0; j < a; j++) {\n if (i \/ p3[j] % 3 == 1)\n A += (1 << j);\n if (i \/ p3[j] % 3 == 2)\n B += (1 << j);\n }\n if (!(A & 1))\n continue;\n if (!(B & 2))\n continue;\n bool ok = true;\n int cnt = 0;\n for (int j = 0; j < a; j++) {\n if (!(A & (1 << j)))\n continue;\n if (C[j][B])\n ok = false;\n }\n if (!ok)\n continue;\n for (int j = 0; j < a; j++) {\n if (!(A & (1 << j)))\n continue;\n cnt += C[j][(1 << a) - 1 - A];\n }\n for (int j = 0; j < a; j++) {\n if (!(B & (1 << j)))\n continue;\n cnt += C[j][(1 << a) - 1 - B];\n }\n \/\/ printf(\"%d: %lld\\\\n\",i,pw(d2,cnt)*calc(A)%mod*calc(B)%mod);\n ret = (ret + pw(d2, cnt) * calc(A) % mod * calc(B)) % mod;\n }\n ret = (1 + mod - ret) % mod;\n ret = ret * pw(2, b) % mod;\n printf(\"%lld\\\\n\", ret);\n}","change":"replace","i1":0,"i2":3,"j1":0,"j2":3,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cstdio>\nusing namespace std;\nint main() {\n int n, p[100001];\n scanf(\"%d\", &n);\n for (int i = 0; i < 2 * n; i++)\n scanf(\"%d\", &p[i]);\n sort(p, p + n * 2);\n double ans = 0;\n for (int i = 0; i < 2 * n; i++)\n ans += (p[i] * i) \/ (double)(n * 2 - 1);\n printf(\"%.10lf\\\\n\", ans);\n return 0;\n}","fail":"#include <algorithm>\n#include <cstdio>\nusing namespace std;\nint main() {\n long long n, p[1000001];\n scanf(\"%d\", &n);\n for (int i = 0; i < 2 * n; i++)\n scanf(\"%d\", &p[i]);\n sort(p, p + n * 2);\n double ans = 0;\n for (int i = 0; i < 2 * n; i++)\n ans += (p[i] * i) \/ (double)(n * 2 - 1);\n printf(\"%.10lf\\\\n\", ans);\n return 0;\n}","change":"replace","i1":4,"i2":5,"j1":4,"j2":5,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\nint a[111111], n;\nint main() {\n scanf(\"%d\", &n);\n n *= 2;\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n double res = 0;\n for (int i = n - 1; i >= 0; i--) {\n res += a[i] \/ (n - 1.0) * i;\n }\n printf(\"%.12lf\\\\n\", res);\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\nint a[222222], n;\nint main() {\n scanf(\"%d\", &n);\n n *= 2;\n for (int i = 0; i < n; i++)\n scanf(\"%d\", &a[i]);\n sort(a, a + n);\n double res = 0;\n for (int i = n - 1; i >= 0; i--) {\n res += a[i] \/ (n - 1.0) * i;\n }\n printf(\"%.12lf\\\\n\", res);\n return 0;\n}\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#define For(i, a, b) for (i = a; i <= b; i++)\nusing namespace std;\ninline int read() {\n int res = 0;\n bool bo = 0;\n char c;\n while (((c = getchar()) < '0' || c > '9') && c != '-')\n ;\n if (c == '-')\n bo = 1;\n else\n res = c - 48;\n while ((c = getchar()) >= '0' && c <= '9')\n res = (res << 3) + (res << 1) + (c - 48);\n return bo ? ~res + 1 : res;\n}\nconst int N = 1e5 + 5;\nint i, n, p[N];\ndouble ans;\nint main() {\n n = (read() << 1) - 1;\n For(i, 0, n) p[i] = read();\n sort(p, p + n + 1);\n For(i, 0, n) ans += 1.0 * i * p[i] \/ n;\n printf(\"%.10lf\\\\n\", ans);\n return 0;\n}","fail":"#include <algorithm>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <iostream>\n#include <math.h>\n#include <string>\nusing namespace std;\n\nconst int N = 3e5 + 5;\nint n, s[N];\nlong long ans;\n\nvoid init() {\n int i;\n scanf(\"%d\", &n);\n for (i = 1; i <= 2 * n; ++i)\n scanf(\"%d\", &s[i]);\n sort(s + 1, s + 2 * n + 1);\n}\n\nvoid work() {\n int i;\n for (i = 1; i <= 2 * n; ++i)\n ans += 1LL * (i - 1) * s[i];\n printf(\"%.12lf\\\\n\", 1.0 * ans \/ (2 * n - 1));\n}\n\nint main() {\n init();\n work();\n return 0;\n}","change":"replace","i1":1,"i2":30,"j1":1,"j2":31,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#define For(i, a, b) for (i = a; i <= b; i++)\nusing namespace std;\ninline int read() {\n int res = 0;\n bool bo = 0;\n char c;\n while (((c = getchar()) < '0' || c > '9') && c != '-')\n ;\n if (c == '-')\n bo = 1;\n else\n res = c - 48;\n while ((c = getchar()) >= '0' && c <= '9')\n res = (res << 3) + (res << 1) + (c - 48);\n return bo ? ~res + 1 : res;\n}\nconst int N = 1e5 + 5;\nint i, n, p[N];\ndouble ans;\nint main() {\n n = (read() << 1) - 1;\n For(i, 0, n) p[i] = read();\n sort(p, p + n + 1);\n For(i, 0, n) ans += 1.0 * i * p[i] \/ n;\n printf(\"%.10f\\\\n\", ans);\n return 0;\n}","fail":"#include <bits\/stdc++.h>\nusing namespace std;\nlong long ans, n, a[1000001];\nint main() {\n cin >> n;\n for (int i = 0; i < n * 2; i++) {\n cin >> a[i];\n }\n sort(a, a + n * 2);\n for (int i = 0; i < 2 * n; i++) {\n ans += 1 * i * a[i];\n }\n printf(\"%.12lf\\\\n\", 1.0 * ans \/ (2 * n - 1));\n return 0;\n}","change":"replace","i1":0,"i2":30,"j1":0,"j2":13,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\ntypedef long long ll;\nll n, p[100005];\n\nint main() {\n scanf(\"%lld\", &n);\n n *= 2;\n for (int i = 0; i < n; i++)\n scanf(\"%lld\", &p[i]);\n \/\/ calc i=[0, 2n) i*pi\/(2n-1)\n double x = 0;\n sort(p, p + n);\n for (int i = 0; i < n; i++)\n x += p[i] \/ (n - 1.) * i;\n printf(\"%.12lf\\\\n\", x);\n return 0;\n}\n","fail":"#include <algorithm>\n#include <cstdio>\n#include <iostream>\nusing namespace std;\n\ntypedef long long ll;\nll n, p[300005];\n\nint main() {\n scanf(\"%lld\", &n);\n n *= 2;\n for (int i = 0; i < n; i++)\n scanf(\"%lld\", &p[i]);\n \/\/ calc i=[0, 2n) i*pi\/(2n-1)\n double x = 0;\n sort(p, p + n);\n for (int i = 0; i < n; i++)\n x += 1.0 * p[i] \/ (n - 1.) * i;\n printf(\"%.12lf\\\\n\", x);\n return 0;\n}\n","change":"replace","i1":6,"i2":18,"j1":6,"j2":18,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cmath>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <string>\n#include <tuple>\n#include <vector>\nusing namespace std;\nint n, p[100009];\nlong long sum = 0;\nint main() {\n cin >> n;\n n *= 2;\n for (int i = 0; i < n; i++)\n cin >> p[i];\n sort(p, p + n);\n for (int i = 0; i < n; i++) {\n sum += 1LL * i * p[i];\n }\n printf(\"%.15Lf\\\\n\", 1.0L * sum \/ (n - 1));\n return 0;\n}","fail":"#include <algorithm>\n#include <cmath>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <string>\n#include <tuple>\n#include <vector>\nusing namespace std;\nint n, p[200009];\nlong long sum = 0;\nint main() {\n cin >> n;\n n *= 2;\n for (int i = 0; i < n; i++)\n cin >> p[i];\n sort(p, p + n);\n for (int i = 0; i < n; i++) {\n sum += 1LL * i * p[i];\n }\n printf(\"%.15Lf\\\\n\", 1.0L * sum \/ (n - 1));\n return 0;\n}","change":"replace","i1":10,"i2":11,"j1":10,"j2":11,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\nlong long ans, n, a[100001];\nint main() {\n cin >> n;\n for (int i = 0; i < n * 2; i++) {\n cin >> a[i];\n }\n sort(a, a + n * 2);\n for (int i = 0; i < 2 * n; i++) {\n ans += i * a[i];\n }\n printf(\"%.12lf\\\\n\", 1.0 * ans \/ (2 * n - 1));\n return 0;\n}","fail":"#include <bits\/stdc++.h>\nusing namespace std;\nlong long ans, n, a[1000001];\nint main() {\n cin >> n;\n for (int i = 0; i < n * 2; i++) {\n cin >> a[i];\n }\n sort(a, a + n * 2);\n for (int i = 0; i < 2 * n; i++) {\n ans += 1 * i * a[i];\n }\n printf(\"%.12lf\\\\n\", 1.0 * ans \/ (2 * n - 1));\n return 0;\n}","change":"replace","i1":2,"i2":11,"j1":2,"j2":11,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define _rep(i, n) _repl(i, 0, n)\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp(a, b) make_pair((a), (b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(), (x).end()\n#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string) { cout << endl; }\ntemplate <class H, class... T> void _dbg(string s, H h, T... t) {\n int l = s.find(',');\n cout << s.substr(0, l) << \" = \" << h << \", \";\n _dbg(s.substr(l + 1), t...);\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &o, const pair<T, U> &p) {\n o << \"(\" << p.fi << \",\" << p.se << \")\";\n return o;\n}\ntemplate <class T> ostream &operator<<(ostream &o, const vector<T> &v) {\n o << \"[\";\n for (T t : v) {\n o << t << \",\";\n }\n o << \"]\";\n return o;\n}\n\n#define INF 1120000000\n\nint main() {\n int n;\n cin >> n;\n vector<int> p(2 * n);\n rep(i, 2 * n) cin >> p[i];\n\n double ans = 0;\n rep(i, 2 * n) { ans += (2 * n - i - 1.0) \/ (2 * n - 1.0) * p[1 * n - 1 - i]; }\n\n printf(\"%.10f\\\\n\", ans);\n\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define _rep(i, n) _repl(i, 0, n)\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp(a, b) make_pair((a), (b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(), (x).end()\n#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string) { cout << endl; }\ntemplate <class H, class... T> void _dbg(string s, H h, T... t) {\n int l = s.find(',');\n cout << s.substr(0, l) << \" = \" << h << \", \";\n _dbg(s.substr(l + 1), t...);\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &o, const pair<T, U> &p) {\n o << \"(\" << p.fi << \",\" << p.se << \")\";\n return o;\n}\ntemplate <class T> ostream &operator<<(ostream &o, const vector<T> &v) {\n o << \"[\";\n for (T t : v) {\n o << t << \",\";\n }\n o << \"]\";\n return o;\n}\n\n#define INF 1120000000\n\nint main() {\n int n;\n cin >> n;\n vector<int> p(2 * n);\n rep(i, 2 * n) cin >> p[i];\n sort(all(p));\n\n double ans = 0;\n rep(i, 2 * n) { ans += (2 * n - i - 1.0) \/ (2 * n - 1.0) * p[2 * n - 1 - i]; }\n\n printf(\"%.10f\\\\n\", ans);\n\n return 0;\n}\n","change":"replace","i1":40,"i2":43,"j1":40,"j2":44,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#define For(i, a, b) for (i = a; i <= b; i++)\nusing namespace std;\ninline int read() {\n int res = 0;\n bool bo = 0;\n char c;\n while (((c = getchar()) < '0' || c > '9') && c != '-')\n ;\n if (c == '-')\n bo = 1;\n else\n res = c - 48;\n while ((c = getchar()) >= '0' && c <= '9')\n res = (res << 3) + (res << 1) + (c - 48);\n return bo ? ~res + 1 : res;\n}\nconst int N = 1e5 + 5;\nint i, n, p[N];\ndouble ans;\nint main() {\n n = (read() << 1) - 1;\n For(i, 0, n) p[i] = read();\n sort(p, p + n + 1);\n For(i, 0, n) ans += 1.0 * i * p[i] \/ n;\n printf(\"%.10f\\\\n\", ans);\n return 0;\n}","fail":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#define For(i, a, b) for (i = a; i <= b; i++)\nusing namespace std;\ninline int read() {\n int res = 0;\n bool bo = 0;\n char c;\n while (((c = getchar()) < '0' || c > '9') && c != '-')\n ;\n if (c == '-')\n bo = 1;\n else\n res = c - 48;\n while ((c = getchar()) >= '0' && c <= '9')\n res = (res << 3) + (res << 1) + (c - 48);\n return bo ? ~res + 1 : res;\n}\nconst int N = 2e5 + 5;\nint i, n, p[N];\ndouble ans;\nint main() {\n n = (read() << 1) - 1;\n For(i, 0, n) p[i] = read();\n sort(p, p + n + 1);\n For(i, 0, n) ans += 1.0 * i * p[i] \/ n;\n printf(\"%.10lf\\\\n\", ans);\n return 0;\n}","change":"replace","i1":21,"i2":30,"j1":21,"j2":30,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <iomanip>\n#include <iostream>\nusing namespace std;\nint n, a[100009];\nint main() {\n cin >> n;\n for (int i = 0; i < 2 * n; i++)\n cin >> a[i];\n sort(a, a + n);\n long long ret = 0;\n for (int i = 0; i < 2 * n; i++)\n ret += 1LL * a[i] * i;\n cout << fixed << setprecision(15) << 1.0L * ret \/ (2 * n - 1) << endl;\n return 0;\n}","fail":"#include <algorithm>\n#include <iomanip>\n#include <iostream>\nusing namespace std;\nint n, a[200009];\nint main() {\n cin >> n;\n for (int i = 0; i < 2 * n; i++)\n cin >> a[i];\n sort(a, a + 2 * n);\n long long ret = 0;\n for (int i = 0; i < 2 * n; i++)\n ret += 1LL * a[i] * i;\n cout << fixed << setprecision(15) << 1.0L * ret \/ (2 * n - 1) << endl;\n return 0;\n}","change":"replace","i1":4,"i2":10,"j1":4,"j2":10,"error":"WA","stderr":null,"stdout":108.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define rep(i, n) for (lli i = 0; i < (n); i++)\n#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)\nusing namespace std;\nusing lli = long long int;\nint main() {\n double p[100005];\n int n;\n cin >> n;\n rep(i, 2 * n) cin >> p[i];\n sort(p, p + 2 * n, greater<double>());\n double sum = 0;\n rep(i, 2 * n) sum += (2.0 * n - i - 1.0) \/ (2.0 * n - 1.0) * p[i];\n printf(\"%.10f\\\\n\", sum);\n}\n","fail":"#include <bits\/stdc++.h>\n#define rep(i, n) for (lli i = 0; i < (n); i++)\n#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)\nusing namespace std;\nusing lli = long long int;\nint main() {\n double p[200005];\n int n;\n cin >> n;\n rep(i, 2 * n) cin >> p[i];\n sort(p, p + 2 * n, greater<double>());\n double sum = 0;\n rep(i, 2 * n) sum += (2.0 * n - i - 1.0) \/ (2.0 * n - 1.0) * p[i];\n printf(\"%.10f\\\\n\", sum);\n}\n","change":"replace","i1":6,"i2":7,"j1":6,"j2":7,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\n\nconst int MAXN = 1e5 + 5;\n\nint N;\nint a[MAXN];\n\nint main() {\n scanf(\"%d\", &N);\n N *= 2;\n for (int i = 0; i < N; i++)\n scanf(\"%d\", a + i);\n\n sort(a, a + N);\n\n double sol = 0;\n for (int i = 0; i < N; i++)\n sol += (double)i * a[i];\n\n printf(\"%.10lf\\\\n\", sol \/ (N - 1));\n\n return 0;\n}","fail":"#include <bits\/stdc++.h>\nusing namespace std;\n\nconst int MAXN = 2e5 + 5;\n\nint N;\nint a[MAXN];\n\nint main() {\n scanf(\"%d\", &N);\n N *= 2;\n for (int i = 0; i < N; i++)\n scanf(\"%d\", a + i);\n\n sort(a, a + N);\n\n double sol = 0;\n for (int i = 0; i < N; i++)\n sol += (double)i * a[i];\n\n printf(\"%.10lf\\\\n\", sol \/ (N - 1));\n\n return 0;\n}","change":"replace","i1":3,"i2":4,"j1":3,"j2":4,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define N 100005\nusing namespace std;\nlong \/*double*\/ long ans = 0;\nlong long n, a[N];\ntemplate <typename T> inline void read(T &x) {\n int f = 0;\n int orz = 1;\n char c = getchar();\n while (c < '0' || c > '9') {\n if (c == '-')\n orz = -1;\n c = getchar();\n }\n while (c >= '0' && c <= '9') {\n f = (f << 3) + (f << 1) + (c & 15);\n c = getchar();\n }\n f *= orz;\n x = f;\n}\ntemplate <typename T> void write(T x) {\n \/*if (x==INF)\n {\n write(-1);\n return;\n }*\/\n if (x < 0) {\n x = -x;\n putchar('-');\n }\n if (x >= 10)\n write(x \/ 10);\n putchar(x % 10 + '0');\n}\nint main() {\n read(n);\n n = n << 1;\n for (register int i = 1; i <= n; i++)\n read(a[i]);\n sort(a + 1, a + n + 1);\n for (register int i = 1; i <= n; i++)\n ans = ans + (unsigned long long)a[i] * (i - 1);\n \/*ans\/=(n-1);*\/\n printf(\"%.13Lf\", (long double)ans \/ (n - 1));\n putchar('\\\\n');\n return 0;\n}","fail":"#include <bits\/stdc++.h>\n#define N 400005\nusing namespace std;\nlong \/*double*\/ long ans = 0;\nlong long n, a[N];\ntemplate <typename T> inline void read(T &x) {\n int f = 0;\n int orz = 1;\n char c = getchar();\n while (c < '0' || c > '9') {\n if (c == '-')\n orz = -1;\n c = getchar();\n }\n while (c >= '0' && c <= '9') {\n f = (f << 3) + (f << 1) + (c & 15);\n c = getchar();\n }\n f *= orz;\n x = f;\n}\ntemplate <typename T> void write(T x) {\n \/*if (x==INF)\n {\n write(-1);\n return;\n }*\/\n if (x < 0) {\n x = -x;\n putchar('-');\n }\n if (x >= 10)\n write(x \/ 10);\n putchar(x % 10 + '0');\n}\nint main() {\n read(n);\n n = n << 1;\n for (register int i = 1; i <= n; i++)\n read(a[i]);\n sort(a + 1, a + n + 1);\n for (register int i = 1; i <= n; i++)\n ans = ans + (unsigned long long)a[i] * (i - 1);\n \/*ans\/=(n-1);*\/\n printf(\"%.13Lf\", (long double)ans \/ (n - 1));\n putchar('\\\\n');\n return 0;\n}","change":"replace","i1":1,"i2":2,"j1":1,"j2":2,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03514","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000007\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 (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 spair(p) cout << #p << \": \" << p.fi << \" \" << p.se << endl\n#define svec(v) \\\\\n cout << #v << \":\"; \\\\\n rep(kbrni, v.size()) cout << \" \" << v[kbrni]; \\\\\n cout << endl\n#define sset(s) \\\\\n cout << #s << \":\"; \\\\\n each(kbrni, s) cout << \" \" << kbrni; \\\\\n cout << endl\n#define smap(m) \\\\\n cout << #m << \":\"; \\\\\n each(kbrni, m) cout << \" {\" << kbrni.first << \":\" << kbrni.second << \"}\"; \\\\\n cout << endl\n\nusing namespace std;\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 main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n vl p(n);\n rep(i, 2 * n) { cin >> p[i]; }\n sort(all(p));\n double ans = 0;\n vector<double> val(n);\n val[1] = 1;\n srep(i, 1, n + 1) {\n ans += p[i - 1] * val[i];\n val[i + 1] = val[i] * (2 * n - 2 * i) \/ (2 * n - 2 * i + 1);\n }\n srep(i, n + 1, 2 * n + 1) { ans += p[i - 1] * (1.0 - val[2 * n + 1 - i]); }\n printf(\"%.12lf\\\\n\", ans);\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n#define ll long long\n#define INF 1000000005\n#define MOD 1000000007\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 (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 spair(p) cout << #p << \": \" << p.fi << \" \" << p.se << endl\n#define svec(v) \\\\\n cout << #v << \":\"; \\\\\n rep(kbrni, v.size()) cout << \" \" << v[kbrni]; \\\\\n cout << endl\n#define sset(s) \\\\\n cout << #s << \":\"; \\\\\n each(kbrni, s) cout << \" \" << kbrni; \\\\\n cout << endl\n#define smap(m) \\\\\n cout << #m << \":\"; \\\\\n each(kbrni, m) cout << \" {\" << kbrni.first << \":\" << kbrni.second << \"}\"; \\\\\n cout << endl\n\nusing namespace std;\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 main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n vd p(2 * n);\n rep(i, 2 * n) { cin >> p[i]; }\n sort(all(p), greater<ll>());\n double ans = 0;\n srep(i, 1, 2 * n + 1) { ans += p[i - 1] * (2 * n - i) \/ (2 * n - 1); }\n printf(\"%.10f\\\\n\", ans);\n return 0;\n}\n","change":"replace","i1":51,"i2":63,"j1":51,"j2":57,"error":"WA","stderr":null,"stdout":150000.0}
{"problem_id":"p03521","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n#define syosu(x) fixed << setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<double, double> pdd;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<int, P> pip;\ntypedef vector<pip> vip;\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 60;\nconst double pi = acos(-1);\nconst double eps = 1e-10;\nconst ll mod = 1e9 + 7;\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\n\nint n;\nvvi g;\nvl F;\nvvl DP, dp[3];\n\nint dfs(int v) {\n int S = 1;\n dp[0][v][0]++;\n for (int i = 0; i < g[v].size(); i++) {\n int u = g[v][i];\n int T = dfs(u);\n S += T;\n vl a[3];\n a[0] = a[1] = a[2] = vl(n);\n a[0][0]++;\n if (!i) {\n a[0] = DP[u];\n for (int j = 1; j < S; j++)\n a[1][j] = (dp[0][u][j - 1] * 2 + dp[1][u][j - 1]) % mod;\n } else {\n for (int j = 0; j < 3; j++)\n for (int k = 1; k < S; k++)\n for (int l = max(0, k - T); l <= k; l++) {\n (a[j][k] += dp[j][v][l] * DP[u][k - l]) %= mod;\n if (j && l < k)\n (a[j][k] +=\n dp[j - 1][v][l] *\n (dp[0][u][k - l - 1] * (3 - j) +\n dp[1][u][k - l - 1] * (j == 1 ? 1 : mod \/ 2 + 1) % mod)) %= mod;\n }\n }\n dp[0][v] = a[0];\n dp[1][v] = a[1];\n dp[2][v] = a[2];\n }\n for (int i = 0; i < 3; i++)\n for (int j = 0; j < S; j++)\n (DP[v][j] += dp[i][v][j]) %= mod;\n return S;\n}\n\nint main() {\n cin >> n;\n g = vvi(n);\n F = vl(n + 1, 1);\n DP = dp[0] = dp[1] = dp[2] = vvl(n, vl(n));\n for (int i = 1; i < n; i++) {\n int v;\n cin >> v;\n g[v - 1].push_back(i);\n }\n dfs(0);\n ll res = 0;\n for (int i = 1; i <= n; i++)\n F[i] = F[i - 1] * i % mod;\n for (int i = 0; i < n; i++) {\n ll tmp = F[n - i] * DP[0][i] % mod;\n if (i % 2 == 1)\n tmp = (mod - tmp) % mod;\n (res += tmp) %= mod;\n }\n cout << res << endl;\n}","fail":"#include <bits\/stdc++.h>\n#define syosu(x) fixed << setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<double, double> pdd;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<int, P> pip;\ntypedef vector<pip> vip;\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 60;\nconst double pi = acos(-1);\nconst double eps = 1e-10;\nconst ll mod = 1e9 + 7;\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\n\nint n;\nvvi g;\nvl F;\nvvl DP, dp[3];\n\nint dfs(int v) {\n int S = 1;\n dp[0][v][0]++;\n vp b;\n for (int i = 0; i < g[v].size(); i++) {\n int u = g[v][i];\n b.push_back({dfs(u), u});\n }\n sort(b.rbegin(), b.rend());\n for (int i = 0; i < b.size(); i++) {\n int T = b[i].first, u = b[i].second;\n S += T;\n vl a[3];\n a[0] = a[1] = a[2] = vl(n);\n a[0][0]++;\n if (!i) {\n a[0] = DP[u];\n for (int j = 1; j < S; j++)\n a[1][j] = (dp[0][u][j - 1] * 2 + dp[1][u][j - 1]) % mod;\n } else {\n for (int j = 0; j < 3; j++)\n for (int k = 1; k < S; k++)\n for (int l = max(0, k - T); l <= k; l++) {\n (a[j][k] += dp[j][v][l] * DP[u][k - l]) %= mod;\n if (j && l < k)\n (a[j][k] +=\n dp[j - 1][v][l] *\n (dp[0][u][k - l - 1] * (3 - j) +\n dp[1][u][k - l - 1] * (j == 1 ? 1 : mod \/ 2 + 1) % mod)) %= mod;\n }\n }\n dp[0][v] = a[0];\n dp[1][v] = a[1];\n dp[2][v] = a[2];\n }\n for (int i = 0; i < 3; i++)\n for (int j = 0; j < S; j++)\n (DP[v][j] += dp[i][v][j]) %= mod;\n return S;\n}\n\nint main() {\n cin >> n;\n g = vvi(n);\n F = vl(n + 1, 1);\n DP = dp[0] = dp[1] = dp[2] = vvl(n, vl(n));\n for (int i = 1; i < n; i++) {\n int v;\n cin >> v;\n g[v - 1].push_back(i);\n }\n dfs(0);\n ll res = 0;\n for (int i = 1; i <= n; i++)\n F[i] = F[i - 1] * i % mod;\n for (int i = 0; i < n; i++) {\n ll tmp = F[n - i] * DP[0][i] % mod;\n if (i % 2 == 1)\n tmp = (mod - tmp) % mod;\n (res += tmp) %= mod;\n }\n cout << res << endl;\n}","change":"replace","i1":35,"i2":38,"j1":35,"j2":43,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03521","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nconst int MAXN = 2010;\nconst ll MOD = 1000000007;\n\ninline int read() {\n int x = 0, f = 1;\n char ch = getchar();\n for (; !isdigit(ch); ch = getchar())\n if (ch == '-')\n f = -1;\n for (; isdigit(ch); ch = getchar())\n x = (x * 10) + (ch ^ 48);\n return x * f;\n}\n\ninline ll qpow(ll a, ll b) {\n ll res = 1;\n while (b) {\n if (b & 1LL)\n res = res * a % MOD;\n b >>= 1, a = a * a % MOD;\n }\n return res;\n}\n\nint e, st[MAXN], to[MAXN];\nint nxt[MAXN];\ninline void Add(int u, int v) {\n to[++e] = v, nxt[e] = st[u];\n st[u] = e;\n}\n\nint n, fa[MAXN], size[MAXN];\nll dp[MAXN][MAXN][3], inv2;\nll tmp[MAXN][3];\nll fac[MAXN], ans;\n\ninline void update(ll &cur, ll val) {\n cur = cur + val;\n if (cur >= MOD)\n cur -= MOD;\n}\n\nvoid dfs(int u) {\n int i, j, k;\n dp[u][1][0] = 1, size[u] = 1;\n for (i = st[u]; i; i = nxt[i]) {\n int v = to[i];\n dfs(v), size[u] += size[v];\n }\n if (size[u] == 1)\n return;\n for (i = st[u]; i; i = nxt[i]) {\n for (k = size[u]; k >= 1; k--) {\n tmp[k][0] = dp[u][k][0];\n tmp[k][1] = dp[u][k][1];\n tmp[k][2] = dp[u][k][2];\n dp[u][k][0] = dp[u][k][1] = dp[u][k][2] = 0;\n }\n int v = to[i];\n for (k = size[u]; k >= 1; k--) {\n for (j = min(size[v], size[u] - k + 1); j >= 1; j--) {\n if (j + k - 1 != size[u]) {\n update(dp[u][j + k][0], dp[v][j][0] * tmp[k][0] % MOD);\n update(dp[u][j + k][1], dp[v][j][0] * tmp[k][1] % MOD);\n update(dp[u][j + k][2], dp[v][j][0] * tmp[k][2] % MOD);\n update(dp[u][j + k][0], dp[v][j][1] * tmp[k][0] % MOD);\n update(dp[u][j + k][1], dp[v][j][1] * tmp[k][1] % MOD);\n update(dp[u][j + k][2], dp[v][j][1] * tmp[k][2] % MOD);\n update(dp[u][j + k][0], dp[v][j][2] * tmp[k][0] % MOD);\n update(dp[u][j + k][1], dp[v][j][2] * tmp[k][1] % MOD);\n update(dp[u][j + k][2], dp[v][j][2] * tmp[k][2] % MOD);\n }\n update(dp[u][j + k - 1][2], dp[v][j][0] * tmp[k][1] % MOD);\n update(dp[u][j + k - 1][2], dp[v][j][1] * tmp[k][1] % MOD * inv2 % MOD);\n update(dp[u][j + k - 1][1], dp[v][j][0] * tmp[k][0] % MOD * 2 % MOD);\n update(dp[u][j + k - 1][1], dp[v][j][1] * tmp[k][0] % MOD);\n }\n }\n \/*if(u == 1) {\n printf(\":\");\n for(k = 1; k <= size[u]; k++)\n printf(\"(%lld,%lld,%lld) \", dp[u][k][0], dp[u][k][1],\n dp[u][k][2]); printf(\"\\\\n\");\n }*\/\n }\n \/*for(k = 1; k <= size[u]; k++)\n printf(\"(%lld,%lld,%lld) \", dp[u][k][0], dp[u][k][1], dp[u][k][2]);\n printf(\"\\\\n\");*\/\n}\n\nint main() {\n int i;\n\n n = read();\n for (i = 2; i <= n; i++)\n Add(read(), i);\n\n inv2 = qpow(2, MOD - 2);\n dfs(1);\n \/\/ printf(\"%lld\\\\n\", dp[4][1][0]);\n \/\/ printf(\"%lld\\\\n\", dp[3][1][1]);\n \/\/ printf(\"%lld\\\\n\", dp[3][2][0]);\n\n fac[0] = 1;\n for (i = 1; i <= n; i++)\n fac[i] = fac[i - 1] * i % MOD;\n for (i = 0; i < n; i++) {\n int f = i & 1 ? MOD - 1 : 1;\n update(ans,\n f * fac[n - i] % MOD *\n ((dp[1][n - i][0] + dp[1][n - i][1] + dp[1][n - i][2]) % MOD) %\n MOD);\n }\n printf(\"%lld\\\\n\", ans);\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nconst int MAXN = 2010;\nconst ll MOD = 1000000007;\n\ninline int read() {\n int x = 0, f = 1;\n char ch = getchar();\n for (; !isdigit(ch); ch = getchar())\n if (ch == '-')\n f = -1;\n for (; isdigit(ch); ch = getchar())\n x = (x * 10) + (ch ^ 48);\n return x * f;\n}\n\ninline ll qpow(ll a, ll b) {\n ll res = 1;\n while (b) {\n if (b & 1LL)\n res = res * a % MOD;\n b >>= 1, a = a * a % MOD;\n }\n return res;\n}\n\nint e, st[MAXN], to[MAXN];\nint nxt[MAXN];\ninline void Add(int u, int v) {\n to[++e] = v, nxt[e] = st[u];\n st[u] = e;\n}\n\nint n, fa[MAXN], size[MAXN];\nll dp[MAXN][MAXN][3], inv2;\nll tmp[MAXN][3];\nll fac[MAXN], ans;\n\ninline void update(ll &cur, ll val) {\n cur = cur + val;\n if (cur >= MOD)\n cur -= MOD;\n}\n\nvoid dfs(int u) {\n int i, j, k;\n dp[u][1][0] = 1, size[u] = 1;\n for (i = st[u]; i; i = nxt[i]) {\n int v = to[i];\n dfs(v), size[u] += size[v];\n }\n if (size[u] == 1)\n return;\n for (i = st[u]; i; i = nxt[i]) {\n for (k = size[u]; k >= 1; k--) {\n tmp[k][0] = dp[u][k][0];\n tmp[k][1] = dp[u][k][1];\n tmp[k][2] = dp[u][k][2];\n dp[u][k][0] = dp[u][k][1] = dp[u][k][2] = 0;\n }\n int v = to[i];\n for (k = size[u] - size[v] + 1; k >= 1; k--) {\n for (j = size[v]; j >= 1; j--) {\n if (j + k - 1 != size[u]) {\n update(dp[u][j + k][0], dp[v][j][0] * tmp[k][0] % MOD);\n update(dp[u][j + k][1], dp[v][j][0] * tmp[k][1] % MOD);\n update(dp[u][j + k][2], dp[v][j][0] * tmp[k][2] % MOD);\n update(dp[u][j + k][0], dp[v][j][1] * tmp[k][0] % MOD);\n update(dp[u][j + k][1], dp[v][j][1] * tmp[k][1] % MOD);\n update(dp[u][j + k][2], dp[v][j][1] * tmp[k][2] % MOD);\n update(dp[u][j + k][0], dp[v][j][2] * tmp[k][0] % MOD);\n update(dp[u][j + k][1], dp[v][j][2] * tmp[k][1] % MOD);\n update(dp[u][j + k][2], dp[v][j][2] * tmp[k][2] % MOD);\n }\n update(dp[u][j + k - 1][2], dp[v][j][0] * tmp[k][1] % MOD);\n update(dp[u][j + k - 1][2], dp[v][j][1] * tmp[k][1] % MOD * inv2 % MOD);\n update(dp[u][j + k - 1][1], dp[v][j][0] * tmp[k][0] % MOD * 2 % MOD);\n update(dp[u][j + k - 1][1], dp[v][j][1] * tmp[k][0] % MOD);\n }\n }\n \/*if(u == 1) {\n printf(\":\");\n for(k = 1; k <= size[u]; k++)\n printf(\"(%lld,%lld,%lld) \", dp[u][k][0], dp[u][k][1],\n dp[u][k][2]); printf(\"\\\\n\");\n }*\/\n }\n \/*for(k = 1; k <= size[u]; k++)\n printf(\"(%lld,%lld,%lld) \", dp[u][k][0], dp[u][k][1], dp[u][k][2]);\n printf(\"\\\\n\");*\/\n}\n\nint main() {\n int i;\n\n n = read();\n for (i = 2; i <= n; i++)\n Add(read(), i);\n\n inv2 = qpow(2, MOD - 2);\n dfs(1);\n \/\/ printf(\"%lld\\\\n\", dp[4][1][0]);\n \/\/ printf(\"%lld\\\\n\", dp[3][1][1]);\n \/\/ printf(\"%lld\\\\n\", dp[3][2][0]);\n\n fac[0] = 1;\n for (i = 1; i <= n; i++)\n fac[i] = fac[i - 1] * i % MOD;\n for (i = 0; i < n; i++) {\n int f = i & 1 ? MOD - 1 : 1;\n update(ans,\n f * fac[n - i] % MOD *\n ((dp[1][n - i][0] + dp[1][n - i][1] + dp[1][n - i][2]) % MOD) %\n MOD);\n }\n printf(\"%lld\\\\n\", ans);\n return 0;\n}\n","change":"replace","i1":63,"i2":65,"j1":63,"j2":65,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03521","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define show(x) std::cerr << #x << \" = \" << (x) << std::endl\nusing ll = long long;\ntemplate <typename T> constexpr T MOD = static_cast<T>(1000000007);\ntemplate <typename T> constexpr T INF = std::numeric_limits<T>::max() \/ 16;\ntemplate <typename T, T mod = MOD<T>> class ModInt {\nprivate:\n T value;\n static T pow(const T p, const T n) {\n return p < 0 ? pow(mod + p, n)\n : n == 0 ? 1\n : n % 2 == 1 ? pow(p, n - 1) * p % mod\n : pow(p * p % mod, n \/ 2);\n }\n static T inv(const T p) { return pow(p, mod - 2); }\n\npublic:\n ModInt() : value{0} {}\n ModInt(const T val) : value{((val % mod) + mod) % mod} {}\n ModInt(const ModInt<T, mod> &n) : value{n()} {}\n ModInt<T, mod> &operator=(const ModInt<T, mod> &n) {\n return value = n(), (*this);\n }\n ModInt<T, mod> &operator=(const T v) {\n return value = (mod + v % mod) % mod, (*this);\n }\n ModInt<T, mod> operator+() const { return *this; }\n ModInt<T, mod> operator-() const { return ModInt{mod - value}; }\n ModInt<T, mod> operator+(const ModInt<T, mod> &val) const {\n return ModInt{value + val()};\n }\n ModInt<T, mod> operator-(const ModInt<T, mod> &val) const {\n return ModInt{value - val() + mod};\n }\n ModInt<T, mod> operator*(const ModInt<T, mod> &val) const {\n return ModInt{value * val()};\n }\n ModInt<T, mod> operator\/(const ModInt<T, mod> &val) const {\n return ModInt{value * inv(val())};\n }\n ModInt<T, mod> &operator+=(const ModInt<T, mod> &val) {\n return (((value += val()) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator-=(const ModInt<T, mod> &val) {\n return (((value -= val()) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator*=(const ModInt<T, mod> &val) {\n return (((value *= val()) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator\/=(const ModInt<T, mod> &val) {\n return (((value *= inv(val())) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> operator+(const T val) const { return ModInt{value + val}; }\n ModInt<T, mod> operator-(const T val) const { return ModInt{value - val}; }\n ModInt<T, mod> operator*(const T val) const { return ModInt{value * val}; }\n ModInt<T, mod> operator\/(const T val) const {\n return ModInt{value * inv(val)};\n }\n ModInt<T, mod> &operator+=(const T val) {\n return (((value += val) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator-=(const T val) {\n return (((value -= val) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator*=(const T val) {\n return (((value *= val) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator\/=(const T val) {\n return (((value *= inv(val)) %= mod) += mod) %= mod, (*this);\n }\n bool operator==(const ModInt<T, mod> &val) const {\n return value == val.value;\n }\n bool operator!=(const ModInt<T, mod> &val) const { return not(*this == val); }\n bool operator==(const T val) const {\n return value == (mod + val % mod) % mod;\n }\n bool operator!=(const T val) const { return not(*this == val); }\n T operator()() const { return value; }\n};\ntemplate <typename T, T mod>\ninline ModInt<T, mod> operator+(const T val, const ModInt<T, mod> &n) {\n return ModInt<T, mod>{n() + val};\n}\ntemplate <typename T, T mod>\ninline ModInt<T, mod> operator-(const T val, const ModInt<T, mod> &n) {\n return ModInt<T, mod>{-n() + val};\n}\ntemplate <typename T, T mod>\ninline ModInt<T, mod> operator*(const T val, const ModInt<T, mod> &n) {\n return ModInt<T, mod>{n() * val};\n}\ntemplate <typename T, T mod>\ninline ModInt<T, mod> operator\/(const T val, const ModInt<T, mod> &n) {\n return ModInt<T, mod>(val) \/ n;\n}\ntemplate <typename T, T mod>\ninline bool operator==(const T val, const ModInt<T, mod> &n) {\n return n == val;\n}\ntemplate <typename T, T mod>\ninline bool operator!=(const T val, const ModInt<T, mod> &n) {\n return not(val == n);\n}\ntemplate <typename T, T mod>\ninline std::istream &operator>>(std::istream &is, ModInt<T, mod> &n) {\n T v;\n return is >> v, n = v, is;\n}\ntemplate <typename T, T mod>\nstd::ostream &operator<<(std::ostream &os, const ModInt<T, mod> &n) {\n return (os << n());\n}\nusing mint = ModInt<int, MOD<int>>;\nusing mll = ModInt<ll, MOD<ll>>;\nusing Poly = std::vector<mll>;\nPoly operator*(const Poly &p1, const Poly &p2) {\n const int d1 = p1.size() - 1, d2 = p2.size() - 1, d = d1 + d2;\n Poly ans(d, 0);\n for (int i = 0; i <= d1; i++) {\n for (int j = 0; j < d2; j++) {\n ans[i + j] += p1[i] * p2[j];\n }\n }\n return ans;\n}\nPoly operator*(const ll s, const Poly &p2) {\n const int d = p2.size() - 1;\n Poly ans(d + 1, 0);\n for (int i = 0; i <= d; i++) {\n ans[i] = p2[i] * d;\n }\n return ans;\n}\nPoly operator+(const Poly &p1, const Poly &p2) {\n const int d = p1.size() - 1;\n assert(p2.size() == d + 1);\n Poly ans(d + 1, 0);\n for (int i = 0; i <= d; i++) {\n ans[i] = p1[i] + p2[i];\n }\n return ans;\n}\n\nint main() {\n int N;\n std::cin >> N;\n std::vector<std::vector<int>> g(N);\n for (int i = 1, p; i < N; i++) {\n std::cin >> p, g[p - 1].push_back(i);\n }\n \/\/ vi\u4ee5\u4e0b\u306e\u30d1\u30b9\u5206\u5272\u5168\u4f53\u3067\u3001\u6839vi\u306e\u6b21\u6570\u304cj, \u9023\u7d50\u6210\u5206\u6570k\n \/\/ 2^{\u9023\u7d50\u6210\u5206\u6570}\/2^{\u5b64\u7acb\u70b9\u6570} \u306e\u548c\n std::vector<std::vector<Poly>> dp(N,\n std::vector<std::vector<mll>>(3, Poly{1}));\n auto dfs = [&](auto &&self, const int s) -> void {\n for (const int to : g[s]) {\n self(self, to);\n }\n Poly p0{1}, p1{1}, p2{1};\n for (const int to : g[s]) {\n const Poly z = dp[to][0] + dp[to][1] + dp[to][2];\n const Poly o = 2 * dp[to][0] + dp[to][1];\n p0 = p0 * z;\n p1 = p1 * z + p0 * o;\n p2 = p2 * z + p1 * o;\n }\n dp[s][0] = p0 * Poly{0, 1};\n dp[s][1] = p1;\n for (int i = 1; i < p2.size(); i++) {\n p2[i - 1] = p2[i] * (MOD<ll> + 1) \/ 2;\n }\n dp[s][2] = p2;\n };\n dfs(dfs, 0);\n mll p = 1, ans = 0;\n const Poly f = dp[0][0] + dp[0][1] + dp[0][2];\n for (int i = 0; i <= N; i++) {\n ans += (i % 2 == 0 ? p * f[i] : (-p) * f[i]);\n p *= (i + 1);\n }\n std::cout << ans << std::endl;\n return 0;\n}","fail":"#include <bits\/stdc++.h>\n#define show(x) std::cerr << #x << \" = \" << (x) << std::endl\nusing ll = long long;\ntemplate <typename T> constexpr T MOD = static_cast<T>(1000000007);\ntemplate <typename T> constexpr T INF = std::numeric_limits<T>::max() \/ 16;\ntemplate <typename T, T mod = MOD<T>> class ModInt {\nprivate:\n T value;\n static T pow(const T p, const T n) {\n return p < 0 ? pow(mod + p, n)\n : n == 0 ? 1\n : n % 2 == 1 ? pow(p, n - 1) * p % mod\n : pow(p * p % mod, n \/ 2);\n }\n static T inv(const T p) { return pow(p, mod - 2); }\n\npublic:\n ModInt() : value{0} {}\n ModInt(const T val) : value{((val % mod) + mod) % mod} {}\n ModInt(const ModInt<T, mod> &n) : value{n()} {}\n ModInt<T, mod> &operator=(const ModInt<T, mod> &n) {\n return value = n(), (*this);\n }\n ModInt<T, mod> &operator=(const T v) {\n return value = (mod + v % mod) % mod, (*this);\n }\n ModInt<T, mod> operator+() const { return *this; }\n ModInt<T, mod> operator-() const { return ModInt{mod - value}; }\n ModInt<T, mod> operator+(const ModInt<T, mod> &val) const {\n return ModInt{value + val()};\n }\n ModInt<T, mod> operator-(const ModInt<T, mod> &val) const {\n return ModInt{value - val() + mod};\n }\n ModInt<T, mod> operator*(const ModInt<T, mod> &val) const {\n return ModInt{value * val()};\n }\n ModInt<T, mod> operator\/(const ModInt<T, mod> &val) const {\n return ModInt{value * inv(val())};\n }\n ModInt<T, mod> &operator+=(const ModInt<T, mod> &val) {\n return (((value += val()) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator-=(const ModInt<T, mod> &val) {\n return (((value -= val()) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator*=(const ModInt<T, mod> &val) {\n return (((value *= val()) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator\/=(const ModInt<T, mod> &val) {\n return (((value *= inv(val())) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> operator+(const T val) const { return ModInt{value + val}; }\n ModInt<T, mod> operator-(const T val) const { return ModInt{value - val}; }\n ModInt<T, mod> operator*(const T val) const { return ModInt{value * val}; }\n ModInt<T, mod> operator\/(const T val) const {\n return ModInt{value * inv(val)};\n }\n ModInt<T, mod> &operator+=(const T val) {\n return (((value += val) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator-=(const T val) {\n return (((value -= val) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator*=(const T val) {\n return (((value *= val) %= mod) += mod) %= mod, (*this);\n }\n ModInt<T, mod> &operator\/=(const T val) {\n return (((value *= inv(val)) %= mod) += mod) %= mod, (*this);\n }\n bool operator==(const ModInt<T, mod> &val) const {\n return value == val.value;\n }\n bool operator!=(const ModInt<T, mod> &val) const { return not(*this == val); }\n bool operator==(const T val) const {\n return value == (mod + val % mod) % mod;\n }\n bool operator!=(const T val) const { return not(*this == val); }\n T operator()() const { return value; }\n};\ntemplate <typename T, T mod>\ninline ModInt<T, mod> operator+(const T val, const ModInt<T, mod> &n) {\n return ModInt<T, mod>{n() + val};\n}\ntemplate <typename T, T mod>\ninline ModInt<T, mod> operator-(const T val, const ModInt<T, mod> &n) {\n return ModInt<T, mod>{-n() + val};\n}\ntemplate <typename T, T mod>\ninline ModInt<T, mod> operator*(const T val, const ModInt<T, mod> &n) {\n return ModInt<T, mod>{n() * val};\n}\ntemplate <typename T, T mod>\ninline ModInt<T, mod> operator\/(const T val, const ModInt<T, mod> &n) {\n return ModInt<T, mod>(val) \/ n;\n}\ntemplate <typename T, T mod>\ninline bool operator==(const T val, const ModInt<T, mod> &n) {\n return n == val;\n}\ntemplate <typename T, T mod>\ninline bool operator!=(const T val, const ModInt<T, mod> &n) {\n return not(val == n);\n}\ntemplate <typename T, T mod>\ninline std::istream &operator>>(std::istream &is, ModInt<T, mod> &n) {\n T v;\n return is >> v, n = v, is;\n}\ntemplate <typename T, T mod>\nstd::ostream &operator<<(std::ostream &os, const ModInt<T, mod> &n) {\n return (os << n());\n}\nusing mint = ModInt<int, MOD<int>>;\nusing mll = ModInt<ll, MOD<ll>>;\nusing Poly = std::vector<mll>;\nPoly operator*(const Poly &p1, const Poly &p2) {\n const int d1 = p1.size() - 1, d2 = p2.size() - 1, d = d1 + d2;\n Poly ans(d + 1, 0);\n for (int i = 0; i <= d1; i++) {\n for (int j = 0; j <= d2; j++) {\n ans[i + j] += p1[i] * p2[j];\n }\n }\n return ans;\n}\nPoly operator*(const ll s, const Poly &p2) {\n const int d = p2.size() - 1;\n Poly ans(d + 1, 0);\n for (int i = 0; i <= d; i++) {\n ans[i] = p2[i] * s;\n }\n return ans;\n}\nPoly operator+(const Poly &p1, const Poly &p2) {\n const int d1 = p1.size() - 1, d2 = p2.size() - 1, d = std::max(d1, d2);\n Poly ans(d + 1, 0);\n for (int i = 0; i <= d1; i++) {\n ans[i] += p1[i];\n }\n for (int i = 0; i <= d2; i++) {\n ans[i] += p2[i];\n }\n return ans;\n}\ntemplate <typename T, typename A>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T, A> &v) {\n os << \"[\";\n for (const auto &e : v) {\n os << e << \",\";\n }\n return (os << \"]\" << std::endl);\n}\nint main() {\n int N;\n std::cin >> N;\n std::vector<std::vector<int>> g(N);\n for (int i = 1, p; i < N; i++) {\n std::cin >> p, g[p - 1].push_back(i);\n }\n \/\/ vi\u4ee5\u4e0b\u306e\u30d1\u30b9\u5206\u5272\u5168\u4f53\u3067\u3001\u6839vi\u306e\u6b21\u6570\u304cj, \u9023\u7d50\u6210\u5206\u6570k\n \/\/ 2^{\u9023\u7d50\u6210\u5206\u6570}\/2^{\u5b64\u7acb\u70b9\u6570} \u306e\u548c\n std::vector<std::vector<Poly>> dp(N, std::vector<std::vector<mll>>(3));\n auto dfs = [&](auto &&self, const int s) -> void {\n for (const int to : g[s]) {\n self(self, to);\n }\n Poly p0{1}, p1{0}, p2{0};\n for (const int to : g[s]) {\n const Poly z = dp[to][0] + dp[to][1] + dp[to][2];\n const Poly o = 2 * dp[to][0] + dp[to][1];\n auto p0_ = p0, p1_ = p1, p2_ = p2;\n p0 = p0_ * z, p1 = p1_ * z + p0_ * o, p2 = p2_ * z + p1_ * o;\n }\n \/\/ show(s);\n \/\/ show(p0), show(p1), show(p2);\n dp[s][0] = p0 * Poly{0, 1};\n dp[s][1] = p1;\n for (int i = 1; i < p2.size(); i++) {\n p2[i - 1] = p2[i] * (MOD<ll> + 1) \/ 2;\n }\n p2[p2.size() - 1] = 0;\n dp[s][2] = p2;\n };\n dfs(dfs, 0);\n \/\/ show(dp);\n mll p = 1, ans = 0;\n const Poly f = dp[0][0] + dp[0][1] + dp[0][2];\n for (int i = 0; i <= N; i++) {\n ans += ((N - i) % 2 == 0 ? p * f[i] : (-p) * f[i]);\n p *= (i + 1);\n }\n std::cout << ans << std::endl;\n return 0;\n}","change":"replace","i1":118,"i2":179,"j1":118,"j2":190,"error":"-6","stderr":"terminate called after throwing an instance of 'std::length_error'\n what(): cannot create std::vector larger than max_size()\n","stdout":null}
{"problem_id":"p03521","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <deque>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <string>\n#include <vector>\nusing namespace std;\nconst long long mod = 1000000007;\nconst long long inf = mod * mod;\nconst long long d2 = 500000004;\nconst double EPS = 1e-6;\nconst double PI = acos(-1.0);\nint ABS(int a) { return max(a, -a); }\nlong long ABS(long long a) { return max(a, -a); }\nvector<int> g[2100];\nint sz[2100];\nlong long dp[2][2100];\nlong long dp2[3][2100][2100];\nlong long fact[3100];\nvoid solve(int a) {\n int n = g[a].size();\n dp2[0][0][0] = 1;\n for (int i = 0; i < g[a].size(); i++) {\n solve(g[a][i]);\n int T = sz[a];\n sz[a] += sz[g[a][i]];\n for (int j = 0; j <= sz[a]; j++) {\n dp2[0][i + 1][j] = dp2[1][i + 1][j] = dp2[2][i + 1][j] = 0;\n }\n for (int j = 0; j <= T; j++) {\n for (int k = 0; k <= sz[g[a][i]]; k++) {\n dp2[0][i + 1][j + k] =\n (dp2[0][i + 1][j + k] + dp2[0][i][j] * dp[0][k]) % mod;\n dp2[1][i + 1][j + k] =\n (dp2[0][i + 1][j + k] + dp2[0][i][j] * dp[1][k]) % mod;\n dp2[1][i + 1][j + k] =\n (dp2[0][i + 1][j + k] + dp2[1][i][j] * dp[0][k]) % mod;\n dp2[2][i + 1][j + k] =\n (dp2[0][i + 1][j + k] + dp2[1][i][j] * dp[1][k]) % mod;\n dp2[2][i + 1][j + k] =\n (dp2[0][i + 1][j + k] + dp2[2][i][j] * dp[0][k]) % mod;\n }\n }\n }\n for (int i = 0; i <= sz[g[a][i]]; i++) {\n dp[0][i] = (dp2[0][n][i] + dp2[1][n][i] * 2 + dp2[2][n][i]) % mod;\n dp[1][i + 1] = dp2[1][n][i] % mod;\n }\n sz[a]++;\n}\nint main() {\n int a;\n scanf(\"%d\", &a);\n for (int i = 0; i < a - 1; i++) {\n int p;\n scanf(\"%d\", &p);\n p--;\n g[p].push_back(i + 1);\n }\n solve(0);\n long long ret = 0;\n fact[0] = 1;\n for (int i = 1; i < 3100; i++)\n fact[i] = fact[i - 1] * i % mod;\n\n for (int i = 0; i <= a; i++) {\n if (i % 2 == 0)\n ret = (ret + dp[0][i] * fact[a - i] % mod) % mod;\n else\n ret = (ret + mod - dp[0][i] * fact[a - i] % mod) % mod;\n }\n printf(\"%lld\\\\n\", ret);\n}","fail":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <deque>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <string>\n#include <vector>\nusing namespace std;\nconst long long mod = 1000000007;\nconst long long inf = mod * mod;\nconst long long d2 = 500000004;\nconst double EPS = 1e-6;\nconst double PI = acos(-1.0);\nint ABS(int a) { return max(a, -a); }\nlong long ABS(long long a) { return max(a, -a); }\nvector<int> g[2100];\nint sz[2100];\nlong long dp[3][2100][2100];\nlong long dp2[4][2100][4100];\nlong long fact[3100];\nvoid solve(int a) {\n \/\/\t\tprintf(\"%d\\\\n\",a);fflush(stdout);\n int n = g[a].size();\n dp2[0][0][0] = 1;\n for (int i = 0; i < g[a].size(); i++) {\n solve(g[a][i]);\n }\n for (int i = 0; i < g[a].size(); i++) {\n int T = sz[a];\n sz[a] += sz[g[a][i]];\n int to = g[a][i];\n for (int j = 0; j <= sz[a] + 10; j++) {\n dp2[0][i + 1][j] = dp2[1][i + 1][j] = dp2[2][i + 1][j] =\n dp2[3][i + 1][j] = 0;\n }\n for (int j = 0; j <= T; j++) {\n \/\/\tif(a==1&&j<2)printf(\"%d %d: %lld %lld\n \/\/%lld\\\\n\",i,j,dp2[0][i][j],dp2[1][i][j],dp2[2][i][j]);\n\n for (int k = 0; k <= sz[g[a][i]] + 1; k++) {\n dp2[0][i + 1][j + k] =\n (dp2[0][i + 1][j + k] + dp2[0][i][j] * dp[0][to][k]) % mod;\n dp2[1][i + 1][j + k] =\n (dp2[1][i + 1][j + k] + dp2[0][i][j] * dp[1][to][k]) % mod;\n dp2[1][i + 1][j + k] =\n (dp2[1][i + 1][j + k] + dp2[1][i][j] * dp[0][to][k]) % mod;\n dp2[2][i + 1][j + k] =\n (dp2[2][i + 1][j + k] + dp2[2][i][j] * dp[0][to][k]) % mod;\n dp2[2][i + 1][j + k] =\n (dp2[2][i + 1][j + k] + dp2[0][i][j] * dp[2][to][k]) % mod;\n dp2[3][i + 1][j + k] =\n (dp2[3][i + 1][j + k] + dp2[1][i][j] * dp[2][to][k]) % mod;\n dp2[3][i + 1][j + k] =\n (dp2[3][i + 1][j + k] + dp2[2][i][j] * dp[1][to][k]) % mod;\n dp2[3][i + 1][j + k] =\n (dp2[3][i + 1][j + k] + dp2[3][i][j] * dp[0][to][k]) % mod;\n }\n }\n }\n\n \/\/ if(a==1)printf(\"%d %d: %lld %lld\n \/\/ %lld\\\\n\",4,0,dp2[0][4][0],dp2[1][4][0],dp2[2][4][0]); if(a==1)printf(\"%d %d:\n \/\/ %lld %lld %lld\\\\n\",4,1,dp2[0][4][1],dp2[1][4][1],dp2[2][4][1]);\n\n \/\/\tprintf(\"AA\\\\n\");fflush(stdout);\n for (int i = 0; i <= sz[a]; i++) {\n dp[0][a][i] =\n (dp2[0][n][i] + dp2[1][n][i] + dp2[2][n][i] + dp2[3][n][i]) % mod;\n dp[1][a][i + 1] = (dp2[0][n][i] + dp2[1][n][i]) % mod;\n dp[2][a][i + 1] = (dp2[0][n][i] + dp2[2][n][i]) % mod;\n \/\/\t\tif(i<=1)printf(\"%d %d: %lld\n \/\/%lld\\\\n\",a,i,dp[0][a][i],dp[1][a][i]);\n }\n \/\/\tif(sz[a]+1==1)printf(\"%d %d: %lld\n \/\/%lld\\\\n\",a,sz[a]+1,dp[0][a][sz[a]+1],dp[1][a][sz[a]+1]);\n sz[a]++;\n}\nint main() {\n int a;\n scanf(\"%d\", &a);\n for (int i = 0; i < a - 1; i++) {\n int p;\n scanf(\"%d\", &p);\n p--;\n \/\/\tprintf(\"%d %d\\\\n\",i+1,p);fflush(stdout);\n g[p].push_back(i + 1);\n }\n solve(0);\n long long ret = 0;\n fact[0] = 1;\n for (int i = 1; i < 3100; i++)\n fact[i] = fact[i - 1] * i % mod;\n\n for (int i = 0; i <= a; i++) {\n \/\/\tprintf(\"%d: %lld\\\\n\",i,dp[0][0][i]);\n if (i % 2 == 0)\n ret = (ret + dp[0][0][i] * fact[a - i] % mod) % mod;\n else\n ret = (ret + mod - dp[0][0][i] * fact[a - i] % mod) % mod;\n }\n printf(\"%lld\\\\n\", ret);\n}","change":"replace","i1":23,"i2":77,"j1":23,"j2":105,"error":"-11","stderr":null,"stdout":null}
{"problem_id":"p03522","language":"C++","original_status":"Runtime Error","pass":"\/\/ https:\/\/cf17-exhibition-open.contest.atcoder.jp\/tasks\/cf17_exhibition_b\n#include <algorithm>\n#include <cstdio>\nusing namespace std;\n#define N 200020\n#define inf 0x7fffffff\n#define ll long long\nint n, mn[N], add[N], b[N], a[N];\nll ans = 0;\ninline void pushup(int x) { mn[x] = min(mn[x << 1], mn[x << 1 | 1]); }\ninline void pushdown(int x) {\n mn[x << 1] += add[x];\n mn[x << 1 | 1] += add[x];\n add[x << 1] += add[x];\n add[x << 1 | 1] += add[x];\n add[x] = 0;\n}\nvoid build(int v, int l, int r) {\n if (l == r) {\n mn[v] = b[l];\n return;\n }\n int mid = l + r >> 1;\n build(v << 1, l, mid);\n build(v << 1 | 1, mid + 1, r);\n pushup(v);\n}\nvoid ins(int v, int l, int r, int x, int y) {\n if (x > y)\n return;\n if (x <= l && r <= y) {\n add[v]++;\n mn[v]++;\n return;\n }\n int mid = l + r >> 1;\n pushdown(v);\n if (x <= mid)\n ins(v << 1, l, mid, x, y);\n if (mid < y)\n ins(v << 1 | 1, mid + 1, r, x, y);\n pushup(v);\n}\nint query(int v, int l, int r, int x, int y) {\n if (x <= l && r <= y)\n return mn[v];\n int mid = l + r >> 1, s = inf;\n pushdown(v);\n if (x <= mid)\n s = min(s, query(v << 1, l, mid, x, y));\n if (mid < y)\n s = min(s, query(v << 1 | 1, mid + 1, r, x, y));\n}\nint main() {\n scanf(\"%d\", &n);\n for (int i = 1; i <= n; i++)\n scanf(\"%d\", &a[i]), b[i] = a[i];\n sort(b + 1, b + n + 1);\n int nn = unique(b + 1, b + n + 1) - b - 1;\n build(1, 1, nn);\n for (int i = 1; i <= n; i++) {\n int p = lower_bound(b + 1, b + nn + 1, a[i]) - b;\n ans += query(1, 1, nn, p, nn) - a[i];\n ins(1, 1, nn, 1, p - 1);\n }\n printf(\"%lld\\\\n\", ans);\n return 0;\n}","fail":"\/\/ https:\/\/cf17-exhibition-open.contest.atcoder.jp\/tasks\/cf17_exhibition_b\n#include <algorithm>\n#include <cstdio>\nusing namespace std;\n#define N 200020\n#define inf 0x7fffffff\n#define ll long long\nint n, mn[N << 2], add[N << 2], b[N], a[N];\nll ans = 0;\ninline void pushup(int x) { mn[x] = min(mn[x << 1], mn[x << 1 | 1]); }\ninline void pushdown(int x) {\n mn[x << 1] += add[x];\n mn[x << 1 | 1] += add[x];\n add[x << 1] += add[x];\n add[x << 1 | 1] += add[x];\n add[x] = 0;\n}\nvoid build(int v, int l, int r) {\n if (l == r) {\n mn[v] = b[l];\n return;\n }\n int mid = l + r >> 1;\n build(v << 1, l, mid);\n build(v << 1 | 1, mid + 1, r);\n pushup(v);\n}\nvoid ins(int v, int l, int r, int x, int y) {\n if (x > y)\n return;\n if (x <= l && r <= y) {\n add[v]++;\n mn[v]++;\n return;\n }\n int mid = l + r >> 1;\n pushdown(v);\n if (x <= mid)\n ins(v << 1, l, mid, x, y);\n if (mid < y)\n ins(v << 1 | 1, mid + 1, r, x, y);\n pushup(v);\n}\nint query(int v, int l, int r, int x, int y) {\n if (x <= l && r <= y)\n return mn[v];\n int mid = l + r >> 1, s = inf;\n pushdown(v);\n if (x <= mid)\n s = min(s, query(v << 1, l, mid, x, y));\n if (mid < y)\n s = min(s, query(v << 1 | 1, mid + 1, r, x, y));\n return s;\n}\nint main() {\n scanf(\"%d\", &n);\n for (int i = 1; i <= n; i++)\n scanf(\"%d\", &a[i]), b[i] = a[i];\n sort(b + 1, b + n + 1);\n int nn = unique(b + 1, b + n + 1) - b - 1;\n build(1, 1, nn);\n for (int i = 1; i <= n; i++) {\n int p = lower_bound(b + 1, b + nn + 1, a[i]) - b;\n ans += query(1, 1, nn, p, nn) - a[i];\n ins(1, 1, nn, 1, p - 1);\n }\n printf(\"%lld\\\\n\", ans);\n return 0;\n}","change":"replace","i1":7,"i2":52,"j1":7,"j2":53,"error":"0","stderr":null,"stdout":2.0}
{"problem_id":"p03522","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\nconst int N = 1e5 + 5;\nint n, m, a[N], b[N], tree[4 * N], tree2[4 * N], lazy[4 * N];\nll ans;\nvoid initseg(int nd, int l, int r) {\n if (l == r) {\n tree[nd] = b[l];\n tree2[nd] = l;\n return;\n }\n int m = (l + r) \/ 2;\n initseg(nd * 2, l, m);\n initseg(nd * 2 + 1, m + 1, r);\n tree[nd] = tree[nd * 2];\n tree2[nd] = l;\n}\nvoid pushdown(int nd, int l, int r) {\n if (l != r) {\n lazy[nd * 2] += lazy[nd];\n lazy[nd * 2 + 1] += lazy[nd];\n }\n tree[nd] += lazy[nd];\n lazy[nd] = 0;\n}\nP query(int nd, int l, int r, int s, int e) {\n if (r < s || e < l)\n return P(2e9, 2e9);\n pushdown(nd, l, r);\n if (s <= l && r <= e)\n return P(tree[nd], tree2[nd]);\n int m = (l + r) \/ 2;\n P p1 = query(nd * 2, l, m, s, e);\n P p2 = query(nd * 2 + 1, m + 1, r, s, e);\n if (p1.first > p2.first)\n return p2;\n return p1;\n}\nvoid update(int nd, int l, int r, int s, int e) {\n if (r < s || e < l)\n return;\n pushdown(nd, l, r);\n if (s <= l && r <= e) {\n lazy[nd]++;\n pushdown(nd, l, r);\n return;\n }\n int m = (l + r) \/ 2;\n update(nd * 2, l, m, s, e);\n update(nd * 2 + 1, m + 1, r, s, e);\n if (tree[nd * 2] > tree[nd * 2 + 1]) {\n tree[nd] = tree[nd * 2 + 1];\n tree2[nd] = tree2[nd * 2 + 1];\n } else {\n tree[nd] = tree[nd * 2];\n tree2[nd] = tree2[nd * 2];\n }\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> a[i];\n b[i] = a[i];\n }\n sort(b + 1, b + 1 + n);\n m = unique(b + 1, b + 1 + n) - b - 1;\n initseg(1, 1, m);\n for (int i = 1; i <= n; i++) {\n P tp = query(1, 1, m, lower_bound(b + 1, b + 1 + m, a[i]) - b, m);\n ans += (ll)tp.first - a[i];\n if (tp.second == 1)\n continue;\n update(1, 1, m, 1, tp.second - 1);\n }\n cout << ans;\n return 0;\n}","fail":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\nconst int N = 2e5 + 5;\nint n, m, a[N], b[N], tree[4 * N], tree2[4 * N], lazy[4 * N];\nll ans;\nvoid initseg(int nd, int l, int r) {\n if (l == r) {\n tree[nd] = b[l];\n tree2[nd] = l;\n return;\n }\n int m = (l + r) \/ 2;\n initseg(nd * 2, l, m);\n initseg(nd * 2 + 1, m + 1, r);\n tree[nd] = tree[nd * 2];\n tree2[nd] = l;\n}\nvoid pushdown(int nd, int l, int r) {\n if (l != r) {\n lazy[nd * 2] += lazy[nd];\n lazy[nd * 2 + 1] += lazy[nd];\n }\n tree[nd] += lazy[nd];\n lazy[nd] = 0;\n}\nP query(int nd, int l, int r, int s, int e) {\n if (r < s || e < l)\n return P(2e9, 2e9);\n pushdown(nd, l, r);\n if (s <= l && r <= e)\n return P(tree[nd], tree2[nd]);\n int m = (l + r) \/ 2;\n P p1 = query(nd * 2, l, m, s, e);\n P p2 = query(nd * 2 + 1, m + 1, r, s, e);\n if (p1.first > p2.first)\n return p2;\n return p1;\n}\nvoid update(int nd, int l, int r, int s, int e) {\n if (r < s || e < l)\n return;\n pushdown(nd, l, r);\n if (s <= l && r <= e) {\n lazy[nd]++;\n pushdown(nd, l, r);\n return;\n }\n int m = (l + r) \/ 2;\n update(nd * 2, l, m, s, e);\n update(nd * 2 + 1, m + 1, r, s, e);\n if (tree[nd * 2] > tree[nd * 2 + 1]) {\n tree[nd] = tree[nd * 2 + 1];\n tree2[nd] = tree2[nd * 2 + 1];\n } else {\n tree[nd] = tree[nd * 2];\n tree2[nd] = tree2[nd * 2];\n }\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> a[i];\n b[i] = a[i];\n }\n sort(b + 1, b + 1 + n);\n m = unique(b + 1, b + 1 + n) - b - 1;\n initseg(1, 1, m);\n for (int i = 1; i <= n; i++) {\n int plc = lower_bound(b + 1, b + 1 + m, a[i]) - b;\n P tp = query(1, 1, m, plc, m);\n ans += (ll)tp.first - a[i];\n if (plc == 1)\n continue;\n update(1, 1, m, 1, plc - 1);\n }\n cout << ans;\n return 0;\n}","change":"replace","i1":4,"i2":77,"j1":4,"j2":78,"error":"WA","stderr":null,"stdout":2.0}
{"problem_id":"p03522","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define xx first\n#define yy second\n#define mp make_pair\n#define pb push_back\n#define mset(x, y) memset(x, y, sizeof x)\n#define mcpy(x, y) memcpy(x, y, sizeof x)\nusing namespace std;\n\ntypedef long long LL;\ntypedef pair<int, int> pii;\n\ninline int Read() {\n int x = 0, f = 1, c = getchar();\n for (; !isdigit(c); c = getchar())\n if (c == '-')\n f = -1;\n for (; isdigit(c); c = getchar())\n x = x * 10 + c - '0';\n return x * f;\n}\n\nconst int MAXN = 200005;\n\nint n, m, a[MAXN], b[MAXN], tag[MAXN];\npii val[MAXN << 2];\nLL ans;\n\ninline void Build(int x, int l, int r) {\n val[x] = mp(b[l], l);\n if (l == r)\n return;\n int mid = l + r >> 1;\n Build(x << 1, l, mid), Build(x << 1 | 1, mid + 1, r);\n}\n\ninline void Modify(int x, int l, int r, int ql, int qr) {\n if (l == ql && r == qr)\n return (void)(val[x].xx++, tag[x]++);\n if (tag[x])\n val[x << 1].xx += tag[x], tag[x << 1] += tag[x],\n val[x << 1 | 1].xx += tag[x], tag[x << 1 | 1] += tag[x], tag[x] = 0;\n int mid = l + r >> 1;\n if (qr <= mid)\n Modify(x << 1, l, mid, ql, qr);\n else if (ql > mid)\n Modify(x << 1 | 1, mid + 1, r, ql, qr);\n else\n Modify(x << 1, l, mid, ql, mid),\n Modify(x << 1 | 1, mid + 1, r, mid + 1, qr);\n val[x] = min(val[x << 1], val[x << 1 | 1]);\n}\n\ninline pii Query(int x, int l, int r, int ql, int qr) {\n if (l == ql && r == qr)\n return val[x];\n if (tag[x])\n val[x << 1].xx += tag[x], tag[x << 1] += tag[x],\n val[x << 1 | 1].xx += tag[x], tag[x << 1 | 1] += tag[x], tag[x] = 0;\n int mid = l + r >> 1;\n if (qr <= mid)\n return Query(x << 1, l, mid, ql, qr);\n if (ql > mid)\n return Query(x << 1 | 1, mid + 1, r, ql, qr);\n return min(Query(x << 1, l, mid, ql, mid),\n Query(x << 1 | 1, mid + 1, r, mid + 1, qr));\n}\n\nint main() {\n#ifdef wxh010910\n freopen(\"data.in\", \"r\", stdin);\n#endif\n n = Read();\n for (int i = 1; i <= n; i++)\n a[i] = b[i] = Read(), ans -= a[i];\n sort(b + 1, b + n + 1), m = unique(b + 1, b + n + 1) - b - 1, Build(1, 1, m);\n for (int i = 1; i <= n; i++) {\n pii val = Query(1, 1, m, lower_bound(b + 1, b + m + 1, a[i]) - b, m);\n ans += val.xx;\n if (val.yy > 1)\n Modify(1, 1, m, 1, val.yy - 1);\n }\n return printf(\"%lld\\\\n\", ans), 0;\n}\n","fail":"#include <bits\/stdc++.h>\n#define xx first\n#define yy second\n#define mp make_pair\n#define pb push_back\n#define mset(x, y) memset(x, y, sizeof x)\n#define mcpy(x, y) memcpy(x, y, sizeof x)\nusing namespace std;\n\ntypedef long long LL;\ntypedef pair<int, int> pii;\n\ninline int Read() {\n int x = 0, f = 1, c = getchar();\n for (; !isdigit(c); c = getchar())\n if (c == '-')\n f = -1;\n for (; isdigit(c); c = getchar())\n x = x * 10 + c - '0';\n return x * f;\n}\n\nconst int MAXN = 200005;\n\nint n, m, a[MAXN], b[MAXN], tag[MAXN << 2];\npii val[MAXN << 2];\nLL ans;\n\ninline void Build(int x, int l, int r) {\n val[x] = mp(b[l], l);\n if (l == r)\n return;\n int mid = l + r >> 1;\n Build(x << 1, l, mid), Build(x << 1 | 1, mid + 1, r);\n}\n\ninline void Modify(int x, int l, int r, int ql, int qr) {\n if (l == ql && r == qr)\n return (void)(val[x].xx++, tag[x]++);\n if (tag[x])\n val[x << 1].xx += tag[x], tag[x << 1] += tag[x],\n val[x << 1 | 1].xx += tag[x], tag[x << 1 | 1] += tag[x], tag[x] = 0;\n int mid = l + r >> 1;\n if (qr <= mid)\n Modify(x << 1, l, mid, ql, qr);\n else if (ql > mid)\n Modify(x << 1 | 1, mid + 1, r, ql, qr);\n else\n Modify(x << 1, l, mid, ql, mid),\n Modify(x << 1 | 1, mid + 1, r, mid + 1, qr);\n val[x] = min(val[x << 1], val[x << 1 | 1]);\n}\n\ninline pii Query(int x, int l, int r, int ql, int qr) {\n if (l == ql && r == qr)\n return val[x];\n if (tag[x])\n val[x << 1].xx += tag[x], tag[x << 1] += tag[x],\n val[x << 1 | 1].xx += tag[x], tag[x << 1 | 1] += tag[x], tag[x] = 0;\n int mid = l + r >> 1;\n if (qr <= mid)\n return Query(x << 1, l, mid, ql, qr);\n if (ql > mid)\n return Query(x << 1 | 1, mid + 1, r, ql, qr);\n return min(Query(x << 1, l, mid, ql, mid),\n Query(x << 1 | 1, mid + 1, r, mid + 1, qr));\n}\n\nint main() {\n#ifdef wxh010910\n freopen(\"data.in\", \"r\", stdin);\n#endif\n n = Read();\n for (int i = 1; i <= n; i++)\n a[i] = b[i] = Read(), ans -= a[i];\n sort(b + 1, b + n + 1), m = unique(b + 1, b + n + 1) - b - 1, Build(1, 1, m);\n for (int i = 1; i <= n; i++) {\n pii val = Query(1, 1, m, lower_bound(b + 1, b + m + 1, a[i]) - b, m);\n ans += val.xx;\n if (val.yy > 1)\n Modify(1, 1, m, 1, val.yy - 1);\n }\n return printf(\"%lld\\\\n\", ans), 0;\n}\n","change":"replace","i1":24,"i2":25,"j1":24,"j2":25,"error":"0","stderr":null,"stdout":2.0}
{"problem_id":"p03522","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n#define dbg() cerr <<\n#define name(x) (#x) << \": \" << (x) << ' ' <<\n\nusing namespace std;\n\nstruct SegmTree {\n int n;\n vector<int> a, tree, lazy, where;\n SegmTree(const vector<int> a_)\n : n(a_.size()), a(a_), tree(4 * n), lazy(4 * n), where(4 * n) {\n Build(0, 0, n - 1);\n }\n void Recalc(int node) {\n if (tree[2 * node + 1] < tree[2 * node + 2]) {\n tree[node] = tree[2 * node + 1];\n where[node] = where[2 * node + 1];\n } else {\n tree[node] = tree[2 * node + 2];\n where[node] = where[2 * node + 2];\n }\n }\n void Build(int node, int left, int right) {\n if (left == right) {\n tree[node] = a[left];\n where[node] = left;\n return;\n }\n int mid = left + (right - left) \/ 2;\n Build(2 * node + 1, left, mid);\n Build(2 * node + 2, mid + 1, right);\n Recalc(node);\n }\n inline void Add(int node, int val) {\n tree[node] += val;\n lazy[node] += val;\n }\n inline void Propagate(int node) {\n if (lazy[node] == 0)\n return;\n Add(2 * node + 1, lazy[node]);\n Add(2 * node + 2, lazy[node]);\n lazy[node] = 0;\n }\n void Update(int node, int left, int right, int pos) {\n if (pos >= right) {\n Add(node, 1);\n return;\n }\n Propagate(node);\n int mid = left + (right - left) \/ 2;\n Update(2 * node + 1, left, mid, pos);\n if (mid < pos)\n Update(2 * node + 2, mid + 1, right, pos);\n Recalc(node);\n }\n pair<int, int> Query(int node, int left, int right, int pos) {\n if (left >= pos) {\n return make_pair(tree[node], where[node]);\n }\n Propagate(node);\n int mid = left + (right - left) \/ 2;\n pair<int, int> ret = {(int)2e9, -1};\n if (pos <= mid)\n ret = Query(2 * node + 1, left, mid, pos);\n ret = min(ret, Query(2 * node + 2, mid + 1, right, pos));\n return ret;\n }\n pair<int, int> Query(int pos) { return Query(0, 0, n - 1, pos); }\n void Update(int pos) {\n if (pos >= 0)\n Update(0, 0, n - 1, pos);\n }\n};\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int n;\n cin >> n;\n vector<int> a(n);\n for (int &x : a) {\n cin >> x;\n }\n auto b = a;\n sort(b.begin(), b.end());\n b.erase(unique(b.begin(), b.end()), b.end());\n SegmTree st(b);\n long long ans = 0;\n for (int i = 0; i < n; ++i) {\n int pos = find(b.begin(), b.end(), a[i]) - b.begin();\n pair<int, int> val = st.Query(pos);\n ans += val.first - a[i];\n st.Update(val.second - 1);\n }\n cout << ans << endl;\n\n cerr << \"Time elapsed: \" << 1.0 * clock() \/ CLOCKS_PER_SEC << \" s.\\\\n\";\n}","fail":"#include <bits\/stdc++.h>\n#define dbg() cerr <<\n#define name(x) (#x) << \": \" << (x) << ' ' <<\n\nusing namespace std;\n\nstruct SegmTree {\n int n;\n vector<int> a, tree, lazy, where;\n SegmTree(const vector<int> a_)\n : n(a_.size()), a(a_), tree(4 * n), lazy(4 * n), where(4 * n) {\n Build(0, 0, n - 1);\n }\n void Recalc(int node) {\n if (tree[2 * node + 1] < tree[2 * node + 2]) {\n tree[node] = tree[2 * node + 1];\n where[node] = where[2 * node + 1];\n } else {\n tree[node] = tree[2 * node + 2];\n where[node] = where[2 * node + 2];\n }\n }\n void Build(int node, int left, int right) {\n if (left == right) {\n tree[node] = a[left];\n where[node] = left;\n return;\n }\n int mid = left + (right - left) \/ 2;\n Build(2 * node + 1, left, mid);\n Build(2 * node + 2, mid + 1, right);\n Recalc(node);\n }\n inline void Add(int node, int val) {\n tree[node] += val;\n lazy[node] += val;\n }\n inline void Propagate(int node) {\n if (lazy[node] == 0)\n return;\n Add(2 * node + 1, lazy[node]);\n Add(2 * node + 2, lazy[node]);\n lazy[node] = 0;\n }\n void Update(int node, int left, int right, int pos) {\n if (pos >= right) {\n Add(node, 1);\n return;\n }\n Propagate(node);\n int mid = left + (right - left) \/ 2;\n Update(2 * node + 1, left, mid, pos);\n if (mid < pos)\n Update(2 * node + 2, mid + 1, right, pos);\n Recalc(node);\n }\n pair<int, int> Query(int node, int left, int right, int pos) {\n if (left >= pos) {\n return make_pair(tree[node], where[node]);\n }\n Propagate(node);\n int mid = left + (right - left) \/ 2;\n pair<int, int> ret = {(int)2e9, -1};\n if (pos <= mid)\n ret = Query(2 * node + 1, left, mid, pos);\n ret = min(ret, Query(2 * node + 2, mid + 1, right, pos));\n return ret;\n }\n pair<int, int> Query(int pos) { return Query(0, 0, n - 1, pos); }\n void Update(int pos) {\n if (pos >= 0)\n Update(0, 0, n - 1, pos);\n }\n};\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int n;\n cin >> n;\n vector<int> a(n);\n for (int &x : a) {\n cin >> x;\n }\n auto b = a;\n sort(b.begin(), b.end());\n b.erase(unique(b.begin(), b.end()), b.end());\n SegmTree st(b);\n long long ans = 0;\n for (int i = 0; i < n; ++i) {\n int pos = lower_bound(b.begin(), b.end(), a[i]) - b.begin();\n pair<int, int> val = st.Query(pos);\n ans += val.first - a[i];\n st.Update(val.second - 1);\n }\n cout << ans << endl;\n\n cerr << \"Time elapsed: \" << 1.0 * clock() \/ CLOCKS_PER_SEC << \" s.\\\\n\";\n}","change":"replace","i1":91,"i2":92,"j1":91,"j2":92,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03522","language":"C++","original_status":"Runtime Error","pass":"\n#include <algorithm>\n#include <cstdio>\nusing namespace std;\nint n, w[201000], Loc[201000], G[201000];\nstruct point {\n int x, num;\n bool operator<(const point &p) const {\n return x != p.x ? x < p.x : num < p.num;\n }\n} ord[210000];\nvoid RTE() {\n RTE();\n RTE();\n}\nint main() {\n int i, j;\n scanf(\"%d\", &n);\n if (n > 10000) {\n RTE();\n }\n for (i = 1; i <= n; i++) {\n scanf(\"%d\", &w[i]);\n Loc[i] = i;\n G[i] = i;\n ord[i] = {w[i], i};\n }\n sort(ord + 1, ord + n + 1);\n long long res = 0;\n for (i = 1; i <= n; i++) {\n int t = Loc[ord[i].num];\n int M = 0, Mn = 2e9, xx = 0, U = -1;\n for (j = 1; j <= t; j++) {\n if (Mn >= max(0, M - ord[i].x) + (t - j)) {\n Mn = max(0, M - ord[i].x) + (t - j);\n U = max(M, ord[i].x);\n xx = j;\n }\n M = max(M, w[G[j]]);\n }\n w[ord[i].num] = U;\n res += Mn;\n for (j = t; j > xx; j--) {\n swap(G[j - 1], G[j]);\n swap(Loc[G[j - 1]], Loc[G[j]]);\n }\n }\n printf(\"%lld\\\\n\", res);\n}","fail":"#include <algorithm>\n#include <cstdio>\nusing namespace std;\n#define INF ((1 << 30) - 1)\nint n;\nstruct Tree {\n Tree *c1, *c2;\n int L, S, pv;\n Tree(int b, int e) {\n L = 0;\n c1 = c2 = NULL;\n pv = b - 1;\n S = -1 * (e - b + 1);\n }\n Tree GetMax(int b, int e, int s) {\n if (b == s)\n return *this;\n int m = (b + e) >> 1;\n if (!c1) {\n c1 = new Tree(b, m);\n c2 = new Tree(m + 1, e);\n }\n if (m < s)\n return c2->GetMax(m + 1, e, s);\n Tree ret = c1->GetMax(b, m, s);\n if (ret.L < ret.S + c2->L) {\n ret.L = ret.S + c2->L;\n ret.pv = c2->pv;\n }\n ret.S = ret.S + c2->S;\n return ret;\n }\n void Add(int b, int e, int x) {\n if (b == e) {\n S++;\n if (S > 0) {\n L = S;\n pv = b;\n }\n return;\n }\n int m = (b + e) >> 1;\n if (c1 == NULL) {\n c1 = new Tree(b, m);\n c2 = new Tree(m + 1, e);\n }\n if (x <= m)\n c1->Add(b, m, x);\n else\n c2->Add(m + 1, e, x);\n S = c1->S + c2->S;\n L = max(c1->L, c1->S + c2->L);\n pv = c1->pv;\n if (L != c1->L)\n pv = c2->pv;\n }\n int Sum(int b, int e, int x) {\n if (b == x)\n return S;\n int m = (b + e) >> 1, r = 0;\n if (!c1) {\n c1 = new Tree(b, m);\n c2 = new Tree(m + 1, e);\n }\n if (x <= m) {\n r = c2->S + c1->Sum(b, m, x);\n } else {\n r = c2->Sum(m + 1, e, x);\n }\n return r;\n }\n};\nint main() {\n int i, a;\n scanf(\"%d\", &n);\n long long res = 0, SS = 0;\n Tree *Root = new Tree(0, INF);\n for (i = 1; i <= n; i++) {\n scanf(\"%d\", &a);\n Tree rr = Root->GetMax(0, INF, a + 1);\n res += rr.pv - a;\n res += Root->Sum(0, INF, rr.pv + 1) + (INF - rr.pv);\n Root->Add(0, INF, rr.pv);\n SS += rr.pv - a;\n }\n printf(\"%lld\\\\n\", res);\n}","change":"replace","i1":0,"i2":46,"j1":0,"j2":84,"error":"0","stderr":null,"stdout":2.0}
{"problem_id":"p03522","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n#include <ext\/pb_ds\/assoc_container.hpp>\n#include <ext\/pb_ds\/tree_policy.hpp>\n\nusing namespace std;\nusing namespace __gnu_pbds;\n\n#define fi first\n#define se second\n#define mp make_pair\n#define pb push_back\n\ntypedef long long ll;\ntypedef pair<int, int> ii;\ntypedef vector<int> vi;\ntypedef long double ld;\ntypedef tree<ii, null_type, less<ii>, rb_tree_tag,\n tree_order_statistics_node_update>\n pbds;\n\nint a[222222];\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n int n;\n cin >> n;\n for (int i = 0; i < n; i++)\n cin >> a[i];\n vector<int> vec;\n ll ans = 0;\n for (int i = 0; i < n; i++) {\n if (vec.empty() || a[i] >= vec.back()) {\n vec.pb(a[i]);\n continue;\n }\n int mn = int(1e9);\n int aft = i - 1;\n int x = 0;\n for (int j = i - 1; j >= -1; j--) {\n int val = i - 1 - j + max(0, (j >= 0 ? vec[j] : -int(1e9)) - a[i]);\n if (val < mn) {\n mn = val;\n aft = j;\n x = max(0, (j >= 0 ? vec[j] : -int(1e9)) - a[i]);\n }\n }\n vi nw;\n ans += mn;\n for (int j = 0; j <= aft; j++)\n nw.pb(vec[j]);\n nw.pb(a[i] + x);\n for (int j = aft + 1; j < i; j++)\n nw.pb(vec[j]);\n vec = nw;\n }\n cout << ans << '\\\\n';\n}\n","fail":"#include <bits\/stdc++.h>\n#include <ext\/pb_ds\/assoc_container.hpp>\n#include <ext\/pb_ds\/tree_policy.hpp>\n\nusing namespace std;\nusing namespace __gnu_pbds;\n\n#define fi first\n#define se second\n#define mp make_pair\n#define pb push_back\n\ntypedef long long ll;\ntypedef pair<int, int> ii;\ntypedef vector<int> vi;\ntypedef long double ld;\ntypedef tree<ii, null_type, less<ii>, rb_tree_tag,\n tree_order_statistics_node_update>\n pbds;\n\nconst int N = 455555;\nconst int INF = int(1e9);\nint a[N];\n\n\/*\nstruct node\n{\n int v,lazy;\n};\nnode st[N*4];\nvoid build(int id, int l, int r)\n{\n st[id].lazy=0;st[id].v=INF;\n if(r-l>=2)\n {\n int mid=(l+r)>>1;\n build(id*2,l,mid); build(id*2+1,mid,r);\n }\n}\n\nvoid push(int id, int l, int r)\n{\n if(st[id].lazy!=0)\n {\n st[id].v+=st[id].lazy;\n if(r-l>=2)\n {\n st[id*2].lazy+=st[id].lazy;\nst[id*2+1].lazy+=st[id].lazy;\n }\n st[id].lazy=0;\n }\n}\n\nvoid update(int id, int l, int r, int pos, int v)\n{\n push(id,l,r);\n if(pos>=r||pos<l) return ;\n if(r-l<2)\n {\n st[id].v=v; return ;\n }\n int mid=(l+r)>>1;\n update(id*2,l,mid,pos,v); update(id*2+1,mid,r,pos,v);\n st[id].v=min(st[id*2].v,st[id*2+1].v);\n}\n\nvoid updaterange(int id, int l, int r, int ql, int qr, int v)\n{\n push(id,l,r);\n if(ql>=r||l>=qr) return ;\n if(ql<=l&&r<=qr)\n {\n st[id].lazy+=v; push(id,l,r); return ;\n }\n int mid=(l+r)>>1;\n updaterange(id*2,l,mid,ql,qr,v); updaterange(id*2+1,mid,r,ql,qr,v);\n st[id].v=min(st[id*2].v,st[id*2+1].v);\n}\n\nii query(int id, int l, int r, int ql, int qr)\n{\n push(id,l,r);\n if(ql>=r||l>=qr) return mp(INF, -1);\n if(ql<=l&&r<=qr) return mp(st[id].v, l);\n int mid=(l+r)>>1;\n return min(query(id*2,l,mid,ql,qr),query(id*2+1,mid,r,ql,qr));\n}\n*\/\n\nstruct node {\n int prior, siz;\n ii val; \/\/ value stored in the array\n ii sum; \/\/ whatever info you want to maintain in segtree for each node\n int lazy; \/\/ whatever lazy update you want to do\n struct node *l, *r;\n};\n\nnode buffer[555555];\ntypedef node *pnode;\n\nint sz(pnode t) { return t ? t->siz : 0; }\nvoid upd_sz(pnode t) {\n if (t)\n t->siz = sz(t->l) + 1 + sz(t->r);\n}\nvoid lazy(pnode t) {\n if (!t || !t->lazy)\n return;\n t->val.fi += t->lazy; \/\/ operation of lazy\n t->sum.fi += t->lazy;\n if (t->l)\n t->l->lazy += t->lazy; \/\/ propagate lazy\n if (t->r)\n t->r->lazy += t->lazy;\n t->lazy = 0;\n}\nvoid reset(pnode t) {\n if (t)\n t->sum = t->val; \/\/ no need to reset lazy coz when we call this lazy would\n \/\/ itself be propagated\n}\nvoid combine(pnode &t, pnode l, pnode r) { \/\/ combining two ranges of segtree\n if (!l || !r)\n return void(t = l ? l : r);\n t->sum = min(l->sum, r->sum);\n}\nvoid operation(pnode t) { \/\/ operation of segtree\n if (!t)\n return;\n reset(t); \/\/ reset the value of current node assuming it now represents a\n \/\/ single element of the array\n lazy(t->l);\n lazy(t->r); \/\/ imp:propagate lazy before combining t->l,t->r;\n combine(t, t->l, t);\n combine(t, t, t->r);\n}\nvoid split(pnode t, pnode &l, pnode &r, int pos, int add = 0) {\n \/\/ if(pos<0&&add==0){l=NULL; r=t; return ;}\n if (!t)\n return void(l = r = NULL);\n lazy(t);\n int curr_pos = add + sz(t->l);\n if (curr_pos <= pos) \/\/ element at pos goes to left subtree(l)\n split(t->r, t->r, r, pos, curr_pos + 1), l = t;\n else\n split(t->l, l, t->l, pos, add), r = t;\n upd_sz(t);\n operation(t);\n}\nvoid merge(pnode &t, pnode l,\n pnode r) { \/\/ l->leftarray,r->rightarray,t->resulting array\n lazy(l);\n lazy(r);\n if (!l || !r)\n t = l ? l : r;\n else if (l->prior > r->prior)\n merge(l->r, l->r, r), t = l;\n else\n merge(r->l, l, r->l), t = r;\n upd_sz(t);\n operation(t);\n}\n\npnode curnode = &buffer[0];\npnode init(ii val) {\n pnode ret = curnode++;\n ret->prior = rand();\n ret->siz = 1;\n ret->val = val;\n ret->sum = val;\n ret->lazy = 0;\n return ret;\n}\nii range_query(pnode t, int l, int r) { \/\/[l,r]\n if (l > r)\n return mp(INF, -1);\n pnode L, mid, R;\n split(t, L, mid, l - 1);\n split(mid, t, R, r - l); \/\/ note: r-l!!\n ii ans = t->sum;\n merge(mid, L, t);\n merge(t, mid, R);\n return ans;\n}\nvoid range_update(pnode t, int l, int r, ll val) { \/\/[l,r]\n if (l > r)\n return;\n pnode L, mid, R;\n split(t, L, mid, l - 1);\n split(mid, t, R, r - l); \/\/ note: r-l!!\n t->lazy += val; \/\/ lazy_update\n merge(mid, L, t);\n merge(t, mid, R);\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n int n;\n cin >> n;\n for (int i = 0; i < n; i++)\n cin >> a[i];\n pbds T;\n int timer = 0;\n ll ans = 0;\n pnode treap = NULL;\n for (int i = 0; i < n; i++) {\n int aft = T.order_of_key(mp(a[i] + 1, -1)) - 1;\n int mn = i - 1 - aft;\n if (mn == 0) {\n T.insert(mp(a[i], ++timer));\n pnode tmp = init(mp(a[i] - i, a[i]));\n merge(treap, treap, tmp);\n continue;\n }\n int id = aft + 1;\n aft = -1;\n ii X = range_query(treap, id + 1, i - 1);\n if (X.fi + i - 1 - a[i] < mn) {\n mn = X.fi + i - 1 - a[i];\n aft = X.se;\n }\n ans += mn;\n \/\/ cerr<<\"MN : \"<<mn<<\" AFT : \"<<aft<<endl;\n if (aft >= 0) {\n int pos = T.order_of_key(mp(aft + 1, -1));\n range_update(treap, pos, i - 1, -1);\n T.insert(mp(aft, ++timer));\n pnode tmp = init(mp(aft - pos, aft));\n pnode L, R;\n split(treap, L, R, pos - 1);\n merge(L, L, tmp);\n merge(treap, L, R);\n } else {\n aft = a[i];\n int pos = T.order_of_key(mp(aft + 1, -1));\n range_update(treap, pos, i - 1, -1);\n T.insert(mp(aft, ++timer));\n pnode tmp = init(mp(aft - pos, aft));\n pnode L, R;\n split(treap, L, R, pos - 1);\n merge(L, L, tmp);\n merge(treap, L, R);\n }\n \/\/ cerr<<\"MN \"<<mn<<' '<<\"AFT \"<<aft<<'\\\\n';\n }\n cout << ans << '\\\\n';\n}\n","change":"replace","i1":20,"i2":55,"j1":20,"j2":246,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03522","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long lint;\ntypedef long double llf;\ntypedef pair<lint, lint> pi;\nconst int MAXN = 2005, N = MAXN;\nconst int mod = 1e9 + 7, inv2 = (mod + 1) \/ 2;\nint dp[MAXN][3][MAXN], odp[3][MAXN], sz[MAXN];\nvector<int> adj[N];\nvoid sadd(int &x, int y) {\n x += y;\n while (x >= mod)\n x -= mod;\n}\nvoid dfs(int v, int p = -1) {\n dp[v][0][1] = 1;\n sz[v] = 1;\n for (int u : adj[v]) {\n if (u != p) {\n dfs(u, v);\n memcpy(odp, dp[v], sizeof dp[v]);\n memset(dp[v], 0, sizeof dp[v]);\n for (int dv = 0; dv <= 2; ++dv) {\n for (int du = 0; du <= 2; ++du) {\n for (int use = 0; use <= 1; ++use) {\n if (use == 1 && (du > 1 || dv > 1))\n continue;\n for (int cv = 1; cv <= sz[v]; ++cv)\n for (int cu = 1; cu <= sz[u]; ++cu) {\n int ways = (use == 1 ? mod - 1 : 1);\n if (use) {\n if (du == 0 && dv == 0)\n ways = (long long)ways * 2 % mod;\n if (du == 1 && dv == 1)\n ways = (long long)ways * inv2 % mod;\n }\n sadd(dp[v][dv + use][cv + cu - use],\n odp[dv][cv] * (long long)dp[u][du][cu] % mod * ways % mod);\n }\n }\n }\n }\n sz[v] += sz[u];\n }\n }\n}\nint f[N], a[N];\nint main() {\n int n;\n long long res = 0;\n cin >> n;\n for (int j = 0; j < n; ++j)\n cin >> a[j];\n for (int j = 0; j < n; ++j) {\n int best = 2e9;\n for (int i = j; i >= 0; --i) {\n if (max(i == 0 ? 0 : a[i - 1] - a[j], 0) + j - i < best) {\n best = max(i == 0 ? 0 : a[i - 1] - a[j], 0) + j - i;\n }\n }\n for (int i = j; i >= 0; --i) {\n if (max(i == 0 ? 0 : a[i - 1] - a[j], 0) + j - i == best) {\n for (int k = j; k > i; --k) {\n swap(a[k], a[k - 1]);\n }\n a[i] = max(a[i], (i == 0 ? 0 : a[i - 1]));\n }\n }\n res += best;\n }\n cout << res << endl;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long lint;\ntypedef pair<int, int> pi;\nconst int MAXN = 200005;\nconst int MAXT = 530000;\n\nint n, a[MAXN];\nvector<int> v;\n\nstruct seg {\n pi tree[MAXT];\n int lazy[MAXT];\n void init(int s, int e, int p, vector<int> &v) {\n if (s == e) {\n tree[p] = pi(v[s], s);\n return;\n }\n int m = (s + e) \/ 2;\n init(s, m, 2 * p, v);\n init(m + 1, e, 2 * p + 1, v);\n tree[p] = min(tree[2 * p], tree[2 * p + 1]);\n }\n void lazydown(int p) {\n tree[2 * p].first += lazy[p];\n tree[2 * p + 1].first += lazy[p];\n lazy[2 * p] += lazy[p];\n lazy[2 * p + 1] += lazy[p];\n lazy[p] = 0;\n }\n void add(int s, int e, int ps, int pe, int p, int v) {\n if (e < ps || pe < s)\n return;\n if (s <= ps && pe <= e) {\n tree[p].first += v;\n lazy[p] += v;\n return;\n }\n int pm = (ps + pe) \/ 2;\n lazydown(p);\n add(s, e, ps, pm, 2 * p, v);\n add(s, e, pm + 1, pe, 2 * p + 1, v);\n tree[p] = min(tree[2 * p], tree[2 * p + 1]);\n }\n pi query(int s, int e, int ps, int pe, int p) {\n if (e < ps || pe < s)\n return pi(2e9, -1);\n if (s <= ps && pe <= e)\n return tree[p];\n int pm = (ps + pe) \/ 2;\n lazydown(p);\n return min(query(s, e, ps, pm, 2 * p), query(s, e, pm + 1, pe, 2 * p + 1));\n }\n} seg;\n\nint main() {\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++) {\n scanf(\"%d\", &a[i]);\n v.push_back(a[i]);\n }\n sort(v.begin(), v.end());\n v.resize(unique(v.begin(), v.end()) - v.begin());\n seg.init(0, v.size() - 1, 1, v);\n lint ans = 0;\n for (int i = 0; i < n; i++) {\n a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin();\n auto ret = seg.query(a[i], v.size() - 1, 0, v.size() - 1, 1);\n ans += ret.first - v[a[i]];\n seg.add(0, ret.second - 1, 0, v.size() - 1, 1, 1);\n }\n cout << ans << endl;\n}\n","change":"replace","i1":3,"i2":72,"j1":3,"j2":73,"error":"0","stderr":null,"stdout":2.0}
{"problem_id":"p03522","language":"C++","original_status":"Time Limit Exceeded","pass":"\/**\n * author: tourist\n * created: 27.11.2019 18:36:41\n **\/\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n;\n cin >> n;\n vector<int> a(n);\n long long ans = 0;\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n int best_j = -1;\n int best_c = 787788;\n for (int j = 0; j <= i; j++) {\n int cur_c = j + (j == i ? 0 : max(0, a[i - 1 - j] - a[i]));\n if (cur_c < best_c) {\n best_c = cur_c;\n best_j = j;\n }\n }\n ans += best_c;\n if (best_j < i) {\n a[i] = max(a[i], a[i - 1 - best_j]);\n }\n for (int j = 0; j < best_j; j++) {\n swap(a[i - j], a[i - j - 1]);\n }\n }\n cout << ans << '\\\\n';\n return 0;\n}\n","fail":"\/**\n * author: tourist\n * created: 27.11.2019 18:36:41\n **\/\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\nclass segtree {\npublic:\n struct node {\n \/\/ don't forget to set default value (used for leaves)\n \/\/ not necessarily neutral element!\n int mn = 0;\n int add = 0;\n int id = -1;\n\n void apply(int l, int r, int v) {\n mn += v;\n add += v;\n if (l == r) {\n id = l;\n }\n }\n };\n\n node unite(const node &a, const node &b) const {\n node res;\n res.mn = min(a.mn, b.mn);\n res.id = (res.mn == a.mn ? a.id : b.id);\n return res;\n }\n\n inline void push(int x, int l, int r) {\n int y = (l + r) >> 1;\n int z = x + ((y - l + 1) << 1);\n if (tree[x].add != 0) {\n tree[x + 1].apply(l, y, tree[x].add);\n tree[z].apply(y + 1, r, tree[x].add);\n tree[x].add = 0;\n }\n }\n\n inline void pull(int x, int z) { tree[x] = unite(tree[x + 1], tree[z]); }\n\n int n;\n vector<node> tree;\n\n void build(int x, int l, int r) {\n if (l == r) {\n return;\n }\n int y = (l + r) >> 1;\n int z = x + ((y - l + 1) << 1);\n build(x + 1, l, y);\n build(z, y + 1, r);\n pull(x, z);\n }\n\n template <typename M> void build(int x, int l, int r, const vector<M> &v) {\n if (l == r) {\n tree[x].apply(l, r, v[l]);\n return;\n }\n int y = (l + r) >> 1;\n int z = x + ((y - l + 1) << 1);\n build(x + 1, l, y, v);\n build(z, y + 1, r, v);\n pull(x, z);\n }\n\n node get(int x, int l, int r, int ll, int rr) {\n if (ll <= l && r <= rr) {\n return tree[x];\n }\n int y = (l + r) >> 1;\n int z = x + ((y - l + 1) << 1);\n push(x, l, r);\n node res{};\n if (rr <= y) {\n res = get(x + 1, l, y, ll, rr);\n } else {\n if (ll > y) {\n res = get(z, y + 1, r, ll, rr);\n } else {\n res = unite(get(x + 1, l, y, ll, rr), get(z, y + 1, r, ll, rr));\n }\n }\n pull(x, z);\n return res;\n }\n\n template <typename... M>\n void modify(int x, int l, int r, int ll, int rr, const M &...v) {\n if (ll <= l && r <= rr) {\n tree[x].apply(l, r, v...);\n return;\n }\n int y = (l + r) >> 1;\n int z = x + ((y - l + 1) << 1);\n push(x, l, r);\n if (ll <= y) {\n modify(x + 1, l, y, ll, rr, v...);\n }\n if (rr > y) {\n modify(z, y + 1, r, ll, rr, v...);\n }\n pull(x, z);\n }\n\n int find_first_knowingly(int x, int l, int r,\n const function<bool(const node &)> &f) {\n if (l == r) {\n return l;\n }\n push(x, l, r);\n int y = (l + r) >> 1;\n int z = x + ((y - l + 1) << 1);\n int res;\n if (f(tree[x + 1])) {\n res = find_first_knowingly(x + 1, l, y, f);\n } else {\n res = find_first_knowingly(z, y + 1, r, f);\n }\n pull(x, z);\n return res;\n }\n\n int find_first(int x, int l, int r, int ll, int rr,\n const function<bool(const node &)> &f) {\n if (ll <= l && r <= rr) {\n if (!f(tree[x])) {\n return -1;\n }\n return find_first_knowingly(x, l, r, f);\n }\n push(x, l, r);\n int y = (l + r) >> 1;\n int z = x + ((y - l + 1) << 1);\n int res = -1;\n if (ll <= y) {\n res = find_first(x + 1, l, y, ll, rr, f);\n }\n if (rr > y && res == -1) {\n res = find_first(z, y + 1, r, ll, rr, f);\n }\n pull(x, z);\n return res;\n }\n\n int find_last_knowingly(int x, int l, int r,\n const function<bool(const node &)> &f) {\n if (l == r) {\n return l;\n }\n push(x, l, r);\n int y = (l + r) >> 1;\n int z = x + ((y - l + 1) << 1);\n int res;\n if (f(tree[z])) {\n res = find_last_knowingly(z, y + 1, r, f);\n } else {\n res = find_last_knowingly(x + 1, l, y, f);\n }\n pull(x, z);\n return res;\n }\n\n int find_last(int x, int l, int r, int ll, int rr,\n const function<bool(const node &)> &f) {\n if (ll <= l && r <= rr) {\n if (!f(tree[x])) {\n return -1;\n }\n return find_last_knowingly(x, l, r, f);\n }\n push(x, l, r);\n int y = (l + r) >> 1;\n int z = x + ((y - l + 1) << 1);\n int res = -1;\n if (rr > y) {\n res = find_last(z, y + 1, r, ll, rr, f);\n }\n if (ll <= y && res == -1) {\n res = find_last(x + 1, l, y, ll, rr, f);\n }\n pull(x, z);\n return res;\n }\n\n segtree(int _n) : n(_n) {\n assert(n > 0);\n tree.resize(2 * n - 1);\n build(0, 0, n - 1);\n }\n\n template <typename M> segtree(const vector<M> &v) {\n n = v.size();\n assert(n > 0);\n tree.resize(2 * n - 1);\n build(0, 0, n - 1, v);\n }\n\n node get(int ll, int rr) {\n assert(0 <= ll && ll <= rr && rr <= n - 1);\n return get(0, 0, n - 1, ll, rr);\n }\n\n node get(int p) {\n assert(0 <= p && p <= n - 1);\n return get(0, 0, n - 1, p, p);\n }\n\n template <typename... M> void modify(int ll, int rr, const M &...v) {\n assert(0 <= ll && ll <= rr && rr <= n - 1);\n modify(0, 0, n - 1, ll, rr, v...);\n }\n\n \/\/ find_first and find_last call all FALSE elements\n \/\/ to the left (right) of the sought position exactly once\n\n int find_first(int ll, int rr, const function<bool(const node &)> &f) {\n assert(0 <= ll && ll <= rr && rr <= n - 1);\n return find_first(0, 0, n - 1, ll, rr, f);\n }\n\n int find_last(int ll, int rr, const function<bool(const node &)> &f) {\n assert(0 <= ll && ll <= rr && rr <= n - 1);\n return find_last(0, 0, n - 1, ll, rr, f);\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n;\n cin >> n;\n vector<int> a(n);\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n }\n long long ans = 0;\n vector<int> as = a;\n sort(as.begin(), as.end());\n segtree st(as);\n for (int i = 0; i < n; i++) {\n int pos = (int)(lower_bound(as.begin(), as.end(), a[i]) - as.begin());\n auto ret = st.get(pos, n - 1);\n ans += ret.mn - a[i];\n if (ret.id > 0) {\n st.modify(0, ret.id - 1, 1);\n }\n }\n cout << ans << '\\\\n';\n return 0;\n}\n","change":"replace","i1":7,"i2":32,"j1":7,"j2":251,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03530","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <set>\n#define ll long long\n#define inf 2147483647\n#define rep(i, a, b) for (int i = a; i <= b; ++i)\n#define repp(i, a, b, c) for (int i = a; i <= b; i += c)\n#define reph(i, a, b) for (i = a; i <= b; ++i)\n#define reg(i, head, d, a) for (int i = head[d]; i; i = a[i].next)\n#define rap(i, a, b) for (int i = a; i >= b; --i)\n#define me(a, b) memset(a, b, sizeof(a));\n#define poi(lx, ly, rx, ry) \\\\\n ((lx > rx or ly > ry) ? 0 \\\\\n : (ice[rx][ry] + ice[lx - 1][ly - 1] - \\\\\n ice[rx][ly - 1] - ice[lx - 1][ry]))\nint n, m, sx, sy;\nint ice[45][45], ans = inf, f[45][45][45][45];\nchar temp;\n\nusing namespace std;\n\nint main(void) {\n\n freopen(\"haner.in\", \"r\", stdin);\n freopen(\"haner.out\", \"w\", stdout);\n\n ios::sync_with_stdio(0);\n\n cin >> n >> m;\n me(f, 0x7f);\n f[1][1][n][m] = 0;\n rep(i, 1, n) {\n rep(j, 1, m) {\n cin >> temp;\n if (temp == 'H')\n sx = i, sy = j;\n ice[i][j] = ice[i - 1][j] + ice[i][j - 1] - ice[i - 1][j - 1] +\n ((temp == '#') ? 1 : 0);\n }\n }\n rep(i, 1, sx) {\n rep(j, 1, sy) {\n rap(o, n, sx) {\n rap(p, m, sy) {\n ans = min(ans, f[i][j][o][p] +\n min(min(poi(i, j, sx, sy), poi(i, sy, sx, p)),\n min(poi(sx, j, o, sy), poi(sx, sy, o, p))));\n rep(s, i, o) {\n rep(t, j, p) {\n if (sx <= s and sy <= t)\n f[i][j][s][t] =\n min(f[i][j][s][t], f[i][j][o][p] + poi(i, t + 1, s, p) +\n poi(s + 1, j, o, t));\n if (sx <= s and sy >= t)\n f[i][t][s][p] =\n min(f[i][t][s][p], f[i][j][o][p] + poi(i, j, s, t - 1) +\n poi(s + 1, t, o, p));\n if (sx >= s and sy >= t)\n f[s][t][o][p] =\n min(f[s][t][o][p], f[i][j][o][p] + poi(i, t, s - 1, p) +\n poi(s, j, o, t - 1));\n if (sx >= s and sy <= t)\n f[s][j][o][t] =\n min(f[s][j][o][t], f[i][j][o][p] + poi(i, j, s - 1, t) +\n poi(s, t + 1, o, p));\n }\n }\n }\n }\n }\n }\n cout << ans << endl;\n return 0;\n}","fail":"#include <bits\/stdc++.h>\nusing namespace std;\nconst int MAXN = 45;\nconst int INF = 1e9;\n\nint ice[MAXN][MAXN], dp[MAXN][MAXN][MAXN][MAXN];\nint n, m, hx, hy, ans = INF;\n\ninline int poi(int lx, int ly, int rx, int ry) {\n if (lx > rx || ly > ry)\n return 0;\n return ice[rx][ry] - ice[rx][ly - 1] - ice[lx - 1][ry] + ice[lx - 1][ly - 1];\n}\n\nint main() {\n ios::sync_with_stdio(0);\n cin >> n >> m;\n memset(dp, 0x3f, sizeof dp);\n dp[1][1][n][m] = 0;\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= m; j++) {\n char c;\n cin >> c;\n if (c == 'P')\n hx = i, hy = j;\n ice[i][j] =\n ice[i - 1][j] + ice[i][j - 1] - ice[i - 1][j - 1] + (c == '#');\n }\n }\n for (int i = 1; i <= hx; i++)\n for (int j = 1; j <= hy; j++)\n for (int k = n; k >= hx; k--)\n for (int l = m; l >= hy; l--) {\n ans = min(ans, dp[i][j][k][l] +\n min(min(poi(i, j, hx, hy), poi(i, hy, hx, l)),\n min(poi(hx, j, k, hy), poi(hx, hy, k, l))));\n for (int s = i; s <= k; s++)\n for (int t = j; t <= l; t++) {\n if (s >= hx && t >= hy)\n dp[i][j][s][t] =\n min(dp[i][j][s][t], dp[i][j][k][l] + poi(s + 1, j, k, t) +\n poi(i, t + 1, s, l));\n if (s >= hx && t <= hy)\n dp[i][t][s][l] =\n min(dp[i][t][s][l], dp[i][j][k][l] + poi(i, j, s, t - 1) +\n poi(s + 1, t, k, l));\n if (s <= hx && t <= hy)\n dp[s][t][k][l] =\n min(dp[s][t][k][l], dp[i][j][k][l] + poi(s, j, k, t - 1) +\n poi(i, t, s - 1, l));\n if (s <= hx && t >= hy)\n dp[s][j][k][t] =\n min(dp[s][j][k][t], dp[i][j][k][l] + poi(i, j, s - 1, t) +\n poi(s, t + 1, k, l));\n }\n }\n cout << ans << endl;\n return 0;\n}","change":"replace","i1":0,"i2":73,"j1":0,"j2":56,"error":"WA","stderr":null,"stdout":null}
{"problem_id":"p03530","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n\n#define MAXN 41\n#define re register\n#define xx x + fx[i][0]\n#define yy y + fx[i][1]\n#define INF 0x7ffffff\n#define mp(a, b) make_pair(a, b)\n\nusing namespace std;\n\nstruct node {\n int step;\n pair<int, int> p[MAXN * 10];\n int cnt;\n bool used[MAXN * 10];\n};\n\nint n, m, endx, endy, hardcnt, specflag = true;\nint imap[MAXN][MAXN], vis[MAXN][MAXN], minn[MAXN][MAXN];\nint fx[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\npair<int, int> hard[MAXN * MAXN];\n\nqueue<node> q;\n\ninline void File() {\n#ifndef Mr_Chen\n freopen(\"haner.in\", \"r\", stdin);\n freopen(\"haner.out\", \"w\", stdout);\n#endif\n}\n\ninline int read() {\n re int res = 0;\n re bool f = 1;\n re char ch = getchar();\n while (ch < '0' || ch > '9') {\n if (ch == '-')\n f = 0;\n ch = getchar();\n }\n while (ch >= '0' && ch <= '9') {\n res = (res << 3) + (res << 1) + (ch & 15);\n ch = getchar();\n }\n return f ? res : -res;\n}\n\ninline bool disap(re int x, re int y) {\n return imap[x][y] == 1 && !((imap[x - 1][y] && imap[x + 1][y]) ||\n (imap[x][y - 1] && imap[x][y + 1]));\n}\n\nvoid killp(re int x, re int y) {\n \/\/ printf(\"<%d,%d> killed\\\\n\",x,y);\n imap[x][y] = 0;\n for (re int i = 0; i < 4; ++i)\n if (xx > 0 && xx <= n && yy > 0 && yy <= m && disap(xx, yy))\n killp(xx, yy);\n}\n\ninline void clac() {\n for (re int i = 1; i <= n; ++i)\n for (re int j = 1; j <= m; ++j)\n if (disap(i, j))\n killp(i, j);\n}\n\ninline int bfs() {\n re node start;\n start.step = 0;\n start.cnt = 0;\n memset(start.used, 0, sizeof start.used);\n \/\/ memset(start.p,0,sizeof start.p);\n q.push(start);\n while (!q.empty()) {\n re node now = q.front();\n q.pop();\n for (re int j = 1; j <= now.cnt; ++j)\n imap[now.p[j].first][now.p[j].second] = 1;\n for (re int i = 1; i <= hardcnt; ++i) {\n if (now.used[i])\n continue;\n imap[hard[i].first][hard[i].second] = 1;\n clac();\n if (imap[endx][endy] == 0)\n return now.step + 1;\n imap[hard[i].first][hard[i].second] = 2;\n re node t = now;\n ++t.step;\n t.p[++t.cnt] = hard[i];\n t.used[i] = true;\n q.push(t);\n }\n for (re int j = 1; j <= now.cnt; ++j)\n imap[now.p[j].first][now.p[j].second] = 2;\n }\n}\n\nint main() {\n char ch;\n n = read(), m = read();\n for (re int i = 1; i <= n; ++i) {\n for (re int j = 1; j <= m; ++j) {\n do\n ch = getchar();\n while (ch == '\\\\n' || ch == ' ');\n if (ch == '+')\n imap[i][j] = 1;\n else if (ch == '#') {\n imap[i][j] = 2;\n hard[++hardcnt] = mp(i, j);\n specflag = false;\n } else if (ch == 'P') {\n imap[i][j] = 1;\n endx = i, endy = j;\n } else\n puts(\"ZYH && ALSaoBen && wzr AK IOI\");\n }\n }\n if (specflag) {\n printf(\"0\\\\n\");\n return 0;\n }\n clac();\n if (imap[endx][endy] == 0) {\n printf(\"0\\\\n\");\n return 0;\n }\n \/*for(re int i=1;i<=n;++i)\n {\n for(re int j=1;j<=m;++j)\n printf(\"%d \",imap[i][j]);\n printf(\"\\\\n\");\n }*\/\n printf(\"%d\\\\n\", bfs());\n return 0;\n}","fail":"\/************************************************\n * Au: Hany01\n * Prob: haner\n * Email: hany01dxx@gmail.com & hany01@foxmail.com\n * Inst: Yali High School\n ************************************************\/\n\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef long double LD;\ntypedef pair<int, int> PII;\n#define Rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++i)\n#define For(i, j, k) \\\\\n for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++i)\n#define Fordown(i, j, k) \\\\\n for (register int i = (j), i##_end_ = (k); i >= i##_end_; --i)\n#define Set(a, b) memset(a, b, sizeof(a))\n#define Cpy(a, b) memcpy(a, b, sizeof(a))\n#define X first\n#define Y second\n#define PB(a) push_back(a)\n#define MP(a, b) make_pair(a, b)\n#define SZ(a) ((int)(a).size())\n#define ALL(a) a.begin(), a.end()\n#define INF (0x3f3f3f3f)\n#define INF1 (2139062143)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define y1 wozenmezhemecaia\n\ntemplate <typename T> inline bool chkmax(T &a, T b) {\n return a < b ? a = b, 1 : 0;\n}\ntemplate <typename T> inline bool chkmin(T &a, T b) {\n return b < a ? a = b, 1 : 0;\n}\n\ntemplate <typename T> inline T read() {\n static T _, __;\n static char c_;\n for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar())\n if (c_ == '-')\n __ = -1;\n for (; c_ >= '0' && c_ <= '9'; c_ = getchar())\n _ = (_ << 1) + (_ << 3) + (c_ ^ 48);\n return _ * __;\n}\n\/\/ EOT\n\nconst int maxn = 45;\n\nint n, m;\nint sum[maxn][maxn], dp[maxn][maxn][maxn][maxn], x, y,\n vis[maxn][maxn][maxn][maxn];\n\ninline void Init() {\n static char str[maxn];\n n = read<int>(), m = read<int>();\n For(i, 1, n) {\n scanf(\"%s\", str + 1);\n For(j, 1, m) if (str[j] == 'P') x = i, y = j;\n else if (str[j] == '#') sum[i][j] = 1;\n }\n For(i, 1, n) For(j, 1, m) sum[i][j] +=\n sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];\n}\n\ninline int getsum(int x1, int y1, int x2, int y2) {\n \/\/ if (sum[x2][y2] - sum[x2][y1 - 1] - sum[x1 - 1][y2] + sum[x1 - 1][y1 - 1] <\n \/\/ 0) cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\n return sum[x2][y2] - sum[x2][y1 - 1] - sum[x1 - 1][y2] + sum[x1 - 1][y1 - 1];\n}\n\nint DFS(int x1, int y1, int x2, int y2) {\n if (!chkmax(vis[x1][y1][x2][y2], 1))\n return dp[x1][y1][x2][y2];\n int &ans = dp[x1][y1][x2][y2] = INF;\n chkmin(ans, getsum(x1, y1, x, y));\n chkmin(ans, getsum(x1, y, x, y2));\n chkmin(ans, getsum(x, y1, x2, y));\n chkmin(ans, getsum(x, y, x2, y2));\n For(i, x1 + 1, x) For(j, y1 + 1, y) if (i != x1 || j != y1)\n chkmin(ans, DFS(i, j, x2, y2) + getsum(i, y1, x2, j - 1) +\n getsum(x1, j, i - 1, y2));\n For(i, x, x2 - 1) For(j, y, y2 - 1) if (i != x2 || j != y2)\n chkmin(ans, DFS(x1, y1, i, j) + getsum(i + 1, y1, x2, j) +\n getsum(x1, j + 1, i, y2));\n For(i, x, x2 - 1) For(j, y1 + 1, y) if (i != x2 || j != y1)\n chkmin(ans, DFS(x1, j, i, y2) + getsum(x1, y1, i, j - 1) +\n getsum(i + 1, j, x2, y2));\n For(i, x1 + 1, x) For(j, y, y2 - 1) if (i != x1 || j != y2)\n chkmin(ans, DFS(i, y1, x2, j) + getsum(x1, y1, i - 1, j) +\n getsum(i, j + 1, x2, y2));\n return ans;\n}\n\nint main() {\n\n Init();\n printf(\"%d\\\\n\", DFS(1, 1, n, m));\n\n return 0;\n}","change":"replace","i1":0,"i2":136,"j1":0,"j2":103,"error":"0","stderr":null,"stdout":2.0}
{"problem_id":"p03530","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define FU(i, l, r) \\\\\n for (register int i = (l), _end_ = (int)(r); i <= _end_; ++i)\n#define FD(i, r, l) \\\\\n for (register int i = (r), _end_ = (int)(l); i >= _end_; --i)\n#define X first\n#define Y second\n#define Set(a, b) memset(a, b, sizeof(a))\n#define Cpy(a, b) memcpy(a, b, sizeof(a))\n#define SZ(a) ((int)(a).size())\n#define lowbit(x) x & (-x)\n#define pii pair<int, int>\n#define LL long long\n#define INF 0x3f3f3f3f\n#define file(a) freopen(a \".in\", \"r\", stdin), freopen(a \".out\", \"w\", stdout);\nusing namespace std;\n\ntemplate <typename T> inline bool chkmax(T &a, T b) {\n return (a < b) ? a = b, 1 : 0;\n}\ntemplate <typename T> inline bool chkmin(T &a, T b) {\n return (b < a) ? a = b, 1 : 0;\n}\n\ntemplate <typename T> inline T read() {\n static T __;\n static char c_;\n static bool flag_;\n __ = 0;\n c_ = getchar();\n flag_ = false;\n while (c_ > '9' || c_ < '0') {\n flag_ |= c_ == '-';\n c_ = getchar();\n }\n while (c_ >= '0' && c_ <= '9') {\n __ = (__ << 1) + (__ << 3) + (c_ ^ 48);\n c_ = getchar();\n }\n return flag_ ? -__ : __;\n}\n\ntemplate <typename T> inline T write(T a) {\n if (a < 0) {\n putchar('-');\n a = -a;\n }\n if (a > 9)\n write(a \/ 10);\n putchar(a % 10 + '0');\n return 0;\n}\n\nconst int maxN = 40 + 4;\n\nint n, m, sum[maxN][maxN], dp[maxN][maxN][maxN][maxN], dx, dy, ans;\nchar tmp;\n\ninline int getsum(int x, int y, int u, int v) {\n if (x > u || y > v)\n return 0;\n return sum[u][v] - sum[x - 1][v] - sum[u][y - 1] + sum[x - 1][y - 1];\n}\n\ninline void Input() {\n ios::sync_with_stdio(false);\n file(\"haner\") cin >> n >> m;\n ans = INF;\n for (register int i = 1; i <= n; ++i) {\n for (register int j = 1; j <= m; ++j) {\n cin >> tmp;\n sum[i][j] =\n sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (tmp == '#');\n if (tmp == 'H')\n dx = i, dy = j;\n }\n }\n memset(dp, 0x3f, sizeof(dp));\n return;\n}\n\ninline void Solve() {\n dp[1][1][n][m] = 0;\n for (register int i = 1; i <= dx; ++i)\n for (register int j = 1; j <= dy; ++j)\n for (register int k = n; k >= dx; --k)\n for (register int l = m; l >= dy; --l) {\n chkmin(ans, dp[i][j][k][l] +\n min(min(getsum(i, j, dx, dy), getsum(i, dy, dx, l)),\n min(getsum(dx, j, k, dy), getsum(dx, dy, k, l))));\n for (register int s = i; s <= k; ++s)\n for (register int t = j; t <= l; ++t) {\n if (s <= dx && t <= dy)\n chkmin(dp[i][j][s][t], dp[i][j][k][l] + getsum(i, t, s - 1, l) +\n getsum(s, j, k, t - 1));\n if (s >= dx && t <= dy)\n chkmin(dp[i][j][s][t], dp[i][j][k][l] + getsum(i, j, s, t - 1) +\n getsum(s + 1, t, k, l));\n if (s >= dx && t >= dy)\n chkmin(dp[i][j][s][t], dp[i][j][k][l] + getsum(i, t + 1, s, l) +\n getsum(s + 1, j, k, t));\n if (s <= dx && t >= dy)\n chkmin(dp[i][j][s][t], dp[i][j][k][l] + getsum(i, j, s - 1, t) +\n getsum(s, t + 1, k, l));\n }\n }\n return;\n}\n\ninline void Output() {\n write(ans);\n putchar('\\\\n');\n return;\n}\n\nint main() {\n Input();\n Solve();\n Output();\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n#define FU(i, a, b) for (register int i = a; i <= b; ++i)\n#define FD(i, a, b) for (register int i = a; i >= b; --i)\n#define set_max(a) memset(a, 0x3f, sizeof a)\n#define set_min(a) memset(a, ~0x3f, sizeof a)\n#define clear(a) memset(a, 0, sizeof a)\n\nusing namespace std;\n\ntemplate <typename T> inline void chkmax(T &a, T b) {\n if (a < b)\n a = b;\n}\ntemplate <typename T> inline void chkmin(T &a, T b) {\n if (a > b)\n a = b;\n}\n\ntemplate <typename T> inline T read() {\n int res = 0, flag = 1;\n char ch = getchar();\n while (!isdigit(ch)) {\n if (ch == '-')\n flag = -1;\n ch = getchar();\n }\n while (isdigit(ch)) {\n res = (res << 3) + (res << 1) + ch - '0';\n ch = getchar();\n }\n return res * flag;\n}\n\ntemplate <typename T> inline void write(T x) {\n if (x \/ 10)\n write(x \/ 10);\n putchar(x % 10 + '0');\n}\n\nconst int INF = 0x3f3f3f3f;\nconst int N = 4e1;\nint n, m, hx, hy;\nint ice[N + 5][N + 5], dp[N + 5][N + 5][N + 5][N + 5];\n\ninline void Input() {\n n = read<int>();\n m = read<int>();\n\n char ch;\n for (register int i = 1; i <= n; ++i)\n for (register int j = 1; j <= m; ++j) {\n cin >> ch;\n ice[i][j] =\n ice[i - 1][j] + ice[i][j - 1] - ice[i - 1][j - 1] + (ch == '#');\n if (ch == 'P') {\n hx = i;\n hy = j;\n }\n }\n}\n\ninline int thick(int dx, int dy, int rx, int ry) {\n \/\/ if(dx > rx || dy > ry) return 0;\n return ice[rx][ry] - ice[rx][dy - 1] - ice[dx - 1][ry] + ice[dx - 1][dy - 1];\n}\n\ninline int MIN(int a, int b, int c, int d) { return min(min(a, b), min(c, d)); }\n\ninline void Solve() {\n int ans = INF;\n set_max(dp);\n dp[1][1][n][m] = 0;\n for (register int i = 1; i <= hx; ++i)\n for (register int j = 1; j <= hy; ++j)\n for (register int k = n; k >= hx; --k)\n for (register int p = m; p >= hy; --p) {\n chkmin(ans, dp[i][j][k][p] +\n MIN(thick(i, j, hx, hy), thick(hx, hy, k, p),\n thick(hx, j, k, hy), thick(i, hy, hx, p)));\n for (register int s = i; s <= k; ++s)\n for (register int t = j; t <= p; ++t) {\n if (s >= hx && t >= hy)\n chkmin(dp[i][j][s][t], dp[i][j][k][p] + thick(s + 1, j, k, t) +\n thick(i, t + 1, s, p));\n if (s <= hx && t <= hy)\n chkmin(dp[s][t][k][p], dp[i][j][k][p] + thick(s, j, k, t - 1) +\n thick(i, t, s - 1, p));\n if (s >= hx && t <= hy)\n chkmin(dp[i][t][s][p], dp[i][j][k][p] + thick(i, j, s, t - 1) +\n thick(s + 1, t, k, p));\n if (s <= hx && t >= hy)\n chkmin(dp[s][j][k][t], dp[i][j][k][p] + thick(i, j, s - 1, t) +\n thick(s, t + 1, k, p));\n }\n }\n\n write(ans);\n putchar('\\\\n');\n}\n\ninline void File() {\n freopen(\"haner.in\", \"r\", stdin);\n freopen(\"haner.out\", \"w\", stdout);\n}\n\nint main() {\n \/\/ File();\n\n Input();\n Solve();\n\n return 0;\n}\n","change":"replace","i1":1,"i2":119,"j1":1,"j2":111,"error":"WA","stderr":null,"stdout":null}
{"problem_id":"p03530","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n\n#define I inline\n#define fi first\n#define se second\n#define R register\n#define LL long long\n#define mp make_pair\n#define reg register int\n#define pii pair<int, int>\n#define fo(i, a, b) for (reg i = a; i <= b; i++)\n#define fd(i, a, b) for (reg i = a; i >= b; i--)\n#define cr const reg &\nusing namespace std;\nconst int N = 41;\n\nI int _max(cr x, cr y) { return x > y ? x : y; }\nI int _min(cr x, cr y) { return x < y ? x : y; }\nI int read() {\n reg x = 0, f = 1;\n char ch = getchar();\n while (ch < '0' || ch > '9') {\n if (ch == '-')\n f = -1;\n ch = getchar();\n }\n while (ch >= '0' && ch <= '9')\n x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();\n return x * f;\n}\nI void ptt(LL x) {\n if (x >= 10)\n ptt(x \/ 10);\n putchar(x % 10 + '0');\n}\nI void put(LL x) { x < 0 ? putchar('-'), ptt(-x) : ptt(x); }\nI void pr1(LL x) { put(x), putchar(' '); }\nI void pr2(LL x) { put(x), puts(\"\"); }\n\nchar ss[N][N];\nint s[N][N], f[N][N][N][N];\n\nI int S(cr a, cr b, cr c, cr d) {\n return s[c][d] - s[a - 1][d] - s[c][b - 1] + s[a - 1][b - 1];\n}\nI void upd(int &x, int c) { x = _min(x, c); }\n\nint main() {\n reg n = read(), m = read(), px, py;\n fo(i, 1, n) {\n scanf(\"%s\", ss[i] + 1);\n fo(j, 1, m) {\n if (ss[i][j] == 'P')\n px = i, py = j;\n else if (ss[i][j] == '#')\n s[i][j] = 1;\n s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];\n }\n }\n memset(f, 63, sizeof(f));\n reg ans = f[0][0][0][0];\n f[1][1][n][m] = 0;\n fo(i, 1, n) fo(j, 1, m) fd(k, n, i)\n fd(h, m, j) if (i <= px && j <= py && k >= px && h >= py) {\n reg c = f[i][j][k][h];\n fo(u, i, k) fo(v, j, h) {\n reg s1 = S(i, j, u, v) + S(u + 1, v + 1, k, h);\n reg s2 = S(i, v + 1, u, h) + S(u + 1, j, k, v);\n upd(f[i][j][u][v], c + s2), upd(f[u + 1][v + 1][k][h], c + s2);\n upd(f[i][v + 1][u][j], c + s1), upd(f[u + 1][j][k][v], c + s1);\n }\n ans = _min(ans, c + _min(_min(S(i, j, px, py), S(i, py, px, h)),\n _min(S(px, j, k, py), S(px, py, k, h))));\n }\n pr2(ans);\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n\n#define I inline\n#define fi first\n#define se second\n#define R register\n#define LL long long\n#define mp make_pair\n#define reg register int\n#define pii pair<int, int>\n#define fo(i, a, b) for (reg i = a; i <= b; i++)\n#define fd(i, a, b) for (reg i = a; i >= b; i--)\n#define cr const reg &\nusing namespace std;\nconst int N = 42;\n\nI int _max(cr x, cr y) { return x > y ? x : y; }\nI int _min(cr x, cr y) { return x < y ? x : y; }\nI int read() {\n reg x = 0, f = 1;\n char ch = getchar();\n while (ch < '0' || ch > '9') {\n if (ch == '-')\n f = -1;\n ch = getchar();\n }\n while (ch >= '0' && ch <= '9')\n x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();\n return x * f;\n}\nI void ptt(LL x) {\n if (x >= 10)\n ptt(x \/ 10);\n putchar(x % 10 + '0');\n}\nI void put(LL x) { x < 0 ? putchar('-'), ptt(-x) : ptt(x); }\nI void pr1(LL x) { put(x), putchar(' '); }\nI void pr2(LL x) { put(x), puts(\"\"); }\n\nchar ss[N][N];\nint s[N][N], f[N][N][N][N];\n\nI int S(cr a, cr b, cr c, cr d) {\n return s[c][d] - s[a - 1][d] - s[c][b - 1] + s[a - 1][b - 1];\n}\nI void upd(int &x, int c) { x = _min(x, c); }\n\nint main() {\n reg n = read(), m = read(), px, py;\n fo(i, 1, n) {\n scanf(\"%s\", ss[i] + 1);\n fo(j, 1, m) {\n if (ss[i][j] == 'P')\n px = i, py = j;\n else if (ss[i][j] == '#')\n s[i][j] = 1;\n s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];\n }\n }\n memset(f, 63, sizeof(f));\n reg ans = f[0][0][0][0];\n f[1][1][n][m] = 0;\n fo(i, 1, n) fo(j, 1, m) fd(k, n, i)\n fd(h, m, j) if (i <= px && j <= py && k >= px && h >= py) {\n reg c = f[i][j][k][h];\n fo(u, i, k) fo(v, j, h) {\n reg s1 = S(i, j, u, v) + S(u + 1, v + 1, k, h);\n reg s2 = S(i, v + 1, u, h) + S(u + 1, j, k, v);\n upd(f[i][j][u][v], c + s2), upd(f[u + 1][v + 1][k][h], c + s2);\n upd(f[i][v + 1][u][h], c + s1), upd(f[u + 1][j][k][v], c + s1);\n }\n ans = _min(ans, c + _min(_min(S(i, j, px, py), S(i, py, px, h)),\n _min(S(px, j, k, py), S(px, py, k, h))));\n }\n pr2(ans);\n return 0;\n}\n","change":"replace","i1":14,"i2":70,"j1":14,"j2":70,"error":"0","stderr":null,"stdout":2.0}
{"problem_id":"p03530","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n\n#define MAXN 41\n#define re register\n#define xx x + fx[i][0]\n#define yy y + fx[i][1]\n#define INF 0x7ffffff\n#define mp(a, b) make_pair(a, b)\n\nusing namespace std;\n\nstruct node {\n int step;\n pair<int, int> p[MAXN * 10];\n int cnt;\n bool used[MAXN * 10];\n};\n\nint n, m, endx, endy, hardcnt, specflag = true;\nint imap[MAXN][MAXN], vis[MAXN][MAXN], minn[MAXN][MAXN];\nint fx[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\npair<int, int> hard[MAXN * MAXN];\n\nqueue<node> q;\n\ninline void File() {\n#ifndef Mr_Chen\n freopen(\"haner.in\", \"r\", stdin);\n freopen(\"haner.out\", \"w\", stdout);\n#endif\n}\n\ninline int read() {\n re int res = 0;\n re bool f = 1;\n re char ch = getchar();\n while (ch < '0' || ch > '9') {\n if (ch == '-')\n f = 0;\n ch = getchar();\n }\n while (ch >= '0' && ch <= '9') {\n res = (res << 3) + (res << 1) + (ch & 15);\n ch = getchar();\n }\n return f ? res : -res;\n}\n\ninline bool disap(re int x, re int y) {\n return imap[x][y] == 1 && !((imap[x - 1][y] && imap[x + 1][y]) ||\n (imap[x][y - 1] && imap[x][y + 1]));\n}\n\nvoid killp(re int x, re int y) {\n \/\/ printf(\"<%d,%d> killed\\\\n\",x,y);\n imap[x][y] = 0;\n for (re int i = 0; i < 4; ++i)\n if (xx > 0 && xx <= n && yy > 0 && yy <= m && disap(xx, yy))\n killp(xx, yy);\n}\n\ninline void clac() {\n for (re int i = 1; i <= n; ++i)\n for (re int j = 1; j <= m; ++j)\n if (disap(i, j))\n killp(i, j);\n}\n\ninline int bfs() {\n re node start;\n start.step = 0;\n start.cnt = 0;\n memset(start.used, 0, sizeof start.used);\n \/\/ memset(start.p,0,sizeof start.p);\n q.push(start);\n while (!q.empty()) {\n re node now = q.front();\n q.pop();\n for (re int j = 1; j <= now.cnt; ++j)\n imap[now.p[j].first][now.p[j].second] = 1;\n for (re int i = 1; i <= hardcnt; ++i) {\n if (now.used[i])\n continue;\n imap[hard[i].first][hard[i].second] = 1;\n clac();\n if (imap[endx][endy] == 0)\n return now.step + 1;\n imap[hard[i].first][hard[i].second] = 2;\n re node t = now;\n ++t.step;\n t.p[++t.cnt] = hard[i];\n t.used[i] = true;\n q.push(t);\n }\n for (re int j = 1; j <= now.cnt; ++j)\n imap[now.p[j].first][now.p[j].second] = 2;\n }\n}\n\nint main() {\n char ch;\n n = read(), m = read();\n for (re int i = 1; i <= n; ++i) {\n for (re int j = 1; j <= m; ++j) {\n do\n ch = getchar();\n while (ch == '\\\\n' || ch == ' ');\n if (ch == '+')\n imap[i][j] = 1;\n else if (ch == '#') {\n imap[i][j] = 2;\n hard[++hardcnt] = mp(i, j);\n specflag = false;\n } else if (ch == 'P') {\n imap[i][j] = 1;\n endx = i, endy = j;\n } else\n puts(\"ZYH && ALSaoBen && wzr AK IOI\");\n }\n }\n if (specflag) {\n return 0;\n }\n clac();\n if (imap[endx][endy] == 0) {\n return 0;\n }\n \/*for(re int i=1;i<=n;++i)\n {\n for(re int j=1;j<=m;++j)\n printf(\"%d \",imap[i][j]);\n printf(\"\\\\n\");\n }*\/\n printf(\"%d\\\\n\", bfs());\n return 0;\n}","fail":"\/\/ Code by muq\n#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <set>\n#define ll long long\n#define inf 2147483647\n#define rep(i, a, b) for (int i = a; i <= b; ++i)\n#define repp(i, a, b, c) for (int i = a; i <= b; i += c)\n#define reph(i, a, b) for (i = a; i <= b; ++i)\n#define reg(i, head, d, a) for (int i = head[d]; i; i = a[i].next)\n#define rap(i, a, b) for (int i = a; i >= b; --i)\n#define me(a, b) memset(a, b, sizeof(a));\n#define poi(lx, ly, rx, ry) \\\\\n ((lx > rx or ly > ry) ? 0 \\\\\n : (ice[rx][ry] + ice[lx - 1][ly - 1] - \\\\\n ice[rx][ly - 1] - ice[lx - 1][ry]))\n\nint n, m, sx, sy;\nint ice[45][45], ans = inf, f[45][45][45][45];\nchar temp;\n\nusing namespace std;\n\nint main(void) {\n ios::sync_with_stdio(0);\n\n cin >> n >> m;\n me(f, 0x7f);\n f[1][1][n][m] = 0;\n rep(i, 1, n) {\n rep(j, 1, m) {\n cin >> temp;\n if (temp == 'P')\n sx = i, sy = j;\n ice[i][j] = ice[i - 1][j] + ice[i][j - 1] - ice[i - 1][j - 1] +\n ((temp == '#') ? 1 : 0);\n }\n }\n rep(i, 1, sx) {\n rep(j, 1, sy) {\n rap(o, n, sx) {\n rap(p, m, sy) {\n ans = min(ans, f[i][j][o][p] +\n min(min(poi(i, j, sx, sy), poi(i, sy, sx, p)),\n min(poi(sx, j, o, sy), poi(sx, sy, o, p))));\n rep(s, i, o) {\n rep(t, j, p) {\n if (sx <= s and sy <= t)\n f[i][j][s][t] =\n min(f[i][j][s][t], f[i][j][o][p] + poi(i, t + 1, s, p) +\n poi(s + 1, j, o, t));\n if (sx <= s and sy >= t)\n f[i][t][s][p] =\n min(f[i][t][s][p], f[i][j][o][p] + poi(i, j, s, t - 1) +\n poi(s + 1, t, o, p));\n if (sx >= s and sy >= t)\n f[s][t][o][p] =\n min(f[s][t][o][p], f[i][j][o][p] + poi(i, t, s - 1, p) +\n poi(s, j, o, t - 1));\n if (sx >= s and sy <= t)\n f[s][j][o][t] =\n min(f[s][j][o][t], f[i][j][o][p] + poi(i, j, s - 1, t) +\n poi(s, t + 1, o, p));\n }\n }\n }\n }\n }\n }\n cout << ans << endl;\n return 0;\n}","change":"replace","i1":0,"i2":134,"j1":0,"j2":72,"error":"0","stderr":null,"stdout":2.0}
{"problem_id":"p03530","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define mp make_pair\n#define x first\n#define y second\n#define pb push_back\n#define SZ(x) (int((x).size()))\n#define ALL(x) (x).begin(), (x).end()\n\ntemplate <typename T> inline bool chkmin(T &a, const T &b) {\n return b < a ? a = b, 1 : 0;\n}\ntemplate <typename T> inline bool chkmax(T &a, const T &b) {\n return a < b ? a = b, 1 : 0;\n}\n\ntypedef long long LL;\n\nconst int oo = 0x3f3f3f3f;\n\nconst int maxn = 50;\n\nint n, m;\n\nchar g[maxn + 5][maxn + 5];\n\nint dp[maxn + 5][maxn + 5][maxn + 5][maxn + 5];\n\nint sum[maxn + 5][maxn + 5];\n\ninline int get_sum(int xl, int yl, int xr, int yr) {\n return sum[xr][yr] - sum[xl][yr] - sum[xr][yl] + sum[xl][yl];\n}\n\nint px, py;\n\nint ans = oo;\n\nint main() {\n#ifdef matthew99\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n scanf(\"%d%d\", &n, &m);\n assert(n == m);\n REP(i, 0, n) scanf(\"%s\", g[i]);\n px = py = -1;\n REP(i, 0, n) REP(j, 0, m) if (g[i][j] == 'P') px = i, py = j;\n REP(i, 0, n)\n REP(j, 0, m) sum[i + 1][j + 1] =\n sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + (g[i][j] == '#');\n memset(dp, oo, sizeof dp);\n dp[0][0][n][m] = 0;\n REP(xl, 0, n)\n REP(yl, 0, m) REP(xr, xl + 1, n + 1)\n REP(yr, yl + 1, m + 1) if (dp[xl][yl][xr][yr] < oo) {\n REP(xmid, xl + 1, xr) REP(ymid, yl + 1, yr) {\n chkmin(dp[xl][yl][xmid][ymid], dp[xl][yl][xr][yr] +\n get_sum(xl, ymid, xmid, yr) +\n get_sum(xmid, yl, xr, ymid));\n chkmin(dp[xmid][ymid][xr][yr], dp[xl][yl][xr][yr] +\n get_sum(xl, ymid, xmid, yr) +\n get_sum(xmid, yl, xr, ymid));\n chkmin(dp[xl][ymid][xmid][yr], dp[xl][yl][xr][yr] +\n get_sum(xl, yl, xmid, ymid) +\n get_sum(xmid, ymid, xr, yr));\n chkmin(dp[xmid][yl][xr][ymid], dp[xl][yl][xr][yr] +\n get_sum(xl, yl, xmid, ymid) +\n get_sum(xmid, ymid, xr, yr));\n }\n }\n ans = oo;\n REP(xl, 0, px + 1)\n REP(yl, 0, py + 1) REP(xr, px + 1, n + 1)\n REP(yr, py + 1, m + 1) if (dp[xl][yl][xr][yr] < oo) {\n chkmin(ans, dp[xl][yl][xr][yr] + min({get_sum(xl, yl, px + 1, py + 1),\n get_sum(xl, py, px + 1, yr),\n get_sum(px, yl, xr, py + 1),\n get_sum(px, py, xr, yr)}));\n }\n printf(\"%d\\\\n\", ans);\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define mp make_pair\n#define x first\n#define y second\n#define pb push_back\n#define SZ(x) (int((x).size()))\n#define ALL(x) (x).begin(), (x).end()\n\ntemplate <typename T> inline bool chkmin(T &a, const T &b) {\n return b < a ? a = b, 1 : 0;\n}\ntemplate <typename T> inline bool chkmax(T &a, const T &b) {\n return a < b ? a = b, 1 : 0;\n}\n\ntypedef long long LL;\n\nconst int oo = 0x3f3f3f3f;\n\nconst int maxn = 50;\n\nint n, m;\n\nchar g[maxn + 5][maxn + 5];\n\nint dp[maxn + 5][maxn + 5][maxn + 5][maxn + 5];\n\nint sum[maxn + 5][maxn + 5];\n\ninline int get_sum(int xl, int yl, int xr, int yr) {\n return sum[xr][yr] - sum[xl][yr] - sum[xr][yl] + sum[xl][yl];\n}\n\nint px, py;\n\nint ans = oo;\n\nint main() {\n#ifdef matthew99\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n scanf(\"%d%d\", &n, &m);\n REP(i, 0, n) scanf(\"%s\", g[i]);\n px = py = -1;\n REP(i, 0, n) REP(j, 0, m) if (g[i][j] == 'P') px = i, py = j;\n REP(i, 0, n)\n REP(j, 0, m) sum[i + 1][j + 1] =\n sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + (g[i][j] == '#');\n memset(dp, oo, sizeof dp);\n dp[0][0][n][m] = 0;\n REP(xl, 0, n)\n REP(yl, 0, m) for (int xr = n; xr > xl;\n --xr) for (int yr = m; yr > yl;\n --yr) if (dp[xl][yl][xr][yr] < oo) {\n REP(xmid, xl + 1, xr) REP(ymid, yl + 1, yr) {\n chkmin(dp[xl][yl][xmid][ymid], dp[xl][yl][xr][yr] +\n get_sum(xl, ymid, xmid, yr) +\n get_sum(xmid, yl, xr, ymid));\n chkmin(dp[xmid][ymid][xr][yr], dp[xl][yl][xr][yr] +\n get_sum(xl, ymid, xmid, yr) +\n get_sum(xmid, yl, xr, ymid));\n chkmin(dp[xl][ymid][xmid][yr], dp[xl][yl][xr][yr] +\n get_sum(xl, yl, xmid, ymid) +\n get_sum(xmid, ymid, xr, yr));\n chkmin(dp[xmid][yl][xr][ymid], dp[xl][yl][xr][yr] +\n get_sum(xl, yl, xmid, ymid) +\n get_sum(xmid, ymid, xr, yr));\n }\n }\n ans = oo;\n REP(xl, 0, px + 1)\n REP(yl, 0, py + 1) REP(xr, px + 1, n + 1)\n REP(yr, py + 1, m + 1) if (dp[xl][yl][xr][yr] < oo) {\n chkmin(ans, dp[xl][yl][xr][yr] + min({get_sum(xl, yl, px + 1, py + 1),\n get_sum(xl, py, px + 1, yr),\n get_sum(px, yl, xr, py + 1),\n get_sum(px, py, xr, yr)}));\n }\n printf(\"%d\\\\n\", ans);\n return 0;\n}\n","change":"replace","i1":48,"i2":60,"j1":48,"j2":60,"error":"0","stderr":null,"stdout":2.0}
{"problem_id":"p03530","language":"C++","original_status":"Time Limit Exceeded","pass":"\/************************************************\n * Au: Hany01\n * Prob: haner\n * Email: hany01dxx@gmail.com & hany01@foxmail.com\n * Inst: Yali High School\n ************************************************\/\n\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef long double LD;\ntypedef pair<int, int> PII;\n#define Rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++i)\n#define For(i, j, k) \\\\\n for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++i)\n#define Fordown(i, j, k) \\\\\n for (register int i = (j), i##_end_ = (k); i >= i##_end_; --i)\n#define Set(a, b) memset(a, b, sizeof(a))\n#define Cpy(a, b) memcpy(a, b, sizeof(a))\n#define X first\n#define Y second\n#define PB(a) push_back(a)\n#define MP(a, b) make_pair(a, b)\n#define SZ(a) ((int)(a).size())\n#define ALL(a) a.begin(), a.end()\n#define INF (0x3f3f3f3f)\n#define INF1 (2139062143)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define y1 wozenmezhemecaia\n\ntemplate <typename T> inline bool chkmax(T &a, T b) {\n return a < b ? a = b, 1 : 0;\n}\ntemplate <typename T> inline bool chkmin(T &a, T b) {\n return b < a ? a = b, 1 : 0;\n}\n\ntemplate <typename T> inline T read() {\n static T _, __;\n static char c_;\n for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar())\n if (c_ == '-')\n __ = -1;\n for (; c_ >= '0' && c_ <= '9'; c_ = getchar())\n _ = (_ << 1) + (_ << 3) + (c_ ^ 48);\n return _ * __;\n}\n\/\/ EOT\n\nconst int maxn = 45;\n\nint n, m;\nint sum[maxn][maxn], dp[maxn][maxn][maxn][maxn], x, y,\n vis[maxn][maxn][maxn][maxn];\n\ninline void Init() {\n static char str[maxn];\n n = read<int>(), m = read<int>();\n For(i, 1, n) {\n scanf(\"%s\", str + 1);\n For(j, 1, m) if (str[j] == 'p') x = i, y = j;\n else if (str[j] == '#') sum[i][j] = 1;\n }\n For(i, 1, n) For(j, 1, m) sum[i][j] +=\n sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];\n}\n\ninline int getsum(int x1, int y1, int x2, int y2) {\n \/\/ if (sum[x2][y2] - sum[x2][y1 - 1] - sum[x1 - 1][y2] + sum[x1 - 1][y1 - 1] <\n \/\/ 0) cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;\n return sum[x2][y2] - sum[x2][y1 - 1] - sum[x1 - 1][y2] + sum[x1 - 1][y1 - 1];\n}\n\nint DFS(int x1, int y1, int x2, int y2) {\n if (!chkmax(vis[x1][y1][x2][y2], 1))\n return dp[x1][y1][x2][y2];\n int &ans = dp[x1][y1][x2][y2] = INF;\n chkmin(ans, getsum(x1, y1, x, y));\n chkmin(ans, getsum(x1, y, x, y2));\n chkmin(ans, getsum(x, y1, x2, y));\n chkmin(ans, getsum(x, y, x2, y2));\n For(i, x1 + 1, x) For(j, y1 + 1, y) if (i != x1 || j != y1)\n chkmin(ans, DFS(i, j, x2, y2) + getsum(i, y1, x2, j - 1) +\n getsum(x1, j, i - 1, y2));\n For(i, x, x2 - 1) For(j, y, y2 - 1) if (i != x2 || j != y2)\n chkmin(ans, DFS(x1, y1, i, j) + getsum(i + 1, y1, x2, j) +\n getsum(x1, j + 1, i, y2));\n For(i, x, x2 - 1) For(j, y1 + 1, y) if (i != x2 || j != y1)\n chkmin(ans, DFS(x1, j, i, y2) + getsum(x1, y1, i, j - 1) +\n getsum(i + 1, j, x2, y2));\n For(i, x1 + 1, x) For(j, y, y2 - 1) if (i != x1 || j != y2)\n chkmin(ans, DFS(i, y1, x2, j) + getsum(x1, y1, i - 1, j) +\n getsum(i, j + 1, x2, y2));\n return ans;\n}\n\nint main() {\n freopen(\"haner.in\", \"r\", stdin);\n freopen(\"haner.out\", \"w\", stdout);\n\n Init();\n printf(\"%d\\\\n\", DFS(1, 1, n, m));\n\n return 0;\n}\n","fail":"#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <set>\n#define ll long long\n#define inf 2147483647\n#define rep(i, a, b) for (int i = a; i <= b; ++i)\n#define repp(i, a, b, c) for (int i = a; i <= b; i += c)\n#define reph(i, a, b) for (i = a; i <= b; ++i)\n#define reg(i, head, d, a) for (int i = head[d]; i; i = a[i].next)\n#define rap(i, a, b) for (int i = a; i >= b; --i)\n#define me(a, b) memset(a, b, sizeof(a));\n#define poi(lx, ly, rx, ry) \\\\\n ((lx > rx or ly > ry) ? 0 \\\\\n : (ice[rx][ry] + ice[lx - 1][ly - 1] - \\\\\n ice[rx][ly - 1] - ice[lx - 1][ry]))\nint n, m, sx, sy;\nint ice[45][45], ans = inf, f[45][45][45][45];\nchar temp;\n\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(0);\n\n cin >> n >> m;\n me(f, 0x7f);\n f[1][1][n][m] = 0;\n rep(i, 1, n) {\n rep(j, 1, m) {\n cin >> temp;\n if (temp == 'P')\n sx = i, sy = j;\n ice[i][j] = ice[i - 1][j] + ice[i][j - 1] - ice[i - 1][j - 1] +\n ((temp == '#') ? 1 : 0);\n }\n }\n rep(i, 1, sx) {\n rep(j, 1, sy) {\n rap(o, n, sx) {\n rap(p, m, sy) {\n ans = min(ans, f[i][j][o][p] +\n min(min(poi(i, j, sx, sy), poi(i, sy, sx, p)),\n min(poi(sx, j, o, sy), poi(sx, sy, o, p))));\n rep(s, i, o) {\n rep(t, j, p) {\n if (sx <= s and sy <= t)\n f[i][j][s][t] =\n min(f[i][j][s][t], f[i][j][o][p] + poi(i, t + 1, s, p) +\n poi(s + 1, j, o, t));\n if (sx <= s and sy >= t)\n f[i][t][s][p] =\n min(f[i][t][s][p], f[i][j][o][p] + poi(i, j, s, t - 1) +\n poi(s + 1, t, o, p));\n if (sx >= s and sy >= t)\n f[s][t][o][p] =\n min(f[s][t][o][p], f[i][j][o][p] + poi(i, t, s - 1, p) +\n poi(s, j, o, t - 1));\n if (sx >= s and sy <= t)\n f[s][j][o][t] =\n min(f[s][j][o][t], f[i][j][o][p] + poi(i, j, s - 1, t) +\n poi(s, t + 1, o, p));\n }\n }\n }\n }\n }\n }\n cout << ans << endl;\n return 0;\n}","change":"replace","i1":0,"i2":105,"j1":0,"j2":70,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03530","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <stdio.h>\n#define inf 9999998\n#define GC getchar()\n#define g(a, b, c, d) g[a][b][c][d]\nusing namespace std;\ninline void min(int &a, int b) { a = a < b ? a : b; }\nint n, m, f[45][45][45][45], xx, yy, sum[45][45], g[45][45][45][45];\nbool mk[45][45][45][45];\nchar mp[45][45];\n\/\/ inline int g(int xa,int ya,int xb,int yb){\n\/\/\treturn sum[xb][yb]-sum[xb][ya-1]-sum[xa-1][yb]+sum[xa-1][ya-1];\n\/\/ }\ninline bool is(int xa, int ya, int xb, int yb) {\n if (xa > xx || xb < xx || ya > yy || yb < yy)\n return 0;\n return 1;\n}\nvoid dfs(int xa, int ya, int xb, int yb) {\n \/\/ if(mk[xa][ya][xb][yb])return;\n \/\/ if(!mk[xa][ya][xb][yb])mk[xa][ya][xb][yb]=1;\n for (int i = xa; i < xb; i++) {\n for (int j = ya; j < yb; j++) {\n \/\/ if(g(xa,j+1,i,yb)>0||g(i+1,ya,xb,j)>0)continue;\n if (is(xa, ya, i, j)) {\n dfs(xa, ya, i, j);\n min(f[xa][ya][i][j],\n f[xa][ya][xb][yb] + g(xa, j + 1, i, yb) + g(i + 1, ya, xb, j));\n }\n if (is(i + 1, j + 1, xb, yb)) {\n dfs(i + 1, j + 1, xb, yb);\n min(f[i + 1][j + 1][xb][yb],\n f[xa][ya][xb][yb] + g(xa, j + 1, i, yb) + g(i + 1, ya, xb, j));\n }\n if (is(i + 1, ya, xb, j)) {\n dfs(i + 1, ya, xb, j);\n min(f[i + 1][ya][xb][j],\n f[xa][ya][xb][yb] + g(xa, ya, i, j) + g(i + 1, j + 1, xb, yb));\n }\n if (is(xa, j + 1, i, yb)) {\n dfs(xa, j + 1, i, yb);\n min(f[xa][j + 1][i][yb],\n f[xa][ya][xb][yb] + g(xa, ya, i, j) + g(i + 1, j + 1, xb, yb));\n }\n }\n } \/\/ printf(\"%d %d %d %d %d\\\\n\",xa,ya,xb,yb,f[xa][ya][xb][yb]);\n}\nint main() {\n \/\/ freopen(\"haner3.in\",\"r\",stdin);\n \/\/ freopen(\"haner.out\",\"w\",stdout);\n scanf(\"%d%d\", &n, &m);\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= m; j++) {\n char ch = GC;\n while (ch != '+' && ch != '#' && ch != 'P')\n ch = GC;\n mp[j][i] = ch;\n if (ch == 'P')\n xx = j, yy = i;\n }\n }\n for (int i = 1; i <= m; i++) {\n for (int j = 1; j <= n; j++) {\n sum[i][j] =\n sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (mp[i][j] == '#');\n }\n }\n for (int i = 1; i <= m; i++) {\n for (int j = 1; j <= n; j++) {\n for (int ii = i; ii <= m; ii++) {\n for (int jj = j; jj <= n; jj++) {\n f[i][j][ii][jj] = inf;\n g[i][j][ii][jj] =\n sum[ii][jj] - sum[ii][j - 1] - sum[i - 1][jj] + sum[i - 1][j - 1];\n }\n }\n }\n }\n f[1][1][m][n] = 0;\n dfs(1, 1, m, n);\n int ans = inf;\n for (int i = 1; i <= xx; i++) {\n for (int j = 1; j <= yy; j++) {\n for (int ii = xx; ii <= m; ii++) {\n for (int jj = yy; jj <= n; jj++) {\n min(ans, f[i][j][ii][jj] + g(i, j, xx, yy));\n min(ans, f[i][j][ii][jj] + g(xx, j, ii, yy));\n min(ans, f[i][j][ii][jj] + g(i, yy, xx, jj));\n min(ans, f[i][j][ii][jj] + g(xx, yy, ii, jj));\n }\n }\n }\n }\n printf(\"%d\", ans);\n}\n\n\/*\n2 3\n#H#\n###\n*\/","fail":"#include <bits\/stdc++.h>\n\n#define REP(i, a, b) for (int i = a, i##_end_ = b; i <= i##_end_; ++i)\n#define DREP(i, a, b) for (int i = a, i##_end_ = b; i >= i##_end_; --i)\n#define MREP(i, x) for (int i = beg[x], v; v = to[i], i; i = las[i])\n#define debug(x) cout << #x << \"=\" << x << endl\n#define fi first\n#define se second\n#define mk make_pair\n#define pb push_back\n#define y1 asdasd\ntypedef long long ll;\n\nusing namespace std;\n\nvoid File() {\n freopen(\"haner.in\", \"r\", stdin);\n freopen(\"haner.out\", \"w\", stdout);\n}\n\ntemplate <typename T> void read(T &_) {\n T __ = 0, mul = 1;\n char ch = getchar();\n while (!isdigit(ch)) {\n if (ch == '-')\n mul = -1;\n ch = getchar();\n }\n while (isdigit(ch))\n __ = (__ << 1) + (__ << 3) + (ch ^ '0'), ch = getchar();\n _ = __ * mul;\n}\n\nconst int maxn = 40 + 10;\nconst int inf = 0x3f3f3f3f;\nint n, m, px, py, dp[maxn][maxn][maxn][maxn], sum[maxn][maxn], ans = inf;\nchar s[maxn][maxn];\n\nint S(int x1, int y1, int x2, int y2) {\n return sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1];\n}\n\ntemplate <typename T> void chkmin(T &_, T __) { _ = _ < __ ? _ : __; }\n\nint main() {\n read(n);\n read(m);\n REP(i, 1, n) scanf(\"%s\", s[i] + 1);\n REP(i, 1, n) {\n REP(j, 1, m) {\n if (s[i][j] == 'P') {\n px = i;\n py = j;\n s[i][j] = '+';\n }\n sum[i][j] =\n sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + (s[i][j] == '#');\n \/\/ cout<<sum[i][j]<<\" \";\n }\n \/\/ cout<<endl;\n }\n memset(dp, 63, sizeof(dp));\n dp[1][1][n][m] = 0; \/\/ \u4ee3\u8868\u5c06(1,1,n,m)\u8fd9\u4e2a\u77e9\u5f62\u72ec\u7acb\u7684\u6700\u5c0f\u4ee3\u4ef7\u4e3a0\u3002\n REP(x1, 1, n) REP(y1, 1, m) DREP(x2, n, x1) DREP(y2, m, y1) {\n if (x1 <= px && x2 >= px && y1 <= py && y2 >= py) {\n int w = dp[x1][y1][x2][y2];\n REP(x, x1, x2) REP(y, y1, y2) {\n int cost1 = S(x1, y1, x, y) + S(x + 1, y + 1, x2, y2);\n int cost2 = S(x1, y + 1, x, y2) + S(x + 1, y1, x2, y);\n chkmin(dp[x1][y + 1][x][y2], cost1 + w);\n chkmin(dp[x + 1][y1][x2][y], cost1 + w);\n chkmin(dp[x1][y1][x][y], cost2 + w);\n chkmin(dp[x + 1][y + 1][x2][y2], cost2 + w);\n }\n \/\/ cout<<x1<<\" \"<<y1<<\" \"<<x2<<\" \"<<y2<<\" \"<<w<<endl;\n chkmin(ans, w + S(x1, y1, px, py));\n chkmin(ans, w + S(px, py, x2, y2));\n chkmin(ans, w + S(px, y1, x2, py));\n chkmin(ans, w + S(x1, py, px, y2));\n }\n }\n printf(\"%d\\\\n\", ans);\n return 0;\n}","change":"replace","i1":0,"i2":100,"j1":0,"j2":84,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03531","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint n, A[1 << 18], l[1 << 18], r[1 << 18];\nvector<int> add[1 << 18], del[1 << 18];\nstruct cmp {\n bool operator()(int p, int q) { return r[p] > r[q]; }\n};\npriority_queue<int, vector<int>, cmp> q;\n\nint main() {\n scanf(\"%d\", &n);\n for (int i = 0; i < 1 << n; ++i) {\n scanf(\"%d\", A + i);\n if (A[i])\n l[i] = r[i] = A[i];\n else\n l[i] = 1, r[i] = 1 << n;\n }\n for (int i = 0; i < 1 << n; ++i)\n for (int j = 0; j < n; ++j)\n if (!(i >> j & 1))\n l[i ^ (1 << j)] = max(l[i ^ (1 << j)], l[i] + 1);\n for (int i = (1 << n) - 1; i >= 0; --i)\n for (int j = 0; j < n; ++j)\n if (i >> j & 1)\n r[i ^ (1 << j)] = min(r[i ^ (1 << j)], r[i] - 1);\n for (int i = 0; i < 1 << n; ++i) {\n if (l[i] > r[i])\n return puts(\"NO\"), 0;\n add[l[i]].push_back(i);\n del[r[i]].push_back(i);\n }\n for (int i = 0; i < 1 << n; ++i) {\n for (int x : add[i])\n q.push(x);\n while (!q.empty() && A[q.top()])\n q.pop();\n if (!q.empty())\n A[q.top()] = i;\n for (int x : del[i])\n if (!A[x])\n return puts(\"NO\"), 0;\n }\n for (int i = 0, j = 0; i < 1 << n; ++i) {\n if (i > j)\n swap(A[i], A[j]);\n for (int k = 1 << n - 1; (j ^= k) < k; k >>= 1)\n ;\n }\n puts(\"YES\");\n for (int i = 0; i < 1 << n; ++i)\n printf(\"%d%c\", A[i], \" \\\\n \"[i + 1 == 1 << n]);\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\n\nint n, A[1 << 18], l[1 << 18], r[1 << 18];\nvector<int> add[1 << 18], del[1 << 18];\nstruct cmp {\n bool operator()(int p, int q) { return r[p] > r[q]; }\n};\npriority_queue<int, vector<int>, cmp> q;\n\nint main() {\n scanf(\"%d\", &n);\n for (int i = 0; i < 1 << n; ++i) {\n scanf(\"%d\", A + i);\n if (A[i])\n l[i] = r[i] = A[i];\n else\n l[i] = 1, r[i] = 1 << n;\n }\n for (int i = 0; i < 1 << n; ++i)\n for (int j = 0; j < n; ++j)\n if (!(i >> j & 1))\n l[i ^ (1 << j)] = max(l[i ^ (1 << j)], l[i] + 1);\n for (int i = (1 << n) - 1; i >= 0; --i)\n for (int j = 0; j < n; ++j)\n if (i >> j & 1)\n r[i ^ (1 << j)] = min(r[i ^ (1 << j)], r[i] - 1);\n for (int i = 0; i < 1 << n; ++i) {\n if (l[i] > r[i])\n return puts(\"NO\"), 0;\n add[l[i] - 1].push_back(i);\n del[r[i] - 1].push_back(i);\n }\n for (int i = 0; i < 1 << n; ++i) {\n for (int x : add[i])\n q.push(x);\n if (!q.empty())\n A[q.top()] = i + 1, q.pop();\n for (int x : del[i])\n if (!A[x])\n return puts(\"NO\"), 0;\n }\n for (int i = 0, j = 0; i < 1 << n; ++i) {\n if (i > j)\n swap(A[i], A[j]);\n for (int k = 1 << n - 1; (j ^= k) < k; k >>= 1)\n ;\n }\n puts(\"YES\");\n for (int i = 0; i < 1 << n; ++i)\n printf(\"%d%c\", A[i], \" \\\\n \"[i + 1 == 1 << n]);\n return 0;\n}\n","change":"replace","i1":30,"i2":40,"j1":30,"j2":38,"error":"WA","stderr":null,"stdout":"YES\n1 3 2 4 3 5 6 8\n"}
{"problem_id":"p03531","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define mp make_pair\n#define x first\n#define y second\n#define pb push_back\n#define SZ(x) (int((x).size()))\n#define ALL(x) (x).begin(), (x).end()\n#define EXIT(...) printf(__VA_ARGS__), exit(0)\n\ntemplate <typename T> inline bool chkmin(T &a, const T &b) {\n return b < a ? a = b, 1 : 0;\n}\ntemplate <typename T> inline bool chkmax(T &a, const T &b) {\n return a < b ? a = b, 1 : 0;\n}\n\ntypedef long long LL;\n\nconst int oo = 0x3f3f3f3f;\n\nconst int maxn = 280000;\n\nint n, L;\nint a[maxn + 5];\n\nint ans[maxn + 5];\n\nint pos[maxn + 5];\nbool vis[maxn + 5];\n\nint bitrev[maxn + 5];\n\nint pre[maxn + 5];\n\nint get_pre(int x) { return pre[x] == x ? x : pre[x] = get_pre(pre[x]); }\n\nvoid dfs(int x) {\n if (vis[x])\n return;\n vis[x] = 1;\n int tmp = oo;\n REP(i, 0, L) if (!(x >> i & 1)) {\n dfs(x | (1 << i));\n chkmin(tmp, a[x | (1 << i)]);\n }\n if (!~a[x]) {\n tmp = get_pre(tmp);\n if (tmp == n)\n EXIT(\"NO\\\\n\");\n a[x] = tmp;\n if (!tmp)\n pre[tmp] = n;\n else\n pre[tmp] = get_pre(tmp - 1);\n } else if (tmp < a[x])\n EXIT(\"NO\\\\n\");\n}\n\nint main() {\n#ifdef matthew99\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n scanf(\"%d\", &L), n = 1 << L;\n REP(i, 0, n) scanf(\"%d\", a + i), --a[i], pos[i] = i;\n sort(pos, pos + n, [&](int x, int y) { return a[x] > a[y]; });\n REP(i, 0, n + 1) pre[i] = i;\n REP(i, 0, n) if (~a[i]) {\n if (!a[i])\n pre[a[i]] = n;\n else\n pre[a[i]] = get_pre(a[i] - 1);\n }\n memset(vis, 0, sizeof vis);\n REP(i, 0, n) if (!vis[pos[i]]) { dfs(pos[i]); }\n REP(i, 0, n) bitrev[i] = bitrev[i >> 1] >> 1 | ((i & 1) << (L - 1));\n REP(i, 0, n) { ans[bitrev[a[i]]] = i; }\n puts(\"YES\");\n REP(i, 0, n) printf(\"%d \", ans[i] + 1);\n printf(\"\\\\n\");\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\n#define REP(i, a, b) for (int i = (a), i##_end_ = (b); i < i##_end_; ++i)\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#define mp make_pair\n#define x first\n#define y second\n#define pb push_back\n#define SZ(x) (int((x).size()))\n#define ALL(x) (x).begin(), (x).end()\n#define EXIT(...) printf(__VA_ARGS__), exit(0)\n\ntemplate <typename T> inline bool chkmin(T &a, const T &b) {\n return b < a ? a = b, 1 : 0;\n}\ntemplate <typename T> inline bool chkmax(T &a, const T &b) {\n return a < b ? a = b, 1 : 0;\n}\n\ntypedef long long LL;\n\nconst int oo = 0x3f3f3f3f;\n\nconst int maxn = 280000;\n\nint n, L;\nint a[maxn + 5];\n\nint ans[maxn + 5];\n\nint pos[maxn + 5];\nbool vis[maxn + 5];\n\nint bitrev[maxn + 5];\n\nint pre[maxn + 5];\n\nint get_pre(int x) { return pre[x] == x ? x : pre[x] = get_pre(pre[x]); }\n\nvoid dfs(int x) {\n if (vis[x])\n return;\n vis[x] = 1;\n int tmp = n - 1;\n REP(i, 0, L) if (!(x >> i & 1)) {\n dfs(x | (1 << i));\n chkmin(tmp, a[x | (1 << i)]);\n }\n if (!~a[x]) {\n tmp = get_pre(tmp);\n if (tmp == n)\n EXIT(\"NO\\\\n\");\n a[x] = tmp;\n if (!tmp)\n pre[tmp] = n;\n else\n pre[tmp] = get_pre(tmp - 1);\n } else if (tmp < a[x])\n EXIT(\"NO\\\\n\");\n}\n\nint main() {\n#ifdef matthew99\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n scanf(\"%d\", &L), n = 1 << L;\n REP(i, 0, n) scanf(\"%d\", a + i), --a[i], pos[i] = i;\n sort(pos, pos + n, [&](int x, int y) { return a[x] > a[y]; });\n REP(i, 0, n + 1) pre[i] = i;\n REP(i, 0, n) if (~a[i]) {\n if (!a[i])\n pre[a[i]] = n;\n else\n pre[a[i]] = get_pre(a[i] - 1);\n }\n memset(vis, 0, sizeof vis);\n REP(i, 0, n) if (!vis[pos[i]]) { dfs(pos[i]); }\n REP(i, 0, n) bitrev[i] = bitrev[i >> 1] >> 1 | ((i & 1) << (L - 1));\n REP(i, 0, n) { ans[bitrev[i]] = a[i]; }\n REP(i, 0, n) debug(\"%d \", a[i]);\n debug(\"\\\\n\");\n puts(\"YES\");\n REP(i, 0, n) printf(\"%d \", ans[i] + 1);\n printf(\"\\\\n\");\n return 0;\n}\n","change":"replace","i1":45,"i2":82,"j1":45,"j2":84,"error":"WA","stderr":null,"stdout":"YES\n1 7 2 6 5 4 3 8 \n"}
{"problem_id":"p03531","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define Impossible \\\\\n { \\\\\n cout << \"NO\\\\n\"; \\\\\n return 0; \\\\\n }\n\nusing namespace std;\n\nconst int Nmax = 1 << 18;\n\nint N, n, i, j, x;\nint L[Nmax], R[Nmax], A[Nmax];\nbool used[Nmax];\nvector<int> open[Nmax];\npriority_queue<pair<int, int>> heap;\n\nint reversed(int x) {\n int i, y = 0;\n for (i = 0; i < n; ++i)\n y = (y << 1) | ((x & (1 << i)) > 0);\n return y;\n}\n\nint main() {\n \/\/ freopen(\"input\", \"r\", stdin);\n \/\/ freopen(\"output\", \"w\", stdout);\n cin.sync_with_stdio(false);\n\n cin >> n;\n N = (1 << n);\n\n for (i = 0; i < N; ++i)\n L[i] = 0, R[i] = N - 1;\n\n for (i = 0; i < N; ++i) {\n cin >> A[i];\n --A[i];\n if (A[i] == -1)\n continue;\n\n L[i] = R[i] = A[i];\n used[A[i]] = 1;\n }\n\n for (i = 0; i < N; ++i)\n for (j = 0; j < n; ++j)\n if (!(i & (1 << j))) {\n x = i ^ (1 << j);\n L[x] = max(L[x], L[i] + 1);\n }\n\n for (i = N - 1; i >= 0; --i)\n for (j = 0; j < n; ++j)\n if (i & (1 << j)) {\n x = i ^ (1 << j);\n R[x] = min(R[x], R[i] - 1);\n }\n\n for (i = 0; i < N; ++i)\n open[R[i]].push_back(i);\n\n for (i = N - 1; i >= 0; --i) {\n for (auto it : open[i])\n heap.push({L[it], it + (A[it] != -1 ? N : 0)});\n\n if (heap.empty())\n Impossible;\n\n if (heap.top().second < N)\n A[heap.top().second] = i;\n heap.pop();\n }\n\n cout << \"YES\\\\n\";\n for (i = 0; i < N; ++i)\n cout << A[reversed(i)] + 1 << ' ';\n\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n#define Impossible \\\\\n { \\\\\n cout << \"NO\\\\n\"; \\\\\n return 0; \\\\\n }\n\nusing namespace std;\n\nconst int Nmax = 1 << 18;\n\nint N, n, i, j, x;\nint L[Nmax], R[Nmax], A[Nmax];\nbool used[Nmax];\nvector<int> open[Nmax];\npriority_queue<pair<int, int>> heap;\n\nint reversed(int x) {\n int i, y = 0;\n for (i = 0; i < n; ++i)\n y = (y << 1) | ((x & (1 << i)) > 0);\n return y;\n}\n\nint main() {\n \/\/ freopen(\"input\", \"r\", stdin);\n \/\/ freopen(\"output\", \"w\", stdout);\n cin.sync_with_stdio(false);\n\n cin >> n;\n N = (1 << n);\n\n for (i = 0; i < N; ++i)\n L[i] = 0, R[i] = N - 1;\n\n for (i = 0; i < N; ++i) {\n cin >> A[i];\n --A[i];\n if (A[i] == -1)\n continue;\n\n L[i] = R[i] = A[i];\n used[A[i]] = 1;\n }\n\n for (i = 0; i < N; ++i)\n for (j = 0; j < n; ++j)\n if (!(i & (1 << j))) {\n x = i ^ (1 << j);\n L[x] = max(L[x], L[i] + 1);\n }\n\n for (i = N - 1; i >= 0; --i)\n for (j = 0; j < n; ++j)\n if (i & (1 << j)) {\n x = i ^ (1 << j);\n R[x] = min(R[x], R[i] - 1);\n }\n\n for (i = 0; i < N; ++i) {\n if (L[i] > N - 1 || R[i] < 0 || L[i] > R[i])\n Impossible;\n open[R[i]].push_back(i);\n }\n\n for (i = N - 1; i >= 0; --i) {\n for (auto it : open[i])\n heap.push({L[it], it + (A[it] != -1 ? N : 0)});\n\n if (heap.empty())\n Impossible;\n\n if (heap.top().second < N) {\n A[heap.top().second] = i;\n if (L[heap.top().second] > i)\n Impossible;\n }\n\n heap.pop();\n }\n\n cout << \"YES\\\\n\";\n for (i = 0; i < N; ++i)\n cout << A[reversed(i)] + 1 << ' ';\n\n return 0;\n}\n","change":"replace","i1":26,"i2":71,"j1":26,"j2":78,"error":"WA","stderr":null,"stdout":"YES\n1 4 2 5 3 7 6 8 "}
{"problem_id":"p03531","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\n\n#define N 300005\n#define M 19\n\n#define ls (t << 1)\n#define rs ((t << 1) | 1)\n#define mid ((l + r) >> 1)\n\n#define mk make_pair\n#define pb push_back\n#define fi first\n#define se second\n\nusing namespace std;\n\nint i, j, m, n, p, k, r, A[1 << M], vis[(1 << M) + 5], Q[(1 << M) + 5],\n deg[1 << M], que[(1 << M) + 5], Qt[(1 << M) + 5], B[1 << M], G[1 << M],\n H[1 << M], F[1 << M];\n\nvector<int> ve[1 << M];\n\ninline int cmp(int a, int b) { return A[a] < A[b]; }\n\ninline int cmp2(int a, int b) {\n if (G[a] != G[b])\n return G[a] < G[b];\n return H[a] > H[b];\n}\n\nint ojbk(int x) {\n que[que[0] = 1] = x;\n int i, l;\n for (l = 1; l <= que[0]; ++l) {\n int p = que[l];\n for (i = 0; i < (int)ve[p].size(); ++i) {\n int k = ve[p][i];\n if (A[k]) {\n if (A[k] >= A[x])\n return 0;\n } else\n que[++que[0]] = k, A[k] = -1;\n }\n }\n for (l = 2; l <= que[0]; ++l) {\n int p = que[l];\n for (j = 0; j < (int)ve[p].size(); ++j) {\n int k = ve[p][j];\n if (A[k] == -1)\n deg[k]++;\n }\n }\n Qt[0] = 0;\n for (l = 2; l <= que[0]; ++l) {\n int p = que[l];\n if (!deg[p])\n Qt[++Qt[0]] = p;\n }\n for (l = 1; l <= Qt[0]; ++l) {\n int p = Qt[l];\n for (i = 0; i < (int)ve[p].size(); ++i) {\n int k = ve[p][i];\n if (A[k] == -1) {\n deg[k]--;\n if (!deg[k])\n Qt[++Qt[0]] = k;\n }\n }\n }\n for (i = Qt[0]; i >= 1; --i) {\n int p = Qt[i];\n H[Qt[i]] = i;\n for (j = 0; j < (int)ve[p].size(); ++j) {\n int k = ve[p][j];\n G[p] = max(G[p], G[k]);\n }\n }\n sort(Qt + 1, Qt + Qt[0] + 1, cmp2);\n F[0] = Qt[0] + 1;\n for (i = 1; i <= Qt[0]; ++i)\n F[i + 1] = Qt[i];\n F[1] = x;\n for (i = 1; i <= Qt[0]; ++i) {\n int p = Qt[i];\n for (; vis[r]; ++r)\n ;\n if (r > A[x] || r <= G[p])\n return 0;\n A[p] = r;\n vis[r] = 1;\n }\n for (i = F[0]; i; --i) {\n int p = F[i];\n G[p] = A[p];\n for (j = 0; j < (int)ve[p].size(); ++j) {\n int k = ve[p][j];\n G[p] = max(G[p], G[k]);\n }\n }\n return 1;\n}\nint ojbkall() {\n int i, l;\n que[0] = 0;\n for (i = 0; i < m; ++i)\n if (!A[i])\n que[++que[0]] = i;\n for (l = 1; l <= que[0]; ++l) {\n int p = que[l];\n for (j = 0; j < (int)ve[p].size(); ++j) {\n int k = ve[p][j];\n if (A[k] == 0)\n deg[k]++;\n }\n }\n Qt[0] = 0;\n for (l = 1; l <= que[0]; ++l) {\n int p = que[l];\n if (!deg[p])\n Qt[++Qt[0]] = p;\n }\n for (l = 1; l <= Qt[0]; ++l) {\n int p = Qt[l];\n for (i = 0; i < (int)ve[p].size(); ++i) {\n int k = ve[p][i];\n if (A[k] == 0) {\n deg[k]--;\n if (!deg[k])\n Qt[++Qt[0]] = k;\n }\n }\n }\n for (i = 1; i <= Qt[0]; ++i)\n H[Qt[i]] = i;\n for (i = 0; i < m; ++i)\n G[i] = A[i];\n for (i = 0; i < m; ++i) {\n int p = i;\n for (j = 0; j < (int)ve[p].size(); ++j)\n G[p] = max(G[p], G[ve[p][j]]);\n }\n sort(Qt + 1, Qt + Qt[0] + 1, cmp2);\n for (i = 1; i <= Qt[0]; ++i) {\n int p = Qt[i];\n for (; vis[r]; ++r)\n ;\n if (G[p] >= r)\n return 0;\n A[p] = r;\n vis[r] = 1;\n }\n return 1;\n}\n\nint main() {\n scanf(\"%d\", &n);\n m = 1 << n;\n for (i = 0; i < m; ++i) {\n scanf(\"%d\", &A[i]);\n if (A[i])\n vis[A[i]] = 1, Q[++Q[0]] = i, G[i] = A[i];\n }\n r = 1;\n for (i = 0; i < n; ++i) {\n for (j = 0; j < m; ++j) {\n int p = j ^ (1 << i);\n if (p < j)\n ve[j].pb(p);\n }\n }\n sort(Q + 1, Q + Q[0] + 1, cmp);\n for (i = 1; i <= Q[0]; ++i) {\n if (!ojbk(Q[i])) {\n puts(\"NO\");\n for (;;)\n ;\n return 0;\n }\n }\n \/\/\t\tfor (i=0;i<n;++i)\n \/\/\t\t{\n \/\/\t\t\t\tfor (j=0;j<m;++j)\n \/\/\t\t\t\t{\n \/\/\t\t\t\t\t\tint p=j^(1<<i);\n \/\/\t\t\t\t\t\tif (p<j&&A[p]&&A[j]&&A[p]>=A[j]) for\n \/\/(;;);\n \/\/\t\t\t\t}\n \/\/\t\t}\n if (!ojbkall()) {\n puts(\"NO\");\n for (;;)\n ;\n return 0;\n }\n printf(\"YES\\\\n\");\n \/\/\t\tfor (;vis[r];++r);\n \/\/\t\tif (r!=(1<<n)+1) for (;;);\n \/*\n for (i=0;i<n;++i)\n {\n for (j=0;j<m;++j)\n {\n int p=j^(1<<i);\n if (p<j&&A[p]>=A[j]) for (;;);\n }\n }\n *\/\n \/\/\t\tsort(A,A+m);\n \/\/\t\tfor (i=0;i<m-1;++i) if (A[i]==A[i+1]) for (;;);\n Q[Q[0] = 1] = 0;\n for (i = 0; i < n; ++i) {\n for (j = 1; j <= (1 << i); ++j)\n Q[++Q[0]] = Q[j] + (1 << (n - 1 - i));\n }\n for (i = 1; i <= m; ++i)\n B[Q[i]] = A[i - 1];\n for (i = 0; i < m; ++i)\n printf(\"%d \", B[i]);\n}","fail":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\n\n#define N 500005\n#define M 8000005\n\n#define ls (t << 1)\n#define rs ((t << 1) | 1)\n#define mid ((l + r) >> 1)\n\n#define mk make_pair\n#define pb push_back\n#define fi first\n#define se second\n\nusing namespace std;\n\nint i, j, m, n, p, k, A[N], L[N], R[N], Q[N], B[N];\n\nvector<pair<int, int>> v[N];\n\nset<pair<int, int>> st;\n\nint main() {\n scanf(\"%d\", &n);\n m = 1 << n;\n for (i = 0; i < m; ++i)\n scanf(\"%d\", &A[i]);\n for (i = m - 1; i >= 0; --i) {\n R[i] = m;\n if (A[i])\n R[i] = A[i];\n for (j = 0; j < n; ++j)\n if ((i ^ (1 << j)) > i)\n R[i] = min(R[i], R[i ^ (1 << j)]);\n }\n for (i = 0; i < m; ++i) {\n L[i] = 1;\n if (A[i])\n L[i] = A[i];\n for (j = 0; j < n; ++j)\n if ((i ^ (1 << j)) < i)\n L[i] = max(L[i], L[i ^ (1 << j)]);\n }\n for (i = 0; i < m; ++i)\n v[L[i]].pb(mk(R[i], i));\n for (i = 1; i <= m; ++i) {\n for (j = 0; j < (int)v[i].size(); ++j)\n st.insert(v[i][j]);\n if (!st.size() || (*st.begin()).fi < i) {\n puts(\"NO\");\n return 0;\n }\n A[(*st.begin()).se] = i;\n st.erase(st.begin());\n }\n puts(\"YES\");\n Q[Q[0] = 1] = 0;\n for (i = 0; i < n; ++i) {\n for (j = 1; j <= (1 << i); ++j)\n Q[++Q[0]] = Q[j] + (1 << (n - 1 - i));\n }\n for (i = 1; i <= m; ++i)\n B[Q[i]] = A[i - 1];\n for (i = 0; i < m; ++i)\n printf(\"%d \", B[i]);\n}\n","change":"replace","i1":12,"i2":219,"j1":12,"j2":66,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03531","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing ll = long long;\nusing ld = long double;\nusing namespace std;\n\nconst int N = 18;\nconst int MN = (1 << N);\n\nvector<int> e[MN];\nvector<int> reve[MN];\n\nint c[MN];\n\nint req[MN];\nint a[MN];\n\nint cur;\n\nset<int> avail;\n\nvoid no() {\n cout << \"NO\\\\n\";\n exit(0);\n}\n\nint dfs(int x) {\n if (a[x] != -1) {\n return a[x];\n }\n\n int vl = MN;\n\n for (int y : e[x]) {\n vl = min(vl, dfs(y));\n }\n\n auto it = avail.lower_bound(vl);\n\n if (it == avail.begin()) {\n no();\n }\n\n --it;\n vl = a[x] = *it;\n avail.erase(it);\n\n return vl;\n}\n\nint buf[N];\nint b[N];\nint inita[N];\n\nvoid dfsgo(int v, int val) {\n for (int u : e[v]) {\n if (dfs(u) <= val) {\n no();\n }\n }\n\n a[v] = val;\n}\n\nint n, k;\n\nvoid cool() {\n for (int i = k; i > 0; --i) {\n copy(a, a + n, buf);\n int c = 1 << i;\n for (int l = 0; l < n; l += c) {\n int r = l + c;\n int md = (l + r) \/ 2;\n for (int cc = 0; cc < (md - l); ++cc) {\n a[l + cc] = buf[l + cc * 2];\n a[md + cc] = buf[l + cc * 2 + 1];\n }\n }\n }\n\n for (int i = 0; i < n; ++i) {\n \/\/ assert(a[i] == inita[i]);\n }\n}\n\nint main() {\n#ifdef PAUNSVOKNO\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n\n cin >> k;\n n = (1 << k);\n cur = n - 1;\n fill(req, req + n, -1);\n\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < k; ++j) {\n if ((i & (1 << j)) == 0) {\n e[i].push_back(i + (1 << j));\n }\n }\n }\n\n for (int i = 0; i < n; ++i) {\n cin >> a[i];\n --a[i];\n if (a[i] >= 0) {\n req[a[i]] = i;\n }\n }\n\n for (int i = 0; i < n; ++i) {\n if (req[i] == -1) {\n avail.insert(i);\n }\n }\n\n for (int i = n - 1; i >= 0; --i) {\n if (req[i] != -1) {\n dfsgo(req[i], i);\n }\n }\n\n if (a[0] > 0) {\n no();\n }\n\n dfsgo(0, 0);\n copy(a, a + n, inita);\n\n for (int i = 2; i <= k; ++i) {\n copy(a, a + n, buf);\n for (int j = 0; j < (1 << (k - i)); ++j) {\n int l = (j << i);\n int r = ((j + 1) << i);\n int m = (l + r) \/ 2;\n\n for (int i2 = 0; i2 < (1 << (i - 1)); ++i2) {\n a[l + i2 * 2] = buf[l + i2];\n a[l + i2 * 2 + 1] = buf[m + i2];\n }\n }\n }\n\n cout << \"YES\\\\n\";\n for (int i = 0; i < n; ++i) {\n cout << a[i] + 1 << \" \";\n }\n\n cool();\n}","fail":"#include <bits\/stdc++.h>\nusing ll = long long;\nusing ld = long double;\nusing namespace std;\n\nconst int N = 18;\nconst int MN = (1 << N);\n\nvector<int> e[MN];\nvector<int> reve[MN];\n\nint c[MN];\n\nint req[MN];\nint a[MN];\n\nint cur;\n\nset<int> avail;\n\nvoid no() {\n cout << \"NO\\\\n\";\n exit(0);\n}\n\nint dfs(int x) {\n if (a[x] != -1) {\n return a[x];\n }\n\n int vl = MN;\n\n for (int y : e[x]) {\n vl = min(vl, dfs(y));\n }\n\n auto it = avail.lower_bound(vl);\n\n if (it == avail.begin()) {\n no();\n }\n\n --it;\n vl = a[x] = *it;\n avail.erase(it);\n\n return vl;\n}\n\nint buf[MN];\nint b[MN];\nint inita[MN];\n\nvoid dfsgo(int v, int val) {\n for (int u : e[v]) {\n if (dfs(u) <= val) {\n no();\n }\n }\n\n a[v] = val;\n}\n\nint n, k;\n\nvoid cool() {\n for (int i = k; i > 0; --i) {\n copy(a, a + n, buf);\n int c = 1 << i;\n for (int l = 0; l < n; l += c) {\n int r = l + c;\n int md = (l + r) \/ 2;\n for (int cc = 0; cc < (md - l); ++cc) {\n a[l + cc] = buf[l + cc * 2];\n a[md + cc] = buf[l + cc * 2 + 1];\n }\n }\n }\n\n for (int i = 0; i < n; ++i) {\n assert(a[i] == inita[i]);\n }\n}\n\nint main() {\n#ifdef PAUNSVOKNO\n freopen(\"input.txt\", \"r\", stdin);\n freopen(\"output.txt\", \"w\", stdout);\n#endif\n\n cin >> k;\n n = (1 << k);\n cur = n - 1;\n fill(req, req + n, -1);\n\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < k; ++j) {\n if ((i & (1 << j)) == 0) {\n e[i].push_back(i + (1 << j));\n }\n }\n }\n\n for (int i = 0; i < n; ++i) {\n cin >> a[i];\n --a[i];\n if (a[i] >= 0) {\n req[a[i]] = i;\n }\n }\n\n for (int i = 0; i < n; ++i) {\n if (req[i] == -1) {\n avail.insert(i);\n }\n }\n\n for (int i = n - 1; i >= 0; --i) {\n if (req[i] != -1) {\n dfsgo(req[i], i);\n }\n }\n\n if (a[0] > 0) {\n no();\n }\n\n dfsgo(0, 0);\n copy(a, a + n, inita);\n\n for (int i = 2; i <= k; ++i) {\n copy(a, a + n, buf);\n for (int j = 0; j < (1 << (k - i)); ++j) {\n int l = (j << i);\n int r = ((j + 1) << i);\n int m = (l + r) \/ 2;\n\n for (int i2 = 0; i2 < (1 << (i - 1)); ++i2) {\n a[l + i2 * 2] = buf[l + i2];\n a[l + i2 * 2 + 1] = buf[m + i2];\n }\n }\n }\n\n cout << \"YES\\\\n\";\n for (int i = 0; i < n; ++i) {\n cout << a[i] + 1 << \" \";\n }\n\n cool();\n}","change":"replace","i1":49,"i2":81,"j1":49,"j2":81,"error":"WA","stderr":null,"stdout":"YES\n1 2 4 5 3 7 6 8 "}
{"problem_id":"p03537","language":"C++","original_status":"Time Limit Exceeded","pass":"\/\/ need\n#include <algorithm>\n#include <iostream>\n\/\/ data structure\n#include <bitset>\n#include <complex>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\/\/ #include <deque>\n#include <array>\n#include <unordered_map>\n#include <unordered_set>\n#include <valarray>\n\/\/ stream\n\/\/ #include <istream>\n#include <sstream>\n\/\/ #include <ostream>\n#include <fstream>\n\/\/ etc\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <random>\n\n\/\/ input\n#define INIT \\\\\n std::ios::sync_with_stdio(false); \\\\\n std::cin.tie(0);\n#define VAR(type, ...) \\\\\n type __VA_ARGS__; \\\\\n MACRO_VAR_Scan(__VA_ARGS__);\ntemplate <typename T> void MACRO_VAR_Scan(T &t) { std::cin >> t; }\ntemplate <typename First, typename... Rest>\nvoid MACRO_VAR_Scan(First &first, Rest &...rest) {\n std::cin >> first;\n MACRO_VAR_Scan(rest...);\n}\n#define VEC_ROW(type, n, ...) \\\\\n std::vector<type> __VA_ARGS__; \\\\\n MACRO_VEC_ROW_Init(n, __VA_ARGS__); \\\\\n for (int w_ = 0; w_ < n; ++w_) { \\\\\n MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \\\\\n }\ntemplate <typename T> void MACRO_VEC_ROW_Init(int n, T &t) { t.resize(n); }\ntemplate <typename First, typename... Rest>\nvoid MACRO_VEC_ROW_Init(int n, First &first, Rest &...rest) {\n first.resize(n);\n MACRO_VEC_ROW_Init(n, rest...);\n}\ntemplate <typename T> void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }\ntemplate <typename First, typename... Rest>\nvoid MACRO_VEC_ROW_Scan(int p, First &first, Rest &...rest) {\n std::cin >> first[p];\n MACRO_VEC_ROW_Scan(p, rest...);\n}\n#define VEC(type, c, n) \\\\\n std::vector<type> c(n); \\\\\n for (auto &i : c) \\\\\n std::cin >> i;\n#define MAT(type, c, m, n) \\\\\n std::vector<std::vector<type>> c(m, std::vector<type>(n)); \\\\\n for (auto &R : c) \\\\\n for (auto &w : R) \\\\\n std::cin >> w;\n\/\/ output\n#define OUT(dist) std::cout << (dist);\n#define FOUT(n, dist) std::cout << std::fixed << std::setprecision(n) << (dist);\n#define SOUT(n, c, dist) std::cout << std::setw(n) << std::setfill(c) << (dist);\n#define SP std::cout << \" \";\n#define TAB std::cout << \"\\\\t\";\n#define BR std::cout << \"\\\\n\";\n#define SPBR(w, n) std::cout << (w + 1 == n ? '\\\\n' : ' ');\n#define ENDL std::cout << std::endl;\n#define FLUSH std::cout << std::flush;\n#define SHOW(dist) \\\\\n { std::cerr << #dist << \"\\\\t:\" << (dist) << \"\\\\n\"; }\n#define SHOWVECTOR(v) \\\\\n { \\\\\n std::cerr << #v << \"\\\\t:\"; \\\\\n for (const auto &xxx : v) { \\\\\n std::cerr << xxx << \" \"; \\\\\n } \\\\\n std::cerr << \"\\\\n\"; \\\\\n }\n#define SHOWVECTOR2(v) \\\\\n { \\\\\n std::cerr << #v << \"\\\\t:\\\\n\"; \\\\\n for (const auto &xxx : v) { \\\\\n for (const auto &yyy : xxx) { \\\\\n std::cerr << yyy << \" \"; \\\\\n } \\\\\n std::cerr << \"\\\\n\"; \\\\\n } \\\\\n }\n#define SHOWQUEUE(a) \\\\\n { \\\\\n auto tmp(a); \\\\\n std::cerr << #a << \"\\\\t:\"; \\\\\n while (!tmp.empty()) { \\\\\n std::cerr << tmp.front() << \" \"; \\\\\n tmp.pop(); \\\\\n } \\\\\n std::cerr << \"\\\\n\"; \\\\\n }\n\/\/ utility\n#define ALL(a) (a).begin(), (a).end()\n#define FOR(w, a, n) for (int w = (a); w < (n); ++w)\n#define RFOR(w, a, n) for (int w = (n)-1; w >= (a); --w)\n#define REP(w, n) for (int w = 0; w < int(n); ++w)\n#define RREP(w, n) for (int w = int(n) - 1; w >= 0; --w)\n#define FORLL(w, a, n) for (ll w = ll(a); w < ll(n); ++w)\n#define RFORLL(w, a, n) for (ll w = ll(n) - 1; w >= ll(a); --w)\n#define REPLL(w, n) for (ll w = 0; w < ll(n); ++w)\n#define RREPLL(w, n) for (ll w = ll(n) - 1; w >= 0; --w)\n#define IN(a, x, b) (a <= x && x < b)\ntemplate <class T> inline T CHMAX(T &a, const T b) {\n return a = (a < b) ? b : a;\n}\ntemplate <class T> inline T CHMIN(T &a, const T b) {\n return a = (a > b) ? b : a;\n}\n#define EXCEPTION(msg) \\\\\n throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + \\\\\n std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) \\\\\n try { \\\\\n if (cond) \\\\\n EXCEPTION(msg); \\\\\n } catch (std::string s) { \\\\\n std::cerr << s << std::endl; \\\\\n }\n\/\/ void CHECKTIME(std::function<void()> f) { auto start =\n\/\/ std::chrono::system_clock::now(); f(); auto end =\n\/\/ std::chrono::system_clock::now(); auto res =\n\/\/ std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count();\n\/\/ std::cerr << \"[Time:\" << res << \"ns (\" << res \/ (1.0e9) << \"s)]\\\\n\"; }\n\/\/ test\ntemplate <class T> using V = std::vector<T>;\ntemplate <class T> using VV = V<V<T>>;\n\ntemplate <typename S, typename T>\nstd::ostream &operator<<(std::ostream &os, std::pair<S, T> p) {\n os << \"(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\n\n#define random_shuffle \"USE std::shuffle!\";\n\n\/\/ type\/const\n#define int ll\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing PAIR = std::pair<int, int>;\nusing PAIRLL = std::pair<ll, ll>;\nconstexpr int INFINT = 1 << 30; \/\/ 1.07x10^ 9\nconstexpr int INFINT_LIM = (1LL << 31) - 1; \/\/ 2.15x10^ 9\nconstexpr ll INFLL = 1LL << 60; \/\/ 1.15x10^18\nconstexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); \/\/ 9.22x10^18\nconstexpr double EPS = 1e-6;\nconstexpr int MOD = 998244353;\nconstexpr double PI = 3.141592653589793238462643383279;\ntemplate <class T, size_t N> void FILL(T (&a)[N], const T &val) {\n for (auto &x : a)\n x = val;\n}\ntemplate <class ARY, size_t N, size_t M, class T>\nvoid FILL(ARY (&a)[N][M], const T &val) {\n for (auto &b : a)\n FILL(b, val);\n}\ntemplate <class T> void FILL(std::vector<T> &a, const T &val) {\n for (auto &x : a)\n x = val;\n}\ntemplate <class ARY, class T>\nvoid FILL(std::vector<std::vector<ARY>> &a, const T &val) {\n for (auto &b : a)\n FILL(b, val);\n}\n\/\/ ------------>8------------------------------------->8------------\n\nvoid add(char &c, int d) {\n int t = c - 'a' + d;\n t %= 26;\n if (t < 0)\n t += 26;\n c = 'a' + t;\n}\n\nbool calc() {\n VAR(std::string, s);\n VAR(int, n);\n VEC_ROW(int, n, l, r);\n\n std::string t(s.rbegin(), s.rend());\n int M = s.size();\n int m = M \/ 2;\n s.resize(m);\n t.resize(m);\n\n std::vector<std::vector<int>> seg(m + 1);\n\n REP(i, n) {\n --l[i];\n --r[i];\n if (r[i] < m)\n continue;\n if (l[i] >= M - m) {\n l[i] = M - 1 - l[i];\n r[i] = M - 1 - r[i];\n std::swap(l[i], r[i]);\n continue;\n }\n r[i] = M - 1 - r[i];\n if (l[i] == r[i]) {\n l[i] = r[i] = -1;\n } else if (l[i] < r[i]) {\n --r[i];\n } else if (r[i] < l[i]) {\n --l[i];\n std::swap(l[i], r[i]);\n }\n }\n\n REP(i, n) {\n if (l[i] == -1)\n continue;\n seg[l[i]].emplace_back(r[i]);\n }\n\n REP(i, m) {\n std::sort(ALL(seg[i]));\n FOR(j, 1, seg[i].size()) {\n if (seg[i][0] + 1 <= seg[i][j])\n seg[seg[i][0] + 1].emplace_back(seg[i][j]);\n }\n if (seg[i].size() > 1)\n seg[i].resize(1);\n }\n\n std::vector<int> imos(m + 1, 0);\n REP(i, m) {\n add(s[i], imos[i]);\n if (s[i] != t[i]) {\n if (seg[i].empty())\n return false;\n\n int d = t[i] - s[i];\n if (d < 0)\n d += 26;\n add(s[i], d);\n assert(s[i] == t[i]);\n\n imos[i] += d;\n imos[seg[i][0] + 1] -= d;\n }\n (imos[i + 1] += imos[i]) %= 26;\n }\n assert(s == t);\n\n return true;\n}\n\nsigned main() {\n INIT;\n\n OUT(calc() ? \"YES\" : \"NO\") BR;\n\n return 0;\n}","fail":"\/\/ need\n#include <algorithm>\n#include <iostream>\n\/\/ data structure\n#include <bitset>\n#include <complex>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\n\/\/ #include <deque>\n#include <array>\n#include <unordered_map>\n#include <unordered_set>\n#include <valarray>\n\/\/ stream\n\/\/ #include <istream>\n#include <sstream>\n\/\/ #include <ostream>\n#include <fstream>\n\/\/ etc\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <random>\n\n\/\/ input\n#define INIT \\\\\n std::ios::sync_with_stdio(false); \\\\\n std::cin.tie(0);\n#define VAR(type, ...) \\\\\n type __VA_ARGS__; \\\\\n MACRO_VAR_Scan(__VA_ARGS__);\ntemplate <typename T> void MACRO_VAR_Scan(T &t) { std::cin >> t; }\ntemplate <typename First, typename... Rest>\nvoid MACRO_VAR_Scan(First &first, Rest &...rest) {\n std::cin >> first;\n MACRO_VAR_Scan(rest...);\n}\n#define VEC_ROW(type, n, ...) \\\\\n std::vector<type> __VA_ARGS__; \\\\\n MACRO_VEC_ROW_Init(n, __VA_ARGS__); \\\\\n for (int w_ = 0; w_ < n; ++w_) { \\\\\n MACRO_VEC_ROW_Scan(w_, __VA_ARGS__); \\\\\n }\ntemplate <typename T> void MACRO_VEC_ROW_Init(int n, T &t) { t.resize(n); }\ntemplate <typename First, typename... Rest>\nvoid MACRO_VEC_ROW_Init(int n, First &first, Rest &...rest) {\n first.resize(n);\n MACRO_VEC_ROW_Init(n, rest...);\n}\ntemplate <typename T> void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }\ntemplate <typename First, typename... Rest>\nvoid MACRO_VEC_ROW_Scan(int p, First &first, Rest &...rest) {\n std::cin >> first[p];\n MACRO_VEC_ROW_Scan(p, rest...);\n}\n#define VEC(type, c, n) \\\\\n std::vector<type> c(n); \\\\\n for (auto &i : c) \\\\\n std::cin >> i;\n#define MAT(type, c, m, n) \\\\\n std::vector<std::vector<type>> c(m, std::vector<type>(n)); \\\\\n for (auto &R : c) \\\\\n for (auto &w : R) \\\\\n std::cin >> w;\n\/\/ output\n#define OUT(dist) std::cout << (dist);\n#define FOUT(n, dist) std::cout << std::fixed << std::setprecision(n) << (dist);\n#define SOUT(n, c, dist) std::cout << std::setw(n) << std::setfill(c) << (dist);\n#define SP std::cout << \" \";\n#define TAB std::cout << \"\\\\t\";\n#define BR std::cout << \"\\\\n\";\n#define SPBR(w, n) std::cout << (w + 1 == n ? '\\\\n' : ' ');\n#define ENDL std::cout << std::endl;\n#define FLUSH std::cout << std::flush;\n#define SHOW(dist) \\\\\n { std::cerr << #dist << \"\\\\t:\" << (dist) << \"\\\\n\"; }\n#define SHOWVECTOR(v) \\\\\n { \\\\\n std::cerr << #v << \"\\\\t:\"; \\\\\n for (const auto &xxx : v) { \\\\\n std::cerr << xxx << \" \"; \\\\\n } \\\\\n std::cerr << \"\\\\n\"; \\\\\n }\n#define SHOWVECTOR2(v) \\\\\n { \\\\\n std::cerr << #v << \"\\\\t:\\\\n\"; \\\\\n for (const auto &xxx : v) { \\\\\n for (const auto &yyy : xxx) { \\\\\n std::cerr << yyy << \" \"; \\\\\n } \\\\\n std::cerr << \"\\\\n\"; \\\\\n } \\\\\n }\n#define SHOWQUEUE(a) \\\\\n { \\\\\n auto tmp(a); \\\\\n std::cerr << #a << \"\\\\t:\"; \\\\\n while (!tmp.empty()) { \\\\\n std::cerr << tmp.front() << \" \"; \\\\\n tmp.pop(); \\\\\n } \\\\\n std::cerr << \"\\\\n\"; \\\\\n }\n\/\/ utility\n#define ALL(a) (a).begin(), (a).end()\n#define FOR(w, a, n) for (int w = (a); w < (n); ++w)\n#define RFOR(w, a, n) for (int w = (n)-1; w >= (a); --w)\n#define REP(w, n) for (int w = 0; w < int(n); ++w)\n#define RREP(w, n) for (int w = int(n) - 1; w >= 0; --w)\n#define FORLL(w, a, n) for (ll w = ll(a); w < ll(n); ++w)\n#define RFORLL(w, a, n) for (ll w = ll(n) - 1; w >= ll(a); --w)\n#define REPLL(w, n) for (ll w = 0; w < ll(n); ++w)\n#define RREPLL(w, n) for (ll w = ll(n) - 1; w >= 0; --w)\n#define IN(a, x, b) (a <= x && x < b)\ntemplate <class T> inline T CHMAX(T &a, const T b) {\n return a = (a < b) ? b : a;\n}\ntemplate <class T> inline T CHMIN(T &a, const T b) {\n return a = (a > b) ? b : a;\n}\n#define EXCEPTION(msg) \\\\\n throw std::string(\"Exception : \" msg \" [ in \") + __func__ + \" : \" + \\\\\n std::to_string(__LINE__) + \" lines ]\"\n#define TRY(cond, msg) \\\\\n try { \\\\\n if (cond) \\\\\n EXCEPTION(msg); \\\\\n } catch (std::string s) { \\\\\n std::cerr << s << std::endl; \\\\\n }\n\/\/ void CHECKTIME(std::function<void()> f) { auto start =\n\/\/ std::chrono::system_clock::now(); f(); auto end =\n\/\/ std::chrono::system_clock::now(); auto res =\n\/\/ std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count();\n\/\/ std::cerr << \"[Time:\" << res << \"ns (\" << res \/ (1.0e9) << \"s)]\\\\n\"; }\n\/\/ test\ntemplate <class T> using V = std::vector<T>;\ntemplate <class T> using VV = V<V<T>>;\n\ntemplate <typename S, typename T>\nstd::ostream &operator<<(std::ostream &os, std::pair<S, T> p) {\n os << \"(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\n\n#define random_shuffle \"USE std::shuffle!\";\n\n\/\/ type\/const\n#define int ll\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing PAIR = std::pair<int, int>;\nusing PAIRLL = std::pair<ll, ll>;\nconstexpr int INFINT = 1 << 30; \/\/ 1.07x10^ 9\nconstexpr int INFINT_LIM = (1LL << 31) - 1; \/\/ 2.15x10^ 9\nconstexpr ll INFLL = 1LL << 60; \/\/ 1.15x10^18\nconstexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); \/\/ 9.22x10^18\nconstexpr double EPS = 1e-6;\nconstexpr int MOD = 998244353;\nconstexpr double PI = 3.141592653589793238462643383279;\ntemplate <class T, size_t N> void FILL(T (&a)[N], const T &val) {\n for (auto &x : a)\n x = val;\n}\ntemplate <class ARY, size_t N, size_t M, class T>\nvoid FILL(ARY (&a)[N][M], const T &val) {\n for (auto &b : a)\n FILL(b, val);\n}\ntemplate <class T> void FILL(std::vector<T> &a, const T &val) {\n for (auto &x : a)\n x = val;\n}\ntemplate <class ARY, class T>\nvoid FILL(std::vector<std::vector<ARY>> &a, const T &val) {\n for (auto &b : a)\n FILL(b, val);\n}\n\/\/ ------------>8------------------------------------->8------------\n\nvoid add(char &c, int d) {\n int t = c - 'a' + d;\n t %= 26;\n if (t < 0)\n t += 26;\n c = 'a' + t;\n}\n\nbool calc() {\n VAR(std::string, s);\n VAR(int, n);\n VEC_ROW(int, n, l, r);\n\n std::string t(s.rbegin(), s.rend());\n int M = s.size();\n int m = M \/ 2;\n s.resize(m);\n t.resize(m);\n\n std::vector<std::set<int>> segset(m + 1);\n std::vector<int> seg(m + 1, -1);\n\n REP(i, n) {\n --l[i];\n --r[i];\n if (r[i] < m)\n continue;\n if (l[i] >= M - m) {\n l[i] = M - 1 - l[i];\n r[i] = M - 1 - r[i];\n std::swap(l[i], r[i]);\n continue;\n }\n r[i] = M - 1 - r[i];\n if (l[i] == r[i]) {\n l[i] = r[i] = -1;\n } else if (l[i] < r[i]) {\n --r[i];\n } else if (r[i] < l[i]) {\n --l[i];\n std::swap(l[i], r[i]);\n }\n }\n\n REP(i, n) {\n if (l[i] == -1)\n continue;\n segset[l[i]].insert(r[i]);\n }\n\n REP(i, m) {\n int pre = -1;\n for (auto &x : segset[i]) {\n if (pre != -1) {\n if (pre + 1 <= x)\n segset[pre + 1].insert(x);\n }\n pre = x;\n }\n if (!segset[i].empty()) {\n seg[i] = *segset[i].begin();\n }\n segset[i].clear();\n }\n\n std::vector<int> imos(m + 1, 0);\n REP(i, m) {\n add(s[i], imos[i]);\n if (s[i] != t[i]) {\n if (seg[i] == -1)\n return false;\n\n int d = t[i] - s[i];\n if (d < 0)\n d += 26;\n add(s[i], d);\n assert(s[i] == t[i]);\n\n imos[i] += d;\n imos[seg[i] + 1] -= d;\n }\n (imos[i + 1] += imos[i]) %= 26;\n }\n assert(s == t);\n\n return true;\n}\n\nsigned main() {\n INIT;\n\n OUT(calc() ? \"YES\" : \"NO\") BR;\n\n return 0;\n}","change":"replace","i1":209,"i2":264,"j1":209,"j2":270,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03537","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)\nusing namespace std;\ntypedef long long ll;\n\nstring S;\nll N, L[100000], R[100000];\nvector<ll> E[100000];\nvector<ll> d;\nbool visited[100000];\n\nll dfs(ll v) {\n if (visited[v])\n return 0;\n visited[v] = true;\n\n ll ret = d[v];\n for (ll u : E[v])\n ret += dfs(u);\n return ret;\n}\n\nint main(void) {\n cin >> S >> N;\n REP(i, 0, N) cin >> L[i] >> R[i], L[i]--, R[i];\n\n S = \"a\" + S + \"a\";\n REP(i, 0, S.length() - 1) d.push_back((S[i + 1] - S[i] + 26) % 26);\n\n REP(i, 0, N) {\n E[L[i]].push_back(R[i]);\n E[R[i]].push_back(L[i]);\n }\n REP(i, 0, (d.size()) \/ 2) {\n E[i].push_back(d.size() - 1 - i);\n E[d.size() - 1 - i].push_back(i);\n }\n\n bool ans = true;\n REP(i, 0, S.length() - 1) visited[i] = false;\n REP(i, 0, S.length() - 1) {\n ll sum = dfs(i) % 26;\n if (sum != 0)\n ans = false;\n }\n cout << (ans ? \"YES\" : \"NO\") << endl;\n}\n","fail":"#include <bits\/stdc++.h>\n#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)\nusing namespace std;\ntypedef long long ll;\n\nstring S;\nll N, L[200000], R[200000];\nvector<ll> E[200000];\nvector<ll> d;\nbool visited[200000];\n\nll dfs(ll v) {\n if (visited[v])\n return 0;\n visited[v] = true;\n\n ll ret = d[v];\n for (ll u : E[v])\n ret += dfs(u);\n return ret;\n}\n\nint main(void) {\n cin >> S >> N;\n REP(i, 0, N) cin >> L[i] >> R[i], L[i]--, R[i];\n\n S = \"a\" + S + \"a\";\n REP(i, 0, S.length() - 1) d.push_back((S[i + 1] - S[i] + 26) % 26);\n\n REP(i, 0, N) {\n E[L[i]].push_back(R[i]);\n E[R[i]].push_back(L[i]);\n }\n REP(i, 0, (d.size()) \/ 2) {\n E[i].push_back(d.size() - 1 - i);\n E[d.size() - 1 - i].push_back(i);\n }\n\n bool ans = true;\n REP(i, 0, d.size()) visited[i] = false;\n REP(i, 0, d.size()) {\n ll sum = dfs(i) % 26;\n if (sum != 0)\n ans = false;\n }\n cout << (ans ? \"YES\" : \"NO\") << endl;\n}\n","change":"replace","i1":6,"i2":41,"j1":6,"j2":41,"error":"0","stderr":null,"stdout":"YES\n"}
{"problem_id":"p03537","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define _rep(i, n) _repl(i, 0, n)\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp(a, b) make_pair((a), (b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(), (x).end()\n#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string) { cout << endl; }\ntemplate <class H, class... T> void _dbg(string s, H h, T... t) {\n int l = s.find(',');\n cout << s.substr(0, l) << \" = \" << h << \", \";\n _dbg(s.substr(l + 1), t...);\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &o, const pair<T, U> &p) {\n o << \"(\" << p.fi << \",\" << p.se << \")\";\n return o;\n}\ntemplate <class T> ostream &operator<<(ostream &o, const vector<T> &v) {\n o << \"[\";\n for (T t : v) {\n o << t << \",\";\n }\n o << \"]\";\n return o;\n}\n\n#define INF 1120000000\n\nclass UnionFind {\npublic:\n vector<int> par, rank;\n \/\/ if par is negative, it is a root, of which tree size is the abs-value.\n \/\/ rank represents depth\n UnionFind(int sz) : par(sz, -1), rank(sz, 0) {}\n int find(int x) {\n if (par[x] < 0)\n return x;\n else\n return par[x] = find(par[x]);\n }\n void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y)\n return;\n if (rank[x] < rank[y])\n swap(x, y);\n par[x] += par[y];\n par[y] = x;\n if (rank[x] == rank[y])\n rank[x]++;\n }\n inline bool same(int x, int y) { return find(x) == find(y); }\n inline int size(int x) { return -par[find(x)]; }\n};\n\nbool solve() {\n string s;\n int q;\n cin >> s >> q;\n int n = s.size();\n vector<int> l(q), r(q);\n rep(i, q) cin >> l[i] >> r[i];\n\n if (n == 1)\n return true;\n\n rep(i, q) {\n l[i]--;\n if (l[i] < n \/ 2 && (n + 1) \/ 2 < r[i]) {\n if (l[i] < n - r[i]) {\n r[i] = n - r[i];\n } else if (n - r[i] < l[i]) {\n int ll = l[i];\n int rr = r[i];\n l[i] = n - rr;\n r[i] = ll;\n } else {\n l[i] = (n + 1) \/ 2;\n r[i] = (n + 1) \/ 2;\n }\n } else if (n \/ 2 <= l[i]) {\n swap(l[i], r[i]);\n l[i] = n - l[i];\n r[i] = n - r[i];\n }\n }\n\n UnionFind uf(q);\n\n map<int, int> pos;\n \/\/ positions -> idx\n rep(i, q) {\n if (pos.count(l[i])) {\n uf.unite(i, pos[l[i]]);\n } else {\n pos[l[i]] = i;\n }\n if (pos.count(r[i])) {\n uf.unite(i, pos[r[i]]);\n } else {\n pos[r[i]] = i;\n }\n }\n \/\/ rep(i,q)dbg(l[i],r[i]);\n\n \/\/ build range group\n map<int, vector<int>> gp;\n rep(i, q) {\n gp[uf.find(i)].pb(l[i]);\n gp[uf.find(i)].pb(r[i]);\n }\n\n vector<int> ranges(n \/ 2 + 1, -1); \/\/ begin -> end\n for (auto &&pv : gp) {\n auto &&v = pv.second;\n if (v.size()) {\n uniq(v);\n assert(v.size() >= 2);\n rep(i, v.size() - 1) { ranges[v[i]] = v[i + 1]; }\n }\n }\n \/\/ dbg(ranges);\n\n int crnt = 0;\n vector<int> memo(n \/ 2 + 1, 0);\n rep(i, n \/ 2) {\n int req = (s[n - i - 1] - s[i] + 26) % 26;\n crnt = (crnt + memo[i] + 26) % 26;\n if (crnt != req) {\n if (ranges[i] == -1)\n return false;\n int add = (req + 26 - crnt) % 26;\n assert(memo[ranges[i]] == 0 && add > 0);\n memo[ranges[i]] = -add;\n crnt = (crnt + add) % 26;\n }\n assert(crnt == req);\n }\n\n return true;\n}\n\nint main() {\n if (solve())\n cout << \"YES\" << endl;\n else\n cout << \"NO\" << endl;\n\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define _rep(i, n) _repl(i, 0, n)\n#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define mp(a, b) make_pair((a), (b))\n#define pb(a) push_back((a))\n#define all(x) (x).begin(), (x).end()\n#define uniq(x) sort(all(x)), (x).erase(unique(all(x)), end(x))\n#define fi first\n#define se second\n#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\nvoid _dbg(string) { cout << endl; }\ntemplate <class H, class... T> void _dbg(string s, H h, T... t) {\n int l = s.find(',');\n cout << s.substr(0, l) << \" = \" << h << \", \";\n _dbg(s.substr(l + 1), t...);\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &o, const pair<T, U> &p) {\n o << \"(\" << p.fi << \",\" << p.se << \")\";\n return o;\n}\ntemplate <class T> ostream &operator<<(ostream &o, const vector<T> &v) {\n o << \"[\";\n for (T t : v) {\n o << t << \",\";\n }\n o << \"]\";\n return o;\n}\n\n#define INF 1120000000\n\nclass UnionFind {\npublic:\n vector<int> par, rank;\n \/\/ if par is negative, it is a root, of which tree size is the abs-value.\n \/\/ rank represents depth\n UnionFind(int sz) : par(sz, -1), rank(sz, 0) {}\n int find(int x) {\n if (par[x] < 0)\n return x;\n else\n return par[x] = find(par[x]);\n }\n void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y)\n return;\n if (rank[x] < rank[y])\n swap(x, y);\n par[x] += par[y];\n par[y] = x;\n if (rank[x] == rank[y])\n rank[x]++;\n }\n inline bool same(int x, int y) { return find(x) == find(y); }\n inline int size(int x) { return -par[find(x)]; }\n};\n\nbool solve() {\n string s;\n int q;\n cin >> s >> q;\n int n = s.size();\n vector<int> l(q), r(q);\n rep(i, q) cin >> l[i] >> r[i];\n\n if (n == 1)\n return true;\n\n rep(i, q) {\n l[i]--;\n if (l[i] < n \/ 2 && (n + 1) \/ 2 < r[i]) {\n if (l[i] < n - r[i]) {\n r[i] = n - r[i];\n } else if (n - r[i] < l[i]) {\n int ll = l[i];\n int rr = r[i];\n l[i] = n - rr;\n r[i] = ll;\n } else {\n l[i] = (n + 1) \/ 2;\n r[i] = (n + 1) \/ 2;\n }\n } else if (n \/ 2 <= l[i]) {\n swap(l[i], r[i]);\n l[i] = n - l[i];\n r[i] = n - r[i];\n }\n }\n\n UnionFind uf(q);\n\n map<int, int> pos;\n \/\/ positions -> idx\n rep(i, q) {\n if (pos.count(l[i])) {\n uf.unite(i, pos[l[i]]);\n } else {\n pos[l[i]] = i;\n }\n if (pos.count(r[i])) {\n uf.unite(i, pos[r[i]]);\n } else {\n pos[r[i]] = i;\n }\n }\n \/\/ rep(i,q)dbg(l[i],r[i]);\n\n \/\/ build range group\n map<int, vector<int>> gp;\n rep(i, q) {\n gp[uf.find(i)].pb(l[i]);\n gp[uf.find(i)].pb(r[i]);\n }\n\n vector<int> ranges(n \/ 2 + 1, -1); \/\/ begin -> end\n for (auto &&pv : gp) {\n auto &&v = pv.second;\n if (v.size()) {\n uniq(v);\n rep(i, v.size() - 1) { ranges[v[i]] = v[i + 1]; }\n }\n }\n \/\/ dbg(ranges);\n\n int crnt = 0;\n vector<int> memo(n \/ 2 + 1, 0);\n rep(i, n \/ 2) {\n int req = (s[n - i - 1] - s[i] + 26) % 26;\n crnt = (crnt + memo[i]) % 26;\n if (crnt != req) {\n if (ranges[i] == -1)\n return false;\n int add = (req + 26 - crnt) % 26;\n memo[ranges[i]] = 26 - add;\n crnt = (crnt + add) % 26;\n }\n assert(crnt == req);\n }\n\n return true;\n}\n\nint main() {\n if (solve())\n cout << \"YES\" << endl;\n else\n cout << \"NO\" << endl;\n\n return 0;\n}\n","change":"replace","i1":125,"i2":142,"j1":125,"j2":140,"error":"0","stderr":null,"stdout":"YES\n"}
{"problem_id":"p03537","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <iostream>\n#include <set>\n#include <vector>\n\nusing namespace std;\n\nvoid failure() {\n cout << \"NO\" << endl;\n exit(0);\n}\n\ntypedef long long ll;\n\nconst int MOD = 26; \/\/ change if needed\n\nstruct Modint {\n ll val;\n\n Modint(ll _val = 0) : val(_val % MOD) {}\n\n Modint operator+(Modint other) const { return Modint(val + other.val); }\n\n void operator+=(Modint other) {\n val += other.val;\n val %= MOD;\n }\n\n Modint operator-() const { return Modint(MOD - val); }\n\n Modint operator-(Modint other) const { return Modint(val + MOD - other.val); }\n\n void operator-=(Modint other) {\n val += MOD - other.val;\n val %= MOD;\n }\n\n Modint operator*(Modint other) const { return Modint(val * other.val); }\n\n void operator*=(Modint other) {\n val *= other.val;\n val %= MOD;\n }\n\n bool operator==(Modint other) const { return val == other.val; }\n\n bool operator!=(Modint other) const { return val != other.val; }\n};\n\nModint exp(Modint a, int k) {\n if (k == 0) {\n return Modint(1);\n } else if (k % 2 == 0) {\n Modint half = exp(a, k \/ 2);\n return half * half;\n } else {\n return a * exp(a, k - 1);\n }\n}\n\nModint inv(Modint a) { return exp(a, MOD - 2); }\n\nostream &operator<<(ostream &out, Modint p) {\n out << p.val;\n return out;\n}\n\ntypedef pair<int, int> interval;\n#define l first\n#define r second\n\nconst int MAX_Q = 1e5 + 5;\n\ninterval qs[MAX_Q];\nset<int> rs[MAX_Q];\nModint sub[MAX_Q];\n\nModint A[MAX_Q];\nModint B[MAX_Q];\n\nint main() {\n ios::sync_with_stdio(false);\n\n string s;\n cin >> s;\n\n int qc;\n cin >> qc;\n\n for (int i = 0; i < qc; i++) {\n cin >> qs[i].l >> qs[i].r;\n qs[i].l--;\n qs[i].r--;\n }\n\n if ((int)s.size() % 2 == 1) {\n int mid = (int)s.size() \/ 2;\n string t;\n for (int i = 0; i < (int)s.size(); i++) {\n if (i != mid) {\n t += s[i];\n }\n }\n s = t;\n\n for (int i = 0; i < qc; i++) {\n if (qs[i].l > mid) {\n qs[i].l--;\n }\n\n if (qs[i].r >= mid) {\n qs[i].r--;\n }\n }\n }\n\n int n = s.size();\n int m = n \/ 2;\n\n for (int i = 0; i < qc; i++) {\n if (qs[i].l <= qs[i].r) {\n int l = qs[i].l;\n int r = qs[i].r;\n\n int flips = 0;\n if (l >= m) {\n l = n - l - 1;\n flips++;\n }\n if (r >= m) {\n r = n - r - 1;\n flips++;\n }\n if (l > r)\n swap(l, r);\n if (flips == 1) {\n r--;\n }\n\n if (l <= r) {\n rs[l].insert(r);\n }\n }\n }\n\n for (int i = 0; i < m; i++) {\n A[i] = Modint(s[i] - 'a');\n }\n\n for (int i = 0; i < m; i++) {\n B[i] = Modint(s[n - i - 1] - 'a');\n }\n\n Modint cur(0);\n for (int i = 0; i < m; i++) {\n cur -= sub[i];\n Modint need = B[i] - (A[i] + cur);\n bool can = !rs[i].empty();\n\n if (can) {\n int nl = *rs[i].begin() + 1;\n rs[i].erase(nl - 1);\n\n for (int r : rs[i]) {\n if (r >= nl) {\n rs[nl].insert(r);\n }\n }\n\n cur += need;\n sub[nl] += need;\n } else if (need != Modint(0)) {\n failure();\n }\n }\n\n cout << \"YES\" << endl;\n}\n","fail":"#include <iostream>\n#include <set>\n#include <vector>\n\nusing namespace std;\n\nvoid failure() {\n cout << \"NO\" << endl;\n exit(0);\n}\n\ntypedef long long ll;\n\nconst int MOD = 26; \/\/ change if needed\n\nstruct Modint {\n ll val;\n\n Modint(ll _val = 0) : val(_val % MOD) {}\n\n Modint operator+(Modint other) const { return Modint(val + other.val); }\n\n void operator+=(Modint other) {\n val += other.val;\n val %= MOD;\n }\n\n Modint operator-() const { return Modint(MOD - val); }\n\n Modint operator-(Modint other) const { return Modint(val + MOD - other.val); }\n\n void operator-=(Modint other) {\n val += MOD - other.val;\n val %= MOD;\n }\n\n Modint operator*(Modint other) const { return Modint(val * other.val); }\n\n void operator*=(Modint other) {\n val *= other.val;\n val %= MOD;\n }\n\n bool operator==(Modint other) const { return val == other.val; }\n\n bool operator!=(Modint other) const { return val != other.val; }\n};\n\nModint exp(Modint a, int k) {\n if (k == 0) {\n return Modint(1);\n } else if (k % 2 == 0) {\n Modint half = exp(a, k \/ 2);\n return half * half;\n } else {\n return a * exp(a, k - 1);\n }\n}\n\nModint inv(Modint a) { return exp(a, MOD - 2); }\n\nostream &operator<<(ostream &out, Modint p) {\n out << p.val;\n return out;\n}\n\ntypedef pair<int, int> interval;\n#define l first\n#define r second\n\nconst int MAX_Q = 1e5 + 5;\n\ninterval qs[MAX_Q];\nset<int> *rs[MAX_Q];\nModint sub[MAX_Q];\n\nModint A[MAX_Q];\nModint B[MAX_Q];\n\nset<int> *merge(set<int> *p, set<int> *q) {\n if (p->size() < q->size()) {\n swap(p, q);\n }\n\n for (auto it = q->begin(); it != q->end(); it++) {\n p->insert(*it);\n }\n return p;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n\n string s;\n cin >> s;\n\n int qc;\n cin >> qc;\n\n for (int i = 0; i < qc; i++) {\n cin >> qs[i].l >> qs[i].r;\n qs[i].l--;\n qs[i].r--;\n }\n\n if ((int)s.size() % 2 == 1) {\n int mid = (int)s.size() \/ 2;\n string t;\n for (int i = 0; i < (int)s.size(); i++) {\n if (i != mid) {\n t += s[i];\n }\n }\n s = t;\n\n for (int i = 0; i < qc; i++) {\n if (qs[i].l > mid) {\n qs[i].l--;\n }\n\n if (qs[i].r >= mid) {\n qs[i].r--;\n }\n }\n }\n\n int n = s.size();\n int m = n \/ 2;\n\n for (int i = 0; i < n; i++) {\n rs[i] = new set<int>();\n }\n\n for (int i = 0; i < qc; i++) {\n if (qs[i].l <= qs[i].r) {\n int l = qs[i].l;\n int r = qs[i].r;\n\n int flips = 0;\n if (l >= m) {\n l = n - l - 1;\n flips++;\n }\n if (r >= m) {\n r = n - r - 1;\n flips++;\n }\n if (l > r)\n swap(l, r);\n if (flips == 1) {\n r--;\n }\n\n if (l <= r) {\n rs[l]->insert(r);\n }\n }\n }\n\n for (int i = 0; i < m; i++) {\n A[i] = Modint(s[i] - 'a');\n }\n\n for (int i = 0; i < m; i++) {\n B[i] = Modint(s[n - i - 1] - 'a');\n }\n\n Modint cur(0);\n for (int i = 0; i < m; i++) {\n cur -= sub[i];\n Modint need = B[i] - (A[i] + cur);\n bool can = !rs[i]->empty();\n\n if (can) {\n int nl = *(rs[i]->begin()) + 1;\n rs[i]->erase(nl - 1);\n rs[nl] = merge(rs[i], rs[nl]);\n\n cur += need;\n sub[nl] += need;\n } else if (need != Modint(0)) {\n failure();\n }\n }\n\n cout << \"YES\" << endl;\n}\n","change":"replace","i1":73,"i2":167,"j1":73,"j2":177,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03537","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\n\ntypedef pair<int, int> P;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define all(c) (c).begin(), (c).end()\n#define uniq(c) c.erase(unique(all(c)), (c).end())\n#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())\n#define _1 first\n#define _2 second\n#define pb push_back\n#define INF 1145141919\n#define MOD 1000000007\nint U[100001];\nset<int> R[100001];\n\nint find(int x) {\n if (U[x] == x)\n return x;\n return U[x] = find(U[x]);\n}\n\nvoid unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y)\n return;\n if (R[x].size() < R[y].size())\n swap(x, y);\n U[y] = x;\n for (int e : R[y])\n R[x].insert(e);\n R[y].clear();\n}\n\nbool same(int x, int y) { return find(x) == find(y); }\ninline int mins(int v) { return (26 - (v % 26)) % 26; }\n\nint N, M;\nstring S;\nint A[100001];\nbool done[100001];\nvoid add(int p, int v) {\n v = (26 + v) % 26;\n A[p] = (A[p] + v) % 26;\n}\nbool go(int pos, int v) {\n v = (26 + v) % 26;\n if (R[find(pos)].empty())\n return false;\n int a = A[pos];\n int left = *R[find(pos)].begin(), right = *R[find(pos)].rbegin();\n if (!done[left]) {\n add(left, a - v);\n add(pos, v - a);\n assert(A[pos] == v);\n return true;\n }\n if (!done[right]) {\n add(right, a - v);\n add(pos, v - a);\n assert(A[pos] == v);\n return true;\n }\n return false;\n}\n\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cin >> S >> M;\n N = S.length();\n rep(i, N + 1) U[i] = i, R[i].insert(i);\n rep(i, M) {\n int l, r;\n cin >> l >> r;\n l--;\n unite(l, r);\n }\n rep(i, N) A[i] = S[i] - (i > 0 ? S[i - 1] : 'a');\n rep(i, N) A[i] = ((A[i] % 26) + 26) % 26;\n A[N] = 0;\n N++;\n if (N % 2 == 1) {\n int pos = (N - 1) \/ 2;\n \/\/ pos -> 0\n if (A[pos] != 0) {\n if (!go(pos, 0)) {\n cout << \"NO\\\\n\";\n return 0;\n }\n }\n done[pos] = true;\n }\n for (int p = N \/ 2 - 1; p >= 1; p--) {\n int right = N - 1 - p;\n done[p] = done[right] = true;\n if (A[p] == mins(A[right]))\n continue;\n if (go(p, -A[right]) || go(right, -A[p])) {\n unite(p, right);\n } else {\n cout << \"NO\\\\n\";\n return 0;\n }\n }\n cout << \"YES\\\\n\";\n return 0;\n}\n","fail":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\n\ntypedef pair<int, int> P;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define all(c) (c).begin(), (c).end()\n#define uniq(c) c.erase(unique(all(c)), (c).end())\n#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())\n#define _1 first\n#define _2 second\n#define pb push_back\n#define INF 1145141919\n#define MOD 1000000007\nint U[100001];\nset<int> R[100001];\n\nint find(int x) {\n if (U[x] == x)\n return x;\n return U[x] = find(U[x]);\n}\n\nvoid unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y)\n return;\n if (R[x].size() < R[y].size())\n swap(x, y);\n U[y] = x;\n for (int e : R[y])\n R[x].insert(e);\n R[y].clear();\n}\n\nbool same(int x, int y) { return find(x) == find(y); }\ninline int mins(int v) { return (26 - (v % 26)) % 26; }\n\nint N, M;\nstring S;\nint A[100001];\nbool done[100001];\nvoid add(int p, int v) {\n v = (26 + v) % 26;\n A[p] = (A[p] + v) % 26;\n}\nbool go(int pos, int v) {\n v = (26 + v) % 26;\n if (R[find(pos)].empty())\n return false;\n int a = A[pos];\n int left = *R[find(pos)].begin(), right = *R[find(pos)].rbegin();\n if (!done[left]) {\n add(left, a - v);\n add(pos, v - a);\n assert(A[pos] == v);\n return true;\n }\n if (!done[right]) {\n add(right, a - v);\n add(pos, v - a);\n assert(A[pos] == v);\n return true;\n }\n return false;\n}\n\nsigned main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cin >> S >> M;\n N = S.length();\n rep(i, N + 1) U[i] = i, R[i].insert(i);\n rep(i, M) {\n int l, r;\n cin >> l >> r;\n l--;\n unite(l, r);\n }\n rep(i, N) A[i] = S[i] - (i > 0 ? S[i - 1] : 'a');\n rep(i, N) A[i] = ((A[i] % 26) + 26) % 26;\n A[N] = 0;\n N++;\n for (int p = N \/ 2 - 1; p >= 0; p--) {\n int right = N - 1 - p;\n unite(p, right);\n }\n if (N % 2 == 1) {\n int pos = (N - 1) \/ 2;\n \/\/ pos -> 0\n done[pos] = true;\n if (A[pos] != 0) {\n if (!go(pos, 0)) {\n cout << \"NO\\\\n\";\n return 0;\n }\n }\n }\n int hoge = N \/ 2;\n for (int p = N \/ 2 - 1; p >= 1; p--) {\n int right = N - 1 - p;\n done[p] = done[right] = true;\n if (A[p] == mins(A[right]))\n continue;\n if (go(p, mins(A[right])) || go(right, mins(A[p]))) {\n } else {\n cout << \"NO\\\\n\";\n return 0;\n }\n }\n cout << \"YES\\\\n\";\n return 0;\n}\n","change":"replace","i1":94,"i2":112,"j1":94,"j2":116,"error":"0","stderr":null,"stdout":"YES\n"}
{"problem_id":"p03537","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n#define EACH(i, s) \\\\\n for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n\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}\ntemplate <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {\n return s << '<' << P.first << \", \" << P.second << '>';\n}\ntemplate <class T> ostream &operator<<(ostream &s, vector<T> P) {\n for (int i = 0; i < P.size(); ++i) {\n if (i > 0) {\n s << \" \";\n }\n s << P[i];\n }\n return s;\n}\ntemplate <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {\n for (int i = 0; i < P.size(); ++i) {\n s << endl << P[i];\n }\n return s << endl;\n}\ntemplate <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {\n EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; }\n return s << endl;\n}\n\ntypedef pair<int, int> pint;\nconst int MAX = 210000;\n\nconst int MAX_UF = MAX;\nstruct UnionFind {\n int size_;\n int par[MAX_UF];\n int rank[MAX_UF];\n\n UnionFind(int n = 0) {\n size_ = n;\n for (int i = 0; i < n; ++i)\n par[i] = i, rank[i] = 0;\n }\n void init(int n) {\n size_ = n;\n for (int i = 0; i < n; ++i)\n par[i] = i, rank[i] = 0;\n }\n int root(int x) { return par[x] == x ? x : par[x] = root(par[x]); }\n bool same(int x, int y) { return root(x) == root(y); }\n\n void connect(int x, int y) {\n x = root(x);\n y = root(y);\n if (x == y)\n return;\n if (rank[x] < rank[y])\n par[x] = y;\n else {\n par[y] = x;\n if (rank[x] == rank[y])\n ++rank[x];\n }\n }\n\n friend ostream &operator<<(ostream &s, UnionFind uf) {\n return s << uf.group();\n }\n vector<vector<int>> group() {\n vector<vector<int>> res;\n vector<bool> fixed(size_, false);\n for (int i = 0; i < size_; ++i) {\n if (!fixed[i]) {\n vector<int> temp;\n for (int j = i; j < size_; ++j) {\n if (same(i, j))\n temp.push_back(j), fixed[j] = true;\n }\n res.push_back(temp);\n }\n }\n return res;\n }\n} uf;\n\nstring str;\nint a[MAX];\nint b[MAX];\nint N;\npint seg[MAX];\n\nbool solve() {\n int n = str.size() + 1;\n\n vector<vector<int>> grs = uf.group();\n for (int i = 0; i < grs.size(); ++i) {\n int sum = 0;\n for (auto v : grs[i])\n sum += b[v];\n while (sum < 0)\n sum += 26;\n if (sum % 26 != 0)\n return false;\n }\n return true;\n}\n\nint main() {\n while (cin >> str >> N) {\n int n = str.size() + 1;\n uf.init(n);\n for (int i = 0; i < N; ++i) {\n cin >> seg[i].first >> seg[i].second;\n --seg[i].first;\n uf.connect(seg[i].first, seg[i].second);\n }\n for (int i = 0; i < n \/ 2; ++i) {\n int j = n - i - 1;\n uf.connect(i, j);\n }\n\n memset(a, 0, sizeof(a));\n for (int i = 0; i < str.size(); ++i) {\n a[i] = (int)(str[i] - 'a');\n }\n b[0] = a[0];\n for (int i = 0; i < str.size(); ++i) {\n b[i + 1] = a[i + 1] - a[i];\n if (b[i + 1] < 0)\n b[i + 1] += 26;\n \/\/ cout << i + 1 << \", \" << a[i+1] << \", \" << b[i+1] << endl;\n }\n \/\/ COUT(uf);\n\n if (solve())\n puts(\"YES\");\n else\n puts(\"NO\");\n }\n}\n","fail":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define COUT(x) cout << #x << \" = \" << (x) << \" (L\" << __LINE__ << \")\" << endl\n#define EACH(i, s) \\\\\n for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)\n\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}\ntemplate <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {\n return s << '<' << P.first << \", \" << P.second << '>';\n}\ntemplate <class T> ostream &operator<<(ostream &s, vector<T> P) {\n for (int i = 0; i < P.size(); ++i) {\n if (i > 0) {\n s << \" \";\n }\n s << P[i];\n }\n return s;\n}\ntemplate <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {\n for (int i = 0; i < P.size(); ++i) {\n s << endl << P[i];\n }\n return s << endl;\n}\ntemplate <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {\n EACH(it, P) { s << \"<\" << it->first << \"->\" << it->second << \"> \"; }\n return s << endl;\n}\n\ntypedef pair<int, int> pint;\nconst int MAX = 210000;\n\nconst int MAX_UF = MAX;\nstruct UnionFind {\n int size_;\n int par[MAX_UF];\n int rank[MAX_UF];\n\n UnionFind(int n = 0) {\n size_ = n;\n for (int i = 0; i < n; ++i)\n par[i] = i, rank[i] = 0;\n }\n void init(int n) {\n size_ = n;\n for (int i = 0; i < n; ++i)\n par[i] = i, rank[i] = 0;\n }\n int root(int x) { return par[x] == x ? x : par[x] = root(par[x]); }\n bool same(int x, int y) { return root(x) == root(y); }\n\n void connect(int x, int y) {\n x = root(x);\n y = root(y);\n if (x == y)\n return;\n if (rank[x] < rank[y])\n par[x] = y;\n else {\n par[y] = x;\n if (rank[x] == rank[y])\n ++rank[x];\n }\n }\n\n friend ostream &operator<<(ostream &s, UnionFind uf) {\n return s << uf.group();\n }\n vector<vector<int>> group() {\n vector<vector<int>> res;\n vector<bool> fixed(size_, false);\n for (int i = 0; i < size_; ++i) {\n if (!fixed[i]) {\n vector<int> temp;\n for (int j = i; j < size_; ++j) {\n if (same(i, j))\n temp.push_back(j), fixed[j] = true;\n }\n res.push_back(temp);\n }\n }\n return res;\n }\n} uf;\n\nstring str;\nint a[MAX];\nint b[MAX];\nint N;\npint seg[MAX];\n\nint sum[MAX];\n\nbool solve() {\n int n = str.size() + 1;\n\n memset(sum, 0, sizeof(sum));\n for (int i = 0; i < n; ++i) {\n int r = uf.root(i);\n sum[r] += b[i];\n }\n for (int i = 0; i < MAX; ++i) {\n if (sum[i] % 26 != 0)\n return false;\n }\n\n return true;\n}\n\nint main() {\n while (cin >> str >> N) {\n int n = str.size() + 1;\n uf.init(n);\n for (int i = 0; i < N; ++i) {\n cin >> seg[i].first >> seg[i].second;\n --seg[i].first;\n uf.connect(seg[i].first, seg[i].second);\n }\n for (int i = 0; i < n \/ 2; ++i) {\n int j = n - i - 1;\n uf.connect(i, j);\n }\n\n memset(a, 0, sizeof(a));\n for (int i = 0; i < str.size(); ++i) {\n a[i] = (int)(str[i] - 'a');\n }\n b[0] = a[0];\n for (int i = 0; i < str.size(); ++i) {\n b[i + 1] = a[i + 1] - a[i];\n if (b[i + 1] < 0)\n b[i + 1] += 26;\n \/\/ cout << i + 1 << \", \" << a[i+1] << \", \" << b[i+1] << endl;\n }\n \/\/ COUT(uf);\n\n if (solve())\n puts(\"YES\");\n else\n puts(\"NO\");\n }\n}\n","change":"replace","i1":125,"i2":138,"j1":125,"j2":140,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03537","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef signed long long ll;\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define FOR(x, to) for (x = 0; x < (to); x++)\n#define FORR(x, arr) for (auto &x : arr)\n#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)\n#define ALL(a) (a.begin()), (a.end())\n#define ZERO(a) memset(a, 0, sizeof(a))\n#define MINUS(a) memset(a, 0xff, sizeof(a))\n\/\/-------------------------------------------------------\n\nint L, N;\nstring S;\nvector<int> R[101010];\nll sum[101010];\n\nvoid solve() {\n int i, j, k, l, r, x, y;\n string s;\n\n cin >> S >> N;\n L = S.size();\n\n FORR(c, S) c -= 'a';\n FOR(i, N) {\n cin >> x >> y;\n x--, y--;\n if (y < (L + 1) \/ 2) {\n R[x].push_back(y);\n } else if (x >= L \/ 2) {\n R[L - 1 - y].push_back(L - 1 - x);\n } else {\n y = L - 1 - y;\n if (x < y)\n R[x].push_back(y - 1);\n if (y < x)\n R[y].push_back(x - 1);\n }\n }\n\n FOR(i, L \/ 2) {\n if (i)\n sum[i] += sum[i - 1];\n int dif = ((S[L - 1 - i] - (S[i] + sum[i])) % 26 + 26) % 26;\n sort(ALL(R[i]));\n FOR(j, R[i].size() - 1) {\n if (R[i][j] != R[i][j + 1])\n R[R[i][j] + 1].push_back(R[i][j + 1]);\n }\n if (dif == 0)\n continue;\n if (R[i].empty())\n return _P(\"NO\\\\n\");\n sum[i] += dif;\n sum[R[i][0] + 1] -= dif;\n }\n _P(\"YES\\\\n\");\n}\n\nint main(int argc, char **argv) {\n string s;\n int i;\n if (argc == 1)\n ios::sync_with_stdio(false), cin.tie(0);\n FOR(i, argc - 1) s += argv[i + 1], s += '\\\\n';\n FOR(i, s.size()) ungetc(s[s.size() - 1 - i], stdin);\n cout.tie(0);\n solve();\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef signed long long ll;\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define FOR(x, to) for (x = 0; x < (to); x++)\n#define FORR(x, arr) for (auto &x : arr)\n#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)\n#define ALL(a) (a.begin()), (a.end())\n#define ZERO(a) memset(a, 0, sizeof(a))\n#define MINUS(a) memset(a, 0xff, sizeof(a))\n\/\/-------------------------------------------------------\n\nint L, N;\nstring S;\nvector<int> R[101010];\nll sum[101010];\n\nvoid solve() {\n int i, j, k, l, r, x, y;\n string s;\n\n cin >> S >> N;\n L = S.size();\n\n FORR(c, S) c -= 'a';\n FOR(i, N) {\n cin >> x >> y;\n x--, y--;\n if (y < (L + 1) \/ 2) {\n R[x].push_back(y);\n } else if (x >= L \/ 2) {\n R[L - 1 - y].push_back(L - 1 - x);\n } else {\n y = L - 1 - y;\n if (x < y)\n R[x].push_back(y - 1);\n if (y < x)\n R[y].push_back(x - 1);\n }\n }\n\n FOR(i, L \/ 2) {\n if (i)\n sum[i] += sum[i - 1];\n int dif = ((S[L - 1 - i] - (S[i] + sum[i])) % 26 + 26) % 26;\n sort(ALL(R[i]));\n if (R[i].size() > 1) {\n FOR(j, R[i].size() - 1) {\n if (R[i][j] != R[i][j + 1])\n R[R[i][j] + 1].push_back(R[i][j + 1]);\n }\n }\n if (dif == 0)\n continue;\n if (R[i].empty())\n return _P(\"NO\\\\n\");\n sum[i] += dif;\n sum[R[i][0] + 1] -= dif;\n }\n _P(\"YES\\\\n\");\n}\n\nint main(int argc, char **argv) {\n string s;\n int i;\n if (argc == 1)\n ios::sync_with_stdio(false), cin.tie(0);\n FOR(i, argc - 1) s += argv[i + 1], s += '\\\\n';\n FOR(i, s.size()) ungetc(s[s.size() - 1 - i], stdin);\n cout.tie(0);\n solve();\n return 0;\n}\n","change":"replace","i1":48,"i2":51,"j1":48,"j2":53,"error":"-11","stderr":null,"stdout":null}
{"problem_id":"p03537","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define maxn 100100\nusing namespace std;\nint n, sum[maxn * 2], tp, m, a[maxn], f[maxn];\nchar s[maxn];\nint g(int x) { return x < 0 ? x + 26 : x; }\nint find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }\nint main() {\n scanf(\"%s%d\", s + 1, &n);\n int m = strlen(s + 1);\n for (int i = 1; i <= m; ++i)\n s[i] -= 'a', f[i] = i;\n f[m + 1] = m + 1;\n for (int i = m + 1; i >= 1; --i)\n s[i] = g(s[i] - s[i - 1]);\n for (int i = 1, l, r; i <= n; ++i)\n scanf(\"%d%d\", &l, &r), f[find(l)] = find(r + 1);\n for (int i = 1; i <= m - i + 2; ++i)\n f[find(i)] = find(m + 2 - i);\n for (int i = 1; i <= m + 1; ++i)\n sum[find(i)] += s[i];\n for (int i = 1; i <= m + 1; ++i)\n if (i == find(i) && sum[i] % 26)\n return puts(\"NO\");\n puts(\"YES\");\n}","fail":"#include <bits\/stdc++.h>\n#define maxn 1000100\nusing namespace std;\nint n, sum[maxn * 2], tp, m, a[maxn], f[maxn];\nchar s[maxn];\nint g(int x) { return x < 0 ? x + 26 : x; }\nint find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }\nint main() {\n scanf(\"%s%d\", s + 1, &n);\n int m = strlen(s + 1);\n for (int i = 1; i <= m; ++i)\n s[i] -= 'a', f[i] = i;\n f[m + 1] = m + 1;\n for (int i = m + 1; i >= 1; --i)\n s[i] = g(s[i] - s[i - 1]);\n for (int i = 1, l, r; i <= n; ++i)\n scanf(\"%d%d\", &l, &r), f[find(l)] = find(r + 1);\n for (int i = 1; i <= m - i + 2; ++i)\n f[find(i)] = find(m + 2 - i);\n for (int i = 1; i <= m + 1; ++i)\n sum[find(i)] += s[i];\n for (int i = 1; i <= m + 1; ++i)\n if (i == find(i) && sum[i] % 26)\n return puts(\"NO\"), 0;\n puts(\"YES\");\n}","change":"replace","i1":1,"i2":24,"j1":1,"j2":24,"error":"0","stderr":null,"stdout":"YES\n"}
{"problem_id":"p03537","language":"C++","original_status":"Runtime Error","pass":"#pragma comment(linker, \"\/STACK:512000000\")\n#define _CRT_SECURE_NO_WARNINGS\n\/*#if !defined(YCM) && 0\n#define _FORTIFY_SOURCE 0\n#pragma GCC optimize(\"Ofast,no-stack-protector\")\n#pragma GCC target(\"avx,tune=native\")\n#include <stdio.h>\n#endif*\/\n\/\/ #include \"testlib.h\"\n#include <bits\/stdc++.h>\nusing namespace std;\n\n#define all(a) a.begin(), a.end()\ntypedef long long li;\ntypedef long double ld;\nvoid solve(bool);\nvoid precalc();\nclock_t start;\nint main() {\n#ifdef AIM\n freopen(\"\/home\/alexandero\/ClionProjects\/ACM\/input.txt\", \"r\", stdin);\n \/\/ freopen(\"\/home\/alexandero\/ClionProjects\/ACM\/output.txt\", \"w\", stdout);\n \/\/ freopen(\"out.txt\", \"w\", stdout);\n#else\n \/\/ freopen(\"input.txt\", \"r\", stdin);\n \/\/ freopen(\"output.txt\", \"w\", stdout);\n#endif\n start = clock();\n int t = 1;\n cout.sync_with_stdio(0);\n cin.tie(0);\n precalc();\n cout.precision(10);\n cout << fixed;\n \/\/ cin >> t;\n int testNum = 1;\n while (t--) {\n \/\/ cout << \"Case #\" << testNum++ << \": \";\n \/\/ cerr << testNum << endl;\n solve(true);\n \/\/ cerr << testNum - 1 << endl;\n }\n cout.flush();\n#ifdef AIM1\n while (true) {\n solve(false);\n }\n#endif\n\n#ifdef AIM\n cerr << \"\\\\n\\\\n time: \" << (clock() - start) \/ 1.0 \/ CLOCKS_PER_SEC << \"\\\\n\\\\n\";\n#endif\n\n return 0;\n}\n\n\/\/ BE CAREFUL: IS INT REALLY INT?\n\ntemplate <typename T> T binpow(T q, T w, T mod) {\n if (!w)\n return 1 % mod;\n if (w & 1)\n return q * 1LL * binpow(q, w - 1, mod) % mod;\n return binpow(q * 1LL * q % mod, w \/ 2, mod);\n}\n\ntemplate <typename T> T gcd(T q, T w) {\n while (w) {\n q %= w;\n swap(q, w);\n }\n return q;\n}\ntemplate <typename T> T lcm(T q, T w) { return q \/ gcd(q, w) * w; }\n\ntemplate <typename T> void make_unique(vector<T> &a) {\n sort(all(a));\n a.erase(unique(all(a)), a.end());\n}\n\ntemplate <typename T> void relax_min(T &cur, T val) { cur = min(cur, val); }\n\ntemplate <typename T> void relax_max(T &cur, T val) { cur = max(cur, val); }\n\nvoid precalc() {}\n\n\/\/ #define int li\n\/\/ const int mod = 1000000007;\n\nvoid solve(bool read) {\n string s;\n cin >> s;\n int n;\n cin >> n;\n int is_odd = (int)s.length() % 2;\n int half = (int)s.length() \/ 2;\n int len = (int)s.length();\n vector<pair<int, int>> segs;\n for (int i = 0; i < n; ++i) {\n int l, r;\n cin >> l >> r;\n --l;\n --r;\n if (l >= half) {\n l = len - 1 - l;\n r = len - 1 - r;\n swap(l, r);\n }\n if (l == half) {\n continue;\n }\n if (r <= half) {\n segs.push_back({l, min(r, half - is_odd)});\n continue;\n }\n if (is_odd) {\n if (half - l < r - half) {\n l = len - 1 - l;\n r = len - 1 - r;\n swap(l, r);\n }\n segs.push_back({l, len - 1 - r - 1});\n continue;\n }\n if (half - 1 - l < r - half) {\n l = len - 1 - l;\n r = len - 1 - r;\n swap(l, r);\n }\n segs.push_back({l, len - 1 - r - 1});\n }\n\n vector<vector<int>> starts(half);\n vector<vector<int>> ends(half + 1);\n vector<int> diff(half);\n for (int i = 0; i < half; ++i) {\n diff[i] = (s[i] + 26 - s[len - 1 - i]) % 26;\n }\n for (int cur = 0; cur < segs.size(); ++cur) {\n auto item = segs[cur];\n if (item.second >= item.first) {\n starts[item.first].push_back(cur);\n ends[item.second + 1].push_back(cur);\n }\n }\n\n set<pair<int, int>> a;\n for (int i = 0; i < half; ++i) {\n \/*if (starts[i].empty() && ends[i].empty() && i > 0 && diff[i] != diff[i -\n 1]) { cout << \"NO\\\\n\"; return;\n }*\/\n for (int id : starts[i]) {\n a.insert({i, id});\n }\n int min_deleted = i;\n for (int id : ends[i]) {\n min_deleted = min(min_deleted, segs[id].first);\n a.erase({segs[id].first, id});\n }\n if (a.empty() && diff[i] != 0) {\n cout << \"NO\\\\n\";\n return;\n }\n if (!a.empty() && min_deleted > a.rbegin()->first && min_deleted &&\n diff[min_deleted - 1] != diff[i]) {\n cout << \"NO\\\\n\";\n return;\n }\n }\n\n cout << \"YES\\\\n\";\n}","fail":"#pragma comment(linker, \"\/STACK:512000000\")\n#define _CRT_SECURE_NO_WARNINGS\n\/*#if !defined(YCM) && 0\n#define _FORTIFY_SOURCE 0\n#pragma GCC optimize(\"Ofast,no-stack-protector\")\n#pragma GCC target(\"avx,tune=native\")\n#include <stdio.h>\n#endif*\/\n\/\/ #include \"testlib.h\"\n#include <bits\/stdc++.h>\nusing namespace std;\n\n#define all(a) a.begin(), a.end()\ntypedef long long li;\ntypedef long double ld;\nvoid solve(bool);\nvoid precalc();\nclock_t start;\nint main() {\n#ifdef AIM\n freopen(\"\/home\/alexandero\/ClionProjects\/ACM\/input.txt\", \"r\", stdin);\n \/\/ freopen(\"\/home\/alexandero\/ClionProjects\/ACM\/output.txt\", \"w\", stdout);\n \/\/ freopen(\"out.txt\", \"w\", stdout);\n#else\n \/\/ freopen(\"input.txt\", \"r\", stdin);\n \/\/ freopen(\"output.txt\", \"w\", stdout);\n#endif\n start = clock();\n int t = 1;\n cout.sync_with_stdio(0);\n cin.tie(0);\n precalc();\n cout.precision(10);\n cout << fixed;\n \/\/ cin >> t;\n int testNum = 1;\n while (t--) {\n \/\/ cout << \"Case #\" << testNum++ << \": \";\n \/\/ cerr << testNum << endl;\n solve(true);\n \/\/ cerr << testNum - 1 << endl;\n }\n cout.flush();\n#ifdef AIM1\n while (true) {\n solve(false);\n }\n#endif\n\n#ifdef AIM\n cerr << \"\\\\n\\\\n time: \" << (clock() - start) \/ 1.0 \/ CLOCKS_PER_SEC << \"\\\\n\\\\n\";\n#endif\n\n return 0;\n}\n\n\/\/ BE CAREFUL: IS INT REALLY INT?\n\ntemplate <typename T> T binpow(T q, T w, T mod) {\n if (!w)\n return 1 % mod;\n if (w & 1)\n return q * 1LL * binpow(q, w - 1, mod) % mod;\n return binpow(q * 1LL * q % mod, w \/ 2, mod);\n}\n\ntemplate <typename T> T gcd(T q, T w) {\n while (w) {\n q %= w;\n swap(q, w);\n }\n return q;\n}\ntemplate <typename T> T lcm(T q, T w) { return q \/ gcd(q, w) * w; }\n\ntemplate <typename T> void make_unique(vector<T> &a) {\n sort(all(a));\n a.erase(unique(all(a)), a.end());\n}\n\ntemplate <typename T> void relax_min(T &cur, T val) { cur = min(cur, val); }\n\ntemplate <typename T> void relax_max(T &cur, T val) { cur = max(cur, val); }\n\nvoid precalc() {}\n\n\/\/ #define int li\n\/\/ const int mod = 1000000007;\n\nvoid solve(bool read) {\n string s;\n if (read) {\n cin >> s;\n } else {\n s = string(1000, 'a');\n }\n int n;\n if (read) {\n cin >> n;\n } else {\n n = 1000;\n }\n int is_odd = (int)s.length() % 2;\n int half = (int)s.length() \/ 2;\n int len = (int)s.length();\n vector<pair<int, int>> segs;\n for (int i = 0; i < n; ++i) {\n int l, r;\n if (read) {\n cin >> l >> r;\n } else {\n do {\n l = rand() % n + 1;\n r = rand() % n + 1;\n } while (l > r);\n }\n --l;\n --r;\n if (l >= half) {\n l = len - 1 - l;\n r = len - 1 - r;\n swap(l, r);\n }\n if (l == half) {\n assert(is_odd);\n continue;\n }\n if (is_odd && r == half) {\n --r;\n }\n if (r < half) {\n segs.push_back({l, r});\n continue;\n }\n if (is_odd) {\n if (half - l < r - half) {\n l = len - 1 - l;\n r = len - 1 - r;\n swap(l, r);\n }\n segs.push_back({l, len - 1 - r - 1});\n continue;\n }\n if (half - 1 - l < r - half) {\n l = len - 1 - l;\n r = len - 1 - r;\n swap(l, r);\n }\n segs.push_back({l, len - 1 - r - 1});\n }\n\n vector<vector<int>> starts(half);\n vector<int> diff(half);\n for (int i = 0; i < half; ++i) {\n diff[i] = (s[i] + 26 - s[len - 1 - i]) % 26;\n }\n for (int cur = 0; cur < segs.size(); ++cur) {\n auto item = segs[cur];\n if (item.second >= item.first) {\n starts[item.first].push_back(item.second + 1);\n }\n }\n vector<int> add(half + 1, 0);\n\n for (int i = 0; i < half; ++i) {\n make_unique(starts[i]);\n for (int j = 1; j < starts[i].size(); ++j) {\n starts[starts[i][j - 1]].push_back(starts[i][j]);\n }\n if (i) {\n add[i] += add[i - 1];\n }\n int need = (diff[i] - add[i] + 26) % 26;\n if (need) {\n if (starts[i].empty()) {\n cout << \"NO\\\\n\";\n return;\n }\n add[i] += need;\n add[starts[i][0]] -= need;\n }\n }\n cout << \"YES\\\\n\";\n}","change":"replace","i1":91,"i2":170,"j1":91,"j2":182,"error":"0","stderr":null,"stdout":"YES\n"}
{"problem_id":"p03539","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\n\nll N, K;\n\nint main(void) {\n cin >> N >> K;\n\n ll p = 1;\n REP(i, 0, N - 1) p = (p * (K + 1)) % MOD;\n ll all = (p * ((K * (K + 1) \/ 2) % MOD)) % MOD * N % MOD;\n\n vector<vector<ll>> dp(N + 1, vector<ll>(3500, 0));\n dp[0][0] = 1;\n REP(i, 0, N) {\n REP(j, 0, K + 1) {\n REP(k, 0, 3500) {\n if (j <= N - i) {\n dp[i + 1][k + (k + j) \/ (N - i)] += dp[i][k];\n dp[i + 1][k + (k + j) \/ (N - i)] %= MOD;\n } else {\n dp[i + 1][k] += dp[i][k];\n dp[i + 1][k] %= MOD;\n }\n }\n }\n }\n\n ll ans = 0;\n REP(i, 0, 3500) {\n ans += (dp[N][i] * i) % MOD;\n ans %= MOD;\n }\n cout << (all - ans + MOD) % MOD << endl;\n}\n","fail":"#include <bits\/stdc++.h>\n#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)\n#define MOD 1000000007LL\nusing namespace std;\ntypedef long long ll;\n\nll N, K;\n\nint main(void) {\n cin >> N >> K;\n\n ll p = 1;\n REP(i, 0, N - 1) p = (p * (K + 1)) % MOD;\n ll all = (p * ((K * (K + 1) \/ 2) % MOD)) % MOD * N % MOD;\n\n vector<vector<ll>> dp(N + 1, vector<ll>(3500, 0));\n dp[0][0] = 1;\n REP(i, 0, N) {\n REP(j, 0, K + 1) {\n REP(k, 0, 3500) {\n if (dp[i][k] == 0)\n continue;\n if (j <= N - i) {\n if (k + (k + j) \/ (N - i) < 3500) {\n dp[i + 1][k + (k + j) \/ (N - i)] += dp[i][k];\n dp[i + 1][k + (k + j) \/ (N - i)] %= MOD;\n }\n } else {\n dp[i + 1][k] += dp[i][k];\n dp[i + 1][k] %= MOD;\n }\n }\n }\n }\n\n ll ans = 0;\n REP(i, 0, 3500) {\n ans += (dp[N][i] * i) % MOD;\n ans %= MOD;\n }\n cout << (all - ans + MOD) % MOD << endl;\n}\n","change":"replace","i1":20,"i2":23,"j1":20,"j2":27,"error":"0","stderr":null,"stdout":10.0}
{"problem_id":"p03539","language":"C++","original_status":"Runtime Error","pass":"#include <stdio.h>\n\nint main() {\n const long long mod = 1000000007;\n int N, K;\n scanf(\"%d %d\", &N, &K);\n long long pw[101] = {\n 1,\n };\n for (int i = 1; i <= N; i++)\n pw[i] = pw[i - 1] * (K + 1) % mod;\n\n long long ans = N * K * (K + 1) \/ 2 * pw[N - 1] % mod;\n long long prv[1000] = {\n 1,\n };\n for (int i = N; i >= 1; i--) {\n long long nxt[1000] = {\n 0,\n };\n for (int k = 0; k <= K; k++) {\n for (int j = 0; j < 1000; j++)\n if (prv[j]) {\n int v = (j + k) \/ i;\n if (k > i)\n v = 0;\n ans = (ans + mod - pw[i - 1] * v % mod * prv[j] % mod) % mod;\n nxt[j + v] = (nxt[j + v] + prv[j]) % mod;\n }\n }\n for (int j = 0; j < 1000; j++)\n prv[j] = nxt[j];\n }\n\n printf(\"%lld\\\\n\", ans);\n\n return 0;\n}","fail":"#include <stdio.h>\n\nint main() {\n const long long mod = 1000000007;\n int N, K;\n scanf(\"%d %d\", &N, &K);\n long long pw[101] = {\n 1,\n };\n for (int i = 1; i <= N; i++)\n pw[i] = pw[i - 1] * (K + 1) % mod;\n\n long long ans = N * K * (K + 1) \/ 2 * pw[N - 1] % mod;\n long long prv[8000] = {\n 1,\n };\n for (int i = N; i >= 1; i--) {\n long long nxt[8000] = {\n 0,\n };\n for (int k = 0; k <= K; k++) {\n for (int j = 0; j < 8000; j++)\n if (prv[j]) {\n int v = (j + k) \/ i;\n if (k > i)\n v = 0;\n ans = (ans + mod - pw[i - 1] * v % mod * prv[j] % mod) % mod;\n nxt[j + v] = (nxt[j + v] + prv[j]) % mod;\n }\n }\n for (int j = 0; j < 8000; j++)\n prv[j] = nxt[j];\n }\n\n printf(\"%lld\\\\n\", ans);\n\n return 0;\n}","change":"replace","i1":13,"i2":31,"j1":13,"j2":31,"error":"0","stderr":null,"stdout":10.0}
{"problem_id":"p03539","language":"C++","original_status":"Runtime Error","pass":"#include \"bits\/stdc++.h\"\nusing namespace std;\nconst int maxn = 101;\nconst int magic = 4040;\nconst int mod = 1000000007;\nlong long o[maxn][maxn * maxn];\nint main() {\n int n, k;\n scanf(\"%d %d\", &n, &k);\n o[n + 1][0] = 1;\n for (int e = n; e >= 1; e--) {\n for (int s = 0; s < magic; s++) {\n if (o[e + 1][s] == 0)\n continue;\n for (int f = 0; f <= k; f++) {\n if (f <= e) {\n o[e][s + (f + s) \/ e] += o[e + 1][s];\n o[e][s + (f + s) \/ e] %= mod;\n } else {\n o[e][s] += o[e + 1][s];\n o[e][s] %= mod;\n }\n }\n }\n }\n long long comb = k * (k + 1) \/ 2;\n comb *= n;\n comb %= mod;\n for (int e = 0; e < n - 1; e++)\n comb *= (k + 1), comb %= mod;\n long long ans = comb;\n for (int e = 0; e < magic; e++)\n ans += mod - (e * o[1][e] % mod), ans %= mod;\n cout << ans << endl;\n return 0;\n}\n","fail":"#include \"bits\/stdc++.h\"\nusing namespace std;\nconst int maxn = 103;\nconst int magic = 4040;\nconst int mod = 1000000007;\nlong long o[maxn][maxn * maxn];\nint main() {\n int n, k;\n scanf(\"%d %d\", &n, &k);\n o[n + 1][0] = 1;\n for (int e = n; e >= 1; e--) {\n for (int s = 0; s < magic; s++) {\n if (o[e + 1][s] == 0)\n continue;\n for (int f = 0; f <= k; f++) {\n if (f <= e) {\n o[e][s + (f + s) \/ e] += o[e + 1][s];\n o[e][s + (f + s) \/ e] %= mod;\n } else {\n o[e][s] += o[e + 1][s];\n o[e][s] %= mod;\n }\n }\n }\n }\n long long comb = k * (k + 1) \/ 2;\n comb *= n;\n comb %= mod;\n for (int e = 0; e < n - 1; e++)\n comb *= (k + 1), comb %= mod;\n long long ans = comb;\n for (int e = 0; e < magic; e++)\n ans += mod - (e * o[1][e] % mod), ans %= mod;\n cout << ans << endl;\n return 0;\n}\n","change":"replace","i1":2,"i2":3,"j1":2,"j2":3,"error":"0","stderr":null,"stdout":10.0}
{"problem_id":"p03539","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <utility>\n#include <vector>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\n#define MP make_pair\n#define PB push_back\nconst ll mod = 1000000007;\n\nll dp[101][5000];\nlong long ruijo(long long x, ll n) {\n long long p, ans;\n if (n == 0)\n return 1;\n if (n == 1)\n return x;\n if (n % 2) {\n p = ruijo(x, n \/ 2);\n ans = (x * p) % mod;\n ans = (ans * p) % mod;\n return ans;\n } else {\n p = ruijo(x, n \/ 2);\n ans = (p * p) % mod;\n return ans;\n }\n}\nll n, k;\n\nll element_count(ll x, ll y, ll z) {\n ll a = max((ll)0, y * z - x);\n ll b = min(y, y * (z + 1) - 1 - x);\n if (a > b)\n return (ll)0;\n else\n return b - a + 1;\n}\n\nint main() {\n cin >> n >> k;\n for (ll i = n; i > k; i--) {\n dp[i][0] = ruijo(k + 1, (n - i + 1));\n }\n dp[k][0] = k * ruijo(k + 1, n - k);\n dp[k][1] = 1 * ruijo(k + 1, n - k);\n for (ll i = k - 1; i >= 1; i--) {\n for (ll j = 0; j < 4000; j++) {\n if (j == 0) {\n dp[i][0] = k * dp[i + 1][0] % mod;\n } else {\n for (ll m = 0; m <= j; m++) {\n if (j != m) {\n dp[i][j] =\n (dp[i][j] + element_count(m, i, j - m) * dp[i + 1][m]) % mod;\n } else {\n dp[i][j] = (dp[i][j] + (k - i) * dp[i + 1][m]) % mod;\n if (i - m - 1 >= 0) {\n dp[i][j] = (dp[i][j] + (i - m) * dp[i + 1][m]) % mod;\n }\n }\n }\n }\n }\n }\n ll ans = 0;\n for (int i = 1; i < 4000; i++) {\n ans = (ans + i * dp[1][i]) % mod;\n }\n ll w = (n * ruijo(k + 1, n - 1)) % mod;\n ll s = ((k * (k + 1)) \/ 2) % mod;\n s = (s * w) % mod;\n cout << (s - ans + mod) % mod << endl;\n return 0;\n}","fail":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <utility>\n#include <vector>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> PII;\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\n#define MP make_pair\n#define PB push_back\nconst ll mod = 1000000007;\n\nll dp[101][4010];\nlong long ruijo(long long x, ll n) {\n long long p, ans;\n if (n == 0)\n return 1;\n if (n == 1)\n return x;\n if (n % 2) {\n p = ruijo(x, n \/ 2);\n ans = (x * p) % mod;\n ans = (ans * p) % mod;\n return ans;\n } else {\n p = ruijo(x, n \/ 2);\n ans = (p * p) % mod;\n return ans;\n }\n}\nll n, k;\n\nll element_count(ll x, ll y, ll z) {\n ll a = max((ll)0, y * z - x);\n ll b = min(y, y * (z + 1) - 1 - x);\n if (a > b)\n return (ll)0;\n else\n return b - a + 1;\n}\n\nint main() {\n cin >> n >> k;\n for (ll i = n; i > k; i--) {\n dp[i][0] = ruijo(k + 1, (n - i + 1));\n }\n dp[k][0] = k * ruijo(k + 1, n - k);\n dp[k][1] = 1 * ruijo(k + 1, n - k);\n for (ll i = k - 1; i >= 1; i--) {\n ll p;\n if (i == 1) {\n p = 4000;\n }\n if (i == 2) {\n p = 3000;\n }\n if (i == 3) {\n p = 2000;\n }\n if (i >= 4) {\n p = 1000;\n }\n for (ll j = 0; j < p; j++) {\n if (j == 0) {\n dp[i][0] = k * dp[i + 1][0] % mod;\n } else {\n for (ll m = 0; m <= j; m++) {\n if (j != m) {\n dp[i][j] =\n (dp[i][j] + element_count(m, i, j - m) * dp[i + 1][m]) % mod;\n } else {\n dp[i][j] = (dp[i][j] + (k - i) * dp[i + 1][m]) % mod;\n if (i - m - 1 >= 0) {\n dp[i][j] = (dp[i][j] + (i - m) * dp[i + 1][m]) % mod;\n }\n }\n }\n }\n }\n }\n ll ans = 0;\n for (int i = 1; i < 4000; i++) {\n ans = (ans + i * dp[1][i]) % mod;\n }\n ll w = (n * ruijo(k + 1, n - 1)) % mod;\n ll s = ((k * (k + 1)) \/ 2) % mod;\n s = (s * w) % mod;\n cout << (s - ans + mod) % mod << endl;\n return 0;\n}","change":"replace","i1":19,"i2":57,"j1":19,"j2":70,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03540","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define ADD(a, b) a = (a + ll(b)) % mod\n#define MUL(a, b) a = (a * ll(b)) % mod\n#define MAX(a, b) a = max(a, b)\n#define MIN(a, b) a = min(a, b)\n#define rep(i, a, b) for (int i = int(a); i < int(b); i++)\n#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)\n#define all(a) (a).begin(), (a).end()\n#define sz(v) (int)(v).size()\n#define pb push_back\n#define sec second\n#define fst first\n#define debug(fmt, ...) Debug(__LINE__, \":\", fmt, ##__VA_ARGS__)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pi;\ntypedef pair<ll, ll> pl;\ntypedef pair<int, pi> ppi;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<vl> mat;\ntypedef complex<double> comp;\nvoid Debug() { cout << '\\\\n'; }\ntemplate <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {\n cout << arg << \" \";\n Debug(rest...);\n}\ntemplate <class T> ostream &operator<<(ostream &out, const vector<T> &v) {\n out << \"[\";\n if (!v.empty()) {\n rep(i, 0, sz(v) - 1) out << v[i] << \", \";\n out << v.back();\n }\n out << \"]\";\n return out;\n}\ntemplate <class S, class T>\nostream &operator<<(ostream &out, const pair<S, T> &v) {\n out << \"(\" << v.first << \", \" << v.second << \")\";\n return out;\n}\nconst int MAX_N = 200010;\nconst int MAX_V = 100010;\nconst double eps = 1e-6;\nconst ll mod = 1000000007;\nconst int inf = 1 << 29;\nconst ll linf = 1LL << 60;\nconst double PI = 3.14159265358979323846;\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint N, M;\nint X, Y;\nint A[50][50];\nint S[50][50];\nint dp[50][50][50][50];\n\nint get_sum(int x1, int y1, int x2, int y2) {\n return S[x2 + 1][y2 + 1] - S[x2 + 1][y1] - S[x1][y2 + 1] + S[x1][y1];\n}\n\nvoid solve() {\n cin >> N >> M;\n rep(i, 0, N) {\n rep(j, 0, M) {\n char c;\n cin >> c;\n if (c == '+')\n A[i][j] = 0;\n else if (c == '#')\n A[i][j] = 1;\n else {\n A[i][j] = 0;\n X = i;\n Y = j;\n }\n }\n }\n rep(i, 0, N) {\n rep(j, 0, M) {\n S[i + 1][j + 1] = A[i][j] + S[i + 1][j] + S[i][j + 1] - S[i][j];\n }\n }\n rep(x1, 0, N) {\n rep(y1, 0, M) {\n rep(x2, x1, N) {\n rep(y2, y1, M) { dp[x1][y1][x2][y2] = N * M; }\n }\n }\n }\n dp[0][0][N - 1][M - 1] = 0;\n rep(x1, 0, N) {\n rep(y1, 0, M) {\n rer(x2, N, x1) {\n rer(y2, M, y1) {\n int left = get_sum(x1, y1, x1, y2);\n int up = get_sum(x1, y1, x2, y1);\n int right = get_sum(x2, y1, x2, y2);\n int down = get_sum(x1, y2, x2, y2);\n MIN(dp[x1 + 1][y1][x2][y2], left + dp[x1][y1][x2][y2]);\n MIN(dp[x1][y1 + 1][x2][y2], up + dp[x1][y1][x2][y2]);\n MIN(dp[x1][y1][x2 - 1][y2], right + dp[x1][y1][x2][y2]);\n MIN(dp[x1][y1][x2][y2 - 1], down + dp[x1][y1][x2][y2]);\n if (A[x1][y1])\n MIN(dp[x1 + 1][y1 + 1][x2][y2], left + up - 2 + dp[x1][y1][x2][y2]);\n if (A[x1][y2])\n MIN(dp[x1 + 1][y1][x2][y2 - 1],\n left + down - 2 + dp[x1][y1][x2][y2]);\n if (A[x2][y1])\n MIN(dp[x1][y1 + 1][x2 - 1][y2],\n right + up - 2 + dp[x1][y1][x2][y2]);\n if (A[x2][y2])\n MIN(dp[x1][y1][x2 - 1][y2 - 1],\n right + down - 2 + dp[x1][y1][x2][y2]);\n }\n }\n }\n }\n int ans = N * M;\n rep(x1, 0, N) {\n rep(y1, 0, M) {\n rep(x2, x1, N) {\n rep(y2, y1, M) {\n if (!(x1 <= X && X <= x2 && y1 <= Y && Y <= y2))\n continue;\n MIN(ans, dp[x1][y1][x2][y2] + get_sum(x1, y1, X, Y));\n MIN(ans, dp[x1][y1][x2][y2] + get_sum(X, y1, x2, Y));\n MIN(ans, dp[x1][y1][x2][y2] + get_sum(x1, Y, X, y2));\n MIN(ans, dp[x1][y1][x2][y2] + get_sum(X, Y, x2, y2));\n }\n }\n }\n }\n cout << ans << \"\\\\n\";\n}\n\nint main() {\n#ifndef LOCAL\n ios::sync_with_stdio(false);\n cin.tie(0);\n#endif\n cout << fixed;\n cout.precision(20);\n srand((unsigned int)time(NULL));\n#ifdef LOCAL\n \/\/ freopen(\"in.txt\", \"wt\", stdout); \/\/for tester\n freopen(\"in.txt\", \"rt\", stdin);\n#endif\n solve();\n#ifdef LOCAL\n cerr << \"Time elapsed: \" << 1.0 * clock() \/ CLOCKS_PER_SEC << \" s.\\\\n\";\n#endif\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n#define ADD(a, b) a = (a + ll(b)) % mod\n#define MUL(a, b) a = (a * ll(b)) % mod\n#define MAX(a, b) a = max(a, b)\n#define MIN(a, b) a = min(a, b)\n#define rep(i, a, b) for (int i = int(a); i < int(b); i++)\n#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)\n#define all(a) (a).begin(), (a).end()\n#define sz(v) (int)(v).size()\n#define pb push_back\n#define sec second\n#define fst first\n#define debug(fmt, ...) Debug(__LINE__, \":\", fmt, ##__VA_ARGS__)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pi;\ntypedef pair<ll, ll> pl;\ntypedef pair<int, pi> ppi;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<vl> mat;\ntypedef complex<double> comp;\nvoid Debug() { cout << '\\\\n'; }\ntemplate <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {\n cout << arg << \" \";\n Debug(rest...);\n}\ntemplate <class T> ostream &operator<<(ostream &out, const vector<T> &v) {\n out << \"[\";\n if (!v.empty()) {\n rep(i, 0, sz(v) - 1) out << v[i] << \", \";\n out << v.back();\n }\n out << \"]\";\n return out;\n}\ntemplate <class S, class T>\nostream &operator<<(ostream &out, const pair<S, T> &v) {\n out << \"(\" << v.first << \", \" << v.second << \")\";\n return out;\n}\nconst int MAX_N = 200010;\nconst int MAX_V = 100010;\nconst double eps = 1e-6;\nconst ll mod = 1000000007;\nconst int inf = 1 << 29;\nconst ll linf = 1LL << 60;\nconst double PI = 3.14159265358979323846;\n\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\/\n\nint N, M;\nint X, Y;\nint A[50][50];\nint S[50][50];\nint dp[50][50][50][50];\n\nint get_sum(int x1, int y1, int x2, int y2) {\n return S[x2 + 1][y2 + 1] - S[x2 + 1][y1] - S[x1][y2 + 1] + S[x1][y1];\n}\n\nvoid solve() {\n cin >> N >> M;\n rep(i, 0, N) {\n rep(j, 0, M) {\n char c;\n cin >> c;\n if (c == '+')\n A[i][j] = 0;\n else if (c == '#')\n A[i][j] = 1;\n else {\n A[i][j] = 0;\n X = i;\n Y = j;\n }\n }\n }\n rep(i, 0, N) {\n rep(j, 0, M) {\n S[i + 1][j + 1] = A[i][j] + S[i + 1][j] + S[i][j + 1] - S[i][j];\n }\n }\n rep(x1, 0, N) {\n rep(y1, 0, M) {\n rep(x2, x1, N) {\n rep(y2, y1, M) { dp[x1][y1][x2][y2] = N * M; }\n }\n }\n }\n dp[0][0][N - 1][M - 1] = 0;\n rep(x1, 0, N) {\n rep(y1, 0, M) {\n rer(x2, N, x1) {\n rer(y2, M, y1) {\n rep(x, 0, x1 + 1) {\n rep(y, 0, y1 + 1) {\n MIN(dp[x1][y1][x2][y2], dp[x][y][x2][y2] +\n get_sum(x, y1, x1 - 1, y2) +\n get_sum(x1, y, x2, y1 - 1));\n }\n }\n\n rep(x, x2, N) {\n rep(y, 0, y1 + 1) {\n MIN(dp[x1][y1][x2][y2], dp[x1][y][x][y2] +\n get_sum(x1, y, x2, y1 - 1) +\n get_sum(x2 + 1, y1, x, y2));\n }\n }\n\n rep(x, 0, x1 + 1) {\n rep(y, y2, M) {\n MIN(dp[x1][y1][x2][y2], dp[x][y1][x2][y] +\n get_sum(x, y1, x1 - 1, y2) +\n get_sum(x1, y2 + 1, x2, y));\n }\n }\n\n rep(x, x2, N) {\n rep(y, y2, M) {\n MIN(dp[x1][y1][x2][y2], dp[x1][y1][x][y] +\n get_sum(x2 + 1, y1, x, y2) +\n get_sum(x1, y2 + 1, x2, y));\n }\n }\n }\n }\n }\n }\n int ans = N * M;\n rep(x1, 0, N) {\n rep(y1, 0, M) {\n rep(x2, x1, N) {\n rep(y2, y1, M) {\n if (!(x1 <= X && X <= x2 && y1 <= Y && Y <= y2))\n continue;\n MIN(ans, dp[x1][y1][x2][y2] + get_sum(x1, y1, X, Y));\n MIN(ans, dp[x1][y1][x2][y2] + get_sum(X, y1, x2, Y));\n MIN(ans, dp[x1][y1][x2][y2] + get_sum(x1, Y, X, y2));\n MIN(ans, dp[x1][y1][x2][y2] + get_sum(X, Y, x2, y2));\n }\n }\n }\n }\n cout << ans << \"\\\\n\";\n}\n\nint main() {\n#ifndef LOCAL\n ios::sync_with_stdio(false);\n cin.tie(0);\n#endif\n cout << fixed;\n cout.precision(20);\n srand((unsigned int)time(NULL));\n#ifdef LOCAL\n \/\/ freopen(\"in.txt\", \"wt\", stdout); \/\/for tester\n freopen(\"in.txt\", \"rt\", stdin);\n#endif\n solve();\n#ifdef LOCAL\n cerr << \"Time elapsed: \" << 1.0 * clock() \/ CLOCKS_PER_SEC << \" s.\\\\n\";\n#endif\n return 0;\n}\n","change":"replace","i1":95,"i2":114,"j1":95,"j2":126,"error":0,"stderr":null,"stdout":2}
{"problem_id":"p03541","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <queue>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef pair<pii, int> pi3;\nint mini[1 << 18], maxi[1 << 18];\nvector<pii> qs[1000000];\nint ans[1000000];\nint main() {\n int num;\n scanf(\"%d\", &num);\n fill(maxi, maxi + (1 << num), 1000000000);\n for (int i = 0; i < (1 << num); i++) {\n int z;\n scanf(\"%d\", &z);\n if (z > 0)\n mini[i] = maxi[i] = z;\n }\n for (int i = 0; i < num; i++) {\n for (int j = 0; j < (1 << num); j++) {\n if (j & (1 << i))\n maxi[j - (1 << i)] = min(maxi[j - (1 << i)], maxi[j]);\n else\n mini[j + (1 << i)] = max(mini[j + (1 << i)], mini[j]);\n }\n }\n \/\/ for (int i = 0; i < (1 << num); i++)printf(\"%d %d\\\\n\", mini[i], maxi[i]);\n for (int i = 0; i < (1 << num); i++)\n qs[maxi[i]].push_back(make_pair(mini[i], i));\n priority_queue<pi3> que;\n for (int i = (1 << num); i >= 1; i--) {\n for (int j = 0; j < qs[i].size(); j++) {\n que.push(make_pair(make_pair(qs[i][j].first, i), qs[i][j].second));\n }\n if (que.empty()) {\n printf(\"NO\\\\n\");\n return 0;\n }\n pi3 z = que.top();\n que.pop();\n if (!(z.first.first <= i && i <= z.first.second)) {\n printf(\"NO\\\\n\");\n return 0;\n }\n ans[z.second] = i;\n }\n printf(\"YES\\\\n\");\n for (int i = 0; i < (1 << num); i++) {\n int p = 0;\n for (int j = 0; j < num; j++)\n if (i & (1 << j))\n p += 1 << (num - 1 - j);\n printf(\"%d \", ans[p]);\n }\n printf(\"\\\\n\");\n}","fail":"#include <algorithm>\n#include <queue>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\ntypedef pair<pii, int> pi3;\nint mini[1 << 18], maxi[1 << 18];\nvector<pii> qs[1000000];\nint ans[1000000];\nint main() {\n int num;\n scanf(\"%d\", &num);\n fill(maxi, maxi + (1 << num), 1 << num);\n fill(mini, mini + (1 << num), 1);\n for (int i = 0; i < (1 << num); i++) {\n int z;\n scanf(\"%d\", &z);\n if (z > 0)\n mini[i] = maxi[i] = z;\n }\n for (int i = 0; i < num; i++) {\n for (int j = 0; j < (1 << num); j++) {\n if (j & (1 << i))\n maxi[j - (1 << i)] = min(maxi[j - (1 << i)], maxi[j]);\n else\n mini[j + (1 << i)] = max(mini[j + (1 << i)], mini[j]);\n }\n }\n \/\/ for (int i = 0; i < (1 << num); i++)printf(\"%d %d\\\\n\", mini[i], maxi[i]);\n for (int i = 0; i < (1 << num); i++)\n qs[maxi[i]].push_back(make_pair(mini[i], i));\n priority_queue<pi3> que;\n for (int i = (1 << num); i >= 1; i--) {\n for (int j = 0; j < qs[i].size(); j++) {\n que.push(make_pair(make_pair(qs[i][j].first, i), qs[i][j].second));\n }\n if (que.empty()) {\n printf(\"NO\\\\n\");\n return 0;\n }\n pi3 z = que.top();\n que.pop();\n if (!(z.first.first <= i && i <= z.first.second)) {\n printf(\"NO\\\\n\");\n return 0;\n }\n ans[z.second] = i;\n }\n printf(\"YES\\\\n\");\n for (int i = 0; i < (1 << num); i++) {\n int p = 0;\n for (int j = 0; j < num; j++)\n if (i & (1 << j))\n p += 1 << (num - 1 - j);\n printf(\"%d \", ans[p]);\n }\n printf(\"\\\\n\");\n}","change":"replace","i1":13,"i2":14,"j1":13,"j2":15,"error":"WA","stderr":null,"stdout":"YES\n1 4 2 5 3 7 6 8 \n"}
{"problem_id":"p03542","language":"C++","original_status":"Memory Limit Exceeded","pass":"#include <algorithm>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> pii;\ntypedef pair<ll, pii> pi3;\ntypedef vector<pair<vector<int>, vector<pi3>>> inher;\nvector<pi3> ans;\nll dat[200000];\n#define INF 1000000000000000000LL\nclass tree {\npublic:\n \/\/ \u3053\u3053\u304b\u3089\u3044\u3058\u3089\u306a\u3044\u3068\u3053\u308d(\u8fba\u91cd\u307f\u304c\u3042\u308b\u3068\u304d\u306f\u3046\u307e\u304f\u3044\u3058\u308b)\n vector<int>\n idx; \/\/ \u5143\u3005\u306e index \u6728\u304c\u5c0f\u3055\u304f\u306a\u308b\u305f\u3073\u306b\u5b9f\u969b\u306e index \u306f\u4ed8\u3051\u66ff\u3048\u3089\u308c\u308b\n vector<vector<pii>> pat;\n vector<bool> flag;\n int num, cent; \/\/ num \u306f\u9802\u70b9\u6570\u3001cent \u306f\u91cd\u5fc3\u306e\u9802\u70b9\u756a\u53f7 (0 <= cent < num)\n int dfs1(int node) {\n if (flag[node])\n return 0;\n flag[node] = true;\n int s = 1, maxi = 0;\n for (int i = 0; i < pat[node].size(); i++) {\n int r = dfs1(pat[node][i].first);\n s += r, maxi = max(maxi, r);\n }\n if (maxi <= num \/ 2 && (num - s) <= num \/ 2)\n cent = node;\n return s;\n }\n void init(vector<int> zid, vector<pi3> ed) {\n idx = zid;\n num = idx.size();\n flag.resize(num);\n pat.resize(num);\n for (int i = 0; i < ed.size(); i++) {\n pat[ed[i].second.first].push_back(\n make_pair(ed[i].second.second, ed[i].first));\n pat[ed[i].second.second].push_back(\n make_pair(ed[i].second.first, ed[i].first));\n }\n dfs1(0);\n fill(flag.begin(), flag.end(), false);\n }\n vector<int> sub1;\n vector<pi3> sub2;\n void dfs2(int node) {\n if (flag[node])\n return;\n flag[node] = true;\n int t = sub1.size();\n sub1.push_back(idx[node]);\n for (int i = 0; i < pat[node].size(); i++) {\n if (!flag[pat[node][i].first]) {\n sub2.push_back(\n make_pair(pat[node][i].second, make_pair(t, sub1.size())));\n dfs2(pat[node][i].first);\n }\n }\n }\n inher decompose() {\n inher r;\n fill(flag.begin(), flag.end(), false);\n flag[cent] = true;\n for (int i = 0; i < pat[cent].size(); i++) {\n sub1.clear();\n sub2.clear();\n dfs2(pat[cent][i].first);\n r.push_back(make_pair(sub1, sub2));\n }\n return r;\n }\n ll mn;\n int rr;\n void dfs3(int node, ll dep) {\n if (flag[node])\n return;\n flag[node] = true;\n if (mn > dep + dat[idx[node]])\n mn = dep + dat[idx[node]], rr = idx[node];\n ans.push_back(make_pair(dat[idx[cent]] + dat[idx[node]] + dep,\n make_pair(idx[cent], idx[node])));\n for (int i = 0; i < pat[node].size(); i++)\n dfs3(pat[node][i].first, dep + pat[node][i].second);\n }\n void dfs4(int node, ll dep, int r) {\n if (flag[node])\n return;\n flag[node] = true;\n ans.push_back(make_pair(dat[idx[node]] + dep, make_pair(r, idx[node])));\n \/\/ printf(\"%d %d\\\\n\",r, idx[node]);\n for (int i = 0; i < pat[node].size(); i++)\n dfs4(pat[node][i].first, dep + pat[node][i].second, r);\n }\n \/\/ \u3053\u3053\u307e\u3067\u3044\u3058\u3089\u306a\u3044\u3068\u3053\u308d\n void solve() \/\/ \u3044\u3058\u308b\u3068\u3053\u308d\n {\n flag[cent] = true;\n ll m1 = INF, m2 = INF;\n int r1 = -1, r2 = -1;\n int t = -1;\n for (int i = 0; i < pat[cent].size(); i++) {\n mn = INF, rr = -1;\n dfs3(pat[cent][i].first, pat[cent][i].second);\n if (m1 > mn)\n m2 = m1, r2 = r1, m1 = mn, r1 = rr, t = i;\n else if (m2 > mn)\n m2 = mn, r2 = rr;\n }\n fill(flag.begin(), flag.end(), false);\n flag[cent] = true;\n \/\/ printf(\" %lld %d\\\\n\", m1, r1);\n for (int i = 0; i < pat[cent].size(); i++) {\n ll z;\n int r;\n if (t != i)\n z = m1, r = r1;\n else\n z = m2, r = r2;\n dfs4(pat[cent][i].first, z + pat[cent][i].second, r);\n }\n }\n};\n\/*\n\u91cd\u5fc3\u5206\u89e3\nidx = {0,1,...,N-1}, ed \u306f\u8fba\u5168\u90e8 \u3068\u3057\u3066\u547c\u3076\ntr.init \u3067\u6728\u304c\u4f5c\u3089\u308c\u3066\u91cd\u5fc3\u304c\u6c42\u307e\u308b\ntr.solve \u3067\u672c\u8cea\u3092\u3084\u308b\ntr.decompose \u3067\u5206\u89e3\u3092\u8a08\u7b97\n\u5b50\u306b\u5bfe\u3059\u308b solve \u306e\u7d50\u679c\u3092\u5229\u7528\u3059\u308b\u3068\u304d\u306f cetroiddecomposition \u306e\u8fd4\u308a\u5024\u3068\u3057\u3066\u6e21\u3059\n\n\u518d\u5e30\u3059\u308b\u3054\u3068\u306b\u9802\u70b9\u756a\u53f7\u3092 0 \u304b\u3089\u9802\u70b9\u6570 - 1 \u306b\u53d6\u308a\u63db\u3048\u308b\u306e\u3067\u3001\u305d\u306e\u53d6\u308a\u63db\u3048\u305f\u5f8c\u306e\nindex -> \u3082\u3068\u306e index \u3092\u8868\u3059\u306e\u304c idx ed \u306f\u53d6\u308a\u63db\u3048\u5f8c\u306e index \u3067\u9802\u70b9\u3092\u8868\u73fe\u3059\u308b\n*\/\nvoid centroiddecomposition(vector<int> idx, vector<pi3> ed) {\n \/\/ for (int i = 0; i < idx.size(); i++)printf(\"%d \", idx[i] + 1);\n \/\/ printf(\"\\\\n\");\n if (idx.size() <= 2) {\n if (idx.size() == 2)\n ans.push_back(make_pair(ed[0].first + dat[idx[0]] + dat[idx[1]],\n make_pair(idx[0], idx[1])));\n return;\n }\n tree tr;\n tr.init(idx, ed);\n tr.solve();\n inher r = tr.decompose();\n tr.idx.clear();\n tr.pat.clear();\n tr.flag.clear();\n tr.sub1.clear();\n tr.sub2.clear();\n for (int i = 0; i < r.size(); i++)\n centroiddecomposition(r[i].first, r[i].second);\n}\n#define SIZE 200000\nclass unionfind {\npublic:\n int par[SIZE];\n int ran[SIZE];\n int ren[SIZE];\n void init() {\n for (int i = 0; i < SIZE; i++) {\n par[i] = i;\n ran[i] = 0;\n ren[i] = 1;\n }\n }\n int find(int a) {\n if (a == par[a])\n return a;\n else\n return par[a] = find(par[a]);\n }\n void unite(int a, int b) {\n a = find(a);\n b = find(b);\n if (a == b)\n return;\n if (ran[a] > ran[b]) {\n par[b] = a;\n ren[a] += ren[b];\n } else {\n par[a] = b;\n ren[b] += ren[a];\n }\n if (ran[a] == ran[b])\n ran[b]++;\n }\n};\nunionfind uf;\nint main() {\n int num;\n scanf(\"%d\", &num);\n vector<int> zzd;\n vector<pi3> ed;\n for (int i = 0; i < num; i++)\n scanf(\"%lld\", &dat[i]), zzd.push_back(i);\n for (int i = 0; i < num - 1; i++) {\n int za, zb, zc;\n scanf(\"%d%d%d\", &za, &zb, &zc);\n za--, zb--;\n ed.push_back(make_pair(zc, make_pair(za, zb)));\n }\n centroiddecomposition(zzd, ed);\n sort(ans.begin(), ans.end());\n uf.init();\n ll ret = 0;\n for (int i = 0; i < ans.size(); i++) {\n \/\/ printf(\"%lld %lld %lld\\\\n\", ans[i].second.first + 1, ans[i].second.second\n \/\/ + 1, ans[i].first);\n if (uf.find(ans[i].second.first) != uf.find(ans[i].second.second)) {\n ret += ans[i].first;\n uf.unite(ans[i].second.first, ans[i].second.second);\n }\n }\n printf(\"%lld\\\\n\", ret);\n}","fail":"#include <algorithm>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, pii> pi3;\ntypedef vector<pair<vector<int>, vector<pi3>>> inher;\nvector<pi3> ans;\nll dat[200000];\n#define INF 1000000000000000000LL\nclass tree {\npublic:\n \/\/ \u3053\u3053\u304b\u3089\u3044\u3058\u3089\u306a\u3044\u3068\u3053\u308d(\u8fba\u91cd\u307f\u304c\u3042\u308b\u3068\u304d\u306f\u3046\u307e\u304f\u3044\u3058\u308b)\n vector<int>\n idx; \/\/ \u5143\u3005\u306e index \u6728\u304c\u5c0f\u3055\u304f\u306a\u308b\u305f\u3073\u306b\u5b9f\u969b\u306e index \u306f\u4ed8\u3051\u66ff\u3048\u3089\u308c\u308b\n vector<vector<pii>> pat;\n vector<bool> flag;\n int num, cent; \/\/ num \u306f\u9802\u70b9\u6570\u3001cent \u306f\u91cd\u5fc3\u306e\u9802\u70b9\u756a\u53f7 (0 <= cent < num)\n int dfs1(int node) {\n if (flag[node])\n return 0;\n flag[node] = true;\n int s = 1, maxi = 0;\n for (int i = 0; i < pat[node].size(); i++) {\n int r = dfs1(pat[node][i].first);\n s += r, maxi = max(maxi, r);\n }\n if (maxi <= num \/ 2 && (num - s) <= num \/ 2)\n cent = node;\n return s;\n }\n void init(vector<int> zid, vector<pi3> ed) {\n idx = zid;\n num = idx.size();\n flag.resize(num);\n pat.resize(num);\n for (int i = 0; i < ed.size(); i++) {\n pat[ed[i].second.first].push_back(\n make_pair(ed[i].second.second, ed[i].first));\n pat[ed[i].second.second].push_back(\n make_pair(ed[i].second.first, ed[i].first));\n }\n dfs1(0);\n fill(flag.begin(), flag.end(), false);\n }\n vector<int> sub1;\n vector<pi3> sub2;\n void dfs2(int node) {\n if (flag[node])\n return;\n flag[node] = true;\n int t = sub1.size();\n sub1.push_back(idx[node]);\n for (int i = 0; i < pat[node].size(); i++) {\n if (!flag[pat[node][i].first]) {\n sub2.push_back(\n make_pair(pat[node][i].second, make_pair(t, sub1.size())));\n dfs2(pat[node][i].first);\n }\n }\n }\n inher decompose() {\n inher r;\n fill(flag.begin(), flag.end(), false);\n flag[cent] = true;\n for (int i = 0; i < pat[cent].size(); i++) {\n sub1.clear();\n sub2.clear();\n dfs2(pat[cent][i].first);\n r.push_back(make_pair(sub1, sub2));\n }\n return r;\n }\n ll mn;\n int rr;\n void dfs3(int node, ll dep) {\n if (flag[node])\n return;\n flag[node] = true;\n if (mn > dep + dat[idx[node]])\n mn = dep + dat[idx[node]], rr = idx[node];\n ans.push_back(make_pair(dat[idx[cent]] + dat[idx[node]] + dep,\n make_pair(idx[cent], idx[node])));\n for (int i = 0; i < pat[node].size(); i++)\n dfs3(pat[node][i].first, dep + pat[node][i].second);\n }\n void dfs4(int node, ll dep, int r) {\n if (flag[node])\n return;\n flag[node] = true;\n ans.push_back(make_pair(dat[idx[node]] + dep, make_pair(r, idx[node])));\n \/\/ printf(\"%d %d\\\\n\",r, idx[node]);\n for (int i = 0; i < pat[node].size(); i++)\n dfs4(pat[node][i].first, dep + pat[node][i].second, r);\n }\n \/\/ \u3053\u3053\u307e\u3067\u3044\u3058\u3089\u306a\u3044\u3068\u3053\u308d\n void solve() \/\/ \u3044\u3058\u308b\u3068\u3053\u308d\n {\n flag[cent] = true;\n ll m1 = INF, m2 = INF;\n int r1 = -1, r2 = -1;\n int t = -1;\n for (int i = 0; i < pat[cent].size(); i++) {\n mn = INF, rr = -1;\n dfs3(pat[cent][i].first, pat[cent][i].second);\n if (m1 > mn)\n m2 = m1, r2 = r1, m1 = mn, r1 = rr, t = i;\n else if (m2 > mn)\n m2 = mn, r2 = rr;\n }\n fill(flag.begin(), flag.end(), false);\n flag[cent] = true;\n \/\/ printf(\" %lld %d\\\\n\", m1, r1);\n for (int i = 0; i < pat[cent].size(); i++) {\n ll z;\n int r;\n if (t != i)\n z = m1, r = r1;\n else\n z = m2, r = r2;\n dfs4(pat[cent][i].first, z + pat[cent][i].second, r);\n }\n }\n};\n\/*\n\u91cd\u5fc3\u5206\u89e3\nidx = {0,1,...,N-1}, ed \u306f\u8fba\u5168\u90e8 \u3068\u3057\u3066\u547c\u3076\ntr.init \u3067\u6728\u304c\u4f5c\u3089\u308c\u3066\u91cd\u5fc3\u304c\u6c42\u307e\u308b\ntr.solve \u3067\u672c\u8cea\u3092\u3084\u308b\ntr.decompose \u3067\u5206\u89e3\u3092\u8a08\u7b97\n\u5b50\u306b\u5bfe\u3059\u308b solve \u306e\u7d50\u679c\u3092\u5229\u7528\u3059\u308b\u3068\u304d\u306f cetroiddecomposition \u306e\u8fd4\u308a\u5024\u3068\u3057\u3066\u6e21\u3059\n\n\u518d\u5e30\u3059\u308b\u3054\u3068\u306b\u9802\u70b9\u756a\u53f7\u3092 0 \u304b\u3089\u9802\u70b9\u6570 - 1 \u306b\u53d6\u308a\u63db\u3048\u308b\u306e\u3067\u3001\u305d\u306e\u53d6\u308a\u63db\u3048\u305f\u5f8c\u306e\nindex -> \u3082\u3068\u306e index \u3092\u8868\u3059\u306e\u304c idx ed \u306f\u53d6\u308a\u63db\u3048\u5f8c\u306e index \u3067\u9802\u70b9\u3092\u8868\u73fe\u3059\u308b\n*\/\nvoid centroiddecomposition(vector<int> idx, vector<pi3> ed) {\n \/\/ for (int i = 0; i < idx.size(); i++)printf(\"%d \", idx[i] + 1);\n \/\/ printf(\"\\\\n\");\n if (idx.size() <= 2) {\n if (idx.size() == 2)\n ans.push_back(make_pair(ed[0].first + dat[idx[0]] + dat[idx[1]],\n make_pair(idx[0], idx[1])));\n return;\n }\n tree tr;\n tr.init(idx, ed);\n tr.solve();\n inher r = tr.decompose();\n tr.idx.clear();\n tr.pat.clear();\n tr.flag.clear();\n tr.sub1.clear();\n tr.sub2.clear();\n for (int i = 0; i < r.size(); i++)\n centroiddecomposition(r[i].first, r[i].second);\n}\n#define SIZE 200000\nclass unionfind {\npublic:\n int par[SIZE];\n int ran[SIZE];\n int ren[SIZE];\n void init() {\n for (int i = 0; i < SIZE; i++) {\n par[i] = i;\n ran[i] = 0;\n ren[i] = 1;\n }\n }\n int find(int a) {\n if (a == par[a])\n return a;\n else\n return par[a] = find(par[a]);\n }\n void unite(int a, int b) {\n a = find(a);\n b = find(b);\n if (a == b)\n return;\n if (ran[a] > ran[b]) {\n par[b] = a;\n ren[a] += ren[b];\n } else {\n par[a] = b;\n ren[b] += ren[a];\n }\n if (ran[a] == ran[b])\n ran[b]++;\n }\n};\nunionfind uf;\nint main() {\n int num;\n scanf(\"%d\", &num);\n vector<int> zzd;\n vector<pi3> ed;\n for (int i = 0; i < num; i++)\n scanf(\"%lld\", &dat[i]), zzd.push_back(i);\n for (int i = 0; i < num - 1; i++) {\n int za, zb, zc;\n scanf(\"%d%d%d\", &za, &zb, &zc);\n za--, zb--;\n ed.push_back(make_pair(zc, make_pair(za, zb)));\n }\n centroiddecomposition(zzd, ed);\n sort(ans.begin(), ans.end());\n uf.init();\n ll ret = 0;\n for (int i = 0; i < ans.size(); i++) {\n \/\/ printf(\"%lld %lld %lld\\\\n\", ans[i].second.first + 1, ans[i].second.second\n \/\/ + 1, ans[i].first);\n if (uf.find(ans[i].second.first) != uf.find(ans[i].second.second)) {\n ret += ans[i].first;\n uf.unite(ans[i].second.first, ans[i].second.second);\n }\n }\n printf(\"%lld\\\\n\", ret);\n}","change":"replace","i1":5,"i2":6,"j1":5,"j2":6,"error":"MLE","stderr":null,"stdout":null}
{"problem_id":"p03542","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n#include <ext\/pb_ds\/assoc_container.hpp>\n\n#pragma GCC optimize(\"O3\")\n\nusing namespace std;\n#define PB push_back\n#define MP make_pair\n#define LL long long\n\/\/ #define int LL\n#define FOR(i, a, b) for (int i = (a); i <= (b); i++)\n#define RE(i, n) FOR(i, 1, n)\n#define REP(i, n) FOR(i, 0, (int)(n)-1)\n#define R(i, n) REP(i, n)\n#define VI vector<int>\n#define PII pair<int, int>\n#define LD long double\n#define FI first\n#define SE second\n#define st FI\n#define nd SE\n#define ALL(x) (x).begin(), (x).end()\n#define SZ(x) ((int)(x).size())\n\n#define unordered_map __fast_unordered_map\ntemplate <class Key, class Value, class Hash = std::hash<Key>>\nusing unordered_map = __gnu_pbds::gp_hash_table<Key, Value, Hash>;\n\ntemplate <class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }\ntemplate <class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }\n\ntemplate <class TH> void _dbg(const char *sdbg, TH h) {\n cerr << sdbg << '=' << h << endl;\n}\ntemplate <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {\n while (*sdbg != ',')\n cerr << *sdbg++;\n cerr << '=' << h << ',';\n _dbg(sdbg + 1, a...);\n}\n\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> V) {\n os << \"[\";\n for (auto vv : V)\n os << vv << \",\";\n return os << \"]\";\n}\ntemplate <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) {\n return os << \"(\" << P.st << \",\" << P.nd << \")\";\n}\ntemplate <class L, class R, class X>\nostream &operator<<(ostream &os, tuple<L, R, X> P) {\n return os << \"(\" << get<0>(P) << \",\" << get<1>(P) << \",\" << get<2>(P) << \")\";\n}\n\n#ifdef LOCAL\n#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (__VA_ARGS__)\n#define cerr \\\\\n if (0) \\\\\n cout\n#endif\n\nconst int MaxN = 2e5 + 100;\n\nint groups[MaxN];\nint centroid_subtree[MaxN];\n\nstruct BestInfo {\n LL dist;\n \/\/ int subtree_idx;\n int vert;\n\n bool operator<(const BestInfo &other) const { return dist < other.dist; }\n\n bool SameType(const BestInfo &other) const {\n return groups[vert] == groups[other.vert];\n }\n\n friend ostream &operator<<(ostream &os, const BestInfo &bi) {\n return os << \"(\" << bi.dist << \",\" << bi.vert << \")\";\n }\n};\n\nvector<PII> adj[MaxN];\nint weights[MaxN];\nint N;\nbool is_avail[MaxN];\nint tree_size[MaxN];\nint layer_idx[MaxN];\nvector<int> conn_verts;\nvector<BestInfo> best_dists[MaxN];\n\nvoid DfsSizes(int v, int p) {\n tree_size[v] = 1;\n conn_verts.push_back(v);\n for (auto &E : adj[v]) {\n const int s = E.st;\n if (s == p) {\n continue;\n }\n if (!is_avail[s]) {\n continue;\n }\n DfsSizes(s, v);\n tree_size[v] += tree_size[s];\n }\n}\n\nvoid Centroids(int v, int layer) {\n conn_verts.clear();\n DfsSizes(v, v);\n\n int centroid = v;\n for (int s : conn_verts)\n if (2 * tree_size[s] >= tree_size[v] && tree_size[s] < tree_size[centroid])\n centroid = s;\n\n is_avail[centroid] = false;\n layer_idx[centroid] = layer;\n debug(centroid, layer);\n\n for (auto &E : adj[centroid])\n if (is_avail[E.st])\n Centroids(E.st, layer + 1);\n}\n\nconst int kMaxBests = 4;\nint subtree_idx;\nint centr_cur;\nLL dists_from_centroid[MaxN];\nint vert_ptr[MaxN];\nLL vert_ptr_dist[MaxN];\n\nvoid DfsDists(int v, int p, LL cur_dist, vector<BestInfo> &bests) {\n debug(v, p, centr_cur);\n dists_from_centroid[v] = cur_dist;\n conn_verts.push_back(v);\n centroid_subtree[v] = subtree_idx;\n\n if (v != p) {\n bool changed = false;\n BestInfo my_info{cur_dist + weights[v], v};\n\n for (auto &x : bests) {\n if (x.SameType(my_info)) {\n changed = true;\n if (x.dist > my_info.dist)\n x = my_info;\n break;\n }\n }\n\n if (!changed) {\n bests.push_back(my_info);\n swap(*min_element(ALL(bests)), bests[0]);\n int lptr = 1;\n int seen[2] = {-1, 0};\n for (int i = 1; i < SZ(bests); ++i) {\n const bool same_group = groups[bests[i].vert] == groups[bests[0].vert];\n if (!same_group && bests[i].dist <= bests[1].dist) {\n bests[1] = bests[i];\n ++lptr;\n }\n }\n bests.resize(lptr);\n } else {\n \/\/ sort(ALL(bests));\n }\n\n if (centr_cur == 2)\n debug(v, bests, cur_dist, weights[v]);\n }\n\n for (auto &E : adj[v]) {\n const int s = E.st;\n if (s == p || layer_idx[s] < layer_idx[centr_cur]) {\n continue;\n }\n if (v == p) {\n subtree_idx = s;\n }\n DfsDists(s, v, cur_dist + E.nd, bests);\n }\n}\n\nvoid CentroidGroups() {\n fill_n(vert_ptr_dist, N + 1, (LL)1e18);\n\n for (int centroid = 1; centroid <= N; ++centroid) {\n best_dists[centroid].clear();\n subtree_idx = -1;\n centr_cur = centroid;\n conn_verts.clear();\n DfsDists(centroid, centroid, 0, best_dists[centroid]);\n debug(centroid, best_dists[centroid]);\n debug(conn_verts);\n\n for (int v : conn_verts) {\n for (auto &best : best_dists[centroid]) {\n if (groups[best.vert] == groups[v])\n continue;\n\n const LL new_dist = best.dist + dists_from_centroid[v] + weights[v];\n debug(centroid, v, dists_from_centroid[v], best.vert, new_dist);\n if (new_dist < vert_ptr_dist[v]) {\n vert_ptr[v] = best.vert;\n vert_ptr_dist[v] = new_dist;\n }\n }\n\n if (groups[centroid] != groups[v]) {\n const LL centr_dist =\n dists_from_centroid[v] + weights[v] + weights[centroid];\n if (centr_dist < vert_ptr_dist[v]) {\n vert_ptr[v] = centroid;\n vert_ptr_dist[v] = centr_dist;\n }\n if (centr_dist < vert_ptr_dist[centroid]) {\n vert_ptr[centroid] = v;\n vert_ptr_dist[centroid] = centr_dist;\n }\n }\n }\n }\n}\n\nint fu_parent[MaxN];\n\nint FuFind(int v) {\n if (fu_parent[v] == v)\n return v;\n return fu_parent[v] = FuFind(fu_parent[v]);\n}\n\nbool FuUnion(int a, int b) {\n a = FuFind(a);\n b = FuFind(b);\n if (a != b) {\n fu_parent[a] = b;\n return true;\n }\n return false;\n}\n\nint32_t main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout << fixed << setprecision(11);\n cerr << fixed << setprecision(6);\n\n cin >> N;\n for (int i = 1; i <= N; ++i)\n cin >> weights[i];\n\n iota(fu_parent, fu_parent + N + 1, 0);\n\n for (int i = 0; i < N - 1; ++i) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].emplace_back(v, c);\n adj[v].emplace_back(u, c);\n }\n\n fill_n(is_avail, N + 1, true);\n fill_n(layer_idx, N + 1, (int)1e9);\n Centroids(1, 0);\n\n int num_edges = 0;\n long long total_cost = 0;\n iota(groups, groups + N + 1, 0);\n\n while (num_edges < N - 1) {\n CentroidGroups();\n\n vector<int> order(N);\n vector<bool> had_out_edge(N + 1);\n iota(ALL(order), 1);\n sort(ALL(order), [&](int lhs, int rhs) {\n return vert_ptr_dist[lhs] < vert_ptr_dist[rhs];\n });\n\n for (int i : order) {\n if (had_out_edge[groups[i]]) {\n continue;\n }\n had_out_edge[groups[i]] = true;\n debug(i, vert_ptr[i], vert_ptr_dist[i]);\n assert(vert_ptr_dist[i] < 1e17);\n if (FuUnion(i, vert_ptr[i])) {\n total_cost += vert_ptr_dist[i];\n ++num_edges;\n debug(\"TAKING EDGE\", i, vert_ptr[i], vert_ptr_dist[i],\n \"!@#@!@!#@!##@!\");\n }\n }\n\n for (int i = 1; i <= N; ++i) {\n groups[i] = FuFind(i);\n debug(i, groups[i]);\n }\n }\n\n cout << total_cost << \"\\\\n\";\n}\n","fail":"#include <bits\/stdc++.h>\n#include <ext\/pb_ds\/assoc_container.hpp>\n\n#pragma GCC optimize(\"O3\")\n\nusing namespace std;\n#define PB push_back\n#define MP make_pair\n#define LL long long\n\/\/ #define int LL\n#define FOR(i, a, b) for (int i = (a); i <= (b); i++)\n#define RE(i, n) FOR(i, 1, n)\n#define REP(i, n) FOR(i, 0, (int)(n)-1)\n#define R(i, n) REP(i, n)\n#define VI vector<int>\n#define PII pair<int, int>\n#define LD long double\n#define FI first\n#define SE second\n#define st FI\n#define nd SE\n#define ALL(x) (x).begin(), (x).end()\n#define SZ(x) ((int)(x).size())\n\n#define unordered_map __fast_unordered_map\ntemplate <class Key, class Value, class Hash = std::hash<Key>>\nusing unordered_map = __gnu_pbds::gp_hash_table<Key, Value, Hash>;\n\ntemplate <class C> void mini(C &a4, C b4) { a4 = min(a4, b4); }\ntemplate <class C> void maxi(C &a4, C b4) { a4 = max(a4, b4); }\n\ntemplate <class TH> void _dbg(const char *sdbg, TH h) {\n cerr << sdbg << '=' << h << endl;\n}\ntemplate <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {\n while (*sdbg != ',')\n cerr << *sdbg++;\n cerr << '=' << h << ',';\n _dbg(sdbg + 1, a...);\n}\n\ntemplate <class T> ostream &operator<<(ostream &os, vector<T> V) {\n os << \"[\";\n for (auto vv : V)\n os << vv << \",\";\n return os << \"]\";\n}\ntemplate <class L, class R> ostream &operator<<(ostream &os, pair<L, R> P) {\n return os << \"(\" << P.st << \",\" << P.nd << \")\";\n}\ntemplate <class L, class R, class X>\nostream &operator<<(ostream &os, tuple<L, R, X> P) {\n return os << \"(\" << get<0>(P) << \",\" << get<1>(P) << \",\" << get<2>(P) << \")\";\n}\n\n#ifdef LOCAL\n#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (__VA_ARGS__)\n#define cerr \\\\\n if (0) \\\\\n cout\n#endif\n\nconst int MaxN = 2e5 + 100;\n\nint groups[MaxN];\n\nstruct BestInfo {\n LL dist;\n \/\/ int subtree_idx;\n int vert;\n\n bool operator<(const BestInfo &other) const { return dist < other.dist; }\n\n bool SameType(const BestInfo &other) const {\n return groups[vert] == groups[other.vert];\n }\n\n friend ostream &operator<<(ostream &os, const BestInfo &bi) {\n return os << \"(\" << bi.dist << \",\" << bi.vert << \")\";\n }\n};\n\nvector<PII> adj[MaxN];\nint weights[MaxN];\nint N;\nbool is_avail[MaxN];\nint tree_size[MaxN];\nint layer_idx[MaxN];\nvector<int> conn_verts;\n\nvoid DfsSizes(int v, int p) {\n tree_size[v] = 1;\n conn_verts.push_back(v);\n for (auto &E : adj[v]) {\n const int s = E.st;\n if (s == p) {\n continue;\n }\n if (!is_avail[s]) {\n continue;\n }\n DfsSizes(s, v);\n tree_size[v] += tree_size[s];\n }\n}\n\nvoid Centroids(int v, int layer) {\n conn_verts.clear();\n DfsSizes(v, v);\n\n int centroid = v;\n for (int s : conn_verts)\n if (2 * tree_size[s] >= tree_size[v] && tree_size[s] < tree_size[centroid])\n centroid = s;\n\n is_avail[centroid] = false;\n layer_idx[centroid] = layer;\n debug(centroid, layer);\n\n for (auto &E : adj[centroid])\n if (is_avail[E.st])\n Centroids(E.st, layer + 1);\n}\n\nconst int kMaxBests = 4;\nint subtree_idx;\nint centr_cur;\nLL dists_from_centroid[MaxN];\nint vert_ptr[MaxN];\nLL vert_ptr_dist[MaxN];\nBestInfo best_non_centroid[MaxN][2];\nBestInfo best_centroid[MaxN];\n\nvoid DfsDists(int v, int p, LL cur_dist) {\n dists_from_centroid[v] = cur_dist;\n conn_verts.push_back(v);\n\n if (v != p) {\n BestInfo my_info{cur_dist + weights[v], v};\n\n if (groups[v] != groups[centr_cur]) {\n if (my_info < best_non_centroid[centr_cur][0]) {\n best_non_centroid[centr_cur][1] = best_non_centroid[centr_cur][0];\n best_non_centroid[centr_cur][0] = my_info;\n } else if (my_info < best_non_centroid[centr_cur][1]) {\n best_non_centroid[centr_cur][1] = my_info;\n }\n } else {\n mini(best_centroid[centr_cur], BestInfo{cur_dist + weights[v], v});\n }\n }\n\n for (auto &E : adj[v]) {\n const int s = E.st;\n if (s == p || layer_idx[s] < layer_idx[centr_cur]) {\n continue;\n }\n if (v == p) {\n subtree_idx = s;\n }\n DfsDists(s, v, cur_dist + E.nd);\n }\n}\n\nvoid CentroidGroups() {\n fill_n(vert_ptr_dist, N + 1, (LL)1e18);\n\n for (int centroid = 1; centroid <= N; ++centroid) {\n subtree_idx = -1;\n centr_cur = centroid;\n conn_verts.clear();\n best_non_centroid[centroid][0] = BestInfo{(LL)1e18, -1};\n best_non_centroid[centroid][1] = BestInfo{(LL)1e18, -1};\n best_centroid[centroid] = BestInfo{weights[centroid], centroid};\n DfsDists(centroid, centroid, 0);\n debug(conn_verts);\n\n for (int v : conn_verts) {\n for (int idx : {0, 1}) {\n const auto &best = best_non_centroid[centroid][idx];\n if (best.vert != -1 && groups[v] != groups[best.vert]) {\n const LL new_dist = best.dist + dists_from_centroid[v] + weights[v];\n if (new_dist < vert_ptr_dist[v]) {\n vert_ptr[v] = best.vert;\n vert_ptr_dist[v] = new_dist;\n }\n }\n }\n\n if (groups[centroid] != groups[v]) {\n const LL centr_dist =\n dists_from_centroid[v] + weights[v] + weights[centroid];\n const LL group_dist =\n dists_from_centroid[v] + best_centroid[centroid].dist + weights[v];\n if (group_dist < vert_ptr_dist[v]) {\n vert_ptr[v] = best_centroid[centroid].vert;\n vert_ptr_dist[v] = group_dist;\n }\n if (centr_dist < vert_ptr_dist[centroid]) {\n vert_ptr[centroid] = v;\n vert_ptr_dist[centroid] = centr_dist;\n }\n }\n }\n }\n}\n\nint fu_parent[MaxN];\n\nint FuFind(int v) {\n if (fu_parent[v] == v)\n return v;\n return fu_parent[v] = FuFind(fu_parent[v]);\n}\n\nbool FuUnion(int a, int b) {\n a = FuFind(a);\n b = FuFind(b);\n if (a != b) {\n fu_parent[a] = b;\n return true;\n }\n return false;\n}\n\nint32_t main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout << fixed << setprecision(11);\n cerr << fixed << setprecision(6);\n\n cin >> N;\n for (int i = 1; i <= N; ++i)\n cin >> weights[i];\n\n iota(fu_parent, fu_parent + N + 1, 0);\n\n for (int i = 0; i < N - 1; ++i) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].emplace_back(v, c);\n adj[v].emplace_back(u, c);\n }\n\n fill_n(is_avail, N + 1, true);\n fill_n(layer_idx, N + 1, (int)1e9);\n Centroids(1, 0);\n\n int num_edges = 0;\n long long total_cost = 0;\n iota(groups, groups + N + 1, 0);\n\n while (num_edges < N - 1) {\n CentroidGroups();\n\n vector<int> order(N);\n vector<bool> had_out_edge(N + 1);\n iota(ALL(order), 1);\n sort(ALL(order), [&](int lhs, int rhs) {\n return vert_ptr_dist[lhs] < vert_ptr_dist[rhs];\n });\n\n for (int i : order) {\n if (had_out_edge[groups[i]]) {\n continue;\n }\n had_out_edge[groups[i]] = true;\n debug(i, vert_ptr[i], vert_ptr_dist[i]);\n assert(vert_ptr_dist[i] < 1e17);\n if (FuUnion(i, vert_ptr[i])) {\n total_cost += vert_ptr_dist[i];\n ++num_edges;\n debug(\"TAKING EDGE\", i, vert_ptr[i], vert_ptr_dist[i],\n \"!@#@!@!#@!##@!\");\n }\n }\n\n for (int i = 1; i <= N; ++i) {\n groups[i] = FuFind(i);\n debug(i, groups[i]);\n }\n }\n\n cout << total_cost << \"\\\\n\";\n}\n","change":"replace","i1":67,"i2":218,"j1":67,"j2":199,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03542","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n\n#define pb push_back\n#define mp make_pair\n#define taskname \"A\"\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<int, int> ii;\n\nconst int maxn = 2e5 + 5;\nconst int logn = log2(maxn) + 2;\nconst int mod = 1e9 + 7;\nint lab[maxn];\nint FindLab(int u) { return lab[u] < 0 ? u : lab[u] = FindLab(lab[u]); }\nint n, cost[maxn];\nstruct node {\n pair<ll, int> a, b;\n node() { a = b = mp(1e18, -1); };\n void reset() { a = b = mp(1e18, -1); }\n void add(pair<ll, int> x, ll y = 0) {\n x.first += y;\n if (a.second == x.second)\n a = min(a, x);\n else if (b.second == x.second)\n b = min(b, x);\n else if (a > x)\n b = a, a = x;\n else if (b > x)\n b = x;\n if (b < a)\n swap(a, b);\n assert(b.second != a.second || a.second == -1);\n }\n} dp[maxn];\npair<ll, int> bezt[maxn];\nvector<ii> adj[maxn];\n\nnode dfs(int u, int par) {\n node a;\n \/\/ cout << u << endl;\n for (auto c : adj[u]) {\n if (c.first == par)\n continue;\n auto tmp = dfs(c.first, u);\n a.add(tmp.a, c.second);\n a.add(tmp.b, c.second);\n }\n if (a.a.second != FindLab(u))\n bezt[FindLab(u)] =\n min(bezt[FindLab(u)], mp(a.a.first + cost[u], a.a.second));\n if (a.b.second != FindLab(u))\n bezt[FindLab(u)] =\n min(bezt[FindLab(u)], mp(a.b.first + cost[u], a.b.second));\n a.add(mp(cost[u], FindLab(u)));\n for (auto c : adj[u]) {\n if (c.first == par)\n continue;\n dp[c.first].add(a.a);\n dp[c.first].add(a.b);\n }\n return a;\n}\n\nvoid dfs1(int u, int par, node a) {\n if (a.a.second != FindLab(u))\n bezt[FindLab(u)] =\n min(bezt[FindLab(u)], mp(a.a.first + cost[u], a.a.second));\n if (a.b.second != FindLab(u))\n bezt[FindLab(u)] =\n min(bezt[FindLab(u)], mp(a.b.first + cost[u], a.b.second));\n for (auto c : adj[u]) {\n if (c.first == par)\n continue;\n node b;\n b.add(a.a, c.second);\n b.add(a.b, c.second);\n b.add(dp[c.first].a, c.second);\n b.add(dp[c.first].b, c.second);\n dfs1(c.first, u, b);\n }\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n if (fopen(taskname \".INP\", \"r\")) {\n freopen(taskname \".INP\", \"r\", stdin);\n freopen(taskname \".OUT\", \"w\", stdout);\n }\n fill_n(lab, maxn, -1);\n cin >> n;\n for (int i = 1; i <= n; ++i)\n cin >> cost[i];\n for (int i = 1; i < n; ++i) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].pb(mp(v, c));\n adj[v].pb(mp(u, c));\n }\n ll res = 0;\n int cnt = n - 1;\n while (cnt > 0) {\n for (int i = 1; i <= n; ++i)\n dp[i].reset(), bezt[i] = mp(1e18, -1);\n dfs(1, 0);\n \/\/ return 0;\n node tmp;\n tmp.reset();\n dfs1(1, 0, tmp);\n vector<pair<ll, ii>> edge;\n for (int i = 1; i <= n; ++i) {\n if (lab[i] < 0) {\n if (bezt[i].first < 1e18) {\n edge.pb(mp(bezt[i].first, mp(i, bezt[i].second)));\n int u = i, v = bezt[i].second;\n if (u == v)\n continue;\n res += bezt[i].first;\n if (lab[u] > lab[v])\n swap(u, v);\n lab[u] += lab[v];\n lab[v] = u;\n --cnt;\n }\n }\n }\n }\n cout << res;\n}\n","fail":"#include <bits\/stdc++.h>\n\n#define pb push_back\n#define mp make_pair\n#define taskname \"A\"\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef long double ld;\ntypedef pair<int, int> ii;\n\nconst int maxn = 2e5 + 5;\nconst int logn = log2(maxn) + 2;\nconst int mod = 1e9 + 7;\nint lab[maxn];\nint FindLab(int u) { return lab[u] < 0 ? u : lab[u] = FindLab(lab[u]); }\nint n, cost[maxn];\nstruct node {\n pair<ll, int> a, b;\n node() { a = b = mp(1e18, -1); };\n void reset() { a = b = mp(1e18, -1); }\n void add(pair<ll, int> x, ll y = 0) {\n x.first += y;\n if (a.second == x.second)\n a = min(a, x);\n else if (b.second == x.second)\n b = min(b, x);\n else if (a > x)\n b = a, a = x;\n else if (b > x)\n b = x;\n if (b < a)\n swap(a, b);\n assert(b.second != a.second || a.second == -1);\n }\n} dp[maxn];\npair<ll, int> bezt[maxn];\nvector<ii> adj[maxn];\n\nnode dfs(int u, int par) {\n node a;\n \/\/ cout << u << endl;\n for (auto c : adj[u]) {\n if (c.first == par)\n continue;\n auto tmp = dfs(c.first, u);\n a.add(tmp.a, c.second);\n a.add(tmp.b, c.second);\n }\n if (a.a.second != FindLab(u))\n bezt[FindLab(u)] =\n min(bezt[FindLab(u)], mp(a.a.first + cost[u], a.a.second));\n if (a.b.second != FindLab(u))\n bezt[FindLab(u)] =\n min(bezt[FindLab(u)], mp(a.b.first + cost[u], a.b.second));\n a.add(mp(cost[u], FindLab(u)));\n for (auto c : adj[u]) {\n if (c.first == par)\n continue;\n dp[c.first].add(a.a);\n dp[c.first].add(a.b);\n }\n return a;\n}\n\nvoid dfs1(int u, int par, node a) {\n if (a.a.second != FindLab(u))\n bezt[FindLab(u)] =\n min(bezt[FindLab(u)], mp(a.a.first + cost[u], a.a.second));\n if (a.b.second != FindLab(u))\n bezt[FindLab(u)] =\n min(bezt[FindLab(u)], mp(a.b.first + cost[u], a.b.second));\n for (auto c : adj[u]) {\n if (c.first == par)\n continue;\n node b;\n b.add(a.a, c.second);\n b.add(a.b, c.second);\n b.add(dp[c.first].a, c.second);\n b.add(dp[c.first].b, c.second);\n dfs1(c.first, u, b);\n }\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n if (fopen(taskname \".INP\", \"r\")) {\n freopen(taskname \".INP\", \"r\", stdin);\n freopen(taskname \".OUT\", \"w\", stdout);\n }\n fill_n(lab, maxn, -1);\n cin >> n;\n for (int i = 1; i <= n; ++i)\n cin >> cost[i];\n for (int i = 1; i < n; ++i) {\n int u, v, c;\n cin >> u >> v >> c;\n adj[u].pb(mp(v, c));\n adj[v].pb(mp(u, c));\n }\n ll res = 0;\n int cnt = n - 1;\n while (cnt > 0) {\n for (int i = 1; i <= n; ++i)\n dp[i].reset(), bezt[i] = mp(1e18, -1);\n dfs(1, 0);\n \/\/ return 0;\n node tmp;\n tmp.reset();\n dfs1(1, 0, tmp);\n vector<pair<ll, ii>> edge;\n for (int i = 1; i <= n; ++i) {\n if (lab[i] < 0) {\n if (bezt[i].first < 1e18) {\n edge.pb(mp(bezt[i].first, mp(i, bezt[i].second)));\n int u = FindLab(i), v = FindLab(bezt[i].second);\n if (u == v)\n continue;\n res += bezt[i].first;\n if (lab[u] > lab[v])\n swap(u, v);\n lab[u] += lab[v];\n lab[v] = u;\n --cnt;\n }\n }\n }\n }\n cout << res;\n}\n","change":"replace","i1":117,"i2":118,"j1":117,"j2":118,"error":"WA","stderr":null,"stdout":22.0}
{"problem_id":"p03542","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\n\n#define pb push_back\n#define mp make_pair\n\nusing namespace std;\n\ntemplate <typename T> inline bool upmin(T &x, T y) {\n return y < x ? x = y, 1 : 0;\n}\n\ntypedef unsigned int u32;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef long double lod;\ntypedef pair<int, int> PR;\ntypedef vector<int> VI;\n\nconst lod pi = acos(-1);\nconst int oo = 1 << 30;\nconst LL OO = 1e18;\n\nconst int N = 2e5 + 100;\n\nint gi() {\n int w = 0;\n bool q = 1;\n char c = getchar();\n while ((c < '0' || c > '9') && c != '-')\n c = getchar();\n if (c == '-')\n q = 0, c = getchar();\n while (c >= '0' && c <= '9')\n w = w * 10 + c - '0', c = getchar();\n return q ? w : -w;\n}\n\nint val[N], fa[N];\nint head[N], nxt[N * 2], to[N * 2], w[N * 2];\ninline int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }\n#define fi first\n#define se second\nstruct DT {\n pair<LL, int> fi, se;\n} f[N];\ninline DT operator+(const DT &a, const int &b) {\n return (DT){mp(a.fi.fi + b, a.fi.se), mp(a.se.fi + b, a.se.se)};\n}\ninline DT operator+(const DT &a, const DT &b) {\n DT ans;\n if (a.fi.se == b.fi.se)\n ans.fi = min(a.fi, b.fi), ans.se = min(a.se, b.se);\n else if (a.fi.fi < b.fi.fi)\n ans = a, upmin(ans.se, b.fi);\n else\n ans = b, upmin(ans.se, a.fi);\n return ans;\n}\ninline void dfs1(int k, int fa) {\n f[k] = (DT){mp(val[k], find(k)), mp(OO, 0)};\n for (int i = head[k]; i; i = nxt[i])\n if (to[i] != fa)\n dfs1(to[i], k), f[k] = f[k] + (f[to[i]] + w[i]);\n}\ninline void dfs2(int k, int fa) {\n for (int i = head[k]; i; i = nxt[i])\n if (to[i] != fa) {\n f[to[i]] = f[to[i]] + (f[k] + w[i]);\n dfs2(to[i], k);\n }\n}\nint main() {\n#ifndef ONLINE_JUDGE\n freopen(\"J.in\", \"r\", stdin);\n freopen(\"J.out\", \"w\", stdout);\n#endif\n int n = gi(), i, a, b, C = n, tot = 0;\n pair<LL, int> p;\n LL ans = 0;\n for (i = 1; i <= n; i++)\n val[i] = gi(), fa[i] = i;\n for (i = 1; i < n; i++) {\n a = gi(), b = gi();\n to[++tot] = b, nxt[tot] = head[a], head[a] = tot;\n to[++tot] = a, nxt[tot] = head[b], head[b] = tot;\n w[tot] = w[tot - 1] = gi();\n }\n while (C > 1) {\n dfs1(1, 0);\n dfs2(1, 0);\n for (i = 1; i <= n; i++)\n f[i].fi.fi += val[i], f[i].se.fi += val[i];\n for (i = 1; i <= n; i++)\n if (fa[i] != i)\n f[find(i)] = f[find(i)] + f[i];\n for (i = 1; i <= n; i++)\n if (fa[i] == i) {\n p = f[i].fi.se == i ? f[i].se : f[i].fi;\n if (find(i) != find(p.se)) {\n ans += p.fi;\n fa[i] = p.se;\n C--;\n }\n }\n }\n cout << ans << endl;\n return 0;\n}\n","fail":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\n\n#define pb push_back\n#define mp make_pair\n\nusing namespace std;\n\ntemplate <typename T> inline bool upmin(T &x, T y) {\n return y < x ? x = y, 1 : 0;\n}\n\ntypedef unsigned int u32;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef long double lod;\ntypedef pair<int, int> PR;\ntypedef vector<int> VI;\n\nconst lod pi = acos(-1);\nconst int oo = 1 << 30;\nconst LL OO = 1e18;\n\nconst int N = 2e5 + 100;\n\nint gi() {\n int w = 0;\n bool q = 1;\n char c = getchar();\n while ((c < '0' || c > '9') && c != '-')\n c = getchar();\n if (c == '-')\n q = 0, c = getchar();\n while (c >= '0' && c <= '9')\n w = w * 10 + c - '0', c = getchar();\n return q ? w : -w;\n}\n\nint val[N], fa[N];\nint head[N], nxt[N * 2], to[N * 2], w[N * 2];\ninline int find(int x) { return fa[x] == x ? x : fa[x] = find(fa[x]); }\n#define fi first\n#define se second\nstruct DT {\n pair<LL, int> fi, se;\n} f[N];\ninline DT operator+(const DT &a, const int &b) {\n return (DT){mp(a.fi.fi + b, a.fi.se), mp(a.se.fi + b, a.se.se)};\n}\ninline DT operator+(const DT &a, const DT &b) {\n DT ans;\n if (a.fi.se == b.fi.se)\n ans.fi = min(a.fi, b.fi), ans.se = min(a.se, b.se);\n else if (a.fi.fi < b.fi.fi)\n ans = a, upmin(ans.se, b.fi);\n else\n ans = b, upmin(ans.se, a.fi);\n return ans;\n}\ninline void dfs1(int k, int fa) {\n f[k] = (DT){mp(val[k], find(k)), mp(OO, 0)};\n for (int i = head[k]; i; i = nxt[i])\n if (to[i] != fa)\n dfs1(to[i], k), f[k] = f[k] + (f[to[i]] + w[i]);\n}\ninline void dfs2(int k, int fa) {\n for (int i = head[k]; i; i = nxt[i])\n if (to[i] != fa) {\n f[to[i]] = f[to[i]] + (f[k] + w[i]);\n dfs2(to[i], k);\n }\n}\nint main() {\n int n = gi(), i, a, b, C = n, tot = 0;\n pair<LL, int> p;\n LL ans = 0;\n for (i = 1; i <= n; i++)\n val[i] = gi(), fa[i] = i;\n for (i = 1; i < n; i++) {\n a = gi(), b = gi();\n to[++tot] = b, nxt[tot] = head[a], head[a] = tot;\n to[++tot] = a, nxt[tot] = head[b], head[b] = tot;\n w[tot] = w[tot - 1] = gi();\n }\n while (C > 1) {\n dfs1(1, 0);\n dfs2(1, 0);\n for (i = 1; i <= n; i++)\n f[i].fi.fi += val[i], f[i].se.fi += val[i];\n for (i = 1; i <= n; i++)\n if (fa[i] != i)\n f[find(i)] = f[find(i)] + f[i];\n for (i = 1; i <= n; i++)\n if (fa[i] == i) {\n p = f[i].fi.se == i ? f[i].se : f[i].fi;\n if (find(i) != find(p.se)) {\n ans += p.fi;\n fa[i] = p.se;\n C--;\n }\n }\n }\n cout << ans << endl;\n return 0;\n}\n","change":"delete","i1":84,"i2":88,"j1":84,"j2":84,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03542","language":"C++","original_status":"Memory Limit Exceeded","pass":"#include <algorithm>\n#include <functional>\n#include <inttypes.h>\n#include <queue>\n#include <stdint.h>\n#include <stdio.h>\n\nint ri() {\n int n;\n scanf(\"%d\", &n);\n return n;\n}\n\n#define INF 1000000000000000000\n\nstruct Node;\nextern Node *NONE;\nstruct Node {\n template <class T> struct Min {\n std::priority_queue<T, std::vector<T>, std::greater<T>> all;\n std::priority_queue<T, std::vector<T>, std::greater<T>> removing;\n void add(T content) { all.push(content); }\n void fix() {\n while (removing.size() && removing.top() == all.top())\n removing.pop(), all.pop();\n }\n void remove(T content) {\n removing.push(content);\n fix();\n }\n T min() { return all.size() ? all.top() : T{INF, {}}; }\n int size() { return all.size() - removing.size(); }\n };\n#define l ch[0]\n#define r ch[1]\n Node *ch[2] = {NONE, NONE};\n Node *p = NONE;\n \/* vvvv LIGHT stuff vvvv *\/\n Min<std::pair<int64_t, int>> light_nearest[2];\n Min<std::pair<int64_t, std::pair<int, int>>> light_res;\n \/* vvvv self stuff vvvv *\/\n bool rev = false;\n bool marked[2] = {false, false};\n int len = 0;\n int id = -1;\n \/* vvvv heavy stuff vvvv *\/\n int64_t len_sum = 0;\n std::pair<int64_t, std::pair<int, int>> res = {INF, {-1, -1}};\n std::pair<int64_t, int> left[2] = {{INF, -1}, {INF, -1}};\n std::pair<int64_t, int> right[2] = {{INF, -1}, {INF, -1}};\n Node *fetch() {\n if (l != NONE)\n l->flush();\n if (r != NONE)\n r->flush();\n len_sum = len + l->len_sum + r->len_sum;\n \/\/ a lot of candidates\n res = {INF, {-1, -1}};\n if (light_res.size())\n res = light_res.min(); \/\/ inside light\n res = std::min(\n res, {light_nearest[0].min().first + light_nearest[1].min().first + len,\n {light_nearest[0].min().second,\n light_nearest[1].min().second}}); \/\/ light to light\n if (marked[0]) { \/\/ from this\n res = std::min(\n res, {l->right[1].first, {id, l->right[1].second}}); \/\/ heavy left\n res = std::min(\n res, {r->left[1].first, {id, r->left[1].second}}); \/\/ heavy right\n res = std::min(res, {light_nearest[1].min().first,\n {id, light_nearest[1].min().second}}); \/\/ light\n }\n if (marked[1]) { \/\/ from this\n res = std::min(\n res, {l->right[0].first, {l->right[0].second, id}}); \/\/ heavy left\n res = std::min(\n res, {r->left[0].first, {r->left[0].second, id}}); \/\/ heavy right\n res = std::min(res, {light_nearest[0].min().first,\n {light_nearest[0].min().second, id}}); \/\/ light\n }\n \/\/ left to right\n res = std::min(res, {l->right[0].first + r->left[1].first + len,\n {l->right[0].second, r->left[1].second}});\n res = std::min(res, {l->right[1].first + r->left[0].first + len,\n {r->left[0].second, l->right[1].second}});\n \/\/ light to left\/right\n res = std::min(res, {l->right[0].first + light_nearest[1].min().first + len,\n {l->right[0].second, light_nearest[1].min().second}});\n res = std::min(res, {r->left[0].first + light_nearest[1].min().first + len,\n {r->left[0].second, light_nearest[1].min().second}});\n res = std::min(res, {l->right[1].first + light_nearest[0].min().first + len,\n {light_nearest[0].min().second, l->right[1].second}});\n res = std::min(res, {r->left[1].first + light_nearest[0].min().first + len,\n {light_nearest[0].min().second, r->left[1].second}});\n res = std::min({res, l->res, r->res}); \/\/ inside heavy left\/right\n\n for (int i = 0; i < 2; i++) {\n left[i] =\n std::min({l->left[i],\n {r->left[i].first + len + l->len_sum, r->left[i].second},\n {light_nearest[i].min().first + len + l->len_sum,\n light_nearest[i].min().second}});\n if (marked[i])\n left[i] = std::min(left[i], {l->len_sum, id});\n right[i] =\n std::min({r->right[i],\n {l->right[i].first + len + r->len_sum, l->right[i].second},\n {light_nearest[i].min().first + len + r->len_sum,\n light_nearest[i].min().second}});\n if (marked[i])\n right[i] = std::min(right[i], {r->len_sum, id});\n }\n return this;\n }\n Node *flush() {\n if (rev) {\n std::swap(l, r);\n l->rev ^= 1;\n r->rev ^= 1;\n std::swap(left[0], right[0]);\n std::swap(left[1], right[1]);\n rev = false;\n }\n return this;\n }\n Node *rotate(int dir) {\n Node *new_root = ch[!dir];\n ch[!dir] = new_root->ch[dir];\n ch[!dir]->p = this;\n new_root->ch[dir] = this;\n new_root->p = p;\n if (p->l == this)\n p->l = new_root;\n if (p->r == this)\n p->r = new_root;\n p = new_root;\n return fetch(), new_root->fetch();\n }\n bool is_root() { return p == NONE || (p->l != this && p->r != this); }\n void splay() {\n flush();\n while (!is_root()) {\n if (p->is_root()) {\n p->flush(), flush();\n p->rotate(p->l == this);\n } else {\n Node *pp = p->p;\n pp->flush(), p->flush(), flush();\n bool flag0 = pp->l == p;\n bool flag1 = p->l == this;\n if (flag0 == flag1)\n pp->rotate(flag0);\n p->rotate(flag1);\n if (flag0 != flag1)\n pp->rotate(flag0);\n }\n }\n }\n Node *expose() {\n Node *prev = NONE;\n for (Node *cur = this; cur != NONE; cur = cur->p) {\n cur->splay();\n if (cur->r != NONE) { \/\/ add\n cur->r->flush();\n for (int i = 0; i < 2; i++)\n cur->light_nearest[i].add(cur->r->left[i]);\n cur->light_res.add(cur->r->res);\n }\n cur->r = prev;\n if (cur->r != NONE) { \/\/ remove\n for (int i = 0; i < 2; i++)\n cur->light_nearest[i].remove(cur->r->left[i]);\n cur->light_res.remove(cur->r->res);\n }\n cur->fetch();\n prev = cur;\n }\n splay();\n return prev;\n }\n void link(Node *parent) {\n expose();\n parent->expose();\n p = parent;\n parent->r = this;\n parent->fetch();\n }\n void cut() {\n expose();\n l->p = NONE;\n l = NONE;\n fetch();\n }\n void evert() {\n expose();\n rev = true;\n flush();\n }\n#undef l\n#undef r\n};\nNode *NONE = new Node;\n\nint main() {\n int n = ri();\n int a[n];\n for (auto &i : a)\n i = ri();\n Node nodes[2 * n];\n Node edges[2 * n - 1];\n for (int i = 0; i < 2 * n; i++) {\n nodes[i].id = i;\n if (i >= n)\n nodes[i].marked[1] = true;\n nodes[i].fetch();\n }\n for (int i = 0; i + 1 < n; i++) {\n int a = ri() - 1;\n int b = ri() - 1;\n int c = ri();\n edges[i].len = c;\n edges[i].fetch();\n nodes[a].evert();\n nodes[a].link(edges + i);\n edges[i].link(nodes + b);\n }\n for (int i = 0; i < n; i++) {\n edges[i + n - 1].len = a[i];\n edges[i + n - 1].fetch();\n edges[i + n - 1].link(nodes + i);\n nodes[i + n].link(edges + i + n - 1);\n }\n auto flip = [&](int i) {\n nodes[i].expose();\n nodes[i].marked[1] = false;\n nodes[i].marked[0] = true;\n nodes[i].fetch();\n };\n flip(n);\n int64_t res = 0;\n for (int i = 0; i + 1 < n; i++) {\n nodes[0].evert();\n res += nodes[0].res.first;\n flip(nodes[0].res.second.second);\n }\n printf(\"%\" PRId64 \"\\\\n\", res);\n return 0;\n}\n","fail":"#include <algorithm>\n#include <functional>\n#include <inttypes.h>\n#include <queue>\n#include <stdint.h>\n#include <stdio.h>\n\nint ri() {\n int n;\n scanf(\"%d\", &n);\n return n;\n}\n\n#define INF 1000000000000000000\n\nstruct Node;\nextern Node *NONE;\nstruct Node {\n template <class T> struct Min {\n std::priority_queue<T, std::vector<T>, std::greater<T>> all;\n std::priority_queue<T, std::vector<T>, std::greater<T>> removing;\n void add(T content) { all.push(content); }\n void fix() {\n while (removing.size() && removing.top() == all.top())\n removing.pop(), all.pop();\n }\n void remove(T content) {\n removing.push(content);\n fix();\n }\n T min() { return all.size() ? all.top() : T{INF, {}}; }\n int size() { return all.size() - removing.size(); }\n };\n#define l ch[0]\n#define r ch[1]\n Node *ch[2] = {NONE, NONE};\n Node *p = NONE;\n \/* vvvv LIGHT stuff vvvv *\/\n Min<std::pair<int64_t, int>> light_nearest[2];\n Min<std::pair<int64_t, std::pair<int, int>>> light_res;\n \/* vvvv self stuff vvvv *\/\n bool rev = false;\n bool marked[2] = {false, false};\n int len = 0;\n int id = -1;\n int bias = 0;\n \/* vvvv heavy stuff vvvv *\/\n int64_t len_sum = 0;\n std::pair<int64_t, std::pair<int, int>> res = {INF, {-1, -1}};\n std::pair<int64_t, int> left[2] = {{INF, -1}, {INF, -1}};\n std::pair<int64_t, int> right[2] = {{INF, -1}, {INF, -1}};\n Node *fetch() {\n if (l != NONE)\n l->flush();\n if (r != NONE)\n r->flush();\n len_sum = len + l->len_sum + r->len_sum;\n \/\/ a lot of candidates\n res = {INF, {-1, -1}};\n if (light_res.size())\n res = light_res.min(); \/\/ inside light\n res = std::min(\n res, {light_nearest[0].min().first + light_nearest[1].min().first + len,\n {light_nearest[0].min().second,\n light_nearest[1].min().second}}); \/\/ light to light\n if (marked[0]) { \/\/ from this\n res = std::min(res, {l->right[1].first + bias,\n {id, l->right[1].second}}); \/\/ heavy left\n res = std::min(res, {r->left[1].first + bias,\n {id, r->left[1].second}}); \/\/ heavy right\n res = std::min(res, {light_nearest[1].min().first + bias,\n {id, light_nearest[1].min().second}}); \/\/ light\n }\n if (marked[1]) { \/\/ from this\n res = std::min(res, {l->right[0].first + bias,\n {l->right[0].second, id}}); \/\/ heavy left\n res = std::min(res, {r->left[0].first + bias,\n {r->left[0].second, id}}); \/\/ heavy right\n res = std::min(res, {light_nearest[0].min().first + bias,\n {light_nearest[0].min().second, id}}); \/\/ light\n }\n \/\/ left to right\n res = std::min(res, {l->right[0].first + r->left[1].first + len,\n {l->right[0].second, r->left[1].second}});\n res = std::min(res, {l->right[1].first + r->left[0].first + len,\n {r->left[0].second, l->right[1].second}});\n \/\/ light to left\/right\n res = std::min(res, {l->right[0].first + light_nearest[1].min().first + len,\n {l->right[0].second, light_nearest[1].min().second}});\n res = std::min(res, {r->left[0].first + light_nearest[1].min().first + len,\n {r->left[0].second, light_nearest[1].min().second}});\n res = std::min(res, {l->right[1].first + light_nearest[0].min().first + len,\n {light_nearest[0].min().second, l->right[1].second}});\n res = std::min(res, {r->left[1].first + light_nearest[0].min().first + len,\n {light_nearest[0].min().second, r->left[1].second}});\n res = std::min({res, l->res, r->res}); \/\/ inside heavy left\/right\n\n for (int i = 0; i < 2; i++) {\n left[i] =\n std::min({l->left[i],\n {r->left[i].first + len + l->len_sum, r->left[i].second},\n {light_nearest[i].min().first + len + l->len_sum,\n light_nearest[i].min().second}});\n if (marked[i])\n left[i] = std::min(left[i], {l->len_sum + bias, id});\n right[i] =\n std::min({r->right[i],\n {l->right[i].first + len + r->len_sum, l->right[i].second},\n {light_nearest[i].min().first + len + r->len_sum,\n light_nearest[i].min().second}});\n if (marked[i])\n right[i] = std::min(right[i], {r->len_sum + bias, id});\n }\n return this;\n }\n Node *flush() {\n if (rev) {\n std::swap(l, r);\n l->rev ^= 1;\n r->rev ^= 1;\n std::swap(left[0], right[0]);\n std::swap(left[1], right[1]);\n rev = false;\n }\n return this;\n }\n Node *rotate(int dir) {\n Node *new_root = ch[!dir];\n ch[!dir] = new_root->ch[dir];\n ch[!dir]->p = this;\n new_root->ch[dir] = this;\n new_root->p = p;\n if (p->l == this)\n p->l = new_root;\n if (p->r == this)\n p->r = new_root;\n p = new_root;\n return fetch(), new_root->fetch();\n }\n bool is_root() { return p == NONE || (p->l != this && p->r != this); }\n void splay() {\n flush();\n while (!is_root()) {\n if (p->is_root()) {\n p->flush(), flush();\n p->rotate(p->l == this);\n } else {\n Node *pp = p->p;\n pp->flush(), p->flush(), flush();\n bool flag0 = pp->l == p;\n bool flag1 = p->l == this;\n if (flag0 == flag1)\n pp->rotate(flag0);\n p->rotate(flag1);\n if (flag0 != flag1)\n pp->rotate(flag0);\n }\n }\n }\n Node *expose() {\n Node *prev = NONE;\n for (Node *cur = this; cur != NONE; cur = cur->p) {\n cur->splay();\n if (cur->r != NONE) { \/\/ add\n cur->r->flush();\n for (int i = 0; i < 2; i++)\n cur->light_nearest[i].add(cur->r->left[i]);\n cur->light_res.add(cur->r->res);\n }\n cur->r = prev;\n if (cur->r != NONE) { \/\/ remove\n for (int i = 0; i < 2; i++)\n cur->light_nearest[i].remove(cur->r->left[i]);\n cur->light_res.remove(cur->r->res);\n }\n cur->fetch();\n prev = cur;\n }\n splay();\n return prev;\n }\n void link(Node *parent) {\n expose();\n parent->expose();\n p = parent;\n parent->r = this;\n parent->fetch();\n }\n void cut() {\n expose();\n l->p = NONE;\n l = NONE;\n fetch();\n }\n void evert() {\n expose();\n rev = true;\n flush();\n }\n#undef l\n#undef r\n};\nNode *NONE = new Node;\n\nint main() {\n int n = ri();\n int a[n];\n for (auto &i : a)\n i = ri();\n Node nodes[n];\n Node edges[n - 1];\n for (int i = 0; i < n; i++) {\n nodes[i].id = i;\n nodes[i].marked[1] = true;\n nodes[i].bias = a[i];\n nodes[i].fetch();\n }\n for (int i = 0; i + 1 < n; i++) {\n int a = ri() - 1;\n int b = ri() - 1;\n int c = ri();\n edges[i].len = c;\n edges[i].fetch();\n nodes[a].evert();\n nodes[a].link(edges + i);\n edges[i].link(nodes + b);\n }\n auto flip = [&](int i) {\n nodes[i].expose();\n nodes[i].marked[1] = false;\n nodes[i].marked[0] = true;\n nodes[i].fetch();\n };\n flip(0);\n int64_t res = 0;\n for (int i = 0; i + 1 < n; i++) {\n nodes[0].evert();\n res += nodes[0].res.first;\n flip(nodes[0].res.second.second);\n }\n printf(\"%\" PRId64 \"\\\\n\", res);\n return 0;\n}\n","change":"replace","i1":45,"i2":239,"j1":45,"j2":234,"error":"MLE","stderr":null,"stdout":null}
{"problem_id":"p03542","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <cstdio>\n#include <set>\n#include <vector>\n#define pli pair<long long, int>\n#define N_ 201000\nusing namespace std;\nvector<int> E[N_], L[N_];\nint X[N_], n, C[N_], chk[N_];\nlong long D[N_], dis[N_][20], INF = 4e18;\nint Root[N_][20];\nvector<int> TP;\n\nmultiset<long long> On[N_];\nset<pli> Off[N_], Set;\nbool MST[N_];\n\nvoid DFS(int a, int pp) {\n int i;\n TP.push_back(a);\n C[a] = 1;\n for (i = 0; i < E[a].size(); i++) {\n if (chk[E[a][i]] || E[a][i] == pp)\n continue;\n D[E[a][i]] = D[a] + L[a][i];\n DFS(E[a][i], a);\n C[a] += C[E[a][i]];\n }\n}\nvoid Do(int a, int dep) {\n int i;\n D[a] = 0;\n TP.clear();\n DFS(a, 0);\n if (C[a] == 1)\n return;\n int M = C[a] + 1, mid = 0;\n for (i = 0; i < TP.size(); i++) {\n if (C[a] < C[TP[i]] * 2 && M > C[TP[i]]) {\n M = C[TP[i]];\n mid = TP[i];\n }\n }\n chk[mid] = 1;\n for (i = 0; i < E[mid].size(); i++) {\n if (!chk[E[mid][i]]) {\n Do(E[mid][i], dep + 1);\n }\n }\n chk[mid] = 0;\n TP.clear();\n D[mid] = 0;\n DFS(mid, 0);\n for (i = 0; i < TP.size(); i++) {\n Root[TP[i]][dep] = mid;\n dis[TP[i]][dep] = D[TP[i]];\n Off[mid].insert({D[TP[i]] + X[TP[i]], TP[i]});\n }\n\n Off[mid].insert({INF, -1});\n On[mid].insert(INF);\n Set.insert(\n {Off[mid].begin()->first + *On[mid].begin(), Off[mid].begin()->second});\n}\n\nvoid Make(int a) {\n MST[a] = true;\n int i;\n for (i = 0; i < 20; i++) {\n if (!Root[a][i])\n break;\n int rt = Root[a][i];\n pli r1 = {Off[rt].begin()->first + *On[rt].begin(),\n Off[rt].begin()->second};\n Off[rt].erase({dis[a][i] + X[a], a});\n On[rt].insert(dis[a][i] + X[a]);\n pli r2 = {Off[rt].begin()->first + *On[rt].begin(),\n Off[rt].begin()->second};\n Set.erase(r1);\n Set.insert(r2);\n }\n}\n\nint main() {\n int i, a, b, c;\n scanf(\"%d\", &n);\n for (i = 1; i <= n; i++) {\n scanf(\"%d\", &X[i]);\n }\n for (i = 1; i < n; i++) {\n scanf(\"%d%d%d\", &a, &b, &c);\n E[a].push_back(b);\n L[a].push_back(c);\n E[b].push_back(a);\n L[b].push_back(c);\n }\n Do(1, 0);\n\n Make(1);\n long long res = 0;\n for (int i = 0; i < n - 1; i++) {\n pli tp = *Set.begin();\n res += tp.first;\n Make(tp.second);\n }\n printf(\"%lld\\\\n\", res);\n}\n","fail":"\/*#include<cstdio>\n#include<algorithm>\nusing namespace std;\nint w[101000];\nint n;\nint main(){\n int i;\n\n \/\/ freopen(\"\/Users\/joseunghyeon\/Downloads\/in (2)\/eval_input.txt\",\"r\",stdin);\n int TC, TT;\n scanf(\"%d\",&TC);\n for(TT=1;TT<=TC;TT++){\n scanf(\"%d\",&n);\n for(i=1;i<=n;i++)scanf(\"%d\",&w[i]);\n sort(w+1,w+n+1);\n printf(\"Case #%d\\\\n\",TT);\n if(w[n]-w[1]>1){\n printf(\"No\\\\n\");\n continue;\n }\n if(w[n]-w[1]==0){\n if(w[1] <= n\/2 || w[1] == n-1)printf(\"Yes\\\\n\");\n else printf(\"No\\\\n\");\n continue;\n }\n for(i=1;i<n;i++)if(w[i]!=w[i+1])break;\n int t = i;\n if(t + 1 <= w[n] && t + (n-t)\/2 >= w[n])printf(\"Yes\\\\n\");\n else printf(\"No\\\\n\");\n }\n}\n*\/\n\n\/*#include<cstdio>\n#include<algorithm>\nusing namespace std;\nint n, w[201000];\nint main(){\n char fp[200];\n\n int T[2]={6,18};\n freopen(\"\/Users\/joseunghyeon\/Downloads\/in (2)\/eval_input.txt\",\"w\",stdout);\n printf(\"%d\\\\n\",T[0]+T[1]);\n for(int TTT = 0; TTT < 2; TTT++){\n for(int TT=0;TT< T[TTT];TT++){\n fprintf(stderr,\"%d %d\\\\n\",TTT,TT);\n sprintf(fp, \"\/Users\/joseunghyeon\/Downloads\/in (2)\/%d_%02d.txt\", TTT,\nTT); freopen(fp, \"r\",stdin); int n, a; scanf(\"%d\",&n); printf(\"%d\\\\n\",n); for(int\ni=0;i<n;i++){ scanf(\"%d\",&a); printf(\"%d\",a); if(i!=n-1)printf(\" \");\n }\n printf(\"\\\\n\");\n }\n }\n return 0;\n}\n*\/\n\n\/*#include<cstdio>\n#include<algorithm>\nusing namespace std;\nint n, w[201000];\nint main(){\n char fp[200];\n int TC = 0;\n int T[2]={6,18};\n freopen(\"\/Users\/joseunghyeon\/Downloads\/out (2)\/eval_output.txt\",\"w\",stdout);\n for(int TTT = 0; TTT < 2; TTT++){\n for(int TT=0;TT< T[TTT];TT++){\n fprintf(stderr,\"%d %d\\\\n\",TTT,TT);\n sprintf(fp, \"\/Users\/joseunghyeon\/Downloads\/out (2)\/%d_%02d.txt\",\nTTT, TT); freopen(fp, \"r\",stdin); char rr[10]; scanf(\"%s\",rr); printf(\"Case\n#%d\\\\n%s\\\\n\",++TC,rr);\n }\n }\n return 0;\n}*\/\n\n\/*\n#include<algorithm>\n#include<cstdio>\n#include<map>\n#include<vector>\nusing namespace std;\nmap<vector<int>,int>Map;\nvector<int> Do(vector<int>T){\n vector<int>ret,T1,T2;\n if(T.size()==1){\n ret.push_back(T[0]+1);\n return ret;\n }\n int i;\n for(i=0;i<T.size()\/2;i++){\n T1.push_back(min(T[i*2],T[i*2+1]));\n T2.push_back(max(T[i*2],T[i*2+1]));\n }\n vector<int>r1, r2;\n r1 = Do(T1);\n r2 = Do(T2);\n for(i=0;i<r1.size();i++)ret.push_back(r1[i]);\n for(i=0;i<r2.size();i++)ret.push_back(r2[i]);\n return ret;\n}\nint main(){\n int i, w[8];\n vector<int>TP(8);\n vector<int>res;\n for(i=0;i<8;i++)w[i]=i;\n do{\n for(i=0;i<8;i++)TP[i]=w[i];\n res = Do(TP);\n Map[res] = 1;\n }while(next_permutation(w,w+8));\n for(auto &tp : Map){\n for(i=0;i<8;i++)printf(\"%d \",tp.first[i]);\n printf(\"\\\\n\");\n }\n}*\/\n\n#include <algorithm>\n#include <cstdio>\n#include <set>\n#include <vector>\n#define pli pair<long long, int>\n#define N_ 201000\nusing namespace std;\nvector<int> E[N_], L[N_];\nint X[N_], n, C[N_], chk[N_], Num[N_][20];\nlong long D[N_], dis[N_][20], INF = 4e18;\nint Root[N_][20];\nvector<int> TP;\nvector<pli> U[N_];\nset<pli> Set;\n\nint PV[N_], Mn[N_];\nlong long RR[N_];\n\nbool MST[N_];\n\nvoid DFS(int a, int pp) {\n int i;\n TP.push_back(a);\n C[a] = 1;\n for (i = 0; i < E[a].size(); i++) {\n if (chk[E[a][i]] || E[a][i] == pp)\n continue;\n D[E[a][i]] = D[a] + L[a][i];\n DFS(E[a][i], a);\n C[a] += C[E[a][i]];\n }\n}\nvoid Do(int a, int dep) {\n int i;\n D[a] = 0;\n TP.clear();\n DFS(a, 0);\n if (C[a] == 1)\n return;\n int M = C[a] + 1, mid = 0;\n for (i = 0; i < TP.size(); i++) {\n if (C[a] < C[TP[i]] * 2 && M > C[TP[i]]) {\n M = C[TP[i]];\n mid = TP[i];\n }\n }\n chk[mid] = 1;\n for (i = 0; i < E[mid].size(); i++) {\n if (!chk[E[mid][i]]) {\n Do(E[mid][i], dep + 1);\n }\n }\n chk[mid] = 0;\n TP.clear();\n D[mid] = 0;\n DFS(mid, 0);\n for (i = 0; i < TP.size(); i++) {\n Root[TP[i]][dep] = mid;\n dis[TP[i]][dep] = D[TP[i]];\n U[mid].push_back({D[TP[i]] + X[TP[i]], TP[i]});\n }\n sort(U[mid].begin(), U[mid].end());\n for (i = 0; i < U[mid].size(); i++) {\n Num[U[mid][i].second][dep] = i;\n }\n RR[mid] = INF;\n Mn[mid] = U[mid].size();\n}\n\nvoid Make(int a) {\n MST[a] = true;\n int i;\n for (i = 0; i < 20; i++) {\n if (!Root[a][i])\n break;\n int rt = Root[a][i], sz = U[rt].size();\n if (PV[rt] != sz && Mn[rt] != sz) {\n Set.erase(\n {U[rt][Mn[rt]].first + U[rt][PV[rt]].first, U[rt][PV[rt]].second});\n }\n Mn[rt] = min(Mn[rt], Num[a][i]);\n while (PV[rt] < sz && MST[U[rt][PV[rt]].second])\n PV[rt]++;\n if (PV[rt] != sz && Mn[rt] != sz) {\n Set.insert(\n {U[rt][Mn[rt]].first + U[rt][PV[rt]].first, U[rt][PV[rt]].second});\n }\n }\n}\n\nint main() {\n int i, a, b, c;\n scanf(\"%d\", &n);\n for (i = 1; i <= n; i++) {\n scanf(\"%d\", &X[i]);\n }\n for (i = 1; i < n; i++) {\n scanf(\"%d%d%d\", &a, &b, &c);\n E[a].push_back(b);\n L[a].push_back(c);\n E[b].push_back(a);\n L[b].push_back(c);\n }\n Do(1, 0);\n\n Make(1);\n long long res = 0;\n for (int i = 0; i < n - 1; i++) {\n pli tp = *Set.begin();\n res += tp.first;\n Make(tp.second);\n }\n printf(\"%lld\\\\n\", res);\n}\n","change":"replace","i1":0,"i2":80,"j1":0,"j2":205,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03571","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <set>\n#include <vector>\n\n#define MIN_INT -2147483648\n#define MAX_INT 2147483647\n#define MIN_LONG -9223372036854775808L\n#define MAX_LONG 9223372036854775807L\n#define PI 3.141592653589793238462643383279502884L\n\n#define MOD 1000000007L\n\n#define long long long int\n\nusing std::cerr;\nusing std::cin;\nusing std::cout;\nusing std::map;\nusing std::pair;\nusing std::string;\nusing std::vector;\n\nlong max(long a, long b) { return a > b ? a : b; }\n\nlong min(long a, long b) { return a < b ? a : b; }\n\n\/\/ @author: pashka\nint main() {\n std::ios::sync_with_stdio(false);\n\n long b[3], d;\n cin >> b[0] >> b[1] >> b[2] >> d;\n\n long x[4] = {0, 0, 0};\n long l[4] = {0, 0, 0};\n long r[4] = {0, 0, 0};\n\n bool g[3];\n\n for (int i = 0; i < 3; i++) {\n g[i] = (b[i] - 1 > d);\n }\n\n int ng = 0;\n for (int i = 0; i < 3; i++) {\n if (g[i])\n ng++;\n }\n\n long res = 1;\n for (int i = 0; i < 3; i++)\n if (g[i]) {\n r[i] = min(b[i], d + 1);\n res *= r[i];\n res %= MOD;\n }\n\n if (ng > 0)\n while (true) {\n \/\/ cout << x[0] << \" \" << x[1] << \" \" << x[2] << \" \" << res <<\n \/\/ \"\\\\n\";\n bool ok = true;\n for (int i = 0; i < 3; i++) {\n if (x[i] < b[i] - 1) {\n ok = false;\n }\n }\n if (ok)\n break;\n\n ok = true;\n for (int i = 0; i < 3; i++) {\n if (g[i] && (l[i] != x[i] - d || r[i] != x[i] + d + 1)) {\n ok = false;\n }\n }\n if (ok) {\n\n \/\/ cout << x[0] << \" \" << x[1] << \" \" << x[2] << \"\\\\n\";\n\n long dd = 2 * d + 1;\n\n long d2 = 1;\n for (int i = 0; i < ng - 1; i++) {\n d2 = (d2 * dd) % MOD;\n }\n long sx = 0;\n for (int i = 0; i < 3; i++) {\n if (g[i])\n sx += x[i];\n }\n\n long ss = (d2 * (dd + sx)) % MOD;\n long e = (ss - res) % MOD;\n\n \/\/ cout << d2 << \" \" << sx << \" \" << ss << \" \" << e <<\n \/\/ \"\\\\n\";\n\n if (e < 0)\n e += MOD;\n\n sx = 0;\n for (int i = 0; i < 3; i++) {\n if (g[i])\n sx += b[i] - 1;\n sx %= MOD;\n }\n ss = (d2 * (dd + sx)) % MOD;\n\n res = ss - 2 * e;\n while (res < 0) {\n res += MOD;\n }\n\n \/\/ cout << ss << \" \" << res << \"\\\\n\";\n break;\n }\n\n bool c[3] = {true, true, true};\n for (int i = 0; i < 3; i++) {\n for (int j = i + 1; j < 3; j++) {\n if ((x[i] + 1) * b[j] > (x[j] + 1) * b[i]) {\n c[i] = false;\n } else {\n c[j] = false;\n }\n }\n }\n\n \/\/ cout << c[0] << \" \" << c[1] << \" \" << c[2] << \"\\\\n\";\n\n ok = false;\n for (int i = 0; i < 3; i++) {\n if (c[i]) {\n ok = true;\n x[i]++;\n if (g[i] && x[i] + d < b[i]) {\n long s = 1;\n for (int j = 0; j < 3; j++)\n if (g[j] && i != j) {\n s *= (r[j] - l[j]);\n }\n res += s;\n while (res >= MOD) {\n res -= MOD;\n }\n }\n l[i] = max(x[i] - d, 0);\n r[i] = min(x[i] + d + 1, b[i]);\n }\n }\n if (!ok) {\n return 1;\n }\n }\n else\n res = 1;\n\n for (int i = 0; i < 3; i++) {\n if (!g[i]) {\n res *= b[i];\n res %= MOD;\n }\n }\n\n cout << res << \"\\\\n\";\n\n return 0;\n}","fail":"#include <algorithm>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <set>\n#include <vector>\n\n#define MIN_INT -2147483648\n#define MAX_INT 2147483647\n#define MIN_LONG -9223372036854775808L\n#define MAX_LONG 9223372036854775807L\n#define PI 3.141592653589793238462643383279502884L\n\n#define MOD 1000000007L\n\n#define long long long int\n\nusing std::cerr;\nusing std::cin;\nusing std::cout;\nusing std::map;\nusing std::pair;\nusing std::string;\nusing std::vector;\n\nlong max(long a, long b) { return a > b ? a : b; }\n\nlong min(long a, long b) { return a < b ? a : b; }\n\n\/\/ @author: pashka\nint main() {\n std::ios::sync_with_stdio(false);\n\n long b[3], d;\n cin >> b[0] >> b[1] >> b[2] >> d;\n\n long x[4] = {0, 0, 0};\n long l[4] = {0, 0, 0};\n long r[4] = {0, 0, 0};\n\n bool g[3];\n\n for (int i = 0; i < 3; i++) {\n g[i] = (b[i] - 1 > d);\n }\n\n int ng = 0;\n for (int i = 0; i < 3; i++) {\n if (g[i])\n ng++;\n }\n\n long res = 1;\n for (int i = 0; i < 3; i++)\n if (g[i]) {\n r[i] = min(b[i], d + 1);\n res *= r[i];\n res %= MOD;\n }\n\n if (ng > 0)\n while (true) {\n \/\/ cout << x[0] << \" \" << x[1] << \" \" << x[2] << \" \" << res <<\n \/\/ \"\\\\n\";\n bool ok = true;\n for (int i = 0; i < 3; i++) {\n if (x[i] < b[i] - 1) {\n ok = false;\n }\n }\n if (ok)\n break;\n\n ok = true;\n for (int i = 0; i < 3; i++) {\n if (g[i] && (l[i] != x[i] - d || r[i] != x[i] + d + 1)) {\n ok = false;\n }\n }\n if (ok) {\n\n \/\/ cout << x[0] << \" \" << x[1] << \" \" << x[2] << \"\\\\n\";\n\n long dd = 2 * d + 1;\n\n long d2 = 1;\n for (int i = 0; i < ng - 1; i++) {\n d2 = (d2 * dd) % MOD;\n }\n long sx = 0;\n for (int i = 0; i < 3; i++) {\n if (g[i])\n sx += x[i];\n }\n\n long ss = (d2 * (dd + sx)) % MOD;\n long e = (ss - res) % MOD;\n\n \/\/ cout << d2 << \" \" << sx << \" \" << ss << \" \" << e <<\n \/\/ \"\\\\n\";\n\n if (e < 0)\n e += MOD;\n\n sx = 0;\n for (int i = 0; i < 3; i++) {\n if (g[i])\n sx += b[i] - 1;\n sx %= MOD;\n }\n ss = (d2 * (dd + sx)) % MOD;\n\n res = ss - 2 * e;\n while (res < 0) {\n res += MOD;\n }\n\n \/\/ cout << ss << \" \" << res << \"\\\\n\";\n break;\n }\n\n bool c[3] = {true, true, true};\n for (int i = 0; i < 3; i++) {\n for (int j = i + 1; j < 3; j++) {\n if ((x[i] + 1) * b[j] > (x[j] + 1) * b[i]) {\n c[i] = false;\n } else {\n c[j] = false;\n }\n }\n }\n\n \/\/ cout << c[0] << \" \" << c[1] << \" \" << c[2] << \"\\\\n\";\n\n ok = false;\n for (int i = 0; i < 3; i++) {\n if (c[i]) {\n\n long L = 0;\n long R = b[i] - x[i];\n\n while (R > L + 1) {\n long M = (L + R) \/ 2;\n bool c[3] = {true, true, true};\n x[i] = x[i] + M;\n for (int i = 0; i < 3; i++) {\n for (int j = i + 1; j < 3; j++) {\n if ((x[i] + 1) * b[j] > (x[j] + 1) * b[i]) {\n c[i] = false;\n } else {\n c[j] = false;\n }\n }\n }\n x[i] = x[i] - M;\n if (c[i]) {\n L = M;\n } else {\n R = M;\n }\n }\n\n ok = true;\n if (g[i]) {\n long s = 1;\n for (int j = 0; j < 3; j++)\n if (g[j] && i != j) {\n s *= (r[j] - l[j]);\n }\n long q = min(R, b[i] - 1 - d - x[i]) % MOD;\n if (q > 0)\n res += (s * q) % MOD;\n while (res >= MOD) {\n res -= MOD;\n }\n }\n x[i] += R;\n l[i] = max(x[i] - d, 0);\n r[i] = min(x[i] + d + 1, b[i]);\n }\n }\n if (!ok) {\n return 1;\n }\n }\n else\n res = 1;\n\n for (int i = 0; i < 3; i++) {\n if (!g[i]) {\n res *= b[i];\n res %= MOD;\n }\n }\n\n cout << res << \"\\\\n\";\n\n return 0;\n}","change":"replace","i1":138,"i2":151,"j1":138,"j2":178,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03571","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cassert>\n#include <cstdio>\n#include <cstring>\n\nusing namespace std;\ntypedef long long ll;\nconst int MOD = 1e9 + 7;\nconst int MAXN = 1000010;\nint _w;\n\nint a, b, c, d;\n\nvoid bmax(int &a, int b) { a = b > a ? b : a; }\nvoid bmin(int &a, int b) { a = b < a ? b : a; }\nint calc(int x1, int x2, int y1, int y2, int z1, int z2) {\n if (x1 > a - 1 || y1 > b - 1 || z1 > c - 1 || x2 < 0 || y2 < 0 || z2 < 0)\n return 0;\n bmax(x1, 0), bmin(x1, a - 1), bmax(x2, 0), bmin(x2, a - 1);\n bmax(y1, 0), bmin(y1, b - 1), bmax(y2, 0), bmin(y2, b - 1);\n bmax(z1, 0), bmin(z1, c - 1), bmax(z2, 0), bmin(z2, c - 1);\n int x = x2 - x1 + 1, y = y2 - y1 + 1, z = z2 - z1 + 1;\n return int((ll)x * y % MOD * z % MOD);\n}\n\nvoid nextblock(int x, int y, int z, int &xx, int &yy, int &zz) {\n xx = x + 1;\n yy = int((ll)xx * b \/ a);\n zz = int((ll)xx * c \/ a);\n if (yy == y && zz == z)\n return;\n yy = y + 1;\n xx = int((ll)yy * a \/ b);\n zz = int((ll)yy * c \/ b);\n if (xx == x && zz == z)\n return;\n zz = z + 1;\n xx = int((ll)zz * a \/ c);\n yy = int((ll)zz * b \/ c);\n if (xx == x && yy == y)\n return;\n printf(\"nextblock(%d, %d, %d)\\\\n\", x, y, z);\n assert(0);\n}\nbool test(int x, int y, int z, int xx, int yy, int zz) {\n return false;\n if (xx < x || yy < y || zz < z)\n return false;\n if ((x < d && xx != x) || (y < d && yy != y) || (z < d && zz != z) ||\n (xx >= a - 1 - d && xx != x) || (yy >= b - 1 - d && yy != y) ||\n (zz >= c - 1 - d && zz != z))\n return false;\n else\n return true;\n}\nvoid jumpx(int x, int y, int z, int &xx, int &yy, int &zz) {\n int low = x, high = a - 1;\n while (low < high) {\n int mid = (low + high + 1) >> 1;\n int tx = mid;\n int ty = int((ll)tx * b \/ a);\n int tz = int((ll)tx * c \/ a);\n if (test(x, y, z, tx, ty, tz))\n low = mid;\n else\n high = mid - 1;\n }\n int tx = low;\n int ty = int((ll)tx * b \/ a);\n int tz = int((ll)tx * c \/ a);\n bmax(xx, tx), bmax(yy, ty), bmax(zz, tz);\n}\nvoid jumpy(int x, int y, int z, int &xx, int &yy, int &zz) {\n int low = y, high = b - 1;\n while (low < high) {\n int mid = (low + high + 1) >> 1;\n int ty = mid;\n int tx = int((ll)ty * a \/ b);\n int tz = int((ll)ty * c \/ b);\n if (test(x, y, z, tx, ty, tz))\n low = mid;\n else\n high = mid - 1;\n }\n int ty = low;\n int tx = int((ll)ty * a \/ b);\n int tz = int((ll)ty * c \/ b);\n bmax(xx, tx), bmax(yy, ty), bmax(zz, tz);\n}\nvoid jumpz(int x, int y, int z, int &xx, int &yy, int &zz) {\n int low = z, high = c - 1;\n while (low < high) {\n int mid = (low + high + 1) >> 1;\n int tz = mid;\n int ty = int((ll)tz * b \/ c);\n int tx = int((ll)tz * a \/ c);\n if (test(x, y, z, tx, ty, tz))\n low = mid;\n else\n high = mid - 1;\n }\n int tz = low;\n int ty = int((ll)tz * b \/ c);\n int tx = int((ll)tz * a \/ c);\n bmax(xx, tx), bmax(yy, ty), bmax(zz, tz);\n}\nvoid jumpnext(int x, int y, int z, int &xx, int &yy, int &zz) {\n xx = x, yy = y, zz = z;\n jumpx(x, y, z, xx, yy, zz);\n jumpy(x, y, z, xx, yy, zz);\n jumpz(x, y, z, xx, yy, zz);\n}\n\nint x[MAXN], y[MAXN], z[MAXN], v[MAXN], sz;\nbool checkend() {\n return x[sz - 1] == a - 1 && y[sz - 1] == b - 1 && z[sz - 1] == c - 1;\n}\nvoid solve() {\n x[sz] = y[sz] = z[sz] = 0;\n v[sz++] = calc(-d, d, -d, d, -d, d);\n while (!checkend()) {\n jumpnext(x[sz - 1], y[sz - 1], z[sz - 1], x[sz], y[sz], z[sz]);\n int xx = x[sz], yy = y[sz], zz = z[sz];\n \/\/ printf( \"x = %d, y = %d, z = %d, (pre)\\\\n\", xx, yy, zz );\n nextblock(xx, yy, zz, x[sz], y[sz], z[sz]);\n if (xx != x[sz]) {\n v[sz] = calc(x[sz] + d, x[sz] + d, y[sz] - d, y[sz] + d, z[sz] - d,\n z[sz] + d);\n } else if (yy != y[sz]) {\n v[sz] = calc(x[sz] - d, x[sz] + d, y[sz] + d, y[sz] + d, z[sz] - d,\n z[sz] + d);\n } else if (zz != z[sz]) {\n v[sz] = calc(x[sz] - d, x[sz] + d, y[sz] - d, y[sz] + d, z[sz] + d,\n z[sz] + d);\n }\n \/\/ printf( \"x = %d, y = %d, z = %d, sz = %d\\\\n\", x[sz], y[sz], z[sz], sz );\n ++sz;\n }\n int ans = 0;\n for (int i = 1; i < sz; ++i) {\n ll cnt = (ll)x[i] - x[i - 1] + y[i] - y[i - 1] + z[i] - z[i - 1];\n ans = int((ans + cnt % MOD * v[i - 1]) % MOD);\n }\n printf(\"%d\\\\n\", (ans + (d == 0)) % MOD);\n}\n\nint main() {\n _w = scanf(\"%d%d%d%d\", &a, &b, &c, &d);\n solve();\n return 0;\n}\n","fail":"#include <algorithm>\n#include <cassert>\n#include <cstdio>\n#include <cstring>\n\nusing namespace std;\ntypedef long long ll;\nconst int MOD = 1e9 + 7;\nconst int MAXN = 1000010;\nint _w;\n\nint a, b, c, d;\n\nvoid bmax(int &a, int b) { a = b > a ? b : a; }\nvoid bmin(int &a, int b) { a = b < a ? b : a; }\nint calc(int x1, int x2, int y1, int y2, int z1, int z2) {\n if (x1 > a - 1 || y1 > b - 1 || z1 > c - 1 || x2 < 0 || y2 < 0 || z2 < 0)\n return 0;\n bmax(x1, 0), bmin(x1, a - 1), bmax(x2, 0), bmin(x2, a - 1);\n bmax(y1, 0), bmin(y1, b - 1), bmax(y2, 0), bmin(y2, b - 1);\n bmax(z1, 0), bmin(z1, c - 1), bmax(z2, 0), bmin(z2, c - 1);\n int x = x2 - x1 + 1, y = y2 - y1 + 1, z = z2 - z1 + 1;\n return int((ll)x * y % MOD * z % MOD);\n}\nint calc2(int x, int y, int z, int xx, int yy, int zz) {\n if (xx != x) {\n return calc(x + d, x + d, y - d, y + d, z - d, z + d);\n } else if (yy != y) {\n return calc(x - d, x + d, y + d, y + d, z - d, z + d);\n } else if (zz != z) {\n return calc(x - d, x + d, y - d, y + d, z + d, z + d);\n }\n assert(0);\n}\n\nvoid nextblock(int x, int y, int z, int &xx, int &yy, int &zz) {\n xx = x + 1;\n yy = int((ll)xx * b \/ a);\n zz = int((ll)xx * c \/ a);\n if (yy == y && zz == z)\n return;\n yy = y + 1;\n xx = int((ll)yy * a \/ b);\n zz = int((ll)yy * c \/ b);\n if (xx == x && zz == z)\n return;\n zz = z + 1;\n xx = int((ll)zz * a \/ c);\n yy = int((ll)zz * b \/ c);\n if (xx == x && yy == y)\n return;\n printf(\"nextblock(%d, %d, %d)\\\\n\", x, y, z);\n assert(0);\n}\n\nbool test(int x, int y, int z, int xx, int yy, int zz) {\n if (xx < x || yy < y || zz < z)\n return false;\n if ((x < d && xx != x) || (y < d && yy != y) || (z < d && zz != z) ||\n (xx >= a - 1 - d && xx != x) || (yy >= b - 1 - d && yy != y) ||\n (zz >= c - 1 - d && zz != z))\n return false;\n else\n return true;\n}\n\nvoid jumpx(int x, int y, int z, int &xx, int &yy, int &zz) {\n int low = x, high = a - 1;\n while (low < high) {\n int mid = (low + high + 1) >> 1;\n int tx = mid;\n int ty = int((ll)tx * b \/ a);\n int tz = int((ll)tx * c \/ a);\n if (test(x, y, z, tx, ty, tz))\n low = mid;\n else\n high = mid - 1;\n }\n int tx = low;\n int ty = int((ll)tx * b \/ a);\n int tz = int((ll)tx * c \/ a);\n bmax(xx, tx), bmax(yy, ty), bmax(zz, tz);\n}\n\nvoid jumpy(int x, int y, int z, int &xx, int &yy, int &zz) {\n int low = y, high = b - 1;\n while (low < high) {\n int mid = (low + high + 1) >> 1;\n int ty = mid;\n int tx = int((ll)ty * a \/ b);\n int tz = int((ll)ty * c \/ b);\n if (test(x, y, z, tx, ty, tz))\n low = mid;\n else\n high = mid - 1;\n }\n int ty = low;\n int tx = int((ll)ty * a \/ b);\n int tz = int((ll)ty * c \/ b);\n bmax(xx, tx), bmax(yy, ty), bmax(zz, tz);\n}\n\nvoid jumpz(int x, int y, int z, int &xx, int &yy, int &zz) {\n int low = z, high = c - 1;\n while (low < high) {\n int mid = (low + high + 1) >> 1;\n int tz = mid;\n int ty = int((ll)tz * b \/ c);\n int tx = int((ll)tz * a \/ c);\n if (test(x, y, z, tx, ty, tz))\n low = mid;\n else\n high = mid - 1;\n }\n int tz = low;\n int ty = int((ll)tz * b \/ c);\n int tx = int((ll)tz * a \/ c);\n bmax(xx, tx), bmax(yy, ty), bmax(zz, tz);\n}\n\nvoid jumpnext(int x, int y, int z, int &xx, int &yy, int &zz) {\n xx = x, yy = y, zz = z;\n jumpx(x, y, z, xx, yy, zz);\n jumpy(x, y, z, xx, yy, zz);\n jumpz(x, y, z, xx, yy, zz);\n}\n\nint x[MAXN], y[MAXN], z[MAXN], v[MAXN], v2[MAXN], sz;\nbool checkend() {\n return x[sz - 1] == a - 1 && y[sz - 1] == b - 1 && z[sz - 1] == c - 1;\n}\nvoid solve() {\n x[sz] = y[sz] = z[sz] = 0;\n v[sz++] = calc(-d, d, -d, d, -d, d);\n while (!checkend()) {\n int xx, yy, zz;\n nextblock(x[sz - 1], y[sz - 1], z[sz - 1], xx, yy, zz);\n v2[sz - 1] = calc2(xx, yy, zz, x[sz - 1], y[sz - 1], z[sz - 1]);\n jumpnext(x[sz - 1], y[sz - 1], z[sz - 1], x[sz], y[sz], z[sz]);\n xx = x[sz], yy = y[sz], zz = z[sz];\n \/\/ printf( \"x = %d, y = %d, z = %d, (pre)\\\\n\", xx, yy, zz );\n nextblock(xx, yy, zz, x[sz], y[sz], z[sz]);\n v[sz] = calc2(x[sz], y[sz], z[sz], xx, yy, zz);\n \/\/ printf( \"x = %d, y = %d, z = %d, sz = %d\\\\n\", x[sz], y[sz], z[sz], sz );\n ++sz;\n }\n int ans = 0;\n for (int i = 1; i < sz; ++i) {\n ll cnt = (ll)x[i] - x[i - 1] + y[i] - y[i - 1] + z[i] - z[i - 1];\n ans = int((ans + v[i - 1] + (cnt - 1) % MOD * v2[i - 1]) % MOD);\n }\n printf(\"%d\\\\n\", (ans + (d == 0)) % MOD);\n}\n\nint main() {\n _w = scanf(\"%d%d%d%d\", &a, &b, &c, &d);\n solve();\n return 0;\n}\n","change":"replace","i1":24,"i2":142,"j1":24,"j2":150,"error":"0","stderr":null,"stdout":54.0}
{"problem_id":"p03755","language":"C++","original_status":"Memory Limit Exceeded","pass":"#include <bits\/stdc++.h>\ntypedef long long ll;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, a) FOR(i, 0, a)\n\nusing namespace std;\nconst int MAX_X = 2500, MAX_K = 2500;\nint K, X, S[MAX_K], N;\nconst ll MOD = 1e9 + 7;\nll dp[MAX_X * 2][10000], psm[MAX_X * 2][10001];\nint main() {\n scanf(\"%d %d %d\", &N, &K, &X);\n REP(i, K) { scanf(\"%d\", S + i); }\n dp[0][0] = 1;\n REP(i, 10000 - 1) dp[0][i + 1] = 0;\n psm[0][0] = 0;\n REP(i, 10000) { psm[0][i + 1] = 1; }\n FOR(i, 1, 2 * X) {\n REP(j, 10000) {\n int ub;\n if (i % 2) {\n ub = max(j - i - 1, 0);\n } else {\n ub = max(j - i, 0);\n }\n dp[i][j] = ((psm[i - 1][j] - psm[i - 1][ub] + MOD) + (j <= i)) % MOD;\n psm[i][j + 1] = (psm[i][j] + dp[i][j]) % MOD;\n }\n }\n ll ans = 1;\n REP(i, K - 1) {\n if (X * 2 - 1 - i * 2 >= 0) {\n ans *= dp[X * 2 - 1 - i * 2][S[i + 1] - S[i] - 1];\n } else {\n ans = 0;\n }\n ans %= MOD;\n }\n printf(\"%lld\\\\n\", ans);\n}","fail":"#include <bits\/stdc++.h>\ntypedef long long ll;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, a) FOR(i, 0, a)\n\nusing namespace std;\nconst int MAX_X = 2500, MAX_K = 2500;\nint K, X, S[MAX_K], N;\nconst ll MOD = 1e9 + 7;\nint dp[MAX_X * 2][10000], psm[MAX_X * 2][10001];\nint main() {\n scanf(\"%d %d %d\", &N, &K, &X);\n REP(i, K) { scanf(\"%d\", S + i); }\n dp[0][0] = 1;\n REP(i, 10000 - 1) dp[0][i + 1] = 0;\n psm[0][0] = 0;\n REP(i, 10000) { psm[0][i + 1] = 1; }\n FOR(i, 1, 2 * X) {\n REP(j, 10000) {\n int ub;\n if (i % 2) {\n ub = max(j - i - 1, 0);\n } else {\n ub = max(j - i, 0);\n }\n dp[i][j] =\n (int)((((ll)psm[i - 1][j] - psm[i - 1][ub] + MOD) + (j <= i)) % MOD);\n psm[i][j + 1] = (int)(((ll)psm[i][j] + dp[i][j]) % MOD);\n }\n }\n ll ans = 1;\n REP(i, K - 1) {\n if (X * 2 - 1 - i * 2 >= 0) {\n ans *= dp[X * 2 - 1 - i * 2][S[i + 1] - S[i] - 1];\n } else {\n ans = 0;\n }\n ans %= MOD;\n }\n printf(\"%lld\\\\n\", ans);\n}","change":"replace","i1":9,"i2":27,"j1":9,"j2":28,"error":"MLE","stderr":null,"stdout":null}
{"problem_id":"p03755","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ext\/pb_ds\/priority_queue.hpp>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\nusing namespace std;\n\nconst int N = 303;\ntypedef long long LL;\nconst LL mo = 1000000007;\n\nint n, k, x, Ans = 1, s[N], f[N][N], q[N];\n\ninline int Mul(const LL &x, const LL &y) { return x * y % mo; }\ninline int min(const int &x, const int &y) { return x < y ? x : y; }\ninline int max(const int &x, const int &y) { return x > y ? x : y; }\ninline int Add(const int &x, const int &y) {\n return x + y < mo ? x + y : x + y - mo;\n}\ninline int Dec(const int &x, const int &y) {\n return x - y >= 0 ? x - y : x - y + mo;\n}\n\nint ksm(int x, int y) {\n int ret = 1;\n for (; y; y >>= 1) {\n if (y & 1)\n ret = Mul(ret, x);\n x = Mul(x, x);\n }\n return ret;\n}\n\ninline int Solve(int tot, int L, int R, int sum) {\n f[1][1] = 1;\n for (int j = 2; j <= sum; j++) {\n int head, tail, cnt;\n cnt = f[j - 1][j - 1];\n q[head = tail = 1] = j - 1;\n for (int i = j, TT = tot - sum + j; i <= TT; i++) {\n while (head <= tail) {\n int l = q[head], r = i;\n int nl = max(L - j + 2, R - sum + j - 1);\n if (nl < 0) {\n cnt = Dec(cnt, f[q[head]][j - 1]);\n ++head;\n continue;\n }\n int nr = max(L - j + 1, R - sum + j);\n if (nr < 0) {\n cnt = Dec(cnt, f[q[head]][j - 1]);\n ++head;\n continue;\n }\n if (nl + nr < r - l - 1) {\n cnt = Dec(cnt, f[q[head]][j - 1]);\n ++head;\n continue;\n }\n break;\n }\n f[i][j] = cnt;\n if (f[i][j - 1])\n q[++tail] = i, cnt = Add(cnt, f[i][j - 1]);\n }\n }\n return f[tot][sum];\n}\n\ninline int Calc(int tot, int L, int R) {\n if (L < 0 || R < 0)\n return 0;\n if (L + R >= tot - 2)\n return ksm(2, tot - 2);\n int ret = 0;\n for (int i = 1; i <= tot - 2; i++)\n ret = Add(ret, Solve(tot, L, R, i + 2));\n return ret;\n}\n\nint main() {\n#ifdef DMC\n freopen(\"DMC.txt\", \"r\", stdin);\n#endif\n\n cin >> n >> k >> x;\n for (int i = 0; i < k; i++)\n scanf(\"%d\", &s[i]);\n for (int i = 1; i < k; i++) {\n if (s[i] - s[i - 1] == 1)\n continue;\n int L = max(x - i + 1, k - i);\n int R = max(x - i, k - 1 - i);\n Ans = Mul(Ans, Calc(s[i] - s[i - 1] + 1, L, R));\n if (!Ans) {\n cout << 0 << endl;\n return 0;\n }\n }\n cout << Ans << endl;\n return 0;\n}","fail":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ext\/pb_ds\/priority_queue.hpp>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <vector>\nusing namespace std;\n\nconst int maxn = 5005;\nconst int maxm = 1E4 + 10;\ntypedef long long LL;\nconst LL mo = 1000000007;\n\nint n, k, x, tail, Ans = 1, s[maxn], f[maxn][maxm];\n\ninline int Mul(const LL &x, const LL &y) { return x * y % mo; }\ninline int Add(const int &x, const int &y) {\n return x + y < mo ? x + y : x + y - mo;\n}\ninline int Dec(const int &x, const int &y) {\n return x - y >= 0 ? x - y : x - y + mo;\n}\n\nint main() {\n#ifdef DMC\n freopen(\"DMC.txt\", \"r\", stdin);\n#endif\n\n f[0][1] = 1;\n cin >> n >> k >> x;\n for (int i = 0; i < k; i++)\n scanf(\"%d\", &s[i]);\n for (int i = 1; i < k; i++)\n tail = max(tail, s[i] - s[i - 1]);\n for (int i = 1; i <= 2 * x; i++) {\n int sum = 0, Max = i + (i & 1);\n for (int j = 1; j <= tail; j++) {\n sum = Add(sum, f[i - 1][j - 1]);\n if (j - Max - 1 >= 0)\n sum = Dec(sum, f[i - 1][j - Max - 1]);\n f[i][j] = sum;\n if (i + 1 >= j)\n f[i][j] = Add(f[i][j], 1);\n }\n }\n for (int i = 1; i < k; i++)\n Ans = Mul(Ans, f[2 * x - 2 * i + 1][s[i] - s[i - 1]]);\n cout << Ans << endl;\n return 0;\n}","change":"replace","i1":14,"i2":106,"j1":14,"j2":53,"error":"0","stderr":null,"stdout":55.0}
{"problem_id":"p03755","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <array>\n#include <chrono>\n#include <cmath>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <string>\n#include <tuple>\n#include <unordered_set>\n#include <vector>\nusing namespace std;\ntypedef long long int llint;\ntypedef long double lldo;\n#define mp make_pair\n#define mt make_tuple\n#define pub push_back\n#define puf push_front\n#define pob pop_back\n#define pof pop_front\n#define fir first\n#define sec second\n#define res resize\n#define ins insert\n#define era erase\n\/\/ cout<<setprecision(20)\nconst llint mod = 1000000007;\nconst llint big = 2.19e15 + 1;\nconst long double pai = 3.141592653589793238462643383279502884197;\nconst long double eps = 1e-15;\ntemplate <class T, class U> void mineq(T &a, U b) {\n if (a > b) {\n a = b;\n }\n}\ntemplate <class T, class U> void maxeq(T &a, U b) {\n if (a < b) {\n a = b;\n }\n}\nllint gcd(llint a, llint b) {\n if (a % b == 0) {\n return b;\n } else\n return gcd(b, a % b);\n}\nllint lcm(llint a, llint b) { return a \/ gcd(a, b) * b; }\ntemplate <class T> void SO(T &ve) { sort(ve.begin(), ve.end()); }\ntemplate <class T> void REV(T &ve) { reverse(ve.begin(), ve.end()); }\nint LBI(vector<lldo> &ar, lldo in) {\n return lower_bound(ar.begin(), ar.end(), in) - ar.begin();\n}\nint UBI(vector<lldo> &ar, lldo in) {\n return upper_bound(ar.begin(), ar.end(), in) - ar.begin();\n}\nint main(void) {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, K, X, i, j;\n cin >> n >> K >> X;\n static llint dp[2501][2501] = {0};\n static llint ep[2501][2501] = {0};\n \/\/ \u5de6\u5074\u306e\u6b8b\u308a\u6642\u9593,\u99c5\u9593,\u306e\u7d2f\u7a4dWA,dp\u306a\u3089\u53f3=\u5de6-1,ep\u306a\u3089\u53f3=\u5de6\n \/\/ \u3053\u308c\u3092\u524d\u8a08\u7b97\n for (j = 2; j <= n; j++) {\n ep[0][j] = 1;\n }\n for (i = 1; i <= X; i++) { \/\/ dp\n dp[i][1] = 1;\n ep[i][1] = 1;\n for (j = 2; j <= n + 1; j++) {\n dp[i][j] = (mod + dp[i][j - 1] + ep[i - 1][j - 1] -\n ep[i - 1][max(0, j - i - i - 1)]) %\n mod;\n } \/\/ \u99c5\u9593\n for (j = 2; j <= n + 1; j++) {\n ep[i][j] =\n (mod + ep[i][j - 1] + dp[i][j - 1] - dp[i][max(0, j - i - i - 1)]) %\n mod;\n } \/\/ \u99c5\u9593\n \/\/ for(j=1;j<=n+1;j++){cerr<<dp[i][j]<<\" \";}\n \/\/ cerr<<endl;\n \/\/ for(j=1;j<=n+1;j++){cerr<<ep[i][j]<<\" \";}\n \/\/ cerr<<endl;\n }\n llint ans = 1, mae;\n cin >> mae;\n for (i = 0; i < K - 1; i++) {\n int s;\n cin >> s;\n ans *= (mod + ep[X - i][1 + s - mae] - ep[X - i][s - mae]);\n ans %= mod;\n mae = s;\n }\n cout << ans << endl;\n return 0;\n}","fail":"#include <algorithm>\n#include <array>\n#include <chrono>\n#include <cmath>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <string>\n#include <tuple>\n#include <unordered_set>\n#include <vector>\nusing namespace std;\ntypedef long long int llint;\ntypedef long double lldo;\n#define mp make_pair\n#define mt make_tuple\n#define pub push_back\n#define puf push_front\n#define pob pop_back\n#define pof pop_front\n#define fir first\n#define sec second\n#define res resize\n#define ins insert\n#define era erase\n\/\/ cout<<setprecision(20)\nconst llint mod = 1000000007;\nconst llint big = 2.19e15 + 1;\nconst long double pai = 3.141592653589793238462643383279502884197;\nconst long double eps = 1e-15;\ntemplate <class T, class U> void mineq(T &a, U b) {\n if (a > b) {\n a = b;\n }\n}\ntemplate <class T, class U> void maxeq(T &a, U b) {\n if (a < b) {\n a = b;\n }\n}\nllint gcd(llint a, llint b) {\n if (a % b == 0) {\n return b;\n } else\n return gcd(b, a % b);\n}\nllint lcm(llint a, llint b) { return a \/ gcd(a, b) * b; }\ntemplate <class T> void SO(T &ve) { sort(ve.begin(), ve.end()); }\ntemplate <class T> void REV(T &ve) { reverse(ve.begin(), ve.end()); }\nint LBI(vector<lldo> &ar, lldo in) {\n return lower_bound(ar.begin(), ar.end(), in) - ar.begin();\n}\nint UBI(vector<lldo> &ar, lldo in) {\n return upper_bound(ar.begin(), ar.end(), in) - ar.begin();\n}\nint main(void) {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n, K, X, i, j;\n cin >> n >> K >> X;\n mineq(n, 10000);\n \/\/ static llint cp[2505][10005]={0};\n static llint dp[2505][10005] = {0};\n static llint ep[2505][10005] = {0};\n \/\/ \u5de6\u5074\u306e\u6b8b\u308a\u6642\u9593,\u99c5\u9593,\u306e\u7d2f\u7a4dWA,dp\u306a\u3089\u53f3=\u5de6-1,ep\u306a\u3089\u53f3=\u5de6 cp\u306a\u3089\u7247\u65b9\u306e\u307f\n \/\/ \u3053\u308c\u3092\u524d\u8a08\u7b97\n ep[0][1] = 1;\n for (j = 2; j <= n; j++) {\n ep[0][j] = 2;\n }\n for (i = 1; i <= X; i++) { \/\/ dp\n dp[i][1] = 1;\n ep[i][1] = 1;\n for (j = 1; j <= n; j++) {\n dp[i][j + 1] =\n (mod + dp[i][j] + ep[i - 1][j] - ep[i - 1][max(0, j - i - i)]) % mod;\n } \/\/ \u99c5\u9593\n for (j = 1; j <= n; j++) {\n ep[i][j + 1] =\n (mod + ep[i][j] + dp[i][j] - dp[i][max(0, j - i - i)]) % mod;\n if (j == i + i + 1) {\n ep[i][j + 1]++;\n }\n } \/\/ \u99c5\u9593\n \/*for(j=1;j<=n+1;j++){cerr<<dp[i][j]<<\" \";}\n cerr<<endl;\n for(j=1;j<=n+1;j++){cerr<<ep[i][j]<<\" \";}\n cerr<<endl;*\/\n }\n llint ans = 1, mae;\n cin >> mae;\n for (i = 0; i < K - 1; i++) {\n int s;\n cin >> s;\n ans *= (mod + dp[X - i][1 + s - mae] - dp[X - i][s - mae]);\n ans %= mod;\n mae = s;\n }\n cout << ans << endl;\n return 0;\n}\n","change":"replace","i1":66,"i2":97,"j1":66,"j2":101,"error":"127","stderr":"\/tmp\/af6dc7a1-01af-46aa-aa23-41547c9455b1.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object\n","stdout":null}
{"problem_id":"p03756","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define ll long long\n#define inf 1000000000000000000ll\n#define N 420005\n#define M 2000005\nusing namespace std;\n\nconst int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};\nint H, W, n, cnt, C, tot, fst[N], pnt[M], len[M], nxt[M];\nint hsh[2010527], nxt_h[M], mn[M], pos[N];\nll d[N];\nbool bo[N];\nstruct node {\n int x, y, z, id;\n} p[N];\nint getdct(char c) {\n if (c == 'N')\n return 0;\n else if (c == 'S')\n return 1;\n else if (c == 'W')\n return 2;\n else\n return 3;\n}\nint calc(int x, int y, int z) {\n \/\/ if (x<=0 || x>H || y<=0 || y>W) return 0;\n int t = (x * 100000ll + y) % 2010527, i;\n for (i = hsh[t]; i; i = nxt_h[i])\n if (p[i].x == x && p[i].y == y && p[i].z == z)\n return i;\n \/\/ cout<<x<<' '<<y<<' '<<z<<' '<<cnt+1<<endl;\n cnt++;\n p[cnt] = (node){x, y, z, cnt};\n nxt_h[cnt] = hsh[t];\n hsh[t] = cnt;\n return cnt;\n}\nvoid add(int x, int y, ll z) {\n if (!x || !y)\n return;\n \/\/\tcout<<\"\t\t\t\t\"<<x<<' '<<y<<' '<<z<<endl;\n pnt[++tot] = y;\n len[tot] = z;\n nxt[tot] = fst[x];\n fst[x] = tot;\n}\nvoid build(int k, int l, int r) {\n mn[k] = l;\n if (l == r) {\n pos[l] = k;\n return;\n }\n int mid = l + r >> 1;\n build(k << 1, l, mid);\n build(k << 1 | 1, mid + 1, r);\n}\nvoid mdy(int x) {\n int i;\n for (i = pos[x] >> 1; i; i >>= 1)\n mn[i] = (d[mn[i << 1]] < d[mn[i << 1 | 1]]) ? mn[i << 1] : mn[i << 1 | 1];\n}\nbool cmpx(node u, node v) {\n return u.x < v.x || u.x == v.x && u.y < v.y ||\n u.x == v.x && u.y == v.y && u.z < v.z;\n}\nbool cmpy(node u, node v) {\n return u.y < v.y || u.y == v.y && u.x < v.x ||\n u.x == v.x && u.y == v.y && u.z < v.z;\n}\nint main() {\n scanf(\"%d%d%d%d\", &H, &W, &n, &C);\n int x1, x2, y1, y2, i, j, k, l, x, y, cst;\n char c;\n scanf(\"%d%d%d%d\", &x1, &y1, &x2, &y2);\n calc(x1, y1, 0);\n calc(x2, y2, 0);\n for (i = 1; i <= 2; i++)\n add(calc(x2, y2, i), calc(x2, y2, 0), 0);\n for (i = 1; i <= n; i++) {\n scanf(\"%d%d %c%d%d\", &x, &y, &c, &l, &cst);\n \/\/\tcout<<\"(\"<<c<<\")\"<<endl;\n k = getdct(c);\n \/\/\tcout<<k<<endl;\n \/\/\tcout<<x<<' '<<y<<' '<<c<<' '<<l<<' '<<cst<<endl;\n for (j = 1; j <= 2; j++)\n add(calc(x, y, j), calc(x, y, 0), 0);\n for (j = 0; j < 4; j++)\n add(calc(x, y, 0), calc(x + dx[j] * l, y + dy[j] * l, (j > 1) ? 1 : 2),\n (j == k) ? 0 : cst);\n }\n \/\/ cout<<cnt<<endl;\n sort(p + 1, p + cnt + 1, cmpx);\n for (i = 1; i <= cnt; i = j)\n for (j = i, k = 0; p[i].x == p[j].x; j++) {\n \/\/\tcout<<p[j].x<<' '<<p[j].y<<' '<<p[j].z<<endl;\n if (p[j].z == 1) {\n add(p[j].id, p[k].id, (ll)(p[j].y - p[k].y) * C);\n add(p[k].id, p[j].id, (ll)(p[j].y - p[k].y) * C);\n k = j;\n }\n }\n sort(p + 1, p + cnt + 1, cmpy);\n for (i = 1; i <= cnt; i = j)\n for (j = i, k = 0; p[i].y == p[j].y; j++)\n if (p[j].z == 2) {\n add(p[j].id, p[k].id, (ll)(p[j].x - p[k].x) * C);\n add(p[k].id, p[j].id, (ll)(p[j].x - p[k].x) * C);\n k = j;\n }\n for (i = 2; i <= cnt; i++)\n d[i] = inf;\n memset(bo, 1, sizeof(bo));\n build(1, 1, cnt);\n for (i = 1; i <= cnt; i++) {\n x = mn[1];\n if (x == 2)\n break;\n bo[x] = 0;\n for (j = fst[x]; j; j = nxt[j]) {\n y = pnt[j];\n if (bo[y] && d[x] + len[j] < d[y]) {\n \/\/\tcout<<x<<\"->\"<<y<<endl;\n d[y] = d[x] + len[j];\n mdy(y);\n }\n }\n d[x] = inf;\n mdy(x);\n }\n printf(\"%lld\\\\n\", (d[2] < inf) ? d[2] : -1);\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n#define ll long long\n#define inf 1000000000000000000ll\n#define N 1000005\n#define M 4000005\nusing namespace std;\n\nconst int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};\nint H, W, n, cnt, C, tot, fst[N], pnt[M], nxt[M];\nint hsh[2010527], nxt_h[M], mn[M], pos[N];\nll d[N], len[M];\nbool bo[N];\nstruct node {\n int x, y, z, id;\n} p[N];\nint getdct(char c) {\n if (c == 'N')\n return 0;\n else if (c == 'S')\n return 1;\n else if (c == 'W')\n return 2;\n else\n return 3;\n}\nint calc(int x, int y, int z) {\n \/\/ if (x<=0 || x>H || y<=0 || y>W) return 0;\n int t = (x * 100000ll + y) % 2010527, i;\n for (i = hsh[t]; i; i = nxt_h[i])\n if (p[i].x == x && p[i].y == y && p[i].z == z)\n return i;\n \/\/ cout<<x<<' '<<y<<' '<<z<<' '<<cnt+1<<endl;\n cnt++;\n p[cnt] = (node){x, y, z, cnt};\n nxt_h[cnt] = hsh[t];\n hsh[t] = cnt;\n return cnt;\n}\nvoid add(int x, int y, ll z) {\n if (!x || !y)\n return;\n \/\/\tcout<<\"\t\t\t\t\"<<x<<' '<<y<<' '<<z<<endl;\n pnt[++tot] = y;\n len[tot] = z;\n nxt[tot] = fst[x];\n fst[x] = tot;\n}\nvoid build(int k, int l, int r) {\n mn[k] = l;\n if (l == r) {\n pos[l] = k;\n return;\n }\n int mid = l + r >> 1;\n build(k << 1, l, mid);\n build(k << 1 | 1, mid + 1, r);\n}\nvoid mdy(int x) {\n int i;\n for (i = pos[x] >> 1; i; i >>= 1)\n mn[i] = (d[mn[i << 1]] < d[mn[i << 1 | 1]]) ? mn[i << 1] : mn[i << 1 | 1];\n}\nbool cmpx(node u, node v) {\n return u.x < v.x || u.x == v.x && u.y < v.y ||\n u.x == v.x && u.y == v.y && u.z < v.z;\n}\nbool cmpy(node u, node v) {\n return u.y < v.y || u.y == v.y && u.x < v.x ||\n u.x == v.x && u.y == v.y && u.z < v.z;\n}\nint main() {\n scanf(\"%d%d%d%d\", &H, &W, &n, &C);\n int x1, x2, y1, y2, i, j, k, l, x, y, cst;\n char c;\n scanf(\"%d%d%d%d\", &x1, &y1, &x2, &y2);\n calc(x1, y1, 0);\n calc(x2, y2, 0);\n for (i = 1; i <= 2; i++)\n add(calc(x2, y2, i), calc(x2, y2, 0), 0);\n for (i = 1; i <= n; i++) {\n scanf(\"%d%d %c%d%d\", &x, &y, &c, &l, &cst);\n \/\/\tcout<<\"(\"<<c<<\")\"<<endl;\n k = getdct(c);\n \/\/\tcout<<k<<endl;\n \/\/\tcout<<x<<' '<<y<<' '<<c<<' '<<l<<' '<<cst<<endl;\n for (j = 1; j <= 2; j++)\n add(calc(x, y, j), calc(x, y, 0), 0);\n for (j = 0; j < 4; j++)\n add(calc(x, y, 0), calc(x + dx[j] * l, y + dy[j] * l, (j > 1) ? 1 : 2),\n (j == k) ? 0 : cst);\n }\n \/\/ cout<<cnt<<endl;\n sort(p + 1, p + cnt + 1, cmpx);\n for (i = 1; i <= cnt; i = j)\n for (j = i, k = 0; p[i].x == p[j].x; j++) {\n \/\/\tcout<<p[j].x<<' '<<p[j].y<<' '<<p[j].z<<endl;\n if (p[j].z == 1) {\n add(p[j].id, p[k].id, (ll)(p[j].y - p[k].y) * C);\n add(p[k].id, p[j].id, (ll)(p[j].y - p[k].y) * C);\n k = j;\n }\n }\n sort(p + 1, p + cnt + 1, cmpy);\n for (i = 1; i <= cnt; i = j)\n for (j = i, k = 0; p[i].y == p[j].y; j++)\n if (p[j].z == 2) {\n add(p[j].id, p[k].id, (ll)(p[j].x - p[k].x) * C);\n add(p[k].id, p[j].id, (ll)(p[j].x - p[k].x) * C);\n k = j;\n }\n for (i = 2; i <= cnt; i++)\n d[i] = inf;\n memset(bo, 1, sizeof(bo));\n build(1, 1, cnt);\n for (i = 1; i <= cnt; i++) {\n x = mn[1];\n if (x == 2)\n break;\n bo[x] = 0;\n for (j = fst[x]; j; j = nxt[j]) {\n y = pnt[j];\n if (bo[y] && d[x] + len[j] < d[y]) {\n \/\/\tcout<<x<<\"->\"<<y<<endl;\n d[y] = d[x] + len[j];\n mdy(y);\n }\n }\n d[x] = inf;\n mdy(x);\n }\n printf(\"%lld\\\\n\", (d[2] < inf) ? d[2] : -1);\n return 0;\n}\n","change":"replace","i1":3,"i2":11,"j1":3,"j2":11,"error":0,"stderr":null,"stdout":4}
{"problem_id":"p03756","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define PB push_back\n#define MP make_pair\n#define SZ(v) ((int)(v).size())\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)\n#define REPE(i, n) FORE(i, 0, n)\n#define FORSZ(i, a, v) FOR(i, a, SZ(v))\n#define REPSZ(i, v) REP(i, SZ(v))\ntypedef long long ll;\ntypedef unsigned long long ull;\nll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }\n\nconst int MAXN = 70000 + 1;\nconst int DX[] = {-1, 0, +1, 0}, DY[] = {0, +1, 0, -1};\nchar DC[] = {'N', 'E', 'S', 'W'};\ntypedef struct P {\n int u, v, idx, t;\n} P;\nbool operator<(const P &a, const P &b) {\n if (a.t != b.t)\n return a.t < b.t;\n if (a.u != b.u)\n return a.u < b.u;\n if (a.v != b.v)\n return a.v < b.v;\n return a.idx < b.idx;\n}\n\nint h, w, n, dcost;\nint sx, sy, tx, ty;\n\nint ax[MAXN], ay[MAXN], ak[MAXN], ad[MAXN], akcost[MAXN];\nll d[MAXN];\n\nP p[2 * MAXN];\nll mninc[8 * MAXN], mndec[8 * MAXN], mn[8 * MAXN];\nint fst[8 * MAXN], lst[8 * MAXN], mnpos[8 * MAXN];\n\nvoid updinc(int x, ll val) {\n if (val >= mninc[x])\n return;\n mninc[x] = val;\n if (fst[x] != -1) {\n ll cur = mninc[x] + (ll)dcost * p[fst[x]].v;\n if (cur < mn[x])\n mn[x] = cur, mnpos[x] = fst[x];\n }\n}\nvoid upddec(int x, ll val) {\n if (val >= mndec[x])\n return;\n mndec[x] = val;\n if (lst[x] != -1) {\n ll cur = mndec[x] - (ll)dcost * p[lst[x]].v;\n if (cur < mn[x])\n mn[x] = cur, mnpos[x] = lst[x];\n }\n}\nvoid spush(int x) {\n if (mninc[x] != LLONG_MAX)\n updinc(2 * x + 1, mninc[x]), updinc(2 * x + 2, mninc[x]),\n mninc[x] = LLONG_MAX;\n if (mndec[x] != LLONG_MAX)\n upddec(2 * x + 1, mndec[x]), upddec(2 * x + 2, mndec[x]),\n mndec[x] = LLONG_MAX;\n}\nvoid scalc(int x) {\n fst[x] = fst[2 * x + 1] != -1 ? fst[2 * x + 1] : fst[2 * x + 2];\n lst[x] = lst[2 * x + 1] != -1 ? lst[2 * x + 2] : lst[2 * x + 1];\n mn[x] = LLONG_MAX, mnpos[x] = -1;\n if (mninc[x] != LLONG_MAX && fst[x] != -1) {\n ll cur = mninc[x] + (ll)dcost * p[fst[x]].v;\n if (cur < mn[x])\n mn[x] = cur, mnpos[x] = fst[x];\n }\n if (mndec[x] != LLONG_MAX && lst[x] != -1) {\n ll cur = mndec[x] - (ll)dcost * p[lst[x]].v;\n if (cur < mn[x])\n mn[x] = cur, mnpos[x] = lst[x];\n }\n if (mn[2 * x + 1] < mn[x])\n mn[x] = mn[2 * x + 1], mnpos[x] = mnpos[2 * x + 1];\n if (mn[2 * x + 2] < mn[x])\n mn[x] = mn[2 * x + 2], mnpos[x] = mnpos[2 * x + 2];\n}\nvoid sinit(int x, int l, int r) {\n mninc[x] = mndec[x] = LLONG_MAX;\n if (l == r) {\n mn[x] = LLONG_MAX;\n fst[x] = lst[x] = mnpos[x] = l;\n return;\n }\n int m = l + (r - l) \/ 2;\n sinit(2 * x + 1, l, m);\n sinit(2 * x + 2, m + 1, r);\n scalc(x);\n}\nvoid sset(int x, int l, int r, int POS, ll VAL) {\n if (l == r) {\n mn[x] = VAL;\n return;\n }\n int m = l + (r - l) \/ 2;\n spush(x);\n if (POS <= m)\n sset(2 * x + 1, l, m, POS, VAL);\n else\n sset(2 * x + 2, m + 1, r, POS, VAL);\n scalc(x);\n}\nvoid skill(int x, int l, int r, int POS) {\n if (l == r) {\n fst[x] = lst[x] = mnpos[x] = -1;\n mn[x] = LLONG_MAX;\n return;\n }\n int m = l + (r - l) \/ 2;\n spush(x);\n if (POS <= m)\n skill(2 * x + 1, l, m, POS);\n else\n skill(2 * x + 2, m + 1, r, POS);\n scalc(x);\n}\nvoid sinc(int x, int l, int r, int T, int U, int V, ll VAL) {\n if (T < p[l].t || T == p[l].t && (U < p[l].u))\n return;\n if (T > p[r].t || T == p[r].t && (U > p[r].u || U == p[r].u && (V > p[r].v)))\n return;\n \/\/ printf(\"sinc(%d,%d..%d,[%d,%d,%d],%lld) [%d,%d,%d]\n \/\/ [%d,%d,%d]\\\\n\",x,l,r,T,U,V,VAL,p[l].t,p[l].u,p[l].v,p[r].t,p[r].u,p[r].v);\n if (T == p[l].t && T == p[r].t && U == p[l].u && U == p[r].u && V <= p[l].v) {\n updinc(x, VAL);\n } else {\n int m = l + (r - l) \/ 2;\n spush(x);\n sinc(2 * x + 1, l, m, T, U, V, VAL);\n sinc(2 * x + 2, m + 1, r, T, U, V, VAL);\n scalc(x);\n }\n}\nvoid sdec(int x, int l, int r, int T, int U, int V, ll VAL) {\n if (T < p[l].t || T == p[l].t && (U < p[l].u || U == p[l].u && (V < p[l].v)))\n return;\n if (T > p[r].t || T == p[r].t && (U > p[r].u))\n return;\n if (T == p[l].t && T == p[r].t && U == p[l].u && U == p[r].u && V >= p[r].v) {\n upddec(x, VAL);\n } else {\n int m = l + (r - l) \/ 2;\n spush(x);\n sdec(2 * x + 1, l, m, T, U, V, VAL);\n sdec(2 * x + 2, m + 1, r, T, U, V, VAL);\n scalc(x);\n }\n}\n\nvoid run() {\n scanf(\"%d%d%d%d\", &h, &w, &n, &dcost);\n scanf(\"%d%d%d%d\", &sx, &sy, &tx, &ty);\n --sx, --sy, --tx, --ty;\n REP(i, n) {\n char c;\n scanf(\"%d%d %c%d%d\", &ax[i], &ay[i], &c, &ad[i], &akcost[i]);\n --ax[i], --ay[i], ak[i] = -1;\n REP(k, 4) if (DC[k] == c) ak[i] = k;\n assert(ak[i] != -1);\n }\n ax[n] = tx, ay[n] = ty, ak[n] = -1, ad[n] = 0, akcost[n] = 0, ++n;\n\n REP(i, n) p[i].u = ax[i], p[i].v = ay[i], p[i].idx = i, p[i].t = 0;\n REP(i, n)\n p[n + i].u = ay[i],\n p[n + i].v = ax[i], p[n + i].idx = i, p[n + i].t = 1;\n sort(p, p + 2 * n);\n sinit(0, 0, 2 * n - 1);\n REP(i, n) d[i] = LLONG_MAX;\n REP(i, 2 * n)\n if (p[i].t == 0 && p[i].u == sx && p[i].v == sy ||\n p[i].t == 1 && p[i].u == sy && p[i].v == sx) sset(0, 0, 2 * n - 1, i, 0);\n while (mn[0] != LLONG_MAX) {\n int pos = mnpos[0], idx = p[pos].idx;\n ll cost = mn[0];\n \/\/ printf(\"pos=%d (u=%d,v=%d,idx=%d,t=%d) =\n \/\/ %lld\\\\n\",pos,p[pos].u,p[pos].v,p[pos].idx,p[pos].t,cost);\n skill(0, 0, 2 * n - 1, pos);\n if (d[idx] == LLONG_MAX)\n d[idx] = cost;\n else {\n assert(cost >= d[idx]);\n continue;\n }\n if (ak[idx] == -1)\n continue;\n REP(k, 4) {\n ll ncost = cost + (k == ak[idx] ? 0 : akcost[idx]);\n int x = ax[idx] + ad[idx] * DX[k], y = ay[idx] + ad[idx] * DY[k],\n t = DX[k] == 0 ? 0 : 1, u = t == 0 ? x : y, v = t == 0 ? y : x;\n \/\/ printf(\"\\\\t->(%d,%d)=%lld (%d,%d)\\\\n\",x,y,ncost,DX[k],DY[k]);\n sdec(0, 0, 2 * n - 1, t, u, v, ncost + (ll)dcost * v);\n sinc(0, 0, 2 * n - 1, t, u, v, ncost - (ll)dcost * v);\n }\n }\n ll ret = d[n - 1];\n printf(\"%lld\\\\n\", ret == LLONG_MAX ? -1 : ret);\n}\n\nint main() {\n run();\n return 0;\n}\n","fail":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define PB push_back\n#define MP make_pair\n#define SZ(v) ((int)(v).size())\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)\n#define REPE(i, n) FORE(i, 0, n)\n#define FORSZ(i, a, v) FOR(i, a, SZ(v))\n#define REPSZ(i, v) REP(i, SZ(v))\ntypedef long long ll;\ntypedef unsigned long long ull;\nll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }\n\nconst int MAXN = 70000 + 1;\nconst int DX[] = {-1, 0, +1, 0}, DY[] = {0, +1, 0, -1};\nchar DC[] = {'N', 'E', 'S', 'W'};\ntypedef struct P {\n int u, v, idx, t;\n} P;\nbool operator<(const P &a, const P &b) {\n if (a.t != b.t)\n return a.t < b.t;\n if (a.u != b.u)\n return a.u < b.u;\n if (a.v != b.v)\n return a.v < b.v;\n return a.idx < b.idx;\n}\n\nint h, w, n, dcost;\nint sx, sy, tx, ty;\n\nint ax[MAXN], ay[MAXN], ak[MAXN], ad[MAXN], akcost[MAXN];\nll d[MAXN];\n\nP p[2 * MAXN];\nll mninc[8 * MAXN], mndec[8 * MAXN], mn[8 * MAXN];\nint fst[8 * MAXN], lst[8 * MAXN], mnpos[8 * MAXN];\n\nvoid updinc(int x, ll val) {\n if (val >= mninc[x])\n return;\n mninc[x] = val;\n if (fst[x] != -1) {\n ll cur = mninc[x] + (ll)dcost * p[fst[x]].v;\n if (cur < mn[x])\n mn[x] = cur, mnpos[x] = fst[x];\n }\n}\nvoid upddec(int x, ll val) {\n if (val >= mndec[x])\n return;\n mndec[x] = val;\n if (lst[x] != -1) {\n ll cur = mndec[x] - (ll)dcost * p[lst[x]].v;\n if (cur < mn[x])\n mn[x] = cur, mnpos[x] = lst[x];\n }\n}\nvoid spush(int x) {\n if (mninc[x] != LLONG_MAX)\n updinc(2 * x + 1, mninc[x]), updinc(2 * x + 2, mninc[x]),\n mninc[x] = LLONG_MAX;\n if (mndec[x] != LLONG_MAX)\n upddec(2 * x + 1, mndec[x]), upddec(2 * x + 2, mndec[x]),\n mndec[x] = LLONG_MAX;\n}\nvoid scalc(int x) {\n fst[x] = fst[2 * x + 1] != -1 ? fst[2 * x + 1] : fst[2 * x + 2];\n lst[x] = lst[2 * x + 2] != -1 ? lst[2 * x + 2] : lst[2 * x + 1];\n mn[x] = LLONG_MAX, mnpos[x] = -1;\n if (mninc[x] != LLONG_MAX && fst[x] != -1) {\n ll cur = mninc[x] + (ll)dcost * p[fst[x]].v;\n if (cur < mn[x])\n mn[x] = cur, mnpos[x] = fst[x];\n }\n if (mndec[x] != LLONG_MAX && lst[x] != -1) {\n ll cur = mndec[x] - (ll)dcost * p[lst[x]].v;\n if (cur < mn[x])\n mn[x] = cur, mnpos[x] = lst[x];\n }\n if (mn[2 * x + 1] < mn[x])\n mn[x] = mn[2 * x + 1], mnpos[x] = mnpos[2 * x + 1];\n if (mn[2 * x + 2] < mn[x])\n mn[x] = mn[2 * x + 2], mnpos[x] = mnpos[2 * x + 2];\n}\nvoid sinit(int x, int l, int r) {\n mninc[x] = mndec[x] = LLONG_MAX;\n if (l == r) {\n mn[x] = LLONG_MAX;\n fst[x] = lst[x] = mnpos[x] = l;\n return;\n }\n int m = l + (r - l) \/ 2;\n sinit(2 * x + 1, l, m);\n sinit(2 * x + 2, m + 1, r);\n scalc(x);\n}\nvoid sset(int x, int l, int r, int POS, ll VAL) {\n if (l == r) {\n mn[x] = VAL;\n return;\n }\n int m = l + (r - l) \/ 2;\n spush(x);\n if (POS <= m)\n sset(2 * x + 1, l, m, POS, VAL);\n else\n sset(2 * x + 2, m + 1, r, POS, VAL);\n scalc(x);\n}\nvoid skill(int x, int l, int r, int POS) {\n if (l == r) {\n fst[x] = lst[x] = mnpos[x] = -1;\n mn[x] = LLONG_MAX;\n return;\n }\n int m = l + (r - l) \/ 2;\n spush(x);\n if (POS <= m)\n skill(2 * x + 1, l, m, POS);\n else\n skill(2 * x + 2, m + 1, r, POS);\n scalc(x);\n}\nvoid sinc(int x, int l, int r, int T, int U, int V, ll VAL) {\n if (T < p[l].t || T == p[l].t && (U < p[l].u))\n return;\n if (T > p[r].t || T == p[r].t && (U > p[r].u || U == p[r].u && (V > p[r].v)))\n return;\n \/\/ printf(\"sinc(%d,%d..%d,[%d,%d,%d],%lld) [%d,%d,%d]\n \/\/ [%d,%d,%d]\\\\n\",x,l,r,T,U,V,VAL,p[l].t,p[l].u,p[l].v,p[r].t,p[r].u,p[r].v);\n if (T == p[l].t && T == p[r].t && U == p[l].u && U == p[r].u && V <= p[l].v) {\n updinc(x, VAL);\n } else {\n int m = l + (r - l) \/ 2;\n spush(x);\n sinc(2 * x + 1, l, m, T, U, V, VAL);\n sinc(2 * x + 2, m + 1, r, T, U, V, VAL);\n scalc(x);\n }\n}\nvoid sdec(int x, int l, int r, int T, int U, int V, ll VAL) {\n if (T < p[l].t || T == p[l].t && (U < p[l].u || U == p[l].u && (V < p[l].v)))\n return;\n if (T > p[r].t || T == p[r].t && (U > p[r].u))\n return;\n if (T == p[l].t && T == p[r].t && U == p[l].u && U == p[r].u && V >= p[r].v) {\n upddec(x, VAL);\n } else {\n int m = l + (r - l) \/ 2;\n spush(x);\n sdec(2 * x + 1, l, m, T, U, V, VAL);\n sdec(2 * x + 2, m + 1, r, T, U, V, VAL);\n scalc(x);\n }\n}\n\nll solve() {\n ax[n] = tx, ay[n] = ty, ak[n] = -1, ad[n] = 0, akcost[n] = 0, ++n;\n\n REP(i, n) p[i].u = ax[i], p[i].v = ay[i], p[i].idx = i, p[i].t = 0;\n REP(i, n)\n p[n + i].u = ay[i],\n p[n + i].v = ax[i], p[n + i].idx = i, p[n + i].t = 1;\n sort(p, p + 2 * n);\n sinit(0, 0, 2 * n - 1);\n REP(i, n) d[i] = LLONG_MAX;\n REP(i, 2 * n)\n if (p[i].t == 0 && p[i].u == sx && p[i].v == sy ||\n p[i].t == 1 && p[i].u == sy && p[i].v == sx) sset(0, 0, 2 * n - 1, i, 0);\n while (mn[0] != LLONG_MAX) {\n int pos = mnpos[0], idx = p[pos].idx;\n ll cost = mn[0];\n \/\/ printf(\"pos=%d (u=%d,v=%d,idx=%d,t=%d) =\n \/\/ %lld\\\\n\",pos,p[pos].u,p[pos].v,p[pos].idx,p[pos].t,cost);\n skill(0, 0, 2 * n - 1, pos);\n if (d[idx] == LLONG_MAX)\n d[idx] = cost;\n else {\n assert(cost >= d[idx]);\n continue;\n }\n if (ak[idx] == -1)\n continue;\n REP(k, 4) {\n ll ncost = cost + (k == ak[idx] ? 0 : akcost[idx]);\n int x = ax[idx] + ad[idx] * DX[k], y = ay[idx] + ad[idx] * DY[k],\n t = DX[k] == 0 ? 0 : 1, u = t == 0 ? x : y, v = t == 0 ? y : x;\n \/\/ printf(\"\\\\t->(%d,%d)=%lld (%d,%d)\\\\n\",x,y,ncost,DX[k],DY[k]);\n sdec(0, 0, 2 * n - 1, t, u, v, ncost + (ll)dcost * v);\n sinc(0, 0, 2 * n - 1, t, u, v, ncost - (ll)dcost * v);\n }\n }\n ll ret = d[n - 1];\n return ret == LLONG_MAX ? -1 : ret;\n}\n\nvoid run() {\n scanf(\"%d%d%d%d\", &h, &w, &n, &dcost);\n scanf(\"%d%d%d%d\", &sx, &sy, &tx, &ty);\n --sx, --sy, --tx, --ty;\n REP(i, n) {\n char c;\n scanf(\"%d%d %c%d%d\", &ax[i], &ay[i], &c, &ad[i], &akcost[i]);\n --ax[i], --ay[i], ak[i] = -1;\n REP(k, 4) if (DC[k] == c) ak[i] = k;\n assert(ak[i] != -1);\n }\n ll ret = solve();\n printf(\"%lld\\\\n\", ret);\n}\n\nvoid stress() {\n while (true) {\n n = MAXN - 1;\n REP(i, n)\n ax[i] = rand() % 1000,\n ay[i] = rand() % 1000, ak[i] = rand() % 4, ad[i] = rand() % 1000,\n akcost[i] = rand() % 1000;\n dcost = rand() % 1000;\n {\n int s = rand() % n;\n sx = ax[s], sy = ay[s];\n }\n tx = rand() % 1000, ty = rand() % 1000;\n \/\/ printf(\"? ? %d %d\\\\n\",n,dcost); printf(\"%d %d %d\n \/\/ %d\\\\n\",sx+1,sy+1,tx+1,ty+1); REP(i,n) printf(\"%d %d %c %d\n \/\/ %d\\\\n\",ax[i]+1,ay[i]+1,DC[ak[i]],ad[i],akcost[i]);\n solve();\n puts(\".\");\n }\n}\n\nint main() {\n \/\/ stress();\n run();\n return 0;\n}\n","change":"replace","i1":88,"i2":228,"j1":88,"j2":255,"error":0,"stderr":null,"stdout":4}
{"problem_id":"p03757","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define PB push_back\n#define MP make_pair\n#define SZ(v) ((int)(v).size())\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)\n#define REPE(i, n) FORE(i, 0, n)\n#define FORSZ(i, a, v) FOR(i, a, SZ(v))\n#define REPSZ(i, v) REP(i, SZ(v))\ntypedef long long ll;\ntypedef unsigned long long ull;\nll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }\n\nconst int MAXN = 400000;\nconst int MAXQ = 50000;\nconst int MAXEMP = MAXN + MAXQ;\nconst int SZ = 400;\nconst int MAXB = (MAXEMP + SZ - 1) \/ SZ;\n\nint n, nq, nemp;\nint par[MAXEMP], oval[MAXEMP];\nbool alive[MAXEMP];\nint qt[MAXQ], qemp[MAXQ], qd[MAXQ], qby[MAXQ];\n\nint chead[MAXEMP], cnxt[MAXEMP];\nint d[MAXEMP], lid[MAXEMP], rid[MAXEMP], emp[MAXEMP], nid;\nvoid dfs(int at) {\n d[at] = par[at] == -1 ? 0 : d[par[at]] + 1;\n emp[nid] = at, lid[at] = nid++;\n for (int to = chead[at]; to != -1; to = cnxt[to])\n dfs(to);\n rid[at] = nid - 1;\n}\n\nint pos[MAXEMP];\nint sd[MAXEMP];\n\ntypedef struct S {\n ll sval[4 * SZ];\n int slazy[4 * SZ];\n int scnt[4 * SZ];\n void clear() {\n memset(sval, 0, sizeof(sval));\n memset(slazy, 0, sizeof(slazy));\n memset(scnt, 0, sizeof(scnt));\n }\n void spush(int x) {\n if (slazy[x] == 0)\n return;\n sval[2 * x + 1] += slazy[x] * scnt[2 * x + 1];\n slazy[2 * x + 1] += slazy[x];\n sval[2 * x + 2] += slazy[x] * scnt[2 * x + 2];\n slazy[2 * x + 2] += slazy[x];\n slazy[x] = 0;\n }\n void scalc(int x) {\n scnt[x] = scnt[2 * x + 1] + scnt[2 * x + 2];\n sval[x] = sval[2 * x + 1] + sval[2 * x + 2];\n }\n void sborn(int x, int l, int r, int IDX, int VAL) {\n if (l == r) {\n sval[x] = VAL, slazy[x] = 0, scnt[x] = 1;\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n if (IDX <= m)\n sborn(2 * x + 1, l, m, IDX, VAL);\n else\n sborn(2 * x + 2, m + 1, r, IDX, VAL);\n scalc(x);\n }\n \/\/ printf(\"sborn(%d,%d,%d,%d,%d) -> %d\n \/\/ %lld\\\\n\",x,l,r,IDX,VAL,scnt[x],sval[x]);\n }\n void smod(int x, int l, int r, int L, int R, int BY) {\n if (L <= l && r <= R) {\n sval[x] += (ll)scnt[x] * BY;\n slazy[x] += BY;\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n if (L <= m)\n smod(2 * x + 1, l, m, L, R, BY);\n if (m + 1 <= R)\n smod(2 * x + 2, m + 1, r, L, R, BY);\n scalc(x);\n }\n \/\/ printf(\"smod(%d,%d,%d,%d,%d,%d) -> %d %lld\n \/\/ %d\\\\n\",x,l,r,L,R,BY,scnt[x],sval[x],slazy[x]);\n }\n ll sget(int x, int l, int r, int L, int R) {\n if (L <= l && r <= R) {\n return sval[x];\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n ll ret = 0;\n if (L <= m)\n ret += sget(2 * x + 1, l, m, L, R);\n if (m + 1 <= R)\n ret += sget(2 * x + 2, m + 1, r, L, R);\n return ret;\n }\n }\n void save(int x, int l, int r, ll *val, int *cnt) {\n if (l == r) {\n val[l] = sval[x];\n cnt[l] = scnt[x];\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n save(2 * x + 1, l, m, val, cnt);\n save(2 * x + 2, m + 1, r, val, cnt);\n }\n }\n void load(int x, int l, int r, ll *val, int *cnt) {\n if (l == r) {\n sval[x] = val[l], scnt[x] = cnt[x];\n } else {\n int m = l + (r - l) \/ 2;\n load(2 * x + 1, l, m, val, cnt);\n load(2 * x + 2, m + 1, r, val, cnt);\n scalc(x);\n }\n }\n} S;\nS s[MAXB];\n\nint nb;\npair<int, int> tmp[SZ];\nvoid build() {\n for (int i = 0; i < nemp; i += SZ) {\n int cnt = min(SZ, nemp - i);\n REP(j, cnt) tmp[j] = MP(d[emp[i + j]], emp[i + j]);\n sort(tmp, tmp + cnt);\n REP(j, cnt) sd[i + j] = tmp[j].first, pos[tmp[j].second] = i + j;\n }\n nb = (nemp + SZ - 1) \/ SZ;\n REP(i, nb) s[i].clear();\n REP(i, nemp)\n if (alive[i]) s[pos[i] \/ SZ].sborn(0, 0, SZ - 1, pos[i] % SZ, oval[i]);\n \/\/ REP(i,nemp) printf(\"%d: emp=%d d=%d pos=%d\n \/\/ oval=%d\\\\n\",i,emp[i],d[emp[i]],pos[emp[i]],oval[emp[i]]); REP(i,nemp)\n \/\/ printf(\" %d\",sd[i]); puts(\"\");\n}\n\nll tval[SZ];\nint tcnt[SZ];\nll query1(int idx, int ld, int rd) {\n \/\/ printf(\"query1(%d,%d,%d)\\\\n\",idx,ld,rd);\n if (!alive[idx] || d[idx] < ld || d[idx] >= rd)\n return 0;\n \/\/ return s[pos[idx]\/SZ].sget(0,0,SZ-1,pos[idx]%SZ,pos[idx]%SZ);\n return tval[pos[idx] % SZ];\n}\n\nll queryb(int idx, int ld, int rd) {\n \/\/ printf(\"queryb(%d,%d,%d)\\\\n\",idx,ld,rd);\n int bl = idx * SZ, br = min(nemp, (idx + 1) * SZ);\n int l = lower_bound(sd + bl, sd + br, ld) - sd;\n if (l >= br || sd[l] >= rd)\n return 0;\n int r = lower_bound(sd + bl, sd + br, rd) - sd;\n \/\/ printf(\"->%d..%d (%d,%d)\\\\n\",l,r-1,bl,br);\n return s[idx].sget(0, 0, SZ - 1, l % SZ, (r - 1) % SZ);\n}\n\nll query(int lid, int rid, int ld, int rd) {\n \/\/ printf(\"query(%d..%d,%d..%d)\\\\n\",lid,rid,ld,rd);\n ll ret = 0;\n if (lid < rid && lid % SZ != 0) {\n int b = lid \/ SZ;\n s[b].save(0, 0, SZ - 1, tval, tcnt);\n while (lid < rid && lid % SZ != 0)\n ret += query1(emp[lid++], ld, rd);\n }\n if (lid < rid && rid % SZ != 0) {\n int b = rid \/ SZ;\n s[b].save(0, 0, SZ - 1, tval, tcnt);\n while (lid < rid && rid % SZ != 0)\n ret += query1(emp[--rid], ld, rd);\n }\n while (lid < rid)\n ret += queryb(lid \/ SZ, ld, rd), lid += SZ;\n return ret;\n}\n\nvoid update1(int idx, int ld, int rd, int by) {\n if (!alive[idx] || d[idx] < ld || d[idx] >= rd)\n return;\n \/\/ s[pos[idx]\/SZ].smod(0,0,SZ-1,pos[idx]%SZ,pos[idx]%SZ,by);\n tval[pos[idx] % SZ] += by;\n}\n\nvoid updateb(int idx, int ld, int rd, int by) {\n int bl = idx * SZ, br = min(nemp, (idx + 1) * SZ);\n int l = lower_bound(sd + bl, sd + br, ld) - sd;\n if (l >= br || sd[l] >= rd)\n return;\n int r = lower_bound(sd + bl, sd + br, rd) - sd;\n return s[idx].smod(0, 0, SZ - 1, l % SZ, (r - 1) % SZ, by);\n}\n\nvoid update(int lid, int rid, int ld, int rd, int by) {\n if (lid < rid && lid % SZ != 0) {\n int b = lid \/ SZ;\n s[b].save(0, 0, SZ - 1, tval, tcnt);\n while (lid < rid && lid % SZ != 0)\n update1(emp[lid++], ld, rd, by);\n s[b].load(0, 0, SZ - 1, tval, tcnt);\n }\n if (lid < rid && rid % SZ != 0) {\n int b = rid \/ SZ;\n s[b].save(0, 0, SZ - 1, tval, tcnt);\n while (lid < rid && rid % SZ != 0)\n update1(emp[--rid], ld, rd, by);\n s[b].load(0, 0, SZ - 1, tval, tcnt);\n }\n while (lid < rid)\n updateb(lid \/ SZ, ld, rd, by), lid += SZ;\n}\n\nvoid born(int idx) {\n assert(!alive[idx]);\n alive[idx] = true;\n s[pos[idx] \/ SZ].sborn(0, 0, SZ - 1, pos[idx] % SZ, oval[idx]);\n}\n\nll ans[MAXQ];\nvoid solve() {\n REP(i, nemp) chead[i] = -1;\n REP(i, nemp) if (par[i] != -1) cnxt[i] = chead[par[i]], chead[par[i]] = i;\n nid = 0;\n dfs(0);\n build();\n\n REP(i, nq) {\n if (qt[i] == 1)\n update(lid[qemp[i]], rid[qemp[i]] + 1, d[qemp[i]], d[qemp[i]] + qd[i] + 1,\n qby[i]);\n if (qt[i] == 2)\n ans[i] = query(lid[qemp[i]], rid[qemp[i]] + 1, d[qemp[i]],\n d[qemp[i]] + qd[i] + 1);\n if (qt[i] == 3)\n born(qemp[i]);\n }\n}\n\nvoid run() {\n scanf(\"%d%d\", &n, &nq);\n nemp = n;\n REP(i, n) scanf(\"%d%d\", &par[i], &oval[i]), alive[i] = true;\n REP(i, nq) {\n scanf(\"%d\", &qt[i]);\n if (qt[i] == 1)\n scanf(\"%d%d%d\", &qemp[i], &qd[i], &qby[i]);\n if (qt[i] == 2)\n scanf(\"%d%d\", &qemp[i], &qd[i]);\n if (qt[i] == 3)\n scanf(\"%d%d\", &par[nemp], &oval[nemp]), alive[nemp] = false,\n qemp[i] = nemp++;\n }\n solve();\n REP(i, nq) if (qt[i] == 2) printf(\"%lld\\\\n\", ans[i]);\n}\n\nvoid stress() {\n REP(x, 10) {\n n = MAXN;\n nq = MAXQ;\n par[0] = -1;\n FOR(i, 1, n)\n par[i] = i < n \/ 10 ? i - 1 : (rand() * 1000 + rand()) % (n \/ 10);\n REP(i, n) oval[i] = rand() % 1000 + 1, alive[i] = true;\n nemp = n;\n REP(i, nq) {\n qt[i] = rand() % 3 + 1;\n if (qt[i] == 1)\n qemp[i] = 0, qd[i] = rand() % (n \/ 10), qby[i] = rand() % 1000 + 1;\n if (qt[i] == 2)\n qemp[i] = 0, qd[i] = rand() % (n \/ 10);\n if (qt[i] == 3)\n qemp[i] = nemp, par[nemp] = (rand() * 1000 + rand()) % (n \/ 10),\n oval[nemp] = rand() % 1000 + 1, alive[nemp] = false, ++nemp;\n }\n clock_t begin = clock();\n solve();\n \/\/ REP(i,nq) if(qt[i]==2) printf(\"%lld\\\\n\",ans[i]); exit(0);\n ll chk = 0;\n REP(i, nq) if (qt[i] == 2) chk += ans[i];\n printf(\"%.9lf %lld\\\\n\", double(clock() - begin) \/ CLOCKS_PER_SEC, chk);\n }\n}\n\nint main() {\n stress();\n \/\/ run();\n return 0;\n}\n","fail":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define PB push_back\n#define MP make_pair\n#define SZ(v) ((int)(v).size())\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)\n#define REPE(i, n) FORE(i, 0, n)\n#define FORSZ(i, a, v) FOR(i, a, SZ(v))\n#define REPSZ(i, v) REP(i, SZ(v))\ntypedef long long ll;\ntypedef unsigned long long ull;\nll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }\n\nconst int MAXN = 400000;\nconst int MAXQ = 50000;\nconst int MAXEMP = MAXN + MAXQ;\nconst int SZ = 400;\nconst int MAXB = (MAXEMP + SZ - 1) \/ SZ;\n\nint n, nq, nemp;\nint par[MAXEMP], oval[MAXEMP];\nbool alive[MAXEMP];\nint qt[MAXQ], qemp[MAXQ], qd[MAXQ], qby[MAXQ];\n\nint chead[MAXEMP], cnxt[MAXEMP];\nint d[MAXEMP], lid[MAXEMP], rid[MAXEMP], emp[MAXEMP], nid;\nvoid dfs(int at) {\n d[at] = par[at] == -1 ? 0 : d[par[at]] + 1;\n emp[nid] = at, lid[at] = nid++;\n for (int to = chead[at]; to != -1; to = cnxt[to])\n dfs(to);\n rid[at] = nid - 1;\n}\n\nint pos[MAXEMP];\nint sd[MAXEMP];\n\ntypedef struct S {\n ll sval[4 * SZ];\n int slazy[4 * SZ];\n int scnt[4 * SZ];\n void clear() {\n memset(sval, 0, sizeof(sval));\n memset(slazy, 0, sizeof(slazy));\n memset(scnt, 0, sizeof(scnt));\n }\n void spush(int x) {\n if (slazy[x] == 0)\n return;\n sval[2 * x + 1] += slazy[x] * scnt[2 * x + 1];\n slazy[2 * x + 1] += slazy[x];\n sval[2 * x + 2] += slazy[x] * scnt[2 * x + 2];\n slazy[2 * x + 2] += slazy[x];\n slazy[x] = 0;\n }\n void scalc(int x) {\n scnt[x] = scnt[2 * x + 1] + scnt[2 * x + 2];\n sval[x] = sval[2 * x + 1] + sval[2 * x + 2];\n }\n void sborn(int x, int l, int r, int IDX, int VAL) {\n if (l == r) {\n sval[x] = VAL, slazy[x] = 0, scnt[x] = 1;\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n if (IDX <= m)\n sborn(2 * x + 1, l, m, IDX, VAL);\n else\n sborn(2 * x + 2, m + 1, r, IDX, VAL);\n scalc(x);\n }\n \/\/ printf(\"sborn(%d,%d,%d,%d,%d) -> %d\n \/\/ %lld\\\\n\",x,l,r,IDX,VAL,scnt[x],sval[x]);\n }\n void smod(int x, int l, int r, int L, int R, int BY) {\n if (L <= l && r <= R) {\n sval[x] += (ll)scnt[x] * BY;\n slazy[x] += BY;\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n if (L <= m)\n smod(2 * x + 1, l, m, L, R, BY);\n if (m + 1 <= R)\n smod(2 * x + 2, m + 1, r, L, R, BY);\n scalc(x);\n }\n \/\/ printf(\"smod(%d,%d,%d,%d,%d,%d) -> %d %lld\n \/\/ %d\\\\n\",x,l,r,L,R,BY,scnt[x],sval[x],slazy[x]);\n }\n ll sget(int x, int l, int r, int L, int R) {\n if (L <= l && r <= R) {\n return sval[x];\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n ll ret = 0;\n if (L <= m)\n ret += sget(2 * x + 1, l, m, L, R);\n if (m + 1 <= R)\n ret += sget(2 * x + 2, m + 1, r, L, R);\n return ret;\n }\n }\n void save(int x, int l, int r, ll *val, int *cnt) {\n if (l == r) {\n val[l] = sval[x];\n cnt[l] = scnt[x];\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n save(2 * x + 1, l, m, val, cnt);\n save(2 * x + 2, m + 1, r, val, cnt);\n }\n }\n void load(int x, int l, int r, ll *val, int *cnt) {\n if (l == r) {\n sval[x] = val[l], scnt[x] = cnt[l];\n } else {\n int m = l + (r - l) \/ 2;\n load(2 * x + 1, l, m, val, cnt);\n load(2 * x + 2, m + 1, r, val, cnt);\n scalc(x);\n }\n }\n} S;\nS s[MAXB];\n\nint nb;\npair<int, int> tmp[SZ];\nvoid build() {\n for (int i = 0; i < nemp; i += SZ) {\n int cnt = min(SZ, nemp - i);\n REP(j, cnt) tmp[j] = MP(d[emp[i + j]], emp[i + j]);\n sort(tmp, tmp + cnt);\n REP(j, cnt) sd[i + j] = tmp[j].first, pos[tmp[j].second] = i + j;\n }\n nb = (nemp + SZ - 1) \/ SZ;\n REP(i, nb) s[i].clear();\n REP(i, nemp)\n if (alive[i]) s[pos[i] \/ SZ].sborn(0, 0, SZ - 1, pos[i] % SZ, oval[i]);\n \/\/ REP(i,nemp) printf(\"%d: emp=%d d=%d pos=%d\n \/\/ oval=%d\\\\n\",i,emp[i],d[emp[i]],pos[emp[i]],oval[emp[i]]); REP(i,nemp)\n \/\/ printf(\" %d\",sd[i]); puts(\"\");\n}\n\nll tval[SZ];\nint tcnt[SZ];\nll query1(int idx, int ld, int rd) {\n \/\/ printf(\"query1(%d,%d,%d)\\\\n\",idx,ld,rd);\n if (!alive[idx] || d[idx] < ld || d[idx] >= rd)\n return 0;\n \/\/ return s[pos[idx]\/SZ].sget(0,0,SZ-1,pos[idx]%SZ,pos[idx]%SZ);\n return tval[pos[idx] % SZ];\n}\n\nll queryb(int idx, int ld, int rd) {\n \/\/ printf(\"queryb(%d,%d,%d)\\\\n\",idx,ld,rd);\n int bl = idx * SZ, br = min(nemp, (idx + 1) * SZ);\n int l = lower_bound(sd + bl, sd + br, ld) - sd;\n if (l >= br || sd[l] >= rd)\n return 0;\n int r = lower_bound(sd + bl, sd + br, rd) - sd;\n \/\/ printf(\"->%d..%d (%d,%d)\\\\n\",l,r-1,bl,br);\n return s[idx].sget(0, 0, SZ - 1, l % SZ, (r - 1) % SZ);\n}\n\nll query(int lid, int rid, int ld, int rd) {\n \/\/ printf(\"query(%d..%d,%d..%d)\\\\n\",lid,rid,ld,rd);\n ll ret = 0;\n if (lid < rid && lid % SZ != 0) {\n int b = lid \/ SZ;\n s[b].save(0, 0, SZ - 1, tval, tcnt);\n while (lid < rid && lid % SZ != 0)\n ret += query1(emp[lid++], ld, rd);\n }\n if (lid < rid && rid % SZ != 0) {\n int b = rid \/ SZ;\n s[b].save(0, 0, SZ - 1, tval, tcnt);\n while (lid < rid && rid % SZ != 0)\n ret += query1(emp[--rid], ld, rd);\n }\n while (lid < rid)\n ret += queryb(lid \/ SZ, ld, rd), lid += SZ;\n return ret;\n}\n\nvoid update1(int idx, int ld, int rd, int by) {\n if (!alive[idx] || d[idx] < ld || d[idx] >= rd)\n return;\n \/\/ s[pos[idx]\/SZ].smod(0,0,SZ-1,pos[idx]%SZ,pos[idx]%SZ,by);\n tval[pos[idx] % SZ] += by;\n}\n\nvoid updateb(int idx, int ld, int rd, int by) {\n int bl = idx * SZ, br = min(nemp, (idx + 1) * SZ);\n int l = lower_bound(sd + bl, sd + br, ld) - sd;\n if (l >= br || sd[l] >= rd)\n return;\n int r = lower_bound(sd + bl, sd + br, rd) - sd;\n return s[idx].smod(0, 0, SZ - 1, l % SZ, (r - 1) % SZ, by);\n}\n\nvoid update(int lid, int rid, int ld, int rd, int by) {\n if (lid < rid && lid % SZ != 0) {\n int b = lid \/ SZ;\n s[b].save(0, 0, SZ - 1, tval, tcnt);\n while (lid < rid && lid % SZ != 0)\n update1(emp[lid++], ld, rd, by);\n s[b].load(0, 0, SZ - 1, tval, tcnt);\n }\n if (lid < rid && rid % SZ != 0) {\n int b = rid \/ SZ;\n s[b].save(0, 0, SZ - 1, tval, tcnt);\n while (lid < rid && rid % SZ != 0)\n update1(emp[--rid], ld, rd, by);\n s[b].load(0, 0, SZ - 1, tval, tcnt);\n }\n while (lid < rid)\n updateb(lid \/ SZ, ld, rd, by), lid += SZ;\n}\n\nvoid born(int idx) {\n assert(!alive[idx]);\n alive[idx] = true;\n s[pos[idx] \/ SZ].sborn(0, 0, SZ - 1, pos[idx] % SZ, oval[idx]);\n}\n\nll ans[MAXQ];\nvoid solve() {\n REP(i, nemp) chead[i] = -1;\n REP(i, nemp) if (par[i] != -1) cnxt[i] = chead[par[i]], chead[par[i]] = i;\n nid = 0;\n dfs(0);\n build();\n\n REP(i, nq) {\n if (qt[i] == 1)\n update(lid[qemp[i]], rid[qemp[i]] + 1, d[qemp[i]], d[qemp[i]] + qd[i] + 1,\n qby[i]);\n if (qt[i] == 2)\n ans[i] = query(lid[qemp[i]], rid[qemp[i]] + 1, d[qemp[i]],\n d[qemp[i]] + qd[i] + 1);\n if (qt[i] == 3)\n born(qemp[i]);\n }\n}\n\nvoid run() {\n scanf(\"%d%d\", &n, &nq);\n nemp = n;\n REP(i, n) scanf(\"%d%d\", &par[i], &oval[i]), alive[i] = true;\n REP(i, nq) {\n scanf(\"%d\", &qt[i]);\n if (qt[i] == 1)\n scanf(\"%d%d%d\", &qemp[i], &qd[i], &qby[i]);\n if (qt[i] == 2)\n scanf(\"%d%d\", &qemp[i], &qd[i]);\n if (qt[i] == 3)\n scanf(\"%d%d\", &par[nemp], &oval[nemp]), alive[nemp] = false,\n qemp[i] = nemp++;\n }\n solve();\n REP(i, nq) if (qt[i] == 2) printf(\"%lld\\\\n\", ans[i]);\n}\n\nvoid stress() {\n REP(x, 10) {\n n = MAXN;\n nq = MAXQ;\n par[0] = -1;\n FOR(i, 1, n)\n par[i] = i < n \/ 10 ? i - 1 : (rand() * 1000 + rand()) % (n \/ 10);\n REP(i, n) oval[i] = rand() % 1000 + 1, alive[i] = true;\n nemp = n;\n REP(i, nq) {\n qt[i] = rand() % 3 + 1;\n if (qt[i] == 1)\n qemp[i] = rand() % min(n, 10), qd[i] = rand() % (n \/ 10),\n qby[i] = rand() % 1000 + 1;\n if (qt[i] == 2)\n qemp[i] = rand() % min(n, 10), qd[i] = rand() % (n \/ 10);\n if (qt[i] == 3)\n qemp[i] = nemp, par[nemp] = (rand() * 1000 + rand()) % (n \/ 10),\n oval[nemp] = rand() % 1000 + 1, alive[nemp] = false, ++nemp;\n }\n clock_t begin = clock();\n solve();\n \/\/ REP(i,nq) if(qt[i]==2) printf(\"%lld\\\\n\",ans[i]); exit(0);\n ll chk = 0;\n REP(i, nq) if (qt[i] == 2) chk += ans[i];\n printf(\"%.9lf %lld\\\\n\", double(clock() - begin) \/ CLOCKS_PER_SEC, chk);\n }\n}\n\nint main() {\n \/\/ stress();\n run();\n return 0;\n}\n","change":"replace","i1":136,"i2":316,"j1":136,"j2":317,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03757","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define PB push_back\n#define MP make_pair\n#define SZ(v) ((int)(v).size())\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)\n#define REPE(i, n) FORE(i, 0, n)\n#define FORSZ(i, a, v) FOR(i, a, SZ(v))\n#define REPSZ(i, v) REP(i, SZ(v))\ntypedef long long ll;\ntypedef unsigned long long ull;\nll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }\n\nconst int MAXN = 400000;\nconst int MAXQ = 50000;\nconst int MAXEMP = MAXN + MAXQ;\nconst int SZ = 400;\nconst int MAXB = (MAXEMP + SZ - 1) \/ SZ;\n\nint n, nq, nemp;\nint par[MAXEMP], oval[MAXEMP];\nbool alive[MAXEMP];\nint qt[MAXQ], qemp[MAXQ], qd[MAXQ], qby[MAXQ];\n\nint chead[MAXEMP], cnxt[MAXEMP];\nint d[MAXEMP], lid[MAXEMP], rid[MAXEMP], emp[MAXEMP], nid;\nvoid dfs(int at) {\n d[at] = par[at] == -1 ? 0 : d[par[at]] + 1;\n emp[nid] = at, lid[at] = nid++;\n for (int to = chead[at]; to != -1; to = cnxt[to])\n dfs(to);\n rid[at] = nid - 1;\n}\n\nint pos[MAXEMP];\nint sd[MAXEMP];\nll sval[4 * MAXEMP];\nint slazy[4 * MAXEMP];\nint scnt[4 * MAXEMP];\n\nvoid spush(int x) {\n if (slazy[x] == 0)\n return;\n sval[2 * x + 1] += slazy[x] * scnt[2 * x + 1];\n slazy[2 * x + 1] += slazy[x];\n sval[2 * x + 2] += slazy[x] * scnt[2 * x + 2];\n slazy[2 * x + 2] += slazy[x];\n slazy[x] = 0;\n}\nvoid scalc(int x) {\n scnt[x] = scnt[2 * x + 1] + scnt[2 * x + 2];\n sval[x] = sval[2 * x + 1] + sval[2 * x + 2];\n}\nvoid sborn(int x, int l, int r, int IDX, int VAL) {\n if (l == r) {\n sval[x] = VAL, slazy[x] = 0, scnt[x] = 1;\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n if (IDX <= m)\n sborn(2 * x + 1, l, m, IDX, VAL);\n else\n sborn(2 * x + 2, m + 1, r, IDX, VAL);\n scalc(x);\n }\n \/\/ printf(\"sborn(%d,%d,%d,%d,%d) -> %d %lld\\\\n\",x,l,r,IDX,VAL,scnt[x],sval[x]);\n}\nvoid smod(int x, int l, int r, int L, int R, int BY) {\n if (L <= l && r <= R) {\n sval[x] += (ll)scnt[x] * BY;\n slazy[x] += BY;\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n if (L <= m)\n smod(2 * x + 1, l, m, L, R, BY);\n if (m + 1 <= R)\n smod(2 * x + 2, m + 1, r, L, R, BY);\n scalc(x);\n }\n \/\/ printf(\"smod(%d,%d,%d,%d,%d,%d) -> %d %lld\n \/\/ %d\\\\n\",x,l,r,L,R,BY,scnt[x],sval[x],slazy[x]);\n}\nll sget(int x, int l, int r, int L, int R) {\n if (L <= l && r <= R) {\n return sval[x];\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n ll ret = 0;\n if (L <= m)\n ret += sget(2 * x + 1, l, m, L, R);\n if (m + 1 <= R)\n ret += sget(2 * x + 2, m + 1, r, L, R);\n return ret;\n }\n}\n\npair<int, int> tmp[SZ];\nvoid build() {\n for (int i = 0; i < nemp; i += SZ) {\n int cnt = min(SZ, nemp - i);\n REP(j, cnt) tmp[j] = MP(d[emp[i + j]], emp[i + j]);\n sort(tmp, tmp + cnt);\n REP(j, cnt) sd[i + j] = tmp[j].first, pos[tmp[j].second] = i + j;\n }\n memset(sval, 0, sizeof(sval));\n memset(slazy, 0, sizeof(slazy));\n memset(scnt, 0, sizeof(scnt));\n REP(i, nemp) if (alive[i]) sborn(0, 0, nemp - 1, pos[i], oval[i]);\n \/\/ REP(i,nemp) printf(\"%d: emp=%d d=%d pos=%d\n \/\/ oval=%d\\\\n\",i,emp[i],d[emp[i]],pos[emp[i]],oval[emp[i]]); REP(i,nemp)\n \/\/ printf(\" %d\",sd[i]); puts(\"\");\n}\n\nll query1(int idx, int ld, int rd) {\n \/\/ printf(\"query1(%d,%d,%d)\\\\n\",idx,ld,rd);\n if (!alive[idx] || d[idx] < ld || d[idx] >= rd)\n return 0;\n return sget(0, 0, nemp - 1, pos[idx], pos[idx]);\n}\n\nll queryb(int idx, int ld, int rd) {\n \/\/ printf(\"queryb(%d,%d,%d)\\\\n\",idx,ld,rd);\n int bl = idx * SZ, br = min(nemp, (idx + 1) * SZ);\n int l = lower_bound(sd + bl, sd + br, ld) - sd;\n if (l >= br || sd[l] >= rd)\n return 0;\n int r = lower_bound(sd + bl, sd + br, rd) - sd;\n \/\/ printf(\"->%d..%d (%d,%d)\\\\n\",l,r-1,bl,br);\n return sget(0, 0, nemp - 1, l, r - 1);\n}\n\nll query(int lid, int rid, int ld, int rd) {\n \/\/ printf(\"query(%d..%d,%d..%d)\\\\n\",lid,rid,ld,rd);\n ll ret = 0;\n while (lid < rid && lid % SZ != 0)\n ret += query1(emp[lid++], ld, rd);\n while (lid < rid && rid % SZ != 0)\n ret += query1(emp[--rid], ld, rd);\n while (lid < rid)\n ret += queryb(lid \/ SZ, ld, rd), lid += SZ;\n return ret;\n}\n\nvoid update1(int idx, int ld, int rd, int by) {\n if (!alive[idx] || d[idx] < ld || d[idx] >= rd)\n return;\n smod(0, 0, nemp - 1, pos[idx], pos[idx], by);\n}\n\nvoid updateb(int idx, int ld, int rd, int by) {\n int bl = idx * SZ, br = min(nemp, (idx + 1) * SZ);\n int l = lower_bound(sd + bl, sd + br, ld) - sd;\n if (l >= br || sd[l] >= rd)\n return;\n int r = lower_bound(sd + bl, sd + br, rd) - sd;\n return smod(0, 0, nemp - 1, l, r - 1, by);\n}\n\nvoid update(int lid, int rid, int ld, int rd, int by) {\n while (lid < rid && lid % SZ != 0)\n update1(emp[lid++], ld, rd, by);\n while (lid < rid && rid % SZ != 0)\n update1(emp[--rid], ld, rd, by);\n while (lid < rid)\n updateb(lid \/ SZ, ld, rd, by), lid += SZ;\n}\n\nvoid born(int idx) {\n assert(!alive[idx]);\n alive[idx] = true;\n sborn(0, 0, nemp - 1, pos[idx], oval[idx]);\n}\n\nll ans[MAXQ];\nvoid solve() {\n REP(i, nemp) chead[i] = -1;\n REP(i, nemp) if (par[i] != -1) cnxt[i] = chead[par[i]], chead[par[i]] = i;\n nid = 0;\n dfs(0);\n build();\n\n REP(i, nq) {\n if (qt[i] == 1)\n update(lid[qemp[i]], rid[qemp[i]] + 1, d[qemp[i]], d[qemp[i]] + qd[i] + 1,\n qby[i]);\n if (qt[i] == 2)\n ans[i] = query(lid[qemp[i]], rid[qemp[i]] + 1, d[qemp[i]],\n d[qemp[i]] + qd[i] + 1);\n if (qt[i] == 3)\n born(qemp[i]);\n }\n}\n\nvoid run() {\n scanf(\"%d%d\", &n, &nq);\n nemp = n;\n REP(i, n) scanf(\"%d%d\", &par[i], &oval[i]), alive[i] = true;\n REP(i, nq) {\n scanf(\"%d\", &qt[i]);\n if (qt[i] == 1)\n scanf(\"%d%d%d\", &qemp[i], &qd[i], &qby[i]);\n if (qt[i] == 2)\n scanf(\"%d%d\", &qemp[i], &qd[i]);\n if (qt[i] == 3)\n scanf(\"%d%d\", &par[nemp], &oval[nemp]), alive[nemp] = false,\n qemp[i] = nemp++;\n }\n solve();\n REP(i, nq) if (qt[i] == 2) printf(\"%lld\\\\n\", ans[i]);\n}\n\nvoid stress() {\n REP(x, 10) {\n n = MAXN;\n nq = MAXQ;\n par[0] = -1;\n FOR(i, 1, n) par[i] = rand() % i;\n REP(i, n) oval[i] = rand() % 1000 + 1, alive[i] = true;\n nemp = n;\n REP(i, nq) {\n qt[i] = rand() % 3 + 1;\n if (qt[i] == 1)\n qemp[i] = rand() % min(50, nemp), qd[i] = rand() % 100,\n qby[i] = rand() % 1000 + 1;\n if (qt[i] == 2)\n qemp[i] = rand() % min(50, nemp), qd[i] = rand() % 100;\n if (qt[i] == 3)\n qemp[i] = nemp, par[nemp] = rand() % nemp,\n oval[nemp] = rand() % 1000 + 1, alive[nemp] = false, ++nemp;\n }\n clock_t begin = clock();\n solve();\n printf(\"%.9lf\\\\n\", double(clock() - begin) \/ CLOCKS_PER_SEC);\n }\n}\n\nint main() {\n \/\/ stress();\n run();\n return 0;\n}\n","fail":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <iostream>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define PB push_back\n#define MP make_pair\n#define SZ(v) ((int)(v).size())\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)\n#define REPE(i, n) FORE(i, 0, n)\n#define FORSZ(i, a, v) FOR(i, a, SZ(v))\n#define REPSZ(i, v) REP(i, SZ(v))\ntypedef long long ll;\ntypedef unsigned long long ull;\nll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }\n\nconst int MAXN = 400000;\nconst int MAXQ = 50000;\nconst int MAXEMP = MAXN + MAXQ;\nconst int SZ = 400;\nconst int MAXB = (MAXEMP + SZ - 1) \/ SZ;\n\nint n, nq, nemp;\nint par[MAXEMP], oval[MAXEMP];\nbool alive[MAXEMP];\nint qt[MAXQ], qemp[MAXQ], qd[MAXQ], qby[MAXQ];\n\nint chead[MAXEMP], cnxt[MAXEMP];\nint d[MAXEMP], lid[MAXEMP], rid[MAXEMP], emp[MAXEMP], nid;\nvoid dfs(int at) {\n d[at] = par[at] == -1 ? 0 : d[par[at]] + 1;\n emp[nid] = at, lid[at] = nid++;\n for (int to = chead[at]; to != -1; to = cnxt[to])\n dfs(to);\n rid[at] = nid - 1;\n}\n\nint pos[MAXEMP];\nint sd[MAXEMP];\n\ntypedef struct S {\n ll sval[4 * SZ];\n int slazy[4 * SZ];\n int scnt[4 * SZ];\n void clear() {\n memset(sval, 0, sizeof(sval));\n memset(slazy, 0, sizeof(slazy));\n memset(scnt, 0, sizeof(scnt));\n }\n void spush(int x) {\n if (slazy[x] == 0)\n return;\n sval[2 * x + 1] += slazy[x] * scnt[2 * x + 1];\n slazy[2 * x + 1] += slazy[x];\n sval[2 * x + 2] += slazy[x] * scnt[2 * x + 2];\n slazy[2 * x + 2] += slazy[x];\n slazy[x] = 0;\n }\n void scalc(int x) {\n scnt[x] = scnt[2 * x + 1] + scnt[2 * x + 2];\n sval[x] = sval[2 * x + 1] + sval[2 * x + 2];\n }\n void sborn(int x, int l, int r, int IDX, int VAL) {\n if (l == r) {\n sval[x] = VAL, slazy[x] = 0, scnt[x] = 1;\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n if (IDX <= m)\n sborn(2 * x + 1, l, m, IDX, VAL);\n else\n sborn(2 * x + 2, m + 1, r, IDX, VAL);\n scalc(x);\n }\n \/\/ printf(\"sborn(%d,%d,%d,%d,%d) -> %d\n \/\/ %lld\\\\n\",x,l,r,IDX,VAL,scnt[x],sval[x]);\n }\n void smod(int x, int l, int r, int L, int R, int BY) {\n if (L <= l && r <= R) {\n sval[x] += (ll)scnt[x] * BY;\n slazy[x] += BY;\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n if (L <= m)\n smod(2 * x + 1, l, m, L, R, BY);\n if (m + 1 <= R)\n smod(2 * x + 2, m + 1, r, L, R, BY);\n scalc(x);\n }\n \/\/ printf(\"smod(%d,%d,%d,%d,%d,%d) -> %d %lld\n \/\/ %d\\\\n\",x,l,r,L,R,BY,scnt[x],sval[x],slazy[x]);\n }\n ll sget(int x, int l, int r, int L, int R) {\n if (L <= l && r <= R) {\n return sval[x];\n } else {\n spush(x);\n int m = l + (r - l) \/ 2;\n ll ret = 0;\n if (L <= m)\n ret += sget(2 * x + 1, l, m, L, R);\n if (m + 1 <= R)\n ret += sget(2 * x + 2, m + 1, r, L, R);\n return ret;\n }\n }\n} S;\nS s[MAXB];\n\nint nb;\npair<int, int> tmp[SZ];\nvoid build() {\n for (int i = 0; i < nemp; i += SZ) {\n int cnt = min(SZ, nemp - i);\n REP(j, cnt) tmp[j] = MP(d[emp[i + j]], emp[i + j]);\n sort(tmp, tmp + cnt);\n REP(j, cnt) sd[i + j] = tmp[j].first, pos[tmp[j].second] = i + j;\n }\n nb = (nemp + SZ - 1) \/ SZ;\n REP(i, nb) s[i].clear();\n REP(i, nemp)\n if (alive[i]) s[pos[i] \/ SZ].sborn(0, 0, SZ - 1, pos[i] % SZ, oval[i]);\n \/\/ REP(i,nemp) printf(\"%d: emp=%d d=%d pos=%d\n \/\/ oval=%d\\\\n\",i,emp[i],d[emp[i]],pos[emp[i]],oval[emp[i]]); REP(i,nemp)\n \/\/ printf(\" %d\",sd[i]); puts(\"\");\n}\n\nll query1(int idx, int ld, int rd) {\n \/\/ printf(\"query1(%d,%d,%d)\\\\n\",idx,ld,rd);\n if (!alive[idx] || d[idx] < ld || d[idx] >= rd)\n return 0;\n return s[pos[idx] \/ SZ].sget(0, 0, SZ - 1, pos[idx] % SZ, pos[idx] % SZ);\n}\n\nll queryb(int idx, int ld, int rd) {\n \/\/ printf(\"queryb(%d,%d,%d)\\\\n\",idx,ld,rd);\n int bl = idx * SZ, br = min(nemp, (idx + 1) * SZ);\n int l = lower_bound(sd + bl, sd + br, ld) - sd;\n if (l >= br || sd[l] >= rd)\n return 0;\n int r = lower_bound(sd + bl, sd + br, rd) - sd;\n \/\/ printf(\"->%d..%d (%d,%d)\\\\n\",l,r-1,bl,br);\n return s[idx].sget(0, 0, SZ - 1, l % SZ, (r - 1) % SZ);\n}\n\nll query(int lid, int rid, int ld, int rd) {\n \/\/ printf(\"query(%d..%d,%d..%d)\\\\n\",lid,rid,ld,rd);\n ll ret = 0;\n while (lid < rid && lid % SZ != 0)\n ret += query1(emp[lid++], ld, rd);\n while (lid < rid && rid % SZ != 0)\n ret += query1(emp[--rid], ld, rd);\n while (lid < rid)\n ret += queryb(lid \/ SZ, ld, rd), lid += SZ;\n return ret;\n}\n\nvoid update1(int idx, int ld, int rd, int by) {\n if (!alive[idx] || d[idx] < ld || d[idx] >= rd)\n return;\n s[pos[idx] \/ SZ].smod(0, 0, SZ - 1, pos[idx] % SZ, pos[idx] % SZ, by);\n}\n\nvoid updateb(int idx, int ld, int rd, int by) {\n int bl = idx * SZ, br = min(nemp, (idx + 1) * SZ);\n int l = lower_bound(sd + bl, sd + br, ld) - sd;\n if (l >= br || sd[l] >= rd)\n return;\n int r = lower_bound(sd + bl, sd + br, rd) - sd;\n return s[idx].smod(0, 0, SZ - 1, l % SZ, (r - 1) % SZ, by);\n}\n\nvoid update(int lid, int rid, int ld, int rd, int by) {\n while (lid < rid && lid % SZ != 0)\n update1(emp[lid++], ld, rd, by);\n while (lid < rid && rid % SZ != 0)\n update1(emp[--rid], ld, rd, by);\n while (lid < rid)\n updateb(lid \/ SZ, ld, rd, by), lid += SZ;\n}\n\nvoid born(int idx) {\n assert(!alive[idx]);\n alive[idx] = true;\n s[pos[idx] \/ SZ].sborn(0, 0, SZ - 1, pos[idx] % SZ, oval[idx]);\n}\n\nll ans[MAXQ];\nvoid solve() {\n REP(i, nemp) chead[i] = -1;\n REP(i, nemp) if (par[i] != -1) cnxt[i] = chead[par[i]], chead[par[i]] = i;\n nid = 0;\n dfs(0);\n build();\n\n REP(i, nq) {\n if (qt[i] == 1)\n update(lid[qemp[i]], rid[qemp[i]] + 1, d[qemp[i]], d[qemp[i]] + qd[i] + 1,\n qby[i]);\n if (qt[i] == 2)\n ans[i] = query(lid[qemp[i]], rid[qemp[i]] + 1, d[qemp[i]],\n d[qemp[i]] + qd[i] + 1);\n if (qt[i] == 3)\n born(qemp[i]);\n }\n}\n\nvoid run() {\n scanf(\"%d%d\", &n, &nq);\n nemp = n;\n REP(i, n) scanf(\"%d%d\", &par[i], &oval[i]), alive[i] = true;\n REP(i, nq) {\n scanf(\"%d\", &qt[i]);\n if (qt[i] == 1)\n scanf(\"%d%d%d\", &qemp[i], &qd[i], &qby[i]);\n if (qt[i] == 2)\n scanf(\"%d%d\", &qemp[i], &qd[i]);\n if (qt[i] == 3)\n scanf(\"%d%d\", &par[nemp], &oval[nemp]), alive[nemp] = false,\n qemp[i] = nemp++;\n }\n solve();\n REP(i, nq) if (qt[i] == 2) printf(\"%lld\\\\n\", ans[i]);\n}\n\nvoid stress() {\n REP(x, 10) {\n n = MAXN;\n nq = MAXQ;\n par[0] = -1;\n FOR(i, 1, n)\n par[i] = i < n \/ 10 ? i - 1 : (rand() * 1000 + rand()) % (n \/ 10);\n REP(i, n) oval[i] = rand() % 1000 + 1, alive[i] = true;\n nemp = n;\n REP(i, nq) {\n qt[i] = rand() % 3 + 1;\n if (qt[i] == 1)\n qemp[i] = 0, qd[i] = rand() % (n \/ 10), qby[i] = rand() % 1000 + 1;\n if (qt[i] == 2)\n qemp[i] = 0, qd[i] = rand() % (n \/ 10);\n if (qt[i] == 3)\n qemp[i] = nemp, par[nemp] = (rand() * 1000 + rand()) % (n \/ 10),\n oval[nemp] = rand() % 1000 + 1, alive[nemp] = false, ++nemp;\n }\n clock_t begin = clock();\n solve();\n printf(\"%.9lf\\\\n\", double(clock() - begin) \/ CLOCKS_PER_SEC);\n }\n}\n\nint main() {\n \/\/ stress();\n run();\n return 0;\n}\n","change":"replace","i1":55,"i2":249,"j1":55,"j2":259,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03794","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stdio.h>\n#include <utility>\n#include <vector>\nusing namespace std;\n#define y0 y0z\n#define y1 y1z\n#define yn ynz\n#define j0 j0z\n#define j1 j1z\n#define jn jnz\n#define tm tmz\n#define buli(x) (__builtin_popcountll(x))\n#define bur0(x) (__builtin_ctzll(x))\n#define bul2(x) (63 - __builtin_clzll(x))\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define se second\n#define fil(a, b) memset((a), (b), sizeof(a))\n#define cl(a) fil(a, 0)\n#define siz(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define foreach(it, a) \\\\\n for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)\n#define rep(i, a, b) for (int i = (a), _ed = (b); i < _ed; i++)\n#define per(i, a, b) for (int i = (b)-1, _ed = (a); i >= _ed; i--)\n#define forg(i, gu) for (int i = gu; ~i; i = e[i].next)\n#define pw(x) ((ll(1)) << (x))\n#define upmo(a, b) (((a) = ((a) + (b)) % mo) < 0 ? (a) += mo : (a))\n#define mmo(a, b) (((a) = 1ll * (a) * (b) % mo) < 0 ? (a) += mo : (a))\nvoid getre() {\n int x = 0;\n printf(\"%d\\\\n\", 1 \/ x);\n}\nvoid gettle() {\n int res = 1;\n while (1)\n res <<= 1;\n printf(\"%d\\\\n\", res);\n}\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<pii> vpii;\ntemplate <typename T, typename S> inline bool upmin(T &a, const S &b) {\n return a > b ? a = b, 1 : 0;\n}\ntemplate <typename T, typename S> inline bool upmax(T &a, const S &b) {\n return a < b ? a = b, 1 : 0;\n}\ntemplate <typename N, typename PN> inline N flo(N a, PN b) {\n return a >= 0 ? a \/ b : -((-a - 1) \/ b) - 1;\n}\ntemplate <typename N, typename PN> inline N cei(N a, PN b) {\n return a > 0 ? (a - 1) \/ b + 1 : -(-a \/ b);\n}\ntemplate <typename N> N gcd(N a, N b) { return b ? gcd(b, a % b) : a; }\ntemplate <typename N> inline int sgn(N a) {\n return a > 0 ? 1 : (a < 0 ? -1 : 0);\n}\n#if ((_WIN32 || __WIN32__) && __cplusplus < 201103L)\n#define lld \"%I64d\"\n#else\n#define lld \"%lld\"\n#endif\ninline void gn(long long &x) {\n int sg = 1;\n char c;\n while (((c = getchar()) < '0' || c > '9') && c != '-')\n ;\n c == '-' ? (sg = -1, x = 0) : (x = c - '0');\n while ((c = getchar()) >= '0' && c <= '9')\n x = x * 10 + c - '0';\n x *= sg;\n}\ninline void gn(int &x) {\n long long t;\n gn(t);\n x = t;\n}\ninline void gn(unsigned long long &x) {\n long long t;\n gn(t);\n x = t;\n}\ninline void gn(double &x) {\n double t;\n scanf(\"%lf\", &t);\n x = t;\n}\ninline void gn(long double &x) {\n double t;\n scanf(\"%lf\", &t);\n x = t;\n}\ninline void gs(char *s) { scanf(\"%s\", s); }\ninline void gc(char &c) {\n while ((c = getchar()) > 126 || c < 33)\n ;\n}\ninline void pc(char c) { putchar(c); }\n#ifdef JCVB\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#else\n#define debug(...)\n#endif\ntypedef long long ll;\ntypedef double db;\ninline ll sqr(ll a) { return a * a; }\ninline db sqrf(db a) { return a * a; }\nconst int inf = 0x3f3f3f3f;\n\/\/ const ll inf=0x3f3f3f3f3f3f3f3fll;\nconst db pi = 3.14159265358979323846264338327950288L;\nconst db eps = 1e-6;\nconst int mo = 1e9 + 7;\n\/\/ int qp(int a,ll b){int\n\/\/ n=1;do{if(b&1)n=1ll*n*a%mo;a=1ll*a*a%mo;}while(b>>=1);return n;}\n\nconst int TREE_MAXV = 3000 + 5;\nstruct edge {\n int v, next;\n} e[TREE_MAXV * 2];\nint g[TREE_MAXV], etot;\nint qu[TREE_MAXV], pre[TREE_MAXV];\nint h[33333];\nint n;\nvoid ae(int u, int v) {\n e[etot].v = v;\n e[etot].next = g[u];\n g[u] = etot++;\n}\n\nint bel[33333];\nvoid bfs(int rt) {\n int p = 0, q = 0;\n pre[rt] = 0;\n h[rt] = 0;\n qu[q++] = rt;\n while (p != q) {\n int u = qu[p++];\n for (int i = g[u]; ~i; i = e[i].next)\n if (e[i].v != pre[u]) {\n pre[e[i].v] = u;\n bel[e[i].v] |= bel[u];\n h[e[i].v] = h[u] + 1;\n qu[q++] = e[i].v;\n }\n }\n}\nvoid tree_init() {\n static bool ini = 0;\n if (!ini) {\n ini = 1;\n memset(g, -1, sizeof(g));\n } else {\n for (int i = 0; i <= n; i++)\n g[i] = -1;\n }\n etot = 0;\n}\nvoid readedge() {\n for (int i = 1; i < n; i++) {\n int x, y;\n gn(x);\n gn(y);\n ae(x, y);\n ae(y, x);\n }\n}\n\nint boun[2222], to[2222];\nconst int zer = 1111;\nint f[1111][2222];\n\nint dp() {\n cl(f);\n for (int i = n - 1; i >= 0; i--) {\n int u = qu[i];\n\n for (int j = to[u] - boun[u]; j <= to[u] + boun[u]; j++) {\n f[u][j + zer] = 1;\n forg(t, g[u]) if (e[t].v != pre[u])\n mmo(f[u][j + zer], (f[e[t].v][j - 1 + zer] + f[e[t].v][j + 1 + zer]));\n }\n }\n int ret = 0;\n rep(t, 0, 2222) upmo(ret, f[qu[0]][t]);\n return ret;\n}\n\nint main() {\n#ifdef JCVB\n \/\/ freopen(\"1.in\",\"r\",stdin);\n \/\/ freopen(\"1.out\",\"w\",stdout);\n int _time_jc = clock();\n#endif\n gn(n);\n tree_init();\n readedge();\n\n static int dis1[2222];\n\n bfs(1);\n int ma = 1;\n rep(u, 2, n + 1) if (h[u] > h[ma]) ma = u;\n bfs(ma);\n int mav = 1;\n rep(u, 1, n + 1) if (h[u] > h[mav]) mav = u;\n\n bfs(mav);\n rep(i, 1, n + 1) dis1[i] = h[i];\n bfs(ma);\n int r;\n\n r = cei(h[mav], 2);\n int rt = 0, rt2 = 0;\n\n if (h[mav] % 2 == 0) {\n rep(i, 1, n + 1) {\n if (dis1[i] == h[i] && h[i] == h[mav] \/ 2)\n rt = i;\n }\n } else {\n rep(i, 1, n + 1) {\n if (dis1[i] == h[mav] \/ 2 && h[i] == (h[mav] + 1) \/ 2)\n rt = i;\n if (dis1[i] == (h[mav] + 1) \/ 2 && h[i] == (h[mav] + 0) \/ 2)\n rt2 = i;\n }\n }\n\n bel[rt2] = 1;\n bfs(rt);\n\n int ans = 0;\n if (rt2 == 0) {\n getre();\n rep(u, 1, n + 1) boun[u] = r - h[u], to[u] = 0;\n upmo(ans, dp());\n } else {\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (bel[u]) {\n to[u] = 0;\n boun[u] = d;\n } else {\n to[u] = 0;\n boun[u] = d + 1;\n }\n }\n upmo(ans, dp());\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (bel[u]) {\n to[u] = 0;\n boun[u] = d;\n } else {\n to[u] = 0;\n boun[u] = d + 1;\n if (d == 0) {\n to[u] = 1;\n boun[u] = 0;\n }\n }\n }\n upmo(ans, -dp());\n\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (bel[u]) {\n to[u] = 0;\n boun[u] = d;\n } else {\n to[u] = 0;\n boun[u] = d + 1;\n if (d == 0) {\n to[u] = -1;\n boun[u] = 0;\n }\n }\n }\n upmo(ans, -dp());\n\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (bel[u]) {\n to[u] = 0;\n boun[u] = d + 1;\n } else {\n to[u] = 0;\n boun[u] = d;\n }\n }\n upmo(ans, dp());\n\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (!bel[u]) {\n to[u] = 0;\n boun[u] = d;\n } else {\n to[u] = 0;\n boun[u] = d + 1;\n if (d == 0) {\n to[u] = 1;\n boun[u] = 0;\n }\n }\n }\n upmo(ans, -dp());\n\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (!bel[u]) {\n to[u] = 0;\n boun[u] = d;\n } else {\n to[u] = 0;\n boun[u] = d + 1;\n if (d == 0) {\n to[u] = -1;\n boun[u] = 0;\n }\n }\n }\n upmo(ans, -dp());\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (!bel[u]) {\n to[u] = 1;\n boun[u] = d + 1;\n if (d == 0) {\n to[u] = 0;\n boun[u] = 0;\n }\n } else {\n to[u] = 0;\n boun[u] = d + 1;\n if (d == 0) {\n to[u] = 1;\n boun[u] = 0;\n }\n }\n }\n upmo(ans, dp());\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (bel[u]) {\n to[u] = 1;\n boun[u] = d + 1;\n if (d == 0) {\n to[u] = 0;\n boun[u] = 0;\n }\n } else {\n to[u] = 0;\n boun[u] = d + 1;\n if (d == 0) {\n to[u] = 1;\n boun[u] = 0;\n }\n }\n }\n upmo(ans, dp());\n }\n\n printf(\"%d\\\\n\", ans);\n#ifdef JCVB\n debug(\"time: %d\\\\n\", int(clock() - _time_jc));\n#endif\n return 0;\n}\n","fail":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stdio.h>\n#include <utility>\n#include <vector>\nusing namespace std;\n#define y0 y0z\n#define y1 y1z\n#define yn ynz\n#define j0 j0z\n#define j1 j1z\n#define jn jnz\n#define tm tmz\n#define buli(x) (__builtin_popcountll(x))\n#define bur0(x) (__builtin_ctzll(x))\n#define bul2(x) (63 - __builtin_clzll(x))\n#define mp make_pair\n#define pb push_back\n#define fi first\n#define se second\n#define fil(a, b) memset((a), (b), sizeof(a))\n#define cl(a) fil(a, 0)\n#define siz(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define foreach(it, a) \\\\\n for (__typeof((a).begin()) it = (a).begin(); it != (a).end(); it++)\n#define rep(i, a, b) for (int i = (a), _ed = (b); i < _ed; i++)\n#define per(i, a, b) for (int i = (b)-1, _ed = (a); i >= _ed; i--)\n#define forg(i, gu) for (int i = gu; ~i; i = e[i].next)\n#define pw(x) ((ll(1)) << (x))\n#define upmo(a, b) (((a) = ((a) + (b)) % mo) < 0 ? (a) += mo : (a))\n#define mmo(a, b) (((a) = 1ll * (a) * (b) % mo) < 0 ? (a) += mo : (a))\nvoid getre() {\n int x = 0;\n printf(\"%d\\\\n\", 1 \/ x);\n}\nvoid gettle() {\n int res = 1;\n while (1)\n res <<= 1;\n printf(\"%d\\\\n\", res);\n}\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<pii> vpii;\ntemplate <typename T, typename S> inline bool upmin(T &a, const S &b) {\n return a > b ? a = b, 1 : 0;\n}\ntemplate <typename T, typename S> inline bool upmax(T &a, const S &b) {\n return a < b ? a = b, 1 : 0;\n}\ntemplate <typename N, typename PN> inline N flo(N a, PN b) {\n return a >= 0 ? a \/ b : -((-a - 1) \/ b) - 1;\n}\ntemplate <typename N, typename PN> inline N cei(N a, PN b) {\n return a > 0 ? (a - 1) \/ b + 1 : -(-a \/ b);\n}\ntemplate <typename N> N gcd(N a, N b) { return b ? gcd(b, a % b) : a; }\ntemplate <typename N> inline int sgn(N a) {\n return a > 0 ? 1 : (a < 0 ? -1 : 0);\n}\n#if ((_WIN32 || __WIN32__) && __cplusplus < 201103L)\n#define lld \"%I64d\"\n#else\n#define lld \"%lld\"\n#endif\ninline void gn(long long &x) {\n int sg = 1;\n char c;\n while (((c = getchar()) < '0' || c > '9') && c != '-')\n ;\n c == '-' ? (sg = -1, x = 0) : (x = c - '0');\n while ((c = getchar()) >= '0' && c <= '9')\n x = x * 10 + c - '0';\n x *= sg;\n}\ninline void gn(int &x) {\n long long t;\n gn(t);\n x = t;\n}\ninline void gn(unsigned long long &x) {\n long long t;\n gn(t);\n x = t;\n}\ninline void gn(double &x) {\n double t;\n scanf(\"%lf\", &t);\n x = t;\n}\ninline void gn(long double &x) {\n double t;\n scanf(\"%lf\", &t);\n x = t;\n}\ninline void gs(char *s) { scanf(\"%s\", s); }\ninline void gc(char &c) {\n while ((c = getchar()) > 126 || c < 33)\n ;\n}\ninline void pc(char c) { putchar(c); }\n#ifdef JCVB\n#define debug(...) fprintf(stderr, __VA_ARGS__)\n#else\n#define debug(...)\n#endif\ntypedef long long ll;\ntypedef double db;\ninline ll sqr(ll a) { return a * a; }\ninline db sqrf(db a) { return a * a; }\nconst int inf = 0x3f3f3f3f;\n\/\/ const ll inf=0x3f3f3f3f3f3f3f3fll;\nconst db pi = 3.14159265358979323846264338327950288L;\nconst db eps = 1e-6;\nconst int mo = 1e9 + 7;\n\/\/ int qp(int a,ll b){int\n\/\/ n=1;do{if(b&1)n=1ll*n*a%mo;a=1ll*a*a%mo;}while(b>>=1);return n;}\n\nconst int TREE_MAXV = 3000 + 5;\nstruct edge {\n int v, next;\n} e[TREE_MAXV * 2];\nint g[TREE_MAXV], etot;\nint qu[TREE_MAXV], pre[TREE_MAXV];\nint h[33333];\nint n;\nvoid ae(int u, int v) {\n e[etot].v = v;\n e[etot].next = g[u];\n g[u] = etot++;\n}\n\nint bel[33333];\nvoid bfs(int rt) {\n int p = 0, q = 0;\n pre[rt] = 0;\n h[rt] = 0;\n qu[q++] = rt;\n while (p != q) {\n int u = qu[p++];\n for (int i = g[u]; ~i; i = e[i].next)\n if (e[i].v != pre[u]) {\n pre[e[i].v] = u;\n bel[e[i].v] |= bel[u];\n h[e[i].v] = h[u] + 1;\n qu[q++] = e[i].v;\n }\n }\n}\nvoid tree_init() {\n static bool ini = 0;\n if (!ini) {\n ini = 1;\n memset(g, -1, sizeof(g));\n } else {\n for (int i = 0; i <= n; i++)\n g[i] = -1;\n }\n etot = 0;\n}\nvoid readedge() {\n for (int i = 1; i < n; i++) {\n int x, y;\n gn(x);\n gn(y);\n ae(x, y);\n ae(y, x);\n }\n}\n\nint boun[2222], to[2222];\nconst int zer = 1111;\nint f[1111][2222];\n\nint dp() {\n cl(f);\n for (int i = n - 1; i >= 0; i--) {\n int u = qu[i];\n\n for (int j = to[u] - boun[u]; j <= to[u] + boun[u]; j++) {\n f[u][j + zer] = 1;\n forg(t, g[u]) if (e[t].v != pre[u])\n mmo(f[u][j + zer], (f[e[t].v][j - 1 + zer] + f[e[t].v][j + 1 + zer]));\n }\n }\n int ret = 0;\n rep(t, 0, 2222) upmo(ret, f[qu[0]][t]);\n return ret;\n}\n\nint main() {\n#ifdef JCVB\n \/\/ freopen(\"1.in\",\"r\",stdin);\n \/\/ freopen(\"1.out\",\"w\",stdout);\n int _time_jc = clock();\n#endif\n gn(n);\n tree_init();\n readedge();\n\n static int dis1[2222];\n\n bfs(1);\n int ma = 1;\n rep(u, 2, n + 1) if (h[u] > h[ma]) ma = u;\n bfs(ma);\n int mav = 1;\n rep(u, 1, n + 1) if (h[u] > h[mav]) mav = u;\n\n bfs(mav);\n rep(i, 1, n + 1) dis1[i] = h[i];\n bfs(ma);\n int r;\n\n r = cei(h[mav], 2);\n int rt = 0, rt2 = 0;\n\n if (h[mav] % 2 == 0) {\n rep(i, 1, n + 1) {\n if (dis1[i] == h[i] && h[i] == h[mav] \/ 2)\n rt = i;\n }\n } else {\n rep(i, 1, n + 1) {\n if (dis1[i] == h[mav] \/ 2 && h[i] == (h[mav] + 1) \/ 2)\n rt = i;\n if (dis1[i] == (h[mav] + 1) \/ 2 && h[i] == (h[mav] + 0) \/ 2)\n rt2 = i;\n }\n }\n\n bel[rt2] = 1;\n bfs(rt);\n\n int ans = 0;\n if (rt2 == 0) {\n rep(u, 1, n + 1) boun[u] = r - h[u], to[u] = 0;\n upmo(ans, dp());\n } else {\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (bel[u]) {\n to[u] = 0;\n boun[u] = d;\n } else {\n to[u] = 0;\n boun[u] = d + 1;\n }\n }\n upmo(ans, dp());\n \/* rep(u,1,n+1){ *\/\n \/* \tint d; *\/\n \/* \tif(!bel[u])d=r-1-h[u];else d=r-h[u]; *\/\n \/* \tif(bel[u]){ *\/\n \/* \t\tto[u]=0; *\/\n \/* \t\tboun[u]=d; *\/\n \/* \t}else{ *\/\n \/* \t\tto[u]=0; *\/\n \/* \t\tboun[u]=d+1; *\/\n \/* \t\tif(d==0){ *\/\n \/* \t\t\tto[u]=1; *\/\n \/* \t\t\tboun[u]=0; *\/\n \/* \t\t} *\/\n \/* \t} *\/\n \/* } *\/\n \/* upmo(ans,-dp()); *\/\n\n \/* rep(u,1,n+1){ *\/\n \/* \tint d; *\/\n \/* \tif(!bel[u])d=r-1-h[u];else d=r-h[u]; *\/\n \/* \tif(bel[u]){ *\/\n \/* \t\tto[u]=0; *\/\n \/* \t\tboun[u]=d; *\/\n \/* \t}else{ *\/\n \/* \t\tto[u]=0; *\/\n \/* \t\tboun[u]=d+1; *\/\n \/* \t\tif(d==0){ *\/\n \/* \t\t\tto[u]=-1; *\/\n \/* \t\t\tboun[u]=0; *\/\n \/* \t\t} *\/\n \/* \t} *\/\n \/* } *\/\n \/* upmo(ans,-dp()); *\/\n\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (bel[u]) {\n to[u] = 0;\n boun[u] = d + 1;\n } else {\n to[u] = 0;\n boun[u] = d;\n }\n }\n upmo(ans, dp());\n\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (!bel[u]) {\n to[u] = 0;\n boun[u] = d;\n } else {\n to[u] = 0;\n boun[u] = d + 1;\n if (d == 0) {\n to[u] = 1;\n boun[u] = 0;\n }\n }\n }\n \/\/ upmo(ans,-dp());\n\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (!bel[u]) {\n to[u] = 0;\n boun[u] = d;\n } else {\n to[u] = 0;\n boun[u] = d + 1;\n if (d == 0) {\n to[u] = -1;\n boun[u] = 0;\n }\n }\n }\n \/\/ upmo(ans,-dp());\n \/* rep(u,1,n+1){ *\/\n \/* \tint d; *\/\n \/* \tif(!bel[u])d=r-1-h[u];else d=r-h[u]; *\/\n \/* \tif(!bel[u]){ *\/\n \/* \t\tto[u]=1; *\/\n \/* \t\tboun[u]=d+1; *\/\n \/* \t\tif(d==0){ *\/\n \/* \t\t\tto[u]=0; *\/\n \/* \t\t\tboun[u]=0; *\/\n \/* \t\t} *\/\n \/* \t}else{ *\/\n \/* \t\tto[u]=0; *\/\n \/* \t\tboun[u]=d+1; *\/\n \/* \t\tif(d==0){ *\/\n \/* \t\t\tto[u]=1; *\/\n \/* \t\t\tboun[u]=0; *\/\n \/* \t\t} *\/\n \/* \t} *\/\n \/* } *\/\n \/* upmo(ans,dp()); *\/\n \/* rep(u,1,n+1){ *\/\n \/* \tint d; *\/\n \/* \tif(!bel[u])d=r-1-h[u];else d=r-h[u]; *\/\n \/* \tif(bel[u]){ *\/\n \/* \t\tto[u]=1; *\/\n \/* \t\tboun[u]=d+1; *\/\n \/* \t\tif(d==0){ *\/\n \/* \t\t\tto[u]=0; *\/\n \/* \t\t\tboun[u]=0; *\/\n \/* \t\t} *\/\n \/* \t}else{ *\/\n \/* \t\tto[u]=0; *\/\n \/* \t\tboun[u]=d+1; *\/\n \/* \t\tif(d==0){ *\/\n \/* \t\t\tto[u]=1; *\/\n \/* \t\t\tboun[u]=0; *\/\n \/* \t\t} *\/\n \/* \t} *\/\n \/* } *\/\n \/* upmo(ans,dp()); *\/\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (!bel[u]) {\n to[u] = 0;\n boun[u] = d;\n } else {\n to[u] = 1;\n boun[u] = d;\n }\n }\n upmo(ans, -dp());\n rep(u, 1, n + 1) {\n int d;\n if (!bel[u])\n d = r - 1 - h[u];\n else\n d = r - h[u];\n if (bel[u]) {\n to[u] = 0;\n boun[u] = d;\n } else {\n to[u] = 1;\n boun[u] = d;\n }\n }\n upmo(ans, -dp());\n }\n\n printf(\"%d\\\\n\", ans);\n#ifdef JCVB\n debug(\"time: %d\\\\n\", int(clock() - _time_jc));\n#endif\n return 0;\n}\n","change":"replace","i1":249,"i2":409,"j1":249,"j2":426,"error":"WA","stderr":null,"stdout":"0\n2\n"}
{"problem_id":"p03794","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define pii pair<int, int>\n#define fi first\n#define se second\n#define mp make_pair\n#define poly vector<ll>\n#define For(i, l, r) for (int i = (int)(l); i <= (int)(r); i++)\n#define Rep(i, r, l) for (int i = (int)(r); i >= (int)(l); i--)\n#define pb push_back\ninline char gc() {\n static char buf[100000], *p1 = buf, *p2 = buf;\n return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)\n ? EOF\n : *p1++;\n}\n#define gc getchar\ninline ll read() {\n ll x = 0;\n char ch = gc();\n bool positive = 1;\n for (; !isdigit(ch); ch = gc())\n if (ch == '-')\n positive = 0;\n for (; isdigit(ch); ch = gc())\n x = x * 10 + ch - '0';\n return positive ? x : -x;\n}\ninline void write(ll x) {\n if (x < 0) {\n x = -x;\n putchar('-');\n }\n if (x >= 10)\n write(x \/ 10);\n putchar('0' + x % 10);\n}\ninline void writeln(ll x) {\n write(x);\n puts(\"\");\n}\ninline void writep(ll x) {\n write(x);\n putchar(' ');\n}\ninline ull rnd() { return ((ull)rand() << 30 ^ rand()) << 4 | rand() % 4; }\nconst int N = 1005, mo = 1e9 + 7;\nint dep[N], fa[N], D;\npoly v[N];\nvoid dfs(int u) {\n dep[u] = dep[fa[u]] + 1;\n for (auto k : v[u]) {\n if (k == fa[u])\n continue;\n fa[k] = u;\n dfs(k);\n }\n}\nint f[N][N << 1];\nvoid dfs(int u, int fa, int D, int dep, int t) {\n int l = dep - D + t, r = D - dep + t;\n For(i, l + 505, r + 505) f[u][i] = 1;\n for (auto k : v[u]) {\n if (k == fa)\n continue;\n dfs(k, u, D, dep + 1, t);\n For(i, l + 505, r + 505) {\n int ssw = (f[k][i - 1] + f[k][i + 1]) % mo;\n f[u][i] = (ll)f[u][i] * ssw % mo;\n }\n }\n}\nint solve1(int u) {\n dfs(u, 0, D, 0, 1);\n int res = 0;\n For(i, 0, 1000) res = (res + f[u][i]) % mo;\n return res;\n}\nint solve2(int u, int v, int t) {\n memset(f, 0, sizeof(f));\n dfs(u, v, D + (!t), 0, 0);\n dfs(v, u, D, 0, t);\n int res = 0;\n For(i, 1, 1000) {\n int ssw = (f[v][i - 1] + f[v][i + 1]) % mo;\n res = (res + (ll)f[u][i] * ssw) % mo;\n }\n return res;\n}\nint main() {\n int n = read();\n read();\n For(i, 1, n - 1) {\n int x = read(), y = read();\n v[x].pb(y);\n v[y].pb(x);\n }\n dep[0] = -1;\n int rt = 0;\n dfs(1);\n For(i, 1, n) if (dep[i] > dep[rt]) rt = i;\n memset(fa, 0, sizeof(fa));\n dfs(rt);\n For(i, rt = 1, n) if (dep[i] > dep[rt]) rt = i;\n if (dep[rt] % 2 == 0) {\n D = dep[rt] \/ 2;\n For(i, 1, D) rt = fa[rt];\n cout << solve1(rt);\n } else {\n D = dep[rt] \/ 2;\n For(i, 1, D) rt = fa[rt];\n int u = rt, v = fa[rt];\n int res = (solve2(u, v, 0) + solve2(v, u, 0)) % mo;\n int ssw = (solve2(u, v, 1) + solve2(u, v, -1)) % mo;\n res = (res - ssw + mo) % mo;\n cout << res;\n }\n}","fail":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define pii pair<int, int>\n#define fi first\n#define se second\n#define mp make_pair\n#define poly vector<ll>\n#define For(i, l, r) for (int i = (int)(l); i <= (int)(r); i++)\n#define Rep(i, r, l) for (int i = (int)(r); i >= (int)(l); i--)\n#define pb push_back\ninline char gc() {\n static char buf[100000], *p1 = buf, *p2 = buf;\n return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)\n ? EOF\n : *p1++;\n}\n#define gc getchar\ninline ll read() {\n ll x = 0;\n char ch = gc();\n bool positive = 1;\n for (; !isdigit(ch); ch = gc())\n if (ch == '-')\n positive = 0;\n for (; isdigit(ch); ch = gc())\n x = x * 10 + ch - '0';\n return positive ? x : -x;\n}\ninline void write(ll x) {\n if (x < 0) {\n x = -x;\n putchar('-');\n }\n if (x >= 10)\n write(x \/ 10);\n putchar('0' + x % 10);\n}\ninline void writeln(ll x) {\n write(x);\n puts(\"\");\n}\ninline void writep(ll x) {\n write(x);\n putchar(' ');\n}\ninline ull rnd() { return ((ull)rand() << 30 ^ rand()) << 4 | rand() % 4; }\nconst int N = 2005, mo = 1e9 + 7;\nint dep[N], fa[N], D;\npoly v[N];\nvoid dfs(int u) {\n dep[u] = dep[fa[u]] + 1;\n for (auto k : v[u]) {\n if (k == fa[u])\n continue;\n fa[k] = u;\n dfs(k);\n }\n}\nint f[N][N << 1];\nvoid dfs(int u, int fa, int D, int dep, int t) {\n int l = dep - D + t, r = D - dep + t;\n For(i, l + 505, r + 505) f[u][i] = 1;\n for (auto k : v[u]) {\n if (k == fa)\n continue;\n dfs(k, u, D, dep + 1, t);\n For(i, l + 505, r + 505) {\n int ssw = (f[k][i - 1] + f[k][i + 1]) % mo;\n f[u][i] = (ll)f[u][i] * ssw % mo;\n }\n }\n}\nint solve1(int u) {\n dfs(u, 0, D, 0, 1);\n int res = 0;\n For(i, 0, 1005) res = (res + f[u][i]) % mo;\n return res;\n}\nint solve2(int u, int v, int t) {\n memset(f, 0, sizeof(f));\n dfs(u, v, D + (!t), 0, 0);\n dfs(v, u, D, 0, t);\n int res = 0;\n For(i, 1, 1005) {\n int ssw = (f[v][i - 1] + f[v][i + 1]) % mo;\n res = (res + (ll)f[u][i] * ssw) % mo;\n }\n return res;\n}\nint main() {\n int n = read();\n For(i, 1, n - 1) {\n int x = read(), y = read();\n v[x].pb(y);\n v[y].pb(x);\n }\n dep[0] = -1;\n int rt = 0;\n dfs(1);\n For(i, 1, n) if (dep[i] > dep[rt]) rt = i;\n memset(fa, 0, sizeof(fa));\n dfs(rt);\n For(i, rt = 1, n) if (dep[i] > dep[rt]) rt = i;\n if (dep[rt] % 2 == 0) {\n D = dep[rt] \/ 2;\n For(i, 1, D) rt = fa[rt];\n cout << solve1(rt);\n } else {\n D = dep[rt] \/ 2;\n For(i, 1, D) rt = fa[rt];\n int u = rt, v = fa[rt];\n int res = (solve2(u, v, 0) + solve2(v, u, 0)) % mo;\n int ssw = (solve2(u, v, 1) + solve2(u, v, -1)) % mo;\n res = (res - ssw + mo) % mo;\n cout << res;\n }\n}","change":"replace","i1":49,"i2":95,"j1":49,"j2":94,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03794","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef signed long long ll;\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define FOR(x, to) for (x = 0; x < (to); x++)\n#define FORR(x, arr) for (auto &x : arr)\n#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)\n#define ALL(a) (a.begin()), (a.end())\n#define ZERO(a) memset(a, 0, sizeof(a))\n#define MINUS(a) memset(a, 0xff, sizeof(a))\n\/\/-------------------------------------------------------\n\nint N;\nvector<vector<int>> E;\nvector<int> D;\nll dp[1010][1010];\nll mo = 1000000007;\n\npair<int, int> farthest(vector<vector<int>> &E, int cur, int pre, int d,\n vector<int> &D) {\n D[cur] = d;\n pair<int, int> r = {d, cur};\n FORR(e, E[cur]) if (e != pre) r = max(r, farthest(E, e, cur, d + 1, D));\n return r;\n}\n\npair<int, vector<int>> diameter(vector<vector<int>> &E) { \/\/ diameter,center\n vector<int> D[2];\n D[0].resize(E.size());\n D[1].resize(E.size());\n auto v1 = farthest(E, 0, 0, 0, D[0]);\n auto v2 = farthest(E, v1.second, v1.second, 0, D[0]);\n farthest(E, v2.second, v2.second, 0, D[1]);\n pair<int, vector<int>> R;\n R.first = v2.first;\n for (int i = E.size() - 1; i >= 0; i--)\n if (D[0][i] + D[1][i] == R.first && abs(D[0][i] - D[1][i]) <= 1)\n R.second.push_back(i);\n return R;\n}\n\nvoid dfs(int cur, int pre, int d, int md, int p1, int p2) {\n if (d == md) {\n dp[cur][505] = 1;\n } else {\n FORR(e, E[cur]) if (e != pre) dfs(e, cur, d + 1, md, p1, p2);\n for (int x = -503; x <= 503; x++)\n if (abs(x + p2) <= md - d + p1) {\n dp[cur][505 + x] = 1;\n FORR(e, E[cur])\n if (e != pre)(dp[cur][505 + x] *=\n (dp[e][505 + x + 1] + dp[e][505 + x - 1])) %= mo;\n }\n }\n}\n\nvoid solve() {\n int i, j, k, l, r, x, y;\n string s;\n\n cin >> N;\n E.resize(N);\n FOR(i, N - 1) {\n cin >> x >> y;\n E[x - 1].push_back(y - 1);\n E[y - 1].push_back(x - 1);\n }\n\n auto dia = diameter(E);\n if (dia.first % 2 == 0) {\n dfs(dia.second[0], -1, 0, dia.first \/ 2, 0, 0);\n cout << accumulate(dp[dia.second[0]], dp[dia.second[0]] + 1010, 0LL) % mo\n << endl;\n } else {\n assert(0);\n \/*\n dfs(dia.second[0],dia.second[1],0,dia.first\/2,0,1);\n dfs(dia.second[1],dia.second[0],1,dia.first\/2,0,0);\n *\/\n }\n}\n\nint main(int argc, char **argv) {\n string s;\n int i;\n if (argc == 1)\n ios::sync_with_stdio(false), cin.tie(0);\n FOR(i, argc - 1) s += argv[i + 1], s += '\\\\n';\n FOR(i, s.size()) ungetc(s[s.size() - 1 - i], stdin);\n solve();\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef signed long long ll;\n\n#undef _P\n#define _P(...) (void)printf(__VA_ARGS__)\n#define FOR(x, to) for (x = 0; x < (to); x++)\n#define FORR(x, arr) for (auto &x : arr)\n#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)\n#define ALL(a) (a.begin()), (a.end())\n#define ZERO(a) memset(a, 0, sizeof(a))\n#define MINUS(a) memset(a, 0xff, sizeof(a))\n\/\/-------------------------------------------------------\n\nint N;\nvector<vector<int>> E;\nvector<int> D;\nll dp[1020][1020];\nll mo = 1000000007;\n\npair<int, int> farthest(vector<vector<int>> &E, int cur, int pre, int d,\n vector<int> &D) {\n D[cur] = d;\n pair<int, int> r = {d, cur};\n FORR(e, E[cur]) if (e != pre) r = max(r, farthest(E, e, cur, d + 1, D));\n return r;\n}\n\npair<int, vector<int>> diameter(vector<vector<int>> &E) { \/\/ diameter,center\n vector<int> D[2];\n D[0].resize(E.size());\n D[1].resize(E.size());\n auto v1 = farthest(E, 0, 0, 0, D[0]);\n auto v2 = farthest(E, v1.second, v1.second, 0, D[0]);\n farthest(E, v2.second, v2.second, 0, D[1]);\n pair<int, vector<int>> R;\n R.first = v2.first;\n for (int i = E.size() - 1; i >= 0; i--)\n if (D[0][i] + D[1][i] == R.first && abs(D[0][i] - D[1][i]) <= 1)\n R.second.push_back(i);\n return R;\n}\n\nvoid dfs(int cur, int pre, int d, int md, int p) {\n FORR(e, E[cur]) if (e != pre) dfs(e, cur, d + 1, md, p);\n for (int x = -503; x <= 503; x++)\n if ((abs(x + p) <= md - d) && (abs(x - p) <= md - d)) {\n dp[cur][505 + x] = 1;\n FORR(e, E[cur])\n if (e != pre)(dp[cur][505 + x] *=\n (dp[e][505 + x + 1] + dp[e][505 + x - 1])) %= mo;\n }\n}\n\nvoid solve() {\n int i, j, k, l, r, x, y;\n string s;\n\n cin >> N;\n E.resize(N);\n FOR(i, N - 1) {\n cin >> x >> y;\n E[x - 1].push_back(y - 1);\n E[y - 1].push_back(x - 1);\n }\n\n auto dia = diameter(E);\n if (dia.first % 2 == 0) {\n dfs(dia.second[0], -1, 0, dia.first \/ 2, 0);\n cout << accumulate(dp[dia.second[0]], dp[dia.second[0]] + 1010, 0LL) % mo\n << endl;\n } else {\n ll ret = 0;\n dfs(dia.second[0], dia.second[1], 0, dia.first \/ 2, 0);\n dfs(dia.second[1], dia.second[0], 0, dia.first \/ 2 + 1, 0);\n for (x = 3; x <= 1008; x++)\n (ret += dp[dia.second[0]][x] *\n (dp[dia.second[1]][x + 1] + dp[dia.second[1]][x - 1])) %= mo;\n\n ZERO(dp);\n dfs(dia.second[0], dia.second[1], 0, dia.first \/ 2 + 1, 0);\n dfs(dia.second[1], dia.second[0], 0, dia.first \/ 2, 0);\n for (x = 3; x <= 1008; x++)\n (ret += dp[dia.second[0]][x] *\n (dp[dia.second[1]][x + 1] + dp[dia.second[1]][x - 1])) %= mo;\n\n ZERO(dp);\n dfs(dia.second[0], dia.second[1], 0, dia.first \/ 2, 0);\n dfs(dia.second[1], dia.second[0], 0, dia.first \/ 2, 0);\n for (i = 3; i <= 1008; i++)\n ret -= 2 * dp[dia.second[0]][i] * dp[dia.second[1]][i] % mo;\n for (i = 3; i <= 1008; i++)\n ret -= dp[dia.second[0]][i] * dp[dia.second[1]][i + 2] % mo;\n for (i = 3; i <= 1008; i++)\n ret -= dp[dia.second[0]][i] * dp[dia.second[1]][i - 2] % mo;\n cout << (ret % mo + mo) % mo << endl;\n }\n}\n\nint main(int argc, char **argv) {\n string s;\n int i;\n if (argc == 1)\n ios::sync_with_stdio(false), cin.tie(0);\n FOR(i, argc - 1) s += argv[i + 1], s += '\\\\n';\n FOR(i, s.size()) ungetc(s[s.size() - 1 - i], stdin);\n solve();\n return 0;\n}\n","change":"replace","i1":17,"i2":81,"j1":17,"j2":96,"error":"0","stderr":null,"stdout":"2\n"}
{"problem_id":"p03794","language":"C++","original_status":"Memory Limit Exceeded","pass":"#include <bits\/stdc++.h>\n#define syosu(x) fixed << setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<double, double> pdd;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<int, P> pip;\ntypedef vector<pip> vip;\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 60;\nconst double pi = acos(-1);\nconst double eps = 1e-9;\nconst ll mod = 1e9 + 7;\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\n\nint n, N = 0, M;\nvvi g;\nvi a, b;\nvector<vvl> dp;\n\nP dfs(int v, int d, int w) {\n P p = {d, v};\n for (auto u : g[v])\n if (u != w)\n p = max(p, dfs(u, d + 1, v));\n return p;\n}\n\nbool DFS(int v, int w, int p) {\n bool B = 0;\n if (v == w)\n B = 1;\n for (auto u : g[v])\n if (u != p) {\n B |= DFS(u, w, v);\n }\n if (B) {\n a.push_back(v);\n b[v]++;\n N++;\n }\n return B;\n}\n\nint Rec(int v, int p) {\n int D = 1, B = 0;\n vvl DP;\n for (auto u : g[v])\n if (u != p) {\n int d = Rec(u, v), D_ = D;\n D = max(D, d + 1);\n vvl DP_(D, vl(D));\n if (!B) {\n for (int i = 0; i < d; i++)\n for (int j = 0; j < d; j++) {\n (DP_[i + 1][j] += dp[u][i][j]) %= mod;\n (DP_[i][j + 1] += dp[u][i][j]) %= mod;\n }\n B = 1;\n } else {\n for (int i = 0; i < D_; i++)\n for (int j = 0; j < D_; j++)\n if (DP[i][j]) {\n for (int k = 0; k < min(d, M - j + 1); k++)\n for (int l = 0; l < min(d, M - i + 1); l++) {\n if (j + k + 1 <= M)\n (DP_[max(i, k + 1)][max(j, l)] += DP[i][j] * dp[u][k][l]) %=\n mod;\n if (i + l + 1 <= M)\n (DP_[max(i, k)][max(j, l + 1)] += DP[i][j] * dp[u][k][l]) %=\n mod;\n }\n }\n }\n DP = DP_;\n }\n if (D == 1) {\n DP = vvl(1, vl(1));\n DP[0][0]++;\n }\n dp[v] = DP;\n return D;\n}\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cin >> n;\n b = vi(n);\n g = vvi(n);\n dp = vector<vvl>(n);\n for (int i = 1; i < n; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n int L = dfs(0, 0, -1).second, R = dfs(L, 0, -1).second;\n DFS(L, R, -1);\n M = N \/ 2;\n ll C = a[N \/ 2], res = 0;\n Rec(C, -1);\n for (int i = 0; i <= M; i++)\n for (int j = 0; j <= M; j++)\n (res += dp[C][i][j]) %= mod;\n cout << res << endl;\n}","fail":"#include <bits\/stdc++.h>\n#define syosu(x) fixed << setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<double, double> pdd;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<int, P> pip;\ntypedef vector<pip> vip;\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 60;\nconst double pi = acos(-1);\nconst double eps = 1e-9;\nconst ll mod = 1e9 + 7;\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\n\nint n, N = 0, M;\nvvi g;\nvi a, b;\nvector<vvl> dp;\n\nP dfs(int v, int d, int w) {\n P p = {d, v};\n for (auto u : g[v])\n if (u != w)\n p = max(p, dfs(u, d + 1, v));\n return p;\n}\n\nbool DFS(int v, int w, int p) {\n bool B = 0;\n if (v == w)\n B = 1;\n for (auto u : g[v])\n if (u != p) {\n B |= DFS(u, w, v);\n }\n if (B) {\n a.push_back(v);\n b[v]++;\n N++;\n }\n return B;\n}\n\nint Rec(int v, int p) {\n int D = 1, B = 0;\n vvl DP;\n for (auto u : g[v])\n if (u != p) {\n int d = Rec(u, v), D_ = D;\n D = max(D, d + 1);\n vvl DP_(D, vl(D));\n if (!B) {\n for (int i = 0; i < d; i++)\n for (int j = 0; j < d; j++) {\n (DP_[i + 1][j] += dp[u][i][j]) %= mod;\n (DP_[i][j + 1] += dp[u][i][j]) %= mod;\n }\n B = 1;\n } else {\n for (int i = 0; i < D_; i++)\n for (int j = 0; j < D_; j++)\n if (DP[i][j]) {\n for (int k = 0; k < min(d, M - j + 1); k++)\n for (int l = 0; l < min(d, M - i + 1); l++) {\n if (j + k + 1 <= M)\n (DP_[max(i, k + 1)][max(j, l)] += DP[i][j] * dp[u][k][l]) %=\n mod;\n if (i + l + 1 <= M)\n (DP_[max(i, k)][max(j, l + 1)] += DP[i][j] * dp[u][k][l]) %=\n mod;\n }\n }\n }\n DP = DP_;\n }\n for (auto u : g[v])\n if (u != p)\n dp[u].clear();\n if (D == 1) {\n DP = vvl(1, vl(1));\n DP[0][0]++;\n }\n dp[v] = DP;\n return D;\n}\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cin >> n;\n b = vi(n);\n g = vvi(n);\n dp = vector<vvl>(n);\n for (int i = 1; i < n; i++) {\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n int L = dfs(0, 0, -1).second, R = dfs(L, 0, -1).second;\n DFS(L, R, -1);\n M = N \/ 2;\n ll C = a[N \/ 2], res = 0;\n Rec(C, -1);\n for (int i = 0; i <= M; i++)\n for (int j = 0; j <= M; j++)\n (res += dp[C][i][j]) %= mod;\n cout << res << endl;\n}","change":"insert","i1":88,"i2":88,"j1":88,"j2":91,"error":"MLE","stderr":null,"stdout":null}
{"problem_id":"p03794","language":"C++","original_status":"Runtime Error","pass":"\/\/ In the Name of God\n\/\/ Ya Ali\n\n#include <bits\/stdc++.h>\n\n#define int long long\n\n#define pb push_back\n\n#define err(A) cout << #A << \" = \" << (A) << endl\n\nusing namespace std;\n\nconst int M = 1e9 + 7 + 0;\nconst int maxn = 1024;\n\nint n;\n\nvector<int> g[maxn];\n\nint lvl[maxn];\n\nint d0[maxn];\nint d1[maxn];\n\nint D, D1, D2;\nint far;\n\nint r0, r1;\n\nint dp[maxn][maxn \/ 2];\nint cp[maxn][maxn \/ 2];\n\nint ans;\n\nvoid pfs(int v, int par = n) {\n lvl[v] = lvl[par] + 1;\n for (int u : g[v])\n if (u != par)\n pfs(u, v);\n if (lvl[v] > lvl[far])\n far = v;\n}\n\nvoid dfs(int v, int par = n) {\n lvl[v] = lvl[par] + 1;\n for (int i = 0; i <= D2; i++) {\n if (D1 - lvl[v] >= i)\n dp[v][i] = 1;\n if (D1 - lvl[v] >= i - 1)\n cp[v][i] = 1;\n }\n for (int u : g[v])\n if (u != par) {\n dfs(u, v);\n for (int i = 0; i <= D2; i++) {\n (dp[v][i] *= dp[u][i] + (i ? dp[u][i - 1] : 0)) %= M;\n (cp[v][i] *= cp[u][i] + (i ? cp[u][i - 1] : 0)) %= M;\n }\n }\n}\n\nint32_t main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n cin >> n;\n for (int v, u, i = 0; i < n - 1; i++) {\n cin >> v >> u;\n v--, u--;\n g[v].pb(u);\n g[u].pb(v);\n }\n\n lvl[n] = -1;\n pfs(far);\n pfs(far);\n for (int i = 0; i < n; i++)\n d0[i] = lvl[i];\n pfs(far);\n for (int i = 0; i < n; i++)\n d1[i] = lvl[i];\n\n D = lvl[far];\n D1 = (D + 0) \/ 2;\n D2 = (D + 1) \/ 2;\n\n if (D & 1) {\n for (int i = 0; i < n; i++)\n if (d0[i] + d1[i] == D)\n if (d0[i] == d1[i] - 1)\n r0 = i;\n else if (d0[i] == d1[i] + 1)\n r1 = i;\n lvl[r1] = -1;\n dfs(r0, r1);\n lvl[r0] = -1;\n dfs(r1, r0);\n for (int i = 0; i <= D2; i++) {\n ans += dp[r0][i] * cp[r1][i] % M;\n ans += cp[r0][i + 1] * dp[r1][i] % M;\n ans -= dp[r0][i] * dp[r1][i] % M;\n ans += dp[r1][i] * cp[r0][i] % M;\n ans += cp[r1][i + 1] * dp[r0][i] % M;\n ans -= dp[r1][i] * dp[r0][i] % M;\n ans -= dp[r1][i] * dp[r0][i] % M;\n ans %= M;\n return 1;\n }\n } else {\n for (int i = 0; i < n; i++)\n if (d0[i] + d1[i] == D and d0[i] == d1[i])\n r0 = i;\n dfs(r0);\n for (int i = 0; i <= D2; i++)\n ans += dp[r0][i];\n }\n\n ans = (ans % M + M) % M;\n\n cout << ans << endl;\n\n return 0;\n}\n","fail":"\/\/ In the Name of God\n\/\/ Ya Ali\n\n#include <bits\/stdc++.h>\n\n#define int long long\n\n#define pb push_back\n\n#define err(A) cout << #A << \" = \" << (A) << endl\n\nusing namespace std;\n\nconst int M = 1e9 + 7 + 0;\nconst int maxn = 1024;\n\nint n;\n\nvector<int> g[maxn];\n\nint lvl[maxn];\n\nint d0[maxn];\nint d1[maxn];\n\nint D, D1, D2;\nint far;\n\nint r0, r1;\n\nint dp[maxn][maxn \/ 2];\nint cp[maxn][maxn \/ 2];\n\nint ans;\n\nvoid pfs(int v, int par = n) {\n lvl[v] = lvl[par] + 1;\n for (int u : g[v])\n if (u != par)\n pfs(u, v);\n if (lvl[v] > lvl[far])\n far = v;\n}\n\nvoid dfs(int v, int par = n) {\n lvl[v] = lvl[par] + 1;\n for (int i = 0; i <= D2; i++) {\n if (D1 - lvl[v] >= i)\n dp[v][i] = 1;\n if (D1 - lvl[v] >= i - 1)\n cp[v][i] = 1;\n }\n for (int u : g[v])\n if (u != par) {\n dfs(u, v);\n for (int i = 0; i <= D2; i++) {\n (dp[v][i] *= dp[u][i] + (i ? dp[u][i - 1] : 0)) %= M;\n (cp[v][i] *= cp[u][i] + (i ? cp[u][i - 1] : 0)) %= M;\n }\n }\n}\n\nint32_t main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n cin >> n;\n for (int v, u, i = 0; i < n - 1; i++) {\n cin >> v >> u;\n v--, u--;\n g[v].pb(u);\n g[u].pb(v);\n }\n\n lvl[n] = -1;\n pfs(far);\n pfs(far);\n for (int i = 0; i < n; i++)\n d0[i] = lvl[i];\n pfs(far);\n for (int i = 0; i < n; i++)\n d1[i] = lvl[i];\n\n D = lvl[far];\n D1 = (D + 0) \/ 2;\n D2 = (D + 1) \/ 2;\n\n if (D & 1) {\n for (int i = 0; i < n; i++)\n if (d0[i] + d1[i] == D)\n if (d0[i] == d1[i] - 1)\n r0 = i;\n else if (d0[i] == d1[i] + 1)\n r1 = i;\n lvl[r1] = -1;\n dfs(r0, r1);\n lvl[r0] = -1;\n dfs(r1, r0);\n for (int i = 0; i <= D2; i++) {\n ans += dp[r0][i] * cp[r1][i] % M;\n ans += cp[r0][i + 1] * dp[r1][i] % M;\n ans -= dp[r0][i] * dp[r1][i] % M;\n ans -= dp[r0][i + 1] * dp[r1][i] % M;\n ans += dp[r1][i] * cp[r0][i] % M;\n ans += cp[r1][i + 1] * dp[r0][i] % M;\n ans -= dp[r1][i] * dp[r0][i] % M;\n ans -= dp[r1][i + 1] * dp[r0][i] % M;\n ans %= M;\n }\n } else {\n for (int i = 0; i < n; i++)\n if (d0[i] + d1[i] == D and d0[i] == d1[i])\n r0 = i;\n dfs(r0);\n for (int i = 0; i <= D2; i++)\n ans += dp[r0][i];\n }\n\n ans = (ans % M + M) % M;\n\n cout << ans << endl;\n\n return 0;\n}\n","change":"replace","i1":102,"i2":108,"j1":102,"j2":108,"error":"0","stderr":null,"stdout":"2\n"}
{"problem_id":"p03794","language":"C++","original_status":"Runtime Error","pass":"#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#endif\n\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\nmt19937 mrand(random_device{}());\n\nint rnd(int x) { return mrand() % x; }\n\ntypedef long double ld;\ntypedef long long ll;\n\n#ifdef DEBUG\n#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)\n#else\n#define eprintf(...) ;\n#endif\n\n#define pb push_back\n#define mp make_pair\n#define sz(x) ((int)(x).size())\n#define TASK \"text\"\n\nconst int inf = (int)1.01e9;\nconst ld eps = 1e-9;\nconst ld pi = acos((ld)-1.0);\n\nconst int mod = (int)1e9 + 7;\n\nvoid add(int &x, int y) {\n if ((x += y) >= mod) {\n x -= mod;\n }\n}\n\nint mult(int x, int y) { return (long long)x * y % mod; }\n\nint myPower(int x, int pw) {\n int res = 1;\n for (; pw; pw >>= 1) {\n if (pw & 1) {\n res = mult(res, x);\n }\n x = mult(x, x);\n }\n return res;\n}\n\nvoid precalc() {}\n\nconst int maxn = (int)1e3 + 10;\nint n;\n\nvector<vector<int>> es;\n\nint read() {\n if (scanf(\"%d\", &n) < 1) {\n return 0;\n }\n es = vector<vector<int>>(n);\n for (int i = 0; i < n - 1; ++i) {\n int s, t;\n scanf(\"%d%d\", &s, &t);\n --s, --t;\n es[s].pb(t), es[t].pb(s);\n }\n return 1;\n}\n\nint dist[maxn];\nint dist1[maxn];\n\nvoid dfs1(int v, int p) {\n for (int u : es[v]) {\n if (u == p) {\n continue;\n }\n dist[u] = dist[v] + 1;\n dfs1(u, v);\n }\n}\n\nint used[maxn];\n\ntypedef vector<vector<int>> vvi;\n\nint cnt[maxn];\n\nvoid dfs2(int v, int p) {\n cnt[v] = 1;\n for (int u : es[v]) {\n if (u == p || used[u]) {\n continue;\n }\n dfs2(u, v);\n cnt[v] += cnt[u];\n }\n}\n\nint diam, D;\n\nvoid adde(vvi &a) {\n int n = sz(a);\n for (int i = 0; i < n; ++i) {\n a[i].pb(0);\n }\n a.pb(vector<int>(n + 1, 0));\n\n for (int i = n - 1; i >= 0; --i) {\n for (int j = n - 1; j >= 0; --j) {\n int x = a[i][j];\n if (!x) {\n continue;\n }\n a[i][j] = 0;\n if (i + 1 <= D) {\n add(a[i + 1][j], x);\n }\n if (i + 1 <= D) {\n add(a[i][j + 1], x);\n }\n }\n }\n}\n\nvoid makesum(vvi &a) {\n for (int i = 0; i < sz(a); ++i) {\n for (int j = 0; j < sz(a); ++j) {\n int &res = a[i][j];\n if (i) {\n add(res, a[i - 1][j]);\n if (j) {\n add(res, mod - a[i - 1][j - 1]);\n }\n }\n if (j) {\n add(res, a[i][j - 1]);\n }\n }\n }\n}\n\nvoid makeone(vvi &a) {\n for (int i = sz(a) - 1; i >= 0; --i) {\n for (int j = sz(a) - 1; j >= 0; --j) {\n int &res = a[i][j];\n if (i) {\n add(res, mod - a[i - 1][j]);\n if (j) {\n add(res, a[i - 1][j - 1]);\n }\n }\n if (j) {\n add(res, mod - a[i][j - 1]);\n }\n }\n }\n}\n\nvoid update(vvi &a, vvi &b) {\n \/*eprintf(\"update:\\\\n\");\n eprintf(\"%d\\\\n\", sz(a));\n for (int i = 0; i < sz(a); ++i) {\n for (int j = 0; j < sz(a); ++j) {\n eprintf(\"%d%c\", a[i][j], \" \\\\n\"[j == sz(a) - 1]);\n }\n }\n eprintf(\"%d\\\\n\", sz(b));\n for (int i = 0; i < sz(b); ++i) {\n for (int j = 0; j < sz(b); ++j) {\n eprintf(\"%d%c\", b[i][j], \" \\\\n\"[j == sz(b) - 1]);\n }\n }*\/\n assert(sz(a) >= sz(b));\n\n makesum(a);\n makesum(b);\n for (int i = 0; i < sz(a); ++i) {\n for (int j = 0; j < sz(a); ++j) {\n a[i][j] = mult(a[i][j], b[min(sz(b) - 1, i)][min(sz(b) - 1, j)]);\n }\n }\n makeone(a);\n}\n\nvvi *dfs3(int v, int p) {\n int u0 = -1;\n for (int u : es[v]) {\n if (u == p || used[u]) {\n continue;\n }\n if (u0 == -1 || cnt[u] > cnt[u0]) {\n u0 = u;\n }\n }\n if (u0 == -1) {\n return new vvi({{1}});\n }\n auto ans = dfs3(u0, v);\n adde(*ans);\n\n for (int u : es[v]) {\n if (u == p || u == u0 || used[u]) {\n continue;\n }\n auto got = dfs3(u, v);\n adde(*got);\n update(*ans, *got);\n }\n return ans;\n}\n\nint ans[maxn];\nint adds[maxn];\n\nvoid solve() {\n dist[0] = 0;\n dfs1(0, -1);\n int v = max_element(dist, dist + n) - dist;\n\n dist[v] = 0;\n dfs1(v, -1);\n int u = max_element(dist, dist + n) - dist;\n diam = dist[u];\n\n memcpy(dist1, dist, sizeof(dist[0]) * n);\n\n dist[u] = 0;\n dfs1(u, -1);\n\n D = (diam + 1) \/ 2;\n \/\/ eprintf(\"diam = %d\\\\n\", diam);\n\n for (int i = 0; i < n; ++i) {\n used[i] = 0;\n }\n int vs[2];\n int k = 0;\n for (int i = 0; i < n; ++i) {\n if (dist[i] + dist1[i] == diam && abs(dist[i] - dist1[i]) <= 1) {\n vs[k++] = i;\n used[i] = 1;\n }\n }\n assert(1 <= k && k <= 2);\n for (int i = 0; i < k; ++i) {\n dfs2(i, -1);\n }\n\n \/\/ eprintf(\"middle %d\\\\n\", vs[0]);\n\n int res = 0;\n if (k == 1) {\n dfs2(vs[0], -1);\n for (int i = 0; i <= D; ++i) {\n ans[i] = 1;\n }\n for (int u : es[vs[0]]) {\n auto &got = *dfs3(u, vs[0]);\n adde(got);\n for (int i = 0; i <= D; ++i) {\n adds[i] = 0;\n }\n for (int i = 0; i < sz(got); ++i) {\n for (int j = 0; j < sz(got); ++j) {\n int cur = got[i][j];\n if (!cur) {\n continue;\n }\n \/\/ eprintf(\"u = %d, (%d,%d) x%d\\\\n\", u, i, j, cur);\n int l = i, r = D - j;\n if (l <= r) {\n \/\/ eprintf(\"[%d..%d]\\\\n\", l, r);\n add(adds[l], cur);\n add(adds[r + 1], mod - cur);\n }\n }\n }\n int bal = 0;\n for (int i = 0; i <= D; ++i) {\n add(bal, adds[i]);\n ans[i] = mult(ans[i], bal);\n }\n }\n for (int i = 0; i <= D; ++i) {\n add(res, ans[i]);\n }\n } else {\n auto &ans1 = *(dfs3(vs[0], -1));\n auto &ans2 = *(dfs3(vs[1], -1));\n assert(sz(ans1) == D && sz(ans2) == sz(ans1));\n \/\/ eprintf(\"D = %d\\\\n\", D);\n for (int i = 0; i < sz(ans1); ++i) {\n add(res, mult(2, mult(ans1[i][D - 1 - i], ans2[i][D - 1 - i])));\n if (i) {\n add(res, mult(ans1[i][D - 1 - i], ans2[i][D - i]));\n add(res, mult(ans2[i][D - 1 - i], ans1[i][D - i]));\n\n add(res, mult(ans1[i][D - 1 - i], ans2[i - 1][D - i]));\n add(res, mult(ans2[i][D - 1 - i], ans1[i - 1][D - i]));\n }\n if (i < sz(ans1) - 1) {\n add(res, mult(ans1[i][D - 1 - i], ans2[i + 1][D - 1 - i]));\n add(res, mult(ans2[i][D - 1 - i], ans1[i + 1][D - 1 - i]));\n }\n }\n }\n\n printf(\"%d\\\\n\", res);\n \/\/ exit(0);\n}\n\nint main() {\n precalc();\n#ifdef LOCAL\n freopen(TASK \".out\", \"w\", stdout);\n assert(freopen(TASK \".in\", \"r\", stdin));\n#endif\n\n while (1) {\n if (!read()) {\n break;\n }\n solve();\n#ifdef DEBUG\n eprintf(\"Time %.2f\\\\n\", (double)clock() \/ CLOCKS_PER_SEC);\n#endif\n }\n return 0;\n}\n","fail":"#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n#endif\n\n#include <bits\/stdc++.h>\n\nusing namespace std;\n\nmt19937 mrand(random_device{}());\n\nint rnd(int x) { return mrand() % x; }\n\ntypedef long double ld;\ntypedef long long ll;\n\n#ifdef DEBUG\n#define eprintf(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)\n#else\n#define eprintf(...) ;\n#endif\n\n#define pb push_back\n#define mp make_pair\n#define sz(x) ((int)(x).size())\n#define TASK \"text\"\n\nconst int inf = (int)1.01e9;\nconst ld eps = 1e-9;\nconst ld pi = acos((ld)-1.0);\n\nconst int mod = (int)1e9 + 7;\n\nvoid add(int &x, int y) {\n if ((x += y) >= mod) {\n x -= mod;\n }\n}\n\nint mult(int x, int y) { return (long long)x * y % mod; }\n\nint myPower(int x, int pw) {\n int res = 1;\n for (; pw; pw >>= 1) {\n if (pw & 1) {\n res = mult(res, x);\n }\n x = mult(x, x);\n }\n return res;\n}\n\nvoid precalc() {}\n\nconst int maxn = (int)1e3 + 10;\nint n;\n\nvector<vector<int>> es;\n\nint read() {\n if (scanf(\"%d\", &n) < 1) {\n return 0;\n }\n es = vector<vector<int>>(n);\n for (int i = 0; i < n - 1; ++i) {\n int s, t;\n scanf(\"%d%d\", &s, &t);\n --s, --t;\n es[s].pb(t), es[t].pb(s);\n }\n return 1;\n}\n\nint dist[maxn];\nint dist1[maxn];\n\nvoid dfs1(int v, int p) {\n for (int u : es[v]) {\n if (u == p) {\n continue;\n }\n dist[u] = dist[v] + 1;\n dfs1(u, v);\n }\n}\n\nint used[maxn];\n\ntypedef vector<vector<int>> vvi;\n\nint cnt[maxn];\n\nvoid dfs2(int v, int p) {\n cnt[v] = 1;\n for (int u : es[v]) {\n if (u == p || used[u]) {\n continue;\n }\n dfs2(u, v);\n cnt[v] += cnt[u];\n }\n}\n\nint diam, D;\n\nvoid adde(vvi &a) {\n int n = sz(a);\n for (int i = 0; i < n; ++i) {\n a[i].pb(0);\n }\n a.pb(vector<int>(n + 1, 0));\n\n for (int i = n - 1; i >= 0; --i) {\n for (int j = n - 1; j >= 0; --j) {\n int x = a[i][j];\n if (!x) {\n continue;\n }\n a[i][j] = 0;\n if (i + 1 <= D) {\n add(a[i + 1][j], x);\n }\n if (i + 1 <= D) {\n add(a[i][j + 1], x);\n }\n }\n }\n}\n\nvoid makesum(vvi &a) {\n for (int i = 0; i < sz(a); ++i) {\n for (int j = 0; j < sz(a); ++j) {\n int &res = a[i][j];\n if (i) {\n add(res, a[i - 1][j]);\n if (j) {\n add(res, mod - a[i - 1][j - 1]);\n }\n }\n if (j) {\n add(res, a[i][j - 1]);\n }\n }\n }\n}\n\nvoid makeone(vvi &a) {\n for (int i = sz(a) - 1; i >= 0; --i) {\n for (int j = sz(a) - 1; j >= 0; --j) {\n int &res = a[i][j];\n if (i) {\n add(res, mod - a[i - 1][j]);\n if (j) {\n add(res, a[i - 1][j - 1]);\n }\n }\n if (j) {\n add(res, mod - a[i][j - 1]);\n }\n }\n }\n}\n\nvoid update(vvi &a, vvi &b) {\n \/*eprintf(\"update:\\\\n\");\n eprintf(\"%d\\\\n\", sz(a));\n for (int i = 0; i < sz(a); ++i) {\n for (int j = 0; j < sz(a); ++j) {\n eprintf(\"%d%c\", a[i][j], \" \\\\n\"[j == sz(a) - 1]);\n }\n }\n eprintf(\"%d\\\\n\", sz(b));\n for (int i = 0; i < sz(b); ++i) {\n for (int j = 0; j < sz(b); ++j) {\n eprintf(\"%d%c\", b[i][j], \" \\\\n\"[j == sz(b) - 1]);\n }\n }*\/\n assert(sz(a) >= sz(b));\n\n makesum(a);\n makesum(b);\n for (int i = 0; i < sz(a); ++i) {\n for (int j = 0; j < sz(a); ++j) {\n a[i][j] = mult(a[i][j], b[min(sz(b) - 1, i)][min(sz(b) - 1, j)]);\n }\n }\n makeone(a);\n}\n\nvvi *dfs3(int v, int p) {\n int u0 = -1;\n for (int u : es[v]) {\n if (u == p || used[u]) {\n continue;\n }\n if (u0 == -1 || cnt[u] > cnt[u0]) {\n u0 = u;\n }\n }\n if (u0 == -1) {\n return new vvi({{1}});\n }\n auto ans = dfs3(u0, v);\n adde(*ans);\n\n for (int u : es[v]) {\n if (u == p || u == u0 || used[u]) {\n continue;\n }\n auto got = dfs3(u, v);\n adde(*got);\n if (sz(*ans) < sz(*got)) {\n swap(ans, got);\n }\n update(*ans, *got);\n }\n return ans;\n}\n\nint ans[maxn];\nint adds[maxn];\n\nvoid solve() {\n dist[0] = 0;\n dfs1(0, -1);\n int v = max_element(dist, dist + n) - dist;\n\n dist[v] = 0;\n dfs1(v, -1);\n int u = max_element(dist, dist + n) - dist;\n diam = dist[u];\n\n memcpy(dist1, dist, sizeof(dist[0]) * n);\n\n dist[u] = 0;\n dfs1(u, -1);\n\n D = (diam + 1) \/ 2;\n \/\/ eprintf(\"diam = %d\\\\n\", diam);\n\n for (int i = 0; i < n; ++i) {\n used[i] = 0;\n }\n int vs[2];\n int k = 0;\n for (int i = 0; i < n; ++i) {\n if (dist[i] + dist1[i] == diam && abs(dist[i] - dist1[i]) <= 1) {\n vs[k++] = i;\n used[i] = 1;\n }\n }\n assert(1 <= k && k <= 2);\n for (int i = 0; i < k; ++i) {\n dfs2(i, -1);\n }\n\n \/\/ eprintf(\"middle %d\\\\n\", vs[0]);\n\n int res = 0;\n if (k == 1) {\n dfs2(vs[0], -1);\n for (int i = 0; i <= D; ++i) {\n ans[i] = 1;\n }\n for (int u : es[vs[0]]) {\n auto &got = *dfs3(u, vs[0]);\n adde(got);\n for (int i = 0; i <= D; ++i) {\n adds[i] = 0;\n }\n for (int i = 0; i < sz(got); ++i) {\n for (int j = 0; j < sz(got); ++j) {\n int cur = got[i][j];\n if (!cur) {\n continue;\n }\n \/\/ eprintf(\"u = %d, (%d,%d) x%d\\\\n\", u, i, j, cur);\n int l = i, r = D - j;\n if (l <= r) {\n \/\/ eprintf(\"[%d..%d]\\\\n\", l, r);\n add(adds[l], cur);\n add(adds[r + 1], mod - cur);\n }\n }\n }\n int bal = 0;\n for (int i = 0; i <= D; ++i) {\n add(bal, adds[i]);\n ans[i] = mult(ans[i], bal);\n }\n }\n for (int i = 0; i <= D; ++i) {\n add(res, ans[i]);\n }\n } else {\n auto &ans1 = *(dfs3(vs[0], -1));\n auto &ans2 = *(dfs3(vs[1], -1));\n assert(sz(ans1) == D && sz(ans2) == sz(ans1));\n \/\/ eprintf(\"D = %d\\\\n\", D);\n for (int i = 0; i < sz(ans1); ++i) {\n add(res, mult(2, mult(ans1[i][D - 1 - i], ans2[i][D - 1 - i])));\n if (i) {\n add(res, mult(ans1[i][D - 1 - i], ans2[i][D - i]));\n add(res, mult(ans2[i][D - 1 - i], ans1[i][D - i]));\n\n add(res, mult(ans1[i][D - 1 - i], ans2[i - 1][D - i]));\n add(res, mult(ans2[i][D - 1 - i], ans1[i - 1][D - i]));\n }\n if (i < sz(ans1) - 1) {\n add(res, mult(ans1[i][D - 1 - i], ans2[i + 1][D - 1 - i]));\n add(res, mult(ans2[i][D - 1 - i], ans1[i + 1][D - 1 - i]));\n }\n }\n }\n\n printf(\"%d\\\\n\", res);\n \/\/ exit(0);\n}\n\nint main() {\n precalc();\n#ifdef LOCAL\n freopen(TASK \".out\", \"w\", stdout);\n assert(freopen(TASK \".in\", \"r\", stdin));\n#endif\n\n while (1) {\n if (!read()) {\n break;\n }\n solve();\n#ifdef DEBUG\n eprintf(\"Time %.2f\\\\n\", (double)clock() \/ CLOCKS_PER_SEC);\n#endif\n }\n return 0;\n}\n","change":"insert","i1":210,"i2":210,"j1":210,"j2":213,"error":"0","stderr":null,"stdout":"2\n"}
{"problem_id":"p03794","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <vector>\n\n#define ls (t << 1)\n#define rs ((t << 1) + 1)\n#define mid ((l + r) >> 1)\n#define fi first\n#define se second\n#define mk make_pair\n#define pb push_back\n\n#define N 1005\n#define M 200005\n#define seed 23333\n#define Mo 1000000007\n\nusing namespace std;\nint i, j, m, n, p, k, f[N][N * 2], dis[N], fa[N], Q[N], x, y, dia[N], ans, D,\n col[N], Dis[N], lim[N];\nvector<int> v[N];\nvoid jia(int &x, int y) {\n x += y;\n if (x >= Mo)\n x -= Mo;\n}\nvoid jian(int &x, int y) {\n x -= y;\n if (x < 0)\n x += Mo;\n}\nint bfs(int *dis, int x) {\n memset(fa, 0, sizeof(fa));\n for (i = 1; i <= n; ++i)\n dis[i] = -1;\n dis[x] = 0;\n Q[Q[0] = 1] = x;\n int i, l;\n for (l = 1; l <= Q[0]; ++l) {\n int p = Q[l];\n for (i = 0; i < (int)v[p].size(); ++i) {\n int k = v[p][i];\n if (dis[k] != -1)\n continue;\n dis[k] = dis[p] + 1;\n fa[k] = p;\n Q[++Q[0]] = k;\n }\n }\n int now = 1;\n for (i = 1; i <= n; ++i)\n if (dis[now] < dis[i])\n now = i;\n return now;\n}\nvoid dfs(int x) {\n int i, j;\n for (i = -n + N; i <= n + N; ++i)\n if (abs(i - N) <= D \/ 2 - dis[x])\n f[x][i] = 1;\n for (i = 0; i < (int)v[x].size(); ++i) {\n int p = v[x][i];\n if (fa[x] == p)\n continue;\n dfs(p);\n for (j = -n + N; j <= n + N; ++j)\n f[x][j] = 1ll * f[x][j] * (f[p][j - 1] + f[p][j + 1]) % Mo;\n }\n}\nvoid Dfs(int x) {\n int i, j;\n for (i = -n + N; i <= n + N; ++i)\n if (abs(i - N) <= lim[x])\n f[x][i] = 1;\n for (i = 0; i < (int)v[x].size(); ++i) {\n int p = v[x][i];\n if (fa[x] == p)\n continue;\n Dfs(p);\n for (j = -n + N; j <= n + N; ++j)\n f[x][j] = 1ll * f[x][j] * (f[p][j - 1] + f[p][j + 1]) % Mo;\n }\n}\nint g[N][N * 2][8], G[N * 2][8];\nvoid Del(int x) {\n int i, j, k, l;\n if (col[x] || lim[x] > 1) {\n for (i = -n + N; i <= n + N; ++i)\n if (abs(i - N) <= lim[x])\n g[x][i][0] = 1;\n } else {\n g[x][N][1] = 1;\n g[x][N - 1][2] = 1;\n g[x][N + 1][4] = 1;\n }\n for (i = 0; i < (int)v[x].size(); ++i) {\n int p = v[x][i];\n if (fa[x] == p)\n continue;\n Del(p);\n memcpy(G, g[x], sizeof(G));\n memset(g[x], 0, sizeof(g[x]));\n for (j = -n + N; j <= n + N; ++j)\n for (k = 0; k < 8; ++k)\n if (G[j][k])\n for (l = 0; l < 8; ++l)\n jia(g[x][j][k | l],\n 1ll * G[j][k] * (g[p][j - 1][l] + g[p][j + 1][l]) % Mo);\n }\n}\nint main() {\n scanf(\"%d\", &n);\n for (i = 1; i < n; ++i) {\n scanf(\"%d%d\", &x, &y);\n v[x].pb(y);\n v[y].pb(x);\n }\n int x = bfs(dis, 1), y = bfs(dis, x);\n for (; y; y = fa[y])\n dia[++dia[0]] = y;\n if (dia[0] & 1) {\n D = dia[0] - 1;\n bfs(dis, dia[D \/ 2 + 1]);\n dfs(dia[D \/ 2 + 1]);\n for (i = -n + N; i <= n + N; ++i)\n jia(ans, f[dia[D \/ 2 + 1]][i]);\n printf(\"%d\\\\n\", ans);\n } else {\n for (;;)\n ;\n D = dia[0] - 1;\n bfs(Dis, dia[D \/ 2 + 2]);\n bfs(dis, dia[D \/ 2 + 1]);\n for (i = 1; i <= n; ++i)\n if (dis[i] < Dis[i])\n col[i] = 1;\n for (i = 1; i <= n; ++i)\n if (col[i])\n lim[i] = D \/ 2 + 1 - dis[i];\n else\n lim[i] = D \/ 2 - Dis[i];\n Dfs(dia[D \/ 2 + 1]);\n for (i = -n + N; i <= n + N; ++i)\n jia(ans, f[dia[D \/ 2 + 1]][i]);\n for (i = 1; i <= n; ++i)\n if (col[i])\n lim[i] = D \/ 2 - dis[i];\n else\n lim[i] = D \/ 2 + 1 - Dis[i];\n memset(f, 0, sizeof(f));\n Dfs(dia[D \/ 2 + 1]);\n for (i = -n + N; i <= n + N; ++i)\n jia(ans, f[dia[D \/ 2 + 1]][i]);\n Del(dia[D \/ 2 + 1]);\n for (i = -n + N; i <= n + N; ++i)\n jian(ans, g[dia[D \/ 2 + 1]][i][1]), jian(ans, g[dia[D \/ 2 + 1]][i][2]),\n jian(ans, g[dia[D \/ 2 + 1]][i][4]);\n printf(\"%d\\\\n\", ans);\n }\n}\n","fail":"#include <algorithm>\n#include <bitset>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <vector>\n\n#define ls (t << 1)\n#define rs ((t << 1) + 1)\n#define mid ((l + r) >> 1)\n#define fi first\n#define se second\n#define mk make_pair\n#define pb push_back\n\n#define N 1005\n#define M 200005\n#define seed 23333\n#define Mo 1000000007\n\nusing namespace std;\nint i, j, m, n, p, k, f[N][N * 2], dis[N], fa[N], Q[N], x, y, dia[N], ans, D,\n col[N], Dis[N], lim[N];\nvector<int> v[N];\nvoid jia(int &x, int y) {\n x += y;\n if (x >= Mo)\n x -= Mo;\n}\nvoid jian(int &x, int y) {\n x -= y;\n if (x < 0)\n x += Mo;\n}\nint bfs(int *dis, int x) {\n memset(fa, 0, sizeof(fa));\n for (i = 1; i <= n; ++i)\n dis[i] = -1;\n dis[x] = 0;\n Q[Q[0] = 1] = x;\n int i, l;\n for (l = 1; l <= Q[0]; ++l) {\n int p = Q[l];\n for (i = 0; i < (int)v[p].size(); ++i) {\n int k = v[p][i];\n if (dis[k] != -1)\n continue;\n dis[k] = dis[p] + 1;\n fa[k] = p;\n Q[++Q[0]] = k;\n }\n }\n int now = 1;\n for (i = 1; i <= n; ++i)\n if (dis[now] < dis[i])\n now = i;\n return now;\n}\nvoid dfs(int x) {\n int i, j;\n for (i = -n + N; i <= n + N; ++i)\n if (abs(i - N) <= D \/ 2 - dis[x])\n f[x][i] = 1;\n for (i = 0; i < (int)v[x].size(); ++i) {\n int p = v[x][i];\n if (fa[x] == p)\n continue;\n dfs(p);\n for (j = -n + N; j <= n + N; ++j)\n f[x][j] = 1ll * f[x][j] * (f[p][j - 1] + f[p][j + 1]) % Mo;\n }\n}\nvoid Dfs(int x, int tp) {\n int i, j;\n for (i = -n + N; i <= n + N; ++i)\n if (col[x]) {\n if (abs(i - N) <= lim[x])\n f[x][i] = 1;\n } else if (abs(i - N - tp) <= lim[x])\n f[x][i] = 1;\n for (i = 0; i < (int)v[x].size(); ++i) {\n int p = v[x][i];\n if (fa[x] == p)\n continue;\n Dfs(p, tp);\n for (j = -n + N; j <= n + N; ++j)\n f[x][j] = 1ll * f[x][j] * (f[p][j - 1] + f[p][j + 1]) % Mo;\n }\n}\nint main() {\n scanf(\"%d\", &n);\n for (i = 1; i < n; ++i) {\n scanf(\"%d%d\", &x, &y);\n v[x].pb(y);\n v[y].pb(x);\n }\n int x = bfs(dis, 1), y = bfs(dis, x);\n for (; y; y = fa[y])\n dia[++dia[0]] = y;\n if (dia[0] & 1) {\n D = dia[0] - 1;\n bfs(dis, dia[D \/ 2 + 1]);\n dfs(dia[D \/ 2 + 1]);\n for (i = -n + N; i <= n + N; ++i)\n jia(ans, f[dia[D \/ 2 + 1]][i]);\n printf(\"%d\\\\n\", ans);\n } else {\n D = dia[0] - 1;\n bfs(Dis, dia[D \/ 2 + 2]);\n bfs(dis, dia[D \/ 2 + 1]);\n for (i = 1; i <= n; ++i)\n if (dis[i] < Dis[i])\n col[i] = 1;\n for (i = 1; i <= n; ++i)\n if (col[i])\n lim[i] = D \/ 2 + 1 - dis[i];\n else\n lim[i] = D \/ 2 - Dis[i];\n Dfs(dia[D \/ 2 + 1], 0);\n for (i = -n + N; i <= n + N; ++i)\n jia(ans, f[dia[D \/ 2 + 1]][i]);\n for (i = 1; i <= n; ++i)\n if (col[i])\n lim[i] = D \/ 2 - dis[i];\n else\n lim[i] = D \/ 2 + 1 - Dis[i];\n memset(f, 0, sizeof(f));\n Dfs(dia[D \/ 2 + 1], 0);\n for (i = -n + N; i <= n + N; ++i)\n jia(ans, f[dia[D \/ 2 + 1]][i]);\n memset(f, 0, sizeof(f));\n Dfs(dia[D \/ 2 + 1], -1);\n for (i = -n + N; i <= n + N; ++i)\n jian(ans, f[dia[D \/ 2 + 1]][i]);\n memset(f, 0, sizeof(f));\n Dfs(dia[D \/ 2 + 1], 1);\n for (i = -n + N; i <= n + N; ++i)\n jian(ans, f[dia[D \/ 2 + 1]][i]);\n printf(\"%d\\\\n\", ans);\n }\n}\n","change":"replace","i1":76,"i2":164,"j1":76,"j2":142,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03794","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<int, P> P1;\ntypedef pair<P, P> P2;\n#define pb push_back\n#define mp make_pair\n#define eps 1e-7\n#define INF 1000000000\n#define mod 1000000007\n#define fi first\n#define sc second\n#define rep(i, x) for (int i = 0; i < x; i++)\n#define repn(i, x) for (int i = 1; i <= x; i++)\n#define SORT(x) sort(x.begin(), x.end())\n#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())\n#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())\n#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())\nint n;\nvector<int> edge[1005];\nP DFS(int v, int u, int d) {\n P ret = mp(d, v);\n rep(i, edge[v].size()) {\n if (edge[v][i] == u)\n continue;\n ret = max(ret, DFS(edge[v][i], v, d + 1));\n }\n return ret;\n}\nint dist[1005][2];\nvoid DFS2(int v, int u, int d, int ty) {\n dist[v][ty] = d;\n rep(i, edge[v].size()) {\n if (edge[v][i] == u)\n continue;\n DFS2(edge[v][i], v, d + 1, ty);\n }\n}\nint must, u, v;\nbool ok(int x, int val) {\n int D = dist[x][0];\n if ((D + abs(val)) \/ 2 > (dist[v][0] + 1) \/ 2)\n return false;\n D = dist[x][1];\n if ((D + abs(val - must)) \/ 2 > (dist[v][0] + 1) \/ 2)\n return false;\n return true;\n}\nll dp[1005][2005];\nll dfs(int x, int y, int val) {\n if (x == v) {\n if (must == val)\n return 1LL;\n else\n return 0LL;\n }\n if (dp[x][val + 1050] >= 0)\n return dp[x][val + 1050];\n ll ret = 1;\n rep(i, edge[x].size()) {\n if (edge[x][i] == y)\n continue;\n ll add = 0;\n if (ok(edge[x][i], val + 1)) {\n add += dfs(edge[x][i], x, val + 1);\n }\n if (ok(edge[x][i], val - 1)) {\n add += dfs(edge[x][i], x, val - 1);\n }\n add %= mod;\n ret = ret * add % mod;\n }\n return dp[x][val + 1050] = ret;\n}\nint main() {\n cin >> n;\n rep(i, n - 1) {\n int a, b;\n cin >> a >> b;\n edge[a].pb(b);\n edge[b].pb(a);\n }\n P p = DFS(1, -1, 0);\n P q = DFS(p.sc, -1, 0);\n u = p.sc, v = q.sc;\n DFS2(u, -1, 0, 0);\n DFS2(v, -1, 0, 1);\n if (q.fi % 2 == 0) {\n memset(dp, -1LL, sizeof(dp));\n must = 0;\n cout << dfs(u, -1, 0) << endl;\n } else {\n assert(0);\n ll ans = 0;\n must = 1;\n ans += dfs(u, -1, 0);\n must = -1;\n ans += dfs(u, -1, 0);\n cout << ans % mod << endl;\n }\n}","fail":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\ntypedef pair<int, P> P1;\ntypedef pair<P, P> P2;\n#define pb push_back\n#define mp make_pair\n#define eps 1e-7\n#define INF 1000000000\n#define mod 1000000007\n#define fi first\n#define sc second\n#define rep(i, x) for (int i = 0; i < x; i++)\n#define repn(i, x) for (int i = 1; i <= x; i++)\n#define SORT(x) sort(x.begin(), x.end())\n#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())\n#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())\n#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())\nint n;\nvector<int> edge[1005];\nP DFS(int v, int u, int d) {\n P ret = mp(d, v);\n rep(i, edge[v].size()) {\n if (edge[v][i] == u)\n continue;\n ret = max(ret, DFS(edge[v][i], v, d + 1));\n }\n return ret;\n}\nint dist[1005][2];\nvoid DFS2(int v, int u, int d, int ty) {\n dist[v][ty] = d;\n rep(i, edge[v].size()) {\n if (edge[v][i] == u)\n continue;\n DFS2(edge[v][i], v, d + 1, ty);\n }\n}\nint must, u, v;\nbool ok(int x, int val) {\n int D = dist[x][0];\n if ((D + abs(val)) \/ 2 > (dist[v][0] + 1) \/ 2)\n return false;\n D = dist[x][1];\n if ((D + abs(val - must)) \/ 2 > (dist[v][0] + 1) \/ 2)\n return false;\n return true;\n}\nll dp[1005][2005];\nll dfs(int x, int y, int val) {\n if (x == v) {\n if (must == val)\n return 1LL;\n else\n return 0LL;\n }\n if (dp[x][val + 1050] >= 0)\n return dp[x][val + 1050];\n ll ret = 1;\n rep(i, edge[x].size()) {\n if (edge[x][i] == y)\n continue;\n ll add = 0;\n if (ok(edge[x][i], val + 1)) {\n add += dfs(edge[x][i], x, val + 1);\n }\n if (ok(edge[x][i], val - 1)) {\n add += dfs(edge[x][i], x, val - 1);\n }\n add %= mod;\n ret = ret * add % mod;\n }\n return dp[x][val + 1050] = ret;\n}\n\nint ok2(int x, int val) {\n int D = dist[x][0];\n if ((D + abs(val)) \/ 2 > (dist[v][0] + 1) \/ 2)\n return -1;\n D = dist[x][1];\n if ((D + abs(val - must)) \/ 2 > (dist[v][0] + 1) \/ 2)\n return -1;\n if (dist[x][0] < dist[x][1]) {\n int dif = dist[v][0] - dist[x][1];\n if (dif < abs(val))\n return 1;\n } else {\n int dif = dist[v][0] - dist[x][0];\n if (dif < abs(val - must))\n return 2;\n }\n return 0;\n}\nll dp2[1005][2005][4];\nvoid dfs2(int x, int y, int val) {\n if (x == v) {\n rep(a, 4) dp2[x][val + 1050][a] = 0;\n if (must == val)\n dp2[x][val + 1050][0] = 1LL;\n return;\n }\n if (dp2[x][val + 1050][0] >= 0)\n return;\n rep(a, 4) dp2[x][val + 1050][a] = 0;\n ll ret[2][4] = {};\n ret[0][ok2(x, val)] = 1LL;\n int cur = 0, nxt = 1;\n rep(i, edge[x].size()) {\n if (edge[x][i] == y)\n continue;\n rep(a, 4) ret[nxt][a] = 0;\n if (ok2(edge[x][i], val + 1) != -1) {\n dfs2(edge[x][i], x, val + 1);\n rep(a, 4) rep(b, 4) ret[nxt][a | b] +=\n ret[cur][a] * dp2[edge[x][i]][val + 1 + 1050][b] % mod;\n }\n if (ok2(edge[x][i], val - 1) != -1) {\n dfs2(edge[x][i], x, val - 1);\n rep(a, 4) rep(b, 4) ret[nxt][a | b] +=\n ret[cur][a] * dp2[edge[x][i]][val - 1 + 1050][b] % mod;\n }\n rep(a, 4) ret[nxt][a] %= mod;\n swap(cur, nxt);\n }\n rep(a, 4) dp2[x][val + 1050][a] = ret[cur][a];\n return;\n}\nint main() {\n cin >> n;\n rep(i, n - 1) {\n int a, b;\n cin >> a >> b;\n edge[a].pb(b);\n edge[b].pb(a);\n }\n P p = DFS(1, -1, 0);\n P q = DFS(p.sc, -1, 0);\n u = p.sc, v = q.sc;\n DFS2(u, -1, 0, 0);\n DFS2(v, -1, 0, 1);\n if (q.fi % 2 == 0) {\n memset(dp, -1LL, sizeof(dp));\n must = 0;\n cout << dfs(u, -1, 0) << endl;\n } else {\n ll ans = 0;\n memset(dp2, -1LL, sizeof(dp2));\n must = 1;\n dfs2(u, -1, 0);\n for (int i = 0; i < 3; i++)\n ans += dp2[u][1050][i];\n memset(dp2, -1LL, sizeof(dp2));\n must = -1;\n dfs2(u, -1, 0);\n for (int i = 0; i < 3; i++)\n ans += dp2[u][1050][i];\n cout << ans % mod << endl;\n }\n}","change":"replace","i1":75,"i2":99,"j1":75,"j2":157,"error":"0","stderr":null,"stdout":"2\n"}
{"problem_id":"p03794","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define pb push_back\n#define all(v) (v).begin(), (v).end()\n#define fi first\n#define se second\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\n\nconst int mod = 1000000007;\ninline void add(int &a, int b) {\n a += b;\n if (a >= mod)\n a -= mod;\n}\nint mpow(int n, int m) {\n int ret = 1;\n while (m) {\n if (m & 1)\n ret = ret * n % mod;\n n = n * n % mod;\n m >>= 1;\n }\n return ret;\n}\nconst int FACT_SIZE = 1111111;\nint fact[FACT_SIZE];\nint inv[FACT_SIZE];\nstruct fact_exec {\n fact_exec() {\n fact[0] = 1;\n for (int i = 1; i < FACT_SIZE; i++)\n fact[i] = fact[i - 1] * i % mod;\n inv[FACT_SIZE - 1] = mpow(fact[FACT_SIZE - 1], mod - 2);\n for (int i = FACT_SIZE - 2; i >= 0; i--)\n inv[i] = inv[i + 1] * (i + 1) % mod;\n }\n} factexec;\nint nCk(int n, int k) {\n if (n < 0 | k < 0 || k > n)\n return 0;\n return fact[n] * inv[k] % mod * inv[n - k] % mod;\n}\nint nPk(int n, int k) {\n if (n < 0 || k < 0 || k > n)\n return 0;\n return fact[n] * inv[n - k] % mod;\n}\n\nint N;\nvint G[1111];\n\nint dist[1111];\n\nvoid dfs(int v, int p, int d) {\n dist[v] = d;\n for (auto u : G[v]) {\n if (u == p)\n continue;\n dfs(u, v, d + 1);\n }\n}\n\nint D;\nint X;\nint dp[1111][1111];\nvoid dfs2(int v, int p, int d) {\n rep(i, D \/ 2 + 1) dp[v][i] = 1;\n for (auto u : G[v]) {\n if (u == p)\n continue;\n dfs2(u, v, d + 1);\n rep(i, D \/ 2 + 1) dp[v][i] = dp[v][i] * (dp[u][i] + dp[u][i + 1]) % mod;\n }\n rep(i, D \/ 2 + 1) if (i > X || d - i > D \/ 2 - X) dp[v][i] = 0;\n}\nvoid solve(int c) {\n int ans = 0;\n for (X = 0; X <= D \/ 2; X++) {\n memset(dp, 0, sizeof(dp));\n dfs2(c, -1, 0);\n add(ans, dp[c][0]);\n }\n cout << ans << endl;\n}\n\nsigned main() {\n\n cin >> N;\n rep(i, N - 1) {\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n G[a].pb(b);\n G[b].pb(a);\n }\n\n dfs(0, -1, 0);\n int v = 0;\n rep(i, N) if (dist[i] > dist[v]) v = i;\n dfs(v, -1, 0);\n\n int u = 0;\n rep(i, N) if (dist[i] > dist[u]) u = i;\n\n vint latte(N);\n rep(i, N) latte[i] = dist[i];\n dfs(u, -1, 0);\n rep(i, N) chmax(latte[i], dist[i]);\n\n vint lis;\n rep(i, N) if (latte[i] <= (dist[v] + 1) \/ 2) lis.pb(i);\n\n D = dist[v];\n\n if (lis.size() == 1) {\n solve(lis[0]);\n } else {\n int u = lis[0], v = lis[1];\n\n vint x(N), y(N), z(N), w(N);\n\n for (X = 0; X <= D \/ 2; X++) {\n memset(dp, 0, sizeof(dp));\n dfs2(u, v, 0);\n x[X] = dp[u][0];\n\n memset(dp, 0, sizeof(dp));\n dfs2(v, u, 0);\n y[X] = dp[v][0];\n }\n\n D++;\n for (X = 0; X <= D \/ 2; X++) {\n memset(dp, 0, sizeof(dp));\n dfs2(u, v, 0);\n z[X] = dp[u][0];\n\n memset(dp, 0, sizeof(dp));\n dfs2(v, u, 0);\n w[X] = dp[v][0];\n }\n\n D--;\n z[0] = w[0] = 0;\n for (int i = 1; i < N; i++)\n z[i] = (z[i] - x[i] - x[i - 1] + mod * 2) % mod;\n for (int i = 1; i < N; i++)\n w[i] = (w[i] - y[i] - y[i - 1] + mod * 2) % mod;\n\n int ans = 0;\n for (int i = 0; i <= D \/ 2; i++) {\n for (int j = 0; j <= D \/ 2; j++) {\n int a = i;\n int b = D \/ 2 - i;\n int c = j;\n int d = D \/ 2 - j;\n if (a + d <= D \/ 2 + 1 && b + c + 1 <= D \/ 2 + 1)\n add(ans, x[i] * y[j] % mod);\n if (a + d + 1 <= D \/ 2 + 1 && b + c <= D \/ 2 + 1)\n add(ans, x[i] * y[j] % mod);\n }\n }\n\n for (int i = 0; i <= D \/ 2; i++) {\n for (int j = 0; j <= D \/ 2 + 1; j++) {\n int a = i;\n int b = D \/ 2 - i;\n int c = j;\n int d = D \/ 2 + 1 - j;\n if (a + d <= D \/ 2 + 1 && b + c + 1 <= D \/ 2 + 1)\n add(ans, x[i] * w[j] % mod);\n if (a + d + 1 <= D \/ 2 + 1 && b + c <= D \/ 2 + 1)\n add(ans, x[i] * w[j] % mod);\n }\n }\n\n for (int i = 0; i <= D \/ 2 + 1; i++) {\n for (int j = 0; j <= D \/ 2 + 1; j++) {\n int a = i;\n int b = D \/ 2 + 1 - i;\n int c = j;\n int d = D \/ 2 + 1 - j;\n if (a + d <= D \/ 2 + 1 && b + c + 1 <= D \/ 2 + 1)\n add(ans, z[i] * w[j] % mod);\n if (a + d + 1 <= D \/ 2 + 1 && b + c <= D \/ 2 + 1)\n add(ans, z[i] * w[j] % mod);\n }\n }\n\n for (int i = 0; i <= D \/ 2 + 1; i++) {\n for (int j = 0; j <= D \/ 2; j++) {\n int a = i;\n int b = D \/ 2 + 1 - i;\n int c = j;\n int d = D \/ 2 - j;\n if (a + d <= D \/ 2 + 1 && b + c + 1 <= D \/ 2 + 1)\n add(ans, z[i] * y[j] % mod);\n if (a + d + 1 <= D \/ 2 + 1 && b + c <= D \/ 2 + 1)\n add(ans, z[i] * y[j] % mod);\n }\n }\n\n cout << ans << endl;\n }\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define pb push_back\n#define all(v) (v).begin(), (v).end()\n#define fi first\n#define se second\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<pint> vpint;\n\ntemplate <typename A, typename B> inline void chmin(A &a, B b) {\n if (a > b)\n a = b;\n}\ntemplate <typename A, typename B> inline void chmax(A &a, B b) {\n if (a < b)\n a = b;\n}\n\nconst int mod = 1000000007;\ninline void add(int &a, int b) {\n a += b;\n if (a >= mod)\n a -= mod;\n}\nint mpow(int n, int m) {\n int ret = 1;\n while (m) {\n if (m & 1)\n ret = ret * n % mod;\n n = n * n % mod;\n m >>= 1;\n }\n return ret;\n}\nconst int FACT_SIZE = 1111111;\nint fact[FACT_SIZE];\nint inv[FACT_SIZE];\nstruct fact_exec {\n fact_exec() {\n fact[0] = 1;\n for (int i = 1; i < FACT_SIZE; i++)\n fact[i] = fact[i - 1] * i % mod;\n inv[FACT_SIZE - 1] = mpow(fact[FACT_SIZE - 1], mod - 2);\n for (int i = FACT_SIZE - 2; i >= 0; i--)\n inv[i] = inv[i + 1] * (i + 1) % mod;\n }\n} factexec;\nint nCk(int n, int k) {\n if (n < 0 | k < 0 || k > n)\n return 0;\n return fact[n] * inv[k] % mod * inv[n - k] % mod;\n}\nint nPk(int n, int k) {\n if (n < 0 || k < 0 || k > n)\n return 0;\n return fact[n] * inv[n - k] % mod;\n}\n\nint N;\nvint G[1111];\n\nint dist[1111];\n\nvoid dfs(int v, int p, int d) {\n dist[v] = d;\n for (auto u : G[v]) {\n if (u == p)\n continue;\n dfs(u, v, d + 1);\n }\n}\n\nint D;\nint X;\nint dp[1111][1111];\nvoid dfs2(int v, int p, int d) {\n\n int l = max(0ll, X + d - D \/ 2);\n\n for (int i = l; i <= X; i++)\n dp[v][i] = 1;\n for (auto u : G[v]) {\n if (u == p)\n continue;\n dfs2(u, v, d + 1);\n for (int i = l; i <= X; i++)\n dp[v][i] = dp[v][i] * (dp[u][i] + dp[u][i + 1]) % mod;\n }\n}\nvoid solve(int c) {\n int ans = 0;\n for (X = 0; X <= D \/ 2; X++) {\n memset(dp, 0, sizeof(dp));\n dfs2(c, -1, 0);\n add(ans, dp[c][0]);\n }\n cout << ans << endl;\n}\n\nsigned main() {\n\n cin >> N;\n rep(i, N - 1) {\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n G[a].pb(b);\n G[b].pb(a);\n }\n\n dfs(0, -1, 0);\n int v = 0;\n rep(i, N) if (dist[i] > dist[v]) v = i;\n dfs(v, -1, 0);\n\n int u = 0;\n rep(i, N) if (dist[i] > dist[u]) u = i;\n\n vint latte(N);\n rep(i, N) latte[i] = dist[i];\n dfs(u, -1, 0);\n rep(i, N) chmax(latte[i], dist[i]);\n\n vint lis;\n rep(i, N) if (latte[i] <= (dist[v] + 1) \/ 2) lis.pb(i);\n\n D = dist[v];\n\n if (lis.size() == 1) {\n solve(lis[0]);\n } else {\n int u = lis[0], v = lis[1];\n\n vint x(N), y(N), z(N), w(N);\n\n for (X = 0; X <= D \/ 2; X++) {\n memset(dp, 0, sizeof(dp));\n dfs2(u, v, 0);\n x[X] = dp[u][0];\n\n memset(dp, 0, sizeof(dp));\n dfs2(v, u, 0);\n y[X] = dp[v][0];\n }\n\n D++;\n for (X = 0; X <= D \/ 2; X++) {\n memset(dp, 0, sizeof(dp));\n dfs2(u, v, 0);\n z[X] = dp[u][0];\n\n memset(dp, 0, sizeof(dp));\n dfs2(v, u, 0);\n w[X] = dp[v][0];\n }\n\n D--;\n z[0] = w[0] = 0;\n for (int i = 1; i < N; i++)\n z[i] = (z[i] - x[i] - x[i - 1] + mod * 2) % mod;\n for (int i = 1; i < N; i++)\n w[i] = (w[i] - y[i] - y[i - 1] + mod * 2) % mod;\n\n int ans = 0;\n for (int i = 0; i <= D \/ 2; i++) {\n for (int j = 0; j <= D \/ 2; j++) {\n int a = i;\n int b = D \/ 2 - i;\n int c = j;\n int d = D \/ 2 - j;\n if (a + d <= D \/ 2 + 1 && b + c + 1 <= D \/ 2 + 1)\n add(ans, x[i] * y[j] % mod);\n if (a + d + 1 <= D \/ 2 + 1 && b + c <= D \/ 2 + 1)\n add(ans, x[i] * y[j] % mod);\n }\n }\n\n for (int i = 0; i <= D \/ 2; i++) {\n for (int j = 0; j <= D \/ 2 + 1; j++) {\n int a = i;\n int b = D \/ 2 - i;\n int c = j;\n int d = D \/ 2 + 1 - j;\n if (a + d <= D \/ 2 + 1 && b + c + 1 <= D \/ 2 + 1)\n add(ans, x[i] * w[j] % mod);\n if (a + d + 1 <= D \/ 2 + 1 && b + c <= D \/ 2 + 1)\n add(ans, x[i] * w[j] % mod);\n }\n }\n\n for (int i = 0; i <= D \/ 2 + 1; i++) {\n for (int j = 0; j <= D \/ 2 + 1; j++) {\n int a = i;\n int b = D \/ 2 + 1 - i;\n int c = j;\n int d = D \/ 2 + 1 - j;\n if (a + d <= D \/ 2 + 1 && b + c + 1 <= D \/ 2 + 1)\n add(ans, z[i] * w[j] % mod);\n if (a + d + 1 <= D \/ 2 + 1 && b + c <= D \/ 2 + 1)\n add(ans, z[i] * w[j] % mod);\n }\n }\n\n for (int i = 0; i <= D \/ 2 + 1; i++) {\n for (int j = 0; j <= D \/ 2; j++) {\n int a = i;\n int b = D \/ 2 + 1 - i;\n int c = j;\n int d = D \/ 2 - j;\n if (a + d <= D \/ 2 + 1 && b + c + 1 <= D \/ 2 + 1)\n add(ans, z[i] * y[j] % mod);\n if (a + d + 1 <= D \/ 2 + 1 && b + c <= D \/ 2 + 1)\n add(ans, z[i] * y[j] % mod);\n }\n }\n\n cout << ans << endl;\n }\n return 0;\n}\n","change":"replace","i1":81,"i2":89,"j1":81,"j2":93,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03794","language":"C++","original_status":"Time Limit Exceeded","pass":"\/\/ ba mei zi !\n\n#include <bits\/stdc++.h>\n\n#define HEAP priority_queue\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 forn(i, l, r) for (int i = (l); i <= (r); ++i)\n#define nrof(i, r, l) for (int i = (r); i >= (l); --i)\n#define FOR(a, b) for (auto(a) : (b))\n#define mp make_pair\n#define mt make_tuple\n#define pb push_back\n#define X first\n#define Y second\n#define eps 1e-6\n#define pi 3.1415926535897932384626433832795\n#define SZ(x) (int)x.size()\n#define ALL(x) x.begin(), x.end()\n#define FILL(a, b) memset((a), (b), sizeof((a)))\n#define MCPY(a, b) memcpy((a), (b), sizeof((b)))\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef double flt;\ntypedef vector<int> vi;\ntypedef vector<LL> vl;\ntypedef pair<int, int> pii;\ntypedef pair<int, LL> pil;\ntypedef pair<LL, int> pli;\ntypedef pair<LL, LL> pll;\ntypedef vector<pil> vil;\ntypedef vector<pii> vii;\ntypedef vector<pli> vli;\ntypedef vector<pll> vll;\n\nconst int iinf = 1e9 + 7;\nconst LL linf = 1ll << 60;\nconst flt dinf = 1e60;\n\ntemplate <typename T> inline void scf(T &x) {\n bool f = 0;\n x = 0;\n char c = getchar();\n while ((c < '0' || c > '9') && c != '-')\n c = getchar();\n if (c == '-') {\n f = 1;\n c = getchar();\n }\n while (c >= '0' && c <= '9') {\n x = x * 10 + c - '0';\n c = getchar();\n }\n if (f)\n x = -x;\n return;\n}\n\ntemplate <typename T1, typename T2> void scf(T1 &x, T2 &y) {\n scf(x);\n return scf(y);\n}\n\ntemplate <typename T1, typename T2, typename T3> void scf(T1 &x, T2 &y, T3 &z) {\n scf(x);\n scf(y);\n return scf(z);\n}\n\ntemplate <typename T1, typename T2, typename T3, typename T4>\nvoid scf(T1 &x, T2 &y, T3 &z, T4 &w) {\n scf(x);\n scf(y);\n scf(z);\n return scf(w);\n}\n\ninline char mygetchar() {\n char c = getchar();\n while (c == ' ' || c == '\\\\n')\n c = getchar();\n return c;\n}\n\ntemplate <typename T> void chkmax(T &x, const T &y) {\n if (y > x)\n x = y;\n return;\n}\n\ntemplate <typename T> void chkmin(T &x, const T &y) {\n if (y < x)\n x = y;\n return;\n}\n\n#ifdef ONLINE_JUDGE\n#define debug(x, c) ;\n#else\n#define DEBUG\n#define debug(x, c) cerr << #x << \"=\" << x << c;\n#endif\n\n\/\/---------------------------head----------------------------\n\nconst int N = 1e3 + 100;\nconst int mod = 1e9 + 7;\n\nint n, diameter_length, min_D;\nint dp[N][N], tag[N][N], current_time;\nvi g[N];\nvi diameter_path;\n\nnamespace TREE {\nint par[N], dep[N];\n\nvoid dfs(int u = 1, int fa = 0) {\n par[u] = fa;\n dep[u] = dep[fa] + 1;\n for (int v : g[u])\n if (v != fa)\n dfs(v, u);\n return;\n}\n\nvoid get_diameter() {\n dfs();\n int mx = -1, S, T;\n forn(i, 1, n) if (dep[i] > mx) mx = dep[i], S = i;\n dfs(S);\n mx = -1;\n forn(i, 1, n) if (dep[i] > mx) mx = dep[i], T = i;\n\n diameter_length = dep[T] - 1;\n min_D = dep[T] >> 1;\n\n int u = T;\n while (u != S)\n diameter_path.pb(u), u = par[u];\n diameter_path.pb(S);\n return;\n}\n} \/\/ namespace TREE\n\nvoid MEI() {\n scf(n);\n rep(i, n - 1) {\n int u, v;\n scf(u, v);\n g[u].pb(v);\n g[v].pb(u);\n }\n\n TREE::get_diameter();\n return;\n}\n\nnamespace Bamboo {\nvoid solve() {\n for (;;)\n ;\n dp[0][0] = 1;\n forn(i, 1, n - 1) {\n dp[i][0] = dp[i][i] = 1;\n forn(j, 1, i - 1) dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % mod;\n }\n printf(\"%d\\\\n\", dp[n - 1][min_D] * 2 % mod);\n return;\n}\n} \/\/ namespace Bamboo\n\nvoid DP(int u, int par, int max_down, int max_up) {\n if (tag[u][max_down] == current_time)\n return;\n\n tag[u][max_down] = current_time;\n int &t = dp[u][max_down];\n t = 1;\n\n for (int v : g[u])\n if (v != par) {\n int foo = 0;\n if (max_down)\n DP(v, u, max_down - 1, max_up), foo += dp[v][max_down - 1];\n if (max_up)\n DP(v, u, max_down, max_up - 1), foo += dp[v][max_down];\n t = 1ll * t * foo % mod;\n }\n return;\n}\n\nnamespace Odd {\nint ans = 0;\nint root1, root2;\n\nvoid case1() {\n rep(down2, min_D) {\n int up1 = min_D - 1 - down2;\n int up2 = up1, down1 = down2;\n\n current_time++;\n DP(root2, root1, down2, up2);\n int foo = dp[root2][down2];\n\n current_time++;\n DP(root1, root2, down1, up1);\n foo = 1ll * foo * dp[root1][down1] % mod;\n ans += foo;\n if (ans >= mod)\n ans -= mod;\n }\n debug(ans, '\\\\n') return;\n}\n\nvoid case2() {\n forn(down2, 1, min_D - 1) {\n int up2 = min_D - 1 - down2;\n int up1 = min_D - down2;\n int down1 = min_D - 1 - up1;\n\n current_time++;\n DP(root2, root1, down2, up2);\n int foo = dp[root2][down2];\n\n current_time++;\n DP(root1, root2, down1, up1);\n foo = 1ll * foo * dp[root1][down1] % mod;\n ans += foo;\n if (ans >= mod)\n ans -= mod;\n }\n debug(ans, '\\\\n') return;\n}\n\nvoid case3() {\n rep(down2, min_D) {\n int up1 = min_D - down2;\n int up2 = up1 - 1;\n int down1 = min_D - up1;\n\n current_time++;\n DP(root2, root1, down2, up2);\n int foo = dp[root2][down2];\n\n current_time++;\n DP(root1, root2, down1, up1);\n LL bar = dp[root1][down1];\n if (down1 > 0) {\n current_time++;\n DP(root1, root2, down1 - 1, up1);\n bar += mod - dp[root1][down1 - 1];\n }\n if (up1 > 0) {\n current_time++;\n DP(root1, root2, down1, up1 - 1);\n bar += mod - dp[root1][down1];\n }\n\n foo = 1ll * foo * bar % mod;\n ans += foo;\n if (ans >= mod)\n ans -= mod;\n }\n debug(ans, '\\\\n') return;\n}\n\nvoid case4() {\n forn(down2, 1, min_D) {\n int up1 = min_D - down2;\n int up2 = up1;\n int down1 = min_D - 1 - up1;\n\n current_time++;\n DP(root2, root1, down2, up2);\n LL foo = dp[root2][down2];\n if (up2 > 0) {\n current_time++;\n DP(root2, root1, down2, up2 - 1);\n foo += mod - dp[root2][down2];\n }\n if (down2 > 0) {\n current_time++;\n DP(root2, root1, down2 - 1, up2);\n foo += mod - dp[root2][down2 - 1];\n }\n\n current_time++;\n DP(root1, root2, down1, up1);\n foo = foo * 1ll * dp[root1][down1] % mod;\n\n ans += foo;\n if (ans >= mod)\n ans -= mod;\n }\n debug(ans, '\\\\n') return;\n}\n\nvoid solve() {\n root1 = diameter_path[min_D - 1];\n root2 = diameter_path[min_D];\n case1();\n case2();\n case3();\n case4();\n ans += ans;\n if (ans >= mod)\n ans -= mod;\n printf(\"%d\\\\n\", ans);\n return;\n}\n} \/\/ namespace Odd\n\nnamespace Even {\nvoid solve() {\n int root = diameter_path[min_D];\n int ans = 0;\n forn(max_down, 0, min_D) {\n current_time++;\n DP(root, 0, max_down, min_D - max_down);\n ans += dp[root][max_down];\n if (ans >= mod)\n ans -= mod;\n }\n printf(\"%d\\\\n\", ans);\n return;\n}\n} \/\/ namespace Even\n\nvoid ZI() {\n if (diameter_length == n - 1)\n Bamboo::solve();\n else if (diameter_length & 1)\n Odd::solve();\n else\n Even::solve();\n return;\n}\n\n\/*\n Main\n code\n is\n over\n .\n If\n you\n are\n in\n a\n hurry\n trying\n to\n hack\n me\n you\n don't\n need\n to\n read\n the\n part\n left\n .\n Trust\n me\n .\n It\n is\n useless\n .\n My\n code\n always\ngets\na\nfailed\nsystem\ntest\n,\nso\nit\nwill\nbe\npretty\neasy\nfor\nyou\nto\nhack\nme\n.\nJust\nfind\na\ntest\ncase\nand\nhack\n.\nWish\nyou\nall\nhappy\nhack\n.\n _____\n\/ \\\\\n| . . |\n| |\n| | |\n| --- |\n| \\\\_\/ |\n\\\\_____\/\n\n*\/\n\n#ifdef DEBUG\n\nstruct I {\n int x;\n I() {}\n I(int y) : x(y) {}\n bool operator<(const I &a) const { return x < a.x; }\n};\n\npair<I, LL> time_limit_exceeded;\nconst bool FLAG = 1;\nstatic vector<I> wrong_answer;\nI *RP = new I;\n\nI FUCK = min(I{*RP}, I{0});\nstatic int memory_limit_exceeded[10];\nvi O() {\n cout << FUCK.x << endl;\n vi ert;\n int x = 0;\n x = (int)hypot(3.0, 4.0);\n ert.pb(x);\n if (x & 1)\n exit(0);\n auto t = lower_bound(ALL(ert), 5);\n static list<int> runtime_error_;\n return ert;\n}\n#endif \/\/ DEBUG\n\n#define MEI int\n#define ZI main\nMEI ZI() {\n#undef MEI\n#undef ZI\n\n MEI();\n ZI();\n\n#define BA return\n#define MEI 0\n#define ZI ;\n BA MEI ZI\n#undef BA\n#undef MEI\n#undef ZI\n}","fail":"\/\/ ba mei zi !\n\n#include <bits\/stdc++.h>\n\n#define HEAP priority_queue\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 forn(i, l, r) for (int i = (l); i <= (r); ++i)\n#define nrof(i, r, l) for (int i = (r); i >= (l); --i)\n#define FOR(a, b) for (auto(a) : (b))\n#define mp make_pair\n#define mt make_tuple\n#define pb push_back\n#define X first\n#define Y second\n#define eps 1e-6\n#define pi 3.1415926535897932384626433832795\n#define SZ(x) (int)x.size()\n#define ALL(x) x.begin(), x.end()\n#define FILL(a, b) memset((a), (b), sizeof((a)))\n#define MCPY(a, b) memcpy((a), (b), sizeof((b)))\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef double flt;\ntypedef vector<int> vi;\ntypedef vector<LL> vl;\ntypedef pair<int, int> pii;\ntypedef pair<int, LL> pil;\ntypedef pair<LL, int> pli;\ntypedef pair<LL, LL> pll;\ntypedef vector<pil> vil;\ntypedef vector<pii> vii;\ntypedef vector<pli> vli;\ntypedef vector<pll> vll;\n\nconst int iinf = 1e9 + 7;\nconst LL linf = 1ll << 60;\nconst flt dinf = 1e60;\n\ntemplate <typename T> inline void scf(T &x) {\n bool f = 0;\n x = 0;\n char c = getchar();\n while ((c < '0' || c > '9') && c != '-')\n c = getchar();\n if (c == '-') {\n f = 1;\n c = getchar();\n }\n while (c >= '0' && c <= '9') {\n x = x * 10 + c - '0';\n c = getchar();\n }\n if (f)\n x = -x;\n return;\n}\n\ntemplate <typename T1, typename T2> void scf(T1 &x, T2 &y) {\n scf(x);\n return scf(y);\n}\n\ntemplate <typename T1, typename T2, typename T3> void scf(T1 &x, T2 &y, T3 &z) {\n scf(x);\n scf(y);\n return scf(z);\n}\n\ntemplate <typename T1, typename T2, typename T3, typename T4>\nvoid scf(T1 &x, T2 &y, T3 &z, T4 &w) {\n scf(x);\n scf(y);\n scf(z);\n return scf(w);\n}\n\ninline char mygetchar() {\n char c = getchar();\n while (c == ' ' || c == '\\\\n')\n c = getchar();\n return c;\n}\n\ntemplate <typename T> void chkmax(T &x, const T &y) {\n if (y > x)\n x = y;\n return;\n}\n\ntemplate <typename T> void chkmin(T &x, const T &y) {\n if (y < x)\n x = y;\n return;\n}\n\n#ifdef ONLINE_JUDGE\n#define debug(x, c) ;\n#else\n#define DEBUG\n#define debug(x, c) cerr << #x << \"=\" << x << c;\n#endif\n\n\/\/---------------------------head----------------------------\n\nconst int N = 1e3 + 100;\nconst int mod = 1e9 + 7;\n\nint n, diameter_length, min_D;\nint dp[N][N], tag[N][N], current_time;\nvi g[N];\nvi diameter_path;\n\nnamespace TREE {\nint par[N], dep[N];\n\nvoid dfs(int u = 1, int fa = 0) {\n par[u] = fa;\n dep[u] = dep[fa] + 1;\n for (int v : g[u])\n if (v != fa)\n dfs(v, u);\n return;\n}\n\nvoid get_diameter() {\n dfs();\n int mx = -1, S, T;\n forn(i, 1, n) if (dep[i] > mx) mx = dep[i], S = i;\n dfs(S);\n mx = -1;\n forn(i, 1, n) if (dep[i] > mx) mx = dep[i], T = i;\n\n diameter_length = dep[T] - 1;\n min_D = dep[T] >> 1;\n\n int u = T;\n while (u != S)\n diameter_path.pb(u), u = par[u];\n diameter_path.pb(S);\n return;\n}\n} \/\/ namespace TREE\n\nvoid MEI() {\n scf(n);\n rep(i, n - 1) {\n int u, v;\n scf(u, v);\n g[u].pb(v);\n g[v].pb(u);\n }\n\n TREE::get_diameter();\n return;\n}\n\nnamespace Bamboo {\nvoid solve() {\n dp[0][0] = 1;\n forn(i, 1, n - 1) {\n dp[i][0] = dp[i][i] = 1;\n forn(j, 1, i - 1) dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]) % mod;\n }\n printf(\"%d\\\\n\", (n & 1) ? dp[n - 1][min_D] : (dp[n - 1][min_D] * 2 % mod));\n return;\n}\n} \/\/ namespace Bamboo\n\nvoid DP(int u, int par, int max_down, int max_up) {\n if (tag[u][max_down] == current_time)\n return;\n\n tag[u][max_down] = current_time;\n int &t = dp[u][max_down];\n t = 1;\n\n for (int v : g[u])\n if (v != par) {\n int foo = 0;\n if (max_down)\n DP(v, u, max_down - 1, max_up), foo += dp[v][max_down - 1];\n if (max_up)\n DP(v, u, max_down, max_up - 1), foo += dp[v][max_down];\n t = 1ll * t * foo % mod;\n }\n return;\n}\n\nnamespace Odd {\nint ans = 0;\nint root1, root2;\n\nvoid case1() {\n rep(down2, min_D) {\n int up1 = min_D - 1 - down2;\n int up2 = up1, down1 = down2;\n\n current_time++;\n DP(root2, root1, down2, up2);\n int foo = dp[root2][down2];\n\n current_time++;\n DP(root1, root2, down1, up1);\n foo = 1ll * foo * dp[root1][down1] % mod;\n ans += foo;\n if (ans >= mod)\n ans -= mod;\n }\n debug(ans, '\\\\n') return;\n}\n\nvoid case2() {\n forn(down2, 1, min_D - 1) {\n int up2 = min_D - 1 - down2;\n int up1 = min_D - down2;\n int down1 = min_D - 1 - up1;\n\n current_time++;\n DP(root2, root1, down2, up2);\n int foo = dp[root2][down2];\n\n current_time++;\n DP(root1, root2, down1, up1);\n foo = 1ll * foo * dp[root1][down1] % mod;\n ans += foo;\n if (ans >= mod)\n ans -= mod;\n }\n debug(ans, '\\\\n') return;\n}\n\nvoid case3() {\n rep(down2, min_D) {\n int up1 = min_D - down2;\n int up2 = up1 - 1;\n int down1 = min_D - up1;\n\n current_time++;\n DP(root2, root1, down2, up2);\n int foo = dp[root2][down2];\n\n current_time++;\n DP(root1, root2, down1, up1);\n LL bar = dp[root1][down1];\n if (down1 > 0) {\n current_time++;\n DP(root1, root2, down1 - 1, up1);\n bar += mod - dp[root1][down1 - 1];\n }\n if (up1 > 0) {\n current_time++;\n DP(root1, root2, down1, up1 - 1);\n bar += mod - dp[root1][down1];\n }\n\n foo = 1ll * foo * bar % mod;\n ans += foo;\n if (ans >= mod)\n ans -= mod;\n }\n debug(ans, '\\\\n') return;\n}\n\nvoid case4() {\n forn(down2, 1, min_D) {\n int up1 = min_D - down2;\n int up2 = up1;\n int down1 = min_D - 1 - up1;\n\n current_time++;\n DP(root2, root1, down2, up2);\n LL foo = dp[root2][down2];\n if (up2 > 0) {\n current_time++;\n DP(root2, root1, down2, up2 - 1);\n foo += mod - dp[root2][down2];\n }\n if (down2 > 0) {\n current_time++;\n DP(root2, root1, down2 - 1, up2);\n foo += mod - dp[root2][down2 - 1];\n }\n\n current_time++;\n DP(root1, root2, down1, up1);\n foo = foo * 1ll * dp[root1][down1] % mod;\n\n ans += foo;\n if (ans >= mod)\n ans -= mod;\n }\n debug(ans, '\\\\n') return;\n}\n\nvoid solve() {\n root1 = diameter_path[min_D - 1];\n root2 = diameter_path[min_D];\n case1();\n case2();\n case3();\n case4();\n ans += ans;\n if (ans >= mod)\n ans -= mod;\n printf(\"%d\\\\n\", ans);\n return;\n}\n} \/\/ namespace Odd\n\nnamespace Even {\nvoid solve() {\n int root = diameter_path[min_D];\n int ans = 0;\n forn(max_down, 0, min_D) {\n current_time++;\n DP(root, 0, max_down, min_D - max_down);\n ans += dp[root][max_down];\n if (ans >= mod)\n ans -= mod;\n }\n printf(\"%d\\\\n\", ans);\n return;\n}\n} \/\/ namespace Even\n\nvoid ZI() {\n if (diameter_length == n - 1)\n Bamboo::solve();\n else if (diameter_length & 1)\n Odd::solve();\n else\n Even::solve();\n return;\n}\n\n\/*\n Main\n code\n is\n over\n .\n If\n you\n are\n in\n a\n hurry\n trying\n to\n hack\n me\n you\n don't\n need\n to\n read\n the\n part\n left\n .\n Trust\n me\n .\n It\n is\n useless\n .\n My\n code\n always\ngets\na\nfailed\nsystem\ntest\n,\nso\nit\nwill\nbe\npretty\neasy\nfor\nyou\nto\nhack\nme\n.\nJust\nfind\na\ntest\ncase\nand\nhack\n.\nWish\nyou\nall\nhappy\nhack\n.\n _____\n\/ \\\\\n| . . |\n| |\n| | |\n| --- |\n| \\\\_\/ |\n\\\\_____\/\n\n*\/\n\n#ifdef DEBUG\n\nstruct I {\n int x;\n I() {}\n I(int y) : x(y) {}\n bool operator<(const I &a) const { return x < a.x; }\n};\n\npair<I, LL> time_limit_exceeded;\nconst bool FLAG = 1;\nstatic vector<I> wrong_answer;\nI *RP = new I;\n\nI FUCK = min(I{*RP}, I{0});\nstatic int memory_limit_exceeded[10];\nvi O() {\n cout << FUCK.x << endl;\n vi ert;\n int x = 0;\n x = (int)hypot(3.0, 4.0);\n ert.pb(x);\n if (x & 1)\n exit(0);\n auto t = lower_bound(ALL(ert), 5);\n static list<int> runtime_error_;\n return ert;\n}\n#endif \/\/ DEBUG\n\n#define MEI int\n#define ZI main\nMEI ZI() {\n#undef MEI\n#undef ZI\n\n MEI();\n ZI();\n\n#define BA return\n#define MEI 0\n#define ZI ;\n BA MEI ZI\n#undef BA\n#undef MEI\n#undef ZI\n}","change":"replace","i1":161,"i2":169,"j1":161,"j2":167,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03794","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n#define N 1200\n\nconst LL mod = 1000000007;\nLL n, rt, q[N], tot, len, head[N], f[N][N], fa[N], dep[N];\nbool vis[N];\nstruct edge {\n LL v, nxt;\n} e[N << 1];\n\nvoid add(LL x, LL y) {\n e[++tot].v = y;\n e[tot].nxt = head[x];\n head[x] = tot;\n}\n\nLL bfs(LL s) {\n memset(vis, 0, sizeof vis);\n LL tt = 0, ww = 1;\n q[1] = s;\n vis[s] = 1;\n while (tt < ww) {\n LL u = q[++tt];\n for (LL i = head[u], v; i; i = e[i].nxt)\n if (!vis[v = e[i].v]) {\n vis[v] = 1;\n q[++ww] = v;\n }\n }\n return q[n];\n}\n\nvoid dfs(LL u) {\n for (LL i = head[u], v; i; i = e[i].nxt)\n if ((v = e[i].v) != fa[u]) {\n fa[v] = u;\n dfs(v);\n }\n}\n\nvoid dp(LL u) {\n dep[u] = dep[fa[u]] + 1;\n for (LL i = 0; i <= len + 1 - dep[u]; ++i)\n f[u][i] = 1;\n for (LL i = head[u], v; i; i = e[i].nxt)\n if ((v = e[i].v) != fa[u]) {\n fa[v] = u;\n dp(v);\n for (LL j = 0; j <= len; ++j) {\n f[u][j] = f[u][j] * (f[v][j] + (j ? f[v][j - 1] : 0)) % mod;\n }\n }\n}\n\nint main() {\n scanf(\"%lld\", &n);\n for (LL i = 1; i < n; ++i) {\n LL x, y;\n scanf(\"%lld%lld\", &x, &y);\n add(x, y);\n add(y, x);\n }\n LL S = bfs(1);\n LL T = bfs(S);\n dfs(S);\n len = 0;\n for (LL i = T; i != S; i = fa[i])\n ++len;\n if (len & 1) {\n assert(0);\n } else {\n len \/= 2;\n rt = T;\n for (int i = 1; i <= len; ++i)\n rt = fa[rt];\n memset(fa, 0, sizeof fa);\n dp(rt);\n LL ans = 0;\n for (LL i = 0; i <= len; ++i)\n ans = (ans + f[rt][i]) % mod;\n printf(\"%lld\\\\n\", ans);\n }\n\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\ntypedef long long LL;\n#define N 1200\n\nconst LL mod = 1000000007;\nLL n, rt, rt1, rt2, q[N], tot, len, head[N], f[N][N][2], fa[N], dep[N];\nbool vis[N];\nstruct edge {\n LL v, nxt;\n} e[N << 1];\n\nvoid add(LL x, LL y) {\n e[++tot].v = y;\n e[tot].nxt = head[x];\n head[x] = tot;\n}\n\nLL bfs(LL s) {\n memset(vis, 0, sizeof vis);\n LL tt = 0, ww = 1;\n q[1] = s;\n vis[s] = 1;\n while (tt < ww) {\n LL u = q[++tt];\n for (LL i = head[u], v; i; i = e[i].nxt)\n if (!vis[v = e[i].v]) {\n vis[v] = 1;\n q[++ww] = v;\n }\n }\n return q[n];\n}\n\nvoid dfs(LL u) {\n for (LL i = head[u], v; i; i = e[i].nxt)\n if ((v = e[i].v) != fa[u]) {\n fa[v] = u;\n dfs(v);\n }\n}\n\nvoid dp(LL u) {\n for (LL i = 0; i <= len - dep[u]; ++i)\n f[u][i][0] = f[u][i][1] = f[u][i + 1][1] = 1;\n for (LL i = head[u], v; i; i = e[i].nxt)\n if ((v = e[i].v) != fa[u]) {\n dep[v] = dep[u] + 1;\n fa[v] = u;\n dp(v);\n for (LL j = 0; j <= len; ++j) {\n f[u][j][0] = f[u][j][0] * (f[v][j][0] + (j ? f[v][j - 1][0] : 0)) % mod;\n f[u][j][1] = f[u][j][1] * (f[v][j][1] + (j ? f[v][j - 1][1] : 0)) % mod;\n }\n }\n}\n\nint main() {\n scanf(\"%lld\", &n);\n for (LL i = 1; i < n; ++i) {\n LL x, y;\n scanf(\"%lld%lld\", &x, &y);\n add(x, y);\n add(y, x);\n }\n LL S = bfs(1);\n LL T = bfs(S);\n dfs(S);\n len = 0;\n for (LL i = T; i != S; i = fa[i])\n ++len;\n if (len & 1) {\n len \/= 2;\n rt1 = T;\n for (int i = 1; i <= len; ++i)\n rt1 = fa[rt1];\n rt2 = fa[rt1];\n memset(fa, 0, sizeof fa);\n fa[rt1] = rt2;\n fa[rt2] = rt1;\n dp(rt1);\n dp(rt2);\n LL ans = 0;\n#define f1 f[rt1]\n#define f2 f[rt2]\n for (LL i = 0; i <= len; ++i)\n ans = (ans + f1[i][0] * (f2[i][1] + f2[i + 1][1] - f2[i][0]) % mod +\n f2[i][0] * (f1[i][1] + f1[i + 1][1] - f1[i][0]) % mod -\n f1[i][0] * f2[i + 1][0] % mod - f1[i + 1][0] * f2[i][0] % mod +\n mod * 10) %\n mod;\n printf(\"%lld\\\\n\", ans);\n } else {\n len \/= 2;\n rt = T;\n for (int i = 1; i <= len; ++i)\n rt = fa[rt];\n memset(fa, 0, sizeof fa);\n dp(rt);\n LL ans = 0;\n for (LL i = 0; i <= len; ++i)\n ans = (ans + f[rt][i][0]) % mod;\n printf(\"%lld\\\\n\", ans);\n }\n\n return 0;\n}\n","change":"replace","i1":8,"i2":84,"j1":8,"j2":104,"error":"0","stderr":null,"stdout":"2\n"}
{"problem_id":"p03869","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\n\/*{{{*\/ \/\/ template\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nconstexpr int INF = numeric_limits<int>::max() \/ 2;\nconstexpr long long LINF = numeric_limits<long long>::max() \/ 3;\n#define mp make_pair\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se second\n#define all(v) (v).begin(), (v).end()\n#define sz(x) (int)(x).size()\n#define debug(x) cerr << #x << \":\" << x << endl\n#define debug2(x, y) cerr << #x << \",\" << #y \":\" << x << \",\" << y << endl\n\/\/ struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;\nstruct Double {\n double d;\n explicit Double(double x) : d(x) {}\n};\nostream &operator<<(ostream &os, const Double x) {\n os << fixed << setprecision(20) << x.d;\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"[\";\n for (const auto &v : vec) {\n os << v << \",\";\n }\n os << \"]\";\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> ostream &operator<<(ostream &os, const set<T> &st) {\n os << \"{\";\n for (T v : st)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U> inline void chmax(T &x, U y) {\n if (y > x)\n x = y;\n}\ntemplate <typename T, typename U> inline void chmin(T &x, U y) {\n if (y < x)\n x = y;\n}\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nll gcd(ll a, ll b) {\n if (b == 0)\n return a;\n else\n return gcd(b, a % b);\n}\n\/\/ constexpr double eps = 1e-14;\nconstexpr double eps = 1e-10;\nconstexpr ll mod = 1e9 + 7;\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\n\/*}}}*\/\n\nclass Point {\npublic:\n double x, y;\n Point() {}\n Point(double x, double y) : x(x), y(y) {}\n\n Point operator+(const Point &p) const { return Point(x + p.x, y + p.y); }\n Point operator-(const Point &p) const { return Point(x - p.x, y - p.y); }\n\n friend ostream &operator<<(ostream &os, const Point &p) {\n os << \"(\" << p.x << \",\" << p.y << \")\";\n return os;\n }\n};\n\nusing Vector = Point;\n\n\/\/ \u30d9\u30af\u30c8\u30eb\u306e\u504f\u89d2(\u30e9\u30b8\u30a2\u30f3)\ndouble arg(const Vector &v) { return atan2(v.y, v.x); }\n\ndouble abs(const Vector &v) { return sqrt(v.x * v.x + v.y * v.y); }\n\nint main() {\n vector<Point> ps(3);\n rep(i, 3) cin >> ps[i].x >> ps[i].y;\n swap(ps[1], ps[2]);\n\n double ans = 0;\n for (int i = 0; i < 3; i++) {\n for (int j = i + 1; j < 3; j++) {\n int k = 3 - i - j;\n Point a = ps[i];\n Point b = ps[j];\n Point c = ps[k];\n debug(a);\n debug(b);\n debug(c);\n\n double th1 = (arg(c - a) - arg(b - a)) \/ 2.0;\n double th2 = (arg(a - b) - arg(c - b)) \/ 2.0;\n if (th1 < 0)\n th1 *= -1;\n if (th2 < 0)\n th2 *= -1;\n\n assert(tan(th1) > 0);\n assert(tan(th2) > 0);\n\n double r = abs(b - a) \/ (2 + 1 \/ tan(th1) + 1 \/ tan(th2));\n assert(r > 0);\n ans = max(ans, r);\n }\n }\n cout << Double(ans) << endl;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\n\/*{{{*\/ \/\/ template\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nconstexpr int INF = numeric_limits<int>::max() \/ 2;\nconstexpr long long LINF = numeric_limits<long long>::max() \/ 3;\n#define mp make_pair\n#define pb push_back\n#define eb emplace_back\n#define fi first\n#define se second\n#define all(v) (v).begin(), (v).end()\n#define sz(x) (int)(x).size()\n#define debug(x) cerr << #x << \":\" << x << endl\n#define debug2(x, y) cerr << #x << \",\" << #y \":\" << x << \",\" << y << endl\n\/\/ struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;\nstruct Double {\n double d;\n explicit Double(double x) : d(x) {}\n};\nostream &operator<<(ostream &os, const Double x) {\n os << fixed << setprecision(20) << x.d;\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"[\";\n for (const auto &v : vec) {\n os << v << \",\";\n }\n os << \"]\";\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> ostream &operator<<(ostream &os, const set<T> &st) {\n os << \"{\";\n for (T v : st)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T, typename U> inline void chmax(T &x, U y) {\n if (y > x)\n x = y;\n}\ntemplate <typename T, typename U> inline void chmin(T &x, U y) {\n if (y < x)\n x = y;\n}\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nll gcd(ll a, ll b) {\n if (b == 0)\n return a;\n else\n return gcd(b, a % b);\n}\n\/\/ constexpr double eps = 1e-14;\nconstexpr double eps = 1e-10;\nconstexpr ll mod = 1e9 + 7;\nconst int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\n\/*}}}*\/\n\nclass Point {\npublic:\n double x, y;\n Point() {}\n Point(double x, double y) : x(x), y(y) {}\n\n Point operator+(const Point &p) const { return Point(x + p.x, y + p.y); }\n Point operator-(const Point &p) const { return Point(x - p.x, y - p.y); }\n\n friend ostream &operator<<(ostream &os, const Point &p) {\n os << \"(\" << p.x << \",\" << p.y << \")\";\n return os;\n }\n};\n\nusing Vector = Point;\n\n\/\/ \u30d9\u30af\u30c8\u30eb\u306e\u504f\u89d2(\u30e9\u30b8\u30a2\u30f3)\ndouble arg(const Vector &v) { return atan2(v.y, v.x); }\n\ndouble abs(const Vector &v) { return sqrt(v.x * v.x + v.y * v.y); }\n\nint main() {\n vector<Point> ps(3);\n rep(i, 3) cin >> ps[i].x >> ps[i].y;\n swap(ps[1], ps[2]);\n\n double ans = 0;\n for (int i = 0; i < 3; i++) {\n for (int j = i + 1; j < 3; j++) {\n int k = 3 - i - j;\n Point a = ps[i];\n Point b = ps[j];\n Point c = ps[k];\n debug(a);\n debug(b);\n debug(c);\n\n double th1 = (arg(c - a) - arg(b - a)) \/ 2.0;\n double th2 = (arg(a - b) - arg(c - b)) \/ 2.0;\n if (tan(th1) < 0)\n th1 *= -1;\n if (tan(th2) < 0)\n th2 *= -1;\n\n \/\/ assert(tan(th1) > 0);\n \/\/ assert(tan(th2) > 0);\n\n double r = abs(b - a) \/ (2 + 1 \/ tan(th1) + 1 \/ tan(th2));\n \/\/ assert(r > 0);\n ans = max(ans, r);\n }\n }\n cout << Double(ans) << endl;\n}\n","change":"replace","i1":109,"i2":119,"j1":109,"j2":119,"error":"WA","stderr":null,"stdout":0.2928932188}
{"problem_id":"p03869","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\nusing namespace std;\nusing P = complex<double>;\n\nnamespace std {\nbool operator<(const P &a, const P &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\n} \/\/ namespace std\n\nconst double EPS{1e-9};\nauto m = [](int x) { return x % 3; };\n\ndouble cross(const P &a, const P &b) { return imag(conj(a) * b); }\n\ndouble area2(const vector<P> p) {\n P a{p[1] - p[0]};\n P b{p[2] - p[0]};\n double theta{abs(arg(b) - arg(a))};\n return abs(a) * abs(b) * sin(theta);\n}\n\nint main() {\n vector<P> p(3);\n for (int i = 0; i < 3; i++) {\n double x, y;\n cin >> x >> y;\n p[i] = {x, y};\n }\n double ls{}, lmx{};\n for (int i = 0; i < 3; i++) {\n double l{abs(p[m(i + 1)] - p[m(i)])};\n ls += l;\n lmx = max(lmx, l);\n }\n double y{area2(p) \/ ls};\n auto f = [=](double x) { return (1.0 - x \/ y) * lmx - 2.0 * x; };\n double x{}, l{}, r{y};\n while (abs(f(x)) > EPS) {\n x = (l + r) \/ 2.0;\n ((f(x) >= 0) ? l : r) = x;\n }\n cout << fixed << setprecision(9) << x << endl;\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\nusing P = complex<double>;\n\nnamespace std {\nbool operator<(const P &a, const P &b) {\n return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);\n}\n} \/\/ namespace std\n\nconst double EPS{1e-9};\nauto m = [](int x) { return x % 3; };\n\ndouble cross(const P &a, const P &b) { return imag(conj(a) * b); }\n\ndouble area2(const vector<P> p) {\n P a{p[1] - p[0]};\n P b{p[2] - p[0]};\n return abs(real(a) * imag(b) - imag(a) * real(b));\n}\n\nint main() {\n vector<P> p(3);\n for (int i = 0; i < 3; i++) {\n double x, y;\n cin >> x >> y;\n p[i] = {x, y};\n }\n double ls{}, lmx{};\n for (int i = 0; i < 3; i++) {\n double l{abs(p[m(i + 1)] - p[m(i)])};\n ls += l;\n lmx = max(lmx, l);\n }\n double r{area2(p) \/ ls};\n cout << fixed << setprecision(10) << lmx * r \/ (lmx + 2.0 * r) << endl;\n return 0;\n}\n","change":"replace","i1":18,"i2":43,"j1":18,"j2":36,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03871","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\nusing namespace std;\nstruct fast_ios {\n fast_ios() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n };\n} fast_ios_;\n#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)\n#define REP(i, n) FOR(i, 0, n)\n#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)\n#define IREP(i, n) IFOR(i, 0, n)\n#define Sort(v) sort(v.begin(), v.end())\n#define Reverse(v) reverse(v.begin(), v.end())\n#define all(v) v.begin(), v.end()\n#define SZ(v) ((int)v.size())\n#define Lower_bound(v, x) \\\\\n distance(v.begin(), lower_bound(v.begin(), v.end(), x))\n#define Upper_bound(v, x) \\\\\n distance(v.begin(), upper_bound(v.begin(), v.end(), x))\n#define Max(a, b) a = max(a, b)\n#define Min(a, b) a = min(a, b)\n#define bit(n) (1LL << (n))\n#define bit_exist(x, n) ((x >> n) & 1)\n#define debug(x) cout << #x << \"=\" << x << endl;\n#define vdebug(v) \\\\\n cout << #v << \"=\" << endl; \\\\\n REP(i_debug, v.size()) { cout << v[i_debug] << \",\"; } \\\\\n cout << endl;\n#define mdebug(m) \\\\\n cout << #m << \"=\" << endl; \\\\\n REP(i_debug, m.size()) { \\\\\n REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << \",\"; } \\\\\n cout << endl; \\\\\n }\n#define pb push_back\n#define f first\n#define s second\n#define int long long\n#define INF 1000000000000000000\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) {\n for (auto &x : v)\n is >> x;\n return is;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> &v) {\n for (int i = 0; i < v.size(); i++) {\n cout << v[i];\n if (i != v.size() - 1)\n cout << endl;\n };\n return os;\n}\ntemplate <typename T> void Out(T x) { cout << x << endl; }\ntemplate <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {\n if (f)\n Out(y);\n else\n Out(n);\n}\n\nusing vec = vector<int>;\nusing mat = vector<vec>;\nusing Pii = pair<int, int>;\nusing PiP = pair<int, Pii>;\nusing PPi = pair<Pii, int>;\nusing bools = vector<bool>;\nusing pairs = vector<Pii>;\n\n\/\/ int dx[4] = {1,0,-1,0};\n\/\/ int dy[4] = {0,1,0,-1};\n\/\/ char d[4] = {'D','R','U','L'};\n\nconst int mod = 1000000007;\n\/\/ const int mod = 998244353;\n#define Add(x, y) x = (x + (y)) % mod\n#define Mult(x, y) x = (x * (y)) % mod\n\nsigned main() {\n\n vector<double> p(6), q(6);\n cin >> p;\n cin >> q;\n REP(i, 6) {\n p[i] \/= 100.0;\n q[i] \/= 100.0;\n }\n\n double ans = 1.0;\n \/\/ REP(i, 6) ans += max(p[i], q[i]) * 0.5;\n for (double a = 0.3; a <= 0.7; a += 1.0e-9) {\n double tmp = 0.0;\n double b = 1.0 - a;\n REP(i, 6) tmp += max(a * p[i], b * q[i]);\n Min(ans, tmp);\n }\n Out(ans);\n\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\nstruct fast_ios {\n fast_ios() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n };\n} fast_ios_;\n#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)\n#define REP(i, n) FOR(i, 0, n)\n#define IFOR(i, begin, end) for (int i = (end)-1; i >= (begin); i--)\n#define IREP(i, n) IFOR(i, 0, n)\n#define Sort(v) sort(v.begin(), v.end())\n#define Reverse(v) reverse(v.begin(), v.end())\n#define all(v) v.begin(), v.end()\n#define SZ(v) ((int)v.size())\n#define Lower_bound(v, x) \\\\\n distance(v.begin(), lower_bound(v.begin(), v.end(), x))\n#define Upper_bound(v, x) \\\\\n distance(v.begin(), upper_bound(v.begin(), v.end(), x))\n#define Max(a, b) a = max(a, b)\n#define Min(a, b) a = min(a, b)\n#define bit(n) (1LL << (n))\n#define bit_exist(x, n) ((x >> n) & 1)\n#define debug(x) cout << #x << \"=\" << x << endl;\n#define vdebug(v) \\\\\n cout << #v << \"=\" << endl; \\\\\n REP(i_debug, v.size()) { cout << v[i_debug] << \",\"; } \\\\\n cout << endl;\n#define mdebug(m) \\\\\n cout << #m << \"=\" << endl; \\\\\n REP(i_debug, m.size()) { \\\\\n REP(j_debug, m[i_debug].size()) { cout << m[i_debug][j_debug] << \",\"; } \\\\\n cout << endl; \\\\\n }\n#define pb push_back\n#define f first\n#define s second\n#define int long long\n#define INF 1000000000000000000\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &v) {\n for (auto &x : v)\n is >> x;\n return is;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, vector<T> &v) {\n for (int i = 0; i < v.size(); i++) {\n cout << v[i];\n if (i != v.size() - 1)\n cout << endl;\n };\n return os;\n}\ntemplate <typename T> void Out(T x) { cout << x << endl; }\ntemplate <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {\n if (f)\n Out(y);\n else\n Out(n);\n}\n\nusing vec = vector<int>;\nusing mat = vector<vec>;\nusing Pii = pair<int, int>;\nusing PiP = pair<int, Pii>;\nusing PPi = pair<Pii, int>;\nusing bools = vector<bool>;\nusing pairs = vector<Pii>;\n\n\/\/ int dx[4] = {1,0,-1,0};\n\/\/ int dy[4] = {0,1,0,-1};\n\/\/ char d[4] = {'D','R','U','L'};\n\nconst int mod = 1000000007;\n\/\/ const int mod = 998244353;\n#define Add(x, y) x = (x + (y)) % mod\n#define Mult(x, y) x = (x * (y)) % mod\n\nsigned main() {\n\n vector<double> p(6), q(6);\n cin >> p;\n cin >> q;\n REP(i, 6) {\n p[i] \/= 100.0;\n q[i] \/= 100.0;\n }\n\n double ans = 1.0;\n double a0 = 0.0, a1 = 1.0;\n while (true) {\n double A0 = a0 + (a1 - a0) \/ 3, A1 = a0 + (a1 - a0) * 2 \/ 3;\n double val0 = 0.0, val1 = 0.0;\n REP(i, 6) {\n val0 += max(A0 * p[i], (1.0 - A0) * q[i]);\n val1 += max(A1 * p[i], (1.0 - A1) * q[i]);\n }\n\n if (val0 > val1)\n a0 = A0;\n else\n a1 = A1;\n\n if (a1 - a0 < 1.0e-11) {\n Out((val0 + val1) \/ 2.0);\n return 0;\n }\n }\n \/\/ Out(ans);\n\n return 0;\n}\n","change":"replace","i1":90,"i2":98,"j1":90,"j2":110,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03872","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n#include <unistd.h>\n#define ll long long\n#define inf 1000000007\n#define inf16 0x3f3f3f3f\n#define INF 1000000000000000007LL\n#define VI vector<int>\n#define VPII vector<pair<int, int>>\n#define VLL vector<ll>\n#define PII pair<int, int>\n#define st first\n#define nd second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define endl '\\\\n'\n#define ALL(c) (c).begin(), (c).end()\nusing namespace std;\n\nconst int N = 15;\n\nint n;\n\nint x[N];\nint y[N];\nint a[N];\n\ndouble mst[1 << N];\ndouble sum[1 << N];\ndouble dist[N][N];\nint dp[1 << N];\nint ok[1 << N];\n\nVPII E;\n\nbool check(double k) {\n for (int i = 0; i < 1 << n; ++i) {\n dp[i] = 0;\n\n if (sum[i] >= __builtin_popcount(i) * k + mst[i])\n ok[i] = 1;\n else\n ok[i] = 0;\n }\n\n dp[0] = 1;\n\n for (int i = 0; i < 1 << n; ++i) {\n for (int j = i;; j = (j - 1) & i) {\n if (ok[j] && dp[i ^ j])\n dp[i] = 1;\n\n if (!j)\n break;\n }\n }\n\n return dp[(1 << n) - 1];\n}\n\nint p[N];\n\nint Find(int a) {\n if (p[a] != a)\n p[a] = Find(p[a]);\n\n return p[a];\n}\n\ndouble licz(int m) {\n for (int i = 0; i < n; ++i) {\n p[i] = i;\n }\n\n double res = 0;\n\n for (auto &it : E) {\n if ((m & (1 << it.st)) && (m & (1 << it.nd))) {\n int a = Find(it.st);\n int b = Find(it.nd);\n\n if (a != b) {\n res += dist[it.st][it.nd];\n p[a] = b;\n }\n }\n }\n\n return res;\n}\n\nint32_t main() {\n ios_base::sync_with_stdio(0);\n cin.tie(NULL);\n\n cin >> n;\n\n for (int i = 0; i < n; ++i) {\n cin >> x[i] >> y[i] >> a[i];\n }\n\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n dist[i][j] = sqrt((ll)(x[i] - x[j]) * (x[i] - x[j]) +\n (ll)(y[i] - y[j]) * (y[i] - y[j]));\n E.eb(i, j);\n }\n }\n\n sort(ALL(E),\n [](PII a, PII b) { return dist[a.st][a.nd] < dist[b.st][b.nd]; });\n\n for (int i = 0; i < 1 << n; ++i) {\n mst[i] = licz(i);\n }\n\n for (int i = 0; i < 1 << n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (i & (1 << j))\n sum[i] += a[j];\n }\n }\n\n double l = 0, r = 1e9;\n\n for (int i = 0; i < 70; ++i) {\n double m = (l + r) \/ 2;\n\n if (check(m))\n l = m;\n else\n r = m;\n }\n\n cout << fixed << setprecision(20) << l << endl;\n}","fail":"#include <bits\/stdc++.h>\n#include <unistd.h>\n#define ll long long\n#define inf 1000000007\n#define inf16 0x3f3f3f3f\n#define INF 1000000000000000007LL\n#define VI vector<int>\n#define VPII vector<pair<int, int>>\n#define VLL vector<ll>\n#define PII pair<int, int>\n#define st first\n#define nd second\n#define pb push_back\n#define mp make_pair\n#define eb emplace_back\n#define endl '\\\\n'\n#define ALL(c) (c).begin(), (c).end()\nusing namespace std;\n\nconst int N = 15;\n\nint n;\n\nint x[N];\nint y[N];\nint a[N];\n\ndouble mst[1 << N];\ndouble sum[1 << N];\ndouble dist[N][N];\nint dp[1 << N];\nint ok[1 << N];\n\nVPII E;\n\nbool check(double k) {\n for (int i = 0; i < 1 << n; ++i) {\n dp[i] = 0;\n\n if (sum[i] >= __builtin_popcount(i) * k + mst[i])\n ok[i] = 1;\n else\n ok[i] = 0;\n }\n\n dp[0] = 1;\n\n for (int i = 0; i < 1 << n; ++i) {\n for (int j = i;; j = (j - 1) & i) {\n if (ok[j] && dp[i ^ j]) {\n dp[i] = 1;\n break;\n }\n\n if (!j)\n break;\n }\n }\n\n return dp[(1 << n) - 1];\n}\n\nint p[N];\n\nint Find(int a) {\n if (p[a] != a)\n p[a] = Find(p[a]);\n\n return p[a];\n}\n\ndouble licz(int m) {\n for (int i = 0; i < n; ++i) {\n p[i] = i;\n }\n\n double res = 0;\n\n for (auto &it : E) {\n if ((m & (1 << it.st)) && (m & (1 << it.nd))) {\n int a = Find(it.st);\n int b = Find(it.nd);\n\n if (a != b) {\n res += dist[it.st][it.nd];\n p[a] = b;\n }\n }\n }\n\n return res;\n}\n\nint32_t main() {\n ios_base::sync_with_stdio(0);\n cin.tie(NULL);\n\n cin >> n;\n\n for (int i = 0; i < n; ++i) {\n cin >> x[i] >> y[i] >> a[i];\n }\n\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n dist[i][j] = sqrt((ll)(x[i] - x[j]) * (x[i] - x[j]) +\n (ll)(y[i] - y[j]) * (y[i] - y[j]));\n E.eb(i, j);\n }\n }\n\n sort(ALL(E),\n [](PII a, PII b) { return dist[a.st][a.nd] < dist[b.st][b.nd]; });\n\n for (int i = 0; i < 1 << n; ++i) {\n mst[i] = licz(i);\n }\n\n for (int i = 0; i < 1 << n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (i & (1 << j))\n sum[i] += a[j];\n }\n }\n\n double l = 0, r = 1e9;\n\n for (int i = 0; i < 70; ++i) {\n double m = (l + r) \/ 2;\n\n if (check(m))\n l = m;\n else\n r = m;\n }\n\n cout << fixed << setprecision(20) << l << endl;\n}","change":"replace","i1":49,"i2":51,"j1":49,"j2":53,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03872","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\nconst int N = 16;\ndouble dis[N][N], f[1 << N], x[N], y[N], a[N];\nint n, m;\nint main() {\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> x[i] >> y[i] >> a[i];\n }\n for (int i = 1; i <= n; i++)\n for (int j = 1; j <= n; j++)\n dis[i][j] =\n sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]));\n for (int i = 0; i <= 1 << n; i++)\n f[i] = 1e18;\n f[0] = 0;\n for (int i = 0; i < 1 << n; i++)\n f[1 << i] = 0;\n for (int s = 0; s < 1 << n; s++) {\n for (int i = 0; i <= n - 1; i++)\n for (int j = 0; j <= n - 1; j++)\n if ((s & (1 << i)) && (!(s & (1 << j))))\n f[s | (1 << j)] = min(f[s | (1 << j)], f[s] + dis[i + 1][j + 1]);\n }\n for (int s = 0; s < 1 << n; s++) {\n f[s] = -f[s];\n for (int i = 0; i < n; i++)\n if (s & (1 << i))\n f[s] += a[i + 1];\n f[s] \/= (double)__builtin_popcount(s);\n for (int t = (s - 1) & s; t; t = (t - 1) & s)\n f[s] = max(f[s], min(f[t], f[s - t]));\n }\n printf(\"%.10lf\\\\n\", f[(1 << n) - 1]);\n}","fail":"#include <bits\/stdc++.h>\nusing namespace std;\nconst int N = 17;\ndouble dis[N][N], f[1 << N], x[N], y[N], a[N];\nint n, m;\nint main() {\n cin >> n;\n for (int i = 1; i <= n; i++) {\n cin >> x[i] >> y[i] >> a[i];\n }\n for (int i = 1; i <= n; i++)\n for (int j = 1; j <= n; j++)\n dis[i][j] =\n sqrt((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]));\n for (int i = 0; i <= 1 << n; i++)\n f[i] = 1e18;\n f[0] = 0;\n for (int i = 0; i < n; i++)\n f[1 << i] = 0;\n for (int s = 0; s < 1 << n; s++) {\n for (int i = 0; i <= n - 1; i++)\n for (int j = 0; j <= n - 1; j++)\n if ((s & (1 << i)) && (!(s & (1 << j))))\n f[s | (1 << j)] = min(f[s | (1 << j)], f[s] + dis[i + 1][j + 1]);\n }\n for (int s = 0; s < 1 << n; s++) {\n f[s] = -f[s];\n for (int i = 0; i < n; i++)\n if (s & (1 << i))\n f[s] += a[i + 1];\n f[s] \/= __builtin_popcount(s);\n for (int t = (s - 1) & s; t; t = (t - 1) & s)\n f[s] = max(f[s], min(f[t], f[s - t]));\n }\n printf(\"%.10lf\\\\n\", f[(1 << n) - 1]);\n}","change":"replace","i1":2,"i2":31,"j1":2,"j2":31,"error":"WA","stderr":null,"stdout":6.5}
{"problem_id":"p03872","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#define PB push_back\n#define MP make_pair\n#define sz(v) (in((v).size()))\n#define forn(i, n) for (in i = 0; i < (n); ++i)\n#define forv(i, v) forn(i, sz(v))\n#define fors(i, s) for (auto i = (s).begin(); i != (s).end(); ++i)\n#define all(v) (v).begin(), (v).end()\nusing namespace std;\ntypedef long long in;\ntypedef vector<in> VI;\ntypedef vector<VI> VVI;\nin p2(in a) { return 1LL << a; }\nvector<double> a;\nvector<vector<double>> ds;\nvector<double> sms;\nstruct unifnd {\n VI ht, pr;\n in fnd(in a) {\n in ta = a;\n while (a != pr[a])\n a = pr[a];\n in tt = ta;\n while (ta != a) {\n tt = pr[ta];\n pr[ta] = a;\n ta = tt;\n }\n return a;\n }\n void uni(in a, in b) {\n a = fnd(a);\n b = fnd(b);\n if (a == b)\n return;\n if (ht[b] < ht[a])\n swap(a, b);\n pr[a] = b;\n ht[b] += (ht[a] == ht[b]);\n }\n void ini(in n) {\n ht.resize(n);\n pr.resize(n);\n forn(i, n) {\n ht[i] = 0;\n pr[i] = i;\n }\n }\n};\nunifnd tfd;\nin n;\nvector<pair<double, pair<in, in>>> egs;\ndouble spantri(in msk) {\n tfd.ini(16);\n egs.clear();\n forn(i, n) {\n if (!(msk & p2(i)))\n continue;\n forn(j, i) {\n if (!(msk & p2(j)))\n continue;\n egs.PB(MP(ds[i][j], MP(i, j)));\n }\n }\n sort(all(egs));\n double sm = 0;\n forv(i, egs) {\n if (tfd.fnd(egs[i].second.first) != tfd.fnd(egs[i].second.second)) {\n tfd.uni(egs[i].second.first, egs[i].second.second);\n sm += egs[i].first;\n }\n }\n return sm;\n}\nvector<double> bsmin;\nvector<double> stri;\ndouble sq(double aa) { return aa * aa; }\nvector<double> x, y;\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cin >> n;\n x = y = a = vector<double>(n);\n forn(i, n) cin >> x[i] >> y[i] >> a[i];\n ds = vector<vector<double>>(n, vector<double>(n));\n forn(i, n) {\n forn(j, n) { ds[i][j] = sqrt(sq(x[i] - x[j]) + sq(y[i] - y[j])); }\n }\n bsmin = stri = sms = vector<double>(p2(n), 0);\n forn(msk, p2(n)) {\n stri[msk] = spantri(msk);\n sms[msk] = 0;\n forn(i, n) {\n if (msk & p2(i))\n sms[msk] += a[i];\n }\n }\n vector<in> p3;\n p3.PB(1);\n forn(i, 16) { p3[i + 1] = p3[i] * 3; }\n bsmin[0] = 1e18;\n in upmsk, dnmsk;\n forn(msk, p3[n]) {\n upmsk = dnmsk = 0;\n forn(i, n) {\n if (msk % 3)\n dnmsk |= p2(i);\n if (msk % 3 == 2)\n upmsk |= p2(i);\n msk \/= 3;\n }\n if (dnmsk == 0)\n continue;\n bsmin[upmsk] =\n max(bsmin[upmsk], min(bsmin[upmsk ^ dnmsk], sms[dnmsk] - stri[dnmsk]));\n }\n cout << setprecision(15);\n cout << bsmin[p2(n) - 1] << endl;\n return 0;\n}\n","fail":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#define PB push_back\n#define MP make_pair\n#define sz(v) (in((v).size()))\n#define forn(i, n) for (in i = 0; i < (n); ++i)\n#define forv(i, v) forn(i, sz(v))\n#define fors(i, s) for (auto i = (s).begin(); i != (s).end(); ++i)\n#define all(v) (v).begin(), (v).end()\nusing namespace std;\ntypedef long long in;\ntypedef vector<in> VI;\ntypedef vector<VI> VVI;\nin p2(in a) { return 1LL << a; }\nstruct unifnd {\n VI ht, pr;\n in fnd(in a) {\n in ta = a;\n while (a != pr[a])\n a = pr[a];\n in tt = ta;\n while (ta != a) {\n tt = pr[ta];\n pr[ta] = a;\n ta = tt;\n }\n return a;\n }\n void uni(in a, in b) {\n a = fnd(a);\n b = fnd(b);\n if (a == b)\n return;\n if (ht[b] < ht[a])\n swap(a, b);\n pr[a] = b;\n ht[b] += (ht[a] == ht[b]);\n }\n void ini(in n) {\n ht.resize(n);\n pr.resize(n);\n forn(i, n) {\n ht[i] = 0;\n pr[i] = i;\n }\n }\n};\nunifnd tfd;\nvector<double> x, y, a;\nvector<double> bspan;\nvector<pair<double, pair<in, in>>> egs;\ndouble sq(double d) { return d * d; }\ndouble dist(in i, in j) { return sqrt(sq(x[i] - x[j]) + sq(y[i] - y[j])); }\nvector<double> btot;\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n in n;\n cin >> n;\n x = y = a = vector<double>(n);\n forn(i, n) { cin >> x[i] >> y[i] >> a[i]; }\n forn(i, n) {\n forn(j, i) { egs.PB(MP(dist(i, j), MP(i, j))); }\n }\n sort(all(egs));\n bspan.resize(p2(n));\n bspan[0] = 2e9;\n in ta, tb;\n forn(msk, p2(n)) {\n if (!msk)\n continue;\n double tsm = 0;\n in tcnt = 0;\n tfd.ini(n);\n forn(i, n) {\n if (msk & p2(i)) {\n tsm += a[i];\n ++tcnt;\n }\n }\n for (auto &eg : egs) {\n ta = eg.second.first;\n tb = eg.second.second;\n if ((msk & p2(ta)) && (msk & p2(tb))) {\n if (tfd.fnd(ta) != tfd.fnd(tb)) {\n tfd.uni(ta, tb);\n tsm -= eg.first;\n }\n }\n }\n bspan[msk] = max(0.0, tsm \/ tcnt);\n }\n btot.resize(p2(n));\n btot[0] = 2e9;\n forn(msk, p2(n)) {\n if (!msk)\n continue;\n for (in lmsk = msk; lmsk > 0; lmsk = (lmsk - 1) & msk) {\n btot[msk] = max(btot[msk], min(btot[msk ^ lmsk], bspan[lmsk]));\n }\n }\n cout << setprecision(15);\n cout << btot[p2(n) - 1] << endl;\n return 0;\n}\n","change":"replace","i1":21,"i2":126,"j1":21,"j2":110,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03873","language":"C++","original_status":"Memory Limit Exceeded","pass":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nint N;\npair<int, int> A[5000];\nlong long *dp1[5000];\nlong long dp2[5000][5001];\n\nlong long prefix(int pos, int typeA) {\n if (pos == -1)\n return 0;\n long long &ret = dp1[pos][typeA];\n if (ret != -1)\n return ret;\n ret = 0x3f3f3f3f3f3f3f3fLL;\n int typeB = pos - typeA + 1;\n int len = A[pos].first + A[pos].second;\n if (typeA > 0)\n ret = min(ret, 1LL * len * (typeA - 1) + A[pos].second +\n prefix(pos - 1, typeA - 1));\n if (typeB > 0)\n ret = min(ret,\n 1LL * len * (typeB - 1) + A[pos].first + prefix(pos - 1, typeA));\n return ret;\n}\n\nlong long suffix1(int pos, int typeA) {\n if (pos == N) {\n if (typeA == (N - 1) \/ 2)\n return 0;\n return 0x3f3f3f3f3f3f3f3fLL;\n }\n long long &ret = dp2[pos][typeA];\n if (ret != -1)\n return ret;\n ret = 0x3f3f3f3f3f3f3f3fLL;\n int typeB = pos - typeA - 1;\n int len = A[pos].first + A[pos].second;\n ret =\n min(ret, 1LL * len * typeA + A[pos].second + suffix1(pos + 1, typeA + 1));\n ret = min(ret, 1LL * len * typeB + A[pos].first + suffix1(pos + 1, typeA));\n return ret;\n}\n\nlong long suffix2(int pos, int typeA) {\n if (pos == N) {\n if (typeA == (N - 1) \/ 2 + 1)\n return 0;\n return 0x3f3f3f3f3f3f3f3fLL;\n }\n long long &ret = dp2[pos][typeA];\n if (ret != -1)\n return ret;\n ret = 0x3f3f3f3f3f3f3f3fLL;\n int typeB = pos - typeA - 1;\n int len = A[pos].first + A[pos].second;\n ret =\n min(ret, 1LL * len * typeA + A[pos].second + suffix2(pos + 1, typeA + 1));\n ret = min(ret, 1LL * len * typeB + A[pos].first + suffix2(pos + 1, typeA));\n return ret;\n}\n\nint main() {\n scanf(\"%d\", &N);\n for (int i = 0; i < N; i++)\n scanf(\"%d%d\", &A[i].first, &A[i].second);\n sort(A, A + N, [](const pair<int, int> &a, const pair<int, int> &b) {\n return a.first + a.second > b.first + b.second;\n });\n memset(dp2, -1, sizeof dp2);\n long long ans = 0x3f3f3f3f3f3f3f3fLL;\n for (int i = 1; i < N; i++) {\n dp1[i - 1] = new long long[min((N - 1) \/ 2 + 1, i) + 1];\n for (int j = 0; j <= min((N - 1) \/ 2 + 1, i); j++)\n dp1[i - 1][j] = -1;\n }\n for (int i = 0; i < N; i++) {\n for (int j = 0; j <= min((N - 1) \/ 2, i); j++)\n ans = min(ans, 1LL * A[i].first * ((N - 1) \/ 2) +\n 1LL * A[i].second * (N - 1 - (N - 1) \/ 2) +\n prefix(i - 1, j) + suffix1(i + 1, j));\n }\n memset(dp2, -1, sizeof dp2);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j <= min((N - 1) \/ 2 + 1, i); j++)\n ans = min(ans, 1LL * A[i].first * ((N - 1) \/ 2 + 1) +\n 1LL * A[i].second * (N - 1 - ((N - 1) \/ 2 + 1)) +\n prefix(i - 1, j) + suffix2(i + 1, j));\n }\n printf(\"%lld\\\\n\", ans);\n return 0;\n}\n","fail":"#include <bits\/stdc++.h>\n\nusing namespace std;\n\nint N;\npair<int, int> A[5000];\nlong long dp1[5000][2505];\nlong long dp2[5000][2505];\n\nlong long prefix(int pos, int typeA) {\n if (pos == -1)\n return 0;\n long long &ret = dp1[pos][typeA];\n if (ret != -1)\n return ret;\n ret = 0x3f3f3f3f3f3f3f3fLL;\n int typeB = pos - typeA + 1;\n int len = A[pos].first + A[pos].second;\n if (typeA > 0)\n ret = min(ret, 1LL * len * (typeA - 1) + A[pos].second +\n prefix(pos - 1, typeA - 1));\n if (typeB > 0)\n ret = min(ret,\n 1LL * len * (typeB - 1) + A[pos].first + prefix(pos - 1, typeA));\n return ret;\n}\n\nlong long suffix1(int pos, int typeA) {\n if (pos == N) {\n if (typeA == (N - 1) \/ 2)\n return 0;\n return 0x3f3f3f3f3f3f3f3fLL;\n }\n if (typeA > (N - 1) \/ 2)\n return 0x3f3f3f3f3f3f3f3fLL;\n long long &ret = dp2[pos][typeA];\n if (ret != -1)\n return ret;\n ret = 0x3f3f3f3f3f3f3f3fLL;\n int typeB = pos - typeA - 1;\n int len = A[pos].first + A[pos].second;\n ret =\n min(ret, 1LL * len * typeA + A[pos].second + suffix1(pos + 1, typeA + 1));\n ret = min(ret, 1LL * len * typeB + A[pos].first + suffix1(pos + 1, typeA));\n return ret;\n}\n\nlong long suffix2(int pos, int typeA) {\n if (pos == N) {\n if (typeA == (N - 1) \/ 2 + 1)\n return 0;\n return 0x3f3f3f3f3f3f3f3fLL;\n }\n if (typeA > (N - 1) \/ 2 + 1)\n return 0x3f3f3f3f3f3f3f3fLL;\n long long &ret = dp2[pos][typeA];\n if (ret != -1)\n return ret;\n ret = 0x3f3f3f3f3f3f3f3fLL;\n int typeB = pos - typeA - 1;\n int len = A[pos].first + A[pos].second;\n ret =\n min(ret, 1LL * len * typeA + A[pos].second + suffix2(pos + 1, typeA + 1));\n ret = min(ret, 1LL * len * typeB + A[pos].first + suffix2(pos + 1, typeA));\n return ret;\n}\n\nint main() {\n scanf(\"%d\", &N);\n for (int i = 0; i < N; i++)\n scanf(\"%d%d\", &A[i].first, &A[i].second);\n sort(A, A + N, [](const pair<int, int> &a, const pair<int, int> &b) {\n return a.first + a.second > b.first + b.second;\n });\n memset(dp1, -1, sizeof dp1);\n memset(dp2, -1, sizeof dp2);\n long long ans = 0x3f3f3f3f3f3f3f3fLL;\n for (int i = 0; i < N; i++) {\n for (int j = 0; j <= min((N - 1) \/ 2, i); j++)\n ans = min(ans, 1LL * A[i].first * ((N - 1) \/ 2) +\n 1LL * A[i].second * (N - 1 - (N - 1) \/ 2) +\n prefix(i - 1, j) + suffix1(i + 1, j));\n }\n memset(dp2, -1, sizeof dp2);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j <= min((N - 1) \/ 2 + 1, i); j++)\n ans = min(ans, 1LL * A[i].first * ((N - 1) \/ 2 + 1) +\n 1LL * A[i].second * (N - 1 - ((N - 1) \/ 2 + 1)) +\n prefix(i - 1, j) + suffix2(i + 1, j));\n }\n printf(\"%lld\\\\n\", ans);\n return 0;\n}\n","change":"replace","i1":6,"i2":77,"j1":6,"j2":77,"error":"MLE","stderr":null,"stdout":null}
{"problem_id":"p03873","language":"C++","original_status":"Memory Limit Exceeded","pass":"\/\/ +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ \\\\\\\\\n\n#include <bits\/stdc++.h>\n\n#define int ll\n\n#define F first\n#define S second\n#define _sz(x) (int)x.size()\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\n\nconst int N = 5000 + 20;\nint n, l[N], r[N], dp[N][N][2], ord[N];\n\ninline bool byLength(int i, int j) { return l[i] + r[i] > l[j] + r[j]; }\n\nint32_t main() {\n ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n\n cin >> n;\n for (int i = 0; i < n; i++)\n cin >> l[i] >> r[i];\n\n if (!(n & 1))\n n++;\n\n int k = (n - 1) \/ 2;\n\n iota(ord, ord + n, 0);\n sort(ord, ord + n, byLength);\n\n memset(dp, 127, sizeof dp);\n dp[0][0][0] = 0;\n\n for (int i = 0; i <= k; i++) {\n for (int j = 0; j <= k; j++) {\n for (int b = 0; b <= 1; b++) {\n int ind = ord[i + j + b], len = l[ind] + r[ind];\n\n if (i < k)\n dp[i + 1][j][b] =\n min(dp[i + 1][j][b], dp[i][j][b] + r[ind] + i * len);\n\n if (j < k)\n dp[i][j + 1][b] =\n min(dp[i][j + 1][b], dp[i][j][b] + l[ind] + j * len);\n\n if (b < 1)\n dp[i][j][b + 1] = min(dp[i][j][b + 1], dp[i][j][b] + k * len);\n }\n }\n }\n\n cout << dp[k][k][1] << '\\\\n';\n}\n","fail":"\/\/ +-- -- --++-- +-In the name of ALLAH-+ --++-- -- --+ \\\\\\\\\n\n#include <bits\/stdc++.h>\n\n#define int ll\n\n#define F first\n#define S second\n#define _sz(x) (int)x.size()\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pii = pair<int, int>;\n\nconst int N = 5000 + 20;\nint n, l[N], r[N], dp[2][N][2], ord[N];\n\ninline bool byLength(int i, int j) { return l[i] + r[i] > l[j] + r[j]; }\n\nint32_t main() {\n ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n\n cin >> n;\n for (int i = 0; i < n; i++)\n cin >> l[i] >> r[i];\n\n if (!(n & 1))\n n++;\n\n int k = (n - 1) \/ 2;\n\n iota(ord, ord + n, 0);\n sort(ord, ord + n, byLength);\n\n memset(dp, 127, sizeof dp);\n dp[0][0][0] = 0;\n\n for (int i = 0; i <= k; i++) {\n int nw = i & 1, nxt = !nw;\n\n memset(dp[nxt], 127, sizeof dp[nxt]);\n\n for (int j = 0; j <= k; j++) {\n for (int b = 0; b <= 1; b++) {\n int ind = ord[i + j + b], len = l[ind] + r[ind];\n\n if (i < k)\n dp[nxt][j][b] = min(dp[nxt][j][b], dp[nw][j][b] + r[ind] + i * len);\n\n if (j < k)\n dp[nw][j + 1][b] =\n min(dp[nw][j + 1][b], dp[nw][j][b] + l[ind] + j * len);\n\n if (b < 1)\n dp[nw][j][b + 1] = min(dp[nw][j][b + 1], dp[nw][j][b] + k * len);\n }\n }\n }\n\n cout << dp[k & 1][k][1] << '\\\\n';\n}\n","change":"replace","i1":16,"i2":58,"j1":16,"j2":61,"error":"MLE","stderr":null,"stdout":null}
{"problem_id":"p03873","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iostream>\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 {\n int u, v;\n ll w;\n};\n\n#define rep(i, N) for (int i = 0; i < N; i++)\n#define pb push_back\n\nll MOD = 1000000007;\nll _MOD = 1000000009;\ndouble EPS = 1e-10;\n\nint main() {\n int N;\n cin >> N;\n int _N = N;\n vector<ll> a(N), b(N);\n rep(i, N) cin >> a[i] >> b[i];\n if (N % 2 == 0) {\n N++;\n a.pb(0);\n b.pb(0);\n }\n vector<pair<ll, ll_ll>> p(N);\n rep(i, N) p[i] = make_pair(a[i] + b[i], i_i(a[i], b[i]));\n sort(p.begin(), p.end());\n rep(i, N) a[i] = p[i].second.first, b[i] = p[i].second.second;\n int n = N \/ 2;\n if (_N % 2 == 0 || _N <= 10) {\n ll ans = n * (a[0] + b[0]);\n vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, LLONG_MAX));\n dp[0][0] = ans;\n for (int i = 0; i <= n; i++)\n for (int j = 0; j <= n; j++) {\n ll l = a[i + j + 1], r = b[i + j + 1];\n if (i < n) {\n ll x = dp[i][j] + r + (n - i - 1) * (l + r);\n dp[i + 1][j] = min(dp[i + 1][j], x);\n }\n if (j < n) {\n ll x = dp[i][j] + l + (n - j - 1) * (l + r);\n dp[i][j + 1] = min(dp[i][j + 1], x);\n }\n }\n cout << dp[n][n] << endl;\n return 0;\n }\n return -1;\n ll unko = LLONG_MAX;\n rep(t, 10) {\n ll ans = n * (a[0] + b[0]);\n vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, LLONG_MAX));\n dp[0][0] = ans;\n for (int i = 0; i <= n; i++)\n for (int j = 0; j <= n; j++) {\n ll l = a[i + j + 1], r = b[i + j + 1];\n if (i < n) {\n ll x = dp[i][j] + r + (n - i - 1) * (l + r);\n dp[i + 1][j] = min(dp[i + 1][j], x);\n }\n if (j < n) {\n ll x = dp[i][j] + l + (n - j - 1) * (l + r);\n dp[i][j + 1] = min(dp[i][j + 1], x);\n }\n }\n unko = min(unko, dp[n][n]);\n swap(a[0], a[t]);\n swap(b[0], b[t]);\n sort(a.begin() + 1, a.end());\n sort(b.begin() + 1, b.end());\n }\n cout << unko << endl;\n}\n","fail":"#include <algorithm>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iostream>\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 {\n int u, v;\n ll w;\n};\n\n#define rep(i, N) for (int i = 0; i < N; i++)\n#define pb push_back\n\nll MOD = 1000000007;\nll _MOD = 1000000009;\ndouble EPS = 1e-10;\n\nint main() {\n int N;\n cin >> N;\n int _N = N;\n vector<ll> a(N), b(N);\n rep(i, N) cin >> a[i] >> b[i];\n if (N % 2 == 0) {\n N++;\n a.pb(0);\n b.pb(0);\n }\n vector<pair<ll, ll_ll>> p(N);\n rep(i, N) p[i] = make_pair(a[i] + b[i], i_i(a[i], b[i]));\n sort(p.begin(), p.end());\n rep(i, N) a[i] = p[i].second.first, b[i] = p[i].second.second;\n int n = N \/ 2;\n if (_N % 2 == 0 || _N <= 10) {\n ll ans = n * (a[0] + b[0]);\n vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, LLONG_MAX));\n dp[0][0] = ans;\n for (int i = 0; i <= n; i++)\n for (int j = 0; j <= n; j++) {\n ll l = a[i + j + 1], r = b[i + j + 1];\n if (i < n) {\n ll x = dp[i][j] + r + (n - i - 1) * (l + r);\n dp[i + 1][j] = min(dp[i + 1][j], x);\n }\n if (j < n) {\n ll x = dp[i][j] + l + (n - j - 1) * (l + r);\n dp[i][j + 1] = min(dp[i][j + 1], x);\n }\n }\n cout << dp[n][n] << endl;\n return 0;\n }\n ll unko = LLONG_MAX;\n rep(t, 10) {\n ll ans = n * (a[0] + b[0]);\n vector<vector<ll>> dp(n + 1, vector<ll>(n + 1, LLONG_MAX));\n dp[0][0] = ans;\n for (int i = 0; i <= n; i++)\n for (int j = 0; j <= n; j++) {\n ll l = a[i + j + 1], r = b[i + j + 1];\n if (i < n) {\n ll x = dp[i][j] + r + (n - i - 1) * (l + r);\n dp[i + 1][j] = min(dp[i + 1][j], x);\n }\n if (j < n) {\n ll x = dp[i][j] + l + (n - j - 1) * (l + r);\n dp[i][j + 1] = min(dp[i][j + 1], x);\n }\n }\n unko = min(unko, dp[n][n]);\n vector<pair<ll, ll_ll>> _p = p;\n swap(_p[0], _p[t + 1]);\n sort(_p.begin() + 1, _p.end());\n rep(i, N) a[i] = _p[i].second.first, b[i] = _p[i].second.second;\n }\n cout << unko << endl;\n}\n","change":"replace","i1":73,"i2":96,"j1":73,"j2":95,"error":"0","stderr":null,"stdout":22.0}
{"problem_id":"p03873","language":"C++","original_status":"Memory Limit Exceeded","pass":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\n\nconst int MN = 5010;\n\nint N;\npii S[MN];\nint L[MN];\nll psum[MN];\n\nbool cmp(pii a, pii b) { return a.first + a.second < b.first + b.second; }\n\nint X;\nll cc[MN][MN][2];\nll dp(int x, int k, int t) {\n if (x == N)\n return k == 0 && t == 0 ? 0 : 1e18;\n ll &ret = cc[x][k][t];\n if (ret != 9e18)\n return ret;\n\n ret = 1e18;\n if (N - 1 - X - x - k >= 0)\n ret = min(ret,\n dp(x + 1, k, t) + S[x].second + 1LL * L[x] * (N - 1 - X - x - k));\n if (k)\n ret = min(ret, dp(x + 1, k - 1, t) + S[x].first + 1LL * L[x] * (k - 1));\n if (t)\n ret = min(ret, dp(x + 1, k, 0) + 1LL * L[x] * N \/ 2);\n return ret;\n}\n\nint main() {\n scanf(\"%d\", &N);\n\n for (int i = 0; i < N; i++) {\n scanf(\"%d %d\", &S[i].first, &S[i].second);\n }\n\n sort(S, S + N, cmp);\n\n ll ans = 1e18;\n\n for (int i = 0; i < N; i++) {\n L[i] = S[i].first + S[i].second;\n psum[i] = L[i];\n if (i)\n psum[i] += psum[i - 1];\n }\n\n for (int i = 0; i < MN; i++)\n for (int j = 0; j < MN; j++)\n cc[i][j][0] = 9e18;\n\n X = 0;\n for (int i = 0; i <= N; i++) {\n ans = min(ans, dp(0, i, 0));\n }\n\n if (N % 2) {\n for (int i = 0; i < MN; i++)\n for (int j = 0; j < MN; j++)\n for (int k = 0; k < 2; k++)\n cc[i][j][k] = 9e18;\n X = 1;\n ans = min(ans, dp(0, N \/ 2, 1));\n }\n\n printf(\"%lld\", ans);\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\n\nconst int MN = 5010;\n\nint N;\npii S[MN];\nint L[MN];\nll psum[MN];\n\nbool cmp(pii a, pii b) { return a.first + a.second < b.first + b.second; }\n\nll dp[2][MN][2];\n\nvoid prop() {\n for (int i = 0; i <= N; i++)\n for (int j = 0; j < 2; j++)\n dp[N & 1][i][j] = 1e18;\n dp[N & 1][0][0] = 0;\n for (int i = N - 1; i >= 0; i--) {\n int c = i & 1;\n int p = c ^ 1;\n for (int j = 0; j <= N; j++) {\n for (int k = 0; k < 2; k++) {\n ll &ret = dp[c][j][k];\n ret = 1e18;\n\n ret = min(ret,\n dp[p][j][k] + S[i].second + 1LL * L[i] * (N - 1 - i - j - k));\n if (j)\n ret = min(ret, dp[p][j - 1][k] + S[i].first + 1LL * L[i] * (j - 1));\n if (k)\n ret = min(ret, dp[p][j][0] + 1LL * L[i] * (N \/ 2));\n }\n }\n }\n}\n\nint main() {\n scanf(\"%d\", &N);\n\n for (int i = 0; i < N; i++) {\n scanf(\"%d %d\", &S[i].first, &S[i].second);\n }\n\n sort(S, S + N, cmp);\n\n ll ans = 1e18;\n\n for (int i = 0; i < N; i++) {\n L[i] = S[i].first + S[i].second;\n psum[i] = L[i];\n if (i)\n psum[i] += psum[i - 1];\n }\n\n prop();\n for (int i = 0; i <= N; i++) {\n ans = min(ans, dp[0][i][0]);\n }\n\n if (N % 2) {\n ans = min(ans, dp[0][N \/ 2][1]);\n }\n\n printf(\"%lld\", ans);\n}\n","change":"replace","i1":15,"i2":69,"j1":15,"j2":66,"error":"MLE","stderr":null,"stdout":null}
{"problem_id":"p03873","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#ifdef LOCAL\n#define eprintf(...) fprintf(stderr, __VA_ARGS__)\n#else\n#define eprintf(...) 42\n#endif\n\ntypedef long long int int64;\n\nstruct Seg {\n long long l, r;\n Seg() : l(), r() {}\n\n void read() { scanf(\"%lld%lld\", &l, &r); }\n\n bool operator<(const Seg &A) const {\n if (r + l != A.r + A.l)\n return r + l < A.r + A.l;\n return l < A.l;\n }\n};\n\nconst int N = 5005;\nSeg s[N];\n\nlong long dp[N \/ 2][N \/ 2][2];\n\nlong long INF = (long long)1e18;\nvoid updDp(long long &a, long long b) { a = min(a, b); }\n\nint main(int, char **) {\n#ifdef LOCAL\n freopen(\"input.txt\", \"r\", stdin);\n\/\/\tfreopen(\"output.txt\", \"w\", stdout);\n#endif\n\n int n;\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++)\n s[i].read();\n sort(s, s + n);\n\n for (int i = 0; i <= n; i++)\n for (int j = 0; j <= n; j++)\n for (int t = 0; t < 2; t++)\n dp[i][j][t] = INF;\n\n \/\/\tint ptr = 0;\n \/\/\twhile (ptr < n && s[ptr + 1].l + s[ptr + 1].r == s[ptr].l + s[ptr].r)\n \/\/\t\tptr++;\n \/\/\tswap(s[0], s[ptr \/ 2] );\n \/\/\tint sti = 0;\n long long std = 0;\n \/\/\tif (n % 2 == 1)\n \/\/\t{\n \/\/\t\tsti = 1;\n \/\/\t\tstd = (n \/ 2) * 1LL * (s[0].l + s[0].r);\n \/\/\t}\n dp[n \/ 2][n \/ 2][n % 2] = std;\n\n for (int i = 0; i < n; i++) {\n for (int rl = 0; rl <= n \/ 2; rl++) {\n for (int t = 0; t < 2; t++) {\n int rr = n - i - rl - t;\n if (rr < 0 || rr > n \/ 2)\n continue;\n\n if (rl != 0)\n updDp(dp[rl - 1][rr][t],\n (rl - 1) * 1LL * (s[i].l + s[i].r) + s[i].r + dp[rl][rr][t]);\n if (rr != 0)\n updDp(dp[rl][rr - 1][t],\n (rr - 1) * 1LL * (s[i].l + s[i].r) + s[i].l + dp[rl][rr][t]);\n if (t == 1)\n updDp(dp[rl][rr][0],\n dp[rl][rr][1] + (n \/ 2) * 1LL * (s[i].l + s[i].r));\n }\n }\n }\n long long ans = dp[0][0][0];\n printf(\"%lld\\\\n\", ans);\n\n return 0;\n}\n","fail":"#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#ifdef LOCAL\n#define eprintf(...) fprintf(stderr, __VA_ARGS__)\n#else\n#define eprintf(...) 42\n#endif\n\ntypedef long long int int64;\n\nstruct Seg {\n long long l, r;\n Seg() : l(), r() {}\n\n void read() { scanf(\"%lld%lld\", &l, &r); }\n\n bool operator<(const Seg &A) const {\n if (r + l != A.r + A.l)\n return r + l < A.r + A.l;\n return l < A.l;\n }\n};\n\nconst int N = 5005;\nSeg s[N];\n\nlong long dp[N \/ 2][N \/ 2][2];\n\nlong long INF = (long long)1e18;\nvoid updDp(long long &a, long long b) { a = min(a, b); }\n\nint main(int, char **) {\n#ifdef LOCAL\n freopen(\"input.txt\", \"r\", stdin);\n\/\/\tfreopen(\"output.txt\", \"w\", stdout);\n#endif\n\n int n;\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++)\n s[i].read();\n sort(s, s + n);\n\n for (int i = 0; i <= n \/ 2; i++)\n for (int j = 0; j <= n \/ 2; j++)\n for (int t = 0; t < 2; t++)\n dp[i][j][t] = INF;\n\n \/\/\tint ptr = 0;\n \/\/\twhile (ptr < n && s[ptr + 1].l + s[ptr + 1].r == s[ptr].l + s[ptr].r)\n \/\/\t\tptr++;\n \/\/\tswap(s[0], s[ptr \/ 2] );\n \/\/\tint sti = 0;\n long long std = 0;\n \/\/\tif (n % 2 == 1)\n \/\/\t{\n \/\/\t\tsti = 1;\n \/\/\t\tstd = (n \/ 2) * 1LL * (s[0].l + s[0].r);\n \/\/\t}\n dp[n \/ 2][n \/ 2][n % 2] = std;\n\n for (int i = 0; i < n; i++) {\n for (int rl = 0; rl <= n \/ 2; rl++) {\n for (int t = 0; t < 2; t++) {\n int rr = n - i - rl - t;\n if (rr < 0 || rr > n \/ 2)\n continue;\n\n if (rl != 0)\n updDp(dp[rl - 1][rr][t],\n (rl - 1) * 1LL * (s[i].l + s[i].r) + s[i].r + dp[rl][rr][t]);\n if (rr != 0)\n updDp(dp[rl][rr - 1][t],\n (rr - 1) * 1LL * (s[i].l + s[i].r) + s[i].l + dp[rl][rr][t]);\n if (t == 1)\n updDp(dp[rl][rr][0],\n dp[rl][rr][1] + (n \/ 2) * 1LL * (s[i].l + s[i].r));\n }\n }\n }\n long long ans = dp[0][0][0];\n printf(\"%lld\\\\n\", ans);\n\n return 0;\n}\n","change":"replace","i1":54,"i2":56,"j1":54,"j2":56,"error":"127","stderr":"\/tmp\/df169ced-d384-4667-bb4e-03a1f15cb701.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object\n","stdout":null}
{"problem_id":"p03873","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <typeinfo>\n#include <vector>\n#define syosu(x) fixed << setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<long double, long double> pdd;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<long double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<vc> vvc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<int, P> pip;\ntypedef vector<pip> vip;\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 61;\nconst double pi = acos(-1);\nconst double eps = 1e-10;\nconst ll mod = 1e9 + 7;\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\n\nint n;\nvl l, r;\nvpll a;\n\nint main() {\n cin >> n;\n l = r = vl(n);\n a = vpll(n);\n for (int i = 0; i < n; i++) {\n cin >> l[i] >> r[i];\n a[i] = {l[i] + r[i], i};\n }\n sort(a.begin(), a.end());\n int N = n \/ 2;\n vvl dp(n + 1, vl(N + 1)), DP(n + 1, vl(N + 1));\n for (int i = 1; i <= n; i++) {\n ll A = a[i - 1].first, I = a[i - 1].second;\n for (int j = 0; j <= min(i, N); j++)\n if (i - N <= j) {\n ll res = INF;\n if (j)\n res = dp[i - 1][j - 1] + r[I] + A * (N - j);\n if (i != j)\n res = min(res, dp[i - 1][j] + l[I] + A * (N - i + j));\n dp[i][j] = res;\n }\n }\n for (int i = n - 1; i >= 0; i--) {\n ll A = a[i].first, I = a[i].second;\n for (int j = 0; j <= min(n - i, N); j++)\n if (n - i - N <= j) {\n ll res = INF;\n if (j)\n res = DP[i + 1][j - 1] + r[I] + A * (j - 1);\n if (n - i != j)\n res = min(res, DP[i + 1][j] + l[I] + A * (n - i - j - 1));\n DP[i][j] = res;\n }\n }\n assert(n % 2 == 0);\n if (n % 2 == 0)\n cout << dp[n][N] << endl;\n else {\n ll res = INF;\n for (int i = 0; i < n; i++)\n for (int j = 0; j <= i; j++) {\n res = min(res, dp[i][j] + DP[i + 1][N - j] + a[i].first * N);\n }\n cout << res << endl;\n }\n}","fail":"#include <algorithm>\n#include <cassert>\n#include <cctype>\n#include <cmath>\n#include <complex>\n#include <cstdio>\n#include <fstream>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <typeinfo>\n#include <vector>\n#define syosu(x) fixed << setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<long double, long double> pdd;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<long double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<vc> vvc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<int, P> pip;\ntypedef vector<pip> vip;\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 61;\nconst double pi = acos(-1);\nconst double eps = 1e-10;\nconst ll mod = 1e9 + 7;\nconst int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};\n\nint n;\nvl l, r;\nvpll a;\n\nint main() {\n cin >> n;\n l = r = vl(n);\n a = vpll(n);\n for (int i = 0; i < n; i++) {\n cin >> l[i] >> r[i];\n a[i] = {l[i] + r[i], i};\n }\n sort(a.begin(), a.end());\n int N = n \/ 2;\n vvl dp(n + 1, vl(N + 1)), DP(n + 1, vl(N + 1));\n for (int i = 1; i <= n; i++) {\n ll A = a[i - 1].first, I = a[i - 1].second;\n for (int j = 0; j <= min(i, N); j++)\n if (i - N <= j) {\n ll res = INF;\n if (j)\n res = dp[i - 1][j - 1] + r[I] + A * (N - j);\n if (i != j)\n res = min(res, dp[i - 1][j] + l[I] + A * (N - i + j));\n dp[i][j] = res;\n }\n }\n for (int i = n - 1; i >= 0; i--) {\n ll A = a[i].first, I = a[i].second;\n for (int j = 0; j <= min(n - i, N); j++)\n if (n - i - N <= j) {\n ll res = INF;\n if (j)\n res = DP[i + 1][j - 1] + r[I] + A * (j - 1);\n if (n - i != j)\n res = min(res, DP[i + 1][j] + l[I] + A * (n - i - j - 1));\n DP[i][j] = res;\n }\n }\n if (n % 2 == 0)\n cout << dp[n][N] << endl;\n else {\n ll res = INF;\n for (int i = 0; i < n; i++)\n for (int j = max(0, N - n + i + 1); j <= min(i, N); j++) {\n res = min(res, dp[i][j] + DP[i + 1][N - j] + a[i].first * N);\n }\n cout << res << endl;\n }\n}","change":"replace","i1":86,"i2":93,"j1":86,"j2":92,"error":"0","stderr":null,"stdout":22.0}
{"problem_id":"p03873","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)\n#define all(c) c.begin(), c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nusing namespace std;\ntemplate <class S, class T>\nostream &operator<<(ostream &o, const pair<S, T> &p) {\n return o << \"(\" << p.fs << \",\" << p.sc << \")\";\n}\ntemplate <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {\n o << \"sz = \" << vc.size() << endl << \"[\";\n for (const T &v : vc)\n o << v << \",\";\n o << \"]\";\n return o;\n}\ntypedef long long ll;\nll inf = 1e18;\nint N;\nll L[5000], R[5000];\nll dp[2][2501][2501];\nint main() {\n cin >> N;\n rep(i, N) cin >> L[i] >> R[i];\n rep(i, N - 1) rep(j, N - 1) if (L[j] + R[j] < L[j + 1] + R[j + 1])\n swap(L[j], L[j + 1]),\n swap(R[j], R[j + 1]);\n rep(i, 2) rep(j, 2501) rep(k, 2501) dp[i][j][k] = inf;\n dp[0][0][0] = 0;\n rep(n, N) {\n rep(c, 2) rep(l, n + 1 - c) {\n int r = n - l - c;\n if (dp[c][l][r] == inf)\n continue;\n if (c == 0)\n chmin(dp[1][l][r], dp[0][l][r] + N \/ 2 * (L[n] + R[n]));\n if (l < 2500)\n chmin(dp[c][l + 1][r], dp[c][l][r] + l * (L[n] + R[n]) + R[n]);\n if (r < 2500)\n chmin(dp[c][l][r + 1], dp[c][l][r] + r * (L[n] + R[n]) + L[n]);\n }\n }\n ll ans = inf;\n rep(c, 2) rep(l, N + 1 - c) {\n int r = N - l - c;\n if (l <= 2500 && r <= 2500)\n chmin(ans, dp[c][l][r]);\n }\n cout << ans << endl;\n}\n","fail":"#include <bits\/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)\n#define all(c) c.begin(), c.end()\n#define pb push_back\n#define fs first\n#define sc second\n#define show(x) cout << #x << \" = \" << x << endl\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\nusing namespace std;\ntemplate <class S, class T>\nostream &operator<<(ostream &o, const pair<S, T> &p) {\n return o << \"(\" << p.fs << \",\" << p.sc << \")\";\n}\ntemplate <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {\n o << \"sz = \" << vc.size() << endl << \"[\";\n for (const T &v : vc)\n o << v << \",\";\n o << \"]\";\n return o;\n}\ntypedef long long ll;\nll inf = 1e18;\nint N;\nll L[5000], R[5000];\nll dp[2][2501][2501];\nint main() {\n cin >> N;\n rep(i, N) cin >> L[i] >> R[i];\n rep(i, N - 1) rep(j, N - 1) if (L[j] + R[j] < L[j + 1] + R[j + 1])\n swap(L[j], L[j + 1]),\n swap(R[j], R[j + 1]);\n rep(i, 2) rep(j, 2501) rep(k, 2501) dp[i][j][k] = inf;\n dp[0][0][0] = 0;\n rep(n, N) {\n rep(c, 2) rep(l, n + 1 - c) {\n int r = n - l - c;\n if (l > 2500 || r > 2500)\n continue;\n if (dp[c][l][r] == inf)\n continue;\n if (c == 0)\n chmin(dp[1][l][r], dp[0][l][r] + N \/ 2 * (L[n] + R[n]));\n if (l < 2500)\n chmin(dp[c][l + 1][r], dp[c][l][r] + l * (L[n] + R[n]) + R[n]);\n if (r < 2500)\n chmin(dp[c][l][r + 1], dp[c][l][r] + r * (L[n] + R[n]) + L[n]);\n }\n }\n ll ans = inf;\n rep(c, 2) rep(l, N + 1 - c) {\n int r = N - l - c;\n if (l <= 2500 && r <= 2500)\n chmin(ans, dp[c][l][r]);\n }\n cout << ans << endl;\n}\n","change":"insert","i1":38,"i2":38,"j1":38,"j2":40,"error":"127","stderr":"\/tmp\/726c74fc-136a-4b61-a75d-c47ad832b420.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object\n","stdout":null}
{"problem_id":"p03874","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nstring solve(long long n) {\n vector<long long> v;\n long long cur = 1;\n for (int i = 1; cur <= n; i++) {\n v.push_back(cur);\n cur *= i + 7;\n cur \/= i;\n }\n vector<int> c(v.size());\n for (int i = v.size() - 1; i >= 0; i--) {\n while (n >= v[i]) {\n n -= v[i];\n c[i]++;\n }\n }\n string ret;\n for (int i = 0; i < v.size(); i++) {\n ret += \"FESTIVA\" + string(c[i], 'L');\n }\n return ret;\n}\nint main() {\n long long n;\n cin >> n;\n cout << solve(n) << \"\\\\n\";\n return 0;\n}","fail":"#include <iostream>\n#include <string>\n#include <vector>\nusing namespace std;\nstring solve(long long n) {\n vector<long long> v;\n long long cur = 1;\n for (int i = 1; cur * 100 <= n + 1000; i++) {\n v.push_back(cur);\n cur *= i + 7;\n cur \/= i;\n }\n vector<int> c(v.size());\n for (int i = v.size() - 1; i >= 0; i--) {\n while (n >= v[i]) {\n n -= v[i];\n c[i]++;\n }\n }\n string ret;\n for (int i = 0; i < v.size(); i++) {\n ret += \"FESTIVA\" + string(c[i], 'L');\n }\n return ret;\n}\nint main() {\n long long n;\n cin >> n;\n cout << solve(n) << \"\\\\n\";\n return 0;\n}","change":"replace","i1":7,"i2":8,"j1":7,"j2":8,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03874","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <deque>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <string>\n#include <vector>\nusing namespace std;\nconst long long mod = 1000000007;\nconst long long inf = mod * mod;\nconst long long d2 = 500000004;\nconst double EPS = 1e-6;\nconst double PI = acos(-1.0);\nint ABS(int a) { return max(a, -a); }\nlong long ABS(long long a) { return max(a, -a); }\nlong long A[10];\nlong long B[10];\nchar wolf[10] = \"FESTIVAL\";\nint main() {\n long long K;\n scanf(\"%lld\", &K);\n if (K < 4950) {\n printf(\"FESTIVA\");\n for (int i = 0; i < K; i++)\n printf(\"L\");\n printf(\"\\\\n\");\n return 0;\n }\n int lim = max(7, (int)(pow((double)K, 0.125)));\n \/\/ printf(\"%f\\\\n\",(pow((double)K,0.125)));return 0;\n \/\/\tif(K>10000000000LL)lim=10;\n \/\/ int lim=7;\n while (1) {\n for (int i = 0; i < 8; i++) {\n A[i] = rand() % lim + 1;\n }\n int len = 0;\n for (int i = 0; i < 8; i++)\n len += A[i];\n\n int UL = 1;\n for (int i = 0; i < 7; i++)\n B[i] = rand() % lim + 1;\n for (int i = 7; i < 8; i++) {\n int left = UL;\n int right = 5050;\n while (left + 1 < right) {\n int M = (left + right) \/ 2;\n for (int j = i; j < 8; j++) {\n B[j] = M;\n }\n long long rem = K;\n for (int j = 0; j <= 8; j++) {\n long long now = 1;\n for (int k = 0; k < 8; k++) {\n long long mul = A[k];\n if (j <= k)\n mul = B[k];\n if (rem \/ now < mul) {\n rem = -1;\n break;\n }\n now *= mul;\n }\n rem -= now;\n if (rem < 0)\n break;\n }\n if (rem < 0) {\n right = M;\n } else\n left = M;\n }\n B[i] = left;\n UL = B[i];\n }\n\n int tot = 0;\n for (int i = 0; i < 8; i++)\n tot += A[i] + B[i];\n if (tot > 5000)\n continue;\n long long val = 0;\n for (int i = 0; i <= 8; i++) {\n long long tmp = 1;\n for (int j = 0; j < 8; j++) {\n if (i <= j)\n tmp *= B[j];\n else\n tmp *= A[j];\n }\n val += tmp;\n }\n \/\/\tfor(int i=0;i<8;i++)printf(\"%lld \",A[i]);\n \/\/\t\tprintf(\":\");\n \/\/\tfor(int i=0;i<8;i++)printf(\"%lld \",B[i]);\n \/\/\t\tprintf(\": %lld\\\\n\",val);\n if (val == K) {\n for (int i = 0; i < 8; i++) {\n for (int j = 0; j < A[i]; j++)\n printf(\"%c\", wolf[i]);\n }\n for (int i = 0; i < 8; i++) {\n for (int j = 0; j < B[i]; j++)\n printf(\"%c\", wolf[i]);\n }\n printf(\"\\\\n\");\n return 0;\n }\n }\n}","fail":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <deque>\n#include <map>\n#include <math.h>\n#include <queue>\n#include <set>\n#include <stack>\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n#include <string>\n#include <time.h>\n#include <vector>\nusing namespace std;\nconst long long mod = 1000000007;\nconst long long inf = mod * mod;\nconst long long d2 = (mod + 1) \/ 2;\nconst long double EPS = 1e-13;\nconst long double PI = acos(-1.0);\nint ABS(int a) { return max(a, -a); }\nlong long ABS(long long a) { return max(a, -a); }\nlong double ABS(long double a) { return max(a, -a); }\nint c[700];\nlong long f[700];\nlong long C[700][10];\nint main() {\n long long a;\n scanf(\"%lld\", &a);\n C[0][0] = 1;\n for (int i = 0; i < 650; i++) {\n for (int j = 0; j < 9; j++) {\n C[i + 1][j] += C[i][j];\n C[i + 1][j + 1] += C[i][j];\n }\n }\n for (int i = 0; i < 600; i++) {\n f[i] = C[i + 7][7];\n }\n for (int i = 599; i >= 0; i--) {\n c[i] = a \/ f[i];\n a %= f[i];\n }\n for (int i = 0; i < 600; i++) {\n printf(\"FESTIVA\");\n for (int j = 0; j < c[i]; j++)\n printf(\"L\");\n }\n printf(\"\\\\n\");\n}","change":"replace","i1":8,"i2":116,"j1":8,"j2":50,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03874","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define syosu(x) fixed << setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<double, double> pdd;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<int, P> pip;\ntypedef vector<pip> vip;\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 55;\nconst double pi = acos(-1);\nconst double eps = 1e-8;\nconst ll mod = 1e9 + 7;\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nconst int N = 8;\nconst string s = \"FESTIVAL\";\nll n;\n\nint main() {\n cin >> n;\n int t = 1, B = 0, l = 0;\n bool flag = 1;\n vl dp(N + 1), a, c;\n dp[0] = 1;\n while (1) {\n vl DP = dp;\n for (int i = 0; i < N; i++)\n for (int j = 0; j < t; j++)\n DP[i + 1] += DP[i];\n if (DP[N] > n)\n break;\n dp = DP;\n a.push_back(DP[N - 1]);\n c.push_back(t);\n l += t * N;\n if (flag) {\n flag = 0;\n continue;\n }\n if (B % 6 < 5)\n t++;\n B++;\n }\n while (t > 0) {\n vl DP = dp;\n for (int i = 0; i < N; i++)\n for (int j = 0; j < t; j++)\n DP[i + 1] += DP[i];\n if (DP[N] > n) {\n t--;\n continue;\n }\n dp = DP;\n l += N * t;\n a.push_back(DP[N - 1]);\n c.push_back(t);\n }\n n -= dp[N];\n int S = a.size();\n vl b(S);\n while (n) {\n for (int i = S - 1; i >= 0; i--)\n if (a[i] <= n) {\n n -= a[i];\n b[i]++;\n l++;\n }\n }\n assert(l <= 5000);\n for (int i = 0; i < S; i++) {\n for (int j = 0; j < N; j++)\n for (int k = 0; k < c[i]; k++)\n cout << s[j];\n for (int j = 0; j < b[i]; j++)\n cout << 'L';\n }\n cout << endl;\n}","fail":"#include <bits\/stdc++.h>\n#define syosu(x) fixed << setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<double, double> pdd;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<int, P> pip;\ntypedef vector<pip> vip;\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 55;\nconst double pi = acos(-1);\nconst double eps = 1e-8;\nconst ll mod = 1e9 + 7;\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nconst int N = 8;\nconst string s = \"FESTIVAL\";\nll n;\n\nint main() {\n cin >> n;\n int t = 1, B = 0, l = 0;\n int flag = 2;\n vl dp(N + 1), a, c;\n dp[0] = 1;\n while (1) {\n vl DP = dp;\n for (int i = 0; i < N; i++)\n for (int j = 0; j < t; j++)\n DP[i + 1] += DP[i];\n if (DP[N] > n)\n break;\n dp = DP;\n a.push_back(DP[N - 1]);\n c.push_back(t);\n l += t * N;\n if (flag) {\n flag--;\n continue;\n }\n if (B % 6 < 5)\n t++;\n B++;\n }\n while (t > 0) {\n vl DP = dp;\n for (int i = 0; i < N; i++)\n for (int j = 0; j < t; j++)\n DP[i + 1] += DP[i];\n if (DP[N] > n) {\n t--;\n continue;\n }\n dp = DP;\n l += N * t;\n a.push_back(DP[N - 1]);\n c.push_back(t);\n }\n n -= dp[N];\n int S = a.size();\n vl b(S);\n while (n) {\n for (int i = S - 1; i >= 0; i--)\n if (a[i] <= n) {\n n -= a[i];\n b[i]++;\n l++;\n }\n }\n assert(l <= 5000);\n for (int i = 0; i < S; i++) {\n for (int j = 0; j < N; j++)\n for (int k = 0; k < c[i]; k++)\n cout << s[j];\n for (int j = 0; j < b[i]; j++)\n cout << 'L';\n }\n cout << endl;\n}","change":"replace","i1":34,"i2":50,"j1":34,"j2":50,"error":"WA","stderr":null,"stdout":"FESTIVALLLLLLL\n"}
{"problem_id":"p03874","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> PP;\n\n\/*\n freopen(\"input\",\"r\",stdin);\n freopen(\"output\",\"w\",stdout);\n*\/\n\nll check(string s) {\n if (s.size() > 5000)\n return -1;\n ll DP[8];\n memset(DP, 0, sizeof(DP));\n for (int i = 0; i < s.size(); i++) {\n if (s[i] == 'F')\n DP[0]++;\n if (s[i] == 'E')\n DP[1] += DP[0];\n if (s[i] == 'S')\n DP[2] += DP[1];\n if (s[i] == 'T')\n DP[3] += DP[2];\n if (s[i] == 'I')\n DP[4] += DP[3];\n if (s[i] == 'V')\n DP[5] += DP[4];\n if (s[i] == 'A')\n DP[6] += DP[5];\n if (s[i] == 'L')\n DP[7] += DP[6];\n }\n return DP[7];\n}\n\nint main() {\n ios::sync_with_stdio(false);\n ll K;\n cin >> K;\n ll DP[8];\n ll Q[8]; \/\/ Rem\n ll P[8]; \/\/ Number of Operation in second round.\n DP[7] = K;\n Q[0] = 1;\n for (int i = 7; i > 0; i--) {\n if (DP[i] <= 2) {\n DP[i - 1] = DP[i];\n Q[i] = DP[i];\n } else {\n ll T = min(400LL, DP[i] - 1);\n bool ok = 0;\n for (int j = T; j > 0 && ok == 0; j--) {\n if (DP[i] % j != 0) {\n Q[i] = DP[i] % j;\n DP[i - 1] = DP[i] \/ j;\n P[i] = j;\n ok = 1;\n }\n }\n }\n }\n string s = \"FESTIVAL\";\n string sol = s;\n for (int i = 7; i > 0; i--) {\n for (int j = Q[i]; j > 1; j--)\n sol.push_back(s[i]);\n }\n for (int i = 1; i < 8; i++) {\n for (int j = 0; j < P[i]; j++) {\n sol.push_back(s[i]);\n }\n }\n \/\/ ll ans = check(sol);\n \/\/ if (ans != K) cerr << \"WRONG\" << endl;\n cout << sol << endl;\n return 0;\n}\n","fail":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> PP;\n\n\/*\n freopen(\"input\",\"r\",stdin);\n freopen(\"output\",\"w\",stdout);\n*\/\n\nll check(string s) {\n if (s.size() > 5000)\n return -1;\n ll DP[8];\n memset(DP, 0, sizeof(DP));\n for (int i = 0; i < s.size(); i++) {\n if (s[i] == 'F')\n DP[0]++;\n if (s[i] == 'E')\n DP[1] += DP[0];\n if (s[i] == 'S')\n DP[2] += DP[1];\n if (s[i] == 'T')\n DP[3] += DP[2];\n if (s[i] == 'I')\n DP[4] += DP[3];\n if (s[i] == 'V')\n DP[5] += DP[4];\n if (s[i] == 'A')\n DP[6] += DP[5];\n if (s[i] == 'L')\n DP[7] += DP[6];\n }\n return DP[7];\n}\n\nint main() {\n ios::sync_with_stdio(false);\n ll K;\n cin >> K;\n ll DP[8];\n ll Q[8]; \/\/ Rem\n ll P[8]; \/\/ Number of Operation in second round.\n memset(DP, 0, sizeof(DP));\n memset(Q, 0, sizeof(Q));\n memset(P, 0, sizeof(P));\n DP[7] = K;\n Q[0] = 1;\n for (int i = 7; i > 0; i--) {\n if (DP[i] <= 2) {\n DP[i - 1] = DP[i];\n Q[i] = DP[i];\n } else {\n ll T = min(400LL, DP[i] - 1);\n bool ok = 0;\n for (int j = T; j > 0 && ok == 0; j--) {\n if (DP[i] % j != 0) {\n Q[i] = DP[i] % j;\n DP[i - 1] = DP[i] \/ j;\n P[i] = j;\n ok = 1;\n }\n }\n }\n }\n string s = \"FESTIVAL\";\n string sol = s;\n for (int i = 7; i > 0; i--) {\n for (int j = Q[i]; j > 1; j--)\n sol.push_back(s[i]);\n }\n for (int i = 1; i < 8; i++) {\n for (int j = 0; j < P[i]; j++) {\n sol.push_back(s[i]);\n }\n }\n \/\/ ll ans = check(sol);\n \/\/ if (ans != K) cerr << \"WRONG\" << endl;\n cout << sol << endl;\n return 0;\n}\n","change":"insert","i1":58,"i2":58,"j1":58,"j2":61,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03876","language":"C++","original_status":"Runtime Error","pass":"#include \"algorithm\"\n#include \"bitset\"\n#include \"cassert\"\n#include \"climits\"\n#include \"cmath\"\n#include \"cstdio\"\n#include \"ctime\"\n#include \"functional\"\n#include \"iomanip\"\n#include \"iostream\"\n#include \"list\"\n#include \"map\"\n#include \"numeric\"\n#include \"queue\"\n#include \"random\"\n#include \"set\"\n#include \"stack\"\n#include \"string\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n\nusing namespace std;\n\n\/\/ constexpr long long int MOD = 1000000007;\n\/\/ constexpr int MOD = 1000000007;\nconstexpr int MOD = 998244353;\n\/\/ constexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-8;\n\n\/\/ int N, M, K, H, W, L, R;\nlong long int N, M, K, H, W, L, R;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n cin >> N;\n\n vector<int> v(N);\n for (auto &i : v)\n cin >> i;\n\n if (accumulate(v.begin(), v.end(), 0) != N * 180 - 360) {\n cout << -1 << endl;\n return 0;\n }\n vector<int> st;\n vector<int> p(N, -1);\n vector<vector<int>> edge(N);\n for (int i = N * 2 - 1; i >= 0; i--) {\n if (i >= N && v[i % N] == 270)\n st.push_back(i % N);\n if (v[i % N] == 90 && !st.empty()) {\n p[st.back()] = i % N;\n p[i % N] = st.back();\n \/\/\tcout << \"pair \" << i % N << \" \" << p[i%N] << endl;\n st.pop_back();\n for (auto j : st) {\n edge[j].push_back(p[i % N]);\n }\n }\n }\n vector<long long int> x(N, MOD * 2);\n vector<long long int> y(N, MOD * 2);\n int cnt = 0;\n for (int i = 0; i < N; i++) {\n if (p[i] == -1) {\n x[i] = (cnt % 2) ^ (cnt \/ 2);\n y[i] = cnt \/ 2;\n x[i] *= 2;\n y[i] *= 2;\n cnt++;\n }\n }\n assert(cnt == 4);\n vector<int> dir(N);\n queue<int> Q;\n for (int i = 0; i < N; i++) {\n for (auto j : edge[i])\n dir[j]++;\n }\n for (int i = 0; i < N; i++) {\n if (v[i] == 270 && !dir[i])\n Q.push(i);\n }\n while (!Q.empty()) {\n int cn = Q.front();\n \/\/\tcout << \"cn\" << cn << endl;\n Q.pop();\n for (auto i : edge[cn]) {\n dir[i]--;\n if (!dir[i])\n Q.push(i);\n }\n L = p[cn];\n R = cn;\n while (x[L] == MOD * 2) {\n L--;\n if (L < 0)\n L += N;\n }\n while (x[R] == MOD * 2) {\n R++;\n R %= N;\n }\n \/\/\tcout << L << \" \" << R << endl;\n if (x[L] < x[R]) {\n x[p[cn]] = x[cn] = x[L] + 1;\n y[p[cn]] = y[cn] = y[L];\n y[cn]++;\n y[R]++;\n } else if (x[L] > x[R]) {\n x[p[cn]] = x[cn] = x[L] - 1;\n y[p[cn]] = y[cn] = y[L];\n y[cn]--;\n y[R]--;\n } else if (y[L] < y[R]) {\n y[p[cn]] = y[cn] = y[L] + 1;\n x[p[cn]] = x[cn] = x[L];\n x[cn]--;\n x[R]--;\n } else if (y[L] > y[R]) {\n y[p[cn]] = y[cn] = y[L] - 1;\n x[p[cn]] = x[cn] = x[L];\n x[cn]++;\n x[R]++;\n }\n int xodd = 0;\n for (auto i : x) {\n if (i & 1)\n xodd = i;\n }\n for (auto &i : x) {\n if (i >= xodd && i < MOD * 2) {\n if (i & 1)\n i++;\n else\n i += 2;\n }\n }\n int yodd = 0;\n for (auto i : y) {\n if (i & 1)\n yodd = i;\n }\n for (auto &i : y) {\n if (i >= yodd && i < MOD * 2) {\n if (i & 1)\n i++;\n else\n i += 2;\n }\n }\n }\n for (int i = 0; i < N; i++) {\n \/\/ assert(x[i] != MOD * 2);\n cout << x[i] << \" \" << y[i] << endl;\n }\n}","fail":"#include \"algorithm\"\n#include \"bitset\"\n#include \"cassert\"\n#include \"climits\"\n#include \"cmath\"\n#include \"cstdio\"\n#include \"ctime\"\n#include \"functional\"\n#include \"iomanip\"\n#include \"iostream\"\n#include \"list\"\n#include \"map\"\n#include \"numeric\"\n#include \"queue\"\n#include \"random\"\n#include \"set\"\n#include \"stack\"\n#include \"string\"\n#include \"unordered_map\"\n#include \"unordered_set\"\n\nusing namespace std;\n\n\/\/ constexpr long long int MOD = 1000000007;\n\/\/ constexpr int MOD = 1000000007;\nconstexpr int MOD = 998244353;\n\/\/ constexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-8;\n\n\/\/ int N, M, K, H, W, L, R;\nlong long int N, M, K, H, W, L, R;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n cin >> N;\n\n vector<int> v(N);\n for (auto &i : v)\n cin >> i;\n\n if (accumulate(v.begin(), v.end(), 0) != N * 180 - 360) {\n cout << -1 << endl;\n return 0;\n }\n for (auto i : v) {\n if (i == 90)\n H++;\n else\n W++;\n }\n vector<int> st;\n vector<int> p(N, -1);\n vector<vector<int>> edge(N);\n for (int i = N * 2 - 1; i >= 0; i--) {\n if (i >= N && v[i % N] == 270)\n st.push_back(i % N);\n if (v[i % N] == 90 && !st.empty() && p[i % N] == -1) {\n p[st.back()] = i % N;\n p[i % N] = st.back();\n \/\/ cout << \"pair \" << i % N << \" \" << p[i%N] << endl;\n st.pop_back();\n }\n }\n for (int i = 0; i < N; i++) {\n if (v[i] == 270) {\n \/\/\tcout <<\"pair \"<< i << \" \" << p[i] << endl;\n for (int j = 0; j < N; j++) {\n if (v[j] != 270)\n continue;\n if (p[i] < p[j] && i > j && p[i] < i && p[j] < j)\n edge[i].push_back(j);\n if (p[i] < p[j] && i > j && p[i] > i && p[j] > j)\n edge[i].push_back(j);\n if (p[i] < p[j] && i < j && p[i] > i && p[j] < j)\n edge[i].push_back(j);\n if (p[i] > p[j] && i > j && p[i] > i && p[j] < j) {\n \/\/\tcout <<\"edge \"<< i << \" \" << j << endl;\n edge[i].push_back(j);\n }\n }\n }\n }\n vector<long long int> x(N, MOD * 2);\n vector<long long int> y(N, MOD * 2);\n int cnt = 0;\n for (int i = 0; i < N; i++) {\n if (p[i] == -1) {\n \/\/\tcout << i << endl;\n x[i] = (cnt % 2) ^ (cnt \/ 2);\n y[i] = cnt \/ 2;\n x[i] *= 2;\n y[i] *= 2;\n cnt++;\n }\n }\n vector<int> dir(N);\n queue<int> Q;\n for (int i = 0; i < N; i++) {\n for (auto j : edge[i])\n dir[j]++;\n }\n for (int i = 0; i < N; i++) {\n if (v[i] == 270 && !dir[i])\n Q.push(i);\n }\n while (!Q.empty()) {\n int cn = Q.front();\n Q.pop();\n for (auto i : edge[cn]) {\n dir[i]--;\n if (!dir[i])\n Q.push(i);\n }\n L = p[cn];\n R = cn;\n \/\/\tcout << \"pair \" << L << \" \" << R << endl;\n while (x[L] == MOD * 2) {\n L--;\n if (L < 0)\n L += N;\n }\n while (x[R] == MOD * 2) {\n R++;\n R %= N;\n }\n \/\/\tcout << L << \" \" << R << endl;\n \/\/\tcout << L << \" \" << R << endl;\n if (x[L] < x[R]) {\n x[p[cn]] = x[cn] = x[L] + 1;\n y[p[cn]] = y[cn] = y[L];\n y[cn]++;\n y[R]++;\n } else if (x[L] > x[R]) {\n x[p[cn]] = x[cn] = x[L] - 1;\n y[p[cn]] = y[cn] = y[L];\n y[cn]--;\n y[R]--;\n } else if (y[L] < y[R]) {\n y[p[cn]] = y[cn] = y[L] + 1;\n x[p[cn]] = x[cn] = x[L];\n x[cn]--;\n x[R]--;\n } else if (y[L] > y[R]) {\n y[p[cn]] = y[cn] = y[L] - 1;\n x[p[cn]] = x[cn] = x[L];\n x[cn]++;\n x[R]++;\n }\n int xodd = 0;\n for (auto i : x) {\n if (i & 1)\n xodd = i;\n }\n for (auto &i : x) {\n if (i >= xodd && i < MOD * 2) {\n if (i & 1)\n i++;\n else\n i += 2;\n }\n }\n int yodd = 0;\n for (auto i : y) {\n if (i & 1)\n yodd = i;\n }\n for (auto &i : y) {\n if (i >= yodd && i < MOD * 2) {\n if (i & 1)\n i++;\n else\n i += 2;\n }\n }\n for (int j = 0; j < N; j++) {\n if (x[j] != MOD * 2) {\n \/\/\t\tcout << j << \" \" << x[j] << \" \" << y[j] << endl;\n }\n }\n }\n for (int i = 0; i < N; i++) {\n \/\/ assert(x[i] != MOD * 2);\n cout << x[i] << \" \" << y[i] << endl;\n }\n}","change":"replace","i1":46,"i2":153,"j1":46,"j2":181,"error":"WA","stderr":null,"stdout":"0 0\n2 0\n2 2\n6 2\n6 6\n4 6\n4 4\n0 4\n"}
{"problem_id":"p03876","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define syosu(x) fixed << setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<double, double> pdd;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<P, int> pip;\ntypedef vector<pip> vip;\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 60;\nconst double pi = acos(-1);\nconst double eps = 1e-8;\nconst ll mod = 1e9 + 7;\nconst int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};\n\nint n;\nvi a, c, x, y;\n\nvoid Compless() {\n vi A, B;\n for (int i = 0; i < n; i++) {\n if (x[i] != inf)\n A.push_back(x[i]);\n if (y[i] != inf)\n B.push_back(y[i]);\n }\n sort(A.begin(), A.end());\n sort(B.begin(), B.end());\n A.erase(unique(A.begin(), A.end()), A.end());\n B.erase(unique(B.begin(), B.end()), B.end());\n map<int, int> ma, mb;\n ma[inf] = inf;\n mb[inf] = inf;\n for (int i = 0; i < A.size(); i++)\n ma[A[i]] = i * 2;\n for (int i = 0; i < B.size(); i++)\n mb[B[i]] = i * 2;\n for (int i = 0; i < n; i++)\n x[i] = ma[x[i]];\n for (int i = 0; i < n; i++)\n y[i] = mb[y[i]];\n}\n\nvoid Rec(int l, int r) {\n int d = 0;\n vi L, R;\n for (int i = l; i != r; i = (i + 1) % n) {\n if (!d)\n L.push_back(i);\n d += a[i];\n if (!d)\n R.push_back(i);\n }\n for (int i = 0; i < L.size(); i++) {\n int D = c[r], cx = dx[D], cy = dy[D], cx_ = dx[(D + 3) % 4],\n cy_ = dy[(D + 3) % 4];\n x[L[i]] = x[r] + cx_;\n y[L[i]] = y[r] + cy_;\n x[R[i]] = x[L[i]] + cx;\n y[R[i]] = y[L[i]] + cy;\n x[r] += cx;\n y[r] += cy;\n Compless();\n }\n for (int i = 0; i < L.size(); i++)\n Rec((L[i] + 1) % n, R[i]);\n}\n\nint main() {\n cin >> n;\n assert(n <= 36);\n a = c = vi(n, -1);\n x = y = vi(n, inf);\n int t = 0;\n for (int i = 0; i < n; i++) {\n int A;\n cin >> A;\n if (A == 270)\n a[i] = 1, t++;\n }\n if (n % 2 != 0 || n \/ 2 - 2 != t) {\n cout << -1 << endl;\n return 0;\n }\n int b[4], id = 0, d = 0, D = 1;\n for (int i = 0; i < n; i++) {\n d += a[i];\n D = (D + 1 + (a[i] == 1 ? 2 : 0)) % 4;\n c[i] = (D + 2) % 4;\n if (d == -1 && id < 4)\n b[id++] = i, d = 0;\n }\n for (int i = 0; i < 4; i++) {\n x[b[i]] = (0 < i && i < 3 ? 2 : 0);\n y[b[i]] = (1 < i ? 2 : 0);\n }\n for (int i = 0; i < 4; i++)\n Rec((b[i] + 1) % n, b[(i + 1) % 4]);\n for (int i = 0; i < n; i++)\n cout << x[i] << ' ' << y[i] << endl;\n}","fail":"#include <bits\/stdc++.h>\n#define syosu(x) fixed << setprecision(x)\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<int, int> P;\ntypedef pair<double, double> pdd;\ntypedef pair<ll, ll> pll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<string> vs;\ntypedef vector<P> vp;\ntypedef vector<vp> vvp;\ntypedef vector<pll> vpll;\ntypedef pair<P, int> pip;\ntypedef vector<pip> vip;\nconst int inf = 1 << 30;\nconst ll INF = 1ll << 60;\nconst double pi = acos(-1);\nconst double eps = 1e-8;\nconst ll mod = 1e9 + 7;\nconst int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};\n\nint n;\nvi a, c, x, y;\n\nvoid Compless() {\n vi A, B;\n for (int i = 0; i < n; i++) {\n if (x[i] != inf)\n A.push_back(x[i]);\n if (y[i] != inf)\n B.push_back(y[i]);\n }\n sort(A.begin(), A.end());\n sort(B.begin(), B.end());\n A.erase(unique(A.begin(), A.end()), A.end());\n B.erase(unique(B.begin(), B.end()), B.end());\n map<int, int> ma, mb;\n ma[inf] = inf;\n mb[inf] = inf;\n for (int i = 0; i < A.size(); i++)\n ma[A[i]] = i * 2;\n for (int i = 0; i < B.size(); i++)\n mb[B[i]] = i * 2;\n for (int i = 0; i < n; i++)\n x[i] = ma[x[i]];\n for (int i = 0; i < n; i++)\n y[i] = mb[y[i]];\n}\n\nint main() {\n cin >> n;\n a = c = vi(n, -1);\n x = y = vi(n, inf);\n int t = 0;\n for (int i = 0; i < n; i++) {\n int A;\n cin >> A;\n if (A == 270)\n a[i] = 1, t++;\n }\n if (n % 2 != 0 || n \/ 2 - 2 != t) {\n cout << -1 << endl;\n return 0;\n }\n int b[4], id = 0, d = 0, D = 1;\n for (int i = 0; i < n; i++) {\n d += a[i];\n D = (D + (a[i] == 1 ? 3 : 1)) % 4;\n c[i] = D;\n if (d == -1 && id < 4)\n b[id++] = i, d = 0;\n }\n for (int i = 0; i < 4; i++) {\n x[b[i]] = (0 < i && i < 3 ? 2 : 0);\n y[b[i]] = (1 < i ? 2 : 0);\n }\n for (int i = (b[0] + 1) % n; i != b[0]; i = (i + 1) % n)\n if (x[i] == inf) {\n d = 0;\n int j = i;\n while (1) {\n d += a[j];\n if (d == 0)\n break;\n j = (j + 1) % n;\n }\n int J = j;\n while (x[J] == inf)\n J = (J + 1) % n;\n int I = (c[J] + (a[j] == a[J] ? 2 : 0)) % 4, cx = dx[I], cy = dy[I],\n I_ = (c[J] + (a[J] == 1 ? 3 : 1)) % 4, cx_ = dx[I_], cy_ = dy[I_];\n x[i] = x[J] + cx_;\n y[i] = y[J] + cy_;\n x[j] = x[i] + cx;\n y[j] = y[i] + cy;\n x[J] += cx;\n y[J] += cy;\n Compless();\n }\n for (int i = 0; i < n; i++)\n cout << x[i] << ' ' << y[i] << endl;\n}","change":"replace","i1":55,"i2":110,"j1":55,"j2":105,"error":"WA","stderr":null,"stdout":"0 0\n4 0\n4 4\n6 4\n6 6\n2 6\n2 2\n0 2\n"}
{"problem_id":"p03876","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\nusing lint = long long int;\nusing pint = pair<int, int>;\nstruct fast_ios {\n fast_ios() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n };\n} fast_ios_;\n#define FOR(i, begin, end) \\\\\n for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)\n#define IFOR(i, begin, end) \\\\\n for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)\n#define REP(i, n) FOR(i, 0, n)\n#define IREP(i, n) IFOR(i, 0, n)\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec) {\n for (auto &v : vec)\n is >> v;\n return is;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"[\";\n for (auto v : vec)\n os << v << \",\";\n os << \"]\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {\n os << \"deq[\";\n for (auto v : vec)\n os << v << \",\";\n os << \"]\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const unordered_set<T> &vec) {\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &pa) {\n os << \"(\" << pa.first << \",\" << pa.second << \")\";\n return os;\n}\ntemplate <typename TK, typename TV>\nostream &operator<<(ostream &os, const map<TK, TV> &mp) {\n os << \"{\";\n for (auto v : mp)\n os << v.first << \"=>\" << v.second << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename TK, typename TV>\nostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {\n os << \"{\";\n for (auto v : mp)\n os << v.first << \"=>\" << v.second << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }\ntemplate <typename T, typename... Args>\nvoid ndarray(vector<T> &vec, int len, Args... args) {\n vec.resize(len);\n for (auto &v : vec)\n ndarray(v, args...);\n}\ntemplate <typename T> bool mmax(T &m, const T q) {\n if (m < q) {\n m = q;\n return true;\n } else\n return false;\n}\ntemplate <typename T> bool mmin(T &m, const T q) {\n if (m > q) {\n m = q;\n return true;\n } else\n return false;\n}\ntemplate <typename T1, typename T2>\npair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {\n return make_pair(l.first + r.first, l.second + r.second);\n}\ntemplate <typename T1, typename T2>\npair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {\n return make_pair(l.first - r.first, l.second - r.second);\n}\n#define dbg(x) \\\\\n cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \") \" << __FILE__ << endl;\n#define ALL(x) (x).begin(), (x).end()\n\nint N;\nvector<int> a;\n\nvector<pint> ans;\n\nconstexpr int DMAX = 1 << 10;\n\nvoid reshape() {\n set<int> X, Y;\n for (auto p : ans)\n X.insert(p.first), Y.insert(p.second);\n unordered_map<int, int> xz, yz;\n for (auto x : X) {\n int n = xz.size();\n xz[x] = n * DMAX;\n }\n for (auto y : Y) {\n int n = yz.size();\n yz[y] = n * DMAX;\n }\n vector<pint> ret;\n for (auto p : ans)\n ret.emplace_back(xz[p.first], yz[p.second]);\n\n ans = ret;\n}\n\nint main() {\n cin >> N;\n a.resize(N);\n cin >> a;\n vector<int> acc(N + 1);\n REP(i, N) acc[i + 1] = acc[i] + (a[i] == 90 ? 1 : -1);\n if (acc.back() != 4) {\n puts(\"-1\");\n return 0;\n }\n int mini = min_element(acc.begin(), acc.end()) - acc.begin();\n\n ans.emplace_back(0, 0);\n ans.emplace_back(DMAX, 0);\n ans.emplace_back(DMAX, DMAX);\n ans.emplace_back(0, DMAX);\n ans.emplace_back(0, 0);\n int np = (N - 4) \/ 2;\n int D = DMAX \/ 2;\n REP(now, N) {\n int d = a[(mini + now) % N];\n if (d == 270 or np <= 0) {\n now++;\n continue;\n }\n pint &A = ans[now];\n pint &B = ans[now + 1];\n pint X = make_pair((A.first + B.first) \/ 2, (A.second + B.second) \/ 2);\n pint Y = make_pair((A.first + B.first) \/ 2, (A.second + B.second) \/ 2);\n if (A.second == B.second) {\n if ((A.first < B.first) xor (d == 90)) {\n Y.second -= D, B.second -= D;\n } else {\n Y.second += D, B.second += D;\n }\n } else {\n if ((A.second < B.second) xor (d == 90)) {\n Y.first += D, B.first += D;\n } else {\n Y.first -= D, B.first -= D;\n }\n }\n ans.insert(ans.begin() + now + 1, Y);\n ans.insert(ans.begin() + now + 1, X);\n now++;\n D \/= 2;\n if (D < 1) {\n reshape();\n D = DMAX \/ 2;\n }\n }\n\n vector<pint> ret(N);\n REP(i, N) ret[(mini + i) % N] = ans[i];\n REP(i, N) printf(\"%d %d\\\\n\", ret[i].first, ret[i].second);\n}\n","fail":"#include <bits\/stdc++.h>\nusing namespace std;\nusing lint = long long int;\nusing pint = pair<int, int>;\nstruct fast_ios {\n fast_ios() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n };\n} fast_ios_;\n#define FOR(i, begin, end) \\\\\n for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)\n#define IFOR(i, begin, end) \\\\\n for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)\n#define REP(i, n) FOR(i, 0, n)\n#define IREP(i, n) IFOR(i, 0, n)\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec) {\n for (auto &v : vec)\n is >> v;\n return is;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {\n os << \"[\";\n for (auto v : vec)\n os << v << \",\";\n os << \"]\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) {\n os << \"deq[\";\n for (auto v : vec)\n os << v << \",\";\n os << \"]\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &vec) {\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const unordered_set<T> &vec) {\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) {\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T>\nostream &operator<<(ostream &os, const unordered_multiset<T> &vec) {\n os << \"{\";\n for (auto v : vec)\n os << v << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &pa) {\n os << \"(\" << pa.first << \",\" << pa.second << \")\";\n return os;\n}\ntemplate <typename TK, typename TV>\nostream &operator<<(ostream &os, const map<TK, TV> &mp) {\n os << \"{\";\n for (auto v : mp)\n os << v.first << \"=>\" << v.second << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename TK, typename TV>\nostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) {\n os << \"{\";\n for (auto v : mp)\n os << v.first << \"=>\" << v.second << \",\";\n os << \"}\";\n return os;\n}\ntemplate <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }\ntemplate <typename T, typename... Args>\nvoid ndarray(vector<T> &vec, int len, Args... args) {\n vec.resize(len);\n for (auto &v : vec)\n ndarray(v, args...);\n}\ntemplate <typename T> bool mmax(T &m, const T q) {\n if (m < q) {\n m = q;\n return true;\n } else\n return false;\n}\ntemplate <typename T> bool mmin(T &m, const T q) {\n if (m > q) {\n m = q;\n return true;\n } else\n return false;\n}\ntemplate <typename T1, typename T2>\npair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {\n return make_pair(l.first + r.first, l.second + r.second);\n}\ntemplate <typename T1, typename T2>\npair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {\n return make_pair(l.first - r.first, l.second - r.second);\n}\n#define dbg(x) \\\\\n cerr << #x << \" = \" << (x) << \" (L\" << __LINE__ << \") \" << __FILE__ << endl;\n#define ALL(x) (x).begin(), (x).end()\n\nint N;\nvector<int> a;\n\nvector<pint> ans;\n\nconstexpr int DMAX = 1 << 10;\nint D;\nvoid reshape(int DMAX = DMAX) {\n set<int> X, Y;\n for (auto p : ans)\n X.insert(p.first), Y.insert(p.second);\n unordered_map<int, int> xz, yz;\n for (auto x : X) {\n int n = xz.size();\n xz[x] = n * DMAX;\n }\n for (auto y : Y) {\n int n = yz.size();\n yz[y] = n * DMAX;\n }\n vector<pint> ret;\n for (auto p : ans)\n ret.emplace_back(xz[p.first], yz[p.second]);\n ans = ret;\n D = DMAX \/ 2;\n}\n\nvoid dfs(int L, int R) {\n if (L + 1 >= R)\n return;\n pint &A = ans[L], &B = ans[R];\n\n L++;\n int now = L + 1, cou = 0;\n while (cou or a[now] == a[L]) {\n if (a[now] == 90)\n cou++;\n else\n cou--;\n now++;\n }\n \/\/ make pair between (L, now)\n pint X = make_pair((A.first + B.first) \/ 2, (A.second + B.second) \/ 2);\n pint Y = make_pair((A.first + B.first) \/ 2, (A.second + B.second) \/ 2);\n\n if (A.first == B.first) {\n if ((A.second < B.second) xor (a[L] == 90))\n Y.first += D, B.first += D;\n else\n Y.first -= D, B.first -= D;\n } else {\n if ((A.first < B.first) xor (a[L] == 90))\n Y.second -= D, B.second -= D;\n else\n Y.second += D, B.second += D;\n }\n\n ans[L] = X, ans[now] = Y;\n\n D \/= 2;\n if (D == 0)\n reshape();\n dfs(L, now);\n dfs(now, R);\n}\n\nint main() {\n cin >> N;\n a.resize(N * 2);\n REP(i, N) {\n cin >> a[i];\n a[i + N] = a[i];\n }\n\n vector<int> acc(N + 1);\n REP(i, N) acc[i + 1] = acc[i] + (a[i] == 90 ? 1 : -1);\n if (acc.back() != 4) {\n puts(\"-1\");\n return 0;\n }\n\n vector<int> V(5);\n while (a[V[0]] != 90)\n V[0]++;\n REP(d, 3) {\n int acc = 0;\n V[d + 1] = V[d] + 1;\n while (acc != 0 or a[V[d + 1]] != 90) {\n if (a[V[d + 1]] == 90)\n acc++;\n else\n acc--;\n V[d + 1]++;\n }\n }\n V[4] = V[0] + N;\n ans.resize(2 * N);\n REP(i, 2) ans[V[0] + i * N] = make_pair(0, 0);\n REP(i, 2) ans[V[1] + i * N] = make_pair(DMAX, 0);\n REP(i, 2) ans[V[2] + i * N] = make_pair(DMAX, DMAX);\n REP(i, 2) ans[V[3] + i * N] = make_pair(0, DMAX);\n D = DMAX \/ 2;\n\n REP(i, 4) dfs(V[i], V[i + 1]);\n\n FOR(i, V[0], V[4] + 1) ans[i % N] = ans[i];\n reshape(1);\n REP(i, N) printf(\"%d %d\\\\n\", ans[i].first, ans[i].second);\n}\n","change":"replace","i1":126,"i2":203,"j1":126,"j2":229,"error":"WA","stderr":null,"stdout":"0 0\n512 0\n512 512\n1024 512\n1024 1024\n512 1024\n512 768\n0 768\n"}
{"problem_id":"p03876","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nvector<pii> comp(vector<pii> v) {\n vector<int> za, zb;\n for (int i = 0; i < v.size(); i++)\n za.push_back(v[i].first), zb.push_back(v[i].second);\n sort(za.begin(), za.end());\n sort(zb.begin(), zb.end());\n for (int i = 0; i < v.size(); i++) {\n v[i].first =\n (lower_bound(za.begin(), za.end(), v[i].first) - za.begin()) * 2;\n v[i].second =\n (lower_bound(zb.begin(), zb.end(), v[i].second) - zb.begin()) * 2;\n }\n return v;\n}\nvector<pii> calc(vector<int> v) {\n if (v.size() == 4) {\n vector<pii> r;\n r.push_back(make_pair(0, 0));\n r.push_back(make_pair(2, 0));\n r.push_back(make_pair(2, 2));\n r.push_back(make_pair(0, 2));\n return r;\n }\n int rr = 0;\n for (int i = 0; i < v.size() - 1; i++) {\n if (v[i] != v[i + 1]) {\n rr = i;\n break;\n }\n }\n vector<int> z;\n for (int i = 0; i < rr; i++)\n z.push_back(v[i]);\n for (int i = rr + 2; i < v.size(); i++)\n z.push_back(v[i]);\n vector<pii> now = calc(z);\n vector<pii> ans;\n for (int i = 0; i < rr; i++)\n ans.push_back(now[i]);\n pii s = now[(rr + now.size() - 1) % now.size()], t = now[rr % now.size()];\n pii a = make_pair((s.first + t.first) \/ 2, (s.second + t.second) \/ 2), b = a;\n if (s.first == t.first) {\n if ((s.second < t.second) == (v[rr] == 1))\n b.first--, t.first--;\n else\n b.first++, t.first++;\n } else {\n if ((s.first < t.first) == (v[rr] == 1))\n b.second++, t.second++;\n else\n b.second--, t.second--;\n }\n ans.push_back(a);\n ans.push_back(b);\n for (int i = rr; i < now.size(); i++)\n ans.push_back(now[i]);\n ans[(rr + 2) % ans.size()] = t;\n \/\/ for (int i = 0; i < v.size(); i++)printf(\"%d \", v[i]); printf(\"\\\\n\");\n \/\/ for (int i = 0; i < ans.size(); i++)printf(\"%d %d \", ans[i].first,\n \/\/ ans[i].second); printf(\"\\\\n\");\n return comp(ans);\n}\nint main() {\n int num;\n scanf(\"%d\", &num);\n vector<int> v;\n int s = 0;\n for (int i = 0; i < num; i++) {\n int z;\n scanf(\"%d\", &z);\n v.push_back((180 - z) \/ 90);\n s += v[i];\n }\n if (s != 4)\n printf(\"-1\\\\n\");\n vector<pii> r = calc(v);\n for (int i = 0; i < num; i++)\n printf(\"%d %d\\\\n\", r[i].first, r[i].second);\n}","fail":"#include <algorithm>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\ntypedef pair<int, int> pii;\nvector<pii> comp(vector<pii> v) {\n vector<int> za, zb;\n for (int i = 0; i < v.size(); i++)\n za.push_back(v[i].first), zb.push_back(v[i].second);\n sort(za.begin(), za.end());\n sort(zb.begin(), zb.end());\n for (int i = 0; i < v.size(); i++) {\n v[i].first =\n (lower_bound(za.begin(), za.end(), v[i].first) - za.begin()) * 2;\n v[i].second =\n (lower_bound(zb.begin(), zb.end(), v[i].second) - zb.begin()) * 2;\n }\n return v;\n}\nvector<pii> calc(vector<int> v) {\n if (v.size() == 4) {\n vector<pii> r;\n r.push_back(make_pair(0, 0));\n r.push_back(make_pair(2, 0));\n r.push_back(make_pair(2, 2));\n r.push_back(make_pair(0, 2));\n return r;\n }\n int rr = 0;\n for (int i = 0; i < v.size() - 1; i++) {\n if (v[i] != v[i + 1]) {\n rr = i;\n break;\n }\n }\n vector<int> z;\n for (int i = 0; i < rr; i++)\n z.push_back(v[i]);\n for (int i = rr + 2; i < v.size(); i++)\n z.push_back(v[i]);\n vector<pii> now = calc(z);\n vector<pii> ans;\n for (int i = 0; i < rr; i++)\n ans.push_back(now[i]);\n pii s = now[(rr + now.size() - 1) % now.size()], t = now[rr % now.size()];\n pii a = make_pair((s.first + t.first) \/ 2, (s.second + t.second) \/ 2), b = a;\n if (s.first == t.first) {\n if ((s.second < t.second) == (v[rr] == 1))\n b.first--, t.first--;\n else\n b.first++, t.first++;\n } else {\n if ((s.first < t.first) == (v[rr] == 1))\n b.second++, t.second++;\n else\n b.second--, t.second--;\n }\n ans.push_back(a);\n ans.push_back(b);\n for (int i = rr; i < now.size(); i++)\n ans.push_back(now[i]);\n ans[(rr + 2) % ans.size()] = t;\n \/\/ for (int i = 0; i < v.size(); i++)printf(\"%d \", v[i]); printf(\"\\\\n\");\n \/\/ for (int i = 0; i < ans.size(); i++)printf(\"%d %d \", ans[i].first,\n \/\/ ans[i].second); printf(\"\\\\n\");\n return comp(ans);\n}\nint main() {\n int num;\n scanf(\"%d\", &num);\n vector<int> v;\n int s = 0;\n for (int i = 0; i < num; i++) {\n int z;\n scanf(\"%d\", &z);\n v.push_back((180 - z) \/ 90);\n s += v[i];\n }\n if (s != 4) {\n printf(\"-1\\\\n\");\n return 0;\n }\n vector<pii> r = calc(v);\n for (int i = 0; i < num; i++)\n printf(\"%d %d\\\\n\", r[i].first, r[i].second);\n}","change":"replace","i1":78,"i2":80,"j1":78,"j2":82,"error":"WA","stderr":null,"stdout":"0 0\n4 0\n4 4\n12 4\n12 12\n4 12\n4 8\n0 8\n"}
{"problem_id":"p03877","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\nconst double PI = 3.14159265358979323846;\nconst double EPS = 1e-12;\nconst ll INF = 1LL << 29;\nconst ll mod = 1e9 + 7;\n#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); ++(i))\n#define repd(i, n, d) for (ll(i) = 0; (i) < (ll)(n); (i) += (d))\n#define all(v) (v).begin(), (v).end()\n#define pb(x) push_back(x)\n#define mp(x, y) make_pair((x), (y))\n#define mset(m, v) memset((m), (v), sizeof(m))\n#define chmin(x, y) (x = min(x, y))\n#define chmax(x, y) (x = max(x, y))\n#define fst first\n#define snd second\n#define UNIQUE(x) (x).erase(unique(all(x)), (x).end())\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n int n = v.size();\n rep(i, n) os << v[i] << (i == n - 1 ? \"\" : \" \");\n return os;\n}\n#define N 40010\nll n, a, b, c;\n\nll inv[N], fact[N], ifact[N], be[N];\n\nll comb(ll a, ll b) { return fact[a + b] * ifact[a] % mod * ifact[b] % mod; }\n\nll comb_nk(ll n, ll k) { return comb(n - k, k); }\n\nll pow_mod(ll a, ll r, ll m) {\n ll x = 1;\n while (r) {\n if (r & 1)\n (x *= a) %= m;\n (a *= a) %= m;\n r >>= 1;\n }\n return x;\n}\n\nvoid init_fact(ll n = N) {\n inv[1] = 1;\n for (int i = 2; i < n; i++)\n inv[i] = inv[mod % i] * (mod - mod \/ i) % mod;\n fact[0] = ifact[0] = 1;\n for (int i = 1; i < n; i++) {\n fact[i] = (fact[i - 1] * i) % mod;\n ifact[i] = (ifact[i - 1] * inv[i]) % mod;\n }\n}\n\nint main() {\n init_fact();\n cin >> n >> a >> b >> c;\n if (b % 2) {\n cout << 0 << endl;\n while (true)\n ;\n return 0;\n }\n if (b == 0)\n return -1;\n b \/= 2;\n ll res = 0;\n rep(y, a + 1) {\n ll z = a - y;\n for (ll x = 0; x <= (c - y) \/ 3; x++) {\n ll w = c - y - 3 * x;\n if (b == 0 && w > 0)\n continue;\n (res += fact[x + y + z + b] * ifact[x] % mod * ifact[y] % mod * ifact[z] %\n mod * ifact[b] % mod * comb_nk(w + b - 1, w)) %= mod;\n }\n }\n cout << res << endl;\n return 0;\n}\n","fail":"#include <algorithm>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\nconst double PI = 3.14159265358979323846;\nconst double EPS = 1e-12;\nconst ll INF = 1LL << 29;\nconst ll mod = 1e9 + 7;\n#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); ++(i))\n#define repd(i, n, d) for (ll(i) = 0; (i) < (ll)(n); (i) += (d))\n#define all(v) (v).begin(), (v).end()\n#define pb(x) push_back(x)\n#define mp(x, y) make_pair((x), (y))\n#define mset(m, v) memset((m), (v), sizeof(m))\n#define chmin(x, y) (x = min(x, y))\n#define chmax(x, y) (x = max(x, y))\n#define fst first\n#define snd second\n#define UNIQUE(x) (x).erase(unique(all(x)), (x).end())\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n int n = v.size();\n rep(i, n) os << v[i] << (i == n - 1 ? \"\" : \" \");\n return os;\n}\n#define N 40010\nll n, a, b, c;\n\nll inv[N], fact[N], ifact[N], be[N];\n\nll comb(ll a, ll b) { return fact[a + b] * ifact[a] % mod * ifact[b] % mod; }\n\nll comb_nk(ll n, ll k) {\n if (n < 0)\n return 1;\n return comb(n - k, k);\n}\n\nll pow_mod(ll a, ll r, ll m) {\n ll x = 1;\n while (r) {\n if (r & 1)\n (x *= a) %= m;\n (a *= a) %= m;\n r >>= 1;\n }\n return x;\n}\n\nvoid init_fact(ll n = N) {\n inv[1] = 1;\n for (int i = 2; i < n; i++)\n inv[i] = inv[mod % i] * (mod - mod \/ i) % mod;\n fact[0] = ifact[0] = 1;\n for (int i = 1; i < n; i++) {\n fact[i] = (fact[i - 1] * i) % mod;\n ifact[i] = (ifact[i - 1] * inv[i]) % mod;\n }\n}\n\nint main() {\n init_fact();\n cin >> n >> a >> b >> c;\n if (b % 2) {\n cout << 0 << endl;\n return 0;\n }\n b \/= 2;\n ll res = 0;\n rep(y, a + 1) {\n ll z = a - y;\n for (ll x = 0; x <= (c - y) \/ 3; x++) {\n ll w = c - y - 3 * x;\n if (w < 0)\n continue;\n if (b == 0 && w > 0)\n continue;\n (res += fact[x + y + z + b] * ifact[x] % mod * ifact[y] % mod * ifact[z] %\n mod * ifact[b] % mod * comb_nk(w + b - 1, w)) %= mod;\n }\n }\n cout << res << endl;\n return 0;\n}\n","change":"replace","i1":50,"i2":91,"j1":50,"j2":93,"error":0,"stderr":null,"stdout":2.0}
{"problem_id":"p03877","language":"C++","original_status":"Runtime Error","pass":"#include <iostream>\nusing namespace std;\n\nlong long N, A, B, C, sum1[5009], sum2[5009][5009], ans, mod = 1000000007;\nlong long fact[5009], inv[5009], factinv[5009];\n\nvoid init() {\n fact[0] = 1;\n for (int i = 1; i <= 5000; i++)\n fact[i] = (fact[i - 1] * i) % mod;\n inv[1] = 1;\n for (int i = 2; i <= 5000; i++)\n inv[i] = (mod - (1LL * (mod \/ i) * inv[mod % i]) % mod) % mod;\n factinv[0] = 1;\n for (int i = 1; i <= 5000; i++)\n factinv[i] = (factinv[i - 1] * inv[i]) % mod;\n}\nlong long ncr(long long n, long long r) {\n if (n < 0 || r < 0 || n < r)\n return 0;\n return (((fact[n] * factinv[n - r]) % mod) * factinv[r]) % mod;\n}\n\nint main() {\n init();\n cin >> N >> A >> B >> C;\n if (B % 2 == 1) {\n cout << \"0\" << endl;\n return 0;\n }\n\n for (int i = 0; i <= B \/ 2; i++) {\n for (int j = 0; j <= C; j++) {\n long long ret = factinv[i] * factinv[B \/ 2 - i];\n ret *= ncr(j + (i - 1), (i - 1));\n ret %= mod;\n sum1[j] += ret;\n sum1[j] %= mod;\n }\n }\n for (int i = 0; i <= C; i++) {\n for (int j = 0; j <= C; j += 3) {\n if (i + j > C || i > A)\n continue;\n long long P1 = A - i, P2 = i, P3 = j \/ 3;\n long long ret = factinv[P1] * factinv[P2];\n ret %= mod;\n ret *= factinv[P3];\n ret %= mod;\n sum2[P1 + P2 + P3][i + j] += ret;\n sum2[P1 + P2 + P3][j] %= mod;\n }\n }\n\n for (int i = 0; i <= C; i++) {\n for (int j = 0; j <= N; j++) {\n ans += ((sum1[i] * sum2[j + A + i][C - i]) % mod) * fact[j];\n ans %= mod;\n }\n }\n cout << ans << endl;\n return 0;\n}","fail":"#include <iostream>\nusing namespace std;\n\nlong long N, A, B, C, dp[5009][5009], fact[5009], factinv[5009],\n mod = 1000000007;\n\nlong long modpow(long long a, long long b, long long m) {\n long long p = 1, q = a;\n for (int i = 0; i < 30; i++) {\n if ((b \/ (1 << i)) % 2 == 1) {\n p *= q;\n p %= m;\n }\n q *= q;\n q %= m;\n }\n return p;\n}\nlong long Div(long long a, long long b, long long m) {\n return (a * modpow(b, m - 2, m)) % m;\n}\nvoid init() {\n fact[0] = 1;\n for (int i = 1; i <= 5000; i++)\n fact[i] = (fact[i - 1] * i) % mod;\n for (int i = 0; i <= 5000; i++)\n factinv[i] = Div(1, fact[i], mod);\n\n dp[0][0] = 1;\n for (int i = 1; i <= 5000; i++) {\n for (int j = 0; j <= 5000; j++)\n dp[i][j] += dp[i - 1][j];\n for (int j = 1; j <= 5000; j++) {\n dp[i][j] += dp[i][j - 1];\n dp[i][j] %= mod;\n }\n }\n}\n\nint main() {\n init();\n cin >> N >> A >> B >> C;\n if (B % 2 == 1) {\n cout << \"0\" << endl;\n return 0;\n }\n long long sum = 0;\n for (int i = 0; i <= A; i++) {\n for (int j = 0; j <= C; j++) {\n long long a = i, b = (A - i), c = j, d = B \/ 2, n = (C - b - 3 * c);\n if (a < 0 || b < 0 || c < 0 || d < 0 || n < 0)\n continue;\n long long X = fact[a + b + c + d];\n X *= factinv[a];\n X %= mod;\n X *= factinv[b];\n X %= mod;\n X *= factinv[c];\n X %= mod;\n X *= factinv[d];\n X %= mod;\n X *= dp[d][n];\n X %= mod;\n sum += X;\n sum %= mod;\n }\n }\n cout << sum << endl;\n return 0;\n}","change":"replace","i1":3,"i2":61,"j1":3,"j2":68,"error":-11,"stderr":null,"stdout":null}
{"problem_id":"p03877","language":"C++","original_status":"Runtime Error","pass":"#ifndef __INTMOD_H__\n#define __INTMOD_H__\n\n\/* updated: 2019-10-10 *\/\n\n#include <cassert>\n#include <cstdint>\n#include <functional>\n#include <iostream>\n#include <unordered_map>\n#include <vector>\n\ntemplate <uint32_t Mod> class IntMod {\n static_assert(Mod != 0, \"Mod must not be 0\");\n static_assert(Mod < 0x80000000, \"Mod must be less than 0x80000000\");\n\nprivate:\n uint32_t value_m;\n\npublic:\n IntMod();\n IntMod(int32_t value);\n IntMod(uint32_t value);\n IntMod(int64_t value);\n IntMod(uint64_t value);\n\n const IntMod<Mod> &operator+() const;\n IntMod<Mod> operator-() const;\n IntMod<Mod> &operator++();\n IntMod<Mod> &operator--();\n IntMod<Mod> operator++(int dummy);\n IntMod<Mod> operator--(int dummy);\n IntMod<Mod> &operator+=(const IntMod<Mod> &right);\n IntMod<Mod> &operator-=(const IntMod<Mod> &right);\n IntMod<Mod> &operator*=(const IntMod<Mod> &right);\n IntMod<Mod> &operator\/=(const IntMod<Mod> &right);\n IntMod<Mod> operator[](uint64_t exp) const;\n\n static IntMod<Mod> add(const IntMod<Mod> &a, const IntMod<Mod> &b);\n static IntMod<Mod> subtract(const IntMod<Mod> &a, const IntMod<Mod> &b);\n static IntMod<Mod> multiply(const IntMod<Mod> &a, const IntMod<Mod> &b);\n static IntMod<Mod> divide(const IntMod<Mod> &a, const IntMod<Mod> &b);\n static int compare(const IntMod<Mod> &a, const IntMod<Mod> &b);\n\n IntMod<Mod> inverse() const;\n IntMod<Mod> power(uint64_t exp) const;\n uint32_t get() const;\n\n static IntMod<Mod> fact(uint32_t num);\n static IntMod<Mod> invFact(uint32_t num);\n static IntMod<Mod> combi(uint32_t n, uint32_t r);\n static IntMod<Mod> homcombi(uint32_t n, uint32_t r);\n static IntMod<Mod> perm(uint32_t n, uint32_t r);\n static std::vector<IntMod<Mod>> calcInverseList(int max);\n};\n\ntemplate <uint32_t Mod>\nIntMod<Mod> operator+(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nIntMod<Mod> operator-(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nIntMod<Mod> operator*(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nIntMod<Mod> operator\/(const IntMod<Mod> &a, const IntMod<Mod> &b);\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator+(const IntMod<Mod> &a, const Int &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator-(const IntMod<Mod> &a, const Int &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator*(const IntMod<Mod> &a, const Int &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator\/(const IntMod<Mod> &a, const Int &b);\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator+(const Int &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator-(const Int &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator*(const Int &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator\/(const Int &a, const IntMod<Mod> &b);\n\ntemplate <uint32_t Mod>\nbool operator==(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nbool operator!=(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nbool operator<(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nbool operator<=(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nbool operator>(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nbool operator>=(const IntMod<Mod> &a, const IntMod<Mod> &b);\n\ntemplate <uint32_t Mod, class Int>\nbool operator==(const IntMod<Mod> &a, const Int &b);\ntemplate <uint32_t Mod, class Int>\nbool operator!=(const IntMod<Mod> &a, const Int &b);\n\ntemplate <uint32_t Mod>\nstd::istream &operator>>(std::istream &ist, IntMod<Mod> &object);\ntemplate <uint32_t Mod>\nstd::ostream &operator<<(std::ostream &ost, const IntMod<Mod> &object);\n\nusing MInt = IntMod<1000000007>;\nusing MF = IntMod<998244353>;\n\n\/\/ for unordered_set\/map\nnamespace std {\ntemplate <uint32_t Mod> struct hash<IntMod<Mod>> {\n size_t operator()(const IntMod<Mod> &object) const {\n return std::hash<uint32_t>()(object.get());\n }\n};\n} \/\/ namespace std\n\ntemplate <uint32_t Mod>\nuint32_t discreteLog(const IntMod<Mod> &a, const IntMod<Mod> &b);\n\n\/*------------------------------------*\/\n\/*------- Implementations --------*\/\n\/*------------------------------------*\/\n\ntemplate <uint32_t Mod> IntMod<Mod>::IntMod() : value_m(0) {}\n\ntemplate <uint32_t Mod> IntMod<Mod>::IntMod(int32_t value) {\n int32_t tmp = value % int32_t(Mod);\n value_m = tmp >= 0 ? tmp : Mod - uint32_t(-tmp);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod>::IntMod(uint32_t value) : value_m(value % Mod) {}\n\ntemplate <uint32_t Mod> IntMod<Mod>::IntMod(int64_t value) {\n int32_t tmp = value % int64_t(Mod);\n value_m = tmp >= 0 ? tmp : Mod - uint32_t(-tmp);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod>::IntMod(uint64_t value) : value_m(value % Mod) {}\n\ntemplate <uint32_t Mod> const IntMod<Mod> &IntMod<Mod>::operator+() const {\n return *this;\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::operator-() const {\n IntMod<Mod> ret;\n if (value_m == 0) {\n ret.value_m = 0;\n } else {\n ret.value_m = Mod - value_m;\n }\n return ret;\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> &IntMod<Mod>::operator++() {\n ++value_m;\n if (value_m == Mod) {\n value_m = 0;\n }\n return *this;\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> &IntMod<Mod>::operator--() {\n if (value_m == 0) {\n value_m = Mod;\n }\n --value_m;\n return *this;\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::operator++(int dummy) {\n IntMod ret(*this);\n ++*this;\n return ret;\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::operator--(int dummy) {\n IntMod ret(*this);\n --*this;\n return ret;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> &IntMod<Mod>::operator+=(const IntMod<Mod> &right) {\n value_m += right.value_m; \/\/ note: value_m < 0x80000000\n if (value_m >= Mod) {\n value_m -= Mod;\n }\n return *this;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> &IntMod<Mod>::operator-=(const IntMod<Mod> &right) {\n if (value_m < right.value_m) {\n value_m += Mod; \/\/ note: value_m < 0x80000000\n }\n value_m -= right.value_m;\n return *this;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> &IntMod<Mod>::operator*=(const IntMod<Mod> &right) {\n value_m = (uint64_t(value_m) * right.value_m) % Mod;\n return *this;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> &IntMod<Mod>::operator\/=(const IntMod<Mod> &right) {\n *this *= right.inverse();\n return *this;\n}\n\n\/\/ for power\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::operator[](uint64_t exp) const {\n return power(exp);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::add(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n IntMod<Mod> ret(a);\n ret += b;\n return ret;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::subtract(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n IntMod<Mod> ret(a);\n ret -= b;\n return ret;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::multiply(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n IntMod<Mod> ret(a);\n ret *= b;\n return ret;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::divide(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n IntMod<Mod> ret(a);\n ret \/= b;\n return ret;\n}\n\ntemplate <uint32_t Mod>\nint IntMod<Mod>::compare(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n if (a.value_m < b.value_m)\n return -1;\n if (a.value_m > b.value_m)\n return 1;\n return 0;\n}\n\n\/* Mod must be a prime. *\/\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::inverse() const {\n assert(value_m != 0);\n return power(Mod - 2);\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::power(uint64_t exp) const {\n IntMod<Mod> product(1);\n IntMod<Mod> factor(*this);\n while (exp > 0) {\n if (exp & 1) {\n product *= factor;\n }\n factor *= factor;\n exp >>= 1;\n }\n return product;\n}\n\ntemplate <uint32_t Mod> uint32_t IntMod<Mod>::get() const { return value_m; }\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::fact(uint32_t num) {\n assert(num <= 0x80000000);\n\n static std::vector<IntMod<Mod>> table(1, 1);\n if (table.size() > num)\n return table[num];\n\n uint32_t old_size = table.size();\n table.resize(num + 1);\n for (uint32_t i = old_size; i <= num; ++i) {\n table[i] = table[i - 1] * i;\n }\n return table[num];\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::invFact(uint32_t num) {\n assert(num <= 0x80000000);\n\n static std::vector<IntMod<Mod>> table(1, 1);\n if (table.size() > num)\n return table[num];\n\n uint32_t old_size = table.size();\n table.resize(num + 1);\n table[num] = fact(num).inverse();\n for (uint32_t i = num; i >= old_size; --i) {\n table[i - 1] = table[i] * i;\n }\n return table[num];\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::combi(uint32_t n, uint32_t r) {\n assert(n >= r);\n return fact(n) * invFact(n - r) * invFact(r);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::homcombi(uint32_t n, uint32_t r) {\n assert(n != 0 || r == 0);\n\n if (n == 0 && r == 0)\n return IntMod<Mod>(1);\n return combi(n + r - 1, r);\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::perm(uint32_t n, uint32_t r) {\n assert(n >= r);\n return fact(n) \/ fact(n - r);\n}\n\ntemplate <uint32_t Mod>\nstd::vector<IntMod<Mod>> IntMod<Mod>::calcInverseList(int max) {\n assert(max < Mod);\n\n std::vector<IntMod<Mod>> table(max + 1);\n table[1] = 1;\n for (int i = 2; i <= max; ++i) {\n table[i] = (uint64_t(Mod - Mod \/ i) * table[Mod % i].get()) % Mod;\n }\n return table;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> operator+(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::add(a, b);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> operator-(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::subtract(a, b);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> operator*(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::multiply(a, b);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> operator\/(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::divide(a, b);\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator+(const IntMod<Mod> &a, const Int &b) {\n return a + IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator-(const IntMod<Mod> &a, const Int &b) {\n return a - IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator*(const IntMod<Mod> &a, const Int &b) {\n return a * IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator\/(const IntMod<Mod> &a, const Int &b) {\n return a \/ IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator+(const Int &a, const IntMod<Mod> &b) {\n return IntMod<Mod>(a) + b;\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator-(const Int &a, const IntMod<Mod> &b) {\n return IntMod<Mod>(a) - b;\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator*(const Int &a, const IntMod<Mod> &b) {\n return IntMod<Mod>(a) * b;\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator\/(const Int &a, const IntMod<Mod> &b) {\n return IntMod<Mod>(a) \/ b;\n}\n\ntemplate <uint32_t Mod>\nbool operator==(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) == 0;\n}\n\ntemplate <uint32_t Mod>\nbool operator!=(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) != 0;\n}\n\ntemplate <uint32_t Mod>\nbool operator<(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) < 0;\n}\n\ntemplate <uint32_t Mod>\nbool operator<=(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) <= 0;\n}\n\ntemplate <uint32_t Mod>\nbool operator>(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) > 0;\n}\n\ntemplate <uint32_t Mod>\nbool operator>=(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) >= 0;\n}\n\ntemplate <uint32_t Mod, class Int>\nbool operator==(const IntMod<Mod> &a, const Int &b) {\n return a == IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod, class Int>\nbool operator!=(const IntMod<Mod> &a, const Int &b) {\n return a != IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod>\nstd::istream &operator>>(std::istream &ist, IntMod<Mod> &object) {\n uint64_t value;\n ist >> value;\n object = IntMod<Mod>(value);\n return ist;\n}\n\ntemplate <uint32_t Mod>\nstd::ostream &operator<<(std::ostream &ost, const IntMod<Mod> &object) {\n ost << object.get();\n return ost;\n}\n\n#endif\n\n#define _CRT_SECURE_NO_WARNINGS\n#define _SCL_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <valarray>\n#include <vector>\n\nusing namespace std;\nusing uint = uint32_t;\nusing LL = int64_t;\nusing ULL = uint64_t;\nusing PP = pair<LL, LL>;\ntemplate <typename T>\nusing PriorityQ = priority_queue<T, vector<T>, greater<T>>;\n#define REP(i, a, n) for (LL i = (a), i##_max_ = (n); i < i##_max_; ++i)\n#define REM(i, a, n) for (LL i = (LL)(n)-1, i##_min_ = (a); i >= i##_min_; --i)\n#define FLOAT fixed << setprecision(16)\n#define SPEEDUP \\\\\n { \\\\\n cin.tie(NULL); \\\\\n ios::sync_with_stdio(false); \\\\\n }\nconst int INF = 0x3FFFFFFF;\nconst LL INFLL = 0x3FFFFFFF3FFFFFFF;\nconst double INFD = 1.0e+308;\nconst double EPS = 1.0e-9;\n\nvoid YesNo(bool b) { cout << (b ? \"Yes\" : \"No\") << endl; }\nvoid YESNO(bool b) { cout << (b ? \"YES\" : \"NO\") << endl; }\ntemplate <class T, class U>\nistream &operator>>(istream &ist, pair<T, U> &right) {\n return ist >> right.first >> right.second;\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &ost, const pair<T, U> &right) {\n return ost << right.first << ' ' << right.second;\n}\ntemplate <class T, class TCompatible, size_t N>\nvoid Fill(T (&dest)[N], const TCompatible &val) {\n fill(dest, dest + N, val);\n}\ntemplate <class T, class TCompatible, size_t M, size_t N>\nvoid Fill(T (&dest)[M][N], const TCompatible &val) {\n for (int i = 0; i < M; ++i)\n Fill(dest[i], val);\n}\ntemplate <class T> T Next() {\n T buf;\n cin >> buf;\n return buf;\n}\nistream &Ignore(istream &ist) {\n string s;\n ist >> s;\n return ist;\n}\nbool Inside(int i, int j, int h, int w) {\n return i >= 0 && i < h && j >= 0 && j < w;\n}\n\n#ifdef ONLY_MY_ENVIR\n#include \"Accumulator.h\"\n#include \"Algebraic.h\"\n#include \"BIT.h\"\n#include \"BinaryMatrix.h\"\n#include \"BinaryTree.h\"\n#include \"Bipartite.h\"\n#include \"Compressor.h\"\n#include \"Decompositions.h\"\n#include \"DynamicMod.h\"\n#include \"FFT.h\"\n#include \"Factorization.h\"\n#include \"FlowSolver.h\"\n#include \"Graph.h\"\n#include \"GraphUtil.h\"\n#include \"IntMod.h\"\n#include \"LIS.h\"\n#include \"LazySegmentTree.h\"\n#include \"Math.h\"\n#include \"MathUtil.h\"\n#include \"Matrix.h\"\n#include \"MinCostFlowSolver.h\"\n#include \"MinMax.h\"\n#include \"Numbers.h\"\n#include \"Optimize.h\"\n#include \"Permutation.h\"\n#include \"Polynomial.h\"\n#include \"Position.h\"\n#include \"Range.h\"\n#include \"Rational.h\"\n#include \"SegmentTree.h\"\n#include \"SegmentTree2D.h\"\n#include \"Sets.h\"\n#include \"Shortest.h\"\n#include \"SlidingWindow.h\"\n#include \"SpanningTree.h\"\n#include \"StringSearching.h\"\n#include \"SuffixArray.h\"\n#include \"Tree.h\"\n#include \"TreeUtil.h\"\n#include \"UnionFind.h\"\n#include \"Util.h\"\n#include \"VectorUtil.h\"\n#endif\n\n#ifdef __GNUC__\ntypedef __int128 LLL;\nistream &operator>>(istream &ist, __int128 &val) {\n LL tmp;\n ist >> tmp;\n val = tmp;\n return ist;\n}\nostream &operator<<(ostream &ost, __int128 val) {\n LL tmp = val;\n ost << tmp;\n return ost;\n}\n#endif\n\nint N, A, B, C;\nint main() {\n cin >> N >> A >> B >> C;\n if (B % 2 == 0) {\n MInt sum;\n REP(x, 0, N) {\n REP(y, 0, 2 * N) {\n if ((C - x - y) % 3 != 0)\n continue;\n int p = A - x;\n int q = x;\n int r = (C - x - y) \/ 3;\n int s = B \/ 2;\n if (p < 0)\n continue;\n if (q < 0)\n continue;\n if (r < 0)\n continue;\n sum += MInt::fact(p + q + r + s) * MInt::homcombi(s, y) \/\n (MInt::fact(p) * MInt::fact(q) * MInt::fact(r) * MInt::fact(s));\n }\n }\n cout << sum << endl;\n } else {\n cout << 0 << endl;\n }\n return 0;\n}\n","fail":"#ifndef __INTMOD_H__\n#define __INTMOD_H__\n\n\/* updated: 2019-10-10 *\/\n\n#include <cassert>\n#include <cstdint>\n#include <functional>\n#include <iostream>\n#include <unordered_map>\n#include <vector>\n\ntemplate <uint32_t Mod> class IntMod {\n static_assert(Mod != 0, \"Mod must not be 0\");\n static_assert(Mod < 0x80000000, \"Mod must be less than 0x80000000\");\n\nprivate:\n uint32_t value_m;\n\npublic:\n IntMod();\n IntMod(int32_t value);\n IntMod(uint32_t value);\n IntMod(int64_t value);\n IntMod(uint64_t value);\n\n const IntMod<Mod> &operator+() const;\n IntMod<Mod> operator-() const;\n IntMod<Mod> &operator++();\n IntMod<Mod> &operator--();\n IntMod<Mod> operator++(int dummy);\n IntMod<Mod> operator--(int dummy);\n IntMod<Mod> &operator+=(const IntMod<Mod> &right);\n IntMod<Mod> &operator-=(const IntMod<Mod> &right);\n IntMod<Mod> &operator*=(const IntMod<Mod> &right);\n IntMod<Mod> &operator\/=(const IntMod<Mod> &right);\n IntMod<Mod> operator[](uint64_t exp) const;\n\n static IntMod<Mod> add(const IntMod<Mod> &a, const IntMod<Mod> &b);\n static IntMod<Mod> subtract(const IntMod<Mod> &a, const IntMod<Mod> &b);\n static IntMod<Mod> multiply(const IntMod<Mod> &a, const IntMod<Mod> &b);\n static IntMod<Mod> divide(const IntMod<Mod> &a, const IntMod<Mod> &b);\n static int compare(const IntMod<Mod> &a, const IntMod<Mod> &b);\n\n IntMod<Mod> inverse() const;\n IntMod<Mod> power(uint64_t exp) const;\n uint32_t get() const;\n\n static IntMod<Mod> fact(uint32_t num);\n static IntMod<Mod> invFact(uint32_t num);\n static IntMod<Mod> combi(uint32_t n, uint32_t r);\n static IntMod<Mod> homcombi(uint32_t n, uint32_t r);\n static IntMod<Mod> perm(uint32_t n, uint32_t r);\n static std::vector<IntMod<Mod>> calcInverseList(int max);\n};\n\ntemplate <uint32_t Mod>\nIntMod<Mod> operator+(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nIntMod<Mod> operator-(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nIntMod<Mod> operator*(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nIntMod<Mod> operator\/(const IntMod<Mod> &a, const IntMod<Mod> &b);\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator+(const IntMod<Mod> &a, const Int &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator-(const IntMod<Mod> &a, const Int &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator*(const IntMod<Mod> &a, const Int &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator\/(const IntMod<Mod> &a, const Int &b);\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator+(const Int &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator-(const Int &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator*(const Int &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator\/(const Int &a, const IntMod<Mod> &b);\n\ntemplate <uint32_t Mod>\nbool operator==(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nbool operator!=(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nbool operator<(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nbool operator<=(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nbool operator>(const IntMod<Mod> &a, const IntMod<Mod> &b);\ntemplate <uint32_t Mod>\nbool operator>=(const IntMod<Mod> &a, const IntMod<Mod> &b);\n\ntemplate <uint32_t Mod, class Int>\nbool operator==(const IntMod<Mod> &a, const Int &b);\ntemplate <uint32_t Mod, class Int>\nbool operator!=(const IntMod<Mod> &a, const Int &b);\n\ntemplate <uint32_t Mod>\nstd::istream &operator>>(std::istream &ist, IntMod<Mod> &object);\ntemplate <uint32_t Mod>\nstd::ostream &operator<<(std::ostream &ost, const IntMod<Mod> &object);\n\nusing MInt = IntMod<1000000007>;\nusing MF = IntMod<998244353>;\n\n\/\/ for unordered_set\/map\nnamespace std {\ntemplate <uint32_t Mod> struct hash<IntMod<Mod>> {\n size_t operator()(const IntMod<Mod> &object) const {\n return std::hash<uint32_t>()(object.get());\n }\n};\n} \/\/ namespace std\n\ntemplate <uint32_t Mod>\nuint32_t discreteLog(const IntMod<Mod> &a, const IntMod<Mod> &b);\n\n\/*------------------------------------*\/\n\/*------- Implementations --------*\/\n\/*------------------------------------*\/\n\ntemplate <uint32_t Mod> IntMod<Mod>::IntMod() : value_m(0) {}\n\ntemplate <uint32_t Mod> IntMod<Mod>::IntMod(int32_t value) {\n int32_t tmp = value % int32_t(Mod);\n value_m = tmp >= 0 ? tmp : Mod - uint32_t(-tmp);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod>::IntMod(uint32_t value) : value_m(value % Mod) {}\n\ntemplate <uint32_t Mod> IntMod<Mod>::IntMod(int64_t value) {\n int32_t tmp = value % int64_t(Mod);\n value_m = tmp >= 0 ? tmp : Mod - uint32_t(-tmp);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod>::IntMod(uint64_t value) : value_m(value % Mod) {}\n\ntemplate <uint32_t Mod> const IntMod<Mod> &IntMod<Mod>::operator+() const {\n return *this;\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::operator-() const {\n IntMod<Mod> ret;\n if (value_m == 0) {\n ret.value_m = 0;\n } else {\n ret.value_m = Mod - value_m;\n }\n return ret;\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> &IntMod<Mod>::operator++() {\n ++value_m;\n if (value_m == Mod) {\n value_m = 0;\n }\n return *this;\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> &IntMod<Mod>::operator--() {\n if (value_m == 0) {\n value_m = Mod;\n }\n --value_m;\n return *this;\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::operator++(int dummy) {\n IntMod ret(*this);\n ++*this;\n return ret;\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::operator--(int dummy) {\n IntMod ret(*this);\n --*this;\n return ret;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> &IntMod<Mod>::operator+=(const IntMod<Mod> &right) {\n value_m += right.value_m; \/\/ note: value_m < 0x80000000\n if (value_m >= Mod) {\n value_m -= Mod;\n }\n return *this;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> &IntMod<Mod>::operator-=(const IntMod<Mod> &right) {\n if (value_m < right.value_m) {\n value_m += Mod; \/\/ note: value_m < 0x80000000\n }\n value_m -= right.value_m;\n return *this;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> &IntMod<Mod>::operator*=(const IntMod<Mod> &right) {\n value_m = (uint64_t(value_m) * right.value_m) % Mod;\n return *this;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> &IntMod<Mod>::operator\/=(const IntMod<Mod> &right) {\n *this *= right.inverse();\n return *this;\n}\n\n\/\/ for power\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::operator[](uint64_t exp) const {\n return power(exp);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::add(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n IntMod<Mod> ret(a);\n ret += b;\n return ret;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::subtract(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n IntMod<Mod> ret(a);\n ret -= b;\n return ret;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::multiply(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n IntMod<Mod> ret(a);\n ret *= b;\n return ret;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::divide(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n IntMod<Mod> ret(a);\n ret \/= b;\n return ret;\n}\n\ntemplate <uint32_t Mod>\nint IntMod<Mod>::compare(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n if (a.value_m < b.value_m)\n return -1;\n if (a.value_m > b.value_m)\n return 1;\n return 0;\n}\n\n\/* Mod must be a prime. *\/\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::inverse() const {\n assert(value_m != 0);\n return power(Mod - 2);\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::power(uint64_t exp) const {\n IntMod<Mod> product(1);\n IntMod<Mod> factor(*this);\n while (exp > 0) {\n if (exp & 1) {\n product *= factor;\n }\n factor *= factor;\n exp >>= 1;\n }\n return product;\n}\n\ntemplate <uint32_t Mod> uint32_t IntMod<Mod>::get() const { return value_m; }\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::fact(uint32_t num) {\n assert(num <= 0x80000000);\n\n static std::vector<IntMod<Mod>> table(1, 1);\n if (table.size() > num)\n return table[num];\n\n uint32_t old_size = table.size();\n table.resize(num + 1);\n for (uint32_t i = old_size; i <= num; ++i) {\n table[i] = table[i - 1] * i;\n }\n return table[num];\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::invFact(uint32_t num) {\n assert(num <= 0x80000000);\n\n static std::vector<IntMod<Mod>> table(1, 1);\n if (table.size() > num)\n return table[num];\n\n uint32_t old_size = table.size();\n table.resize(num + 1);\n table[num] = fact(num).inverse();\n for (uint32_t i = num; i >= old_size; --i) {\n table[i - 1] = table[i] * i;\n }\n return table[num];\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::combi(uint32_t n, uint32_t r) {\n assert(n >= r);\n return fact(n) * invFact(n - r) * invFact(r);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> IntMod<Mod>::homcombi(uint32_t n, uint32_t r) {\n assert(n != 0 || r == 0);\n\n if (n == 0 && r == 0)\n return IntMod<Mod>(1);\n return combi(n + r - 1, r);\n}\n\ntemplate <uint32_t Mod> IntMod<Mod> IntMod<Mod>::perm(uint32_t n, uint32_t r) {\n assert(n >= r);\n return fact(n) \/ fact(n - r);\n}\n\ntemplate <uint32_t Mod>\nstd::vector<IntMod<Mod>> IntMod<Mod>::calcInverseList(int max) {\n assert(max < Mod);\n\n std::vector<IntMod<Mod>> table(max + 1);\n table[1] = 1;\n for (int i = 2; i <= max; ++i) {\n table[i] = (uint64_t(Mod - Mod \/ i) * table[Mod % i].get()) % Mod;\n }\n return table;\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> operator+(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::add(a, b);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> operator-(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::subtract(a, b);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> operator*(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::multiply(a, b);\n}\n\ntemplate <uint32_t Mod>\nIntMod<Mod> operator\/(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::divide(a, b);\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator+(const IntMod<Mod> &a, const Int &b) {\n return a + IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator-(const IntMod<Mod> &a, const Int &b) {\n return a - IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator*(const IntMod<Mod> &a, const Int &b) {\n return a * IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator\/(const IntMod<Mod> &a, const Int &b) {\n return a \/ IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator+(const Int &a, const IntMod<Mod> &b) {\n return IntMod<Mod>(a) + b;\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator-(const Int &a, const IntMod<Mod> &b) {\n return IntMod<Mod>(a) - b;\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator*(const Int &a, const IntMod<Mod> &b) {\n return IntMod<Mod>(a) * b;\n}\n\ntemplate <uint32_t Mod, class Int>\nIntMod<Mod> operator\/(const Int &a, const IntMod<Mod> &b) {\n return IntMod<Mod>(a) \/ b;\n}\n\ntemplate <uint32_t Mod>\nbool operator==(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) == 0;\n}\n\ntemplate <uint32_t Mod>\nbool operator!=(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) != 0;\n}\n\ntemplate <uint32_t Mod>\nbool operator<(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) < 0;\n}\n\ntemplate <uint32_t Mod>\nbool operator<=(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) <= 0;\n}\n\ntemplate <uint32_t Mod>\nbool operator>(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) > 0;\n}\n\ntemplate <uint32_t Mod>\nbool operator>=(const IntMod<Mod> &a, const IntMod<Mod> &b) {\n return IntMod<Mod>::compare(a, b) >= 0;\n}\n\ntemplate <uint32_t Mod, class Int>\nbool operator==(const IntMod<Mod> &a, const Int &b) {\n return a == IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod, class Int>\nbool operator!=(const IntMod<Mod> &a, const Int &b) {\n return a != IntMod<Mod>(b);\n}\n\ntemplate <uint32_t Mod>\nstd::istream &operator>>(std::istream &ist, IntMod<Mod> &object) {\n uint64_t value;\n ist >> value;\n object = IntMod<Mod>(value);\n return ist;\n}\n\ntemplate <uint32_t Mod>\nstd::ostream &operator<<(std::ostream &ost, const IntMod<Mod> &object) {\n ost << object.get();\n return ost;\n}\n\n#endif\n\n#define _CRT_SECURE_NO_WARNINGS\n#define _SCL_SECURE_NO_WARNINGS\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <valarray>\n#include <vector>\n\nusing namespace std;\nusing uint = uint32_t;\nusing LL = int64_t;\nusing ULL = uint64_t;\nusing PP = pair<LL, LL>;\ntemplate <typename T>\nusing PriorityQ = priority_queue<T, vector<T>, greater<T>>;\n#define REP(i, a, n) for (LL i = (a), i##_max_ = (n); i < i##_max_; ++i)\n#define REM(i, a, n) for (LL i = (LL)(n)-1, i##_min_ = (a); i >= i##_min_; --i)\n#define FLOAT fixed << setprecision(16)\n#define SPEEDUP \\\\\n { \\\\\n cin.tie(NULL); \\\\\n ios::sync_with_stdio(false); \\\\\n }\nconst int INF = 0x3FFFFFFF;\nconst LL INFLL = 0x3FFFFFFF3FFFFFFF;\nconst double INFD = 1.0e+308;\nconst double EPS = 1.0e-9;\n\nvoid YesNo(bool b) { cout << (b ? \"Yes\" : \"No\") << endl; }\nvoid YESNO(bool b) { cout << (b ? \"YES\" : \"NO\") << endl; }\ntemplate <class T, class U>\nistream &operator>>(istream &ist, pair<T, U> &right) {\n return ist >> right.first >> right.second;\n}\ntemplate <class T, class U>\nostream &operator<<(ostream &ost, const pair<T, U> &right) {\n return ost << right.first << ' ' << right.second;\n}\ntemplate <class T, class TCompatible, size_t N>\nvoid Fill(T (&dest)[N], const TCompatible &val) {\n fill(dest, dest + N, val);\n}\ntemplate <class T, class TCompatible, size_t M, size_t N>\nvoid Fill(T (&dest)[M][N], const TCompatible &val) {\n for (int i = 0; i < M; ++i)\n Fill(dest[i], val);\n}\ntemplate <class T> T Next() {\n T buf;\n cin >> buf;\n return buf;\n}\nistream &Ignore(istream &ist) {\n string s;\n ist >> s;\n return ist;\n}\nbool Inside(int i, int j, int h, int w) {\n return i >= 0 && i < h && j >= 0 && j < w;\n}\n\n#ifdef ONLY_MY_ENVIR\n#include \"Accumulator.h\"\n#include \"Algebraic.h\"\n#include \"BIT.h\"\n#include \"BinaryMatrix.h\"\n#include \"BinaryTree.h\"\n#include \"Bipartite.h\"\n#include \"Compressor.h\"\n#include \"Decompositions.h\"\n#include \"DynamicMod.h\"\n#include \"FFT.h\"\n#include \"Factorization.h\"\n#include \"FlowSolver.h\"\n#include \"Graph.h\"\n#include \"GraphUtil.h\"\n#include \"IntMod.h\"\n#include \"LIS.h\"\n#include \"LazySegmentTree.h\"\n#include \"Math.h\"\n#include \"MathUtil.h\"\n#include \"Matrix.h\"\n#include \"MinCostFlowSolver.h\"\n#include \"MinMax.h\"\n#include \"Numbers.h\"\n#include \"Optimize.h\"\n#include \"Permutation.h\"\n#include \"Polynomial.h\"\n#include \"Position.h\"\n#include \"Range.h\"\n#include \"Rational.h\"\n#include \"SegmentTree.h\"\n#include \"SegmentTree2D.h\"\n#include \"Sets.h\"\n#include \"Shortest.h\"\n#include \"SlidingWindow.h\"\n#include \"SpanningTree.h\"\n#include \"StringSearching.h\"\n#include \"SuffixArray.h\"\n#include \"Tree.h\"\n#include \"TreeUtil.h\"\n#include \"UnionFind.h\"\n#include \"Util.h\"\n#include \"VectorUtil.h\"\n#endif\n\n#ifdef __GNUC__\ntypedef __int128 LLL;\nistream &operator>>(istream &ist, __int128 &val) {\n LL tmp;\n ist >> tmp;\n val = tmp;\n return ist;\n}\nostream &operator<<(ostream &ost, __int128 val) {\n LL tmp = val;\n ost << tmp;\n return ost;\n}\n#endif\n\nint N, A, B, C;\nint main() {\n cin >> N >> A >> B >> C;\n if (B % 2 == 0) {\n MInt sum;\n REP(x, 0, N + 1) {\n REP(y, 0, 2 * N + 1) {\n if (B == 0 && y != 0)\n continue;\n if ((C - x - y) % 3 != 0)\n continue;\n int p = A - x;\n int q = x;\n int r = (C - x - y) \/ 3;\n int s = B \/ 2;\n if (p < 0)\n continue;\n if (q < 0)\n continue;\n if (r < 0)\n continue;\n sum += MInt::fact(p + q + r + s) * MInt::homcombi(s, y) \/\n (MInt::fact(p) * MInt::fact(q) * MInt::fact(r) * MInt::fact(s));\n }\n }\n cout << sum << endl;\n } else {\n cout << 0 << endl;\n }\n return 0;\n}\n","change":"replace","i1":605,"i2":607,"j1":605,"j2":609,"error":0,"stderr":null,"stdout":2.0}
{"problem_id":"p03877","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\n#define DN(en, ka) (F[en] * pot(F[ka] * F[en - ka] % Q, -1) % Q)\nusing namespace std;\ntypedef long long int ll;\nconst ll N = 1 << 16, Q = 1000000007;\nll n, a, b, c, res, F[N] = {1};\nint pot(ll a, ll b) {\n a %= Q;\n if (b < 0)\n return pot(pot(a, -b), Q - 2);\n if (b == 0)\n return 1;\n if (b % 2 == 1)\n return ((ll)pot(a, b - 1) * a) % Q;\n ll t = pot(a, b \/ 2);\n return (t * t) % Q;\n}\nint solve(int x, int y) {\n ll t = c - a + x - 3 * y, l = F[a + y + b \/ 2],\n m = F[x] * F[y] % Q * F[a - x] % Q * F[b \/ 2] % Q,\n k = b ? DN(b \/ 2 + t - 1, t) : 1;\n return (c < y * 3 + a - x) ? 0 : (l * pot(m, -1) % Q * k % Q);\n}\nint main() {\n for (int i = 1; i < N; i++)\n F[i] = (F[i - 1] * i) % Q;\n cin >> n >> a >> b >> c;\n if (b % 2 == 1) {\n cout << \"0\\\\n\";\n return 0;\n }\n for (int i = 0; i <= a; i++)\n for (int j = 0; j <= c \/ 3; j++)\n res += solve(i, j);\n cout << res % Q << endl;\n}\n","fail":"#include <bits\/stdc++.h>\n#define DN(en, ka) (F[en] * pot(F[ka] * F[en - ka] % Q, -1) % Q)\nusing namespace std;\ntypedef long long int ll;\nconst ll N = 1 << 16, Q = 1000000007;\nll n, a, b, c, res, F[N] = {1};\nint pot(ll a, ll b) {\n a %= Q;\n if (b < 0)\n return pot(pot(a, -b), Q - 2);\n if (b == 0)\n return 1;\n if (b % 2 == 1)\n return ((ll)pot(a, b - 1) * a) % Q;\n ll t = pot(a, b \/ 2);\n return (t * t) % Q;\n}\nint solve(int x, int y) {\n if (b % 2 == 1 || c < y * 3 + a - x ||\n (b == 0 && ((c - a + x) % 3 != 0 || c != y * 3 + a - x)))\n return 0;\n ll t = c - a + x - 3 * y, l = F[a + y + b \/ 2],\n m = F[x] * F[y] % Q * F[a - x] % Q * F[b \/ 2] % Q,\n k = b ? DN(b \/ 2 + t - 1, t) : 1;\n return l * pot(m, -1) % Q * k % Q;\n}\nint main() {\n for (int i = 1; i < N; i++)\n F[i] = (F[i - 1] * i) % Q;\n cin >> n >> a >> b >> c;\n for (int i = 0; i <= a; i++)\n for (int j = 0; j <= c \/ 3; j++) {\n res += solve(i, j);\n }\n cout << res % Q << endl;\n}\n","change":"replace","i1":18,"i2":34,"j1":18,"j2":34,"error":0,"stderr":null,"stdout":2.0}
{"problem_id":"p03877","language":"C++","original_status":"Runtime Error","pass":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define P 1000000007\nint N, A, B, C;\nint co[5010][5010];\nint dp[2501][5010][2];\nint ans;\n\nvoid up(int &x, int y) { x = (x + y) % P; }\n\nint main() {\n cin >> N >> A >> B >> C;\n co[0][0] = 1;\n for (int i = 1; i <= 5000; i++) {\n co[i][0] = 1;\n for (int j = 1; j <= i; j++)\n co[i][j] = (co[i - 1][j] + co[i - 1][j - 1]) % P;\n }\n if (B % 2 != 0) {\n printf(\"0\\\\n\");\n return 0;\n }\n dp[0][0][0] = 1;\n for (int i = 0; i <= N \/ 2; i++)\n for (int j = 0; j <= N; j++) {\n if (dp[i][j][1]) {\n up(dp[i][j][0], dp[i][j][1]);\n up(dp[i][j + 1][1], dp[i][j][1]);\n }\n if (dp[i][j][0]) {\n up(dp[i + 1][j][1], dp[i][j][0]);\n \/\/ up(dp[i + 1][j][0], dp[i][j][0]);\n }\n }\n \/\/ for (int i = 0; i <= N \/ 3; i++)\n for (int j = 0; j <= C; j++)\n if (dp[B \/ 2][j][0])\n for (int q = 0; j + 3 * q <= C; q++) {\n \/\/ if ((B - 2 * i) % 2 != 0)\n \/\/ \tcontinue;\n int aa = C - j - 3 * q, bb = q, cc = A - aa;\n \/\/ printf(\"?? %d %d %d %d %d\\\\n\", i, j, aa, bb, cc);\n if (aa < 0 || cc < 0)\n continue;\n \/\/ printf(\"?? %d %d %d %d %d %d\\\\n\", i, j, aa, bb, cc, dp[i][j][0]);\n\n int tmp = dp[B \/ 2][j][0];\n tmp = 1LL * tmp * co[B \/ 2 + aa][aa] % P;\n tmp = 1LL * tmp * co[B \/ 2 + aa + bb][bb] % P;\n tmp = 1LL * tmp * co[B \/ 2 + aa + bb + cc][cc] % P;\n \/\/ tmp = 1LL * tmp * co[i + aa + bb + cc][cc] % P;\n \/\/ tmp = 1LL * tmp * co[i + aa + bb + cc + q][q] % P;\n\n up(ans, tmp);\n }\n printf(\"%d\\\\n\", ans);\n}\n","fail":"#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\n\n#define P 1000000007\nint N, A, B, C;\nint co[5010][5010];\nint dp[2511][5010][2];\nint ans;\n\nvoid up(int &x, int y) { x = (x + y) % P; }\n\nint main() {\n cin >> N >> A >> B >> C;\n co[0][0] = 1;\n for (int i = 1; i <= 5000; i++) {\n co[i][0] = 1;\n for (int j = 1; j <= i; j++)\n co[i][j] = (co[i - 1][j] + co[i - 1][j - 1]) % P;\n }\n if (B % 2 != 0) {\n printf(\"0\\\\n\");\n return 0;\n }\n dp[0][0][0] = 1;\n for (int i = 0; i <= N \/ 2; i++)\n for (int j = 0; j <= N; j++) {\n if (dp[i][j][1]) {\n up(dp[i][j][0], dp[i][j][1]);\n up(dp[i][j + 1][1], dp[i][j][1]);\n }\n if (dp[i][j][0]) {\n up(dp[i + 1][j][1], dp[i][j][0]);\n \/\/ up(dp[i + 1][j][0], dp[i][j][0]);\n }\n }\n \/\/ for (int i = 0; i <= N \/ 3; i++)\n for (int j = 0; j <= C; j++)\n if (dp[B \/ 2][j][0])\n for (int q = 0; j + 3 * q <= C; q++) {\n \/\/ if ((B - 2 * i) % 2 != 0)\n \/\/ \tcontinue;\n int aa = C - j - 3 * q, bb = q, cc = A - aa;\n \/\/ printf(\"?? %d %d %d %d %d\\\\n\", i, j, aa, bb, cc);\n if (aa < 0 || cc < 0)\n continue;\n \/\/ printf(\"?? %d %d %d %d %d %d\\\\n\", i, j, aa, bb, cc, dp[i][j][0]);\n\n int tmp = dp[B \/ 2][j][0];\n tmp = 1LL * tmp * co[B \/ 2 + aa][aa] % P;\n tmp = 1LL * tmp * co[B \/ 2 + aa + bb][bb] % P;\n tmp = 1LL * tmp * co[B \/ 2 + aa + bb + cc][cc] % P;\n \/\/ tmp = 1LL * tmp * co[i + aa + bb + cc][cc] % P;\n \/\/ tmp = 1LL * tmp * co[i + aa + bb + cc + q][q] % P;\n\n up(ans, tmp);\n }\n printf(\"%d\\\\n\", ans);\n}\n","change":"replace","i1":17,"i2":18,"j1":17,"j2":18,"error":-11,"stderr":null,"stdout":null}
{"problem_id":"p03882","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <queue>\n#include <stdio.h>\n#include <string.h>\n#include <string>\n#include <vector>\n\n#ifdef LOCAL\n#define eprintf(...) fprintf(stderr, __VA_ARGS__)\n#else\n#define NDEBUG\n#define eprintf(...) \\\\\n do { \\\\\n } while (0)\n#endif\n#include <cassert>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef vector<int> VI;\n\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\n#define EACH(i, c) \\\\\n for (__typeof((c).begin()) i = (c).begin(), i##_end = (c).end(); \\\\\n i != i##_end; ++i)\n\ntemplate <class T> inline void amin(T &x, const T &y) {\n if (y < x)\n x = y;\n}\ntemplate <class T> inline void amax(T &x, const T &y) {\n if (x < y)\n x = y;\n}\ntemplate <class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {\n for (bool sp = 0; begin != end; ++begin) {\n if (sp)\n putchar(' ');\n else\n sp = true;\n printf(fmt, *begin);\n }\n putchar('\\\\n');\n}\ninline int bits(int m) { return (1 << m) - 1; }\nusing Double = double;\nconst Double INF = 1e100;\n\nint N;\nLL X[15], Y[15], A[15];\n\nDouble D[15][15];\nDouble cst[1 << 15];\nDouble sum[1 << 15];\nbool dp[1 << 15];\n\nbool ok(Double mid) {\n Double need = 0;\n Double rest = 0;\n REP(i, N) {\n if (A[i] < mid) {\n need += mid - A[i];\n } else {\n rest += A[i] - mid;\n }\n }\n if (need == 0)\n return true;\n if (rest < need)\n return false;\n\n REP(s, 1 << N) if (s) {\n REP(i, N) if (s >> i & 1) {\n sum[s] = sum[s ^ (1 << i)] + A[i];\n break;\n }\n }\n\n memset(dp, 0, sizeof dp);\n dp[0] = true;\n REP(s, 1 << N) if (dp[s]) {\n int sup = bits(N) ^ s;\n for (int t = sup; t; t = (t - 1) & sup) {\n if (sum[t] - __builtin_popcount(t) * mid - cst[t] >= 0)\n dp[s | t] = true;\n }\n }\n\n return dp[bits(N)];\n}\n\nvoid MAIN() {\n scanf(\"%d\", &N);\n REP(i, N) scanf(\"%lld%lld%lld\", X + i, Y + i, A + i);\n\n REP(t, N) REP(i, N - 1) if (A[i] > A[i + 1]) {\n swap(X[i], X[i + 1]);\n swap(Y[i], Y[i + 1]);\n swap(A[i], A[i + 1]);\n }\n\n REP(i, N) REP(j, N) D[i][j] = hypot((Double)X[i] - X[j], (Double)Y[i] - Y[j]);\n REP(s, 1 << N) cst[s] = INF;\n REP(s, 1 << N) {\n if (__builtin_popcount(s) <= 1)\n cst[s] = 0;\n REP(i, N)\n if (s >> i & 1) REP(j, N) if (~s >> j & 1)\n amin(cst[s | 1 << j], cst[s] + D[i][j]);\n }\n\n Double lo = *min_element(A, A + N), hi = *max_element(A, A + N);\n REP(t, 60) {\n Double mid = (lo + hi) \/ 2;\n (ok(mid) ? lo : hi) = mid;\n }\n double ans = (lo + hi) \/ 2;\n printf(\"%.12f\\\\n\", ans);\n}\n\nint main() {\n int TC = 1;\n \/\/ scanf(\"%d\", &TC);\n REP(tc, TC) MAIN();\n return 0;\n}\n","fail":"#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <queue>\n#include <stdio.h>\n#include <string.h>\n#include <string>\n#include <vector>\n\n#ifdef LOCAL\n#define eprintf(...) fprintf(stderr, __VA_ARGS__)\n#else\n#define NDEBUG\n#define eprintf(...) \\\\\n do { \\\\\n } while (0)\n#endif\n#include <cassert>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef vector<int> VI;\n\n#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)\n#define EACH(i, c) \\\\\n for (__typeof((c).begin()) i = (c).begin(), i##_end = (c).end(); \\\\\n i != i##_end; ++i)\n\ntemplate <class T> inline void amin(T &x, const T &y) {\n if (y < x)\n x = y;\n}\ntemplate <class T> inline void amax(T &x, const T &y) {\n if (x < y)\n x = y;\n}\ntemplate <class Iter> void rprintf(const char *fmt, Iter begin, Iter end) {\n for (bool sp = 0; begin != end; ++begin) {\n if (sp)\n putchar(' ');\n else\n sp = true;\n printf(fmt, *begin);\n }\n putchar('\\\\n');\n}\ninline int bits(int m) { return (1 << m) - 1; }\nusing Double = double;\nconst Double INF = 1e100;\n\nint N;\nLL X[15], Y[15], A[15];\n\nDouble D[15][15];\nDouble cst[1 << 15];\nDouble sum[1 << 15];\nbool dp[1 << 15];\n\nbool ok(Double mid) {\n Double need = 0;\n Double rest = 0;\n REP(i, N) {\n if (A[i] < mid) {\n need += mid - A[i];\n } else {\n rest += A[i] - mid;\n }\n }\n if (need == 0)\n return true;\n if (rest < need)\n return false;\n\n REP(s, 1 << N) if (s) {\n REP(i, N) if (s >> i & 1) {\n sum[s] = sum[s ^ (1 << i)] + A[i];\n break;\n }\n }\n\n memset(dp, 0, sizeof dp);\n dp[0] = true;\n REP(s, 1 << N) if (dp[s]) {\n int other = bits(N) ^ s;\n int sup = other & (other - 1);\n int small = sup ^ other;\n for (int t = sup;; t = (t - 1) & sup) {\n if (sum[t | small] - __builtin_popcount(t | small) * mid -\n cst[t | small] >=\n 0)\n dp[s | t | small] = true;\n if (t == 0)\n break;\n }\n }\n\n return dp[bits(N)];\n}\n\nvoid MAIN() {\n scanf(\"%d\", &N);\n REP(i, N) scanf(\"%lld%lld%lld\", X + i, Y + i, A + i);\n\n REP(t, N) REP(i, N - 1) if (A[i] > A[i + 1]) {\n swap(X[i], X[i + 1]);\n swap(Y[i], Y[i + 1]);\n swap(A[i], A[i + 1]);\n }\n\n REP(i, N) REP(j, N) D[i][j] = hypot((Double)X[i] - X[j], (Double)Y[i] - Y[j]);\n REP(s, 1 << N) cst[s] = INF;\n REP(s, 1 << N) {\n if (__builtin_popcount(s) <= 1)\n cst[s] = 0;\n REP(i, N)\n if (s >> i & 1) REP(j, N) if (~s >> j & 1)\n amin(cst[s | 1 << j], cst[s] + D[i][j]);\n }\n\n Double lo = *min_element(A, A + N), hi = *max_element(A, A + N);\n REP(t, 60) {\n Double mid = (lo + hi) \/ 2;\n (ok(mid) ? lo : hi) = mid;\n }\n double ans = (lo + hi) \/ 2;\n printf(\"%.12f\\\\n\", ans);\n}\n\nint main() {\n int TC = 1;\n \/\/ scanf(\"%d\", &TC);\n REP(tc, TC) MAIN();\n return 0;\n}\n","change":"replace","i1":84,"i2":88,"j1":84,"j2":94,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03882","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <bits\/stdc++.h>\n\n#define _overload(_1, _2, _3, name, ...) name\n#define _rep(i, n) _range(i, 0, n)\n#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)\n#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)\n\n#define _rrep(i, n) _rrange(i, n, 0)\n#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)\n#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)\n\n#define _all(arg) begin(arg), end(arg)\n#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))\n#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)\n#define clr(a, b) memset((a), (b), sizeof(a))\n#define bit(n) (1LL << (n))\n#define popcount(n) (__builtin_popcountll(n))\n\nusing namespace std;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n return (a < b) ? (a = b, 1) : 0;\n}\ntemplate <class T> bool chmin(T &a, const T &b) {\n return (b < a) ? (a = b, 1) : 0;\n}\n\nusing ll = long long;\nusing R = long double;\nconst R EPS = 1e-9L; \/\/ [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\ninline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }\ninline R sq(R x) { return sqrt(max(x, 0.0L)); }\n\nconst int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconst int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\n\/\/ Problem Specific Parameter:\n#define error(args...) \\\\\n { \\\\\n vector<string> _debug = split(#args, ','); \\\\\n err(begin(_debug), args); \\\\\n }\n\nvector<string> split(const string &s, char c) {\n vector<string> v;\n stringstream ss(s);\n string x;\n while (getline(ss, x, c))\n v.emplace_back(x);\n return move(v);\n}\n\nvoid err(vector<string>::iterator it) { cerr << endl; }\ntemplate <typename T, typename... Args>\nvoid err(vector<string>::iterator it, T a, Args... args) {\n cerr << it->substr((*it)[0] == ' ', it->length()) << \" = \" << a << \" \",\n err(++it, args...);\n}\n\n\/\/ Description: \u7d20\u96c6\u5408\u3092\u7ba1\u7406\u3059\u308b\u30c7\u30fc\u30bf\u69cb\u9020\n\/\/ TimeComplexity: \u521d\u671f\u5316$\\\\mathcal{O}(n)$ \u66f4\u65b0$\\\\mathcal{O}(\\\\log n)$\n\/\/ Verifyed: AOJ DSL_1_A\n\nstruct Union_find {\n Union_find(int n) { data.assign(n, -1); }\n int find(int x) { return (data[x] < 0) ? x : data[x] = find(data[x]); }\n void unite(int a, int b) {\n a = find(a), b = find(b);\n if (a != b) {\n if (data[a] < data[b])\n swap(a, b);\n data[a] += data[b], data[b] = a;\n }\n }\n bool same(int a, int b) { return find(a) == find(b); }\n int size(int x) { return -data[x]; }\n vector<int> data;\n};\n\nint x[15], y[15], a[15];\nbool dp[1 << 15];\nR cost[1 << 15];\n\nbool check(int n, R val) {\n rep(mask, 1 << n) {\n dp[mask] = false;\n const R m = __builtin_popcountll(mask);\n R cur = 0.0;\n rep(i, n) if (mask & (1 << i)) cur += a[i];\n cur -= cost[mask] + m * val;\n if (cur >= 0.0)\n dp[mask] = true;\n \/\/ error(mask, dp[mask]);\n }\n\n rep(mask, 1 << n) {\n if (dp[mask])\n continue;\n for (int smask = (mask - 1) & mask; smask > 0; smask = (smask - 1) & mask) {\n const int tmask = mask ^ smask;\n if (dp[smask] and dp[tmask]) {\n dp[mask] = true;\n break;\n }\n }\n }\n\n return dp[(1 << n) - 1];\n}\n\nint main(void) {\n int n;\n cin >> n;\n\n rep(i, n) cin >> x[i] >> y[i] >> a[i];\n\n rep(mask, 1 << n) {\n cost[mask] = 0.0;\n using edge = tuple<R, int, int>;\n vector<edge> ary;\n\n rep(j, n) rep(i, j) {\n if (((mask >> i) & 1) == 0)\n continue;\n if (((mask >> j) & 1) == 0)\n continue;\n ary.push_back(edge(hypot(x[i] - x[j], y[i] - y[j]), i, j));\n }\n\n sort(begin(ary), end(ary));\n Union_find uf(n);\n\n for (auto &e : ary) {\n R w;\n int a, b;\n tie(w, a, b) = e;\n if (uf.same(a, b))\n continue;\n cost[mask] += w;\n uf.unite(a, b);\n }\n \/\/ error(mask, cost[mask]);\n }\n\n R low = 0.0, high = 1e10;\n\n rep(loop, 100) {\n const R mid = (low + high) \/ 2.0;\n if (check(n, mid))\n low = mid;\n else\n high = mid;\n }\n\n cout.precision(20);\n cout << fixed << low << endl;\n\n \/*\n cerr << check(n, 5.5) << endl;\n cerr << check(n, 7.5) << endl;\n *\/\n\n return 0;\n}","fail":"#include <bits\/stdc++.h>\n\n#define _overload(_1, _2, _3, name, ...) name\n#define _rep(i, n) _range(i, 0, n)\n#define _range(i, a, b) for (int i = int(a); i < int(b); ++i)\n#define rep(...) _overload(__VA_ARGS__, _range, _rep, )(__VA_ARGS__)\n\n#define _rrep(i, n) _rrange(i, n, 0)\n#define _rrange(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)\n#define rrep(...) _overload(__VA_ARGS__, _rrange, _rrep, )(__VA_ARGS__)\n\n#define _all(arg) begin(arg), end(arg)\n#define uniq(arg) sort(_all(arg)), (arg).erase(unique(_all(arg)), end(arg))\n#define getidx(ary, key) lower_bound(_all(ary), key) - begin(ary)\n#define clr(a, b) memset((a), (b), sizeof(a))\n#define bit(n) (1LL << (n))\n#define popcount(n) (__builtin_popcountll(n))\n\nusing namespace std;\n\ntemplate <class T> bool chmax(T &a, const T &b) {\n return (a < b) ? (a = b, 1) : 0;\n}\ntemplate <class T> bool chmin(T &a, const T &b) {\n return (b < a) ? (a = b, 1) : 0;\n}\n\nusing ll = long long;\nusing R = long double;\nconst R EPS = 1e-9L; \/\/ [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7\ninline int sgn(const R &r) { return (r > EPS) - (r < -EPS); }\ninline R sq(R x) { return sqrt(max(x, 0.0L)); }\n\nconst int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconst int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\n\/\/ Problem Specific Parameter:\n#define error(args...) \\\\\n { \\\\\n vector<string> _debug = split(#args, ','); \\\\\n err(begin(_debug), args); \\\\\n }\n\nvector<string> split(const string &s, char c) {\n vector<string> v;\n stringstream ss(s);\n string x;\n while (getline(ss, x, c))\n v.emplace_back(x);\n return move(v);\n}\n\nvoid err(vector<string>::iterator it) { cerr << endl; }\ntemplate <typename T, typename... Args>\nvoid err(vector<string>::iterator it, T a, Args... args) {\n cerr << it->substr((*it)[0] == ' ', it->length()) << \" = \" << a << \" \",\n err(++it, args...);\n}\n\n\/\/ Description: \u7d20\u96c6\u5408\u3092\u7ba1\u7406\u3059\u308b\u30c7\u30fc\u30bf\u69cb\u9020\n\/\/ TimeComplexity: \u521d\u671f\u5316$\\\\mathcal{O}(n)$ \u66f4\u65b0$\\\\mathcal{O}(\\\\log n)$\n\/\/ Verifyed: AOJ DSL_1_A\n\nstruct Union_find {\n Union_find(int n) { data.assign(n, -1); }\n int find(int x) { return (data[x] < 0) ? x : data[x] = find(data[x]); }\n void unite(int a, int b) {\n a = find(a), b = find(b);\n if (a != b) {\n if (data[a] < data[b])\n swap(a, b);\n data[a] += data[b], data[b] = a;\n }\n }\n bool same(int a, int b) { return find(a) == find(b); }\n int size(int x) { return -data[x]; }\n vector<int> data;\n};\n\nint x[15], y[15], a[15];\nbool dp[1 << 15];\nR cost[1 << 15];\n\nbool check(int n, R val) {\n rep(mask, 1 << n) {\n dp[mask] = false;\n const R m = __builtin_popcountll(mask);\n R cur = 0.0;\n rep(i, n) if (mask & (1 << i)) cur += a[i];\n cur -= cost[mask] + m * val;\n if (cur >= 0.0)\n dp[mask] = true;\n \/\/ error(mask, dp[mask]);\n }\n\n rep(mask, 1 << n) {\n if (dp[mask])\n continue;\n for (int smask = (mask - 1) & mask;; smask = (smask - 1) & mask) {\n const int tmask = mask ^ smask;\n if (smask < tmask)\n break;\n\n if (dp[smask] and dp[tmask]) {\n dp[mask] = true;\n break;\n }\n }\n }\n\n return dp[(1 << n) - 1];\n}\n\nint main(void) {\n int n;\n cin >> n;\n\n rep(i, n) cin >> x[i] >> y[i] >> a[i];\n\n using edge = tuple<R, int, int>;\n vector<edge> ary;\n\n rep(j, n) rep(i, j)\n ary.push_back(edge(hypot(x[i] - x[j], y[i] - y[j]), i, j));\n sort(begin(ary), end(ary));\n\n rep(mask, 1 << n) {\n cost[mask] = 0.0;\n Union_find uf(n);\n\n for (auto &e : ary) {\n R w;\n int a, b;\n tie(w, a, b) = e;\n if (((mask >> a) & 1) == 0)\n continue;\n if (((mask >> b) & 1) == 0)\n continue;\n if (uf.same(a, b))\n continue;\n cost[mask] += w;\n uf.unite(a, b);\n }\n \/\/ error(mask, cost[mask]);\n }\n\n R low = 0.0, high = 1e10;\n\n rep(loop, 100) {\n const R mid = (low + high) \/ 2.0;\n if (check(n, mid))\n low = mid;\n else\n high = mid;\n }\n\n cout.precision(20);\n cout << fixed << low << endl;\n\n \/*\n cerr << check(n, 5.5) << endl;\n cerr << check(n, 7.5) << endl;\n *\/\n\n return 0;\n}","change":"replace","i1":98,"i2":136,"j1":98,"j2":138,"error":"TLE","stderr":null,"stdout":null}
{"problem_id":"p03927","language":"C++","original_status":"Runtime Error","pass":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define mod 1000000007\n#define rep(i, x) for (int i = 0; i < x; i++)\nint n, m;\nstring f[205];\nll ans = 1;\nbool mat[405][405];\nll c[5][5];\nint gauss() {\n int cur = 0;\n for (int i = 0; i < 405; i++) {\n for (int j = cur; j < 405; j++) {\n if (mat[j][i] == true) {\n for (int k = 0; k < 405; k++)\n swap(mat[j][k], mat[cur][k]);\n goto nxt;\n }\n }\n continue;\n nxt:;\n for (int j = cur + 1; j < 405; j++) {\n if (mat[j][i] == true) {\n for (int k = 0; k < 405; k++)\n mat[j][k] ^= mat[cur][k];\n }\n }\n cur++;\n }\n return cur;\n}\nint main() {\n cin >> n >> m;\n rep(i, n) cin >> f[i];\n if (n % 2 == 1) {\n rep(i, m) {\n if (i > m - 1 - i)\n break;\n if (f[n \/ 2][i] != f[n \/ 2][m - 1 - i]) {\n ans = ans * 2ll % mod;\n break;\n }\n }\n }\n if (m % 2 == 1) {\n rep(i, n) {\n if (i > n - 1 - i)\n break;\n if (f[i][m \/ 2] != f[n - 1 - i][m \/ 2]) {\n ans = ans * 2ll % mod;\n break;\n }\n }\n }\n rep(i, 5) rep(j, i + 1) {\n if (j == 0 || j == i)\n c[i][j] = 1;\n else\n c[i][j] = c[i - 1][j] + c[i - 1][j - 1];\n }\n int row = 0;\n rep(i, n \/ 2) rep(j, m \/ 2) {\n map<char, int> S;\n S[f[i][j]] += 1;\n S[f[n - 1 - i][j]] += 1;\n S[f[i][m - 1 - j]] += 1;\n S[f[n - 1 - i][m - 1 - j]] += 1;\n int cur = 0;\n ll mul = 1;\n for (map<char, int>::iterator it = S.begin(); it != S.end(); it++) {\n mul = mul * c[cur + it->second][cur];\n cur += it->second;\n }\n if (mul == 24) {\n ans = ans * 12LL % mod;\n mat[row][i] = 1;\n mat[row][j + n] = 1;\n row++;\n } else {\n ans = ans * mul % mod;\n }\n }\n int free = gauss();\n rep(i, free) ans = ans * 2LL % mod;\n cout << ans << endl;\n}","fail":"#include <bits\/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define mod 1000000007\n#define rep(i, x) for (int i = 0; i < x; i++)\nint n, m;\nstring f[205];\nll ans = 1;\nbitset<205> mat[10005];\nll c[5][5];\nint gauss() {\n int cur = 0;\n for (int i = 0; i < 205; i++) {\n for (int j = cur; j < 10005; j++) {\n if (mat[j][i] == true) {\n swap(mat[j], mat[cur]);\n goto nxt;\n }\n }\n continue;\n nxt:;\n for (int j = cur + 1; j < 10005; j++) {\n if (mat[j][i] == true) {\n mat[j] ^= mat[cur];\n }\n }\n cur++;\n }\n return cur;\n}\nint main() {\n cin >> n >> m;\n rep(i, n) cin >> f[i];\n if (n % 2 == 1) {\n rep(i, m) {\n if (i > m - 1 - i)\n break;\n if (f[n \/ 2][i] != f[n \/ 2][m - 1 - i]) {\n ans = ans * 2ll % mod;\n break;\n }\n }\n }\n if (m % 2 == 1) {\n rep(i, n) {\n if (i > n - 1 - i)\n break;\n if (f[i][m \/ 2] != f[n - 1 - i][m \/ 2]) {\n ans = ans * 2ll % mod;\n break;\n }\n }\n }\n rep(i, 5) rep(j, i + 1) {\n if (j == 0 || j == i)\n c[i][j] = 1;\n else\n c[i][j] = c[i - 1][j] + c[i - 1][j - 1];\n }\n int row = 0;\n rep(i, n \/ 2) rep(j, m \/ 2) {\n map<char, int> S;\n S[f[i][j]] += 1;\n S[f[n - 1 - i][j]] += 1;\n S[f[i][m - 1 - j]] += 1;\n S[f[n - 1 - i][m - 1 - j]] += 1;\n int cur = 0;\n ll mul = 1;\n for (map<char, int>::iterator it = S.begin(); it != S.end(); it++) {\n mul = mul * c[cur + it->second][cur];\n cur += it->second;\n }\n if (mul == 24) {\n ans = ans * 12LL % mod;\n mat[row][i] = 1;\n mat[row][j + n \/ 2 + 2] = 1;\n row++;\n } else {\n ans = ans * mul % mod;\n }\n }\n int free = gauss();\n rep(i, free) ans = ans * 2LL % mod;\n cout << ans << endl;\n}","change":"replace","i1":8,"i2":78,"j1":8,"j2":76,"error":0,"stderr":null,"stdout":6}
{"problem_id":"p03983","language":"C++","original_status":"Time Limit Exceeded","pass":"#include <iostream>\nusing namespace std;\n#pragma warning(disable : 4996)\n\nint mod = 1000000007;\nint prev_[100009], dp[100009], dpr[100009];\nint mulr[100009];\n\nlong long Q;\nlong long N[1 << 18], C[1 << 18], Base[1 << 18];\nlong long Answer[1 << 18];\n\nvoid init(int pos) {\n int lims = (pos - 2) * (pos - 1) \/ 2;\n int lim2 = max(1, lims);\n if (pos == 1) {\n for (int i = lims; i <= 100000; i++)\n dp[i] = 1;\n } else {\n for (int i = lims; i <= 100000; i++)\n prev_[i] = dp[i];\n for (int i = lims; i <= 100000; i++)\n dp[i] = 0;\n for (int i = lims; i <= 100000 - pos; i++)\n dp[i + pos - 1] = prev_[i];\n for (int i = lims; i <= 100000 - pos; i++) {\n dp[i + pos] += dp[i];\n if (dp[i + pos] >= mod)\n dp[i + pos] -= mod;\n }\n }\n for (int i = lims; i <= 100000; i++)\n dpr[i] = dp[i];\n for (int i = lim2; i <= 100000; i++) {\n dpr[i] += dpr[i - 1];\n if (dpr[i] >= mod)\n dpr[i] -= mod;\n }\n for (int i = lims; i <= 100000; i++)\n mulr[i] = (1LL * i * dp[i]) % mod;\n for (int i = lim2; i <= 100000; i++) {\n mulr[i] += mulr[i - 1];\n if (mulr[i] >= mod)\n mulr[i] -= mod;\n }\n}\n\nint main() {\n scanf(\"%lld\", &Q);\n for (int i = 1; i <= Q; i++)\n scanf(\"%lld%lld\", &N[i], &C[i]);\n for (int i = 1; i <= Q; i++)\n Base[i] = N[i] \/ C[i];\n for (int i = 1; i <= Q; i++) {\n if (Base[i] == 0)\n Answer[i] = N[i];\n }\n\n for (int gen = 1; gen <= 450; gen++) {\n init(gen);\n for (int i = 1; i <= Q; i++) {\n if (Base[i] == 0)\n continue;\n int cl = Base[i] - 2 * gen + 1;\n int cr = Base[i] - gen;\n if (cr < 0)\n continue;\n\n \/\/ 1 \u500b\u76ee\u306e\u8a08\u7b97\n long long V1 = 0;\n if (cr >= 0)\n V1 = dpr[cr];\n if (cl >= 1)\n V1 -= dpr[cl - 1];\n if (V1 < 0)\n V1 += mod;\n\n int S1 = 0;\n if (cr >= 0)\n S1 = mulr[cr];\n if (cl >= 1)\n S1 -= mulr[cl - 1];\n if (S1 < 0)\n S1 += mod;\n\n \/\/ 2 \u500b\u76ee\u306e\u8a08\u7b97\n int V2 = 0;\n if (cl >= 1)\n V2 = dp[cl - 1];\n\n int S2 = 0;\n if (cl >= 1)\n S2 = 1LL * (cl - 1 + gen) * dp[cl - 1] % mod;\n\n \/\/ \u7b54\u3048\u306b\u52a0\u7b97\n Answer[i] += (1LL * V1 * N[i] - 1LL * S1 * C[i] + 1LL * mod * mod);\n Answer[i] += (1LL * V2 * N[i] - 1LL * S2 * C[i] + 1LL * mod * mod);\n Answer[i] %= mod; \/\/ cout << gen << \": \" << V1 << \" \" << S1 << \" \" << V2\n \/\/ << \" \" << S2 << \" \" << Answer[i] << endl;\n }\n }\n\n for (int i = 1; i <= Q; i++)\n printf(\"%lld\\\\n\", Answer[i]);\n return 0;\n}","fail":"#include <iostream>\nusing namespace std;\n#pragma warning(disable : 4996)\n\nint mod = 1000000007;\nint prev_[100009], dp[100009], dpr[100009];\nint mulr[100009];\n\nlong long Q;\nlong long N[1 << 18], C[1 << 18], Base[1 << 18];\nlong long Answer[1 << 18];\n\nvoid init(int pos) {\n int lims = (pos - 2) * (pos - 1) \/ 2;\n int lim2 = max(1, lims);\n if (pos == 1) {\n for (int i = lims; i <= 100000; i++)\n dp[i] = 1;\n } else {\n for (int i = lims; i <= 100000; i++)\n prev_[i] = dp[i];\n for (int i = lims; i <= 100000; i++)\n dp[i] = 0;\n for (int i = lims; i <= 100000 - pos; i++)\n dp[i + pos - 1] = prev_[i];\n for (int i = lims; i <= 100000 - pos; i++) {\n dp[i + pos] += dp[i];\n if (dp[i + pos] >= mod)\n dp[i + pos] -= mod;\n }\n for (int i = 0; i < lims; i++)\n dp[i] = 0;\n }\n for (int i = lims; i <= 100000; i++)\n dpr[i] = dp[i];\n for (int i = lim2; i <= 100000; i++) {\n dpr[i] += dpr[i - 1];\n if (dpr[i] >= mod)\n dpr[i] -= mod;\n }\n for (int i = lims; i <= 100000; i++)\n mulr[i] = (1LL * i * dp[i]) % mod;\n for (int i = lim2; i <= 100000; i++) {\n mulr[i] += mulr[i - 1];\n if (mulr[i] >= mod)\n mulr[i] -= mod;\n }\n}\n\nint main() {\n scanf(\"%lld\", &Q);\n for (int i = 1; i <= Q; i++)\n scanf(\"%lld%lld\", &N[i], &C[i]);\n for (int i = 1; i <= Q; i++)\n Base[i] = N[i] \/ C[i];\n for (int i = 1; i <= Q; i++) {\n if (Base[i] == 0)\n Answer[i] = N[i];\n }\n\n for (int gen = 1; gen <= 450; gen++) {\n init(gen);\n int lims = gen * (gen - 1) \/ 2;\n for (int i = 1; i <= Q; i++) {\n if (Base[i] <= lims)\n continue;\n int cl = Base[i] - 2 * gen + 1;\n int cr = Base[i] - gen;\n if (cr < 0)\n continue;\n\n \/\/ 1 \u500b\u76ee\u306e\u8a08\u7b97\n long long V1 = 0;\n if (cr >= 0)\n V1 = dpr[cr];\n if (cl >= 1)\n V1 -= dpr[cl - 1];\n if (V1 < 0)\n V1 += mod;\n\n long long S1 = 0;\n if (cr >= 0)\n S1 = mulr[cr];\n if (cl >= 1)\n S1 -= mulr[cl - 1];\n if (S1 < 0)\n S1 += mod;\n\n \/\/ 2 \u500b\u76ee\u306e\u8a08\u7b97\n long long V2 = 0;\n if (cl >= 1)\n V2 = dp[cl - 1];\n\n long long S2 = 0;\n if (cl >= 1)\n S2 = 1LL * (cl - 1 + gen) * dp[cl - 1] % mod;\n\n \/\/ \u7b54\u3048\u306b\u52a0\u7b97\n Answer[i] += (1LL * V1 * N[i] - 1LL * S1 * C[i] + 1LL * mod * mod);\n Answer[i] += (1LL * V2 * N[i] - 1LL * S2 * C[i] + 1LL * mod * mod);\n Answer[i] %= mod; \/\/ cout << gen << \": \" << V1 << \" \" << S1 << \" \" << V2\n \/\/ << \" \" << S2 << \" \" << Answer[i] << endl;\n }\n }\n\n for (int i = 1; i <= Q; i++)\n printf(\"%lld\\\\n\", Answer[i]);\n return 0;\n}","change":"replace","i1":30,"i2":91,"j1":30,"j2":94,"error":"TLE","stderr":null,"stdout":null}